nxt_queue.h (42:def41906e4a5) nxt_queue.h (115:bef7c075837b)
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_

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

188#define \
189nxt_queue_truncate(queue, link) \
190 do { \
191 (queue)->head.prev = (link)->prev; \
192 (queue)->head.prev->next = &(queue)->head; \
193 } while (0)
194
195
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_

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

188#define \
189nxt_queue_truncate(queue, link) \
190 do { \
191 (queue)->head.prev = (link)->prev; \
192 (queue)->head.prev->next = &(queue)->head; \
193 } while (0)
194
195
196/* Add the queue "tail" to the queue "queue". */
196/*
197 * Add the queue "tail" to the queue "queue".
198 * If the queue "tail" is intended to be reused again,
199 * it must be initiated with nxt_queue_init(tail).
200 */
197
198#define \
199nxt_queue_add(queue, tail) \
200 do { \
201 (queue)->head.prev->next = (tail)->head.next; \
202 (tail)->head.next->prev = (queue)->head.prev; \
203 (queue)->head.prev = (tail)->head.prev; \
204 (queue)->head.prev->next = &(queue)->head; \

--- 30 unchanged lines hidden ---
201
202#define \
203nxt_queue_add(queue, tail) \
204 do { \
205 (queue)->head.prev->next = (tail)->head.next; \
206 (tail)->head.next->prev = (queue)->head.prev; \
207 (queue)->head.prev = (tail)->head.prev; \
208 (queue)->head.prev->next = &(queue)->head; \

--- 30 unchanged lines hidden ---