Lines Matching full:do
134 #define LIST_INIT(head) do { \
139 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
149 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
158 #define LIST_INSERT_HEAD(head, elm, field) do { \
167 #define LIST_REMOVE(elm, field) do { \
209 #define SLIST_INIT(head) do { \
214 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
220 #define SLIST_INSERT_HEAD(head, elm, field) do { \
226 #define SLIST_REMOVE_HEAD(head, field) do { \
231 #define SLIST_REMOVE(head, elm, type, field) do { \
276 #define STAILQ_INIT(head) do { \
282 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
289 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
296 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
304 #define STAILQ_REMOVE_HEAD(head, field) do { \
311 #define STAILQ_REMOVE(head, elm, type, field) do { \
358 #define SIMPLEQ_INIT(head) do { \
364 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
371 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
378 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
385 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \
391 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \
476 #define TAILQ_INIT(head) do { \
482 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
494 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
503 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
515 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
524 #define TAILQ_REMOVE(head, elm, field) do { \
582 #define CIRCLEQ_INIT(head) do { \
588 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
599 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
610 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
621 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
632 #define CIRCLEQ_REMOVE(head, elm, field) do { \