237 #define TAILQ_PREPEND(dhead,shead,headname,field) do {                  \  argument
238         if (unlikely(TAILQ_EMPTY(dhead))) {                             \
239                 TAILQ_MOVE(dhead, shead, field);                        \
242                         TAILQ_FIRST(dhead);                             \
243                 TAILQ_FIRST(dhead)->field.tqe_prev =                    \
245                 TAILQ_FIRST(shead)->field.tqe_prev = &(dhead)->tqh_first; \
246                 TAILQ_FIRST(dhead) = TAILQ_FIRST(shead);                \
252 #define TAILQ_INSERT_LIST(dhead,listelm,shead,headname,elmtype,field) do { \  argument
253         if (TAILQ_LAST(dhead, headname) == listelm) {                   \
254                 TAILQ_CONCAT(dhead, shead, field);                      \
268 #define TAILQ_INSERT_LIST_BEFORE(dhead,insert_before,shead,headname,elmtype,field) \  argument
270                 if (TAILQ_FIRST(dhead) == insert_before) {              \
271                         TAILQ_PREPEND(dhead, shead, headname, field);   \