[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20100411003529.28fe5c3b@lxorguk.ukuu.org.uk>
Date: Sun, 11 Apr 2010 00:35:29 +0100
From: Alan Cox <alan@...rguk.ukuu.org.uk>
To: Ulrich Drepper <drepper@...il.com>
Cc: Darren Hart <dvhltc@...ibm.com>,
Peter Zijlstra <peterz@...radead.org>,
Avi Kivity <avi@...hat.com>, linux-kernel@...r.kernel.org,
Thomas Gleixner <tglx@...utronix.de>,
Ingo Molnar <mingo@...e.hu>,
Eric Dumazet <eric.dumazet@...il.com>,
"Peter W. Morreale" <pmorreale@...ell.com>,
Rik van Riel <riel@...hat.com>,
Steven Rostedt <rostedt@...dmis.org>,
Gregory Haskins <ghaskins@...ell.com>,
Sven-Thorsten Dietrich <sdietrich@...ell.com>,
Chris Mason <chris.mason@...cle.com>,
John Cooper <john.cooper@...rd-harmonic.com>,
Chris Wright <chrisw@...s-sol.org>
Subject: Re: [PATCH V2 0/6][RFC] futex: FUTEX_LOCK with optional adaptive
spinning
> The non-swappable part will be tricky. One doesn't know how many
> threads will be created in a process. This mechanism shouldn't put an
> arbitrary limit in place. So where to allocate the memory? Perhaps
> it's better to implicitly mark the memory page pointed to by the new
> syscall as non-swappable? This could mean one page per thread...
You only need one page per 4096 threads or so if you make it create the
page on the first request, tied to say the signals and the like in
threaded tasks, and you then allocate 'slots' in the page for future
calls until you've got 4096 live.
ie you'd see something like
addr = set_tid_notifier_addr();
[1st call
map page at x to x + 4095, probably R/O]
[returns x]
next thread
addr = set_tid_notifier_addr()
[returns x + 1]
Alan
--
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