Lines Matching defs:head
99 #define SLIST_HEAD_INITIALIZER(head) \ argument
114 #define SLIST_FIRST(head) ((head)->slh_first) argument
115 #define SLIST_END(head) NULL argument
116 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
119 #define SLIST_FOREACH(var, head, field) \ argument
124 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
132 #define SLIST_INIT(head) { \ argument
141 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
146 #define SLIST_REMOVE_NEXT(head, elm, field) do { \ argument
150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
154 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
176 #define LIST_HEAD_INITIALIZER(head) \ argument
188 #define LIST_FIRST(head) ((head)->lh_first) argument
189 #define LIST_END(head) NULL argument
190 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
193 #define LIST_FOREACH(var, head, field) \ argument
201 #define LIST_INIT(head) do { \ argument
220 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
255 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
266 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
267 #define SIMPLEQ_END(head) NULL argument
268 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
271 #define SIMPLEQ_FOREACH(var, head, field) \ argument
279 #define SIMPLEQ_INIT(head) do { \ argument
284 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
290 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
296 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
316 #define TAILQ_HEAD_INITIALIZER(head) \ argument
328 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
329 #define TAILQ_END(head) NULL argument
331 #define TAILQ_LAST(head, headname) \ argument
336 #define TAILQ_EMPTY(head) \ argument
339 #define TAILQ_FOREACH(var, head, field) \ argument
344 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
352 #define TAILQ_INIT(head) do { \ argument
357 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
367 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
374 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
391 #define TAILQ_REMOVE(head, elm, field) do { \ argument
402 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
423 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
435 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
436 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
437 #define CIRCLEQ_END(head) ((void *)(head)) argument
440 #define CIRCLEQ_EMPTY(head) \ argument
443 #define CIRCLEQ_FOREACH(var, head, field) \ argument
448 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
456 #define CIRCLEQ_INIT(head) do { \ argument
461 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
471 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
481 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
491 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
501 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
516 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument