akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 1 | #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 | |
| 25 | void |
| 26 | add_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 = ⅇ |
| 35 | int res; |
| 36 | |
| 37 | hashtb_start(nlsr->adl, e); |
| 38 | res = hashtb_seek(e, nbr->neighbor->name , nbr->neighbor->length, 0); |
akmhoque | 2852a22 | 2012-08-21 12:09:00 -0400 | [diff] [blame] | 39 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 40 | if(res == HT_NEW_ENTRY ) |
| 41 | { |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 42 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 43 | hnbr = e->data; |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 44 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 45 | hnbr->neighbor=(struct name_prefix *)malloc(sizeof(struct name_prefix *)); |
| 46 | hnbr->neighbor->name=(char *)malloc(nbr->neighbor->length); |
| 47 | memcpy(hnbr->neighbor->name,nbr->neighbor->name,nbr->neighbor->length); |
| 48 | hnbr->last_lsdb_version=(char *)malloc(15); |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 49 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 50 | hnbr->neighbor->length=nbr->neighbor->length; |
| 51 | hnbr->face=nbr->face; |
| 52 | hnbr->status=nbr->status; |
| 53 | memcpy(hnbr->last_lsdb_version,"00000000000000",14); |
| 54 | memcpy(hnbr->last_lsdb_version+strlen(hnbr->last_lsdb_version),"\0",1); |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 55 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 56 | struct hashtb_param param_luq = {0}; |
| 57 | hnbr->lsa_update_queue=hashtb_create(200, ¶m_luq); |
| 58 | } |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 59 | |
| 60 | hashtb_end(e); |
| 61 | |
| 62 | printf("\n"); |
| 63 | |
| 64 | |
| 65 | } |
| 66 | |
| 67 | void |
| 68 | print_adjacent_from_adl(void) |
| 69 | { |
| 70 | printf("print_adjacent_from_adl called \n"); |
| 71 | int i, adl_element; |
| 72 | struct ndn_neighbor *nbr; |
| 73 | |
| 74 | struct hashtb_enumerator ee; |
| 75 | struct hashtb_enumerator *e = ⅇ |
| 76 | |
| 77 | hashtb_start(nlsr->adl, e); |
| 78 | adl_element=hashtb_n(nlsr->adl); |
| 79 | |
| 80 | for(i=0;i<adl_element;i++) |
| 81 | { |
| 82 | nbr=e->data; |
akmhoque | 6dc9a24 | 2012-08-21 11:23:57 -0400 | [diff] [blame] | 83 | 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); |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 84 | hashtb_next(e); |
| 85 | } |
| 86 | |
| 87 | hashtb_end(e); |
| 88 | |
| 89 | printf("\n"); |
| 90 | } |
| 91 | |
| 92 | void |
| 93 | update_adjacent_status_to_adl(struct ccn_charbuf *nbr, int status) |
| 94 | { |
| 95 | printf("update_adjacent_status_to_adl called \n"); |
| 96 | |
| 97 | int res; |
| 98 | struct ndn_neighbor *nnbr; |
| 99 | |
| 100 | struct hashtb_enumerator ee; |
| 101 | struct hashtb_enumerator *e = ⅇ |
| 102 | |
| 103 | hashtb_start(nlsr->adl, e); |
akmhoque | 50206fc | 2012-08-21 11:49:12 -0400 | [diff] [blame] | 104 | res = hashtb_seek(e, nbr->buf, nbr->length, 0); |
akmhoque | 50206fc | 2012-08-21 11:49:12 -0400 | [diff] [blame] | 105 | |
akmhoque | 918ff9a | 2012-08-21 11:34:49 -0400 | [diff] [blame] | 106 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 107 | if (res == HT_OLD_ENTRY) |
| 108 | { |
| 109 | nnbr=e->data; |
| 110 | nnbr->status=status; |
| 111 | } |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 112 | |
| 113 | hashtb_end(e); |
| 114 | } |
| 115 | |
| 116 | |
| 117 | void |
akmhoque | 6dc9a24 | 2012-08-21 11:23:57 -0400 | [diff] [blame] | 118 | update_adjacent_lsdb_version_to_adl(struct ccn_charbuf *nbr, char *version) |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 119 | { |
| 120 | printf("update_adjacent_status_to_adl called \n"); |
| 121 | |
| 122 | int res; |
| 123 | struct ndn_neighbor *nnbr; |
| 124 | |
| 125 | struct hashtb_enumerator ee; |
| 126 | struct hashtb_enumerator *e = ⅇ |
| 127 | |
| 128 | hashtb_start(nlsr->adl, e); |
akmhoque | 2852a22 | 2012-08-21 12:09:00 -0400 | [diff] [blame] | 129 | res = hashtb_seek(e, nbr->buf, nbr->length, 0); |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 130 | |
akmhoque | e7c4b6d | 2012-08-21 12:30:25 -0400 | [diff] [blame^] | 131 | if( res == HT_OLD_ENTRY ) |
| 132 | { |
| 133 | nnbr=e->data; |
| 134 | memcpy(nnbr->last_lsdb_version,version,strlen(version)+1); |
| 135 | } |
akmhoque | 8a5babe | 2012-08-16 17:39:33 -0500 | [diff] [blame] | 136 | hashtb_end(e); |
| 137 | } |