[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:09:47 -07:00
|
|
|
; RUN: opt < %s -analyze -enable-new-pm=0 -scalar-evolution | FileCheck %s
|
|
|
|
|
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s
|
2018-03-01 06:56:48 +00:00
|
|
|
|
|
|
|
|
define void @merge_values_with_ranges(i32 *%a_len_ptr, i32 *%b_len_ptr, i1 %unknown_cond) {
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: Classifying expressions for: @merge_values_with_ranges
|
|
|
|
|
; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
|
|
|
|
|
; CHECK-NEXT: --> %len U: [0,2147483647) S: [0,2147483647)
|
|
|
|
|
|
|
|
|
|
entry:
|
|
|
|
|
br i1 %unknown_cond, label %if.true, label %if.false
|
|
|
|
|
|
|
|
|
|
if.true:
|
|
|
|
|
%len_a = load i32, i32* %a_len_ptr, !range !0
|
|
|
|
|
br label %merge
|
|
|
|
|
|
|
|
|
|
if.false:
|
|
|
|
|
%len_b = load i32, i32* %b_len_ptr, !range !0
|
|
|
|
|
br label %merge
|
|
|
|
|
|
|
|
|
|
merge:
|
|
|
|
|
%len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define void @merge_values_with_ranges_looped(i32 *%a_len_ptr, i32 *%b_len_ptr) {
|
|
|
|
|
|
|
|
|
|
; TODO: We could be much smarter here. So far we just make sure that we do not
|
|
|
|
|
; go into infinite loop analyzing these Phis.
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: Classifying expressions for: @merge_values_with_ranges_looped
|
|
|
|
|
; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
|
|
|
|
|
; CHECK-NEXT: --> %p1 U: full-set S: full-set
|
|
|
|
|
; CHECK: %p2 = phi i32 [ %len_b, %entry ], [ %p1, %loop ]
|
|
|
|
|
; CHECK-NEXT: --> %p2 U: full-set S: full-set
|
|
|
|
|
|
|
|
|
|
entry:
|
|
|
|
|
%len_a = load i32, i32* %a_len_ptr, !range !0
|
|
|
|
|
%len_b = load i32, i32* %b_len_ptr, !range !0
|
|
|
|
|
br label %loop
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
%p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
|
|
|
|
|
%p2 = phi i32 [ %len_b, %entry ], [ %p1, %loop ]
|
|
|
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ]
|
|
|
|
|
%iv.next = add i32 %iv, 1
|
|
|
|
|
%loop.cond = icmp slt i32 %iv.next, 100
|
|
|
|
|
br i1 %loop.cond, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
!0 = !{i32 0, i32 2147483647}
|
