| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| LegalizeMutations.cpp | 19 [=](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.Types[TypeIdx]
[all...] |
| LegalityPredicates.cpp | 30 [=](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.Types[TypeIdx1]
[all...] |
| LegalizerInfo.cpp | 9 // Implement an interface to specify and query how an illegal operation on a
190 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const {
191 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs());
198 if (Rule.match(Query)) {
200 std::pair<unsigned, LLT> Mutation = Rule.determineMutation(Query);
203 assert(mutationIsSane(Rule, Query, Mutation) &&
205 assert(hasNoSimpleLoops(Rule, Query, Mutation) && "Simple loop detected");
466 LegalizerInfo::getAction(const LegalityQuery &Query) const {
467 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| AutoConvert.cpp | 32 struct f_cnvrt Query = {
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)
|
| TrigramIndex.cpp | 85 bool TrigramIndex::isDefinitelyOut(StringRef Query) const {
90 for (size_t I = 0; I < Query.size(); I++) {
91 Tri = ((Tri << 8) + Query[I]) & 0xFFFFFF;
99 // If we have reached a desired limit, we have to look at the query
|
| SpecialCaseList.cpp | 61 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);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/ |
| AArch64LegalizerInfo.cpp | 87 [=](const LegalityQuery &Query) {
88 return Query.Types[0].isVector() &&
89 (Query.Types[0].getElementType() != s64 ||
90 Query.Types[0].getNumElements() != 2);
92 [=](const LegalityQuery &Query) {
93 LLT EltTy = Query.Types[0].getElementType();
112 [=](const LegalityQuery &Query) {
113 return Query.Opcode == G_MUL && Query.Types[0] == v2s64;
124 .customIf([=](const LegalityQuery &Query) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| TrigramIndex.h | 14 // The basic idea is that in order for a wildcard to match a query, the query
16 // index (trigram -> list of rules with it) and then count trigrams in the query
18 // the check passes the query to a regex. If none of the rules got enough
19 // trigrams, the check tells that the query is definitely not matched by any
44 /// that matches the query. Returns false, if it's not sure.
45 bool isDefinitelyOut(StringRef Query) const;
55 // chance to match the query. The number of elements equals the number of
|
| SpecialCaseList.h | 91 /// 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,
124 // Returns the line number in the source file that this query matches to.
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;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| MipsLegalizerInfo.cpp | 38 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query,
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,
63 return llvm::is_contained(SupportedValues, Query.Types[N]);
79 .legalIf([=, &ST](const LegalityQuery &Query) {
80 if (CheckTyN(0, Query, {s32}))
82 if (ST.hasMSA() && CheckTyN(0, Query, {v16s8, v8s16, v4s32, v2s64})
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 110 /// Query interferences between a single live virtual register and a live
112 class Query {
124 Query() = default;
125 Query(const LiveRange &LR, const LiveIntervalUnion &LIU)
127 Query(const Query &) = delete;
128 Query &operator=(const Query &) = delete;
155 // query's live virtual register, up to maxInterferingRegs.
|
| LiveRegMatrix.h | 53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries;
147 /// Query a line of the assigned virtual register matrix directly.
149 /// This returns a reference to an internal Query data structure that is only
150 /// valid until the next query() call.
151 LiveIntervalUnion::Query &query(const LiveRange &LR, MCRegister RegUnit);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| LegalizerInfo.h | 123 /// to free it before using the query.
147 /// The result of a query. It either indicates a final answer of Legal or
197 return [=](const LegalityQuery &Query) {
198 return P0(Query) && P1(Query);
210 return [=](const LegalityQuery &Query) {
211 return P0(Query) || P1(Query);
228 return [=](const LegalityQuery &Query) {
229 return Query.Types[TypeIdx] != Type
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| SanitizerSpecialCaseList.cpp | 57 StringRef Query,
61 SpecialCaseList::inSectionBlame(S.Entries, Prefix, Query, Category))
|
| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| SanitizerSpecialCaseList.h | 42 // Query ignorelisted entries if any bit in Mask matches the entry's section.
43 bool inSection(SanitizerMask Mask, StringRef Prefix, StringRef Query,
|
| /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/Config/ |
| Query.pm | 8 package OpenSSL::Config::Query;
17 OpenSSL::Config::Query - Query OpenSSL configuration info
23 my $query = OpenSSL::Config::Query->new(info => \%unified_info);
25 # Query for something that's expected to give a scalar back
26 my $variable = $query->method(... args ...);
28 # Query for something that's expected to give a list back
29 my @variable = $query->method(... args ...);
43 Creates an instance of the B<OpenSSL::Config::Query> class. It takes option
[all...] |
| /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/Config/ |
| Query.pm | 8 package OpenSSL::Config::Query;
17 OpenSSL::Config::Query - Query OpenSSL configuration info
23 my $query = OpenSSL::Config::Query->new(info => \%unified_info);
25 # Query for something that's expected to give a scalar back
26 my $variable = $query->method(... args ...);
28 # Query for something that's expected to give a list back
29 my @variable = $query->method(... args ...);
43 Creates an instance of the B<OpenSSL::Config::Query> class. It takes option
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPULegalizerInfo.cpp | 66 return [=](const LegalityQuery &Query) {
67 const LLT Ty = Query.Types[TypeIdx];
80 return [=](const LegalityQuery &Query) {
81 const LLT Ty = Query.Types[TypeIdx];
87 return [=](const LegalityQuery &Query) {
88 const LLT Ty = Query.Types[TypeIdx];
95 return [=](const LegalityQuery &Query) {
96 const LLT Ty = Query.Types[TypeIdx];
103 return [=](const LegalityQuery &Query) {
104 const LLT Ty = Query.Types[TypeIdx]
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LiveRegMatrix.cpp | 62 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, function in class:LiveRegMatrix
180 LiveIntervalUnion::Query &Q = Queries[RegUnit];
201 return query(LR, Unit).checkInterference();
221 // checkInterference overload is called twice, without any other query()
223 // the cached query - the LR address seen the second time may well be the
226 // this query.
228 // FIXME: the usability of the Query API needs to be improved to avoi
[all...] |
| LiveIntervalUnion.cpp | 114 bool LiveIntervalUnion::Query::isSeenInterference(LiveInterval *VirtReg) const {
119 // query's live virtual register.
121 // The query state is one of:
127 unsigned LiveIntervalUnion::Query::
|
| LiveRangeEdit.cpp | 248 if (LI.Query(Idx).isKill())
254 if ((S.LaneMask & LaneMask).any() && S.Query(Idx).isKill())
|
| /src/external/gpl2/mkhybrid/dist/ |
| magic | 73 >>>15 string Query - type %s
80 >>>16 string Query - type %s
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCVSXFMAMutate.cpp | 112 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()
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ValueTracking.cpp | 101 struct Query {
114 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI,
195 KnownBits &Known, unsigned Depth, const Query &Q);
198 const Query &Q) {
218 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
227 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
231 unsigned Depth, const Query &Q);
234 const Query &Q);
243 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
254 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE))
[all...] |
| /src/libexec/httpd/ |
| printenv.lua | 21 function printenv(env, headers, query)
55 if query ~= nil then
56 httpd.print('<h2>Query Variables</h2>')
57 for k, v in pairs(query) do
77 function form(env, header, query)
82 if query ~= nil then
89 for k, v in pairs(query) do
|
