[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <q2r412e6f7f1004280656t331e9120rc9eab069fb4d4de3@mail.gmail.com>
Date: Wed, 28 Apr 2010 21:56:29 +0800
From: Changli Gao <xiaosuo@...il.com>
To: David Howells <dhowells@...hat.com>
Cc: Ingo Molnar <mingo@...e.hu>,
Alexander Viro <viro@...iv.linux.org.uk>,
Andrew Morton <akpm@...ux-foundation.org>,
"Eric W. Biederman" <ebiederm@...ssion.com>,
Davide Libenzi <davidel@...ilserver.org>,
Roland Dreier <rolandd@...co.com>,
Stefan Richter <stefanr@...6.in-berlin.de>,
Peter Zijlstra <a.p.zijlstra@...llo.nl>,
"David S. Miller" <davem@...emloft.net>,
Eric Dumazet <dada1@...mosbay.com>,
Christoph Lameter <cl@...ux.com>,
Andreas Herrmann <andreas.herrmann3@....com>,
Thomas Gleixner <tglx@...utronix.de>,
Takashi Iwai <tiwai@...e.de>, linux-fsdevel@...r.kernel.org,
linux-kernel@...r.kernel.org
Subject: Re: [RFC] sched: implement the exclusive wait queue as a LIFO queue
On Wed, Apr 28, 2010 at 5:32 PM, David Howells <dhowells@...hat.com> wrote:
> Changli Gao <xiaosuo@...il.com> wrote:
>
>> @@ -50,6 +48,7 @@ struct wait_bit_queue {
>> struct __wait_queue_head {
>> spinlock_t lock;
>> struct list_head task_list;
>> + struct list_head task_list_ex;
>
> It would be preferable it if you could avoid making struct __wait_queue_head
> bigger. That will increase the size of a lot of things.
>
I don't know how to do that, as maybe there are non-exclusive and
exclusive wait queues in the same wait queue head. If we want to
enqueue exclusive wait queues at the head of exclusive queues, we have
to know where the head is, otherwise, we have to loop to find the head
when enqueuing.
--
Regards,
Changli Gao(xiaosuo@...il.com)
--
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