[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CA+55aFwP_zR8ETgmX-AfpSzG+B6+FZnaJ+_DFiOmKxEAd5=tkg@mail.gmail.com>
Date: Mon, 20 Apr 2015 14:04:53 -0700
From: Linus Torvalds <torvalds@...ux-foundation.org>
To: Al Viro <viro@...iv.linux.org.uk>
Cc: Neil Brown <neilb@...e.de>,
Linux Kernel Mailing List <linux-kernel@...r.kernel.org>,
linux-fsdevel <linux-fsdevel@...r.kernel.org>
Subject: Re: [PATCH 16/24] link_path_walk: kill the recursion
On Mon, Apr 20, 2015 at 11:13 AM, Al Viro <viro@...iv.linux.org.uk> wrote:
> */
> static int link_path_walk(const char *name, struct nameidata *nd)
> {
> + struct saved {
> + struct path link;
> + void *cookie;
> + const char *name;
> + } stack[MAX_NESTED_LINKS], *last = stack + nd->depth - 1;
> struct path next;
> int err;
I was going to complain about this, and suggest that you move it to
the nameidata, but I see that you did that later.
That said, you then introduce a stack-allocated "struct saved stack[]"
in path_mountpoint[] instead, *and* nameidata is saved on stack, so
this all ends up being very stack-intensive anyway.
I might have missed some patch here, but would it be possible to just
allocate a single per-thread nameidata, and just leave it at that?
Because allocating that thing on the stack when it contains what is
now one kilobyte of array data is *not* acceptable.
Other than that, my quick scan through this looked fine. And maybe
that quick scan missed where you already did that too.
Linus
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists