mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +01:00
Correct indentation for dumping LexicalScope.
llvm-svn: 174237
This commit is contained in:
parent
783b7811da
commit
7ddbce87d4
@ -159,9 +159,6 @@ public:
|
||||
LexicalScope(LexicalScope *P, const MDNode *D, const MDNode *I, bool A)
|
||||
: Parent(P), Desc(D), InlinedAtLocation(I), AbstractScope(A),
|
||||
LastInsn(0), FirstInsn(0), DFSIn(0), DFSOut(0) {
|
||||
#ifndef NDEBUG
|
||||
IndentLevel = 0;
|
||||
#endif
|
||||
if (Parent)
|
||||
Parent->addChild(this);
|
||||
}
|
||||
@ -228,7 +225,7 @@ public:
|
||||
void setDFSIn(unsigned I) { DFSIn = I; }
|
||||
|
||||
/// dump - print lexical scope.
|
||||
void dump() const;
|
||||
void dump(unsigned Indent = 0) const;
|
||||
|
||||
private:
|
||||
LexicalScope *Parent; // Parent to this scope.
|
||||
@ -244,9 +241,6 @@ private:
|
||||
const MachineInstr *FirstInsn; // First instruction of this scope.
|
||||
unsigned DFSIn, DFSOut; // In & Out Depth use to determine
|
||||
// scope nesting.
|
||||
#ifndef NDEBUG
|
||||
mutable unsigned IndentLevel; // Private state for dump()
|
||||
#endif
|
||||
};
|
||||
|
||||
} // end llvm namespace
|
||||
|
@ -314,24 +314,22 @@ bool LexicalScopes::dominates(DebugLoc DL, MachineBasicBlock *MBB) {
|
||||
void LexicalScope::anchor() { }
|
||||
|
||||
/// dump - Print data structures.
|
||||
void LexicalScope::dump() const {
|
||||
void LexicalScope::dump(unsigned Indent) const {
|
||||
#ifndef NDEBUG
|
||||
raw_ostream &err = dbgs();
|
||||
err.indent(IndentLevel);
|
||||
err.indent(Indent);
|
||||
err << "DFSIn: " << DFSIn << " DFSOut: " << DFSOut << "\n";
|
||||
const MDNode *N = Desc;
|
||||
err.indent(Indent);
|
||||
N->dump();
|
||||
if (AbstractScope)
|
||||
err << "Abstract Scope\n";
|
||||
err << std::string(Indent, ' ') << "Abstract Scope\n";
|
||||
|
||||
IndentLevel += 2;
|
||||
if (!Children.empty())
|
||||
err << "Children ...\n";
|
||||
err << std::string(Indent + 2, ' ') << "Children ...\n";
|
||||
for (unsigned i = 0, e = Children.size(); i != e; ++i)
|
||||
if (Children[i] != this)
|
||||
Children[i]->dump();
|
||||
|
||||
IndentLevel -= 2;
|
||||
Children[i]->dump(Indent + 2);
|
||||
#endif
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user