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
34 lines
1.5 KiB
LLVM
34 lines
1.5 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-classify-expressions=0 | FileCheck %s
|
|
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
|
|
|
|
; ScalarEvolution should be able to compute a loop exit value for %indvar.i8.
|
|
|
|
define void @another_count_down_signed(double* %d, i64 %n) nounwind {
|
|
; CHECK-LABEL: 'another_count_down_signed'
|
|
; CHECK-NEXT: Determining loop execution counts for: @another_count_down_signed
|
|
; CHECK-NEXT: Loop %loop: backedge-taken count is (-11 + %n)
|
|
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-11 + %n)
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %loop: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop: ; preds = %loop, %entry
|
|
%indvar = phi i64 [ %n, %entry ], [ %indvar.next, %loop ] ; <i64> [#uses=4]
|
|
%s0 = shl i64 %indvar, 8 ; <i64> [#uses=1]
|
|
%indvar.i8 = ashr i64 %s0, 8 ; <i64> [#uses=1]
|
|
%t0 = getelementptr double, double* %d, i64 %indvar.i8 ; <double*> [#uses=2]
|
|
%t1 = load double, double* %t0 ; <double> [#uses=1]
|
|
%t2 = fmul double %t1, 1.000000e-01 ; <double> [#uses=1]
|
|
store double %t2, double* %t0
|
|
%indvar.next = sub i64 %indvar, 1 ; <i64> [#uses=2]
|
|
%exitcond = icmp eq i64 %indvar.next, 10 ; <i1> [#uses=1]
|
|
br i1 %exitcond, label %return, label %loop
|
|
|
|
return: ; preds = %loop
|
|
ret void
|
|
}
|