Home
last modified time | relevance | path

Searched refs:Query (Results 1 – 25 of 83) sorted by relevance

1234

/openbsd-src/gnu/llvm/llvm/lib/CodeGen/GlobalISel/
H A DLegalityPredicates.cpp30 [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; }; in typeIs() argument
37 return [=](const LegalityQuery &Query) { in typeInSet() argument
38 return llvm::is_contained(Types, Query.Types[TypeIdx]); in typeInSet()
46 return [=](const LegalityQuery &Query) { in typePairInSet() argument
47 std::pair<LLT, LLT> Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1]}; in typePairInSet()
56 return [=](const LegalityQuery &Query) { in typePairAndMemDescInSet() argument
57 TypePairAndMemDesc Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1], in typePairAndMemDescInSet()
58 Query.MMODescrs[MMOIdx].MemoryTy, in typePairAndMemDescInSet()
59 Query.MMODescrs[MMOIdx].AlignInBits}; in typePairAndMemDescInSet()
68 return [=](const LegalityQuery &Query) { in isScalar() argument
[all …]
H A DLegalizeMutations.cpp19 [=](const LegalityQuery &Query) { return std::make_pair(TypeIdx, Ty); }; in changeTo() argument
24 return [=](const LegalityQuery &Query) { in changeTo() argument
25 return std::make_pair(TypeIdx, Query.Types[FromTypeIdx]); in changeTo()
31 return [=](const LegalityQuery &Query) { in changeElementTo() argument
32 const LLT OldTy = Query.Types[TypeIdx]; in changeElementTo()
33 const LLT NewTy = Query.Types[FromTypeIdx]; in changeElementTo()
40 return [=](const LegalityQuery &Query) { in changeElementTo() argument
41 const LLT OldTy = Query.Types[TypeIdx]; in changeElementTo()
48 return [=](const LegalityQuery &Query) { in changeElementCountTo() argument
49 const LLT OldTy = Query.Types[TypeIdx]; in changeElementCountTo()
[all …]
H A DLegalizerInfo.cpp183 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const { in apply()
184 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs()); in apply()
191 if (Rule.match(Query)) { in apply()
193 std::pair<unsigned, LLT> Mutation = Rule.determineMutation(Query); in apply()
196 assert(mutationIsSane(Rule, Query, Mutation) && in apply()
198 assert(hasNoSimpleLoops(Rule, Query, Mutation) && "Simple loop detected"); in apply()
319 LegalizerInfo::getAction(const LegalityQuery &Query) const { in getAction()
320 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query); in getAction()
325 return getLegacyLegalizerInfo().getAction(Query); in getAction()
H A DLegacyLegalizerInfo.cpp370 LegacyLegalizerInfo::getAction(const LegalityQuery &Query) const { in getAction()
371 for (unsigned i = 0; i < Query.Types.size(); ++i) { in getAction()
372 auto Action = getAspectAction({Query.Opcode, i, Query.Types[i]}); in getAction()
/openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/GISel/
H A DAArch64LegalizerInfo.cpp89 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
90 return Query.Types[0].isVector() && in AArch64LegalizerInfo()
91 (Query.Types[0].getElementType() != s64 || in AArch64LegalizerInfo()
92 Query.Types[0].getNumElements() != 2); in AArch64LegalizerInfo()
94 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
95 LLT EltTy = Query.Types[0].getElementType(); in AArch64LegalizerInfo()
121 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
122 return Query.Opcode == G_MUL && Query.Types[0] == v2s64; in AArch64LegalizerInfo()
133 .customIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
134 const auto &SrcTy = Query.Types[0]; in AArch64LegalizerInfo()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegalizerInfo.h229 return [=](const LegalityQuery &Query) { in all()
230 return P0(Query) && P1(Query); in all()
242 return [=](const LegalityQuery &Query) { in any()
243 return P0(Query) || P1(Query); in any()
260 return [=](const LegalityQuery &Query) { in typeIsNot()
261 return Query.Types[TypeIdx] != Type; in typeIsNot()
404 bool match(const LegalityQuery &Query) const { in match() argument
405 return Predicate(Query); in match()
411 std::pair<unsigned, LLT> determineMutation(const LegalityQuery &Query) const { in determineMutation() argument
413 return Mutation(Query); in determineMutation()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/Mips/
H A DMipsLegalizerInfo.cpp39 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query, in CheckTy0Ty1MemSizeAlign() argument
41 unsigned QueryMemSize = Query.MMODescrs[0].MemoryTy.getSizeInBits(); in CheckTy0Ty1MemSizeAlign()
48 if (Val.ValTy != Query.Types[0]) in CheckTy0Ty1MemSizeAlign()
50 if (Val.PtrTy != Query.Types[1]) in CheckTy0Ty1MemSizeAlign()
55 isUnalignedMemmoryAccess(QueryMemSize, Query.MMODescrs[0].AlignInBits)) in CheckTy0Ty1MemSizeAlign()
62 static bool CheckTyN(unsigned N, const LegalityQuery &Query, in CheckTyN() argument
64 return llvm::is_contained(SupportedValues, Query.Types[N]); in CheckTyN()
82 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() argument
83 if (CheckTyN(0, Query, {s32})) in MipsLegalizerInfo()
85 if (ST.hasMSA() && CheckTyN(0, Query, {v16s8, v8s16, v4s32, v2s64})) in MipsLegalizerInfo()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DAutoConvert.cpp32 struct f_cnvrt Query = { in enableAutoConversion() local
38 if (fcntl(FD, F_CONTROL_CVT, &Query) == -1) in enableAutoConversion()
41 Query.cvtcmd = SETCVTALL; in enableAutoConversion()
42 Query.pccsid = in enableAutoConversion()
47 Query.fccsid = (Query.fccsid == FT_UNTAGGED) ? CCSID_IBM_1047 : Query.fccsid; in enableAutoConversion()
48 if (fcntl(FD, F_CONTROL_CVT, &Query) == -1) in enableAutoConversion()
H A DSpecialCaseList.cpp60 unsigned SpecialCaseList::Matcher::match(StringRef Query) const { in match()
61 auto It = Strings.find(Query); in match()
64 if (Trigrams.isDefinitelyOut(Query)) in match()
67 if (RegExKV.first->match(Query)) in match()
204 StringRef Query, StringRef Category) const { in inSection() argument
205 return inSectionBlame(Section, Prefix, Query, Category); in inSection()
209 StringRef Query, in inSectionBlame() argument
214 inSectionBlame(SectionIter.Entries, Prefix, Query, Category); in inSectionBlame()
222 StringRef Prefix, StringRef Query, in inSectionBlame() argument
229 return II->getValue().match(Query); in inSectionBlame()
H A DTrigramIndex.cpp86 bool TrigramIndex::isDefinitelyOut(StringRef Query) const { in isDefinitelyOut()
91 for (size_t I = 0; I < Query.size(); I++) { in isDefinitelyOut()
92 Tri = ((Tri << 8) + Query[I]) & 0xFFFFFF; in isDefinitelyOut()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h112 class Query {
131 Query() = default;
132 Query(const LiveRange &LR, const LiveIntervalUnion &LIU) in Query() function
134 Query(const Query &) = delete;
135 Query &operator=(const Query &) = delete;
H A DLiveRegMatrix.h53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries;
153 LiveIntervalUnion::Query &query(const LiveRange &LR, MCRegister RegUnit);
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A DSpecialCaseList.h93 bool inSection(StringRef Section, StringRef Prefix, StringRef Query,
104 unsigned inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query,
127 unsigned match(StringRef Query) const;
153 StringRef Query, StringRef Category) const;
H A DTrigramIndex.h44 bool isDefinitelyOut(StringRef Query) const;
/openbsd-src/gnu/llvm/clang/lib/Basic/
H A DProfileList.cpp106 StringRef Query) const { in inSection()
107 if (SCL->inSection(Section, Prefix, Query, "allow")) in inSection()
109 if (SCL->inSection(Section, Prefix, Query, "skip")) in inSection()
111 if (SCL->inSection(Section, Prefix, Query, "forbid")) in inSection()
113 if (SCL->inSection(Section, Prefix, Query)) in inSection()
H A DSanitizerSpecialCaseList.cpp57 StringRef Query, in inSection() argument
61 SpecialCaseList::inSectionBlame(S.Entries, Prefix, Query, Category)) in inSection()
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPULegalizerInfo.cpp67 return [=](const LegalityQuery &Query) { in isSmallOddVector() argument
68 const LLT Ty = Query.Types[TypeIdx]; in isSmallOddVector()
81 return [=](const LegalityQuery &Query) { in sizeIsMultipleOf32() argument
82 const LLT Ty = Query.Types[TypeIdx]; in sizeIsMultipleOf32()
88 return [=](const LegalityQuery &Query) { in isWideVec16() argument
89 const LLT Ty = Query.Types[TypeIdx]; in isWideVec16()
96 return [=](const LegalityQuery &Query) { in oneMoreElement() argument
97 const LLT Ty = Query.Types[TypeIdx]; in oneMoreElement()
105 return [=](const LegalityQuery &Query) { in fewerEltsToSize64Vector() argument
106 const LLT Ty = Query.Types[TypeIdx]; in fewerEltsToSize64Vector()
[all …]
H A DSIOptimizeExecMaskingPreRA.cpp85 LiveQueryResult AndLRQ = LR.Query(AndIdx); in isDefBetween()
86 return (!AndLRQ.isKill() && AndLRQ.valueIn() != LR.Query(SelIdx).valueOut()); in isDefBetween()
242 auto CCQ = CCLI.Query(SelIdx.getRegSlot()); in optimizeVcndVcmpPair()
252 auto CCQS = SR.Query(SelIdx.getRegSlot()); in optimizeVcndVcmpPair()
268 if ((CmpLI && CmpLI->Query(AndIdx.getRegSlot()).isKill()) || in optimizeVcndVcmpPair()
282 bool IsKill = SelLI->Query(CmpIdx.getRegSlot()).isKill(); in optimizeVcndVcmpPair()
284 bool IsDead = SelLI->Query(SelIdx.getRegSlot()).isDeadDef(); in optimizeVcndVcmpPair()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DLiveRegMatrix.cpp62 Queries.reset(new LiveIntervalUnion::Query[NumRegUnits]); in runOnMachineFunction()
178 LiveIntervalUnion::Query &LiveRegMatrix::query(const LiveRange &LR, in query()
180 LiveIntervalUnion::Query &Q = Queries[RegUnit]; in query()
232 LiveIntervalUnion::Query Q; in checkInterference()
H A DLiveIntervalUnion.cpp116 bool LiveIntervalUnion::Query::isSeenInterference( in isSeenInterference()
131 LiveIntervalUnion::Query::collectInterferingVRegs(unsigned MaxInterferingRegs) { in collectInterferingVRegs()
/openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCVSXFMAMutate.cpp112 LIS->getInterval(MI.getOperand(1).getReg()).Query(FMAIdx).valueIn(); in processBlock()
192 if (LIS->getInterval(Reg2).Query(FMAIdx).isKill() in processBlock()
196 } else if (LIS->getInterval(Reg3).Query(FMAIdx).isKill() in processBlock()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DValueTracking.cpp102 struct Query { struct
115 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, in Query() function
173 KnownBits &Known, unsigned Depth, const Query &Q);
176 const Query &Q) { in computeKnownBits()
192 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
201 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
205 unsigned Depth, const Query &Q);
208 const Query &Q);
217 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
228 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); in computeKnownBits()
[all …]
/openbsd-src/gnu/usr.sbin/mkhybrid/src/
H A Dmagic73 >>>15 string Query - type %s
80 >>>16 string Query - type %s
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/clang-tools-extra/clang-query/
H A DBUILD.gn15 "Query.cpp",
/openbsd-src/gnu/llvm/clang/include/clang/Basic/
H A DSanitizerSpecialCaseList.h43 bool inSection(SanitizerMask Mask, StringRef Prefix, StringRef Query,

1234