diff options
| author | Chris Lattner <sabre@nondot.org> | 2005-01-30 23:51:02 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2005-01-30 23:51:02 +0000 |
| commit | a9548d9fd99beea7d5e4dc6619cb5569b54620c0 (patch) | |
| tree | 9f87a41c58c91a4329843364d64c54d788e5171e /include/llvm/Analysis/DataStructure/DSSupport.h | |
| parent | 7b2a5270b7613a12fb0b3c12ccdef26367fb8339 (diff) | |
* Make some methods more const correct.
* Change the FunctionCalls and AuxFunctionCalls vectors into std::lists.
This makes many operations on these lists much more natural, and avoids
*exteremely* expensive copying of DSCallSites (e.g. moving nodes around
between lists, erasing a node from not the end of the vector, etc).
With a profile build of analyze, this speeds up BU DS from 25.14s to
12.59s on 176.gcc. I expect that it would help TD even more, but I don't
have data for it.
This effectively eliminates removeIdenticalCalls and children from the
profile, going from 6.53 to 0.27s.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19939 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Analysis/DataStructure/DSSupport.h')
| -rw-r--r-- | include/llvm/Analysis/DataStructure/DSSupport.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/llvm/Analysis/DataStructure/DSSupport.h b/include/llvm/Analysis/DataStructure/DSSupport.h index 07fe159781..08bb3ee17e 100644 --- a/include/llvm/Analysis/DataStructure/DSSupport.h +++ b/include/llvm/Analysis/DataStructure/DSSupport.h @@ -289,7 +289,7 @@ public: /// DSNodes, marking any nodes which are reachable. All reachable nodes it /// adds to the set, which allows it to only traverse visited nodes once. /// - void markReachableNodes(hash_set<DSNode*> &Nodes); + void markReachableNodes(hash_set<const DSNode*> &Nodes) const; bool operator<(const DSCallSite &CS) const { if (isDirectCall()) { // This must sort by callee first! |