Lines Matching refs:_t
12 #define RBI_LINK(_n, _t) \
14 struct _t *left; \
15 struct _t *right; \
16 struct _t *parent; \
20 #define RBI_HEAD(_n, _t) \
22 struct _t top; \
24 int (* compare)(struct _t *, struct _t *); \
27 #define RBI_CODE(_n, _t, _f, _cmp) \
29 typedef void (*_n##_rb_walker_t)(_t *, void *); \
31 _t * _n##_rb_delete(struct _n##_rb_head *, _t *); \
33 void _n##_rb_insert(struct _n##_rb_head *, _t *); \
34 _t * _n##_rb_search(struct _n##_rb_head *, void *); \
38 rotate_left(struct _n##_rb_head *head, _t *node) \
40 _t *parent, *tmp1, *tmp2; \
60 rotate_right(struct _n##_rb_head *head, _t *node) \
62 _t *parent, *tmp1, *tmp2; \
82 _n##_rb_insert(struct _n##_rb_head *head, _t *node) \
84 _t *n, *parent, **p, *tmp1, *gparent; \
145 deleteblack(struct _n##_rb_head *head, _t *parent, _t *node) \
147 _t *tmp; \
169 _t *tmp2 = tmp->_f.left; \
202 _t *tmp2 = tmp->_f.right; \
224 _t * \
225 _n##_rb_delete(struct _n##_rb_head *head, _t *node) \
227 _t *child, *parent, *old = node, *left; \
305 _t *prev; \
306 _t *next; \
307 _t *node = head->top._f.right; \
308 _t *base; \
337 _t * \
341 _t *node; \