Home
last modified time | relevance | path

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

123456789

/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
H A DGISelKnownBits.cpp34 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() argument
38 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth); in computeKnownAlignment()
46 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1); in computeKnownAlignment()
64 unsigned Depth) { in getKnownBits() argument
87 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() argument
88 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult()
89 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult()
91 << "[" << Depth << "] Zero: 0x" << Known.Zero.toString(16, false) in dumpResult()
93 << "[" << Depth << "] One: 0x" << Known.One.toString(16, false) in dumpResult()
101 unsigned Depth) { in computeKnownBitsMin() argument
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DValueTracking.cpp195 KnownBits &Known, unsigned Depth, const Query &Q);
197 static void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
209 computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits()
213 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument
217 ::computeKnownBits(V, Known, Depth, in computeKnownBits()
223 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument
226 ::computeKnownBits(V, DemandedElts, Known, Depth, in computeKnownBits()
231 unsigned Depth, const Query &Q);
233 static KnownBits computeKnownBits(const Value *V, unsigned Depth,
237 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument
[all …]
H A DLoopAccessAnalysis.cpp460 unsigned Depth) const { in printChecks()
465 OS.indent(Depth) << "Check " << N++ << ":\n"; in printChecks()
467 OS.indent(Depth + 2) << "Comparing group (" << Check.first << "):\n"; in printChecks()
469 OS.indent(Depth + 2) << *Pointers[First[K]].PointerValue << "\n"; in printChecks()
471 OS.indent(Depth + 2) << "Against group (" << Check.second << "):\n"; in printChecks()
473 OS.indent(Depth + 2) << *Pointers[Second[K]].PointerValue << "\n"; in printChecks()
477 void RuntimePointerChecking::print(raw_ostream &OS, unsigned Depth) const { in print()
479 OS.indent(Depth) << "Run-time memory checks:\n"; in print()
480 printChecks(OS, Checks, Depth); in print()
482 OS.indent(Depth) << "Grouped accesses:\n"; in print()
[all …]
H A DScalarEvolution.cpp614 unsigned Depth) { in CompareValueComplexity() argument
615 if (Depth > MaxValueCompareDepth || EqCacheValue.isEquivalent(LV, RV)) in CompareValueComplexity()
676 RInst->getOperand(Idx), Depth + 1); in CompareValueComplexity()
695 const SCEV *RHS, DominatorTree &DT, unsigned Depth = 0) { in CompareSCEVComplexity() argument
708 if (Depth > MaxSCEVCompareDepth) in CompareSCEVComplexity()
720 RU->getValue(), Depth + 1); in CompareSCEVComplexity()
767 Depth + 1); in CompareSCEVComplexity()
792 Depth + 1); in CompareSCEVComplexity()
806 RC->getLHS(), DT, Depth + 1); in CompareSCEVComplexity()
810 RC->getRHS(), DT, Depth + 1); in CompareSCEVComplexity()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h45 size_t Depth = 0; variable
57 size_t getDepth() const { return Depth; } in getDepth()
61 assert(Depth && !(Depth & (Depth - 1)) &&
64 return Data[(Head + idx) & (Depth-1)];
69 Depth = d;
70 Data = new InstrStage::FuncUnits[Depth];
73 memset(Data, 0, Depth * sizeof(Data[0]));
78 Head = (Head + 1) & (Depth-1); in advance()
82 Head = (Head - 1) & (Depth-1); in recede()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp73 KnownBits &Known, unsigned Depth) { in SimplifyDemandedBits() argument
76 Depth, I); in SimplifyDemandedBits()
110 unsigned Depth, in SimplifyDemandedUseBits() argument
113 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in SimplifyDemandedUseBits()
122 computeKnownBits(V, Known, Depth, CxtI); in SimplifyDemandedUseBits()
130 if (Depth == MaxAnalysisRecursionDepth) in SimplifyDemandedUseBits()
138 computeKnownBits(V, Known, Depth, CxtI); in SimplifyDemandedUseBits()
145 if (Depth != 0 && !I->hasOneUse()) in SimplifyDemandedUseBits()
146 return SimplifyMultipleUseDemandedBits(I, DemandedMask, Known, Depth, CxtI); in SimplifyDemandedUseBits()
154 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits()
[all …]
H A DInstCombineNegator.cpp133 LLVM_NODISCARD Value *Negator::visitImpl(Value *V, unsigned Depth) { in visitImpl() argument
256 if (Depth > NegatorMaxDepth) { in visitImpl()
266 Value *NegOp = negate(I->getOperand(0), Depth + 1); in visitImpl()
277 negate(std::get<0>(I), Depth + 1))) // Early return. in visitImpl()
300 Value *NegOp1 = negate(I->getOperand(1), Depth + 1); in visitImpl()
303 Value *NegOp2 = negate(I->getOperand(2), Depth + 1); in visitImpl()
313 Value *NegOp0 = negate(I->getOperand(0), Depth + 1); in visitImpl()
316 Value *NegOp1 = negate(I->getOperand(1), Depth + 1); in visitImpl()
325 Value *NegVector = negate(EEI->getVectorOperand(), Depth + 1); in visitImpl()
335 Value *NegVector = negate(IEI->getOperand(0), Depth + 1); in visitImpl()
[all …]
H A DInstCombineInternal.h470 unsigned Depth, const Instruction *CxtI) const { in computeKnownBits() argument
471 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT); in computeKnownBits()
474 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument
476 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT); in computeKnownBits()
480 unsigned Depth = 0,
482 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
485 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0,
487 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT);
490 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0,
492 return llvm::ComputeNumSignBits(Op, DL, Depth, &AC, CxtI, &DT);
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DValueTracking.h59 const DataLayout &DL, unsigned Depth = 0,
76 unsigned Depth = 0, AssumptionCache *AC = nullptr,
84 unsigned Depth = 0, AssumptionCache *AC = nullptr,
92 const DataLayout &DL, unsigned Depth = 0,
119 bool OrZero = false, unsigned Depth = 0,
133 bool isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth = 0,
147 unsigned Depth = 0,
155 bool isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth = 0,
163 bool isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth = 0,
188 unsigned Depth = 0, AssumptionCache *AC = nullptr,
[all …]
H A DScalarEvolution.h234 virtual void print(raw_ostream &OS, unsigned Depth = 0) const = 0;
278 void print(raw_ostream &OS, unsigned Depth = 0) const override;
384 void print(raw_ostream &OS, unsigned Depth = 0) const override;
427 void print(raw_ostream &OS, unsigned Depth) const override;
515 const SCEV *getLosslessPtrToIntExpr(const SCEV *Op, unsigned Depth = 0);
517 const SCEV *getTruncateExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
518 const SCEV *getZeroExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
519 const SCEV *getSignExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
523 unsigned Depth = 0);
526 unsigned Depth = 0) {
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Sema/
H A DTemplate.h139 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { in operator()
140 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in operator()
141 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size()); in operator()
142 return TemplateArgumentLists[getNumLevels() - Depth - 1][Index]; in operator()
149 bool hasTemplateArgument(unsigned Depth, unsigned Index) const { in hasTemplateArgument() argument
150 assert(Depth < getNumLevels()); in hasTemplateArgument()
152 if (Depth < NumRetainedOuterLevels) in hasTemplateArgument()
155 if (Index >= TemplateArgumentLists[getNumLevels() - Depth - 1].size()) in hasTemplateArgument()
158 return !(*this)(Depth, Index).isNull(); in hasTemplateArgument()
162 void setArgument(unsigned Depth, unsigned Index, in setArgument() argument
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
H A DGISelKnownBits.h40 unsigned Depth = 0);
43 const APInt &DemandedElts, unsigned Depth = 0);
59 unsigned Depth = 0);
62 unsigned Depth = 0);
63 unsigned computeNumSignBits(Register R, unsigned Depth = 0);
68 unsigned Depth = 0);
93 Align computeKnownAlignment(Register R, unsigned Depth = 0);
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DSignals.cpp99 static bool findModulesAndOffsets(void **StackTrace, int Depth,
115 int Depth, llvm::raw_ostream &OS) { in printSymbolizedStackTrace() argument
148 std::vector<const char *> Modules(Depth, nullptr); in printSymbolizedStackTrace()
149 std::vector<intptr_t> Offsets(Depth, 0); in printSymbolizedStackTrace()
150 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(), in printSymbolizedStackTrace()
162 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace()
193 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace()
196 std::log10(Depth) + 2) in printSymbolizedStackTrace()
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
H A Dxray-account.cpp134 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage); in operator ++() local
135 assert(Depth >= 0 && Depth < std::numeric_limits<decltype(Depth)>::max()); in operator ++()
136 ++Depth; in operator ++()
137 Bitfield::set<RecursionStatus::Depth>(Storage, Depth); // ++Storage in operator ++()
139 if (!isRecursive() && Depth == 2) // Storage == 2 / Storage s> 1 in operator ++()
145 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage); in operator --() local
146 assert(Depth > 0); in operator --()
147 --Depth; in operator --()
148 Bitfield::set<RecursionStatus::Depth>(Storage, Depth); // --Storage in operator --()
150 if (isRecursive() && Depth == 0) // Storage == INT_MIN in operator --()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h456 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
458 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT); in computeKnownBits()
461 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument
463 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT); in computeKnownBits()
467 unsigned Depth = 0,
469 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
472 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0,
474 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT);
477 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0,
479 return llvm::ComputeNumSignBits(Op, DL, Depth, &AC, CxtI, &DT);
[all …]
/netbsd-src/external/mit/expat/dist/examples/
H A Doutline.c58 int Depth; variable
65 for (i = 0; i < Depth; i++) in start()
75 Depth++; in start()
83 Depth--; in end()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp380 unsigned Depth; in checkForProfitableCmovCandidates() member
446 MIDepth = std::max(MIDepth, Info.Depth); in checkForProfitableCmovCandidates()
467 MaxDepth.Depth = std::max(MaxDepth.Depth, MIDepth); in checkForProfitableCmovCandidates()
473 unsigned Diff[LoopIterations] = {LoopDepth[0].Depth - LoopDepth[0].OptDepth, in checkForProfitableCmovCandidates()
474 LoopDepth[1].Depth - LoopDepth[1].OptDepth}; in checkForProfitableCmovCandidates()
508 WorthOptLoop = Diff[0] * 8 >= LoopDepth[0].Depth; in checkForProfitableCmovCandidates()
511 (Diff[1] - Diff[0]) * 2 >= (LoopDepth[1].Depth - LoopDepth[0].Depth) && in checkForProfitableCmovCandidates()
512 (Diff[1] * 8 >= LoopDepth[1].Depth); in checkForProfitableCmovCandidates()
549 DepthMap[OperandToDefMap.lookup(&MI->getOperand(4))].Depth; in checkForProfitableCmovCandidates()
551 DepthMap[OperandToDefMap.lookup(&MI->getOperand(1))].Depth, in checkForProfitableCmovCandidates()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
H A DDWARFUnit.cpp364 uint32_t Depth = 0; in extractDIEsToVector() local
368 Depth)) { in extractDIEsToVector()
387 ++Depth; in extractDIEsToVector()
390 if (Depth > 0) in extractDIEsToVector()
391 --Depth; in extractDIEsToVector()
392 if (Depth == 0) in extractDIEsToVector()
714 const uint32_t Depth = Die->getDepth(); in getParent() local
716 if (Depth == 0) in getParent()
719 if (Depth == 1) in getParent()
722 const uint32_t ParentDepth = Depth - 1; in getParent()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/MCTargetDesc/
H A DWebAssemblyInstPrinter.cpp220 uint64_t Depth = MI->getOperand(0).getImm(); in printInst() local
221 if (Depth >= ControlFlowStack.size()) { in printInst()
224 const auto &Pair = ControlFlowStack.rbegin()[Depth]; in printInst()
253 uint64_t Depth = MI->getOperand(I).getImm(); in printInst() local
254 if (!Printed.insert(Depth).second) in printInst()
256 if (Depth >= ControlFlowStack.size()) { in printInst()
259 const auto &Pair = ControlFlowStack.rbegin()[Depth]; in printInst()
260 printAnnotation(OS, utostr(Depth) + ": " + in printInst()
/netbsd-src/external/apache2/llvm/dist/clang/utils/TableGen/
H A DClangOptionDocEmitter.cpp205 void emitHeading(int Depth, std::string Heading, raw_ostream &OS) { in emitHeading() argument
206 assert(Depth < 8 && "groups nested too deeply"); in emitHeading()
208 << std::string(Heading.size(), "=~-_'+<>"[Depth]) << "\n"; in emitHeading()
350 void emitDocumentation(int Depth, const Documentation &Doc,
353 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, in emitGroup() argument
358 emitHeading(Depth, in emitGroup()
368 emitDocumentation(Depth + 1, Group, DocInfo, OS); in emitGroup()
371 void emitDocumentation(int Depth, const Documentation &Doc, in emitDocumentation() argument
376 emitGroup(Depth, G, DocInfo, OS); in emitDocumentation()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugInfoEntry.h29 uint32_t Depth = 0; variable
44 uint32_t Depth);
47 uint32_t getDepth() const { return Depth; } in getDepth()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/
H A DSemaTemplateDeduction.cpp164 bool OnlyDeduced, unsigned Depth,
175 getDeducedParameterFromExpr(const Expr *E, unsigned Depth) { in getDeducedParameterFromExpr() argument
198 if (NTTP->getDepth() == Depth) in getDeducedParameterFromExpr()
755 unsigned Depth, Index; in addPacks() local
756 std::tie(Depth, Index) = getDepthAndIndex(Unexpanded[I]); in addPacks()
757 if (Depth == Info.getDeducedDepth()) in addPacks()
4764 unsigned Depth = DependentDeductionDepth.getValueOr(0); in DeduceAutoType() local
4811 Context, nullptr, SourceLocation(), Loc, Depth, 0, nullptr, false, false, in DeduceAutoType()
4828 TemplateDeductionInfo Info(Loc, Depth); in DeduceAutoType()
5700 unsigned Depth; member
[all …]
H A DScope.cpp34 Depth = parent->Depth + 1; in setFlags()
47 Depth = 0; in setFlags()
190 OS << "Depth: " << Depth << '\n'; in dumpImpl()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp2423 bool SelectionDAG::SignBitIsZero(SDValue Op, unsigned Depth) const { in SignBitIsZero()
2425 return MaskedValueIsZero(Op, APInt::getSignMask(BitWidth), Depth); in SignBitIsZero()
2432 unsigned Depth) const { in MaskedValueIsZero()
2433 return Mask.isSubsetOf(computeKnownBits(V, Depth).Zero); in MaskedValueIsZero()
2441 unsigned Depth) const { in MaskedValueIsZero()
2442 return Mask.isSubsetOf(computeKnownBits(V, DemandedElts, Depth).Zero); in MaskedValueIsZero()
2448 unsigned Depth) const { in MaskedElementsAreZero()
2451 return MaskedValueIsZero(Op, DemandedBits, DemandedElts, Depth); in MaskedElementsAreZero()
2456 unsigned Depth) const { in MaskedValueIsAllOnes()
2457 return Mask.isSubsetOf(computeKnownBits(V, Depth).One); in MaskedValueIsAllOnes()
[all …]
H A DTargetLowering.cpp619 unsigned Depth, in SimplifyDemandedBits() argument
635 return SimplifyDemandedBits(Op, DemandedBits, DemandedElts, Known, TLO, Depth, in SimplifyDemandedBits()
643 SelectionDAG &DAG, unsigned Depth) const { in SimplifyMultipleUseDemandedBits()
645 if (Depth >= SelectionDAG::MaxRecursionDepth) in SimplifyMultipleUseDemandedBits()
671 Src, DemandedBits, DemandedElts, DAG, Depth + 1)) in SimplifyMultipleUseDemandedBits()
693 Src, DemandedSrcBits, DemandedSrcElts, DAG, Depth + 1)) in SimplifyMultipleUseDemandedBits()
712 Src, DemandedSrcBits, DemandedSrcElts, DAG, Depth + 1)) in SimplifyMultipleUseDemandedBits()
719 LHSKnown = DAG.computeKnownBits(Op.getOperand(0), DemandedElts, Depth + 1); in SimplifyMultipleUseDemandedBits()
720 RHSKnown = DAG.computeKnownBits(Op.getOperand(1), DemandedElts, Depth + 1); in SimplifyMultipleUseDemandedBits()
732 LHSKnown = DAG.computeKnownBits(Op.getOperand(0), DemandedElts, Depth + 1); in SimplifyMultipleUseDemandedBits()
[all …]

123456789