3 * Copyright (C) Igor Sysoev
4 * Copyright (C) Nginx, Inc.
8 #include <ngx_config.h>
12 #ifndef _NGX_QUEUE_H_INCLUDED_
13 #define _NGX_QUEUE_H_INCLUDED_
16 typedef struct ngx_queue_s ngx_queue_t
;
24 #define ngx_queue_init(q) \
29 #define ngx_queue_empty(h) \
33 #define ngx_queue_insert_head(h, x) \
34 (x)->next = (h)->next; \
35 (x)->next->prev = x; \
40 #define ngx_queue_insert_after ngx_queue_insert_head
43 #define ngx_queue_insert_tail(h, x) \
44 (x)->prev = (h)->prev; \
45 (x)->prev->next = x; \
50 #define ngx_queue_head(h) \
54 #define ngx_queue_last(h) \
58 #define ngx_queue_sentinel(h) \
62 #define ngx_queue_next(q) \
66 #define ngx_queue_prev(q) \
72 #define ngx_queue_remove(x) \
73 (x)->next->prev = (x)->prev; \
74 (x)->prev->next = (x)->next; \
80 #define ngx_queue_remove(x) \
81 (x)->next->prev = (x)->prev; \
82 (x)->prev->next = (x)->next
87 #define ngx_queue_split(h, q, n) \
88 (n)->prev = (h)->prev; \
89 (n)->prev->next = n; \
91 (h)->prev = (q)->prev; \
92 (h)->prev->next = h; \
96 #define ngx_queue_add(h, n) \
97 (h)->prev->next = (n)->next; \
98 (n)->next->prev = (h)->prev; \
99 (h)->prev = (n)->prev; \
103 #define ngx_queue_data(q, type, link) \
104 (type *) ((u_char *) q - offsetof(type, link))
107 ngx_queue_t
*ngx_queue_middle(ngx_queue_t
*queue
);
108 void ngx_queue_sort(ngx_queue_t
*queue
,
109 ngx_int_t (*cmp
)(const ngx_queue_t
*, const ngx_queue_t
*));
112 #endif /* _NGX_QUEUE_H_INCLUDED_ */