llvm-6502/test/Analysis/ScalarEvolution/2008-05-25-NegativeStepToZero.ll
Dan Gohman 46bdfb0e6b Rename ScalarEvolution's getIterationCount to getBackedgeTakenCount,
to more accurately describe what it does. Expand its doxygen comment
to describe what the backedge-taken count is and how it differs
from the actual iteration count of the loop. Adjust names and
comments in associated code accordingly.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@65382 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-24 18:55:53 +00:00

23 lines
607 B
LLVM

; RUN: llvm-as < %s | opt -analyze -scalar-evolution \
; RUN: -scalar-evolution-max-iterations=0 | grep {backedge-taken count is 61}
; PR2364
define i32 @func_6() nounwind {
entry:
br label %bb5
bb: ; preds = %bb5
%tmp2 = add i32 %i.0, 1 ; <i32> [#uses=1]
%tmp4 = add i8 %x.0, -4 ; <i8> [#uses=1]
br label %bb5
bb5: ; preds = %bb, %entry
%x.0 = phi i8 [ 0, %entry ], [ %tmp4, %bb ] ; <i8> [#uses=2]
%i.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb ] ; <i32> [#uses=2]
%tmp7 = icmp eq i8 %x.0, 12 ; <i1> [#uses=1]
br i1 %tmp7, label %return, label %bb
return: ; preds = %bb5
ret i32 %i.0
}