xref: /openbsd-src/usr.sbin/ospf6d/neighbor.c (revision 99fd087599a8791921855f21bd7e36130f39aadc)
1 /*	$OpenBSD: neighbor.c,v 1.16 2020/01/02 10:16:46 denis Exp $ */
2 
3 /*
4  * Copyright (c) 2005 Claudio Jeker <claudio@openbsd.org>
5  * Copyright (c) 2004, 2005, 2007 Esben Norby <norby@openbsd.org>
6  *
7  * Permission to use, copy, modify, and distribute this software for any
8  * purpose with or without fee is hereby granted, provided that the above
9  * copyright notice and this permission notice appear in all copies.
10  *
11  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
12  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
13  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
14  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
15  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
16  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
17  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18  */
19 
20 #include <sys/types.h>
21 #include <sys/ioctl.h>
22 #include <sys/time.h>
23 #include <sys/socket.h>
24 #include <netinet/in.h>
25 #include <arpa/inet.h>
26 #include <net/if.h>
27 
28 #include <ctype.h>
29 #include <err.h>
30 #include <stdio.h>
31 #include <stdlib.h>
32 #include <string.h>
33 #include <event.h>
34 
35 #include "ospf6d.h"
36 #include "ospf6.h"
37 #include "ospfe.h"
38 #include "log.h"
39 #include "rde.h"
40 
41 int	 nbr_adj_ok(struct nbr *);
42 
43 LIST_HEAD(nbr_head, nbr);
44 
45 struct nbr_table {
46 	struct nbr_head		*hashtbl;
47 	u_int32_t		 hashmask;
48 } nbrtable;
49 
50 #define NBR_HASH(x)		\
51 	&nbrtable.hashtbl[(x) & nbrtable.hashmask]
52 
53 u_int32_t	peercnt = NBR_CNTSTART;
54 
55 struct {
56 	int		state;
57 	enum nbr_event	event;
58 	enum nbr_action	action;
59 	int		new_state; /* 0 means action decides or unchanged */
60 } nbr_fsm_tbl[] = {
61     /* current state	event that happened	action to take		resulting state */
62     {NBR_STA_ACTIVE,	NBR_EVT_HELLO_RCVD,	NBR_ACT_RST_ITIMER,	0},
63     {NBR_STA_BIDIR,	NBR_EVT_2_WAY_RCVD,	NBR_ACT_NOTHING,	0},
64     {NBR_STA_INIT,	NBR_EVT_1_WAY_RCVD,	NBR_ACT_NOTHING,	0},
65     {NBR_STA_DOWN,	NBR_EVT_HELLO_RCVD,	NBR_ACT_STRT_ITIMER,	NBR_STA_INIT},
66     {NBR_STA_ATTEMPT,	NBR_EVT_HELLO_RCVD,	NBR_ACT_RST_ITIMER,	NBR_STA_INIT},
67     {NBR_STA_INIT,	NBR_EVT_2_WAY_RCVD,	NBR_ACT_EVAL,		0},
68     {NBR_STA_XSTRT,	NBR_EVT_NEG_DONE,	NBR_ACT_SNAP,		0},
69     {NBR_STA_SNAP,	NBR_EVT_SNAP_DONE,	NBR_ACT_SNAP_DONE,	NBR_STA_XCHNG},
70     {NBR_STA_XCHNG,	NBR_EVT_XCHNG_DONE,	NBR_ACT_XCHNG_DONE,	0},
71     {NBR_STA_LOAD,	NBR_EVT_LOAD_DONE,	NBR_ACT_NOTHING,	NBR_STA_FULL},
72     {NBR_STA_2_WAY,	NBR_EVT_ADJ_OK,		NBR_ACT_EVAL,		0},
73     {NBR_STA_ADJFORM,	NBR_EVT_ADJ_OK,		NBR_ACT_ADJ_OK,		0},
74     {NBR_STA_PRELIM,	NBR_EVT_ADJ_OK,		NBR_ACT_HELLO_CHK,	0},
75     {NBR_STA_ADJFORM,	NBR_EVT_ADJTMOUT,	NBR_ACT_RESTRT_DD,	0},
76     {NBR_STA_FLOOD,	NBR_EVT_SEQ_NUM_MIS,	NBR_ACT_RESTRT_DD,	0},
77     {NBR_STA_FLOOD,	NBR_EVT_BAD_LS_REQ,	NBR_ACT_RESTRT_DD,	0},
78     {NBR_STA_ANY,	NBR_EVT_KILL_NBR,	NBR_ACT_DEL,		NBR_STA_DOWN},
79     {NBR_STA_ANY,	NBR_EVT_LL_DOWN,	NBR_ACT_DEL,		NBR_STA_DOWN},
80     {NBR_STA_ANY,	NBR_EVT_ITIMER,		NBR_ACT_DEL,		NBR_STA_DOWN},
81     {NBR_STA_BIDIR,	NBR_EVT_1_WAY_RCVD,	NBR_ACT_CLR_LST,	NBR_STA_INIT},
82     {-1,		NBR_EVT_NOTHING,	NBR_ACT_NOTHING,	0},
83 };
84 
85 const char * const nbr_event_names[] = {
86 	"NOTHING",
87 	"HELLO_RECEIVED",
88 	"2_WAY_RECEIVED",
89 	"NEGOTIATION_DONE",
90 	"SNAPSHOT_DONE",
91 	"EXCHANGE_DONE",
92 	"BAD_LS_REQ",
93 	"LOADING_DONE",
94 	"ADJ_OK",
95 	"SEQ_NUM_MISMATCH",
96 	"1_WAY_RECEIVED",
97 	"KILL_NBR",
98 	"INACTIVITY_TIMER",
99 	"LL_DOWN",
100 	"ADJ_TIMEOUT"
101 };
102 
103 const char * const nbr_action_names[] = {
104 	"NOTHING",
105 	"RESET_INACTIVITY_TIMER",
106 	"START_INACTIVITY_TIMER",
107 	"EVAL",
108 	"SNAPSHOT",
109 	"SNAPSHOT_DONE",
110 	"EXCHANGE_DONE",
111 	"ADJ_OK",
112 	"RESET_DD",
113 	"DELETE",
114 	"CLEAR_LISTS",
115 	"HELLO_CHK"
116 };
117 
118 int
119 nbr_fsm(struct nbr *nbr, enum nbr_event event)
120 {
121 	struct timeval	now;
122 	int		old_state;
123 	int		new_state = 0;
124 	int		i, ret = 0;
125 
126 	if (nbr == nbr->iface->self)
127 		return (0);
128 
129 	old_state = nbr->state;
130 	for (i = 0; nbr_fsm_tbl[i].state != -1; i++)
131 		if ((nbr_fsm_tbl[i].state & old_state) &&
132 		    (nbr_fsm_tbl[i].event == event)) {
133 			new_state = nbr_fsm_tbl[i].new_state;
134 			break;
135 		}
136 
137 	if (nbr_fsm_tbl[i].state == -1) {
138 		/* event outside of the defined fsm, ignore it. */
139 		log_warnx("nbr_fsm: neighbor ID %s, "
140 		    "event %s not expected in state %s",
141 		    inet_ntoa(nbr->id), nbr_event_names[event],
142 		    nbr_state_name(old_state));
143 		return (0);
144 	}
145 
146 	switch (nbr_fsm_tbl[i].action) {
147 	case NBR_ACT_RST_ITIMER:
148 		ret = nbr_act_reset_itimer(nbr);
149 		break;
150 	case NBR_ACT_STRT_ITIMER:
151 		ret = nbr_act_start_itimer(nbr);
152 		break;
153 	case NBR_ACT_EVAL:
154 		ret = nbr_act_eval(nbr);
155 		break;
156 	case NBR_ACT_SNAP:
157 		ret = nbr_act_snapshot(nbr);
158 		break;
159 	case NBR_ACT_SNAP_DONE:
160 		/* start db exchange */
161 		start_db_tx_timer(nbr);
162 		break;
163 	case NBR_ACT_XCHNG_DONE:
164 		ret = nbr_act_exchange_done(nbr);
165 		break;
166 	case NBR_ACT_ADJ_OK:
167 		ret = nbr_act_adj_ok(nbr);
168 		break;
169 	case NBR_ACT_RESTRT_DD:
170 		ret = nbr_act_restart_dd(nbr);
171 		break;
172 	case NBR_ACT_DEL:
173 		ret = nbr_act_delete(nbr);
174 		break;
175 	case NBR_ACT_CLR_LST:
176 		ret = nbr_act_clear_lists(nbr);
177 		break;
178 	case NBR_ACT_HELLO_CHK:
179 		ret = nbr_act_hello_check(nbr);
180 		break;
181 	case NBR_ACT_NOTHING:
182 		/* do nothing */
183 		break;
184 	}
185 
186 	if (ret) {
187 		log_warnx("nbr_fsm: error changing state for neighbor ID %s, "
188 		    "event %s, state %s", inet_ntoa(nbr->id),
189 		    nbr_event_names[event], nbr_state_name(old_state));
190 		return (-1);
191 	}
192 
193 	if (new_state != 0)
194 		nbr->state = new_state;
195 
196 	if (old_state != nbr->state) {
197 		nbr->stats.sta_chng++;
198 
199 		if (old_state & NBR_STA_FULL || nbr->state & NBR_STA_FULL) {
200 			extern struct ospfd_conf        *oeconf; /* XXX */
201 			/*
202 			 * neighbor changed from/to FULL
203 			 * originate new rtr and net LSA
204 			 */
205 			orig_rtr_lsa(nbr->iface->area);
206 			if (nbr->iface->state & IF_STA_DR)
207 				orig_net_lsa(nbr->iface);
208 
209 			gettimeofday(&now, NULL);
210 			nbr->uptime = now.tv_sec;
211 		}
212 
213 		/* state change inform RDE */
214 		ospfe_imsg_compose_rde(IMSG_NEIGHBOR_CHANGE,
215 		    nbr->peerid, 0, &nbr->state, sizeof(nbr->state));
216 
217 		/* bidirectional communication lost */
218 		if (old_state & ~NBR_STA_PRELIM && nbr->state & NBR_STA_PRELIM)
219 			if_fsm(nbr->iface, IF_EVT_NBR_CHNG);
220 
221 		log_debug("nbr_fsm: event %s resulted in action %s and "
222 		    "changing state for neighbor ID %s from %s to %s",
223 		    nbr_event_names[event],
224 		    nbr_action_names[nbr_fsm_tbl[i].action],
225 		    inet_ntoa(nbr->id), nbr_state_name(old_state),
226 		    nbr_state_name(nbr->state));
227 
228 		if (nbr->iface->type == IF_TYPE_VIRTUALLINK) {
229 			orig_rtr_lsa(nbr->iface->area);
230 		}
231 	}
232 
233 	return (ret);
234 }
235 
236 void
237 nbr_init(u_int32_t hashsize)
238 {
239 	struct nbr_head	*head;
240 	struct nbr	*nbr;
241 	u_int32_t        hs, i;
242 
243 	for (hs = 1; hs < hashsize; hs <<= 1)
244 		;
245 	nbrtable.hashtbl = calloc(hs, sizeof(struct nbr_head));
246 	if (nbrtable.hashtbl == NULL)
247 		fatal("nbr_init");
248 
249 	for (i = 0; i < hs; i++)
250 		LIST_INIT(&nbrtable.hashtbl[i]);
251 
252 	nbrtable.hashmask = hs - 1;
253 
254 	/* allocate a dummy neighbor used for self originated AS ext routes */
255 	if ((nbr = calloc(1, sizeof(*nbr))) == NULL)
256 		fatal("nbr_init");
257 
258 	nbr->id.s_addr = ospfe_router_id();
259 	nbr->state = NBR_STA_DOWN;
260 	nbr->peerid = NBR_IDSELF;
261 	head = NBR_HASH(nbr->peerid);
262 	LIST_INSERT_HEAD(head, nbr, hash);
263 
264 	TAILQ_INIT(&nbr->ls_retrans_list);
265 	TAILQ_INIT(&nbr->db_sum_list);
266 	TAILQ_INIT(&nbr->ls_req_list);
267 }
268 
269 struct nbr *
270 nbr_new(u_int32_t nbr_id, struct iface *iface, u_int32_t iface_id, int self,
271 	struct in6_addr *addr)
272 {
273 	struct nbr_head	*head;
274 	struct nbr	*nbr;
275 	struct rde_nbr	 rn;
276 
277 	if ((nbr = calloc(1, sizeof(*nbr))) == NULL)
278 		fatal("nbr_new");
279 
280 	nbr->state = NBR_STA_DOWN;
281 	nbr->dd_master = 1;
282 	nbr->dd_seq_num = arc4random();	/* RFC: some unique value */
283 	nbr->id.s_addr = nbr_id;
284 
285 	/* get next unused peerid */
286 	while (nbr_find_peerid(++peercnt))
287 		;
288 	nbr->peerid = peercnt;
289 	head = NBR_HASH(nbr->peerid);
290 	LIST_INSERT_HEAD(head, nbr, hash);
291 
292 	/* add to peer list */
293 	nbr->iface = iface;
294 	nbr->iface_id = iface_id;
295 	LIST_INSERT_HEAD(&iface->nbr_list, nbr, entry);
296 
297 	TAILQ_INIT(&nbr->ls_retrans_list);
298 	TAILQ_INIT(&nbr->db_sum_list);
299 	TAILQ_INIT(&nbr->ls_req_list);
300 
301 	nbr->ls_req = NULL;
302 
303 	if (self) {
304 		nbr->state = NBR_STA_FULL;
305 		nbr->addr = iface->addr;
306 		nbr->priority = iface->priority;
307 	}
308 
309 	/* set event structures */
310 	evtimer_set(&nbr->inactivity_timer, nbr_itimer, nbr);
311 	evtimer_set(&nbr->db_tx_timer, db_tx_timer, nbr);
312 	evtimer_set(&nbr->lsreq_tx_timer, ls_req_tx_timer, nbr);
313 	evtimer_set(&nbr->ls_retrans_timer, ls_retrans_timer, nbr);
314 	evtimer_set(&nbr->adj_timer, nbr_adj_timer, nbr);
315 
316 	bzero(&rn, sizeof(rn));
317 	if (addr)
318 		rn.addr = *addr;
319 	rn.id.s_addr = nbr->id.s_addr;
320 	rn.area_id.s_addr = nbr->iface->area->id.s_addr;
321 	rn.ifindex = nbr->iface->ifindex;
322 	rn.iface_id = nbr->iface_id;
323 	rn.state = nbr->state;
324 	rn.self = self;
325 	ospfe_imsg_compose_rde(IMSG_NEIGHBOR_UP, nbr->peerid, 0, &rn,
326 	    sizeof(rn));
327 
328 	return (nbr);
329 }
330 
331 void
332 nbr_del(struct nbr *nbr)
333 {
334 	ospfe_imsg_compose_rde(IMSG_NEIGHBOR_DOWN, nbr->peerid, 0, NULL, 0);
335 
336 	if (evtimer_pending(&nbr->inactivity_timer, NULL))
337 		evtimer_del(&nbr->inactivity_timer);
338 	if (evtimer_pending(&nbr->db_tx_timer, NULL))
339 		evtimer_del(&nbr->db_tx_timer);
340 	if (evtimer_pending(&nbr->lsreq_tx_timer, NULL))
341 		evtimer_del(&nbr->lsreq_tx_timer);
342 	if (evtimer_pending(&nbr->ls_retrans_timer, NULL))
343 		evtimer_del(&nbr->ls_retrans_timer);
344 	if (evtimer_pending(&nbr->adj_timer, NULL))
345 		evtimer_del(&nbr->adj_timer);
346 
347 	/* clear lists */
348 	ls_retrans_list_clr(nbr);
349 	db_sum_list_clr(nbr);
350 	ls_req_list_clr(nbr);
351 
352 	LIST_REMOVE(nbr, entry);
353 	LIST_REMOVE(nbr, hash);
354 
355 	free(nbr);
356 }
357 
358 struct nbr *
359 nbr_find_peerid(u_int32_t peerid)
360 {
361 	struct nbr_head	*head;
362 	struct nbr	*nbr;
363 
364 	head = NBR_HASH(peerid);
365 
366 	LIST_FOREACH(nbr, head, hash) {
367 		if (nbr->peerid == peerid)
368 			return (nbr);
369 	}
370 
371 	return (NULL);
372 }
373 
374 struct nbr *
375 nbr_find_id(struct iface *iface, u_int32_t rtr_id)
376 {
377 	struct nbr	*nbr = NULL;
378 
379 	LIST_FOREACH(nbr, &iface->nbr_list, entry) {
380 		if (nbr->id.s_addr == rtr_id)
381 			return (nbr);
382 	}
383 
384 	return (NULL);
385 }
386 
387 /* timers */
388 /* ARGSUSED */
389 void
390 nbr_itimer(int fd, short event, void *arg)
391 {
392 	struct nbr *nbr = arg;
393 
394 	if (nbr->state == NBR_STA_DOWN)
395 		nbr_del(nbr);
396 	else
397 		nbr_fsm(nbr, NBR_EVT_ITIMER);
398 }
399 
400 void
401 nbr_start_itimer(struct nbr *nbr)
402 {
403 	struct timeval	tv;
404 
405 	timerclear(&tv);
406 	tv.tv_sec = nbr->iface->dead_interval;
407 
408 	if (evtimer_add(&nbr->inactivity_timer, &tv) == -1)
409 		fatal("nbr_start_itimer");
410 }
411 
412 void
413 nbr_stop_itimer(struct nbr *nbr)
414 {
415 	if (evtimer_del(&nbr->inactivity_timer) == -1)
416 		fatal("nbr_stop_itimer");
417 }
418 
419 void
420 nbr_reset_itimer(struct nbr *nbr)
421 {
422 	struct timeval	tv;
423 
424 	timerclear(&tv);
425 	tv.tv_sec = nbr->iface->dead_interval;
426 
427 	if (evtimer_add(&nbr->inactivity_timer, &tv) == -1)
428 		fatal("nbr_reset_itimer");
429 }
430 
431 /* ARGSUSED */
432 void
433 nbr_adj_timer(int fd, short event, void *arg)
434 {
435 	struct nbr *nbr = arg;
436 
437 	if (!(nbr->state & NBR_STA_ADJFORM))
438 		return;
439 
440 	if (nbr->state & NBR_STA_ACTIVE && nbr->state != NBR_STA_FULL) {
441 		log_warnx("nbr_adj_timer: failed to form adjacency with %s",
442 		    inet_ntoa(nbr->id));
443 		nbr_fsm(nbr, NBR_EVT_ADJTMOUT);
444 	}
445 }
446 
447 void
448 nbr_start_adj_timer(struct nbr *nbr)
449 {
450 	struct timeval	tv;
451 
452 	timerclear(&tv);
453 	tv.tv_sec = DEFAULT_ADJ_TMOUT;
454 
455 	if (evtimer_add(&nbr->adj_timer, &tv) == -1)
456 		fatal("nbr_start_adj_timer");
457 }
458 
459 /* actions */
460 int
461 nbr_act_reset_itimer(struct nbr *nbr)
462 {
463 	nbr_reset_itimer(nbr);
464 
465 	return (0);
466 }
467 
468 int
469 nbr_act_start_itimer(struct nbr *nbr)
470 {
471 	nbr_start_itimer(nbr);
472 
473 	return (0);
474 }
475 
476 int
477 nbr_adj_ok(struct nbr *nbr)
478 {
479 	struct iface	*iface = nbr->iface;
480 
481 	switch (iface->type) {
482 	case IF_TYPE_POINTOPOINT:
483 	case IF_TYPE_VIRTUALLINK:
484 	case IF_TYPE_POINTOMULTIPOINT:
485 		/* always ok */
486 		break;
487 	case IF_TYPE_BROADCAST:
488 	case IF_TYPE_NBMA:
489 		/*
490 		 * if neighbor is dr, bdr or router self is dr or bdr
491 		 * start forming adjacency
492 		 */
493 		if (iface->dr == nbr || iface->bdr == nbr ||
494 		    iface->state & IF_STA_DRORBDR)
495 			break;
496 		return (0);
497 	default:
498 		fatalx("nbr_adj_ok: unknown interface type");
499 	}
500 	return (1);
501 }
502 
503 int
504 nbr_act_eval(struct nbr *nbr)
505 {
506 	if (!nbr_adj_ok(nbr)) {
507 		nbr->state = NBR_STA_2_WAY;
508 		return (0);
509 	}
510 
511 	nbr->state = NBR_STA_XSTRT;
512 	nbr->dd_master = 1;
513 	nbr->dd_seq_num++;	/* as per RFC */
514 	nbr->dd_pending = 0;
515 	/* initial db negotiation */
516 	start_db_tx_timer(nbr);
517 
518 	nbr_start_adj_timer(nbr);
519 
520 	return (0);
521 }
522 
523 int
524 nbr_act_snapshot(struct nbr *nbr)
525 {
526 	stop_db_tx_timer(nbr);
527 
528 	/* we need to wait for the old snapshot to finish */
529 	if (nbr->dd_snapshot) {
530 		log_debug("nbr_act_snapshot: giving up, old snapshot running "
531 		    "for neigbor ID %s", inet_ntoa(nbr->id));
532 		return (nbr_act_restart_dd(nbr));
533 	}
534 	ospfe_imsg_compose_rde(IMSG_DB_SNAPSHOT, nbr->peerid, 0, NULL, 0);
535 
536 	nbr->dd_snapshot = 1;	/* wait for IMSG_DB_END */
537 	nbr->state = NBR_STA_SNAP;
538 
539 	return (0);
540 }
541 
542 int
543 nbr_act_exchange_done(struct nbr *nbr)
544 {
545 	if (nbr->dd_master)
546 		stop_db_tx_timer(nbr);
547 
548 	if (ls_req_list_empty(nbr) && nbr->state == NBR_STA_XCHNG &&
549 	    nbr->dd_pending == 0) {
550 		nbr->state = NBR_STA_FULL;
551 		return (0);
552 	}
553 
554 	nbr->state = NBR_STA_LOAD;
555 
556 	if (!ls_req_list_empty(nbr))
557 		start_ls_req_tx_timer(nbr);
558 
559 	return (0);
560 }
561 
562 int
563 nbr_act_adj_ok(struct nbr *nbr)
564 {
565 	if (nbr_adj_ok(nbr)) {
566 		if (nbr->state == NBR_STA_2_WAY)
567 			return (nbr_act_eval(nbr));
568 	} else {
569 		nbr->state = NBR_STA_2_WAY;
570 		return (nbr_act_clear_lists(nbr));
571 	}
572 
573 	return (0);
574 }
575 
576 int
577 nbr_act_restart_dd(struct nbr *nbr)
578 {
579 	nbr_act_clear_lists(nbr);
580 
581 	if (!nbr_adj_ok(nbr)) {
582 		nbr->state = NBR_STA_2_WAY;
583 		return (0);
584 	}
585 
586 	nbr->state = NBR_STA_XSTRT;
587 	nbr->dd_master = 1;
588 	nbr->dd_seq_num += arc4random() & 0xffff;
589 	nbr->dd_pending = 0;
590 
591 	/* initial db negotiation */
592 	start_db_tx_timer(nbr);
593 
594 	nbr_start_adj_timer(nbr);
595 
596 	return (0);
597 }
598 
599 int
600 nbr_act_delete(struct nbr *nbr)
601 {
602 	struct timeval	tv;
603 
604 	/* clear dr and bdr */
605 	nbr->dr.s_addr = 0;
606 	nbr->bdr.s_addr = 0;
607 
608 	if (nbr == nbr->iface->self)
609 		return (0);
610 
611 	/* stop timers */
612 	nbr_stop_itimer(nbr);
613 
614 	/* schedule kill timer */
615 	timerclear(&tv);
616 	tv.tv_sec = DEFAULT_NBR_TMOUT;
617 
618 	if (evtimer_add(&nbr->inactivity_timer, &tv)) {
619 		log_warnx("nbr_act_delete: error scheduling neighbor ID %s "
620 		    "for removal", inet_ntoa(nbr->id));
621 	}
622 
623 	return (nbr_act_clear_lists(nbr));
624 }
625 
626 int
627 nbr_act_clear_lists(struct nbr *nbr)
628 {
629 	/* stop timers */
630 	stop_db_tx_timer(nbr);
631 	stop_ls_req_tx_timer(nbr);
632 
633 	/* clear lists */
634 	ls_retrans_list_clr(nbr);
635 	db_sum_list_clr(nbr);
636 	ls_req_list_clr(nbr);
637 
638 	return (0);
639 }
640 
641 int
642 nbr_act_hello_check(struct nbr *nbr)
643 {
644 	log_debug("nbr_act_hello_check: neighbor ID %s", inet_ntoa(nbr->id));
645 
646 	return (-1);
647 }
648 
649 struct ctl_nbr *
650 nbr_to_ctl(struct nbr *nbr)
651 {
652 	static struct ctl_nbr	 nctl;
653 	struct timeval		 tv, now, res;
654 	struct lsa_entry	*le;
655 
656 	memcpy(nctl.name, nbr->iface->name, sizeof(nctl.name));
657 	memcpy(&nctl.id, &nbr->id, sizeof(nctl.id));
658 	memcpy(&nctl.addr, &nbr->addr, sizeof(nctl.addr));
659 	memcpy(&nctl.dr, &nbr->dr, sizeof(nctl.dr));
660 	memcpy(&nctl.bdr, &nbr->bdr, sizeof(nctl.bdr));
661 	memcpy(&nctl.area, &nbr->iface->area->id, sizeof(nctl.area));
662 
663 	/* this list is 99% of the time empty so that's OK for now */
664 	nctl.db_sum_lst_cnt = 0;
665 	TAILQ_FOREACH(le, &nbr->db_sum_list, entry)
666 		nctl.db_sum_lst_cnt++;
667 
668 	nctl.ls_req_lst_cnt = nbr->ls_req_cnt;
669 	nctl.ls_retrans_lst_cnt = nbr->ls_ret_cnt;
670 
671 	nctl.nbr_state = nbr->state;
672 
673 	/*
674 	 * We need to trick a bit to show the remote iface state.
675 	 * The idea is to print DR, BDR or DROther dependent on
676 	 * the type of the neighbor.
677 	 */
678 	if (nbr->iface->dr == nbr)
679 		nctl.iface_state = IF_STA_DR;
680 	else if (nbr->iface->bdr == nbr)
681 		nctl.iface_state = IF_STA_BACKUP;
682 	else if (nbr->iface->state & IF_STA_MULTI)
683 		nctl.iface_state = IF_STA_DROTHER;
684 	else
685 		nctl.iface_state = nbr->iface->state;
686 
687 	nctl.state_chng_cnt = nbr->stats.sta_chng;
688 
689 	nctl.priority = nbr->priority;
690 	nctl.options = nbr->options;
691 
692 	gettimeofday(&now, NULL);
693 	if (evtimer_pending(&nbr->inactivity_timer, &tv)) {
694 		timersub(&tv, &now, &res);
695 		if (nbr->state & NBR_STA_DOWN)
696 			nctl.dead_timer = DEFAULT_NBR_TMOUT - res.tv_sec;
697 		else
698 			nctl.dead_timer = res.tv_sec;
699 	} else
700 		nctl.dead_timer = 0;
701 
702 	if (nbr->state == NBR_STA_FULL) {
703 		nctl.uptime = now.tv_sec - nbr->uptime;
704 	} else
705 		nctl.uptime = 0;
706 
707 	return (&nctl);
708 }
709 
710 struct lsa_hdr *
711 lsa_hdr_new(void)
712 {
713 	struct lsa_hdr	*lsa_hdr = NULL;
714 
715 	if ((lsa_hdr = calloc(1, sizeof(*lsa_hdr))) == NULL)
716 		fatal("lsa_hdr_new");
717 
718 	return (lsa_hdr);
719 }
720