mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-01 05:01:59 +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
41 lines
1.3 KiB
LLVM
41 lines
1.3 KiB
LLVM
; RUN: opt < %s -analyze -enable-new-pm=0 -iv-users -S | FileCheck %s
|
|
; RUN: opt < %s -disable-output "-passes=print<iv-users>" -S 2>&1 | FileCheck %s
|
|
|
|
; This is a regression test for the commit rL327362.
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128-ni:1"
|
|
target triple = "x86_64-unknown-linux-gnu"
|
|
|
|
define void @test(i64 %a, i64* %p) {
|
|
entry:
|
|
br label %first_loop
|
|
|
|
first_loop:
|
|
%i = phi i64 [20, %entry], [%i.next, %first_loop]
|
|
%i.next = add nuw nsw i64 %i, 1
|
|
%cond1 = icmp ult i64 %i.next, %a
|
|
br i1 %cond1, label %first_loop, label %middle_block
|
|
|
|
middle_block:
|
|
%b = load i64, i64* %p
|
|
%cmp = icmp ult i64 %i, %b
|
|
; When SCEV will try to compute the initial value for %j
|
|
; it will observe umax generated by this select.
|
|
; When it will try to simplify this umax it will invoke
|
|
; isKnownPredicate with AddRec for %i and unknown SCEV for %b.
|
|
; As a result we find MDL == first_loop where %b is not available
|
|
; at loop entry.
|
|
; CHECK: IV Users for loop %second_loop with backedge-taken count{{.*}}umax
|
|
%s = select i1 %cmp, i64 %i, i64 %b
|
|
br label %second_loop
|
|
|
|
second_loop:
|
|
%j = phi i64 [%s, %middle_block], [%j.next, %second_loop]
|
|
%j.next = add nuw nsw i64 %j, 1
|
|
%cond2 = icmp ult i64 %j.next, 100
|
|
br i1 %cond2, label %second_loop, label %return
|
|
|
|
return:
|
|
ret void
|
|
}
|