s/SequeuentiallyConsistent/SequentiallyConsistent/g

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@139481 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/docs/Atomics.html b/docs/Atomics.html
index 9d9bdacd9bb25c6f0fc6a1606cbfd6aa6f3cb5b9..fc15e27c39cd765233d8e7d40447e86a8b0eab33 100644 (file)
--- a/docs/Atomics.html
+++ b/docs/Atomics.html
@@ -437,10 +437,10 @@ void f(int* a) {
       SequentiallyConsistent operations may not be reordered.</dd>
   <dt>Notes for code generation</dt>
   <dd>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.</dd>
 </dl>