| /src/common/lib/libc/gen/ |
| rbtree.c | 247 next = TAILQ_NEXT(prev, rb_link);
249 prev = TAILQ_PREV(next, rb_node_qh, rb_link);
301 RB_TAILQ_INSERT_HEAD(&rbt->rbt_nodes, self, rb_link);
306 RB_TAILQ_INSERT_BEFORE(RB_FATHER(self), self, rb_link); local
312 self, rb_link);
530 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
681 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
740 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
1125 KASSERT(prev0 == TAILQ_PREV(self, rb_node_qh, rb_link));
1126 KASSERT(next0 == TAILQ_NEXT(self, rb_link));
[all...] |
| rbtree.c | 247 next = TAILQ_NEXT(prev, rb_link);
249 prev = TAILQ_PREV(next, rb_node_qh, rb_link);
301 RB_TAILQ_INSERT_HEAD(&rbt->rbt_nodes, self, rb_link);
306 RB_TAILQ_INSERT_BEFORE(RB_FATHER(self), self, rb_link); local
312 self, rb_link);
530 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
681 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
740 RB_TAILQ_REMOVE(&rbt->rbt_nodes, self, rb_link);
1125 KASSERT(prev0 == TAILQ_PREV(self, rb_node_qh, rb_link));
1126 KASSERT(next0 == TAILQ_NEXT(self, rb_link));
[all...] |
| /src/sys/sys/ |
| rbtree.h | 106 TAILQ_ENTRY(rb_node) rb_link; member in struct:rb_node
|
| rbtree.h | 106 TAILQ_ENTRY(rb_node) rb_link; member in struct:rb_node
|
