Searched refs:LegalityQuery (Results 1 – 12 of 12) sorted by relevance
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
H A D | LegalityPredicates.cpp | 30 [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; }; in typeIs() 37 return [=](const LegalityQuery &Query) { in typeInSet() 46 return [=](const LegalityQuery &Query) { in typePairInSet() 56 return [=](const LegalityQuery &Query) { in typePairAndMemDescInSet() 68 return [=](const LegalityQuery &Query) { in isScalar() 74 return [=](const LegalityQuery &Query) { in isVector() 80 return [=](const LegalityQuery &Query) { in isPointer() 87 return [=](const LegalityQuery &Query) { in isPointer() 95 return [=](const LegalityQuery &Query) { in elementTypeIs() 103 return [=](const LegalityQuery &Query) { in scalarNarrowerThan() [all …]
|
H A D | LegalizeMutations.cpp | 19 [=](const LegalityQuery &Query) { return std::make_pair(TypeIdx, Ty); }; in changeTo() 24 return [=](const LegalityQuery &Query) { in changeTo() 31 return [=](const LegalityQuery &Query) { in changeElementTo() 40 return [=](const LegalityQuery &Query) { in changeElementTo() 48 return [=](const LegalityQuery &Query) { in changeElementSizeTo() 58 return [=](const LegalityQuery &Query) { in widenScalarOrEltToNextPow2() 68 return [=](const LegalityQuery &Query) { in moreElementsToNextPow2() 78 return [=](const LegalityQuery &Query) { in scalarize()
|
H A D | LegalizerInfo.cpp | 87 raw_ostream &LegalityQuery::print(raw_ostream &OS) const { in print() 105 static bool hasNoSimpleLoops(const LegalizeRule &Rule, const LegalityQuery &Q, in hasNoSimpleLoops() 122 const LegalityQuery &Q, in mutationIsSane() 190 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const { in apply() 466 LegalizerInfo::getAction(const LegalityQuery &Query) const { in getAction() 508 SmallVector<LegalityQuery::MemDesc, 2> MemDescrs; in getAction()
|
H A D | CombinerHelper.cpp | 117 const LegalityQuery &Query) const { in isLegalOrBeforeLegalizer() 491 LegalityQuery::MemDesc MMDesc; in matchCombineExtendingLoads() 3634 LegalityQuery::MemDesc MMDesc; in matchLoadOrCombine()
|
H A D | LegalizerHelper.cpp | 5230 auto isSupported = [this](const LegalityQuery &Q) { in lowerBitCount()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/ |
H A D | AArch64LegalizerInfo.cpp | 87 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() 92 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() 112 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() 124 .customIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() 171 .lowerIf([=](const LegalityQuery &Q) { return Q.Types[0].isScalar(); }); in AArch64LegalizerInfo() 192 [=, &ST](const LegalityQuery &Query) { in AArch64LegalizerInfo() 197 [=](const LegalityQuery &Query) { return std::make_pair(0, s16); }) in AArch64LegalizerInfo() 201 [=, &ST](const LegalityQuery &Query) { in AArch64LegalizerInfo() 204 [=](const LegalityQuery &Query) { return std::make_pair(0, s32); }) in AArch64LegalizerInfo() 216 .unsupportedIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | LegalizerInfo.h | 124 struct LegalityQuery { struct 138 constexpr LegalityQuery(unsigned Opcode, const ArrayRef<LLT> Types, in LegalityQuery() argument 141 constexpr LegalityQuery(unsigned Opcode, const ArrayRef<LLT> Types) in LegalityQuery() argument 142 : LegalityQuery(Opcode, Types, {}) {} in LegalityQuery() 168 using LegalityPredicate = std::function<bool (const LegalityQuery &)>; 170 std::function<std::pair<unsigned, LLT>(const LegalityQuery &)>; 197 return [=](const LegalityQuery &Query) { in all() 210 return [=](const LegalityQuery &Query) { in any() 228 return [=](const LegalityQuery &Query) { in typeIsNot() 349 bool match(const LegalityQuery &Query) const { in match() [all …]
|
H A D | CombinerHelper.h | 37 struct LegalityQuery; 112 bool isLegalOrBeforeLegalizer(const LegalityQuery &Query) const;
|
H A D | LegalizationArtifactCombiner.h | 992 bool isInstUnsupported(const LegalityQuery &Query) const { in isInstUnsupported() 998 bool isInstLegal(const LegalityQuery &Query) const { in isInstLegal()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
H A D | MipsLegalizerInfo.cpp | 38 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query, in CheckTy0Ty1MemSizeAlign() 61 static bool CheckTyN(unsigned N, const LegalityQuery &Query, in CheckTyN() 79 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() 103 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() 122 .customIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() 163 .legalIf([](const LegalityQuery &Query) { return false; }) in MipsLegalizerInfo() 167 .legalIf([](const LegalityQuery &Query) { return false; }) in MipsLegalizerInfo() 194 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() 237 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() 242 .lowerIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPULegalizerInfo.cpp | 66 return [=](const LegalityQuery &Query) { in isSmallOddVector() 80 return [=](const LegalityQuery &Query) { in sizeIsMultipleOf32() 87 return [=](const LegalityQuery &Query) { in isWideVec16() 95 return [=](const LegalityQuery &Query) { in oneMoreElement() 103 return [=](const LegalityQuery &Query) { in fewerEltsToSize64Vector() 116 return [=](const LegalityQuery &Query) { in moreEltsToNext32Bit() 145 return [=](const LegalityQuery &Query) { in bitcastToRegisterType() 152 return [=](const LegalityQuery &Query) { in bitcastToVectorElement32() 161 return [=](const LegalityQuery &Query) { in vectorSmallerThan() 168 return [=](const LegalityQuery &Query) { in vectorWiderThan() [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/docs/GlobalISel/ |
H A D | Legalizer.rst | 73 At the core of this ruleset is the ``LegalityQuery`` which describes the 211 information in the ``LegalityQuery`` to make its decision.
|