Home
last modified time | relevance | path

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

123456789

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DGISelKnownBits.cpp39 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() argument
43 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth); in computeKnownAlignment()
57 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1); in computeKnownAlignment()
78 unsigned Depth) { in getKnownBits() argument
83 computeKnownBitsImpl(R, Known, DemandedElts, Depth); in getKnownBits()
101 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() argument
102 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult()
103 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult()
105 << "[" << Depth << "] Zero: 0x" << toString(Known.Zero, 16, false) in dumpResult()
107 << "[" << Depth << "] One: 0x" << toString(Known.One, 16, false) in dumpResult()
[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/include/llvm/Analysis/
H A DValueTracking.h59 unsigned Depth = 0, AssumptionCache *AC = nullptr,
66 unsigned Depth = 0, AssumptionCache *AC = nullptr,
73 const DataLayout &DL, unsigned Depth = 0,
80 unsigned Depth, const SimplifyQuery &Q);
82 KnownBits computeKnownBits(const Value *V, unsigned Depth,
85 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
95 unsigned Depth, const SimplifyQuery &Q);
101 unsigned Depth, const SimplifyQuery &SQ);
106 bool Invert, unsigned Depth,
120 bool OrZero = false, unsigned Depth = 0,
[all …]
H A DLoopNestAnalysis.h119 /// Get the loops in the nest at the given \p Depth.
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 DScalarEvolution.h252 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;
569 const SCEV *getLosslessPtrToIntExpr(const SCEV *Op, unsigned Depth = 0);
571 const SCEV *getTruncateExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
574 const SCEV *getZeroExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
576 unsigned Depth = 0);
577 const SCEV *getSignExtendExpr(const SCEV *Op, Type *Ty, unsigned Depth = 0);
579 unsigned Depth = 0);
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplate.h134 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 …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp91 KnownBits &Known, unsigned Depth, in SimplifyDemandedBits() argument
96 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
107 if (Depth == MaxAnalysisRecursionDepth) in SimplifyDemandedBits()
112 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
119 NewVal = SimplifyDemandedUseBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
124 SimplifyMultipleUseDemandedBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
160 unsigned Depth, in SimplifyDemandedUseBits() argument
163 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in SimplifyDemandedUseBits()
195 SimplifyDemandedBits(I, 0, DemandedFromOps, LHSKnown, Depth + 1, Q) || in SimplifyDemandedUseBits()
197 SimplifyDemandedBits(I, 1, DemandedFromOps, RHSKnown, Depth + 1, Q)) { in SimplifyDemandedUseBits()
[all …]
H A DInstCombineNegator.cpp126 [[nodiscard]] Value *Negator::visitImpl(Value *V, bool IsNSW, unsigned Depth) { in visitImpl() argument
296 if (Depth > NegatorMaxDepth) { in visitImpl()
306 Value *NegOp = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
317 negate(std::get<0>(I), IsNSW, Depth + 1))) // Early return. in visitImpl()
341 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
344 Value *NegOp2 = negate(I->getOperand(2), IsNSW, Depth + 1); in visitImpl()
354 Value *NegOp0 = negate(I->getOperand(0), IsNSW, Depth + 1); in visitImpl()
357 Value *NegOp1 = negate(I->getOperand(1), IsNSW, Depth + 1); in visitImpl()
366 Value *NegVector = negate(EEI->getVectorOperand(), IsNSW, Depth + 1); in visitImpl()
376 Value *NegVector = negate(IEI->getOperand(0), IsNSW, Depth + 1); in visitImpl()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp151 KnownBits &Known, unsigned Depth,
154 void llvm::computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
162 ::computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits()
166 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument
170 V, Known, Depth, in computeKnownBits()
175 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument
179 V, Depth, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits()
183 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument
187 V, DemandedElts, Depth, in computeKnownBits()
269 static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
[all …]
H A DLoopAccessAnalysis.cpp616 unsigned Depth) const { in printChecks()
621 OS.indent(Depth) << "Check " << N++ << ":\n"; in printChecks()
623 OS.indent(Depth + 2) << "Comparing group (" << Check1 << "):\n"; in printChecks()
625 OS.indent(Depth + 2) << *Pointers[K].PointerValue << "\n"; in printChecks()
627 OS.indent(Depth + 2) << "Against group (" << Check2 << "):\n"; in printChecks()
629 OS.indent(Depth + 2) << *Pointers[K].PointerValue << "\n"; in printChecks()
633 void RuntimePointerChecking::print(raw_ostream &OS, unsigned Depth) const { in print()
635 OS.indent(Depth) << "Run-time memory checks:\n"; in print()
636 printChecks(OS, Checks, Depth); in print()
638 OS.indent(Depth) << "Grouped accesses:\n"; in print()
[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/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h211 unsigned Depth);
431 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
433 llvm::computeKnownBits(V, Known, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
436 KnownBits computeKnownBits(const Value *V, unsigned Depth, in computeKnownBits() argument
438 return llvm::computeKnownBits(V, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
442 unsigned Depth = 0,
444 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
447 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0,
449 return llvm::MaskedValueIsZero(V, Mask, SQ.getWithInstruction(CxtI), Depth);
452 unsigned ComputeNumSignBits(const Value *Op, unsigned Depth = 0,
[all …]
/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()
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,
270 for (int I = 0; I < Depth;
142 printSymbolizedStackTrace(StringRef Argv0,void ** StackTrace,int Depth,llvm::raw_ostream & OS) printSymbolizedStackTrace() argument
[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/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp2683 bool SelectionDAG::SignBitIsZero(SDValue Op, unsigned Depth) const { in SignBitIsZero()
2685 return MaskedValueIsZero(Op, APInt::getSignMask(BitWidth), Depth); in SignBitIsZero()
2692 unsigned Depth) const { in MaskedValueIsZero()
2693 return Mask.isSubsetOf(computeKnownBits(V, Depth).Zero); in MaskedValueIsZero()
2701 unsigned Depth) const { in MaskedValueIsZero()
2702 return Mask.isSubsetOf(computeKnownBits(V, DemandedElts, Depth).Zero); in MaskedValueIsZero()
2708 unsigned Depth /* = 0 */) const { in MaskedVectorIsZero()
2709 return computeKnownBits(V, DemandedElts, Depth).isZero(); in MaskedVectorIsZero()
2714 unsigned Depth) const { in MaskedValueIsAllOnes()
2715 return Mask.isSubsetOf(computeKnownBits(V, Depth).One); in MaskedValueIsAllOnes()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64RegisterBankInfo.h128 unsigned Depth = 0) const;
132 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
136 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
140 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/
H A DWebAssemblyInstPrinter.cpp220 uint64_t Depth = MI->getOperand(0).getImm(); in printInst()
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()
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()
219 uint64_t Depth = MI->getOperand(0).getImm(); printInst() local
252 uint64_t Depth = MI->getOperand(I).getImm(); printInst() local
/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()
324 Cycle->Depth = Cycle->ParentCycle ? Cycle->ParentCycle->Depth + 1 : 1; in updateDepth()
507 check(Child->Depth > Cycle->Depth); in validateTree()
509 ChildDepth = Child->Depth; in validateTree()
511 check(ChildDepth == Child->Depth); in validateTree()
536 for (unsigned I = 0; I < Cycle->Depth; ++I) in print()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/GISel/
H A DPPCRegisterBankInfo.cpp254 unsigned Depth) const { in hasFPConstraints()
283 if (!MI.isPHI() || Depth > MaxFPRSearchDepth) in hasFPConstraints()
288 onlyDefinesFP(*MRI.getVRegDef(Op.getReg()), MRI, TRI, Depth + 1); in hasFPConstraints()
297 unsigned Depth) const { in onlyUsesFP()
308 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyUsesFP()
316 unsigned Depth) const { in onlyDefinesFP()
324 return hasFPConstraints(MI, MRI, TRI, Depth); in onlyDefinesFP()
H A DPPCRegisterBankInfo.h83 unsigned Depth = 0) const;
87 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
91 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/GISel/
H A DX86RegisterBankInfo.h71 unsigned Depth = 0) const;
75 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
79 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
/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()
419 void emitDocumentation(int Depth, const Documentation &Doc,
422 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo, in emitGroup() argument
424 emitHeading(Depth, in emitGroup()
434 emitDocumentation(Depth + 1, Group, DocInfo, OS); in emitGroup()
437 void emitDocumentation(int Depth, const Documentation &Doc, in emitDocumentation() argument
442 emitGroup(Depth, G, DocInfo, OS); in emitDocumentation()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfileMatcher.cpp204 for (int32_t Depth = Trace.size() - 1; X > 0 || Y > 0; Depth--) { in longestCommonSequence() local
205 const auto &P = Trace[Depth]; in longestCommonSequence()
208 if (K == -Depth || (K != Depth && P[Index(K - 1)] < P[Index(K + 1)])) in longestCommonSequence()
221 if (Depth == 0) in longestCommonSequence()
240 for (int32_t Depth = 0; Depth <= MaxDepth; Depth++) { in longestCommonSequence() local
242 for (int32_t K = -Depth; K <= Depth; K += 2) { in longestCommonSequence()
244 if (K == -Depth || (K != Depth && V[Index(K - 1)] < V[Index(K + 1)])) in longestCommonSequence()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.h71 unsigned Depth : 2; member
80 ImageAttrs(unsigned Dim, unsigned Depth, unsigned Arrayed, unsigned MS,
84 Flags.Depth = Depth;
94 make_descr_image(const Type *SampledTy, unsigned Dim, unsigned Depth,
99 ImageAttrs(Dim, Depth, Arrayed, MS, Sampled, ImageFormat, AQ).Val,

123456789