Lines Matching full:first

20  * @new_first:	first entry in batch to be added
29 	struct llist_node *first;  in llist_add_batch()  local
32 		new_last->next = first = READ_ONCE(head->first);  in llist_add_batch()
33 	} while (cmpxchg(&head->first, first, new_first) != first);  in llist_add_batch()
35 	return !first;  in llist_add_batch()
40  * llist_del_first - delete the first entry of lock-less list
43  * If list is empty, return NULL, otherwise, return the first entry
49  * llist_add) sequence in another user may change @head->first->next,
50  * but keep @head->first.  If multiple consumers are needed, please
57 	entry = smp_load_acquire(&head->first);  in llist_del_first()
63 		entry = cmpxchg(&head->first, old_entry, next);  in llist_del_first()
74  * @head:	first item of the list to be reversed
77  * new first entry.