lkml.org 
[lkml]   [2014]   [Aug]   [28]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
Date
SubjectRe: [PATCH] doc: memory-barriers.txt: Correct example for reorderings
On Thu, Aug 28, 2014 at 5:39 PM, Paul E. McKenney
<paulmck@linux.vnet.ibm.com> wrote:
> On Thu, Aug 28, 2014 at 05:15:50PM -0400, Pranith Kumar wrote:
>> On Thu, Aug 28, 2014 at 5:00 PM, Paul E. McKenney
>> <paulmck@linux.vnet.ibm.com> wrote:
>> >
>> > I am really confused by the ordering of the new lines, as I would have
>> > expected the "x"s to be replaced with "y"s and vice versa. But the
>> > ordering of the various combinations does not matter, and each line
>> > looks OK.
>>
>> Since x = A was replaced by x = B and y = B was replaced by y = A, I
>> just converted all x = load A to x = load B. Similarly for y. I think
>> we can do either this or as you suggested replacing x's with y's.
>
> Fair enough. The other thing that confused me was the "STORE B=4,"
> showing up early in your replacement.
>

So I converted

STORE A=3, x=LOAD A->3

to

STORE B=4, x=LOAD B->4

since the later load into x wanted an updated value of B and not the
default. That is the reason you see STORE B = 4 in place of STORE A =
3


--
Pranith


\
 
 \ /
  Last update: 2014-08-29 00:21    [W:0.077 / U:0.056 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site