Lines Matching refs:prev
25 WRITE_ONCE(list->prev, list);
35 * list_tail_rcu - returns the prev pointer of the head of the list
42 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev)))
74 * the prev/next entries already!
77 struct list_head *prev, struct list_head *next)
79 if (!__list_add_valid(new, prev, next))
83 new->prev = prev;
84 rcu_assign_pointer(list_next_rcu(prev), new);
85 next->prev = new;
128 __list_add_rcu(new, head->prev, head);
158 entry->prev = LIST_POISON2;
201 new->prev = old->prev;
202 rcu_assign_pointer(list_next_rcu(new->prev), new);
203 new->next->prev = new;
204 old->prev = LIST_POISON2;
210 * @prev: points to the last element of the existing list
214 * The list pointed to by @prev and @next can be RCU-read traversed
227 struct list_head *prev,
232 struct list_head *last = list->prev;
257 * permitted to traverse the prev pointers without excluding
262 rcu_assign_pointer(list_next_rcu(prev), first);
263 first->prev = prev;
264 next->prev = last;
294 __list_splice_init_rcu(list, head->prev, head, sync);
663 * @prev: the existing element to add the new element after.
679 struct hlist_node *prev)
681 n->next = prev->next;
682 WRITE_ONCE(n->pprev, &prev->next);
683 rcu_assign_pointer(hlist_next_rcu(prev), n);