Home
last modified time | relevance | path

Searched defs:VF (Results 1 – 25 of 57) sorted by relevance

123

/llvm-project/llvm/lib/Transforms/Utils/
H A DInjectTLIMappings.cpp94 const VecDesc *VD = TLI.getVectorMappingInfo(ScalarName, VF, Predicate); in addMappingsFromTLI() argument
113 ElementCount::isKnownLE(VF, WidestFixedV in addMappingsFromTLI() local
41 addVariantDeclaration(CallInst & CI,const ElementCount & VF,const VecDesc * VD) addVariantDeclaration() argument
117 for (ElementCount VF = ElementCount::getScalable(2); addMappingsFromTLI() local
[all...]
/llvm-project/clang/test/Layout/
H A Dms-x86-member-pointers.cpp14 struct VF { char a; int (V::*mp)(); }; argument
/llvm-project/llvm/lib/Analysis/
H A DTargetLibraryInfo.cpp1237 TLI_DEFINE_VECFUNC(SCAL,VEC,VF,VABI_PREFIX) global() argument
1244 TLI_DEFINE_VECFUNC(SCAL,VEC,VF,VABI_PREFIX) global() argument
1251 TLI_DEFINE_VECFUNC(SCAL,VEC,VF,MASK,VABI_PREFIX) global() argument
1259 TLI_DEFINE_VECFUNC(SCAL,VEC,VF,MASK,VABI_PREFIX) global() argument
1267 TLI_DEFINE_VECFUNC(SCAL,VEC,VF,MASK,VABI_PREFIX) global() argument
1340 getVectorizedFunction(StringRef F,const ElementCount & VF,bool Masked) const getVectorizedFunction() argument
1349 getVectorMappingInfo(StringRef F,const ElementCount & VF,bool Masked) const getVectorMappingInfo() argument
1438 ElementCount *VF = getWidestVF() local
[all...]
H A DVectorUtils.cpp519 for (int Idx = 0, VF = FirstMask.size(); Idx < VF; ++Idx) { processShuffleMasks() local
528 for (int Idx = 0, VF = Mask.size(); Idx < VF; ++Idx) { processShuffleMasks() local
863 createBitMaskForGaps(IRBuilderBase & Builder,unsigned VF,const InterleaveGroup<Instruction> & Group) createBitMaskForGaps() argument
883 createReplicatedMask(unsigned ReplicationFactor,unsigned VF) createReplicatedMask() argument
892 createInterleaveMask(unsigned VF,unsigned NumVecs) createInterleaveMask() argument
903 createStrideMask(unsigned Start,unsigned Stride,unsigned VF) createStrideMask() argument
[all...]
/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp692 ElementCount VF; global() member in llvm::InnerLoopVectorizer
970 createStepForVF(IRBuilderBase & B,Type * Ty,ElementCount VF,int64_t Step) createStepForVF() argument
977 getRuntimeVF(IRBuilderBase & B,Type * Ty,ElementCount VF) getRuntimeVF() argument
1014 reportVectorization(OptimizationRemarkEmitter * ORE,Loop * TheLoop,VectorizationFactor VF,unsigned IC) reportVectorization() argument
1235 setWideningDecision(Instruction * I,ElementCount VF,InstWidening W,InstructionCost Cost) setWideningDecision() argument
1244 setWideningDecision(const InterleaveGroup<Instruction> * Grp,ElementCount VF,InstWidening W,InstructionCost Cost) setWideningDecision() argument
1277 getWideningCost(Instruction * I,ElementCount VF) getWideningCost() argument
1293 setCallWideningDecision(CallInst * CI,ElementCount VF,InstWidening Kind,Function * Variant,Intrinsic::ID IID,std::optional<unsigned> MaskPos,InstructionCost Cost) setCallWideningDecision() argument
1311 isOptimizableIVTruncate(Instruction * I,ElementCount VF) isOptimizableIVTruncate() argument
1344 collectUniformsAndScalars(ElementCount VF) collectUniformsAndScalars() argument
1370 isLegalGatherOrScatter(Value * V,ElementCount VF) isLegalGatherOrScatter() argument
1475 __anone1bc88200402(ElementCount VF) requiresScalarEpilogue() argument
1893 Create(Loop * L,const LoopAccessInfo & LAI,const SCEVPredicate & UnionPred,ElementCount VF,unsigned IC) Create() argument
2357 isIndvarOverflowCheckKnownFalse(const LoopVectorizationCostModel * Cost,ElementCount VF,std::optional<unsigned> UF=std::nullopt) isIndvarOverflowCheckKnownFalse() argument
2775 auto VF = DstFVTy->getElementCount(); createBitOrPointerCast() local
3262 MaybeVectorizeType(Type * Elt,ElementCount VF) MaybeVectorizeType() argument
3499 collectLoopScalars(ElementCount VF) collectLoopScalars() argument
3912 memoryInstructionCanBeWidened(Instruction * I,ElementCount VF) memoryInstructionCanBeWidened() argument
3937 collectLoopUniforms(ElementCount VF) collectLoopUniforms() argument
4016 __anone1bc88201b02(Instruction *I, ElementCount VF) collectLoopUniforms() argument
4701 __anone1bc88202702(unsigned VF, InstructionCost VectorCost, InstructionCost ScalarCost) isMoreProfitable() argument
4788 willGenerateVectors(VPlan & Plan,ElementCount VF,const TargetTransformInfo & TTI) willGenerateVectors() argument
4904 for (ElementCount VF : P->vectorFactors()) { selectVectorizationFactor() local
5192 selectInterleaveCount(ElementCount VF,InstructionCost LoopCost) selectInterleaveCount() argument
5556 __anone1bc88202f02(Type *Ty, ElementCount VF) calculateRegisterUsage() argument
5645 ElementCount VF = IsScalar ? ElementCount::getFixed(1) : VFs[i]; calculateRegisterUsage() local
5678 useEmulatedMaskMemRefHack(Instruction * I,ElementCount VF) useEmulatedMaskMemRefHack() argument
5694 collectInstsToScalarize(ElementCount VF) collectInstsToScalarize() argument
5738 computePredInstDiscount(Instruction * PredInst,ScalarCostsTy & ScalarCosts,ElementCount VF) computePredInstDiscount() argument
5851 expectedCost(ElementCount VF,SmallVectorImpl<InstructionVFPair> * Invalid) expectedCost() argument
5928 getMemInstScalarizationCost(Instruction * I,ElementCount VF) getMemInstScalarizationCost() argument
5988 getConsecutiveMemOpCost(Instruction * I,ElementCount VF) getConsecutiveMemOpCost() argument
6018 getUniformMemOpCost(Instruction * I,ElementCount VF) getUniformMemOpCost() argument
6046 getGatherScatterCost(Instruction * I,ElementCount VF) getGatherScatterCost() argument
6060 getInterleaveGroupCost(Instruction * I,ElementCount VF) getInterleaveGroupCost() argument
6099 getReductionPatternCost(Instruction * I,ElementCount VF,Type * Ty,TTI::TargetCostKind CostKind) const getReductionPatternCost() argument
6273 getMemoryInstructionCost(Instruction * I,ElementCount VF) getMemoryInstructionCost() argument
6290 getScalarizationOverhead(Instruction * I,ElementCount VF,TTI::TargetCostKind CostKind) const getScalarizationOverhead() argument
6330 setCostBasedWideningDecision(ElementCount VF) setCostBasedWideningDecision() argument
6516 setVectorizedCallDecision(ElementCount VF) setVectorizedCallDecision() argument
6680 getInstructionCost(Instruction * I,ElementCount VF) getInstructionCost() argument
6705 __anone1bc88203302(Instruction *I, ElementCount VF) getInstructionCost() argument
7155 ElementCount VF = UserVF; planInVPlanNativePath() local
7259 for (auto VF = ElementCount::getFixed(1); plan() local
7262 for (auto VF = ElementCount::getScalable(1); plan() local
7267 for (const auto &VF : VFCandidates) { plan() local
7288 VectorizationFactor VF = selectVectorizationFactor(); plan() local
7876 for (ElementCount VF = MinVF; ElementCount::isKnownLT(VF, MaxVFTimes2);) { buildVPlans() local
8015 __anone1bc88203b02(ElementCount VF) tryToWidenMemory() argument
8098 __anone1bc88203c02(ElementCount VF) tryToOptimizeInductionPHI() argument
8117 __anone1bc88203e02(ElementCount VF) tryToOptimizeInductionTruncate() argument
8168 __anone1bc88203f02(ElementCount VF) tryToWidenCall() argument
8189 __anone1bc88204002(ElementCount VF) tryToWidenCall() argument
8203 __anone1bc88204102(ElementCount VF) tryToWidenCall() argument
8261 __anone1bc88204202(ElementCount VF) shouldWiden() argument
8329 __anone1bc88204302(ElementCount VF) handleReplication() argument
8427 __anone1bc88204402(ElementCount VF) tryToCreateWidenRecipe() argument
8461 for (ElementCount VF = MinVF; ElementCount::isKnownLT(VF, MaxVFTimes2);) { buildVPlansWithVPRecipes() local
8543 __anone1bc88204502(ElementCount VF) tryToBuildVPlanWithVPRecipes() argument
8562 for (ElementCount VF : Range) tryToBuildVPlanWithVPRecipes() local
8584 __anone1bc88204602(ElementCount VF) tryToBuildVPlanWithVPRecipes() argument
8732 for (ElementCount VF : Range) tryToBuildVPlanWithVPRecipes() local
8804 for (ElementCount VF : Range) buildVPlan() local
9570 const VectorizationFactor VF = LVP.planInVPlanNativePath(UserVF); processLoopInVPlanNativePath() local
9646 areRuntimeChecksProfitable(GeneratedRTChecks & Checks,VectorizationFactor & VF,std::optional<unsigned> VScale,Loop * L,ScalarEvolution & SE,ScalarEpilogueLowering SEL) areRuntimeChecksProfitable() argument
9922 VectorizationFactor VF = VectorizationFactor::Disabled(); processLoop() local
[all...]
H A DSLPVectorizer.cpp438 buildUseMask(int VF,ArrayRef<int> Mask,UseMask MaskArg) buildUseMask() argument
4245 const int VF = GetVF(I); findReusedOrderedScalars() local
4313 unsigned VF = 0; findReusedOrderedScalars() local
4628 for (unsigned VF = MaxVF; VF >= MinVF; VF /= 2) { canVectorizeLoads() local
4944 unsigned VF = ReorderMask.size(); getReorderingData() local
4969 unsigned VF = TE.getVectorFactor(); getReorderingData() local
5288 for (unsigned VF = VectorizableTree.front()->getVectorFactor(); VF > 1; reorderTopToBottom() local
5703 unsigned VF = Data.second.front().second->getVectorFactor(); reorderBottomToTop() local
7707 int VF = VecTy->getNumElements(); isIdentityMask() local
7734 unsigned VF = Mask.size(); combineMasks() local
7900 int VF = Mask.size(); createShuffle() local
7908 int VF = createShuffle() local
8252 unsigned VF = VL.size() / 2; getBuildVectorCost() local
8591 unsigned VF = E1.getVectorFactor(); estimateNodesPermuteCost() local
8613 isEmptyOrIdentity(ArrayRef<int> Mask,unsigned VF) isEmptyOrIdentity() argument
8628 unsigned VF = createShuffleVector() local
8637 unsigned VF = createShuffleVector() local
8664 __anon779134677f02(const TreeEntry &E, unsigned VF) createShuffle() argument
8707 unsigned VF = E->getVectorFactor(); createShuffle() local
8741 unsigned VF = E->getVectorFactor(); createShuffle() local
8782 unsigned VF = cast<FixedVectorType>(V1->getType())->getNumElements(); createShuffle() local
8808 unsigned VF = cast<FixedVectorType>(V2->getType())->getNumElements(); createShuffle() local
8836 unsigned VF = cast<FixedVectorType>(V1->getType())->getNumElements(); createShuffle() local
9073 unsigned VF = cast<FixedVectorType>(V1->getType())->getNumElements(); add() local
9097 unsigned VF = VL.size(); gather() local
9117 finalize(ArrayRef<int> ExtMask,unsigned VF=0,function_ref<void (Value * &,SmallVectorImpl<int> &)> Action={}) finalize() argument
9201 buildIntrinsicArgTypes(const CallInst * CI,const Intrinsic::ID ID,const unsigned VF,unsigned MinBW) buildIntrinsicArgTypes() argument
10307 for (unsigned Idx = 0, VF = Mask.size(); Idx < VF; ++Idx) { performExtractsShuffleAction() local
10337 for (unsigned I = 0, VF = Mask.size(); I < VF; ++I) { performExtractsShuffleAction() local
10351 for (unsigned I = 0, VF = Mask.size(); I < VF; ++I) { performExtractsShuffleAction() local
10373 for (unsigned I = 0, VF = Mask.size(); I < VF; ++I) { performExtractsShuffleAction() local
10607 unsigned VF = Mask.size(); getTreeCost() local
10631 unsigned VF = 0; getTreeCost() local
11038 unsigned VF = 0; isGatherShuffledSingleRegisterEntry() local
11078 unsigned VF = TE->getVectorFactor(); isGatherShuffledSingleRegisterEntry() local
11739 unsigned VF = Mask.size(); createShuffleVector() local
11751 createPoison(Type * Ty,unsigned VF) createPoison() argument
11761 int VF = std::max(V1VF, V2VF); resizeToMatch() local
11877 const unsigned VF = std::accumulate( adjustExtracts() local
12071 int VF = CommonMask.size(); add() local
12093 finalize(ArrayRef<int> ExtMask,unsigned VF=0,function_ref<void (Value * &,SmallVectorImpl<int> &)> Action={}) finalize() argument
12149 const unsigned VF = VL.size(); vectorizeOperand() local
12265 unsigned VF = E->getVectorFactor(); processBuildVector() local
14056 int VF = cast<FixedVectorType>(V1->getType())->getNumElements(); vectorizeTree() local
14073 unsigned VF = Mask.size(); vectorizeTree() local
15129 const unsigned VF = E.Scalars.size(); collectValuesToDemote() local
15385 unsigned VF = E.Scalars.size(); collectValuesToDemote() local
15468 unsigned VF = E.getVectorFactor(); computeMinimumValueSizes() local
15798 unsigned VF = Chain.size(); vectorizeStoreChain() local
15994 __anon7791346714002(unsigned &VF) vectorizeStores() argument
16165 unsigned VF = PowerOf2Ceil(CandidateVFs.front()) * 2; vectorizeStores() local
16383 for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF; VF /= 2) { tryToVectorizeList() local
17886 for (unsigned I = 0, VF = VL.size(); I < VF; ++I) { emitReusedOps() local
[all...]
H A DVPlan.h113 ElementCount VF; global() member
170 getLaneFromEnd(const ElementCount & VF,unsigned Offset) getLaneFromEnd() argument
184 getLastLaneForVF(const ElementCount & VF) getLastLaneForVF() argument
206 mapToCacheIndex(const ElementCount & VF) mapToCacheIndex() argument
219 getNumCachedLanes(const ElementCount & VF) getNumCachedLanes() argument
249 ElementCount VF; global() member
3249 addVF(ElementCount VF) addVF() argument
3251 setVF(ElementCount VF) setVF() argument
3257 hasVF(ElementCount VF) hasVF() argument
[all...]
H A DLoopIdiomVectorize.cpp104 LoopIdiomVectorize(LoopIdiomVectorizeStyle S, unsigned VF, DominatorTree *DT, in LoopIdiomVectorize() argument
509 auto *VF = ConstantInt::get(I32Type, ByteCompareVF); createPredicatedFindMismatch() local
/llvm-project/llvm/lib/Target/LoongArch/
H A DLoongArchTargetTransformInfo.cpp72 getMaxInterleaveFactor(ElementCount VF) getMaxInterleaveFactor() argument
/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp681 // FIXME: VF 2 for these FP operations are currently just as in getVectorTruncCost() local
532 unsigned VF = VTy->getNumElements(); getArithmeticInstrCost() local
725 getCmpOpsType(const Instruction * I,unsigned VF=1) getCmpOpsType() argument
755 unsigned VF = DstVTy->getNumElements(); getBoolVecToIntConversionCost() local
853 unsigned VF = SrcVecTy->getNumElements(); getCastInstrCost() local
995 unsigned VF = cast<FixedVectorType>(ValTy)->getNumElements(); getCmpSelInstrCost() local
1248 unsigned VF = NumElts / Factor; getInterleavedMemoryOpCost() local
[all...]
/llvm-project/clang-tools-extra/unittests/include/common/
H A DVirtualFileHelper.h43 VirtualFile VF = { FileName, Code }; in mapFile() local
/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVTargetTransformInfo.h305 isLegalToVectorizeReduction(const RecurrenceDescriptor & RdxDesc,ElementCount VF) isLegalToVectorizeReduction() argument
334 getMaxInterleaveFactor(ElementCount VF) getMaxInterleaveFactor() argument
/llvm-project/clang/test/CodeGenCXX/
H A Dapple-kext-indirect-call-2.cpp18 void B::VF() {} in VF() function in B
H A Dptrauth-apple-kext-indirect-call-2.cpp18 void B::VF() {} in VF() function in B
/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.h151 getMaxNumElements(ElementCount VF) getMaxNumElements() argument
420 getStoreMinimumVF(unsigned VF,Type * ScalarMemTy,Type * ScalarValTy) getStoreMinimumVF() argument
[all...]
/llvm-project/llvm/unittests/IR/
H A DShuffleVectorInstTest.cpp127 int ReplicationFactor, VF; in TEST() local
/llvm-project/llvm/include/llvm/Analysis/
H A DTargetLibraryInfo.h202 return !(getVectorizedFunction(F, VF, false).empty() && in isFunctionVectorizable() argument
391 return Impl->isFunctionVectorizable(F, VF); in isFunctionVectorizable() argument
401 getVectorMappingInfo(StringRef F,const ElementCount & VF,bool Masked) getVectorMappingInfo() argument
[all...]
H A DTargetTransformInfoImpl.h544 unsigned getStoreMinimumVF(unsigned VF, Type *, Type *) const { return VF; } in getMaxInterleaveFactor() argument
500 getStoreMinimumVF(unsigned VF,Type *,Type *) getStoreMinimumVF() argument
676 getReplicationShuffleCost(Type * EltTy,int ReplicationFactor,int VF,const APInt & DemandedDstElts,TTI::TargetCostKind CostKind) getReplicationShuffleCost() argument
905 isLegalToVectorizeReduction(const RecurrenceDescriptor & RdxDesc,ElementCount VF) isLegalToVectorizeReduction() argument
911 getLoadVectorFactor(unsigned VF,unsigned LoadSize,unsigned ChainSizeInBytes,VectorType * VecTy) getLoadVectorFactor() argument
917 getStoreVectorFactor(unsigned VF,unsigned StoreSize,unsigned ChainSizeInBytes,VectorType * VecTy) getStoreVectorFactor() argument
1369 int ReplicationFactor, VF; getInstructionCost() local
[all...]
/llvm-project/llvm/lib/IR/
H A DVFABIDemangler.cpp95 unsigned VF = 0; tryParseVLEN() local
551 ElementCount VF = Info.Shape.VF; createFunctionType() local
[all...]
/llvm-project/llvm/lib/Target/AMDGPU/
H A DR600TargetTransformInfo.cpp85 unsigned R600TTIImpl::getMaxInterleaveFactor(ElementCount VF) { in getMaxInterleaveFactor()
H A DAMDGPUTargetTransformInfo.cpp345 getLoadVectorFactor(unsigned VF,unsigned LoadSize,unsigned ChainSizeInBytes,VectorType * VecTy) const getLoadVectorFactor() argument
356 getStoreVectorFactor(unsigned VF,unsigned StoreSize,unsigned ChainSizeInBytes,VectorType * VecTy) const getStoreVectorFactor() argument
491 getMaxInterleaveFactor(ElementCount VF) getMaxInterleaveFactor() argument
/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLowerMASSVEntries.cpp33 #define TLI_DEFINE_VECFUNC(SCAL, VEC, VF, VABI_PREFIX) VEC, argument
/llvm-project/llvm/lib/Target/X86/
H A DX86InterleavedAccess.cpp439 int VF = VT.getVectorNumElements(); createShuffleStride() local
452 int VF = VT.getVectorNumElements() / std::max(VectorSize / 128, 1); setGroupSize() local
611 int VF = VT.getVectorNumElements(); group2Shuffle() local
[all...]
/llvm-project/llvm/include/llvm/IR/
H A DVFABIDemangler.h83 ElementCount VF; // Vectorization factor. global() member
/llvm-project/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.h181 unsigned getMaxInterleaveFactor(ElementCount VF) { in getMaxInterleaveFactor() argument

123