RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-20 11:08:27 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

ARM cost model: Add vector reverse shuffle costs

Browse Source 
A reverse shuffle is lowered to a vrev and possibly a vext instruction (quad
word).

radar://13171406

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@174933 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Arnold Schwaighofer 2013-02-12 02:40:39 +00:00
parent 4fc6484ee2
commit 6851623c54
2 changed files with 73 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
lib/Target/ARM/ARMTargetTransformInfo.cpp
View File

@ -114,6 +114,9 @@ public:
return 1;
}
unsigned getShuffleCost(ShuffleKind Kind, Type *Tp,
int Index, Type *SubTp) const;
unsigned getCastInstrCost(unsigned Opcode, Type *Dst,
Type *Src) const;
@ -335,3 +338,33 @@ unsigned ARMTTI::getAddressComputationCost(Type *Ty) const {
// addressing mode.
return 1;
}
unsigned ARMTTI::getShuffleCost(ShuffleKind Kind, Type *Tp, int Index,
Type *SubTp) const {
// We only handle costs of reverse shuffles for now.
if (Kind != SK_Reverse)
return TargetTransformInfo::getShuffleCost(Kind, Tp, Index, SubTp);
static const CostTblEntry<MVT> NEONShuffleTbl[] = {
// Reverse shuffle cost one instruction if we are shuffling within a double
// word (vrev) or two if we shuffle a quad word (vrev, vext).
{ ISD::VECTOR_SHUFFLE, MVT::v2i32, 1 },
{ ISD::VECTOR_SHUFFLE, MVT::v2f32, 1 },
{ ISD::VECTOR_SHUFFLE, MVT::v2i64, 1 },
{ ISD::VECTOR_SHUFFLE, MVT::v2f64, 1 },
{ ISD::VECTOR_SHUFFLE, MVT::v4i32, 2 },
{ ISD::VECTOR_SHUFFLE, MVT::v4f32, 2 },
{ ISD::VECTOR_SHUFFLE, MVT::v8i16, 2 },
{ ISD::VECTOR_SHUFFLE, MVT::v16i8, 2 }
};
std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Tp);
int Idx = CostTableLookup<MVT>(NEONShuffleTbl, array_lengthof(NEONShuffleTbl),
ISD::VECTOR_SHUFFLE, LT.second);
if (Idx == -1)
return TargetTransformInfo::getShuffleCost(Kind, Tp, Index, SubTp);
return LT.first * NEONShuffleTbl[Idx].Cost;
}

40
test/Analysis/CostModel/ARM/shuffle.ll Normal file
View File

@ -0,0 +1,40 @@
; RUN: opt < %s -cost-model -analyze -mtriple=thumbv7-apple-ios6.0.0 -mcpu=swift | FileCheck %s
target datalayout = "e-p:32:32:32-i1:8:32-i8:8:32-i16:16:32-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:32:64-v128:32:128-a0:0:32-n32-S32"
target triple = "thumbv7-apple-ios6.0.0"
; CHECK: shuffle
define void @shuffle() {
;; Reverse shuffles should be lowered to vrev and possibly a vext (for
;; quadwords)
; Vector values
; CHECK: cost of 1 {{.*}} shuffle
%v7 = shufflevector <2 x i8> undef, <2 x i8>undef, <2 x i32> <i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v8 = shufflevector <4 x i8> undef, <4 x i8>undef, <4 x i32> <i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v9 = shufflevector <8 x i8> undef, <8 x i8>undef, <8 x i32> <i32 7, i32 6, i32 5, i32 4, i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 2 {{.*}} shuffle
%v10 = shufflevector <16 x i8> undef, <16 x i8>undef, <16 x i32> <i32 15, i32 14, i32 13, i32 12, i32 11, i32 10, i32 9, i32 8, i32 7, i32 6, i32 5, i32 4, i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v11 = shufflevector <2 x i16> undef, <2 x i16>undef, <2 x i32> <i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v12 = shufflevector <4 x i16> undef, <4 x i16>undef, <4 x i32> <i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 2 {{.*}} shuffle
%v13 = shufflevector <8 x i16> undef, <8 x i16>undef, <8 x i32> <i32 7, i32 6, i32 5, i32 4, i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v14 = shufflevector <2 x i32> undef, <2 x i32>undef, <2 x i32> <i32 1, i32 0>
; CHECK: cost of 2 {{.*}} shuffle
%v15 = shufflevector <4 x i32> undef, <4 x i32>undef, <4 x i32> <i32 3, i32 2, i32 1, i32 0>
; CHECK: cost of 1 {{.*}} shuffle
%v16 = shufflevector <2 x float> undef, <2 x float>undef, <2 x i32> <i32 1, i32 0>
; CHECK: cost of 2 {{.*}} shuffle
%v17 = shufflevector <4 x float> undef, <4 x float>undef, <4 x i32> <i32 3, i32 2, i32 1, i32 0>
ret void
}