diff options
author | Chris Lattner <sabre@nondot.org> | 2006-08-16 21:01:10 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2006-08-16 21:01:10 +0000 |
commit | 5892d47a625638a90afeb31dd4f6f80a2f9bacde (patch) | |
tree | 0a53bf3f7ca9f20db23be599d33bedadc7101d8e | |
parent | f83482dcad35ac4fcb0d387d8f84794cda70f857 (diff) |
Change the use_list to be a smallvector instead of a vector. This reduces
isel time from 6.79s to 5.53s (22%) on kc++ with a release build on ppc.
Go smallvector! :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29731 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | include/llvm/CodeGen/SelectionDAG.h | 1 | ||||
-rw-r--r-- | include/llvm/CodeGen/SelectionDAGNodes.h | 6 |
2 files changed, 4 insertions, 3 deletions
diff --git a/include/llvm/CodeGen/SelectionDAG.h b/include/llvm/CodeGen/SelectionDAG.h index 7e323902b2..b748053429 100644 --- a/include/llvm/CodeGen/SelectionDAG.h +++ b/include/llvm/CodeGen/SelectionDAG.h @@ -20,6 +20,7 @@ #include "llvm/ADT/ilist" #include <list> +#include <vector> #include <map> #include <set> #include <string> diff --git a/include/llvm/CodeGen/SelectionDAGNodes.h b/include/llvm/CodeGen/SelectionDAGNodes.h index 4ee389b848..ad4ae4a3f8 100644 --- a/include/llvm/CodeGen/SelectionDAGNodes.h +++ b/include/llvm/CodeGen/SelectionDAGNodes.h @@ -23,9 +23,9 @@ #include "llvm/Value.h" #include "llvm/ADT/GraphTraits.h" #include "llvm/ADT/iterator" +#include "llvm/ADT/SmallVector.h" #include "llvm/Support/DataTypes.h" #include <cassert> -#include <vector> namespace llvm { @@ -722,7 +722,7 @@ class SDNode { /// Uses - These are all of the SDNode's that use a value produced by this /// node. - std::vector<SDNode*> Uses; + SmallVector<SDNode*,3> Uses; // Out-of-line virtual method to give class a home. virtual void ANCHOR(); @@ -751,7 +751,7 @@ public: /// int getNodeId() const { return NodeId; } - typedef std::vector<SDNode*>::const_iterator use_iterator; + typedef SmallVector<SDNode*,3>::const_iterator use_iterator; use_iterator use_begin() const { return Uses.begin(); } use_iterator use_end() const { return Uses.end(); } |