mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-18 10:31:57 +00:00
Don't sort SDNodes by their addresses in SelectionDAG::dump. Instead,
just use the AllNodes order, which is at least relatively stable across runs. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53632 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
2b4f7bbd49
commit
90a7b8fba6
@ -4973,16 +4973,12 @@ static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
|
||||
|
||||
void SelectionDAG::dump() const {
|
||||
cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
|
||||
std::vector<const SDNode*> Nodes;
|
||||
for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
|
||||
I != E; ++I)
|
||||
Nodes.push_back(I);
|
||||
|
||||
std::sort(Nodes.begin(), Nodes.end());
|
||||
|
||||
for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
|
||||
if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
|
||||
DumpNodes(Nodes[i], 2, this);
|
||||
for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
|
||||
I != E; ++I) {
|
||||
const SDNode *N = I;
|
||||
if (!N->hasOneUse() && N != getRoot().Val)
|
||||
DumpNodes(N, 2, this);
|
||||
}
|
||||
|
||||
if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
|
||||
|
Loading…
Reference in New Issue
Block a user