[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20170611135632.sl72klbeklelupej@tardis>
Date: Sun, 11 Jun 2017 21:56:32 +0800
From: Boqun Feng <boqun.feng@...il.com>
To: Peter Zijlstra <peterz@...radead.org>
Cc: Will Deacon <will.deacon@....com>,
Paul McKenney <paulmck@...ux.vnet.ibm.com>,
linux-kernel@...r.kernel.org, Ingo Molnar <mingo@...nel.org>,
Thomas Gleixner <tglx@...utronix.de>
Subject: Re: [RFC][PATCH]: documentation,atomic: Add a new atomic_t document
Hi Peter,
On Fri, Jun 09, 2017 at 09:36:04PM +0200, Peter Zijlstra wrote:
[...]
> > > +Ordering: (go read memory-barriers.txt first)
> > > +
> > > +The rule of thumb:
> > > +
> > > + - non-RmW operations are unordered;
> > > +
> > > + - RmW operations that have no return value are unordered;
> > > +
> > > + - RmW operations that have a return value are Sequentially Consistent;
> >
> > I think it's stronger than that, because they also order non-RmW operations,
> > whereas this makes it sounds like there's just a total order over all RmW
> > operations.
>
> Right, what should I call it?
>
I think the term we use to refer this behavior is "fully-ordered"? Could
we give it a slight formal definition like:
a. memory operations preceding and following the RmW operation is
Sequentially Consistent.
b. load or store part of the RmW operation is Sequentially
Consistent with operations preceding or following.
Though, sounds like defining "fully-ordered" is the job for
memory-barriers.txt, but it's never done ;-)
Regards,
Boqun
> > > + - RmW operations that are conditional are unordered on FAILURE, otherwise the
> > > + above rules apply.
> >
Download attachment "signature.asc" of type "application/pgp-signature" (489 bytes)
Powered by blists - more mailing lists