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
29 lines
901 B
LLVM
29 lines
901 B
LLVM
; RUN: opt < %s -analyze -enable-new-pm=0 -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
|
|
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-max-iterations=0 2>&1 | FileCheck %s
|
|
; PR2607
|
|
|
|
define i32 @_Z1aj(i32 %j) nounwind {
|
|
entry:
|
|
icmp sgt i32 0, %j ; <i1>:0 [#uses=1]
|
|
br i1 %0, label %bb.preheader, label %return
|
|
|
|
bb.preheader: ; preds = %entry
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb, %bb.preheader
|
|
%i.01 = phi i32 [ %1, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
|
|
add i32 %i.01, -1 ; <i32>:1 [#uses=3]
|
|
icmp sgt i32 %1, %j ; <i1>:2 [#uses=1]
|
|
br i1 %2, label %bb, label %return.loopexit
|
|
|
|
return.loopexit: ; preds = %bb
|
|
br label %return
|
|
|
|
return: ; preds = %return.loopexit, %entry
|
|
%i.0.lcssa = phi i32 [ 0, %entry ], [ %1, %return.loopexit ] ; <i32> [#uses=1]
|
|
ret i32 %i.0.lcssa
|
|
}
|
|
|
|
; CHECK: backedge-taken count is (-1 + (-1 * %j))
|
|
|