46 	struct list_head *next;  member
75 	list->next = list->prev = list;  in INIT_LIST_HEAD()
82 	return (head->next == head);  in list_empty()
88 	struct list_head *next = head->next;  in list_empty_careful()  local
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()
117 	new->next = old->next;  in list_replace()
118 	new->next->prev = new;  in list_replace()
120 	new->prev->next = new;  in list_replace()
132     struct list_head *next)  in linux_list_add()  argument
135 	next->prev = new;  in linux_list_add()
136 	new->next = next;  in linux_list_add()
138 	prev->next = new;  in linux_list_add()
152 	list_entry((ptr)->next, type, member)
161 	list_entry(((ptr)->member.next), typeof(*(ptr)), member)
170 	for (p = (head)->next; p != (head); p = (p)->next)
173 	for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
176 	for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
177 	    p = list_entry((p)->field.next, typeof(*p), field))
180 	for (p = list_entry((h)->next, typeof(*p), field),		\
181 	    n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
182 	    p = n, n = list_entry(n->field.next, typeof(*n), field))
186 	    p = list_entry((p)->field.next, typeof(*p), field))
193 	for (n = list_entry((pos)->member.next, typeof(*pos), member);		\
195 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
216 	linux_list_add(new, head, head->next);  in list_add()
244     struct list_head *next)  in linux_list_splice()  argument
251 	first = list->next;  in linux_list_splice()
254 	prev->next = first;  in linux_list_splice()
255 	last->next = next;  in linux_list_splice()
256 	next->prev = last;  in linux_list_splice()
263 	linux_list_splice(list, head, head->next);  in list_splice()
277 	linux_list_splice(list, head, head->next);  in list_splice_init()
298 	struct hlist_node *next, **pprev;  member
306 	(node)->next = NULL;						\
328 	if (n->next)  in hlist_del()
329 		n->next->pprev = n->pprev;  in hlist_del()
330 	*n->pprev = n->next;  in hlist_del()
347 	n->next = h->first;  in hlist_add_head()
349 		h->first->pprev = &n->next;  in hlist_add_head()
355 hlist_add_before(struct hlist_node *n, struct hlist_node *next)  in hlist_add_before()  argument
358 	n->pprev = next->pprev;  in hlist_add_before()
359 	n->next = next;  in hlist_add_before()
360 	next->pprev = &n->next;  in hlist_add_before()
365 hlist_add_after(struct hlist_node *n, struct hlist_node *next)  in hlist_add_after()  argument
368 	next->next = n->next;  in hlist_add_after()
369 	n->next = next;  in hlist_add_after()
370 	next->pprev = &n->next;  in hlist_add_after()
371 	if (next->next)  in hlist_add_after()
372 		next->next->pprev = &next->next;  in hlist_add_after()
387 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
393 	struct list_head *new_first = entry->next;  in __list_cut_position()
394 	list->next = head->next;  in __list_cut_position()
395 	list->next->prev = list;  in __list_cut_position()
397 	entry->next = list;  in __list_cut_position()
398 	head->next = new_first;  in __list_cut_position()
408 		(head->next != entry && head != entry))  in list_cut_position()
419 	return list->next == head;  in list_is_last()
425 	for (p = (head)->first; p; p = (p)->next)
428 	for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
436 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
439 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
441 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
445 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
449 	     (pos) && ({ n = (pos)->member.next; 1; });			\