2 * Copyright (c) 2011 Felix Fietkau <nbd@openwrt.org>
3 * Copyright (c) 2010 Isilon Systems, Inc.
4 * Copyright (c) 2010 iX Systems, Inc.
5 * Copyright (c) 2010 Panasas, Inc.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice unmodified, this list of conditions, and the following
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 #ifndef _LINUX_LIST_H_
30 #define _LINUX_LIST_H_
38 #define container_of(ptr, type, member) \
40 const __typeof__(((type *) NULL)->member) *__mptr = (ptr); \
41 (type *) ((char *) __mptr - offsetof(type, member)); \
45 #ifndef container_of_safe
46 #define container_of_safe(ptr, type, member) \
48 const __typeof__(((type *) NULL)->member) *__mptr = (ptr); \
49 __mptr ? (type *)((char *) __mptr - offsetof(type, member)) : NULL; \
54 struct list_head
*next
;
55 struct list_head
*prev
;
58 #define LIST_HEAD_INIT(name) { &(name), &(name) }
60 #define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
63 INIT_LIST_HEAD(struct list_head
*list
)
65 list
->next
= list
->prev
= list
;
69 list_empty(const struct list_head
*head
)
71 return (head
->next
== head
);
75 list_is_first(const struct list_head
*list
,
76 const struct list_head
*head
)
78 return list
->prev
== head
;
82 list_is_last(const struct list_head
*list
,
83 const struct list_head
*head
)
85 return list
->next
== head
;
89 _list_del(struct list_head
*entry
)
91 entry
->next
->prev
= entry
->prev
;
92 entry
->prev
->next
= entry
->next
;
96 list_del(struct list_head
*entry
)
99 entry
->next
= entry
->prev
= NULL
;
103 _list_add(struct list_head
*_new
, struct list_head
*prev
,
104 struct list_head
*next
)
114 list_del_init(struct list_head
*entry
)
117 INIT_LIST_HEAD(entry
);
120 #define list_entry(ptr, type, field) container_of(ptr, type, field)
121 #define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field)
122 #define list_last_entry(ptr, type, field) list_entry((ptr)->prev, type, field)
123 #define list_next_entry(pos, member) list_entry((pos)->member.next, typeof(*(pos)), member)
124 #define list_entry_is_h(p, h, field) (&p->field == (h))
126 #define list_for_each(p, head) \
127 for (p = (head)->next; p != (head); p = p->next)
129 #define list_for_each_safe(p, n, head) \
130 for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
132 #define list_for_each_entry(p, h, field) \
133 for (p = list_first_entry(h, __typeof__(*p), field); &p->field != (h); \
134 p = list_entry(p->field.next, __typeof__(*p), field))
136 #define list_for_each_entry_continue(p, h, field) \
137 for (p = list_next_entry(p, field); \
138 !list_entry_is_h(p, h, field); \
139 p = list_next_entry(p, field))
141 #define list_for_each_entry_continue_reverse(p, h, field) \
142 for (p = list_prev_entry(p, field); \
143 !list_entry_is_h(p, h, field); \
144 p = list_prev_entry(p, field))
146 #define list_for_each_entry_safe(p, n, h, field) \
147 for (p = list_first_entry(h, __typeof__(*p), field), \
148 n = list_entry(p->field.next, __typeof__(*p), field); &p->field != (h);\
149 p = n, n = list_entry(n->field.next, __typeof__(*n), field))
151 #define list_for_each_entry_reverse(p, h, field) \
152 for (p = list_last_entry(h, __typeof__(*p), field); &p->field != (h); \
153 p = list_entry(p->field.prev, __typeof__(*p), field))
155 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = p->prev)
156 #define list_for_each_prev_safe(p, n, h) for (p = (h)->prev, n = p->prev; p != (h); p = n, n = p->prev)
159 list_add(struct list_head
*_new
, struct list_head
*head
)
161 _list_add(_new
, head
, head
->next
);
165 list_add_tail(struct list_head
*_new
, struct list_head
*head
)
167 _list_add(_new
, head
->prev
, head
);
171 list_move(struct list_head
*list
, struct list_head
*head
)
174 list_add(list
, head
);
178 list_move_tail(struct list_head
*entry
, struct list_head
*head
)
181 list_add_tail(entry
, head
);
185 _list_splice(const struct list_head
*list
, struct list_head
*prev
,
186 struct list_head
*next
)
188 struct list_head
*first
;
189 struct list_head
*last
;
191 if (list_empty(list
))
203 list_splice(const struct list_head
*list
, struct list_head
*head
)
205 _list_splice(list
, head
, head
->next
);
209 list_splice_tail(struct list_head
*list
, struct list_head
*head
)
211 _list_splice(list
, head
->prev
, head
);
215 list_splice_init(struct list_head
*list
, struct list_head
*head
)
217 _list_splice(list
, head
, head
->next
);
218 INIT_LIST_HEAD(list
);
222 list_splice_tail_init(struct list_head
*list
, struct list_head
*head
)
224 _list_splice(list
, head
->prev
, head
);
225 INIT_LIST_HEAD(list
);
228 #endif /* _LINUX_LIST_H_ */