From: Chris Lattner <sabre@nondot.org>
Date: Sun, 4 Feb 2007 01:20:02 +0000 (+0000)
Subject: swtich vector-> smallvector, speeding up selectiondag stuff 1%
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=0ed44170752b85c3dd3bbf95459dd2668864f5ec;p=oota-llvm.git

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


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33861 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp b/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
index 2479abb9593..8e80121ab3c 100644
--- a/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
+++ b/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.