93 	struct list_head *prev;  member
101 	list->next = list->prev = list;  in INIT_LIST_HEAD()
116 	return ((next == head) && (next == head->prev));  in list_empty_careful()
120 __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
122 	next->prev = prev;  in __list_del()
123 	WRITE_ONCE(prev->next, next);  in __list_del()
130 	__list_del(entry->prev, entry->next);  in __list_del_entry()
137 	__list_del(entry->prev, entry->next);  in list_del()
144 	new->next->prev = new;  in list_replace()
145 	new->prev = old->prev;  in list_replace()
146 	new->prev->next = new;  in list_replace()
157 linux_list_add(struct list_head *new, struct list_head *prev,  in linux_list_add()  argument
161 	next->prev = new;  in linux_list_add()
163 	new->prev = prev;  in linux_list_add()
164 	prev->next = new;  in linux_list_add()
181 	list_entry((ptr)->prev, type, member)
193 	list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
224 	for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
225 	    p = list_entry((p)->field.prev, typeof(*p), field))
228 	for (p = list_entry((h)->prev, typeof(*p), field),		\
229 	    n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
230 	    p = n, n = list_entry(n->field.prev, typeof(*n), field))
233 	for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
234 	    p = list_entry((p)->field.prev, typeof(*p), field))
236 #define	list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
253 	linux_list_add(new, head->prev, head);  in list_add_tail()
283 	first->prev->next = last->next;  in list_bulk_move_tail()
284 	last->next->prev = first->prev;  in list_bulk_move_tail()
285 	head->prev->next = first;  in list_bulk_move_tail()
286 	first->prev = head->prev;  in list_bulk_move_tail()
288 	head->prev = last;  in list_bulk_move_tail()
292 linux_list_splice(const struct list_head *list, struct list_head *prev,  in linux_list_splice()  argument
301 	last = list->prev;  in linux_list_splice()
302 	first->prev = prev;  in linux_list_splice()
303 	prev->next = first;  in linux_list_splice()
305 	next->prev = last;  in linux_list_splice()
319 	linux_list_splice(list, head->prev, head);  in list_splice_tail()
334 	linux_list_splice(list, head->prev, head);  in list_splice_tail_init()
412 hlist_add_behind(struct hlist_node *n, struct hlist_node *prev)  in hlist_add_behind()  argument
415 	n->next = prev->next;  in hlist_add_behind()
416 	WRITE_ONCE(prev->next, n);  in hlist_add_behind()
417 	n->pprev = &prev->next;  in hlist_add_behind()
435 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
443 	list->next->prev = list;  in __list_cut_position()
444 	list->prev = entry;  in __list_cut_position()
447 	new_first->prev = head;  in __list_cut_position()
468 	return (list->prev == head);  in list_is_first()