Lines Matching defs:rn
473 struct rt_node *rn;
476 while((rn = RB_MIN(rt_tree, &eigrp->topology)) != NULL)
477 rt_del(rn);
490 rde_send_change_kroute(struct rt_node *rn, struct eigrp_route *route)
496 log_debug("%s: %s nbr %s", __func__, log_prefix(rn),
501 kr.prefix = rn->prefix;
502 kr.prefixlen = rn->prefixlen;
535 rde_send_delete_kroute(struct rt_node *rn, struct eigrp_route *route)
541 log_debug("%s: %s nbr %s", __func__, log_prefix(rn),
546 kr.prefix = rn->prefix;
547 kr.prefixlen = rn->prefixlen;
726 struct rt_node *rn;
729 RB_FOREACH(rn, rt_tree, &eigrp->topology)
730 if (rn->state == DUAL_STA_PASSIVE &&
731 !rde_summary_check(nbr->ei, &rn->prefix, rn->prefixlen)) {
732 rinfo_fill_successor(rn, &ri);
742 rt_to_ctl(struct rt_node *rn, struct eigrp_route *route)
749 rtctl.prefix = rn->prefix;
750 rtctl.prefixlen = rn->prefixlen;
762 rtctl.fdistance = rn->successor.fdistance;
763 rtctl.state = rn->state;
776 if (route->nbr == rn->successor.nbr)
778 else if (route->rdistance < rn->successor.fdistance)
788 struct rt_node *rn;
794 RB_FOREACH(rn, rt_tree, &eigrp->topology) {
797 &rn->prefix))
801 (treq->prefixlen != rn->prefixlen))
805 TAILQ_FOREACH(route, &rn->routes, entry) {
807 !(rn->state & DUAL_STA_ACTIVE_ALL))
810 route->rdistance >= rn->successor.fdistance)
813 rtctl = rt_to_ctl(rn, route);