| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| ScoreboardHazardRecognizer.h | 45 size_t Depth = 0;
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 InstrStage::FuncUnits[Depth];
73 memset(Data, 0, Depth * sizeof(Data[0]))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| GISelKnownBits.cpp | 34 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) {
38 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth);
46 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1);
64 unsigned Depth) {
87 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) {
88 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth
89 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x"
91 << "[" << Depth << "] Zero: 0x" << Known.Zero.toString(16, false)
93 << "[" << Depth << "] One: 0x" << Known.One.toString(16, false
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugInfoEntry.h | 27 /// The integer depth of this DIE within the compile unit DIEs where the
28 /// compile/type unit DIE has a depth of zero.
29 uint32_t Depth = 0;
44 uint32_t Depth);
47 uint32_t getDepth() const { return Depth; }
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| 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);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ValueTracking.cpp | 195 KnownBits &Known, unsigned Depth, const Query &Q);
197 static void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
209 computeKnownBits(V, DemandedElts, Known, Depth, Q);
213 const DataLayout &DL, unsigned Depth,
217 ::computeKnownBits(V, Known, Depth,
223 unsigned Depth, AssumptionCache *AC,
226 ::computeKnownBits(V, DemandedElts, Known, Depth,
231 unsigned Depth, const Query &Q);
233 static KnownBits computeKnownBits(const Value *V, unsigned Depth,
237 unsigned Depth, AssumptionCache *AC
[all...] |
| LoopAccessAnalysis.cpp | 460 unsigned Depth) const {
465 OS.indent(Depth) << "Check " << N++ << ":\n";
467 OS.indent(Depth + 2) << "Comparing group (" << Check.first << "):\n";
469 OS.indent(Depth + 2) << *Pointers[First[K]].PointerValue << "\n";
471 OS.indent(Depth + 2) << "Against group (" << Check.second << "):\n";
473 OS.indent(Depth + 2) << *Pointers[Second[K]].PointerValue << "\n";
477 void RuntimePointerChecking::print(raw_ostream &OS, unsigned Depth) const {
479 OS.indent(Depth) << "Run-time memory checks:\n";
480 printChecks(OS, Checks, Depth);
482 OS.indent(Depth) << "Grouped accesses:\n"
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineNegator.cpp | 68 STATISTIC(NegatorMaxDepthVisited, "Negator: Maximal traversal depth ever "
71 "Negator: How many times did the traversal depth limit was reached "
98 NegatorMaxDepth("instcombine-negator-max-depth",
100 cl::desc("What is the maximal lookup depth when trying to "
132 // the depth-first, early bailout traversal?
133 LLVM_NODISCARD Value *Negator::visitImpl(Value *V, unsigned Depth) {
256 if (Depth > NegatorMaxDepth) {
257 LLVM_DEBUG(dbgs() << "Negator: reached maximal allowed traversal depth in "
266 Value *NegOp = negate(I->getOperand(0), Depth + 1);
277 negate(std::get<0>(I), Depth + 1))) // Early return
[all...] |
| InstCombineSimplifyDemanded.cpp | 73 KnownBits &Known, unsigned Depth) {
76 Depth, I);
110 unsigned Depth,
113 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth");
122 computeKnownBits(V, Known, Depth, CxtI);
130 if (Depth == MaxAnalysisRecursionDepth)
138 computeKnownBits(V, Known, Depth, CxtI);
145 if (Depth != 0 && !I->hasOneUse())
146 return SimplifyMultipleUseDemandedBits(I, DemandedMask, Known, Depth, CxtI)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/ |
| AArch64RegisterBankInfo.h | 118 /// Maximum recursion depth for hasFPConstraints.
123 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
127 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
131 const TargetRegisterInfo &TRI, unsigned Depth = 0) const;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Signals.h | 53 /// \param Depth refers to the number of stackframes to print. If not
55 void PrintStackTrace(raw_ostream &OS, int Depth = 0);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| ValueTracking.h | 59 const DataLayout &DL, unsigned Depth = 0,
76 unsigned Depth = 0, AssumptionCache *AC = nullptr,
84 unsigned Depth = 0, AssumptionCache *AC = nullptr,
92 const DataLayout &DL, unsigned Depth = 0,
119 bool OrZero = false, unsigned Depth = 0,
133 bool isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth = 0,
147 unsigned Depth = 0,
155 bool isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth = 0,
163 bool isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth = 0,
188 unsigned Depth = 0, AssumptionCache *AC = nullptr
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| Template.h | 73 /// list will contain a template argument list (int) at depth 0 and a
74 /// template argument list (17) at depth 1.
76 /// The template argument list at a certain template depth
138 /// Retrieve the template argument at a given depth and index.
139 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const {
140 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels());
141 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size());
142 return TemplateArgumentLists[getNumLevels() - Depth - 1][Index];
146 /// given depth and index
[all...] |
| Scope.h | 154 /// Depth - This is the depth of this scope. The translation-unit scope has
155 /// depth 0.
156 unsigned short Depth;
282 /// Returns the depth of this scope. The translation-unit has scope depth 0.
283 unsigned getDepth() const { return Depth; }
486 /// Returns if rhs has a higher scope depth than this.
490 bool Contains(const Scope& rhs) const { return Depth < rhs.Depth; }
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| Signals.cpp | 99 static bool findModulesAndOffsets(void **StackTrace, int Depth,
115 int Depth, llvm::raw_ostream &OS) {
148 std::vector<const char *> Modules(Depth, nullptr);
149 std::vector<intptr_t> Offsets(Depth, 0);
150 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(),
162 for (int i = 0; i < Depth; i++) {
193 for (int i = 0; i < Depth; i++) {
196 std::log10(Depth) + 2)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombiner.h | 456 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
458 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT);
461 KnownBits computeKnownBits(const Value *V, unsigned Depth,
463 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT);
467 unsigned Depth = 0,
469 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
472 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth = 0,
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)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyDebugFixup.cpp | 13 /// track stack depth when values get stackified.
91 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]);
93 << " -> Stack Relative " << Depth << "\n");
94 MO.ChangeToTargetIndex(WebAssembly::TI_OPERAND_STACK, Depth);
107 // Track stack depth.
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCAPElim.cpp | 44 bool MayAutorelease(const CallBase &CB, unsigned Depth = 0) {
51 // This recursion depth limit is arbitrary. It's just great
53 if (Depth < 3 && !JCB->onlyReadsMemory() &&
54 MayAutorelease(*JCB, Depth + 1))
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| Scope.cpp | 34 Depth = parent->Depth + 1;
47 Depth = 0;
190 OS << "Depth: " << Depth << '\n';
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-account.cpp | 134 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage);
135 assert(Depth >= 0 && Depth < std::numeric_limits<decltype(Depth)>::max());
136 ++Depth;
137 Bitfield::set<RecursionStatus::Depth>(Storage, Depth); // ++Storage
139 if (!isRecursive() && Depth == 2) // Storage == 2 / Storage s> 1
145 auto Depth = Bitfield::get<RecursionStatus::Depth>(Storage)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
| WebAssemblyInstPrinter.cpp | 220 uint64_t Depth = MI->getOperand(0).getImm();
221 if (Depth >= ControlFlowStack.size()) {
224 const auto &Pair = ControlFlowStack.rbegin()[Depth];
253 uint64_t Depth = MI->getOperand(I).getImm();
254 if (!Printed.insert(Depth).second)
256 if (Depth >= ControlFlowStack.size()) {
257 printAnnotation(OS, "Invalid depth argument!");
259 const auto &Pair = ControlFlowStack.rbegin()[Depth];
260 printAnnotation(OS, utostr(Depth) + ": " +
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86CmovConversion.cpp | 27 /// depth cost by some threshold.
209 // * Calculate both loop-depth and optimized-loop-depth.
210 // * Use these depth to check for loop transformation profitability.
363 /// \returns Depth of CMOV instruction as if it was converted into branch.
364 /// \param TrueOpDepth depth cost of CMOV true value operand.
365 /// \param FalseOpDepth depth cost of CMOV false value operand.
367 // The depth of the result after branch conversion is
370 // the other, and pick the result with the largest resulting depth.
379 /// Depth of original loop
[all...] |
| /src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| ClangOptionDocEmitter.cpp | 205 void emitHeading(int Depth, std::string Heading, raw_ostream &OS) {
206 assert(Depth < 8 && "groups nested too deeply");
208 << std::string(Heading.size(), "=~-_'+<>"[Depth]) << "\n";
350 void emitDocumentation(int Depth, const Documentation &Doc,
353 void emitGroup(int Depth, const DocumentedGroup &Group, const Record *DocInfo,
358 emitHeading(Depth,
368 emitDocumentation(Depth + 1, Group, DocInfo, OS);
371 void emitDocumentation(int Depth, const Documentation &Doc,
376 emitGroup(Depth, G, DocInfo, OS);
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnit.cpp | 364 uint32_t Depth = 0;
368 Depth)) {
387 ++Depth;
390 if (Depth > 0)
391 --Depth;
392 if (Depth == 0)
714 const uint32_t Depth = Die->getDepth();
715 // Unit DIEs always have a depth of zero and never have parents.
716 if (Depth == 0)
718 // Depth of 1 always means parent is the compile/type unit
[all...] |
| DWARFDebugInfoEntry.cpp | 32 Depth = D;
|
| /src/sys/external/bsd/acpica/dist/compiler/ |
| dtsubtable.c | 114 Subtable->Depth = ParentTable->Depth + 1;
|
