Home
last modified time | relevance | path

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

123456789

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DGISelKnownBits.cpp97 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult()
174 if (Depth >= getMaxDepth()) in computeKnownBitsImpl()
269 Depth + 1); in computeKnownBitsImpl()
271 Depth + 1); in computeKnownBitsImpl()
278 Depth + 1); in computeKnownBitsImpl()
280 Depth + 1); in computeKnownBitsImpl()
296 Depth + 1); in computeKnownBitsImpl()
298 Depth + 1); in computeKnownBitsImpl()
306 Depth + 1); in computeKnownBitsImpl()
308 Depth + 1); in computeKnownBitsImpl()
[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(Depth && !(Depth & (Depth - 1)) &&
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/llvm/lib/Analysis/
H A DValueTracking.cpp169 V, Known, Depth, in computeKnownBits()
186 V, DemandedElts, Depth, in computeKnownBits()
269 V, OrZero, Depth, in isKnownToBeAPowerOfTwo()
298 return isKnownNonNegative(V, SQ, Depth) && ::isKnownNonZero(V, Depth, SQ); in isKnownPositive()
3145 if (isAddOfNonZero(V1, V2, Depth, Q) || isAddOfNonZero(V2, V1, Depth, Q)) in isKnownNonEqual()
3148 if (isNonEqualMul(V1, V2, Depth, Q) || isNonEqualMul(V2, V1, Depth, Q)) in isKnownNonEqual()
3151 if (isNonEqualShl(V1, V2, Depth, Q) || isNonEqualShl(V2, V1, Depth, Q)) in isKnownNonEqual()
3166 if (isNonEqualSelect(V1, V2, Depth, Q) || isNonEqualSelect(V2, V1, Depth, Q)) in isKnownNonEqual()
5275 if (Depth < PhiRecursionLimit) { in computeKnownFPClass()
6742 if (Depth >= MaxDepth) in directlyImpliesPoison()
[all …]
H A DLoopAccessAnalysis.cpp610 unsigned Depth) const { in printChecks()
630 printChecks(OS, Checks, Depth); in print()
632 OS.indent(Depth) << "Grouped accesses:\n"; in print()
892 unsigned Depth) { in findForkedSCEVs() argument
899 !isa<Instruction>(Ptr) || Depth == 0) { in findForkedSCEVs()
904 Depth--; in findForkedSCEVs()
2271 raw_ostream &OS, unsigned Depth, in print() argument
2976 OS.indent(Depth) << "Dependences:\n"; in print()
2985 PtrRtChecking->print(OS, Depth); in print()
2993 PSE->getPredicate().print(OS, Depth); in print()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplate.h135 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in getNumSubsitutedArgs()
155 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in operator()
165 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in getAssociatedDecl()
176 assert(Depth < getNumLevels()); in hasTemplateArgument()
178 if (Depth < NumRetainedOuterLevels) in hasTemplateArgument()
185 return !(*this)(Depth, Index).isNull(); in hasTemplateArgument()
197 void setArgument(unsigned Depth, unsigned Index, in setArgument() argument
199 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in setArgument()
286 for (unsigned Depth = NumRetainedOuterLevels; Depth < getNumLevels(); in dump() local
287 ++Depth) { in dump()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DValueTracking.h81 KnownBits computeKnownBits(const Value *V, unsigned Depth,
141 unsigned Depth = 0);
146 unsigned Depth = 0);
151 unsigned Depth = 0);
190 unsigned Depth = 0,
485 unsigned Depth = 0,
521 unsigned Depth = 0,
534 unsigned Depth = 0, AssumptionCache *AC = nullptr,
869 unsigned Depth = 0);
999 unsigned Depth = 0);
[all …]
H A DLoopNestAnalysis.h120 LoopVectorTy getLoopsAtDepth(unsigned Depth) const { in getLoopsAtDepth() argument
121 assert(Depth >= Loops.front()->getLoopDepth() && in getLoopsAtDepth()
122 Depth <= Loops.back()->getLoopDepth() && "Invalid depth"); in getLoopsAtDepth()
126 if (L->getLoopDepth() == Depth) in getLoopsAtDepth()
128 else if (L->getLoopDepth() > Depth) in getLoopsAtDepth()
H A DScalarEvolution.h583 unsigned Depth = 0);
586 unsigned Depth = 0) {
588 return getAddExpr(Ops, Flags, Depth);
592 unsigned Depth = 0) {
594 return getAddExpr(Ops, Flags, Depth);
598 unsigned Depth = 0);
601 unsigned Depth = 0) {
603 return getMulExpr(Ops, Flags, Depth);
607 unsigned Depth = 0) {
609 return getMulExpr(Ops, Flags, Depth);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp140 computeKnownBits(V, Known, Depth, CxtI); in SimplifyDemandedUseBits()
148 if (Depth == MaxAnalysisRecursionDepth) in SimplifyDemandedUseBits()
153 computeKnownBits(V, Known, Depth, CxtI); in SimplifyDemandedUseBits()
160 if (Depth != 0 && !I->hasOneUse()) in SimplifyDemandedUseBits()
168 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits()
204 computeKnownBits(I, Known, Depth, CxtI); in SimplifyDemandedUseBits()
210 Depth + 1)) in SimplifyDemandedUseBits()
240 Depth + 1)) { in SimplifyDemandedUseBits()
940 RHSKnown, Depth + 1)) in SimplifyDemandedUseBits()
1394 if (Depth == 10) in SimplifyDemandedVectorElts()
[all …]
H A DInstCombineNegator.cpp291 if (Depth > NegatorMaxDepth) { in visitImpl()
301 Value *NegOp = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
335 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
338 Value *NegOp2 = negate(I->getOperand(2), IsNSW, Depth + 1); in visitImpl()
348 Value *NegOp0 = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
351 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
370 Value *NegVector = negate(IEI->getOperand(0), IsNSW, Depth + 1); in visitImpl()
373 Value *NegNewElt = negate(IEI->getOperand(1), IsNSW, Depth + 1); in visitImpl()
389 if (Value *NegOp0 = negate(I->getOperand(0), IsNSW, Depth + 1)) in visitImpl()
480 NegatorMaxDepthVisited.updateMax(Depth); in negate()
[all …]
/freebsd/contrib/llvm-project/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);
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSignals.cpp127 static bool findModulesAndOffsets(void **StackTrace, int Depth,
143 int Depth, llvm::raw_ostream &OS) { in printSymbolizedStackTrace() argument
176 std::vector<const char *> Modules(Depth, nullptr); in printSymbolizedStackTrace()
177 std::vector<intptr_t> Offsets(Depth, 0); in printSymbolizedStackTrace()
178 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(), in printSymbolizedStackTrace()
190 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace()
221 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace()
224 std::log10(Depth) + 2) in printSymbolizedStackTrace()
259 static bool printMarkupStackTrace(StringRef Argv0, void **StackTrace, int Depth, in printMarkupStackTrace() argument
270 for (int I = 0; I < Depth; I++) in printMarkupStackTrace()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h249 unsigned Depth);
469 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
471 llvm::computeKnownBits(V, Known, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
474 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument
476 return llvm::computeKnownBits(V, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
480 unsigned Depth = 0,
490 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0,
492 return llvm::ComputeNumSignBits(Op, DL, Depth, &AC, CxtI, &DT);
495 unsigned ComputeMaxSignificantBits(const Value *Op, unsigned Depth = 0,
544 unsigned Depth = 0) = 0;
[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/X86/
H A DX86CmovConversion.cpp399 unsigned Depth; in checkForProfitableCmovCandidates() member
464 MIDepth = std::max(MIDepth, Info.Depth); in checkForProfitableCmovCandidates()
485 MaxDepth.Depth = std::max(MaxDepth.Depth, MIDepth); in checkForProfitableCmovCandidates()
491 unsigned Diff[LoopIterations] = {LoopDepth[0].Depth - LoopDepth[0].OptDepth, in checkForProfitableCmovCandidates()
492 LoopDepth[1].Depth - LoopDepth[1].OptDepth}; in checkForProfitableCmovCandidates()
526 WorthOptLoop = Diff[0] * 8 >= LoopDepth[0].Depth; in checkForProfitableCmovCandidates()
529 (Diff[1] - Diff[0]) * 2 >= (LoopDepth[1].Depth - LoopDepth[0].Depth) && in checkForProfitableCmovCandidates()
530 (Diff[1] * 8 >= LoopDepth[1].Depth); in checkForProfitableCmovCandidates()
567 DepthMap[OperandToDefMap.lookup(&MI->getOperand(4))].Depth; in checkForProfitableCmovCandidates()
569 DepthMap[OperandToDefMap.lookup(&MI->getOperand(1))].Depth, in checkForProfitableCmovCandidates()
[all …]
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h39 if (Depth > C->Depth) in contains()
41 while (Depth < C->Depth) in contains()
309 Cycle->Depth = Cycle->ParentCycle ? Cycle->ParentCycle->Depth + 1 : 1; in updateDepth()
492 check(Child->Depth > Cycle->Depth); in validateTree()
494 ChildDepth = Child->Depth; in validateTree()
496 check(ChildDepth == Child->Depth); in validateTree()
521 for (unsigned I = 0; I < Cycle->Depth; ++I) in print()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/GISel/
H A DPPCRegisterBankInfo.h83 unsigned Depth = 0) const;
87 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
91 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
H A DPPCRegisterBankInfo.cpp291 unsigned Depth) const { in hasFPConstraints()
320 if (!MI.isPHI() || Depth > MaxFPRSearchDepth) in hasFPConstraints()
325 onlyDefinesFP(*MRI.getVRegDef(Op.getReg()), MRI, TRI, Depth + 1); in hasFPConstraints()
334 unsigned Depth) const { in onlyUsesFP()
345 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyUsesFP()
353 unsigned Depth) const { in onlyDefinesFP()
361 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyDefinesFP()
/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()
388 void emitDocumentation(int Depth, const Documentation &Doc,
391 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, in emitGroup() argument
393 emitHeading(Depth, in emitGroup()
403 emitDocumentation(Depth + 1, Group, DocInfo, OS); in emitGroup()
406 void emitDocumentation(int Depth, const Documentation &Doc, in emitDocumentation() argument
411 emitGroup(Depth, G, DocInfo, OS); in emitDocumentation()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp2713 if (Depth >= MaxRecursionDepth) in isSplatValue()
3079 if (Depth >= MaxRecursionDepth) in computeKnownBits()
3095 Depth + 1); in computeKnownBits()
3285 Depth + 1); in computeKnownBits()
4171 if (Depth >= MaxRecursionDepth) in isKnownToBeAPowerOfTwo()
4286 if (Depth >= MaxRecursionDepth) in ComputeNumSignBits()
4939 if (Depth >= MaxRecursionDepth) in isGuaranteedNotToBeUndefOrPoison()
5002 Depth); in canCreateUndefOrPoison()
5109 if (Depth >= MaxRecursionDepth) in isKnownNeverNaN()
5235 if (Depth >= MaxRecursionDepth) in isKnownNeverZero()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCAPElim.cpp45 bool MayAutorelease(const CallBase &CB, unsigned Depth = 0) { in MayAutorelease() argument
54 if (Depth < 3 && !JCB->onlyReadsMemory() && in MayAutorelease()
55 MayAutorelease(*JCB, Depth + 1)) in MayAutorelease()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DScope.cpp34 Depth = parent->Depth + 1; in setFlags()
50 Depth = 0; in setFlags()
247 OS << "Depth: " << Depth << '\n'; in dumpImpl()
H A DSemaTemplateDeduction.cpp186 if (NTTP->getDepth() == Depth) in getDeducedParameterFromExpr()
777 unsigned Depth, Index; in addPacks() local
6071 unsigned Depth; member
6075 : Used(Used), Depth(Depth) { } in MarkUsedTemplateParameterVisitor()
6078 if (T->getDepth() == Depth) in VisitTemplateTypeParmType()
6086 if (TTP->getDepth() == Depth) in TraverseTemplateName()
6095 if (NTTP->getDepth() == Depth) in VisitDeclRefExpr()
6124 if (NTTP->getDepth() == Depth) in MarkUsedTemplateParameters()
6161 if (TTP->getDepth() == Depth) in MarkUsedTemplateParameters()
6195 Depth, in MarkUsedTemplateParameters()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64RegisterBankInfo.h125 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
129 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
133 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;

123456789