18 #define BI_LIST_INIT_NODE(node) do {              \  argument
19     (node)->bnext = node;                         \
20     (node)->bprev = node;                         \
24 #define BI_LIST_INSERT_AFTER(curr, node) do {     \  argument
25     (node)->bnext = (curr)->bnext;                \
26     (node)->bprev = curr;                         \
27     (curr)->bnext->bprev = node;                  \
28     (curr)->bnext = node;                         \
32 #define BI_LIST_INSERT_BEFORE(curr, node) do {    \  argument
33     (curr)->bprev->bnext = node;                  \
34     (node)->bprev = (curr)->bprev;                \
35     (curr)->bprev = node;                         \
36     (node)->bnext = curr;                         \
40 #define BI_LIST_REMOVE_NODE(node) do {            \  argument
41     (node)->bprev->bnext = (node)->bnext;         \
42     (node)->bnext->bprev = (node)->bprev;         \
49 #define BI_LIST_NEXT_NODE(node)     ((node)->bnext)  argument
52 #define BI_LIST_FOR_EACH(node, head)              \  argument
53     for (node = (head)->bnext; node != head; node = (node)->bnext)
64 #define UNI_LIST_INSERT_AFTER(posi, node, link) do {    \  argument
65     (node)->link = (posi)->link;                        \
66     (posi)->link = node;                                \
70 #define UNI_LIST_IS_EMPTY(node, link)                   \  argument
71     ((node == NULL) || ((node)->link == NULL))
74 #define UNI_LIST_NEXT_NODE(node, link) ((node)->link)  argument
77 #define UNI_LIST_REMOVE_NODE(prev, node, link) do {     \  argument
78     (prev)->link = (node)->link;                        \
79     (node)->link = NULL;                                \
87 #define UNI_LIST_MOVE_AFTER(posi, prev, node, link) do {\  argument
89         (prev)->link = (node)->link;                    \
90         (node)->link = (posi)->link;                    \
91         (posi)->link = node;                            \
96 #define UNI_LIST_FOREACH(node, head, link)              \  argument
97     for (node = (head)->link; node != NULL; node = (node)->link)
100 #define UNI_LIST_FOREACH_NODE_PREV(prev, node, head, link)   \  argument
101     for (prev = NULL, node = (head)->link;                   \
102                  node != NULL; prev = node, node = (prev)->link)
105 #define UNI_LIST_FOREACH_NODE_PNODE(pnode, node, head, link) \  argument
106     for (pnode = &(head)->link, node = (head)->link;         \
107          node != NULL;                                       \
108          pnode = &(node)->link, node = (node)->link)