2014-04-04 00:01:44 +08:00
|
|
|
; RUN: llc -mtriple=arm-eabi -mattr=+neon %s -o - | FileCheck %s
|
2009-08-22 04:54:19 +08:00
|
|
|
|
|
|
|
define <8 x i8> @vtrni8(<8 x i8>* %A, <8 x i8>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrni8:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d16, [r1]
|
|
|
|
; CHECK-NEXT: vldr d17, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.8 d17, d16
|
|
|
|
; CHECK-NEXT: vadd.i8 d16, d17, d16
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <8 x i8>, <8 x i8>* %A
|
|
|
|
%tmp2 = load <8 x i8>, <8 x i8>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <8 x i32> <i32 0, i32 8, i32 2, i32 10, i32 4, i32 12, i32 6, i32 14>
|
|
|
|
%tmp4 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <8 x i32> <i32 1, i32 9, i32 3, i32 11, i32 5, i32 13, i32 7, i32 15>
|
|
|
|
%tmp5 = add <8 x i8> %tmp3, %tmp4
|
|
|
|
ret <8 x i8> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <16 x i8> @vtrni8_Qres(<8 x i8>* %A, <8 x i8>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrni8_Qres:
|
|
|
|
; CHECK: @ BB#0:
|
[ARM] Look through concat when lowering in-place shuffles (VZIP, ..)
Currently, we canonicalize shuffles that produce a result larger than
their operands with:
shuffle(concat(v1, undef), concat(v2, undef))
->
shuffle(concat(v1, v2), undef)
because we can access quad vectors (see PerformVECTOR_SHUFFLECombine).
This is useful in the general case, but there are special cases where
native shuffles produce larger results: the two-result ops.
We can look through the concat when lowering them:
shuffle(concat(v1, v2), undef)
->
concat(VZIP(v1, v2):0, :1)
This lets us generate the native shuffles instead of scalarizing to
dozens of VMOVs.
Differential Revision: http://reviews.llvm.org/D10424
llvm-svn: 240118
2015-06-19 10:32:35 +08:00
|
|
|
; CHECK-NEXT: vldr d17, [r1]
|
|
|
|
; CHECK-NEXT: vldr d16, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.8 d16, d17
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <8 x i8>, <8 x i8>* %A
|
|
|
|
%tmp2 = load <8 x i8>, <8 x i8>* %B
|
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <16 x i32> <i32 0, i32 8, i32 2, i32 10, i32 4, i32 12, i32 6, i32 14, i32 1, i32 9, i32 3, i32 11, i32 5, i32 13, i32 7, i32 15>
|
|
|
|
ret <16 x i8> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <4 x i16> @vtrni16(<4 x i16>* %A, <4 x i16>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrni16:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d16, [r1]
|
|
|
|
; CHECK-NEXT: vldr d17, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.16 d17, d16
|
|
|
|
; CHECK-NEXT: vadd.i16 d16, d17, d16
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <4 x i16>, <4 x i16>* %A
|
|
|
|
%tmp2 = load <4 x i16>, <4 x i16>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <4 x i16> %tmp1, <4 x i16> %tmp2, <4 x i32> <i32 0, i32 4, i32 2, i32 6>
|
|
|
|
%tmp4 = shufflevector <4 x i16> %tmp1, <4 x i16> %tmp2, <4 x i32> <i32 1, i32 5, i32 3, i32 7>
|
|
|
|
%tmp5 = add <4 x i16> %tmp3, %tmp4
|
|
|
|
ret <4 x i16> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <8 x i16> @vtrni16_Qres(<4 x i16>* %A, <4 x i16>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrni16_Qres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d17, [r1]
|
[ARM] Look through concat when lowering in-place shuffles (VZIP, ..)
Currently, we canonicalize shuffles that produce a result larger than
their operands with:
shuffle(concat(v1, undef), concat(v2, undef))
->
shuffle(concat(v1, v2), undef)
because we can access quad vectors (see PerformVECTOR_SHUFFLECombine).
This is useful in the general case, but there are special cases where
native shuffles produce larger results: the two-result ops.
We can look through the concat when lowering them:
shuffle(concat(v1, v2), undef)
->
concat(VZIP(v1, v2):0, :1)
This lets us generate the native shuffles instead of scalarizing to
dozens of VMOVs.
Differential Revision: http://reviews.llvm.org/D10424
llvm-svn: 240118
2015-06-19 10:32:35 +08:00
|
|
|
; CHECK-NEXT: vldr d16, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.16 d16, d17
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <4 x i16>, <4 x i16>* %A
|
|
|
|
%tmp2 = load <4 x i16>, <4 x i16>* %B
|
|
|
|
%tmp3 = shufflevector <4 x i16> %tmp1, <4 x i16> %tmp2, <8 x i32> <i32 0, i32 4, i32 2, i32 6, i32 1, i32 5, i32 3, i32 7>
|
|
|
|
ret <8 x i16> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <2 x i32> @vtrni32(<2 x i32>* %A, <2 x i32>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrni32:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d16, [r1]
|
|
|
|
; CHECK-NEXT: vldr d17, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.32 d17, d16
|
|
|
|
; CHECK-NEXT: vadd.i32 d16, d17, d16
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <2 x i32>, <2 x i32>* %A
|
|
|
|
%tmp2 = load <2 x i32>, <2 x i32>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <2 x i32> %tmp1, <2 x i32> %tmp2, <2 x i32> <i32 0, i32 2>
|
|
|
|
%tmp4 = shufflevector <2 x i32> %tmp1, <2 x i32> %tmp2, <2 x i32> <i32 1, i32 3>
|
|
|
|
%tmp5 = add <2 x i32> %tmp3, %tmp4
|
|
|
|
ret <2 x i32> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <4 x i32> @vtrni32_Qres(<2 x i32>* %A, <2 x i32>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrni32_Qres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d17, [r1]
|
|
|
|
; CHECK-NEXT: vldr d16, [r0]
|
[ARM] Look through concat when lowering in-place shuffles (VZIP, ..)
Currently, we canonicalize shuffles that produce a result larger than
their operands with:
shuffle(concat(v1, undef), concat(v2, undef))
->
shuffle(concat(v1, v2), undef)
because we can access quad vectors (see PerformVECTOR_SHUFFLECombine).
This is useful in the general case, but there are special cases where
native shuffles produce larger results: the two-result ops.
We can look through the concat when lowering them:
shuffle(concat(v1, v2), undef)
->
concat(VZIP(v1, v2):0, :1)
This lets us generate the native shuffles instead of scalarizing to
dozens of VMOVs.
Differential Revision: http://reviews.llvm.org/D10424
llvm-svn: 240118
2015-06-19 10:32:35 +08:00
|
|
|
; CHECK-NEXT: vtrn.32 d16, d17
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <2 x i32>, <2 x i32>* %A
|
|
|
|
%tmp2 = load <2 x i32>, <2 x i32>* %B
|
|
|
|
%tmp3 = shufflevector <2 x i32> %tmp1, <2 x i32> %tmp2, <4 x i32> <i32 0, i32 2, i32 1, i32 3>
|
|
|
|
ret <4 x i32> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <2 x float> @vtrnf(<2 x float>* %A, <2 x float>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnf:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d16, [r1]
|
|
|
|
; CHECK-NEXT: vldr d17, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.32 d17, d16
|
|
|
|
; CHECK-NEXT: vadd.f32 d16, d17, d16
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <2 x float>, <2 x float>* %A
|
|
|
|
%tmp2 = load <2 x float>, <2 x float>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <2 x float> %tmp1, <2 x float> %tmp2, <2 x i32> <i32 0, i32 2>
|
|
|
|
%tmp4 = shufflevector <2 x float> %tmp1, <2 x float> %tmp2, <2 x i32> <i32 1, i32 3>
|
2010-05-04 06:36:46 +08:00
|
|
|
%tmp5 = fadd <2 x float> %tmp3, %tmp4
|
2009-08-22 04:54:19 +08:00
|
|
|
ret <2 x float> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <4 x float> @vtrnf_Qres(<2 x float>* %A, <2 x float>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnf_Qres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d17, [r1]
|
|
|
|
; CHECK-NEXT: vldr d16, [r0]
|
[ARM] Look through concat when lowering in-place shuffles (VZIP, ..)
Currently, we canonicalize shuffles that produce a result larger than
their operands with:
shuffle(concat(v1, undef), concat(v2, undef))
->
shuffle(concat(v1, v2), undef)
because we can access quad vectors (see PerformVECTOR_SHUFFLECombine).
This is useful in the general case, but there are special cases where
native shuffles produce larger results: the two-result ops.
We can look through the concat when lowering them:
shuffle(concat(v1, v2), undef)
->
concat(VZIP(v1, v2):0, :1)
This lets us generate the native shuffles instead of scalarizing to
dozens of VMOVs.
Differential Revision: http://reviews.llvm.org/D10424
llvm-svn: 240118
2015-06-19 10:32:35 +08:00
|
|
|
; CHECK-NEXT: vtrn.32 d16, d17
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <2 x float>, <2 x float>* %A
|
|
|
|
%tmp2 = load <2 x float>, <2 x float>* %B
|
|
|
|
%tmp3 = shufflevector <2 x float> %tmp1, <2 x float> %tmp2, <4 x i32> <i32 0, i32 2, i32 1, i32 3>
|
|
|
|
ret <4 x float> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <16 x i8> @vtrnQi8(<16 x i8>* %A, <16 x i8>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnQi8:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r1]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.8 q9, q8
|
|
|
|
; CHECK-NEXT: vadd.i8 q8, q9, q8
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <16 x i8>, <16 x i8>* %A
|
|
|
|
%tmp2 = load <16 x i8>, <16 x i8>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <16 x i8> %tmp1, <16 x i8> %tmp2, <16 x i32> <i32 0, i32 16, i32 2, i32 18, i32 4, i32 20, i32 6, i32 22, i32 8, i32 24, i32 10, i32 26, i32 12, i32 28, i32 14, i32 30>
|
|
|
|
%tmp4 = shufflevector <16 x i8> %tmp1, <16 x i8> %tmp2, <16 x i32> <i32 1, i32 17, i32 3, i32 19, i32 5, i32 21, i32 7, i32 23, i32 9, i32 25, i32 11, i32 27, i32 13, i32 29, i32 15, i32 31>
|
|
|
|
%tmp5 = add <16 x i8> %tmp3, %tmp4
|
|
|
|
ret <16 x i8> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <32 x i8> @vtrnQi8_QQres(<16 x i8>* %A, <16 x i8>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnQi8_QQres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r2]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r1]
|
|
|
|
; CHECK-NEXT: vtrn.8 q9, q8
|
|
|
|
; CHECK-NEXT: vst1.8 {d18, d19}, [r0:128]!
|
|
|
|
; CHECK-NEXT: vst1.64 {d16, d17}, [r0:128]
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <16 x i8>, <16 x i8>* %A
|
|
|
|
%tmp2 = load <16 x i8>, <16 x i8>* %B
|
|
|
|
%tmp3 = shufflevector <16 x i8> %tmp1, <16 x i8> %tmp2, <32 x i32> <i32 0, i32 16, i32 2, i32 18, i32 4, i32 20, i32 6, i32 22, i32 8, i32 24, i32 10, i32 26, i32 12, i32 28, i32 14, i32 30, i32 1, i32 17, i32 3, i32 19, i32 5, i32 21, i32 7, i32 23, i32 9, i32 25, i32 11, i32 27, i32 13, i32 29, i32 15, i32 31>
|
|
|
|
ret <32 x i8> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <8 x i16> @vtrnQi16(<8 x i16>* %A, <8 x i16>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnQi16:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r1]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.16 q9, q8
|
|
|
|
; CHECK-NEXT: vadd.i16 q8, q9, q8
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <8 x i16>, <8 x i16>* %A
|
|
|
|
%tmp2 = load <8 x i16>, <8 x i16>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <8 x i32> <i32 0, i32 8, i32 2, i32 10, i32 4, i32 12, i32 6, i32 14>
|
|
|
|
%tmp4 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <8 x i32> <i32 1, i32 9, i32 3, i32 11, i32 5, i32 13, i32 7, i32 15>
|
|
|
|
%tmp5 = add <8 x i16> %tmp3, %tmp4
|
|
|
|
ret <8 x i16> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <16 x i16> @vtrnQi16_QQres(<8 x i16>* %A, <8 x i16>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnQi16_QQres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r2]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r1]
|
|
|
|
; CHECK-NEXT: vtrn.16 q9, q8
|
|
|
|
; CHECK-NEXT: vst1.16 {d18, d19}, [r0:128]!
|
|
|
|
; CHECK-NEXT: vst1.64 {d16, d17}, [r0:128]
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <8 x i16>, <8 x i16>* %A
|
|
|
|
%tmp2 = load <8 x i16>, <8 x i16>* %B
|
|
|
|
%tmp3 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <16 x i32> <i32 0, i32 8, i32 2, i32 10, i32 4, i32 12, i32 6, i32 14, i32 1, i32 9, i32 3, i32 11, i32 5, i32 13, i32 7, i32 15>
|
|
|
|
ret <16 x i16> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <4 x i32> @vtrnQi32(<4 x i32>* %A, <4 x i32>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnQi32:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r1]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.32 q9, q8
|
|
|
|
; CHECK-NEXT: vadd.i32 q8, q9, q8
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <4 x i32>, <4 x i32>* %A
|
|
|
|
%tmp2 = load <4 x i32>, <4 x i32>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <4 x i32> %tmp1, <4 x i32> %tmp2, <4 x i32> <i32 0, i32 4, i32 2, i32 6>
|
|
|
|
%tmp4 = shufflevector <4 x i32> %tmp1, <4 x i32> %tmp2, <4 x i32> <i32 1, i32 5, i32 3, i32 7>
|
|
|
|
%tmp5 = add <4 x i32> %tmp3, %tmp4
|
|
|
|
ret <4 x i32> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <8 x i32> @vtrnQi32_QQres(<4 x i32>* %A, <4 x i32>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnQi32_QQres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r2]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r1]
|
|
|
|
; CHECK-NEXT: vtrn.32 q9, q8
|
|
|
|
; CHECK-NEXT: vst1.32 {d18, d19}, [r0:128]!
|
|
|
|
; CHECK-NEXT: vst1.64 {d16, d17}, [r0:128]
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <4 x i32>, <4 x i32>* %A
|
|
|
|
%tmp2 = load <4 x i32>, <4 x i32>* %B
|
|
|
|
%tmp3 = shufflevector <4 x i32> %tmp1, <4 x i32> %tmp2, <8 x i32> <i32 0, i32 4, i32 2, i32 6, i32 1, i32 5, i32 3, i32 7>
|
|
|
|
ret <8 x i32> %tmp3
|
|
|
|
}
|
|
|
|
|
2009-08-22 04:54:19 +08:00
|
|
|
define <4 x float> @vtrnQf(<4 x float>* %A, <4 x float>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnQf:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r1]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.32 q9, q8
|
|
|
|
; CHECK-NEXT: vadd.f32 q8, q9, q8
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <4 x float>, <4 x float>* %A
|
|
|
|
%tmp2 = load <4 x float>, <4 x float>* %B
|
2009-08-22 04:54:19 +08:00
|
|
|
%tmp3 = shufflevector <4 x float> %tmp1, <4 x float> %tmp2, <4 x i32> <i32 0, i32 4, i32 2, i32 6>
|
|
|
|
%tmp4 = shufflevector <4 x float> %tmp1, <4 x float> %tmp2, <4 x i32> <i32 1, i32 5, i32 3, i32 7>
|
2010-05-04 06:36:46 +08:00
|
|
|
%tmp5 = fadd <4 x float> %tmp3, %tmp4
|
2009-08-22 04:54:19 +08:00
|
|
|
ret <4 x float> %tmp5
|
|
|
|
}
|
2010-08-17 13:54:34 +08:00
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <8 x float> @vtrnQf_QQres(<4 x float>* %A, <4 x float>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnQf_QQres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r2]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r1]
|
|
|
|
; CHECK-NEXT: vtrn.32 q9, q8
|
|
|
|
; CHECK-NEXT: vst1.32 {d18, d19}, [r0:128]!
|
|
|
|
; CHECK-NEXT: vst1.64 {d16, d17}, [r0:128]
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <4 x float>, <4 x float>* %A
|
|
|
|
%tmp2 = load <4 x float>, <4 x float>* %B
|
|
|
|
%tmp3 = shufflevector <4 x float> %tmp1, <4 x float> %tmp2, <8 x i32> <i32 0, i32 4, i32 2, i32 6, i32 1, i32 5, i32 3, i32 7>
|
|
|
|
ret <8 x float> %tmp3
|
|
|
|
}
|
|
|
|
|
2010-08-17 13:54:34 +08:00
|
|
|
|
|
|
|
define <8 x i8> @vtrni8_undef(<8 x i8>* %A, <8 x i8>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrni8_undef:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vldr d16, [r1]
|
|
|
|
; CHECK-NEXT: vldr d17, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.8 d17, d16
|
|
|
|
; CHECK-NEXT: vadd.i8 d16, d17, d16
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <8 x i8>, <8 x i8>* %A
|
|
|
|
%tmp2 = load <8 x i8>, <8 x i8>* %B
|
2010-08-17 13:54:34 +08:00
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <8 x i32> <i32 0, i32 undef, i32 2, i32 10, i32 undef, i32 12, i32 6, i32 14>
|
|
|
|
%tmp4 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <8 x i32> <i32 1, i32 9, i32 3, i32 11, i32 5, i32 undef, i32 undef, i32 15>
|
|
|
|
%tmp5 = add <8 x i8> %tmp3, %tmp4
|
|
|
|
ret <8 x i8> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <16 x i8> @vtrni8_undef_Qres(<8 x i8>* %A, <8 x i8>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrni8_undef_Qres:
|
|
|
|
; CHECK: @ BB#0:
|
[ARM] Look through concat when lowering in-place shuffles (VZIP, ..)
Currently, we canonicalize shuffles that produce a result larger than
their operands with:
shuffle(concat(v1, undef), concat(v2, undef))
->
shuffle(concat(v1, v2), undef)
because we can access quad vectors (see PerformVECTOR_SHUFFLECombine).
This is useful in the general case, but there are special cases where
native shuffles produce larger results: the two-result ops.
We can look through the concat when lowering them:
shuffle(concat(v1, v2), undef)
->
concat(VZIP(v1, v2):0, :1)
This lets us generate the native shuffles instead of scalarizing to
dozens of VMOVs.
Differential Revision: http://reviews.llvm.org/D10424
llvm-svn: 240118
2015-06-19 10:32:35 +08:00
|
|
|
; CHECK-NEXT: vldr d17, [r1]
|
|
|
|
; CHECK-NEXT: vldr d16, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.8 d16, d17
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <8 x i8>, <8 x i8>* %A
|
|
|
|
%tmp2 = load <8 x i8>, <8 x i8>* %B
|
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <16 x i32> <i32 0, i32 undef, i32 2, i32 10, i32 undef, i32 12, i32 6, i32 14, i32 1, i32 9, i32 3, i32 11, i32 5, i32 undef, i32 undef, i32 15>
|
|
|
|
ret <16 x i8> %tmp3
|
|
|
|
}
|
|
|
|
|
2010-08-17 13:54:34 +08:00
|
|
|
define <8 x i16> @vtrnQi16_undef(<8 x i16>* %A, <8 x i16>* %B) nounwind {
|
2015-06-19 10:15:34 +08:00
|
|
|
; CHECK-LABEL: vtrnQi16_undef:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r1]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r0]
|
|
|
|
; CHECK-NEXT: vtrn.16 q9, q8
|
|
|
|
; CHECK-NEXT: vadd.i16 q8, q9, q8
|
|
|
|
; CHECK-NEXT: vmov r0, r1, d16
|
|
|
|
; CHECK-NEXT: vmov r2, r3, d17
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load <8 x i16>, <8 x i16>* %A
|
|
|
|
%tmp2 = load <8 x i16>, <8 x i16>* %B
|
2010-08-17 13:54:34 +08:00
|
|
|
%tmp3 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <8 x i32> <i32 0, i32 8, i32 undef, i32 undef, i32 4, i32 12, i32 6, i32 14>
|
|
|
|
%tmp4 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <8 x i32> <i32 1, i32 undef, i32 3, i32 11, i32 5, i32 13, i32 undef, i32 undef>
|
|
|
|
%tmp5 = add <8 x i16> %tmp3, %tmp4
|
|
|
|
ret <8 x i16> %tmp5
|
|
|
|
}
|
|
|
|
|
2015-06-19 10:15:34 +08:00
|
|
|
define <16 x i16> @vtrnQi16_undef_QQres(<8 x i16>* %A, <8 x i16>* %B) nounwind {
|
|
|
|
; CHECK-LABEL: vtrnQi16_undef_QQres:
|
|
|
|
; CHECK: @ BB#0:
|
|
|
|
; CHECK-NEXT: vld1.64 {d16, d17}, [r2]
|
|
|
|
; CHECK-NEXT: vld1.64 {d18, d19}, [r1]
|
|
|
|
; CHECK-NEXT: vtrn.16 q9, q8
|
|
|
|
; CHECK-NEXT: vst1.16 {d18, d19}, [r0:128]!
|
|
|
|
; CHECK-NEXT: vst1.64 {d16, d17}, [r0:128]
|
|
|
|
; CHECK-NEXT: mov pc, lr
|
|
|
|
%tmp1 = load <8 x i16>, <8 x i16>* %A
|
|
|
|
%tmp2 = load <8 x i16>, <8 x i16>* %B
|
|
|
|
%tmp3 = shufflevector <8 x i16> %tmp1, <8 x i16> %tmp2, <16 x i32> <i32 0, i32 8, i32 undef, i32 undef, i32 4, i32 12, i32 6, i32 14, i32 1, i32 undef, i32 3, i32 11, i32 5, i32 13, i32 undef, i32 undef>
|
|
|
|
ret <16 x i16> %tmp3
|
|
|
|
}
|
2015-07-24 17:57:05 +08:00
|
|
|
|
|
|
|
define <8 x i16> @vtrn_lower_shufflemask_undef(<4 x i16>* %A, <4 x i16>* %B) {
|
|
|
|
entry:
|
|
|
|
; CHECK-LABEL: vtrn_lower_shufflemask_undef
|
|
|
|
; CHECK: vtrn
|
|
|
|
%tmp1 = load <4 x i16>, <4 x i16>* %A
|
|
|
|
%tmp2 = load <4 x i16>, <4 x i16>* %B
|
|
|
|
%0 = shufflevector <4 x i16> %tmp1, <4 x i16> %tmp2, <8 x i32> <i32 undef, i32 undef, i32 undef, i32 undef, i32 1, i32 5, i32 3, i32 7>
|
|
|
|
ret <8 x i16> %0
|
|
|
|
}
|