1 /* $OpenBSD: neighbor.c,v 1.17 2020/06/22 18:18:20 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 /* 201 * neighbor changed from/to FULL 202 * originate new rtr and net LSA 203 */ 204 orig_rtr_lsa(nbr->iface->area); 205 if (nbr->iface->state & IF_STA_DR) 206 orig_net_lsa(nbr->iface); 207 208 gettimeofday(&now, NULL); 209 nbr->uptime = now.tv_sec; 210 } 211 212 /* state change inform RDE */ 213 ospfe_imsg_compose_rde(IMSG_NEIGHBOR_CHANGE, 214 nbr->peerid, 0, &nbr->state, sizeof(nbr->state)); 215 216 /* bidirectional communication lost */ 217 if (old_state & ~NBR_STA_PRELIM && nbr->state & NBR_STA_PRELIM) 218 if_fsm(nbr->iface, IF_EVT_NBR_CHNG); 219 220 log_debug("nbr_fsm: event %s resulted in action %s and " 221 "changing state for neighbor ID %s from %s to %s", 222 nbr_event_names[event], 223 nbr_action_names[nbr_fsm_tbl[i].action], 224 inet_ntoa(nbr->id), nbr_state_name(old_state), 225 nbr_state_name(nbr->state)); 226 227 if (nbr->iface->type == IF_TYPE_VIRTUALLINK) { 228 orig_rtr_lsa(nbr->iface->area); 229 } 230 } 231 232 return (ret); 233 } 234 235 void 236 nbr_init(u_int32_t hashsize) 237 { 238 struct nbr_head *head; 239 struct nbr *nbr; 240 u_int32_t hs, i; 241 242 for (hs = 1; hs < hashsize; hs <<= 1) 243 ; 244 nbrtable.hashtbl = calloc(hs, sizeof(struct nbr_head)); 245 if (nbrtable.hashtbl == NULL) 246 fatal("nbr_init"); 247 248 for (i = 0; i < hs; i++) 249 LIST_INIT(&nbrtable.hashtbl[i]); 250 251 nbrtable.hashmask = hs - 1; 252 253 /* allocate a dummy neighbor used for self originated AS ext routes */ 254 if ((nbr = calloc(1, sizeof(*nbr))) == NULL) 255 fatal("nbr_init"); 256 257 nbr->id.s_addr = ospfe_router_id(); 258 nbr->state = NBR_STA_DOWN; 259 nbr->peerid = NBR_IDSELF; 260 head = NBR_HASH(nbr->peerid); 261 LIST_INSERT_HEAD(head, nbr, hash); 262 263 TAILQ_INIT(&nbr->ls_retrans_list); 264 TAILQ_INIT(&nbr->db_sum_list); 265 TAILQ_INIT(&nbr->ls_req_list); 266 } 267 268 struct nbr * 269 nbr_new(u_int32_t nbr_id, struct iface *iface, u_int32_t iface_id, int self, 270 struct in6_addr *addr) 271 { 272 struct nbr_head *head; 273 struct nbr *nbr; 274 struct rde_nbr rn; 275 276 if ((nbr = calloc(1, sizeof(*nbr))) == NULL) 277 fatal("nbr_new"); 278 279 nbr->state = NBR_STA_DOWN; 280 nbr->dd_master = 1; 281 nbr->dd_seq_num = arc4random(); /* RFC: some unique value */ 282 nbr->id.s_addr = nbr_id; 283 284 /* get next unused peerid */ 285 while (nbr_find_peerid(++peercnt)) 286 ; 287 nbr->peerid = peercnt; 288 head = NBR_HASH(nbr->peerid); 289 LIST_INSERT_HEAD(head, nbr, hash); 290 291 /* add to peer list */ 292 nbr->iface = iface; 293 nbr->iface_id = iface_id; 294 LIST_INSERT_HEAD(&iface->nbr_list, nbr, entry); 295 296 TAILQ_INIT(&nbr->ls_retrans_list); 297 TAILQ_INIT(&nbr->db_sum_list); 298 TAILQ_INIT(&nbr->ls_req_list); 299 300 nbr->ls_req = NULL; 301 302 if (self) { 303 nbr->state = NBR_STA_FULL; 304 nbr->addr = iface->addr; 305 nbr->priority = iface->priority; 306 } 307 308 /* set event structures */ 309 evtimer_set(&nbr->inactivity_timer, nbr_itimer, nbr); 310 evtimer_set(&nbr->db_tx_timer, db_tx_timer, nbr); 311 evtimer_set(&nbr->lsreq_tx_timer, ls_req_tx_timer, nbr); 312 evtimer_set(&nbr->ls_retrans_timer, ls_retrans_timer, nbr); 313 evtimer_set(&nbr->adj_timer, nbr_adj_timer, nbr); 314 315 bzero(&rn, sizeof(rn)); 316 if (addr) 317 rn.addr = *addr; 318 rn.id.s_addr = nbr->id.s_addr; 319 rn.area_id.s_addr = nbr->iface->area->id.s_addr; 320 rn.ifindex = nbr->iface->ifindex; 321 rn.iface_id = nbr->iface_id; 322 rn.state = nbr->state; 323 rn.self = self; 324 ospfe_imsg_compose_rde(IMSG_NEIGHBOR_UP, nbr->peerid, 0, &rn, 325 sizeof(rn)); 326 327 return (nbr); 328 } 329 330 void 331 nbr_del(struct nbr *nbr) 332 { 333 ospfe_imsg_compose_rde(IMSG_NEIGHBOR_DOWN, nbr->peerid, 0, NULL, 0); 334 335 if (evtimer_pending(&nbr->inactivity_timer, NULL)) 336 evtimer_del(&nbr->inactivity_timer); 337 if (evtimer_pending(&nbr->db_tx_timer, NULL)) 338 evtimer_del(&nbr->db_tx_timer); 339 if (evtimer_pending(&nbr->lsreq_tx_timer, NULL)) 340 evtimer_del(&nbr->lsreq_tx_timer); 341 if (evtimer_pending(&nbr->ls_retrans_timer, NULL)) 342 evtimer_del(&nbr->ls_retrans_timer); 343 if (evtimer_pending(&nbr->adj_timer, NULL)) 344 evtimer_del(&nbr->adj_timer); 345 346 /* clear lists */ 347 ls_retrans_list_clr(nbr); 348 db_sum_list_clr(nbr); 349 ls_req_list_clr(nbr); 350 351 LIST_REMOVE(nbr, entry); 352 LIST_REMOVE(nbr, hash); 353 354 free(nbr); 355 } 356 357 struct nbr * 358 nbr_find_peerid(u_int32_t peerid) 359 { 360 struct nbr_head *head; 361 struct nbr *nbr; 362 363 head = NBR_HASH(peerid); 364 365 LIST_FOREACH(nbr, head, hash) { 366 if (nbr->peerid == peerid) 367 return (nbr); 368 } 369 370 return (NULL); 371 } 372 373 struct nbr * 374 nbr_find_id(struct iface *iface, u_int32_t rtr_id) 375 { 376 struct nbr *nbr = NULL; 377 378 LIST_FOREACH(nbr, &iface->nbr_list, entry) { 379 if (nbr->id.s_addr == rtr_id) 380 return (nbr); 381 } 382 383 return (NULL); 384 } 385 386 /* timers */ 387 /* ARGSUSED */ 388 void 389 nbr_itimer(int fd, short event, void *arg) 390 { 391 struct nbr *nbr = arg; 392 393 if (nbr->state == NBR_STA_DOWN) 394 nbr_del(nbr); 395 else 396 nbr_fsm(nbr, NBR_EVT_ITIMER); 397 } 398 399 void 400 nbr_start_itimer(struct nbr *nbr) 401 { 402 struct timeval tv; 403 404 timerclear(&tv); 405 tv.tv_sec = nbr->iface->dead_interval; 406 407 if (evtimer_add(&nbr->inactivity_timer, &tv) == -1) 408 fatal("nbr_start_itimer"); 409 } 410 411 void 412 nbr_stop_itimer(struct nbr *nbr) 413 { 414 if (evtimer_del(&nbr->inactivity_timer) == -1) 415 fatal("nbr_stop_itimer"); 416 } 417 418 void 419 nbr_reset_itimer(struct nbr *nbr) 420 { 421 struct timeval tv; 422 423 timerclear(&tv); 424 tv.tv_sec = nbr->iface->dead_interval; 425 426 if (evtimer_add(&nbr->inactivity_timer, &tv) == -1) 427 fatal("nbr_reset_itimer"); 428 } 429 430 /* ARGSUSED */ 431 void 432 nbr_adj_timer(int fd, short event, void *arg) 433 { 434 struct nbr *nbr = arg; 435 436 if (!(nbr->state & NBR_STA_ADJFORM)) 437 return; 438 439 if (nbr->state & NBR_STA_ACTIVE && nbr->state != NBR_STA_FULL) { 440 log_warnx("nbr_adj_timer: failed to form adjacency with %s", 441 inet_ntoa(nbr->id)); 442 nbr_fsm(nbr, NBR_EVT_ADJTMOUT); 443 } 444 } 445 446 void 447 nbr_start_adj_timer(struct nbr *nbr) 448 { 449 struct timeval tv; 450 451 timerclear(&tv); 452 tv.tv_sec = DEFAULT_ADJ_TMOUT; 453 454 if (evtimer_add(&nbr->adj_timer, &tv) == -1) 455 fatal("nbr_start_adj_timer"); 456 } 457 458 /* actions */ 459 int 460 nbr_act_reset_itimer(struct nbr *nbr) 461 { 462 nbr_reset_itimer(nbr); 463 464 return (0); 465 } 466 467 int 468 nbr_act_start_itimer(struct nbr *nbr) 469 { 470 nbr_start_itimer(nbr); 471 472 return (0); 473 } 474 475 int 476 nbr_adj_ok(struct nbr *nbr) 477 { 478 struct iface *iface = nbr->iface; 479 480 switch (iface->type) { 481 case IF_TYPE_POINTOPOINT: 482 case IF_TYPE_VIRTUALLINK: 483 case IF_TYPE_POINTOMULTIPOINT: 484 /* always ok */ 485 break; 486 case IF_TYPE_BROADCAST: 487 case IF_TYPE_NBMA: 488 /* 489 * if neighbor is dr, bdr or router self is dr or bdr 490 * start forming adjacency 491 */ 492 if (iface->dr == nbr || iface->bdr == nbr || 493 iface->state & IF_STA_DRORBDR) 494 break; 495 return (0); 496 default: 497 fatalx("nbr_adj_ok: unknown interface type"); 498 } 499 return (1); 500 } 501 502 int 503 nbr_act_eval(struct nbr *nbr) 504 { 505 if (!nbr_adj_ok(nbr)) { 506 nbr->state = NBR_STA_2_WAY; 507 return (0); 508 } 509 510 nbr->state = NBR_STA_XSTRT; 511 nbr->dd_master = 1; 512 nbr->dd_seq_num++; /* as per RFC */ 513 nbr->dd_pending = 0; 514 /* initial db negotiation */ 515 start_db_tx_timer(nbr); 516 517 nbr_start_adj_timer(nbr); 518 519 return (0); 520 } 521 522 int 523 nbr_act_snapshot(struct nbr *nbr) 524 { 525 stop_db_tx_timer(nbr); 526 527 /* we need to wait for the old snapshot to finish */ 528 if (nbr->dd_snapshot) { 529 log_debug("nbr_act_snapshot: giving up, old snapshot running " 530 "for neigbor ID %s", inet_ntoa(nbr->id)); 531 return (nbr_act_restart_dd(nbr)); 532 } 533 ospfe_imsg_compose_rde(IMSG_DB_SNAPSHOT, nbr->peerid, 0, NULL, 0); 534 535 nbr->dd_snapshot = 1; /* wait for IMSG_DB_END */ 536 nbr->state = NBR_STA_SNAP; 537 538 return (0); 539 } 540 541 int 542 nbr_act_exchange_done(struct nbr *nbr) 543 { 544 if (nbr->dd_master) 545 stop_db_tx_timer(nbr); 546 547 if (ls_req_list_empty(nbr) && nbr->state == NBR_STA_XCHNG && 548 nbr->dd_pending == 0) { 549 nbr->state = NBR_STA_FULL; 550 return (0); 551 } 552 553 nbr->state = NBR_STA_LOAD; 554 555 if (!ls_req_list_empty(nbr)) 556 start_ls_req_tx_timer(nbr); 557 558 return (0); 559 } 560 561 int 562 nbr_act_adj_ok(struct nbr *nbr) 563 { 564 if (nbr_adj_ok(nbr)) { 565 if (nbr->state == NBR_STA_2_WAY) 566 return (nbr_act_eval(nbr)); 567 } else { 568 nbr->state = NBR_STA_2_WAY; 569 return (nbr_act_clear_lists(nbr)); 570 } 571 572 return (0); 573 } 574 575 int 576 nbr_act_restart_dd(struct nbr *nbr) 577 { 578 nbr_act_clear_lists(nbr); 579 580 if (!nbr_adj_ok(nbr)) { 581 nbr->state = NBR_STA_2_WAY; 582 return (0); 583 } 584 585 nbr->state = NBR_STA_XSTRT; 586 nbr->dd_master = 1; 587 nbr->dd_seq_num += arc4random() & 0xffff; 588 nbr->dd_pending = 0; 589 590 /* initial db negotiation */ 591 start_db_tx_timer(nbr); 592 593 nbr_start_adj_timer(nbr); 594 595 return (0); 596 } 597 598 int 599 nbr_act_delete(struct nbr *nbr) 600 { 601 struct timeval tv; 602 603 /* clear dr and bdr */ 604 nbr->dr.s_addr = 0; 605 nbr->bdr.s_addr = 0; 606 607 if (nbr == nbr->iface->self) 608 return (0); 609 610 /* stop timers */ 611 nbr_stop_itimer(nbr); 612 613 /* schedule kill timer */ 614 timerclear(&tv); 615 tv.tv_sec = DEFAULT_NBR_TMOUT; 616 617 if (evtimer_add(&nbr->inactivity_timer, &tv)) { 618 log_warnx("nbr_act_delete: error scheduling neighbor ID %s " 619 "for removal", inet_ntoa(nbr->id)); 620 } 621 622 return (nbr_act_clear_lists(nbr)); 623 } 624 625 int 626 nbr_act_clear_lists(struct nbr *nbr) 627 { 628 /* stop timers */ 629 stop_db_tx_timer(nbr); 630 stop_ls_req_tx_timer(nbr); 631 632 /* clear lists */ 633 ls_retrans_list_clr(nbr); 634 db_sum_list_clr(nbr); 635 ls_req_list_clr(nbr); 636 637 return (0); 638 } 639 640 int 641 nbr_act_hello_check(struct nbr *nbr) 642 { 643 log_debug("nbr_act_hello_check: neighbor ID %s", inet_ntoa(nbr->id)); 644 645 return (-1); 646 } 647 648 struct ctl_nbr * 649 nbr_to_ctl(struct nbr *nbr) 650 { 651 static struct ctl_nbr nctl; 652 struct timeval tv, now, res; 653 struct lsa_entry *le; 654 655 memcpy(nctl.name, nbr->iface->name, sizeof(nctl.name)); 656 memcpy(&nctl.id, &nbr->id, sizeof(nctl.id)); 657 memcpy(&nctl.addr, &nbr->addr, sizeof(nctl.addr)); 658 memcpy(&nctl.dr, &nbr->dr, sizeof(nctl.dr)); 659 memcpy(&nctl.bdr, &nbr->bdr, sizeof(nctl.bdr)); 660 memcpy(&nctl.area, &nbr->iface->area->id, sizeof(nctl.area)); 661 662 /* this list is 99% of the time empty so that's OK for now */ 663 nctl.db_sum_lst_cnt = 0; 664 TAILQ_FOREACH(le, &nbr->db_sum_list, entry) 665 nctl.db_sum_lst_cnt++; 666 667 nctl.ls_req_lst_cnt = nbr->ls_req_cnt; 668 nctl.ls_retrans_lst_cnt = nbr->ls_ret_cnt; 669 670 nctl.nbr_state = nbr->state; 671 672 /* 673 * We need to trick a bit to show the remote iface state. 674 * The idea is to print DR, BDR or DROther dependent on 675 * the type of the neighbor. 676 */ 677 if (nbr->iface->dr == nbr) 678 nctl.iface_state = IF_STA_DR; 679 else if (nbr->iface->bdr == nbr) 680 nctl.iface_state = IF_STA_BACKUP; 681 else if (nbr->iface->state & IF_STA_MULTI) 682 nctl.iface_state = IF_STA_DROTHER; 683 else 684 nctl.iface_state = nbr->iface->state; 685 686 nctl.state_chng_cnt = nbr->stats.sta_chng; 687 688 nctl.priority = nbr->priority; 689 nctl.options = nbr->options; 690 691 gettimeofday(&now, NULL); 692 if (evtimer_pending(&nbr->inactivity_timer, &tv)) { 693 timersub(&tv, &now, &res); 694 if (nbr->state & NBR_STA_DOWN) 695 nctl.dead_timer = DEFAULT_NBR_TMOUT - res.tv_sec; 696 else 697 nctl.dead_timer = res.tv_sec; 698 } else 699 nctl.dead_timer = 0; 700 701 if (nbr->state == NBR_STA_FULL) { 702 nctl.uptime = now.tv_sec - nbr->uptime; 703 } else 704 nctl.uptime = 0; 705 706 return (&nctl); 707 } 708 709 struct lsa_hdr * 710 lsa_hdr_new(void) 711 { 712 struct lsa_hdr *lsa_hdr = NULL; 713 714 if ((lsa_hdr = calloc(1, sizeof(*lsa_hdr))) == NULL) 715 fatal("lsa_hdr_new"); 716 717 return (lsa_hdr); 718 } 719