Lines Matching refs:head

88 #define SPLAY_ROOT(head)		(head)->sph_root  argument
89 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
92 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
93 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
94 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
98 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
99 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
100 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
101 (head)->sph_root = tmp; \
104 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
105 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
106 tmp = (head)->sph_root; \
107 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
110 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
111 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
112 tmp = (head)->sph_root; \
113 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
116 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
117 SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
118 SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
119 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
120 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
133 name##_SPLAY_FIND(struct name *head, struct type *elm) \
135 if (SPLAY_EMPTY(head)) \
137 name##_SPLAY(head, elm); \
138 if ((cmp)(elm, (head)->sph_root) == 0) \
139 return (head->sph_root); \
144 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
146 name##_SPLAY(head, elm); \
158 name##_SPLAY_MIN_MAX(struct name *head, int val) \
160 name##_SPLAY_MINMAX(head, val); \
161 return (SPLAY_ROOT(head)); \
169 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
171 if (SPLAY_EMPTY(head)) { \
175 name##_SPLAY(head, elm); \
176 __comp = (cmp)(elm, (head)->sph_root); \
178 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
179 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
180 SPLAY_LEFT((head)->sph_root, field) = NULL; \
182 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
183 SPLAY_LEFT(elm, field) = (head)->sph_root; \
184 SPLAY_RIGHT((head)->sph_root, field) = NULL; \
186 return ((head)->sph_root); \
188 (head)->sph_root = (elm); \
193 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
196 if (SPLAY_EMPTY(head)) \
198 name##_SPLAY(head, elm); \
199 if ((cmp)(elm, (head)->sph_root) == 0) { \
200 if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
201 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
203 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
204 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
205 name##_SPLAY(head, elm); \
206 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
214 name##_SPLAY(struct name *head, struct type *elm) \
222 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
224 __tmp = SPLAY_LEFT((head)->sph_root, field); \
228 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
229 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
232 SPLAY_LINKLEFT(head, __right, field); \
234 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
238 SPLAY_ROTATE_LEFT(head, __tmp, field); \
239 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
242 SPLAY_LINKRIGHT(head, __left, field); \
245 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
251 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
260 __tmp = SPLAY_LEFT((head)->sph_root, field); \
264 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
265 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
268 SPLAY_LINKLEFT(head, __right, field); \
270 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
274 SPLAY_ROTATE_LEFT(head, __tmp, field); \
275 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
278 SPLAY_LINKRIGHT(head, __left, field); \
281 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
296 #define SPLAY_FOREACH(x, name, head) \ argument
297 for ((x) = SPLAY_MIN(name, head); \
299 (x) = SPLAY_NEXT(name, head, x))
329 #define RB_ROOT(head) (head)->rbh_root argument
330 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
355 #define RB_SWAP_CHILD(head, out, in, field) do { \ argument
357 RB_ROOT(head) = (in); \
364 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
370 RB_SWAP_CHILD(head, elm, tmp, field); \
376 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
382 RB_SWAP_CHILD(head, elm, tmp, field); \
436 #define RB_RED_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
441 RB_SWAP_CHILD(head, elm, tmp, field); \
447 #define RB_RED_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
452 RB_SWAP_CHILD(head, elm, tmp, field); \
517 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
538 RB_ROTATE_RIGHT(head, gparent, tmp, field); \
555 RB_ROTATE_LEFT(head, gparent, tmp, field); \
558 RB_COLOR(head->rbh_root, field) = RB_BLACK; \
563 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent) \
572 RB_RED_ROTATE_LEFT(head, parent, tmp, field); \
591 RB_ROTATE_LEFT(head, parent, tmp, field); \
592 elm = RB_ROOT(head); \
598 RB_RED_ROTATE_RIGHT(head, parent, tmp, field); \
617 RB_ROTATE_RIGHT(head, parent, tmp, field); \
618 elm = RB_ROOT(head); \
627 name##_RB_REMOVE(struct name *head, struct type *elm) \
658 RB_SWAP_CHILD(head, old, elm, field); \
663 name##_RB_REMOVE_COLOR(head, parent); \
674 name##_RB_INSERT(struct name *head, struct type *elm) \
679 tmp = RB_ROOT(head); \
697 RB_ROOT(head) = elm; \
698 name##_RB_INSERT_COLOR(head, elm); \
709 name##_RB_FIND(struct name *head, struct type *elm) \
711 struct type *tmp = RB_ROOT(head); \
728 name##_RB_NFIND(struct name *head, struct type *elm) \
730 struct type *tmp = RB_ROOT(head); \
795 name##_RB_MINMAX(struct name *head, int val) \
797 struct type *tmp = RB_ROOT(head); \
811 name##_RB_REINSERT(struct name *head, struct type *elm) \
814 if (((cmpelm = RB_PREV(name, head, elm)) != NULL && \
816 ((cmpelm = RB_NEXT(name, head, elm)) != NULL && \
819 RB_REMOVE(name, head, elm); \
820 return (RB_INSERT(name, head, elm)); \
838 #define RB_FOREACH(x, name, head) \ argument
839 for ((x) = RB_MIN(name, head); \
848 #define RB_FOREACH_SAFE(x, name, head, y) \ argument
849 for ((x) = RB_MIN(name, head); \
853 #define RB_FOREACH_REVERSE(x, name, head) \ argument
854 for ((x) = RB_MAX(name, head); \
863 #define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \ argument
864 for ((x) = RB_MAX(name, head); \