Lines Matching defs:rib
329 * prefix is taken of the rib list and put onto a redo queue. All
344 np = TAILQ_NEXT(xp, entry.list.rib);
353 TAILQ_REMOVE(&re->prefix_h, xp, entry.list.rib);
354 TAILQ_INSERT_TAIL(&redo, xp, entry.list.rib);
389 entry.list.rib), xp);
398 TAILQ_INSERT_HEAD(&re->prefix_h, new, entry.list.rib);
400 TAILQ_INSERT_AFTER(&re->prefix_h, insertp, new, entry.list.rib);
404 prefix_set_dmetric(new, TAILQ_NEXT(new, entry.list.rib));
409 TAILQ_REMOVE(&redo, xp, entry.list.rib);
431 xp = TAILQ_NEXT(old, entry.list.rib);
432 pp = TAILQ_PREV(old, prefix_queue, entry.list.rib);
433 TAILQ_REMOVE(&re->prefix_h, old, entry.list.rib);
440 np = TAILQ_NEXT(xp, entry.list.rib);
449 TAILQ_REMOVE(&re->prefix_h, xp, entry.list.rib);
450 TAILQ_INSERT_TAIL(&redo, xp, entry.list.rib);
461 entry.list.rib), xp);
470 prefix_set_dmetric(pp, TAILQ_NEXT(pp, entry.list.rib));
477 TAILQ_REMOVE(&redo, xp, entry.list.rib);
509 struct rib *rib;
511 rib = re_rib(re);
512 if (rib->flags & F_RIB_NOEVALUATE)
533 struct rib *rib;
535 rib = re_rib(re);
536 if (rib->flags & F_RIB_NOEVALUATE) {
539 TAILQ_REMOVE(&re->prefix_h, old, entry.list.rib);
541 TAILQ_INSERT_HEAD(&re->prefix_h, new, entry.list.rib);
564 if ((rib->flags & F_RIB_NOFIB) == 0)
565 rde_send_kroute(rib, newbest, oldbest);
589 struct rib *rib;
592 rib = re_rib(re);
593 if (rib->flags & F_RIB_NOEVALUATE) {
607 if ((rib->flags & F_RIB_NOFIB) == 0 &&
609 rde_send_kroute(rib, p, NULL);
643 if ((rib->flags & F_RIB_NOFIB) == 0)
644 rde_send_kroute(rib, newbest, oldbest);