maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

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

llvm-svn: 33861
This commit is contained in:
Chris Lattner 2007-02-04 01:20:02 +00:00
parent 4b0ddb22e9
commit 94c44c96d3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
llvm/lib/CodeGen/SelectionDAG/LegalizeDAG.cpp
View File

@ -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.