Lines Matching defs:first
815 * the first pending barrier.
861 struct llist_node *first = NULL, *last = NULL;
879 struct llist_node *prev = first;
913 first = barrier_to_ll(node);
914 first->next = prev;
916 last = first;
921 llist_add_batch(first, last, &ref->preallocated_barriers);
926 while (first) {
927 struct active_node *node = barrier_from_ll(first);
929 first = first->next;
1045 * first, so if we succeed and pass it back to our user then it is not
1061 * then it has locked C first (before B).
1072 * A does the cmpxchg first, and so it sees C or NULL, as before, or
1098 * and we know that we are first on the timeline. If it is still