blob: 94ccb42a9da904152d5dceb8fcf0f43ec901adaf [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);
akmhoque6dc9a242012-08-21 11:23:57 -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;
akmhoque6dc9a242012-08-21 11:23:57 -040050 memcpy(hnbr->last_lsdb_version,"00000000000000",14);
51 memcpy(hnbr->last_lsdb_version+strlen(hnbr->last_lsdb_version),"\0",1);
akmhoque8a5babe2012-08-16 17:39:33 -050052
53 struct hashtb_param param_luq = {0};
54 hnbr->lsa_update_queue=hashtb_create(200, &param_luq);
55
56 hashtb_end(e);
57
58 printf("\n");
59
60
61}
62
63void
64print_adjacent_from_adl(void)
65{
66 printf("print_adjacent_from_adl called \n");
67 int i, adl_element;
68 struct ndn_neighbor *nbr;
69
70 struct hashtb_enumerator ee;
71 struct hashtb_enumerator *e = &ee;
72
73 hashtb_start(nlsr->adl, e);
74 adl_element=hashtb_n(nlsr->adl);
75
76 for(i=0;i<adl_element;i++)
77 {
78 nbr=e->data;
akmhoque6dc9a242012-08-21 11:23:57 -040079 printf("Neighbor: %s Length: %d Face: %d Status: %d LSDB Version: %s \n",nbr->neighbor->name,nbr->neighbor->length,nbr->face, nbr->status, nbr->last_lsdb_version);
akmhoque8a5babe2012-08-16 17:39:33 -050080 hashtb_next(e);
81 }
82
83 hashtb_end(e);
84
85 printf("\n");
86}
87
88void
89update_adjacent_status_to_adl(struct ccn_charbuf *nbr, int status)
90{
91 printf("update_adjacent_status_to_adl called \n");
92
93 int res;
94 struct ndn_neighbor *nnbr;
95
96 struct hashtb_enumerator ee;
97 struct hashtb_enumerator *e = &ee;
98
99 hashtb_start(nlsr->adl, e);
100 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
101
akmhoque6dc9a242012-08-21 11:23:57 -0400102 assert( res == HT_OLD_ENTRY);
akmhoque8a5babe2012-08-16 17:39:33 -0500103
104 nnbr=e->data;
105 nnbr->status=status;
106
107 hashtb_end(e);
108}
109
110
111void
akmhoque6dc9a242012-08-21 11:23:57 -0400112update_adjacent_lsdb_version_to_adl(struct ccn_charbuf *nbr, char *version)
akmhoque8a5babe2012-08-16 17:39:33 -0500113{
114 printf("update_adjacent_status_to_adl called \n");
115
116 int res;
117 struct ndn_neighbor *nnbr;
118
119 struct hashtb_enumerator ee;
120 struct hashtb_enumerator *e = &ee;
121
122 hashtb_start(nlsr->adl, e);
123 res = hashtb_seek(e, nbr->buf, nbr->length, 0);
124
akmhoque6dc9a242012-08-21 11:23:57 -0400125 assert( res == HT_OLD_ENTRY);
akmhoque8a5babe2012-08-16 17:39:33 -0500126
127 nnbr=e->data;
akmhoque6dc9a242012-08-21 11:23:57 -0400128 memcpy(nnbr->last_lsdb_version,version,strlen(version)+1);
129
akmhoque8a5babe2012-08-16 17:39:33 -0500130 hashtb_end(e);
131}