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>
64 #include <netinet/tcp_lro.h>
66 #include <netinet6/in6_var.h>
67 #include <netinet6/nd6.h>
70 #include <vm/vm_object.h>
76 struct list_head *next;
77 struct list_head *prev;
81 INIT_LIST_HEAD(struct list_head *list)
84 list->next = list->prev = list;
88 list_empty(const struct list_head *head)
91 return (head->next == head);
95 list_del(struct list_head *entry)
98 entry->next->prev = entry->prev;
99 entry->prev->next = entry->next;
103 list_replace(struct list_head *old, struct list_head *new)
105 new->next = old->next;
106 new->next->prev = new;
107 new->prev = old->prev;
108 new->prev->next = new;
112 linux_list_add(struct list_head *new, struct list_head *prev,
113 struct list_head *next)
123 list_del_init(struct list_head *entry)
127 INIT_LIST_HEAD(entry);
130 #define list_entry(ptr, type, field) container_of(ptr, type, field)
132 #define list_first_entry(ptr, type, member) \
133 list_entry((ptr)->next, type, member)
135 #define list_next_entry(ptr, member) \
136 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
138 #define list_for_each(p, head) \
139 for (p = (head)->next; p != (head); p = (p)->next)
141 #define list_for_each_safe(p, n, head) \
142 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
144 #define list_for_each_entry(p, h, field) \
145 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
146 p = list_entry((p)->field.next, typeof(*p), field))
148 #define list_for_each_entry_safe(p, n, h, field) \
149 for (p = list_entry((h)->next, typeof(*p), field), \
150 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
151 p = n, n = list_entry(n->field.next, typeof(*n), field))
153 #define list_for_each_entry_from(p, h, field) \
154 for ( ; &(p)->field != (h); \
155 p = list_entry((p)->field.next, typeof(*p), field))
157 #define list_for_each_entry_continue(p, h, field) \
158 for (p = list_next_entry((p), field); &(p)->field != (h); \
159 p = list_next_entry((p), field))
161 #define list_for_each_entry_safe_from(pos, n, head, member) \
162 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
163 &(pos)->member != (head); \
164 pos = n, n = list_entry(n->member.next, typeof(*n), member))
166 #define list_for_each_entry_reverse(p, h, field) \
167 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
168 p = list_entry((p)->field.prev, typeof(*p), field))
170 #define list_for_each_entry_continue_reverse(p, h, field) \
171 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
172 p = list_entry((p)->field.prev, typeof(*p), field))
174 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
177 list_add(struct list_head *new, struct list_head *head)
180 linux_list_add(new, head, head->next);
184 list_add_tail(struct list_head *new, struct list_head *head)
187 linux_list_add(new, head->prev, head);
191 list_move(struct list_head *list, struct list_head *head)
195 list_add(list, head);
199 list_move_tail(struct list_head *entry, struct list_head *head)
203 list_add_tail(entry, head);
207 linux_list_splice(const struct list_head *list, struct list_head *prev,
208 struct list_head *next)
210 struct list_head *first;
211 struct list_head *last;
213 if (list_empty(list))
224 list_splice(const struct list_head *list, struct list_head *head)
227 linux_list_splice(list, head, head->next);
231 list_splice_tail(struct list_head *list, struct list_head *head)
234 linux_list_splice(list, head->prev, head);
238 list_splice_init(struct list_head *list, struct list_head *head)
241 linux_list_splice(list, head, head->next);
242 INIT_LIST_HEAD(list);
246 list_splice_tail_init(struct list_head *list, struct list_head *head)
249 linux_list_splice(list, head->prev, head);
250 INIT_LIST_HEAD(list);
254 #define LIST_HEAD(name) struct list_head name = { &(name), &(name) }
258 struct hlist_node *first;
262 struct hlist_node *next, **pprev;
265 #define HLIST_HEAD_INIT { }
266 #define HLIST_HEAD(name) struct hlist_head name = HLIST_HEAD_INIT
267 #define INIT_HLIST_HEAD(head) (head)->first = NULL
268 #define INIT_HLIST_NODE(node) \
270 (node)->next = NULL; \
271 (node)->pprev = NULL; \
275 hlist_unhashed(const struct hlist_node *h)
282 hlist_empty(const struct hlist_head *h)
289 hlist_del(struct hlist_node *n)
293 n->next->pprev = n->pprev;
298 hlist_del_init(struct hlist_node *n)
301 if (hlist_unhashed(n))
308 hlist_add_head(struct hlist_node *n, struct hlist_head *h)
313 h->first->pprev = &n->next;
315 n->pprev = &h->first;
319 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
322 n->pprev = next->pprev;
324 next->pprev = &n->next;
329 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
332 next->next = n->next;
334 next->pprev = &n->next;
336 next->next->pprev = &next->next;
340 hlist_move_list(struct hlist_head *old, struct hlist_head *new)
343 new->first = old->first;
345 new->first->pprev = &new->first;
350 * list_is_singular - tests whether a list has just one entry.
351 * @head: the list to test.
353 static inline int list_is_singular(const struct list_head *head)
355 return !list_empty(head) && (head->next == head->prev);
358 static inline void __list_cut_position(struct list_head *list,
359 struct list_head *head, struct list_head *entry)
361 struct list_head *new_first = entry->next;
362 list->next = head->next;
363 list->next->prev = list;
366 head->next = new_first;
367 new_first->prev = head;
371 * list_cut_position - cut a list into two
372 * @list: a new list to add all removed entries
373 * @head: a list with entries
374 * @entry: an entry within head, could be the head itself
375 * and if so we won't cut the list
377 * This helper moves the initial part of @head, up to and
378 * including @entry, from @head to @list. You should
379 * pass on @entry an element you know is on @head. @list
380 * should be an empty list or a list you do not care about
384 static inline void list_cut_position(struct list_head *list,
385 struct list_head *head, struct list_head *entry)
387 if (list_empty(head))
389 if (list_is_singular(head) &&
390 (head->next != entry && head != entry))
393 INIT_LIST_HEAD(list);
395 __list_cut_position(list, head, entry);
399 * list_is_last - tests whether @list is the last entry in list @head
400 * @list: the entry to test
401 * @head: the head of the list
403 static inline int list_is_last(const struct list_head *list,
404 const struct list_head *head)
406 return list->next == head;
409 #define hlist_entry(ptr, type, field) container_of(ptr, type, field)
411 #define hlist_for_each(p, head) \
412 for (p = (head)->first; p; p = (p)->next)
414 #define hlist_for_each_safe(p, n, head) \
415 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
417 #define hlist_entry_safe(ptr, type, member) \
418 ((ptr) ? hlist_entry(ptr, type, member) : NULL)
420 #define hlist_for_each_entry(pos, head, member) \
421 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
423 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
425 #define hlist_for_each_entry_continue(pos, member) \
426 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
428 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
430 #define hlist_for_each_entry_from(pos, member) \
432 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
434 #define hlist_for_each_entry_safe(pos, n, head, member) \
435 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
436 (pos) && ({ n = (pos)->member.next; 1; }); \
437 pos = hlist_entry_safe(n, typeof(*(pos)), member))
439 #endif /* _LINUX_LIST_H_ */