Lines Matching defs:head
99 #define SLIST_HEAD_INITIALIZER(head) \ argument
110 #define SLIST_FIRST(head) ((head)->slh_first) argument
111 #define SLIST_END(head) NULL argument
112 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
115 #define SLIST_FOREACH(var, head, field) \ argument
120 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
128 #define SLIST_INIT(head) { \ argument
137 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
172 #define LIST_HEAD_INITIALIZER(head) \ argument
184 #define LIST_FIRST(head) ((head)->lh_first) argument
185 #define LIST_END(head) NULL argument
186 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
189 #define LIST_FOREACH(var, head, field) \ argument
194 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
202 #define LIST_INIT(head) do { \ argument
221 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
256 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
267 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
268 #define SIMPLEQ_END(head) NULL argument
269 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
272 #define SIMPLEQ_FOREACH(var, head, field) \ argument
277 #define SIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \ argument
285 #define SIMPLEQ_INIT(head) do { \ argument
290 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
296 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
302 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
308 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
313 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ argument
345 #define XSIMPLEQ_XOR(head, ptr) ((__typeof(ptr))((head)->sqx_cookie ^ \ argument
347 #define XSIMPLEQ_FIRST(head) XSIMPLEQ_XOR(head, ((head)->sqx_first)) argument
348 #define XSIMPLEQ_END(head) NULL argument
349 #define XSIMPLEQ_EMPTY(head) (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head)) argument
350 #define XSIMPLEQ_NEXT(head, elm, field) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next)) argument
353 #define XSIMPLEQ_FOREACH(var, head, field) \ argument
358 #define XSIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \ argument
366 #define XSIMPLEQ_INIT(head) do { \ argument
372 #define XSIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
379 #define XSIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
385 #define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
392 #define XSIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
398 #define XSIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ argument
416 #define TAILQ_HEAD_INITIALIZER(head) \ argument
428 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
429 #define TAILQ_END(head) NULL argument
431 #define TAILQ_LAST(head, headname) \ argument
436 #define TAILQ_EMPTY(head) \ argument
439 #define TAILQ_FOREACH(var, head, field) \ argument
444 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
451 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
456 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
465 #define TAILQ_INIT(head) do { \ argument
470 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
480 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
487 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
504 #define TAILQ_REMOVE(head, elm, field) do { \ argument
515 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument