dev/drm2/drm_linux_list.h

45 INIT_LIST_HEAD(struct list_head *head) {
46 	(head)->next = head;
47 	(head)->prev = head;
56 list_empty(const struct list_head *head) {
57 	return (head)->next == head;
61 list_add(struct list_head *new, struct list_head *head) {
62         (head)->next->prev = new;
63         (new)->next = (head)->next;
64         (new)->prev = head;
65         (head)->next = new;
69 list_add_tail(struct list_head *entry, struct list_head *head) {
70 	(entry)->prev = (head)->prev;
71 	(entry)->next = head;
72 	(head)->prev->next = entry;
73 	(head)->prev = entry;
91 static inline void list_move(struct list_head *list, struct list_head *head)
94 	list_add(list, head);
98     struct list_head *head)
101 	list_add_tail(list, head);
111 #define list_for_each(entry, head)				\
112     for (entry = (head)->next; entry != head; entry = (entry)->next)
114 #define list_for_each_prev(entry, head) \
115         for (entry = (head)->prev; entry != (head); \
118 #define list_for_each_safe(entry, temp, head)			\
119     for (entry = (head)->next, temp = (entry)->next;		\
120 	entry != head; 						\
123 #define list_for_each_entry(pos, head, member)				\
124     for (pos = list_entry((head)->next, __typeof(*pos), member);	\
125 	&pos->member != (head);					 	\
128 #define list_for_each_entry_continue_reverse(pos, head, member)         \
130              &pos->member != (head);    				\
137  * @head:       the head for your list.
140 #define list_for_each_entry_safe(pos, n, head, member)			\
141 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
143 	    &pos->member != (head);					\
146 #define list_for_each_entry_safe_from(pos, n, head, member) 			\
148 	     &pos->member != (head);						\
170 list_splice(const struct list_head *list, struct list_head *head)
175 	__list_splice(list, head, head->next);
178 void drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
193 #define	INIT_HLIST_HEAD(head) (head)->first = NULL
277 #define	hlist_for_each(p, head)						\
278 	for (p = (head)->first; p; p = p->next)
280 #define	hlist_for_each_safe(p, n, head)					\
281 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
283 #define	hlist_for_each_entry(tp, p, head, field)			\
284 	for (p = (head)->first;						\
294 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) 		 \
295 	for (pos = (head)->first;					 \