Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1755566AbaGNLqj (ORCPT ); Mon, 14 Jul 2014 07:46:39 -0400 Received: from e36.co.us.ibm.com ([32.97.110.154]:37861 "EHLO e36.co.us.ibm.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1754267AbaGNLqc (ORCPT ); Mon, 14 Jul 2014 07:46:32 -0400 Date: Mon, 14 Jul 2014 04:39:11 -0700 From: "Paul E. McKenney" To: Rusty Russell Cc: Tejun Heo , Christoph Lameter , David Howells , Linus Torvalds , Andrew Morton , Oleg Nesterov , linux-kernel@vger.kernel.org Subject: Re: [PATCH RFC] percpu: add data dependency barrier in percpu accessors and operations Message-ID: <20140714113911.GM16041@linux.vnet.ibm.com> Reply-To: paulmck@linux.vnet.ibm.com References: <20140612135630.GA23606@htj.dyndns.org> <20140612153426.GV4581@linux.vnet.ibm.com> <20140612155227.GB23606@htj.dyndns.org> <20140617144151.GD4669@linux.vnet.ibm.com> <20140617152752.GC31819@htj.dyndns.org> <87lhs35p0v.fsf@rustcorp.com.au> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <87lhs35p0v.fsf@rustcorp.com.au> User-Agent: Mutt/1.5.21 (2010-09-15) X-TM-AS-MML: disable X-Content-Scanned: Fidelis XPS MAILER x-cbid: 14071411-3532-0000-0000-000003228AAE Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org On Wed, Jul 09, 2014 at 10:25:44AM +0930, Rusty Russell wrote: > Tejun Heo writes: > > Hello, Paul. > > Rusty wakes up... ;-) > >> Good point. How about per-CPU variables that are introduced by > >> loadable modules? (I would guess that there are plenty of memory > >> barriers in the load process, given that text and data also needs > >> to be visible to other CPUs.) > > > > (cc'ing Rusty, hi!) > > > > Percpu initialization happens in post_relocation() before > > module_finalize(). There seem to be enough operations which can act > > as write barrier afterwards but nothing seems explicit. > > > > I have no idea how we're guaranteeing that .data is visible to all > > cpus without barrier from reader side. Maybe we don't allow something > > like the following? > > > > module init built-in code > > > > static int mod_static_var = X; if (builtin_ptr) > > builtin_ptr = &mod_static_var; WARN_ON(*builtin_ptr != X); > > > > Rusty, can you please enlighten me? > > Subtle, but I think in theory (though not in practice) this can happen. > > Making this this assigner's responsibility is nasty, since we reasonably > assume that .data is consistent across CPUs once code is executing > (similarly on boot). > > >> Again, it won't help for the allocator to strongly order the > >> initialization to zero if there are additional initializations of some > >> fields to non-zero values. And again, it should be a lot easier to > >> require the smp_store_release() or whatever uniformly than only in cases > >> where additional initialization occurred. > > > > This one is less murky as we can say that the cpu which allocated owns > > the zeroing; however, it still deviates from requiring the one which > > makes changes to take care of barriering for those changes, which is > > what makes me feel a bit uneasy. IOW, it's the allocator which > > cleared the memory, why should its users worry about in-flight > > operations from it? That said, this poses a lot less issues compared > > to percpu ones as passing normal pointers to other cpus w/o going > > through proper set of barriers is a special thing to do anyway. > > I think that the implicit per-cpu allocations done by modules need to > be consistent once the module is running. > > I'm deeply reluctant to advocate it in the other per-cpu cases though. > Once we add a barrier, it's impossible to remove: callers may subtly > rely on the behavior. > > "Magic barrier sprinkles" is a bad path to start down, IMHO. Here is the sort of thing that I would be concerned about: p = alloc_percpu(struct foo); for_each_possible_cpu(cpu) initialize(per_cpu_ptr(p, cpu); gp = p; We clearly need a memory barrier in there somewhere, and it cannot be buried in alloc_percpu(). Some cases avoid trouble due to locking, for example, initialize() might acquire a per-CPU lock and later uses might acquire that same lock. Clearly, use of a global lock would not be helpful from a scalability viewpoint. Thoughts? Thanx, Paul -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/