Lines Matching refs:prev

38 	WRITE_ONCE(list->prev, list);  in INIT_LIST_HEAD()
43 struct list_head *prev,
48 struct list_head *prev, in __list_add_valid() argument
66 struct list_head *prev, in __list_add() argument
69 if (!__list_add_valid(new, prev, next)) in __list_add()
72 next->prev = new; in __list_add()
74 new->prev = prev; in __list_add()
75 WRITE_ONCE(prev->next, new); in __list_add()
102 __list_add(new, head->prev, head); in list_add_tail()
112 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
114 next->prev = prev; in __list_del()
115 WRITE_ONCE(prev->next, next); in __list_del()
128 __list_del(entry->prev, entry->next); in __list_del_clearprev()
129 entry->prev = NULL; in __list_del_clearprev()
137 __list_del(entry->prev, entry->next); in __list_del_entry()
150 entry->prev = LIST_POISON2; in list_del()
164 new->next->prev = new; in list_replace()
165 new->prev = old->prev; in list_replace()
166 new->prev->next = new; in list_replace()
191 struct list_head *pos = entry2->prev; in list_swap()
246 first->prev->next = last->next; in list_bulk_move_tail()
247 last->next->prev = first->prev; in list_bulk_move_tail()
249 head->prev->next = first; in list_bulk_move_tail()
250 first->prev = head->prev; in list_bulk_move_tail()
253 head->prev = last; in list_bulk_move_tail()
263 return list->prev == head; in list_is_first()
309 WRITE_ONCE(entry->prev, entry); in list_del_init_careful()
329 return list_is_head(next, head) && (next == READ_ONCE(head->prev)); in list_empty_careful()
370 return !list_empty(head) && (head->next == head->prev); in list_is_singular()
378 list->next->prev = list; in __list_cut_position()
379 list->prev = entry; in __list_cut_position()
382 new_first->prev = head; in __list_cut_position()
435 list->next->prev = list; in list_cut_before()
436 list->prev = entry->prev; in list_cut_before()
437 list->prev->next = list; in list_cut_before()
439 entry->prev = head; in list_cut_before()
443 struct list_head *prev, in __list_splice() argument
447 struct list_head *last = list->prev; in __list_splice()
449 first->prev = prev; in __list_splice()
450 prev->next = first; in __list_splice()
453 next->prev = last; in __list_splice()
477 __list_splice(list, head->prev, head); in list_splice_tail()
508 __list_splice(list, head->prev, head); in list_splice_tail_init()
542 list_entry((ptr)->prev, type, member)
585 list_entry((pos)->member.prev, typeof(*(pos)), member)
634 for (pos = (head)->prev; !list_is_head(pos, (head)); pos = pos->prev)
654 for (pos = (head)->prev, n = pos->prev; \
656 pos = n, n = pos->prev)
955 struct hlist_node *prev) in hlist_add_behind() argument
957 WRITE_ONCE(n->next, prev->next); in hlist_add_behind()
958 WRITE_ONCE(prev->next, n); in hlist_add_behind()
959 WRITE_ONCE(n->pprev, &prev->next); in hlist_add_behind()