Lines Matching defs:field

105 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
120 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
127 #define LIST_REMOVE(elm, field) do { \ argument
134 #define LIST_FOREACH(var, head, field) \ argument
144 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
170 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
175 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
180 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
184 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
197 #define SLIST_FOREACH(var, head, field) \ argument
205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
233 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
239 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
245 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
251 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
256 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
269 #define STAILQ_FOREACH(var, head, field) \ argument
287 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
315 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
321 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
327 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
333 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
338 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
351 #define SIMPLEQ_FOREACH(var, head, field) \ argument
361 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
392 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
402 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
409 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
419 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
426 #define TAILQ_REMOVE(head, elm, field) do { \ argument
435 #define TAILQ_FOREACH(var, head, field) \ argument
440 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
445 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
459 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
463 #define TAILQ_PREV(elm, headname, field) \ argument
493 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
503 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
513 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
523 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
533 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
546 #define CIRCLEQ_FOREACH(var, head, field) \ argument
551 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
562 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
563 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
565 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
569 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument