Lines Matching refs:next
48 struct list_head *next;
77 list->next = list->prev = list;
84 return (head->next == head);
90 struct list_head *next = head->next;
92 return ((next == head) && (next == head->prev));
96 __list_del(struct list_head *prev, struct list_head *next)
98 next->prev = prev;
99 WRITE_ONCE(prev->next, next);
106 __list_del(entry->prev, entry->next);
113 __list_del(entry->prev, entry->next);
119 new->next = old->next;
120 new->next->prev = new;
122 new->prev->next = new;
134 struct list_head *next)
137 next->prev = new;
138 new->next = next;
140 prev->next = new;
154 list_entry((ptr)->next, type, member)
163 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
172 for (p = (head)->next; p != (head); p = (p)->next)
175 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
178 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
179 p = list_entry((p)->field.next, typeof(*p), field))
182 for (p = list_entry((h)->next, typeof(*p), field), \
183 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
184 p = n, n = list_entry(n->field.next, typeof(*n), field))
188 p = list_entry((p)->field.next, typeof(*p), field))
195 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
197 pos = n, n = list_entry(n->member.next, typeof(*n), member))
218 linux_list_add(new, head, head->next);
246 struct list_head *next)
253 first = list->next;
256 prev->next = first;
257 last->next = next;
258 next->prev = last;
265 linux_list_splice(list, head, head->next);
279 linux_list_splice(list, head, head->next);
300 struct hlist_node *next, **pprev;
308 (node)->next = NULL; \
330 if (n->next)
331 n->next->pprev = n->pprev;
332 *n->pprev = n->next;
349 n->next = h->first;
351 h->first->pprev = &n->next;
357 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
360 n->pprev = next->pprev;
361 n->next = next;
362 next->pprev = &n->next;
367 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
370 next->next = n->next;
371 n->next = next;
372 next->pprev = &n->next;
373 if (next->next)
374 next->next->pprev = &next->next;
389 return !list_empty(head) && (head->next == head->prev);
395 struct list_head *new_first = entry->next;
396 list->next = head->next;
397 list->next->prev = list;
399 entry->next = list;
400 head->next = new_first;
410 (head->next != entry && head != entry))
421 return list->next == head;
427 for (p = (head)->first; p; p = (p)->next)
430 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
438 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
441 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
443 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
447 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
451 (pos) && ({ n = (pos)->member.next; 1; }); \