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_PREVPTR(var, varp, head, field) \ argument
128 #define SLIST_INIT(head) { \ argument
137 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
142 #define SLIST_REMOVE_NEXT(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
197 #define LIST_INIT(head) do { \ argument
216 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
251 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
262 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
263 #define SIMPLEQ_END(head) NULL argument
264 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
267 #define SIMPLEQ_FOREACH(var, head, field) \ argument
275 #define SIMPLEQ_INIT(head) do { \ argument
280 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
286 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
292 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
312 #define TAILQ_HEAD_INITIALIZER(head) \ argument
324 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
325 #define TAILQ_END(head) NULL argument
327 #define TAILQ_LAST(head, headname) \ argument
332 #define TAILQ_EMPTY(head) \ argument
335 #define TAILQ_FOREACH(var, head, field) \ argument
340 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
348 #define TAILQ_INIT(head) do { \ argument
353 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
363 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
370 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
387 #define TAILQ_REMOVE(head, elm, field) do { \ argument
398 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
419 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
431 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
432 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
433 #define CIRCLEQ_END(head) ((void *)(head)) argument
436 #define CIRCLEQ_EMPTY(head) \ argument
439 #define CIRCLEQ_FOREACH(var, head, field) \ argument
444 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
452 #define CIRCLEQ_INIT(head) do { \ argument
457 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
467 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
477 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
487 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
497 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
512 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument