root / prex-0.9.0 / include / sys / list.h @ 03e9c04a
History | View | Annotate | Download (2.56 KB)
1 |
/*
|
---|---|
2 |
* Copyright (c) 2005-2007, 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_LIST_H_
|
31 |
#define _SYS_LIST_H_
|
32 |
|
33 |
#include <sys/cdefs.h> |
34 |
|
35 |
struct list {
|
36 |
struct list *next;
|
37 |
struct list *prev;
|
38 |
}; |
39 |
|
40 |
typedef struct list *list_t; |
41 |
|
42 |
#define list_init(head) ((head)->next = (head)->prev = (head))
|
43 |
#define list_next(node) ((node)->next)
|
44 |
#define list_prev(node) ((node)->prev)
|
45 |
#define list_empty(head) ((head)->next == (head))
|
46 |
#define list_first(head) ((head)->next)
|
47 |
#define list_last(head) ((head)->prev)
|
48 |
#define list_end(head, node) ((node) == (head))
|
49 |
|
50 |
/*
|
51 |
* Get the struct for this entry
|
52 |
*/
|
53 |
#define list_entry(p, type, member) \
|
54 |
((type *)((char *)(p) - (unsigned long)(&((type *)0)->member))) |
55 |
|
56 |
#define LIST_INIT(head) { &(head), &(head) }
|
57 |
|
58 |
|
59 |
/*
|
60 |
* Insert new node after specified node
|
61 |
*/
|
62 |
static __inline void |
63 |
list_insert(list_t prev, list_t node) |
64 |
{ |
65 |
prev->next->prev = node; |
66 |
node->next = prev->next; |
67 |
node->prev = prev; |
68 |
prev->next = node; |
69 |
} |
70 |
|
71 |
/*
|
72 |
* Remove specified node from list
|
73 |
*/
|
74 |
static __inline void |
75 |
list_remove(list_t node) |
76 |
{ |
77 |
node->prev->next = node->next; |
78 |
node->next->prev = node->prev; |
79 |
} |
80 |
|
81 |
#endif /* !_SYS_LIST_H_ */ |