| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/GlobalISel/ |
| H A D | GISelKnownBits.cpp | 35 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() argument 39 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth); in computeKnownAlignment() 51 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1); in computeKnownAlignment() 69 unsigned Depth) { in getKnownBits() argument 92 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() argument 93 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult() 94 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult() 96 << "[" << Depth << "] Zero: 0x" << toString(Known.Zero, 16, false) in dumpResult() 98 << "[" << Depth << "] One: 0x" << toString(Known.One, 16, false) in dumpResult() 106 unsigned Depth) { in computeKnownBitsMin() argument [all …]
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | ValueTracking.cpp | 173 KnownBits &Known, unsigned Depth, const Query &Q); 175 static void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument 183 computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits() 187 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument 191 ::computeKnownBits(V, Known, Depth, in computeKnownBits() 197 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument 200 ::computeKnownBits(V, DemandedElts, Known, Depth, in computeKnownBits() 205 unsigned Depth, const Query &Q); 207 static KnownBits computeKnownBits(const Value *V, unsigned Depth, 211 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument [all …]
|
| H A D | LoopAccessAnalysis.cpp | 574 unsigned Depth) const { in printChecks() 579 OS.indent(Depth) << "Check " << N++ << ":\n"; in printChecks() 581 OS.indent(Depth + 2) << "Comparing group (" << Check.first << "):\n"; in printChecks() 583 OS.indent(Depth + 2) << *Pointers[First[K]].PointerValue << "\n"; in printChecks() 585 OS.indent(Depth + 2) << "Against group (" << Check.second << "):\n"; in printChecks() 587 OS.indent(Depth + 2) << *Pointers[Second[K]].PointerValue << "\n"; in printChecks() 591 void RuntimePointerChecking::print(raw_ostream &OS, unsigned Depth) const { in print() 593 OS.indent(Depth) << "Run-time memory checks:\n"; in print() 594 printChecks(OS, Checks, Depth); in print() 596 OS.indent(Depth) << "Grouped accesses:\n"; in print() [all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/Sema/ |
| H A D | Template.h | 134 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 …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineSimplifyDemanded.cpp | 73 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() 135 computeKnownBits(V, Known, Depth, CxtI); in SimplifyDemandedUseBits() 142 if (Depth != 0 && !I->hasOneUse()) in SimplifyDemandedUseBits() 143 return SimplifyMultipleUseDemandedBits(I, DemandedMask, Known, Depth, CxtI); in SimplifyDemandedUseBits() 151 if (Depth == 0 && !V->hasOneUse()) in SimplifyDemandedUseBits() [all …]
|
| H A D | InstCombineNegator.cpp | 131 [[nodiscard]] Value *Negator::visitImpl(Value *V, unsigned Depth) { in visitImpl() argument 295 if (Depth > NegatorMaxDepth) { in visitImpl() 305 Value *NegOp = negate(I->getOperand(0), Depth + 1); in visitImpl() 316 negate(std::get<0>(I), Depth + 1))) // Early return. in visitImpl() 339 Value *NegOp1 = negate(I->getOperand(1), Depth + 1); in visitImpl() 342 Value *NegOp2 = negate(I->getOperand(2), Depth + 1); in visitImpl() 352 Value *NegOp0 = negate(I->getOperand(0), Depth + 1); in visitImpl() 355 Value *NegOp1 = negate(I->getOperand(1), Depth + 1); in visitImpl() 364 Value *NegVector = negate(EEI->getVectorOperand(), Depth + 1); in visitImpl() 374 Value *NegVector = negate(IEI->getOperand(0), Depth + 1); in visitImpl() [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | ValueTracking.h | 57 unsigned Depth = 0, AssumptionCache *AC = nullptr, 73 unsigned Depth = 0, AssumptionCache *AC = nullptr, 81 unsigned Depth = 0, AssumptionCache *AC = nullptr, 89 const DataLayout &DL, unsigned Depth = 0, 114 bool OrZero = false, unsigned Depth = 0, 128 bool isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth = 0, 142 unsigned Depth = 0, AssumptionCache *AC = nullptr, 149 bool isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth = 0, 157 bool isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth = 0, 181 unsigned Depth = 0, AssumptionCache *AC = nullptr, [all …]
|
| H A D | LoopNestAnalysis.h | 120 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 D | ScalarEvolution.h | 252 virtual void print(raw_ostream &OS, unsigned Depth = 0) const = 0; 294 void print(raw_ostream &OS, unsigned Depth = 0) const override; 401 void print(raw_ostream &OS, unsigned Depth = 0) const override; 437 void print(raw_ostream &OS, unsigned Depth) const override; 566 const SCEV *getLosslessPtrToIntExpr(const SCEV *Op, unsigned Depth = 0); 568 const SCEV *getTruncateExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 569 const SCEV *getZeroExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 571 unsigned Depth = 0); 572 const SCEV *getSignExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0); 574 unsigned Depth = 0); [all …]
|
| /openbsd-src/gnu/llvm/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);
|
| /openbsd-src/gnu/llvm/clang/lib/Analysis/FlowSensitive/ |
| H A D | DebugSupport.cpp | 102 std::string debugString(const BoolValue &B, size_t Depth = 0) { in debugString() argument 111 auto L = debugString(C.getLeftSubValue(), Depth + 1); in debugString() 112 auto R = debugString(C.getRightSubValue(), Depth + 1); in debugString() 118 auto L = debugString(D.getLeftSubValue(), Depth + 1); in debugString() 119 auto R = debugString(D.getRightSubValue(), Depth + 1); in debugString() 125 S = formatv("(not\n{0})", debugString(N.getSubVal(), Depth + 1)); in debugString() 130 auto L = debugString(IV.getLeftSubValue(), Depth + 1); in debugString() 131 auto R = debugString(IV.getRightSubValue(), Depth + 1); in debugString() 137 auto L = debugString(BV.getLeftSubValue(), Depth + 1); in debugString() 138 auto R = debugString(BV.getRightSubValue(), Depth + 1); in debugString() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | Signals.cpp | 126 static bool findModulesAndOffsets(void **StackTrace, int Depth, 142 int Depth, llvm::raw_ostream &OS) { in printSymbolizedStackTrace() argument 175 std::vector<const char *> Modules(Depth, nullptr); in printSymbolizedStackTrace() 176 std::vector<intptr_t> Offsets(Depth, 0); in printSymbolizedStackTrace() 177 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(), in printSymbolizedStackTrace() 189 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace() 220 for (int i = 0; i < Depth; i++) { in printSymbolizedStackTrace() 223 std::log10(Depth) + 2) in printSymbolizedStackTrace()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombiner.h | 461 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument 463 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT); in computeKnownBits() 466 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument 468 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT); in computeKnownBits() 472 unsigned Depth = 0, 474 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT); 477 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0, 479 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT); 482 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0, 484 return llvm::ComputeNumSignBits(Op, DL, Depth, &AC, CxtI, &DT); [all …]
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-xray/ |
| H A D | xray-account.cpp | 136 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 --()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 39 if (Depth > C->Depth) in contains() 41 while (Depth < C->Depth) in contains() 292 Cycle->Depth = Cycle->ParentCycle ? Cycle->ParentCycle->Depth + 1 : 1; in updateDepth() 436 check(Child->Depth > Cycle->Depth); in validateTree() 438 ChildDepth = Child->Depth; in validateTree() 440 check(ChildDepth == Child->Depth); in validateTree() 465 for (unsigned I = 0; I < Cycle->Depth; ++I) in print()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | X86CmovConversion.cpp | 395 unsigned Depth; in checkForProfitableCmovCandidates() member 460 MIDepth = std::max(MIDepth, Info.Depth); in checkForProfitableCmovCandidates() 481 MaxDepth.Depth = std::max(MaxDepth.Depth, MIDepth); in checkForProfitableCmovCandidates() 487 unsigned Diff[LoopIterations] = {LoopDepth[0].Depth - LoopDepth[0].OptDepth, in checkForProfitableCmovCandidates() 488 LoopDepth[1].Depth - LoopDepth[1].OptDepth}; in checkForProfitableCmovCandidates() 522 WorthOptLoop = Diff[0] * 8 >= LoopDepth[0].Depth; in checkForProfitableCmovCandidates() 525 (Diff[1] - Diff[0]) * 2 >= (LoopDepth[1].Depth - LoopDepth[0].Depth) && in checkForProfitableCmovCandidates() 526 (Diff[1] * 8 >= LoopDepth[1].Depth); in checkForProfitableCmovCandidates() 563 DepthMap[OperandToDefMap.lookup(&MI->getOperand(4))].Depth; in checkForProfitableCmovCandidates() 565 DepthMap[OperandToDefMap.lookup(&MI->getOperand(1))].Depth, in checkForProfitableCmovCandidates() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/GISel/ |
| H A D | PPCRegisterBankInfo.cpp | 241 unsigned Depth) const { in hasFPConstraints() 267 if (!MI.isPHI() || Depth > MaxFPRSearchDepth) in hasFPConstraints() 272 onlyDefinesFP(*MRI.getVRegDef(Op.getReg()), MRI, TRI, Depth + 1); in hasFPConstraints() 281 unsigned Depth) const { in onlyUsesFP() 292 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyUsesFP() 300 unsigned Depth) const { in onlyDefinesFP() 308 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyDefinesFP()
|
| H A D | PPCRegisterBankInfo.h | 82 unsigned Depth = 0) const; 86 const TargetRegisterInfo &TRI, unsigned Depth = 0) const; 90 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
|
| /openbsd-src/gnu/llvm/libcxxabi/src/ |
| H A D | cxa_demangle.cpp | 63 unsigned Depth = 0; member 90 ++Depth; in print() 101 --Depth; in print() 223 for (unsigned I = 0; I != Depth; ++I) in newLine() 258 Depth += 2; in operator ()() 262 Depth -= 2; in operator ()() 266 Depth += 2; in operator ()() 276 Depth -= 2; in operator ()()
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/clang/utils/TableGen/ |
| H A D | ClangOptionDocEmitter.cpp | 228 void emitHeading(int Depth, std::string Heading, raw_ostream &OS) { in emitHeading() argument 229 assert(Depth < 8 && "groups nested too deeply"); in emitHeading() 231 << std::string(Heading.size(), "=~-_'+<>"[Depth]) << "\n"; in emitHeading() 399 void emitDocumentation(int Depth, const Documentation &Doc, 402 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, in emitGroup() argument 410 emitHeading(Depth, in emitGroup() 420 emitDocumentation(Depth + 1, Group, DocInfo, OS); in emitGroup() 423 void emitDocumentation(int Depth, const Documentation &Doc, in emitDocumentation() argument 428 emitGroup(Depth, G, DocInfo, OS); in emitDocumentation()
|
| /openbsd-src/gnu/llvm/clang/lib/Sema/ |
| H A D | SemaTemplateDeduction.cpp | 151 bool OnlyDeduced, unsigned Depth, 162 getDeducedParameterFromExpr(const Expr *E, unsigned Depth) { in getDeducedParameterFromExpr() argument 185 if (NTTP->getDepth() == Depth) in getDeducedParameterFromExpr() 759 unsigned Depth, Index; in addPacks() local 760 std::tie(Depth, Index) = getDepthAndIndex(Unexpanded[I]); in addPacks() 761 if (Depth == Info.getDeducedDepth()) in addPacks() 5803 unsigned Depth; member 5806 unsigned Depth) in MarkUsedTemplateParameterVisitor() 5807 : Used(Used), Depth(Depth) { } in MarkUsedTemplateParameterVisitor() 5810 if (T->getDepth() == Depth) in VisitTemplateTypeParmType() [all …]
|
| H A D | Scope.cpp | 34 Depth = parent->Depth + 1; in setFlags() 50 Depth = 0; in setFlags() 245 OS << "Depth: " << Depth << '\n'; in dumpImpl()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCAPElim.cpp | 45 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()
|