37 	struct list_head *next, *prev;  member
44 	(head)->next = head;  in INIT_LIST_HEAD()
55 	return (head)->next == head;  in list_empty()
60         (head)->next->prev = new;  in list_add()
61         (new)->next = (head)->next;  in list_add()
63         (head)->next = new;  in list_add()
69 	(entry)->next = head;  in list_add_tail()
70 	(head)->prev->next = entry;  in list_add_tail()
76 	(entry)->next->prev = (entry)->prev;  in list_del()
77 	(entry)->prev->next = (entry)->next;  in list_del()
83 	new->next = old->next;  in list_replace()
84 	new->next->prev = new;  in list_replace()
86 	new->prev->next = new;  in list_replace()
104 	(entry)->next->prev = (entry)->prev;  in list_del_init()
105 	(entry)->prev->next = (entry)->next;  in list_del_init()
110     for (entry = (head)->next; entry != head; entry = (entry)->next)
117     for (entry = (head)->next, temp = (entry)->next;		\
119 	entry = temp, temp = entry->next)
122     for (pos = list_entry((head)->next, __typeof(*pos), member);	\
124 	pos = list_entry(pos->member.next, __typeof(*pos), member))
139 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
140 	    n = list_entry(pos->member.next, __typeof(*pos), member);	\
142 	    pos = n, n = list_entry(n->member.next, __typeof(*n), member))
145 	for (n = list_entry(pos->member.next, __typeof(*pos), member);		\
147 	     pos = n, n = list_entry(n->member.next, __typeof(*n), member))
150 	list_entry((ptr)->next, type, member)
155     struct list_head *next)  in __list_splice()  argument
157 	struct list_head *first = list->next;  in __list_splice()
161 	prev->next = first;  in __list_splice()
163 	last->next = next;  in __list_splice()
164 	next->prev = last;  in __list_splice()
173 	__list_splice(list, head, head->next);  in list_splice()
186 	struct hlist_node *next, **pprev;  member
194 	(node)->next = NULL;						\
216         if (n->next)  in hlist_del()
217                 n->next->pprev = n->pprev;  in hlist_del()
218         *n->pprev = n->next;  in hlist_del()
235 	n->next = h->first;  in hlist_add_head()
237 		h->first->pprev = &n->next;  in hlist_add_head()
243 hlist_add_before(struct hlist_node *n, struct hlist_node *next)  in hlist_add_before()  argument
246 	n->pprev = next->pprev;  in hlist_add_before()
247 	n->next = next;  in hlist_add_before()
248 	next->pprev = &n->next;  in hlist_add_before()
253 hlist_add_after(struct hlist_node *n, struct hlist_node *next)  in hlist_add_after()  argument
256 	next->next = n->next;  in hlist_add_after()
257 	n->next = next;  in hlist_add_after()
258 	next->pprev = &n->next;  in hlist_add_after()
259 	if (next->next)  in hlist_add_after()
260 		next->next->pprev = &next->next;  in hlist_add_after()
276 	for (p = (head)->first; p; p = p->next)
279 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
283 	    p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
286 	for (p = (p)->next;						\
287 	    p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
290 	for (; p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
294 	     (pos) != 0 && ({ n = (pos)->next; \