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