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

123

/openbsd-current/gnu/llvm/llvm/lib/CodeGen/GlobalISel/
H A DLegalityPredicates.cpp30 [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; };
37 return [=](const LegalityQuery &Query) {
38 return llvm::is_contained(Types, Query.Types[TypeIdx]);
46 return [=](const LegalityQuery &Query) {
47 std::pair<LLT, LLT> Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1]};
56 return [=](const LegalityQuery &Query) {
57 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 OldTy = Query
[all...]
H A DLegalizerInfo.cpp183 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const {
184 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs());
191 if (Rule.match(Query)) {
193 std::pair<unsigned, LLT> Mutation = Rule.determineMutation(Query);
196 assert(mutationIsSane(Rule, Query, Mutation) &&
198 assert(hasNoSimpleLoops(Rule, Query, Mutation) && "Simple loop detected");
319 LegalizerInfo::getAction(const LegalityQuery &Query) const {
320 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query);
325 return getLegacyLegalizerInfo().getAction(Query);
[all...]
H A DLegacyLegalizerInfo.cpp370 LegacyLegalizerInfo::getAction(const LegalityQuery &Query) const {
371 for (unsigned i = 0; i < Query.Types.size(); ++i) {
372 auto Action = getAspectAction({Query.Opcode, i, Query.Types[i]});
/openbsd-current/gnu/llvm/llvm/lib/Support/
H A DAutoConvert.cpp32 struct f_cnvrt Query = { local
38 if (fcntl(FD, F_CONTROL_CVT, &Query) == -1)
41 Query.cvtcmd = SETCVTALL;
42 Query.pccsid =
47 Query.fccsid = (Query.fccsid == FT_UNTAGGED) ? CCSID_IBM_1047 : Query.fccsid;
48 if (fcntl(FD, F_CONTROL_CVT, &Query) == -1)
H A DTrigramIndex.cpp86 bool TrigramIndex::isDefinitelyOut(StringRef Query) const {
91 for (size_t I = 0; I < Query.size(); I++) {
92 Tri = ((Tri << 8) + Query[I]) & 0xFFFFFF;
H A DSpecialCaseList.cpp60 unsigned SpecialCaseList::Matcher::match(StringRef Query) const {
61 auto It = Strings.find(Query);
64 if (Trigrams.isDefinitelyOut(Query))
67 if (RegExKV.first->match(Query))
204 StringRef Query, StringRef Category) const {
205 return inSectionBlame(Section, Prefix, Query, Category);
209 StringRef Query,
214 inSectionBlame(SectionIter.Entries, Prefix, Query, Category);
222 StringRef Prefix, StringRef Query,
229 return II->getValue().match(Query);
203 inSection(StringRef Section, StringRef Prefix, StringRef Query, StringRef Category) const argument
208 inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query, StringRef Category) const argument
221 inSectionBlame(const SectionEntries &Entries, StringRef Prefix, StringRef Query, StringRef Category) const argument
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/Support/
H A DTrigramIndex.h44 bool isDefinitelyOut(StringRef Query) const;
H A DSpecialCaseList.h92 /// where @Query satisfies wildcard expression <E> in a given @Section.
93 bool inSection(StringRef Section, StringRef Prefix, StringRef Query,
101 /// where @Query satisfies wildcard expression <E> in a given @Section.
104 unsigned inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query,
127 unsigned match(StringRef Query) const;
150 // Helper method for derived classes to search by Prefix, Query, and Category
153 StringRef Query, StringRef Category) const;
/openbsd-current/gnu/llvm/llvm/lib/Target/Mips/
H A DMipsLegalizerInfo.cpp39 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query, argument
41 unsigned QueryMemSize = Query.MMODescrs[0].MemoryTy.getSizeInBits();
48 if (Val.ValTy != Query.Types[0])
50 if (Val.PtrTy != Query.Types[1])
55 isUnalignedMemmoryAccess(QueryMemSize, Query.MMODescrs[0].AlignInBits))
62 static bool CheckTyN(unsigned N, const LegalityQuery &Query, argument
64 return llvm::is_contained(SupportedValues, Query.Types[N]);
82 .legalIf([=, &ST](const LegalityQuery &Query) {
83 if (CheckTyN(0, Query, {s32}))
85 if (ST.hasMSA() && CheckTyN(0, Query, {v16s
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/GISel/
H A DAArch64LegalizerInfo.cpp89 [=](const LegalityQuery &Query) {
90 return Query.Types[0].isVector() &&
91 (Query.Types[0].getElementType() != s64 ||
92 Query.Types[0].getNumElements() != 2);
94 [=](const LegalityQuery &Query) {
95 LLT EltTy = Query.Types[0].getElementType();
121 [=](const LegalityQuery &Query) {
122 return Query.Opcode == G_MUL && Query.Types[0] == v2s64;
133 .customIf([=](const LegalityQuery &Query) {
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h110 /// Query interferences between a single live virtual register and a live
112 class Query { class in class:llvm::LiveIntervalUnion
131 Query() = default;
132 Query(const LiveRange &LR, const LiveIntervalUnion &LIU) function in class:llvm::LiveIntervalUnion::Query
134 Query(const Query &) = delete;
135 Query &operator=(const Query &) = delete;
H A DLiveRegMatrix.h53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries;
149 /// Query a line of the assigned virtual register matrix directly.
151 /// This returns a reference to an internal Query data structure that is only
153 LiveIntervalUnion::Query &query(const LiveRange &LR, MCRegister RegUnit);
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegalizerInfo.h229 return [=](const LegalityQuery &Query) {
230 return P0(Query) && P1(Query);
242 return [=](const LegalityQuery &Query) {
243 return P0(Query) || P1(Query);
260 return [=](const LegalityQuery &Query) {
261 return Query.Types[TypeIdx] != Type;
404 bool match(const LegalityQuery &Query) const {
405 return Predicate(Query);
[all...]
H A DLoadStoreOpt.h112 bool isLegalOrBeforeLegalizer(const LegalityQuery &Query,
/openbsd-current/gnu/llvm/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
H A DProfileList.cpp106 StringRef Query) const {
107 if (SCL->inSection(Section, Prefix, Query, "allow"))
109 if (SCL->inSection(Section, Prefix, Query, "skip"))
111 if (SCL->inSection(Section, Prefix, Query, "forbid"))
113 if (SCL->inSection(Section, Prefix, Query))
/openbsd-current/gnu/llvm/clang/include/clang/Basic/
H A DSanitizerSpecialCaseList.h42 // Query ignorelisted entries if any bit in Mask matches the entry's section.
43 bool inSection(SanitizerMask Mask, StringRef Prefix, StringRef Query,
H A DProfileList.h45 StringRef Query) const;
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPULegalizerInfo.cpp67 return [=](const LegalityQuery &Query) {
68 const LLT Ty = Query.Types[TypeIdx];
81 return [=](const LegalityQuery &Query) {
82 const LLT Ty = Query.Types[TypeIdx];
88 return [=](const LegalityQuery &Query) {
89 const LLT Ty = Query.Types[TypeIdx];
96 return [=](const LegalityQuery &Query) {
97 const LLT Ty = Query.Types[TypeIdx];
105 return [=](const LegalityQuery &Query) {
106 const LLT Ty = Query
[all...]
H A DSIOptimizeExecMaskingPreRA.cpp85 LiveQueryResult AndLRQ = LR.Query(AndIdx);
86 return (!AndLRQ.isKill() && AndLRQ.valueIn() != LR.Query(SelIdx).valueOut());
242 auto CCQ = CCLI.Query(SelIdx.getRegSlot());
252 auto CCQS = SR.Query(SelIdx.getRegSlot());
268 if ((CmpLI && CmpLI->Query(AndIdx.getRegSlot()).isKill()) ||
282 bool IsKill = SelLI->Query(CmpIdx.getRegSlot()).isKill();
284 bool IsDead = SelLI->Query(SelIdx.getRegSlot()).isDeadDef();
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/
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];
229 // FIXME: the usability of the Query API needs to be improved to avoid
232 LiveIntervalUnion::Query Q;
H A DLiveIntervalUnion.cpp116 bool LiveIntervalUnion::Query::isSeenInterference(
131 LiveIntervalUnion::Query::collectInterferingVRegs(unsigned MaxInterferingRegs) {
/openbsd-current/gnu/llvm/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()
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DValueTracking.cpp102 struct Query { struct in namespace:__anon2008
115 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, function in struct:__anon2008::Query
173 KnownBits &Known, unsigned Depth, const Query &Q);
176 const Query &Q) {
192 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
201 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
205 unsigned Depth, const Query &Q);
208 const Query &Q);
217 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
228 Query(D
[all...]

Completed in 148 milliseconds

123