nxt_queue.h (115:bef7c075837b) nxt_queue.h (125:5cc5002a788e)
1
2/*
3 * Copyright (C) Igor Sysoev
4 * Copyright (C) NGINX, Inc.
5 */
6
7#ifndef _NXT_QUEUE_H_INCLUDED_
8#define _NXT_QUEUE_H_INCLUDED_

--- 208 unchanged lines hidden (view full) ---

217NXT_EXPORT nxt_queue_link_t *nxt_queue_middle(nxt_queue_t *queue);
218NXT_EXPORT void nxt_queue_sort(nxt_queue_t *queue,
219 nxt_int_t (*cmp)(const void *, const nxt_queue_link_t *,
220 const nxt_queue_link_t *), const void *data);
221
222
223#define nxt_queue_each(elt, queue, type, link) \
224 do { \
1
2/*
3 * Copyright (C) Igor Sysoev
4 * Copyright (C) NGINX, Inc.
5 */
6
7#ifndef _NXT_QUEUE_H_INCLUDED_
8#define _NXT_QUEUE_H_INCLUDED_

--- 208 unchanged lines hidden (view full) ---

217NXT_EXPORT nxt_queue_link_t *nxt_queue_middle(nxt_queue_t *queue);
218NXT_EXPORT void nxt_queue_sort(nxt_queue_t *queue,
219 nxt_int_t (*cmp)(const void *, const nxt_queue_link_t *,
220 const nxt_queue_link_t *), const void *data);
221
222
223#define nxt_queue_each(elt, queue, type, link) \
224 do { \
225 nxt_queue_link_t *_lnk; \
225 nxt_queue_link_t *_lnk, *_nxt; \
226 \
227 for (_lnk = nxt_queue_first(queue); \
228 _lnk != nxt_queue_tail(queue); \
226 \
227 for (_lnk = nxt_queue_first(queue); \
228 _lnk != nxt_queue_tail(queue); \
229 _lnk = nxt_queue_next(_lnk)) { \
229 _lnk = _nxt) { \
230 \
230 \
231 _nxt = nxt_queue_next(_lnk); \
231 elt = nxt_queue_link_data(_lnk, type, link); \
232
233#define nxt_queue_loop \
234 } \
235 } while(0)
236
237
238#endif /* _NXT_QUEUE_H_INCLUDED_ */
232 elt = nxt_queue_link_data(_lnk, type, link); \
233
234#define nxt_queue_loop \
235 } \
236 } while(0)
237
238
239#endif /* _NXT_QUEUE_H_INCLUDED_ */