IndVarSimplify.cpp revision c9838f25d53d3dd7d38949ef6c28f2505a110f45
16148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner//===- IndVarSimplify.cpp - Induction Variable Elimination ----------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 5b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// This file was developed by the LLVM research group and is distributed under 6b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// the University of Illinois Open Source 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" 48455889aa79e3463a4b0f2161e3d9d72a683268b6Chris Lattner#include "llvm/Support/CFG.h" 499133fe28954d498fc4de13064c7d65bd811de02cReid Spencer#include "llvm/Support/Compiler.h" 50ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner#include "llvm/Support/Debug.h" 51a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner#include "llvm/Support/GetElementPtrTypeIterator.h" 5247df12d80db90e125e9f2ff764286ee11665476dJohn Criswell#include "llvm/Transforms/Utils/Local.h" 53551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/CommandLine.h" 54a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer#include "llvm/ADT/SmallVector.h" 55551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/ADT/Statistic.h" 5647df12d80db90e125e9f2ff764286ee11665476dJohn Criswellusing namespace llvm; 57d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 580e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumRemoved , "Number of aux indvars removed"); 590e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumPointer , "Number of pointer indvars promoted"); 600e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumInserted, "Number of canonical indvars added"); 610e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumReplaced, "Number of exit values replaced"); 620e5f499638c8d277b9dc4a4385712177c53b5681Chris LattnerSTATISTIC(NumLFTR , "Number of loop exit tests replaced"); 633324e718bc9ac2ede08a14c325848b576849542bChris Lattner 640e5f499638c8d277b9dc4a4385712177c53b5681Chris Lattnernamespace { 659133fe28954d498fc4de13064c7d65bd811de02cReid Spencer class VISIBILITY_HIDDEN IndVarSimplify : public FunctionPass { 6640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner LoopInfo *LI; 6740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ScalarEvolution *SE; 6815cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner bool Changed; 693324e718bc9ac2ede08a14c325848b576849542bChris Lattner public: 703324e718bc9ac2ede08a14c325848b576849542bChris Lattner virtual bool runOnFunction(Function &) { 7140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner LI = &getAnalysis<LoopInfo>(); 7240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SE = &getAnalysis<ScalarEvolution>(); 7315cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner Changed = false; 7415cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 753324e718bc9ac2ede08a14c325848b576849542bChris Lattner // Induction Variables live in the header nodes of loops 7640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) 77329c1c6c949d07e3fe9722ec633b4258217fd99dChris Lattner runOnLoop(*I); 783324e718bc9ac2ede08a14c325848b576849542bChris Lattner return Changed; 793324e718bc9ac2ede08a14c325848b576849542bChris Lattner } 803324e718bc9ac2ede08a14c325848b576849542bChris Lattner 813324e718bc9ac2ede08a14c325848b576849542bChris Lattner virtual void getAnalysisUsage(AnalysisUsage &AU) const { 823324e718bc9ac2ede08a14c325848b576849542bChris Lattner AU.addRequiredID(LoopSimplifyID); 8340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner AU.addRequired<ScalarEvolution>(); 8440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner AU.addRequired<LoopInfo>(); 853324e718bc9ac2ede08a14c325848b576849542bChris Lattner AU.addPreservedID(LoopSimplifyID); 86ac123227109303be313c3c4625b152246969e781Owen Anderson AU.addPreservedID(LCSSAID); 873324e718bc9ac2ede08a14c325848b576849542bChris Lattner AU.setPreservesCFG(); 883324e718bc9ac2ede08a14c325848b576849542bChris Lattner } 8940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner private: 9040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void runOnLoop(Loop *L); 9140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void EliminatePointerRecurrence(PHINode *PN, BasicBlock *Preheader, 9240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> &DeadInsts); 939ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Instruction *LinearFunctionTestReplace(Loop *L, SCEV *IterationCount, 949ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEVExpander &RW); 9540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void RewriteLoopExitValues(Loop *L); 9640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 9740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner void DeleteTriviallyDeadInstructions(std::set<Instruction*> &Insts); 983324e718bc9ac2ede08a14c325848b576849542bChris Lattner }; 997f8897f22e88271cfa114998a4d6088e7c8e8e11Chris Lattner RegisterPass<IndVarSimplify> X("indvars", "Canonicalize Induction Variables"); 1005e76140536ba66fadeced1cd892f79616f407e3cChris Lattner} 101394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 1024b5015604908e9296800991a7c538a255356428fChris LattnerFunctionPass *llvm::createIndVarSimplifyPass() { 1033324e718bc9ac2ede08a14c325848b576849542bChris Lattner return new IndVarSimplify(); 104394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner} 105394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 10640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// DeleteTriviallyDeadInstructions - If any of the instructions is the 10740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// specified set are trivially dead, delete them and see if this makes any of 10840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// their operands subsequently dead. 10940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattnervoid IndVarSimplify:: 11040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris LattnerDeleteTriviallyDeadInstructions(std::set<Instruction*> &Insts) { 11140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (!Insts.empty()) { 11240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Instruction *I = *Insts.begin(); 11340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Insts.erase(Insts.begin()); 11440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (isInstructionTriviallyDead(I)) { 11540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) 11640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (Instruction *U = dyn_cast<Instruction>(I->getOperand(i))) 11740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Insts.insert(U); 11840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SE->deleteInstructionFromRecords(I); 119ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Deleting: " << *I; 120a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner I->eraseFromParent(); 12140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 12240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 12340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 12440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 1253324e718bc9ac2ede08a14c325848b576849542bChris Lattner 1266148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner 12740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// EliminatePointerRecurrence - Check to see if this is a trivial GEP pointer 12840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// recurrence. If so, change it into an integer recurrence, permitting 12940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// analysis by the SCEV routines. 130fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukmanvoid IndVarSimplify::EliminatePointerRecurrence(PHINode *PN, 13140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader, 13240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> &DeadInsts) { 13340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(PN->getNumIncomingValues() == 2 && "Noncanonicalized loop!"); 13440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner unsigned PreheaderIdx = PN->getBasicBlockIndex(Preheader); 13540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner unsigned BackedgeIdx = PreheaderIdx^1; 13640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (GetElementPtrInst *GEPI = 137cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner dyn_cast<GetElementPtrInst>(PN->getIncomingValue(BackedgeIdx))) 13840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (GEPI->getOperand(0) == PN) { 139cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner assert(GEPI->getNumOperands() == 2 && "GEP types must match!"); 140ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Eliminating pointer recurrence: " << *GEPI; 141ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner 14240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Okay, we found a pointer recurrence. Transform this pointer 14340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // recurrence into an integer recurrence. Compute the value that gets 14440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // added to the pointer at every iteration. 14540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Value *AddedVal = GEPI->getOperand(1); 14640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 14740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Insert a new integer PHI node into the top of the block. 14840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PHINode *NewPhi = new PHINode(AddedVal->getType(), 14940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PN->getName()+".rec", PN); 150c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner NewPhi->addIncoming(Constant::getNullValue(NewPhi->getType()), Preheader); 151c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner 15240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Create the new add instruction. 153c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner Value *NewAdd = BinaryOperator::createAdd(NewPhi, AddedVal, 154c5c5e6afe584ffbd2bf2ce755e65bc89f170053aChris Lattner GEPI->getName()+".rec", GEPI); 15540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner NewPhi->addIncoming(NewAdd, PN->getIncomingBlock(BackedgeIdx)); 156fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 15740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Update the existing GEP to use the recurrence. 15840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner GEPI->setOperand(0, PN->getIncomingValue(PreheaderIdx)); 159fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 16040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Update the GEP to use the new recurrence we just inserted. 16140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner GEPI->setOperand(1, NewAdd); 16240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 163a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // If the incoming value is a constant expr GEP, try peeling out the array 164a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // 0 index if possible to make things simpler. 165a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(GEPI->getOperand(0))) 166a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (CE->getOpcode() == Instruction::GetElementPtr) { 167a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner unsigned NumOps = CE->getNumOperands(); 168a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner assert(NumOps > 1 && "CE folding didn't work!"); 169a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (CE->getOperand(NumOps-1)->isNullValue()) { 170a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // Check to make sure the last index really is an array index. 1711730078d5f553d7516a06e098e6c2089dc8bef9cChris Lattner gep_type_iterator GTI = gep_type_begin(CE); 172ceda605fd7d0e3532a22743538c6d118fe5e40c1Chris Lattner for (unsigned i = 1, e = CE->getNumOperands()-1; 173a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner i != e; ++i, ++GTI) 174a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner /*empty*/; 175a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner if (isa<SequentialType>(*GTI)) { 176a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner // Pull the last index out of the constant expr GEP. 17755eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner SmallVector<Value*, 8> CEIdxs(CE->op_begin()+1, CE->op_end()-1); 178a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner Constant *NCE = ConstantExpr::getGetElementPtr(CE->getOperand(0), 17955eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner &CEIdxs[0], 18055eb1c47de30a6b4e8707b6392e878e32a6583e9Chris Lattner CEIdxs.size()); 181cae5754619433aed7be74abbf1c0551a82d369cbReid Spencer GetElementPtrInst *NGEPI = new GetElementPtrInst( 182cae5754619433aed7be74abbf1c0551a82d369cbReid Spencer NCE, Constant::getNullValue(Type::Int32Ty), NewAdd, 183cae5754619433aed7be74abbf1c0551a82d369cbReid Spencer GEPI->getName(), GEPI); 184a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI->replaceAllUsesWith(NGEPI); 185a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI->eraseFromParent(); 186a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner GEPI = NGEPI; 187a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 188a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 189a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner } 190a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner 191a4b9c7841f94b6a3a2ba6c562b5dc4f4de02c637Chris Lattner 19240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Finally, if there are any other users of the PHI node, we must 19340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // insert a new GEP instruction that uses the pre-incremented version 19440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // of the induction amount. 19540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!PN->use_empty()) { 19640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock::iterator InsertPos = PN; ++InsertPos; 19740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (isa<PHINode>(InsertPos)) ++InsertPos; 19840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Value *PreInc = 19940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner new GetElementPtrInst(PN->getIncomingValue(PreheaderIdx), 2006934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner NewPhi, "", InsertPos); 2016934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner PreInc->takeName(PN); 20240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PN->replaceAllUsesWith(PreInc); 20340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 20440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 20540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Delete the old PHI for sure, and the GEP if its otherwise unused. 20640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeadInsts.insert(PN); 2073324e718bc9ac2ede08a14c325848b576849542bChris Lattner 20840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumPointer; 20940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 21040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 21140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 2123324e718bc9ac2ede08a14c325848b576849542bChris Lattner 21340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// LinearFunctionTestReplace - This method rewrites the exit condition of the 21459fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// loop to be a canonical != comparison against the incremented loop induction 21559fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// variable. This pass is able to rewrite the exit tests of any loop where the 21659fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// SCEV analysis can determine a loop-invariant trip count of the loop, which 21759fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner/// is actually a much broader range than just linear tests. 2189ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// 2199ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// This method returns a "potentially dead" instruction whose computation chain 2209ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner/// should be deleted when convenient. 2219ba46c13bf3d49a5b697227c88ef987951e6b50dChris LattnerInstruction *IndVarSimplify::LinearFunctionTestReplace(Loop *L, 2229ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEV *IterationCount, 2239ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner SCEVExpander &RW) { 22440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Find the exit block for the loop. We can currently only handle loops with 22540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // a single exit. 226f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner std::vector<BasicBlock*> ExitBlocks; 227f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner L->getExitBlocks(ExitBlocks); 2289ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (ExitBlocks.size() != 1) return 0; 229f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner BasicBlock *ExitBlock = ExitBlocks[0]; 23040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 23140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Make sure there is only one predecessor block in the loop. 23240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *ExitingBlock = 0; 23340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 23440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PI != PE; ++PI) 23540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (L->contains(*PI)) { 23640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (ExitingBlock == 0) 23740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ExitingBlock = *PI; 23840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 2399ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return 0; // Multiple exits from loop to this block. 24040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 24140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(ExitingBlock && "Loop info is broken"); 24240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 24340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!isa<BranchInst>(ExitingBlock->getTerminator())) 2449ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return 0; // Can't rewrite non-branch yet 24540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BranchInst *BI = cast<BranchInst>(ExitingBlock->getTerminator()); 24640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner assert(BI->isConditional() && "Must be conditional to be part of loop!"); 24740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 2489ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Instruction *PotentiallyDeadInst = dyn_cast<Instruction>(BI->getCondition()); 2499ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner 250d244057a48660c3cd30d219118ece3f947947790Chris Lattner // If the exiting block is not the same as the backedge block, we must compare 251d244057a48660c3cd30d219118ece3f947947790Chris Lattner // against the preincremented value, otherwise we prefer to compare against 252d244057a48660c3cd30d219118ece3f947947790Chris Lattner // the post-incremented value. 253d244057a48660c3cd30d219118ece3f947947790Chris Lattner BasicBlock *Header = L->getHeader(); 254d244057a48660c3cd30d219118ece3f947947790Chris Lattner pred_iterator HPI = pred_begin(Header); 255d244057a48660c3cd30d219118ece3f947947790Chris Lattner assert(HPI != pred_end(Header) && "Loop with zero preds???"); 256d244057a48660c3cd30d219118ece3f947947790Chris Lattner if (!L->contains(*HPI)) ++HPI; 257d244057a48660c3cd30d219118ece3f947947790Chris Lattner assert(HPI != pred_end(Header) && L->contains(*HPI) && 258d244057a48660c3cd30d219118ece3f947947790Chris Lattner "No backedge in loop?"); 259d244057a48660c3cd30d219118ece3f947947790Chris Lattner 260d244057a48660c3cd30d219118ece3f947947790Chris Lattner SCEVHandle TripCount = IterationCount; 261d244057a48660c3cd30d219118ece3f947947790Chris Lattner Value *IndVar; 262d244057a48660c3cd30d219118ece3f947947790Chris Lattner if (*HPI == ExitingBlock) { 263d244057a48660c3cd30d219118ece3f947947790Chris Lattner // The IterationCount expression contains the number of times that the 264d244057a48660c3cd30d219118ece3f947947790Chris Lattner // backedge actually branches to the loop header. This is one less than the 265d244057a48660c3cd30d219118ece3f947947790Chris Lattner // number of times the loop executes, so add one to it. 266d244057a48660c3cd30d219118ece3f947947790Chris Lattner Constant *OneC = ConstantInt::get(IterationCount->getType(), 1); 267d244057a48660c3cd30d219118ece3f947947790Chris Lattner TripCount = SCEVAddExpr::get(IterationCount, SCEVUnknown::get(OneC)); 268d244057a48660c3cd30d219118ece3f947947790Chris Lattner IndVar = L->getCanonicalInductionVariableIncrement(); 269d244057a48660c3cd30d219118ece3f947947790Chris Lattner } else { 270d244057a48660c3cd30d219118ece3f947947790Chris Lattner // We have to use the preincremented value... 271d244057a48660c3cd30d219118ece3f947947790Chris Lattner IndVar = L->getCanonicalInductionVariable(); 272d244057a48660c3cd30d219118ece3f947947790Chris Lattner } 273ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner 274ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: LFTR: TripCount = " << *TripCount 275ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " IndVar = " << *IndVar << "\n"; 27659fdaeeae8f183e18bb6ad5c382ca23e28e6aaf6Chris Lattner 27740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Expand the code for the iteration count into the preheader of the loop. 27840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 2794a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *ExitCnt = RW.expandCodeFor(TripCount, Preheader->getTerminator(), 28040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner IndVar->getType()); 28140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 282e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // Insert a new icmp_ne or icmp_eq instruction before the branch. 283e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate Opcode; 28440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (L->contains(BI->getSuccessor(0))) 285e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Opcode = ICmpInst::ICMP_NE; 28640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 287e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Opcode = ICmpInst::ICMP_EQ; 28840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 289e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Value *Cond = new ICmpInst(Opcode, IndVar, ExitCnt, "exitcond", BI); 29040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BI->setCondition(Cond); 29140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumLFTR; 29240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 2939ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner return PotentiallyDeadInst; 29440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 2953324e718bc9ac2ede08a14c325848b576849542bChris Lattner 2963324e718bc9ac2ede08a14c325848b576849542bChris Lattner 29740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// RewriteLoopExitValues - Check to see if this loop has a computable 29840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// loop-invariant execution count. If so, this means that we can compute the 29940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// final value of any expressions that are recurrent in the loop, and 30040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// substitute the exit values from the loop into any instructions outside of 30140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner/// the loop that use the final values of the current expressions. 30240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattnervoid IndVarSimplify::RewriteLoopExitValues(Loop *L) { 30340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 30440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 30540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Scan all of the instructions in the loop, looking at those that have 30640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // extra-loop users and which are recurrences. 3074a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 30840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 30940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // We insert the code into the preheader of the loop if the loop contains 31040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // multiple exit blocks, or in the exit block if there is exactly one. 31140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *BlockToInsertInto; 312f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner std::vector<BasicBlock*> ExitBlocks; 313f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner L->getExitBlocks(ExitBlocks); 314f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner if (ExitBlocks.size() == 1) 315f1ab4b4eac5603d19c20f4a508f93a118a52bdd5Chris Lattner BlockToInsertInto = ExitBlocks[0]; 31640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner else 31740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BlockToInsertInto = Preheader; 31840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock::iterator InsertPt = BlockToInsertInto->begin(); 31940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 32040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 32120aa098ba694aa7e3f5fb5a52d22dba7c1e857aeChris Lattner bool HasConstantItCount = isa<SCEVConstant>(SE->getIterationCount(L)); 32220aa098ba694aa7e3f5fb5a52d22dba7c1e857aeChris Lattner 32340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> InstructionsToDelete; 324fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 325c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // Loop over all of the integer-valued instructions in this loop, but that are 326c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // not in a subloop. 327c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) { 328c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (LI->getLoopFor(L->getBlocks()[i]) != L) 329c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; // The Block is in a subloop, skip it. 330c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner BasicBlock *BB = L->getBlocks()[i]; 331c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner for (BasicBlock::iterator II = BB->begin(), E = BB->end(); II != E; ) { 332c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Instruction *I = II++; 333c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 334c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (!I->getType()->isInteger()) 335c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; // SCEV only supports integer expressions for now. 336c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 337c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner SCEVHandle SH = SE->getSCEV(I); 338c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (!HasConstantItCount && 339c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner !SH->hasComputableLoopEvolution(L)) { // Varies predictably 340c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; // Cannot exit evolution for the loop value. 341c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 342c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 343c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // Find out if this predictably varying value is actually used 344c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // outside of the loop. "Extra" is as opposed to "intra". 345c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner std::vector<Instruction*> ExtraLoopUsers; 346c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); 347c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner UI != E; ++UI) { 348c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Instruction *User = cast<Instruction>(*UI); 349c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (!L->contains(User->getParent())) { 350c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // If this is a PHI node in the exit block and we're inserting, 351c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // into the exit block, it must have a single entry. In this 352c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // case, we can't insert the code after the PHI and have the PHI 353c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // still use it. Instead, don't insert the the PHI. 354c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 355c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // FIXME: This is a case where LCSSA pessimizes code, this 356c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // should be fixed better. 357c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (PN->getNumOperands() == 2 && 358c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PN->getParent() == BlockToInsertInto) 359c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; 36040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 361c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner ExtraLoopUsers.push_back(User); 36240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 363c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 364c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 365c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // If nothing outside the loop uses this value, don't rewrite it. 366c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (ExtraLoopUsers.empty()) 367c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; 368c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 369c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // Okay, this instruction has a user outside of the current loop 370c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // and varies predictably *inside* the loop. Evaluate the value it 371c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // contains when the loop exits if possible. 372c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner SCEVHandle ExitValue = SE->getSCEVAtScope(I, L->getParentLoop()); 373c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (isa<SCEVCouldNotCompute>(ExitValue)) 374c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner continue; 375c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 376c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Changed = true; 377c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner ++NumReplaced; 378c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 379c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Value *NewVal = Rewriter.expandCodeFor(ExitValue, InsertPt, 380c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner I->getType()); 3814bd09d70cceb3851f7eb1c2f98338b3071d405f3Chris Lattner 382c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner DOUT << "INDVARS: RLEV: AfterLoopVal = " << *NewVal 383c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner << " LoopVal = " << *I << "\n"; 384c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 385c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // Rewrite any users of the computed value outside of the loop 386c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // with the newly computed value. 387c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner for (unsigned i = 0, e = ExtraLoopUsers.size(); i != e; ++i) { 388c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PHINode* PN = dyn_cast<PHINode>(ExtraLoopUsers[i]); 389c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (PN && PN->getNumOperands() == 2 && 390c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner !L->contains(PN->getParent())) { 391c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // We're dealing with an LCSSA Phi. Handle it specially. 392c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Instruction* LCSSAInsertPt = BlockToInsertInto->begin(); 393c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 394c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Instruction* NewInstr = dyn_cast<Instruction>(NewVal); 395c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (NewInstr && !isa<PHINode>(NewInstr) && 396c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner !L->contains(NewInstr->getParent())) 397c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner for (unsigned j = 0; j != NewInstr->getNumOperands(); ++j) { 398c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner Instruction* PredI = 399c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner dyn_cast<Instruction>(NewInstr->getOperand(j)); 400c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (PredI && L->contains(PredI->getParent())) { 401c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PHINode* NewLCSSA = new PHINode(PredI->getType(), 402c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PredI->getName() + ".lcssa", 403c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner LCSSAInsertPt); 404c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner NewLCSSA->addIncoming(PredI, 405c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner BlockToInsertInto->getSinglePredecessor()); 406c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 407c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner NewInstr->replaceUsesOfWith(PredI, NewLCSSA); 408c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 409c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 410c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 411c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PN->replaceAllUsesWith(NewVal); 412c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner PN->eraseFromParent(); 413c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } else { 414c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner ExtraLoopUsers[i]->replaceUsesOfWith(I, NewVal); 415c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 4164bd09d70cceb3851f7eb1c2f98338b3071d405f3Chris Lattner } 4176148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner 418c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner // If this instruction is dead now, schedule it to be removed. 419c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner if (I->use_empty()) 420c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner InstructionsToDelete.insert(I); 421c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 422c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner } 423c9838f25d53d3dd7d38949ef6c28f2505a110f45Chris Lattner 42440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeleteTriviallyDeadInstructions(InstructionsToDelete); 42540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner} 42615cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 42715cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 42840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattnervoid IndVarSimplify::runOnLoop(Loop *L) { 42940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // First step. Check to see if there are any trivial GEP pointer recurrences. 43040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If there are, change them into integer recurrences, permitting analysis by 43140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // the SCEV routines. 43215cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner // 43340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Header = L->getHeader(); 43440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *Preheader = L->getLoopPreheader(); 435fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 43640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::set<Instruction*> DeadInsts; 4372da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 4382da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode *PN = cast<PHINode>(I); 43940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (isa<PointerType>(PN->getType())) 44040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner EliminatePointerRecurrence(PN, Preheader, DeadInsts); 4412da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer } 44215cad759fe2048ac5eb137c6bb0ab7287538677eChris Lattner 44340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!DeadInsts.empty()) 44440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeleteTriviallyDeadInstructions(DeadInsts); 445394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 446394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 44740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Next, transform all loops nesting inside of this loop. 44840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (LoopInfo::iterator I = L->begin(), E = L->end(); I != E; ++I) 44940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner runOnLoop(*I); 450394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 45140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Check to see if this loop has a computable loop-invariant execution count. 45240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If so, this means that we can compute the final value of any expressions 45340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // that are recurrent in the loop, and substitute the exit values from the 45440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // loop into any instructions outside of the loop that use the final values of 45540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // the current expressions. 456394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner // 45740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle IterationCount = SE->getIterationCount(L); 45840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!isa<SCEVCouldNotCompute>(IterationCount)) 45940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner RewriteLoopExitValues(L); 46040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 46140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Next, analyze all of the induction variables in the loop, canonicalizing 46240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // auxillary induction variables. 46340bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner std::vector<std::pair<PHINode*, SCEVHandle> > IndVars; 46440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 4652da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 4662da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode *PN = cast<PHINode>(I); 46742a75517250017a52afb03a0ade03cbd49559fe5Chris Lattner if (PN->getType()->isInteger()) { // FIXME: when we have fast-math, enable! 46840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle SCEV = SE->getSCEV(PN); 46940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (SCEV->hasComputableLoopEvolution(L)) 470cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // FIXME: It is an extremely bad idea to indvar substitute anything more 471cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // complex than affine induction variables. Doing so will put expensive 472cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // polynomial evaluations inside of the loop, and the str reduction pass 473cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // currently can only reduce affine polynomials. For now just disable 474cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner // indvar subst on anything more complex than an affine addrec. 475595ee7ec26432e4804f1e71817d9cf9b1f86318dChris Lattner if (SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SCEV)) 476cda9ca5a4fed09ea3788b572dbddabf2a5a7a5d9Chris Lattner if (AR->isAffine()) 477595ee7ec26432e4804f1e71817d9cf9b1f86318dChris Lattner IndVars.push_back(std::make_pair(PN, SCEV)); 47840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 4792da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer } 480f016ea4ff80c56c467247a90567dd07bddb590f3Chris Lattner 48140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // If there are no induction variables in the loop, there is nothing more to 48240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // do. 483f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner if (IndVars.empty()) { 484f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner // Actually, if we know how many times the loop iterates, lets insert a 485f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner // canonical induction variable to help subsequent passes. 486f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner if (!isa<SCEVCouldNotCompute>(IterationCount)) { 4874a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 4884a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Rewriter.getOrInsertCanonicalInductionVariable(L, 489f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner IterationCount->getType()); 4909ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (Instruction *I = LinearFunctionTestReplace(L, IterationCount, 4919ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner Rewriter)) { 4929ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner std::set<Instruction*> InstructionsToDelete; 4939ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner InstructionsToDelete.insert(I); 4949ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner DeleteTriviallyDeadInstructions(InstructionsToDelete); 4959ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner } 496f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner } 497f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner return; 498f50af088f19f525f3d1026eb61db77e0037a9f43Chris Lattner } 499f016ea4ff80c56c467247a90567dd07bddb590f3Chris Lattner 50040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Compute the type of the largest recurrence expression. 50140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // 50240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner const Type *LargestType = IndVars[0].first->getType(); 503fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner bool DifferingSizes = false; 50440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 1, e = IndVars.size(); i != e; ++i) { 50540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner const Type *Ty = IndVars[i].first->getType(); 506abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer DifferingSizes |= 507abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer Ty->getPrimitiveSizeInBits() != LargestType->getPrimitiveSizeInBits(); 508abaa8ca433a52dc522f6137c01a9552ebec44bb5Reid Spencer if (Ty->getPrimitiveSizeInBits() > LargestType->getPrimitiveSizeInBits()) 50940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner LargestType = Ty; 510500597a1c39e91a3020587318ed61e737b6c613aChris Lattner } 511394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner 51240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Create a rewriter object which we'll use to transform the code with. 5134a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner SCEVExpander Rewriter(*SE, *LI); 51440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 51540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Now that we know the largest of of the induction variables in this loop, 51640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // insert a canonical induction variable of the largest size. 5174a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *IndVar = Rewriter.getOrInsertCanonicalInductionVariable(L,LargestType); 51840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumInserted; 51940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 520ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: New CanIV: " << *IndVar; 52140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 52240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (!isa<SCEVCouldNotCompute>(IterationCount)) 5239ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner if (Instruction *DI = LinearFunctionTestReplace(L, IterationCount,Rewriter)) 5249ba46c13bf3d49a5b697227c88ef987951e6b50dChris Lattner DeadInsts.insert(DI); 52540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 52640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Now that we have a canonical induction variable, we can rewrite any 52740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // recurrences in terms of the induction variable. Start with the auxillary 52840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // induction variables, and recursively rewrite any of their uses. 52940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock::iterator InsertPt = Header->begin(); 53040bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 53140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner 5325d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // If there were induction variables of other sizes, cast the primary 5335d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // induction variable to the right size for them, avoiding the need for the 5345d461d20aea308471f2a31b718a274bfee28b60cChris Lattner // code evaluation methods to insert induction variables of different sizes. 535fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner if (DifferingSizes) { 536a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer SmallVector<unsigned,4> InsertedSizes; 537a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer InsertedSizes.push_back(LargestType->getPrimitiveSizeInBits()); 538a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer for (unsigned i = 0, e = IndVars.size(); i != e; ++i) { 539a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer unsigned ithSize = IndVars[i].first->getType()->getPrimitiveSizeInBits(); 540ef60b2c4ed67017a46442903c898bc24ed9a6c91Chris Lattner if (std::find(InsertedSizes.begin(), InsertedSizes.end(), ithSize) 541ef60b2c4ed67017a46442903c898bc24ed9a6c91Chris Lattner == InsertedSizes.end()) { 542fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner PHINode *PN = IndVars[i].first; 543a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer InsertedSizes.push_back(ithSize); 544ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner Instruction *New = new TruncInst(IndVar, PN->getType(), "indvar", 545ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner InsertPt); 546fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner Rewriter.addInsertedValue(New, SE->getSCEV(New)); 547ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Made trunc IV for " << *PN 548ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " NewVal = " << *New << "\n"; 549fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner } 550a54b7cbd452b3adb2f51346140d996b29c2cdb30Reid Spencer } 551fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner } 552fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner 553ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner // Rewrite all induction variables in terms of the canonical induction 554ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner // variable. 5555d461d20aea308471f2a31b718a274bfee28b60cChris Lattner std::map<unsigned, Value*> InsertedSizes; 55640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner while (!IndVars.empty()) { 55740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner PHINode *PN = IndVars.back().first; 5584a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *NewVal = Rewriter.expandCodeFor(IndVars.back().second, InsertPt, 559fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner PN->getType()); 560ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner DOUT << "INDVARS: Rewrote IV '" << *IndVars.back().second << "' " << *PN 561ee4f13a9046c380725cdeab62d57722db375c473Chris Lattner << " into = " << *NewVal << "\n"; 5626934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner NewVal->takeName(PN); 5635d461d20aea308471f2a31b718a274bfee28b60cChris Lattner 56440bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner // Replace the old PHI Node with the inserted computation. 565fcb81f5f4cbac61851b7dec403961cf88e614aa1Chris Lattner PN->replaceAllUsesWith(NewVal); 56640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner DeadInsts.insert(PN); 56740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner IndVars.pop_back(); 56840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner ++NumRemoved; 56940bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner Changed = true; 570500597a1c39e91a3020587318ed61e737b6c613aChris Lattner } 571ba4f3f6a419326df190599421fa149c90235cb72Chris Lattner 572b4782d13d1444d9d18c0a681292cf0d0a32cf3efChris Lattner#if 0 5731363e85df74627530ceede53280613c62a4cdbe3Chris Lattner // Now replace all derived expressions in the loop body with simpler 5741363e85df74627530ceede53280613c62a4cdbe3Chris Lattner // expressions. 57540bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) 57640bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner if (LI->getLoopFor(L->getBlocks()[i]) == L) { // Not in a subloop... 57740bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner BasicBlock *BB = L->getBlocks()[i]; 57840bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 57942a75517250017a52afb03a0ade03cbd49559fe5Chris Lattner if (I->getType()->isInteger() && // Is an integer instruction 5801363e85df74627530ceede53280613c62a4cdbe3Chris Lattner !I->use_empty() && 58140bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner !Rewriter.isInsertedInstruction(I)) { 58240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner SCEVHandle SH = SE->getSCEV(I); 5834a7553e2da506a718f59869c03c5ce113eb40f7aChris Lattner Value *V = Rewriter.expandCodeFor(SH, I, I->getType()); 5841363e85df74627530ceede53280613c62a4cdbe3Chris Lattner if (V != I) { 5856934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner if (isa<Instruction>(V)) 5866934a04a8c15e9971cd1ea4d5c8df2d7afdd5be5Chris Lattner V->takeName(I); 5871363e85df74627530ceede53280613c62a4cdbe3Chris Lattner I->replaceAllUsesWith(V); 5881363e85df74627530ceede53280613c62a4cdbe3Chris Lattner DeadInsts.insert(I); 5891363e85df74627530ceede53280613c62a4cdbe3Chris Lattner ++NumRemoved; 5901363e85df74627530ceede53280613c62a4cdbe3Chris Lattner Changed = true; 591fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 59240bf8b48cdb9961898dba1bc67320be1e49e3da1Chris Lattner } 593394437ff7eaccfe1de92fe14d0022ca0addf3e41Chris Lattner } 594b4782d13d1444d9d18c0a681292cf0d0a32cf3efChris Lattner#endif 5951363e85df74627530ceede53280613c62a4cdbe3Chris Lattner 5961363e85df74627530ceede53280613c62a4cdbe3Chris Lattner DeleteTriviallyDeadInstructions(DeadInsts); 597eb705914924865201f8b8018977d94594b258142Owen Anderson 598eb705914924865201f8b8018977d94594b258142Owen Anderson if (mustPreserveAnalysisID(LCSSAID)) assert(L->isLCSSAForm()); 5996148c02591bd83da7b957589c4bbf6f9720d503fChris Lattner} 600