1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00

Don't leak all of the Loop objects created...

llvm-svn: 2196
This commit is contained in:
Chris Lattner 2002-04-09 05:43:19 +00:00
parent dbc90d1c0c
commit 0a8a112014
2 changed files with 18 additions and 3 deletions

View File

@ -46,10 +46,14 @@ public:
private:
friend class LoopInfo;
inline Loop(const BasicBlock *BB) { Blocks.push_back(BB); LoopDepth = 0; }
~Loop() {
for (unsigned i = 0, e = SubLoops.size(); i != e; ++i)
delete SubLoops[i];
}
void setLoopDepth(unsigned Level) {
LoopDepth = Level;
for (unsigned i = 0; i < SubLoops.size(); ++i)
for (unsigned i = 0, e = SubLoops.size(); i != e; ++i)
SubLoops[i]->setLoopDepth(Level+1);
}
};
@ -69,6 +73,7 @@ public:
// LoopInfo ctor - Calculate the natural loop information for a CFG
LoopInfo(AnalysisID id) { assert(id == ID); }
~LoopInfo() { releaseMemory(); }
const std::vector<Loop*> &getTopLevelLoops() const { return TopLevelLoops; }
@ -103,6 +108,8 @@ public:
// runOnMethod - Pass framework implementation
virtual bool runOnMethod(Function *F);
virtual void releaseMemory();
// getAnalysisUsageInfo - Provide loop info, require dominator set
//
virtual void getAnalysisUsageInfo(Pass::AnalysisSet &Requires,

View File

@ -22,13 +22,21 @@ bool cfg::Loop::contains(const BasicBlock *BB) const {
return find(Blocks.begin(), Blocks.end(), BB) != Blocks.end();
}
void cfg::LoopInfo::releaseMemory() {
for (std::vector<Loop*>::iterator I = TopLevelLoops.begin(),
E = TopLevelLoops.end(); I != E; ++I)
delete *I; // Delete all of the loops...
BBMap.clear(); // Reset internal state of analysis
TopLevelLoops.clear();
}
//===----------------------------------------------------------------------===//
// cfg::LoopInfo implementation
//
bool cfg::LoopInfo::runOnMethod(Function *F) {
BBMap.clear(); // Reset internal state of analysis
TopLevelLoops.clear();
releaseMemory();
Calculate(getAnalysis<DominatorSet>()); // Update
return false;
}