mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 12:12:47 +01:00
c1d491f5a6
This allows these optimisations to apply to e.g. `urem i16` directly
before `urem` is promoted to i32 on architectures where i16 operations
are not intrinsically legal (such as on Aarch64). The legalization then
later can happen more directly and generated code gets a chance to avoid
wasting time on computing results in types wider than necessary, in the end.
Seems like mostly an improvement in terms of results at least as far as x86_64 and aarch64 are concerned, with a few regressions here and there. It also helps in preventing regressions in changes like {D87976}.
Reviewed By: lebedev.ri
Differential Revision: https://reviews.llvm.org/D88785
254 lines
7.4 KiB
LLVM
254 lines
7.4 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
|
; RUN: llc -mtriple=aarch64-unknown-linux-gnu < %s | FileCheck %s
|
|
|
|
;------------------------------------------------------------------------------;
|
|
; Odd divisors
|
|
;------------------------------------------------------------------------------;
|
|
|
|
define i32 @test_urem_odd(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_odd:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #52429
|
|
; CHECK-NEXT: movk w8, #52428, lsl #16
|
|
; CHECK-NEXT: mov w9, #13108
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: movk w9, #13107, lsl #16
|
|
; CHECK-NEXT: cmp w8, w9
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 5
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
define i32 @test_urem_odd_25(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_odd_25:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #23593
|
|
; CHECK-NEXT: movk w8, #49807, lsl #16
|
|
; CHECK-NEXT: mov w9, #28836
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: movk w9, #2621, lsl #16
|
|
; CHECK-NEXT: cmp w8, w9
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 25
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; This is like test_urem_odd, except the divisor has bit 30 set.
|
|
define i32 @test_urem_odd_bit30(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_odd_bit30:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #43691
|
|
; CHECK-NEXT: movk w8, #27306, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: cmp w8, #4 // =4
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 1073741827
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; This is like test_urem_odd, except the divisor has bit 31 set.
|
|
define i32 @test_urem_odd_bit31(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_odd_bit31:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #43691
|
|
; CHECK-NEXT: movk w8, #10922, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: cmp w8, #2 // =2
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 2147483651
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
;------------------------------------------------------------------------------;
|
|
; Even divisors
|
|
;------------------------------------------------------------------------------;
|
|
|
|
define i16 @test_urem_even(i16 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_even:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #28087
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: and w9, w8, #0xfffc
|
|
; CHECK-NEXT: lsr w9, w9, #1
|
|
; CHECK-NEXT: bfi w9, w8, #15, #17
|
|
; CHECK-NEXT: ubfx w8, w9, #1, #15
|
|
; CHECK-NEXT: cmp w8, #2340 // =2340
|
|
; CHECK-NEXT: cset w0, hi
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i16 %X, 14
|
|
%cmp = icmp ne i16 %urem, 0
|
|
%ret = zext i1 %cmp to i16
|
|
ret i16 %ret
|
|
}
|
|
|
|
define i32 @test_urem_even_100(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_even_100:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #23593
|
|
; CHECK-NEXT: movk w8, #49807, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: mov w9, #23593
|
|
; CHECK-NEXT: ror w8, w8, #2
|
|
; CHECK-NEXT: movk w9, #655, lsl #16
|
|
; CHECK-NEXT: cmp w8, w9
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 100
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; This is like test_urem_even, except the divisor has bit 30 set.
|
|
define i32 @test_urem_even_bit30(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_even_bit30:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #20165
|
|
; CHECK-NEXT: movk w8, #64748, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: ror w8, w8, #3
|
|
; CHECK-NEXT: cmp w8, #4 // =4
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 1073741928
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; This is like test_urem_odd, except the divisor has bit 31 set.
|
|
define i32 @test_urem_even_bit31(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_even_bit31:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #64251
|
|
; CHECK-NEXT: movk w8, #47866, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: ror w8, w8, #1
|
|
; CHECK-NEXT: cmp w8, #2 // =2
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 2147483750
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
;------------------------------------------------------------------------------;
|
|
; Special case
|
|
;------------------------------------------------------------------------------;
|
|
|
|
; 'NE' predicate is fine too.
|
|
define i32 @test_urem_odd_setne(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_odd_setne:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #52429
|
|
; CHECK-NEXT: movk w8, #52428, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: mov w9, #858993459
|
|
; CHECK-NEXT: cmp w8, w9
|
|
; CHECK-NEXT: cset w0, hi
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 5
|
|
%cmp = icmp ne i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; The fold is only valid for positive divisors, negative-ones should be negated.
|
|
define i32 @test_urem_negative_odd(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_negative_odd:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #858993459
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: cmp w8, #1 // =1
|
|
; CHECK-NEXT: cset w0, hi
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, -5
|
|
%cmp = icmp ne i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
define i32 @test_urem_negative_even(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_negative_even:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w8, #37449
|
|
; CHECK-NEXT: movk w8, #51492, lsl #16
|
|
; CHECK-NEXT: mul w8, w0, w8
|
|
; CHECK-NEXT: ror w8, w8, #1
|
|
; CHECK-NEXT: cmp w8, #1 // =1
|
|
; CHECK-NEXT: cset w0, hi
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, -14
|
|
%cmp = icmp ne i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
;------------------------------------------------------------------------------;
|
|
; Negative tests
|
|
;------------------------------------------------------------------------------;
|
|
|
|
; We can lower remainder of division by one much better elsewhere.
|
|
define i32 @test_urem_one(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_one:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: mov w0, #1
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 1
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; We can lower remainder of division by powers of two much better elsewhere.
|
|
define i32 @test_urem_pow2(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_pow2:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: tst w0, #0xf
|
|
; CHECK-NEXT: cset w0, eq
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 16
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; The fold is only valid for positive divisors, and we can't negate INT_MIN.
|
|
define i32 @test_urem_int_min(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_int_min:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: tst w0, #0x7fffffff
|
|
; CHECK-NEXT: cset w0, eq
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 2147483648
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|
|
|
|
; We can lower remainder of division by all-ones much better elsewhere.
|
|
define i32 @test_urem_allones(i32 %X) nounwind {
|
|
; CHECK-LABEL: test_urem_allones:
|
|
; CHECK: // %bb.0:
|
|
; CHECK-NEXT: neg w8, w0
|
|
; CHECK-NEXT: cmp w8, #2 // =2
|
|
; CHECK-NEXT: cset w0, lo
|
|
; CHECK-NEXT: ret
|
|
%urem = urem i32 %X, 4294967295
|
|
%cmp = icmp eq i32 %urem, 0
|
|
%ret = zext i1 %cmp to i32
|
|
ret i32 %ret
|
|
}
|