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
66  * init_llist_head - initialize lock-less list head
67  * @head:	the head for your lock-less list
69 static inline void init_llist_head(struct llist_head *list)  in init_llist_head()  argument
71 	list->first = NULL;  in init_llist_head()
101  * llist_for_each - iterate over some deleted entries of a lock-less list
103  * @node:	the first entry of deleted list entries
105  * In general, some entries of the lock-less list can be traversed
106  * safely only after being deleted from list, so start with an entry
107  * instead of list head.
109  * If being used on entries deleted from lock-less list directly, the
118  * llist_for_each_safe - iterate over some deleted entries of a lock-less list
119  *			 safe against removal of list entry
122  * @node:	the first entry of deleted list entries
124  * In general, some entries of the lock-less list can be traversed
125  * safely only after being deleted from list, so start with an entry
126  * instead of list head.
128  * If being used on entries deleted from lock-less list directly, the
137  * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
139  * @node:	the fist entry of deleted list entries.
142  * In general, some entries of the lock-less list can be traversed
143  * safely only after being removed from list, so start with an entry
144  * instead of list head.
146  * If being used on entries deleted from lock-less list directly, the
157  * llist_for_each_entry_safe - iterate over some deleted entries of lock-less list of given type
158  *			       safe against removal of list entry
161  * @node:	the first entry of deleted list entries.
164  * In general, some entries of the lock-less list can be traversed
165  * safely only after being removed from list, so start with an entry
166  * instead of list head.
168  * If being used on entries deleted from lock-less list directly, the
180  * llist_empty - tests whether a lock-less list is empty
181  * @head:	the list to test
184  * test whether the list is empty without deleting something from the
185  * list.
203  * @head:	the head for your lock-less list
205  * Returns true if the list was empty prior to adding this entry.
213  * llist_del_all - delete all entries from lock-less list
214  * @head:	the head of lock-less list to delete all entries
216  * If list is empty, return NULL, otherwise, delete all entries and