blob: 5f3e71c5adfd901f83bcb46f80b98cb097570fc5 [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");
29 printf("Neighbor: %s Length: %d Face: %d Status: %d\n",nbr->neighbor->name,nbr->neighbor->length,nbr->face, nbr->status);
30
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);
38 res = hashtb_seek(e, nbr->neighbor->name , nbr->neighbor->length, 0);
39
40 hnbr = e->data;
41
42 hnbr->neighbor=(struct name_prefix *)malloc(sizeof(struct name_prefix *));
43 hnbr->neighbor->name=(char *)malloc(nbr->neighbor->length);
44 memcpy(hnbr->neighbor->name,nbr->neighbor->name,nbr->neighbor->length);
akmhoque3b38ee72012-08-21 09:36:02 -040045 //hnbr->last_lsdb_version=(char *)malloc(15);
akmhoque8a5babe2012-08-16 17:39:33 -050046
47 hnbr->neighbor->length=nbr->neighbor->length;
48 hnbr->face=nbr->face;
49 hnbr->status=nbr->status;
akmhoque3b38ee72012-08-21 09:36:02 -040050 hnbr->last_lsdb_version=0;
51 //memcpy(hnbr->last_lsdb_version,"00000000000000",14);
52 //memcpy(hnbr->last_lsdb_version+strlen(hnbr->last_lsdb_version),"\0",1);
akmhoque8a5babe2012-08-16 17:39:33 -050053
54 struct hashtb_param param_luq = {0};
55 hnbr->lsa_update_queue=hashtb_create(200, &param_luq);
56
57 hashtb_end(e);
58
59 printf("\n");
60
61
62}
63
64void
65print_adjacent_from_adl(void)
66{
67 printf("print_adjacent_from_adl called \n");
68 int i, adl_element;
69 struct ndn_neighbor *nbr;
70
71 struct hashtb_enumerator ee;
72 struct hashtb_enumerator *e = &ee;
73
74 hashtb_start(nlsr->adl, e);
75 adl_element=hashtb_n(nlsr->adl);
76
77 for(i=0;i<adl_element;i++)
78 {
79 nbr=e->data;
akmhoque3b38ee72012-08-21 09:36:02 -040080 printf("Neighbor: %s Length: %d Face: %d Status: %d LSDB Version: %ld \n",nbr->neighbor->name,nbr->neighbor->length,nbr->face, nbr->status, nbr->last_lsdb_version);
akmhoque8a5babe2012-08-16 17:39:33 -050081 hashtb_next(e);
82 }
83
84 hashtb_end(e);
85
86 printf("\n");
87}
88
89void
90update_adjacent_status_to_adl(struct ccn_charbuf *nbr, int status)
91{
92 printf("update_adjacent_status_to_adl called \n");
93
94 int res;
95 struct ndn_neighbor *nnbr;
96
97 struct hashtb_enumerator ee;
98 struct hashtb_enumerator *e = &ee;
99
100 hashtb_start(nlsr->adl, e);
101 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
102
103 assert( res == HT_OLD_ENTRY);
104
105 nnbr=e->data;
106 nnbr->status=status;
107
108 hashtb_end(e);
109}
110
111
112void
akmhoque3b38ee72012-08-21 09:36:02 -0400113update_adjacent_lsdb_version_to_adl(struct ccn_charbuf *nbr, long int version)
akmhoque8a5babe2012-08-16 17:39:33 -0500114{
115 printf("update_adjacent_status_to_adl called \n");
116
117 int res;
118 struct ndn_neighbor *nnbr;
119
120 struct hashtb_enumerator ee;
121 struct hashtb_enumerator *e = &ee;
122
123 hashtb_start(nlsr->adl, e);
124 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
125
126 assert( res == HT_OLD_ENTRY);
127
128 nnbr=e->data;
akmhoque3b38ee72012-08-21 09:36:02 -0400129 nnbr->last_lsdb_version=version;
130
131 //memcpy(nnbr->last_lsdb_version,version,strlen(version)+1);
akmhoque8a5babe2012-08-16 17:39:33 -0500132
133 hashtb_end(e);
134}