[llvm-commits] CVS: llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll

Chris Lattner lattner at cs.uiuc.edu
Sun Nov 2 23:44:01 PST 2003


Changes in directory llvm/test/Regression/Transforms/InstCombine:

bit-tracking.ll updated: 1.1 -> 1.2

---
Log message:

More testcases


---
Diffs of the changes:  (+29 -0)

Index: llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll
diff -u llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll:1.1 llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll:1.2
--- llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll:1.1	Sun Nov  2 23:30:34 2003
+++ llvm/test/Regression/Transforms/InstCombine/bit-tracking.ll	Sun Nov  2 23:42:50 2003
@@ -16,3 +16,32 @@
         ret bool %ELIM3
 }
 
+; See if we can eliminate the shifts...
+int %test2(int %B) {
+        %ELIM1 = shl int %B, ubyte 31
+        %ELIM2 = shr int %ELIM1, ubyte 31
+        %inc = add int %ELIM2, 1   ; == xor int %B, 1
+        ret int %inc
+}
+
+; Reduce down to a single XOR
+int %test3(int %B) {
+        %ELIMinc = and int %B, 1
+        %tmp.5 = xor int %ELIMinc, 1
+        %ELIM7 = and int %B, -2
+        %tmp.8 = or int %tmp.5, %ELIM7
+        ret int %tmp.8
+}
+
+; Finally, a bigger case where we chain things together.  This corresponds to
+; incrementing a single-bit bitfield, which should become just an xor.
+int %test4(int %B) {
+        %ELIM3 = shl int %B, ubyte 31
+        %ELIM4 = shr int %ELIM3, ubyte 31
+        %inc = add int %ELIM4, 1
+        %ELIM5 = and int %inc, 1
+        %ELIM7 = and int %B, -2
+        %tmp.8 = or int %ELIM5, %ELIM7
+        ret int %tmp.8
+}
+





More information about the llvm-commits mailing list