Lines Matching full:do
139 #define SLIST_INIT(head) do { \
143 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
148 #define SLIST_INSERT_HEAD(head, elm, field) do { \
155 #define SLIST_REMOVE(head, elm, type, field) do { \
168 #define SLIST_REMOVE_HEAD(head, field) do { \
201 #define STAILQ_INIT(head) do { \
206 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
212 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
218 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
232 #define STAILQ_REMOVE(head, elm, type, field) do { \
246 #define STAILQ_REMOVE_HEAD(head, field) do { \
252 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
257 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \
293 #define LIST_INIT(head) do { \
297 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
305 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
312 #define LIST_INSERT_HEAD(head, elm, field) do { \
321 #define LIST_REMOVE(elm, field) do { \
363 #define TAILQ_INIT(head) do { \
368 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
378 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
385 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
395 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
410 #define TAILQ_REMOVE(head, elm, field) do { \
454 #define CIRCLEQ_INIT(head) do { \
459 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
469 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
479 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
489 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
505 #define CIRCLEQ_REMOVE(head, elm, field) do { \