diff options
| -rw-r--r-- | lib/CodeGen/SelectionDAG/LegalizeDAG.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp b/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp index 2479abb959..8e80121ab3 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. |