From 94c44c96d35fb5e0fdb7090bf28b27477b0de4ab Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Sun, 4 Feb 2007 01:20:02 +0000
Subject: [PATCH] swtich vector-> smallvector, speeding up selectiondag stuff
 1%

llvm-svn: 33861
---
 llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp b/llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
index 2479abb95939..8e80121ab3c0 100644
--- a/llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
+++ b/llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
@@ -303,7 +303,7 @@ SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
 
 /// 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 @@ void SelectionDAGLegalize::LegalizeDAG() {
   // 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.