86 	struct list_head *prev;  member
94 	list->next = list->prev = list;  in INIT_LIST_HEAD()
109 	return ((next == head) && (next == head->prev));  in list_empty_careful()
113 __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
115 	next->prev = prev;  in __list_del()
116 	WRITE_ONCE(prev->next, next);  in __list_del()
123 	__list_del(entry->prev, entry->next);  in __list_del_entry()
130 	__list_del(entry->prev, entry->next);  in list_del()
137 	new->next->prev = new;  in list_replace()
138 	new->prev = old->prev;  in list_replace()
139 	new->prev->next = new;  in list_replace()
150 linux_list_add(struct list_head *new, struct list_head *prev,  in linux_list_add()  argument
154 	next->prev = new;  in linux_list_add()
156 	new->prev = prev;  in linux_list_add()
157 	prev->next = new;  in linux_list_add()
174 	list_entry((ptr)->prev, type, member)
186 	list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
217 	for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
218 	    p = list_entry((p)->field.prev, typeof(*p), field))
221 	for (p = list_entry((h)->prev, typeof(*p), field),		\
222 	    n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
223 	    p = n, n = list_entry(n->field.prev, typeof(*n), field))
226 	for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
227 	    p = list_entry((p)->field.prev, typeof(*p), field))
229 #define	list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
246 	linux_list_add(new, head->prev, head);  in list_add_tail()
269 	first->prev->next = last->next;  in list_bulk_move_tail()
270 	last->next->prev = first->prev;  in list_bulk_move_tail()
271 	head->prev->next = first;  in list_bulk_move_tail()
272 	first->prev = head->prev;  in list_bulk_move_tail()
274 	head->prev = last;  in list_bulk_move_tail()
278 linux_list_splice(const struct list_head *list, struct list_head *prev,  in linux_list_splice()  argument
287 	last = list->prev;  in linux_list_splice()
288 	first->prev = prev;  in linux_list_splice()
289 	prev->next = first;  in linux_list_splice()
291 	next->prev = last;  in linux_list_splice()
305 	linux_list_splice(list, head->prev, head);  in list_splice_tail()
320 	linux_list_splice(list, head->prev, head);  in list_splice_tail_init()
400 hlist_add_behind(struct hlist_node *n, struct hlist_node *prev)  in hlist_add_behind()  argument
403 	n->next = prev->next;  in hlist_add_behind()
404 	WRITE_ONCE(prev->next, n);  in hlist_add_behind()
405 	n->pprev = &prev->next;  in hlist_add_behind()
423 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
431 	list->next->prev = list;  in __list_cut_position()
432 	list->prev = entry;  in __list_cut_position()
435 	new_first->prev = head;  in __list_cut_position()