1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py 2; RUN: opt -disable-output "-passes=print<scalar-evolution>" %s 2>&1 | FileCheck %s 3 4target triple = "x86_64-unknown-linux-gnu" 5 6define void @test_and(i16 %in) { 7; CHECK-LABEL: 'test_and' 8; CHECK-NEXT: Classifying expressions for: @test_and 9; CHECK-NEXT: %_tmp25.i = phi i16 [ %in, %bb2 ], [ %_tmp6.i, %bb1.i ] 10; CHECK-NEXT: --> {%in,+,1}<nsw><%bb1.i> U: full-set S: full-set Exits: 1 LoopDispositions: { %bb1.i: Computable, %bb2: Variant } 11; CHECK-NEXT: %_tmp6.i = add nsw i16 %_tmp25.i, 1 12; CHECK-NEXT: --> {(1 + %in),+,1}<nsw><%bb1.i> U: full-set S: full-set Exits: 2 LoopDispositions: { %bb1.i: Computable, %bb2: Variant } 13; CHECK-NEXT: %or.cond = and i1 %_tmp10.i, %exitcond.i 14; CHECK-NEXT: --> (%_tmp10.i umin %exitcond.i) U: full-set S: full-set Exits: true LoopDispositions: { %bb1.i: Variant, %bb2: Variant } 15; CHECK-NEXT: Determining loop execution counts for: @test_and 16; CHECK-NEXT: Loop %bb1.i: backedge-taken count is (1 + (-1 * %in)) 17; CHECK-NEXT: Loop %bb1.i: constant max backedge-taken count is i16 -1 18; CHECK-NEXT: Loop %bb1.i: symbolic max backedge-taken count is (1 + (-1 * %in)) 19; CHECK-NEXT: Loop %bb1.i: Trip multiple is 1 20; CHECK-NEXT: Loop %bb2: <multiple exits> Unpredictable backedge-taken count. 21; CHECK-NEXT: Loop %bb2: Unpredictable constant max backedge-taken count. 22; CHECK-NEXT: Loop %bb2: Unpredictable symbolic max backedge-taken count. 23; 24 br label %bb2 25 26bb2: ; preds = %bb1.i, %bb2, %0 27 %_tmp44.i = icmp slt i16 %in, 2 28 br i1 %_tmp44.i, label %bb1.i, label %bb2 29 30bb1.i: ; preds = %bb1.i, %bb2 31 %_tmp25.i = phi i16 [ %in, %bb2 ], [ %_tmp6.i, %bb1.i ] 32 %_tmp6.i = add nsw i16 %_tmp25.i, 1 33 %_tmp10.i = icmp sge i16 %_tmp6.i, 2 34 %exitcond.i = icmp eq i16 %_tmp6.i, 2 35 %or.cond = and i1 %_tmp10.i, %exitcond.i 36 br i1 %or.cond, label %bb2, label %bb1.i 37} 38 39define void @test_or() { 40; CHECK-LABEL: 'test_or' 41; CHECK-NEXT: Classifying expressions for: @test_or 42; CHECK-NEXT: %indvars.iv = phi i64 [ -1, %BB ], [ -1, %0 ] 43; CHECK-NEXT: --> -1 U: [-1,0) S: [-1,0) Exits: -1 LoopDispositions: { %BB: Invariant } 44; CHECK-NEXT: %sum.01 = phi i32 [ %2, %BB ], [ undef, %0 ] 45; CHECK-NEXT: --> {undef,+,-1}<%BB> U: full-set S: full-set Exits: 0 LoopDispositions: { %BB: Computable } 46; CHECK-NEXT: %1 = trunc i64 %indvars.iv to i32 47; CHECK-NEXT: --> -1 U: [-1,0) S: [-1,0) Exits: -1 LoopDispositions: { %BB: Invariant } 48; CHECK-NEXT: %2 = add nsw i32 %1, %sum.01 49; CHECK-NEXT: --> {(-1 + undef),+,-1}<%BB> U: full-set S: full-set Exits: -1 LoopDispositions: { %BB: Computable } 50; CHECK-NEXT: %B3 = add i32 %1, %2 51; CHECK-NEXT: --> {(-2 + undef),+,-1}<%BB> U: full-set S: full-set Exits: -2 LoopDispositions: { %BB: Computable } 52; CHECK-NEXT: %B = or i1 %C5, %C11 53; CHECK-NEXT: --> (%C11 umax %C5) U: full-set S: full-set Exits: false LoopDispositions: { %BB: Variant } 54; CHECK-NEXT: Determining loop execution counts for: @test_or 55; CHECK-NEXT: Loop %BB: backedge-taken count is undef 56; CHECK-NEXT: Loop %BB: constant max backedge-taken count is i32 -1 57; CHECK-NEXT: Loop %BB: symbolic max backedge-taken count is undef 58; CHECK-NEXT: Loop %BB: Trip multiple is 1 59; 60 %C10 = icmp slt i1 undef, undef 61 br i1 %C10, label %BB, label %exit 62 63BB: ; preds = %BB, %0 64 %indvars.iv = phi i64 [ -1, %BB ], [ -1, %0 ] 65 %sum.01 = phi i32 [ %2, %BB ], [ undef, %0 ] 66 %1 = trunc i64 %indvars.iv to i32 67 %2 = add nsw i32 %1, %sum.01 68 %B3 = add i32 %1, %2 69 %C11 = icmp ult i32 %2, %1 70 %C5 = icmp sle i32 %1, %B3 71 %B = or i1 %C5, %C11 72 br i1 %B, label %BB, label %exit 73 74exit: ; preds = %BB, %0 75 ret void 76} 77