Cross Reference: /illumos-gate/usr/src/lib/libresolv2/include/isc/list.h

Lines Matching refs:elt
27 #define INIT_LINK_TYPE(elt, link, type) \
29 		(elt)->link.prev = (type *)(-1); \
30 		(elt)->link.next = (type *)(-1); \
32 #define INIT_LINK(elt, link) \
33 	INIT_LINK_TYPE(elt, link, void)
34 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
35 			   (void *)((elt)->link.next) != (void *)(-1))
41 #define PREPEND(list, elt, link) \
43 		INSIST(!LINKED(elt, link));\
45 			(list).head->link.prev = (elt); \
47 			(list).tail = (elt); \
48 		(elt)->link.prev = NULL; \
49 		(elt)->link.next = (list).head; \
50 		(list).head = (elt); \
53 #define APPEND(list, elt, link) \
55 		INSIST(!LINKED(elt, link));\
57 			(list).tail->link.next = (elt); \
59 			(list).head = (elt); \
60 		(elt)->link.prev = (list).tail; \
61 		(elt)->link.next = NULL; \
62 		(list).tail = (elt); \
65 #define UNLINK_TYPE(list, elt, link, type) \
67 		INSIST(LINKED(elt, link));\
68 		if ((elt)->link.next != NULL) \
69 			(elt)->link.next->link.prev = (elt)->link.prev; \
71 			INSIST((list).tail == (elt)); \
72 			(list).tail = (elt)->link.prev; \
74 		if ((elt)->link.prev != NULL) \
75 			(elt)->link.prev->link.next = (elt)->link.next; \
77 			INSIST((list).head == (elt)); \
78 			(list).head = (elt)->link.next; \
80 		INIT_LINK_TYPE(elt, link, type); \
82 #define UNLINK(list, elt, link) \
83 	UNLINK_TYPE(list, elt, link, void)
85 #define PREV(elt, link) ((elt)->link.prev)
86 #define NEXT(elt, link) ((elt)->link.next)
88 #define INSERT_BEFORE(list, before, elt, link) \
90 		INSIST(!LINKED(elt, link));\
92 			PREPEND(list, elt, link); \
94 			(elt)->link.prev = (before)->link.prev; \
95 			(before)->link.prev = (elt); \
96 			(elt)->link.prev->link.next = (elt); \
97 			(elt)->link.next = (before); \
101 #define INSERT_AFTER(list, after, elt, link) \
103 		INSIST(!LINKED(elt, link));\
105 			APPEND(list, elt, link); \
107 			(elt)->link.next = (after)->link.next; \
108 			(after)->link.next = (elt); \
109 			(elt)->link.next->link.prev = (elt); \
110 			(elt)->link.prev = (after); \
114 #define ENQUEUE(list, elt, link) APPEND(list, elt, link)
115 #define DEQUEUE(list, elt, link) UNLINK(list, elt, link)