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>
77 #define LINUX_LIST_HEAD_INIT(name) { &(name), &(name) }
79 #define LINUX_LIST_HEAD(name) \
80 struct list_head name = LINUX_LIST_HEAD_INIT(name)
85 struct list_head *next;
86 struct list_head *prev;
91 INIT_LIST_HEAD(struct list_head *list)
94 list->next = list->prev = list;
98 list_empty(const struct list_head *head)
101 return (head->next == head);
105 list_empty_careful(const struct list_head *head)
107 struct list_head *next = head->next;
109 return ((next == head) && (next == head->prev));
113 __list_del(struct list_head *prev, struct list_head *next)
116 WRITE_ONCE(prev->next, next);
120 list_del(struct list_head *entry)
123 __list_del(entry->prev, entry->next);
127 list_replace(struct list_head *old, struct list_head *new)
129 new->next = old->next;
130 new->next->prev = new;
131 new->prev = old->prev;
132 new->prev->next = new;
136 list_replace_init(struct list_head *old, struct list_head *new)
138 list_replace(old, new);
143 linux_list_add(struct list_head *new, struct list_head *prev,
144 struct list_head *next)
154 list_del_init(struct list_head *entry)
158 INIT_LIST_HEAD(entry);
161 #define list_entry(ptr, type, field) container_of(ptr, type, field)
163 #define list_first_entry(ptr, type, member) \
164 list_entry((ptr)->next, type, member)
166 #define list_last_entry(ptr, type, member) \
167 list_entry((ptr)->prev, type, member)
169 #define list_first_entry_or_null(ptr, type, member) \
170 (!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
172 #define list_next_entry(ptr, member) \
173 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
175 #define list_prev_entry(ptr, member) \
176 list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
178 #define list_for_each(p, head) \
179 for (p = (head)->next; p != (head); p = (p)->next)
181 #define list_for_each_safe(p, n, head) \
182 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
184 #define list_for_each_entry(p, h, field) \
185 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
186 p = list_entry((p)->field.next, typeof(*p), field))
188 #define list_for_each_entry_safe(p, n, h, field) \
189 for (p = list_entry((h)->next, typeof(*p), field), \
190 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
191 p = n, n = list_entry(n->field.next, typeof(*n), field))
193 #define list_for_each_entry_from(p, h, field) \
194 for ( ; &(p)->field != (h); \
195 p = list_entry((p)->field.next, typeof(*p), field))
197 #define list_for_each_entry_continue(p, h, field) \
198 for (p = list_next_entry((p), field); &(p)->field != (h); \
199 p = list_next_entry((p), field))
201 #define list_for_each_entry_safe_from(pos, n, head, member) \
202 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
203 &(pos)->member != (head); \
204 pos = n, n = list_entry(n->member.next, typeof(*n), member))
206 #define list_for_each_entry_reverse(p, h, field) \
207 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
208 p = list_entry((p)->field.prev, typeof(*p), field))
210 #define list_for_each_entry_safe_reverse(p, n, h, field) \
211 for (p = list_entry((h)->prev, typeof(*p), field), \
212 n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
213 p = n, n = list_entry(n->field.prev, typeof(*n), field))
215 #define list_for_each_entry_continue_reverse(p, h, field) \
216 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
217 p = list_entry((p)->field.prev, typeof(*p), field))
219 #define list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
222 list_add(struct list_head *new, struct list_head *head)
225 linux_list_add(new, head, head->next);
229 list_add_tail(struct list_head *new, struct list_head *head)
232 linux_list_add(new, head->prev, head);
236 list_move(struct list_head *list, struct list_head *head)
240 list_add(list, head);
244 list_move_tail(struct list_head *entry, struct list_head *head)
248 list_add_tail(entry, head);
252 linux_list_splice(const struct list_head *list, struct list_head *prev,
253 struct list_head *next)
255 struct list_head *first;
256 struct list_head *last;
258 if (list_empty(list))
269 list_splice(const struct list_head *list, struct list_head *head)
272 linux_list_splice(list, head, head->next);
276 list_splice_tail(struct list_head *list, struct list_head *head)
279 linux_list_splice(list, head->prev, head);
283 list_splice_init(struct list_head *list, struct list_head *head)
286 linux_list_splice(list, head, head->next);
287 INIT_LIST_HEAD(list);
291 list_splice_tail_init(struct list_head *list, struct list_head *head)
294 linux_list_splice(list, head->prev, head);
295 INIT_LIST_HEAD(list);
299 #define LIST_HEAD(name) struct list_head name = { &(name), &(name) }
303 struct hlist_node *first;
307 struct hlist_node *next, **pprev;
310 #define HLIST_HEAD_INIT { }
311 #define HLIST_HEAD(name) struct hlist_head name = HLIST_HEAD_INIT
312 #define INIT_HLIST_HEAD(head) (head)->first = NULL
313 #define INIT_HLIST_NODE(node) \
315 (node)->next = NULL; \
316 (node)->pprev = NULL; \
320 hlist_unhashed(const struct hlist_node *h)
327 hlist_empty(const struct hlist_head *h)
334 hlist_del(struct hlist_node *n)
338 n->next->pprev = n->pprev;
343 hlist_del_init(struct hlist_node *n)
346 if (hlist_unhashed(n))
353 hlist_add_head(struct hlist_node *n, struct hlist_head *h)
358 h->first->pprev = &n->next;
360 n->pprev = &h->first;
364 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
367 n->pprev = next->pprev;
369 next->pprev = &n->next;
374 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
377 next->next = n->next;
379 next->pprev = &n->next;
381 next->next->pprev = &next->next;
385 hlist_move_list(struct hlist_head *old, struct hlist_head *new)
388 new->first = old->first;
390 new->first->pprev = &new->first;
394 static inline int list_is_singular(const struct list_head *head)
396 return !list_empty(head) && (head->next == head->prev);
399 static inline void __list_cut_position(struct list_head *list,
400 struct list_head *head, struct list_head *entry)
402 struct list_head *new_first = entry->next;
403 list->next = head->next;
404 list->next->prev = list;
407 head->next = new_first;
408 new_first->prev = head;
411 static inline void list_cut_position(struct list_head *list,
412 struct list_head *head, struct list_head *entry)
414 if (list_empty(head))
416 if (list_is_singular(head) &&
417 (head->next != entry && head != entry))
420 INIT_LIST_HEAD(list);
422 __list_cut_position(list, head, entry);
425 static inline int list_is_last(const struct list_head *list,
426 const struct list_head *head)
428 return list->next == head;
431 #define hlist_entry(ptr, type, field) container_of(ptr, type, field)
433 #define hlist_for_each(p, head) \
434 for (p = (head)->first; p; p = (p)->next)
436 #define hlist_for_each_safe(p, n, head) \
437 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
439 #define hlist_entry_safe(ptr, type, member) \
440 ((ptr) ? hlist_entry(ptr, type, member) : NULL)
442 #define hlist_for_each_entry(pos, head, member) \
443 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
445 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
447 #define hlist_for_each_entry_continue(pos, member) \
448 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
450 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
452 #define hlist_for_each_entry_from(pos, member) \
454 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
456 #define hlist_for_each_entry_safe(pos, n, head, member) \
457 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
458 (pos) && ({ n = (pos)->member.next; 1; }); \
459 pos = hlist_entry_safe(n, typeof(*(pos)), member))
461 extern void list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
462 struct list_head *a, struct list_head *b));
464 #endif /* _LINUX_LIST_H_ */