6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-22 10:33:23 +00:00
Code Issues Projects Releases Wiki Activity

a hack to allow count-aa to work with ds-aa :(

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20791 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-03-23 21:59:34 +00:00
parent cf9f20189f
commit 65512d2525
2 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
include/llvm/Analysis/DataStructure/DataStructure.h
View File

@ -112,7 +112,7 @@ protected:
/// with other global values in the DSGraphs. /// with other global values in the DSGraphs.
EquivalenceClasses<GlobalValue*> GlobalECs; EquivalenceClasses<GlobalValue*> GlobalECs;
public: public:
~BUDataStructures() { releaseMemory(); } ~BUDataStructures() { releaseMyMemory(); }
virtual bool runOnModule(Module &M); virtual bool runOnModule(Module &M);
@ -143,10 +143,9 @@ public:
/// ///
void print(std::ostream &O, const Module *M) const; void print(std::ostream &O, const Module *M) const;
/// releaseMemory - if the pass pipeline is done with this pass, we can // FIXME: Once the pass manager is straightened out, rename this to
/// release our memory... // releaseMemory.
/// void releaseMyMemory();
virtual void releaseMemory();
virtual void getAnalysisUsage(AnalysisUsage &AU) const { virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll(); AU.setPreservesAll();

2
lib/Analysis/DataStructure/BottomUpClosure.cpp
View File

@ -305,7 +305,7 @@ unsigned BUDataStructures::calculateGraphs(Function *F,
// releaseMemory - If the pass pipeline is done with this pass, we can release // releaseMemory - If the pass pipeline is done with this pass, we can release
// our memory... here... // our memory... here...
// //
void BUDataStructures::releaseMemory() { void BUDataStructures::releaseMyMemory() {
for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(), for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
E = DSInfo.end(); I != E; ++I) { E = DSInfo.end(); I != E; ++I) {
I->second->getReturnNodes().erase(I->first); I->second->getReturnNodes().erase(I->first);