Lines Matching refs:head1
233 #define SLIST_SWAP(head1, head2, type) do { \
234 struct type *swap_first = SLIST_FIRST(head1); \
235 SLIST_FIRST(head1) = SLIST_FIRST(head2); \
259 #define STAILQ_CONCAT(head1, head2) do { \
261 *(head1)->stqh_last = (head2)->stqh_first; \
262 (head1)->stqh_last = (head2)->stqh_last; \
346 #define STAILQ_SWAP(head1, head2, type) do { \
347 struct type *swap_first = STAILQ_FIRST(head1); \
348 struct type **swap_last = (head1)->stqh_last; \
349 STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \
350 (head1)->stqh_last = (head2)->stqh_last; \
353 if (STAILQ_EMPTY(head1)) \
354 (head1)->stqh_last = &STAILQ_FIRST(head1); \
478 #define LIST_SWAP(head1, head2, type, field) do { \
479 struct type *swap_tmp = LIST_FIRST((head1)); \
480 LIST_FIRST((head1)) = LIST_FIRST((head2)); \
482 if ((swap_tmp = LIST_FIRST((head1))) != NULL) \
483 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
542 #define TAILQ_CONCAT(head1, head2, field) do { \
544 *(head1)->tqh_last = (head2)->tqh_first; \
545 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
546 (head1)->tqh_last = (head2)->tqh_last; \
548 QMD_TRACE_HEAD(head1); \
677 #define TAILQ_SWAP(head1, head2, type, field) do { \
678 struct type *swap_first = (head1)->tqh_first; \
679 struct type **swap_last = (head1)->tqh_last; \
680 (head1)->tqh_first = (head2)->tqh_first; \
681 (head1)->tqh_last = (head2)->tqh_last; \
684 if ((swap_first = (head1)->tqh_first) != NULL) \
685 swap_first->field.tqe_prev = &(head1)->tqh_first; \
687 (head1)->tqh_last = &(head1)->tqh_first; \