/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | LegalityPredicates.cpp | 30 [=](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 D | LegalizeMutations.cpp | 19 [=](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 D | LegalizerInfo.cpp | 187 LegalizeActionStep LegalizeRuleSet::apply(const LegalityQuery &Query) const { in apply() 188 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs()); in apply() 195 if (Rule.match(Query)) { in apply() 197 std::pair<unsigned, LLT> Mutation = Rule.determineMutation(Query); in apply() 200 assert(mutationIsSane(Rule, Query, Mutation) && in apply() 202 assert(hasNoSimpleLoops(Rule, Query, Mutation) && "Simple loop detected"); in apply() 323 LegalizerInfo::getAction(const LegalityQuery &Query) const { in getAction() 324 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query); in getAction() 329 return getLegacyLegalizerInfo().getAction(Query); in getAction()
|
H A D | LegacyLegalizerInfo.cpp | 373 LegacyLegalizerInfo::getAction(const LegalityQuery &Query) const { in getAction() 374 for (unsigned i = 0; i < Query.Types.size(); ++i) { in getAction() 375 auto Action = getAspectAction({Query.Opcode, i, Query.Types[i]}); in getAction()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86LegalizerInfo.cpp |
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/GISel/ |
H A D | X86LegalizerInfo.cpp | 86 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument 90 return typeInSet(0, {p0, s1, s8, s16, s32, s64})(Query) || in X86LegalizerInfo() 91 (Is64Bit && typeInSet(0, {s128})(Query)); in X86LegalizerInfo() 95 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument 96 return typeInSet(0, {p0, s8, s16, s32})(Query) || in X86LegalizerInfo() 97 (Is64Bit && typeInSet(0, {s64})(Query)); in X86LegalizerInfo() 139 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument 140 if (typeInSet(0, {s8, s16, s32})(Query)) in X86LegalizerInfo() 142 if (Is64Bit && typeInSet(0, {s64})(Query)) in X86LegalizerInfo() 144 if (HasSSE2 && typeInSet(0, {v16s8, v8s16, v4s32, v2s64})(Query)) in X86LegalizerInfo() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
H A D | AArch64LegalizerInfo.cpp | 138 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument 139 return Query.Types[0].getNumElements() <= 2; in AArch64LegalizerInfo() 143 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument 144 return Query.Types[0].getNumElements() <= 4; in AArch64LegalizerInfo() 148 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument 149 return Query.Types[0].getNumElements() <= 16; in AArch64LegalizerInfo() 155 .customIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument 156 const auto &SrcTy = Query.Types[0]; in AArch64LegalizerInfo() 157 const auto &AmtTy = Query.Types[1]; in AArch64LegalizerInfo() 249 .legalIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | AutoConvert.cpp | 48 struct f_cnvrt Query = { in enableAutoConversion() local 54 if (fcntl(FD, F_CONTROL_CVT, &Query) == -1) in enableAutoConversion() 61 if (Query.pccsid == CCSID_ISO8859_1 && in enableAutoConversion() 62 (Query.fccsid == CCSID_UTF_8 || Query.fccsid == CCSID_ISO8859_1)) in enableAutoConversion() 68 savedStdHandleAutoConversionMode[FD] = Query.cvtcmd; in enableAutoConversion() 71 Query.cvtcmd = SETCVTON; in enableAutoConversion() 73 Query.cvtcmd = SETCVTALL; in enableAutoConversion() 75 Query.pccsid = in enableAutoConversion() 80 Query.fccsid = (Query.fccsid == FT_UNTAGGED) ? CCSID_IBM_1047 : Query.fccsid; in enableAutoConversion() 81 return fcntl(FD, F_CONTROL_CVT, &Query); in enableAutoConversion()
|
H A D | SpecialCaseList.cpp | 70 unsigned SpecialCaseList::Matcher::match(StringRef Query) const { in create() 72 if (Pair.first.match(Query)) in create() 75 if (Regex->match(Query)) in create() 208 StringRef Query, StringRef Category) const { in inSectionBlame() 209 return inSectionBlame(Section, Prefix, Query, Category); in inSectionBlame() 213 StringRef Query, in inSectionBlame() 218 unsigned Blame = inSectionBlame(S.Entries, Prefix, Query, Category); in inSectionBlame() 227 StringRef Prefix, StringRef Query, in inSectionBlame() 234 return II->getValue().match(Query); 201 inSection(StringRef Section,StringRef Prefix,StringRef Query,StringRef Category) const inSection() argument 206 inSectionBlame(StringRef Section,StringRef Prefix,StringRef Query,StringRef Category) const inSectionBlame() argument 219 inSectionBlame(const SectionEntries & Entries,StringRef Prefix,StringRef Query,StringRef Category) const inSectionBlame() argument
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | LegalizerInfo.h | 229 return [=](const LegalityQuery &Query) { return !P(Query); }; in predNot() 235 return [=](const LegalityQuery &Query) { in all() 236 return P0(Query) && P1(Query); in all() 248 return [=](const LegalityQuery &Query) { in any() 249 return P0(Query) || P1(Query); in any() 266 return [=](const LegalityQuery &Query) { in typeIsNot() 267 return Query.Types[TypeIdx] != Type; in typeIsNot() 410 bool match(const LegalityQuery &Query) const { in match() argument 411 return Predicate(Query); in match() 417 std::pair<unsigned, LLT> determineMutation(const LegalityQuery &Query) const { in determineMutation() argument [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsLegalizerInfo.cpp | 40 CheckTy0Ty1MemSizeAlign(const LegalityQuery &Query, in CheckTy0Ty1MemSizeAlign() argument 42 unsigned QueryMemSize = Query.MMODescrs[0].MemoryTy.getSizeInBits(); in CheckTy0Ty1MemSizeAlign() 49 if (Val.ValTy != Query.Types[0]) in CheckTy0Ty1MemSizeAlign() 51 if (Val.PtrTy != Query.Types[1]) in CheckTy0Ty1MemSizeAlign() 56 isUnalignedMemmoryAccess(QueryMemSize, Query.MMODescrs[0].AlignInBits)) in CheckTy0Ty1MemSizeAlign() 63 static bool CheckTyN(unsigned N, const LegalityQuery &Query, in CheckTyN() argument 65 return llvm::is_contained(SupportedValues, Query.Types[N]); in CheckTyN() 83 .legalIf([=, &ST](const LegalityQuery &Query) { in MipsLegalizerInfo() argument 84 if (CheckTyN(0, Query, {s32})) in MipsLegalizerInfo() 86 if (ST.hasMSA() && CheckTyN(0, Query, {v16s8, v8s16, v4s32, v2s64})) in MipsLegalizerInfo() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalUnion.h | 112 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 D | LiveRegMatrix.h | 53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries; 153 LiveIntervalUnion::Query &query(const LiveRange &LR, MCRegister RegUnit);
|
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | Z3CrosscheckVisitor.cpp | 124 const Z3CrosscheckVisitor::Z3Result &Query) { in interpretQueryResult() argument 126 AccumulatedZ3QueryTimeInEqClass += Query.Z3QueryTimeMilliseconds; in interpretQueryResult() 128 if (Query.IsSAT && Query.IsSAT.value()) { in interpretQueryResult() 135 Query.Z3QueryTimeMilliseconds >= Opts.Z3CrosscheckTimeoutThreshold) { in interpretQueryResult() 142 Query.UsedRLimit >= Opts.Z3CrosscheckRLimitThreshold) { in interpretQueryResult()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/GISel/ |
H A D | RISCVLegalizerInfo.cpp | 36 return [=, &ST](const LegalityQuery &Query) { in typeIsScalarFPArith() argument 37 return Query.Types[TypeIdx].isScalar() && in typeIsScalarFPArith() 38 ((ST.hasStdExtZfh() && Query.Types[TypeIdx].getSizeInBits() == 16) || in typeIsScalarFPArith() 39 (ST.hasStdExtF() && Query.Types[TypeIdx].getSizeInBits() == 32) || in typeIsScalarFPArith() 40 (ST.hasStdExtD() && Query.Types[TypeIdx].getSizeInBits() == 64)); in typeIsScalarFPArith() 48 LegalityPredicate P = [=, &ST](const LegalityQuery &Query) { in typeIsLegalIntOrFPVec() argument 50 (Query.Types[TypeIdx].getScalarSizeInBits() != 64 || in typeIsLegalIntOrFPVec() 52 (Query.Types[TypeIdx].getElementCount().getKnownMinValue() != 1 || in typeIsLegalIntOrFPVec() 62 LegalityPredicate P = [=, &ST](const LegalityQuery &Query) { in typeIsLegalBoolVec() argument 64 (Query.Types[TypeIdx].getElementCount().getKnownMinValue() != 1 || in typeIsLegalBoolVec() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | SpecialCaseList.h | 91 /// where @Query satisfies the glob <E> in a given @Section. 92 bool inSection(StringRef Section, StringRef Prefix, StringRef Query, 100 /// where @Query satisfies the glob <E> in a given @Section. 103 unsigned inSectionBlame(StringRef Section, StringRef Prefix, StringRef Query, 123 unsigned match(StringRef Query) const; 148 // Helper method for derived classes to search by Prefix, Query, and Category 151 StringRef Query, StringRef Category) const;
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPULegalizerInfo.cpp | 73 return [=](const LegalityQuery &Query) { in isSmallOddVector() argument 74 const LLT Ty = Query.Types[TypeIdx]; in isSmallOddVector() 87 return [=](const LegalityQuery &Query) { in sizeIsMultipleOf32() argument 88 const LLT Ty = Query.Types[TypeIdx]; in sizeIsMultipleOf32() 94 return [=](const LegalityQuery &Query) { in isWideVec16() argument 95 const LLT Ty = Query.Types[TypeIdx]; in isWideVec16() 102 return [=](const LegalityQuery &Query) { in oneMoreElement() argument 103 const LLT Ty = Query.Types[TypeIdx]; in oneMoreElement() 111 return [=](const LegalityQuery &Query) { in fewerEltsToSize64Vector() argument 112 const LLT Ty = Query.Types[TypeIdx]; in fewerEltsToSize64Vector() [all …]
|
H A D | SIOptimizeExecMaskingPreRA.cpp | 85 LiveQueryResult AndLRQ = LR.Query(AndIdx); in isDefBetween() 86 return (!AndLRQ.isKill() && AndLRQ.valueIn() != LR.Query(SelIdx).valueOut()); in isDefBetween() 222 auto CCQ = CCLI.Query(SelIdx.getRegSlot()); in optimizeVcndVcmpPair() 233 if ((CmpLI && CmpLI->Query(AndIdx.getRegSlot()).isKill()) || in optimizeVcndVcmpPair() 247 bool IsKill = SelLI->Query(CmpIdx.getRegSlot()).isKill(); in optimizeVcndVcmpPair() 249 bool IsDead = SelLI->Query(SelIdx.getRegSlot()).isDeadDef(); in optimizeVcndVcmpPair()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveRegMatrix.cpp | 62 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 D | LiveIntervalUnion.cpp | 115 bool LiveIntervalUnion::Query::isSeenInterference( 130 LiveIntervalUnion::Query::collectInterferingVRegs(unsigned MaxInterferingRegs) {
|
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/GISel/ |
H A D | PPCLegalizerInfo.cpp | 24 return [=](const LegalityQuery &Query) { in isRegisterType() argument 25 const LLT QueryTy = Query.Types[TypeIdx]; in isRegisterType()
|
/freebsd/sys/kern/ |
H A D | serdev_if.m | 64 # ihand() - Query serial device interrupt handler. 74 # ipend() - Query pending interrupt status. 83 # sysdev() - Query system device status
|
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCVSXFMAMutate.cpp | 112 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()
|
/freebsd/share/skel/ |
H A D | dot.login | 7 # Query terminal size; useful for serial lines.
|
/freebsd/bin/csh/ |
H A D | dot.login | 7 # Query terminal size; useful for serial lines.
|