dev/drm2/drm_linux_list.h

15  * The above copyright notice and this permission notice (including the next
37 	struct list_head *next, *prev;
44 	(head)->next = head;
55 	return (head)->next == head;
60         (head)->next->prev = new;
61         (new)->next = (head)->next;
63         (head)->next = new;
69 	(entry)->next = head;
70 	(head)->prev->next = entry;
76 	(entry)->next->prev = (entry)->prev;
77 	(entry)->prev->next = (entry)->next;
83 	new->next = old->next;
84 	new->next->prev = new;
86 	new->prev->next = new;
104 	(entry)->next->prev = (entry)->prev;
105 	(entry)->prev->next = (entry)->next;
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)
157 	struct list_head *first = list->next;
161 	prev->next = first;
163 	last->next = next;
164 	next->prev = last;
173 	__list_splice(list, head, head->next);
186 	struct hlist_node *next, **pprev;
194 	(node)->next = NULL;						\
216         if (n->next)
217                 n->next->pprev = n->pprev;
218         *n->pprev = n->next;
235 	n->next = h->first;
237 		h->first->pprev = &n->next;
243 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
246 	n->pprev = next->pprev;
247 	n->next = next;
248 	next->pprev = &n->next;
253 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
256 	next->next = n->next;
257 	n->next = next;
258 	next->pprev = &n->next;
259 	if (next->next)
260 		next->next->pprev = &next->next;
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; \