list.h revision 7f35b548d4b0e3c8577ad7a09433e589a0ab3f2a 
1
2#define POISON_POINTER_DELTA 0
3#define LIST_POISON1  ((void *) 0x00100100 + POISON_POINTER_DELTA)
4#define LIST_POISON2  ((void *) 0x00200200 + POISON_POINTER_DELTA)
5
6#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
7#define container_of(ptr, type, member) ({                      \
8		const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
9		(type *)( (char *)__mptr - offsetof(type,member) );})
10
11struct list_head {
12	struct list_head *next, *prev;
13};
14
15#define LIST_HEAD_INIT(name) { &(name), &(name) }
16
17#define LIST_HEAD(name) \
18	struct list_head name = LIST_HEAD_INIT(name)
19
20static inline void INIT_LIST_HEAD(struct list_head *list)
21{
22	list->next = list;
23	list->prev = list;
24}
25
26static inline void __list_add(struct list_head *new,
27		struct list_head *prev,
28		struct list_head *next)
29{
30	next->prev = new;
31	new->next = next;
32	new->prev = prev;
33	prev->next = new;
34}
35
36static inline void list_add(struct list_head *new, struct list_head *head)
37{
38	__list_add(new, head, head->next);
39}
40
41static inline void list_add_tail(struct list_head *new, struct list_head *head)
42{
43	__list_add(new, head->prev, head);
44}
45
46static inline void __list_del(struct list_head * prev, struct list_head * next)
47{
48	next->prev = prev;
49	prev->next = next;
50}
51
52static inline void __list_del_entry(struct list_head *entry)
53{
54	__list_del(entry->prev, entry->next);
55}
56
57static inline void list_del(struct list_head *entry)
58{
59	__list_del(entry->prev, entry->next);
60	entry->next = LIST_POISON1;
61	entry->prev = LIST_POISON2;
62}
63
64static inline int list_empty(const struct list_head *head)
65{
66	return head->next == head;
67}
68
69#define list_entry(ptr, type, member) \
70	container_of(ptr, type, member)
71
72#define list_for_each(pos, head) \
73	for (pos = (head)->next; pos != (head); pos = pos->next)
74
75#define list_for_each_safe(pos, n, head) \
76	for (pos = (head)->next, n = pos->next; pos != (head); \
77			pos = n, n = pos->next)
78#define list_for_each_entry(pos, head, member)                          \
79	for (pos = list_entry((head)->next, typeof(*pos), member);      \
80			&pos->member != (head);    \
81			pos = list_entry(pos->member.next, typeof(*pos), member))
82#define list_for_each_entry_safe(pos, n, head, member)                  \
83	for (pos = list_entry((head)->next, typeof(*pos), member),      \
84			n = list_entry(pos->member.next, typeof(*pos), member); \
85			&pos->member != (head);                                    \
86			pos = n, n = list_entry(n->member.next, typeof(*n), member))
87