IndVarSimplify.cpp revision 02dea8b39f3acad5de1df36273444d149145e7fc
16148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner//===- IndVarSimplify.cpp - Induction Variable Elimination ----------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 8b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell//===----------------------------------------------------------------------===// 96148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner// 1040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// This transformation analyzes and transforms the induction variables (and 1140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// computations derived from them) into simpler forms suitable for subsequent 1240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// analysis and transformation. 1340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 1447a53ac726ceb1ac11bc1326be3fbe095f726b0dReid Spencer// This transformation makes the following changes to each loop with an 1540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// identifiable induction variable: 1640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 1. All loops are transformed to have a SINGLE canonical induction variable 1740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// which starts at zero and steps by one. 1840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 2. The canonical induction variable is guaranteed to be the first PHI node 1940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// in the loop header block. 2040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 3. Any pointer arithmetic recurrences are raised to use array subscripts. 2140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 2240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// If the trip count of a loop is computable, this pass also makes the following 2340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// changes: 2440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 1. The exit condition for the loop is canonicalized to compare the 2540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// induction value against the exit value. This turns loops like: 2640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 'for (i = 7; i*i < 1000; ++i)' into 'for (i = 0; i != 25; ++i)' 2740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 2. Any use outside of the loop of an expression derived from the indvar 2840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// is changed to compute the derived value outside of the loop, eliminating 2940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// the dependence on the exit value of the induction variable. If the only 3040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// purpose of the loop is to compute the exit value of some derived 3140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// expression, this transformation will make the loop dead. 3240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// 3340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// This transformation should be followed by strength reduction after all of the 3440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// desired loop transformations have been performed. Additionally, on targets 3540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// where it is profitable, the loop could be transformed to count down to zero 3640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner// (the "do loop" optimization). 376148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner// 386148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner//===----------------------------------------------------------------------===// 396148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner 400e5f499638c8d277b9dc4a4385712177c53b5681Chris Lattner#define DEBUG_TYPE "indvars" 41022103b3f33febb7e54b8fdf2c9bc461eea78cbaChris Lattner#include "llvm/Transforms/Scalar.h" 4240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner#include "llvm/BasicBlock.h" 4359fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner#include "llvm/Constants.h" 4418b3c97bc773b24a66eb779e85da1820b0f16b31Chris Lattner#include "llvm/Instructions.h" 4540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner#include "llvm/Type.h" 4636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman#include "llvm/Analysis/ScalarEvolutionExpander.h" 4747df12d80db90e125e9f2ff764286ee11665476dJohn Criswell#include "llvm/Analysis/LoopInfo.h" 485ee99979065d75605d150d7e567e4351024aae8fDevang Patel#include "llvm/Analysis/LoopPass.h" 49455889aa79e3463a4b0f2161e3d9d72a683268b6Chris Lattner#include "llvm/Support/CFG.h" 509133fe28954d498fc4de13064c7d65bd811de02cReid Spencer#include "llvm/Support/Compiler.h" 51ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner#include "llvm/Support/Debug.h" 52a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner#include "llvm/Support/GetElementPtrTypeIterator.h" 5347df12d80db90e125e9f2ff764286ee11665476dJohn Criswell#include "llvm/Transforms/Utils/Local.h" 54551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/CommandLine.h" 55a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer#include "llvm/ADT/SmallVector.h" 56551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/ADT/Statistic.h" 5747df12d80db90e125e9f2ff764286ee11665476dJohn Criswellusing namespace llvm; 58d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 590e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumRemoved , "Number of aux indvars removed"); 600e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumPointer , "Number of pointer indvars promoted"); 610e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumInserted, "Number of canonical indvars added"); 620e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumReplaced, "Number of exit values replaced"); 630e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumLFTR , "Number of loop exit tests replaced"); 643324e718bc9ac2ede08a14c325848b576849542bChris Lattner 650e5f499638c8d277b9dc4a4385712177c53b5681Chris Lattnernamespace { 665ee99979065d75605d150d7e567e4351024aae8fDevang Patel class VISIBILITY_HIDDEN IndVarSimplify : public LoopPass { 6740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner LoopInfo *LI; 6840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ScalarEvolution *SE; 6915cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner bool Changed; 703324e718bc9ac2ede08a14c325848b576849542bChris Lattner public: 71794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 72ecd94c804a563f2a86572dcf1d2e81f397e19daaNick Lewycky static char ID; // Pass identification, replacement for typeid 73794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel IndVarSimplify() : LoopPass((intptr_t)&ID) {} 74794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 755ee99979065d75605d150d7e567e4351024aae8fDevang Patel bool runOnLoop(Loop *L, LPPassManager &LPM); 765ee99979065d75605d150d7e567e4351024aae8fDevang Patel bool doInitialization(Loop *L, LPPassManager &LPM); 775ee99979065d75605d150d7e567e4351024aae8fDevang Patel virtual void getAnalysisUsage(AnalysisUsage &AU) const { 78bc533cd1286ebb393c37a2a8b03079bfc9655585Devang Patel AU.addRequired<ScalarEvolution>(); 795ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.addRequiredID(LCSSAID); 805ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.addRequiredID(LoopSimplifyID); 815ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.addRequired<LoopInfo>(); 825ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.addPreservedID(LoopSimplifyID); 835ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.addPreservedID(LCSSAID); 845ee99979065d75605d150d7e567e4351024aae8fDevang Patel AU.setPreservesCFG(); 855ee99979065d75605d150d7e567e4351024aae8fDevang Patel } 863324e718bc9ac2ede08a14c325848b576849542bChris Lattner 8740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner private: 885ee99979065d75605d150d7e567e4351024aae8fDevang Patel 8940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void EliminatePointerRecurrence(PHINode *PN, BasicBlock *Preheader, 9040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> &DeadInsts); 919ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Instruction *LinearFunctionTestReplace(Loop *L, SCEV *IterationCount, 929ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEVExpander &RW); 9340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void RewriteLoopExitValues(Loop *L); 9440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 9540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void DeleteTriviallyDeadInstructions(std::set<Instruction*> &Insts); 963324e718bc9ac2ede08a14c325848b576849542bChris Lattner }; 975e76140536ba66fadeced1cd892f79616f407e3cChris Lattner} 98394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 99844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanchar IndVarSimplify::ID = 0; 100844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterPass<IndVarSimplify> 101844731a7f1909f55935e3514c9e713a62d67662eDan GohmanX("indvars", "Canonicalize Induction Variables"); 102844731a7f1909f55935e3514c9e713a62d67662eDan Gohman 1035ee99979065d75605d150d7e567e4351024aae8fDevang PatelLoopPass *llvm::createIndVarSimplifyPass() { 1043324e718bc9ac2ede08a14c325848b576849542bChris Lattner return new IndVarSimplify(); 105394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner} 106394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 10740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// DeleteTriviallyDeadInstructions - If any of the instructions is the 10840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// specified set are trivially dead, delete them and see if this makes any of 10940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// their operands subsequently dead. 11040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattnervoid IndVarSimplify:: 11140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris LattnerDeleteTriviallyDeadInstructions(std::set<Instruction*> &Insts) { 11240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (!Insts.empty()) { 11340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Instruction *I = *Insts.begin(); 11440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Insts.erase(Insts.begin()); 11540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (isInstructionTriviallyDead(I)) { 11640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) 11740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (Instruction *U = dyn_cast<Instruction>(I->getOperand(i))) 11840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Insts.insert(U); 1195cec4db6ae13a41d04d86f37e347fc5b5997c948Dan Gohman SE->deleteValueFromRecords(I); 120ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Deleting: " << *I; 121a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner I->eraseFromParent(); 12240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 12340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 12440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 12540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 1263324e718bc9ac2ede08a14c325848b576849542bChris Lattner 1276148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner 12840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// EliminatePointerRecurrence - Check to see if this is a trivial GEP pointer 12940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// recurrence. If so, change it into an integer recurrence, permitting 13040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// analysis by the SCEV routines. 131fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukmanvoid IndVarSimplify::EliminatePointerRecurrence(PHINode *PN, 13240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader, 13340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> &DeadInsts) { 13440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(PN->getNumIncomingValues() == 2 && "Noncanonicalized loop!"); 13540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner unsigned PreheaderIdx = PN->getBasicBlockIndex(Preheader); 13640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner unsigned BackedgeIdx = PreheaderIdx^1; 13740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (GetElementPtrInst *GEPI = 138cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner dyn_cast<GetElementPtrInst>(PN->getIncomingValue(BackedgeIdx))) 13940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (GEPI->getOperand(0) == PN) { 140cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner assert(GEPI->getNumOperands() == 2 && "GEP types must match!"); 141ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Eliminating pointer recurrence: " << *GEPI; 142ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner 14340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Okay, we found a pointer recurrence. Transform this pointer 14440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // recurrence into an integer recurrence. Compute the value that gets 14540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // added to the pointer at every iteration. 14640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Value *AddedVal = GEPI->getOperand(1); 14740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 14840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Insert a new integer PHI node into the top of the block. 149051a950000e21935165db56695e35bade668193bGabor Greif PHINode *NewPhi = PHINode::Create(AddedVal->getType(), 150051a950000e21935165db56695e35bade668193bGabor Greif PN->getName()+".rec", PN); 151c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner NewPhi->addIncoming(Constant::getNullValue(NewPhi->getType()), Preheader); 152c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner 15340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Create the new add instruction. 1547cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Value *NewAdd = BinaryOperator::CreateAdd(NewPhi, AddedVal, 155c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner GEPI->getName()+".rec", GEPI); 15640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner NewPhi->addIncoming(NewAdd, PN->getIncomingBlock(BackedgeIdx)); 157fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 15840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Update the existing GEP to use the recurrence. 15940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner GEPI->setOperand(0, PN->getIncomingValue(PreheaderIdx)); 160fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 16140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Update the GEP to use the new recurrence we just inserted. 16240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner GEPI->setOperand(1, NewAdd); 16340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 164a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // If the incoming value is a constant expr GEP, try peeling out the array 165a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // 0 index if possible to make things simpler. 166a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(GEPI->getOperand(0))) 167a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (CE->getOpcode() == Instruction::GetElementPtr) { 168a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner unsigned NumOps = CE->getNumOperands(); 169a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner assert(NumOps > 1 && "CE folding didn't work!"); 170a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (CE->getOperand(NumOps-1)->isNullValue()) { 171a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // Check to make sure the last index really is an array index. 1721730078d5f553d7516a06e098e6c2089dc8bef9cChris Lattner gep_type_iterator GTI = gep_type_begin(CE); 173ceda605fd7d0e3532a22743538c6d118fe5e40c1Chris Lattner for (unsigned i = 1, e = CE->getNumOperands()-1; 174a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner i != e; ++i, ++GTI) 175a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner /*empty*/; 176a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (isa<SequentialType>(*GTI)) { 177a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // Pull the last index out of the constant expr GEP. 17855eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner SmallVector<Value*, 8> CEIdxs(CE->op_begin()+1, CE->op_end()-1); 179a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner Constant *NCE = ConstantExpr::getGetElementPtr(CE->getOperand(0), 18055eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner &CEIdxs[0], 18155eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner CEIdxs.size()); 182b8f74793b9d161bc666fe27fc92fe112b6ec169bDavid Greene Value *Idx[2]; 183b8f74793b9d161bc666fe27fc92fe112b6ec169bDavid Greene Idx[0] = Constant::getNullValue(Type::Int32Ty); 184b8f74793b9d161bc666fe27fc92fe112b6ec169bDavid Greene Idx[1] = NewAdd; 185051a950000e21935165db56695e35bade668193bGabor Greif GetElementPtrInst *NGEPI = GetElementPtrInst::Create( 186b8f74793b9d161bc666fe27fc92fe112b6ec169bDavid Greene NCE, Idx, Idx + 2, 187cae5754619433aed7be74abbf1c0551a82d369cbReid Spencer GEPI->getName(), GEPI); 1885cec4db6ae13a41d04d86f37e347fc5b5997c948Dan Gohman SE->deleteValueFromRecords(GEPI); 189a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI->replaceAllUsesWith(NGEPI); 190a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI->eraseFromParent(); 191a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI = NGEPI; 192a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 193a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 194a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 195a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner 196a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner 19740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Finally, if there are any other users of the PHI node, we must 19840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // insert a new GEP instruction that uses the pre-incremented version 19940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // of the induction amount. 20040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!PN->use_empty()) { 20140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock::iterator InsertPos = PN; ++InsertPos; 20240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (isa<PHINode>(InsertPos)) ++InsertPos; 20340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Value *PreInc = 204051a950000e21935165db56695e35bade668193bGabor Greif GetElementPtrInst::Create(PN->getIncomingValue(PreheaderIdx), 205051a950000e21935165db56695e35bade668193bGabor Greif NewPhi, "", InsertPos); 2066934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner PreInc->takeName(PN); 20740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PN->replaceAllUsesWith(PreInc); 20840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 20940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 21040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Delete the old PHI for sure, and the GEP if its otherwise unused. 21140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeadInsts.insert(PN); 2123324e718bc9ac2ede08a14c325848b576849542bChris Lattner 21340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumPointer; 21440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 21540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 21640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 2173324e718bc9ac2ede08a14c325848b576849542bChris Lattner 21840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// LinearFunctionTestReplace - This method rewrites the exit condition of the 21959fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// loop to be a canonical != comparison against the incremented loop induction 22059fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// variable. This pass is able to rewrite the exit tests of any loop where the 22159fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// SCEV analysis can determine a loop-invariant trip count of the loop, which 22259fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// is actually a much broader range than just linear tests. 2239ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// 2249ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// This method returns a "potentially dead" instruction whose computation chain 2259ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// should be deleted when convenient. 2269ba46c13bf3d49a5b697227c88ef987951e6b50dChris LattnerInstruction *IndVarSimplify::LinearFunctionTestReplace(Loop *L, 2279ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEV *IterationCount, 2289ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEVExpander &RW) { 22940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Find the exit block for the loop. We can currently only handle loops with 23040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // a single exit. 231b7211a2ce13a0365e0e1dd2f27adda2ee3d1288bDevang Patel SmallVector<BasicBlock*, 8> ExitBlocks; 232f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner L->getExitBlocks(ExitBlocks); 2339ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (ExitBlocks.size() != 1) return 0; 234f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner BasicBlock *ExitBlock = ExitBlocks[0]; 23540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 23640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Make sure there is only one predecessor block in the loop. 23740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *ExitingBlock = 0; 23840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 23940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PI != PE; ++PI) 24040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (L->contains(*PI)) { 24140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (ExitingBlock == 0) 24240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ExitingBlock = *PI; 24340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 2449ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return 0; // Multiple exits from loop to this block. 24540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 24640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(ExitingBlock && "Loop info is broken"); 24740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 24840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!isa<BranchInst>(ExitingBlock->getTerminator())) 2499ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return 0; // Can't rewrite non-branch yet 25040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BranchInst *BI = cast<BranchInst>(ExitingBlock->getTerminator()); 25140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(BI->isConditional() && "Must be conditional to be part of loop!"); 25240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 2539ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Instruction *PotentiallyDeadInst = dyn_cast<Instruction>(BI->getCondition()); 2549ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner 255d244057a48660c3cd30d219118ece3f947947790Chris Lattner // If the exiting block is not the same as the backedge block, we must compare 256d244057a48660c3cd30d219118ece3f947947790Chris Lattner // against the preincremented value, otherwise we prefer to compare against 257d244057a48660c3cd30d219118ece3f947947790Chris Lattner // the post-incremented value. 258d244057a48660c3cd30d219118ece3f947947790Chris Lattner BasicBlock *Header = L->getHeader(); 259d244057a48660c3cd30d219118ece3f947947790Chris Lattner pred_iterator HPI = pred_begin(Header); 260d244057a48660c3cd30d219118ece3f947947790Chris Lattner assert(HPI != pred_end(Header) && "Loop with zero preds???"); 261d244057a48660c3cd30d219118ece3f947947790Chris Lattner if (!L->contains(*HPI)) ++HPI; 262d244057a48660c3cd30d219118ece3f947947790Chris Lattner assert(HPI != pred_end(Header) && L->contains(*HPI) && 263d244057a48660c3cd30d219118ece3f947947790Chris Lattner "No backedge in loop?"); 264d244057a48660c3cd30d219118ece3f947947790Chris Lattner 265d244057a48660c3cd30d219118ece3f947947790Chris Lattner SCEVHandle TripCount = IterationCount; 266d244057a48660c3cd30d219118ece3f947947790Chris Lattner Value *IndVar; 267d244057a48660c3cd30d219118ece3f947947790Chris Lattner if (*HPI == ExitingBlock) { 268d244057a48660c3cd30d219118ece3f947947790Chris Lattner // The IterationCount expression contains the number of times that the 269d244057a48660c3cd30d219118ece3f947947790Chris Lattner // backedge actually branches to the loop header. This is one less than the 270d244057a48660c3cd30d219118ece3f947947790Chris Lattner // number of times the loop executes, so add one to it. 271e19dd875987f8327cd93a502d4a05fc1f37064eeDan Gohman ConstantInt *OneC = ConstantInt::get(IterationCount->getType(), 1); 272246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman TripCount = SE->getAddExpr(IterationCount, SE->getConstant(OneC)); 273d244057a48660c3cd30d219118ece3f947947790Chris Lattner IndVar = L->getCanonicalInductionVariableIncrement(); 274d244057a48660c3cd30d219118ece3f947947790Chris Lattner } else { 275d244057a48660c3cd30d219118ece3f947947790Chris Lattner // We have to use the preincremented value... 276d244057a48660c3cd30d219118ece3f947947790Chris Lattner IndVar = L->getCanonicalInductionVariable(); 277d244057a48660c3cd30d219118ece3f947947790Chris Lattner } 278ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner 279ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: LFTR: TripCount = " << *TripCount 280ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " IndVar = " << *IndVar << "\n"; 28159fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner 28240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Expand the code for the iteration count into the preheader of the loop. 28340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 284d19534add90a2a894af61523b830887097bb780bDan Gohman Value *ExitCnt = RW.expandCodeFor(TripCount, Preheader->getTerminator()); 28540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 286e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // Insert a new icmp_ne or icmp_eq instruction before the branch. 287e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate Opcode; 28840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (L->contains(BI->getSuccessor(0))) 289e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Opcode = ICmpInst::ICMP_NE; 29040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 291e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Opcode = ICmpInst::ICMP_EQ; 29240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 293e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Value *Cond = new ICmpInst(Opcode, IndVar, ExitCnt, "exitcond", BI); 29440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BI->setCondition(Cond); 29540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumLFTR; 29640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 2979ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return PotentiallyDeadInst; 29840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 2993324e718bc9ac2ede08a14c325848b576849542bChris Lattner 3003324e718bc9ac2ede08a14c325848b576849542bChris Lattner 30140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// RewriteLoopExitValues - Check to see if this loop has a computable 30240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// loop-invariant execution count. If so, this means that we can compute the 30340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// final value of any expressions that are recurrent in the loop, and 30440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// substitute the exit values from the loop into any instructions outside of 30540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// the loop that use the final values of the current expressions. 30640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattnervoid IndVarSimplify::RewriteLoopExitValues(Loop *L) { 30740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 30840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 30940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Scan all of the instructions in the loop, looking at those that have 31040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // extra-loop users and which are recurrences. 3114a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 31240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 31340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // We insert the code into the preheader of the loop if the loop contains 31440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // multiple exit blocks, or in the exit block if there is exactly one. 31540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *BlockToInsertInto; 316b7211a2ce13a0365e0e1dd2f27adda2ee3d1288bDevang Patel SmallVector<BasicBlock*, 8> ExitBlocks; 3179f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner L->getUniqueExitBlocks(ExitBlocks); 318f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner if (ExitBlocks.size() == 1) 319f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner BlockToInsertInto = ExitBlocks[0]; 32040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 32140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BlockToInsertInto = Preheader; 32202dea8b39f3acad5de1df36273444d149145e7fcDan Gohman BasicBlock::iterator InsertPt = BlockToInsertInto->getFirstNonPHI(); 32340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 32420aa098ba694aa7e3f5fb5a52d22dba7c1e857aeChris Lattner bool HasConstantItCount = isa<SCEVConstant>(SE->getIterationCount(L)); 32520aa098ba694aa7e3f5fb5a52d22dba7c1e857aeChris Lattner 32640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> InstructionsToDelete; 3279f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner std::map<Instruction*, Value*> ExitValues; 3289f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3299f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Find all values that are computed inside the loop, but used outside of it. 3309f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan 3319f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // the exit blocks of the loop to find them. 3329f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) { 3339f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner BasicBlock *ExitBB = ExitBlocks[i]; 3349f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3359f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // If there are no PHI nodes in this exit block, then no values defined 3369f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // inside the loop are used on this path, skip it. 3379f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner PHINode *PN = dyn_cast<PHINode>(ExitBB->begin()); 3389f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (!PN) continue; 3399f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3409f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner unsigned NumPreds = PN->getNumIncomingValues(); 3419f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3429f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Iterate over all of the PHI nodes. 3439f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner BasicBlock::iterator BBI = ExitBB->begin(); 3449f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner while ((PN = dyn_cast<PHINode>(BBI++))) { 345c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 3469f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Iterate over all of the values in all the PHI nodes. 3479f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner for (unsigned i = 0; i != NumPreds; ++i) { 3489f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // If the value being merged in is not integer or is not defined 3499f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // in the loop, skip it. 3509f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner Value *InVal = PN->getIncomingValue(i); 3519f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (!isa<Instruction>(InVal) || 3529f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // SCEV only supports integer expressions for now. 3539f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner !isa<IntegerType>(InVal->getType())) 3549f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner continue; 3559f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3569f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // If this pred is for a subloop, not L itself, skip it. 3579f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (LI->getLoopFor(PN->getIncomingBlock(i)) != L) 3589f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner continue; // The Block is in a subloop, skip it. 3599f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3609f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Check that InVal is defined in the loop. 3619f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner Instruction *Inst = cast<Instruction>(InVal); 3629f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (!L->contains(Inst->getParent())) 3639f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner continue; 3649f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3659f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // We require that this value either have a computable evolution or that 3669f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // the loop have a constant iteration count. In the case where the loop 3679f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // has a constant iteration count, we can sometimes force evaluation of 3689f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // the exit value through brute force. 3699f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner SCEVHandle SH = SE->getSCEV(Inst); 3709f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (!SH->hasComputableLoopEvolution(L) && !HasConstantItCount) 3719f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner continue; // Cannot get exit evolution for the loop value. 3729f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3739f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // Okay, this instruction has a user outside of the current loop 3749f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // and varies predictably *inside* the loop. Evaluate the value it 3759f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // contains when the loop exits, if possible. 3769f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner SCEVHandle ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop()); 3779f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (isa<SCEVCouldNotCompute>(ExitValue) || 3789f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner !ExitValue->isLoopInvariant(L)) 3799f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner continue; 3809f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3819f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner Changed = true; 3829f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner ++NumReplaced; 3839caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner 3849f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // See if we already computed the exit value for the instruction, if so, 3859f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // just reuse it. 3869f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner Value *&ExitVal = ExitValues[Inst]; 3879f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (!ExitVal) 388d19534add90a2a894af61523b830887097bb780bDan Gohman ExitVal = Rewriter.expandCodeFor(ExitValue, InsertPt); 3899f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3909f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner DOUT << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal 3919f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner << " LoopVal = " << *Inst << "\n"; 3929caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner 3939f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner PN->setIncomingValue(i, ExitVal); 3949f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3959f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // If this instruction is dead now, schedule it to be removed. 3969f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (Inst->use_empty()) 3979f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner InstructionsToDelete.insert(Inst); 3989f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner 3999f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // See if this is a single-entry LCSSA PHI node. If so, we can (and 4009f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner // have to) remove 4019caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner // the PHI entirely. This is safe, because the NewVal won't be variant 4029caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner // in the loop, so we don't need an LCSSA phi node anymore. 4039f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner if (NumPreds == 1) { 4045cec4db6ae13a41d04d86f37e347fc5b5997c948Dan Gohman SE->deleteValueFromRecords(PN); 4059f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner PN->replaceAllUsesWith(ExitVal); 4069f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner PN->eraseFromParent(); 4079f3d73886612fd06812fb63cf8e6fa10db9b17e7Chris Lattner break; 408c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 4094bd09d70cceb3851f7eb1c2f98338b3071d405f3Chris Lattner } 410c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 411c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 412c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 41340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeleteTriviallyDeadInstructions(InstructionsToDelete); 41440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 41515cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 4165ee99979065d75605d150d7e567e4351024aae8fDevang Patelbool IndVarSimplify::doInitialization(Loop *L, LPPassManager &LPM) { 41715cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 4185ee99979065d75605d150d7e567e4351024aae8fDevang Patel Changed = false; 41940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // First step. Check to see if there are any trivial GEP pointer recurrences. 42040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If there are, change them into integer recurrences, permitting analysis by 42140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // the SCEV routines. 42215cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner // 42340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Header = L->getHeader(); 42440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 4255ee99979065d75605d150d7e567e4351024aae8fDevang Patel SE = &LPM.getAnalysis<ScalarEvolution>(); 426fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 42740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> DeadInsts; 4282da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 4292da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode *PN = cast<PHINode>(I); 43040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (isa<PointerType>(PN->getType())) 43140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner EliminatePointerRecurrence(PN, Preheader, DeadInsts); 4322da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer } 43315cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 43440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!DeadInsts.empty()) 43540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeleteTriviallyDeadInstructions(DeadInsts); 436394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 4375ee99979065d75605d150d7e567e4351024aae8fDevang Patel return Changed; 4385ee99979065d75605d150d7e567e4351024aae8fDevang Patel} 4395ee99979065d75605d150d7e567e4351024aae8fDevang Patel 4405ee99979065d75605d150d7e567e4351024aae8fDevang Patelbool IndVarSimplify::runOnLoop(Loop *L, LPPassManager &LPM) { 4415ee99979065d75605d150d7e567e4351024aae8fDevang Patel 442394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 4435ee99979065d75605d150d7e567e4351024aae8fDevang Patel LI = &getAnalysis<LoopInfo>(); 4445ee99979065d75605d150d7e567e4351024aae8fDevang Patel SE = &getAnalysis<ScalarEvolution>(); 445394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 4465ee99979065d75605d150d7e567e4351024aae8fDevang Patel Changed = false; 4475ee99979065d75605d150d7e567e4351024aae8fDevang Patel BasicBlock *Header = L->getHeader(); 4485ee99979065d75605d150d7e567e4351024aae8fDevang Patel std::set<Instruction*> DeadInsts; 4495ee99979065d75605d150d7e567e4351024aae8fDevang Patel 4509caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner // Verify the input to the pass in already in LCSSA form. 4519caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner assert(L->isLCSSAForm()); 4529caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner 45340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Check to see if this loop has a computable loop-invariant execution count. 45440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If so, this means that we can compute the final value of any expressions 45540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // that are recurrent in the loop, and substitute the exit values from the 45640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // loop into any instructions outside of the loop that use the final values of 45740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // the current expressions. 458394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner // 45940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle IterationCount = SE->getIterationCount(L); 46040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!isa<SCEVCouldNotCompute>(IterationCount)) 46140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner RewriteLoopExitValues(L); 46240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 46340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Next, analyze all of the induction variables in the loop, canonicalizing 46440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // auxillary induction variables. 46540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::vector<std::pair<PHINode*, SCEVHandle> > IndVars; 46640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 4672da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 4682da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode *PN = cast<PHINode>(I); 46942a75517250017a52afb03a0ade03cbd49559fe5Chris Lattner if (PN->getType()->isInteger()) { // FIXME: when we have fast-math, enable! 47040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle SCEV = SE->getSCEV(PN); 47140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (SCEV->hasComputableLoopEvolution(L)) 472cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // FIXME: It is an extremely bad idea to indvar substitute anything more 473cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // complex than affine induction variables. Doing so will put expensive 474cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // polynomial evaluations inside of the loop, and the str reduction pass 475cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // currently can only reduce affine polynomials. For now just disable 476cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // indvar subst on anything more complex than an affine addrec. 477595ee7ec26432e4804f1e71817d9cf9b1f86318dChris Lattner if (SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SCEV)) 478cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner if (AR->isAffine()) 479595ee7ec26432e4804f1e71817d9cf9b1f86318dChris Lattner IndVars.push_back(std::make_pair(PN, SCEV)); 48040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 4812da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer } 482f016ea4ff80c56c467247a90567dd07bddb590f3Chris Lattner 48340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If there are no induction variables in the loop, there is nothing more to 48440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // do. 485f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner if (IndVars.empty()) { 486f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner // Actually, if we know how many times the loop iterates, lets insert a 487f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner // canonical induction variable to help subsequent passes. 488f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner if (!isa<SCEVCouldNotCompute>(IterationCount)) { 4894a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 4904a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Rewriter.getOrInsertCanonicalInductionVariable(L, 491f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner IterationCount->getType()); 4929ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (Instruction *I = LinearFunctionTestReplace(L, IterationCount, 4939ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Rewriter)) { 4949ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner std::set<Instruction*> InstructionsToDelete; 4959ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner InstructionsToDelete.insert(I); 4969ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner DeleteTriviallyDeadInstructions(InstructionsToDelete); 4979ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner } 498f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner } 4995ee99979065d75605d150d7e567e4351024aae8fDevang Patel return Changed; 500f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner } 501f016ea4ff80c56c467247a90567dd07bddb590f3Chris Lattner 50240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Compute the type of the largest recurrence expression. 50340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // 50440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner const Type *LargestType = IndVars[0].first->getType(); 505fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner bool DifferingSizes = false; 50640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 1, e = IndVars.size(); i != e; ++i) { 50740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner const Type *Ty = IndVars[i].first->getType(); 508abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer DifferingSizes |= 509abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer Ty->getPrimitiveSizeInBits() != LargestType->getPrimitiveSizeInBits(); 510abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer if (Ty->getPrimitiveSizeInBits() > LargestType->getPrimitiveSizeInBits()) 51140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner LargestType = Ty; 512500597a1c39e91a3020587318ed61e737b6c613aChris Lattner } 513394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 51440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Create a rewriter object which we'll use to transform the code with. 5154a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 51640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 51740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Now that we know the largest of of the induction variables in this loop, 51840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // insert a canonical induction variable of the largest size. 5194a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *IndVar = Rewriter.getOrInsertCanonicalInductionVariable(L,LargestType); 52040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumInserted; 52140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 522ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: New CanIV: " << *IndVar; 52340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 524d19534add90a2a894af61523b830887097bb780bDan Gohman if (!isa<SCEVCouldNotCompute>(IterationCount)) { 5250d7d3656f3d10c510353d69472de4c0c0691b2e6Zhou Sheng if (IterationCount->getType()->getPrimitiveSizeInBits() < 5260d7d3656f3d10c510353d69472de4c0c0691b2e6Zhou Sheng LargestType->getPrimitiveSizeInBits()) 527246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman IterationCount = SE->getZeroExtendExpr(IterationCount, LargestType); 5280d7d3656f3d10c510353d69472de4c0c0691b2e6Zhou Sheng else if (IterationCount->getType() != LargestType) 529246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman IterationCount = SE->getTruncateExpr(IterationCount, LargestType); 5309ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (Instruction *DI = LinearFunctionTestReplace(L, IterationCount,Rewriter)) 5319ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner DeadInsts.insert(DI); 532d19534add90a2a894af61523b830887097bb780bDan Gohman } 53340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 53440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Now that we have a canonical induction variable, we can rewrite any 53540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // recurrences in terms of the induction variable. Start with the auxillary 53640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // induction variables, and recursively rewrite any of their uses. 53702dea8b39f3acad5de1df36273444d149145e7fcDan Gohman BasicBlock::iterator InsertPt = Header->getFirstNonPHI(); 53840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 5395d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // If there were induction variables of other sizes, cast the primary 5405d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // induction variable to the right size for them, avoiding the need for the 5415d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // code evaluation methods to insert induction variables of different sizes. 542fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner if (DifferingSizes) { 543a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer SmallVector<unsigned,4> InsertedSizes; 544a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer InsertedSizes.push_back(LargestType->getPrimitiveSizeInBits()); 545a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer for (unsigned i = 0, e = IndVars.size(); i != e; ++i) { 546a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer unsigned ithSize = IndVars[i].first->getType()->getPrimitiveSizeInBits(); 547ef60b2c4ed67017a46442903c898bc24ed9a6c91Chris Lattner if (std::find(InsertedSizes.begin(), InsertedSizes.end(), ithSize) 548ef60b2c4ed67017a46442903c898bc24ed9a6c91Chris Lattner == InsertedSizes.end()) { 549fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner PHINode *PN = IndVars[i].first; 550a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer InsertedSizes.push_back(ithSize); 551ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner Instruction *New = new TruncInst(IndVar, PN->getType(), "indvar", 552ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner InsertPt); 553fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner Rewriter.addInsertedValue(New, SE->getSCEV(New)); 554ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Made trunc IV for " << *PN 555ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " NewVal = " << *New << "\n"; 556fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner } 557a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer } 558fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner } 559fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner 560ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner // Rewrite all induction variables in terms of the canonical induction 561ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner // variable. 5625d461d20aea308471f2a31b718a274bfee28b60cChris Lattner std::map<unsigned, Value*> InsertedSizes; 56340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (!IndVars.empty()) { 56440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PHINode *PN = IndVars.back().first; 565d19534add90a2a894af61523b830887097bb780bDan Gohman Value *NewVal = Rewriter.expandCodeFor(IndVars.back().second, InsertPt); 566ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Rewrote IV '" << *IndVars.back().second << "' " << *PN 567ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " into = " << *NewVal << "\n"; 5686934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner NewVal->takeName(PN); 5695d461d20aea308471f2a31b718a274bfee28b60cChris Lattner 57040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Replace the old PHI Node with the inserted computation. 571fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner PN->replaceAllUsesWith(NewVal); 57240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeadInsts.insert(PN); 57340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner IndVars.pop_back(); 57440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumRemoved; 57540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 576500597a1c39e91a3020587318ed61e737b6c613aChris Lattner } 577ba4f3f6a419326df190599421fa149c90235cb72Chris Lattner 578b4782d13d1444d9d18c0a681292cf0d0a32cf3efChris Lattner#if 0 5791363e85df74627530ceede53280613c62a4cdbe3Chris Lattner // Now replace all derived expressions in the loop body with simpler 5801363e85df74627530ceede53280613c62a4cdbe3Chris Lattner // expressions. 58140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) 58240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (LI->getLoopFor(L->getBlocks()[i]) == L) { // Not in a subloop... 58340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *BB = L->getBlocks()[i]; 58440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 58542a75517250017a52afb03a0ade03cbd49559fe5Chris Lattner if (I->getType()->isInteger() && // Is an integer instruction 5861363e85df74627530ceede53280613c62a4cdbe3Chris Lattner !I->use_empty() && 58740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner !Rewriter.isInsertedInstruction(I)) { 58840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle SH = SE->getSCEV(I); 5894a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *V = Rewriter.expandCodeFor(SH, I, I->getType()); 5901363e85df74627530ceede53280613c62a4cdbe3Chris Lattner if (V != I) { 5916934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner if (isa<Instruction>(V)) 5926934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner V->takeName(I); 5931363e85df74627530ceede53280613c62a4cdbe3Chris Lattner I->replaceAllUsesWith(V); 5941363e85df74627530ceede53280613c62a4cdbe3Chris Lattner DeadInsts.insert(I); 5951363e85df74627530ceede53280613c62a4cdbe3Chris Lattner ++NumRemoved; 5961363e85df74627530ceede53280613c62a4cdbe3Chris Lattner Changed = true; 597fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 59840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 599394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner } 600b4782d13d1444d9d18c0a681292cf0d0a32cf3efChris Lattner#endif 6011363e85df74627530ceede53280613c62a4cdbe3Chris Lattner 6021363e85df74627530ceede53280613c62a4cdbe3Chris Lattner DeleteTriviallyDeadInstructions(DeadInsts); 603eb705914924865201f8b8018977d94594b258142Owen Anderson 6049caed5440d59dac4b388152fe8b993dc0491e5e9Chris Lattner assert(L->isLCSSAForm()); 6055ee99979065d75605d150d7e567e4351024aae8fDevang Patel return Changed; 6066148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner} 607