|
|||
Prex Home / Browse Source - Prex Version: 0.9.0 |
|||
root/include/sys/queue.h/* [<][>][^][v][top][bottom][index][help] */INCLUDED FROM1 /* 2 * Copyright (c) 2005, Kohsuke Ohtani 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the author nor the names of any co-contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 #ifndef _SYS_QUEUE_H 31 #define _SYS_QUEUE_H 32 33 #include <sys/cdefs.h> 34 35 struct queue { 36 struct queue *next; 37 struct queue *prev; 38 }; 39 typedef struct queue *queue_t; 40 41 #define queue_init(head) ((head)->next = (head)->prev = (head)) 42 #define queue_empty(head) ((head)->next == (head)) 43 #define queue_next(q) ((q)->next) 44 #define queue_prev(q) ((q)->prev) 45 #define queue_first(head) ((head)->next) 46 #define queue_last(head) ((head)->prev) 47 #define queue_end(head,q) ((q) == (head)) 48 49 /* Get the struct for this entry */ 50 #define queue_entry(q, type, member) \ 51 ((type *)((char *)(q) - (unsigned long)(&((type *)0)->member))) 52 53 __BEGIN_DECLS 54 void enqueue(queue_t, queue_t); 55 queue_t dequeue(queue_t); 56 void queue_insert(queue_t, queue_t); 57 void queue_remove(queue_t); 58 __END_DECLS 59 60 #endif /* !_SYS_QUEUE_H */ /* [<][>][^][v][top][bottom][index][help] */ | |||
Copyright© 2005-2009 Kohsuke Ohtani |