Lines Matching defs:lower
43 * lower decoded dentry. This is done by following the overlay ancestry up to a
53 * copied up and renamed, upper dir /a will be indexed by lower dir /a from
56 * dentry from the connected lower dentry /a/b/c.
61 * and when the time comes to decode the file handle from lower dentry /a/b/c,
66 * entry /a in the lower layers above layer N and find the indexed dir /a from
68 * will need to verify there are no redirects in lower layers above N. In the
87 * lower layer
93 /* We can get upper/overlay path from indexed/lower dentry */
99 * have the same uppermost lower layer as the origin's layer. We may need to
175 * L = lower file handle
177 * (*) Decoding a connected overlay dir from real lower dentry is not always
178 * possible when there are redirects in lower layers and non-indexed merge dirs.
179 * To mitigate those case, we may copy up the lower dir ancestor before encode
182 * Return 0 for upper file handle, > 0 for lower file handle or < 0 on error.
213 * lower dir or under a non-indexed upper is not always possible.
232 * Check if we should encode a lower or upper file handle and maybe
233 * copy up an ancestor to make lower file handle connectable.
239 /* Encode an upper or lower file handle */
295 struct dentry *lower = lowerpath ? lowerpath->dentry : NULL;
305 if (d_is_dir(upper ?: lower))
308 oe = ovl_alloc_entry(!!lower);
313 if (lower) {
314 ovl_lowerstack(oe)->dentry = dget(lower);
351 /* Get the upper or lower dentry in stack whose on layer @idx */
465 * For decoded lower dir file handle, lookup index by origin to check
466 * if lower dir was copied up and and/or removed.
483 * ovl_lookup_real() in lower layer may call recursively once to
485 * back lower parents to the topmost indexed parent. The second
661 * Get an overlay dentry from upper/lower real dentries and index.