mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 03:02:36 +01:00
09cfe7939a
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
89 lines
2.1 KiB
LLVM
89 lines
2.1 KiB
LLVM
; RUN: opt < %s -scalar-evolution -analyze -enable-new-pm=0 | FileCheck %s
|
|
; RUN: opt < %s "-passes=print<scalar-evolution>" -disable-output 2>&1 | FileCheck %s
|
|
|
|
define void @test1(i32 %n) {
|
|
entry:
|
|
%s = mul i32 %n, 96
|
|
br label %loop
|
|
loop:
|
|
%i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
|
|
%i.next = add i32 %i, 32
|
|
%t = icmp ne i32 %i.next, %s
|
|
br i1 %t, label %loop, label %exit
|
|
exit:
|
|
ret void
|
|
|
|
; CHECK-LABEL: @test1
|
|
; CHECK: Loop %loop: backedge-taken count is ((-32 + (96 * %n)) /u 32)
|
|
; CHECK: Loop %loop: max backedge-taken count is 134217727
|
|
}
|
|
|
|
; PR19183
|
|
define i32 @test2(i32 %n) {
|
|
entry:
|
|
%s = and i32 %n, -32
|
|
br label %loop
|
|
loop:
|
|
%i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
|
|
%i.next = add i32 %i, 32
|
|
%t = icmp ne i32 %i.next, %s
|
|
br i1 %t, label %loop, label %exit
|
|
exit:
|
|
ret i32 %i
|
|
|
|
; CHECK-LABEL: @test2
|
|
; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * (%n /u 32))<nuw>) /u 32)
|
|
; CHECK: Loop %loop: max backedge-taken count is 134217727
|
|
}
|
|
|
|
define void @test3(i32 %n) {
|
|
entry:
|
|
%s = mul i32 %n, 96
|
|
br label %loop
|
|
loop:
|
|
%i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
|
|
%i.next = add i32 %i, 96
|
|
%t = icmp ne i32 %i.next, %s
|
|
br i1 %t, label %loop, label %exit
|
|
exit:
|
|
ret void
|
|
|
|
; CHECK-LABEL: @test3
|
|
; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * %n)) /u 32)
|
|
; CHECK: Loop %loop: max backedge-taken count is 134217727
|
|
}
|
|
|
|
define void @test4(i32 %n) {
|
|
entry:
|
|
%s = mul i32 %n, 4
|
|
br label %loop
|
|
loop:
|
|
%i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
|
|
%i.next = add i32 %i, 12
|
|
%t = icmp ne i32 %i.next, %s
|
|
br i1 %t, label %loop, label %exit
|
|
exit:
|
|
ret void
|
|
|
|
; CHECK-LABEL: @test4
|
|
; CHECK: Loop %loop: backedge-taken count is ((-4 + (-1431655764 * %n)) /u 4)
|
|
; CHECK: Loop %loop: max backedge-taken count is 1073741823
|
|
}
|
|
|
|
define void @test5(i32 %n) {
|
|
entry:
|
|
%s = mul i32 %n, 4
|
|
br label %loop
|
|
loop:
|
|
%i = phi i32 [ %s, %entry ], [ %i.next, %loop ]
|
|
%i.next = add i32 %i, -4
|
|
%t = icmp ne i32 %i.next, 0
|
|
br i1 %t, label %loop, label %exit
|
|
exit:
|
|
ret void
|
|
|
|
; CHECK-LABEL: @test5
|
|
; CHECK: Loop %loop: backedge-taken count is ((-4 + (4 * %n)) /u 4)
|
|
; CHECK: Loop %loop: max backedge-taken count is 1073741823
|
|
}
|