Lines Matching refs:queue

24 #define nxt_queue_init(queue)                                                 \  argument
26 (queue)->head.prev = &(queue)->head; \
27 (queue)->head.next = &(queue)->head; \
47 #define nxt_queue_is_empty(queue) \ argument
48 (&(queue)->head == (queue)->head.prev)
72 #define nxt_queue_first(queue) \ argument
73 (queue)->head.next
76 #define nxt_queue_last(queue) \ argument
77 (queue)->head.prev
80 #define nxt_queue_head(queue) \ argument
81 (&(queue)->head)
84 #define nxt_queue_tail(queue) \ argument
85 (&(queue)->head)
96 #define nxt_queue_insert_head(queue, link) \ argument
98 (link)->next = (queue)->head.next; \
100 (link)->prev = &(queue)->head; \
101 (queue)->head.next = (link); \
105 #define nxt_queue_insert_tail(queue, link) \ argument
107 (link)->prev = (queue)->head.prev; \
109 (link)->next = &(queue)->head; \
110 (queue)->head.prev = (link); \
158 #define nxt_queue_split(queue, link, tail) \ argument
160 (tail)->head.prev = (queue)->head.prev; \
163 (queue)->head.prev = (link)->prev; \
164 (queue)->head.prev->next = &(queue)->head; \
171 #define nxt_queue_truncate(queue, link) \ argument
173 (queue)->head.prev = (link)->prev; \
174 (queue)->head.prev->next = &(queue)->head; \
184 #define nxt_queue_add(queue, tail) \ argument
186 (queue)->head.prev->next = (tail)->head.next; \
187 (tail)->head.next->prev = (queue)->head.prev; \
188 (queue)->head.prev = (tail)->head.prev; \
189 (queue)->head.prev->next = &(queue)->head; \
197 NXT_EXPORT nxt_queue_link_t *nxt_queue_middle(nxt_queue_t *queue);
198 NXT_EXPORT void nxt_queue_sort(nxt_queue_t *queue,
203 #define nxt_queue_each(elt, queue, type, link) \ argument
207 for (_lnk = nxt_queue_first(queue); \
208 _lnk != nxt_queue_tail(queue); \