47 	struct list_head *prev;  member
75 	list->next = list->prev = list;  in INIT_LIST_HEAD()
90 	return ((next == head) && (next == head->prev));  in list_empty_careful()
94 __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
96 	next->prev = prev;  in __list_del()
97 	WRITE_ONCE(prev->next, next);  in __list_del()
104 	__list_del(entry->prev, entry->next);  in __list_del_entry()
111 	__list_del(entry->prev, entry->next);  in list_del()
118 	new->next->prev = new;  in list_replace()
119 	new->prev = old->prev;  in list_replace()
120 	new->prev->next = new;  in list_replace()
131 linux_list_add(struct list_head *new, struct list_head *prev,  in linux_list_add()  argument
135 	next->prev = new;  in linux_list_add()
137 	new->prev = prev;  in linux_list_add()
138 	prev->next = new;  in linux_list_add()
155 	list_entry((ptr)->prev, type, member)
167 	list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
198 	for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
199 	    p = list_entry((p)->field.prev, typeof(*p), field))
202 	for (p = list_entry((h)->prev, typeof(*p), field),		\
203 	    n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
204 	    p = n, n = list_entry(n->field.prev, typeof(*n), field))
207 	for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
208 	    p = list_entry((p)->field.prev, typeof(*p), field))
210 #define	list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)
223 	linux_list_add(new, head->prev, head);  in list_add_tail()
243 linux_list_splice(const struct list_head *list, struct list_head *prev,  in linux_list_splice()  argument
252 	last = list->prev;  in linux_list_splice()
253 	first->prev = prev;  in linux_list_splice()
254 	prev->next = first;  in linux_list_splice()
256 	next->prev = last;  in linux_list_splice()
270 	linux_list_splice(list, head->prev, head);  in list_splice_tail()
285 	linux_list_splice(list, head->prev, head);  in list_splice_tail_init()
387 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
395 	list->next->prev = list;  in __list_cut_position()
396 	list->prev = entry;  in __list_cut_position()
399 	new_first->prev = head;  in __list_cut_position()