Lines Matching +full:2 +full:nd
501 #define EMBEDDED_LEVELS 2
548 static bool nd_alloc_stack(struct nameidata *nd) in nd_alloc_stack() argument
553 nd->flags & LOOKUP_RCU ? GFP_ATOMIC : GFP_KERNEL); in nd_alloc_stack()
556 memcpy(p, nd->internal, sizeof(nd->internal)); in nd_alloc_stack()
557 nd->stack = p; in nd_alloc_stack()
578 static void drop_links(struct nameidata *nd) in drop_links() argument
580 int i = nd->depth; in drop_links()
582 struct saved *last = nd->stack + i; in drop_links()
588 static void terminate_walk(struct nameidata *nd) in terminate_walk() argument
590 drop_links(nd); in terminate_walk()
591 if (!(nd->flags & LOOKUP_RCU)) { in terminate_walk()
593 path_put(&nd->path); in terminate_walk()
594 for (i = 0; i < nd->depth; i++) in terminate_walk()
595 path_put(&nd->stack[i].link); in terminate_walk()
596 if (nd->flags & LOOKUP_ROOT_GRABBED) { in terminate_walk()
597 path_put(&nd->root); in terminate_walk()
598 nd->flags &= ~LOOKUP_ROOT_GRABBED; in terminate_walk()
601 nd->flags &= ~LOOKUP_RCU; in terminate_walk()
604 nd->depth = 0; in terminate_walk()
624 static inline bool legitimize_path(struct nameidata *nd, in legitimize_path() argument
627 return __legitimize_path(path, seq, nd->m_seq); in legitimize_path()
630 static bool legitimize_links(struct nameidata *nd) in legitimize_links() argument
633 for (i = 0; i < nd->depth; i++) { in legitimize_links()
634 struct saved *last = nd->stack + i; in legitimize_links()
635 if (unlikely(!legitimize_path(nd, &last->link, last->seq))) { in legitimize_links()
636 drop_links(nd); in legitimize_links()
637 nd->depth = i + 1; in legitimize_links()
644 static bool legitimize_root(struct nameidata *nd) in legitimize_root() argument
647 * For scoped-lookups (where nd->root has been zeroed), we need to in legitimize_root()
649 * for these lookups (nd->dfd is the root, not the filesystem root). in legitimize_root()
651 if (!nd->root.mnt && (nd->flags & LOOKUP_IS_SCOPED)) in legitimize_root()
653 /* Nothing to do if nd->root is zero or is managed by the VFS user. */ in legitimize_root()
654 if (!nd->root.mnt || (nd->flags & LOOKUP_ROOT)) in legitimize_root()
656 nd->flags |= LOOKUP_ROOT_GRABBED; in legitimize_root()
657 return legitimize_path(nd, &nd->root, nd->root_seq); in legitimize_root()
661 * Path walking has 2 modes, rcu-walk and ref-walk (see
673 * @nd: nameidata pathwalk data
676 * unlazy_walk attempts to legitimize the current nd->path and nd->root
682 static int unlazy_walk(struct nameidata *nd) in unlazy_walk() argument
684 struct dentry *parent = nd->path.dentry; in unlazy_walk()
686 BUG_ON(!(nd->flags & LOOKUP_RCU)); in unlazy_walk()
688 nd->flags &= ~LOOKUP_RCU; in unlazy_walk()
689 if (unlikely(!legitimize_links(nd))) in unlazy_walk()
691 if (unlikely(!legitimize_path(nd, &nd->path, nd->seq))) in unlazy_walk()
693 if (unlikely(!legitimize_root(nd))) in unlazy_walk()
696 BUG_ON(nd->inode != parent->d_inode); in unlazy_walk()
700 nd->path.mnt = NULL; in unlazy_walk()
701 nd->path.dentry = NULL; in unlazy_walk()
709 * @nd: nameidata pathwalk data
710 * @dentry: child of nd->path.dentry
714 * unlazy_child attempts to legitimize the current nd->path, nd->root and dentry
716 * @nd. Must be called from rcu-walk context.
720 static int unlazy_child(struct nameidata *nd, struct dentry *dentry, unsigned seq) in unlazy_child() argument
722 BUG_ON(!(nd->flags & LOOKUP_RCU)); in unlazy_child()
724 nd->flags &= ~LOOKUP_RCU; in unlazy_child()
725 if (unlikely(!legitimize_links(nd))) in unlazy_child()
727 if (unlikely(!legitimize_mnt(nd->path.mnt, nd->m_seq))) in unlazy_child()
729 if (unlikely(!lockref_get_not_dead(&nd->path.dentry->d_lockref))) in unlazy_child()
747 if (unlikely(!legitimize_root(nd))) in unlazy_child()
753 nd->path.mnt = NULL; in unlazy_child()
755 nd->path.dentry = NULL; in unlazy_child()
775 * @nd: pointer nameidata
777 * If we had been in RCU mode, drop out of it and legitimize nd->path.
781 * need to drop nd->path.
783 static int complete_walk(struct nameidata *nd) in complete_walk() argument
785 struct dentry *dentry = nd->path.dentry; in complete_walk()
788 if (nd->flags & LOOKUP_RCU) { in complete_walk()
790 * We don't want to zero nd->root for scoped-lookups or in complete_walk()
791 * externally-managed nd->root. in complete_walk()
793 if (!(nd->flags & (LOOKUP_ROOT | LOOKUP_IS_SCOPED))) in complete_walk()
794 nd->root.mnt = NULL; in complete_walk()
795 if (unlikely(unlazy_walk(nd))) in complete_walk()
799 if (unlikely(nd->flags & LOOKUP_IS_SCOPED)) { in complete_walk()
816 if (!path_is_under(&nd->path, &nd->root)) in complete_walk()
820 if (likely(!(nd->flags & LOOKUP_JUMPED))) in complete_walk()
826 status = dentry->d_op->d_weak_revalidate(dentry, nd->flags); in complete_walk()
836 static int set_root(struct nameidata *nd) in set_root() argument
845 if (WARN_ON(nd->flags & LOOKUP_IS_SCOPED)) in set_root()
848 if (nd->flags & LOOKUP_RCU) { in set_root()
853 nd->root = fs->root; in set_root()
854 nd->root_seq = __read_seqcount_begin(&nd->root.dentry->d_seq); in set_root()
857 get_fs_root(fs, &nd->root); in set_root()
858 nd->flags |= LOOKUP_ROOT_GRABBED; in set_root()
863 static int nd_jump_root(struct nameidata *nd) in nd_jump_root() argument
865 if (unlikely(nd->flags & LOOKUP_BENEATH)) in nd_jump_root()
867 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) { in nd_jump_root()
869 if (nd->path.mnt != NULL && nd->path.mnt != nd->root.mnt) in nd_jump_root()
872 if (!nd->root.mnt) { in nd_jump_root()
873 int error = set_root(nd); in nd_jump_root()
877 if (nd->flags & LOOKUP_RCU) { in nd_jump_root()
879 nd->path = nd->root; in nd_jump_root()
880 d = nd->path.dentry; in nd_jump_root()
881 nd->inode = d->d_inode; in nd_jump_root()
882 nd->seq = nd->root_seq; in nd_jump_root()
883 if (unlikely(read_seqcount_retry(&d->d_seq, nd->seq))) in nd_jump_root()
886 path_put(&nd->path); in nd_jump_root()
887 nd->path = nd->root; in nd_jump_root()
888 path_get(&nd->path); in nd_jump_root()
889 nd->inode = nd->path.dentry->d_inode; in nd_jump_root()
891 nd->flags |= LOOKUP_JUMPED; in nd_jump_root()
902 struct nameidata *nd = current->nameidata; in nd_jump_link() local
904 if (unlikely(nd->flags & LOOKUP_NO_MAGICLINKS)) in nd_jump_link()
908 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) { in nd_jump_link()
909 if (nd->path.mnt != path->mnt) in nd_jump_link()
913 if (unlikely(nd->flags & LOOKUP_IS_SCOPED)) in nd_jump_link()
916 path_put(&nd->path); in nd_jump_link()
917 nd->path = *path; in nd_jump_link()
918 nd->inode = nd->path.dentry->d_inode; in nd_jump_link()
919 nd->flags |= LOOKUP_JUMPED; in nd_jump_link()
927 static inline void put_link(struct nameidata *nd) in put_link() argument
929 struct saved *last = nd->stack + --nd->depth; in put_link()
931 if (!(nd->flags & LOOKUP_RCU)) in put_link()
942 * @nd: nameidata pathwalk data
955 static inline int may_follow_link(struct nameidata *nd, const struct inode *inode) in may_follow_link() argument
965 if ((nd->dir_mode & (S_ISVTX|S_IWOTH)) != (S_ISVTX|S_IWOTH)) in may_follow_link()
969 if (uid_valid(nd->dir_uid) && uid_eq(nd->dir_uid, inode->i_uid)) in may_follow_link()
972 if (nd->flags & LOOKUP_RCU) in may_follow_link()
975 audit_inode(nd->name, nd->stack[0].link.dentry, 0); in may_follow_link()
1063 * If the sysctl_protected_fifos (or sysctl_protected_regular) is set to 2
1081 ((sysctl_protected_fifos >= 2 && S_ISFIFO(inode->i_mode)) || in may_create_in_sticky()
1082 (sysctl_protected_regular >= 2 && S_ISREG(inode->i_mode))))) { in may_create_in_sticky()
1312 static bool __follow_mount_rcu(struct nameidata *nd, struct path *path, in __follow_mount_rcu() argument
1321 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) in __follow_mount_rcu()
1341 nd->flags |= LOOKUP_JUMPED; in __follow_mount_rcu()
1353 if (read_seqretry(&mount_lock, nd->m_seq)) in __follow_mount_rcu()
1360 static inline int handle_mounts(struct nameidata *nd, struct dentry *dentry, in handle_mounts() argument
1367 path->mnt = nd->path.mnt; in handle_mounts()
1369 if (nd->flags & LOOKUP_RCU) { in handle_mounts()
1373 if (likely(__follow_mount_rcu(nd, path, inode, seqp))) in handle_mounts()
1375 if (unlazy_child(nd, dentry, seq)) in handle_mounts()
1378 path->mnt = nd->path.mnt; in handle_mounts()
1381 ret = traverse_mounts(path, &jumped, &nd->total_link_count, nd->flags); in handle_mounts()
1383 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) in handle_mounts()
1386 nd->flags |= LOOKUP_JUMPED; in handle_mounts()
1390 if (path->mnt != nd->path.mnt) in handle_mounts()
1453 static struct dentry *lookup_fast(struct nameidata *nd, in lookup_fast() argument
1457 struct dentry *dentry, *parent = nd->path.dentry; in lookup_fast()
1465 if (nd->flags & LOOKUP_RCU) { in lookup_fast()
1467 dentry = __d_lookup_rcu(parent, &nd->last, &seq); in lookup_fast()
1469 if (unlazy_walk(nd)) in lookup_fast()
1489 if (unlikely(__read_seqcount_retry(&parent->d_seq, nd->seq))) in lookup_fast()
1493 status = d_revalidate(dentry, nd->flags); in lookup_fast()
1496 if (unlazy_child(nd, dentry, seq)) in lookup_fast()
1500 status = d_revalidate(dentry, nd->flags); in lookup_fast()
1502 dentry = __d_lookup(parent, &nd->last); in lookup_fast()
1505 status = d_revalidate(dentry, nd->flags); in lookup_fast()
1566 static inline int may_lookup(struct nameidata *nd) in may_lookup() argument
1568 if (nd->flags & LOOKUP_RCU) { in may_lookup()
1569 int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK); in may_lookup()
1572 if (unlazy_walk(nd)) in may_lookup()
1575 return inode_permission(nd->inode, MAY_EXEC); in may_lookup()
1578 static int reserve_stack(struct nameidata *nd, struct path *link, unsigned seq) in reserve_stack() argument
1580 if (unlikely(nd->total_link_count++ >= MAXSYMLINKS)) in reserve_stack()
1583 if (likely(nd->depth != EMBEDDED_LEVELS)) in reserve_stack()
1585 if (likely(nd->stack != nd->internal)) in reserve_stack()
1587 if (likely(nd_alloc_stack(nd))) in reserve_stack()
1590 if (nd->flags & LOOKUP_RCU) { in reserve_stack()
1593 bool grabbed_link = legitimize_path(nd, link, seq); in reserve_stack()
1595 if (unlazy_walk(nd) != 0 || !grabbed_link) in reserve_stack()
1598 if (nd_alloc_stack(nd)) in reserve_stack()
1604 enum {WALK_TRAILING = 1, WALK_MORE = 2, WALK_NOFOLLOW = 4};
1606 static const char *pick_link(struct nameidata *nd, struct path *link, in pick_link() argument
1611 int error = reserve_stack(nd, link, seq); in pick_link()
1614 if (!(nd->flags & LOOKUP_RCU)) in pick_link()
1618 last = nd->stack + nd->depth++; in pick_link()
1624 error = may_follow_link(nd, inode); in pick_link()
1629 if (unlikely(nd->flags & LOOKUP_NO_SYMLINKS) || in pick_link()
1633 if (!(nd->flags & LOOKUP_RCU)) { in pick_link()
1637 if (unlikely(unlazy_walk(nd))) in pick_link()
1643 nd->flags & LOOKUP_RCU); in pick_link()
1652 if (nd->flags & LOOKUP_RCU) { in pick_link()
1655 if (unlikely(unlazy_walk(nd))) in pick_link()
1668 error = nd_jump_root(nd); in pick_link()
1677 put_link(nd); in pick_link()
1687 static const char *step_into(struct nameidata *nd, int flags, in step_into() argument
1691 int err = handle_mounts(nd, dentry, &path, &inode, &seq); in step_into()
1696 ((flags & WALK_TRAILING) && !(nd->flags & LOOKUP_FOLLOW)) || in step_into()
1699 if (!(nd->flags & LOOKUP_RCU)) { in step_into()
1700 dput(nd->path.dentry); in step_into()
1701 if (nd->path.mnt != path.mnt) in step_into()
1702 mntput(nd->path.mnt); in step_into()
1704 nd->path = path; in step_into()
1705 nd->inode = inode; in step_into()
1706 nd->seq = seq; in step_into()
1709 if (nd->flags & LOOKUP_RCU) { in step_into()
1714 if (path.mnt == nd->path.mnt) in step_into()
1717 return pick_link(nd, &path, inode, seq, flags); in step_into()
1720 static struct dentry *follow_dotdot_rcu(struct nameidata *nd, in follow_dotdot_rcu() argument
1726 if (path_equal(&nd->path, &nd->root)) in follow_dotdot_rcu()
1728 if (unlikely(nd->path.dentry == nd->path.mnt->mnt_root)) { in follow_dotdot_rcu()
1731 if (!choose_mountpoint_rcu(real_mount(nd->path.mnt), in follow_dotdot_rcu()
1732 &nd->root, &path, &seq)) in follow_dotdot_rcu()
1734 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) in follow_dotdot_rcu()
1736 nd->path = path; in follow_dotdot_rcu()
1737 nd->inode = path.dentry->d_inode; in follow_dotdot_rcu()
1738 nd->seq = seq; in follow_dotdot_rcu()
1739 if (unlikely(read_seqretry(&mount_lock, nd->m_seq))) in follow_dotdot_rcu()
1743 old = nd->path.dentry; in follow_dotdot_rcu()
1747 if (unlikely(read_seqcount_retry(&old->d_seq, nd->seq))) in follow_dotdot_rcu()
1749 if (unlikely(!path_connected(nd->path.mnt, parent))) in follow_dotdot_rcu()
1753 if (unlikely(read_seqretry(&mount_lock, nd->m_seq))) in follow_dotdot_rcu()
1755 if (unlikely(nd->flags & LOOKUP_BENEATH)) in follow_dotdot_rcu()
1760 static struct dentry *follow_dotdot(struct nameidata *nd, in follow_dotdot() argument
1766 if (path_equal(&nd->path, &nd->root)) in follow_dotdot()
1768 if (unlikely(nd->path.dentry == nd->path.mnt->mnt_root)) { in follow_dotdot()
1771 if (!choose_mountpoint(real_mount(nd->path.mnt), in follow_dotdot()
1772 &nd->root, &path)) in follow_dotdot()
1774 path_put(&nd->path); in follow_dotdot()
1775 nd->path = path; in follow_dotdot()
1776 nd->inode = path.dentry->d_inode; in follow_dotdot()
1777 if (unlikely(nd->flags & LOOKUP_NO_XDEV)) in follow_dotdot()
1781 parent = dget_parent(nd->path.dentry); in follow_dotdot()
1782 if (unlikely(!path_connected(nd->path.mnt, parent))) { in follow_dotdot()
1791 if (unlikely(nd->flags & LOOKUP_BENEATH)) in follow_dotdot()
1793 dget(nd->path.dentry); in follow_dotdot()
1797 static const char *handle_dots(struct nameidata *nd, int type) in handle_dots() argument
1805 if (!nd->root.mnt) { in handle_dots()
1806 error = ERR_PTR(set_root(nd)); in handle_dots()
1810 if (nd->flags & LOOKUP_RCU) in handle_dots()
1811 parent = follow_dotdot_rcu(nd, &inode, &seq); in handle_dots()
1813 parent = follow_dotdot(nd, &inode, &seq); in handle_dots()
1817 error = step_into(nd, WALK_NOFOLLOW, in handle_dots()
1818 nd->path.dentry, nd->inode, nd->seq); in handle_dots()
1820 error = step_into(nd, WALK_NOFOLLOW, in handle_dots()
1825 if (unlikely(nd->flags & LOOKUP_IS_SCOPED)) { in handle_dots()
1829 * above nd->root (and so userspace should retry or use in handle_dots()
1833 if (unlikely(__read_seqcount_retry(&mount_lock.seqcount, nd->m_seq))) in handle_dots()
1835 if (unlikely(__read_seqcount_retry(&rename_lock.seqcount, nd->r_seq))) in handle_dots()
1842 static const char *walk_component(struct nameidata *nd, int flags) in walk_component() argument
1852 if (unlikely(nd->last_type != LAST_NORM)) { in walk_component()
1853 if (!(flags & WALK_MORE) && nd->depth) in walk_component()
1854 put_link(nd); in walk_component()
1855 return handle_dots(nd, nd->last_type); in walk_component()
1857 dentry = lookup_fast(nd, &inode, &seq); in walk_component()
1861 dentry = lookup_slow(&nd->last, nd->path.dentry, nd->flags); in walk_component()
1865 if (!(flags & WALK_MORE) && nd->depth) in walk_component()
1866 put_link(nd); in walk_component()
1867 return step_into(nd, flags, dentry, inode, seq); in walk_component()
1905 * influence out to 2^6 = 64 state bits.
1908 * deltas or 64*63/2 = 2016 two-bit input deltas, and finding the
1917 * Input delta: 1-bit 2-bit
1919 * 2 rounds: 2753.7 140389.8
1923 * (64*128) (64*63/2 * 128)
1947 * Input delta: 1-bit 2-bit
1949 * 2 rounds: 1246.4 25475.4
1953 * (32*64) (32*31/2 * 64)
2103 * Returns 0 and nd will have valid dentry and mnt on success.
2106 static int link_path_walk(const char *name, struct nameidata *nd) in link_path_walk() argument
2108 int depth = 0; // depth <= nd->depth in link_path_walk()
2111 nd->last_type = LAST_ROOT; in link_path_walk()
2112 nd->flags |= LOOKUP_PARENT; in link_path_walk()
2126 err = may_lookup(nd); in link_path_walk()
2130 hash_len = hash_name(nd->path.dentry, name); in link_path_walk()
2134 case 2: in link_path_walk()
2137 nd->flags |= LOOKUP_JUMPED; in link_path_walk()
2144 struct dentry *parent = nd->path.dentry; in link_path_walk()
2145 nd->flags &= ~LOOKUP_JUMPED; in link_path_walk()
2156 nd->last.hash_len = hash_len; in link_path_walk()
2157 nd->last.name = name; in link_path_walk()
2158 nd->last_type = type; in link_path_walk()
2174 nd->dir_uid = nd->inode->i_uid; in link_path_walk()
2175 nd->dir_mode = nd->inode->i_mode; in link_path_walk()
2176 nd->flags &= ~LOOKUP_PARENT; in link_path_walk()
2180 name = nd->stack[--depth].name; in link_path_walk()
2181 link = walk_component(nd, 0); in link_path_walk()
2184 link = walk_component(nd, WALK_MORE); in link_path_walk()
2190 nd->stack[depth++].name = name; in link_path_walk()
2194 if (unlikely(!d_can_lookup(nd->path.dentry))) { in link_path_walk()
2195 if (nd->flags & LOOKUP_RCU) { in link_path_walk()
2196 if (unlazy_walk(nd)) in link_path_walk()
2205 static const char *path_init(struct nameidata *nd, unsigned flags) in path_init() argument
2208 const char *s = nd->name->name; in path_init()
2215 nd->flags = flags | LOOKUP_JUMPED; in path_init()
2216 nd->depth = 0; in path_init()
2218 nd->m_seq = __read_seqcount_begin(&mount_lock.seqcount); in path_init()
2219 nd->r_seq = __read_seqcount_begin(&rename_lock.seqcount); in path_init()
2223 struct dentry *root = nd->root.dentry; in path_init()
2227 nd->path = nd->root; in path_init()
2228 nd->inode = inode; in path_init()
2230 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq); in path_init()
2231 nd->root_seq = nd->seq; in path_init()
2233 path_get(&nd->path); in path_init()
2238 nd->root.mnt = NULL; in path_init()
2239 nd->path.mnt = NULL; in path_init()
2240 nd->path.dentry = NULL; in path_init()
2242 /* Absolute pathname -- fetch the root (LOOKUP_IN_ROOT uses nd->dfd). */ in path_init()
2244 error = nd_jump_root(nd); in path_init()
2251 if (nd->dfd == AT_FDCWD) { in path_init()
2258 nd->path = fs->pwd; in path_init()
2259 nd->inode = nd->path.dentry->d_inode; in path_init()
2260 nd->seq = __read_seqcount_begin(&nd->path.dentry->d_seq); in path_init()
2263 get_fs_pwd(current->fs, &nd->path); in path_init()
2264 nd->inode = nd->path.dentry->d_inode; in path_init()
2268 struct fd f = fdget_raw(nd->dfd); in path_init()
2281 nd->path = f.file->f_path; in path_init()
2283 nd->inode = nd->path.dentry->d_inode; in path_init()
2284 nd->seq = read_seqcount_begin(&nd->path.dentry->d_seq); in path_init()
2286 path_get(&nd->path); in path_init()
2287 nd->inode = nd->path.dentry->d_inode; in path_init()
2294 nd->root = nd->path; in path_init()
2296 nd->root_seq = nd->seq; in path_init()
2298 path_get(&nd->root); in path_init()
2299 nd->flags |= LOOKUP_ROOT_GRABBED; in path_init()
2305 static inline const char *lookup_last(struct nameidata *nd) in lookup_last() argument
2307 if (nd->last_type == LAST_NORM && nd->last.name[nd->last.len]) in lookup_last()
2308 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY; in lookup_last()
2310 return walk_component(nd, WALK_TRAILING); in lookup_last()
2313 static int handle_lookup_down(struct nameidata *nd) in handle_lookup_down() argument
2315 if (!(nd->flags & LOOKUP_RCU)) in handle_lookup_down()
2316 dget(nd->path.dentry); in handle_lookup_down()
2317 return PTR_ERR(step_into(nd, WALK_NOFOLLOW, in handle_lookup_down()
2318 nd->path.dentry, nd->inode, nd->seq)); in handle_lookup_down()
2321 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2322 static int path_lookupat(struct nameidata *nd, unsigned flags, struct path *path) in path_lookupat() argument
2324 const char *s = path_init(nd, flags); in path_lookupat()
2328 err = handle_lookup_down(nd); in path_lookupat()
2333 while (!(err = link_path_walk(s, nd)) && in path_lookupat()
2334 (s = lookup_last(nd)) != NULL) in path_lookupat()
2337 err = complete_walk(nd); in path_lookupat()
2339 if (!err && nd->flags & LOOKUP_DIRECTORY) in path_lookupat()
2340 if (!d_can_lookup(nd->path.dentry)) in path_lookupat()
2342 if (!err && unlikely(nd->flags & LOOKUP_MOUNTPOINT)) { in path_lookupat()
2343 err = handle_lookup_down(nd); in path_lookupat()
2344 nd->flags &= ~LOOKUP_JUMPED; // no d_weak_revalidate(), please... in path_lookupat()
2347 *path = nd->path; in path_lookupat()
2348 nd->path.mnt = NULL; in path_lookupat()
2349 nd->path.dentry = NULL; in path_lookupat()
2351 terminate_walk(nd); in path_lookupat()
2359 struct nameidata nd; in filename_lookup() local
2363 nd.root = *root; in filename_lookup()
2366 set_nameidata(&nd, dfd, name); in filename_lookup()
2367 retval = path_lookupat(&nd, flags | LOOKUP_RCU, path); in filename_lookup()
2369 retval = path_lookupat(&nd, flags, path); in filename_lookup()
2371 retval = path_lookupat(&nd, flags | LOOKUP_REVAL, path); in filename_lookup()
2381 /* Returns 0 and nd will be valid on success; Retuns error, otherwise. */
2382 static int path_parentat(struct nameidata *nd, unsigned flags, in path_parentat() argument
2385 const char *s = path_init(nd, flags); in path_parentat()
2386 int err = link_path_walk(s, nd); in path_parentat()
2388 err = complete_walk(nd); in path_parentat()
2390 *parent = nd->path; in path_parentat()
2391 nd->path.mnt = NULL; in path_parentat()
2392 nd->path.dentry = NULL; in path_parentat()
2394 terminate_walk(nd); in path_parentat()
2403 struct nameidata nd; in filename_parentat() local
2407 set_nameidata(&nd, dfd, name); in filename_parentat()
2408 retval = path_parentat(&nd, flags | LOOKUP_RCU, parent); in filename_parentat()
2410 retval = path_parentat(&nd, flags, parent); in filename_parentat()
2412 retval = path_parentat(&nd, flags | LOOKUP_REVAL, parent); in filename_parentat()
2414 *last = nd.last; in filename_parentat()
2415 *type = nd.last_type; in filename_parentat()
2488 if (len < 2 || (len == 2 && name[1] == '.')) in lookup_one_len_common()
2668 * 2. We should have write and exec permissions on dir
2728 * 2. We can't do it if dir is read-only (done in permission())
2957 static struct dentry *atomic_open(struct nameidata *nd, struct dentry *dentry, in atomic_open() argument
2962 struct inode *dir = nd->path.dentry->d_inode; in atomic_open()
2965 if (nd->flags & LOOKUP_DIRECTORY) in atomic_open()
2969 file->f_path.mnt = nd->path.mnt; in atomic_open()
3012 static struct dentry *lookup_open(struct nameidata *nd, struct file *file, in lookup_open() argument
3016 struct dentry *dir = nd->path.dentry; in lookup_open()
3028 dentry = d_lookup(dir, &nd->last); in lookup_open()
3031 dentry = d_alloc_parallel(dir, &nd->last, &wq); in lookup_open()
3038 error = d_revalidate(dentry, nd->flags); in lookup_open()
3069 create_error = may_o_create(&nd->path, dentry, mode); in lookup_open()
3076 dentry = atomic_open(nd, dentry, file, open_flag, mode); in lookup_open()
3084 nd->flags); in lookup_open()
3120 static const char *open_last_lookups(struct nameidata *nd, in open_last_lookups() argument
3123 struct dentry *dir = nd->path.dentry; in open_last_lookups()
3132 nd->flags |= op->intent; in open_last_lookups()
3134 if (nd->last_type != LAST_NORM) { in open_last_lookups()
3135 if (nd->depth) in open_last_lookups()
3136 put_link(nd); in open_last_lookups()
3137 return handle_dots(nd, nd->last_type); in open_last_lookups()
3141 if (nd->last.name[nd->last.len]) in open_last_lookups()
3142 nd->flags |= LOOKUP_FOLLOW | LOOKUP_DIRECTORY; in open_last_lookups()
3144 dentry = lookup_fast(nd, &inode, &seq); in open_last_lookups()
3150 BUG_ON(nd->flags & LOOKUP_RCU); in open_last_lookups()
3153 if (nd->flags & LOOKUP_RCU) { in open_last_lookups()
3154 error = unlazy_walk(nd); in open_last_lookups()
3158 audit_inode(nd->name, dir, AUDIT_INODE_PARENT); in open_last_lookups()
3160 if (unlikely(nd->last.name[nd->last.len])) in open_last_lookups()
3165 error = mnt_want_write(nd->path.mnt); in open_last_lookups()
3178 dentry = lookup_open(nd, file, op, got_write); in open_last_lookups()
3187 mnt_drop_write(nd->path.mnt); in open_last_lookups()
3193 dput(nd->path.dentry); in open_last_lookups()
3194 nd->path.dentry = dentry; in open_last_lookups()
3199 if (nd->depth) in open_last_lookups()
3200 put_link(nd); in open_last_lookups()
3201 res = step_into(nd, WALK_TRAILING, dentry, inode, seq); in open_last_lookups()
3203 nd->flags &= ~(LOOKUP_OPEN|LOOKUP_CREATE|LOOKUP_EXCL); in open_last_lookups()
3210 static int do_open(struct nameidata *nd, in do_open() argument
3219 error = complete_walk(nd); in do_open()
3224 audit_inode(nd->name, nd->path.dentry, 0); in do_open()
3228 if (d_is_dir(nd->path.dentry)) in do_open()
3230 error = may_create_in_sticky(nd->dir_mode, nd->dir_uid, in do_open()
3231 d_backing_inode(nd->path.dentry)); in do_open()
3235 if ((nd->flags & LOOKUP_DIRECTORY) && !d_can_lookup(nd->path.dentry)) in do_open()
3244 } else if (d_is_reg(nd->path.dentry) && open_flag & O_TRUNC) { in do_open()
3245 error = mnt_want_write(nd->path.mnt); in do_open()
3250 error = may_open(&nd->path, acc_mode, open_flag); in do_open()
3252 error = vfs_open(&nd->path, file); in do_open()
3262 mnt_drop_write(nd->path.mnt); in do_open()
3305 static int do_tmpfile(struct nameidata *nd, unsigned flags, in do_tmpfile() argument
3311 int error = path_lookupat(nd, flags | LOOKUP_DIRECTORY, &path); in do_tmpfile()
3323 audit_inode(nd->name, child, 0); in do_tmpfile()
3337 static int do_o_path(struct nameidata *nd, unsigned flags, struct file *file) in do_o_path() argument
3340 int error = path_lookupat(nd, flags, &path); in do_o_path()
3342 audit_inode(nd->name, path.dentry, 0); in do_o_path()
3349 static struct file *path_openat(struct nameidata *nd, in path_openat() argument
3360 error = do_tmpfile(nd, flags, op, file); in path_openat()
3362 error = do_o_path(nd, flags, file); in path_openat()
3364 const char *s = path_init(nd, flags); in path_openat()
3365 while (!(error = link_path_walk(s, nd)) && in path_openat()
3366 (s = open_last_lookups(nd, file, op)) != NULL) in path_openat()
3369 error = do_open(nd, file, op); in path_openat()
3370 terminate_walk(nd); in path_openat()
3391 struct nameidata nd; in do_filp_open() local
3395 set_nameidata(&nd, dfd, pathname); in do_filp_open()
3396 filp = path_openat(&nd, op, flags | LOOKUP_RCU); in do_filp_open()
3398 filp = path_openat(&nd, op, flags); in do_filp_open()
3400 filp = path_openat(&nd, op, flags | LOOKUP_REVAL); in do_filp_open()
3408 struct nameidata nd; in do_file_open_root() local
3413 nd.root.mnt = mnt; in do_file_open_root()
3414 nd.root.dentry = dentry; in do_file_open_root()
3423 set_nameidata(&nd, -1, filename); in do_file_open_root()
3424 file = path_openat(&nd, op, flags | LOOKUP_RCU); in do_file_open_root()
3426 file = path_openat(&nd, op, flags); in do_file_open_root()
3428 file = path_openat(&nd, op, flags | LOOKUP_REVAL); in do_file_open_root()
4217 * we'd better make sure that there's no link(2) for them.