include/linux/llist.h

35  * The list entries deleted via llist_del_all can be traversed with
37  * entries can not be traversed safely before deleted from the list.
38  * The order of deleted entries is from the newest to the oldest added
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
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
122  * @node:	the first entry of deleted list entries
124  * In general, some entries of the lock-less list can be traversed
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
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
161  * @node:	the first entry of deleted list entries.
164  * In general, some entries of the lock-less list can be traversed
168  * If being used on entries deleted from lock-less list directly, the
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
217  * return the pointer to the first entry.  The order of entries