46 #define LL_NEXT(src, member) ((src)->member.next)  argument
47 #define LL_PREV(src, member) ((src)->member.prev)  argument
54 #define LL_ENQUEUE(head, src, member) do { \  argument
55         (src)->member.next = NULL; \
56         (src)->member.prev = (head)->last; \
58             (head)->first = (src); \
60             (head)->last->member.next = (src); \
62         (head)->last = (src); \
70 #define LL_INSERT_AFTER(head, dest, src, member) do { \  argument
71         (src)->member.prev = (dest); \
72         (src)->member.next = (dest)->member.next; \
74             (dest)->member.next->member.prev = (src); \
76             (head)->last = (src); \
78         (dest)->member.next = (src); \
81 #define LL_REMOVE(head, src, member) do { \  argument
82         if ((src)->member.prev != NULL) { \
83             (src)->member.prev->member.next = (src)->member.next; \
85             (head)->first = (src)->member.next; \
87         if ((src)->member.next != NULL) { \
88             (src)->member.next->member.prev = (src)->member.prev; \
90             (head)->last = (src)->member.prev; \