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>
75 #define LINUX_LIST_HEAD_INIT(name) { &(name), &(name) }
77 #define LINUX_LIST_HEAD(name) \
78 struct list_head name = LINUX_LIST_HEAD_INIT(name)
83 struct list_head *next;
84 struct list_head *prev;
89 INIT_LIST_HEAD(struct list_head *list)
92 list->next = list->prev = list;
96 list_empty(const struct list_head *head)
99 return (head->next == head);
103 list_empty_careful(const struct list_head *head)
105 struct list_head *next = head->next;
107 return ((next == head) && (next == head->prev));
111 __list_del(struct list_head *prev, struct list_head *next)
114 WRITE_ONCE(prev->next, next);
118 list_del(struct list_head *entry)
121 __list_del(entry->prev, entry->next);
125 list_replace(struct list_head *old, struct list_head *new)
127 new->next = old->next;
128 new->next->prev = new;
129 new->prev = old->prev;
130 new->prev->next = new;
134 list_replace_init(struct list_head *old, struct list_head *new)
136 list_replace(old, new);
141 linux_list_add(struct list_head *new, struct list_head *prev,
142 struct list_head *next)
152 list_del_init(struct list_head *entry)
156 INIT_LIST_HEAD(entry);
159 #define list_entry(ptr, type, field) container_of(ptr, type, field)
161 #define list_first_entry(ptr, type, member) \
162 list_entry((ptr)->next, type, member)
164 #define list_last_entry(ptr, type, member) \
165 list_entry((ptr)->prev, type, member)
167 #define list_first_entry_or_null(ptr, type, member) \
168 (!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
170 #define list_next_entry(ptr, member) \
171 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
173 #define list_prev_entry(ptr, member) \
174 list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
176 #define list_for_each(p, head) \
177 for (p = (head)->next; p != (head); p = (p)->next)
179 #define list_for_each_safe(p, n, head) \
180 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
182 #define list_for_each_entry(p, h, field) \
183 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
184 p = list_entry((p)->field.next, typeof(*p), field))
186 #define list_for_each_entry_safe(p, n, h, field) \
187 for (p = list_entry((h)->next, typeof(*p), field), \
188 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
189 p = n, n = list_entry(n->field.next, typeof(*n), field))
191 #define list_for_each_entry_from(p, h, field) \
192 for ( ; &(p)->field != (h); \
193 p = list_entry((p)->field.next, typeof(*p), field))
195 #define list_for_each_entry_continue(p, h, field) \
196 for (p = list_next_entry((p), field); &(p)->field != (h); \
197 p = list_next_entry((p), field))
199 #define list_for_each_entry_safe_from(pos, n, head, member) \
200 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
201 &(pos)->member != (head); \
202 pos = n, n = list_entry(n->member.next, typeof(*n), member))
204 #define list_for_each_entry_reverse(p, h, field) \
205 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
206 p = list_entry((p)->field.prev, typeof(*p), field))
208 #define list_for_each_entry_safe_reverse(p, n, h, field) \
209 for (p = list_entry((h)->prev, typeof(*p), field), \
210 n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
211 p = n, n = list_entry(n->field.prev, typeof(*n), field))
213 #define list_for_each_entry_continue_reverse(p, h, field) \
214 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
215 p = list_entry((p)->field.prev, typeof(*p), field))
217 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
220 list_add(struct list_head *new, struct list_head *head)
223 linux_list_add(new, head, head->next);
227 list_add_tail(struct list_head *new, struct list_head *head)
230 linux_list_add(new, head->prev, head);
234 list_move(struct list_head *list, struct list_head *head)
238 list_add(list, head);
242 list_move_tail(struct list_head *entry, struct list_head *head)
246 list_add_tail(entry, head);
250 linux_list_splice(const struct list_head *list, struct list_head *prev,
251 struct list_head *next)
253 struct list_head *first;
254 struct list_head *last;
256 if (list_empty(list))
267 list_splice(const struct list_head *list, struct list_head *head)
270 linux_list_splice(list, head, head->next);
274 list_splice_tail(struct list_head *list, struct list_head *head)
277 linux_list_splice(list, head->prev, head);
281 list_splice_init(struct list_head *list, struct list_head *head)
284 linux_list_splice(list, head, head->next);
285 INIT_LIST_HEAD(list);
289 list_splice_tail_init(struct list_head *list, struct list_head *head)
292 linux_list_splice(list, head->prev, head);
293 INIT_LIST_HEAD(list);
297 #define LIST_HEAD(name) struct list_head name = { &(name), &(name) }
301 struct hlist_node *first;
305 struct hlist_node *next, **pprev;
308 #define HLIST_HEAD_INIT { }
309 #define HLIST_HEAD(name) struct hlist_head name = HLIST_HEAD_INIT
310 #define INIT_HLIST_HEAD(head) (head)->first = NULL
311 #define INIT_HLIST_NODE(node) \
313 (node)->next = NULL; \
314 (node)->pprev = NULL; \
318 hlist_unhashed(const struct hlist_node *h)
325 hlist_empty(const struct hlist_head *h)
332 hlist_del(struct hlist_node *n)
336 n->next->pprev = n->pprev;
341 hlist_del_init(struct hlist_node *n)
344 if (hlist_unhashed(n))
351 hlist_add_head(struct hlist_node *n, struct hlist_head *h)
356 h->first->pprev = &n->next;
358 n->pprev = &h->first;
362 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
365 n->pprev = next->pprev;
367 next->pprev = &n->next;
372 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
375 next->next = n->next;
377 next->pprev = &n->next;
379 next->next->pprev = &next->next;
383 hlist_move_list(struct hlist_head *old, struct hlist_head *new)
386 new->first = old->first;
388 new->first->pprev = &new->first;
393 * list_is_singular - tests whether a list has just one entry.
394 * @head: the list to test.
396 static inline int list_is_singular(const struct list_head *head)
398 return !list_empty(head) && (head->next == head->prev);
401 static inline void __list_cut_position(struct list_head *list,
402 struct list_head *head, struct list_head *entry)
404 struct list_head *new_first = entry->next;
405 list->next = head->next;
406 list->next->prev = list;
409 head->next = new_first;
410 new_first->prev = head;
414 * list_cut_position - cut a list into two
415 * @list: a new list to add all removed entries
416 * @head: a list with entries
417 * @entry: an entry within head, could be the head itself
418 * and if so we won't cut the list
420 * This helper moves the initial part of @head, up to and
421 * including @entry, from @head to @list. You should
422 * pass on @entry an element you know is on @head. @list
423 * should be an empty list or a list you do not care about
427 static inline void list_cut_position(struct list_head *list,
428 struct list_head *head, struct list_head *entry)
430 if (list_empty(head))
432 if (list_is_singular(head) &&
433 (head->next != entry && head != entry))
436 INIT_LIST_HEAD(list);
438 __list_cut_position(list, head, entry);
442 * list_is_last - tests whether @list is the last entry in list @head
443 * @list: the entry to test
444 * @head: the head of the list
446 static inline int list_is_last(const struct list_head *list,
447 const struct list_head *head)
449 return list->next == head;
452 #define hlist_entry(ptr, type, field) container_of(ptr, type, field)
454 #define hlist_for_each(p, head) \
455 for (p = (head)->first; p; p = (p)->next)
457 #define hlist_for_each_safe(p, n, head) \
458 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
460 #define hlist_entry_safe(ptr, type, member) \
461 ((ptr) ? hlist_entry(ptr, type, member) : NULL)
463 #define hlist_for_each_entry(pos, head, member) \
464 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
466 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
468 #define hlist_for_each_entry_continue(pos, member) \
469 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
471 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
473 #define hlist_for_each_entry_from(pos, member) \
475 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
477 #define hlist_for_each_entry_safe(pos, n, head, member) \
478 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
479 (pos) && ({ n = (pos)->member.next; 1; }); \
480 pos = hlist_entry_safe(n, typeof(*(pos)), member))
482 extern void list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
483 struct list_head *a, struct list_head *b));
485 #endif /* _LINUX_LIST_H_ */