Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1 | //===- SimplifyCFG.cpp - Code to perform CFG simplification ---------------===// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | bb190ac | 2002-10-08 21:36:33 +0000 | [diff] [blame] | 10 | // Peephole optimize the CFG. |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chris Lattner | 218a822 | 2004-06-20 01:13:18 +0000 | [diff] [blame] | 14 | #define DEBUG_TYPE "simplifycfg" |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 15 | #include "llvm/Transforms/Utils/Local.h" |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 16 | #include "llvm/Constants.h" |
| 17 | #include "llvm/Instructions.h" |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 18 | #include "llvm/Type.h" |
Reid Spencer | c103057 | 2007-01-19 21:13:56 +0000 | [diff] [blame] | 19 | #include "llvm/DerivedTypes.h" |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 20 | #include "llvm/Support/CFG.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 21 | #include "llvm/Support/Debug.h" |
Chris Lattner | 79066fa | 2007-01-30 23:46:24 +0000 | [diff] [blame] | 22 | #include "llvm/Analysis/ConstantFolding.h" |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 23 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
Chris Lattner | 93e985f | 2007-02-13 02:10:56 +0000 | [diff] [blame] | 24 | #include "llvm/ADT/SmallVector.h" |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 25 | #include <algorithm> |
| 26 | #include <functional> |
Chris Lattner | d52c261 | 2004-02-24 07:23:58 +0000 | [diff] [blame] | 27 | #include <set> |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 28 | #include <map> |
Chris Lattner | f7703df | 2004-01-09 06:12:26 +0000 | [diff] [blame] | 29 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 30 | |
Chris Lattner | 2bdcb56 | 2005-08-03 00:19:45 +0000 | [diff] [blame] | 31 | /// SafeToMergeTerminators - Return true if it is safe to merge these two |
| 32 | /// terminator instructions together. |
| 33 | /// |
| 34 | static bool SafeToMergeTerminators(TerminatorInst *SI1, TerminatorInst *SI2) { |
| 35 | if (SI1 == SI2) return false; // Can't merge with self! |
| 36 | |
| 37 | // It is not safe to merge these two switch instructions if they have a common |
| 38 | // successor, and if that successor has a PHI node, and if *that* PHI node has |
| 39 | // conflicting incoming values from the two switch blocks. |
| 40 | BasicBlock *SI1BB = SI1->getParent(); |
| 41 | BasicBlock *SI2BB = SI2->getParent(); |
| 42 | std::set<BasicBlock*> SI1Succs(succ_begin(SI1BB), succ_end(SI1BB)); |
| 43 | |
| 44 | for (succ_iterator I = succ_begin(SI2BB), E = succ_end(SI2BB); I != E; ++I) |
| 45 | if (SI1Succs.count(*I)) |
| 46 | for (BasicBlock::iterator BBI = (*I)->begin(); |
| 47 | isa<PHINode>(BBI); ++BBI) { |
| 48 | PHINode *PN = cast<PHINode>(BBI); |
| 49 | if (PN->getIncomingValueForBlock(SI1BB) != |
| 50 | PN->getIncomingValueForBlock(SI2BB)) |
| 51 | return false; |
| 52 | } |
| 53 | |
| 54 | return true; |
| 55 | } |
| 56 | |
| 57 | /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will |
| 58 | /// now be entries in it from the 'NewPred' block. The values that will be |
| 59 | /// flowing into the PHI nodes will be the same as those coming in from |
| 60 | /// ExistPred, an existing predecessor of Succ. |
| 61 | static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred, |
| 62 | BasicBlock *ExistPred) { |
| 63 | assert(std::find(succ_begin(ExistPred), succ_end(ExistPred), Succ) != |
| 64 | succ_end(ExistPred) && "ExistPred is not a predecessor of Succ!"); |
| 65 | if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do |
| 66 | |
| 67 | for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { |
| 68 | PHINode *PN = cast<PHINode>(I); |
| 69 | Value *V = PN->getIncomingValueForBlock(ExistPred); |
| 70 | PN->addIncoming(V, NewPred); |
| 71 | } |
| 72 | } |
| 73 | |
Chris Lattner | 3b3efc7 | 2005-08-03 00:29:26 +0000 | [diff] [blame] | 74 | // CanPropagatePredecessorsForPHIs - Return true if we can fold BB, an |
| 75 | // almost-empty BB ending in an unconditional branch to Succ, into succ. |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 76 | // |
| 77 | // Assumption: Succ is the single successor for BB. |
| 78 | // |
Chris Lattner | 3b3efc7 | 2005-08-03 00:29:26 +0000 | [diff] [blame] | 79 | static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 80 | assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!"); |
Chris Lattner | 3abb95d | 2002-09-24 00:09:26 +0000 | [diff] [blame] | 81 | |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 82 | // Check to see if one of the predecessors of BB is already a predecessor of |
Chris Lattner | e2ca540 | 2003-03-05 21:01:52 +0000 | [diff] [blame] | 83 | // Succ. If so, we cannot do the transformation if there are any PHI nodes |
| 84 | // with incompatible values coming in from the two edges! |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 85 | // |
Chris Lattner | dc88dbe | 2005-08-03 00:38:27 +0000 | [diff] [blame] | 86 | if (isa<PHINode>(Succ->front())) { |
| 87 | std::set<BasicBlock*> BBPreds(pred_begin(BB), pred_end(BB)); |
Chris Lattner | 8e75ee2 | 2005-12-03 18:25:58 +0000 | [diff] [blame] | 88 | for (pred_iterator PI = pred_begin(Succ), PE = pred_end(Succ); |
Chris Lattner | dc88dbe | 2005-08-03 00:38:27 +0000 | [diff] [blame] | 89 | PI != PE; ++PI) |
| 90 | if (std::find(BBPreds.begin(), BBPreds.end(), *PI) != BBPreds.end()) { |
| 91 | // Loop over all of the PHI nodes checking to see if there are |
| 92 | // incompatible values coming in. |
| 93 | for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { |
| 94 | PHINode *PN = cast<PHINode>(I); |
| 95 | // Loop up the entries in the PHI node for BB and for *PI if the |
| 96 | // values coming in are non-equal, we cannot merge these two blocks |
| 97 | // (instead we should insert a conditional move or something, then |
| 98 | // merge the blocks). |
| 99 | if (PN->getIncomingValueForBlock(BB) != |
| 100 | PN->getIncomingValueForBlock(*PI)) |
| 101 | return false; // Values are not equal... |
| 102 | } |
| 103 | } |
| 104 | } |
Chris Lattner | 1aad921 | 2005-08-03 00:59:12 +0000 | [diff] [blame] | 105 | |
| 106 | // Finally, if BB has PHI nodes that are used by things other than the PHIs in |
| 107 | // Succ and Succ has predecessors that are not Succ and not Pred, we cannot |
| 108 | // fold these blocks, as we don't know whether BB dominates Succ or not to |
| 109 | // update the PHI nodes correctly. |
| 110 | if (!isa<PHINode>(BB->begin()) || Succ->getSinglePredecessor()) return true; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 111 | |
Chris Lattner | 1aad921 | 2005-08-03 00:59:12 +0000 | [diff] [blame] | 112 | // If the predecessors of Succ are only BB and Succ itself, we can handle this. |
| 113 | bool IsSafe = true; |
| 114 | for (pred_iterator PI = pred_begin(Succ), E = pred_end(Succ); PI != E; ++PI) |
| 115 | if (*PI != Succ && *PI != BB) { |
| 116 | IsSafe = false; |
| 117 | break; |
| 118 | } |
| 119 | if (IsSafe) return true; |
| 120 | |
Chris Lattner | 8e75ee2 | 2005-12-03 18:25:58 +0000 | [diff] [blame] | 121 | // If the PHI nodes in BB are only used by instructions in Succ, we are ok if |
| 122 | // BB and Succ have no common predecessors. |
Chris Lattner | a0fcc3e | 2006-05-14 18:45:44 +0000 | [diff] [blame] | 123 | for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++I) { |
Chris Lattner | 1aad921 | 2005-08-03 00:59:12 +0000 | [diff] [blame] | 124 | PHINode *PN = cast<PHINode>(I); |
| 125 | for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end(); UI != E; |
| 126 | ++UI) |
Chris Lattner | 8e75ee2 | 2005-12-03 18:25:58 +0000 | [diff] [blame] | 127 | if (cast<Instruction>(*UI)->getParent() != Succ) |
| 128 | return false; |
Chris Lattner | 1aad921 | 2005-08-03 00:59:12 +0000 | [diff] [blame] | 129 | } |
| 130 | |
Chris Lattner | 8e75ee2 | 2005-12-03 18:25:58 +0000 | [diff] [blame] | 131 | // Scan the predecessor sets of BB and Succ, making sure there are no common |
| 132 | // predecessors. Common predecessors would cause us to build a phi node with |
| 133 | // differing incoming values, which is not legal. |
| 134 | std::set<BasicBlock*> BBPreds(pred_begin(BB), pred_end(BB)); |
| 135 | for (pred_iterator PI = pred_begin(Succ), E = pred_end(Succ); PI != E; ++PI) |
| 136 | if (BBPreds.count(*PI)) |
| 137 | return false; |
| 138 | |
| 139 | return true; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 140 | } |
| 141 | |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 142 | /// TryToSimplifyUncondBranchFromEmptyBlock - BB contains an unconditional |
| 143 | /// branch to Succ, and contains no instructions other than PHI nodes and the |
| 144 | /// branch. If possible, eliminate BB. |
| 145 | static bool TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB, |
| 146 | BasicBlock *Succ) { |
| 147 | // If our successor has PHI nodes, then we need to update them to include |
| 148 | // entries for BB's predecessors, not for BB itself. Be careful though, |
| 149 | // if this transformation fails (returns true) then we cannot do this |
| 150 | // transformation! |
| 151 | // |
Chris Lattner | 3b3efc7 | 2005-08-03 00:29:26 +0000 | [diff] [blame] | 152 | if (!CanPropagatePredecessorsForPHIs(BB, Succ)) return false; |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 153 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 154 | DOUT << "Killing Trivial BB: \n" << *BB; |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 155 | |
Chris Lattner | 3b3efc7 | 2005-08-03 00:29:26 +0000 | [diff] [blame] | 156 | if (isa<PHINode>(Succ->begin())) { |
| 157 | // If there is more than one pred of succ, and there are PHI nodes in |
| 158 | // the successor, then we need to add incoming edges for the PHI nodes |
| 159 | // |
| 160 | const std::vector<BasicBlock*> BBPreds(pred_begin(BB), pred_end(BB)); |
| 161 | |
| 162 | // Loop over all of the PHI nodes in the successor of BB. |
| 163 | for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { |
| 164 | PHINode *PN = cast<PHINode>(I); |
| 165 | Value *OldVal = PN->removeIncomingValue(BB, false); |
| 166 | assert(OldVal && "No entry in PHI for Pred BB!"); |
| 167 | |
Chris Lattner | dc88dbe | 2005-08-03 00:38:27 +0000 | [diff] [blame] | 168 | // If this incoming value is one of the PHI nodes in BB, the new entries |
| 169 | // in the PHI node are the entries from the old PHI. |
Chris Lattner | 3b3efc7 | 2005-08-03 00:29:26 +0000 | [diff] [blame] | 170 | if (isa<PHINode>(OldVal) && cast<PHINode>(OldVal)->getParent() == BB) { |
| 171 | PHINode *OldValPN = cast<PHINode>(OldVal); |
| 172 | for (unsigned i = 0, e = OldValPN->getNumIncomingValues(); i != e; ++i) |
| 173 | PN->addIncoming(OldValPN->getIncomingValue(i), |
| 174 | OldValPN->getIncomingBlock(i)); |
| 175 | } else { |
| 176 | for (std::vector<BasicBlock*>::const_iterator PredI = BBPreds.begin(), |
| 177 | End = BBPreds.end(); PredI != End; ++PredI) { |
| 178 | // Add an incoming value for each of the new incoming values... |
| 179 | PN->addIncoming(OldVal, *PredI); |
| 180 | } |
| 181 | } |
| 182 | } |
| 183 | } |
| 184 | |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 185 | if (isa<PHINode>(&BB->front())) { |
| 186 | std::vector<BasicBlock*> |
| 187 | OldSuccPreds(pred_begin(Succ), pred_end(Succ)); |
| 188 | |
| 189 | // Move all PHI nodes in BB to Succ if they are alive, otherwise |
| 190 | // delete them. |
| 191 | while (PHINode *PN = dyn_cast<PHINode>(&BB->front())) |
Chris Lattner | dc88dbe | 2005-08-03 00:38:27 +0000 | [diff] [blame] | 192 | if (PN->use_empty()) { |
| 193 | // Just remove the dead phi. This happens if Succ's PHIs were the only |
| 194 | // users of the PHI nodes. |
| 195 | PN->eraseFromParent(); |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 196 | } else { |
| 197 | // The instruction is alive, so this means that Succ must have |
| 198 | // *ONLY* had BB as a predecessor, and the PHI node is still valid |
| 199 | // now. Simply move it into Succ, because we know that BB |
| 200 | // strictly dominated Succ. |
Chris Lattner | d423b8b | 2005-08-03 00:23:42 +0000 | [diff] [blame] | 201 | Succ->getInstList().splice(Succ->begin(), |
| 202 | BB->getInstList(), BB->begin()); |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 203 | |
| 204 | // We need to add new entries for the PHI node to account for |
| 205 | // predecessors of Succ that the PHI node does not take into |
| 206 | // account. At this point, since we know that BB dominated succ, |
| 207 | // this means that we should any newly added incoming edges should |
| 208 | // use the PHI node as the value for these edges, because they are |
| 209 | // loop back edges. |
| 210 | for (unsigned i = 0, e = OldSuccPreds.size(); i != e; ++i) |
| 211 | if (OldSuccPreds[i] != BB) |
| 212 | PN->addIncoming(PN, OldSuccPreds[i]); |
| 213 | } |
| 214 | } |
| 215 | |
| 216 | // Everything that jumped to BB now goes to Succ. |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 217 | BB->replaceAllUsesWith(Succ); |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 218 | if (!Succ->hasName()) Succ->takeName(BB); |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 219 | BB->eraseFromParent(); // Delete the old basic block. |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 220 | return true; |
| 221 | } |
| 222 | |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 223 | /// GetIfCondition - Given a basic block (BB) with two predecessors (and |
| 224 | /// presumably PHI nodes in it), check to see if the merge at this block is due |
| 225 | /// to an "if condition". If so, return the boolean condition that determines |
| 226 | /// which entry into BB will be taken. Also, return by references the block |
| 227 | /// that will be entered from if the condition is true, and the block that will |
| 228 | /// be entered if the condition is false. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 229 | /// |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 230 | /// |
| 231 | static Value *GetIfCondition(BasicBlock *BB, |
| 232 | BasicBlock *&IfTrue, BasicBlock *&IfFalse) { |
| 233 | assert(std::distance(pred_begin(BB), pred_end(BB)) == 2 && |
| 234 | "Function can only handle blocks with 2 predecessors!"); |
| 235 | BasicBlock *Pred1 = *pred_begin(BB); |
| 236 | BasicBlock *Pred2 = *++pred_begin(BB); |
| 237 | |
| 238 | // We can only handle branches. Other control flow will be lowered to |
| 239 | // branches if possible anyway. |
| 240 | if (!isa<BranchInst>(Pred1->getTerminator()) || |
| 241 | !isa<BranchInst>(Pred2->getTerminator())) |
| 242 | return 0; |
| 243 | BranchInst *Pred1Br = cast<BranchInst>(Pred1->getTerminator()); |
| 244 | BranchInst *Pred2Br = cast<BranchInst>(Pred2->getTerminator()); |
| 245 | |
| 246 | // Eliminate code duplication by ensuring that Pred1Br is conditional if |
| 247 | // either are. |
| 248 | if (Pred2Br->isConditional()) { |
| 249 | // If both branches are conditional, we don't have an "if statement". In |
| 250 | // reality, we could transform this case, but since the condition will be |
| 251 | // required anyway, we stand no chance of eliminating it, so the xform is |
| 252 | // probably not profitable. |
| 253 | if (Pred1Br->isConditional()) |
| 254 | return 0; |
| 255 | |
| 256 | std::swap(Pred1, Pred2); |
| 257 | std::swap(Pred1Br, Pred2Br); |
| 258 | } |
| 259 | |
| 260 | if (Pred1Br->isConditional()) { |
| 261 | // If we found a conditional branch predecessor, make sure that it branches |
| 262 | // to BB and Pred2Br. If it doesn't, this isn't an "if statement". |
| 263 | if (Pred1Br->getSuccessor(0) == BB && |
| 264 | Pred1Br->getSuccessor(1) == Pred2) { |
| 265 | IfTrue = Pred1; |
| 266 | IfFalse = Pred2; |
| 267 | } else if (Pred1Br->getSuccessor(0) == Pred2 && |
| 268 | Pred1Br->getSuccessor(1) == BB) { |
| 269 | IfTrue = Pred2; |
| 270 | IfFalse = Pred1; |
| 271 | } else { |
| 272 | // We know that one arm of the conditional goes to BB, so the other must |
| 273 | // go somewhere unrelated, and this must not be an "if statement". |
| 274 | return 0; |
| 275 | } |
| 276 | |
| 277 | // The only thing we have to watch out for here is to make sure that Pred2 |
| 278 | // doesn't have incoming edges from other blocks. If it does, the condition |
| 279 | // doesn't dominate BB. |
| 280 | if (++pred_begin(Pred2) != pred_end(Pred2)) |
| 281 | return 0; |
| 282 | |
| 283 | return Pred1Br->getCondition(); |
| 284 | } |
| 285 | |
| 286 | // Ok, if we got here, both predecessors end with an unconditional branch to |
| 287 | // BB. Don't panic! If both blocks only have a single (identical) |
| 288 | // predecessor, and THAT is a conditional branch, then we're all ok! |
| 289 | if (pred_begin(Pred1) == pred_end(Pred1) || |
| 290 | ++pred_begin(Pred1) != pred_end(Pred1) || |
| 291 | pred_begin(Pred2) == pred_end(Pred2) || |
| 292 | ++pred_begin(Pred2) != pred_end(Pred2) || |
| 293 | *pred_begin(Pred1) != *pred_begin(Pred2)) |
| 294 | return 0; |
| 295 | |
| 296 | // Otherwise, if this is a conditional branch, then we can use it! |
| 297 | BasicBlock *CommonPred = *pred_begin(Pred1); |
| 298 | if (BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator())) { |
| 299 | assert(BI->isConditional() && "Two successors but not conditional?"); |
| 300 | if (BI->getSuccessor(0) == Pred1) { |
| 301 | IfTrue = Pred1; |
| 302 | IfFalse = Pred2; |
| 303 | } else { |
| 304 | IfTrue = Pred2; |
| 305 | IfFalse = Pred1; |
| 306 | } |
| 307 | return BI->getCondition(); |
| 308 | } |
| 309 | return 0; |
| 310 | } |
| 311 | |
| 312 | |
| 313 | // If we have a merge point of an "if condition" as accepted above, return true |
| 314 | // if the specified value dominates the block. We don't handle the true |
| 315 | // generality of domination here, just a special case which works well enough |
| 316 | // for us. |
Chris Lattner | 9c07866 | 2004-10-14 05:13:36 +0000 | [diff] [blame] | 317 | // |
| 318 | // If AggressiveInsts is non-null, and if V does not dominate BB, we check to |
| 319 | // see if V (which must be an instruction) is cheap to compute and is |
| 320 | // non-trapping. If both are true, the instruction is inserted into the set and |
| 321 | // true is returned. |
| 322 | static bool DominatesMergePoint(Value *V, BasicBlock *BB, |
| 323 | std::set<Instruction*> *AggressiveInsts) { |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 324 | Instruction *I = dyn_cast<Instruction>(V); |
Chris Lattner | b74b181 | 2006-10-20 00:42:07 +0000 | [diff] [blame] | 325 | if (!I) { |
| 326 | // Non-instructions all dominate instructions, but not all constantexprs |
| 327 | // can be executed unconditionally. |
| 328 | if (ConstantExpr *C = dyn_cast<ConstantExpr>(V)) |
| 329 | if (C->canTrap()) |
| 330 | return false; |
| 331 | return true; |
| 332 | } |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 333 | BasicBlock *PBB = I->getParent(); |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 334 | |
Chris Lattner | da895d6 | 2005-02-27 06:18:25 +0000 | [diff] [blame] | 335 | // We don't want to allow weird loops that might have the "if condition" in |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 336 | // the bottom of this block. |
| 337 | if (PBB == BB) return false; |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 338 | |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 339 | // If this instruction is defined in a block that contains an unconditional |
| 340 | // branch to BB, then it must be in the 'conditional' part of the "if |
| 341 | // statement". |
| 342 | if (BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator())) |
| 343 | if (BI->isUnconditional() && BI->getSuccessor(0) == BB) { |
Chris Lattner | 9c07866 | 2004-10-14 05:13:36 +0000 | [diff] [blame] | 344 | if (!AggressiveInsts) return false; |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 345 | // Okay, it looks like the instruction IS in the "condition". Check to |
| 346 | // see if its a cheap instruction to unconditionally compute, and if it |
| 347 | // only uses stuff defined outside of the condition. If so, hoist it out. |
| 348 | switch (I->getOpcode()) { |
| 349 | default: return false; // Cannot hoist this out safely. |
| 350 | case Instruction::Load: |
| 351 | // We can hoist loads that are non-volatile and obviously cannot trap. |
| 352 | if (cast<LoadInst>(I)->isVolatile()) |
| 353 | return false; |
| 354 | if (!isa<AllocaInst>(I->getOperand(0)) && |
Reid Spencer | 460f16c | 2004-07-18 00:32:14 +0000 | [diff] [blame] | 355 | !isa<Constant>(I->getOperand(0))) |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 356 | return false; |
| 357 | |
| 358 | // Finally, we have to check to make sure there are no instructions |
| 359 | // before the load in its basic block, as we are going to hoist the loop |
| 360 | // out to its predecessor. |
| 361 | if (PBB->begin() != BasicBlock::iterator(I)) |
| 362 | return false; |
| 363 | break; |
| 364 | case Instruction::Add: |
| 365 | case Instruction::Sub: |
| 366 | case Instruction::And: |
| 367 | case Instruction::Or: |
| 368 | case Instruction::Xor: |
| 369 | case Instruction::Shl: |
Reid Spencer | 3822ff5 | 2006-11-08 06:47:33 +0000 | [diff] [blame] | 370 | case Instruction::LShr: |
| 371 | case Instruction::AShr: |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 372 | case Instruction::ICmp: |
| 373 | case Instruction::FCmp: |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 374 | break; // These are all cheap and non-trapping instructions. |
| 375 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 376 | |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 377 | // Okay, we can only really hoist these out if their operands are not |
| 378 | // defined in the conditional region. |
| 379 | for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) |
Chris Lattner | 9c07866 | 2004-10-14 05:13:36 +0000 | [diff] [blame] | 380 | if (!DominatesMergePoint(I->getOperand(i), BB, 0)) |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 381 | return false; |
Chris Lattner | 9c07866 | 2004-10-14 05:13:36 +0000 | [diff] [blame] | 382 | // Okay, it's safe to do this! Remember this instruction. |
| 383 | AggressiveInsts->insert(I); |
Chris Lattner | 570751c | 2004-04-09 22:50:22 +0000 | [diff] [blame] | 384 | } |
| 385 | |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 386 | return true; |
| 387 | } |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 388 | |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 389 | // GatherConstantSetEQs - Given a potentially 'or'd together collection of |
| 390 | // icmp_eq instructions that compare a value against a constant, return the |
| 391 | // value being compared, and stick the constant into the Values vector. |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 392 | static Value *GatherConstantSetEQs(Value *V, std::vector<ConstantInt*> &Values){ |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 393 | if (Instruction *Inst = dyn_cast<Instruction>(V)) |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 394 | if (Inst->getOpcode() == Instruction::ICmp && |
| 395 | cast<ICmpInst>(Inst)->getPredicate() == ICmpInst::ICMP_EQ) { |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 396 | if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(1))) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 397 | Values.push_back(C); |
| 398 | return Inst->getOperand(0); |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 399 | } else if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(0))) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 400 | Values.push_back(C); |
| 401 | return Inst->getOperand(1); |
| 402 | } |
| 403 | } else if (Inst->getOpcode() == Instruction::Or) { |
| 404 | if (Value *LHS = GatherConstantSetEQs(Inst->getOperand(0), Values)) |
| 405 | if (Value *RHS = GatherConstantSetEQs(Inst->getOperand(1), Values)) |
| 406 | if (LHS == RHS) |
| 407 | return LHS; |
| 408 | } |
| 409 | return 0; |
| 410 | } |
| 411 | |
| 412 | // GatherConstantSetNEs - Given a potentially 'and'd together collection of |
| 413 | // setne instructions that compare a value against a constant, return the value |
| 414 | // being compared, and stick the constant into the Values vector. |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 415 | static Value *GatherConstantSetNEs(Value *V, std::vector<ConstantInt*> &Values){ |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 416 | if (Instruction *Inst = dyn_cast<Instruction>(V)) |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 417 | if (Inst->getOpcode() == Instruction::ICmp && |
| 418 | cast<ICmpInst>(Inst)->getPredicate() == ICmpInst::ICMP_NE) { |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 419 | if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(1))) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 420 | Values.push_back(C); |
| 421 | return Inst->getOperand(0); |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 422 | } else if (ConstantInt *C = dyn_cast<ConstantInt>(Inst->getOperand(0))) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 423 | Values.push_back(C); |
| 424 | return Inst->getOperand(1); |
| 425 | } |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 426 | } else if (Inst->getOpcode() == Instruction::And) { |
| 427 | if (Value *LHS = GatherConstantSetNEs(Inst->getOperand(0), Values)) |
| 428 | if (Value *RHS = GatherConstantSetNEs(Inst->getOperand(1), Values)) |
| 429 | if (LHS == RHS) |
| 430 | return LHS; |
| 431 | } |
| 432 | return 0; |
| 433 | } |
| 434 | |
| 435 | |
| 436 | |
| 437 | /// GatherValueComparisons - If the specified Cond is an 'and' or 'or' of a |
| 438 | /// bunch of comparisons of one value against constants, return the value and |
| 439 | /// the constants being compared. |
| 440 | static bool GatherValueComparisons(Instruction *Cond, Value *&CompVal, |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 441 | std::vector<ConstantInt*> &Values) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 442 | if (Cond->getOpcode() == Instruction::Or) { |
| 443 | CompVal = GatherConstantSetEQs(Cond, Values); |
| 444 | |
| 445 | // Return true to indicate that the condition is true if the CompVal is |
| 446 | // equal to one of the constants. |
| 447 | return true; |
| 448 | } else if (Cond->getOpcode() == Instruction::And) { |
| 449 | CompVal = GatherConstantSetNEs(Cond, Values); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 450 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 451 | // Return false to indicate that the condition is false if the CompVal is |
| 452 | // equal to one of the constants. |
| 453 | return false; |
| 454 | } |
| 455 | return false; |
| 456 | } |
| 457 | |
| 458 | /// ErasePossiblyDeadInstructionTree - If the specified instruction is dead and |
| 459 | /// has no side effects, nuke it. If it uses any instructions that become dead |
| 460 | /// because the instruction is now gone, nuke them too. |
| 461 | static void ErasePossiblyDeadInstructionTree(Instruction *I) { |
Chris Lattner | 8cfe633 | 2006-08-03 21:40:24 +0000 | [diff] [blame] | 462 | if (!isInstructionTriviallyDead(I)) return; |
| 463 | |
| 464 | std::vector<Instruction*> InstrsToInspect; |
| 465 | InstrsToInspect.push_back(I); |
| 466 | |
| 467 | while (!InstrsToInspect.empty()) { |
| 468 | I = InstrsToInspect.back(); |
| 469 | InstrsToInspect.pop_back(); |
| 470 | |
| 471 | if (!isInstructionTriviallyDead(I)) continue; |
| 472 | |
| 473 | // If I is in the work list multiple times, remove previous instances. |
| 474 | for (unsigned i = 0, e = InstrsToInspect.size(); i != e; ++i) |
| 475 | if (InstrsToInspect[i] == I) { |
| 476 | InstrsToInspect.erase(InstrsToInspect.begin()+i); |
| 477 | --i, --e; |
| 478 | } |
| 479 | |
| 480 | // Add operands of dead instruction to worklist. |
| 481 | for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) |
| 482 | if (Instruction *OpI = dyn_cast<Instruction>(I->getOperand(i))) |
| 483 | InstrsToInspect.push_back(OpI); |
| 484 | |
| 485 | // Remove dead instruction. |
| 486 | I->eraseFromParent(); |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 487 | } |
| 488 | } |
| 489 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 490 | // isValueEqualityComparison - Return true if the specified terminator checks to |
| 491 | // see if a value is equal to constant integer value. |
| 492 | static Value *isValueEqualityComparison(TerminatorInst *TI) { |
Chris Lattner | 4bebf08 | 2004-03-16 19:45:22 +0000 | [diff] [blame] | 493 | if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { |
| 494 | // Do not permit merging of large switch instructions into their |
| 495 | // predecessors unless there is only one predecessor. |
| 496 | if (SI->getNumSuccessors() * std::distance(pred_begin(SI->getParent()), |
| 497 | pred_end(SI->getParent())) > 128) |
| 498 | return 0; |
| 499 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 500 | return SI->getCondition(); |
Chris Lattner | 4bebf08 | 2004-03-16 19:45:22 +0000 | [diff] [blame] | 501 | } |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 502 | if (BranchInst *BI = dyn_cast<BranchInst>(TI)) |
| 503 | if (BI->isConditional() && BI->getCondition()->hasOneUse()) |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 504 | if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) |
| 505 | if ((ICI->getPredicate() == ICmpInst::ICMP_EQ || |
| 506 | ICI->getPredicate() == ICmpInst::ICMP_NE) && |
| 507 | isa<ConstantInt>(ICI->getOperand(1))) |
| 508 | return ICI->getOperand(0); |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 509 | return 0; |
| 510 | } |
| 511 | |
| 512 | // Given a value comparison instruction, decode all of the 'cases' that it |
| 513 | // represents and return the 'default' block. |
| 514 | static BasicBlock * |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 515 | GetValueEqualityComparisonCases(TerminatorInst *TI, |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 516 | std::vector<std::pair<ConstantInt*, |
| 517 | BasicBlock*> > &Cases) { |
| 518 | if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { |
| 519 | Cases.reserve(SI->getNumCases()); |
| 520 | for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i) |
Chris Lattner | be54dcc | 2005-02-26 18:33:28 +0000 | [diff] [blame] | 521 | Cases.push_back(std::make_pair(SI->getCaseValue(i), SI->getSuccessor(i))); |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 522 | return SI->getDefaultDest(); |
| 523 | } |
| 524 | |
| 525 | BranchInst *BI = cast<BranchInst>(TI); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 526 | ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); |
| 527 | Cases.push_back(std::make_pair(cast<ConstantInt>(ICI->getOperand(1)), |
| 528 | BI->getSuccessor(ICI->getPredicate() == |
| 529 | ICmpInst::ICMP_NE))); |
| 530 | return BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_EQ); |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 531 | } |
| 532 | |
| 533 | |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 534 | // EliminateBlockCases - Given an vector of bb/value pairs, remove any entries |
| 535 | // in the list that match the specified block. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 536 | static void EliminateBlockCases(BasicBlock *BB, |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 537 | std::vector<std::pair<ConstantInt*, BasicBlock*> > &Cases) { |
| 538 | for (unsigned i = 0, e = Cases.size(); i != e; ++i) |
| 539 | if (Cases[i].second == BB) { |
| 540 | Cases.erase(Cases.begin()+i); |
| 541 | --i; --e; |
| 542 | } |
| 543 | } |
| 544 | |
| 545 | // ValuesOverlap - Return true if there are any keys in C1 that exist in C2 as |
| 546 | // well. |
| 547 | static bool |
| 548 | ValuesOverlap(std::vector<std::pair<ConstantInt*, BasicBlock*> > &C1, |
| 549 | std::vector<std::pair<ConstantInt*, BasicBlock*> > &C2) { |
| 550 | std::vector<std::pair<ConstantInt*, BasicBlock*> > *V1 = &C1, *V2 = &C2; |
| 551 | |
| 552 | // Make V1 be smaller than V2. |
| 553 | if (V1->size() > V2->size()) |
| 554 | std::swap(V1, V2); |
| 555 | |
| 556 | if (V1->size() == 0) return false; |
| 557 | if (V1->size() == 1) { |
| 558 | // Just scan V2. |
| 559 | ConstantInt *TheVal = (*V1)[0].first; |
| 560 | for (unsigned i = 0, e = V2->size(); i != e; ++i) |
| 561 | if (TheVal == (*V2)[i].first) |
| 562 | return true; |
| 563 | } |
| 564 | |
| 565 | // Otherwise, just sort both lists and compare element by element. |
| 566 | std::sort(V1->begin(), V1->end()); |
| 567 | std::sort(V2->begin(), V2->end()); |
| 568 | unsigned i1 = 0, i2 = 0, e1 = V1->size(), e2 = V2->size(); |
| 569 | while (i1 != e1 && i2 != e2) { |
| 570 | if ((*V1)[i1].first == (*V2)[i2].first) |
| 571 | return true; |
| 572 | if ((*V1)[i1].first < (*V2)[i2].first) |
| 573 | ++i1; |
| 574 | else |
| 575 | ++i2; |
| 576 | } |
| 577 | return false; |
| 578 | } |
| 579 | |
| 580 | // SimplifyEqualityComparisonWithOnlyPredecessor - If TI is known to be a |
| 581 | // terminator instruction and its block is known to only have a single |
| 582 | // predecessor block, check to see if that predecessor is also a value |
| 583 | // comparison with the same value, and if that comparison determines the outcome |
| 584 | // of this comparison. If so, simplify TI. This does a very limited form of |
| 585 | // jump threading. |
| 586 | static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, |
| 587 | BasicBlock *Pred) { |
| 588 | Value *PredVal = isValueEqualityComparison(Pred->getTerminator()); |
| 589 | if (!PredVal) return false; // Not a value comparison in predecessor. |
| 590 | |
| 591 | Value *ThisVal = isValueEqualityComparison(TI); |
| 592 | assert(ThisVal && "This isn't a value comparison!!"); |
| 593 | if (ThisVal != PredVal) return false; // Different predicates. |
| 594 | |
| 595 | // Find out information about when control will move from Pred to TI's block. |
| 596 | std::vector<std::pair<ConstantInt*, BasicBlock*> > PredCases; |
| 597 | BasicBlock *PredDef = GetValueEqualityComparisonCases(Pred->getTerminator(), |
| 598 | PredCases); |
| 599 | EliminateBlockCases(PredDef, PredCases); // Remove default from cases. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 600 | |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 601 | // Find information about how control leaves this block. |
| 602 | std::vector<std::pair<ConstantInt*, BasicBlock*> > ThisCases; |
| 603 | BasicBlock *ThisDef = GetValueEqualityComparisonCases(TI, ThisCases); |
| 604 | EliminateBlockCases(ThisDef, ThisCases); // Remove default from cases. |
| 605 | |
| 606 | // If TI's block is the default block from Pred's comparison, potentially |
| 607 | // simplify TI based on this knowledge. |
| 608 | if (PredDef == TI->getParent()) { |
| 609 | // If we are here, we know that the value is none of those cases listed in |
| 610 | // PredCases. If there are any cases in ThisCases that are in PredCases, we |
| 611 | // can simplify TI. |
| 612 | if (ValuesOverlap(PredCases, ThisCases)) { |
| 613 | if (BranchInst *BTI = dyn_cast<BranchInst>(TI)) { |
| 614 | // Okay, one of the successors of this condbr is dead. Convert it to a |
| 615 | // uncond br. |
| 616 | assert(ThisCases.size() == 1 && "Branch can only have one case!"); |
| 617 | Value *Cond = BTI->getCondition(); |
| 618 | // Insert the new branch. |
| 619 | Instruction *NI = new BranchInst(ThisDef, TI); |
| 620 | |
| 621 | // Remove PHI node entries for the dead edge. |
| 622 | ThisCases[0].second->removePredecessor(TI->getParent()); |
| 623 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 624 | DOUT << "Threading pred instr: " << *Pred->getTerminator() |
| 625 | << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n"; |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 626 | |
| 627 | TI->eraseFromParent(); // Nuke the old one. |
| 628 | // If condition is now dead, nuke it. |
| 629 | if (Instruction *CondI = dyn_cast<Instruction>(Cond)) |
| 630 | ErasePossiblyDeadInstructionTree(CondI); |
| 631 | return true; |
| 632 | |
| 633 | } else { |
| 634 | SwitchInst *SI = cast<SwitchInst>(TI); |
| 635 | // Okay, TI has cases that are statically dead, prune them away. |
| 636 | std::set<Constant*> DeadCases; |
| 637 | for (unsigned i = 0, e = PredCases.size(); i != e; ++i) |
| 638 | DeadCases.insert(PredCases[i].first); |
| 639 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 640 | DOUT << "Threading pred instr: " << *Pred->getTerminator() |
| 641 | << "Through successor TI: " << *TI; |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 642 | |
| 643 | for (unsigned i = SI->getNumCases()-1; i != 0; --i) |
| 644 | if (DeadCases.count(SI->getCaseValue(i))) { |
| 645 | SI->getSuccessor(i)->removePredecessor(TI->getParent()); |
| 646 | SI->removeCase(i); |
| 647 | } |
| 648 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 649 | DOUT << "Leaving: " << *TI << "\n"; |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 650 | return true; |
| 651 | } |
| 652 | } |
| 653 | |
| 654 | } else { |
| 655 | // Otherwise, TI's block must correspond to some matched value. Find out |
| 656 | // which value (or set of values) this is. |
| 657 | ConstantInt *TIV = 0; |
| 658 | BasicBlock *TIBB = TI->getParent(); |
| 659 | for (unsigned i = 0, e = PredCases.size(); i != e; ++i) |
| 660 | if (PredCases[i].second == TIBB) |
| 661 | if (TIV == 0) |
| 662 | TIV = PredCases[i].first; |
| 663 | else |
| 664 | return false; // Cannot handle multiple values coming to this block. |
| 665 | assert(TIV && "No edge from pred to succ?"); |
| 666 | |
| 667 | // Okay, we found the one constant that our value can be if we get into TI's |
| 668 | // BB. Find out which successor will unconditionally be branched to. |
| 669 | BasicBlock *TheRealDest = 0; |
| 670 | for (unsigned i = 0, e = ThisCases.size(); i != e; ++i) |
| 671 | if (ThisCases[i].first == TIV) { |
| 672 | TheRealDest = ThisCases[i].second; |
| 673 | break; |
| 674 | } |
| 675 | |
| 676 | // If not handled by any explicit cases, it is handled by the default case. |
| 677 | if (TheRealDest == 0) TheRealDest = ThisDef; |
| 678 | |
| 679 | // Remove PHI node entries for dead edges. |
| 680 | BasicBlock *CheckEdge = TheRealDest; |
| 681 | for (succ_iterator SI = succ_begin(TIBB), e = succ_end(TIBB); SI != e; ++SI) |
| 682 | if (*SI != CheckEdge) |
| 683 | (*SI)->removePredecessor(TIBB); |
| 684 | else |
| 685 | CheckEdge = 0; |
| 686 | |
| 687 | // Insert the new branch. |
| 688 | Instruction *NI = new BranchInst(TheRealDest, TI); |
| 689 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 690 | DOUT << "Threading pred instr: " << *Pred->getTerminator() |
| 691 | << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n"; |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 692 | Instruction *Cond = 0; |
| 693 | if (BranchInst *BI = dyn_cast<BranchInst>(TI)) |
| 694 | Cond = dyn_cast<Instruction>(BI->getCondition()); |
| 695 | TI->eraseFromParent(); // Nuke the old one. |
| 696 | |
| 697 | if (Cond) ErasePossiblyDeadInstructionTree(Cond); |
| 698 | return true; |
| 699 | } |
| 700 | return false; |
| 701 | } |
| 702 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 703 | // FoldValueComparisonIntoPredecessors - The specified terminator is a value |
| 704 | // equality comparison instruction (either a switch or a branch on "X == c"). |
| 705 | // See if any of the predecessors of the terminator block are value comparisons |
| 706 | // on the same value. If so, and if safe to do so, fold them together. |
| 707 | static bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI) { |
| 708 | BasicBlock *BB = TI->getParent(); |
| 709 | Value *CV = isValueEqualityComparison(TI); // CondVal |
| 710 | assert(CV && "Not a comparison?"); |
| 711 | bool Changed = false; |
| 712 | |
| 713 | std::vector<BasicBlock*> Preds(pred_begin(BB), pred_end(BB)); |
| 714 | while (!Preds.empty()) { |
| 715 | BasicBlock *Pred = Preds.back(); |
| 716 | Preds.pop_back(); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 717 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 718 | // See if the predecessor is a comparison with the same value. |
| 719 | TerminatorInst *PTI = Pred->getTerminator(); |
| 720 | Value *PCV = isValueEqualityComparison(PTI); // PredCondVal |
| 721 | |
| 722 | if (PCV == CV && SafeToMergeTerminators(TI, PTI)) { |
| 723 | // Figure out which 'cases' to copy from SI to PSI. |
| 724 | std::vector<std::pair<ConstantInt*, BasicBlock*> > BBCases; |
| 725 | BasicBlock *BBDefault = GetValueEqualityComparisonCases(TI, BBCases); |
| 726 | |
| 727 | std::vector<std::pair<ConstantInt*, BasicBlock*> > PredCases; |
| 728 | BasicBlock *PredDefault = GetValueEqualityComparisonCases(PTI, PredCases); |
| 729 | |
| 730 | // Based on whether the default edge from PTI goes to BB or not, fill in |
| 731 | // PredCases and PredDefault with the new switch cases we would like to |
| 732 | // build. |
| 733 | std::vector<BasicBlock*> NewSuccessors; |
| 734 | |
| 735 | if (PredDefault == BB) { |
| 736 | // If this is the default destination from PTI, only the edges in TI |
| 737 | // that don't occur in PTI, or that branch to BB will be activated. |
| 738 | std::set<ConstantInt*> PTIHandled; |
| 739 | for (unsigned i = 0, e = PredCases.size(); i != e; ++i) |
| 740 | if (PredCases[i].second != BB) |
| 741 | PTIHandled.insert(PredCases[i].first); |
| 742 | else { |
| 743 | // The default destination is BB, we don't need explicit targets. |
| 744 | std::swap(PredCases[i], PredCases.back()); |
| 745 | PredCases.pop_back(); |
| 746 | --i; --e; |
| 747 | } |
| 748 | |
| 749 | // Reconstruct the new switch statement we will be building. |
| 750 | if (PredDefault != BBDefault) { |
| 751 | PredDefault->removePredecessor(Pred); |
| 752 | PredDefault = BBDefault; |
| 753 | NewSuccessors.push_back(BBDefault); |
| 754 | } |
| 755 | for (unsigned i = 0, e = BBCases.size(); i != e; ++i) |
| 756 | if (!PTIHandled.count(BBCases[i].first) && |
| 757 | BBCases[i].second != BBDefault) { |
| 758 | PredCases.push_back(BBCases[i]); |
| 759 | NewSuccessors.push_back(BBCases[i].second); |
| 760 | } |
| 761 | |
| 762 | } else { |
| 763 | // If this is not the default destination from PSI, only the edges |
| 764 | // in SI that occur in PSI with a destination of BB will be |
| 765 | // activated. |
| 766 | std::set<ConstantInt*> PTIHandled; |
| 767 | for (unsigned i = 0, e = PredCases.size(); i != e; ++i) |
| 768 | if (PredCases[i].second == BB) { |
| 769 | PTIHandled.insert(PredCases[i].first); |
| 770 | std::swap(PredCases[i], PredCases.back()); |
| 771 | PredCases.pop_back(); |
| 772 | --i; --e; |
| 773 | } |
| 774 | |
| 775 | // Okay, now we know which constants were sent to BB from the |
| 776 | // predecessor. Figure out where they will all go now. |
| 777 | for (unsigned i = 0, e = BBCases.size(); i != e; ++i) |
| 778 | if (PTIHandled.count(BBCases[i].first)) { |
| 779 | // If this is one we are capable of getting... |
| 780 | PredCases.push_back(BBCases[i]); |
| 781 | NewSuccessors.push_back(BBCases[i].second); |
| 782 | PTIHandled.erase(BBCases[i].first);// This constant is taken care of |
| 783 | } |
| 784 | |
| 785 | // If there are any constants vectored to BB that TI doesn't handle, |
| 786 | // they must go to the default destination of TI. |
| 787 | for (std::set<ConstantInt*>::iterator I = PTIHandled.begin(), |
| 788 | E = PTIHandled.end(); I != E; ++I) { |
| 789 | PredCases.push_back(std::make_pair(*I, BBDefault)); |
| 790 | NewSuccessors.push_back(BBDefault); |
| 791 | } |
| 792 | } |
| 793 | |
| 794 | // Okay, at this point, we know which new successor Pred will get. Make |
| 795 | // sure we update the number of entries in the PHI nodes for these |
| 796 | // successors. |
| 797 | for (unsigned i = 0, e = NewSuccessors.size(); i != e; ++i) |
| 798 | AddPredecessorToBlock(NewSuccessors[i], Pred, BB); |
| 799 | |
| 800 | // Now that the successors are updated, create the new Switch instruction. |
Chris Lattner | 3788059 | 2005-01-29 00:38:26 +0000 | [diff] [blame] | 801 | SwitchInst *NewSI = new SwitchInst(CV, PredDefault, PredCases.size(),PTI); |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 802 | for (unsigned i = 0, e = PredCases.size(); i != e; ++i) |
| 803 | NewSI->addCase(PredCases[i].first, PredCases[i].second); |
Chris Lattner | 13b2f76 | 2005-01-01 16:02:12 +0000 | [diff] [blame] | 804 | |
| 805 | Instruction *DeadCond = 0; |
| 806 | if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) |
| 807 | // If PTI is a branch, remember the condition. |
| 808 | DeadCond = dyn_cast<Instruction>(BI->getCondition()); |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 809 | Pred->getInstList().erase(PTI); |
| 810 | |
Chris Lattner | 13b2f76 | 2005-01-01 16:02:12 +0000 | [diff] [blame] | 811 | // If the condition is dead now, remove the instruction tree. |
| 812 | if (DeadCond) ErasePossiblyDeadInstructionTree(DeadCond); |
| 813 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 814 | // Okay, last check. If BB is still a successor of PSI, then we must |
| 815 | // have an infinite loop case. If so, add an infinitely looping block |
| 816 | // to handle the case to preserve the behavior of the code. |
| 817 | BasicBlock *InfLoopBlock = 0; |
| 818 | for (unsigned i = 0, e = NewSI->getNumSuccessors(); i != e; ++i) |
| 819 | if (NewSI->getSuccessor(i) == BB) { |
| 820 | if (InfLoopBlock == 0) { |
| 821 | // Insert it at the end of the loop, because it's either code, |
| 822 | // or it won't matter if it's hot. :) |
| 823 | InfLoopBlock = new BasicBlock("infloop", BB->getParent()); |
| 824 | new BranchInst(InfLoopBlock, InfLoopBlock); |
| 825 | } |
| 826 | NewSI->setSuccessor(i, InfLoopBlock); |
| 827 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 828 | |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 829 | Changed = true; |
| 830 | } |
| 831 | } |
| 832 | return Changed; |
| 833 | } |
| 834 | |
Chris Lattner | 6306d07 | 2005-08-03 17:59:45 +0000 | [diff] [blame] | 835 | /// HoistThenElseCodeToIf - Given a conditional branch that goes to BB1 and |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 836 | /// BB2, hoist any common code in the two blocks up into the branch block. The |
| 837 | /// caller of this function guarantees that BI's block dominates BB1 and BB2. |
| 838 | static bool HoistThenElseCodeToIf(BranchInst *BI) { |
| 839 | // This does very trivial matching, with limited scanning, to find identical |
| 840 | // instructions in the two blocks. In particular, we don't want to get into |
| 841 | // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As |
| 842 | // such, we currently just scan for obviously identical instructions in an |
| 843 | // identical order. |
| 844 | BasicBlock *BB1 = BI->getSuccessor(0); // The true destination. |
| 845 | BasicBlock *BB2 = BI->getSuccessor(1); // The false destination |
| 846 | |
| 847 | Instruction *I1 = BB1->begin(), *I2 = BB2->begin(); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 848 | if (I1->getOpcode() != I2->getOpcode() || isa<PHINode>(I1) || |
| 849 | isa<InvokeInst>(I1) || !I1->isIdenticalTo(I2)) |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 850 | return false; |
| 851 | |
| 852 | // If we get here, we can hoist at least one instruction. |
| 853 | BasicBlock *BIParent = BI->getParent(); |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 854 | |
| 855 | do { |
| 856 | // If we are hoisting the terminator instruction, don't move one (making a |
| 857 | // broken BB), instead clone it, and remove BI. |
| 858 | if (isa<TerminatorInst>(I1)) |
| 859 | goto HoistTerminator; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 860 | |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 861 | // For a normal instruction, we just move one to right before the branch, |
| 862 | // then replace all uses of the other with the first. Finally, we remove |
| 863 | // the now redundant second instruction. |
| 864 | BIParent->getInstList().splice(BI, BB1->getInstList(), I1); |
| 865 | if (!I2->use_empty()) |
| 866 | I2->replaceAllUsesWith(I1); |
| 867 | BB2->getInstList().erase(I2); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 868 | |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 869 | I1 = BB1->begin(); |
| 870 | I2 = BB2->begin(); |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 871 | } while (I1->getOpcode() == I2->getOpcode() && I1->isIdenticalTo(I2)); |
| 872 | |
| 873 | return true; |
| 874 | |
| 875 | HoistTerminator: |
| 876 | // Okay, it is safe to hoist the terminator. |
| 877 | Instruction *NT = I1->clone(); |
| 878 | BIParent->getInstList().insert(BI, NT); |
| 879 | if (NT->getType() != Type::VoidTy) { |
| 880 | I1->replaceAllUsesWith(NT); |
| 881 | I2->replaceAllUsesWith(NT); |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 882 | NT->takeName(I1); |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 883 | } |
| 884 | |
| 885 | // Hoisting one of the terminators from our successor is a great thing. |
| 886 | // Unfortunately, the successors of the if/else blocks may have PHI nodes in |
| 887 | // them. If they do, all PHI entries for BB1/BB2 must agree for all PHI |
| 888 | // nodes, so we insert select instruction to compute the final result. |
| 889 | std::map<std::pair<Value*,Value*>, SelectInst*> InsertedSelects; |
| 890 | for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) { |
| 891 | PHINode *PN; |
| 892 | for (BasicBlock::iterator BBI = SI->begin(); |
Chris Lattner | 0f535c6 | 2004-11-30 07:47:34 +0000 | [diff] [blame] | 893 | (PN = dyn_cast<PHINode>(BBI)); ++BBI) { |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 894 | Value *BB1V = PN->getIncomingValueForBlock(BB1); |
| 895 | Value *BB2V = PN->getIncomingValueForBlock(BB2); |
| 896 | if (BB1V != BB2V) { |
| 897 | // These values do not agree. Insert a select instruction before NT |
| 898 | // that determines the right value. |
| 899 | SelectInst *&SI = InsertedSelects[std::make_pair(BB1V, BB2V)]; |
| 900 | if (SI == 0) |
| 901 | SI = new SelectInst(BI->getCondition(), BB1V, BB2V, |
| 902 | BB1V->getName()+"."+BB2V->getName(), NT); |
| 903 | // Make the PHI node use the select for all incoming values for BB1/BB2 |
| 904 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) |
| 905 | if (PN->getIncomingBlock(i) == BB1 || PN->getIncomingBlock(i) == BB2) |
| 906 | PN->setIncomingValue(i, SI); |
| 907 | } |
| 908 | } |
| 909 | } |
| 910 | |
| 911 | // Update any PHI nodes in our new successors. |
| 912 | for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) |
| 913 | AddPredecessorToBlock(*SI, BIParent, BB1); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 914 | |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 915 | BI->eraseFromParent(); |
| 916 | return true; |
| 917 | } |
| 918 | |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 919 | /// BlockIsSimpleEnoughToThreadThrough - Return true if we can thread a branch |
| 920 | /// across this block. |
| 921 | static bool BlockIsSimpleEnoughToThreadThrough(BasicBlock *BB) { |
| 922 | BranchInst *BI = cast<BranchInst>(BB->getTerminator()); |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 923 | unsigned Size = 0; |
| 924 | |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 925 | // If this basic block contains anything other than a PHI (which controls the |
| 926 | // branch) and branch itself, bail out. FIXME: improve this in the future. |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 927 | for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI, ++Size) { |
| 928 | if (Size > 10) return false; // Don't clone large BB's. |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 929 | |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 930 | // We can only support instructions that are do not define values that are |
| 931 | // live outside of the current basic block. |
| 932 | for (Value::use_iterator UI = BBI->use_begin(), E = BBI->use_end(); |
| 933 | UI != E; ++UI) { |
| 934 | Instruction *U = cast<Instruction>(*UI); |
| 935 | if (U->getParent() != BB || isa<PHINode>(U)) return false; |
| 936 | } |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 937 | |
| 938 | // Looks ok, continue checking. |
| 939 | } |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 940 | |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 941 | return true; |
| 942 | } |
| 943 | |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 944 | /// FoldCondBranchOnPHI - If we have a conditional branch on a PHI node value |
| 945 | /// that is defined in the same block as the branch and if any PHI entries are |
| 946 | /// constants, thread edges corresponding to that entry to be branches to their |
| 947 | /// ultimate destination. |
| 948 | static bool FoldCondBranchOnPHI(BranchInst *BI) { |
| 949 | BasicBlock *BB = BI->getParent(); |
| 950 | PHINode *PN = dyn_cast<PHINode>(BI->getCondition()); |
Chris Lattner | 9c88d98 | 2005-09-19 23:57:04 +0000 | [diff] [blame] | 951 | // NOTE: we currently cannot transform this case if the PHI node is used |
| 952 | // outside of the block. |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 953 | if (!PN || PN->getParent() != BB || !PN->hasOneUse()) |
| 954 | return false; |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 955 | |
| 956 | // Degenerate case of a single entry PHI. |
| 957 | if (PN->getNumIncomingValues() == 1) { |
| 958 | if (PN->getIncomingValue(0) != PN) |
| 959 | PN->replaceAllUsesWith(PN->getIncomingValue(0)); |
| 960 | else |
| 961 | PN->replaceAllUsesWith(UndefValue::get(PN->getType())); |
| 962 | PN->eraseFromParent(); |
| 963 | return true; |
| 964 | } |
| 965 | |
| 966 | // Now we know that this block has multiple preds and two succs. |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 967 | if (!BlockIsSimpleEnoughToThreadThrough(BB)) return false; |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 968 | |
| 969 | // Okay, this is a simple enough basic block. See if any phi values are |
| 970 | // constants. |
Zhou Sheng | 6b6b6ef | 2007-01-11 12:24:14 +0000 | [diff] [blame] | 971 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { |
| 972 | ConstantInt *CB; |
| 973 | if ((CB = dyn_cast<ConstantInt>(PN->getIncomingValue(i))) && |
Reid Spencer | 4fe16d6 | 2007-01-11 18:21:29 +0000 | [diff] [blame] | 974 | CB->getType() == Type::Int1Ty) { |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 975 | // Okay, we now know that all edges from PredBB should be revectored to |
| 976 | // branch to RealDest. |
| 977 | BasicBlock *PredBB = PN->getIncomingBlock(i); |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 978 | BasicBlock *RealDest = BI->getSuccessor(!CB->getZExtValue()); |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 979 | |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 980 | if (RealDest == BB) continue; // Skip self loops. |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 981 | |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 982 | // The dest block might have PHI nodes, other predecessors and other |
| 983 | // difficult cases. Instead of being smart about this, just insert a new |
| 984 | // block that jumps to the destination block, effectively splitting |
| 985 | // the edge we are about to create. |
| 986 | BasicBlock *EdgeBB = new BasicBlock(RealDest->getName()+".critedge", |
| 987 | RealDest->getParent(), RealDest); |
| 988 | new BranchInst(RealDest, EdgeBB); |
| 989 | PHINode *PN; |
| 990 | for (BasicBlock::iterator BBI = RealDest->begin(); |
| 991 | (PN = dyn_cast<PHINode>(BBI)); ++BBI) { |
| 992 | Value *V = PN->getIncomingValueForBlock(BB); |
| 993 | PN->addIncoming(V, EdgeBB); |
| 994 | } |
| 995 | |
| 996 | // BB may have instructions that are being threaded over. Clone these |
| 997 | // instructions into EdgeBB. We know that there will be no uses of the |
| 998 | // cloned instructions outside of EdgeBB. |
| 999 | BasicBlock::iterator InsertPt = EdgeBB->begin(); |
| 1000 | std::map<Value*, Value*> TranslateMap; // Track translated values. |
| 1001 | for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { |
| 1002 | if (PHINode *PN = dyn_cast<PHINode>(BBI)) { |
| 1003 | TranslateMap[PN] = PN->getIncomingValueForBlock(PredBB); |
| 1004 | } else { |
| 1005 | // Clone the instruction. |
| 1006 | Instruction *N = BBI->clone(); |
| 1007 | if (BBI->hasName()) N->setName(BBI->getName()+".c"); |
| 1008 | |
| 1009 | // Update operands due to translation. |
| 1010 | for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { |
| 1011 | std::map<Value*, Value*>::iterator PI = |
| 1012 | TranslateMap.find(N->getOperand(i)); |
| 1013 | if (PI != TranslateMap.end()) |
| 1014 | N->setOperand(i, PI->second); |
| 1015 | } |
| 1016 | |
| 1017 | // Check for trivial simplification. |
| 1018 | if (Constant *C = ConstantFoldInstruction(N)) { |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 1019 | TranslateMap[BBI] = C; |
| 1020 | delete N; // Constant folded away, don't need actual inst |
| 1021 | } else { |
| 1022 | // Insert the new instruction into its new home. |
| 1023 | EdgeBB->getInstList().insert(InsertPt, N); |
| 1024 | if (!BBI->use_empty()) |
| 1025 | TranslateMap[BBI] = N; |
| 1026 | } |
| 1027 | } |
| 1028 | } |
| 1029 | |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1030 | // Loop over all of the edges from PredBB to BB, changing them to branch |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 1031 | // to EdgeBB instead. |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1032 | TerminatorInst *PredBBTI = PredBB->getTerminator(); |
| 1033 | for (unsigned i = 0, e = PredBBTI->getNumSuccessors(); i != e; ++i) |
| 1034 | if (PredBBTI->getSuccessor(i) == BB) { |
| 1035 | BB->removePredecessor(PredBB); |
Chris Lattner | e9487f0 | 2005-09-20 01:48:40 +0000 | [diff] [blame] | 1036 | PredBBTI->setSuccessor(i, EdgeBB); |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1037 | } |
| 1038 | |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1039 | // Recurse, simplifying any other constants. |
| 1040 | return FoldCondBranchOnPHI(BI) | true; |
| 1041 | } |
Zhou Sheng | 6b6b6ef | 2007-01-11 12:24:14 +0000 | [diff] [blame] | 1042 | } |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1043 | |
| 1044 | return false; |
| 1045 | } |
| 1046 | |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1047 | /// FoldTwoEntryPHINode - Given a BB that starts with the specified two-entry |
| 1048 | /// PHI node, see if we can eliminate it. |
| 1049 | static bool FoldTwoEntryPHINode(PHINode *PN) { |
| 1050 | // Ok, this is a two entry PHI node. Check to see if this is a simple "if |
| 1051 | // statement", which has a very simple dominance structure. Basically, we |
| 1052 | // are trying to find the condition that is being branched on, which |
| 1053 | // subsequently causes this merge to happen. We really want control |
| 1054 | // dependence information for this check, but simplifycfg can't keep it up |
| 1055 | // to date, and this catches most of the cases we care about anyway. |
| 1056 | // |
| 1057 | BasicBlock *BB = PN->getParent(); |
| 1058 | BasicBlock *IfTrue, *IfFalse; |
| 1059 | Value *IfCond = GetIfCondition(BB, IfTrue, IfFalse); |
| 1060 | if (!IfCond) return false; |
| 1061 | |
Chris Lattner | 822a879 | 2006-11-18 19:19:36 +0000 | [diff] [blame] | 1062 | // Okay, we found that we can merge this two-entry phi node into a select. |
| 1063 | // Doing so would require us to fold *all* two entry phi nodes in this block. |
| 1064 | // At some point this becomes non-profitable (particularly if the target |
| 1065 | // doesn't support cmov's). Only do this transformation if there are two or |
| 1066 | // fewer PHI nodes in this block. |
| 1067 | unsigned NumPhis = 0; |
| 1068 | for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++NumPhis, ++I) |
| 1069 | if (NumPhis > 2) |
| 1070 | return false; |
| 1071 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1072 | DOUT << "FOUND IF CONDITION! " << *IfCond << " T: " |
| 1073 | << IfTrue->getName() << " F: " << IfFalse->getName() << "\n"; |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1074 | |
| 1075 | // Loop over the PHI's seeing if we can promote them all to select |
| 1076 | // instructions. While we are at it, keep track of the instructions |
| 1077 | // that need to be moved to the dominating block. |
| 1078 | std::set<Instruction*> AggressiveInsts; |
| 1079 | |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1080 | BasicBlock::iterator AfterPHIIt = BB->begin(); |
| 1081 | while (isa<PHINode>(AfterPHIIt)) { |
| 1082 | PHINode *PN = cast<PHINode>(AfterPHIIt++); |
| 1083 | if (PN->getIncomingValue(0) == PN->getIncomingValue(1)) { |
| 1084 | if (PN->getIncomingValue(0) != PN) |
| 1085 | PN->replaceAllUsesWith(PN->getIncomingValue(0)); |
| 1086 | else |
| 1087 | PN->replaceAllUsesWith(UndefValue::get(PN->getType())); |
| 1088 | } else if (!DominatesMergePoint(PN->getIncomingValue(0), BB, |
| 1089 | &AggressiveInsts) || |
| 1090 | !DominatesMergePoint(PN->getIncomingValue(1), BB, |
| 1091 | &AggressiveInsts)) { |
Chris Lattner | 055dc10 | 2005-09-23 07:23:18 +0000 | [diff] [blame] | 1092 | return false; |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1093 | } |
| 1094 | } |
| 1095 | |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1096 | // If we all PHI nodes are promotable, check to make sure that all |
| 1097 | // instructions in the predecessor blocks can be promoted as well. If |
| 1098 | // not, we won't be able to get rid of the control flow, so it's not |
| 1099 | // worth promoting to select instructions. |
| 1100 | BasicBlock *DomBlock = 0, *IfBlock1 = 0, *IfBlock2 = 0; |
| 1101 | PN = cast<PHINode>(BB->begin()); |
| 1102 | BasicBlock *Pred = PN->getIncomingBlock(0); |
| 1103 | if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) { |
| 1104 | IfBlock1 = Pred; |
| 1105 | DomBlock = *pred_begin(Pred); |
| 1106 | for (BasicBlock::iterator I = Pred->begin(); |
| 1107 | !isa<TerminatorInst>(I); ++I) |
| 1108 | if (!AggressiveInsts.count(I)) { |
| 1109 | // This is not an aggressive instruction that we can promote. |
| 1110 | // Because of this, we won't be able to get rid of the control |
| 1111 | // flow, so the xform is not worth it. |
| 1112 | return false; |
| 1113 | } |
| 1114 | } |
| 1115 | |
| 1116 | Pred = PN->getIncomingBlock(1); |
| 1117 | if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) { |
| 1118 | IfBlock2 = Pred; |
| 1119 | DomBlock = *pred_begin(Pred); |
| 1120 | for (BasicBlock::iterator I = Pred->begin(); |
| 1121 | !isa<TerminatorInst>(I); ++I) |
| 1122 | if (!AggressiveInsts.count(I)) { |
| 1123 | // This is not an aggressive instruction that we can promote. |
| 1124 | // Because of this, we won't be able to get rid of the control |
| 1125 | // flow, so the xform is not worth it. |
| 1126 | return false; |
| 1127 | } |
| 1128 | } |
| 1129 | |
| 1130 | // If we can still promote the PHI nodes after this gauntlet of tests, |
| 1131 | // do all of the PHI's now. |
| 1132 | |
| 1133 | // Move all 'aggressive' instructions, which are defined in the |
| 1134 | // conditional parts of the if's up to the dominating block. |
| 1135 | if (IfBlock1) { |
| 1136 | DomBlock->getInstList().splice(DomBlock->getTerminator(), |
| 1137 | IfBlock1->getInstList(), |
| 1138 | IfBlock1->begin(), |
| 1139 | IfBlock1->getTerminator()); |
| 1140 | } |
| 1141 | if (IfBlock2) { |
| 1142 | DomBlock->getInstList().splice(DomBlock->getTerminator(), |
| 1143 | IfBlock2->getInstList(), |
| 1144 | IfBlock2->begin(), |
| 1145 | IfBlock2->getTerminator()); |
| 1146 | } |
| 1147 | |
| 1148 | while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { |
| 1149 | // Change the PHI node into a select instruction. |
| 1150 | Value *TrueVal = |
| 1151 | PN->getIncomingValue(PN->getIncomingBlock(0) == IfFalse); |
| 1152 | Value *FalseVal = |
| 1153 | PN->getIncomingValue(PN->getIncomingBlock(0) == IfTrue); |
| 1154 | |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1155 | Value *NV = new SelectInst(IfCond, TrueVal, FalseVal, "", AfterPHIIt); |
| 1156 | PN->replaceAllUsesWith(NV); |
| 1157 | NV->takeName(PN); |
| 1158 | |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1159 | BB->getInstList().erase(PN); |
| 1160 | } |
| 1161 | return true; |
| 1162 | } |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1163 | |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 1164 | namespace { |
| 1165 | /// ConstantIntOrdering - This class implements a stable ordering of constant |
| 1166 | /// integers that does not depend on their address. This is important for |
| 1167 | /// applications that sort ConstantInt's to ensure uniqueness. |
| 1168 | struct ConstantIntOrdering { |
| 1169 | bool operator()(const ConstantInt *LHS, const ConstantInt *RHS) const { |
Reid Spencer | e1c99d4 | 2007-03-02 23:01:14 +0000 | [diff] [blame] | 1170 | return LHS->getValue().ult(RHS->getValue()); |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 1171 | } |
| 1172 | }; |
| 1173 | } |
| 1174 | |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1175 | // SimplifyCFG - This function is used to do simplification of a CFG. For |
| 1176 | // example, it adjusts branches to branches to eliminate the extra hop, it |
| 1177 | // eliminates unreachable basic blocks, and does other "peephole" optimization |
Chris Lattner | e2ca540 | 2003-03-05 21:01:52 +0000 | [diff] [blame] | 1178 | // of the CFG. It returns true if a modification was made. |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1179 | // |
| 1180 | // WARNING: The entry node of a function may not be simplified. |
| 1181 | // |
Chris Lattner | f7703df | 2004-01-09 06:12:26 +0000 | [diff] [blame] | 1182 | bool llvm::SimplifyCFG(BasicBlock *BB) { |
Chris Lattner | dc3602b | 2003-08-24 18:36:16 +0000 | [diff] [blame] | 1183 | bool Changed = false; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1184 | Function *M = BB->getParent(); |
| 1185 | |
| 1186 | assert(BB && BB->getParent() && "Block not embedded in function!"); |
| 1187 | assert(BB->getTerminator() && "Degenerate basic block encountered!"); |
Dan Gohman | ecb7a77 | 2007-03-22 16:38:57 +0000 | [diff] [blame^] | 1188 | assert(&BB->getParent()->getEntryBlock() != BB && |
| 1189 | "Can't Simplify entry block!"); |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1190 | |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1191 | // Remove basic blocks that have no predecessors... which are unreachable. |
Chris Lattner | d52c261 | 2004-02-24 07:23:58 +0000 | [diff] [blame] | 1192 | if (pred_begin(BB) == pred_end(BB) || |
| 1193 | *pred_begin(BB) == BB && ++pred_begin(BB) == pred_end(BB)) { |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1194 | DOUT << "Removing BB: \n" << *BB; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1195 | |
| 1196 | // Loop through all of our successors and make sure they know that one |
| 1197 | // of their predecessors is going away. |
Chris Lattner | 151c80b | 2005-04-12 18:51:33 +0000 | [diff] [blame] | 1198 | for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) |
| 1199 | SI->removePredecessor(BB); |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1200 | |
| 1201 | while (!BB->empty()) { |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 1202 | Instruction &I = BB->back(); |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1203 | // If this instruction is used, replace uses with an arbitrary |
Chris Lattner | f5e982d | 2005-08-02 23:29:23 +0000 | [diff] [blame] | 1204 | // value. Because control flow can't get here, we don't care |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1205 | // what we replace the value with. Note that since this block is |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1206 | // unreachable, and all values contained within it must dominate their |
| 1207 | // uses, that all uses will eventually be removed. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1208 | if (!I.use_empty()) |
Chris Lattner | f5e982d | 2005-08-02 23:29:23 +0000 | [diff] [blame] | 1209 | // Make all users of this instruction use undef instead |
| 1210 | I.replaceAllUsesWith(UndefValue::get(I.getType())); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1211 | |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1212 | // Remove the instruction from the basic block |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 1213 | BB->getInstList().pop_back(); |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1214 | } |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 1215 | M->getBasicBlockList().erase(BB); |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1216 | return true; |
| 1217 | } |
| 1218 | |
Chris Lattner | 694e37f | 2003-08-17 19:41:53 +0000 | [diff] [blame] | 1219 | // Check to see if we can constant propagate this terminator instruction |
| 1220 | // away... |
Chris Lattner | dc3602b | 2003-08-24 18:36:16 +0000 | [diff] [blame] | 1221 | Changed |= ConstantFoldTerminator(BB); |
Chris Lattner | 694e37f | 2003-08-17 19:41:53 +0000 | [diff] [blame] | 1222 | |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1223 | // If this is a returning block with only PHI nodes in it, fold the return |
| 1224 | // instruction into any unconditional branch predecessors. |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1225 | // |
| 1226 | // If any predecessor is a conditional branch that just selects among |
| 1227 | // different return values, fold the replace the branch/return with a select |
| 1228 | // and return. |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1229 | if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator())) { |
| 1230 | BasicBlock::iterator BBI = BB->getTerminator(); |
| 1231 | if (BBI == BB->begin() || isa<PHINode>(--BBI)) { |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1232 | // Find predecessors that end with branches. |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1233 | std::vector<BasicBlock*> UncondBranchPreds; |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1234 | std::vector<BranchInst*> CondBranchPreds; |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1235 | for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { |
| 1236 | TerminatorInst *PTI = (*PI)->getTerminator(); |
| 1237 | if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) |
| 1238 | if (BI->isUnconditional()) |
| 1239 | UncondBranchPreds.push_back(*PI); |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1240 | else |
| 1241 | CondBranchPreds.push_back(BI); |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1242 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1243 | |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1244 | // If we found some, do the transformation! |
| 1245 | if (!UncondBranchPreds.empty()) { |
| 1246 | while (!UncondBranchPreds.empty()) { |
| 1247 | BasicBlock *Pred = UncondBranchPreds.back(); |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1248 | DOUT << "FOLDING: " << *BB |
| 1249 | << "INTO UNCOND BRANCH PRED: " << *Pred; |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1250 | UncondBranchPreds.pop_back(); |
| 1251 | Instruction *UncondBranch = Pred->getTerminator(); |
| 1252 | // Clone the return and add it to the end of the predecessor. |
| 1253 | Instruction *NewRet = RI->clone(); |
| 1254 | Pred->getInstList().push_back(NewRet); |
| 1255 | |
| 1256 | // If the return instruction returns a value, and if the value was a |
| 1257 | // PHI node in "BB", propagate the right value into the return. |
| 1258 | if (NewRet->getNumOperands() == 1) |
| 1259 | if (PHINode *PN = dyn_cast<PHINode>(NewRet->getOperand(0))) |
| 1260 | if (PN->getParent() == BB) |
| 1261 | NewRet->setOperand(0, PN->getIncomingValueForBlock(Pred)); |
| 1262 | // Update any PHI nodes in the returning block to realize that we no |
| 1263 | // longer branch to them. |
| 1264 | BB->removePredecessor(Pred); |
| 1265 | Pred->getInstList().erase(UncondBranch); |
| 1266 | } |
| 1267 | |
| 1268 | // If we eliminated all predecessors of the block, delete the block now. |
| 1269 | if (pred_begin(BB) == pred_end(BB)) |
| 1270 | // We know there are no successors, so just nuke the block. |
| 1271 | M->getBasicBlockList().erase(BB); |
| 1272 | |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1273 | return true; |
| 1274 | } |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1275 | |
| 1276 | // Check out all of the conditional branches going to this return |
| 1277 | // instruction. If any of them just select between returns, change the |
| 1278 | // branch itself into a select/return pair. |
| 1279 | while (!CondBranchPreds.empty()) { |
| 1280 | BranchInst *BI = CondBranchPreds.back(); |
| 1281 | CondBranchPreds.pop_back(); |
| 1282 | BasicBlock *TrueSucc = BI->getSuccessor(0); |
| 1283 | BasicBlock *FalseSucc = BI->getSuccessor(1); |
| 1284 | BasicBlock *OtherSucc = TrueSucc == BB ? FalseSucc : TrueSucc; |
| 1285 | |
| 1286 | // Check to see if the non-BB successor is also a return block. |
| 1287 | if (isa<ReturnInst>(OtherSucc->getTerminator())) { |
| 1288 | // Check to see if there are only PHI instructions in this block. |
| 1289 | BasicBlock::iterator OSI = OtherSucc->getTerminator(); |
| 1290 | if (OSI == OtherSucc->begin() || isa<PHINode>(--OSI)) { |
| 1291 | // Okay, we found a branch that is going to two return nodes. If |
| 1292 | // there is no return value for this function, just change the |
| 1293 | // branch into a return. |
| 1294 | if (RI->getNumOperands() == 0) { |
| 1295 | TrueSucc->removePredecessor(BI->getParent()); |
| 1296 | FalseSucc->removePredecessor(BI->getParent()); |
| 1297 | new ReturnInst(0, BI); |
| 1298 | BI->getParent()->getInstList().erase(BI); |
| 1299 | return true; |
| 1300 | } |
| 1301 | |
| 1302 | // Otherwise, figure out what the true and false return values are |
| 1303 | // so we can insert a new select instruction. |
| 1304 | Value *TrueValue = TrueSucc->getTerminator()->getOperand(0); |
| 1305 | Value *FalseValue = FalseSucc->getTerminator()->getOperand(0); |
| 1306 | |
| 1307 | // Unwrap any PHI nodes in the return blocks. |
| 1308 | if (PHINode *TVPN = dyn_cast<PHINode>(TrueValue)) |
| 1309 | if (TVPN->getParent() == TrueSucc) |
| 1310 | TrueValue = TVPN->getIncomingValueForBlock(BI->getParent()); |
| 1311 | if (PHINode *FVPN = dyn_cast<PHINode>(FalseValue)) |
| 1312 | if (FVPN->getParent() == FalseSucc) |
| 1313 | FalseValue = FVPN->getIncomingValueForBlock(BI->getParent()); |
| 1314 | |
Chris Lattner | b74b181 | 2006-10-20 00:42:07 +0000 | [diff] [blame] | 1315 | // In order for this transformation to be safe, we must be able to |
| 1316 | // unconditionally execute both operands to the return. This is |
| 1317 | // normally the case, but we could have a potentially-trapping |
| 1318 | // constant expression that prevents this transformation from being |
| 1319 | // safe. |
| 1320 | if ((!isa<ConstantExpr>(TrueValue) || |
| 1321 | !cast<ConstantExpr>(TrueValue)->canTrap()) && |
| 1322 | (!isa<ConstantExpr>(TrueValue) || |
| 1323 | !cast<ConstantExpr>(TrueValue)->canTrap())) { |
| 1324 | TrueSucc->removePredecessor(BI->getParent()); |
| 1325 | FalseSucc->removePredecessor(BI->getParent()); |
Chris Lattner | 7aa773b | 2004-04-02 18:15:10 +0000 | [diff] [blame] | 1326 | |
Chris Lattner | b74b181 | 2006-10-20 00:42:07 +0000 | [diff] [blame] | 1327 | // Insert a new select instruction. |
| 1328 | Value *NewRetVal; |
| 1329 | Value *BrCond = BI->getCondition(); |
| 1330 | if (TrueValue != FalseValue) |
| 1331 | NewRetVal = new SelectInst(BrCond, TrueValue, |
| 1332 | FalseValue, "retval", BI); |
| 1333 | else |
| 1334 | NewRetVal = TrueValue; |
| 1335 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1336 | DOUT << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:" |
| 1337 | << "\n " << *BI << "Select = " << *NewRetVal |
| 1338 | << "TRUEBLOCK: " << *TrueSucc << "FALSEBLOCK: "<< *FalseSucc; |
Chris Lattner | 0ed7f42 | 2004-09-29 05:43:32 +0000 | [diff] [blame] | 1339 | |
Chris Lattner | b74b181 | 2006-10-20 00:42:07 +0000 | [diff] [blame] | 1340 | new ReturnInst(NewRetVal, BI); |
| 1341 | BI->eraseFromParent(); |
| 1342 | if (Instruction *BrCondI = dyn_cast<Instruction>(BrCond)) |
| 1343 | if (isInstructionTriviallyDead(BrCondI)) |
| 1344 | BrCondI->eraseFromParent(); |
| 1345 | return true; |
| 1346 | } |
Chris Lattner | 147af6b | 2004-04-02 18:13:43 +0000 | [diff] [blame] | 1347 | } |
| 1348 | } |
| 1349 | } |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1350 | } |
Reid Spencer | 3ed469c | 2006-11-02 20:25:50 +0000 | [diff] [blame] | 1351 | } else if (isa<UnwindInst>(BB->begin())) { |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1352 | // Check to see if the first instruction in this block is just an unwind. |
| 1353 | // If so, replace any invoke instructions which use this as an exception |
Chris Lattner | af17b1d | 2004-07-20 01:17:38 +0000 | [diff] [blame] | 1354 | // destination with call instructions, and any unconditional branch |
| 1355 | // predecessor with an unwind. |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1356 | // |
| 1357 | std::vector<BasicBlock*> Preds(pred_begin(BB), pred_end(BB)); |
| 1358 | while (!Preds.empty()) { |
| 1359 | BasicBlock *Pred = Preds.back(); |
Chris Lattner | af17b1d | 2004-07-20 01:17:38 +0000 | [diff] [blame] | 1360 | if (BranchInst *BI = dyn_cast<BranchInst>(Pred->getTerminator())) { |
| 1361 | if (BI->isUnconditional()) { |
| 1362 | Pred->getInstList().pop_back(); // nuke uncond branch |
| 1363 | new UnwindInst(Pred); // Use unwind. |
| 1364 | Changed = true; |
| 1365 | } |
| 1366 | } else if (InvokeInst *II = dyn_cast<InvokeInst>(Pred->getTerminator())) |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1367 | if (II->getUnwindDest() == BB) { |
| 1368 | // Insert a new branch instruction before the invoke, because this |
| 1369 | // is now a fall through... |
| 1370 | BranchInst *BI = new BranchInst(II->getNormalDest(), II); |
| 1371 | Pred->getInstList().remove(II); // Take out of symbol table |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1372 | |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1373 | // Insert the call now... |
Chris Lattner | 93e985f | 2007-02-13 02:10:56 +0000 | [diff] [blame] | 1374 | SmallVector<Value*,8> Args(II->op_begin()+3, II->op_end()); |
| 1375 | CallInst *CI = new CallInst(II->getCalledValue(), |
| 1376 | &Args[0], Args.size(), II->getName(), BI); |
Chris Lattner | 16d0db2 | 2005-05-14 12:21:56 +0000 | [diff] [blame] | 1377 | CI->setCallingConv(II->getCallingConv()); |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1378 | // If the invoke produced a value, the Call now does instead |
| 1379 | II->replaceAllUsesWith(CI); |
| 1380 | delete II; |
| 1381 | Changed = true; |
| 1382 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1383 | |
Chris Lattner | e14ea08 | 2004-02-24 05:54:22 +0000 | [diff] [blame] | 1384 | Preds.pop_back(); |
| 1385 | } |
Chris Lattner | 8e509dd | 2004-02-24 16:09:21 +0000 | [diff] [blame] | 1386 | |
| 1387 | // If this block is now dead, remove it. |
| 1388 | if (pred_begin(BB) == pred_end(BB)) { |
| 1389 | // We know there are no successors, so just nuke the block. |
| 1390 | M->getBasicBlockList().erase(BB); |
| 1391 | return true; |
| 1392 | } |
| 1393 | |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 1394 | } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) { |
| 1395 | if (isValueEqualityComparison(SI)) { |
| 1396 | // If we only have one predecessor, and if it is a branch on this value, |
| 1397 | // see if that predecessor totally determines the outcome of this switch. |
| 1398 | if (BasicBlock *OnlyPred = BB->getSinglePredecessor()) |
| 1399 | if (SimplifyEqualityComparisonWithOnlyPredecessor(SI, OnlyPred)) |
| 1400 | return SimplifyCFG(BB) || 1; |
| 1401 | |
| 1402 | // If the block only contains the switch, see if we can fold the block |
| 1403 | // away into any preds. |
| 1404 | if (SI == &BB->front()) |
| 1405 | if (FoldValueComparisonIntoPredecessors(SI)) |
| 1406 | return SimplifyCFG(BB) || 1; |
| 1407 | } |
Chris Lattner | 542f149 | 2004-02-28 21:28:10 +0000 | [diff] [blame] | 1408 | } else if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { |
Chris Lattner | 7e66348 | 2005-08-03 00:11:16 +0000 | [diff] [blame] | 1409 | if (BI->isUnconditional()) { |
| 1410 | BasicBlock::iterator BBI = BB->begin(); // Skip over phi nodes... |
| 1411 | while (isa<PHINode>(*BBI)) ++BBI; |
| 1412 | |
| 1413 | BasicBlock *Succ = BI->getSuccessor(0); |
| 1414 | if (BBI->isTerminator() && // Terminator is the only non-phi instruction! |
| 1415 | Succ != BB) // Don't hurt infinite loops! |
| 1416 | if (TryToSimplifyUncondBranchFromEmptyBlock(BB, Succ)) |
| 1417 | return 1; |
| 1418 | |
| 1419 | } else { // Conditional branch |
Reid Spencer | 3ed469c | 2006-11-02 20:25:50 +0000 | [diff] [blame] | 1420 | if (isValueEqualityComparison(BI)) { |
Chris Lattner | 623369a | 2005-02-24 06:17:52 +0000 | [diff] [blame] | 1421 | // If we only have one predecessor, and if it is a branch on this value, |
| 1422 | // see if that predecessor totally determines the outcome of this |
| 1423 | // switch. |
| 1424 | if (BasicBlock *OnlyPred = BB->getSinglePredecessor()) |
| 1425 | if (SimplifyEqualityComparisonWithOnlyPredecessor(BI, OnlyPred)) |
| 1426 | return SimplifyCFG(BB) || 1; |
| 1427 | |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1428 | // This block must be empty, except for the setcond inst, if it exists. |
| 1429 | BasicBlock::iterator I = BB->begin(); |
| 1430 | if (&*I == BI || |
| 1431 | (&*I == cast<Instruction>(BI->getCondition()) && |
| 1432 | &*++I == BI)) |
| 1433 | if (FoldValueComparisonIntoPredecessors(BI)) |
| 1434 | return SimplifyCFG(BB) | true; |
| 1435 | } |
Chris Lattner | eaba3a1 | 2005-09-19 23:49:37 +0000 | [diff] [blame] | 1436 | |
| 1437 | // If this is a branch on a phi node in the current block, thread control |
| 1438 | // through this block if any PHI node entries are constants. |
| 1439 | if (PHINode *PN = dyn_cast<PHINode>(BI->getCondition())) |
| 1440 | if (PN->getParent() == BI->getParent()) |
| 1441 | if (FoldCondBranchOnPHI(BI)) |
| 1442 | return SimplifyCFG(BB) | true; |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1443 | |
| 1444 | // If this basic block is ONLY a setcc and a branch, and if a predecessor |
| 1445 | // branches to us and one of our successors, fold the setcc into the |
| 1446 | // predecessor and use logical operations to pick the right destination. |
Chris Lattner | 12fe2b1 | 2004-05-02 05:02:03 +0000 | [diff] [blame] | 1447 | BasicBlock *TrueDest = BI->getSuccessor(0); |
| 1448 | BasicBlock *FalseDest = BI->getSuccessor(1); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 1449 | if (Instruction *Cond = dyn_cast<Instruction>(BI->getCondition())) |
| 1450 | if ((isa<CmpInst>(Cond) || isa<BinaryOperator>(Cond)) && |
| 1451 | Cond->getParent() == BB && &BB->front() == Cond && |
Chris Lattner | 12fe2b1 | 2004-05-02 05:02:03 +0000 | [diff] [blame] | 1452 | Cond->getNext() == BI && Cond->hasOneUse() && |
| 1453 | TrueDest != BB && FalseDest != BB) |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1454 | for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI!=E; ++PI) |
| 1455 | if (BranchInst *PBI = dyn_cast<BranchInst>((*PI)->getTerminator())) |
Chris Lattner | a1f79fb | 2004-05-02 01:00:44 +0000 | [diff] [blame] | 1456 | if (PBI->isConditional() && SafeToMergeTerminators(BI, PBI)) { |
Chris Lattner | 2636c1b | 2004-06-21 07:19:01 +0000 | [diff] [blame] | 1457 | BasicBlock *PredBlock = *PI; |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1458 | if (PBI->getSuccessor(0) == FalseDest || |
| 1459 | PBI->getSuccessor(1) == TrueDest) { |
| 1460 | // Invert the predecessors condition test (xor it with true), |
| 1461 | // which allows us to write this code once. |
| 1462 | Value *NewCond = |
| 1463 | BinaryOperator::createNot(PBI->getCondition(), |
| 1464 | PBI->getCondition()->getName()+".not", PBI); |
| 1465 | PBI->setCondition(NewCond); |
| 1466 | BasicBlock *OldTrue = PBI->getSuccessor(0); |
| 1467 | BasicBlock *OldFalse = PBI->getSuccessor(1); |
| 1468 | PBI->setSuccessor(0, OldFalse); |
| 1469 | PBI->setSuccessor(1, OldTrue); |
| 1470 | } |
| 1471 | |
Chris Lattner | 299520d | 2006-02-18 00:33:17 +0000 | [diff] [blame] | 1472 | if ((PBI->getSuccessor(0) == TrueDest && FalseDest != BB) || |
| 1473 | (PBI->getSuccessor(1) == FalseDest && TrueDest != BB)) { |
Chris Lattner | 2636c1b | 2004-06-21 07:19:01 +0000 | [diff] [blame] | 1474 | // Clone Cond into the predecessor basic block, and or/and the |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1475 | // two conditions together. |
| 1476 | Instruction *New = Cond->clone(); |
Chris Lattner | 2636c1b | 2004-06-21 07:19:01 +0000 | [diff] [blame] | 1477 | PredBlock->getInstList().insert(PBI, New); |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1478 | New->takeName(Cond); |
| 1479 | Cond->setName(New->getName()+".old"); |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1480 | Instruction::BinaryOps Opcode = |
| 1481 | PBI->getSuccessor(0) == TrueDest ? |
| 1482 | Instruction::Or : Instruction::And; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1483 | Value *NewCond = |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1484 | BinaryOperator::create(Opcode, PBI->getCondition(), |
| 1485 | New, "bothcond", PBI); |
| 1486 | PBI->setCondition(NewCond); |
| 1487 | if (PBI->getSuccessor(0) == BB) { |
Chris Lattner | 2636c1b | 2004-06-21 07:19:01 +0000 | [diff] [blame] | 1488 | AddPredecessorToBlock(TrueDest, PredBlock, BB); |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1489 | PBI->setSuccessor(0, TrueDest); |
| 1490 | } |
| 1491 | if (PBI->getSuccessor(1) == BB) { |
Chris Lattner | 2636c1b | 2004-06-21 07:19:01 +0000 | [diff] [blame] | 1492 | AddPredecessorToBlock(FalseDest, PredBlock, BB); |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1493 | PBI->setSuccessor(1, FalseDest); |
| 1494 | } |
| 1495 | return SimplifyCFG(BB) | 1; |
| 1496 | } |
| 1497 | } |
Chris Lattner | e67fa05 | 2004-05-01 23:35:43 +0000 | [diff] [blame] | 1498 | |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1499 | // Scan predessor blocks for conditional branchs. |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 1500 | for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) |
| 1501 | if (BranchInst *PBI = dyn_cast<BranchInst>((*PI)->getTerminator())) |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1502 | if (PBI != BI && PBI->isConditional()) { |
| 1503 | |
| 1504 | // If this block ends with a branch instruction, and if there is a |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 1505 | // predecessor that ends on a branch of the same condition, make |
| 1506 | // this conditional branch redundant. |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1507 | if (PBI->getCondition() == BI->getCondition() && |
| 1508 | PBI->getSuccessor(0) != PBI->getSuccessor(1)) { |
| 1509 | // Okay, the outcome of this conditional branch is statically |
| 1510 | // knowable. If this block had a single pred, handle specially. |
| 1511 | if (BB->getSinglePredecessor()) { |
| 1512 | // Turn this into a branch on constant. |
| 1513 | bool CondIsTrue = PBI->getSuccessor(0) == BB; |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 1514 | BI->setCondition(ConstantInt::get(Type::Int1Ty, CondIsTrue)); |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1515 | return SimplifyCFG(BB); // Nuke the branch on constant. |
| 1516 | } |
| 1517 | |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 1518 | // Otherwise, if there are multiple predecessors, insert a PHI |
| 1519 | // that merges in the constant and simplify the block result. |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1520 | if (BlockIsSimpleEnoughToThreadThrough(BB)) { |
Reid Spencer | 4fe16d6 | 2007-01-11 18:21:29 +0000 | [diff] [blame] | 1521 | PHINode *NewPN = new PHINode(Type::Int1Ty, |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 1522 | BI->getCondition()->getName()+".pr", |
| 1523 | BB->begin()); |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1524 | for (PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) |
| 1525 | if ((PBI = dyn_cast<BranchInst>((*PI)->getTerminator())) && |
| 1526 | PBI != BI && PBI->isConditional() && |
| 1527 | PBI->getCondition() == BI->getCondition() && |
| 1528 | PBI->getSuccessor(0) != PBI->getSuccessor(1)) { |
| 1529 | bool CondIsTrue = PBI->getSuccessor(0) == BB; |
Reid Spencer | 579dca1 | 2007-01-12 04:24:46 +0000 | [diff] [blame] | 1530 | NewPN->addIncoming(ConstantInt::get(Type::Int1Ty, |
| 1531 | CondIsTrue), *PI); |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1532 | } else { |
| 1533 | NewPN->addIncoming(BI->getCondition(), *PI); |
| 1534 | } |
| 1535 | |
| 1536 | BI->setCondition(NewPN); |
| 1537 | // This will thread the branch. |
| 1538 | return SimplifyCFG(BB) | true; |
| 1539 | } |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 1540 | } |
| 1541 | |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1542 | // If this is a conditional branch in an empty block, and if any |
| 1543 | // predecessors is a conditional branch to one of our destinations, |
| 1544 | // fold the conditions into logical ops and one cond br. |
| 1545 | if (&BB->front() == BI) { |
| 1546 | int PBIOp, BIOp; |
| 1547 | if (PBI->getSuccessor(0) == BI->getSuccessor(0)) { |
| 1548 | PBIOp = BIOp = 0; |
| 1549 | } else if (PBI->getSuccessor(0) == BI->getSuccessor(1)) { |
| 1550 | PBIOp = 0; BIOp = 1; |
| 1551 | } else if (PBI->getSuccessor(1) == BI->getSuccessor(0)) { |
| 1552 | PBIOp = 1; BIOp = 0; |
| 1553 | } else if (PBI->getSuccessor(1) == BI->getSuccessor(1)) { |
| 1554 | PBIOp = BIOp = 1; |
| 1555 | } else { |
| 1556 | PBIOp = BIOp = -1; |
| 1557 | } |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 1558 | |
Chris Lattner | 299520d | 2006-02-18 00:33:17 +0000 | [diff] [blame] | 1559 | // Check to make sure that the other destination of this branch |
| 1560 | // isn't BB itself. If so, this is an infinite loop that will |
| 1561 | // keep getting unwound. |
| 1562 | if (PBIOp != -1 && PBI->getSuccessor(PBIOp) == BB) |
| 1563 | PBIOp = BIOp = -1; |
Chris Lattner | 822a879 | 2006-11-18 19:19:36 +0000 | [diff] [blame] | 1564 | |
| 1565 | // Do not perform this transformation if it would require |
| 1566 | // insertion of a large number of select instructions. For targets |
| 1567 | // without predication/cmovs, this is a big pessimization. |
| 1568 | if (PBIOp != -1) { |
| 1569 | BasicBlock *CommonDest = PBI->getSuccessor(PBIOp); |
| 1570 | |
| 1571 | unsigned NumPhis = 0; |
| 1572 | for (BasicBlock::iterator II = CommonDest->begin(); |
| 1573 | isa<PHINode>(II); ++II, ++NumPhis) { |
| 1574 | if (NumPhis > 2) { |
| 1575 | // Disable this xform. |
| 1576 | PBIOp = -1; |
| 1577 | break; |
| 1578 | } |
| 1579 | } |
| 1580 | } |
Chris Lattner | 7f2e1dd | 2006-06-12 20:18:01 +0000 | [diff] [blame] | 1581 | |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1582 | // Finally, if everything is ok, fold the branches to logical ops. |
| 1583 | if (PBIOp != -1) { |
| 1584 | BasicBlock *CommonDest = PBI->getSuccessor(PBIOp); |
| 1585 | BasicBlock *OtherDest = BI->getSuccessor(BIOp ^ 1); |
| 1586 | |
Chris Lattner | 7f2e1dd | 2006-06-12 20:18:01 +0000 | [diff] [blame] | 1587 | // If OtherDest *is* BB, then this is a basic block with just |
| 1588 | // a conditional branch in it, where one edge (OtherDesg) goes |
| 1589 | // back to the block. We know that the program doesn't get |
| 1590 | // stuck in the infinite loop, so the condition must be such |
| 1591 | // that OtherDest isn't branched through. Forward to CommonDest, |
| 1592 | // and avoid an infinite loop at optimizer time. |
| 1593 | if (OtherDest == BB) |
| 1594 | OtherDest = CommonDest; |
| 1595 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1596 | DOUT << "FOLDING BRs:" << *PBI->getParent() |
| 1597 | << "AND: " << *BI->getParent(); |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1598 | |
| 1599 | // BI may have other predecessors. Because of this, we leave |
| 1600 | // it alone, but modify PBI. |
| 1601 | |
| 1602 | // Make sure we get to CommonDest on True&True directions. |
| 1603 | Value *PBICond = PBI->getCondition(); |
| 1604 | if (PBIOp) |
| 1605 | PBICond = BinaryOperator::createNot(PBICond, |
| 1606 | PBICond->getName()+".not", |
| 1607 | PBI); |
| 1608 | Value *BICond = BI->getCondition(); |
| 1609 | if (BIOp) |
| 1610 | BICond = BinaryOperator::createNot(BICond, |
| 1611 | BICond->getName()+".not", |
| 1612 | PBI); |
| 1613 | // Merge the conditions. |
| 1614 | Value *Cond = |
| 1615 | BinaryOperator::createOr(PBICond, BICond, "brmerge", PBI); |
| 1616 | |
| 1617 | // Modify PBI to branch on the new condition to the new dests. |
| 1618 | PBI->setCondition(Cond); |
| 1619 | PBI->setSuccessor(0, CommonDest); |
| 1620 | PBI->setSuccessor(1, OtherDest); |
| 1621 | |
| 1622 | // OtherDest may have phi nodes. If so, add an entry from PBI's |
| 1623 | // block that are identical to the entries for BI's block. |
| 1624 | PHINode *PN; |
| 1625 | for (BasicBlock::iterator II = OtherDest->begin(); |
| 1626 | (PN = dyn_cast<PHINode>(II)); ++II) { |
| 1627 | Value *V = PN->getIncomingValueForBlock(BB); |
| 1628 | PN->addIncoming(V, PBI->getParent()); |
| 1629 | } |
| 1630 | |
| 1631 | // We know that the CommonDest already had an edge from PBI to |
| 1632 | // it. If it has PHIs though, the PHIs may have different |
| 1633 | // entries for BB and PBI's BB. If so, insert a select to make |
| 1634 | // them agree. |
| 1635 | for (BasicBlock::iterator II = CommonDest->begin(); |
| 1636 | (PN = dyn_cast<PHINode>(II)); ++II) { |
| 1637 | Value * BIV = PN->getIncomingValueForBlock(BB); |
| 1638 | unsigned PBBIdx = PN->getBasicBlockIndex(PBI->getParent()); |
| 1639 | Value *PBIV = PN->getIncomingValue(PBBIdx); |
| 1640 | if (BIV != PBIV) { |
| 1641 | // Insert a select in PBI to pick the right value. |
| 1642 | Value *NV = new SelectInst(PBICond, PBIV, BIV, |
| 1643 | PBIV->getName()+".mux", PBI); |
| 1644 | PN->setIncomingValue(PBBIdx, NV); |
| 1645 | } |
| 1646 | } |
| 1647 | |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1648 | DOUT << "INTO: " << *PBI->getParent(); |
Chris Lattner | 263d1e4 | 2005-09-23 18:47:20 +0000 | [diff] [blame] | 1649 | |
| 1650 | // This basic block is probably dead. We know it has at least |
| 1651 | // one fewer predecessor. |
| 1652 | return SimplifyCFG(BB) | true; |
| 1653 | } |
Chris Lattner | 2e42e36 | 2005-09-20 00:43:16 +0000 | [diff] [blame] | 1654 | } |
Chris Lattner | 92da2c2 | 2004-05-01 22:36:37 +0000 | [diff] [blame] | 1655 | } |
Chris Lattner | d52c261 | 2004-02-24 07:23:58 +0000 | [diff] [blame] | 1656 | } |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1657 | } else if (isa<UnreachableInst>(BB->getTerminator())) { |
| 1658 | // If there are any instructions immediately before the unreachable that can |
| 1659 | // be removed, do so. |
| 1660 | Instruction *Unreachable = BB->getTerminator(); |
| 1661 | while (Unreachable != BB->begin()) { |
| 1662 | BasicBlock::iterator BBI = Unreachable; |
| 1663 | --BBI; |
| 1664 | if (isa<CallInst>(BBI)) break; |
| 1665 | // Delete this instruction |
| 1666 | BB->getInstList().erase(BBI); |
| 1667 | Changed = true; |
| 1668 | } |
| 1669 | |
| 1670 | // If the unreachable instruction is the first in the block, take a gander |
| 1671 | // at all of the predecessors of this instruction, and simplify them. |
| 1672 | if (&BB->front() == Unreachable) { |
| 1673 | std::vector<BasicBlock*> Preds(pred_begin(BB), pred_end(BB)); |
| 1674 | for (unsigned i = 0, e = Preds.size(); i != e; ++i) { |
| 1675 | TerminatorInst *TI = Preds[i]->getTerminator(); |
| 1676 | |
| 1677 | if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { |
| 1678 | if (BI->isUnconditional()) { |
| 1679 | if (BI->getSuccessor(0) == BB) { |
| 1680 | new UnreachableInst(TI); |
| 1681 | TI->eraseFromParent(); |
| 1682 | Changed = true; |
| 1683 | } |
| 1684 | } else { |
| 1685 | if (BI->getSuccessor(0) == BB) { |
| 1686 | new BranchInst(BI->getSuccessor(1), BI); |
| 1687 | BI->eraseFromParent(); |
| 1688 | } else if (BI->getSuccessor(1) == BB) { |
| 1689 | new BranchInst(BI->getSuccessor(0), BI); |
| 1690 | BI->eraseFromParent(); |
| 1691 | Changed = true; |
| 1692 | } |
| 1693 | } |
| 1694 | } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { |
| 1695 | for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i) |
| 1696 | if (SI->getSuccessor(i) == BB) { |
Chris Lattner | 42eb752 | 2005-05-20 22:19:54 +0000 | [diff] [blame] | 1697 | BB->removePredecessor(SI->getParent()); |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1698 | SI->removeCase(i); |
| 1699 | --i; --e; |
| 1700 | Changed = true; |
| 1701 | } |
| 1702 | // If the default value is unreachable, figure out the most popular |
| 1703 | // destination and make it the default. |
| 1704 | if (SI->getSuccessor(0) == BB) { |
| 1705 | std::map<BasicBlock*, unsigned> Popularity; |
| 1706 | for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i) |
| 1707 | Popularity[SI->getSuccessor(i)]++; |
| 1708 | |
| 1709 | // Find the most popular block. |
| 1710 | unsigned MaxPop = 0; |
| 1711 | BasicBlock *MaxBlock = 0; |
| 1712 | for (std::map<BasicBlock*, unsigned>::iterator |
| 1713 | I = Popularity.begin(), E = Popularity.end(); I != E; ++I) { |
| 1714 | if (I->second > MaxPop) { |
| 1715 | MaxPop = I->second; |
| 1716 | MaxBlock = I->first; |
| 1717 | } |
| 1718 | } |
| 1719 | if (MaxBlock) { |
| 1720 | // Make this the new default, allowing us to delete any explicit |
| 1721 | // edges to it. |
| 1722 | SI->setSuccessor(0, MaxBlock); |
| 1723 | Changed = true; |
| 1724 | |
Chris Lattner | 42eb752 | 2005-05-20 22:19:54 +0000 | [diff] [blame] | 1725 | // If MaxBlock has phinodes in it, remove MaxPop-1 entries from |
| 1726 | // it. |
| 1727 | if (isa<PHINode>(MaxBlock->begin())) |
| 1728 | for (unsigned i = 0; i != MaxPop-1; ++i) |
| 1729 | MaxBlock->removePredecessor(SI->getParent()); |
| 1730 | |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1731 | for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i) |
| 1732 | if (SI->getSuccessor(i) == MaxBlock) { |
| 1733 | SI->removeCase(i); |
| 1734 | --i; --e; |
| 1735 | } |
| 1736 | } |
| 1737 | } |
| 1738 | } else if (InvokeInst *II = dyn_cast<InvokeInst>(TI)) { |
| 1739 | if (II->getUnwindDest() == BB) { |
| 1740 | // Convert the invoke to a call instruction. This would be a good |
| 1741 | // place to note that the call does not throw though. |
| 1742 | BranchInst *BI = new BranchInst(II->getNormalDest(), II); |
| 1743 | II->removeFromParent(); // Take out of symbol table |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1744 | |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1745 | // Insert the call now... |
Chris Lattner | 93e985f | 2007-02-13 02:10:56 +0000 | [diff] [blame] | 1746 | SmallVector<Value*, 8> Args(II->op_begin()+3, II->op_end()); |
| 1747 | CallInst *CI = new CallInst(II->getCalledValue(), |
| 1748 | &Args[0], Args.size(), |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1749 | II->getName(), BI); |
Chris Lattner | 16d0db2 | 2005-05-14 12:21:56 +0000 | [diff] [blame] | 1750 | CI->setCallingConv(II->getCallingConv()); |
Chris Lattner | 698f96f | 2004-10-18 04:07:22 +0000 | [diff] [blame] | 1751 | // If the invoke produced a value, the Call does now instead. |
| 1752 | II->replaceAllUsesWith(CI); |
| 1753 | delete II; |
| 1754 | Changed = true; |
| 1755 | } |
| 1756 | } |
| 1757 | } |
| 1758 | |
| 1759 | // If this block is now dead, remove it. |
| 1760 | if (pred_begin(BB) == pred_end(BB)) { |
| 1761 | // We know there are no successors, so just nuke the block. |
| 1762 | M->getBasicBlockList().erase(BB); |
| 1763 | return true; |
| 1764 | } |
| 1765 | } |
Chris Lattner | 19831ec | 2004-02-16 06:35:48 +0000 | [diff] [blame] | 1766 | } |
| 1767 | |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1768 | // Merge basic blocks into their predecessor if there is only one distinct |
| 1769 | // pred, and if there is only one distinct successor of the predecessor, and |
| 1770 | // if there are no PHI nodes. |
| 1771 | // |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1772 | pred_iterator PI(pred_begin(BB)), PE(pred_end(BB)); |
| 1773 | BasicBlock *OnlyPred = *PI++; |
| 1774 | for (; PI != PE; ++PI) // Search all predecessors, see if they are all same |
| 1775 | if (*PI != OnlyPred) { |
| 1776 | OnlyPred = 0; // There are multiple different predecessors... |
| 1777 | break; |
| 1778 | } |
Chris Lattner | 92da2c2 | 2004-05-01 22:36:37 +0000 | [diff] [blame] | 1779 | |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1780 | BasicBlock *OnlySucc = 0; |
| 1781 | if (OnlyPred && OnlyPred != BB && // Don't break self loops |
| 1782 | OnlyPred->getTerminator()->getOpcode() != Instruction::Invoke) { |
| 1783 | // Check to see if there is only one distinct successor... |
| 1784 | succ_iterator SI(succ_begin(OnlyPred)), SE(succ_end(OnlyPred)); |
| 1785 | OnlySucc = BB; |
| 1786 | for (; SI != SE; ++SI) |
| 1787 | if (*SI != OnlySucc) { |
| 1788 | OnlySucc = 0; // There are multiple distinct successors! |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1789 | break; |
| 1790 | } |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1791 | } |
| 1792 | |
| 1793 | if (OnlySucc) { |
Bill Wendling | 0d45a09 | 2006-11-26 10:17:54 +0000 | [diff] [blame] | 1794 | DOUT << "Merging: " << *BB << "into: " << *OnlyPred; |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1795 | |
| 1796 | // Resolve any PHI nodes at the start of the block. They are all |
| 1797 | // guaranteed to have exactly one entry if they exist, unless there are |
| 1798 | // multiple duplicate (but guaranteed to be equal) entries for the |
| 1799 | // incoming edges. This occurs when there are multiple edges from |
| 1800 | // OnlyPred to OnlySucc. |
| 1801 | // |
| 1802 | while (PHINode *PN = dyn_cast<PHINode>(&BB->front())) { |
| 1803 | PN->replaceAllUsesWith(PN->getIncomingValue(0)); |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1804 | BB->getInstList().pop_front(); // Delete the phi node. |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1805 | } |
| 1806 | |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1807 | // Delete the unconditional branch from the predecessor. |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1808 | OnlyPred->getInstList().pop_back(); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1809 | |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1810 | // Move all definitions in the successor to the predecessor. |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1811 | OnlyPred->getInstList().splice(OnlyPred->end(), BB->getInstList()); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1812 | |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1813 | // Make all PHI nodes that referred to BB now refer to Pred as their |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1814 | // source. |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1815 | BB->replaceAllUsesWith(OnlyPred); |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 1816 | |
Chris Lattner | 86cc423 | 2007-02-11 01:37:51 +0000 | [diff] [blame] | 1817 | // Inherit predecessors name if it exists. |
| 1818 | if (!OnlyPred->hasName()) |
| 1819 | OnlyPred->takeName(BB); |
| 1820 | |
| 1821 | // Erase basic block from the function. |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1822 | M->getBasicBlockList().erase(BB); |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 1823 | |
Chris Lattner | 2355f94 | 2004-02-11 01:17:07 +0000 | [diff] [blame] | 1824 | return true; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1825 | } |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 1826 | |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 1827 | // Otherwise, if this block only has a single predecessor, and if that block |
| 1828 | // is a conditional branch, see if we can hoist any code from this block up |
| 1829 | // into our predecessor. |
| 1830 | if (OnlyPred) |
Chris Lattner | 7613437 | 2004-12-10 17:42:31 +0000 | [diff] [blame] | 1831 | if (BranchInst *BI = dyn_cast<BranchInst>(OnlyPred->getTerminator())) |
| 1832 | if (BI->isConditional()) { |
| 1833 | // Get the other block. |
| 1834 | BasicBlock *OtherBB = BI->getSuccessor(BI->getSuccessor(0) == BB); |
| 1835 | PI = pred_begin(OtherBB); |
| 1836 | ++PI; |
| 1837 | if (PI == pred_end(OtherBB)) { |
| 1838 | // We have a conditional branch to two blocks that are only reachable |
| 1839 | // from the condbr. We know that the condbr dominates the two blocks, |
| 1840 | // so see if there is any identical code in the "then" and "else" |
| 1841 | // blocks. If so, we can hoist it up to the branching block. |
| 1842 | Changed |= HoistThenElseCodeToIf(BI); |
| 1843 | } |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 1844 | } |
Chris Lattner | 37dc938 | 2004-11-30 00:29:14 +0000 | [diff] [blame] | 1845 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1846 | for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) |
| 1847 | if (BranchInst *BI = dyn_cast<BranchInst>((*PI)->getTerminator())) |
| 1848 | // Change br (X == 0 | X == 1), T, F into a switch instruction. |
| 1849 | if (BI->isConditional() && isa<Instruction>(BI->getCondition())) { |
| 1850 | Instruction *Cond = cast<Instruction>(BI->getCondition()); |
| 1851 | // If this is a bunch of seteq's or'd together, or if it's a bunch of |
| 1852 | // 'setne's and'ed together, collect them. |
| 1853 | Value *CompVal = 0; |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 1854 | std::vector<ConstantInt*> Values; |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1855 | bool TrueWhenEqual = GatherValueComparisons(Cond, CompVal, Values); |
Chris Lattner | 42a7551 | 2007-01-15 02:27:26 +0000 | [diff] [blame] | 1856 | if (CompVal && CompVal->getType()->isInteger()) { |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1857 | // There might be duplicate constants in the list, which the switch |
| 1858 | // instruction can't handle, remove them now. |
Chris Lattner | 1654cff | 2004-06-19 07:02:14 +0000 | [diff] [blame] | 1859 | std::sort(Values.begin(), Values.end(), ConstantIntOrdering()); |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1860 | Values.erase(std::unique(Values.begin(), Values.end()), Values.end()); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1861 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1862 | // Figure out which block is which destination. |
| 1863 | BasicBlock *DefaultBB = BI->getSuccessor(1); |
| 1864 | BasicBlock *EdgeBB = BI->getSuccessor(0); |
| 1865 | if (!TrueWhenEqual) std::swap(DefaultBB, EdgeBB); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1866 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1867 | // Create the new switch instruction now. |
Chris Lattner | 3788059 | 2005-01-29 00:38:26 +0000 | [diff] [blame] | 1868 | SwitchInst *New = new SwitchInst(CompVal, DefaultBB,Values.size(),BI); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1869 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1870 | // Add all of the 'cases' to the switch instruction. |
| 1871 | for (unsigned i = 0, e = Values.size(); i != e; ++i) |
| 1872 | New->addCase(Values[i], EdgeBB); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1873 | |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1874 | // We added edges from PI to the EdgeBB. As such, if there were any |
| 1875 | // PHI nodes in EdgeBB, they need entries to be added corresponding to |
| 1876 | // the number of edges added. |
| 1877 | for (BasicBlock::iterator BBI = EdgeBB->begin(); |
Reid Spencer | 2da5c3d | 2004-09-15 17:06:42 +0000 | [diff] [blame] | 1878 | isa<PHINode>(BBI); ++BBI) { |
| 1879 | PHINode *PN = cast<PHINode>(BBI); |
Chris Lattner | 0d56008 | 2004-02-24 05:38:11 +0000 | [diff] [blame] | 1880 | Value *InVal = PN->getIncomingValueForBlock(*PI); |
| 1881 | for (unsigned i = 0, e = Values.size()-1; i != e; ++i) |
| 1882 | PN->addIncoming(InVal, *PI); |
| 1883 | } |
| 1884 | |
| 1885 | // Erase the old branch instruction. |
| 1886 | (*PI)->getInstList().erase(BI); |
| 1887 | |
| 1888 | // Erase the potentially condition tree that was used to computed the |
| 1889 | // branch condition. |
| 1890 | ErasePossiblyDeadInstructionTree(Cond); |
| 1891 | return true; |
| 1892 | } |
| 1893 | } |
| 1894 | |
Chris Lattner | 723c66d | 2004-02-11 03:36:04 +0000 | [diff] [blame] | 1895 | // If there is a trivial two-entry PHI node in this basic block, and we can |
| 1896 | // eliminate it, do so now. |
| 1897 | if (PHINode *PN = dyn_cast<PHINode>(BB->begin())) |
Chris Lattner | f58c1a5 | 2005-09-23 06:39:30 +0000 | [diff] [blame] | 1898 | if (PN->getNumIncomingValues() == 2) |
| 1899 | Changed |= FoldTwoEntryPHINode(PN); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1900 | |
Chris Lattner | 694e37f | 2003-08-17 19:41:53 +0000 | [diff] [blame] | 1901 | return Changed; |
Chris Lattner | 01d1ee3 | 2002-05-21 20:50:24 +0000 | [diff] [blame] | 1902 | } |