/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScoreboardHazardRecognizer.h | 45 size_t Depth = 0; member in class:llvm::ScoreboardHazardRecognizer::Scoreboard 57 size_t getDepth() const { return Depth; } 60 // Depth is expected to be a power-of-2. 61 assert(Depth && !(Depth & (Depth - 1)) && 64 return Data[(Head + idx) & (Depth-1)]; 69 Depth = d; 70 Data = new unsigned[Depth]; 73 memset(Data, 0, Depth * sizeo [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | GISelKnownBits.cpp | 53 unsigned Depth) { 92 unsigned Depth) { 112 if (Depth == getMaxDepth()) 123 Depth); 137 // Don't increment Depth for this one since we didn't do any work. 138 computeKnownBitsImpl(Src.getReg(), Known, DemandedElts, Depth); 159 Depth + 1); 164 Depth + 1); 171 Depth + 1); 173 Depth 51 computeKnownBitsForFrameIndex(Register R, KnownBits &Known, const APInt &DemandedElts, unsigned Depth) argument 90 computeKnownBitsImpl(Register R, KnownBits &Known, const APInt &DemandedElts, unsigned Depth) argument 376 computeNumSignBits(Register R, const APInt &DemandedElts, unsigned Depth) argument 438 computeNumSignBits(Register R, unsigned Depth) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFDebugInfoEntry.h | 29 uint32_t Depth = 0; member in class:llvm::DWARFDebugInfoEntry 44 uint32_t Depth); 47 uint32_t getDepth() const { return Depth; }
|
/freebsd-11-stable/contrib/expat/examples/ |
H A D | outline.c | 54 int Depth; variable 61 for (i = 0; i < Depth; i++) 71 Depth++; 79 Depth--;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | GISelKnownBits.h | 41 unsigned Depth = 0); 44 unsigned Depth = 0); 45 unsigned computeNumSignBits(Register R, unsigned Depth = 0); 69 unsigned Depth = 0);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 167 unsigned Depth, const Query &Q); 170 const DataLayout &DL, unsigned Depth, 174 ::computeKnownBits(V, Known, Depth, 178 static KnownBits computeKnownBits(const Value *V, unsigned Depth, 182 unsigned Depth, AssumptionCache *AC, 188 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); 227 static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth, 231 bool OrZero, unsigned Depth, 235 V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo)); 238 static bool isKnownNonZero(const Value *V, unsigned Depth, cons 169 computeKnownBits(const Value *V, KnownBits &Known, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE, bool UseInstrInfo) argument 181 computeKnownBits(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE, bool UseInstrInfo) argument 230 isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL, bool OrZero, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 240 isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 247 isKnownNonNegative(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 256 isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 268 isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 290 MaskedValueIsZero(const Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 301 ComputeNumSignBits(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 309 computeKnownBitsAddSub(bool Add, const Value *Op0, const Value *Op1, bool NSW, KnownBits &KnownOut, KnownBits &Known2, unsigned Depth, const Query &Q) argument 324 computeKnownBitsMul(const Value *Op0, const Value *Op1, bool NSW, KnownBits &Known, KnownBits &Known2, unsigned Depth, const Query &Q) argument 646 computeKnownBitsFromAssume(const Value *V, KnownBits &Known, unsigned Depth, const Query &Q) argument 959 computeKnownBitsFromShiftOperator( const Operator *I, KnownBits &Known, KnownBits &Known2, unsigned Depth, const Query &Q, function_ref<APInt(const APInt &, unsigned)> KZF, function_ref<APInt(const APInt &, unsigned)> KOF) argument 1046 computeKnownBitsFromOperator(const Operator *I, KnownBits &Known, unsigned Depth, const Query &Q) argument 1700 computeKnownBits(const Value *V, unsigned Depth, const Query &Q) argument 1721 computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, const Query &Q) argument 1829 isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth, const Query &Q) argument 1928 isGEPKnownNonNull(const GEPOperator *GEP, unsigned Depth, const Query &Q) argument 2096 isKnownNonZero(const Value *V, unsigned Depth, const Query &Q) argument 2393 MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth, const Query &Q) argument 2458 ComputeNumSignBits(const Value *V, unsigned Depth, const Query &Q) argument 2471 ComputeNumSignBitsImpl(const Value *V, unsigned Depth, const Query &Q) argument 2765 ComputeMultiple(Value *V, unsigned Base, Value *&Multiple, bool LookThroughSExt, unsigned Depth) argument 2993 CannotBeNegativeZero(const Value *V, const TargetLibraryInfo *TLI, unsigned Depth) argument 3040 cannotBeOrderedLessThanZeroImpl(const Value *V, const TargetLibraryInfo *TLI, bool SignBitOnly, unsigned Depth) argument 3196 isKnownNeverInfinity(const Value *V, const TargetLibraryInfo *TLI, unsigned Depth) argument 3248 isKnownNeverNaN(const Value *V, const TargetLibraryInfo *TLI, unsigned Depth) argument 4161 computeConstantRangeIncludingKnownBits( const Value *V, bool ForSigned, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE = nullptr, bool UseInstrInfo = true) argument 4750 matchMinMaxOfMinMax(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TVal, Value *FVal, unsigned Depth) argument 4844 matchMinMax(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS, unsigned Depth) argument 4938 matchSelectPattern(CmpInst::Predicate Pred, FastMathFlags FMF, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS, unsigned Depth) argument 5228 matchSelectPattern(Value *V, Value *&LHS, Value *&RHS, Instruction::CastOps *CastOp, unsigned Depth) argument 5247 matchDecomposedSelectPattern( CmpInst *CmpI, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS, Instruction::CastOps *CastOp, unsigned Depth) argument 5311 isTruePredicate(CmpInst::Predicate Pred, const Value *LHS, const Value *RHS, const DataLayout &DL, unsigned Depth) argument 5372 isImpliedCondOperands(CmpInst::Predicate Pred, const Value *ALHS, const Value *ARHS, const Value *BLHS, const Value *BRHS, const DataLayout &DL, unsigned Depth) argument 5447 isImpliedCondICmps(const ICmpInst *LHS, const ICmpInst *RHS, const DataLayout &DL, bool LHSIsTrue, unsigned Depth) argument 5492 isImpliedCondAndOr(const BinaryOperator *LHS, const ICmpInst *RHS, const DataLayout &DL, bool LHSIsTrue, unsigned Depth) argument 5521 isImpliedCondition(const Value *LHS, const Value *RHS, const DataLayout &DL, bool LHSIsTrue, unsigned Depth) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ValueTracking.h | 55 const DataLayout &DL, unsigned Depth = 0, 64 unsigned Depth = 0, AssumptionCache *AC = nullptr, 90 bool OrZero = false, unsigned Depth = 0, 104 bool isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth = 0, 118 unsigned Depth = 0, 126 bool isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth = 0, 134 bool isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth = 0, 159 unsigned Depth = 0, AssumptionCache *AC = nullptr, 172 unsigned Depth = 0, AssumptionCache *AC = nullptr, 184 unsigned Depth [all...] |
H A D | ScalarEvolution.h | 231 /// \p Depth. 232 virtual void print(raw_ostream &OS, unsigned Depth = 0) const = 0; 276 void print(raw_ostream &OS, unsigned Depth = 0) const override; 382 void print(raw_ostream &OS, unsigned Depth = 0) const override; 425 void print(raw_ostream &OS, unsigned Depth) const override; 513 const SCEV *getTruncateExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 514 const SCEV *getZeroExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 515 const SCEV *getSignExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 519 unsigned Depth = 0); 522 unsigned Depth [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCAPElim.cpp | 44 static bool MayAutorelease(ImmutableCallSite CS, unsigned Depth = 0); 71 bool ObjCARCAPElim::MayAutorelease(ImmutableCallSite CS, unsigned Depth) { argument 80 if (Depth < 3 && 82 MayAutorelease(JCS, Depth + 1))
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | Template.h | 109 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { argument 110 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); 111 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size()); 112 return TemplateArgumentLists[getNumLevels() - Depth - 1][Index]; 119 bool hasTemplateArgument(unsigned Depth, unsigned Index) const { 120 assert(Depth < getNumLevels()); 122 if (Depth < NumRetainedOuterLevels) 125 if (Index >= TemplateArgumentLists[getNumLevels() - Depth - 1].size()) 128 return !(*this)(Depth, Inde [all...] |
H A D | Scope.h | 148 /// Depth - This is the depth of this scope. The translation-unit scope has 150 unsigned short Depth; member in class:clang::Scope 266 unsigned getDepth() const { return Depth; } 460 bool Contains(const Scope& rhs) const { return Depth < rhs.Depth; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | Signals.cpp | 91 static bool findModulesAndOffsets(void **StackTrace, int Depth, 107 int Depth, llvm::raw_ostream &OS) { 138 std::vector<const char *> Modules(Depth, nullptr); 139 std::vector<intptr_t> Offsets(Depth, 0); 140 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(), 152 for (int i = 0; i < Depth; i++) { 183 for (int i = 0; i < Depth; i++) { 186 std::log10(Depth) + 2) 106 printSymbolizedStackTrace(StringRef Argv0, void **StackTrace, int Depth, llvm::raw_ostream &OS) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineSimplifyDemanded.cpp | 85 unsigned Depth) { 88 Depth, I); 119 KnownBits &Known, unsigned Depth, 122 assert(Depth <= 6 && "Limit Search Depth"); 131 computeKnownBits(V, Known, Depth, CxtI); 139 if (Depth == 6) // Limit search depth. 144 computeKnownBits(V, Known, Depth, CxtI); 151 if (Depth != 0 && !I->hasOneUse()) 152 return SimplifyMultipleUseDemandedBits(I, DemandedMask, Known, Depth, Cxt 82 SimplifyDemandedBits(Instruction *I, unsigned OpNo, const APInt &DemandedMask, KnownBits &Known, unsigned Depth) argument 118 SimplifyDemandedUseBits(Value *V, APInt DemandedMask, KnownBits &Known, unsigned Depth, Instruction *CxtI) argument 792 SimplifyMultipleUseDemandedBits(Instruction *I, const APInt &DemandedMask, KnownBits &Known, unsigned Depth, Instruction *CxtI) argument 1119 SimplifyDemandedVectorElts(Value *V, APInt DemandedElts, APInt &UndefElts, unsigned Depth, bool AllowMultipleUsers) argument [all...] |
H A D | InstCombineInternal.h | 729 unsigned Depth, const Instruction *CxtI) const { 730 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT); 733 KnownBits computeKnownBits(const Value *V, unsigned Depth, argument 735 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT); 739 unsigned Depth = 0, 741 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT); 744 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0, 746 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT); 749 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0, 751 return llvm::ComputeNumSignBits(Op, DL, Depth, 728 computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, const Instruction *CxtI) const argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | Scope.cpp | 34 Depth = parent->Depth + 1; 47 Depth = 0; 190 OS << "Depth: " << Depth << '\n'; local
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86CmovConversion.cpp | 363 /// \returns Depth of CMOV instruction as if it was converted into branch. 379 /// Depth of original loop. 380 unsigned Depth; member in struct:DepthInfo 381 /// Depth of optimized loop. 407 // Instruction-Depth: 410 // CMOV latency + getDepthOfOptCmov(True-Op-Depth, False-Op-depth) 414 // Loop-Depth: 418 // Loop-Depth[i]: 419 // Loop-Depth calculated for first `i` iterations. 422 // Depth [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangOptionDocEmitter.cpp | 205 void emitHeading(int Depth, std::string Heading, raw_ostream &OS) { argument 206 assert(Depth < 8 && "groups nested too deeply"); 208 << std::string(Heading.size(), "=~-_'+<>"[Depth]) << "\n"; 352 void emitDocumentation(int Depth, const Documentation &Doc, 355 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, 360 emitHeading(Depth, 370 emitDocumentation(Depth + 1, Group, DocInfo, OS); 373 void emitDocumentation(int Depth, const Documentation &Doc, 378 emitGroup(Depth, G, DocInfo, OS);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFUnit.cpp | 392 uint32_t Depth = 0; local 396 Depth)) { 415 ++Depth; 418 if (Depth > 0) 419 --Depth; 420 if (Depth == 0) 769 const uint32_t Depth = Die->getDepth(); local 771 if (Depth == 0) 773 // Depth of 1 always means parent is the compile/type unit. 774 if (Depth [all...] |
H A D | DWARFDebugInfoEntry.cpp | 32 Depth = D;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyExceptionInfo.cpp | 152 void WebAssemblyException::print(raw_ostream &OS, unsigned Depth) const { 153 OS.indent(Depth * 2) << "Exception at depth " << getExceptionDepth() 171 SubE->print(OS, Depth + 2);
|
/freebsd-11-stable/sys/contrib/dev/acpica/compiler/ |
H A D | dtsubtable.c | 222 Subtable->Depth = ParentTable->Depth + 1;
|
H A D | prmacros.c | 395 UINT32 Depth = 1; local 408 Depth++; 412 Depth--; 420 if (Depth == 0)
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Parallel.h | 96 const Comparator &Comp, TaskGroup &TG, size_t Depth) { 98 if (std::distance(Start, End) < detail::MinParallelSize || Depth == 0) { 115 parallel_quick_sort(Start, Pivot, Comp, TG, Depth - 1); 117 parallel_quick_sort(Pivot + 1, End, Comp, TG, Depth - 1); 95 parallel_quick_sort(RandomAccessIterator Start, RandomAccessIterator End, const Comparator &Comp, TaskGroup &TG, size_t Depth) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
H A D | WebAssemblyInstPrinter.cpp | 169 uint64_t Depth = MI->getOperand(I).getImm(); local 170 if (!Printed.insert(Depth).second) 172 if (Depth >= ControlFlowStack.size()) { 175 const auto &Pair = ControlFlowStack.rbegin()[Depth]; 176 printAnnotation(OS, utostr(Depth) + ": " +
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | TargetLowering.cpp | 598 unsigned Depth, 604 return SimplifyDemandedBits(Op, DemandedBits, DemandedElts, Known, TLO, Depth, 612 SelectionDAG &DAG, unsigned Depth) const { 614 if (Depth >= SelectionDAG::MaxRecursionDepth) 637 Src, DemandedBits, DemandedElts, DAG, Depth + 1)) 659 Src, DemandedSrcBits, DemandedSrcElts, DAG, Depth + 1)) 678 Src, DemandedSrcBits, DemandedSrcElts, DAG, Depth + 1)) 685 LHSKnown = DAG.computeKnownBits(Op.getOperand(0), DemandedElts, Depth + 1); 686 RHSKnown = DAG.computeKnownBits(Op.getOperand(1), DemandedElts, Depth + 1); 698 LHSKnown = DAG.computeKnownBits(Op.getOperand(0), DemandedElts, Depth 595 SimplifyDemandedBits(SDValue Op, const APInt &DemandedBits, KnownBits &Known, TargetLoweringOpt &TLO, unsigned Depth, bool AssumeSingleUse) const argument 800 SimplifyDemandedBits( SDValue Op, const APInt &OriginalDemandedBits, const APInt &OriginalDemandedElts, KnownBits &Known, TargetLoweringOpt &TLO, unsigned Depth, bool AssumeSingleUse) const argument 2149 SimplifyDemandedVectorElts( SDValue Op, const APInt &OriginalDemandedElts, APInt &KnownUndef, APInt &KnownZero, TargetLoweringOpt &TLO, unsigned Depth, bool AssumeSingleUse) const argument [all...] |