Lines Matching refs:head
38 rotate_left(struct _n##_rb_head *head, _t *node) \
49 head->top._f.right = tmp1; \
60 rotate_right(struct _n##_rb_head *head, _t *node) \
71 head->top._f.right = tmp1; \
82 _n##_rb_insert(struct _n##_rb_head *head, _t *node) \
86 parent = &head->top; \
89 p = &head->top._f.right; \
113 rotate_left(head, node); \
118 rotate_right(head, gparent); \
130 rotate_right(head, node); \
135 rotate_left(head, parent->_f.parent); \
140 head->top._f.right->_f.colour = C_BLACK; \
141 head->count++; \
145 deleteblack(struct _n##_rb_head *head, _t *parent, _t *node) \
150 node != &head->top) { \
156 rotate_left(head, parent); \
174 rotate_right(head, tmp); \
181 rotate_left(head, parent); \
182 node = head->top._f.right; \
189 rotate_right(head, parent); \
207 rotate_left(head, tmp); \
214 rotate_right(head, parent); \
215 node = head->top._f.right; \
225 _n##_rb_delete(struct _n##_rb_head *head, _t *node) \
249 head->top._f.right = child; \
260 head->top._f.right = child; \
280 head->top._f.right = child; \
284 deleteblack(head, parent, node); \
285 head->count--; \
290 _n##_rb_init(struct _n##_rb_head *head) \
292 memset(head, 0, sizeof(*head)); \
294 head->top._f.left = &_n##_rb_zero; \
295 head->top._f.right = &_n##_rb_zero; \
296 head->top._f.parent = &head->top; \
303 _n##_rb_walktree(struct _n##_rb_head *head, _n##_rb_walker_t func, void *arg)\
307 _t *node = head->top._f.right; \
338 _n##_rb_search(struct _n##_rb_head *head, void *key) \
342 node = head->top._f.right; \