1 ; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s
3 ; CHECK: Loop %bb: backedge-taken count is ((-5 + %x) /u 3)
4 ; CHECK: Loop %bb: constant max backedge-taken count is 1431655764
7 ; ScalarEvolution can't compute a trip count because it doesn't know if
8 ; dividing by the stride will have a remainder. This could theoretically
9 ; be teaching it how to use a more elaborate trip count computation.
11 define i32 @f(i32 %x) nounwind readnone {
13 %0 = icmp ugt i32 %x, 4 ; <i1> [#uses=1]
14 br i1 %0, label %bb.nph, label %bb2
16 bb.nph: ; preds = %entry
19 bb: ; preds = %bb.nph, %bb1
20 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
21 %tmp = mul i32 %indvar, -3 ; <i32> [#uses=1]
22 %x_addr.04 = add i32 %tmp, %x ; <i32> [#uses=1]
23 %1 = add i32 %x_addr.04, -3 ; <i32> [#uses=2]
27 %2 = icmp ugt i32 %1, 4 ; <i1> [#uses=1]
28 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1]
29 br i1 %2, label %bb, label %bb1.bb2_crit_edge
31 bb1.bb2_crit_edge: ; preds = %bb1
32 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]
35 bb2: ; preds = %bb1.bb2_crit_edge, %entry
36 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1]
37 ret i32 %x_addr.0.lcssa