[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20130927153434.GG15690@laptop.programming.kicks-ass.net>
Date: Fri, 27 Sep 2013 17:34:34 +0200
From: Peter Zijlstra <peterz@...radead.org>
To: "Paul E. McKenney" <paulmck@...ux.vnet.ibm.com>
Cc: Joe Perches <joe@...ches.com>, Ingo Molnar <mingo@...nel.org>,
Tim Chen <tim.c.chen@...ux.intel.com>,
Jason Low <jason.low2@...com>,
Davidlohr Bueso <davidlohr@...com>,
Ingo Molnar <mingo@...e.hu>,
Andrew Morton <akpm@...ux-foundation.org>,
Andrea Arcangeli <aarcange@...hat.com>,
Alex Shi <alex.shi@...aro.org>,
Andi Kleen <andi@...stfloor.org>,
Michel Lespinasse <walken@...gle.com>,
Davidlohr Bueso <davidlohr.bueso@...com>,
Matthew R Wilcox <matthew.r.wilcox@...el.com>,
Dave Hansen <dave.hansen@...el.com>,
Rik van Riel <riel@...hat.com>,
Peter Hurley <peter@...leysoftware.com>,
linux-kernel@...r.kernel.org, linux-mm <linux-mm@...ck.org>
Subject: Re: [PATCH] checkpatch: Make the memory barrier test noisier
On Fri, Sep 27, 2013 at 08:17:50AM -0700, Paul E. McKenney wrote:
> > Barriers are fundamentally about order; and order only makes sense if
> > there's more than 1 party to the game.
>
> Oddly enough, there is one exception that proves the rule... On Itanium,
> suppose we have the following code, with x initially equal to zero:
>
> CPU 1: ACCESS_ONCE(x) = 1;
>
> CPU 2: r1 = ACCESS_ONCE(x); r2 = ACCESS_ONCE(x);
>
> Itanium architects have told me that it really is possible for CPU 2 to
> see r1==1 and r2==0. Placing a memory barrier between CPU 2's pair of
> fetches prevents this, but without any other memory barrier to pair with.
Oh man.. its really past time to sink that itanic already.
I suppose it allows the cpu to reorder the reads in its pipeline and the
memory barrier disallows this. Curious.. does our memory-barriers.txt
file mention this 'fun' fact?
--
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