mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-07 11:38:04 +00:00
54c4fb4a3f
After legalization, scalar SETCC has an i32 result type on AArch64. The i1 requirement seems too conservative, replace it with an assert. This also means that we now can run after legalization. That should also be fine, since the ops legalizer runs again after each combine, and all types created all have the same sizes as the (legal) inputs. Exposed by r235917; while there, robustize its tests (bsl also uses the register it defines). llvm-svn: 235922
81 lines
2.9 KiB
LLVM
81 lines
2.9 KiB
LLVM
; RUN: llc %s -o - -verify-machineinstrs -mtriple=arm64-none-linux-gnu | FileCheck %s
|
|
|
|
; This is the analogue of AArch64's file of the same name. It's mostly testing
|
|
; some form of correct lowering occurs, the tests are a little artificial but I
|
|
; strongly suspect there's room for improved CodeGen (FIXME).
|
|
|
|
define i64 @test_sext_extr_cmp_0(<1 x i64> %v1, <1 x i64> %v2) {
|
|
; CHECK-LABEL: test_sext_extr_cmp_0:
|
|
; CHECK: cmp {{x[0-9]+}}, {{x[0-9]+}}
|
|
; CHECK: cset
|
|
%1 = icmp sge <1 x i64> %v1, %v2
|
|
%2 = extractelement <1 x i1> %1, i32 0
|
|
%vget_lane = sext i1 %2 to i64
|
|
ret i64 %vget_lane
|
|
}
|
|
|
|
define i64 @test_sext_extr_cmp_1(<1 x double> %v1, <1 x double> %v2) {
|
|
; CHECK-LABEL: test_sext_extr_cmp_1:
|
|
; CHECK: fcmp {{d[0-9]+}}, {{d[0-9]+}}
|
|
%1 = fcmp oeq <1 x double> %v1, %v2
|
|
%2 = extractelement <1 x i1> %1, i32 0
|
|
%vget_lane = sext i1 %2 to i64
|
|
ret i64 %vget_lane
|
|
}
|
|
|
|
define <1 x i64> @test_select_v1i1_0(<1 x i64> %v1, <1 x i64> %v2, <1 x i64> %v3) {
|
|
; CHECK-LABEL: test_select_v1i1_0:
|
|
; CHECK: cmeq d{{[0-9]+}}, d{{[0-9]+}}, d{{[0-9]+}}
|
|
; CHECK: bic v{{[0-9]+}}.8b, v{{[0-9]+}}.8b, v{{[0-9]+}}.8b
|
|
%1 = icmp eq <1 x i64> %v1, %v2
|
|
%res = select <1 x i1> %1, <1 x i64> zeroinitializer, <1 x i64> %v3
|
|
ret <1 x i64> %res
|
|
}
|
|
|
|
define <1 x i64> @test_select_v1i1_1(<1 x double> %v1, <1 x double> %v2, <1 x i64> %v3) {
|
|
; CHECK-LABEL: test_select_v1i1_1:
|
|
; CHECK: fcmeq d{{[0-9]+}}, d{{[0-9]+}}, d{{[0-9]+}}
|
|
; CHECK: bic v{{[0-9]+}}.8b, v{{[0-9]+}}.8b, v{{[0-9]+}}.8b
|
|
%1 = fcmp oeq <1 x double> %v1, %v2
|
|
%res = select <1 x i1> %1, <1 x i64> zeroinitializer, <1 x i64> %v3
|
|
ret <1 x i64> %res
|
|
}
|
|
|
|
define <1 x double> @test_select_v1i1_2(<1 x i64> %v1, <1 x i64> %v2, <1 x double> %v3) {
|
|
; CHECK-LABEL: test_select_v1i1_2:
|
|
; CHECK: cmeq d{{[0-9]+}}, d{{[0-9]+}}, d{{[0-9]+}}
|
|
; CHECK: bic v{{[0-9]+}}.8b, v{{[0-9]+}}.8b, v{{[0-9]+}}.8b
|
|
%1 = icmp eq <1 x i64> %v1, %v2
|
|
%res = select <1 x i1> %1, <1 x double> zeroinitializer, <1 x double> %v3
|
|
ret <1 x double> %res
|
|
}
|
|
|
|
; For v1i64, it's not clear which of the vector or scalar compare is better.
|
|
; Let's stick to the vector form, like for all other vector selects fed by a
|
|
; scalar setcc. If anything, it exposes more ILP.
|
|
define <1 x i64> @test_select_v1i1_3(i64 %lhs, i64 %rhs, <1 x i64> %v3) {
|
|
; CHECK-LABEL: test_select_v1i1_3:
|
|
; CHECK: fmov d{{[0-9]+}}, x{{[0-9]+}}
|
|
; CHECK: fmov d{{[0-9]+}}, x{{[0-9]+}}
|
|
; CHECK: cmeq d{{[0-9]+}}, d{{[0-9]+}}, d{{[0-9]+}}
|
|
; CHECK: bic v{{[0-9]+}}.8b, v{{[0-9]+}}.8b, v{{[0-9]+}}.8b
|
|
%tst = icmp eq i64 %lhs, %rhs
|
|
%evil = insertelement <1 x i1> undef, i1 %tst, i32 0
|
|
%res = select <1 x i1> %evil, <1 x i64> zeroinitializer, <1 x i64> %v3
|
|
ret <1 x i64> %res
|
|
}
|
|
|
|
define i32 @test_br_extr_cmp(<1 x i64> %v1, <1 x i64> %v2) {
|
|
; CHECK-LABEL: test_br_extr_cmp:
|
|
; CHECK: cmp x{{[0-9]+}}, x{{[0-9]+}}
|
|
%1 = icmp eq <1 x i64> %v1, %v2
|
|
%2 = extractelement <1 x i1> %1, i32 0
|
|
br i1 %2, label %if.end, label %if.then
|
|
|
|
if.then:
|
|
ret i32 0;
|
|
|
|
if.end:
|
|
ret i32 1;
|
|
}
|