ScalarEvolutionExpander.cpp revision 11f6d3b478c4fa09d126833c57fbac1d795ead31
136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman//===- ScalarEvolutionExpander.cpp - Scalar Evolution Analysis --*- C++ -*-===// 236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// 336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// The LLVM Compiler Infrastructure 436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// 836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman//===----------------------------------------------------------------------===// 936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// 1036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// This file contains the implementation of the scalar evolution expander, 1136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// which is used to generate the code corresponding to a given scalar evolution 1236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// expression. 1336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman// 1436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman//===----------------------------------------------------------------------===// 1536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 1636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman#include "llvm/Analysis/ScalarEvolutionExpander.h" 17e81561909d128c6e2d8033cb5465a49b2596b26aBill Wendling#include "llvm/Analysis/LoopInfo.h" 1836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begemanusing namespace llvm; 1936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 20ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner/// InsertCastOfTo - Insert a cast of V to the specified type, doing what 21ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner/// we can to share the casts. 223ba68b9eef2851dae8a9d1b18928c6fa2e3c5f87Reid SpencerValue *SCEVExpander::InsertCastOfTo(Instruction::CastOps opcode, Value *V, 233ba68b9eef2851dae8a9d1b18928c6fa2e3c5f87Reid Spencer const Type *Ty) { 24ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner // FIXME: keep track of the cast instruction. 25ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (Constant *C = dyn_cast<Constant>(V)) 26d977d8651a5cd26a3e1088267f31cade405f2adfReid Spencer return ConstantExpr::getCast(opcode, C, Ty); 27ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner 28ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (Argument *A = dyn_cast<Argument>(V)) { 29ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner // Check to see if there is already a cast! 30ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); 31ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner UI != E; ++UI) { 32ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if ((*UI)->getType() == Ty) 333913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CastInst *CI = dyn_cast<CastInst>(cast<Instruction>(*UI))) 343913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CI->getOpcode() == opcode) { 353913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz // If the cast isn't the first instruction of the function, move it. 363913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (BasicBlock::iterator(CI) != 373913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz A->getParent()->getEntryBlock().begin()) { 383913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz CI->moveBefore(A->getParent()->getEntryBlock().begin()); 393913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz } 403913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz return CI; 41ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 42ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 437cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif return CastInst::Create(opcode, V, Ty, V->getName(), 44d977d8651a5cd26a3e1088267f31cade405f2adfReid Spencer A->getParent()->getEntryBlock().begin()); 45ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 463913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz 47ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner Instruction *I = cast<Instruction>(V); 483913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz 49ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner // Check to see if there is already a cast. If there is, use it. 50ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); 51ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner UI != E; ++UI) { 52ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if ((*UI)->getType() == Ty) 533913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CastInst *CI = dyn_cast<CastInst>(cast<Instruction>(*UI))) 543913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CI->getOpcode() == opcode) { 553913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz BasicBlock::iterator It = I; ++It; 563913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (isa<InvokeInst>(I)) 573913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz It = cast<InvokeInst>(I)->getNormalDest()->begin(); 583913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz while (isa<PHINode>(It)) ++It; 593913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (It != BasicBlock::iterator(CI)) { 603913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz // Splice the cast immediately after the operand in question. 613913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz CI->moveBefore(It); 623913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz } 633913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz return CI; 64ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 65ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 66ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner BasicBlock::iterator IP = I; ++IP; 67ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(I)) 68ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner IP = II->getNormalDest()->begin(); 69ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner while (isa<PHINode>(IP)) ++IP; 707cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif return CastInst::Create(opcode, V, Ty, V->getName(), IP); 71ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner} 72ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner 737fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner/// InsertBinop - Insert the specified binary operator, doing a small amount 747fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner/// of work to avoid inserting an obviously redundant operation. 757fec90ebf4ebe7aa73a6dd7d275c255587c041adChris LattnerValue *SCEVExpander::InsertBinop(Instruction::BinaryOps Opcode, Value *LHS, 768a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz Value *RHS, Instruction *InsertPt) { 770f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman // Fold a binop with constant operands. 780f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman if (Constant *CLHS = dyn_cast<Constant>(LHS)) 790f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman if (Constant *CRHS = dyn_cast<Constant>(RHS)) 800f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman return ConstantExpr::get(Opcode, CLHS, CRHS); 810f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman 827fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner // Do a quick scan to see if we have this binop nearby. If so, reuse it. 837fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner unsigned ScanLimit = 6; 848a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz BasicBlock::iterator BlockBegin = InsertPt->getParent()->begin(); 858a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz if (InsertPt != BlockBegin) { 868a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz // Scanning starts from the last instruction before InsertPt. 878a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz BasicBlock::iterator IP = InsertPt; 888a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz --IP; 898a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz for (; ScanLimit; --IP, --ScanLimit) { 908a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(IP)) 918a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz if (BinOp->getOpcode() == Opcode && BinOp->getOperand(0) == LHS && 928a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz BinOp->getOperand(1) == RHS) 938a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz return BinOp; 948a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz if (IP == BlockBegin) break; 958a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz } 967fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner } 978a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz 988a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz // If we haven't found this binop, insert it. 997cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif return BinaryOperator::Create(Opcode, LHS, RHS, "tmp", InsertPt); 1007fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner} 1017fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner 102e24fa64d52330626553298f56ba5aa702624c282Dan GohmanValue *SCEVExpander::visitAddExpr(SCEVAddExpr *S) { 103e24fa64d52330626553298f56ba5aa702624c282Dan Gohman Value *V = expand(S->getOperand(S->getNumOperands()-1)); 104e24fa64d52330626553298f56ba5aa702624c282Dan Gohman 105e24fa64d52330626553298f56ba5aa702624c282Dan Gohman // Emit a bunch of add instructions 106e24fa64d52330626553298f56ba5aa702624c282Dan Gohman for (int i = S->getNumOperands()-2; i >= 0; --i) 107e24fa64d52330626553298f56ba5aa702624c282Dan Gohman V = InsertBinop(Instruction::Add, V, expand(S->getOperand(i)), 108e24fa64d52330626553298f56ba5aa702624c282Dan Gohman InsertPt); 109e24fa64d52330626553298f56ba5aa702624c282Dan Gohman return V; 110e24fa64d52330626553298f56ba5aa702624c282Dan Gohman} 111e24fa64d52330626553298f56ba5aa702624c282Dan Gohman 11236f891bdf6cf38fcc655a0930ca18664e18518d4Nate BegemanValue *SCEVExpander::visitMulExpr(SCEVMulExpr *S) { 11336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman int FirstOp = 0; // Set if we should emit a subtract. 11436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (SCEVConstant *SC = dyn_cast<SCEVConstant>(S->getOperand(0))) 11536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (SC->getValue()->isAllOnesValue()) 11636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman FirstOp = 1; 11736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 11836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman int i = S->getNumOperands()-2; 119d19534add90a2a894af61523b830887097bb780bDan Gohman Value *V = expand(S->getOperand(i+1)); 12036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 12136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Emit a bunch of multiply instructions 12236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman for (; i >= FirstOp; --i) 123d19534add90a2a894af61523b830887097bb780bDan Gohman V = InsertBinop(Instruction::Mul, V, expand(S->getOperand(i)), 1247fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner InsertPt); 12536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // -1 * ... ---> 0 - ... 12636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (FirstOp == 1) 1277fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner V = InsertBinop(Instruction::Sub, Constant::getNullValue(V->getType()), V, 1287fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner InsertPt); 12936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman return V; 13036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman} 13136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 13236f891bdf6cf38fcc655a0930ca18664e18518d4Nate BegemanValue *SCEVExpander::visitAddRecExpr(SCEVAddRecExpr *S) { 13336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman const Type *Ty = S->getType(); 13436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman const Loop *L = S->getLoop(); 13536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // We cannot yet do fp recurrences, e.g. the xform of {X,+,F} --> X+{0,+,F} 13642a75517250017a52afb03a0ade03cbd49559fe5Chris Lattner assert(Ty->isInteger() && "Cannot expand fp recurrences yet!"); 13736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 13836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // {X,+,F} --> X + {0,+,F} 139cfeb6a450632f2a6cd05302633c8c2b8c90cfdfdDan Gohman if (!S->getStart()->isZero()) { 140d19534add90a2a894af61523b830887097bb780bDan Gohman Value *Start = expand(S->getStart()); 14136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman std::vector<SCEVHandle> NewOps(S->op_begin(), S->op_end()); 142246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman NewOps[0] = SE.getIntegerSCEV(0, Ty); 143246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman Value *Rest = expand(SE.getAddRecExpr(NewOps, L)); 14436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 14536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // FIXME: look for an existing add to use. 1467fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner return InsertBinop(Instruction::Add, Rest, Start, InsertPt); 14736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman } 14836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 14936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // {0,+,1} --> Insert a canonical induction variable into the loop! 15036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (S->getNumOperands() == 2 && 151246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman S->getOperand(1) == SE.getIntegerSCEV(1, Ty)) { 15236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Create and insert the PHI node for the induction variable in the 15336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // specified loop. 15436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman BasicBlock *Header = L->getHeader(); 155051a950000e21935165db56695e35bade668193bGabor Greif PHINode *PN = PHINode::Create(Ty, "indvar", Header->begin()); 15636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman PN->addIncoming(Constant::getNullValue(Ty), L->getLoopPreheader()); 15736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 15836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman pred_iterator HPI = pred_begin(Header); 15936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman assert(HPI != pred_end(Header) && "Loop with zero preds???"); 16036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (!L->contains(*HPI)) ++HPI; 16136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman assert(HPI != pred_end(Header) && L->contains(*HPI) && 16236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman "No backedge in loop?"); 16336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 16436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Insert a unit add instruction right before the terminator corresponding 16536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // to the back-edge. 16624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer Constant *One = ConstantInt::get(Ty, 1); 1677cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Instruction *Add = BinaryOperator::CreateAdd(PN, One, "indvar.next", 16836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman (*HPI)->getTerminator()); 16936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 17036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman pred_iterator PI = pred_begin(Header); 17136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (*PI == L->getLoopPreheader()) 17236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman ++PI; 17336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman PN->addIncoming(Add, *PI); 17436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman return PN; 17536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman } 17636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 17736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Get the canonical induction variable I for this loop. 17836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman Value *I = getOrInsertCanonicalInductionVariable(L, Ty); 17936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 180df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // If this is a simple linear addrec, emit it now as a special case. 18136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (S->getNumOperands() == 2) { // {0,+,F} --> i*F 182d19534add90a2a894af61523b830887097bb780bDan Gohman Value *F = expand(S->getOperand(1)); 183df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner 184df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // IF the step is by one, just return the inserted IV. 1856b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng if (ConstantInt *CI = dyn_cast<ConstantInt>(F)) 1864d050d73210d15d8a86ee5967c417ddb5bee4543Reid Spencer if (CI->getValue() == 1) 187df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner return I; 188df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner 189df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // If the insert point is directly inside of the loop, emit the multiply at 190df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // the insert point. Otherwise, L is a loop that is a parent of the insert 191df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // point loop. If we can, move the multiply to the outer most loop that it 192df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // is safe to be in. 193df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner Instruction *MulInsertPt = InsertPt; 194df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner Loop *InsertPtLoop = LI.getLoopFor(MulInsertPt->getParent()); 195df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner if (InsertPtLoop != L && InsertPtLoop && 196df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner L->contains(InsertPtLoop->getHeader())) { 1975d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz do { 198df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // If we cannot hoist the multiply out of this loop, don't. 199df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner if (!InsertPtLoop->isLoopInvariant(F)) break; 200df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner 2015d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz BasicBlock *InsertPtLoopPH = InsertPtLoop->getLoopPreheader(); 2025d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz 2035d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz // If this loop hasn't got a preheader, we aren't able to hoist the 2045d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz // multiply. 2055d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz if (!InsertPtLoopPH) 2065d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz break; 2075d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz 2085d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz // Otherwise, move the insert point to the preheader. 2095d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz MulInsertPt = InsertPtLoopPH->getTerminator(); 210df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner InsertPtLoop = InsertPtLoop->getParentLoop(); 2115d2bc857ec1ae11ec2ea85e596f3712d02fd2c2bWojciech Matyjewicz } while (InsertPtLoop != L); 212df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner } 213df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner 2147fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner return InsertBinop(Instruction::Mul, I, F, MulInsertPt); 21536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman } 21636f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 21736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // If this is a chain of recurrences, turn it into a closed form, using the 21836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // folders, then expandCodeFor the closed form. This allows the folders to 21936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // simplify the expression without having to build a bunch of special code 22036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // into this folder. 221246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman SCEVHandle IH = SE.getUnknown(I); // Get I as a "symbolic" SCEV. 22236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 223246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman SCEVHandle V = S->evaluateAtIteration(IH, SE); 224e81561909d128c6e2d8033cb5465a49b2596b26aBill Wendling //cerr << "Evaluated: " << *this << "\n to: " << *V << "\n"; 22536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 226d19534add90a2a894af61523b830887097bb780bDan Gohman return expand(V); 22736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman} 22896fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov 22911f6d3b478c4fa09d126833c57fbac1d795ead31Dan GohmanValue *SCEVExpander::visitTruncateExpr(SCEVTruncateExpr *S) { 23011f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman Value *V = expand(S->getOperand()); 23111f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman return CastInst::createTruncOrBitCast(V, S->getType(), "tmp.", InsertPt); 23211f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 23311f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 23411f6d3b478c4fa09d126833c57fbac1d795ead31Dan GohmanValue *SCEVExpander::visitZeroExtendExpr(SCEVZeroExtendExpr *S) { 23511f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman Value *V = expand(S->getOperand()); 23611f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman return CastInst::createZExtOrBitCast(V, S->getType(), "tmp.", InsertPt); 23711f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 23811f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 23911f6d3b478c4fa09d126833c57fbac1d795ead31Dan GohmanValue *SCEVExpander::visitSignExtendExpr(SCEVSignExtendExpr *S) { 24011f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman Value *V = expand(S->getOperand()); 24111f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman return CastInst::createSExtOrBitCast(V, S->getType(), "tmp.", InsertPt); 24211f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 24311f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 244c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick LewyckyValue *SCEVExpander::visitSMaxExpr(SCEVSMaxExpr *S) { 245c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky Value *LHS = expand(S->getOperand(0)); 246c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky for (unsigned i = 1; i < S->getNumOperands(); ++i) { 247c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky Value *RHS = expand(S->getOperand(i)); 248c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky Value *ICmp = new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS, "tmp", InsertPt); 249051a950000e21935165db56695e35bade668193bGabor Greif LHS = SelectInst::Create(ICmp, LHS, RHS, "smax", InsertPt); 250c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky } 251c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky return LHS; 252c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky} 253c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky 2543e6307698084e7adfc10b739442ae29742beefd0Nick LewyckyValue *SCEVExpander::visitUMaxExpr(SCEVUMaxExpr *S) { 2553e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky Value *LHS = expand(S->getOperand(0)); 2563e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky for (unsigned i = 1; i < S->getNumOperands(); ++i) { 2573e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky Value *RHS = expand(S->getOperand(i)); 2583e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky Value *ICmp = new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS, "tmp", InsertPt); 259051a950000e21935165db56695e35bade668193bGabor Greif LHS = SelectInst::Create(ICmp, LHS, RHS, "umax", InsertPt); 2603e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky } 2613e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky return LHS; 2623e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky} 2633e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky 26411f6d3b478c4fa09d126833c57fbac1d795ead31Dan GohmanValue *SCEVExpander::expandCodeFor(SCEVHandle SH, Instruction *IP) { 26511f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman // Expand the code for this SCEV. 26611f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman this->InsertPt = IP; 26711f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman return expand(SH); 26811f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 26911f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 27096fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton KorobeynikovValue *SCEVExpander::expand(SCEV *S) { 27196fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov // Check to see if we already expanded this. 27296fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov std::map<SCEVHandle, Value*>::iterator I = InsertedExpressions.find(S); 27396fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov if (I != InsertedExpressions.end()) 27496fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov return I->second; 27596fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov 27696fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov Value *V = visit(S); 27796fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov InsertedExpressions[S] = V; 27896fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov return V; 27996fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov} 280