39 	struct list_head *next, *prev;  member
46 	(head)->next = head;  in INIT_LIST_HEAD()
57 	return (head)->next == head;  in list_empty()
62         (head)->next->prev = new;  in list_add()
63         (new)->next = (head)->next;  in list_add()
65         (head)->next = new;  in list_add()
71 	(entry)->next = head;  in list_add_tail()
72 	(head)->prev->next = entry;  in list_add_tail()
78 	(entry)->next->prev = (entry)->prev;  in list_del()
79 	(entry)->prev->next = (entry)->next;  in list_del()
85 	new->next = old->next;  in list_replace()
86 	new->next->prev = new;  in list_replace()
88 	new->prev->next = new;  in list_replace()
106 	(entry)->next->prev = (entry)->prev;  in list_del_init()
107 	(entry)->prev->next = (entry)->next;  in list_del_init()
112     for (entry = (head)->next; entry != head; entry = (entry)->next)
119     for (entry = (head)->next, temp = (entry)->next;		\
121 	entry = temp, temp = entry->next)
124     for (pos = list_entry((head)->next, __typeof(*pos), member);	\
126 	pos = list_entry(pos->member.next, __typeof(*pos), member))
141 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
142 	    n = list_entry(pos->member.next, __typeof(*pos), member);	\
144 	    pos = n, n = list_entry(n->member.next, __typeof(*n), member))
147 	for (n = list_entry(pos->member.next, __typeof(*pos), member);		\
149 	     pos = n, n = list_entry(n->member.next, __typeof(*n), member))
152 	list_entry((ptr)->next, type, member)
157     struct list_head *next)  in __list_splice()  argument
159 	struct list_head *first = list->next;  in __list_splice()
163 	prev->next = first;  in __list_splice()
165 	last->next = next;  in __list_splice()
166 	next->prev = last;  in __list_splice()
175 	__list_splice(list, head, head->next);  in list_splice()
188 	struct hlist_node *next, **pprev;  member
196 	(node)->next = NULL;						\
218         if (n->next)  in hlist_del()
219                 n->next->pprev = n->pprev;  in hlist_del()
220         *n->pprev = n->next;  in hlist_del()
237 	n->next = h->first;  in hlist_add_head()
239 		h->first->pprev = &n->next;  in hlist_add_head()
245 hlist_add_before(struct hlist_node *n, struct hlist_node *next)  in hlist_add_before()  argument
248 	n->pprev = next->pprev;  in hlist_add_before()
249 	n->next = next;  in hlist_add_before()
250 	next->pprev = &n->next;  in hlist_add_before()
255 hlist_add_after(struct hlist_node *n, struct hlist_node *next)  in hlist_add_after()  argument
258 	next->next = n->next;  in hlist_add_after()
259 	n->next = next;  in hlist_add_after()
260 	next->pprev = &n->next;  in hlist_add_after()
261 	if (next->next)  in hlist_add_after()
262 		next->next->pprev = &next->next;  in hlist_add_after()
278 	for (p = (head)->first; p; p = p->next)
281 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
285 	    p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
288 	for (p = (p)->next;						\
289 	    p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
292 	for (; p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
296 	     (pos) != 0 && ({ n = (pos)->next; \