usr.sbin/bgpd/kroute.c

1373

RB_FOREACH(nh, knexthop_tree, KT2KNT(kt))

usr.sbin/bgpd/kroute.c

1732

RB_FOREACH(n, knexthop_tree, KT2KNT(kt))

usr.sbin/bgpd/kroute.c

1805

RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {

usr.sbin/bgpd/kroute.c

1874

RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {

usr.sbin/bgpd/kroute.c

2000

return (RB_FIND(knexthop_tree, KT2KNT(kt), &s));

usr.sbin/bgpd/kroute.c

2006

if (RB_INSERT(knexthop_tree, KT2KNT(kt), kn) != NULL) {

usr.sbin/bgpd/kroute.c

2022

RB_REMOVE(knexthop_tree, KT2KNT(kt), kn);

usr.sbin/bgpd/kroute.c

2031

while ((kn = RB_MIN(knexthop_tree, KT2KNT(kt))) != NULL)

usr.sbin/bgpd/kroute.c

2271

RB_FOREACH(kn, knexthop_tree, KT2KNT(kt))

usr.sbin/bgpd/kroute.c

2284

RB_FOREACH(kn, knexthop_tree, KT2KNT(kt))

usr.sbin/bgpd/kroute.c

2389

RB_FOREACH(s, knexthop_tree, KT2KNT(kt))

usr.sbin/bgpd/kroute.c

984

RB_FOREACH(h, knexthop_tree, KT2KNT(kt)) {