[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20160721141153.GQ7094@linux.vnet.ibm.com>
Date: Thu, 21 Jul 2016 07:11:53 -0700
From: "Paul E. McKenney" <paulmck@...ux.vnet.ibm.com>
To: SeongJae Park <sj38.park@...il.com>
Cc: byungchul.park@....com, corbet@....net, mingo@...nel.org,
dhowells@...hat.com, minchan@...nel.org,
linux-kernel@...r.kernel.org, linux-doc@...r.kernel.org
Subject: Re: [PATCH v5 1/2] Doc/memory-barriers: Fix a typo of example result
On Thu, Jul 21, 2016 at 10:10:57AM +0900, SeongJae Park wrote:
> An example result for data dependent write has a typo. This commit
> fixes the wrong typo.
>
> Signed-off-by: SeongJae Park <sj38.park@...il.com>
Good catch! Queued, thank you!
Thanx, Paul
> ---
> Documentation/memory-barriers.txt | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/Documentation/memory-barriers.txt b/Documentation/memory-barriers.txt
> index 19c8eb6..ba818ec 100644
> --- a/Documentation/memory-barriers.txt
> +++ b/Documentation/memory-barriers.txt
> @@ -609,7 +609,7 @@ A data-dependency barrier must also order against dependent writes:
> The data-dependency barrier must order the read into Q with the store
> into *Q. This prohibits this outcome:
>
> - (Q == B) && (B == 4)
> + (Q == &B) && (B == 4)
>
> Please note that this pattern should be rare. After all, the whole point
> of dependency ordering is to -prevent- writes to the data structure, along
> --
> 1.9.1
>
Powered by blists - more mailing lists