Home
last modified time | relevance | path

Searched refs:rt_tree (Results 1 – 9 of 9) sorted by relevance

/openbsd-src/usr.sbin/ripd/
H A Drde_rib.c41 RB_HEAD(rt_tree, rt_node) rt;
42 RB_PROTOTYPE(rt_tree, rt_node, entry, rt_compare)
43 RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
143 return (RB_FIND(rt_tree, &rt, &s)); in rt_find()
191 if (RB_INSERT(rt_tree, &rt, r) != NULL) { in rt_insert()
204 if (RB_REMOVE(rt_tree, &rt, r) == NULL) { in rt_remove()
222 RB_FOREACH(r, rt_tree, &rt) { in rt_snap()
240 RB_FOREACH(r, rt_tree, &rt) { in rt_dump()
268 while ((r = RB_MIN(rt_tree, &rt)) != NULL) in rt_clear()
/openbsd-src/usr.sbin/dvmrpd/
H A Drde_srt.c62 RB_HEAD(rt_tree, rt_node) rt;
63 RB_PROTOTYPE(rt_tree, rt_node, entry, rt_compare)
64 RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
161 return (RB_FIND(rt_tree, &rt, &s)); in rt_find()
207 if (RB_INSERT(rt_tree, &rt, r) != NULL) { in rt_insert()
222 if (RB_REMOVE(rt_tree, &rt, r) == NULL) { in rt_remove()
242 for (r = RB_MIN(rt_tree, &rt); r != NULL; r = nr) { in rt_invalidate()
243 nr = RB_NEXT(rt_tree, &rt, r); in rt_invalidate()
256 while ((r = RB_MIN(rt_tree, &rt)) != NULL) in rt_clear()
266 RB_FOREACH(r, rt_tree, &rt) { in rt_snap()
[all …]
/openbsd-src/usr.sbin/ospfd/
H A Drde_spf.c34 RB_HEAD(rt_tree, rt_node) rt;
35 RB_PROTOTYPE(rt_tree, rt_node, entry, rt_compare)
36 RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
550 RB_FOREACH(r, rt_tree, &rt) { in spf_timer()
670 return (RB_FIND(rt_tree, &rt, &s)); in rt_find()
676 if (RB_INSERT(rt_tree, &rt, r) != NULL) { in rt_insert()
689 if (RB_REMOVE(rt_tree, &rt, r) == NULL) { in rt_remove()
706 for (r = RB_MIN(rt_tree, &rt); r != NULL; r = nr) { in rt_invalidate()
707 nr = RB_NEXT(rt_tree, &rt, r); in rt_invalidate()
793 while ((r = RB_MIN(rt_tree, &rt)) != NULL) in rt_clear()
[all …]
/openbsd-src/usr.sbin/ospf6d/
H A Drde_spf.c34 RB_HEAD(rt_tree, rt_node) rt;
35 RB_PROTOTYPE(rt_tree, rt_node, entry, rt_compare)
36 RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
670 RB_FOREACH(r, rt_tree, &rt) { in spf_timer()
788 return (RB_FIND(rt_tree, &rt, &s)); in rt_find()
794 if (RB_INSERT(rt_tree, &rt, r) != NULL) { in rt_insert()
807 if (RB_REMOVE(rt_tree, &rt, r) == NULL) { in rt_remove()
824 for (r = RB_MIN(rt_tree, &rt); r != NULL; r = nr) { in rt_invalidate()
825 nr = RB_NEXT(rt_tree, &rt, r); in rt_invalidate()
914 while ((r = RB_MIN(rt_tree, &rt)) != NULL) in rt_clear()
[all …]
/openbsd-src/usr.sbin/eigrpd/
H A Drde.h95 RB_PROTOTYPE(rt_tree, rt_node, entry, rt_compare)
H A Deigrpd.h130 RB_HEAD(rt_tree, rt_node);
302 struct rt_tree topology;
H A Drde_dual.c71 RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
198 return (RB_FIND(rt_tree, &eigrp->topology, &rn)); in rt_find()
217 if (RB_INSERT(rt_tree, &eigrp->topology, rn) != NULL) { in rt_new()
240 RB_REMOVE(rt_tree, &rn->eigrp->topology, rn); in rt_del()
1237 RB_FOREACH_SAFE(rn, rt_tree, &eigrp->topology, safe) { in rde_check_link_down_nbr()
H A Drde.c476 while((rn = RB_MIN(rt_tree, &eigrp->topology)) != NULL) in rde_instance_del()
729 RB_FOREACH(rn, rt_tree, &eigrp->topology) in rt_snap()
794 RB_FOREACH(rn, rt_tree, &eigrp->topology) { in rt_dump()
/openbsd-src/gnu/gcc/gcc/
H A Drtl.h171 tree rt_tree; member
680 #define XTREE(RTX, N) (RTL_CHECK1 (RTX, N, 't').rt_tree)
697 #define X0TREE(RTX, N) (RTL_CHECK1 (RTX, N, '0').rt_tree)
715 #define XCTREE(RTX, N, C) (RTL_CHECKC1 (RTX, N, C).rt_tree)