mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
70 lines
2.8 KiB
70 lines
2.8 KiB
16 years ago
|
/* Copyright (C) 2002-2009 Igor Sysoev
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
|
||
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
#ifndef oi_queue_h
|
||
|
|
#define oi_queue_h
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include <stddef.h> /* offsetof() */
|
||
|
|
|
||
|
|
typedef struct oi_queue oi_queue;
|
||
|
|
struct oi_queue {
|
||
|
|
oi_queue *prev;
|
||
|
|
oi_queue *next;
|
||
|
|
};
|
||
|
|
|
||
|
|
#define oi_queue_init(q) \
|
||
|
|
(q)->prev = q; \
|
||
|
|
(q)->next = q
|
||
|
|
|
||
|
|
#define oi_queue_empty(h) \
|
||
|
|
(h == (h)->prev)
|
||
|
|
|
||
|
|
#define oi_queue_insert_head(h, x) \
|
||
|
|
(x)->next = (h)->next; \
|
||
|
|
(x)->next->prev = x; \
|
||
|
|
(x)->prev = h; \
|
||
|
|
(h)->next = x
|
||
|
|
|
||
|
|
#define oi_queue_head(h) \
|
||
|
|
(h)->next
|
||
|
|
|
||
|
|
#define oi_queue_last(h) \
|
||
|
|
(h)->prev
|
||
|
|
|
||
|
|
#define oi_queue_remove(x) \
|
||
|
|
(x)->next->prev = (x)->prev; \
|
||
|
|
(x)->prev->next = (x)->next; \
|
||
|
|
(x)->prev = NULL; \
|
||
|
|
(x)->next = NULL
|
||
|
|
|
||
|
|
#define oi_queue_data(q, type, link) \
|
||
|
|
(type *) ((unsigned char *) q - offsetof(type, link))
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
#endif // oi_queue_h
|