Lines Matching refs:next
87 struct list_head *next;
96 list->next = list->prev = list;
103 return (head->next == head);
109 struct list_head *next = head->next;
111 return ((next == head) && (next == head->prev));
115 __list_del(struct list_head *prev, struct list_head *next)
117 next->prev = prev;
118 WRITE_ONCE(prev->next, next);
125 __list_del(entry->prev, entry->next);
132 __list_del(entry->prev, entry->next);
138 new->next = old->next;
139 new->next->prev = new;
141 new->prev->next = new;
153 struct list_head *next)
156 next->prev = new;
157 new->next = next;
159 prev->next = new;
173 list_entry((ptr)->next, type, member)
182 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
191 for (p = (head)->next; p != (head); p = (p)->next)
194 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
197 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
198 p = list_entry((p)->field.next, typeof(*p), field))
203 for (p = list_entry((h)->next, typeof(*p), field), \
204 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
205 p = n, n = list_entry(n->field.next, typeof(*n), field))
209 p = list_entry((p)->field.next, typeof(*p), field))
216 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
218 pos = n, n = list_entry(n->member.next, typeof(*n), member))
243 linux_list_add(new, head, head->next);
273 first->prev->next = last->next;
274 last->next->prev = first->prev;
275 head->prev->next = first;
277 last->next = head;
283 struct list_head *next)
290 first = list->next;
293 prev->next = first;
294 last->next = next;
295 next->prev = last;
302 linux_list_splice(list, head, head->next);
316 linux_list_splice(list, head, head->next);
336 struct hlist_node *next, **pprev;
343 (node)->next = NULL; \
365 WRITE_ONCE(*(n->pprev), n->next);
366 if (n->next != NULL)
367 n->next->pprev = n->pprev;
384 n->next = h->first;
386 h->first->pprev = &n->next;
392 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
395 n->pprev = next->pprev;
396 n->next = next;
397 next->pprev = &n->next;
405 n->next = prev->next;
406 WRITE_ONCE(prev->next, n);
407 n->pprev = &prev->next;
409 if (n->next != NULL)
410 n->next->pprev = &n->next;
425 return !list_empty(head) && (head->next == head->prev);
431 struct list_head *new_first = entry->next;
432 list->next = head->next;
433 list->next->prev = list;
435 entry->next = list;
436 head->next = new_first;
446 (head->next != entry && head != entry))
464 return list->next == head;
470 for (p = (head)->first; p; p = (p)->next)
473 for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
481 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
484 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
486 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
490 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
494 (pos) && ({ n = (pos)->member.next; 1; }); \