45 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 42; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s3 4 5; ScalarEvolution can't compute a trip count because it doesn't know if6; dividing by the stride will have a remainder. This could theoretically7; be teaching it how to use a more elaborate trip count computation.8 9define i32 @f(i32 %x) nounwind readnone {10;11; CHECK-LABEL: 'f'12; CHECK-NEXT: Determining loop execution counts for: @f13; CHECK-NEXT: Loop %bb: backedge-taken count is ((-5 + %x) /u 3)14; CHECK-NEXT: Loop %bb: constant max backedge-taken count is i32 143165576415; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is ((-5 + %x) /u 3)16; CHECK-NEXT: Loop %bb: Trip multiple is 117;18entry:19 %0 = icmp ugt i32 %x, 4 ; <i1> [#uses=1]20 br i1 %0, label %bb.nph, label %bb221 22bb.nph: ; preds = %entry23 br label %bb24 25bb: ; preds = %bb.nph, %bb126 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]27 %tmp = mul i32 %indvar, -3 ; <i32> [#uses=1]28 %x_addr.04 = add i32 %tmp, %x ; <i32> [#uses=1]29 %1 = add i32 %x_addr.04, -3 ; <i32> [#uses=2]30 br label %bb131 32bb1: ; preds = %bb33 %2 = icmp ugt i32 %1, 4 ; <i1> [#uses=1]34 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1]35 br i1 %2, label %bb, label %bb1.bb2_crit_edge36 37bb1.bb2_crit_edge: ; preds = %bb138 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]39 br label %bb240 41bb2: ; preds = %bb1.bb2_crit_edge, %entry42 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1]43 ret i32 %x_addr.0.lcssa44}45