forked from jech/babeld
-
Notifications
You must be signed in to change notification settings - Fork 1
/
source.c
242 lines (204 loc) · 6.02 KB
/
source.c
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
/*
Copyright (c) 2007, 2008 by Juliusz Chroboczek
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/time.h>
#include <assert.h>
#include "babeld.h"
#include "util.h"
#include "source.h"
#include "interface.h"
#include "route.h"
static struct source **sources = NULL;
static int source_slots = 0, max_source_slots = 0;
static int
source_compare(const unsigned char *id,
const unsigned char *prefix, unsigned char plen,
const unsigned char *src_prefix, unsigned char src_plen,
const struct source *src)
{
int rc;
rc = memcmp(id, src->id, 8);
if(rc != 0)
return rc;
if(plen < src->plen)
return -1;
if(plen > src->plen)
return 1;
rc = memcmp(prefix, src->prefix, 16);
if(rc != 0)
return rc;
rc = memcmp(src_prefix, src->src_prefix, 16);
if(rc != 0)
return rc;
return 0;
}
static int
find_source_slot(const unsigned char *id,
const unsigned char *prefix, unsigned char plen,
const unsigned char *src_prefix, unsigned char src_plen,
int *new_return)
{
int p, m, g, c;
if(source_slots < 1) {
if(new_return)
*new_return = 0;
return -1;
}
p = 0; g = source_slots - 1;
do {
m = (p + g) / 2;
c = source_compare(id, prefix, plen, src_prefix, src_plen, sources[m]);
if(c == 0)
return m;
else if(c < 0)
g = m - 1;
else
p = m + 1;
} while(p <= g);
if(new_return)
*new_return = p;
return -1;
}
static int
resize_source_table(int new_slots)
{
struct source **new_sources;
assert(new_slots >= source_slots);
if(new_slots == 0) {
new_sources = NULL;
free(sources);
} else {
new_sources = realloc(sources, new_slots * sizeof(struct source*));
if(new_sources == NULL)
return -1;
}
max_source_slots = new_slots;
sources = new_sources;
return 1;
}
struct source*
find_source(const unsigned char *id,
const unsigned char *prefix, unsigned char plen,
const unsigned char *src_prefix, unsigned char src_plen,
int create, unsigned short seqno)
{
int n = -1;
int i = find_source_slot(id, prefix, plen, src_prefix, src_plen, &n);
struct source *src;
if(i >= 0)
return sources[i];
if(!create)
return NULL;
src = malloc(sizeof(struct source));
if(src == NULL) {
perror("malloc(source)");
return NULL;
}
memcpy(src->id, id, 8);
memcpy(src->prefix, prefix, 16);
src->plen = plen;
memcpy(src->src_prefix, src_prefix, 16);
src->src_plen = src_plen;
src->seqno = seqno;
src->metric = INFINITY;
src->time = now.tv_sec;
src->route_count = 0;
if(source_slots >= max_source_slots)
resize_source_table(max_source_slots < 1 ? 8 : 2 * max_source_slots);
if(source_slots >= max_source_slots) {
free(src);
return NULL;
}
if(n < source_slots)
memmove(sources + n + 1, sources + n,
(source_slots - n) * sizeof(struct source*));
source_slots++;
sources[n] = src;
return src;
}
struct source *
retain_source(struct source *src)
{
assert(src->route_count < 0xffff);
src->route_count++;
return src;
}
void
release_source(struct source *src)
{
assert(src->route_count > 0);
src->route_count--;
}
void
update_source(struct source *src,
unsigned short seqno, unsigned short metric)
{
if(metric >= INFINITY)
return;
/* If a source is expired, pretend that it doesn't exist and update
it unconditionally. This makes ensures that old data will
eventually be overridden, and prevents us from getting stuck if
a router loses its sequence number. */
if(src->time < now.tv_sec - SOURCE_GC_TIME ||
seqno_compare(src->seqno, seqno) < 0 ||
(src->seqno == seqno && src->metric > metric)) {
src->seqno = seqno;
src->metric = metric;
}
src->time = now.tv_sec;
}
void
expire_sources()
{
int i = 0, j = 0;
while(i < source_slots) {
struct source *src = sources[i];
if(src->time > now.tv_sec)
/* clock stepped */
src->time = now.tv_sec;
if(src->route_count == 0 && src->time < now.tv_sec - SOURCE_GC_TIME) {
free(src);
sources[i] = NULL;
i++;
} else {
if(j < i) {
sources[j] = sources[i];
sources[i] = NULL;
}
i++;
j++;
}
}
source_slots = j;
}
void
check_sources_released(void)
{
int i;
for(i = 0; i < source_slots; i++) {
struct source *src = sources[i];
if(src->route_count != 0)
fprintf(stderr, "Warning: source %s %s has refcount %d.\n",
format_eui64(src->id),
format_prefix(src->prefix, src->plen),
(int)src->route_count);
}
}