[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <m11wekn6bc.fsf@ebiederm.dsl.xmission.com>
Date: Fri, 03 Aug 2007 06:36:23 -0600
From: ebiederm@...ssion.com (Eric W. Biederman)
To: Keith Owens <kaos@....com.au>
Cc: vgoyal@...ibm.com, Takenori Nagano <t-nagano@...jp.nec.com>,
k-miyoshi@...jp.nec.com, Bernhard Walle <bwalle@...e.de>,
kexec@...ts.infradead.org, linux-kernel@...r.kernel.org,
Andrew Morton <akpm@...ux-foundation.org>
Subject: Re: [RFC] Handling kernel stack overflows
Well we currently keep a struct thread_info on the stack
which while not as bad as task_struct has it's own uses
and implications which may limit what you are trying
to do.
That said a function like:
int call_on_new_stack(int (*continuation)(void *), void *closure)
{
struct task_struct *tsk;
struct thread_info *ti;
if (plenty_of_stack_space())
return continuation(closure);
tsk = current();
ti = alloc_thread_info(tsk);
if (!ti)
return -ENOMEM;
setup_extra_thread_info(tsk, ti, continuation, closure);
schedule();
}
Might make sense. Last I heard the block layer and xfs seemed
to have largely solved their problems with running short on stack
space, so I don't know if it is necessary but it certainly sounds
relatively simple and interesting.
Running short on stack space is a recurring theme so a function that
allows us to have a little more when we really need it and be able to
switch even x86_64 to 4K stacks would be interesting.
I'm not quite certain where we could insert calls to call_on_new_stack,
but it looks simple enough that it is worth coding up and playing
with. If the results are good it could be worth merging.
Eric
-
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