9adbb5cb3a
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
130 lines
2.9 KiB
LLVM
130 lines
2.9 KiB
LLVM
; RUN: opt -analyze -enable-new-pm=0 -scalar-evolution -S < %s | FileCheck %s
|
|
; RUN: opt -disable-output "-passes=print<scalar-evolution>" -S < %s 2>&1 | FileCheck %s
|
|
|
|
define i16 @test1(i8 %x) {
|
|
%A = zext i8 %x to i12
|
|
%B = sext i12 %A to i16
|
|
; CHECK: zext i8 %x to i16
|
|
ret i16 %B
|
|
}
|
|
|
|
define i8 @test2(i8 %x) {
|
|
%A = zext i8 %x to i16
|
|
%B = add i16 %A, 1025
|
|
%C = trunc i16 %B to i8
|
|
; CHECK: (1 + %x)
|
|
ret i8 %C
|
|
}
|
|
|
|
define i8 @test3(i8 %x) {
|
|
%A = zext i8 %x to i16
|
|
%B = mul i16 %A, 1027
|
|
%C = trunc i16 %B to i8
|
|
; CHECK: (3 * %x)
|
|
ret i8 %C
|
|
}
|
|
|
|
define void @test4(i32 %x, i32 %y) {
|
|
entry:
|
|
%Y = and i32 %y, 3
|
|
br label %loop
|
|
loop:
|
|
%A = phi i32 [0, %entry], [%I, %loop]
|
|
%rand1 = icmp sgt i32 %A, %Y
|
|
%Z1 = select i1 %rand1, i32 %A, i32 %Y
|
|
%rand2 = icmp ugt i32 %A, %Z1
|
|
%Z2 = select i1 %rand2, i32 %A, i32 %Z1
|
|
; CHECK: %Z2 =
|
|
; CHECK-NEXT: --> ([[EXPR:.*]]){{ U: [^ ]+ S: [^ ]+}}{{ +}}Exits: 20
|
|
%B = trunc i32 %Z2 to i16
|
|
%C = sext i16 %B to i30
|
|
; CHECK: %C =
|
|
; CHECK-NEXT: (trunc i32 ([[EXPR]]) to i30)
|
|
%D = sext i16 %B to i32
|
|
; CHECK: %D =
|
|
; CHECK-NEXT: ([[EXPR]])
|
|
%E = sext i16 %B to i34
|
|
; CHECK: %E =
|
|
; CHECK-NEXT: (zext i32 ([[EXPR]]) to i34)
|
|
%F = zext i16 %B to i30
|
|
; CHECK: %F =
|
|
; CHECK-NEXT: (trunc i32 ([[EXPR]]) to i30
|
|
%G = zext i16 %B to i32
|
|
; CHECK: %G =
|
|
; CHECK-NEXT: ([[EXPR]])
|
|
%H = zext i16 %B to i34
|
|
; CHECK: %H =
|
|
; CHECK-NEXT: (zext i32 ([[EXPR]]) to i34)
|
|
%I = add i32 %A, 1
|
|
%0 = icmp ne i32 %A, 20
|
|
br i1 %0, label %loop, label %exit
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
define void @test5(i32 %i) {
|
|
; CHECK-LABEL: @test5
|
|
%A = and i32 %i, 1
|
|
; CHECK: --> (zext i1 (trunc i32 %i to i1) to i32)
|
|
%B = and i32 %i, 2
|
|
; CHECK: --> (2 * (zext i1 (trunc i32 (%i /u 2) to i1) to i32))
|
|
%C = and i32 %i, 63
|
|
; CHECK: --> (zext i6 (trunc i32 %i to i6) to i32)
|
|
%D = and i32 %i, 126
|
|
; CHECK: --> (2 * (zext i6 (trunc i32 (%i /u 2) to i6) to i32))
|
|
%E = and i32 %i, 64
|
|
; CHECK: --> (64 * (zext i1 (trunc i32 (%i /u 64) to i1) to i32))
|
|
%F = and i32 %i, -2147483648
|
|
; CHECK: --> (-2147483648 * (%i /u -2147483648))
|
|
ret void
|
|
}
|
|
|
|
define void @test6(i8 %x) {
|
|
; CHECK-LABEL: @test6
|
|
%A = zext i8 %x to i16
|
|
%B = shl nuw i16 %A, 8
|
|
%C = and i16 %B, -2048
|
|
; CHECK: --> (2048 * ((zext i8 %x to i16) /u 8))
|
|
ret void
|
|
}
|
|
|
|
; PR22960
|
|
define void @test7(i32 %A) {
|
|
; CHECK-LABEL: @test7
|
|
%B = sext i32 %A to i64
|
|
%C = zext i32 %A to i64
|
|
%D = sub i64 %B, %C
|
|
%E = trunc i64 %D to i16
|
|
; CHECK: %E
|
|
; CHECK-NEXT: --> 0
|
|
ret void
|
|
}
|
|
|
|
define i64 @test8(i64 %a) {
|
|
; CHECK-LABEL: @test8
|
|
%t0 = udiv i64 %a, 56
|
|
%t1 = udiv i64 %t0, 56
|
|
; CHECK: %t1
|
|
; CHECK-NEXT: --> (%a /u 3136)
|
|
ret i64 %t1
|
|
}
|
|
|
|
define i64 @test9(i64 %a) {
|
|
; CHECK-LABEL: @test9
|
|
%t0 = udiv i64 %a, 100000000000000
|
|
%t1 = udiv i64 %t0, 100000000000000
|
|
; CHECK: %t1
|
|
; CHECK-NEXT: --> 0
|
|
ret i64 %t1
|
|
}
|
|
|
|
define i64 @test10(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: @test10
|
|
%t0 = udiv i64 %a, 100000000000000
|
|
%t1 = udiv i64 %t0, 100000000000000
|
|
%t2 = mul i64 %b, %t1
|
|
; CHECK: %t2
|
|
; CHECK-NEXT: --> 0
|
|
ret i64 %t2
|
|
}
|