H A D | list.h | 36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \ argument 71 (elt)->link.next->link.prev = (elt)->link.prev; \ 77 (elt)->link.prev->link.next = (elt)->link.next; \ 87 #define PREV(elt, link) ((elt)->link.prev) argument 88 #define NEXT(elt, link) ((elt)->link.next) argument 96 (elt)->link.prev = (before)->link.prev; \ 98 (elt)->link.prev->link.next = (elt); \ 109 (elt)->link.next = (after)->link.next; \ 111 (elt)->link.next->link.prev = (elt); \ 116 #define ENQUEUE(list, elt, link) APPEND(list, elt, link) argument [all …]
|