Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1447572 > unrolled thread
| Started by | SeongJae Park <sj38.park@gmail.com> |
|---|---|
| First post | 2016-07-21 03:20 +0200 |
| Last post | 2016-07-21 16:20 +0200 |
| Articles | 2 — 2 participants |
Back to article view | Back to linux.kernel
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
[PATCH v5 1/2] Doc/memory-barriers: Fix a typo of example result SeongJae Park <sj38.park@gmail.com> - 2016-07-21 03:20 +0200
Re: [PATCH v5 1/2] Doc/memory-barriers: Fix a typo of example result "Paul E. McKenney" <paulmck@linux.vnet.ibm.com> - 2016-07-21 16:20 +0200
| From | SeongJae Park <sj38.park@gmail.com> |
|---|---|
| Date | 2016-07-21 03:20 +0200 |
| Subject | [PATCH v5 1/2] Doc/memory-barriers: Fix a typo of example result |
| Message-ID | <rXaOB-Dh-23@gated-at.bofh.it> |
An example result for data dependent write has a typo. This commit fixes the wrong typo. Signed-off-by: SeongJae Park <sj38.park@gmail.com> --- 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
[toc] | [next] | [standalone]
| From | "Paul E. McKenney" <paulmck@linux.vnet.ibm.com> |
|---|---|
| Date | 2016-07-21 16:20 +0200 |
| Message-ID | <rXmZs-8w7-23@gated-at.bofh.it> |
| In reply to | #1447572 |
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@gmail.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 >
[toc] | [prev] | [standalone]
Back to top | Article view | linux.kernel
csiph-web