Lines Matching defs:next
33 * sometimes we already know the next/prev entries and we can
38 struct ntfs_list_head *next, *prev;
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
54 * @next:
56 * This is only for internal list manipulation where we know the prev/next
60 struct ntfs_list_head * prev, struct ntfs_list_head * next)
62 next->prev = new;
63 new->next = next;
65 prev->next = new;
79 __ntfs_list_add(new, head, head->next);
99 * @next:
101 * Delete a list entry by making the prev/next entries point to each other.
103 * This is only for internal list manipulation where we know the prev/next
107 struct ntfs_list_head * next)
109 next->prev = prev;
110 prev->next = next;
122 __ntfs_list_del(entry->prev, entry->next);
131 __ntfs_list_del(entry->prev, entry->next);
141 return head->next == head;
152 struct ntfs_list_head *first = list->next;
156 struct ntfs_list_head *at = head->next;
159 head->next = first;
161 last->next = at;
181 for (pos = (head)->next; pos != (head); pos = pos->next)
190 for (pos = (head)->next, n = pos->next; pos != (head); \
191 pos = n, n = pos->next)