RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 03:02:36 +01:00
Code Issues Projects Releases Wiki Activity
7f0aeb0ac8
llvm-mirror/test/CodeGen/ARM/lowerMUL-newload.ll
Simon Pilgrim add6aab738 [DAGCombiner] Enable SimplifyDemandedBits vector support for TRUNCATE (REAPPLIED). 
Add DemandedElts support inside the TRUNCATE analysis.

REAPPLIED - this was reverted by @hans at rGa51226057fc3 due to an issue with vector shift amount types, which was fixed in rG935bacd3a724 and an additional test case added at rG0ca81b90d19d

Differential Revision: https://reviews.llvm.org/D56387
2021-01-21 13:01:34 +00:00

250 lines
9.7 KiB
LLVM
Raw Blame History

; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
; RUN: llc < %s -mtriple=arm-eabi -mcpu=krait | FileCheck %s
define arm_aapcs_vfpcc <4 x i16> @mla_args(<4 x i16> %vec0, <4 x i16> %vec1, <4 x i16> %vec2) {
; CHECK-LABEL: mla_args:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: vmull.u16 q8, d1, d0
; CHECK-NEXT: vaddw.u16 q8, q8, d2
; CHECK-NEXT: vmovn.i32 d0, q8
; CHECK-NEXT: bx lr
entry:
%v0 = sext <4 x i16> %vec0 to <4 x i32>
%v1 = sext <4 x i16> %vec1 to <4 x i32>
%v2 = sext <4 x i16> %vec2 to <4 x i32>
%v3 = mul <4 x i32> %v1, %v0
%v4 = add <4 x i32> %v3, %v2
%v5 = trunc <4 x i32> %v4 to <4 x i16>
ret <4 x i16> %v5
}
define void @mla_loadstore(i16* %a, i16* %b, i16* %c) {
; CHECK-LABEL: mla_loadstore:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: vldr d16, [r0, #16]
; CHECK-NEXT: vldr d17, [r1, #16]
; CHECK-NEXT: vldr d18, [r2, #16]
; CHECK-NEXT: vmull.u16 q8, d17, d16
; CHECK-NEXT: vaddw.u16 q8, q8, d18
; CHECK-NEXT: vmovn.i32 d16, q8
; CHECK-NEXT: vstr d16, [r0, #16]
; CHECK-NEXT: bx lr
entry:
%scevgep0 = getelementptr i16, i16* %a, i32 8
%vector_ptr0 = bitcast i16* %scevgep0 to <4 x i16>*
%vec0 = load <4 x i16>, <4 x i16>* %vector_ptr0, align 8
%v0 = sext <4 x i16> %vec0 to <4 x i32>
%scevgep1 = getelementptr i16, i16* %b, i32 8
%vector_ptr1 = bitcast i16* %scevgep1 to <4 x i16>*
%vec1 = load <4 x i16>, <4 x i16>* %vector_ptr1, align 8
%v1 = sext <4 x i16> %vec1 to <4 x i32>
%scevgep2 = getelementptr i16, i16* %c, i32 8
%vector_ptr2 = bitcast i16* %scevgep2 to <4 x i16>*
%vec2 = load <4 x i16>, <4 x i16>* %vector_ptr2, align 8
%v2 = sext <4 x i16> %vec2 to <4 x i32>
%v3 = mul <4 x i32> %v1, %v0
%v4 = add <4 x i32> %v3, %v2
%v5 = trunc <4 x i32> %v4 to <4 x i16>
%scevgep3 = getelementptr i16, i16* %a, i32 8
%vector_ptr3 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %v5, <4 x i16>* %vector_ptr3, align 8
ret void
}
define arm_aapcs_vfpcc <4 x i16> @addmul_args(<4 x i16> %vec0, <4 x i16> %vec1, <4 x i16> %vec2) {
; CHECK-LABEL: addmul_args:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: vmull.u16 q8, d1, d2
; CHECK-NEXT: vmlal.u16 q8, d0, d2
; CHECK-NEXT: vmovn.i32 d0, q8
; CHECK-NEXT: bx lr
entry:
%v0 = sext <4 x i16> %vec0 to <4 x i32>
%v1 = sext <4 x i16> %vec1 to <4 x i32>
%v2 = sext <4 x i16> %vec2 to <4 x i32>
%v3 = add <4 x i32> %v1, %v0
%v4 = mul <4 x i32> %v3, %v2
%v5 = trunc <4 x i32> %v4 to <4 x i16>
ret <4 x i16> %v5
}
define void @addmul_loadstore(i16* %a, i16* %b, i16* %c) {
; CHECK-LABEL: addmul_loadstore:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: vldr d16, [r2, #16]
; CHECK-NEXT: vldr d17, [r1, #16]
; CHECK-NEXT: vmull.u16 q9, d17, d16
; CHECK-NEXT: vldr d17, [r0, #16]
; CHECK-NEXT: vmlal.u16 q9, d17, d16
; CHECK-NEXT: vmovn.i32 d16, q9
; CHECK-NEXT: vstr d16, [r0, #16]
; CHECK-NEXT: bx lr
entry:
%scevgep0 = getelementptr i16, i16* %a, i32 8
%vector_ptr0 = bitcast i16* %scevgep0 to <4 x i16>*
%vec0 = load <4 x i16>, <4 x i16>* %vector_ptr0, align 8
%v0 = sext <4 x i16> %vec0 to <4 x i32>
%scevgep1 = getelementptr i16, i16* %b, i32 8
%vector_ptr1 = bitcast i16* %scevgep1 to <4 x i16>*
%vec1 = load <4 x i16>, <4 x i16>* %vector_ptr1, align 8
%v1 = sext <4 x i16> %vec1 to <4 x i32>
%scevgep2 = getelementptr i16, i16* %c, i32 8
%vector_ptr2 = bitcast i16* %scevgep2 to <4 x i16>*
%vec2 = load <4 x i16>, <4 x i16>* %vector_ptr2, align 8
%v2 = sext <4 x i16> %vec2 to <4 x i32>
%v3 = add <4 x i32> %v1, %v0
%v4 = mul <4 x i32> %v3, %v2
%v5 = trunc <4 x i32> %v4 to <4 x i16>
%scevgep3 = getelementptr i16, i16* %a, i32 8
%vector_ptr3 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %v5, <4 x i16>* %vector_ptr3, align 8
ret void
}
define void @func1(i16* %a, i16* %b, i16* %c) {
; CHECK-LABEL: func1:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: add r3, r1, #16
; CHECK-NEXT: vldr d18, [r2, #16]
; CHECK-NEXT: vld1.16 {d16}, [r3:64]
; CHECK-NEXT: vmovl.u16 q8, d16
; CHECK-NEXT: vaddw.u16 q10, q8, d18
; CHECK-NEXT: vmovn.i32 d19, q10
; CHECK-NEXT: vldr d20, [r0, #16]
; CHECK-NEXT: vstr d19, [r0, #16]
; CHECK-NEXT: vldr d19, [r2, #16]
; CHECK-NEXT: vmull.s16 q11, d18, d19
; CHECK-NEXT: vmovl.s16 q9, d19
; CHECK-NEXT: vmla.i32 q11, q8, q9
; CHECK-NEXT: vmovn.i32 d16, q11
; CHECK-NEXT: vstr d16, [r1, #16]
; CHECK-NEXT: vldr d16, [r2, #16]
; CHECK-NEXT: vmlal.u16 q11, d16, d20
; CHECK-NEXT: vmovn.i32 d16, q11
; CHECK-NEXT: vstr d16, [r0, #16]
; CHECK-NEXT: bx lr
entry:
; The test case trying to vectorize the pseudo code below.
; a[i] = b[i] + c[i];
; b[i] = a[i] * c[i];
; a[i] = b[i] + a[i] * c[i];
; Checking that vector load a[i] for "a[i] = b[i] + a[i] * c[i]" is
; scheduled before the first vector store to "a[i] = b[i] + c[i]".
; Checking that there is no vector load a[i] scheduled between the vector
; stores to a[i], otherwise the load of a[i] will be polluted by the first
; vector store to a[i].
; This test case check that the chain information is updated during
; lowerMUL for the new created Load SDNode.
%scevgep0 = getelementptr i16, i16* %a, i32 8
%vector_ptr0 = bitcast i16* %scevgep0 to <4 x i16>*
%vec0 = load <4 x i16>, <4 x i16>* %vector_ptr0, align 8
%scevgep1 = getelementptr i16, i16* %b, i32 8
%vector_ptr1 = bitcast i16* %scevgep1 to <4 x i16>*
%vec1 = load <4 x i16>, <4 x i16>* %vector_ptr1, align 8
%0 = zext <4 x i16> %vec1 to <4 x i32>
%scevgep2 = getelementptr i16, i16* %c, i32 8
%vector_ptr2 = bitcast i16* %scevgep2 to <4 x i16>*
%vec2 = load <4 x i16>, <4 x i16>* %vector_ptr2, align 8
%1 = sext <4 x i16> %vec2 to <4 x i32>
%vec3 = add <4 x i32> %1, %0
%2 = trunc <4 x i32> %vec3 to <4 x i16>
%scevgep3 = getelementptr i16, i16* %a, i32 8
%vector_ptr3 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %2, <4 x i16>* %vector_ptr3, align 8
%vector_ptr4 = bitcast i16* %scevgep2 to <4 x i16>*
%vec4 = load <4 x i16>, <4 x i16>* %vector_ptr4, align 8
%3 = sext <4 x i16> %vec4 to <4 x i32>
%vec5 = mul <4 x i32> %3, %vec3
%4 = trunc <4 x i32> %vec5 to <4 x i16>
%vector_ptr5 = bitcast i16* %scevgep1 to <4 x i16>*
store <4 x i16> %4, <4 x i16>* %vector_ptr5, align 8
%5 = sext <4 x i16> %vec0 to <4 x i32>
%vector_ptr6 = bitcast i16* %scevgep2 to <4 x i16>*
%vec6 = load <4 x i16>, <4 x i16>* %vector_ptr6, align 8
%6 = sext <4 x i16> %vec6 to <4 x i32>
%vec7 = mul <4 x i32> %6, %5
%vec8 = add <4 x i32> %vec7, %vec5
%7 = trunc <4 x i32> %vec8 to <4 x i16>
%vector_ptr7 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %7, <4 x i16>* %vector_ptr7, align 8
ret void
}
define void @func2(i16* %a, i16* %b, i16* %c) {
; CHECK-LABEL: func2:
; CHECK: @ %bb.0: @ %entry
; CHECK-NEXT: vldr d16, [r1, #16]
; CHECK-NEXT: add r3, r0, #16
; CHECK-NEXT: vldr d17, [r2, #16]
; CHECK-NEXT: vaddl.u16 q9, d17, d16
; CHECK-NEXT: vmovn.i32 d18, q9
; CHECK-NEXT: vld1.16 {d19}, [r3:64]
; CHECK-NEXT: vstr d18, [r0, #16]
; CHECK-NEXT: vldr d18, [r2, #16]
; CHECK-NEXT: vmull.s16 q10, d17, d18
; CHECK-NEXT: vmovl.s16 q11, d18
; CHECK-NEXT: vmovl.u16 q8, d16
; CHECK-NEXT: vmovl.s16 q9, d19
; CHECK-NEXT: vmla.i32 q10, q8, q11
; CHECK-NEXT: vmovn.i32 d16, q10
; CHECK-NEXT: vstr d16, [r1, #16]
; CHECK-NEXT: add r1, r2, #16
; CHECK-NEXT: vld1.16 {d16}, [r1:64]
; CHECK-NEXT: vmovl.u16 q8, d16
; CHECK-NEXT: vmla.i32 q10, q8, q9
; CHECK-NEXT: vadd.i32 q8, q10, q9
; CHECK-NEXT: vmovn.i32 d16, q8
; CHECK-NEXT: vstr d16, [r0, #16]
; CHECK-NEXT: bx lr
entry:
; The test case trying to vectorize the pseudo code below.
; a[i] = b[i] + c[i];
; b[i] = a[i] * c[i];
; a[i] = b[i] + a[i] * c[i] + a[i];
; Checking that vector load a[i] for "a[i] = b[i] + a[i] * c[i] + a[i]"
; is scheduled before the first vector store to "a[i] = b[i] + c[i]".
; Checking that there is no vector load a[i] scheduled between the first
; vector store to a[i] and the vector add of a[i], otherwise the load of
; a[i] will be polluted by the first vector store to a[i].
; This test case check that both the chain and value of the new created
; Load SDNode are updated during lowerMUL.
%scevgep0 = getelementptr i16, i16* %a, i32 8
%vector_ptr0 = bitcast i16* %scevgep0 to <4 x i16>*
%vec0 = load <4 x i16>, <4 x i16>* %vector_ptr0, align 8
%scevgep1 = getelementptr i16, i16* %b, i32 8
%vector_ptr1 = bitcast i16* %scevgep1 to <4 x i16>*
%vec1 = load <4 x i16>, <4 x i16>* %vector_ptr1, align 8
%0 = zext <4 x i16> %vec1 to <4 x i32>
%scevgep2 = getelementptr i16, i16* %c, i32 8
%vector_ptr2 = bitcast i16* %scevgep2 to <4 x i16>*
%vec2 = load <4 x i16>, <4 x i16>* %vector_ptr2, align 8
%1 = sext <4 x i16> %vec2 to <4 x i32>
%vec3 = add <4 x i32> %1, %0
%2 = trunc <4 x i32> %vec3 to <4 x i16>
%scevgep3 = getelementptr i16, i16* %a, i32 8
%vector_ptr3 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %2, <4 x i16>* %vector_ptr3, align 8
%vector_ptr4 = bitcast i16* %scevgep2 to <4 x i16>*
%vec4 = load <4 x i16>, <4 x i16>* %vector_ptr4, align 8
%3 = sext <4 x i16> %vec4 to <4 x i32>
%vec5 = mul <4 x i32> %3, %vec3
%4 = trunc <4 x i32> %vec5 to <4 x i16>
%vector_ptr5 = bitcast i16* %scevgep1 to <4 x i16>*
store <4 x i16> %4, <4 x i16>* %vector_ptr5, align 8
%5 = sext <4 x i16> %vec0 to <4 x i32>
%vector_ptr6 = bitcast i16* %scevgep2 to <4 x i16>*
%vec6 = load <4 x i16>, <4 x i16>* %vector_ptr6, align 8
%6 = sext <4 x i16> %vec6 to <4 x i32>
%vec7 = mul <4 x i32> %6, %5
%vec8 = add <4 x i32> %vec7, %vec5
%vec9 = add <4 x i32> %vec8, %5
%7 = trunc <4 x i32> %vec9 to <4 x i16>
%vector_ptr7 = bitcast i16* %scevgep3 to <4 x i16>*
store <4 x i16> %7, <4 x i16>* %vector_ptr7, align 8
ret void
}
Reference in New Issue View Git Blame Copy Permalink