1 //===- SimplifyCFG.cpp - Code to perform CFG simplification ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Peephole optimize the CFG.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "simplifycfg"
15 #include "llvm/Transforms/Utils/Local.h"
16 #include "llvm/Constants.h"
17 #include "llvm/Instructions.h"
18 #include "llvm/IntrinsicInst.h"
19 #include "llvm/Type.h"
20 #include "llvm/DerivedTypes.h"
21 #include "llvm/Support/CFG.h"
22 #include "llvm/Support/Debug.h"
23 #include "llvm/Analysis/ConstantFolding.h"
24 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
25 #include "llvm/ADT/SmallVector.h"
26 #include "llvm/ADT/SmallPtrSet.h"
27 #include "llvm/ADT/Statistic.h"
34 STATISTIC(NumSpeculations, "Number of speculative executed instructions");
36 /// SafeToMergeTerminators - Return true if it is safe to merge these two
37 /// terminator instructions together.
39 static bool SafeToMergeTerminators(TerminatorInst *SI1, TerminatorInst *SI2) {
40 if (SI1 == SI2) return false; // Can't merge with self!
42 // It is not safe to merge these two switch instructions if they have a common
43 // successor, and if that successor has a PHI node, and if *that* PHI node has
44 // conflicting incoming values from the two switch blocks.
45 BasicBlock *SI1BB = SI1->getParent();
46 BasicBlock *SI2BB = SI2->getParent();
47 SmallPtrSet<BasicBlock*, 16> SI1Succs(succ_begin(SI1BB), succ_end(SI1BB));
49 for (succ_iterator I = succ_begin(SI2BB), E = succ_end(SI2BB); I != E; ++I)
50 if (SI1Succs.count(*I))
51 for (BasicBlock::iterator BBI = (*I)->begin();
52 isa<PHINode>(BBI); ++BBI) {
53 PHINode *PN = cast<PHINode>(BBI);
54 if (PN->getIncomingValueForBlock(SI1BB) !=
55 PN->getIncomingValueForBlock(SI2BB))
62 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
63 /// now be entries in it from the 'NewPred' block. The values that will be
64 /// flowing into the PHI nodes will be the same as those coming in from
65 /// ExistPred, an existing predecessor of Succ.
66 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
67 BasicBlock *ExistPred) {
68 assert(std::find(succ_begin(ExistPred), succ_end(ExistPred), Succ) !=
69 succ_end(ExistPred) && "ExistPred is not a predecessor of Succ!");
70 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
73 for (BasicBlock::iterator I = Succ->begin();
74 (PN = dyn_cast<PHINode>(I)); ++I)
75 PN->addIncoming(PN->getIncomingValueForBlock(ExistPred), NewPred);
78 /// CanPropagatePredecessorsForPHIs - Return true if we can fold BB, an
79 /// almost-empty BB ending in an unconditional branch to Succ, into succ.
81 /// Assumption: Succ is the single successor for BB.
83 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
84 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
86 DOUT << "Looking to fold " << BB->getNameStart() << " into "
87 << Succ->getNameStart() << "\n";
88 // Shortcut, if there is only a single predecessor is must be BB and merging
90 if (Succ->getSinglePredecessor()) return true;
92 typedef SmallPtrSet<Instruction*, 16> InstrSet;
95 // Make a list of all phi nodes in BB
96 BasicBlock::iterator BBI = BB->begin();
97 while (isa<PHINode>(*BBI)) BBPHIs.insert(BBI++);
99 // Make a list of the predecessors of BB
100 typedef SmallPtrSet<BasicBlock*, 16> BlockSet;
101 BlockSet BBPreds(pred_begin(BB), pred_end(BB));
103 // Use that list to make another list of common predecessors of BB and Succ
104 BlockSet CommonPreds;
105 for (pred_iterator PI = pred_begin(Succ), PE = pred_end(Succ);
107 if (BBPreds.count(*PI))
108 CommonPreds.insert(*PI);
110 // Shortcut, if there are no common predecessors, merging is always safe
111 if (CommonPreds.empty())
114 // Look at all the phi nodes in Succ, to see if they present a conflict when
115 // merging these blocks
116 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
117 PHINode *PN = cast<PHINode>(I);
119 // If the incoming value from BB is again a PHINode in
120 // BB which has the same incoming value for *PI as PN does, we can
121 // merge the phi nodes and then the blocks can still be merged
122 PHINode *BBPN = dyn_cast<PHINode>(PN->getIncomingValueForBlock(BB));
123 if (BBPN && BBPN->getParent() == BB) {
124 for (BlockSet::iterator PI = CommonPreds.begin(), PE = CommonPreds.end();
126 if (BBPN->getIncomingValueForBlock(*PI)
127 != PN->getIncomingValueForBlock(*PI)) {
128 DOUT << "Can't fold, phi node " << *PN->getNameStart() << " in "
129 << Succ->getNameStart() << " is conflicting with "
130 << BBPN->getNameStart() << " with regard to common predecessor "
131 << (*PI)->getNameStart() << "\n";
135 // Remove this phinode from the list of phis in BB, since it has been
139 Value* Val = PN->getIncomingValueForBlock(BB);
140 for (BlockSet::iterator PI = CommonPreds.begin(), PE = CommonPreds.end();
142 // See if the incoming value for the common predecessor is equal to the
143 // one for BB, in which case this phi node will not prevent the merging
145 if (Val != PN->getIncomingValueForBlock(*PI)) {
146 DOUT << "Can't fold, phi node " << *PN->getNameStart() << " in "
147 << Succ->getNameStart() << " is conflicting with regard to common "
148 << "predecessor " << (*PI)->getNameStart() << "\n";
155 // If there are any other phi nodes in BB that don't have a phi node in Succ
156 // to merge with, they must be moved to Succ completely. However, for any
157 // predecessors of Succ, branches will be added to the phi node that just
158 // point to itself. So, for any common predecessors, this must not cause
160 for (InstrSet::iterator I = BBPHIs.begin(), E = BBPHIs.end();
162 PHINode *PN = cast<PHINode>(*I);
163 for (BlockSet::iterator PI = CommonPreds.begin(), PE = CommonPreds.end();
165 if (PN->getIncomingValueForBlock(*PI) != PN) {
166 DOUT << "Can't fold, phi node " << *PN->getNameStart() << " in "
167 << BB->getNameStart() << " is conflicting with regard to common "
168 << "predecessor " << (*PI)->getNameStart() << "\n";
176 /// TryToSimplifyUncondBranchFromEmptyBlock - BB contains an unconditional
177 /// branch to Succ, and contains no instructions other than PHI nodes and the
178 /// branch. If possible, eliminate BB.
179 static bool TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB,
181 // Check to see if merging these blocks would cause conflicts for any of the
182 // phi nodes in BB or Succ. If not, we can safely merge.
183 if (!CanPropagatePredecessorsForPHIs(BB, Succ)) return false;
185 DOUT << "Killing Trivial BB: \n" << *BB;
187 if (isa<PHINode>(Succ->begin())) {
188 // If there is more than one pred of succ, and there are PHI nodes in
189 // the successor, then we need to add incoming edges for the PHI nodes
191 const SmallVector<BasicBlock*, 16> BBPreds(pred_begin(BB), pred_end(BB));
193 // Loop over all of the PHI nodes in the successor of BB.
194 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
195 PHINode *PN = cast<PHINode>(I);
196 Value *OldVal = PN->removeIncomingValue(BB, false);
197 assert(OldVal && "No entry in PHI for Pred BB!");
199 // If this incoming value is one of the PHI nodes in BB, the new entries
200 // in the PHI node are the entries from the old PHI.
201 if (isa<PHINode>(OldVal) && cast<PHINode>(OldVal)->getParent() == BB) {
202 PHINode *OldValPN = cast<PHINode>(OldVal);
203 for (unsigned i = 0, e = OldValPN->getNumIncomingValues(); i != e; ++i)
204 // Note that, since we are merging phi nodes and BB and Succ might
205 // have common predecessors, we could end up with a phi node with
206 // identical incoming branches. This will be cleaned up later (and
207 // will trigger asserts if we try to clean it up now, without also
208 // simplifying the corresponding conditional branch).
209 PN->addIncoming(OldValPN->getIncomingValue(i),
210 OldValPN->getIncomingBlock(i));
212 // Add an incoming value for each of the new incoming values.
213 for (unsigned i = 0, e = BBPreds.size(); i != e; ++i)
214 PN->addIncoming(OldVal, BBPreds[i]);
219 if (isa<PHINode>(&BB->front())) {
220 SmallVector<BasicBlock*, 16>
221 OldSuccPreds(pred_begin(Succ), pred_end(Succ));
223 // Move all PHI nodes in BB to Succ if they are alive, otherwise
225 while (PHINode *PN = dyn_cast<PHINode>(&BB->front())) {
226 if (PN->use_empty()) {
227 // Just remove the dead phi. This happens if Succ's PHIs were the only
228 // users of the PHI nodes.
229 PN->eraseFromParent();
233 // The instruction is alive, so this means that BB must dominate all
234 // predecessors of Succ (Since all uses of the PN are after its
235 // definition, so in Succ or a block dominated by Succ. If a predecessor
236 // of Succ would not be dominated by BB, PN would violate the def before
237 // use SSA demand). Therefore, we can simply move the phi node to the
239 Succ->getInstList().splice(Succ->begin(),
240 BB->getInstList(), BB->begin());
242 // We need to add new entries for the PHI node to account for
243 // predecessors of Succ that the PHI node does not take into
244 // account. At this point, since we know that BB dominated succ and all
245 // of its predecessors, this means that we should any newly added
246 // incoming edges should use the PHI node itself as the value for these
247 // edges, because they are loop back edges.
248 for (unsigned i = 0, e = OldSuccPreds.size(); i != e; ++i)
249 if (OldSuccPreds[i] != BB)
250 PN->addIncoming(PN, OldSuccPreds[i]);
254 // Everything that jumped to BB now goes to Succ.
255 BB->replaceAllUsesWith(Succ);
256 if (!Succ->hasName()) Succ->takeName(BB);
257 BB->eraseFromParent(); // Delete the old basic block.
261 /// GetIfCondition - Given a basic block (BB) with two predecessors (and
262 /// presumably PHI nodes in it), check to see if the merge at this block is due
263 /// to an "if condition". If so, return the boolean condition that determines
264 /// which entry into BB will be taken. Also, return by references the block
265 /// that will be entered from if the condition is true, and the block that will
266 /// be entered if the condition is false.
269 static Value *GetIfCondition(BasicBlock *BB,
270 BasicBlock *&IfTrue, BasicBlock *&IfFalse) {
271 assert(std::distance(pred_begin(BB), pred_end(BB)) == 2 &&
272 "Function can only handle blocks with 2 predecessors!");
273 BasicBlock *Pred1 = *pred_begin(BB);
274 BasicBlock *Pred2 = *++pred_begin(BB);
276 // We can only handle branches. Other control flow will be lowered to
277 // branches if possible anyway.
278 if (!isa<BranchInst>(Pred1->getTerminator()) ||
279 !isa<BranchInst>(Pred2->getTerminator()))
281 BranchInst *Pred1Br = cast<BranchInst>(Pred1->getTerminator());
282 BranchInst *Pred2Br = cast<BranchInst>(Pred2->getTerminator());
284 // Eliminate code duplication by ensuring that Pred1Br is conditional if
286 if (Pred2Br->isConditional()) {
287 // If both branches are conditional, we don't have an "if statement". In
288 // reality, we could transform this case, but since the condition will be
289 // required anyway, we stand no chance of eliminating it, so the xform is
290 // probably not profitable.
291 if (Pred1Br->isConditional())
294 std::swap(Pred1, Pred2);
295 std::swap(Pred1Br, Pred2Br);
298 if (Pred1Br->isConditional()) {
299 // If we found a conditional branch predecessor, make sure that it branches
300 // to BB and Pred2Br. If it doesn't, this isn't an "if statement".
301 if (Pred1Br->getSuccessor(0) == BB &&
302 Pred1Br->getSuccessor(1) == Pred2) {
305 } else if (Pred1Br->getSuccessor(0) == Pred2 &&
306 Pred1Br->getSuccessor(1) == BB) {
310 // We know that one arm of the conditional goes to BB, so the other must
311 // go somewhere unrelated, and this must not be an "if statement".
315 // The only thing we have to watch out for here is to make sure that Pred2
316 // doesn't have incoming edges from other blocks. If it does, the condition
317 // doesn't dominate BB.
318 if (++pred_begin(Pred2) != pred_end(Pred2))
321 return Pred1Br->getCondition();
324 // Ok, if we got here, both predecessors end with an unconditional branch to
325 // BB. Don't panic! If both blocks only have a single (identical)
326 // predecessor, and THAT is a conditional branch, then we're all ok!
327 if (pred_begin(Pred1) == pred_end(Pred1) ||
328 ++pred_begin(Pred1) != pred_end(Pred1) ||
329 pred_begin(Pred2) == pred_end(Pred2) ||
330 ++pred_begin(Pred2) != pred_end(Pred2) ||
331 *pred_begin(Pred1) != *pred_begin(Pred2))
334 // Otherwise, if this is a conditional branch, then we can use it!
335 BasicBlock *CommonPred = *pred_begin(Pred1);
336 if (BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator())) {
337 assert(BI->isConditional() && "Two successors but not conditional?");
338 if (BI->getSuccessor(0) == Pred1) {
345 return BI->getCondition();
351 /// DominatesMergePoint - If we have a merge point of an "if condition" as
352 /// accepted above, return true if the specified value dominates the block. We
353 /// don't handle the true generality of domination here, just a special case
354 /// which works well enough for us.
356 /// If AggressiveInsts is non-null, and if V does not dominate BB, we check to
357 /// see if V (which must be an instruction) is cheap to compute and is
358 /// non-trapping. If both are true, the instruction is inserted into the set
359 /// and true is returned.
360 static bool DominatesMergePoint(Value *V, BasicBlock *BB,
361 std::set<Instruction*> *AggressiveInsts) {
362 Instruction *I = dyn_cast<Instruction>(V);
364 // Non-instructions all dominate instructions, but not all constantexprs
365 // can be executed unconditionally.
366 if (ConstantExpr *C = dyn_cast<ConstantExpr>(V))
371 BasicBlock *PBB = I->getParent();
373 // We don't want to allow weird loops that might have the "if condition" in
374 // the bottom of this block.
375 if (PBB == BB) return false;
377 // If this instruction is defined in a block that contains an unconditional
378 // branch to BB, then it must be in the 'conditional' part of the "if
380 if (BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()))
381 if (BI->isUnconditional() && BI->getSuccessor(0) == BB) {
382 if (!AggressiveInsts) return false;
383 // Okay, it looks like the instruction IS in the "condition". Check to
384 // see if its a cheap instruction to unconditionally compute, and if it
385 // only uses stuff defined outside of the condition. If so, hoist it out.
386 switch (I->getOpcode()) {
387 default: return false; // Cannot hoist this out safely.
388 case Instruction::Load:
389 // We can hoist loads that are non-volatile and obviously cannot trap.
390 if (cast<LoadInst>(I)->isVolatile())
392 // FIXME: A computation of a constant can trap!
393 if (!isa<AllocaInst>(I->getOperand(0)) &&
394 !isa<Constant>(I->getOperand(0)))
397 // Finally, we have to check to make sure there are no instructions
398 // before the load in its basic block, as we are going to hoist the loop
399 // out to its predecessor.
400 if (PBB->begin() != BasicBlock::iterator(I))
403 case Instruction::Add:
404 case Instruction::Sub:
405 case Instruction::And:
406 case Instruction::Or:
407 case Instruction::Xor:
408 case Instruction::Shl:
409 case Instruction::LShr:
410 case Instruction::AShr:
411 case Instruction::ICmp:
412 case Instruction::FCmp:
413 if (I->getOperand(0)->getType()->isFPOrFPVector())
414 return false; // FP arithmetic might trap.
415 break; // These are all cheap and non-trapping instructions.
418 // Okay, we can only really hoist these out if their operands are not
419 // defined in the conditional region.
420 for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i)
421 if (!DominatesMergePoint(*i, BB, 0))
423 // Okay, it's safe to do this! Remember this instruction.
424 AggressiveInsts->insert(I);
430 /// GatherConstantSetEQs - Given a potentially 'or'd together collection of
431 /// icmp_eq instructions that compare a value against a constant, return the
432 /// value being compared, and stick the constant into the Values vector.
433 static Value *GatherConstantSetEQs(Value *V, std::vector<ConstantInt*> &Values){
434 if (Instruction *Inst = dyn_cast<Instruction>(V)) {
435 if (Inst->getOpcode() == Instruction::ICmp &&
436 cast<ICmpInst>(Inst)->getPredicate() == ICmpInst::ICMP_EQ) {
437 if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(1))) {
439 return Inst->getOperand(0);
440 } else if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(0))) {
442 return Inst->getOperand(1);
444 } else if (Inst->getOpcode() == Instruction::Or) {
445 if (Value *LHS = GatherConstantSetEQs(Inst->getOperand(0), Values))
446 if (Value *RHS = GatherConstantSetEQs(Inst->getOperand(1), Values))
454 /// GatherConstantSetNEs - Given a potentially 'and'd together collection of
455 /// setne instructions that compare a value against a constant, return the value
456 /// being compared, and stick the constant into the Values vector.
457 static Value *GatherConstantSetNEs(Value *V, std::vector<ConstantInt*> &Values){
458 if (Instruction *Inst = dyn_cast<Instruction>(V)) {
459 if (Inst->getOpcode() == Instruction::ICmp &&
460 cast<ICmpInst>(Inst)->getPredicate() == ICmpInst::ICMP_NE) {
461 if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(1))) {
463 return Inst->getOperand(0);
464 } else if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(0))) {
466 return Inst->getOperand(1);
468 } else if (Inst->getOpcode() == Instruction::And) {
469 if (Value *LHS = GatherConstantSetNEs(Inst->getOperand(0), Values))
470 if (Value *RHS = GatherConstantSetNEs(Inst->getOperand(1), Values))
478 /// GatherValueComparisons - If the specified Cond is an 'and' or 'or' of a
479 /// bunch of comparisons of one value against constants, return the value and
480 /// the constants being compared.
481 static bool GatherValueComparisons(Instruction *Cond, Value *&CompVal,
482 std::vector<ConstantInt*> &Values) {
483 if (Cond->getOpcode() == Instruction::Or) {
484 CompVal = GatherConstantSetEQs(Cond, Values);
486 // Return true to indicate that the condition is true if the CompVal is
487 // equal to one of the constants.
489 } else if (Cond->getOpcode() == Instruction::And) {
490 CompVal = GatherConstantSetNEs(Cond, Values);
492 // Return false to indicate that the condition is false if the CompVal is
493 // equal to one of the constants.
499 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) {
500 Instruction* Cond = 0;
501 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
502 Cond = dyn_cast<Instruction>(SI->getCondition());
503 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
504 if (BI->isConditional())
505 Cond = dyn_cast<Instruction>(BI->getCondition());
508 TI->eraseFromParent();
509 if (Cond) RecursivelyDeleteTriviallyDeadInstructions(Cond);
512 /// isValueEqualityComparison - Return true if the specified terminator checks
513 /// to see if a value is equal to constant integer value.
514 static Value *isValueEqualityComparison(TerminatorInst *TI) {
515 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
516 // Do not permit merging of large switch instructions into their
517 // predecessors unless there is only one predecessor.
518 if (SI->getNumSuccessors() * std::distance(pred_begin(SI->getParent()),
519 pred_end(SI->getParent())) > 128)
522 return SI->getCondition();
524 if (BranchInst *BI = dyn_cast<BranchInst>(TI))
525 if (BI->isConditional() && BI->getCondition()->hasOneUse())
526 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition()))
527 if ((ICI->getPredicate() == ICmpInst::ICMP_EQ ||
528 ICI->getPredicate() == ICmpInst::ICMP_NE) &&
529 isa<ConstantInt>(ICI->getOperand(1)))
530 return ICI->getOperand(0);
534 /// GetValueEqualityComparisonCases - Given a value comparison instruction,
535 /// decode all of the 'cases' that it represents and return the 'default' block.
537 GetValueEqualityComparisonCases(TerminatorInst *TI,
538 std::vector<std::pair<ConstantInt*,
539 BasicBlock*> > &Cases) {
540 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
541 Cases.reserve(SI->getNumCases());
542 for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i)
543 Cases.push_back(std::make_pair(SI->getCaseValue(i), SI->getSuccessor(i)));
544 return SI->getDefaultDest();
547 BranchInst *BI = cast<BranchInst>(TI);
548 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition());
549 Cases.push_back(std::make_pair(cast<ConstantInt>(ICI->getOperand(1)),
550 BI->getSuccessor(ICI->getPredicate() ==
551 ICmpInst::ICMP_NE)));
552 return BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_EQ);
556 /// EliminateBlockCases - Given a vector of bb/value pairs, remove any entries
557 /// in the list that match the specified block.
558 static void EliminateBlockCases(BasicBlock *BB,
559 std::vector<std::pair<ConstantInt*, BasicBlock*> > &Cases) {
560 for (unsigned i = 0, e = Cases.size(); i != e; ++i)
561 if (Cases[i].second == BB) {
562 Cases.erase(Cases.begin()+i);
567 /// ValuesOverlap - Return true if there are any keys in C1 that exist in C2 as
570 ValuesOverlap(std::vector<std::pair<ConstantInt*, BasicBlock*> > &C1,
571 std::vector<std::pair<ConstantInt*, BasicBlock*> > &C2) {
572 std::vector<std::pair<ConstantInt*, BasicBlock*> > *V1 = &C1, *V2 = &C2;
574 // Make V1 be smaller than V2.
575 if (V1->size() > V2->size())
578 if (V1->size() == 0) return false;
579 if (V1->size() == 1) {
581 ConstantInt *TheVal = (*V1)[0].first;
582 for (unsigned i = 0, e = V2->size(); i != e; ++i)
583 if (TheVal == (*V2)[i].first)
587 // Otherwise, just sort both lists and compare element by element.
588 std::sort(V1->begin(), V1->end());
589 std::sort(V2->begin(), V2->end());
590 unsigned i1 = 0, i2 = 0, e1 = V1->size(), e2 = V2->size();
591 while (i1 != e1 && i2 != e2) {
592 if ((*V1)[i1].first == (*V2)[i2].first)
594 if ((*V1)[i1].first < (*V2)[i2].first)
602 /// SimplifyEqualityComparisonWithOnlyPredecessor - If TI is known to be a
603 /// terminator instruction and its block is known to only have a single
604 /// predecessor block, check to see if that predecessor is also a value
605 /// comparison with the same value, and if that comparison determines the
606 /// outcome of this comparison. If so, simplify TI. This does a very limited
607 /// form of jump threading.
608 static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
610 Value *PredVal = isValueEqualityComparison(Pred->getTerminator());
611 if (!PredVal) return false; // Not a value comparison in predecessor.
613 Value *ThisVal = isValueEqualityComparison(TI);
614 assert(ThisVal && "This isn't a value comparison!!");
615 if (ThisVal != PredVal) return false; // Different predicates.
617 // Find out information about when control will move from Pred to TI's block.
618 std::vector<std::pair<ConstantInt*, BasicBlock*> > PredCases;
619 BasicBlock *PredDef = GetValueEqualityComparisonCases(Pred->getTerminator(),
621 EliminateBlockCases(PredDef, PredCases); // Remove default from cases.
623 // Find information about how control leaves this block.
624 std::vector<std::pair<ConstantInt*, BasicBlock*> > ThisCases;
625 BasicBlock *ThisDef = GetValueEqualityComparisonCases(TI, ThisCases);
626 EliminateBlockCases(ThisDef, ThisCases); // Remove default from cases.
628 // If TI's block is the default block from Pred's comparison, potentially
629 // simplify TI based on this knowledge.
630 if (PredDef == TI->getParent()) {
631 // If we are here, we know that the value is none of those cases listed in
632 // PredCases. If there are any cases in ThisCases that are in PredCases, we
634 if (ValuesOverlap(PredCases, ThisCases)) {
635 if (isa<BranchInst>(TI)) {
636 // Okay, one of the successors of this condbr is dead. Convert it to a
638 assert(ThisCases.size() == 1 && "Branch can only have one case!");
639 // Insert the new branch.
640 Instruction *NI = BranchInst::Create(ThisDef, TI);
642 // Remove PHI node entries for the dead edge.
643 ThisCases[0].second->removePredecessor(TI->getParent());
645 DOUT << "Threading pred instr: " << *Pred->getTerminator()
646 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n";
648 EraseTerminatorInstAndDCECond(TI);
652 SwitchInst *SI = cast<SwitchInst>(TI);
653 // Okay, TI has cases that are statically dead, prune them away.
654 SmallPtrSet<Constant*, 16> DeadCases;
655 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
656 DeadCases.insert(PredCases[i].first);
658 DOUT << "Threading pred instr: " << *Pred->getTerminator()
659 << "Through successor TI: " << *TI;
661 for (unsigned i = SI->getNumCases()-1; i != 0; --i)
662 if (DeadCases.count(SI->getCaseValue(i))) {
663 SI->getSuccessor(i)->removePredecessor(TI->getParent());
667 DOUT << "Leaving: " << *TI << "\n";
673 // Otherwise, TI's block must correspond to some matched value. Find out
674 // which value (or set of values) this is.
675 ConstantInt *TIV = 0;
676 BasicBlock *TIBB = TI->getParent();
677 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
678 if (PredCases[i].second == TIBB) {
680 TIV = PredCases[i].first;
682 return false; // Cannot handle multiple values coming to this block.
684 assert(TIV && "No edge from pred to succ?");
686 // Okay, we found the one constant that our value can be if we get into TI's
687 // BB. Find out which successor will unconditionally be branched to.
688 BasicBlock *TheRealDest = 0;
689 for (unsigned i = 0, e = ThisCases.size(); i != e; ++i)
690 if (ThisCases[i].first == TIV) {
691 TheRealDest = ThisCases[i].second;
695 // If not handled by any explicit cases, it is handled by the default case.
696 if (TheRealDest == 0) TheRealDest = ThisDef;
698 // Remove PHI node entries for dead edges.
699 BasicBlock *CheckEdge = TheRealDest;
700 for (succ_iterator SI = succ_begin(TIBB), e = succ_end(TIBB); SI != e; ++SI)
701 if (*SI != CheckEdge)
702 (*SI)->removePredecessor(TIBB);
706 // Insert the new branch.
707 Instruction *NI = BranchInst::Create(TheRealDest, TI);
709 DOUT << "Threading pred instr: " << *Pred->getTerminator()
710 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n";
712 EraseTerminatorInstAndDCECond(TI);
718 /// FoldValueComparisonIntoPredecessors - The specified terminator is a value
719 /// equality comparison instruction (either a switch or a branch on "X == c").
720 /// See if any of the predecessors of the terminator block are value comparisons
721 /// on the same value. If so, and if safe to do so, fold them together.
722 static bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI) {
723 BasicBlock *BB = TI->getParent();
724 Value *CV = isValueEqualityComparison(TI); // CondVal
725 assert(CV && "Not a comparison?");
726 bool Changed = false;
728 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
729 while (!Preds.empty()) {
730 BasicBlock *Pred = Preds.back();
733 // See if the predecessor is a comparison with the same value.
734 TerminatorInst *PTI = Pred->getTerminator();
735 Value *PCV = isValueEqualityComparison(PTI); // PredCondVal
737 if (PCV == CV && SafeToMergeTerminators(TI, PTI)) {
738 // Figure out which 'cases' to copy from SI to PSI.
739 std::vector<std::pair<ConstantInt*, BasicBlock*> > BBCases;
740 BasicBlock *BBDefault = GetValueEqualityComparisonCases(TI, BBCases);
742 std::vector<std::pair<ConstantInt*, BasicBlock*> > PredCases;
743 BasicBlock *PredDefault = GetValueEqualityComparisonCases(PTI, PredCases);
745 // Based on whether the default edge from PTI goes to BB or not, fill in
746 // PredCases and PredDefault with the new switch cases we would like to
748 SmallVector<BasicBlock*, 8> NewSuccessors;
750 if (PredDefault == BB) {
751 // If this is the default destination from PTI, only the edges in TI
752 // that don't occur in PTI, or that branch to BB will be activated.
753 std::set<ConstantInt*> PTIHandled;
754 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
755 if (PredCases[i].second != BB)
756 PTIHandled.insert(PredCases[i].first);
758 // The default destination is BB, we don't need explicit targets.
759 std::swap(PredCases[i], PredCases.back());
760 PredCases.pop_back();
764 // Reconstruct the new switch statement we will be building.
765 if (PredDefault != BBDefault) {
766 PredDefault->removePredecessor(Pred);
767 PredDefault = BBDefault;
768 NewSuccessors.push_back(BBDefault);
770 for (unsigned i = 0, e = BBCases.size(); i != e; ++i)
771 if (!PTIHandled.count(BBCases[i].first) &&
772 BBCases[i].second != BBDefault) {
773 PredCases.push_back(BBCases[i]);
774 NewSuccessors.push_back(BBCases[i].second);
778 // If this is not the default destination from PSI, only the edges
779 // in SI that occur in PSI with a destination of BB will be
781 std::set<ConstantInt*> PTIHandled;
782 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
783 if (PredCases[i].second == BB) {
784 PTIHandled.insert(PredCases[i].first);
785 std::swap(PredCases[i], PredCases.back());
786 PredCases.pop_back();
790 // Okay, now we know which constants were sent to BB from the
791 // predecessor. Figure out where they will all go now.
792 for (unsigned i = 0, e = BBCases.size(); i != e; ++i)
793 if (PTIHandled.count(BBCases[i].first)) {
794 // If this is one we are capable of getting...
795 PredCases.push_back(BBCases[i]);
796 NewSuccessors.push_back(BBCases[i].second);
797 PTIHandled.erase(BBCases[i].first);// This constant is taken care of
800 // If there are any constants vectored to BB that TI doesn't handle,
801 // they must go to the default destination of TI.
802 for (std::set<ConstantInt*>::iterator I = PTIHandled.begin(),
803 E = PTIHandled.end(); I != E; ++I) {
804 PredCases.push_back(std::make_pair(*I, BBDefault));
805 NewSuccessors.push_back(BBDefault);
809 // Okay, at this point, we know which new successor Pred will get. Make
810 // sure we update the number of entries in the PHI nodes for these
812 for (unsigned i = 0, e = NewSuccessors.size(); i != e; ++i)
813 AddPredecessorToBlock(NewSuccessors[i], Pred, BB);
815 // Now that the successors are updated, create the new Switch instruction.
816 SwitchInst *NewSI = SwitchInst::Create(CV, PredDefault,
817 PredCases.size(), PTI);
818 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
819 NewSI->addCase(PredCases[i].first, PredCases[i].second);
821 EraseTerminatorInstAndDCECond(PTI);
823 // Okay, last check. If BB is still a successor of PSI, then we must
824 // have an infinite loop case. If so, add an infinitely looping block
825 // to handle the case to preserve the behavior of the code.
826 BasicBlock *InfLoopBlock = 0;
827 for (unsigned i = 0, e = NewSI->getNumSuccessors(); i != e; ++i)
828 if (NewSI->getSuccessor(i) == BB) {
829 if (InfLoopBlock == 0) {
830 // Insert it at the end of the function, because it's either code,
831 // or it won't matter if it's hot. :)
832 InfLoopBlock = BasicBlock::Create("infloop", BB->getParent());
833 BranchInst::Create(InfLoopBlock, InfLoopBlock);
835 NewSI->setSuccessor(i, InfLoopBlock);
844 /// HoistThenElseCodeToIf - Given a conditional branch that goes to BB1 and
845 /// BB2, hoist any common code in the two blocks up into the branch block. The
846 /// caller of this function guarantees that BI's block dominates BB1 and BB2.
847 static bool HoistThenElseCodeToIf(BranchInst *BI) {
848 // This does very trivial matching, with limited scanning, to find identical
849 // instructions in the two blocks. In particular, we don't want to get into
850 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
851 // such, we currently just scan for obviously identical instructions in an
853 BasicBlock *BB1 = BI->getSuccessor(0); // The true destination.
854 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination
856 Instruction *I1 = BB1->begin(), *I2 = BB2->begin();
857 if (I1->getOpcode() != I2->getOpcode() || isa<PHINode>(I1) ||
858 isa<InvokeInst>(I1) || !I1->isIdenticalTo(I2))
861 // If we get here, we can hoist at least one instruction.
862 BasicBlock *BIParent = BI->getParent();
865 // If we are hoisting the terminator instruction, don't move one (making a
866 // broken BB), instead clone it, and remove BI.
867 if (isa<TerminatorInst>(I1))
868 goto HoistTerminator;
870 // For a normal instruction, we just move one to right before the branch,
871 // then replace all uses of the other with the first. Finally, we remove
872 // the now redundant second instruction.
873 BIParent->getInstList().splice(BI, BB1->getInstList(), I1);
874 if (!I2->use_empty())
875 I2->replaceAllUsesWith(I1);
876 BB2->getInstList().erase(I2);
880 } while (I1->getOpcode() == I2->getOpcode() && I1->isIdenticalTo(I2));
885 // Okay, it is safe to hoist the terminator.
886 Instruction *NT = I1->clone();
887 BIParent->getInstList().insert(BI, NT);
888 if (NT->getType() != Type::VoidTy) {
889 I1->replaceAllUsesWith(NT);
890 I2->replaceAllUsesWith(NT);
894 // Hoisting one of the terminators from our successor is a great thing.
895 // Unfortunately, the successors of the if/else blocks may have PHI nodes in
896 // them. If they do, all PHI entries for BB1/BB2 must agree for all PHI
897 // nodes, so we insert select instruction to compute the final result.
898 std::map<std::pair<Value*,Value*>, SelectInst*> InsertedSelects;
899 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) {
901 for (BasicBlock::iterator BBI = SI->begin();
902 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
903 Value *BB1V = PN->getIncomingValueForBlock(BB1);
904 Value *BB2V = PN->getIncomingValueForBlock(BB2);
906 // These values do not agree. Insert a select instruction before NT
907 // that determines the right value.
908 SelectInst *&SI = InsertedSelects[std::make_pair(BB1V, BB2V)];
910 SI = SelectInst::Create(BI->getCondition(), BB1V, BB2V,
911 BB1V->getName()+"."+BB2V->getName(), NT);
912 // Make the PHI node use the select for all incoming values for BB1/BB2
913 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
914 if (PN->getIncomingBlock(i) == BB1 || PN->getIncomingBlock(i) == BB2)
915 PN->setIncomingValue(i, SI);
920 // Update any PHI nodes in our new successors.
921 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI)
922 AddPredecessorToBlock(*SI, BIParent, BB1);
924 EraseTerminatorInstAndDCECond(BI);
928 /// SpeculativelyExecuteBB - Given a conditional branch that goes to BB1
929 /// and an BB2 and the only successor of BB1 is BB2, hoist simple code
930 /// (for now, restricted to a single instruction that's side effect free) from
931 /// the BB1 into the branch block to speculatively execute it.
932 static bool SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *BB1) {
933 // Only speculatively execution a single instruction (not counting the
934 // terminator) for now.
935 BasicBlock::iterator BBI = BB1->begin();
936 ++BBI; // must have at least a terminator
937 if (BBI == BB1->end()) return false; // only one inst
939 if (BBI != BB1->end()) return false; // more than 2 insts.
941 // Be conservative for now. FP select instruction can often be expensive.
942 Value *BrCond = BI->getCondition();
943 if (isa<Instruction>(BrCond) &&
944 cast<Instruction>(BrCond)->getOpcode() == Instruction::FCmp)
947 // If BB1 is actually on the false edge of the conditional branch, remember
948 // to swap the select operands later.
950 if (BB1 != BI->getSuccessor(0)) {
951 assert(BB1 == BI->getSuccessor(1) && "No edge from 'if' block?");
958 // br i1 %t1, label %BB1, label %BB2
967 // %t3 = select i1 %t1, %t2, %t3
968 Instruction *I = BB1->begin();
969 switch (I->getOpcode()) {
970 default: return false; // Not safe / profitable to hoist.
971 case Instruction::Add:
972 case Instruction::Sub:
973 // FP arithmetic might trap. Not worth doing for vector ops.
974 if (I->getType()->isFloatingPoint() || isa<VectorType>(I->getType()))
977 case Instruction::And:
978 case Instruction::Or:
979 case Instruction::Xor:
980 case Instruction::Shl:
981 case Instruction::LShr:
982 case Instruction::AShr:
983 // Don't mess with vector operations.
984 if (isa<VectorType>(I->getType()))
986 break; // These are all cheap and non-trapping instructions.
989 // If the instruction is obviously dead, don't try to predicate it.
990 if (I->use_empty()) {
991 I->eraseFromParent();
995 // Can we speculatively execute the instruction? And what is the value
996 // if the condition is false? Consider the phi uses, if the incoming value
997 // from the "if" block are all the same V, then V is the value of the
998 // select if the condition is false.
999 BasicBlock *BIParent = BI->getParent();
1000 SmallVector<PHINode*, 4> PHIUses;
1001 Value *FalseV = NULL;
1003 BasicBlock *BB2 = BB1->getTerminator()->getSuccessor(0);
1004 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
1006 // Ignore any user that is not a PHI node in BB2. These can only occur in
1007 // unreachable blocks, because they would not be dominated by the instr.
1008 PHINode *PN = dyn_cast<PHINode>(UI);
1009 if (!PN || PN->getParent() != BB2)
1011 PHIUses.push_back(PN);
1013 Value *PHIV = PN->getIncomingValueForBlock(BIParent);
1016 else if (FalseV != PHIV)
1017 return false; // Inconsistent value when condition is false.
1020 assert(FalseV && "Must have at least one user, and it must be a PHI");
1022 // Do not hoist the instruction if any of its operands are defined but not
1023 // used in this BB. The transformation will prevent the operand from
1024 // being sunk into the use block.
1025 for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i) {
1026 Instruction *OpI = dyn_cast<Instruction>(*i);
1027 if (OpI && OpI->getParent() == BIParent &&
1028 !OpI->isUsedInBasicBlock(BIParent))
1032 // If we get here, we can hoist the instruction. Try to place it
1033 // before the icmp instruction preceeding the conditional branch.
1034 BasicBlock::iterator InsertPos = BI;
1035 if (InsertPos != BIParent->begin())
1037 if (InsertPos == BrCond && !isa<PHINode>(BrCond)) {
1038 SmallPtrSet<Instruction *, 4> BB1Insns;
1039 for(BasicBlock::iterator BB1I = BB1->begin(), BB1E = BB1->end();
1040 BB1I != BB1E; ++BB1I)
1041 BB1Insns.insert(BB1I);
1042 for(Value::use_iterator UI = BrCond->use_begin(), UE = BrCond->use_end();
1044 Instruction *Use = cast<Instruction>(*UI);
1045 if (BB1Insns.count(Use)) {
1046 // If BrCond uses the instruction that place it just before
1047 // branch instruction.
1054 BIParent->getInstList().splice(InsertPos, BB1->getInstList(), I);
1056 // Create a select whose true value is the speculatively executed value and
1057 // false value is the previously determined FalseV.
1060 SI = SelectInst::Create(BrCond, FalseV, I,
1061 FalseV->getName() + "." + I->getName(), BI);
1063 SI = SelectInst::Create(BrCond, I, FalseV,
1064 I->getName() + "." + FalseV->getName(), BI);
1066 // Make the PHI node use the select for all incoming values for "then" and
1068 for (unsigned i = 0, e = PHIUses.size(); i != e; ++i) {
1069 PHINode *PN = PHIUses[i];
1070 for (unsigned j = 0, ee = PN->getNumIncomingValues(); j != ee; ++j)
1071 if (PN->getIncomingBlock(j) == BB1 ||
1072 PN->getIncomingBlock(j) == BIParent)
1073 PN->setIncomingValue(j, SI);
1080 /// BlockIsSimpleEnoughToThreadThrough - Return true if we can thread a branch
1081 /// across this block.
1082 static bool BlockIsSimpleEnoughToThreadThrough(BasicBlock *BB) {
1083 BranchInst *BI = cast<BranchInst>(BB->getTerminator());
1086 // If this basic block contains anything other than a PHI (which controls the
1087 // branch) and branch itself, bail out. FIXME: improve this in the future.
1088 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI, ++Size) {
1089 if (Size > 10) return false; // Don't clone large BB's.
1091 // We can only support instructions that are do not define values that are
1092 // live outside of the current basic block.
1093 for (Value::use_iterator UI = BBI->use_begin(), E = BBI->use_end();
1095 Instruction *U = cast<Instruction>(*UI);
1096 if (U->getParent() != BB || isa<PHINode>(U)) return false;
1099 // Looks ok, continue checking.
1105 /// FoldCondBranchOnPHI - If we have a conditional branch on a PHI node value
1106 /// that is defined in the same block as the branch and if any PHI entries are
1107 /// constants, thread edges corresponding to that entry to be branches to their
1108 /// ultimate destination.
1109 static bool FoldCondBranchOnPHI(BranchInst *BI) {
1110 BasicBlock *BB = BI->getParent();
1111 PHINode *PN = dyn_cast<PHINode>(BI->getCondition());
1112 // NOTE: we currently cannot transform this case if the PHI node is used
1113 // outside of the block.
1114 if (!PN || PN->getParent() != BB || !PN->hasOneUse())
1117 // Degenerate case of a single entry PHI.
1118 if (PN->getNumIncomingValues() == 1) {
1119 FoldSingleEntryPHINodes(PN->getParent());
1123 // Now we know that this block has multiple preds and two succs.
1124 if (!BlockIsSimpleEnoughToThreadThrough(BB)) return false;
1126 // Okay, this is a simple enough basic block. See if any phi values are
1128 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1130 if ((CB = dyn_cast<ConstantInt>(PN->getIncomingValue(i))) &&
1131 CB->getType() == Type::Int1Ty) {
1132 // Okay, we now know that all edges from PredBB should be revectored to
1133 // branch to RealDest.
1134 BasicBlock *PredBB = PN->getIncomingBlock(i);
1135 BasicBlock *RealDest = BI->getSuccessor(!CB->getZExtValue());
1137 if (RealDest == BB) continue; // Skip self loops.
1139 // The dest block might have PHI nodes, other predecessors and other
1140 // difficult cases. Instead of being smart about this, just insert a new
1141 // block that jumps to the destination block, effectively splitting
1142 // the edge we are about to create.
1143 BasicBlock *EdgeBB = BasicBlock::Create(RealDest->getName()+".critedge",
1144 RealDest->getParent(), RealDest);
1145 BranchInst::Create(RealDest, EdgeBB);
1147 for (BasicBlock::iterator BBI = RealDest->begin();
1148 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
1149 Value *V = PN->getIncomingValueForBlock(BB);
1150 PN->addIncoming(V, EdgeBB);
1153 // BB may have instructions that are being threaded over. Clone these
1154 // instructions into EdgeBB. We know that there will be no uses of the
1155 // cloned instructions outside of EdgeBB.
1156 BasicBlock::iterator InsertPt = EdgeBB->begin();
1157 std::map<Value*, Value*> TranslateMap; // Track translated values.
1158 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) {
1159 if (PHINode *PN = dyn_cast<PHINode>(BBI)) {
1160 TranslateMap[PN] = PN->getIncomingValueForBlock(PredBB);
1162 // Clone the instruction.
1163 Instruction *N = BBI->clone();
1164 if (BBI->hasName()) N->setName(BBI->getName()+".c");
1166 // Update operands due to translation.
1167 for (User::op_iterator i = N->op_begin(), e = N->op_end();
1169 std::map<Value*, Value*>::iterator PI =
1170 TranslateMap.find(*i);
1171 if (PI != TranslateMap.end())
1175 // Check for trivial simplification.
1176 if (Constant *C = ConstantFoldInstruction(N)) {
1177 TranslateMap[BBI] = C;
1178 delete N; // Constant folded away, don't need actual inst
1180 // Insert the new instruction into its new home.
1181 EdgeBB->getInstList().insert(InsertPt, N);
1182 if (!BBI->use_empty())
1183 TranslateMap[BBI] = N;
1188 // Loop over all of the edges from PredBB to BB, changing them to branch
1189 // to EdgeBB instead.
1190 TerminatorInst *PredBBTI = PredBB->getTerminator();
1191 for (unsigned i = 0, e = PredBBTI->getNumSuccessors(); i != e; ++i)
1192 if (PredBBTI->getSuccessor(i) == BB) {
1193 BB->removePredecessor(PredBB);
1194 PredBBTI->setSuccessor(i, EdgeBB);
1197 // Recurse, simplifying any other constants.
1198 return FoldCondBranchOnPHI(BI) | true;
1205 /// FoldTwoEntryPHINode - Given a BB that starts with the specified two-entry
1206 /// PHI node, see if we can eliminate it.
1207 static bool FoldTwoEntryPHINode(PHINode *PN) {
1208 // Ok, this is a two entry PHI node. Check to see if this is a simple "if
1209 // statement", which has a very simple dominance structure. Basically, we
1210 // are trying to find the condition that is being branched on, which
1211 // subsequently causes this merge to happen. We really want control
1212 // dependence information for this check, but simplifycfg can't keep it up
1213 // to date, and this catches most of the cases we care about anyway.
1215 BasicBlock *BB = PN->getParent();
1216 BasicBlock *IfTrue, *IfFalse;
1217 Value *IfCond = GetIfCondition(BB, IfTrue, IfFalse);
1218 if (!IfCond) return false;
1220 // Okay, we found that we can merge this two-entry phi node into a select.
1221 // Doing so would require us to fold *all* two entry phi nodes in this block.
1222 // At some point this becomes non-profitable (particularly if the target
1223 // doesn't support cmov's). Only do this transformation if there are two or
1224 // fewer PHI nodes in this block.
1225 unsigned NumPhis = 0;
1226 for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++NumPhis, ++I)
1230 DOUT << "FOUND IF CONDITION! " << *IfCond << " T: "
1231 << IfTrue->getName() << " F: " << IfFalse->getName() << "\n";
1233 // Loop over the PHI's seeing if we can promote them all to select
1234 // instructions. While we are at it, keep track of the instructions
1235 // that need to be moved to the dominating block.
1236 std::set<Instruction*> AggressiveInsts;
1238 BasicBlock::iterator AfterPHIIt = BB->begin();
1239 while (isa<PHINode>(AfterPHIIt)) {
1240 PHINode *PN = cast<PHINode>(AfterPHIIt++);
1241 if (PN->getIncomingValue(0) == PN->getIncomingValue(1)) {
1242 if (PN->getIncomingValue(0) != PN)
1243 PN->replaceAllUsesWith(PN->getIncomingValue(0));
1245 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
1246 } else if (!DominatesMergePoint(PN->getIncomingValue(0), BB,
1247 &AggressiveInsts) ||
1248 !DominatesMergePoint(PN->getIncomingValue(1), BB,
1249 &AggressiveInsts)) {
1254 // If we all PHI nodes are promotable, check to make sure that all
1255 // instructions in the predecessor blocks can be promoted as well. If
1256 // not, we won't be able to get rid of the control flow, so it's not
1257 // worth promoting to select instructions.
1258 BasicBlock *DomBlock = 0, *IfBlock1 = 0, *IfBlock2 = 0;
1259 PN = cast<PHINode>(BB->begin());
1260 BasicBlock *Pred = PN->getIncomingBlock(0);
1261 if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) {
1263 DomBlock = *pred_begin(Pred);
1264 for (BasicBlock::iterator I = Pred->begin();
1265 !isa<TerminatorInst>(I); ++I)
1266 if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) {
1267 // This is not an aggressive instruction that we can promote.
1268 // Because of this, we won't be able to get rid of the control
1269 // flow, so the xform is not worth it.
1274 Pred = PN->getIncomingBlock(1);
1275 if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) {
1277 DomBlock = *pred_begin(Pred);
1278 for (BasicBlock::iterator I = Pred->begin();
1279 !isa<TerminatorInst>(I); ++I)
1280 if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) {
1281 // This is not an aggressive instruction that we can promote.
1282 // Because of this, we won't be able to get rid of the control
1283 // flow, so the xform is not worth it.
1288 // If we can still promote the PHI nodes after this gauntlet of tests,
1289 // do all of the PHI's now.
1291 // Move all 'aggressive' instructions, which are defined in the
1292 // conditional parts of the if's up to the dominating block.
1294 DomBlock->getInstList().splice(DomBlock->getTerminator(),
1295 IfBlock1->getInstList(),
1297 IfBlock1->getTerminator());
1300 DomBlock->getInstList().splice(DomBlock->getTerminator(),
1301 IfBlock2->getInstList(),
1303 IfBlock2->getTerminator());
1306 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
1307 // Change the PHI node into a select instruction.
1309 PN->getIncomingValue(PN->getIncomingBlock(0) == IfFalse);
1311 PN->getIncomingValue(PN->getIncomingBlock(0) == IfTrue);
1313 Value *NV = SelectInst::Create(IfCond, TrueVal, FalseVal, "", AfterPHIIt);
1314 PN->replaceAllUsesWith(NV);
1317 BB->getInstList().erase(PN);
1322 /// SimplifyCondBranchToTwoReturns - If we found a conditional branch that goes
1323 /// to two returning blocks, try to merge them together into one return,
1324 /// introducing a select if the return values disagree.
1325 static bool SimplifyCondBranchToTwoReturns(BranchInst *BI) {
1326 assert(BI->isConditional() && "Must be a conditional branch");
1327 BasicBlock *TrueSucc = BI->getSuccessor(0);
1328 BasicBlock *FalseSucc = BI->getSuccessor(1);
1329 ReturnInst *TrueRet = cast<ReturnInst>(TrueSucc->getTerminator());
1330 ReturnInst *FalseRet = cast<ReturnInst>(FalseSucc->getTerminator());
1332 // Check to ensure both blocks are empty (just a return) or optionally empty
1333 // with PHI nodes. If there are other instructions, merging would cause extra
1334 // computation on one path or the other.
1335 BasicBlock::iterator BBI = TrueRet;
1336 if (BBI != TrueSucc->begin() && !isa<PHINode>(--BBI))
1337 return false; // Not empty with optional phi nodes.
1339 if (BBI != FalseSucc->begin() && !isa<PHINode>(--BBI))
1340 return false; // Not empty with optional phi nodes.
1342 // Okay, we found a branch that is going to two return nodes. If
1343 // there is no return value for this function, just change the
1344 // branch into a return.
1345 if (FalseRet->getNumOperands() == 0) {
1346 TrueSucc->removePredecessor(BI->getParent());
1347 FalseSucc->removePredecessor(BI->getParent());
1348 ReturnInst::Create(0, BI);
1349 EraseTerminatorInstAndDCECond(BI);
1353 // Otherwise, figure out what the true and false return values are
1354 // so we can insert a new select instruction.
1355 Value *TrueValue = TrueRet->getReturnValue();
1356 Value *FalseValue = FalseRet->getReturnValue();
1358 // Unwrap any PHI nodes in the return blocks.
1359 if (PHINode *TVPN = dyn_cast_or_null<PHINode>(TrueValue))
1360 if (TVPN->getParent() == TrueSucc)
1361 TrueValue = TVPN->getIncomingValueForBlock(BI->getParent());
1362 if (PHINode *FVPN = dyn_cast_or_null<PHINode>(FalseValue))
1363 if (FVPN->getParent() == FalseSucc)
1364 FalseValue = FVPN->getIncomingValueForBlock(BI->getParent());
1366 // In order for this transformation to be safe, we must be able to
1367 // unconditionally execute both operands to the return. This is
1368 // normally the case, but we could have a potentially-trapping
1369 // constant expression that prevents this transformation from being
1371 if (ConstantExpr *TCV = dyn_cast_or_null<ConstantExpr>(TrueValue))
1374 if (ConstantExpr *FCV = dyn_cast_or_null<ConstantExpr>(FalseValue))
1378 // Okay, we collected all the mapped values and checked them for sanity, and
1379 // defined to really do this transformation. First, update the CFG.
1380 TrueSucc->removePredecessor(BI->getParent());
1381 FalseSucc->removePredecessor(BI->getParent());
1383 // Insert select instructions where needed.
1384 Value *BrCond = BI->getCondition();
1386 // Insert a select if the results differ.
1387 if (TrueValue == FalseValue || isa<UndefValue>(FalseValue)) {
1388 } else if (isa<UndefValue>(TrueValue)) {
1389 TrueValue = FalseValue;
1391 TrueValue = SelectInst::Create(BrCond, TrueValue,
1392 FalseValue, "retval", BI);
1396 Value *RI = !TrueValue ?
1397 ReturnInst::Create(BI) :
1398 ReturnInst::Create(TrueValue, BI);
1400 DOUT << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:"
1401 << "\n " << *BI << "NewRet = " << *RI
1402 << "TRUEBLOCK: " << *TrueSucc << "FALSEBLOCK: "<< *FalseSucc;
1404 EraseTerminatorInstAndDCECond(BI);
1409 /// FoldBranchToCommonDest - If this basic block is ONLY a setcc and a branch,
1410 /// and if a predecessor branches to us and one of our successors, fold the
1411 /// setcc into the predecessor and use logical operations to pick the right
1413 static bool FoldBranchToCommonDest(BranchInst *BI) {
1414 BasicBlock *BB = BI->getParent();
1415 Instruction *Cond = dyn_cast<Instruction>(BI->getCondition());
1416 if (Cond == 0) return false;
1419 // Only allow this if the condition is a simple instruction that can be
1420 // executed unconditionally. It must be in the same block as the branch, and
1421 // must be at the front of the block.
1422 if ((!isa<CmpInst>(Cond) && !isa<BinaryOperator>(Cond)) ||
1423 Cond->getParent() != BB || &BB->front() != Cond || !Cond->hasOneUse())
1426 // Make sure the instruction after the condition is the cond branch.
1427 BasicBlock::iterator CondIt = Cond; ++CondIt;
1431 // Cond is known to be a compare or binary operator. Check to make sure that
1432 // neither operand is a potentially-trapping constant expression.
1433 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Cond->getOperand(0)))
1436 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Cond->getOperand(1)))
1441 // Finally, don't infinitely unroll conditional loops.
1442 BasicBlock *TrueDest = BI->getSuccessor(0);
1443 BasicBlock *FalseDest = BI->getSuccessor(1);
1444 if (TrueDest == BB || FalseDest == BB)
1447 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
1448 BasicBlock *PredBlock = *PI;
1449 BranchInst *PBI = dyn_cast<BranchInst>(PredBlock->getTerminator());
1451 // Check that we have two conditional branches. If there is a PHI node in
1452 // the common successor, verify that the same value flows in from both
1454 if (PBI == 0 || PBI->isUnconditional() ||
1455 !SafeToMergeTerminators(BI, PBI))
1458 Instruction::BinaryOps Opc;
1459 bool InvertPredCond = false;
1461 if (PBI->getSuccessor(0) == TrueDest)
1462 Opc = Instruction::Or;
1463 else if (PBI->getSuccessor(1) == FalseDest)
1464 Opc = Instruction::And;
1465 else if (PBI->getSuccessor(0) == FalseDest)
1466 Opc = Instruction::And, InvertPredCond = true;
1467 else if (PBI->getSuccessor(1) == TrueDest)
1468 Opc = Instruction::Or, InvertPredCond = true;
1472 DOUT << "FOLDING BRANCH TO COMMON DEST:\n" << *PBI << *BB;
1474 // If we need to invert the condition in the pred block to match, do so now.
1475 if (InvertPredCond) {
1477 BinaryOperator::CreateNot(PBI->getCondition(),
1478 PBI->getCondition()->getName()+".not", PBI);
1479 PBI->setCondition(NewCond);
1480 BasicBlock *OldTrue = PBI->getSuccessor(0);
1481 BasicBlock *OldFalse = PBI->getSuccessor(1);
1482 PBI->setSuccessor(0, OldFalse);
1483 PBI->setSuccessor(1, OldTrue);
1486 // Clone Cond into the predecessor basic block, and or/and the
1487 // two conditions together.
1488 Instruction *New = Cond->clone();
1489 PredBlock->getInstList().insert(PBI, New);
1490 New->takeName(Cond);
1491 Cond->setName(New->getName()+".old");
1493 Value *NewCond = BinaryOperator::Create(Opc, PBI->getCondition(),
1494 New, "or.cond", PBI);
1495 PBI->setCondition(NewCond);
1496 if (PBI->getSuccessor(0) == BB) {
1497 AddPredecessorToBlock(TrueDest, PredBlock, BB);
1498 PBI->setSuccessor(0, TrueDest);
1500 if (PBI->getSuccessor(1) == BB) {
1501 AddPredecessorToBlock(FalseDest, PredBlock, BB);
1502 PBI->setSuccessor(1, FalseDest);
1509 /// SimplifyCondBranchToCondBranch - If we have a conditional branch as a
1510 /// predecessor of another block, this function tries to simplify it. We know
1511 /// that PBI and BI are both conditional branches, and BI is in one of the
1512 /// successor blocks of PBI - PBI branches to BI.
1513 static bool SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) {
1514 assert(PBI->isConditional() && BI->isConditional());
1515 BasicBlock *BB = BI->getParent();
1517 // If this block ends with a branch instruction, and if there is a
1518 // predecessor that ends on a branch of the same condition, make
1519 // this conditional branch redundant.
1520 if (PBI->getCondition() == BI->getCondition() &&
1521 PBI->getSuccessor(0) != PBI->getSuccessor(1)) {
1522 // Okay, the outcome of this conditional branch is statically
1523 // knowable. If this block had a single pred, handle specially.
1524 if (BB->getSinglePredecessor()) {
1525 // Turn this into a branch on constant.
1526 bool CondIsTrue = PBI->getSuccessor(0) == BB;
1527 BI->setCondition(ConstantInt::get(Type::Int1Ty, CondIsTrue));
1528 return true; // Nuke the branch on constant.
1531 // Otherwise, if there are multiple predecessors, insert a PHI that merges
1532 // in the constant and simplify the block result. Subsequent passes of
1533 // simplifycfg will thread the block.
1534 if (BlockIsSimpleEnoughToThreadThrough(BB)) {
1535 PHINode *NewPN = PHINode::Create(Type::Int1Ty,
1536 BI->getCondition()->getName() + ".pr",
1538 // Okay, we're going to insert the PHI node. Since PBI is not the only
1539 // predecessor, compute the PHI'd conditional value for all of the preds.
1540 // Any predecessor where the condition is not computable we keep symbolic.
1541 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
1542 if ((PBI = dyn_cast<BranchInst>((*PI)->getTerminator())) &&
1543 PBI != BI && PBI->isConditional() &&
1544 PBI->getCondition() == BI->getCondition() &&
1545 PBI->getSuccessor(0) != PBI->getSuccessor(1)) {
1546 bool CondIsTrue = PBI->getSuccessor(0) == BB;
1547 NewPN->addIncoming(ConstantInt::get(Type::Int1Ty,
1550 NewPN->addIncoming(BI->getCondition(), *PI);
1553 BI->setCondition(NewPN);
1558 // If this is a conditional branch in an empty block, and if any
1559 // predecessors is a conditional branch to one of our destinations,
1560 // fold the conditions into logical ops and one cond br.
1561 if (&BB->front() != BI)
1565 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(BI->getCondition()))
1570 if (PBI->getSuccessor(0) == BI->getSuccessor(0))
1572 else if (PBI->getSuccessor(0) == BI->getSuccessor(1))
1573 PBIOp = 0, BIOp = 1;
1574 else if (PBI->getSuccessor(1) == BI->getSuccessor(0))
1575 PBIOp = 1, BIOp = 0;
1576 else if (PBI->getSuccessor(1) == BI->getSuccessor(1))
1581 // Check to make sure that the other destination of this branch
1582 // isn't BB itself. If so, this is an infinite loop that will
1583 // keep getting unwound.
1584 if (PBI->getSuccessor(PBIOp) == BB)
1587 // Do not perform this transformation if it would require
1588 // insertion of a large number of select instructions. For targets
1589 // without predication/cmovs, this is a big pessimization.
1590 BasicBlock *CommonDest = PBI->getSuccessor(PBIOp);
1592 unsigned NumPhis = 0;
1593 for (BasicBlock::iterator II = CommonDest->begin();
1594 isa<PHINode>(II); ++II, ++NumPhis)
1595 if (NumPhis > 2) // Disable this xform.
1598 // Finally, if everything is ok, fold the branches to logical ops.
1599 BasicBlock *OtherDest = BI->getSuccessor(BIOp ^ 1);
1601 DOUT << "FOLDING BRs:" << *PBI->getParent()
1602 << "AND: " << *BI->getParent();
1605 // If OtherDest *is* BB, then BB is a basic block with a single conditional
1606 // branch in it, where one edge (OtherDest) goes back to itself but the other
1607 // exits. We don't *know* that the program avoids the infinite loop
1608 // (even though that seems likely). If we do this xform naively, we'll end up
1609 // recursively unpeeling the loop. Since we know that (after the xform is
1610 // done) that the block *is* infinite if reached, we just make it an obviously
1611 // infinite loop with no cond branch.
1612 if (OtherDest == BB) {
1613 // Insert it at the end of the function, because it's either code,
1614 // or it won't matter if it's hot. :)
1615 BasicBlock *InfLoopBlock = BasicBlock::Create("infloop", BB->getParent());
1616 BranchInst::Create(InfLoopBlock, InfLoopBlock);
1617 OtherDest = InfLoopBlock;
1620 DOUT << *PBI->getParent()->getParent();
1622 // BI may have other predecessors. Because of this, we leave
1623 // it alone, but modify PBI.
1625 // Make sure we get to CommonDest on True&True directions.
1626 Value *PBICond = PBI->getCondition();
1628 PBICond = BinaryOperator::CreateNot(PBICond,
1629 PBICond->getName()+".not",
1631 Value *BICond = BI->getCondition();
1633 BICond = BinaryOperator::CreateNot(BICond,
1634 BICond->getName()+".not",
1636 // Merge the conditions.
1637 Value *Cond = BinaryOperator::CreateOr(PBICond, BICond, "brmerge", PBI);
1639 // Modify PBI to branch on the new condition to the new dests.
1640 PBI->setCondition(Cond);
1641 PBI->setSuccessor(0, CommonDest);
1642 PBI->setSuccessor(1, OtherDest);
1644 // OtherDest may have phi nodes. If so, add an entry from PBI's
1645 // block that are identical to the entries for BI's block.
1647 for (BasicBlock::iterator II = OtherDest->begin();
1648 (PN = dyn_cast<PHINode>(II)); ++II) {
1649 Value *V = PN->getIncomingValueForBlock(BB);
1650 PN->addIncoming(V, PBI->getParent());
1653 // We know that the CommonDest already had an edge from PBI to
1654 // it. If it has PHIs though, the PHIs may have different
1655 // entries for BB and PBI's BB. If so, insert a select to make
1657 for (BasicBlock::iterator II = CommonDest->begin();
1658 (PN = dyn_cast<PHINode>(II)); ++II) {
1659 Value *BIV = PN->getIncomingValueForBlock(BB);
1660 unsigned PBBIdx = PN->getBasicBlockIndex(PBI->getParent());
1661 Value *PBIV = PN->getIncomingValue(PBBIdx);
1663 // Insert a select in PBI to pick the right value.
1664 Value *NV = SelectInst::Create(PBICond, PBIV, BIV,
1665 PBIV->getName()+".mux", PBI);
1666 PN->setIncomingValue(PBBIdx, NV);
1670 DOUT << "INTO: " << *PBI->getParent();
1672 DOUT << *PBI->getParent()->getParent();
1674 // This basic block is probably dead. We know it has at least
1675 // one fewer predecessor.
1681 /// ConstantIntOrdering - This class implements a stable ordering of constant
1682 /// integers that does not depend on their address. This is important for
1683 /// applications that sort ConstantInt's to ensure uniqueness.
1684 struct ConstantIntOrdering {
1685 bool operator()(const ConstantInt *LHS, const ConstantInt *RHS) const {
1686 return LHS->getValue().ult(RHS->getValue());
1691 /// SimplifyCFG - This function is used to do simplification of a CFG. For
1692 /// example, it adjusts branches to branches to eliminate the extra hop, it
1693 /// eliminates unreachable basic blocks, and does other "peephole" optimization
1694 /// of the CFG. It returns true if a modification was made.
1696 /// WARNING: The entry node of a function may not be simplified.
1698 bool llvm::SimplifyCFG(BasicBlock *BB) {
1699 bool Changed = false;
1700 Function *M = BB->getParent();
1702 assert(BB && BB->getParent() && "Block not embedded in function!");
1703 assert(BB->getTerminator() && "Degenerate basic block encountered!");
1704 assert(&BB->getParent()->getEntryBlock() != BB &&
1705 "Can't Simplify entry block!");
1707 // Remove basic blocks that have no predecessors... or that just have themself
1708 // as a predecessor. These are unreachable.
1709 if (pred_begin(BB) == pred_end(BB) || BB->getSinglePredecessor() == BB) {
1710 DOUT << "Removing BB: \n" << *BB;
1711 DeleteDeadBlock(BB);
1715 // Check to see if we can constant propagate this terminator instruction
1717 Changed |= ConstantFoldTerminator(BB);
1719 // If there is a trivial two-entry PHI node in this basic block, and we can
1720 // eliminate it, do so now.
1721 if (PHINode *PN = dyn_cast<PHINode>(BB->begin()))
1722 if (PN->getNumIncomingValues() == 2)
1723 Changed |= FoldTwoEntryPHINode(PN);
1725 // If this is a returning block with only PHI nodes in it, fold the return
1726 // instruction into any unconditional branch predecessors.
1728 // If any predecessor is a conditional branch that just selects among
1729 // different return values, fold the replace the branch/return with a select
1731 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator())) {
1732 BasicBlock::iterator BBI = BB->getTerminator();
1733 if (BBI == BB->begin() || isa<PHINode>(--BBI)) {
1734 // Find predecessors that end with branches.
1735 SmallVector<BasicBlock*, 8> UncondBranchPreds;
1736 SmallVector<BranchInst*, 8> CondBranchPreds;
1737 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
1738 TerminatorInst *PTI = (*PI)->getTerminator();
1739 if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) {
1740 if (BI->isUnconditional())
1741 UncondBranchPreds.push_back(*PI);
1743 CondBranchPreds.push_back(BI);
1747 // If we found some, do the transformation!
1748 if (!UncondBranchPreds.empty()) {
1749 while (!UncondBranchPreds.empty()) {
1750 BasicBlock *Pred = UncondBranchPreds.back();
1751 DOUT << "FOLDING: " << *BB
1752 << "INTO UNCOND BRANCH PRED: " << *Pred;
1753 UncondBranchPreds.pop_back();
1754 Instruction *UncondBranch = Pred->getTerminator();
1755 // Clone the return and add it to the end of the predecessor.
1756 Instruction *NewRet = RI->clone();
1757 Pred->getInstList().push_back(NewRet);
1759 // If the return instruction returns a value, and if the value was a
1760 // PHI node in "BB", propagate the right value into the return.
1761 for (User::op_iterator i = NewRet->op_begin(), e = NewRet->op_end();
1763 if (PHINode *PN = dyn_cast<PHINode>(*i))
1764 if (PN->getParent() == BB)
1765 *i = PN->getIncomingValueForBlock(Pred);
1767 // Update any PHI nodes in the returning block to realize that we no
1768 // longer branch to them.
1769 BB->removePredecessor(Pred);
1770 Pred->getInstList().erase(UncondBranch);
1773 // If we eliminated all predecessors of the block, delete the block now.
1774 if (pred_begin(BB) == pred_end(BB))
1775 // We know there are no successors, so just nuke the block.
1776 M->getBasicBlockList().erase(BB);
1781 // Check out all of the conditional branches going to this return
1782 // instruction. If any of them just select between returns, change the
1783 // branch itself into a select/return pair.
1784 while (!CondBranchPreds.empty()) {
1785 BranchInst *BI = CondBranchPreds.back();
1786 CondBranchPreds.pop_back();
1788 // Check to see if the non-BB successor is also a return block.
1789 if (isa<ReturnInst>(BI->getSuccessor(0)->getTerminator()) &&
1790 isa<ReturnInst>(BI->getSuccessor(1)->getTerminator()) &&
1791 SimplifyCondBranchToTwoReturns(BI))
1795 } else if (isa<UnwindInst>(BB->begin())) {
1796 // Check to see if the first instruction in this block is just an unwind.
1797 // If so, replace any invoke instructions which use this as an exception
1798 // destination with call instructions, and any unconditional branch
1799 // predecessor with an unwind.
1801 SmallVector<BasicBlock*, 8> Preds(pred_begin(BB), pred_end(BB));
1802 while (!Preds.empty()) {
1803 BasicBlock *Pred = Preds.back();
1804 if (BranchInst *BI = dyn_cast<BranchInst>(Pred->getTerminator())) {
1805 if (BI->isUnconditional()) {
1806 Pred->getInstList().pop_back(); // nuke uncond branch
1807 new UnwindInst(Pred); // Use unwind.
1810 } else if (InvokeInst *II = dyn_cast<InvokeInst>(Pred->getTerminator()))
1811 if (II->getUnwindDest() == BB) {
1812 // Insert a new branch instruction before the invoke, because this
1813 // is now a fall through...
1814 BranchInst *BI = BranchInst::Create(II->getNormalDest(), II);
1815 Pred->getInstList().remove(II); // Take out of symbol table
1817 // Insert the call now...
1818 SmallVector<Value*,8> Args(II->op_begin()+3, II->op_end());
1819 CallInst *CI = CallInst::Create(II->getCalledValue(),
1820 Args.begin(), Args.end(),
1822 CI->setCallingConv(II->getCallingConv());
1823 CI->setAttributes(II->getAttributes());
1824 // If the invoke produced a value, the Call now does instead
1825 II->replaceAllUsesWith(CI);
1833 // If this block is now dead, remove it.
1834 if (pred_begin(BB) == pred_end(BB)) {
1835 // We know there are no successors, so just nuke the block.
1836 M->getBasicBlockList().erase(BB);
1840 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) {
1841 if (isValueEqualityComparison(SI)) {
1842 // If we only have one predecessor, and if it is a branch on this value,
1843 // see if that predecessor totally determines the outcome of this switch.
1844 if (BasicBlock *OnlyPred = BB->getSinglePredecessor())
1845 if (SimplifyEqualityComparisonWithOnlyPredecessor(SI, OnlyPred))
1846 return SimplifyCFG(BB) || 1;
1848 // If the block only contains the switch, see if we can fold the block
1849 // away into any preds.
1850 if (SI == &BB->front())
1851 if (FoldValueComparisonIntoPredecessors(SI))
1852 return SimplifyCFG(BB) || 1;
1854 } else if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) {
1855 if (BI->isUnconditional()) {
1856 BasicBlock::iterator BBI = BB->getFirstNonPHI();
1858 BasicBlock *Succ = BI->getSuccessor(0);
1859 if (BBI->isTerminator() && // Terminator is the only non-phi instruction!
1860 Succ != BB) // Don't hurt infinite loops!
1861 if (TryToSimplifyUncondBranchFromEmptyBlock(BB, Succ))
1864 } else { // Conditional branch
1865 if (isValueEqualityComparison(BI)) {
1866 // If we only have one predecessor, and if it is a branch on this value,
1867 // see if that predecessor totally determines the outcome of this
1869 if (BasicBlock *OnlyPred = BB->getSinglePredecessor())
1870 if (SimplifyEqualityComparisonWithOnlyPredecessor(BI, OnlyPred))
1871 return SimplifyCFG(BB) || 1;
1873 // This block must be empty, except for the setcond inst, if it exists.
1874 BasicBlock::iterator I = BB->begin();
1876 (&*I == cast<Instruction>(BI->getCondition()) &&
1878 if (FoldValueComparisonIntoPredecessors(BI))
1879 return SimplifyCFG(BB) | true;
1882 // If this is a branch on a phi node in the current block, thread control
1883 // through this block if any PHI node entries are constants.
1884 if (PHINode *PN = dyn_cast<PHINode>(BI->getCondition()))
1885 if (PN->getParent() == BI->getParent())
1886 if (FoldCondBranchOnPHI(BI))
1887 return SimplifyCFG(BB) | true;
1889 // If this basic block is ONLY a setcc and a branch, and if a predecessor
1890 // branches to us and one of our successors, fold the setcc into the
1891 // predecessor and use logical operations to pick the right destination.
1892 if (FoldBranchToCommonDest(BI))
1893 return SimplifyCFG(BB) | 1;
1896 // Scan predecessor blocks for conditional branches.
1897 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
1898 if (BranchInst *PBI = dyn_cast<BranchInst>((*PI)->getTerminator()))
1899 if (PBI != BI && PBI->isConditional())
1900 if (SimplifyCondBranchToCondBranch(PBI, BI))
1901 return SimplifyCFG(BB) | true;
1903 } else if (isa<UnreachableInst>(BB->getTerminator())) {
1904 // If there are any instructions immediately before the unreachable that can
1905 // be removed, do so.
1906 Instruction *Unreachable = BB->getTerminator();
1907 while (Unreachable != BB->begin()) {
1908 BasicBlock::iterator BBI = Unreachable;
1910 // Do not delete instructions that can have side effects, like calls
1911 // (which may never return) and volatile loads and stores.
1912 if (isa<CallInst>(BBI)) break;
1914 if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
1915 if (SI->isVolatile())
1918 if (LoadInst *LI = dyn_cast<LoadInst>(BBI))
1919 if (LI->isVolatile())
1922 // Delete this instruction
1923 BB->getInstList().erase(BBI);
1927 // If the unreachable instruction is the first in the block, take a gander
1928 // at all of the predecessors of this instruction, and simplify them.
1929 if (&BB->front() == Unreachable) {
1930 SmallVector<BasicBlock*, 8> Preds(pred_begin(BB), pred_end(BB));
1931 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
1932 TerminatorInst *TI = Preds[i]->getTerminator();
1934 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
1935 if (BI->isUnconditional()) {
1936 if (BI->getSuccessor(0) == BB) {
1937 new UnreachableInst(TI);
1938 TI->eraseFromParent();
1942 if (BI->getSuccessor(0) == BB) {
1943 BranchInst::Create(BI->getSuccessor(1), BI);
1944 EraseTerminatorInstAndDCECond(BI);
1945 } else if (BI->getSuccessor(1) == BB) {
1946 BranchInst::Create(BI->getSuccessor(0), BI);
1947 EraseTerminatorInstAndDCECond(BI);
1951 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
1952 for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i)
1953 if (SI->getSuccessor(i) == BB) {
1954 BB->removePredecessor(SI->getParent());
1959 // If the default value is unreachable, figure out the most popular
1960 // destination and make it the default.
1961 if (SI->getSuccessor(0) == BB) {
1962 std::map<BasicBlock*, unsigned> Popularity;
1963 for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i)
1964 Popularity[SI->getSuccessor(i)]++;
1966 // Find the most popular block.
1967 unsigned MaxPop = 0;
1968 BasicBlock *MaxBlock = 0;
1969 for (std::map<BasicBlock*, unsigned>::iterator
1970 I = Popularity.begin(), E = Popularity.end(); I != E; ++I) {
1971 if (I->second > MaxPop) {
1973 MaxBlock = I->first;
1977 // Make this the new default, allowing us to delete any explicit
1979 SI->setSuccessor(0, MaxBlock);
1982 // If MaxBlock has phinodes in it, remove MaxPop-1 entries from
1984 if (isa<PHINode>(MaxBlock->begin()))
1985 for (unsigned i = 0; i != MaxPop-1; ++i)
1986 MaxBlock->removePredecessor(SI->getParent());
1988 for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i)
1989 if (SI->getSuccessor(i) == MaxBlock) {
1995 } else if (InvokeInst *II = dyn_cast<InvokeInst>(TI)) {
1996 if (II->getUnwindDest() == BB) {
1997 // Convert the invoke to a call instruction. This would be a good
1998 // place to note that the call does not throw though.
1999 BranchInst *BI = BranchInst::Create(II->getNormalDest(), II);
2000 II->removeFromParent(); // Take out of symbol table
2002 // Insert the call now...
2003 SmallVector<Value*, 8> Args(II->op_begin()+3, II->op_end());
2004 CallInst *CI = CallInst::Create(II->getCalledValue(),
2005 Args.begin(), Args.end(),
2007 CI->setCallingConv(II->getCallingConv());
2008 CI->setAttributes(II->getAttributes());
2009 // If the invoke produced a value, the Call does now instead.
2010 II->replaceAllUsesWith(CI);
2017 // If this block is now dead, remove it.
2018 if (pred_begin(BB) == pred_end(BB)) {
2019 // We know there are no successors, so just nuke the block.
2020 M->getBasicBlockList().erase(BB);
2026 // Merge basic blocks into their predecessor if there is only one distinct
2027 // pred, and if there is only one distinct successor of the predecessor, and
2028 // if there are no PHI nodes.
2030 if (MergeBlockIntoPredecessor(BB))
2033 // Otherwise, if this block only has a single predecessor, and if that block
2034 // is a conditional branch, see if we can hoist any code from this block up
2035 // into our predecessor.
2036 pred_iterator PI(pred_begin(BB)), PE(pred_end(BB));
2037 BasicBlock *OnlyPred = *PI++;
2038 for (; PI != PE; ++PI) // Search all predecessors, see if they are all same
2039 if (*PI != OnlyPred) {
2040 OnlyPred = 0; // There are multiple different predecessors...
2045 if (BranchInst *BI = dyn_cast<BranchInst>(OnlyPred->getTerminator()))
2046 if (BI->isConditional()) {
2047 // Get the other block.
2048 BasicBlock *OtherBB = BI->getSuccessor(BI->getSuccessor(0) == BB);
2049 PI = pred_begin(OtherBB);
2052 if (PI == pred_end(OtherBB)) {
2053 // We have a conditional branch to two blocks that are only reachable
2054 // from the condbr. We know that the condbr dominates the two blocks,
2055 // so see if there is any identical code in the "then" and "else"
2056 // blocks. If so, we can hoist it up to the branching block.
2057 Changed |= HoistThenElseCodeToIf(BI);
2059 BasicBlock* OnlySucc = NULL;
2060 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
2064 else if (*SI != OnlySucc) {
2065 OnlySucc = 0; // There are multiple distinct successors!
2070 if (OnlySucc == OtherBB) {
2071 // If BB's only successor is the other successor of the predecessor,
2072 // i.e. a triangle, see if we can hoist any code from this block up
2073 // to the "if" block.
2074 Changed |= SpeculativelyExecuteBB(BI, BB);
2079 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2080 if (BranchInst *BI = dyn_cast<BranchInst>((*PI)->getTerminator()))
2081 // Change br (X == 0 | X == 1), T, F into a switch instruction.
2082 if (BI->isConditional() && isa<Instruction>(BI->getCondition())) {
2083 Instruction *Cond = cast<Instruction>(BI->getCondition());
2084 // If this is a bunch of seteq's or'd together, or if it's a bunch of
2085 // 'setne's and'ed together, collect them.
2087 std::vector<ConstantInt*> Values;
2088 bool TrueWhenEqual = GatherValueComparisons(Cond, CompVal, Values);
2089 if (CompVal && CompVal->getType()->isInteger()) {
2090 // There might be duplicate constants in the list, which the switch
2091 // instruction can't handle, remove them now.
2092 std::sort(Values.begin(), Values.end(), ConstantIntOrdering());
2093 Values.erase(std::unique(Values.begin(), Values.end()), Values.end());
2095 // Figure out which block is which destination.
2096 BasicBlock *DefaultBB = BI->getSuccessor(1);
2097 BasicBlock *EdgeBB = BI->getSuccessor(0);
2098 if (!TrueWhenEqual) std::swap(DefaultBB, EdgeBB);
2100 // Create the new switch instruction now.
2101 SwitchInst *New = SwitchInst::Create(CompVal, DefaultBB,
2104 // Add all of the 'cases' to the switch instruction.
2105 for (unsigned i = 0, e = Values.size(); i != e; ++i)
2106 New->addCase(Values[i], EdgeBB);
2108 // We added edges from PI to the EdgeBB. As such, if there were any
2109 // PHI nodes in EdgeBB, they need entries to be added corresponding to
2110 // the number of edges added.
2111 for (BasicBlock::iterator BBI = EdgeBB->begin();
2112 isa<PHINode>(BBI); ++BBI) {
2113 PHINode *PN = cast<PHINode>(BBI);
2114 Value *InVal = PN->getIncomingValueForBlock(*PI);
2115 for (unsigned i = 0, e = Values.size()-1; i != e; ++i)
2116 PN->addIncoming(InVal, *PI);
2119 // Erase the old branch instruction.
2120 EraseTerminatorInstAndDCECond(BI);