From 90a7b8fba69503c950aa598fac2edc77123b6bf0 Mon Sep 17 00:00:00 2001 From: Dan Gohman Date: Tue, 15 Jul 2008 18:18:54 +0000 Subject: [PATCH] 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 --- lib/CodeGen/SelectionDAG/SelectionDAG.cpp | 14 +++++--------- 1 file changed, 5 insertions(+), 9 deletions(-) diff --git a/lib/CodeGen/SelectionDAG/SelectionDAG.cpp b/lib/CodeGen/SelectionDAG/SelectionDAG.cpp index cc1acf47db7..4c951ff118d 100644 --- a/lib/CodeGen/SelectionDAG/SelectionDAG.cpp +++ b/lib/CodeGen/SelectionDAG/SelectionDAG.cpp @@ -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 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); -- 2.34.1