[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20160815224801.GA3672@mtj.duckdns.org>
Date: Mon, 15 Aug 2016 18:48:01 -0400
From: Tejun Heo <tj@...nel.org>
To: Heiko Carstens <heiko.carstens@...ibm.com>
Cc: Ming Lei <tom.leiming@...il.com>,
Thomas Gleixner <tglx@...utronix.de>,
Peter Zijlstra <peterz@...radead.org>,
LKML <linux-kernel@...r.kernel.org>,
Yasuaki Ishimatsu <isimatu.yasuaki@...fujitsu.com>,
Andrew Morton <akpm@...ux-foundation.org>,
Lai Jiangshan <laijs@...fujitsu.com>,
Michael Holzheu <holzheu@...ux.vnet.ibm.com>,
Martin Schwidefsky <schwidefsky@...ibm.com>
Subject: Re: [bisected] "sched: Allow per-cpu kernel threads to run on online
&& !active" causes warning
Hello, Heiko.
On Mon, Aug 15, 2016 at 01:19:08PM +0200, Heiko Carstens wrote:
> I can imagine several ways to fix this for s390, but before doing that I'm
> wondering if the workqueue code is correct with
>
> a) assuming that the cpu_to_node() mapping is valid for all _possible_ cpus
> that early
This can be debatable and making it "first registration sticks" is
likely easy enough.
> and
>
> b) that the cpu_to_node() mapping does never change
However, this part isn't just from workqueue. It just hits in a more
obvious way. For example, memory allocation has the same problem and
we would have to synchronize memory allocations against cpu <-> node
mapping changing. It'd be silly to add the complexity and overhead of
making the mapping dynamic when that there's nothing inherently
dynamic about it. The surface area is pretty big here.
I have no idea how s390 fakenuma works. Is that very difficult from
x86's? IIRC, x86's fakenuma isn't all that dynamic.
Thanks.
--
tejun
Powered by blists - more mailing lists