2 * Copyright (c) 2010 Isilon Systems, Inc.
3 * Copyright (c) 2010 iX Systems, Inc.
4 * Copyright (c) 2010 Panasas, Inc.
5 * Copyright (c) 2013-2016 Mellanox Technologies, Ltd.
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.
31 #ifndef _LINUX_LIST_H_
32 #define _LINUX_LIST_H_
35 * Since LIST_HEAD conflicts with the linux definition we must include any
36 * FreeBSD header which requires it here so it is resolved with the correct
37 * definition prior to the undef.
39 #include <linux/types.h>
41 #include <sys/param.h>
42 #include <sys/kernel.h>
43 #include <sys/queue.h>
44 #include <sys/cpuset.h>
47 #include <sys/mutex.h>
49 #include <sys/vnode.h>
51 #include <sys/socket.h>
56 #include <net/if_var.h>
57 #include <net/if_types.h>
58 #include <net/if_media.h>
61 #include <netinet/in.h>
62 #include <netinet/in_pcb.h>
63 #include <netinet/in_var.h>
65 #include <netinet6/in6_var.h>
66 #include <netinet6/nd6.h>
69 #include <vm/vm_object.h>
75 struct list_head *next;
76 struct list_head *prev;
80 INIT_LIST_HEAD(struct list_head *list)
83 list->next = list->prev = list;
87 list_empty(const struct list_head *head)
90 return (head->next == head);
94 list_del(struct list_head *entry)
97 entry->next->prev = entry->prev;
98 entry->prev->next = entry->next;
102 list_replace(struct list_head *old, struct list_head *new)
104 new->next = old->next;
105 new->next->prev = new;
106 new->prev = old->prev;
107 new->prev->next = new;
111 linux_list_add(struct list_head *new, struct list_head *prev,
112 struct list_head *next)
122 list_del_init(struct list_head *entry)
126 INIT_LIST_HEAD(entry);
129 #define list_entry(ptr, type, field) container_of(ptr, type, field)
131 #define list_first_entry(ptr, type, member) \
132 list_entry((ptr)->next, type, member)
134 #define list_next_entry(ptr, member) \
135 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
137 #define list_for_each(p, head) \
138 for (p = (head)->next; p != (head); p = (p)->next)
140 #define list_for_each_safe(p, n, head) \
141 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
143 #define list_for_each_entry(p, h, field) \
144 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
145 p = list_entry((p)->field.next, typeof(*p), field))
147 #define list_for_each_entry_safe(p, n, h, field) \
148 for (p = list_entry((h)->next, typeof(*p), field), \
149 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
150 p = n, n = list_entry(n->field.next, typeof(*n), field))
152 #define list_for_each_entry_from(p, h, field) \
153 for ( ; &(p)->field != (h); \
154 p = list_entry((p)->field.next, typeof(*p), field))
156 #define list_for_each_entry_continue(p, h, field) \
157 for (p = list_next_entry((p), field); &(p)->field != (h); \
158 p = list_next_entry((p), field))
160 #define list_for_each_entry_safe_from(pos, n, head, member) \
161 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
162 &(pos)->member != (head); \
163 pos = n, n = list_entry(n->member.next, typeof(*n), member))
165 #define list_for_each_entry_reverse(p, h, field) \
166 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
167 p = list_entry((p)->field.prev, typeof(*p), field))
169 #define list_for_each_entry_continue_reverse(p, h, field) \
170 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
171 p = list_entry((p)->field.prev, typeof(*p), field))
173 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
176 list_add(struct list_head *new, struct list_head *head)
179 linux_list_add(new, head, head->next);
183 list_add_tail(struct list_head *new, struct list_head *head)
186 linux_list_add(new, head->prev, head);
190 list_move(struct list_head *list, struct list_head *head)
194 list_add(list, head);
198 list_move_tail(struct list_head *entry, struct list_head *head)
202 list_add_tail(entry, head);
206 linux_list_splice(const struct list_head *list, struct list_head *prev,
207 struct list_head *next)
209 struct list_head *first;
210 struct list_head *last;
212 if (list_empty(list))
223 list_splice(const struct list_head *list, struct list_head *head)
226 linux_list_splice(list, head, head->next);
230 list_splice_tail(struct list_head *list, struct list_head *head)
233 linux_list_splice(list, head->prev, head);
237 list_splice_init(struct list_head *list, struct list_head *head)
240 linux_list_splice(list, head, head->next);
241 INIT_LIST_HEAD(list);
245 list_splice_tail_init(struct list_head *list, struct list_head *head)
248 linux_list_splice(list, head->prev, head);
249 INIT_LIST_HEAD(list);
253 #define LIST_HEAD(name) struct list_head name = { &(name), &(name) }
257 struct hlist_node *first;
261 struct hlist_node *next, **pprev;
264 #define HLIST_HEAD_INIT { }
265 #define HLIST_HEAD(name) struct hlist_head name = HLIST_HEAD_INIT
266 #define INIT_HLIST_HEAD(head) (head)->first = NULL
267 #define INIT_HLIST_NODE(node) \
269 (node)->next = NULL; \
270 (node)->pprev = NULL; \
274 hlist_unhashed(const struct hlist_node *h)
281 hlist_empty(const struct hlist_head *h)
288 hlist_del(struct hlist_node *n)
292 n->next->pprev = n->pprev;
297 hlist_del_init(struct hlist_node *n)
300 if (hlist_unhashed(n))
307 hlist_add_head(struct hlist_node *n, struct hlist_head *h)
312 h->first->pprev = &n->next;
314 n->pprev = &h->first;
318 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
321 n->pprev = next->pprev;
323 next->pprev = &n->next;
328 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
331 next->next = n->next;
333 next->pprev = &n->next;
335 next->next->pprev = &next->next;
339 hlist_move_list(struct hlist_head *old, struct hlist_head *new)
342 new->first = old->first;
344 new->first->pprev = &new->first;
349 * list_is_singular - tests whether a list has just one entry.
350 * @head: the list to test.
352 static inline int list_is_singular(const struct list_head *head)
354 return !list_empty(head) && (head->next == head->prev);
357 static inline void __list_cut_position(struct list_head *list,
358 struct list_head *head, struct list_head *entry)
360 struct list_head *new_first = entry->next;
361 list->next = head->next;
362 list->next->prev = list;
365 head->next = new_first;
366 new_first->prev = head;
370 * list_cut_position - cut a list into two
371 * @list: a new list to add all removed entries
372 * @head: a list with entries
373 * @entry: an entry within head, could be the head itself
374 * and if so we won't cut the list
376 * This helper moves the initial part of @head, up to and
377 * including @entry, from @head to @list. You should
378 * pass on @entry an element you know is on @head. @list
379 * should be an empty list or a list you do not care about
383 static inline void list_cut_position(struct list_head *list,
384 struct list_head *head, struct list_head *entry)
386 if (list_empty(head))
388 if (list_is_singular(head) &&
389 (head->next != entry && head != entry))
392 INIT_LIST_HEAD(list);
394 __list_cut_position(list, head, entry);
398 * list_is_last - tests whether @list is the last entry in list @head
399 * @list: the entry to test
400 * @head: the head of the list
402 static inline int list_is_last(const struct list_head *list,
403 const struct list_head *head)
405 return list->next == head;
408 #define hlist_entry(ptr, type, field) container_of(ptr, type, field)
410 #define hlist_for_each(p, head) \
411 for (p = (head)->first; p; p = (p)->next)
413 #define hlist_for_each_safe(p, n, head) \
414 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
416 #define hlist_entry_safe(ptr, type, member) \
417 ((ptr) ? hlist_entry(ptr, type, member) : NULL)
419 #define hlist_for_each_entry(pos, head, member) \
420 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
422 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
424 #define hlist_for_each_entry_continue(pos, member) \
425 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
427 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
429 #define hlist_for_each_entry_from(pos, member) \
431 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
433 #define hlist_for_each_entry_safe(pos, n, head, member) \
434 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
435 (pos) && ({ n = (pos)->member.next; 1; }); \
436 pos = hlist_entry_safe(n, typeof(*(pos)), member))
438 #endif /* _LINUX_LIST_H_ */