mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-01 05:01:59 +01:00
5cbed866a3
In rL300494 there was an attempt to deal with excessive compile time on invocations of getSign/ZeroExtExpr using local caching. This approach only helps if we request the same SCEV multiple times throughout recursion. But in the bug PR33431 we see a case where we request different values all the time, so caching does not help and the size of the cache grows enormously. In this patch we remove the local cache for this methods and add the recursion depth limit instead, as we do for arithmetics. This gives us a guarantee that the invocation sequence is limited and reasonably short. Differential Revision: https://reviews.llvm.org/D34273 llvm-svn: 306785
101 lines
2.7 KiB
LLVM
101 lines
2.7 KiB
LLVM
; RUN: opt -scalar-evolution-max-arith-depth=0 -scalar-evolution-max-ext-depth=0 -analyze -scalar-evolution < %s | FileCheck %s
|
|
|
|
; Check that depth set to 0 prevents getAddExpr and getMulExpr from making
|
|
; transformations in SCEV. We expect the result to be very straightforward.
|
|
|
|
define void @test_add(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f) {
|
|
; CHECK-LABEL: @test_add
|
|
; CHECK: %s2 = add i32 %s1, %p3
|
|
; CHECK-NEXT: --> (%a + %a + %b + %b + %c + %c + %d + %d + %e + %e + %f + %f)
|
|
%tmp0 = add i32 %a, %b
|
|
%tmp1 = add i32 %b, %c
|
|
%tmp2 = add i32 %c, %d
|
|
%tmp3 = add i32 %d, %e
|
|
%tmp4 = add i32 %e, %f
|
|
%tmp5 = add i32 %f, %a
|
|
|
|
%p1 = add i32 %tmp0, %tmp3
|
|
%p2 = add i32 %tmp1, %tmp4
|
|
%p3 = add i32 %tmp2, %tmp5
|
|
|
|
%s1 = add i32 %p1, %p2
|
|
%s2 = add i32 %s1, %p3
|
|
ret void
|
|
}
|
|
|
|
define void @test_mul(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f) {
|
|
; CHECK-LABEL: @test_mul
|
|
; CHECK: %s2 = mul i32 %s1, %p3
|
|
; CHECK-NEXT: --> (2 * 3 * 4 * 5 * 6 * 7 * %a * %b * %c * %d * %e * %f)
|
|
%tmp0 = mul i32 %a, 2
|
|
%tmp1 = mul i32 %b, 3
|
|
%tmp2 = mul i32 %c, 4
|
|
%tmp3 = mul i32 %d, 5
|
|
%tmp4 = mul i32 %e, 6
|
|
%tmp5 = mul i32 %f, 7
|
|
|
|
%p1 = mul i32 %tmp0, %tmp3
|
|
%p2 = mul i32 %tmp1, %tmp4
|
|
%p3 = mul i32 %tmp2, %tmp5
|
|
|
|
%s1 = mul i32 %p1, %p2
|
|
%s2 = mul i32 %s1, %p3
|
|
ret void
|
|
}
|
|
|
|
define void @test_sext(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f) {
|
|
; CHECK-LABEL: @test_sext
|
|
; CHECK: %se2 = sext i64 %iv2.inc to i128
|
|
; CHECK-NEXT: --> {(1 + (sext i64 {(sext i32 (1 + %a) to i64),+,1}<nsw><%loop> to i128))<nsw>,+,1}<nsw><%loop2>
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ %a, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add nsw i32 %iv, 1
|
|
%cond = icmp sle i32 %iv.inc, 50
|
|
br i1 %cond, label %loop, label %between
|
|
|
|
between:
|
|
%se = sext i32 %iv.inc to i64
|
|
br label %loop2
|
|
|
|
loop2:
|
|
%iv2 = phi i64 [ %se, %between ], [ %iv2.inc, %loop2 ]
|
|
%iv2.inc = add nsw i64 %iv2, 1
|
|
%cond2 = icmp sle i64 %iv2.inc, 50
|
|
br i1 %cond2, label %loop2, label %exit
|
|
|
|
exit:
|
|
%se2 = sext i64 %iv2.inc to i128
|
|
ret void
|
|
}
|
|
|
|
define void @test_zext(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f) {
|
|
; CHECK-LABEL: @test_zext
|
|
; CHECK: %ze2 = zext i64 %iv2.inc to i128
|
|
; CHECK-NEXT: --> {(1 + (zext i64 {7,+,1}<nuw><nsw><%loop> to i128))<nuw><nsw>,+,1}<nuw><%loop2>
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 6, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add nsw i32 %iv, 1
|
|
%cond = icmp sle i32 %iv.inc, 50
|
|
br i1 %cond, label %loop, label %between
|
|
|
|
between:
|
|
%ze = zext i32 %iv.inc to i64
|
|
br label %loop2
|
|
|
|
loop2:
|
|
%iv2 = phi i64 [ %ze, %between ], [ %iv2.inc, %loop2 ]
|
|
%iv2.inc = add nuw i64 %iv2, 1
|
|
%cond2 = icmp sle i64 %iv2.inc, 50
|
|
br i1 %cond2, label %loop2, label %exit
|
|
|
|
exit:
|
|
%ze2 = zext i64 %iv2.inc to i128
|
|
ret void
|
|
}
|