Lines Matching refs:_t
17 # define RBI_LINK(_n, _t)
19 # define RBI_HEAD(_n, _t) rb_tree_t
22 # define RBI_CODE(_n, _t, _f, _cmp) \
25 typedef void (*_n##_rb_walker_t)(_t *, void *); \
31 .rbto_node_offset = offsetof(_t, _f), \
48 _t *rb; \
71 #define RBI_LINK(_n, _t) \
73 struct _t *left; \
74 struct _t *right; \
75 struct _t *parent; \
79 #define RBI_HEAD(_n, _t) \
81 struct _t top; \
83 int (* compare)(struct _t *, struct _t *); \
88 #define RBI_CODE(_n, _t, _f, _cmp) \
90 _t RBI_ZERO(_n); \
92 typedef void (*_n##_rb_walker_t)(_t *, void *); \
94 _t * _n##_rb_delete(struct _n##_rb_head *, _t *); \
96 void _n##_rb_insert(struct _n##_rb_head *, _t *); \
97 _t * _n##_rb_search(struct _n##_rb_head *, void *); \
101 rotate_left(struct _n##_rb_head *head, _t *node) \
103 _t *parent, *tmp1, *tmp2; \
123 rotate_right(struct _n##_rb_head *head, _t *node) \
125 _t *parent, *tmp1, *tmp2; \
145 _n##_rb_insert(struct _n##_rb_head *head, _t *node) \
147 _t *n, *parent, **p, *tmp1, *gparent; \
208 deleteblack(struct _n##_rb_head *head, _t *parent, _t *node) \
210 _t *tmp; \
232 _t *tmp2 = tmp->_f.left; \
265 _t *tmp2 = tmp->_f.right; \
287 _t * \
288 _n##_rb_delete(struct _n##_rb_head *head, _t *node) \
290 _t *child, *parent, *old = node, *left; \
367 _t *prev; \
368 _t *next; \
369 _t *node = head->top._f.right; \
370 _t *base; \
399 _t * \
403 _t *node; \
Indexes created Sun Oct 26 13:09:57 GMT 2025