Lines Matching refs:next
94 * Calculate next entry in top down tree traversal.
99 struct list_head *next = p->d_subdirs.next;
101 if (next == &p->d_subdirs) {
105 next = p->d_u.d_child.next;
106 if (next != &p->d_parent->d_subdirs)
111 return list_entry(next, struct dentry, d_u.d_child);
306 struct list_head *next;
319 next = root->d_subdirs.next;
323 while ( next != &root->d_subdirs ) {
324 struct dentry *dentry = list_entry(next, struct dentry, d_u.d_child);
328 next = next->next;
351 goto next;
355 goto next;
362 goto next;
366 goto next;
373 goto next;
387 goto next;
395 next:
399 next = next->next;