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