include/linux/list.h

85 	struct list_head *next;
94 	list->next = list->prev = list;
101 	return (head->next == head);
107 	struct list_head *next = head->next;
109 	return ((next == head) && (next == head->prev));
113 __list_del(struct list_head *prev, struct list_head *next)
115 	next->prev = prev;
116 	WRITE_ONCE(prev->next, next);
123 	__list_del(entry->prev, entry->next);
130 	__list_del(entry->prev, entry->next);
136 	new->next = old->next;
137 	new->next->prev = new;
139 	new->prev->next = new;
151     struct list_head *next)
154 	next->prev = new;
155 	new->next = next;
157 	prev->next = new;
171 	list_entry((ptr)->next, type, member)
180 	list_entry(((ptr)->member.next), typeof(*(ptr)), member)
189 	for (p = (head)->next; p != (head); p = (p)->next)
192 	for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
195 	for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
196 	    p = list_entry((p)->field.next, typeof(*p), field))
199 	for (p = list_entry((h)->next, typeof(*p), field),		\
200 	    n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
201 	    p = n, n = list_entry(n->field.next, typeof(*n), field))
205 	    p = list_entry((p)->field.next, typeof(*p), field))
212 	for (n = list_entry((pos)->member.next, typeof(*pos), member);		\
214 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
239 	linux_list_add(new, head, head->next);
269 	first->prev->next = last->next;
270 	last->next->prev = first->prev;
271 	head->prev->next = first;
273 	last->next = head;
279     struct list_head *next)
286 	first = list->next;
289 	prev->next = first;
290 	last->next = next;
291 	next->prev = last;
298 	linux_list_splice(list, head, head->next);
312 	linux_list_splice(list, head, head->next);
333 	struct hlist_node *next, **pprev;
341 	(node)->next = NULL;						\
363 	WRITE_ONCE(*(n->pprev), n->next);
364 	if (n->next != NULL)
365 		n->next->pprev = n->pprev;
382 	n->next = h->first;
384 		h->first->pprev = &n->next;
390 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
393 	n->pprev = next->pprev;
394 	n->next = next;
395 	next->pprev = &n->next;
403 	n->next = prev->next;
404 	WRITE_ONCE(prev->next, n);
405 	n->pprev = &prev->next;
407 	if (n->next != NULL)
408 		n->next->pprev = &n->next;
423 	return !list_empty(head) && (head->next == head->prev);
429 	struct list_head *new_first = entry->next;
430 	list->next = head->next;
431 	list->next->prev = list;
433 	entry->next = list;
434 	head->next = new_first;
444 		(head->next != entry && head != entry))
455 	return list->next == head;
461 	for (p = (head)->first; p; p = (p)->next)
464 	for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
472 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
475 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
477 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
481 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
485 	     (pos) && ({ n = (pos)->member.next; 1; });			\