Renumber tests sequentially

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

2 files changed, 21 insertions, 19 deletions

diff --git a/test/Transforms/InstCombine/or.ll b/test/Transforms/InstCombine/or.ll
index 9cdd747890..24c451e1c6 100644
--- a/test/Transforms/InstCombine/or.ll
+++ b/test/Transforms/InstCombine/or.ll
@@ -30,43 +30,43 @@ bool %test4(bool %A) {
 	ret bool %B
 }
 
-bool %test9(bool %A) {
+bool %test5(bool %A) {
 	%B = or bool %A, %A
 	ret bool %B
 }
 
-int %test10(int %A) {
+int %test6(int %A) {
 	%B = or int %A, %A
 	ret int %B
 }
 
-int %test12(int %A) {    ; A | ~A == -1
+int %test7(int %A) {    ; A | ~A == -1
         %NotA = xor int -1, %A
         %B = or int %A, %NotA
         ret int %B
 }
 
-ubyte %test14(ubyte %A) {
+ubyte %test8(ubyte %A) {
 	%B = or ubyte %A, 254
 	%C = or ubyte %B, 1
 	ret ubyte %C
 }
 
-ubyte %test17(ubyte %A, ubyte %B) {  ; Test that (A|c1)|(B|c2) == (A|B)|(c1|c2)
+ubyte %test9(ubyte %A, ubyte %B) {  ; Test that (A|c1)|(B|c2) == (A|B)|(c1|c2)
 	%C = or ubyte %A, 1
 	%D = or ubyte %B, 254
 	%E = or ubyte %C, %D
 	ret ubyte %E
 }
 
-ubyte %test21(ubyte %A) {
+ubyte %test10(ubyte %A) {
 	%B = or ubyte %A, 1
 	%C = and ubyte %B, 254
 	%D = or ubyte %C, 254  ; (X & C1) | C2 --> (X | C2) & (C1|C2)
 	ret ubyte %D
 }
 
-ubyte %test22(ubyte %A) {
+ubyte %test11(ubyte %A) {
 	%B = or ubyte %A, 254
 	%C = xor ubyte %B, 13
 	%D = or ubyte %C, 1    ; (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
@@ -74,13 +74,13 @@ ubyte %test22(ubyte %A) {
 	ret ubyte %E
 }
 
-uint %test23(uint %A) {
+uint %test12(uint %A) {
 	%B = or uint %A, 4     ; Should be eliminated
 	%C = and uint %B, 8
 	ret uint %C
 }
 
-uint %test24(uint %A) {
+uint %test13(uint %A) {
 	%B = or uint %A, 12
 	%C = and uint %B, 8    ; Always equal to 8
 	ret uint %C 
diff --git a/test/Transforms/InstCombine/xor.ll b/test/Transforms/InstCombine/xor.ll
index 1956184a94..3dc827395e 100644
--- a/test/Transforms/InstCombine/xor.ll
+++ b/test/Transforms/InstCombine/xor.ll
@@ -5,52 +5,54 @@
 
 implementation
 
-bool %test5(bool %A) {
+bool %test0(bool %A) {
 	%B = xor bool %A, false
 	ret bool %B
 }
 
-int %test6(int %A) {
+int %test1(int %A) {
 	%B = xor int %A, 0
 	ret int %B
 }
 
-bool %test7(bool %A) {
+bool %test2(bool %A) {
 	%B = xor bool %A, %A
 	ret bool %B
 }
 
-int %test8(int %A) {
+int %test3(int %A) {
 	%B = xor int %A, %A
 	ret int %B
 }
 
-int %test11(int %A) {    ; A ^ ~A == -1
+int %test4(int %A) {    ; A ^ ~A == -1
         %NotA = xor int -1, %A
         %B = xor int %A, %NotA
         ret int %B
 }
 
-uint %test13(uint %A) { ; (A|B)^B == A & (~B)
+uint %test5(uint %A) { ; (A|B)^B == A & (~B)
 	%t1 = or uint %A, 123
 	%r  = xor uint %t1, 123
 	ret uint %r
 }
 
-ubyte %test15(ubyte %A) {
+ubyte %test6(ubyte %A) {
 	%B = xor ubyte %A, 17
 	%C = xor ubyte %B, 17
 	ret ubyte %C
 }
 
-int %test16(int %A, int %B) {     ; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
+; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
+int %test7(int %A, int %B) {
+
         %A1 = and int %A, 7
         %B1 = and int %B, 128
         %OROK = xor int %A1, %B1
         ret int %OROK
 }
 
-ubyte %test18(bool %c) {
+ubyte %test8(bool %c) {
 	%d = xor bool %c, true    ; invert the condition
 	br bool %d, label %True, label %False
 True:
@@ -59,7 +61,7 @@ False:
 	ret ubyte 3
 }
 
-bool %test19(ubyte %A) {
+bool %test9(ubyte %A) {
 	%B = xor ubyte %A, 123      ; xor can be eliminated
 	%C = seteq ubyte %B, 34
 	ret bool %C