Use the llvm-upgrade program to upgrade llvm assembly.

[oota-llvm.git] / test / Transforms / InstCombine / xor.ll

diff --git a/test/Transforms/InstCombine/xor.ll b/test/Transforms/InstCombine/xor.ll
index 0e6550c23337da4ef04e4d513a8a2bf106c30a17..ad28660756a0f64e3df4601be7f1e10b70d5f3df 100644 (file)
--- a/test/Transforms/InstCombine/xor.ll
+++ b/test/Transforms/InstCombine/xor.ll
@@ -1,7 +1,11 @@
 ; This test makes sure that these instructions are properly eliminated.
 ;
 
-; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep 'xor '
+; RUN: llvm-upgrade < %s | llvm-as | opt -instcombine -disable-output &&
+; RUN: llvm-upgrade < %s | llvm-as | opt -instcombine | llvm-dis | not grep 'xor '
+
+%G1 = global uint 0
+%G2 = global uint 0
 
 implementation
 
@@ -104,3 +108,76 @@ uint %test15(uint %A) {             ; ~(X-1) == -X
        %C = xor uint %B, 4294967295
        ret uint %C
 }
+
+uint %test16(uint %A) {             ; ~(X+c) == (-c-1)-X
+       %B = add uint %A, 123       ; A generalization of the previous case
+       %C = xor uint %B, 4294967295
+       ret uint %C
+}
+
+uint %test17(uint %A) {             ; ~(c-X) == X-(c-1) == X+(-c+1)
+       %B = sub uint 123, %A
+       %C = xor uint %B, 4294967295
+       ret uint %C
+}
+
+uint %test18(uint %A) {             ; C - ~X == X + (1+C)
+       %B = xor uint %A, 4294967295; -~X == 0 - ~X == X+1
+       %C = sub uint 123, %B
+       ret uint %C
+}
+
+uint %test19(uint %A, uint %B) {
+       %C = xor uint %A, %B
+       %D = xor uint %C, %A  ; A terms cancel, D = B
+       ret uint %D
+}
+
+void %test20(uint %A, uint %B) {  ; The "swap idiom"
+        %tmp.2 = xor uint %B, %A
+        %tmp.5 = xor uint %tmp.2, %B
+        %tmp.8 = xor uint %tmp.5, %tmp.2
+        store uint %tmp.8, uint* %G1   ; tmp.8 = B
+        store uint %tmp.5, uint* %G2   ; tmp.5 = A
+        ret void
+}
+
+int %test21(bool %C, int %A, int %B) {
+       %C2 = xor bool %C, true
+       %D = select bool %C2, int %A, int %B
+       ret int %D
+}
+
+int %test22(bool %X) {
+        %Y = xor bool %X, true
+        %Z = cast bool %Y to int
+        %Q = xor int %Z, 1
+        ret int %Q
+}
+
+bool %test23(int %a, int %b) {
+        %tmp.2 = xor int %b, %a
+        %tmp.4 = seteq int %tmp.2, %a
+        ret bool %tmp.4
+}
+
+bool %test24(int %c, int %d) {
+        %tmp.2 = xor int %d, %c
+        %tmp.4 = setne int %tmp.2, %c
+        ret bool %tmp.4
+}
+
+int %test25(int %g, int %h) {
+       %h2 = xor int %h, -1
+        %tmp2 = and int %h2, %g
+        %tmp4 = xor int %tmp2, %g  ; (h2&g)^g -> ~h2 & g -> h & g
+        ret int %tmp4
+}
+
+int %test26(int %a, int %b) {
+       %b2 = xor int %b, -1
+        %tmp2 = xor int %a, %b2
+        %tmp4 = and int %tmp2, %a  ; (a^b2)&a -> ~b2 & a -> b & a
+        ret int %tmp4
+}
+