RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity

s/RemoveUnreachableBlocks/RemoveUnreachableBlocksFromFn/g

Browse Source 
llvm-svn: 55965
This commit is contained in:
Devang Patel 2008-09-08 22:14:17 +00:00
parent 372133f1c8
commit 7df7366784
1 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
lib/Transforms/Scalar/SimplifyCFGPass.cpp
View File

@ -148,9 +148,10 @@ static bool MarkAliveBlocks(BasicBlock *BB,
return Changed; return Changed;
} }
/// RemoveUnreachableBlocks - Remove blocks that are not reachable, even if they /// RemoveUnreachableBlocksFromFn - Remove blocks that are not reachable, even
/// are in a dead cycle. Return true if a change was made, false otherwise. /// if they are in a dead cycle. Return true if a change was made, false
static bool RemoveUnreachableBlocks(Function &F) { /// otherwise.
static bool RemoveUnreachableBlocksFromFn(Function &F) {
SmallPtrSet<BasicBlock*, 128> Reachable; SmallPtrSet<BasicBlock*, 128> Reachable;
bool Changed = MarkAliveBlocks(F.begin(), Reachable); bool Changed = MarkAliveBlocks(F.begin(), Reachable);
@ -208,23 +209,23 @@ static bool IterativeSimplifyCFG(Function &F) {
// simplify the CFG. // simplify the CFG.
// //
bool CFGSimplifyPass::runOnFunction(Function &F) { bool CFGSimplifyPass::runOnFunction(Function &F) {
bool EverChanged = RemoveUnreachableBlocks(F); bool EverChanged = RemoveUnreachableBlocksFromFn(F);
EverChanged |= IterativeSimplifyCFG(F); EverChanged |= IterativeSimplifyCFG(F);
// If neither pass changed anything, we're done. // If neither pass changed anything, we're done.
if (!EverChanged) return false; if (!EverChanged) return false;
// IterativeSimplifyCFG can (rarely) make some loops dead. If this happens, // IterativeSimplifyCFG can (rarely) make some loops dead. If this happens,
// RemoveUnreachableBlocks is needed to nuke them, which means we should // RemoveUnreachableBlocksFromFn is needed to nuke them, which means we should
// iterate between the two optimizations. We structure the code like this to // iterate between the two optimizations. We structure the code like this to
// avoid reruning IterativeSimplifyCFG if the second pass of // avoid reruning IterativeSimplifyCFG if the second pass of
// RemoveUnreachableBlocks doesn't do anything. // RemoveUnreachableBlocksFromFn doesn't do anything.
if (!RemoveUnreachableBlocks(F)) if (!RemoveUnreachableBlocksFromFn(F))
return true; return true;
do { do {
EverChanged = IterativeSimplifyCFG(F); EverChanged = IterativeSimplifyCFG(F);
EverChanged |= RemoveUnreachableBlocks(F); EverChanged |= RemoveUnreachableBlocksFromFn(F);
} while (EverChanged); } while (EverChanged);
return true; return true;