[llvm-commits] CVS: llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp

[Chris Lattner]

Changes in directory llvm/lib/CodeGen/SelectionDAG:

LegalizeDAG.cpp updated: 1.470 -> 1.471
---
Log message:

swtich vector-> smallvector, speeding up selectiondag stuff 1%


---
Diffs of the changes:  (+2 -2)

 LegalizeDAG.cpp |    4 ++--
 1 files changed, 2 insertions(+), 2 deletions(-)


Index: llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
diff -u llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp:1.470 llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp:1.471
--- llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp:1.470	Sat Feb  3 19:17:38 2007
+++ llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp	Sat Feb  3 19:20:02 2007
@@ -303,7 +303,7 @@
 
 /// ComputeTopDownOrdering - Add the specified node to the Order list if it has
 /// not been visited yet and if all of its operands have already been visited.
-static void ComputeTopDownOrdering(SDNode *N, std::vector<SDNode*> &Order,
+static void ComputeTopDownOrdering(SDNode *N, SmallVector<SDNode*, 64> &Order,
                                    DenseMap<SDNode*, unsigned> &Visited) {
   if (++Visited[N] != N->getNumOperands())
     return;  // Haven't visited all operands yet
@@ -333,7 +333,7 @@
   // blocks.  To avoid this problem, compute an ordering of the nodes where each
   // node is only legalized after all of its operands are legalized.
   DenseMap<SDNode*, unsigned> Visited;
-  std::vector<SDNode*> Order;
+  SmallVector<SDNode*, 64> Order;
   
   // Compute ordering from all of the leaves in the graphs, those (like the
   // entry node) that have no operands.