Lines Matching defs:head
97 #define SLIST_HEAD_INITIALIZER(head) \ argument
108 #define SLIST_FIRST(head) ((head)->slh_first) argument
109 #define SLIST_END(head) NULL argument
110 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
113 #define SLIST_FOREACH(var, head, field) \ argument
121 #define SLIST_INIT(head) { \ argument
130 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
135 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
139 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
160 #define LIST_HEAD_INITIALIZER(head) \ argument
172 #define LIST_FIRST(head) ((head)->lh_first) argument
173 #define LIST_END(head) NULL argument
174 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
177 #define LIST_FOREACH(var, head, field) \ argument
185 #define LIST_INIT(head) do { \ argument
204 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
235 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
246 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
247 #define SIMPLEQ_END(head) NULL argument
248 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
251 #define SIMPLEQ_FOREACH(var, head, field) \ argument
259 #define SIMPLEQ_INIT(head) do { \ argument
264 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
270 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
276 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
282 #define SIMPLEQ_REMOVE_HEAD(head, elm, field) do { \ argument
296 #define TAILQ_HEAD_INITIALIZER(head) \ argument
308 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
309 #define TAILQ_END(head) NULL argument
311 #define TAILQ_LAST(head, headname) \ argument
316 #define TAILQ_EMPTY(head) \ argument
319 #define TAILQ_FOREACH(var, head, field) \ argument
324 #define TAILQ_FOREACH_REVERSE(var, head, field, headname) \ argument
332 #define TAILQ_INIT(head) do { \ argument
337 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
347 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
354 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
371 #define TAILQ_REMOVE(head, elm, field) do { \ argument
380 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
399 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
411 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
412 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
413 #define CIRCLEQ_END(head) ((void *)(head)) argument
416 #define CIRCLEQ_EMPTY(head) \ argument
419 #define CIRCLEQ_FOREACH(var, head, field) \ argument
424 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
432 #define CIRCLEQ_INIT(head) do { \ argument
437 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
447 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
457 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
467 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
477 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
490 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument