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) ( \
39 (type *)( (char *)ptr - offsetof(type,member) ))
43 struct list_head
*next
;
44 struct list_head
*prev
;
47 #define LIST_HEAD_INIT(name) { &(name), &(name) }
48 #define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
51 INIT_LIST_HEAD(struct list_head
*list
)
53 list
->next
= list
->prev
= list
;
57 list_empty(const struct list_head
*head
)
59 return (head
->next
== head
);
63 list_is_first(const struct list_head
*list
,
64 const struct list_head
*head
)
66 return list
->prev
== head
;
70 list_is_last(const struct list_head
*list
,
71 const struct list_head
*head
)
73 return list
->next
== head
;
77 _list_del(struct list_head
*entry
)
79 entry
->next
->prev
= entry
->prev
;
80 entry
->prev
->next
= entry
->next
;
84 list_del(struct list_head
*entry
)
87 entry
->next
= entry
->prev
= NULL
;
91 _list_add(struct list_head
*_new
, struct list_head
*prev
,
92 struct list_head
*next
)
102 list_del_init(struct list_head
*entry
)
105 INIT_LIST_HEAD(entry
);
108 #define list_entry(ptr, type, field) container_of(ptr, type, field)
109 #define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field)
110 #define list_last_entry(ptr, type, field) list_entry((ptr)->prev, type, field)
112 #define list_for_each(p, head) \
113 for (p = (head)->next; p != (head); p = p->next)
115 #define list_for_each_safe(p, n, head) \
116 for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
118 #define list_for_each_entry(p, h, field) \
119 for (p = list_first_entry(h, typeof(*p), field); &p->field != (h); \
120 p = list_entry(p->field.next, typeof(*p), field))
122 #define list_for_each_entry_safe(p, n, h, field) \
123 for (p = list_first_entry(h, typeof(*p), field), \
124 n = list_entry(p->field.next, typeof(*p), field); &p->field != (h);\
125 p = n, n = list_entry(n->field.next, typeof(*n), field))
127 #define list_for_each_entry_reverse(p, h, field) \
128 for (p = list_last_entry(h, typeof(*p), field); &p->field != (h); \
129 p = list_entry(p->field.prev, typeof(*p), field))
131 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = p->prev)
132 #define list_for_each_prev_safe(p, n, h) for (p = (h)->prev, n = p->prev; p != (h); p = n, n = p->prev)
135 list_add(struct list_head
*_new
, struct list_head
*head
)
137 _list_add(_new
, head
, head
->next
);
141 list_add_tail(struct list_head
*_new
, struct list_head
*head
)
143 _list_add(_new
, head
->prev
, head
);
147 list_move(struct list_head
*list
, struct list_head
*head
)
150 list_add(list
, head
);
154 list_move_tail(struct list_head
*entry
, struct list_head
*head
)
157 list_add_tail(entry
, head
);
161 _list_splice(const struct list_head
*list
, struct list_head
*prev
,
162 struct list_head
*next
)
164 struct list_head
*first
;
165 struct list_head
*last
;
167 if (list_empty(list
))
179 list_splice(const struct list_head
*list
, struct list_head
*head
)
181 _list_splice(list
, head
, head
->next
);
185 list_splice_tail(struct list_head
*list
, struct list_head
*head
)
187 _list_splice(list
, head
->prev
, head
);
191 list_splice_init(struct list_head
*list
, struct list_head
*head
)
193 _list_splice(list
, head
, head
->next
);
194 INIT_LIST_HEAD(list
);
198 list_splice_tail_init(struct list_head
*list
, struct list_head
*head
)
200 _list_splice(list
, head
->prev
, head
);
201 INIT_LIST_HEAD(list
);
204 #endif /* _LINUX_LIST_H_ */