1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 04:32:44 +01:00
llvm-mirror/test/Analysis/ScalarEvolution/avoid-assume-hang.ll
Arthur Eubanks 09cfe7939a [SCEV] Fix ScalarEvolution tests under NPM
Many tests use opt's -analyze feature, which does not translate well to
NPM and has better alternatives. The alternative here is to explicitly
add a pass that calls ScalarEvolution::print().

The legacy pass manager RUNs aren't changing, but they are now pinned to
the legacy pass manager.  For each legacy pass manager RUN, I added a
corresponding NPM RUN using the 'print<scalar-evolution>' pass. For
compatibility with update_analyze_test_checks.py and existing test
CHECKs, 'print<scalar-evolution>' now prints what -analyze prints per
function.

This was generated by the following Python script and failures were
manually fixed up:

import sys
for i in sys.argv:
    with open(i, 'r') as f:
        s = f.read()
    with open(i, 'w') as f:
        for l in s.splitlines():
            if "RUN:" in l and ' -analyze ' in l and '\\' not in l:
                f.write(l.replace(' -analyze ', ' -analyze -enable-new-pm=0 '))
                f.write('\n')
                f.write(l.replace(' -analyze ', ' -disable-output ').replace(' -scalar-evolution ', ' "-passes=print<scalar-evolution>" ').replace(" | ", " 2>&1 | "))
                f.write('\n')
            else:
                f.write(l)

There are a couple failures still in ScalarEvolution under NPM, but
those are due to other unrelated naming conflicts.

Reviewed By: asbirlea

Differential Revision: https://reviews.llvm.org/D83798
2020-07-16 11:24:07 -07:00

141 lines
3.3 KiB
LLVM

; RUN: opt %s -always-inline | opt -analyze -enable-new-pm=0 -scalar-evolution
; RUN: opt %s -always-inline 2>&1 | opt -disable-output -scalar-evolution
; There was optimization bug in ScalarEvolution, that causes too long
; compute time and stack overflow crash.
declare void @body(i32)
declare void @llvm.assume(i1)
define available_externally void @assume1(i64 %i.ext, i64 %a) alwaysinline {
%cmp0 = icmp ne i64 %i.ext, %a
call void @llvm.assume(i1 %cmp0)
%a1 = add i64 %a, 1
%cmp1 = icmp ne i64 %i.ext, %a1
call void @llvm.assume(i1 %cmp1)
%a2 = add i64 %a1, 1
%cmp2 = icmp ne i64 %i.ext, %a2
call void @llvm.assume(i1 %cmp2)
%a3 = add i64 %a2, 1
%cmp3 = icmp ne i64 %i.ext, %a3
call void @llvm.assume(i1 %cmp3)
%a4 = add i64 %a3, 1
%cmp4 = icmp ne i64 %i.ext, %a4
call void @llvm.assume(i1 %cmp4)
ret void
}
define available_externally void @assume2(i64 %i.ext, i64 %a) alwaysinline {
call void @assume1(i64 %i.ext, i64 %a)
%a1 = add i64 %a, 5
%cmp1 = icmp ne i64 %i.ext, %a1
call void @assume1(i64 %i.ext, i64 %a1)
%a2 = add i64 %a1, 5
%cmp2 = icmp ne i64 %i.ext, %a2
call void @assume1(i64 %i.ext, i64 %a2)
%a3 = add i64 %a2, 5
%cmp3 = icmp ne i64 %i.ext, %a3
call void @assume1(i64 %i.ext, i64 %a3)
%a4 = add i64 %a3, 5
%cmp4 = icmp ne i64 %i.ext, %a4
call void @assume1(i64 %i.ext, i64 %a4)
ret void
}
define available_externally void @assume3(i64 %i.ext, i64 %a) alwaysinline {
call void @assume2(i64 %i.ext, i64 %a)
%a1 = add i64 %a, 25
%cmp1 = icmp ne i64 %i.ext, %a1
call void @assume2(i64 %i.ext, i64 %a1)
%a2 = add i64 %a1, 25
%cmp2 = icmp ne i64 %i.ext, %a2
call void @assume2(i64 %i.ext, i64 %a2)
%a3 = add i64 %a2, 25
%cmp3 = icmp ne i64 %i.ext, %a3
call void @assume2(i64 %i.ext, i64 %a3)
%a4 = add i64 %a3, 25
%cmp4 = icmp ne i64 %i.ext, %a4
call void @assume2(i64 %i.ext, i64 %a4)
ret void
}
define available_externally void @assume4(i64 %i.ext, i64 %a) alwaysinline {
call void @assume3(i64 %i.ext, i64 %a)
%a1 = add i64 %a, 125
%cmp1 = icmp ne i64 %i.ext, %a1
call void @assume3(i64 %i.ext, i64 %a1)
%a2 = add i64 %a1, 125
%cmp2 = icmp ne i64 %i.ext, %a2
call void @assume3(i64 %i.ext, i64 %a2)
%a3 = add i64 %a2, 125
%cmp3 = icmp ne i64 %i.ext, %a3
call void @assume3(i64 %i.ext, i64 %a3)
%a4 = add i64 %a3, 125
%cmp4 = icmp ne i64 %i.ext, %a4
call void @assume3(i64 %i.ext, i64 %a4)
ret void
}
define available_externally void @assume5(i64 %i.ext, i64 %a) alwaysinline {
call void @assume4(i64 %i.ext, i64 %a)
%a1 = add i64 %a, 625
%cmp1 = icmp ne i64 %i.ext, %a1
call void @assume4(i64 %i.ext, i64 %a1)
%a2 = add i64 %a1, 625
%cmp2 = icmp ne i64 %i.ext, %a2
call void @assume4(i64 %i.ext, i64 %a2)
%a3 = add i64 %a2, 625
%cmp3 = icmp ne i64 %i.ext, %a3
call void @assume4(i64 %i.ext, i64 %a3)
%a4 = add i64 %a3, 625
%cmp4 = icmp ne i64 %i.ext, %a4
call void @assume4(i64 %i.ext, i64 %a4)
ret void
}
define void @fn(i32 %init) {
entry:
br label %loop
loop:
%i = phi i32 [%init, %entry], [%next, %loop]
call void @body(i32 %i)
%i.ext = zext i32 %i to i64
call void @assume5(i64 %i.ext, i64 500000000)
%i.next = add i64 %i.ext, 1
%next = trunc i64 %i.next to i32
%done = icmp eq i32 %i, 500000000
br i1 %done, label %exit, label %loop
exit:
ret void
}