Searched refs:Query (Results 1 - 25 of 47) sorted by relevance

12

/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalityPredicates.cpp19 [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; };
26 return [=](const LegalityQuery &Query) {
27 return std::find(Types.begin(), Types.end(), Query.Types[TypeIdx]) != Types.end();
35 return [=](const LegalityQuery &Query) {
36 std::pair<LLT, LLT> Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1]};
45 return [=](const LegalityQuery &Query) {
46 TypePairAndMemDesc Match = {Query.Types[TypeIdx0], Query
[all...]
H A DLegalizeMutations.cpp19 [=](const LegalityQuery &Query) { return std::make_pair(TypeIdx, Ty); };
24 return [=](const LegalityQuery &Query) {
25 return std::make_pair(TypeIdx, Query.Types[FromTypeIdx]);
31 return [=](const LegalityQuery &Query) {
32 const LLT OldTy = Query.Types[TypeIdx];
33 const LLT NewTy = Query.Types[FromTypeIdx];
40 return [=](const LegalityQuery &Query) {
41 const LLT OldTy = Query.Types[TypeIdx];
48 return [=](const LegalityQuery &Query) {
49 const LLT Ty = Query
[all...]
H A DLegalizerInfo.cpp188 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const {
189 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs());
196 if (Rule.match(Query)) {
198 std::pair<unsigned, LLT> Mutation = Rule.determineMutation(Query);
201 assert(mutationIsSane(Rule, Query, Mutation) &&
203 assert(hasNoSimpleLoops(Rule, Query, Mutation) && "Simple loop detected");
464 LegalizerInfo::getAction(const LegalityQuery &Query) const {
465 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query);
470 for (unsigned i = 0; i < Query
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64LegalizerInfo.cpp69 [=](const LegalityQuery &Query) {
70 return Query.Types[0].isVector() &&
71 (Query.Types[0].getElementType() != s64 ||
72 Query.Types[0].getNumElements() != 2);
74 [=](const LegalityQuery &Query) {
75 LLT EltTy = Query.Types[0].getElementType();
100 .customIf([=](const LegalityQuery &Query) {
101 const auto &SrcTy = Query.Types[0];
102 const auto &AmtTy = Query.Types[1];
134 .customIf([=](const LegalityQuery &Query) {
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DTrigramIndex.h45 bool isDefinitelyOut(StringRef Query) const;
H A DSpecialCaseList.h91 /// where @Query satisfies wildcard expression <E> in a given @Section.
92 bool inSection(StringRef Section, StringRef Prefix, StringRef Query,
100 /// where @Query satisfies wildcard expression <E> in a given @Section.
103 unsigned inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query,
126 unsigned match(StringRef Query) const;
149 // Helper method for derived classes to search by Prefix, Query, and Category
152 StringRef Query, StringRef Category) const;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsLegalizerInfo.cpp38 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query, argument
40 unsigned QueryMemSize = Query.MMODescrs[0].SizeInBits;
47 if (Val.ValTy != Query.Types[0])
49 if (Val.PtrTy != Query.Types[1])
54 isUnalignedMemmoryAccess(QueryMemSize, Query.MMODescrs[0].AlignInBits))
61 static bool CheckTyN(unsigned N, const LegalityQuery &Query, argument
64 if (Val == Query.Types[N])
82 .legalIf([=, &ST](const LegalityQuery &Query) {
83 if (CheckTyN(0, Query, {s32}))
85 if (ST.hasMSA() && CheckTyN(0, Query, {v16s
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DNullResolver.cpp21 NullResolver::lookup(std::shared_ptr<AsynchronousSymbolQuery> Query, argument
H A DOrcMCJITReplacement.h172 SymbolNameSet lookup(std::shared_ptr<AsynchronousSymbolQuery> Query,
180 Query->notifySymbolMetRequiredState(
184 M.ES.legacyFailQuery(*Query, Addr.takeError());
188 M.ES.legacyFailQuery(*Query, std::move(Err));
193 Query->notifySymbolMetRequiredState(
197 M.ES.legacyFailQuery(*Query, Addr.takeError());
201 M.ES.legacyFailQuery(*Query, std::move(Err));
208 if (NewSymbolsResolved && Query->isComplete())
209 Query->handleComplete();
H A DOrcCBindingsStack.h149 lookup(std::shared_ptr<orc::AsynchronousSymbolQuery> Query,
156 Query->notifySymbolMetRequiredState(
159 Stack.ES.legacyFailQuery(*Query, Addr.takeError());
163 Stack.ES.legacyFailQuery(*Query, std::move(Err));
169 if (Query->isComplete())
170 Query->handleComplete();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/
H A DTrigramIndex.cpp90 bool TrigramIndex::isDefinitelyOut(StringRef Query) const {
95 for (size_t I = 0; I < Query.size(); I++) {
96 Tri = ((Tri << 8) + Query[I]) & 0xFFFFFF;
H A DSpecialCaseList.cpp61 unsigned SpecialCaseList::Matcher::match(StringRef Query) const {
62 auto It = Strings.find(Query);
65 if (Trigrams.isDefinitelyOut(Query))
68 if (RegExKV.first->match(Query))
205 StringRef Query, StringRef Category) const {
206 return inSectionBlame(Section, Prefix, Query, Category);
210 StringRef Query,
215 inSectionBlame(SectionIter.Entries, Prefix, Query, Category);
223 StringRef Prefix, StringRef Query,
230 return II->getValue().match(Query);
204 inSection(StringRef Section, StringRef Prefix, StringRef Query, StringRef Category) const argument
209 inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query, StringRef Category) const argument
222 inSectionBlame(const SectionEntries &Entries, StringRef Prefix, StringRef Query, StringRef Category) const argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DLegacy.h38 /// value in Query. Returns the set of symbols that could not be found.
39 virtual SymbolNameSet lookup(std::shared_ptr<AsynchronousSymbolQuery> Query,
62 SymbolNameSet lookup(std::shared_ptr<AsynchronousSymbolQuery> Query,
64 return Lookup(std::move(Query), std::move(Symbols));
131 /// result in Query. If any JITSymbol returned by FindSymbol is in an
132 /// error then Query.notifyFailed(...) is called with that error and the
139 lookupWithLegacyFn(ExecutionSession &ES, AsynchronousSymbolQuery &Query, argument
147 Query.notifySymbolMetRequiredState(
151 ES.legacyFailQuery(Query, Addr.takeError());
155 ES.legacyFailQuery(Query, st
[all...]
H A DNullResolver.h27 SymbolNameSet lookup(std::shared_ptr<AsynchronousSymbolQuery> Query,
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h107 /// Query interferences between a single live virtual register and a live
109 class Query { class in class:llvm::LiveIntervalUnion
132 Query() = default;
133 Query(const LiveRange &LR, const LiveIntervalUnion &LIU): function in class:llvm::LiveIntervalUnion::Query
135 Query(const Query &) = delete;
136 Query &operator=(const Query &) = delete;
H A DLiveRegMatrix.h53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries;
146 /// Query a line of the assigned virtual register matrix directly.
148 /// This returns a reference to an internal Query data structure that is only
150 LiveIntervalUnion::Query &query(const LiveRange &LR, unsigned RegUnit);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Basic/
H A DSanitizerSpecialCaseList.cpp57 StringRef Query,
61 SpecialCaseList::inSectionBlame(S.Entries, Prefix, Query, Category))
56 inSection(SanitizerMask Mask, StringRef Prefix, StringRef Query, StringRef Category) const argument
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegalizerInfo.h198 return [=](const LegalityQuery &Query) {
199 return P0(Query) && P1(Query);
211 return [=](const LegalityQuery &Query) {
212 return P0(Query) || P1(Query);
337 bool match(const LegalityQuery &Query) const {
338 return Predicate(Query);
344 std::pair<unsigned, LLT> determineMutation(const LegalityQuery &Query) const {
346 return Mutation(Query);
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DSanitizerSpecialCaseList.h42 // Query blacklisted entries if any bit in Mask matches the entry's section.
43 bool inSection(SanitizerMask Mask, StringRef Prefix, StringRef Query,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULegalizerInfo.cpp64 return [=](const LegalityQuery &Query) {
65 const LLT Ty = Query.Types[TypeIdx];
74 return [=](const LegalityQuery &Query) {
75 const LLT Ty = Query.Types[TypeIdx];
82 return [=](const LegalityQuery &Query) {
83 const LLT Ty = Query.Types[TypeIdx];
90 return [=](const LegalityQuery &Query) {
91 const LLT Ty = Query.Types[TypeIdx];
103 return [=](const LegalityQuery &Query) {
104 const LLT Ty = Query
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveIntervalUnion.cpp104 bool LiveIntervalUnion::Query::isSeenInterference(LiveInterval *VirtReg) const {
117 unsigned LiveIntervalUnion::Query::
H A DLiveRegMatrix.cpp62 Queries.reset(new LiveIntervalUnion::Query[NumRegUnits]);
73 // No need to clear Queries here, since LiveIntervalUnion::Query doesn't
178 LiveIntervalUnion::Query &LiveRegMatrix::query(const LiveRange &LR,
180 LiveIntervalUnion::Query &Q = Queries[RegUnit];
H A DLiveRangeEdit.cpp249 if (LI.Query(Idx).isKill())
255 if ((S.LaneMask & LaneMask).any() && S.Query(Idx).isKill())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp102 struct Query { struct in namespace:__anon3401
127 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, function in struct:__anon3401::Query
132 Query(const Query &Q, const Value *NewExcl) function in struct:__anon3401::Query
205 KnownBits &Known, unsigned Depth, const Query &Q);
208 const Query &Q) {
228 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
237 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
241 unsigned Depth, const Query &Q);
244 const Query
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCVSXFMAMutate.cpp112 LIS->getInterval(MI.getOperand(1).getReg()).Query(FMAIdx).valueIn();
192 if (LIS->getInterval(Reg2).Query(FMAIdx).isKill()
196 } else if (LIS->getInterval(Reg3).Query(FMAIdx).isKill()

Completed in 513 milliseconds

12