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