mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +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
95 lines
3.6 KiB
LLVM
95 lines
3.6 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
|
; RUN: opt -S -analyze -enable-new-pm=0 -scalar-evolution < %s | FileCheck %s
|
|
; RUN: opt -S -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s
|
|
|
|
; These testcases aren't *identical* but they have the same/similar meaning.
|
|
|
|
; The obvious case.
|
|
define i32 @mul(i32 %val, i32 %num) nounwind {
|
|
; CHECK-LABEL: 'mul'
|
|
; CHECK-NEXT: Classifying expressions for: @mul
|
|
; CHECK-NEXT: %tmp1 = mul i32 %val, %num
|
|
; CHECK-NEXT: --> (%val * %num) U: full-set S: full-set
|
|
; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, %num
|
|
; CHECK-NEXT: --> ((%val * %num) /u %num) U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @mul
|
|
;
|
|
%tmp1 = mul i32 %val, %num
|
|
%tmp2 = udiv i32 %tmp1, %num
|
|
ret i32 %tmp2
|
|
}
|
|
|
|
; Or, it could be any number of equivalent patterns with mask:
|
|
; a) x & (1 << nbits) - 1
|
|
; b) x & ~(-1 << nbits)
|
|
; c) x & (-1 >> (32 - y))
|
|
; d) x << (32 - y) >> (32 - y)
|
|
|
|
define i32 @mask_a(i32 %val, i32 %numlowbits) nounwind {
|
|
; CHECK-LABEL: 'mask_a'
|
|
; CHECK-NEXT: Classifying expressions for: @mask_a
|
|
; CHECK-NEXT: %onebit = shl i32 1, %numlowbits
|
|
; CHECK-NEXT: --> %onebit U: full-set S: full-set
|
|
; CHECK-NEXT: %mask = add nsw i32 %onebit, -1
|
|
; CHECK-NEXT: --> (-1 + %onebit) U: full-set S: full-set
|
|
; CHECK-NEXT: %masked = and i32 %mask, %val
|
|
; CHECK-NEXT: --> %masked U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @mask_a
|
|
;
|
|
%onebit = shl i32 1, %numlowbits
|
|
%mask = add nsw i32 %onebit, -1
|
|
%masked = and i32 %mask, %val
|
|
ret i32 %masked
|
|
}
|
|
|
|
define i32 @mask_b(i32 %val, i32 %numlowbits) nounwind {
|
|
; CHECK-LABEL: 'mask_b'
|
|
; CHECK-NEXT: Classifying expressions for: @mask_b
|
|
; CHECK-NEXT: %notmask = shl i32 -1, %numlowbits
|
|
; CHECK-NEXT: --> %notmask U: full-set S: full-set
|
|
; CHECK-NEXT: %mask = xor i32 %notmask, -1
|
|
; CHECK-NEXT: --> (-1 + (-1 * %notmask)) U: full-set S: full-set
|
|
; CHECK-NEXT: %masked = and i32 %mask, %val
|
|
; CHECK-NEXT: --> %masked U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @mask_b
|
|
;
|
|
%notmask = shl i32 -1, %numlowbits
|
|
%mask = xor i32 %notmask, -1
|
|
%masked = and i32 %mask, %val
|
|
ret i32 %masked
|
|
}
|
|
|
|
define i32 @mask_c(i32 %val, i32 %numlowbits) nounwind {
|
|
; CHECK-LABEL: 'mask_c'
|
|
; CHECK-NEXT: Classifying expressions for: @mask_c
|
|
; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits
|
|
; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
|
|
; CHECK-NEXT: %mask = lshr i32 -1, %numhighbits
|
|
; CHECK-NEXT: --> %mask U: full-set S: full-set
|
|
; CHECK-NEXT: %masked = and i32 %mask, %val
|
|
; CHECK-NEXT: --> %masked U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @mask_c
|
|
;
|
|
%numhighbits = sub i32 32, %numlowbits
|
|
%mask = lshr i32 -1, %numhighbits
|
|
%masked = and i32 %mask, %val
|
|
ret i32 %masked
|
|
}
|
|
|
|
define i32 @mask_d(i32 %val, i32 %numlowbits) nounwind {
|
|
; CHECK-LABEL: 'mask_d'
|
|
; CHECK-NEXT: Classifying expressions for: @mask_d
|
|
; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits
|
|
; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
|
|
; CHECK-NEXT: %highbitscleared = shl i32 %val, %numhighbits
|
|
; CHECK-NEXT: --> %highbitscleared U: full-set S: full-set
|
|
; CHECK-NEXT: %masked = lshr i32 %highbitscleared, %numhighbits
|
|
; CHECK-NEXT: --> %masked U: full-set S: full-set
|
|
; CHECK-NEXT: Determining loop execution counts for: @mask_d
|
|
;
|
|
%numhighbits = sub i32 32, %numlowbits
|
|
%highbitscleared = shl i32 %val, %numhighbits
|
|
%masked = lshr i32 %highbitscleared, %numhighbits
|
|
ret i32 %masked
|
|
}
|