[llvm] r336862 - [LoopIdiomRecognize] Add a test case showing a loop we turn into ctlz that we shouldn't.
Craig Topper via llvm-commits
llvm-commits at lists.llvm.org
Wed Jul 11 15:17:27 PDT 2018
Author: ctopper
Date: Wed Jul 11 15:17:26 2018
New Revision: 336862
URL: http://llvm.org/viewvc/llvm-project?rev=336862&view=rev
Log:
[LoopIdiomRecognize] Add a test case showing a loop we turn into ctlz that we shouldn't.
This loop executes one iteration without checking the input value. This produces a count of 1 for an input of 0 and 1. We are turning this into 32 - ctlz(n), but that returns 0 if n is 0.
Modified:
llvm/trunk/test/Transforms/LoopIdiom/X86/ctlz.ll
Modified: llvm/trunk/test/Transforms/LoopIdiom/X86/ctlz.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/LoopIdiom/X86/ctlz.ll?rev=336862&r1=336861&r2=336862&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/LoopIdiom/X86/ctlz.ll (original)
+++ llvm/trunk/test/Transforms/LoopIdiom/X86/ctlz.ll Wed Jul 11 15:17:26 2018
@@ -483,3 +483,39 @@ while.end:
ret i32 %cnt.0.lcssa
}
+; FIXME: We should not transform this loop. It returns 1 for an input of both
+; 0 and 1.
+;
+; int ctlz_bad(unsigned n)
+; {
+; int i = 0;
+; do {
+; i++;
+; n >>= 1;
+; } while(n != 0) {
+; return i;
+; }
+;
+; ALL: entry
+; ALL-NEXT: %0 = call i32 @llvm.ctlz.i32(i32 %n, i1 false)
+; ALL-NEXT: %1 = sub i32 32, %0
+; ALL-NEXT: br label %while.cond
+; ALL: %inc.lcssa = phi i32 [ %1, %while.cond ]
+; ALL: ret i32 %inc.lcssa
+
+; Function Attrs: norecurse nounwind readnone uwtable
+define i32 @ctlz_bad(i32 %n) {
+entry:
+ br label %while.cond
+
+while.cond: ; preds = %while.cond, %entry
+ %n.addr.0 = phi i32 [ %n, %entry ], [ %shr, %while.cond ]
+ %i.0 = phi i32 [ 0, %entry ], [ %inc, %while.cond ]
+ %shr = lshr i32 %n.addr.0, 1
+ %tobool = icmp eq i32 %shr, 0
+ %inc = add nsw i32 %i.0, 1
+ br i1 %tobool, label %while.end, label %while.cond
+
+while.end: ; preds = %while.cond
+ ret i32 %inc
+}
More information about the llvm-commits
mailing list