Lines Matching full:entries

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
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
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
124  * @node:	the first entry of deleted list entries
126  * In general, some entries of the lock-less list can be traversed
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
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
163  * @node:	the first entry of deleted list entries.
166  * In general, some entries of the lock-less list can be traversed
170  * If being used on entries deleted from lock-less list directly, the
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
234  * return the pointer to the first entry.  The order of entries