Lines Matching refs:prev
34 struct NLIBQueue *prev; /**< previous (or tail) item */ member
40 #define NLIB_Queue_Init(queue) ((queue)->next = (queue)->prev = NULL)
50 #define NLIB_Queue_QueryTail(queue) ((queue)->prev)
55 #define NLIB_Queue_QueryLinkPrev(item, link) ((item)->link.prev)
77 (item)->link.prev = (NLIBQueue*) (previtem); \
81 (queue)->prev = (NLIBQueue*) (item); \
83 ((type) (item)->link.next)->link.prev = (NLIBQueue*) (item); \
91 (item)->link.prev = (afteritem)->link.prev; \
93 (afteritem)->link.prev = (NLIBQueue*) (item); \
94 if (NLIB_Queue_IsEnd(queue, (item)->link.prev)) \
97 ((type) (item)->link.prev)->link.next = (NLIBQueue*) (item); \
107 ___prev = (queue)->prev; \
112 (item)->link.prev = ___prev; \
114 (queue)->prev = (NLIBQueue*) item; \
126 (queue)->prev = (NLIBQueue*) (item); \
128 ((type) ___next)->link.prev = (NLIBQueue*) (item); \
130 (item)->link.prev = NULL; \
143 ___prev = (item)->link.prev; \
146 (queue)->prev = ___prev; \
148 ((type) ___next)->link.prev = ___prev; \
168 (queue)->prev = NULL; \
170 ((type) ___next)->link.prev = NULL; \
183 ___prev = (item)->link.prev; \
189 (queue)->prev = ___prev; \
205 #define NLIB_Queue_IterateQueueReverse(type, queue, item, prev, link) \ argument
207 … (prev) = NLIB_Queue_IsEnd(queue, item) ? NULL : (type) NLIB_Queue_QueryLinkPrev(item, link); \
209 (item) = (prev), \
210 … (prev) = NLIB_Queue_IsEnd(queue, item) ? NULL : (type) NLIB_Queue_QueryLinkPrev(item, link))