Lines Matching full:first

32  * @new_first:	first entry in batch to be added
41 	struct llist_node *first;  in llist_add_batch()  local
44 		new_last->next = first = READ_ONCE(head->first);  in llist_add_batch()
45 	} while (cmpxchg(&head->first, first, new_first) != first);  in llist_add_batch()
47 	return !first;  in llist_add_batch()
52  * llist_del_first - delete the first entry of lock-less list
55  * If list is empty, return NULL, otherwise, return the first entry
61  * llist_add) sequence in another user may change @head->first->next,
62  * but keep @head->first.  If multiple consumers are needed, please
69 	entry = smp_load_acquire(&head->first);  in llist_del_first()
75 		entry = cmpxchg(&head->first, old_entry, next);  in llist_del_first()
86  * @head:	first item of the list to be reversed
89  * new first entry.