Lines Matching full:list

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()
77  * init_llist_node - initialize lock-less list node
81  * a list or not, this initialises the node to clearly
82  * not be on any list.
90  * llist_on_list - test if a lock-list list node is on a list
93  * When a node is on a list the ->next pointer will be NULL or
95  * in init_llist_node() to record that a node is not on any list,
96  * and here to test whether it is on any list.
130  * llist_for_each - iterate over some deleted entries of a lock-less list
132  * @node:	the first entry of deleted list entries
134  * In general, some entries of the lock-less list can be traversed
135  * safely only after being deleted from list, so start with an entry
136  * instead of list head.
138  * If being used on entries deleted from lock-less list directly, the
147  * llist_for_each_safe - iterate over some deleted entries of a lock-less list
148  *			 safe against removal of list entry
151  * @node:	the first entry of deleted list entries
153  * In general, some entries of the lock-less list can be traversed
154  * safely only after being deleted from list, so start with an entry
155  * instead of list head.
157  * If being used on entries deleted from lock-less list directly, the
166  * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
168  * @node:	the fist entry of deleted list entries.
171  * In general, some entries of the lock-less list can be traversed
172  * safely only after being removed from list, so start with an entry
173  * instead of list head.
175  * If being used on entries deleted from lock-less list directly, the
186  * llist_for_each_entry_safe - iterate over some deleted entries of lock-less list of given type
187  *			       safe against removal of list entry
190  * @node:	the first entry of deleted list entries.
193  * In general, some entries of the lock-less list can be traversed
194  * safely only after being removed from list, so start with an entry
195  * instead of list head.
197  * If being used on entries deleted from lock-less list directly, the
209  * llist_empty - tests whether a lock-less list is empty
210  * @head:	the list to test
213  * test whether the list is empty without deleting something from the
214  * list.
242  * @head:	the head for your lock-less list
244  * Returns true if the list was empty prior to adding this entry.
257  * llist_del_all - delete all entries from lock-less list
258  * @head:	the head of lock-less list to delete all entries
260  * If list is empty, return NULL, otherwise, delete all entries and
280  * llist_del_first_init - delete first entry from lock-list and mark is as being off-list
281  * @head:	the head of lock-less list to delete from.