Lines Matching full:do

132 #define	SLIST_INIT(head) do {						\
136 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\
141 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\
148 #define	SLIST_REMOVE(head, elm, type, field) do {			\
161 #define	SLIST_REMOVE_HEAD(head, field) do {				\
194 #define	STAILQ_INIT(head) do {						\
199 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\
205 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\
211 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\
221 #define	STAILQ_REMOVE(head, elm, type, field) do {			\
235 #define	STAILQ_REMOVE_HEAD(head, field) do {				\
241 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\
276 #define	LIST_INIT(head) do {						\
280 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\
288 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
295 #define	LIST_INSERT_HEAD(head, elm, field) do {				\
304 #define	LIST_REMOVE(elm, field) do {					\
346 #define	TAILQ_INIT(head) do {						\
351 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
361 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
368 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\
378 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\
393 #define	TAILQ_REMOVE(head, elm, field) do {				\
437 #define	CIRCLEQ_INIT(head) do {						\
442 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
452 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
462 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\
472 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\
488 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\