Home
last modified time | relevance | path

Searched refs:Depth (Results 1 – 25 of 246) sorted by relevance

12345678910

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DGISelValueTracking.cpp55 Align GISelValueTracking::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() argument
59 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth); in computeKnownAlignment()
73 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1); in computeKnownAlignment()
95 unsigned Depth) { in getKnownBits() argument
100 computeKnownBitsImpl(R, Known, DemandedElts, Depth); in getKnownBits()
120 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() argument
121 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult()
122 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult()
124 << "[" << Depth << "] Zero: 0x" << toString(Known.Zero, 16, false) in dumpResult()
126 << "[" << Depth << "] One: 0x" << toString(Known.One, 16, false) in dumpResult()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLongestCommonSequence.h52 for (int32_t Depth = Trace.size() - 1; X > 0 || Y > 0; Depth--) { in longestCommonSequence() local
53 const auto &P = Trace[Depth]; in longestCommonSequence()
56 if (K == -Depth || (K != Depth && P[Index(K - 1)] < P[Index(K + 1)])) in longestCommonSequence()
69 if (Depth == 0) in longestCommonSequence()
88 for (int32_t Depth = 0; Depth <= MaxDepth; Depth++) { in longestCommonSequence() local
90 for (int32_t K = -Depth; K <= Depth; K += 2) { in longestCommonSequence()
92 if (K == -Depth || (K != Depth && V[Index(K - 1)] < V[Index(K + 1)])) in longestCommonSequence()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DValueTracking.h66 bool UseInstrInfo = true, unsigned Depth = 0);
74 unsigned Depth = 0);
83 unsigned Depth = 0);
86 const SimplifyQuery &Q, unsigned Depth = 0);
89 unsigned Depth = 0);
92 const SimplifyQuery &Q, unsigned Depth = 0);
103 unsigned Depth = 0);
110 unsigned Depth = 0);
117 unsigned Depth = 0);
135 unsigned Depth = 0);
[all …]
H A DLoopNestAnalysis.h121 LoopVectorTy getLoopsAtDepth(unsigned Depth) const { in getLoopsAtDepth() argument
122 assert(Depth >= Loops.front()->getLoopDepth() && in getLoopsAtDepth()
123 Depth <= Loops.back()->getLoopDepth() && "Invalid depth"); in getLoopsAtDepth()
127 if (L->getLoopDepth() == Depth) in getLoopsAtDepth()
129 else if (L->getLoopDepth() > Depth) in getLoopsAtDepth()
H A DScalarEvolution.h249 virtual void print(raw_ostream &OS, unsigned Depth = 0) const = 0;
291 void print(raw_ostream &OS, unsigned Depth = 0) const override;
398 void print(raw_ostream &OS, unsigned Depth = 0) const override;
433 void print(raw_ostream &OS, unsigned Depth) const override;
567 unsigned Depth = 0);
570 unsigned Depth = 0);
574 unsigned Depth = 0);
576 unsigned Depth = 0);
578 unsigned Depth = 0);
580 unsigned Depth = 0);
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DGISelValueTracking.h44 const APInt &DemandedElts, unsigned Depth = 0);
47 const APInt &DemandedElts, unsigned Depth = 0);
50 FPClassTest InterestedClasses, unsigned Depth);
55 KnownFPClass &Known, unsigned Depth);
59 unsigned Depth);
71 unsigned Depth = 0);
74 unsigned Depth = 0);
75 unsigned computeNumSignBits(Register R, unsigned Depth = 0);
80 unsigned Depth = 0);
104 Align computeKnownAlignment(Register R, unsigned Depth = 0);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp136 unsigned Depth);
139 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBits() argument
146 ::computeKnownBits(V, DemandedElts, Known, Q, Depth); in computeKnownBits()
152 bool UseInstrInfo, unsigned Depth) { in computeKnownBits() argument
155 Depth); in computeKnownBits()
161 unsigned Depth) { in computeKnownBits() argument
163 V, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo), Depth); in computeKnownBits()
170 unsigned Depth) { in computeKnownBits() argument
173 SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo), Depth); in computeKnownBits()
270 unsigned Depth) { in isKnownToBeAPowerOfTwo() argument
[all …]
H A DLoopAccessAnalysis.cpp714 unsigned Depth) const { in printChecks()
719 OS.indent(Depth) << "Check " << N++ << ":\n"; in printChecks()
720 OS.indent(Depth + 2) << "Comparing group GRP" << PtrIndices.at(Check1) in printChecks()
723 OS.indent(Depth + 2) << *Pointers[K].PointerValue << "\n"; in printChecks()
724 OS.indent(Depth + 2) << "Against group GRP" << PtrIndices.at(Check2) in printChecks()
727 OS.indent(Depth + 2) << *Pointers[K].PointerValue << "\n"; in printChecks()
731 void RuntimePointerChecking::print(raw_ostream &OS, unsigned Depth) const { in print()
733 OS.indent(Depth) << "Run-time memory checks:\n"; in print()
734 printChecks(OS, Checks, Depth); in print()
736 OS.indent(Depth) << "Grouped accesses:\n"; in print()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h45 size_t Depth = 0; variable
58 size_t getDepth() const { return Depth; } in getDepth()
62 assert(llvm::has_single_bit(Depth) &&
65 return Data[(Head + idx) & (Depth-1)];
70 Depth = d;
71 Data = new InstrStage::FuncUnits[Depth];
74 memset(Data, 0, Depth * sizeof(Data[0]));
79 Head = (Head + 1) & (Depth-1); in advance()
83 Head = (Head - 1) & (Depth-1); in recede()
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplate.h134 unsigned getNumSubsitutedArgs(unsigned Depth) const { in getNumSubsitutedArgs() argument
135 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in getNumSubsitutedArgs()
136 return TemplateArgumentLists[getNumLevels() - Depth - 1].Args.size(); in getNumSubsitutedArgs()
154 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { in operator()
155 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in operator()
157 TemplateArgumentLists[getNumLevels() - Depth - 1].Args.size()); in operator()
158 return TemplateArgumentLists[getNumLevels() - Depth - 1].Args[Index]; in operator()
164 std::pair<Decl *, bool> getAssociatedDecl(unsigned Depth) const { in getAssociatedDecl() argument
165 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in getAssociatedDecl()
166 auto AD = TemplateArgumentLists[getNumLevels() - Depth - 1] in getAssociatedDecl()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp99 unsigned Depth) { in SimplifyDemandedBits() argument
103 llvm::computeKnownBits(V, Known, Q, Depth); in SimplifyDemandedBits()
116 llvm::computeKnownBits(V, Known, Q, Depth); in SimplifyDemandedBits()
120 if (Depth == MaxAnalysisRecursionDepth) in SimplifyDemandedBits()
126 NewVal = SimplifyDemandedUseBits(VInst, DemandedMask, Known, Q, Depth); in SimplifyDemandedBits()
131 SimplifyMultipleUseDemandedBits(VInst, DemandedMask, Known, Q, Depth); in SimplifyDemandedBits()
168 unsigned Depth) { in SimplifyDemandedUseBits() argument
170 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in SimplifyDemandedUseBits()
202 SimplifyDemandedBits(I, 0, DemandedFromOps, LHSKnown, Q, Depth + 1) || in SimplifyDemandedUseBits()
204 SimplifyDemandedBits(I, 1, DemandedFromOps, RHSKnown, Q, Depth + 1)) { in SimplifyDemandedUseBits()
[all …]
H A DInstCombineNegator.cpp122 [[nodiscard]] Value *Negator::visitImpl(Value *V, bool IsNSW, unsigned Depth) { in visitImpl() argument
292 if (Depth > NegatorMaxDepth) { in visitImpl()
302 Value *NegOp = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
316 negate(std::get<0>(I), IsNSW, Depth + 1))) // Early return. in visitImpl()
351 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
354 Value *NegOp2 = negate(I->getOperand(2), IsNSW, Depth + 1); in visitImpl()
364 Value *NegOp0 = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
367 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
376 Value *NegVector = negate(EEI->getVectorOperand(), IsNSW, Depth + 1); in visitImpl()
386 Value *NegVector = negate(IEI->getOperand(0), IsNSW, Depth + 1); in visitImpl()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h207 unsigned Depth);
434 const Instruction *CxtI, unsigned Depth = 0) const {
435 llvm::computeKnownBits(V, Known, SQ.getWithInstruction(CxtI), Depth);
439 unsigned Depth = 0) const {
440 return llvm::computeKnownBits(V, SQ.getWithInstruction(CxtI), Depth);
445 unsigned Depth = 0) {
447 Depth);
452 unsigned Depth = 0) const {
453 return llvm::MaskedValueIsZero(V, Mask, SQ.getWithInstruction(CxtI), Depth);
458 unsigned Depth = 0) const {
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-account.cpp136 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage); in operator ++() local
137 assert(Depth >= 0 && Depth < std::numeric_limits<decltype(Depth)>::max()); in operator ++()
138 ++Depth; in operator ++()
139 Bitfield::set<RecursionStatus::Depth>(Storage, Depth); // ++Storage in operator ++()
141 if (!isRecursive() && Depth == 2) // Storage == 2 / Storage s> 1 in operator ++()
147 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage); in operator --() local
148 assert(Depth > 0); in operator --()
149 --Depth; in operator --()
150 Bitfield::set<RecursionStatus::Depth>(Storage, Depth); // --Storage in operator --()
152 if (isRecursive() && Depth == 0) // Storage == INT_MIN in operator --()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/MCTargetDesc/
H A DAMDGPUMCExpr.cpp350 unsigned Depth = 0);
353 unsigned Depth) { in binaryOpKnownBitsMapHelper() argument
359 knownBitsMapHelper(LHS, KBM, Depth + 1); in binaryOpKnownBitsMapHelper()
360 knownBitsMapHelper(RHS, KBM, Depth + 1); in binaryOpKnownBitsMapHelper()
455 unsigned Depth) { in unaryOpKnownBitsMapHelper() argument
458 knownBitsMapHelper(UExpr->getSubExpr(), KBM, Depth + 1); in unaryOpKnownBitsMapHelper()
485 unsigned Depth) { in targetOpKnownBitsMapHelper() argument
494 knownBitsMapHelper(AGVK->getSubExpr(0), KBM, Depth + 1); in targetOpKnownBitsMapHelper()
497 knownBitsMapHelper(Arg, KBM, Depth + 1); in targetOpKnownBitsMapHelper()
504 knownBitsMapHelper(AGVK->getSubExpr(0), KBM, Depth + 1); in targetOpKnownBitsMapHelper()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp396 unsigned Depth; in checkForProfitableCmovCandidates() member
461 MIDepth = std::max(MIDepth, Info.Depth); in checkForProfitableCmovCandidates()
482 MaxDepth.Depth = std::max(MaxDepth.Depth, MIDepth); in checkForProfitableCmovCandidates()
488 unsigned Diff[LoopIterations] = {LoopDepth[0].Depth - LoopDepth[0].OptDepth, in checkForProfitableCmovCandidates()
489 LoopDepth[1].Depth - LoopDepth[1].OptDepth}; in checkForProfitableCmovCandidates()
523 WorthOptLoop = Diff[0] * 8 >= LoopDepth[0].Depth; in checkForProfitableCmovCandidates()
526 (Diff[1] - Diff[0]) * 2 >= (LoopDepth[1].Depth - LoopDepth[0].Depth) && in checkForProfitableCmovCandidates()
527 (Diff[1] * 8 >= LoopDepth[1].Depth); in checkForProfitableCmovCandidates()
564 DepthMap[OperandToDefMap.lookup(&MI->getOperand(4))].Depth; in checkForProfitableCmovCandidates()
566 DepthMap[OperandToDefMap.lookup(&MI->getOperand(1))].Depth, in checkForProfitableCmovCandidates()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp2926 bool SelectionDAG::SignBitIsZero(SDValue Op, unsigned Depth) const { in SignBitIsZero()
2928 return MaskedValueIsZero(Op, APInt::getSignMask(BitWidth), Depth); in SignBitIsZero()
2935 unsigned Depth) const { in MaskedValueIsZero()
2936 return Mask.isSubsetOf(computeKnownBits(V, Depth).Zero); in MaskedValueIsZero()
2944 unsigned Depth) const { in MaskedValueIsZero()
2945 return Mask.isSubsetOf(computeKnownBits(V, DemandedElts, Depth).Zero); in MaskedValueIsZero()
2951 unsigned Depth /* = 0 */) const { in MaskedVectorIsZero()
2952 return computeKnownBits(V, DemandedElts, Depth).isZero(); in MaskedVectorIsZero()
2957 unsigned Depth) const { in MaskedValueIsAllOnes()
2958 return Mask.isSubsetOf(computeKnownBits(V, Depth).One); in MaskedValueIsAllOnes()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/GISel/
H A DPPCRegisterBankInfo.cpp235 unsigned Depth) const { in hasFPConstraints()
264 if (!MI.isPHI() || Depth > MaxFPRSearchDepth) in hasFPConstraints()
269 onlyDefinesFP(*MRI.getVRegDef(Op.getReg()), MRI, TRI, Depth + 1); in hasFPConstraints()
278 unsigned Depth) const { in onlyUsesFP()
289 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyUsesFP()
297 unsigned Depth) const { in onlyDefinesFP()
305 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyDefinesFP()
H A DPPCRegisterBankInfo.h84 unsigned Depth = 0) const;
88 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
92 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DInstrMaps.h33 unsigned Depth; member
37 unsigned Depth) in Action()
38 : LegalityRes(LR), Bndl(B), UserBndl(UB), Depth(Depth) {} in Action()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64RegisterBankInfo.h128 unsigned Depth = 0) const;
132 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
136 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
140 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/GISel/
H A DX86RegisterBankInfo.h71 unsigned Depth = 0) const;
75 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
79 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/
H A DWebAssemblyInstPrinter.cpp114 uint64_t Depth = Op.getImm(); in printInst() local
115 if (!Printed.insert(Depth).second) in printInst()
117 if (Depth >= ControlFlowStack.size()) { in printInst()
120 const auto &Pair = ControlFlowStack.rbegin()[Depth]; in printInst()
121 printAnnotation(OS, utostr(Depth) + ": " + (Pair.second ? "up" : "down") + in printInst()
253 uint64_t Depth = MI->getOperand(0).getImm(); in printInst() local
254 if (Depth >= ControlFlowStack.size()) { in printInst()
257 const auto &Pair = ControlFlowStack.rbegin()[Depth]; in printInst()
/freebsd/contrib/llvm-project/clang/utils/TableGen/
H A DClangOptionDocEmitter.cpp220 void emitHeading(int Depth, std::string Heading, raw_ostream &OS) { in emitHeading() argument
221 assert(Depth < 8 && "groups nested too deeply"); in emitHeading()
223 << std::string(Heading.size(), "=~-_'+<>"[Depth]) << "\n"; in emitHeading()
418 void emitDocumentation(int Depth, const Documentation &Doc,
421 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, in emitGroup() argument
423 emitHeading(Depth, in emitGroup()
433 emitDocumentation(Depth + 1, Group, DocInfo, OS); in emitGroup()
436 void emitDocumentation(int Depth, const Documentation &Doc, in emitDocumentation() argument
441 emitGroup(Depth, G, DocInfo, OS); in emitDocumentation()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSignals.cpp126 static bool findModulesAndOffsets(void **StackTrace, int Depth,
260 int Depth, llvm::raw_ostream &OS) { in printSymbolizedStackTrace() argument
284 StackTrace, Depth, MainExecutableName.c_str(), LLVMSymbolizerPath); in printSymbolizedStackTrace()
289 OS << right_justify(formatv("#{0}", FrameNo).str(), std::log10(Depth) + 2) in printSymbolizedStackTrace()
335 static bool printMarkupStackTrace(StringRef Argv0, void **StackTrace, int Depth, in printMarkupStackTrace() argument
346 for (int I = 0; I < Depth; I++) in printMarkupStackTrace()

12345678910