34 lines · plain
1; RUN: opt -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-max-add-rec-size=3 < %s 2>&1 | FileCheck %s2 3; Show that we are able to avoid creation of huge SCEVs by capping the max4; AddRec size.5define i32 @test_01(i32 %a, i32 %b) {6 7; CHECK-LABEL: Classifying expressions for: @test_018; CHECK-NEXT: %iv = phi i32 [ %a, %entry ], [ %iv.next, %loop ]9; CHECK-NEXT: --> {%a,+,%b}<%loop> U: full-set S: full-set10; CHECK-NEXT: %iv.next = add i32 %iv, %b11; CHECK-NEXT: --> {(%a + %b),+,%b}<%loop> U: full-set S: full-set12; CHECK-NEXT: %x1 = mul i32 %iv, %iv.next13; CHECK-NEXT: --> {((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop> U: full-set S: full-set14; CHECK-NEXT: %x2 = mul i32 %x1, %x115; CHECK-NEXT: --> ({((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop> * {((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop>) U: full-set S: full-set16; CHECK-NEXT: %x3 = mul i32 %x2, %x117; CHECK-NEXT: --> ({((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop> * {((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop> * {((%a + %b) * %a),+,(((2 * %a) + (2 * %b)) * %b),+,(2 * %b * %b)}<%loop>) U: full-set S: full-set18 19entry:20 br label %loop21 22loop:23 %iv = phi i32 [ %a, %entry ], [ %iv.next, %loop ]24 %iv.next = add i32 %iv, %b25 %cond = icmp slt i32 %iv.next, 100026 br i1 %cond, label %loop, label %exit27 28exit:29 %x1 = mul i32 %iv, %iv.next30 %x2 = mul i32 %x1, %x131 %x3 = mul i32 %x2, %x132 ret i32 %x333}34