34  * sometimes we already know the next/prev entries and we can
53 	list->next = list;  in INIT_LIST_HEAD()
61  * the prev/next entries already!
65 			      struct list_head *next)  in __list_add()  argument
67 	next->prev = new;  in __list_add()
68 	new->next = next;  in __list_add()
70 	prev->next = new;  in __list_add()
83 	__list_add(new, head, head->next);  in list_add()
100  * Delete a list entry by making the prev/next entries
104  * the prev/next entries already!
106 static inline void __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
108 	next->prev = prev;  in __list_del()
109 	prev->next = next;  in __list_del()
114 	__list_del(entry->prev, entry->next);  in __list_del_entry()
126 	entry->next = LIST_POISON1;  in list_del()
140 	new->next = old->next;  in list_replace()
141 	new->next->prev = new;  in list_replace()
143 	new->prev->next = new;  in list_replace()
200 	return list->next == head;  in list_is_last()
219 	return head->next == head;  in list_empty()
240 	list_entry((ptr)->next, type, member)
254  * list_next_entry - get the next element in list
259 	list_entry((pos)->member.next, typeof(*(pos)), member)
324 	h->next = NULL;  in INIT_HLIST_NODE()
343 	struct hlist_node *next = n->next;  in __hlist_del()  local
346 	*pprev = next;  in __hlist_del()
347 	if (next)  in __hlist_del()
348 		next->pprev = pprev;  in __hlist_del()
361 	n->next = LIST_POISON1;  in hlist_del()
391 	n->next = first;  in hlist_add_head()
393 		first->pprev = &n->next;  in hlist_add_head()
414 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
425 	     pos && ({ n = pos->member.next; 1; });			\