From: Bill Wendling Date: Fri, 9 Dec 2011 22:41:40 +0000 (+0000) Subject: Random cleanups. No description changes. X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=262396b64462099a6641050a896eacf04aaf4c03;p=oota-llvm.git Random cleanups. No description changes. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@146288 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/docs/LangRef.html b/docs/LangRef.html index fe81352f4f4..2d77ca48ee3 100644 --- a/docs/LangRef.html +++ b/docs/LangRef.html @@ -4247,9 +4247,9 @@ that the invoke/unwind semantics are likely to change in future versions.

- - - + + + @@ -4308,9 +4308,9 @@ that the invoke/unwind semantics are likely to change in future versions.

In0In1OutIn0In1Out
0
- - - + + + @@ -4372,9 +4372,9 @@ that the invoke/unwind semantics are likely to change in future versions.

In0In1OutIn0In1Out
0
- - - + + + @@ -4785,8 +4785,8 @@ that the invoke/unwind semantics are likely to change in future versions.

Syntax:
-  store [volatile] <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>]                   ; yields {void}
-  store atomic [volatile] <ty> <value>, <ty>* <pointer> [singlethread] <ordering>, align <alignment>             ; yields {void}
+  store [volatile] <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>]        ; yields {void}
+  store atomic [volatile] <ty> <value>, <ty>* <pointer> [singlethread] <ordering>, align <alignment>  ; yields {void}
 
Overview:
@@ -4915,7 +4915,7 @@ thread. (This is useful for interacting with signal handlers.)

Syntax:
-  cmpxchg [volatile] <ty>* <pointer>, <ty> <cmp>, <ty> <new> [singlethread] <ordering>                   ; yields {ty}
+  cmpxchg [volatile] <ty>* <pointer>, <ty> <cmp>, <ty> <new> [singlethread] <ordering>  ; yields {ty}
 
Overview:
@@ -4973,13 +4973,13 @@ FIXME: Is a weaker ordering constraint on failure helpful in practice?
Example:
 entry:
-  %orig = atomic load i32* %ptr unordered                       ; yields {i32}
+  %orig = atomic load i32* %ptr unordered                   ; yields {i32}
   br label %loop
 
 loop:
   %cmp = phi i32 [ %orig, %entry ], [%old, %loop]
   %squared = mul i32 %cmp, %cmp
-  %old = cmpxchg i32* %ptr, i32 %cmp, i32 %squared                       ; yields {i32}
+  %old = cmpxchg i32* %ptr, i32 %cmp, i32 %squared          ; yields {i32}
   %success = icmp eq i32 %cmp, %old
   br i1 %success, label %done, label %loop
 
In0In1OutIn0In1Out
0