Loading fs/namei.c +6 −3 Original line number Diff line number Diff line Loading @@ -1718,11 +1718,10 @@ static int link_path_walk(const char *name, struct nameidata *nd) } stack[MAX_NESTED_LINKS], *last = stack + nd->depth - 1; int err; start: while (*name=='/') name++; if (!*name) goto OK; return 0; /* At this point we know we have a real path component. */ for(;;) { Loading Loading @@ -1821,11 +1820,15 @@ static int link_path_walk(const char *name, struct nameidata *nd) nd->path = nd->root; path_get(&nd->root); nd->flags |= LOOKUP_JUMPED; while (unlikely(*++s == '/')) ; } nd->inode = nd->path.dentry->d_inode; last->name = name; if (!*s) goto OK; name = s; goto start; continue; } } if (!d_can_lookup(nd->path.dentry)) { Loading Loading
fs/namei.c +6 −3 Original line number Diff line number Diff line Loading @@ -1718,11 +1718,10 @@ static int link_path_walk(const char *name, struct nameidata *nd) } stack[MAX_NESTED_LINKS], *last = stack + nd->depth - 1; int err; start: while (*name=='/') name++; if (!*name) goto OK; return 0; /* At this point we know we have a real path component. */ for(;;) { Loading Loading @@ -1821,11 +1820,15 @@ static int link_path_walk(const char *name, struct nameidata *nd) nd->path = nd->root; path_get(&nd->root); nd->flags |= LOOKUP_JUMPED; while (unlikely(*++s == '/')) ; } nd->inode = nd->path.dentry->d_inode; last->name = name; if (!*s) goto OK; name = s; goto start; continue; } } if (!d_can_lookup(nd->path.dentry)) { Loading