Home
last modified time | relevance | path

Searched refs:Shuffles (Results 1 – 10 of 10) sorted by relevance

/external/llvm/lib/CodeGen/
DInterleavedAccessPass.cpp183 SmallVector<ShuffleVectorInst *, 4> Shuffles; in lowerInterleavedLoad() local
191 Shuffles.push_back(SVI); in lowerInterleavedLoad()
194 if (Shuffles.empty()) in lowerInterleavedLoad()
200 if (!isDeInterleaveMask(Shuffles[0]->getShuffleMask(), Factor, Index)) in lowerInterleavedLoad()
207 Type *VecTy = Shuffles[0]->getType(); in lowerInterleavedLoad()
211 for (unsigned i = 1; i < Shuffles.size(); i++) { in lowerInterleavedLoad()
212 if (Shuffles[i]->getType() != VecTy) in lowerInterleavedLoad()
215 if (!isDeInterleaveMaskOfFactor(Shuffles[i]->getShuffleMask(), Factor, in lowerInterleavedLoad()
225 if (!TLI->lowerInterleavedLoad(LI, Shuffles, Indices, Factor)) in lowerInterleavedLoad()
228 for (auto SVI : Shuffles) in lowerInterleavedLoad()
/external/llvm/lib/Target/Hexagon/
DHexagonInstrInfoVector.td478 // Shuffles even bytes for i=0..3: A[2*i].b = C[2*i].b; A[2*i+1].b = B[2*i].b
481 // Shuffles odd bytes for i=0..3: A[2*i].b = C[2*i+1].b; A[2*i+1].b = B[2*i+1].b
484 // Shuffles even half for i=0,1: A[2*i].h = C[2*i].h; A[2*i+1].h = B[2*i].h
487 // Shuffles odd half for i=0,1: A[2*i].h = C[2*i+1].h; A[2*i+1].h = B[2*i+1].h
/external/llvm/lib/Target/AArch64/
DAArch64ISelLowering.h301 ArrayRef<ShuffleVectorInst *> Shuffles,
DAArch64ISelLowering.cpp7007 LoadInst *LI, ArrayRef<ShuffleVectorInst *> Shuffles, in lowerInterleavedLoad() argument
7011 assert(!Shuffles.empty() && "Empty shufflevector input"); in lowerInterleavedLoad()
7012 assert(Shuffles.size() == Indices.size() && in lowerInterleavedLoad()
7017 VectorType *VecTy = Shuffles[0]->getType(); in lowerInterleavedLoad()
7046 for (unsigned i = 0; i < Shuffles.size(); i++) { in lowerInterleavedLoad()
7047 ShuffleVectorInst *SVI = Shuffles[i]; in lowerInterleavedLoad()
/external/llvm/lib/Target/ARM/
DARMISelLowering.h450 ArrayRef<ShuffleVectorInst *> Shuffles,
DARMISelLowering.cpp12086 LoadInst *LI, ArrayRef<ShuffleVectorInst *> Shuffles, in lowerInterleavedLoad() argument
12090 assert(!Shuffles.empty() && "Empty shufflevector input"); in lowerInterleavedLoad()
12091 assert(Shuffles.size() == Indices.size() && in lowerInterleavedLoad()
12094 VectorType *VecTy = Shuffles[0]->getType(); in lowerInterleavedLoad()
12130 for (unsigned i = 0; i < Shuffles.size(); i++) { in lowerInterleavedLoad()
12131 ShuffleVectorInst *SV = Shuffles[i]; in lowerInterleavedLoad()
DARMInstrNEON.td6319 // Other Vector Shuffles.
/external/llvm/lib/Target/PowerPC/
DPPCInstrAltivec.td478 // Shuffles.
891 // Shuffles.
/external/llvm/include/llvm/Target/
DTargetLowering.h1632 ArrayRef<ShuffleVectorInst *> Shuffles, in lowerInterleavedLoad() argument
/external/llvm/test/CodeGen/X86/
Dsse41.ll408 ;;;;;; Shuffles optimizable with a single insertps or blend instruction