Lines Matching refs:list
8 * struct list_head to provide explicit list "head" (struct klist) and list
10 * included that protects access to the actual list itself. struct
13 * in the list.
15 * The entire point is to provide an interface for iterating over a list
16 * that is safe and allows for modification of the list during the
18 * current node on the list.
22 * next element in the list. It returns NULL if there are no more items.
29 * Only when the count goes to 0 is the node removed from the list.
30 * klist_remove() will try to delete the node from the list and block until
174 struct list_head list;
191 list_for_each_entry_safe(waiter, tmp, &klist_remove_waiters, list) {
195 list_del(&waiter->list);
246 list_add(&waiter.list, &klist_remove_waiters);
262 * klist_node_attached - Say whether a node is bound to a list or not.
278 * instead of with the list head.
295 * Similar to klist_iter_init_node(), but start with the list head.
304 * klist_iter_exit - Finish a list iteration.
307 * Must be called when done iterating over list, as it decrements the
309 * the end of the list was reached, and always good form.
326 * klist_prev - Ante up prev node in list.
329 * First grab list lock. Decrement the reference count of the previous
368 * klist_next - Ante up next node in list.
371 * First grab list lock. Decrement the reference count of the previous