From e4481d8ce5aa333b0dc43f307bc8fb47c694e3e2 Mon Sep 17 00:00:00 2001 From: Nick Lewycky Date: Sun, 11 Sep 2011 15:50:05 +0000 Subject: s/SequeuentiallyConsistent/SequentiallyConsistent/g git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@139481 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/Atomics.html | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/Atomics.html b/docs/Atomics.html index 9d9bdac..fc15e27 100644 --- a/docs/Atomics.html +++ b/docs/Atomics.html @@ -437,10 +437,10 @@ void f(int* a) { SequentiallyConsistent operations may not be reordered.
Notes for code generation
SequentiallyConsistent loads minimally require the same barriers - as Acquire operations and SequeuentiallyConsistent stores require + as Acquire operations and SequentiallyConsistent stores require Release barriers. Additionally, the code generator must enforce - ordering between SequeuentiallyConsistent stores followed by - SequeuentiallyConsistent loads. This is usually done by emitting + ordering between SequentiallyConsistent stores followed by + SequentiallyConsistent loads. This is usually done by emitting either a full fence before the loads or a full fence after the stores; which is preferred varies by architecture.
-- cgit v1.1