KT2KNT
RB_FOREACH(nh, knexthop_tree, KT2KNT(kt))
RB_FOREACH(n, knexthop_tree, KT2KNT(kt))
RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {
RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {
return (RB_FIND(knexthop_tree, KT2KNT(kt), &s));
if (RB_INSERT(knexthop_tree, KT2KNT(kt), kn) != NULL) {
RB_REMOVE(knexthop_tree, KT2KNT(kt), kn);
while ((kn = RB_MIN(knexthop_tree, KT2KNT(kt))) != NULL)
RB_FOREACH(kn, knexthop_tree, KT2KNT(kt))
RB_FOREACH(kn, knexthop_tree, KT2KNT(kt))
RB_FOREACH(s, knexthop_tree, KT2KNT(kt))
RB_FOREACH(h, knexthop_tree, KT2KNT(kt)) {