mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 03:02:36 +01:00
c7dbf2fe82
Re-enable commit r323991 now that r325931 has been committed to make MachineOperand::isRenamable() check more conservative w.r.t. code changes and opt-in on a per-target basis. llvm-svn: 326208
148 lines
4.4 KiB
LLVM
148 lines
4.4 KiB
LLVM
; Test vector subtraction.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z13 | FileCheck %s
|
|
|
|
; Test a v16i8 subtraction.
|
|
define <16 x i8> @f1(<16 x i8> %dummy, <16 x i8> %val1, <16 x i8> %val2) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: vsb %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <16 x i8> %val1, %val2
|
|
ret <16 x i8> %ret
|
|
}
|
|
|
|
; Test a v8i16 subtraction.
|
|
define <8 x i16> @f2(<8 x i16> %dummy, <8 x i16> %val1, <8 x i16> %val2) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: vsh %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <8 x i16> %val1, %val2
|
|
ret <8 x i16> %ret
|
|
}
|
|
|
|
; Test a v4i32 subtraction.
|
|
define <4 x i32> @f3(<4 x i32> %dummy, <4 x i32> %val1, <4 x i32> %val2) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: vsf %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <4 x i32> %val1, %val2
|
|
ret <4 x i32> %ret
|
|
}
|
|
|
|
; Test a v2i64 subtraction.
|
|
define <2 x i64> @f4(<2 x i64> %dummy, <2 x i64> %val1, <2 x i64> %val2) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: vsg %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <2 x i64> %val1, %val2
|
|
ret <2 x i64> %ret
|
|
}
|
|
|
|
; Test a v4f32 subtraction, as an example of an operation that needs to be
|
|
; scalarized and reassembled. At present there's an unnecessary move that
|
|
; could be avoided with smarter ordering. It also isn't important whether
|
|
; the VSLDBs use the result of the VLRs or use %v24 and %v26 directly.
|
|
define <4 x float> @f5(<4 x float> %val1, <4 x float> %val2) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK-DAG: vlr %v[[A1:[0-5]]], %v24
|
|
; CHECK-DAG: vlr %v[[A2:[0-5]]], %v26
|
|
; CHECK-DAG: vrepf %v[[B1:[0-5]]], %v24, 1
|
|
; CHECK-DAG: vrepf %v[[B2:[0-5]]], %v26, 1
|
|
; CHECK-DAG: vrepf %v[[C1:[0-5]]], %v24, 2
|
|
; CHECK-DAG: vrepf %v[[C2:[0-5]]], %v26, 2
|
|
; CHECK-DAG: vrepf %v[[D1:[0-5]]], %v24, 3
|
|
; CHECK-DAG: vrepf %v[[D2:[0-5]]], %v26, 3
|
|
; CHECK-DAG: sebr %f[[A1]], %f[[A2]]
|
|
; CHECK-DAG: sebr %f[[B1]], %f[[B2]]
|
|
; CHECK-DAG: sebr %f[[C1]], %f[[C2]]
|
|
; CHECK-DAG: sebr %f[[D1]], %f[[D2]]
|
|
; CHECK-DAG: vmrhf [[HIGH:%v[0-9]+]], %v[[A1]], %v[[B1]]
|
|
; CHECK-DAG: vmrhf [[LOW:%v[0-9]+]], %v[[C1]], %v[[D1]]
|
|
; CHECK: vmrhg %v24, [[HIGH]], [[LOW]]
|
|
; CHECK: br %r14
|
|
%ret = fsub <4 x float> %val1, %val2
|
|
ret <4 x float> %ret
|
|
}
|
|
|
|
; Test a v2f64 subtraction.
|
|
define <2 x double> @f6(<2 x double> %dummy, <2 x double> %val1,
|
|
<2 x double> %val2) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK: vfsdb %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = fsub <2 x double> %val1, %val2
|
|
ret <2 x double> %ret
|
|
}
|
|
|
|
; Test an f64 subtraction that uses vector registers.
|
|
define double @f7(<2 x double> %val1, <2 x double> %val2) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: wfsdb %f0, %v24, %v26
|
|
; CHECK: br %r14
|
|
%scalar1 = extractelement <2 x double> %val1, i32 0
|
|
%scalar2 = extractelement <2 x double> %val2, i32 0
|
|
%ret = fsub double %scalar1, %scalar2
|
|
ret double %ret
|
|
}
|
|
|
|
; Test a v2i8 subtraction, which gets promoted to v16i8.
|
|
define <2 x i8> @f8(<2 x i8> %dummy, <2 x i8> %val1, <2 x i8> %val2) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: vsb %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <2 x i8> %val1, %val2
|
|
ret <2 x i8> %ret
|
|
}
|
|
|
|
; Test a v4i8 subtraction, which gets promoted to v16i8.
|
|
define <4 x i8> @f9(<4 x i8> %dummy, <4 x i8> %val1, <4 x i8> %val2) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: vsb %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <4 x i8> %val1, %val2
|
|
ret <4 x i8> %ret
|
|
}
|
|
|
|
; Test a v8i8 subtraction, which gets promoted to v16i8.
|
|
define <8 x i8> @f10(<8 x i8> %dummy, <8 x i8> %val1, <8 x i8> %val2) {
|
|
; CHECK-LABEL: f10:
|
|
; CHECK: vsb %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <8 x i8> %val1, %val2
|
|
ret <8 x i8> %ret
|
|
}
|
|
|
|
; Test a v2i16 subtraction, which gets promoted to v8i16.
|
|
define <2 x i16> @f11(<2 x i16> %dummy, <2 x i16> %val1, <2 x i16> %val2) {
|
|
; CHECK-LABEL: f11:
|
|
; CHECK: vsh %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <2 x i16> %val1, %val2
|
|
ret <2 x i16> %ret
|
|
}
|
|
|
|
; Test a v4i16 subtraction, which gets promoted to v8i16.
|
|
define <4 x i16> @f12(<4 x i16> %dummy, <4 x i16> %val1, <4 x i16> %val2) {
|
|
; CHECK-LABEL: f12:
|
|
; CHECK: vsh %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <4 x i16> %val1, %val2
|
|
ret <4 x i16> %ret
|
|
}
|
|
|
|
; Test a v2i32 subtraction, which gets promoted to v4i32.
|
|
define <2 x i32> @f13(<2 x i32> %dummy, <2 x i32> %val1, <2 x i32> %val2) {
|
|
; CHECK-LABEL: f13:
|
|
; CHECK: vsf %v24, %v26, %v28
|
|
; CHECK: br %r14
|
|
%ret = sub <2 x i32> %val1, %val2
|
|
ret <2 x i32> %ret
|
|
}
|
|
|
|
; Test a v2f32 subtraction, which gets promoted to v4f32.
|
|
define <2 x float> @f14(<2 x float> %val1, <2 x float> %val2) {
|
|
; No particular output expected, but must compile.
|
|
%ret = fsub <2 x float> %val1, %val2
|
|
ret <2 x float> %ret
|
|
}
|