blob: f4237fb211db0539afe42c7c8ce73901a7599ca3 [file] [log] [blame]
akmhoque8a5babe2012-08-16 17:39:33 -05001#include<stdio.h>
2#include<string.h>
3#include<stdlib.h>
4#include <unistd.h>
5#include <getopt.h>
6#include <sys/time.h>
7#include <assert.h>
8#ifdef HAVE_CONFIG_H
9#include <config.h>
10#endif
11
12
13#include <ccn/ccn.h>
14#include <ccn/uri.h>
15#include <ccn/keystore.h>
16#include <ccn/signing.h>
17#include <ccn/schedule.h>
18#include <ccn/hashtb.h>
19
20#include "nlsr.h"
21#include "nlsr_ndn.h"
22#include "utility.h"
23#include "nlsr_adl.h"
24
25void
26add_adjacent_to_adl(struct ndn_neighbor *nbr)
27{
28 printf("\nadd_adjacent_to_adl called\n");
akmhoquea6817692012-08-21 13:50:01 -040029 printf("Neighbor: %s Length: %d Face: %d Status: %d\n",ccn_charbuf_as_string(nbr->neighbor),(int)nbr->neighbor->length,nbr->face, nbr->status);
akmhoque8a5babe2012-08-16 17:39:33 -050030
31 struct ndn_neighbor *hnbr=(struct ndn_neighbor *)malloc(sizeof(struct ndn_neighbor*));
32
33 struct hashtb_enumerator ee;
34 struct hashtb_enumerator *e = &ee;
35 int res;
36
37 hashtb_start(nlsr->adl, e);
akmhoquea6817692012-08-21 13:50:01 -040038 res = hashtb_seek(e, nbr->neighbor->buf , nbr->neighbor->length, 0);
akmhoque2852a222012-08-21 12:09:00 -040039
akmhoquee7c4b6d2012-08-21 12:30:25 -040040 if(res == HT_NEW_ENTRY )
41 {
akmhoque8a5babe2012-08-16 17:39:33 -050042
akmhoquee7c4b6d2012-08-21 12:30:25 -040043 hnbr = e->data;
akmhoquea6817692012-08-21 13:50:01 -040044 hnbr->neighbor=ccn_charbuf_create();
akmhoquea6817692012-08-21 13:50:01 -040045 ccn_charbuf_append_string(hnbr->neighbor,ccn_charbuf_as_string(nbr->neighbor));
akmhoque8a5babe2012-08-16 17:39:33 -050046
akmhoquee7c4b6d2012-08-21 12:30:25 -040047 hnbr->face=nbr->face;
48 hnbr->status=nbr->status;
akmhoquef6432c22012-08-21 13:18:05 -040049 hnbr->last_lsdb_version=0;
akmhoque8a5babe2012-08-16 17:39:33 -050050
akmhoquee7c4b6d2012-08-21 12:30:25 -040051 struct hashtb_param param_luq = {0};
52 hnbr->lsa_update_queue=hashtb_create(200, &param_luq);
53 }
akmhoque8a5babe2012-08-16 17:39:33 -050054
55 hashtb_end(e);
56
57 printf("\n");
58
59
60}
61
62void
63print_adjacent_from_adl(void)
64{
65 printf("print_adjacent_from_adl called \n");
66 int i, adl_element;
67 struct ndn_neighbor *nbr;
68
69 struct hashtb_enumerator ee;
70 struct hashtb_enumerator *e = &ee;
71
72 hashtb_start(nlsr->adl, e);
73 adl_element=hashtb_n(nlsr->adl);
74
75 for(i=0;i<adl_element;i++)
76 {
77 nbr=e->data;
akmhoquea6817692012-08-21 13:50:01 -040078 printf("Neighbor: %s Length: %d Face: %d Status: %d LSDB Version: %ld \n",ccn_charbuf_as_string(nbr->neighbor),(int)nbr->neighbor->length,nbr->face, nbr->status, nbr->last_lsdb_version);
akmhoque8a5babe2012-08-16 17:39:33 -050079 hashtb_next(e);
80 }
81
82 hashtb_end(e);
83
84 printf("\n");
85}
86
87void
88update_adjacent_status_to_adl(struct ccn_charbuf *nbr, int status)
89{
90 printf("update_adjacent_status_to_adl called \n");
91
92 int res;
93 struct ndn_neighbor *nnbr;
94
95 struct hashtb_enumerator ee;
96 struct hashtb_enumerator *e = &ee;
97
98 hashtb_start(nlsr->adl, e);
akmhoque50206fc2012-08-21 11:49:12 -040099 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
akmhoque50206fc2012-08-21 11:49:12 -0400100
akmhoque918ff9a2012-08-21 11:34:49 -0400101
akmhoquee7c4b6d2012-08-21 12:30:25 -0400102 if (res == HT_OLD_ENTRY)
103 {
104 nnbr=e->data;
105 nnbr->status=status;
106 }
akmhoqueb903ded2012-08-21 12:56:28 -0400107 else if(res == HT_NEW_ENTRY)
108 {
109 hashtb_delete(e);
110 }
akmhoque8a5babe2012-08-16 17:39:33 -0500111
112 hashtb_end(e);
113}
114
115
116void
akmhoquef6432c22012-08-21 13:18:05 -0400117update_adjacent_lsdb_version_to_adl(struct ccn_charbuf *nbr, long int version)
akmhoque8a5babe2012-08-16 17:39:33 -0500118{
119 printf("update_adjacent_status_to_adl called \n");
120
121 int res;
122 struct ndn_neighbor *nnbr;
123
124 struct hashtb_enumerator ee;
125 struct hashtb_enumerator *e = &ee;
126
127 hashtb_start(nlsr->adl, e);
akmhoque2852a222012-08-21 12:09:00 -0400128 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
akmhoque8a5babe2012-08-16 17:39:33 -0500129
akmhoquee7c4b6d2012-08-21 12:30:25 -0400130 if( res == HT_OLD_ENTRY )
131 {
132 nnbr=e->data;
akmhoquef6432c22012-08-21 13:18:05 -0400133 nnbr->last_lsdb_version = version;
134 //memcpy(nnbr->last_lsdb_version,version,strlen(version)+1);
akmhoquee7c4b6d2012-08-21 12:30:25 -0400135 }
akmhoqueb903ded2012-08-21 12:56:28 -0400136 else if(res == HT_NEW_ENTRY)
137 {
138 hashtb_delete(e);
139 }
140
akmhoque8a5babe2012-08-16 17:39:33 -0500141 hashtb_end(e);
142}