mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-26 12:43: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
43 lines
1.9 KiB
LLVM
43 lines
1.9 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
|
; RUN: opt < %s -analyze -enable-new-pm=0 -scalar-evolution -scalar-evolution-huge-expr-threshold=1 | FileCheck %s
|
|
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-huge-expr-threshold=1 2>&1 | FileCheck %s
|
|
|
|
define void @test(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f) {
|
|
; CHECK-LABEL: 'test'
|
|
; CHECK-NEXT: Classifying expressions for: @test
|
|
; CHECK-NEXT: %add1 = add i32 %a, %b
|
|
; CHECK-NEXT: --> (%a + %b) U: full-set S: full-set
|
|
; CHECK-NEXT: %add2 = add i32 %add1, %c
|
|
; CHECK-NEXT: --> ((%a + %b) + %c) U: full-set S: full-set
|
|
; CHECK-NEXT: %add3 = add i32 %add2, %d
|
|
; CHECK-NEXT: --> (((%a + %b) + %c) + %d) U: full-set S: full-set
|
|
; CHECK-NEXT: %add4 = add i32 %add3, %e
|
|
; CHECK-NEXT: --> ((((%a + %b) + %c) + %d) + %e) U: full-set S: full-set
|
|
; CHECK-NEXT: %add5 = add i32 %add4, %f
|
|
; CHECK-NEXT: --> (((((%a + %b) + %c) + %d) + %e) + %f) U: full-set S: full-set
|
|
; CHECK-NEXT: %mul1 = mul i32 %a, %b
|
|
; CHECK-NEXT: --> (%a * %b) U: full-set S: full-set
|
|
; CHECK-NEXT: %mul2 = mul i32 %mul1, %c
|
|
; CHECK-NEXT: --> ((%a * %b) * %c) U: full-set S: full-set
|
|
; CHECK-NEXT: %mul3 = mul i32 %mul2, %d
|
|
; CHECK-NEXT: --> (((%a * %b) * %c) * %d) U: full-set S: full-set
|
|
; CHECK-NEXT: %mul4 = mul i32 %mul3, %e
|
|
; CHECK-NEXT: --> ((((%a * %b) * %c) * %d) * %e) U: full-set S: full-set
|
|
; CHECK-NEXT: %mul5 = mul i32 %mul4, %f
|
|
; CHECK-NEXT: --> (((((%a * %b) * %c) * %d) * %e) * %f) U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @test
|
|
;
|
|
%add1 = add i32 %a, %b
|
|
%add2 = add i32 %add1, %c
|
|
%add3 = add i32 %add2, %d
|
|
%add4 = add i32 %add3, %e
|
|
%add5 = add i32 %add4, %f
|
|
|
|
%mul1 = mul i32 %a, %b
|
|
%mul2 = mul i32 %mul1, %c
|
|
%mul3 = mul i32 %mul2, %d
|
|
%mul4 = mul i32 %mul3, %e
|
|
%mul5 = mul i32 %mul4, %f
|
|
ret void
|
|
}
|