1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/* The AODV code developed by the CMU/MONARCH group was optimized
* and tuned by Samir Das (UTSA) and Mahesh Marina (UTSA). The
* work was partially done in Sun Microsystems.
*
* The original CMU copyright is below.
*/
/*
Copyright (c) 1997, 1998 Carnegie Mellon University. All Rights
Reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* ported into VINT ns by Ya Xu, Sept. 1999 */
#include <rttable.h>
/* =====================================================================
The Routing Table
===================================================================== */
rt_entry::rt_entry()
{
int i;
rt_dst = 0;
rt_seqno = 0;
rt_nexthop = 0;
rt_expire = 0.0;
rt_hops = INFINITY2;
rt_flags = RTF_DOWN;
rt_errors = 0;
rt_error_time = 0.0;
rt_req_timeout = 0.0;
rt_req_cnt = 0;
rt_req_last_ttl = 0;
hist_indx = 0;
for (i=0; i < MAX_HISTORY; i++) {
// rt_length[i] = 0;
rt_disc_latency[i] = 0.0;
}
error_propagate_counter = 0;
LIST_INIT(&rt_nblist);
}
rt_entry::~rt_entry()
{
Neighbor *nb;
while((nb = rt_nblist.lh_first)) {
LIST_REMOVE(nb, nb_link);
delete nb;
}
}
void
rt_entry::nb_insert(nsaddr_t id)
{
Neighbor *nb = new Neighbor(id);
assert(nb);
nb->nb_expire = 0;
LIST_INSERT_HEAD(&rt_nblist, nb, nb_link);
}
Neighbor*
rt_entry::nb_lookup(nsaddr_t id)
{
Neighbor *nb = rt_nblist.lh_first;
for(; nb; nb = nb->nb_link.le_next) {
if(nb->nb_addr == id)
break;
}
return nb;
}
/* =====================================================================
The Routing Table
===================================================================== */
rt_entry*
rttable::rt_lookup(nsaddr_t id)
{
rt_entry *rt = rthead.lh_first;
for(; rt; rt = rt->rt_link.le_next) {
if(rt->rt_dst == id)
break;
}
return rt;
}
void
rttable::rt_delete(nsaddr_t id)
{
rt_entry *rt = rt_lookup(id);
if(rt) {
LIST_REMOVE(rt, rt_link);
delete rt;
}
}
rt_entry*
rttable::rt_add(nsaddr_t id)
{
rt_entry *rt;
assert(rt_lookup(id) == 0);
rt = new rt_entry;
assert(rt);
rt->rt_dst = id;
LIST_INSERT_HEAD(&rthead, rt, rt_link);
return rt;
}
|
