| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | GISelKnownBits.cpp | 89 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult() 166 if (Depth >= getMaxDepth()) in computeKnownBitsImpl() 261 Depth + 1); in computeKnownBitsImpl() 263 Depth + 1); in computeKnownBitsImpl() 270 Depth + 1); in computeKnownBitsImpl() 272 Depth + 1); in computeKnownBitsImpl() 288 Depth + 1); in computeKnownBitsImpl() 290 Depth + 1); in computeKnownBitsImpl() 298 Depth + 1); in computeKnownBitsImpl() 300 Depth + 1); in computeKnownBitsImpl() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScoreboardHazardRecognizer.h | 45 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()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ValueTracking.cpp | 218 ::computeKnownBits(V, Known, Depth, in computeKnownBits() 254 V, DemandedElts, Depth, in computeKnownBits() 313 return ::isKnownNonZero(V, Depth, in isKnownNonZero() 1222 Depth + 1, Q); in computeKnownBitsFromOperator() 1821 computeKnownBits(V, Known, Depth, Q); in computeKnownBits() 2776 if (isAddOfNonZero(V1, V2, Depth, Q) || isAddOfNonZero(V2, V1, Depth, Q)) in isKnownNonEqual() 2779 if (isNonEqualMul(V1, V2, Depth, Q) || isNonEqualMul(V2, V1, Depth, Q)) in isKnownNonEqual() 2782 if (isNonEqualShl(V1, V2, Depth, Q) || isNonEqualShl(V2, V1, Depth, Q)) in isKnownNonEqual() 5052 if (Depth >= MaxDepth) in directlyImpliesPoison() 5086 if (Depth >= MaxDepth) in impliesPoison() [all …]
|
| H A D | LoopAccessAnalysis.cpp | 472 unsigned Depth) const { in printChecks() 477 OS.indent(Depth) << "Check " << N++ << ":\n"; in printChecks() 492 printChecks(OS, Checks, Depth); in print() 494 OS.indent(Depth) << "Grouped accesses:\n"; in print() 1759 raw_ostream &OS, unsigned Depth, in print() argument 1761 OS.indent(Depth) << DepName[Type] << ":\n"; in print() 2222 OS.indent(Depth) << "Dependences:\n"; in print() 2231 PtrRtChecking->print(OS, Depth); in print() 2238 OS.indent(Depth) << "SCEV assumptions:\n"; in print() 2239 PSE->getUnionPredicate().print(OS, Depth); in print() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineSimplifyDemanded.cpp | 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() 154 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits() 159 computeKnownBits(I, Known, Depth, CxtI); in SimplifyDemandedUseBits() 165 Depth + 1)) in SimplifyDemandedUseBits() 194 Depth + 1)) in SimplifyDemandedUseBits() 948 computeKnownBits(I, Known, Depth, CxtI); in SimplifyMultipleUseDemandedBits() 1137 if (Depth == 10) in SimplifyDemandedVectorElts() [all …]
|
| H A D | InstCombineNegator.cpp | 256 if (Depth > NegatorMaxDepth) { in visitImpl() 266 Value *NegOp = negate(I->getOperand(0), Depth + 1); 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() 346 Value *NegOp = negate(I->getOperand(0), Depth + 1); in visitImpl() 381 if (Value *NegOp = negate(Op, Depth + 1)) { in visitImpl() 422 if (Value *NegOp1 = negate(Ops[1], Depth + 1)) { in visitImpl() 441 NegatorMaxDepthVisited.updateMax(Depth); in negate() [all …]
|
| H A D | InstCombineInternal.h | 464 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT); in computeKnownBits() 467 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument 469 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT); in computeKnownBits() 473 unsigned Depth = 0, 483 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0, 485 return llvm::ComputeNumSignBits(Op, DL, Depth, &AC, CxtI, &DT); 569 unsigned Depth, Instruction *CxtI); 572 unsigned Depth = 0) override; 594 unsigned Depth = 0, 765 LLVM_NODISCARD Value *visitImpl(Value *V, unsigned Depth); [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ValueTracking.h | 59 const DataLayout &DL, unsigned Depth = 0, 147 unsigned Depth = 0, 213 unsigned Depth = 0); 223 unsigned Depth = 0); 239 unsigned Depth = 0); 245 unsigned Depth = 0); 552 unsigned Depth = 0); 650 unsigned Depth = 0); 654 unsigned Depth = 0); 802 unsigned Depth = 0); [all …]
|
| H A D | ScalarEvolution.h | 534 unsigned Depth = 0); 537 unsigned Depth = 0) { 539 return getAddExpr(Ops, Flags, Depth); 543 unsigned Depth = 0) { 545 return getAddExpr(Ops, Flags, Depth); 549 unsigned Depth = 0); 552 unsigned Depth = 0) { 554 return getMulExpr(Ops, Flags, Depth); 558 unsigned Depth = 0) { 560 return getMulExpr(Ops, Flags, Depth); [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | GISelKnownBits.h | 40 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-13.1/contrib/llvm-project/clang/include/clang/Sema/ |
| H A D | Template.h | 139 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { in operator() 140 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); 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 164 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in setArgument() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Support/ |
| H A D | Signals.cpp | 120 static bool findModulesAndOffsets(void **StackTrace, int Depth, 136 int Depth, llvm::raw_ostream &OS) { in printSymbolizedStackTrace() argument 169 std::vector<const char *> Modules(Depth, nullptr); in printSymbolizedStackTrace() 170 std::vector<intptr_t> Offsets(Depth, 0); in printSymbolizedStackTrace() 171 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(), in printSymbolizedStackTrace() 183 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace() 214 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace() 217 std::log10(Depth) + 2) in printSymbolizedStackTrace()
|
| /freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-account.cpp | 134 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 --()
|
| /freebsd-13.1/contrib/expat/examples/ |
| H A D | outline.c | 58 int Depth; variable 65 for (i = 0; i < Depth; i++) in start() 75 Depth++; in start() 83 Depth--; in end()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombiner.h | 456 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); 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); 517 unsigned Depth = 0) = 0; [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFDebugInfoEntry.h | 29 uint32_t Depth = 0; variable 44 uint32_t Depth); 47 uint32_t getDepth() const { return Depth; } in getDepth()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86CmovConversion.cpp | 381 unsigned Depth; in checkForProfitableCmovCandidates() member 447 MIDepth = std::max(MIDepth, Info.Depth); in checkForProfitableCmovCandidates() 468 MaxDepth.Depth = std::max(MaxDepth.Depth, MIDepth); in checkForProfitableCmovCandidates() 474 unsigned Diff[LoopIterations] = {LoopDepth[0].Depth - LoopDepth[0].OptDepth, in checkForProfitableCmovCandidates() 475 LoopDepth[1].Depth - LoopDepth[1].OptDepth}; in checkForProfitableCmovCandidates() 509 WorthOptLoop = Diff[0] * 8 >= LoopDepth[0].Depth; in checkForProfitableCmovCandidates() 512 (Diff[1] - Diff[0]) * 2 >= (LoopDepth[1].Depth - LoopDepth[0].Depth) && in checkForProfitableCmovCandidates() 513 (Diff[1] * 8 >= LoopDepth[1].Depth); in checkForProfitableCmovCandidates() 550 DepthMap[OperandToDefMap.lookup(&MI->getOperand(4))].Depth; in checkForProfitableCmovCandidates() 552 DepthMap[OperandToDefMap.lookup(&MI->getOperand(1))].Depth, in checkForProfitableCmovCandidates() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFUnit.cpp | 414 uint32_t Depth = 0; in extractDIEsToVector() local 418 Depth)) { in extractDIEsToVector() 437 ++Depth; in extractDIEsToVector() 438 else if (Depth == 0) in extractDIEsToVector() 442 if (Depth > 0) in extractDIEsToVector() 443 --Depth; in extractDIEsToVector() 444 if (Depth == 0) in extractDIEsToVector() 755 if (Depth == 0) in getParent() 758 if (Depth == 1) in getParent() 774 if (Depth == 0) in getSibling() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
| H A D | WebAssemblyInstPrinter.cpp | 220 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-13.1/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | ClangOptionDocEmitter.cpp | 205 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()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaTemplateDeduction.cpp | 198 if (NTTP->getDepth() == Depth) in getDeducedParameterFromExpr() 755 unsigned Depth, Index; in addPacks() local 5700 unsigned Depth; member 5704 : Used(Used), Depth(Depth) { } in MarkUsedTemplateParameterVisitor() 5707 if (T->getDepth() == Depth) in VisitTemplateTypeParmType() 5715 if (TTP->getDepth() == Depth) in TraverseTemplateName() 5724 if (NTTP->getDepth() == Depth) in VisitDeclRefExpr() 5753 if (NTTP->getDepth() == Depth) in MarkUsedTemplateParameters() 5790 if (TTP->getDepth() == Depth) in MarkUsedTemplateParameters() 5824 Depth, in MarkUsedTemplateParameters() [all …]
|
| H A D | Scope.cpp | 34 Depth = parent->Depth + 1; in setFlags() 47 Depth = 0; in setFlags() 190 OS << "Depth: " << Depth << '\n'; in dumpImpl()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
| H A D | AArch64RegisterBankInfo.h | 123 const TargetRegisterInfo &TRI, unsigned Depth = 0) const; 127 const TargetRegisterInfo &TRI, unsigned Depth = 0) const; 131 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAG.cpp | 2470 if (Depth >= MaxRecursionDepth) in isSplatValue() 2771 if (Depth >= MaxRecursionDepth) in computeKnownBits() 2793 Known2 = computeKnownBits(SrcOp, Depth + 1); in computeKnownBits() 2915 Known = computeKnownBits(N0, Depth + 1); in computeKnownBits() 2954 Depth + 1); in computeKnownBits() 3447 Known2 = computeKnownBits(InVal, Depth + 1); in computeKnownBits() 3685 if (Depth >= MaxRecursionDepth) in ComputeNumSignBits() 3708 Tmp2 = ComputeNumSignBits(SrcOp, Depth + 1); in ComputeNumSignBits() 4278 if (Depth >= MaxRecursionDepth) in isGuaranteedNotToBeUndefOrPoison() 4323 if (Depth >= MaxRecursionDepth) in isKnownNeverNaN() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyDebugFixup.cpp | 91 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); in runOnMachineFunction() local 93 << " -> Stack Relative " << Depth << "\n"); in runOnMachineFunction() 94 MO.ChangeToTargetIndex(WebAssembly::TI_OPERAND_STACK, Depth); in runOnMachineFunction()
|