include/linux/llist.h

5  * Lock-less NULL terminated single linked list
16  * needed.  This is because llist_del_first depends on list->first->next not
19  * preempted back, the list->first is the same as before causing the cmpxchg in
35  * The list entries deleted via llist_del_all can be traversed with
36  * traversing function such as llist_for_each etc.  But the list
37  * entries can not be traversed safely before deleted from the list.
42  * The basic atomic operation of this list is cmpxchg on long.  On
44  * list can NOT be used in NMI handlers.  So code that uses the list in
68  * init_llist_head - initialize lock-less list head
69  * @head:	the head for your lock-less list
71 static inline void init_llist_head(struct llist_head *list)  in init_llist_head()  argument
73 	list->first = NULL;  in init_llist_head()
103  * llist_for_each - iterate over some deleted entries of a lock-less list
105  * @node:	the first entry of deleted list entries
107  * In general, some entries of the lock-less list can be traversed
108  * safely only after being deleted from list, so start with an entry
109  * instead of list head.
111  * If being used on entries deleted from lock-less list directly, the
120  * llist_for_each_safe - iterate over some deleted entries of a lock-less list
121  *			 safe against removal of list entry
124  * @node:	the first entry of deleted list entries
126  * In general, some entries of the lock-less list can be traversed
127  * safely only after being deleted from list, so start with an entry
128  * instead of list head.
130  * If being used on entries deleted from lock-less list directly, the
139  * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
141  * @node:	the fist entry of deleted list entries.
144  * In general, some entries of the lock-less list can be traversed
145  * safely only after being removed from list, so start with an entry
146  * instead of list head.
148  * If being used on entries deleted from lock-less list directly, the
159  * llist_for_each_entry_safe - iterate over some deleted entries of lock-less list of given type
160  *			       safe against removal of list entry
163  * @node:	the first entry of deleted list entries.
166  * In general, some entries of the lock-less list can be traversed
167  * safely only after being removed from list, so start with an entry
168  * instead of list head.
170  * If being used on entries deleted from lock-less list directly, the
182  * llist_empty - tests whether a lock-less list is empty
183  * @head:	the list to test
186  * test whether the list is empty without deleting something from the
187  * list.
215  * @head:	the head for your lock-less list
217  * Returns true if the list was empty prior to adding this entry.
230  * llist_del_all - delete all entries from lock-less list
231  * @head:	the head of lock-less list to delete all entries
233  * If list is empty, return NULL, otherwise, delete all entries and