Lines Matching full:top
32 struct dentry *top = dentry; in autofs_mount_busy() local
61 ino = autofs_dentry_ino(top); in autofs_mount_busy()
113 * Calculate and dget next entry in top down tree traversal.
151 struct dentry *top, in autofs_direct_busy() argument
155 pr_debug("top %p %pd\n", top, top); in autofs_direct_busy()
165 ino = autofs_dentry_ino(top); in autofs_direct_busy()
171 /* Timeout of a direct mount is determined by its top dentry */ in autofs_direct_busy()
172 if (!autofs_can_expire(top, timeout, how)) in autofs_direct_busy()
183 struct dentry *top, in autofs_tree_busy() argument
187 struct autofs_info *top_ino = autofs_dentry_ino(top); in autofs_tree_busy()
190 pr_debug("top %p %pd\n", top, top); in autofs_tree_busy()
193 if (!simple_positive(top)) in autofs_tree_busy()
197 while ((p = get_next_positive_dentry(p, top))) { in autofs_tree_busy()
216 /* allow for dget above and top is already dgot */ in autofs_tree_busy()
217 if (p == top) in autofs_tree_busy()
234 /* Timeout of a tree mount is ultimately determined by its top dentry */ in autofs_tree_busy()
235 if (!autofs_can_expire(top, timeout, how)) in autofs_tree_busy()
334 * Case 1: (i) indirect mount or top level pseudo direct mount in should_expire()