1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 4 2; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 2>&1 | FileCheck %s 3 4; This is a tricky testcase for unsigned wrap detection which ScalarEvolution 5; doesn't yet know how to do. 6 7define i32 @f(i32 %x) nounwind readnone { 8; 9; CHECK-LABEL: 'f' 10; CHECK-NEXT: Determining loop execution counts for: @f 11; CHECK-NEXT: Loop %bb: backedge-taken count is (((-3 + (-1 * (1 umin (-3 + (-1 * %x) + (1000 umax (3 + %x)))))<nuw><nsw> + (-1 * %x) + (1000 umax (3 + %x))) /u 3) + (1 umin (-3 + (-1 * %x) + (1000 umax (3 + %x))))) 12; CHECK-NEXT: Loop %bb: constant max backedge-taken count is i32 334 13; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is (((-3 + (-1 * (1 umin (-3 + (-1 * %x) + (1000 umax (3 + %x)))))<nuw><nsw> + (-1 * %x) + (1000 umax (3 + %x))) /u 3) + (1 umin (-3 + (-1 * %x) + (1000 umax (3 + %x))))) 14; CHECK-NEXT: Loop %bb: Trip multiple is 1 15; 16entry: 17 %0 = icmp ugt i32 %x, 999 ; <i1> [#uses=1] 18 br i1 %0, label %bb2, label %bb.nph 19 20bb.nph: ; preds = %entry 21 br label %bb 22 23bb: ; preds = %bb.nph, %bb1 24 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2] 25 %tmp = mul i32 %indvar, 3 ; <i32> [#uses=1] 26 %x_addr.04 = add i32 %tmp, %x ; <i32> [#uses=1] 27 %1 = add i32 %x_addr.04, 3 ; <i32> [#uses=2] 28 br label %bb1 29 30bb1: ; preds = %bb 31 %2 = icmp ugt i32 %1, 999 ; <i1> [#uses=1] 32 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1] 33 br i1 %2, label %bb1.bb2_crit_edge, label %bb 34 35bb1.bb2_crit_edge: ; preds = %bb1 36 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1] 37 br label %bb2 38 39bb2: ; preds = %bb1.bb2_crit_edge, %entry 40 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1] 41 ret i32 %x_addr.0.lcssa 42} 43