1 //===- SimplifyCFG.cpp - CFG Simplification Pass --------------------------===//
3 // This file implements dead code elimination and basic block merging.
6 // * removes basic blocks with no predecessors
7 // * merges a basic block into its predecessor if there is only one and the
8 // predecessor only has one successor.
9 // * Eliminates PHI nodes for basic blocks with a single predecessor
10 // * Eliminates a basic block that only contains an unconditional branch
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Transforms/Scalar.h"
15 #include "llvm/Transforms/Utils/Local.h"
16 #include "llvm/Module.h"
17 #include "llvm/GlobalVariable.h"
18 #include "llvm/Support/CFG.h"
19 #include "llvm/Pass.h"
20 #include "Support/StatisticReporter.h"
23 static Statistic<> NumSimpl("cfgsimplify\t- Number of blocks simplified");
26 struct CFGSimplifyPass : public FunctionPass {
27 const char *getPassName() const { return "Simplify CFG"; }
29 virtual bool runOnFunction(Function *F);
33 Pass *createCFGSimplificationPass() {
34 return new CFGSimplifyPass();
37 static bool MarkAliveBlocks(BasicBlock *BB, std::set<BasicBlock*> &Reachable) {
38 if (Reachable.count(BB)) return false;
41 bool Changed = ConstantFoldTerminator(BB);
42 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
43 MarkAliveBlocks(*SI, Reachable);
49 // It is possible that we may require multiple passes over the code to fully
52 bool CFGSimplifyPass::runOnFunction(Function *F) {
53 std::set<BasicBlock*> Reachable;
54 bool Changed = MarkAliveBlocks(F->front(), Reachable);
56 // If there are unreachable blocks in the CFG...
57 if (Reachable.size() != F->size()) {
58 assert(Reachable.size() < F->size());
59 NumSimpl += F->size()-Reachable.size();
61 // Loop over all of the basic blocks that are not reachable, dropping all of
62 // their internal references...
63 for (Function::iterator I = F->begin()+1, E = F->end(); I != E; ++I)
64 if (!Reachable.count(*I)) {
66 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI!=SE; ++SI)
67 if (Reachable.count(*SI))
68 (*SI)->removePredecessor(BB);
69 BB->dropAllReferences();
72 for (Function::iterator I = F->begin()+1; I != F->end();)
73 if (!Reachable.count(*I))
74 delete F->getBasicBlocks().remove(I);
81 bool LocalChange = true;
85 // Loop over all of the basic blocks (except the first one) and remove them
86 // if they are unneeded...
88 for (Function::iterator BBIt = F->begin()+1; BBIt != F->end(); ) {
89 if (SimplifyCFG(BBIt)) {
96 Changed |= LocalChange;