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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
|
/* $OpenBSD: neighbor.c,v 1.9 2007/10/24 19:50:33 claudio Exp $ */
/*
* Copyright (c) 2006 Michele Marchetto <mydecay@openbeer.it>
* Copyright (c) 2005 Claudio Jeker <claudio@openbsd.org>
* Copyright (c) 2004, 2005, 2006 Esben Norby <norby@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/ioctl.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <net/if.h>
#include <ctype.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <event.h>
#include "ripd.h"
#include "rip.h"
#include "ripe.h"
#include "log.h"
#include "rde.h"
void nbr_set_timer(struct nbr *);
void nbr_stop_timer(struct nbr *);
void nbr_failed_new(struct nbr *);
void nbr_failed_timeout(int, short, void *);
LIST_HEAD(nbr_head, nbr);
struct nbr_table {
struct nbr_head *hashtbl;
u_int32_t hashmask;
} nbrtable;
#define NBR_HASH(x) \
&nbrtable.hashtbl[(x) & nbrtable.hashmask]
u_int32_t peercnt = NBR_CNTSTART;
struct {
int state;
enum nbr_event event;
enum nbr_action action;
int new_state;
} nbr_fsm_tbl[] = {
/* current state event that happened action to take resulting state */
{NBR_STA_DOWN, NBR_EVT_REQUEST_RCVD, NBR_ACT_NOTHING, NBR_STA_REQ_RCVD},
{NBR_STA_DOWN, NBR_EVT_RESPONSE_RCVD, NBR_ACT_STRT_TIMER, NBR_STA_ACTIVE},
{NBR_STA_ACTIVE, NBR_EVT_RESPONSE_RCVD, NBR_ACT_RST_TIMER, NBR_STA_ACTIVE},
{NBR_STA_ACTIVE, NBR_EVT_REQUEST_RCVD, NBR_ACT_NOTHING, NBR_STA_ACTIVE},
{NBR_STA_ACTIVE, NBR_EVT_TIMEOUT, NBR_ACT_DEL, NBR_STA_DOWN},
{NBR_STA_REQ_RCVD, NBR_EVT_RESPONSE_SENT, NBR_ACT_DEL, NBR_STA_DOWN},
{NBR_STA_ACTIVE, NBR_EVT_RESPONSE_SENT, NBR_ACT_NOTHING, NBR_STA_ACTIVE},
{NBR_STA_ANY, NBR_EVT_KILL_NBR, NBR_ACT_DEL, NBR_STA_DOWN},
{-1, NBR_EVT_NOTHING, NBR_ACT_NOTHING, 0},
};
const char * const nbr_event_names[] = {
"RESPONSE RCVD",
"REQUEST RCVD",
"RESPONSE SENT",
"NBR TIMEOUT",
"NBR KILL",
"NOTHING"
};
const char * const nbr_action_names[] = {
"START TIMER",
"RESET TIMER",
"DELETE NBR",
"NOTHING"
};
int
nbr_fsm(struct nbr *nbr, enum nbr_event event)
{
struct timeval now;
int old_state;
int new_state = 0;
int i;
old_state = nbr->state;
for (i = 0; nbr_fsm_tbl[i].state != -1; i++)
if ((nbr_fsm_tbl[i].state & old_state) &&
(nbr_fsm_tbl[i].event == event)) {
new_state = nbr_fsm_tbl[i].new_state;
break;
}
if (nbr_fsm_tbl[i].state == -1) {
/* event outside of the defined fsm, ignore it. */
log_warnx("nbr_fsm: neighbor ID %s, "
"event '%s' not expected in state '%s'",
inet_ntoa(nbr->id), nbr_event_name(event),
nbr_state_name(old_state));
return (0);
}
switch (nbr_fsm_tbl[i].action) {
case NBR_ACT_RST_TIMER:
nbr_set_timer(nbr);
break;
case NBR_ACT_STRT_TIMER:
nbr_set_timer(nbr);
break;
case NBR_ACT_DEL:
nbr_act_del(nbr);
break;
case NBR_ACT_NOTHING:
/* do nothing */
break;
}
if (new_state != 0)
nbr->state = new_state;
if (old_state != nbr->state) {
/* neighbor changed from/to ACTIVE */
gettimeofday(&now, NULL);
nbr->uptime = now.tv_sec;
log_debug("nbr_fsm: event '%s' resulted in action '%s' and "
"changing state for neighbor ID %s from '%s' to '%s'",
nbr_event_name(event),
nbr_action_name(nbr_fsm_tbl[i].action),
inet_ntoa(nbr->id), nbr_state_name(old_state),
nbr_state_name(nbr->state));
}
return (0);
}
void
nbr_init(u_int32_t hashsize)
{
u_int32_t hs, i;
for (hs = 1; hs < hashsize; hs <<= 1)
;
nbrtable.hashtbl = calloc(hs, sizeof(struct nbr_head));
if (nbrtable.hashtbl == NULL)
fatal("nbr_init");
for (i = 0; i < hs; i++)
LIST_INIT(&nbrtable.hashtbl[i]);
nbrtable.hashmask = hs - 1;
}
struct nbr *
nbr_new(u_int32_t nbr_id, struct iface *iface)
{
struct nbr_head *head;
struct nbr *nbr = NULL;
if ((nbr = calloc(1, sizeof(*nbr))) == NULL)
fatal("nbr_new");
nbr->state = NBR_STA_DOWN;
nbr->id.s_addr = nbr_id;
/* get next unused peerid */
while (nbr_find_peerid(++peercnt))
;
nbr->peerid = peercnt;
head = NBR_HASH(nbr->peerid);
LIST_INSERT_HEAD(head, nbr, hash);
/* add to peer list */
nbr->iface = iface;
LIST_INSERT_HEAD(&iface->nbr_list, nbr, entry);
TAILQ_INIT(&nbr->rp_list);
TAILQ_INIT(&nbr->rq_list);
/* set event structures */
evtimer_set(&nbr->timeout_timer, nbr_timeout_timer, nbr);
log_debug("nbr_new: neighbor ID %s, peerid %lu",
inet_ntoa(nbr->id), nbr->peerid);
return (nbr);
}
void
nbr_act_del(struct nbr *nbr)
{
/* If there is no authentication or it is just a route request
* there is no need to keep track of the failed neighbors */
if (nbr->iface->auth_type == AUTH_CRYPT &&
nbr->state != NBR_STA_REQ_RCVD)
nbr_failed_new(nbr);
log_debug("nbr_del: neighbor ID %s, peerid %lu", inet_ntoa(nbr->id),
nbr->peerid);
/* stop timer */
nbr_stop_timer(nbr);
/* clear lists */
clear_list(&nbr->rq_list);
clear_list(&nbr->rp_list);
LIST_REMOVE(nbr, entry);
LIST_REMOVE(nbr, hash);
free(nbr);
}
struct nbr *
nbr_find_peerid(u_int32_t peerid)
{
struct nbr_head *head;
struct nbr *nbr;
head = NBR_HASH(peerid);
LIST_FOREACH(nbr, head, hash) {
if (nbr->peerid == peerid)
return (nbr);
}
return (NULL);
}
struct nbr *
nbr_find_ip(struct iface *iface, u_int32_t src_ip)
{
struct nbr *nbr = NULL;
LIST_FOREACH(nbr, &iface->nbr_list, entry) {
if (nbr->id.s_addr == src_ip) {
return (nbr);
}
}
return (NULL);
}
/* failed nbr handling */
void
nbr_failed_new(struct nbr *nbr)
{
struct timeval tv;
struct iface *iface;
struct nbr_failed *nbr_failed;
if ((nbr_failed = calloc(1, sizeof(*nbr_failed))) == NULL)
fatal("nbr_failed_new");
nbr_failed->addr = nbr->addr;
nbr_failed->auth_seq_num = nbr->auth_seq_num;
iface = nbr->iface;
timerclear(&tv);
tv.tv_sec = FAILED_NBR_TIMEOUT;
evtimer_set(&nbr_failed->timeout_timer, nbr_failed_timeout,
nbr_failed);
if (evtimer_add(&nbr_failed->timeout_timer, &tv) == -1)
fatal("nbr_failed_new");
LIST_INSERT_HEAD(&iface->failed_nbr_list, nbr_failed, entry);
}
struct nbr_failed *
nbr_failed_find(struct iface *iface, u_int32_t src_ip)
{
struct nbr_failed *nbr_failed = NULL;
LIST_FOREACH(nbr_failed, &iface->failed_nbr_list, entry) {
if (nbr_failed->addr.s_addr == src_ip) {
return (nbr_failed);
}
}
return (NULL);
}
void
nbr_failed_delete(struct nbr_failed *nbr_failed)
{
if (evtimer_pending(&nbr_failed->timeout_timer, NULL))
if (evtimer_del(&nbr_failed->timeout_timer) == -1)
fatal("nbr_failed_delete");
LIST_REMOVE(nbr_failed, entry);
free(nbr_failed);
}
/* timers */
/* ARGSUSED */
void
nbr_timeout_timer(int fd, short event, void *arg)
{
struct nbr *nbr = arg;
nbr_fsm(nbr, NBR_EVT_TIMEOUT);
}
/* ARGSUSED */
void
nbr_failed_timeout(int fd, short event, void *arg)
{
struct nbr_failed *nbr_failed = arg;
log_debug("nbr_failed_timeout: failed neighbor ID %s deleted",
inet_ntoa(nbr_failed->addr));
nbr_failed_delete(nbr_failed);
}
/* actions */
void
nbr_set_timer(struct nbr *nbr)
{
struct timeval tv;
timerclear(&tv);
tv.tv_sec = NBR_TIMEOUT;
if (evtimer_add(&nbr->timeout_timer, &tv) == -1)
fatal("nbr_set_timer");
}
void
nbr_stop_timer(struct nbr *nbr)
{
if (evtimer_del(&nbr->timeout_timer) == -1)
fatal("nbr_stop_timer");
}
/* names */
const char *
nbr_event_name(int event)
{
return (nbr_event_names[event]);
}
const char *
nbr_action_name(int action)
{
return (nbr_action_names[action]);
}
struct ctl_nbr *
nbr_to_ctl(struct nbr *nbr)
{
static struct ctl_nbr nctl;
struct timeval tv, now, res;
memcpy(nctl.name, nbr->iface->name, sizeof(nctl.name));
memcpy(&nctl.id, &nbr->id, sizeof(nctl.id));
memcpy(&nctl.addr, &nbr->addr, sizeof(nctl.addr));
nctl.nbr_state = nbr->state;
nctl.iface_state = nbr->iface->state;
gettimeofday(&now, NULL);
if (evtimer_pending(&nbr->timeout_timer, &tv)) {
timersub(&tv, &now, &res);
if (nbr->state & NBR_STA_DOWN)
nctl.dead_timer = NBR_TIMEOUT - res.tv_sec;
else
nctl.dead_timer = res.tv_sec;
} else
nctl.dead_timer = 0;
if (nbr->state == NBR_STA_ACTIVE) {
nctl.uptime = now.tv_sec - nbr->uptime;
} else
nctl.uptime = 0;
return (&nctl);
}
|