1 /* SPDX-License-Identifier: GPL-2.0 */
5 #include <linux/types.h>
6 #include <linux/stddef.h>
7 #include <linux/poison.h>
8 #include <linux/const.h>
9 #include <linux/kernel.h>
12 * Simple doubly linked list implementation.
14 * Some of the internal functions ("__xxx") are useful when
15 * manipulating whole lists rather than single entries, as
16 * sometimes we already know the next/prev entries and we can
17 * generate better code by using them directly rather than
18 * using the generic single-entry routines.
21 #define LIST_HEAD_INIT(name) { &(name), &(name) }
23 #define LIST_HEAD(name) \
24 struct list_head name = LIST_HEAD_INIT(name)
26 static inline void INIT_LIST_HEAD(struct list_head *list)
28 WRITE_ONCE(list->next, list);
32 #ifdef CONFIG_DEBUG_LIST
33 extern bool __list_add_valid(struct list_head *new,
34 struct list_head *prev,
35 struct list_head *next);
36 extern bool __list_del_entry_valid(struct list_head *entry);
38 static inline bool __list_add_valid(struct list_head *new,
39 struct list_head *prev,
40 struct list_head *next)
44 static inline bool __list_del_entry_valid(struct list_head *entry)
51 * Insert a new entry between two known consecutive entries.
53 * This is only for internal list manipulation where we know
54 * the prev/next entries already!
56 static inline void __list_add(struct list_head *new,
57 struct list_head *prev,
58 struct list_head *next)
60 if (!__list_add_valid(new, prev, next))
66 WRITE_ONCE(prev->next, new);
70 * list_add - add a new entry
71 * @new: new entry to be added
72 * @head: list head to add it after
74 * Insert a new entry after the specified head.
75 * This is good for implementing stacks.
77 static inline void list_add(struct list_head *new, struct list_head *head)
79 __list_add(new, head, head->next);
84 * list_add_tail - add a new entry
85 * @new: new entry to be added
86 * @head: list head to add it before
88 * Insert a new entry before the specified head.
89 * This is useful for implementing queues.
91 static inline void list_add_tail(struct list_head *new, struct list_head *head)
93 __list_add(new, head->prev, head);
97 * Delete a list entry by making the prev/next entries
98 * point to each other.
100 * This is only for internal list manipulation where we know
101 * the prev/next entries already!
103 static inline void __list_del(struct list_head * prev, struct list_head * next)
106 WRITE_ONCE(prev->next, next);
110 * list_del - deletes entry from list.
111 * @entry: the element to delete from the list.
112 * Note: list_empty() on entry does not return true after this, the entry is
113 * in an undefined state.
115 static inline void __list_del_entry(struct list_head *entry)
117 if (!__list_del_entry_valid(entry))
120 __list_del(entry->prev, entry->next);
123 static inline void list_del(struct list_head *entry)
125 __list_del_entry(entry);
126 entry->next = LIST_POISON1;
127 entry->prev = LIST_POISON2;
131 * list_replace - replace old entry by new one
132 * @old : the element to be replaced
133 * @new : the new element to insert
135 * If @old was empty, it will be overwritten.
137 static inline void list_replace(struct list_head *old,
138 struct list_head *new)
140 new->next = old->next;
141 new->next->prev = new;
142 new->prev = old->prev;
143 new->prev->next = new;
146 static inline void list_replace_init(struct list_head *old,
147 struct list_head *new)
149 list_replace(old, new);
154 * list_del_init - deletes entry from list and reinitialize it.
155 * @entry: the element to delete from the list.
157 static inline void list_del_init(struct list_head *entry)
159 __list_del_entry(entry);
160 INIT_LIST_HEAD(entry);
164 * list_move - delete from one list and add as another's head
165 * @list: the entry to move
166 * @head: the head that will precede our entry
168 static inline void list_move(struct list_head *list, struct list_head *head)
170 __list_del_entry(list);
171 list_add(list, head);
175 * list_move_tail - delete from one list and add as another's tail
176 * @list: the entry to move
177 * @head: the head that will follow our entry
179 static inline void list_move_tail(struct list_head *list,
180 struct list_head *head)
182 __list_del_entry(list);
183 list_add_tail(list, head);
187 * list_is_last - tests whether @list is the last entry in list @head
188 * @list: the entry to test
189 * @head: the head of the list
191 static inline int list_is_last(const struct list_head *list,
192 const struct list_head *head)
194 return list->next == head;
198 * list_empty - tests whether a list is empty
199 * @head: the list to test.
201 static inline int list_empty(const struct list_head *head)
203 return READ_ONCE(head->next) == head;
207 * list_empty_careful - tests whether a list is empty and not being modified
208 * @head: the list to test
211 * tests whether a list is empty _and_ checks that no other CPU might be
212 * in the process of modifying either member (next or prev)
214 * NOTE: using list_empty_careful() without synchronization
215 * can only be safe if the only activity that can happen
216 * to the list entry is list_del_init(). Eg. it cannot be used
217 * if another CPU could re-list_add() it.
219 static inline int list_empty_careful(const struct list_head *head)
221 struct list_head *next = head->next;
222 return (next == head) && (next == head->prev);
226 * list_rotate_left - rotate the list to the left
227 * @head: the head of the list
229 static inline void list_rotate_left(struct list_head *head)
231 struct list_head *first;
233 if (!list_empty(head)) {
235 list_move_tail(first, head);
240 * list_is_singular - tests whether a list has just one entry.
241 * @head: the list to test.
243 static inline int list_is_singular(const struct list_head *head)
245 return !list_empty(head) && (head->next == head->prev);
248 static inline void __list_cut_position(struct list_head *list,
249 struct list_head *head, struct list_head *entry)
251 struct list_head *new_first = entry->next;
252 list->next = head->next;
253 list->next->prev = list;
256 head->next = new_first;
257 new_first->prev = head;
261 * list_cut_position - cut a list into two
262 * @list: a new list to add all removed entries
263 * @head: a list with entries
264 * @entry: an entry within head, could be the head itself
265 * and if so we won't cut the list
267 * This helper moves the initial part of @head, up to and
268 * including @entry, from @head to @list. You should
269 * pass on @entry an element you know is on @head. @list
270 * should be an empty list or a list you do not care about
274 static inline void list_cut_position(struct list_head *list,
275 struct list_head *head, struct list_head *entry)
277 if (list_empty(head))
279 if (list_is_singular(head) &&
280 (head->next != entry && head != entry))
283 INIT_LIST_HEAD(list);
285 __list_cut_position(list, head, entry);
289 * list_cut_before - cut a list into two, before given entry
290 * @list: a new list to add all removed entries
291 * @head: a list with entries
292 * @entry: an entry within head, could be the head itself
294 * This helper moves the initial part of @head, up to but
295 * excluding @entry, from @head to @list. You should pass
296 * in @entry an element you know is on @head. @list should
297 * be an empty list or a list you do not care about losing
299 * If @entry == @head, all entries on @head are moved to
302 static inline void list_cut_before(struct list_head *list,
303 struct list_head *head,
304 struct list_head *entry)
306 if (head->next == entry) {
307 INIT_LIST_HEAD(list);
310 list->next = head->next;
311 list->next->prev = list;
312 list->prev = entry->prev;
313 list->prev->next = list;
318 static inline void __list_splice(const struct list_head *list,
319 struct list_head *prev,
320 struct list_head *next)
322 struct list_head *first = list->next;
323 struct list_head *last = list->prev;
333 * list_splice - join two lists, this is designed for stacks
334 * @list: the new list to add.
335 * @head: the place to add it in the first list.
337 static inline void list_splice(const struct list_head *list,
338 struct list_head *head)
340 if (!list_empty(list))
341 __list_splice(list, head, head->next);
345 * list_splice_tail - join two lists, each list being a queue
346 * @list: the new list to add.
347 * @head: the place to add it in the first list.
349 static inline void list_splice_tail(struct list_head *list,
350 struct list_head *head)
352 if (!list_empty(list))
353 __list_splice(list, head->prev, head);
357 * list_splice_init - join two lists and reinitialise the emptied list.
358 * @list: the new list to add.
359 * @head: the place to add it in the first list.
361 * The list at @list is reinitialised
363 static inline void list_splice_init(struct list_head *list,
364 struct list_head *head)
366 if (!list_empty(list)) {
367 __list_splice(list, head, head->next);
368 INIT_LIST_HEAD(list);
373 * list_splice_tail_init - join two lists and reinitialise the emptied list
374 * @list: the new list to add.
375 * @head: the place to add it in the first list.
377 * Each of the lists is a queue.
378 * The list at @list is reinitialised
380 static inline void list_splice_tail_init(struct list_head *list,
381 struct list_head *head)
383 if (!list_empty(list)) {
384 __list_splice(list, head->prev, head);
385 INIT_LIST_HEAD(list);
390 * list_entry - get the struct for this entry
391 * @ptr: the &struct list_head pointer.
392 * @type: the type of the struct this is embedded in.
393 * @member: the name of the list_head within the struct.
395 #define list_entry(ptr, type, member) \
396 container_of(ptr, type, member)
399 * list_first_entry - get the first element from a list
400 * @ptr: the list head to take the element from.
401 * @type: the type of the struct this is embedded in.
402 * @member: the name of the list_head within the struct.
404 * Note, that list is expected to be not empty.
406 #define list_first_entry(ptr, type, member) \
407 list_entry((ptr)->next, type, member)
410 * list_last_entry - get the last element from a list
411 * @ptr: the list head to take the element from.
412 * @type: the type of the struct this is embedded in.
413 * @member: the name of the list_head within the struct.
415 * Note, that list is expected to be not empty.
417 #define list_last_entry(ptr, type, member) \
418 list_entry((ptr)->prev, type, member)
421 * list_first_entry_or_null - get the first element from a list
422 * @ptr: the list head to take the element from.
423 * @type: the type of the struct this is embedded in.
424 * @member: the name of the list_head within the struct.
426 * Note that if the list is empty, it returns NULL.
428 #define list_first_entry_or_null(ptr, type, member) ({ \
429 struct list_head *head__ = (ptr); \
430 struct list_head *pos__ = READ_ONCE(head__->next); \
431 pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
435 * list_next_entry - get the next element in list
436 * @pos: the type * to cursor
437 * @member: the name of the list_head within the struct.
439 #define list_next_entry(pos, member) \
440 list_entry((pos)->member.next, typeof(*(pos)), member)
443 * list_prev_entry - get the prev element in list
444 * @pos: the type * to cursor
445 * @member: the name of the list_head within the struct.
447 #define list_prev_entry(pos, member) \
448 list_entry((pos)->member.prev, typeof(*(pos)), member)
451 * list_for_each - iterate over a list
452 * @pos: the &struct list_head to use as a loop cursor.
453 * @head: the head for your list.
455 #define list_for_each(pos, head) \
456 for (pos = (head)->next; pos != (head); pos = pos->next)
459 * list_for_each_prev - iterate over a list backwards
460 * @pos: the &struct list_head to use as a loop cursor.
461 * @head: the head for your list.
463 #define list_for_each_prev(pos, head) \
464 for (pos = (head)->prev; pos != (head); pos = pos->prev)
467 * list_for_each_safe - iterate over a list safe against removal of list entry
468 * @pos: the &struct list_head to use as a loop cursor.
469 * @n: another &struct list_head to use as temporary storage
470 * @head: the head for your list.
472 #define list_for_each_safe(pos, n, head) \
473 for (pos = (head)->next, n = pos->next; pos != (head); \
474 pos = n, n = pos->next)
477 * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
478 * @pos: the &struct list_head to use as a loop cursor.
479 * @n: another &struct list_head to use as temporary storage
480 * @head: the head for your list.
482 #define list_for_each_prev_safe(pos, n, head) \
483 for (pos = (head)->prev, n = pos->prev; \
485 pos = n, n = pos->prev)
488 * list_entry_is_head - test if the entry points to the head of the list
489 * @pos: the type * to cursor
490 * @head: the head for your list.
491 * @member: the name of the list_head within the struct.
493 #define list_entry_is_head(pos, head, member) \
494 (&pos->member == (head))
497 * list_for_each_entry - iterate over list of given type
498 * @pos: the type * to use as a loop cursor.
499 * @head: the head for your list.
500 * @member: the name of the list_head within the struct.
502 #define list_for_each_entry(pos, head, member) \
503 for (pos = list_first_entry(head, typeof(*pos), member); \
504 !list_entry_is_head(pos, head, member); \
505 pos = list_next_entry(pos, member))
508 * list_for_each_entry_reverse - iterate backwards over list of given type.
509 * @pos: the type * to use as a loop cursor.
510 * @head: the head for your list.
511 * @member: the name of the list_head within the struct.
513 #define list_for_each_entry_reverse(pos, head, member) \
514 for (pos = list_last_entry(head, typeof(*pos), member); \
515 !list_entry_is_head(pos, head, member); \
516 pos = list_prev_entry(pos, member))
519 * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
520 * @pos: the type * to use as a start point
521 * @head: the head of the list
522 * @member: the name of the list_head within the struct.
524 * Prepares a pos entry for use as a start point in list_for_each_entry_continue().
526 #define list_prepare_entry(pos, head, member) \
527 ((pos) ? : list_entry(head, typeof(*pos), member))
530 * list_for_each_entry_continue - continue iteration over list of given type
531 * @pos: the type * to use as a loop cursor.
532 * @head: the head for your list.
533 * @member: the name of the list_head within the struct.
535 * Continue to iterate over list of given type, continuing after
536 * the current position.
538 #define list_for_each_entry_continue(pos, head, member) \
539 for (pos = list_next_entry(pos, member); \
540 !list_entry_is_head(pos, head, member); \
541 pos = list_next_entry(pos, member))
544 * list_for_each_entry_continue_reverse - iterate backwards from the given point
545 * @pos: the type * to use as a loop cursor.
546 * @head: the head for your list.
547 * @member: the name of the list_head within the struct.
549 * Start to iterate over list of given type backwards, continuing after
550 * the current position.
552 #define list_for_each_entry_continue_reverse(pos, head, member) \
553 for (pos = list_prev_entry(pos, member); \
554 !list_entry_is_head(pos, head, member); \
555 pos = list_prev_entry(pos, member))
558 * list_for_each_entry_from - iterate over list of given type from the current point
559 * @pos: the type * to use as a loop cursor.
560 * @head: the head for your list.
561 * @member: the name of the list_head within the struct.
563 * Iterate over list of given type, continuing from current position.
565 #define list_for_each_entry_from(pos, head, member) \
566 for (; !list_entry_is_head(pos, head, member); \
567 pos = list_next_entry(pos, member))
570 * list_for_each_entry_from_reverse - iterate backwards over list of given type
571 * from the current point
572 * @pos: the type * to use as a loop cursor.
573 * @head: the head for your list.
574 * @member: the name of the list_head within the struct.
576 * Iterate backwards over list of given type, continuing from current position.
578 #define list_for_each_entry_from_reverse(pos, head, member) \
579 for (; !list_entry_is_head(pos, head, member); \
580 pos = list_prev_entry(pos, member))
583 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
584 * @pos: the type * to use as a loop cursor.
585 * @n: another type * to use as temporary storage
586 * @head: the head for your list.
587 * @member: the name of the list_head within the struct.
589 #define list_for_each_entry_safe(pos, n, head, member) \
590 for (pos = list_first_entry(head, typeof(*pos), member), \
591 n = list_next_entry(pos, member); \
592 !list_entry_is_head(pos, head, member); \
593 pos = n, n = list_next_entry(n, member))
596 * list_for_each_entry_safe_continue - continue list iteration safe against removal
597 * @pos: the type * to use as a loop cursor.
598 * @n: another type * to use as temporary storage
599 * @head: the head for your list.
600 * @member: the name of the list_head within the struct.
602 * Iterate over list of given type, continuing after current point,
603 * safe against removal of list entry.
605 #define list_for_each_entry_safe_continue(pos, n, head, member) \
606 for (pos = list_next_entry(pos, member), \
607 n = list_next_entry(pos, member); \
608 !list_entry_is_head(pos, head, member); \
609 pos = n, n = list_next_entry(n, member))
612 * list_for_each_entry_safe_from - iterate over list from current point safe against removal
613 * @pos: the type * to use as a loop cursor.
614 * @n: another type * to use as temporary storage
615 * @head: the head for your list.
616 * @member: the name of the list_head within the struct.
618 * Iterate over list of given type from current point, safe against
619 * removal of list entry.
621 #define list_for_each_entry_safe_from(pos, n, head, member) \
622 for (n = list_next_entry(pos, member); \
623 !list_entry_is_head(pos, head, member); \
624 pos = n, n = list_next_entry(n, member))
627 * list_for_each_entry_safe_reverse - iterate backwards over list safe against removal
628 * @pos: the type * to use as a loop cursor.
629 * @n: another type * to use as temporary storage
630 * @head: the head for your list.
631 * @member: the name of the list_head within the struct.
633 * Iterate backwards over list of given type, safe against removal
636 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
637 for (pos = list_last_entry(head, typeof(*pos), member), \
638 n = list_prev_entry(pos, member); \
639 !list_entry_is_head(pos, head, member); \
640 pos = n, n = list_prev_entry(n, member))
643 * list_safe_reset_next - reset a stale list_for_each_entry_safe loop
644 * @pos: the loop cursor used in the list_for_each_entry_safe loop
645 * @n: temporary storage used in list_for_each_entry_safe
646 * @member: the name of the list_head within the struct.
648 * list_safe_reset_next is not safe to use in general if the list may be
649 * modified concurrently (eg. the lock is dropped in the loop body). An
650 * exception to this is if the cursor element (pos) is pinned in the list,
651 * and list_safe_reset_next is called after re-taking the lock and before
652 * completing the current iteration of the loop body.
654 #define list_safe_reset_next(pos, n, member) \
655 n = list_next_entry(pos, member)
658 * Double linked lists with a single pointer list head.
659 * Mostly useful for hash tables where the two pointer list head is
661 * You lose the ability to access the tail in O(1).
664 #define HLIST_HEAD_INIT { .first = NULL }
665 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
666 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
667 static inline void INIT_HLIST_NODE(struct hlist_node *h)
673 static inline int hlist_unhashed(const struct hlist_node *h)
678 static inline int hlist_empty(const struct hlist_head *h)
680 return !READ_ONCE(h->first);
683 static inline void __hlist_del(struct hlist_node *n)
685 struct hlist_node *next = n->next;
686 struct hlist_node **pprev = n->pprev;
688 WRITE_ONCE(*pprev, next);
693 static inline void hlist_del(struct hlist_node *n)
696 n->next = LIST_POISON1;
697 n->pprev = LIST_POISON2;
700 static inline void hlist_del_init(struct hlist_node *n)
702 if (!hlist_unhashed(n)) {
708 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
710 struct hlist_node *first = h->first;
713 first->pprev = &n->next;
714 WRITE_ONCE(h->first, n);
715 n->pprev = &h->first;
718 /* next must be != NULL */
719 static inline void hlist_add_before(struct hlist_node *n,
720 struct hlist_node *next)
722 n->pprev = next->pprev;
724 next->pprev = &n->next;
725 WRITE_ONCE(*(n->pprev), n);
728 static inline void hlist_add_behind(struct hlist_node *n,
729 struct hlist_node *prev)
731 n->next = prev->next;
732 WRITE_ONCE(prev->next, n);
733 n->pprev = &prev->next;
736 n->next->pprev = &n->next;
739 /* after that we'll appear to be on some hlist and hlist_del will work */
740 static inline void hlist_add_fake(struct hlist_node *n)
745 static inline bool hlist_fake(struct hlist_node *h)
747 return h->pprev == &h->next;
751 * Check whether the node is the only node of the head without
755 hlist_is_singular_node(struct hlist_node *n, struct hlist_head *h)
757 return !n->next && n->pprev == &h->first;
761 * Move a list from one list head to another. Fixup the pprev
762 * reference of the first entry if it exists.
764 static inline void hlist_move_list(struct hlist_head *old,
765 struct hlist_head *new)
767 new->first = old->first;
769 new->first->pprev = &new->first;
773 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
775 #define hlist_for_each(pos, head) \
776 for (pos = (head)->first; pos ; pos = pos->next)
778 #define hlist_for_each_safe(pos, n, head) \
779 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
782 #define hlist_entry_safe(ptr, type, member) \
783 ({ typeof(ptr) ____ptr = (ptr); \
784 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
788 * hlist_for_each_entry - iterate over list of given type
789 * @pos: the type * to use as a loop cursor.
790 * @head: the head for your list.
791 * @member: the name of the hlist_node within the struct.
793 #define hlist_for_each_entry(pos, head, member) \
794 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
796 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
799 * hlist_for_each_entry_continue - iterate over a hlist continuing after current point
800 * @pos: the type * to use as a loop cursor.
801 * @member: the name of the hlist_node within the struct.
803 #define hlist_for_each_entry_continue(pos, member) \
804 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
806 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
809 * hlist_for_each_entry_from - iterate over a hlist continuing from current point
810 * @pos: the type * to use as a loop cursor.
811 * @member: the name of the hlist_node within the struct.
813 #define hlist_for_each_entry_from(pos, member) \
815 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
818 * hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
819 * @pos: the type * to use as a loop cursor.
820 * @n: another &struct hlist_node to use as temporary storage
821 * @head: the head for your list.
822 * @member: the name of the hlist_node within the struct.
824 #define hlist_for_each_entry_safe(pos, n, head, member) \
825 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
826 pos && ({ n = pos->member.next; 1; }); \
827 pos = hlist_entry_safe(n, typeof(*pos), member))