Lines Matching defs:type
151 #define QUEUE_TYPEOF(type) type argument
153 #define QUEUE_TYPEOF(type) struct type argument
159 #define SLIST_HEAD(name, type) \ argument
164 #define SLIST_CLASS_HEAD(name, type) \ argument
172 #define SLIST_ENTRY(type) \ argument
177 #define SLIST_CLASS_ENTRY(type) \ argument
220 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
258 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
273 #define SLIST_SWAP(head1, head2, type) do { \ argument
282 #define STAILQ_HEAD(name, type) \ argument
288 #define STAILQ_CLASS_HEAD(name, type) \ argument
297 #define STAILQ_ENTRY(type) \ argument
302 #define STAILQ_CLASS_ENTRY(type) \ argument
378 #define STAILQ_LAST(head, type, field) \ argument
397 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
411 #define STAILQ_SWAP(head1, head2, type) do { \ argument
428 #define LIST_HEAD(name, type) \ argument
433 #define LIST_CLASS_HEAD(name, type) \ argument
441 #define LIST_ENTRY(type) \ argument
447 #define LIST_CLASS_ENTRY(type) \ argument
460 #define LIST_PREV(elm, head, type, field) \ argument
553 #define LIST_SWAP(head1, head2, type, field) do { \ argument
567 #define SIMPLEQ_HEAD(name, type) \ argument
573 #define SIMPLEQ_CLASS_HEAD(name, type) \ argument
582 #define SIMPLEQ_ENTRY(type) \ argument
587 #define SIMPLEQ_CLASS_ENTRY(type) \ argument
669 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
690 #define SIMPLEQ_LAST(head, type, field) \ argument
699 #define TAILQ_HEAD(name, type) \ argument
706 #define TAILQ_CLASS_HEAD(name, type) \ argument
716 #define TAILQ_ENTRY(type) \ argument
723 #define TAILQ_CLASS_ENTRY(type) \ argument
890 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
913 #define CIRCLEQ_HEAD(name, type) \ argument
922 #define CIRCLEQ_ENTRY(type) \ argument