koma/i3
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

implement TAILQ_SWAP (only for consecutive elements, order relevant) and use it

Browse Source
This commit is contained in:
Michael Stapelberg
2011-02-15 02:20:29 +01:00
parent 834f4d7bc2
commit 53d9072ca7
4 changed files with 783 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
include/queue.h
View File

@ -407,6 +407,19 @@ struct { \
_Q_INVALIDATE((elm)->field.tqe_next); \
} while (0)
/* Swaps two consecutive elements. 'second' *MUST* follow 'first' */
#define TAILQ_SWAP(first, second, head, field) do { \
*((first)->field.tqe_prev) = (second); \
(second)->field.tqe_prev = (first)->field.tqe_prev; \
(first)->field.tqe_prev = &((second)->field.tqe_next); \
(first)->field.tqe_next = (second)->field.tqe_next; \
if ((second)->field.tqe_next) \
(second)->field.tqe_next->field.tqe_prev = &((first)->field.tqe_next); \
(second)->field.tqe_next = first; \
if ((head)->tqh_last == &((second)->field.tqe_next)) \
(head)->tqh_last = &((first)->field.tqe_next); \
} while (0)
/*
* Circular queue definitions.
*/