ScalarEvolutionExpander.cpp revision 0f5efe56258f8cd6ceff4d7955a5d80144cd9cb0
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" 1876f600b205606a055ec35e7d3fd1a99602329d67Owen Anderson#include "llvm/LLVMContext.h" 195be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman#include "llvm/Target/TargetData.h" 204d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman#include "llvm/ADT/STLExtras.h" 2136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begemanusing namespace llvm; 2236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 23267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman/// InsertNoopCastOfTo - Insert a cast of V to the specified type, 24267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman/// which must be possible with a noop cast, doing what we can to share 25267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman/// the casts. 26267a385342f2e7388f178b327dd87c5f29afd51bDan GohmanValue *SCEVExpander::InsertNoopCastOfTo(Value *V, const Type *Ty) { 27267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Instruction::CastOps Op = CastInst::getCastOpcode(V, false, Ty, false); 28267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman assert((Op == Instruction::BitCast || 29267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Op == Instruction::PtrToInt || 30267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Op == Instruction::IntToPtr) && 31267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman "InsertNoopCastOfTo cannot perform non-noop casts!"); 32267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && 33267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman "InsertNoopCastOfTo cannot change sizes!"); 34267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman 352d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman // Short-circuit unnecessary bitcasts. 36267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (Op == Instruction::BitCast && V->getType() == Ty) 372d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman return V; 382d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman 39f04fa483b83227c570bc58e1684ea096430a6697Dan Gohman // Short-circuit unnecessary inttoptr<->ptrtoint casts. 40267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if ((Op == Instruction::PtrToInt || Op == Instruction::IntToPtr) && 4180dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { 42af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman if (CastInst *CI = dyn_cast<CastInst>(V)) 43af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman if ((CI->getOpcode() == Instruction::PtrToInt || 44af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman CI->getOpcode() == Instruction::IntToPtr) && 45af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman SE.getTypeSizeInBits(CI->getType()) == 46af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman SE.getTypeSizeInBits(CI->getOperand(0)->getType())) 47af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman return CI->getOperand(0); 4880dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) 4980dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman if ((CE->getOpcode() == Instruction::PtrToInt || 5080dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman CE->getOpcode() == Instruction::IntToPtr) && 5180dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman SE.getTypeSizeInBits(CE->getType()) == 5280dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman SE.getTypeSizeInBits(CE->getOperand(0)->getType())) 5380dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman return CE->getOperand(0); 5480dcdee0f48820ecea86c15768324945bb0d68d1Dan Gohman } 55f04fa483b83227c570bc58e1684ea096430a6697Dan Gohman 56ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (Constant *C = dyn_cast<Constant>(V)) 57baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson return ConstantExpr::getCast(Op, C, Ty); 584c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman 59ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (Argument *A = dyn_cast<Argument>(V)) { 60ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner // Check to see if there is already a cast! 61ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); 6240a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman UI != E; ++UI) 63ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if ((*UI)->getType() == Ty) 643913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CastInst *CI = dyn_cast<CastInst>(cast<Instruction>(*UI))) 65267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (CI->getOpcode() == Op) { 663913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz // If the cast isn't the first instruction of the function, move it. 6740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (BasicBlock::iterator(CI) != 683913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz A->getParent()->getEntryBlock().begin()) { 6940a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // Recreate the cast at the beginning of the entry block. 7040a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // The old cast is left in place in case it is being used 7140a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // as an insert point. 7240a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman Instruction *NewCI = 73267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman CastInst::Create(Op, V, Ty, "", 7440a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman A->getParent()->getEntryBlock().begin()); 7540a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman NewCI->takeName(CI); 7640a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman CI->replaceAllUsesWith(NewCI); 7740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman return NewCI; 783913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz } 793913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz return CI; 80ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 8140a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman 82267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Instruction *I = CastInst::Create(Op, V, Ty, V->getName(), 83cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman A->getParent()->getEntryBlock().begin()); 84a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(I); 85cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return I; 86ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 873913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz 88ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner Instruction *I = cast<Instruction>(V); 893913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz 90ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner // Check to see if there is already a cast. If there is, use it. 91ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); 92ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner UI != E; ++UI) { 93ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if ((*UI)->getType() == Ty) 943913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (CastInst *CI = dyn_cast<CastInst>(cast<Instruction>(*UI))) 95267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (CI->getOpcode() == Op) { 963913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz BasicBlock::iterator It = I; ++It; 973913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (isa<InvokeInst>(I)) 983913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz It = cast<InvokeInst>(I)->getNormalDest()->begin(); 993913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz while (isa<PHINode>(It)) ++It; 1003913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz if (It != BasicBlock::iterator(CI)) { 101c37e3d5d7cd9576711204dfd0240edefba2df4c7Dan Gohman // Recreate the cast after the user. 10240a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // The old cast is left in place in case it is being used 10340a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // as an insert point. 104267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Instruction *NewCI = CastInst::Create(Op, V, Ty, "", It); 10540a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman NewCI->takeName(CI); 10640a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman CI->replaceAllUsesWith(NewCI); 107c37e3d5d7cd9576711204dfd0240edefba2df4c7Dan Gohman rememberInstruction(NewCI); 10840a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman return NewCI; 1093913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz } 110c37e3d5d7cd9576711204dfd0240edefba2df4c7Dan Gohman rememberInstruction(CI); 1113913187bf6135e6a71260c65eed664095c8f9ce9Wojciech Matyjewicz return CI; 112ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 113ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner } 114ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner BasicBlock::iterator IP = I; ++IP; 115ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(I)) 116ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner IP = II->getNormalDest()->begin(); 117ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner while (isa<PHINode>(IP)) ++IP; 118267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Instruction *CI = CastInst::Create(Op, V, Ty, V->getName(), IP); 119a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(CI); 120cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return CI; 121ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner} 122ca1a4bebb3928ba18fb8751e2f0c0f88fad54cfdChris Lattner 1237fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner/// InsertBinop - Insert the specified binary operator, doing a small amount 1247fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner/// of work to avoid inserting an obviously redundant operation. 125267a385342f2e7388f178b327dd87c5f29afd51bDan GohmanValue *SCEVExpander::InsertBinop(Instruction::BinaryOps Opcode, 126267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *LHS, Value *RHS) { 1270f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman // Fold a binop with constant operands. 1280f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman if (Constant *CLHS = dyn_cast<Constant>(LHS)) 1290f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman if (Constant *CRHS = dyn_cast<Constant>(RHS)) 130baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson return ConstantExpr::get(Opcode, CLHS, CRHS); 1310f0eb18addc94bf3d8179fbce162c8c4622b9866Dan Gohman 1327fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner // Do a quick scan to see if we have this binop nearby. If so, reuse it. 1337fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner unsigned ScanLimit = 6; 134267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator BlockBegin = Builder.GetInsertBlock()->begin(); 135267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman // Scanning starts from the last instruction before the insertion point. 136267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator IP = Builder.GetInsertPoint(); 137267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (IP != BlockBegin) { 1388a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz --IP; 1398a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz for (; ScanLimit; --IP, --ScanLimit) { 1405be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (IP->getOpcode() == (unsigned)Opcode && IP->getOperand(0) == LHS && 1415be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman IP->getOperand(1) == RHS) 1425be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman return IP; 1438a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz if (IP == BlockBegin) break; 1448a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz } 1457fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner } 146267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman 1478a08769bad43a22fae2845bb0ba0fd1266cd55c8Wojciech Matyjewicz // If we haven't found this binop, insert it. 148267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *BO = Builder.CreateBinOp(Opcode, LHS, RHS, "tmp"); 149a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(BO); 150cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return BO; 1517fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner} 1527fec90ebf4ebe7aa73a6dd7d275c255587c041adChris Lattner 1534a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman/// FactorOutConstant - Test if S is divisible by Factor, using signed 154453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// division. If so, update S with Factor divided out and return true. 1554a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman/// S need not be evenly divisble if a reasonable remainder can be 1564a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman/// computed. 157453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// TODO: When ScalarEvolution gets a SCEVSDivExpr, this can be made 158453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// unnecessary; in its place, just signed-divide Ops[i] by the scale and 159453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// check to see if the divide was folded. 1600bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohmanstatic bool FactorOutConstant(const SCEV *&S, 1610bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *&Remainder, 162c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Factor, 163c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ScalarEvolution &SE, 164c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const TargetData *TD) { 165453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // Everything is divisible by one. 166c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (Factor->isOne()) 167c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman return true; 168c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 169c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // x/x == 1. 170c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (S == Factor) { 171c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman S = SE.getIntegerSCEV(1, S->getType()); 172453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman return true; 173c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 174453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 175453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // For a Constant, check for a multiple of the given factor. 1764a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(S)) { 177c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // 0/x == 0. 178c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (C->isZero()) 179453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman return true; 180c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Check for divisibility. 181c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const SCEVConstant *FC = dyn_cast<SCEVConstant>(Factor)) { 182c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ConstantInt *CI = 183c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ConstantInt::get(SE.getContext(), 184c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman C->getValue()->getValue().sdiv( 185c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman FC->getValue()->getValue())); 186c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If the quotient is zero and the remainder is non-zero, reject 187c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // the value at this scale. It will be considered for subsequent 188c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // smaller scales. 189c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!CI->isZero()) { 190c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Div = SE.getConstant(CI); 191c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman S = Div; 192c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Remainder = 193c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SE.getAddExpr(Remainder, 194c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SE.getConstant(C->getValue()->getValue().srem( 195c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman FC->getValue()->getValue()))); 196c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman return true; 197c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 198453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 1994a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman } 200453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 201453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // In a Mul, check if there is a constant operand which is a multiple 202453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // of the given factor. 203c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(S)) { 204c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (TD) { 205c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // With TargetData, the size is known. Check if there is a constant 206c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // operand which is a multiple of the given factor. If so, we can 207c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // factor it. 208c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEVConstant *FC = cast<SCEVConstant>(Factor); 209c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(M->getOperand(0))) 210c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!C->getValue()->getValue().srem(FC->getValue()->getValue())) { 211c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SmallVectorImpl<const SCEV *> &MOperands = M->getOperands(); 212c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 4> NewMulOps(MOperands.begin(), 213c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman MOperands.end()); 214c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman NewMulOps[0] = 215c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SE.getConstant(C->getValue()->getValue().sdiv( 216c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman FC->getValue()->getValue())); 217c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman S = SE.getMulExpr(NewMulOps); 218c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman return true; 219c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 220c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } else { 221c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Without TargetData, check if Factor can be factored out of any of the 222c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Mul's operands. If so, we can just remove it. 223c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman for (unsigned i = 0, e = M->getNumOperands(); i != e; ++i) { 224c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *SOp = M->getOperand(i); 225c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Remainder = SE.getIntegerSCEV(0, SOp->getType()); 226c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (FactorOutConstant(SOp, Remainder, Factor, SE, TD) && 227c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Remainder->isZero()) { 228c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SmallVectorImpl<const SCEV *> &MOperands = M->getOperands(); 229c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 4> NewMulOps(MOperands.begin(), 230c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman MOperands.end()); 231c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman NewMulOps[i] = SOp; 232c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman S = SE.getMulExpr(NewMulOps); 233c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman return true; 234c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 235453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 236c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 237c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 238453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 239453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // In an AddRec, check if both start and step are divisible. 240453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman if (const SCEVAddRecExpr *A = dyn_cast<SCEVAddRecExpr>(S)) { 2410bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *Step = A->getStepRecurrence(SE); 2420bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *StepRem = SE.getIntegerSCEV(0, Step->getType()); 243c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!FactorOutConstant(Step, StepRem, Factor, SE, TD)) 2444a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman return false; 2454a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman if (!StepRem->isZero()) 2464a4f767235dac50965fc266fb822d9a2e37d5212Dan Gohman return false; 2470bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *Start = A->getStart(); 248c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!FactorOutConstant(Start, Remainder, Factor, SE, TD)) 249453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman return false; 250453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman S = SE.getAddRecExpr(Start, Step, A->getLoop()); 251453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman return true; 252453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 253453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 254453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman return false; 255453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman} 256453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 257c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// SimplifyAddOperands - Sort and simplify a list of add operands. NumAddRecs 258c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// is the number of SCEVAddRecExprs present, which are kept at the end of 259c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// the list. 260c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// 261c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohmanstatic void SimplifyAddOperands(SmallVectorImpl<const SCEV *> &Ops, 262c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const Type *Ty, 263c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ScalarEvolution &SE) { 264c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman unsigned NumAddRecs = 0; 265c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman for (unsigned i = Ops.size(); i > 0 && isa<SCEVAddRecExpr>(Ops[i-1]); --i) 266c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ++NumAddRecs; 267c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Group Ops into non-addrecs and addrecs. 268c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 8> NoAddRecs(Ops.begin(), Ops.end() - NumAddRecs); 269c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 8> AddRecs(Ops.end() - NumAddRecs, Ops.end()); 270c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Let ScalarEvolution sort and simplify the non-addrecs list. 271c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Sum = NoAddRecs.empty() ? 272c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SE.getIntegerSCEV(0, Ty) : 273c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SE.getAddExpr(NoAddRecs); 274c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If it returned an add, use the operands. Otherwise it simplified 275c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // the sum into a single value, so just use that. 276c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Sum)) 277c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops = Add->getOperands(); 278c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman else { 279c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops.clear(); 280c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!Sum->isZero()) 281c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops.push_back(Sum); 282c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 283c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Then append the addrecs. 284c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops.insert(Ops.end(), AddRecs.begin(), AddRecs.end()); 285c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman} 286c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 287c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// SplitAddRecs - Flatten a list of add operands, moving addrec start values 288c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// out to the top level. For example, convert {a + b,+,c} to a, b, {0,+,d}. 289c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// This helps expose more opportunities for folding parts of the expressions 290c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// into GEP indices. 291c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman/// 292c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohmanstatic void SplitAddRecs(SmallVectorImpl<const SCEV *> &Ops, 293c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const Type *Ty, 294c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ScalarEvolution &SE) { 295c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Find the addrecs. 296c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 8> AddRecs; 297c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman for (unsigned i = 0, e = Ops.size(); i != e; ++i) 298c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman while (const SCEVAddRecExpr *A = dyn_cast<SCEVAddRecExpr>(Ops[i])) { 299c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Start = A->getStart(); 300c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (Start->isZero()) break; 301c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Zero = SE.getIntegerSCEV(0, Ty); 302c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman AddRecs.push_back(SE.getAddRecExpr(Zero, 303c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman A->getStepRecurrence(SE), 304c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman A->getLoop())); 305c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Start)) { 306c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops[i] = Zero; 307c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops.insert(Ops.end(), Add->op_begin(), Add->op_end()); 308c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman e += Add->getNumOperands(); 309c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } else { 310c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops[i] = Start; 311c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 312c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 313c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!AddRecs.empty()) { 314c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Add the addrecs onto the end of the list. 315c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops.insert(Ops.end(), AddRecs.begin(), AddRecs.end()); 316c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Resort the operand list, moving any constants to the front. 317c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SimplifyAddOperands(Ops, Ty, SE); 318c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 319c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman} 320c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 3214c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// expandAddToGEP - Expand an addition expression with a pointer type into 3224c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// a GEP instead of using ptrtoint+arithmetic+inttoptr. This helps 3234c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// BasicAliasAnalysis and other passes analyze the result. See the rules 3244c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// for getelementptr vs. inttoptr in 3254c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// http://llvm.org/docs/LangRef.html#pointeraliasing 3264c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// for details. 32713c5e35222afe0895f0c5e68aa9f22f134ea437aDan Gohman/// 3283abf905b50f33340ae81913da81b0eda96fa4616Dan Gohman/// Design note: The correctness of using getelementptr here depends on 3294c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// ScalarEvolution not recognizing inttoptr and ptrtoint operators, as 3304c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// they may introduce pointer arithmetic which may not be safely converted 3314c0d5d5db876b0628bdf6a2174263a1c0a9130e2Dan Gohman/// into getelementptr. 332453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// 333453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// Design note: It might seem desirable for this function to be more 334453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// loop-aware. If some of the indices are loop-invariant while others 335453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// aren't, it might seem desirable to emit multiple GEPs, keeping the 336453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// loop-invariant portions of the overall computation outside the loop. 337453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// However, there are a few reasons this is not done here. Hoisting simple 338453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// arithmetic is a low-level optimization that often isn't very 339453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// important until late in the optimization process. In fact, passes 340453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// like InstructionCombining will combine GEPs, even if it means 341453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// pushing loop-invariant computation down into loops, so even if the 342453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// GEPs were split here, the work would quickly be undone. The 343453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// LoopStrengthReduction pass, which is usually run quite late (and 344453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// after the last InstructionCombining pass), takes care of hoisting 345453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// loop-invariant portions of expressions, after considering what 346453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// can be folded using target addressing modes. 347453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// 3480bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan GohmanValue *SCEVExpander::expandAddToGEP(const SCEV *const *op_begin, 3490bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *const *op_end, 3505be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman const PointerType *PTy, 3515be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman const Type *Ty, 3525be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman Value *V) { 3535be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman const Type *ElTy = PTy->getElementType(); 3545be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman SmallVector<Value *, 4> GepIndices; 3550bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman SmallVector<const SCEV *, 8> Ops(op_begin, op_end); 3565be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman bool AnyNonZeroIndices = false; 3575be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 358c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Split AddRecs up into parts as either of the parts may be usable 359c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // without the other. 360c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SplitAddRecs(Ops, Ty, SE); 361c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 362eb35699e642f2c021f04154bdb4bd90a1afb3baaBob Wilson // Descend down the pointer's type and attempt to convert the other 3635be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // operands into GEP indices, at each level. The first index in a GEP 3645be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // indexes into the array implied by the pointer operand; the rest of 3655be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // the indices index into the element or field type selected by the 3665be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // preceding index. 3675be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman for (;;) { 368c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *ElSize = SE.getAllocSizeExpr(ElTy); 369c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If the scale size is not 0, attempt to factor out a scale for 370c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // array indexing. 3710bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman SmallVector<const SCEV *, 8> ScaledOps; 372c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (ElTy->isSized() && !ElSize->isZero()) { 373c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SmallVector<const SCEV *, 8> NewOps; 374c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman for (unsigned i = 0, e = Ops.size(); i != e; ++i) { 3750bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *Op = Ops[i]; 376c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Remainder = SE.getIntegerSCEV(0, Ty); 377c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (FactorOutConstant(Op, Remainder, ElSize, SE, SE.TD)) { 378c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Op now has ElSize factored out. 379c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ScaledOps.push_back(Op); 380c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!Remainder->isZero()) 381c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman NewOps.push_back(Remainder); 382c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman AnyNonZeroIndices = true; 383c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } else { 384c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // The operand was not divisible, so add it to the list of operands 385c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // we'll scan next iteration. 386c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman NewOps.push_back(Ops[i]); 3875be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 3885be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 389c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If we made any changes, update Ops. 390c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!ScaledOps.empty()) { 391c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops = NewOps; 392c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman SimplifyAddOperands(Ops, Ty, SE); 393c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 3945be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 395c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 396c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Record the scaled array index for this level of the type. If 397c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // we didn't find any operands that could be factored, tentatively 398c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // assume that element zero was selected (since the zero offset 399c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // would obviously be folded away). 4005be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman Value *Scaled = ScaledOps.empty() ? 401a7235ea7245028a0723e8ab7fd011386b3900777Owen Anderson Constant::getNullValue(Ty) : 4025be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman expandCodeFor(SE.getAddExpr(ScaledOps), Ty); 4035be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman GepIndices.push_back(Scaled); 4045be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 4055be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // Collect struct field index operands. 406c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman while (const StructType *STy = dyn_cast<StructType>(ElTy)) { 407c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman bool FoundFieldNo = false; 408c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // An empty struct has no fields. 409c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (STy->getNumElements() == 0) break; 410c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (SE.TD) { 411c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // With TargetData, field offsets are known. See if a constant offset 412c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // falls within any of the struct fields. 413c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (Ops.empty()) break; 4145be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(Ops[0])) 4155be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (SE.getTypeSizeInBits(C->getType()) <= 64) { 4165be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman const StructLayout &SL = *SE.TD->getStructLayout(STy); 4175be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman uint64_t FullOffset = C->getValue()->getZExtValue(); 4185be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (FullOffset < SL.getSizeInBytes()) { 4195be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman unsigned ElIdx = SL.getElementContainingOffset(FullOffset); 4201d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson GepIndices.push_back( 4211d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson ConstantInt::get(Type::getInt32Ty(Ty->getContext()), ElIdx)); 4225be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman ElTy = STy->getTypeAtIndex(ElIdx); 4235be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman Ops[0] = 4246de29f8d960505421d61c80cdb738e16720b6c0eDan Gohman SE.getConstant(Ty, FullOffset - SL.getElementOffset(ElIdx)); 4255be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman AnyNonZeroIndices = true; 426c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman FoundFieldNo = true; 4275be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 4285be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 429c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } else { 4300f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman // Without TargetData, just check for an offsetof expression of the 431c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // appropriate struct type. 432c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman for (unsigned i = 0, e = Ops.size(); i != e; ++i) 4330f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(Ops[i])) { 4340f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman const StructType *StructTy; 4350f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman Constant *FieldNo; 4360f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman if (U->isOffsetOf(StructTy, FieldNo) && StructTy == STy) { 4370f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman GepIndices.push_back(FieldNo); 4380f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman ElTy = 4390f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman STy->getTypeAtIndex(cast<ConstantInt>(FieldNo)->getZExtValue()); 440c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Ops[i] = SE.getConstant(Ty, 0); 441c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman AnyNonZeroIndices = true; 442c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman FoundFieldNo = true; 443c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman break; 444c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 4450f5efe56258f8cd6ceff4d7955a5d80144cd9cb0Dan Gohman } 4465be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 447c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If no struct field offsets were found, tentatively assume that 448c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // field zero was selected (since the zero offset would obviously 449c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // be folded away). 450c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!FoundFieldNo) { 451c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ElTy = STy->getTypeAtIndex(0u); 452c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman GepIndices.push_back( 453c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Constant::getNullValue(Type::getInt32Ty(Ty->getContext()))); 454c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 455c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 4565be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 457c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const ArrayType *ATy = dyn_cast<ArrayType>(ElTy)) 4585be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman ElTy = ATy->getElementType(); 459c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman else 460c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman break; 4615be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 4625be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 4635be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // If none of the operands were convertable to proper GEP indices, cast 4645be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // the base to i8* and do an ugly getelementptr with that. It's still 4655be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // better than ptrtoint+arithmetic+inttoptr at least. 4665be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (!AnyNonZeroIndices) { 467c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Cast the base to i8*. 4685be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman V = InsertNoopCastOfTo(V, 469ac53a0b272452013124bfc70480aea5e41b60f40Duncan Sands Type::getInt8PtrTy(Ty->getContext(), PTy->getAddressSpace())); 470c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman 471c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Expand the operands for a plain byte offset. 47292fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *Idx = expandCodeFor(SE.getAddExpr(Ops), Ty); 4735be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 4745be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // Fold a GEP with constant operands. 4755be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (Constant *CLHS = dyn_cast<Constant>(V)) 4765be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (Constant *CRHS = dyn_cast<Constant>(Idx)) 477baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson return ConstantExpr::getGetElementPtr(CLHS, &CRHS, 1); 4785be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 4795be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman // Do a quick scan to see if we have this GEP nearby. If so, reuse it. 4805be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman unsigned ScanLimit = 6; 481267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator BlockBegin = Builder.GetInsertBlock()->begin(); 482267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman // Scanning starts from the last instruction before the insertion point. 483267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator IP = Builder.GetInsertPoint(); 484267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (IP != BlockBegin) { 4855be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman --IP; 4865be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman for (; ScanLimit; --IP, --ScanLimit) { 4875be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (IP->getOpcode() == Instruction::GetElementPtr && 4885be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman IP->getOperand(0) == V && IP->getOperand(1) == Idx) 4895be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman return IP; 4905be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (IP == BlockBegin) break; 4915be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 4925be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 4935be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 494c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Emit a GEP. 495c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Value *GEP = Builder.CreateGEP(V, Idx, "uglygep"); 496a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(GEP); 4975be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman return GEP; 4985be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 4995be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 500d6aa02de1076c801ac41295156a2379637976918Dan Gohman // Insert a pretty getelementptr. Note that this GEP is not marked inbounds, 501d6aa02de1076c801ac41295156a2379637976918Dan Gohman // because ScalarEvolution may have changed the address arithmetic to 502d6aa02de1076c801ac41295156a2379637976918Dan Gohman // compute a value which is beyond the end of the allocated object. 503a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *Casted = V; 504a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (V->getType() != PTy) 505a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Casted = InsertNoopCastOfTo(Casted, PTy); 506a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *GEP = Builder.CreateGEP(Casted, 507267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman GepIndices.begin(), 508267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman GepIndices.end(), 509267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman "scevgep"); 5105be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman Ops.push_back(SE.getUnknown(GEP)); 511a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(GEP); 5125be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman return expand(SE.getAddExpr(Ops)); 5135be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman} 5145be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 515a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman/// isNonConstantNegative - Return true if the specified scev is negated, but 516a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman/// not a constant. 517a10756ee657a4d43a48cca5c166919093930ed6bDan Gohmanstatic bool isNonConstantNegative(const SCEV *F) { 518a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(F); 519a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!Mul) return false; 520a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 521a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // If there is a constant factor, it will be first. 522a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0)); 523a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!SC) return false; 524a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 525a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Return true if the value is negative, this matches things like (-42 * V). 526a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman return SC->getValue()->getValue().isNegative(); 527a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 528a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 529890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitAddExpr(const SCEVAddExpr *S) { 530c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman int NumOperands = S->getNumOperands(); 531af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 532c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman 533c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // Find the index of an operand to start with. Choose the operand with 534c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // pointer type, if there is one, or the last operand otherwise. 535c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman int PIdx = 0; 536c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman for (; PIdx != NumOperands - 1; ++PIdx) 537c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman if (isa<PointerType>(S->getOperand(PIdx)->getType())) break; 538c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman 539c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // Expand code for the operand that we chose. 540c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman Value *V = expand(S->getOperand(PIdx)); 5415be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 542453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // Turn things like ptrtoint+arithmetic+inttoptr into GEP. See the 543453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // comments on expandAddToGEP for details. 544c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const PointerType *PTy = dyn_cast<PointerType>(V->getType())) { 545c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // Take the operand at PIdx out of the list. 546c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SmallVectorImpl<const SCEV *> &Ops = S->getOperands(); 547c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman SmallVector<const SCEV *, 8> NewOps; 548c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman NewOps.insert(NewOps.end(), Ops.begin(), Ops.begin() + PIdx); 549c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman NewOps.insert(NewOps.end(), Ops.begin() + PIdx + 1, Ops.end()); 550c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // Make a GEP. 551c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman return expandAddToGEP(NewOps.begin(), NewOps.end(), PTy, Ty, V); 552c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman } 5535be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 554c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // Otherwise, we'll expand the rest of the SCEVAddExpr as plain integer 555c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman // arithmetic. 556af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman V = InsertNoopCastOfTo(V, Ty); 557e24fa64d52330626553298f56ba5aa702624c282Dan Gohman 558e24fa64d52330626553298f56ba5aa702624c282Dan Gohman // Emit a bunch of add instructions 559c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman for (int i = NumOperands-1; i >= 0; --i) { 560c70c37794fbff2c615d4f9dc3b6adf9583b855dcDan Gohman if (i == PIdx) continue; 561a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *Op = S->getOperand(i); 562a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (isNonConstantNegative(Op)) { 563a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *W = expandCodeFor(SE.getNegativeSCEV(Op), Ty); 564a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman V = InsertBinop(Instruction::Sub, V, W); 565a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } else { 566a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *W = expandCodeFor(Op, Ty); 567a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman V = InsertBinop(Instruction::Add, V, W); 568a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 5692d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman } 570e24fa64d52330626553298f56ba5aa702624c282Dan Gohman return V; 571e24fa64d52330626553298f56ba5aa702624c282Dan Gohman} 5725be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman 573890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitMulExpr(const SCEVMulExpr *S) { 574af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 57536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman int FirstOp = 0; // Set if we should emit a subtract. 576890f92b744fb074465bc2b7006ee753a181f62a4Dan Gohman if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(S->getOperand(0))) 57736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (SC->getValue()->isAllOnesValue()) 57836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman FirstOp = 1; 57936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 58036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman int i = S->getNumOperands()-2; 58192fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *V = expandCodeFor(S->getOperand(i+1), Ty); 58236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 58336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Emit a bunch of multiply instructions 5842d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman for (; i >= FirstOp; --i) { 58592fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *W = expandCodeFor(S->getOperand(i), Ty); 586267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman V = InsertBinop(Instruction::Mul, V, W); 5872d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman } 5882d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman 58936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // -1 * ... ---> 0 - ... 59036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman if (FirstOp == 1) 591a7235ea7245028a0723e8ab7fd011386b3900777Owen Anderson V = InsertBinop(Instruction::Sub, Constant::getNullValue(Ty), V); 59236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman return V; 59336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman} 59436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 595890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitUDivExpr(const SCEVUDivExpr *S) { 596af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 5972d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman 59892fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *LHS = expandCodeFor(S->getLHS(), Ty); 599890f92b744fb074465bc2b7006ee753a181f62a4Dan Gohman if (const SCEVConstant *SC = dyn_cast<SCEVConstant>(S->getRHS())) { 6006177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky const APInt &RHS = SC->getValue()->getValue(); 6016177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky if (RHS.isPowerOf2()) 6026177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky return InsertBinop(Instruction::LShr, LHS, 603eed707b1e6097aac2bb6b3d47271f6300ace7f2eOwen Anderson ConstantInt::get(Ty, RHS.logBase2())); 6046177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky } 6056177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky 60692fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *RHS = expandCodeFor(S->getRHS(), Ty); 607267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman return InsertBinop(Instruction::UDiv, LHS, RHS); 6086177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky} 6096177fd4fcee4d82692c47e33754ffe285c38cc69Nick Lewycky 610453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// Move parts of Base into Rest to leave Base with the minimal 611453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// expression that provides a pointer operand suitable for a 612453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman/// GEP expansion. 6130bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohmanstatic void ExposePointerBase(const SCEV *&Base, const SCEV *&Rest, 614453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman ScalarEvolution &SE) { 615453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman while (const SCEVAddRecExpr *A = dyn_cast<SCEVAddRecExpr>(Base)) { 616453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman Base = A->getStart(); 617453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman Rest = SE.getAddExpr(Rest, 618453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman SE.getAddRecExpr(SE.getIntegerSCEV(0, A->getType()), 619453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman A->getStepRecurrence(SE), 620453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman A->getLoop())); 621453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 622453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman if (const SCEVAddExpr *A = dyn_cast<SCEVAddExpr>(Base)) { 623453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman Base = A->getOperand(A->getNumOperands()-1); 6240bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman SmallVector<const SCEV *, 8> NewAddOps(A->op_begin(), A->op_end()); 625453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman NewAddOps.back() = Rest; 626453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman Rest = SE.getAddExpr(NewAddOps); 627453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman ExposePointerBase(Base, Rest, SE); 628453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 629453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman} 630453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 631a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman/// getAddRecExprPHILiterally - Helper for expandAddRecExprLiterally. Expand 632a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman/// the base addrec, which is the addrec without any non-loop-dominating 633a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman/// values, and return the PHI. 634a10756ee657a4d43a48cca5c166919093930ed6bDan GohmanPHINode * 635a10756ee657a4d43a48cca5c166919093930ed6bDan GohmanSCEVExpander::getAddRecExprPHILiterally(const SCEVAddRecExpr *Normalized, 636a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Loop *L, 637a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Type *ExpandTy, 638a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Type *IntTy) { 639a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Reuse a previously-inserted PHI, if present. 640a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman for (BasicBlock::iterator I = L->getHeader()->begin(); 641a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PHINode *PN = dyn_cast<PHINode>(I); ++I) 642a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (isInsertedInstruction(PN) && SE.getSCEV(PN) == Normalized) 643a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman return PN; 644a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 645a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Save the original insertion point so we can restore it when we're done. 646a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman BasicBlock *SaveInsertBB = Builder.GetInsertBlock(); 647a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman BasicBlock::iterator SaveInsertPt = Builder.GetInsertPoint(); 648a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 649a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Expand code for the start value. 650a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *StartV = expandCodeFor(Normalized->getStart(), ExpandTy, 651a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman L->getHeader()->begin()); 652a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 653a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Expand code for the step value. Insert instructions right before the 654a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // terminator corresponding to the back-edge. Do this before creating the PHI 655a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // so that PHI reuse code doesn't see an incomplete PHI. If the stride is 656a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // negative, insert a sub instead of an add for the increment (unless it's a 657a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // constant, because subtracts of constants are canonicalized to adds). 658a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *Step = Normalized->getStepRecurrence(SE); 659a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman bool isPointer = isa<PointerType>(ExpandTy); 660a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman bool isNegative = !isPointer && isNonConstantNegative(Step); 661a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (isNegative) 662a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Step = SE.getNegativeSCEV(Step); 663a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *StepV = expandCodeFor(Step, IntTy, L->getHeader()->begin()); 664a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 665a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Create the PHI. 666a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Builder.SetInsertPoint(L->getHeader(), L->getHeader()->begin()); 667a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PHINode *PN = Builder.CreatePHI(ExpandTy, "lsr.iv"); 668a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(PN); 669a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 670a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Create the step instructions and populate the PHI. 671a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman BasicBlock *Header = L->getHeader(); 672a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman for (pred_iterator HPI = pred_begin(Header), HPE = pred_end(Header); 673a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman HPI != HPE; ++HPI) { 674a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman BasicBlock *Pred = *HPI; 675a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 676a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Add a start value. 677a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!L->contains(Pred)) { 678a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PN->addIncoming(StartV, Pred); 679a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman continue; 680a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 681a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 682a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Create a step value and add it to the PHI. If IVIncInsertLoop is 683a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // non-null and equal to the addrec's loop, insert the instructions 684a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // at IVIncInsertPos. 685a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Instruction *InsertPos = L == IVIncInsertLoop ? 686a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman IVIncInsertPos : Pred->getTerminator(); 687a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Builder.SetInsertPoint(InsertPos->getParent(), InsertPos); 688a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *IncV; 689a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // If the PHI is a pointer, use a GEP, otherwise use an add or sub. 690a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (isPointer) { 691a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const PointerType *GEPPtrTy = cast<PointerType>(ExpandTy); 692a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // If the step isn't constant, don't use an implicitly scaled GEP, because 693a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // that would require a multiply inside the loop. 694a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!isa<ConstantInt>(StepV)) 695a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman GEPPtrTy = PointerType::get(Type::getInt1Ty(SE.getContext()), 696a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman GEPPtrTy->getAddressSpace()); 697a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *const StepArray[1] = { SE.getSCEV(StepV) }; 698a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman IncV = expandAddToGEP(StepArray, StepArray+1, GEPPtrTy, IntTy, PN); 699a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (IncV->getType() != PN->getType()) { 700a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman IncV = Builder.CreateBitCast(IncV, PN->getType(), "tmp"); 701a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(IncV); 702a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 703a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } else { 704a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman IncV = isNegative ? 705a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Builder.CreateSub(PN, StepV, "lsr.iv.next") : 706a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Builder.CreateAdd(PN, StepV, "lsr.iv.next"); 707a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(IncV); 708a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 709a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PN->addIncoming(IncV, Pred); 710a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 711a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 712a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Restore the original insert point. 713a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (SaveInsertBB) 714a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Builder.SetInsertPoint(SaveInsertBB, SaveInsertPt); 715a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 716a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Remember this PHI, even in post-inc mode. 717a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman InsertedValues.insert(PN); 718a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 719a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman return PN; 720a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 721a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 722a10756ee657a4d43a48cca5c166919093930ed6bDan GohmanValue *SCEVExpander::expandAddRecExprLiterally(const SCEVAddRecExpr *S) { 723a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Type *STy = S->getType(); 724a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Type *IntTy = SE.getEffectiveSCEVType(STy); 725a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Loop *L = S->getLoop(); 726a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 727a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Determine a normalized form of this expression, which is the expression 728a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // before any post-inc adjustment is made. 729a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEVAddRecExpr *Normalized = S; 730a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (L == PostIncLoop) { 731a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *Step = S->getStepRecurrence(SE); 732a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized = cast<SCEVAddRecExpr>(SE.getMinusSCEV(S, Step)); 733a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 734a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 735a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Strip off any non-loop-dominating component from the addrec start. 736a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *Start = Normalized->getStart(); 737a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *PostLoopOffset = 0; 738a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!Start->properlyDominates(L->getHeader(), SE.DT)) { 739a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PostLoopOffset = Start; 740a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Start = SE.getIntegerSCEV(0, Normalized->getType()); 741a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized = 742a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman cast<SCEVAddRecExpr>(SE.getAddRecExpr(Start, 743a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized->getStepRecurrence(SE), 744a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized->getLoop())); 745a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 746a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 747a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Strip off any non-loop-dominating component from the addrec step. 748a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *Step = Normalized->getStepRecurrence(SE); 749a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *PostLoopScale = 0; 750a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!Step->hasComputableLoopEvolution(L) && 751a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman !Step->dominates(L->getHeader(), SE.DT)) { 752a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PostLoopScale = Step; 753a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Step = SE.getIntegerSCEV(1, Normalized->getType()); 754a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized = 755a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman cast<SCEVAddRecExpr>(SE.getAddRecExpr(Start, Step, 756a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Normalized->getLoop())); 757a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 758a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 759a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Expand the core addrec. If we need post-loop scaling, force it to 760a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // expand to an integer type to avoid the need for additional casting. 761a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const Type *ExpandTy = PostLoopScale ? IntTy : STy; 762a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman PHINode *PN = getAddRecExprPHILiterally(Normalized, L, ExpandTy, IntTy); 763a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 764a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Accomodate post-inc mode, if necessary. 765a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Value *Result; 766a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (L != PostIncLoop) 767a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Result = PN; 768a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman else { 769a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // In PostInc mode, use the post-incremented value. 770a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman BasicBlock *LatchBlock = L->getLoopLatch(); 771a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman assert(LatchBlock && "PostInc mode requires a unique loop latch!"); 772a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Result = PN->getIncomingValueForBlock(LatchBlock); 773a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 774a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 775a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Re-apply any non-loop-dominating scale. 776a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (PostLoopScale) { 777a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Result = Builder.CreateMul(Result, 778a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman expandCodeFor(PostLoopScale, IntTy)); 779a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(Result); 780a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 781a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 782a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman // Re-apply any non-loop-dominating offset. 783a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (PostLoopOffset) { 784a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (const PointerType *PTy = dyn_cast<PointerType>(ExpandTy)) { 785a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman const SCEV *const OffsetArray[1] = { PostLoopOffset }; 786a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Result = expandAddToGEP(OffsetArray, OffsetArray+1, PTy, IntTy, Result); 787a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } else { 788a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman Result = Builder.CreateAdd(Result, 789a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman expandCodeFor(PostLoopOffset, IntTy)); 790a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(Result); 791a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 792a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 793a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 794a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman return Result; 795a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 796a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 797890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitAddRecExpr(const SCEVAddRecExpr *S) { 798a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!CanonicalMode) return expandAddRecExprLiterally(S); 799a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 800af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 80136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman const Loop *L = S->getLoop(); 80236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 8034d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // First check for an existing canonical IV in a suitable type. 8044d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman PHINode *CanonicalIV = 0; 8054d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman if (PHINode *PN = L->getCanonicalInductionVariable()) 8064d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman if (SE.isSCEVable(PN->getType()) && 8074d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman isa<IntegerType>(SE.getEffectiveSCEVType(PN->getType())) && 8084d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman SE.getTypeSizeInBits(PN->getType()) >= SE.getTypeSizeInBits(Ty)) 8094d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman CanonicalIV = PN; 8104d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman 8114d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // Rewrite an AddRec in terms of the canonical induction variable, if 8124d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // its type is more narrow. 8134d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman if (CanonicalIV && 8144d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman SE.getTypeSizeInBits(CanonicalIV->getType()) > 8154d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman SE.getTypeSizeInBits(Ty)) { 816f3f1be6f065d1b90afe80ca80c9d6473c10deb5aDan Gohman const SmallVectorImpl<const SCEV *> &Ops = S->getOperands(); 817f3f1be6f065d1b90afe80ca80c9d6473c10deb5aDan Gohman SmallVector<const SCEV *, 4> NewOps(Ops.size()); 818f3f1be6f065d1b90afe80ca80c9d6473c10deb5aDan Gohman for (unsigned i = 0, e = Ops.size(); i != e; ++i) 819f3f1be6f065d1b90afe80ca80c9d6473c10deb5aDan Gohman NewOps[i] = SE.getAnyExtendExpr(Ops[i], CanonicalIV->getType()); 820f3f1be6f065d1b90afe80ca80c9d6473c10deb5aDan Gohman Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop())); 821267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock *SaveInsertBB = Builder.GetInsertBlock(); 822267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator SaveInsertPt = Builder.GetInsertPoint(); 8234d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman BasicBlock::iterator NewInsertPt = 8247896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner llvm::next(BasicBlock::iterator(cast<Instruction>(V))); 8254d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman while (isa<PHINode>(NewInsertPt)) ++NewInsertPt; 8264d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman V = expandCodeFor(SE.getTruncateExpr(SE.getUnknown(V), Ty), 0, 8274d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman NewInsertPt); 828267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Builder.SetInsertPoint(SaveInsertBB, SaveInsertPt); 8294d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman return V; 8304d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman } 8314d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman 83236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // {X,+,F} --> X + {0,+,F} 833cfeb6a450632f2a6cd05302633c8c2b8c90cfdfdDan Gohman if (!S->getStart()->isZero()) { 8340bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SmallVectorImpl<const SCEV *> &SOperands = S->getOperands(); 8350bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman SmallVector<const SCEV *, 4> NewOps(SOperands.begin(), SOperands.end()); 836246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman NewOps[0] = SE.getIntegerSCEV(0, Ty); 8370bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *Rest = SE.getAddRecExpr(NewOps, L); 838453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 839453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // Turn things like ptrtoint+arithmetic+inttoptr into GEP. See the 840453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman // comments on expandAddToGEP for details. 841c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *Base = S->getStart(); 842c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman const SCEV *RestArray[1] = { Rest }; 843c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Dig into the expression to find the pointer base for a GEP. 844c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman ExposePointerBase(Base, RestArray[0], SE); 845c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // If we found a pointer, expand the AddRec with a GEP. 846c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (const PointerType *PTy = dyn_cast<PointerType>(Base->getType())) { 847c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // Make sure the Base isn't something exotic, such as a multiplied 848c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // or divided pointer value. In those cases, the result type isn't 849c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman // actually a pointer type. 850c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman if (!isa<SCEVMulExpr>(Base) && !isa<SCEVUDivExpr>(Base)) { 851c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman Value *StartV = expand(Base); 852c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman assert(StartV->getType() == PTy && "Pointer type mismatch for GEP!"); 853c40f17b08774c2dcc5787fd83241e3c64ba82974Dan Gohman return expandAddToGEP(RestArray, RestArray+1, PTy, Ty, StartV); 854453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 855453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman } 856453aa4fbf1083cc7f646a0ac21e2bcc384a91ae9Dan Gohman 85740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // Just do a normal add. Pre-expand the operands to suppress folding. 85840a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman return expand(SE.getAddExpr(SE.getUnknown(expand(S->getStart())), 85940a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman SE.getUnknown(expand(Rest)))); 86036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman } 86136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 86236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // {0,+,1} --> Insert a canonical induction variable into the loop! 86317f1972c770dc18f5c7c3c95776b4d62ae9e121dDan Gohman if (S->isAffine() && 864246b2564d3bbbafe06ebf6a67745cd24141b5cb4Dan Gohman S->getOperand(1) == SE.getIntegerSCEV(1, Ty)) { 8654d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // If there's a canonical IV, just use it. 8664d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman if (CanonicalIV) { 8674d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman assert(Ty == SE.getEffectiveSCEVType(CanonicalIV->getType()) && 8684d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman "IVs with types different from the canonical IV should " 8694d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman "already have been handled!"); 8704d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman return CanonicalIV; 8714d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman } 8724d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman 87336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Create and insert the PHI node for the induction variable in the 87436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // specified loop. 87536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman BasicBlock *Header = L->getHeader(); 876051a950000e21935165db56695e35bade668193bGabor Greif PHINode *PN = PHINode::Create(Ty, "indvar", Header->begin()); 877a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(PN); 87836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 879eed707b1e6097aac2bb6b3d47271f6300ace7f2eOwen Anderson Constant *One = ConstantInt::get(Ty, 1); 88083d577490b1473213b6973236110c28e59127956Dan Gohman for (pred_iterator HPI = pred_begin(Header), HPE = pred_end(Header); 88183d577490b1473213b6973236110c28e59127956Dan Gohman HPI != HPE; ++HPI) 88283d577490b1473213b6973236110c28e59127956Dan Gohman if (L->contains(*HPI)) { 8833abf905b50f33340ae81913da81b0eda96fa4616Dan Gohman // Insert a unit add instruction right before the terminator 8843abf905b50f33340ae81913da81b0eda96fa4616Dan Gohman // corresponding to the back-edge. 88583d577490b1473213b6973236110c28e59127956Dan Gohman Instruction *Add = BinaryOperator::CreateAdd(PN, One, "indvar.next", 88683d577490b1473213b6973236110c28e59127956Dan Gohman (*HPI)->getTerminator()); 887a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(Add); 88883d577490b1473213b6973236110c28e59127956Dan Gohman PN->addIncoming(Add, *HPI); 88983d577490b1473213b6973236110c28e59127956Dan Gohman } else { 89083d577490b1473213b6973236110c28e59127956Dan Gohman PN->addIncoming(Constant::getNullValue(Ty), *HPI); 89183d577490b1473213b6973236110c28e59127956Dan Gohman } 89236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman } 89336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 8944d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // {0,+,F} --> {0,+,1} * F 89536f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // Get the canonical induction variable I for this loop. 8964d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman Value *I = CanonicalIV ? 8974d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman CanonicalIV : 8984d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman getOrInsertCanonicalInductionVariable(L, Ty); 89936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 900df14a04b5ccbbe6a46c2ccb93e27b12a36ff163eChris Lattner // If this is a simple linear addrec, emit it now as a special case. 90140a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (S->isAffine()) // {0,+,F} --> i*F 90240a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman return 90340a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman expand(SE.getTruncateOrNoop( 90440a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman SE.getMulExpr(SE.getUnknown(I), 90540a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman SE.getNoopOrAnyExtend(S->getOperand(1), 90640a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman I->getType())), 90740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman Ty)); 90836f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 90936f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // If this is a chain of recurrences, turn it into a closed form, using the 91036f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // folders, then expandCodeFor the closed form. This allows the folders to 91136f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // simplify the expression without having to build a bunch of special code 91236f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman // into this folder. 9130bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *IH = SE.getUnknown(I); // Get I as a "symbolic" SCEV. 91436f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 9154d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // Promote S up to the canonical IV type, if the cast is foldable. 9160bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *NewS = S; 9170bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *Ext = SE.getNoopOrAnyExtend(S, I->getType()); 9184d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman if (isa<SCEVAddRecExpr>(Ext)) 9194d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman NewS = Ext; 9204d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman 9210bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *V = cast<SCEVAddRecExpr>(NewS)->evaluateAtIteration(IH, SE); 922e81561909d128c6e2d8033cb5465a49b2596b26aBill Wendling //cerr << "Evaluated: " << *this << "\n to: " << *V << "\n"; 92336f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman 9244d8414f42033a5e744e8e60d2ca188b424c76168Dan Gohman // Truncate the result down to the original type, if needed. 9250bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *T = SE.getTruncateOrNoop(V, Ty); 926469f3cdc13851914f3a766cbd8f701cf8431cacaDan Gohman return expand(T); 92736f891bdf6cf38fcc655a0930ca18664e18518d4Nate Begeman} 92896fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov 929890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitTruncateExpr(const SCEVTruncateExpr *S) { 930af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 93192fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *V = expandCodeFor(S->getOperand(), 93292fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman SE.getEffectiveSCEVType(S->getOperand()->getType())); 933267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *I = Builder.CreateTrunc(V, Ty, "tmp"); 934a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(I); 935cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return I; 93611f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 93711f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 938890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitZeroExtendExpr(const SCEVZeroExtendExpr *S) { 939af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 94092fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *V = expandCodeFor(S->getOperand(), 94192fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman SE.getEffectiveSCEVType(S->getOperand()->getType())); 942267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *I = Builder.CreateZExt(V, Ty, "tmp"); 943a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(I); 944cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return I; 94511f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 94611f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 947890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitSignExtendExpr(const SCEVSignExtendExpr *S) { 948af79fb5f47b0088c6a8973a7fdbaea96973a429dDan Gohman const Type *Ty = SE.getEffectiveSCEVType(S->getType()); 94992fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *V = expandCodeFor(S->getOperand(), 95092fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman SE.getEffectiveSCEVType(S->getOperand()->getType())); 951267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *I = Builder.CreateSExt(V, Ty, "tmp"); 952a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(I); 953cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman return I; 95411f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 95511f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 956890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitSMaxExpr(const SCEVSMaxExpr *S) { 9570196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman Value *LHS = expand(S->getOperand(S->getNumOperands()-1)); 9580196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman const Type *Ty = LHS->getType(); 9590196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman for (int i = S->getNumOperands()-2; i >= 0; --i) { 9600196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // In the case of mixed integer and pointer types, do the 9610196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // rest of the comparisons as integer. 9620196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman if (S->getOperand(i)->getType() != Ty) { 9630196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman Ty = SE.getEffectiveSCEVType(Ty); 9640196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman LHS = InsertNoopCastOfTo(LHS, Ty); 9650196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman } 96692fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *RHS = expandCodeFor(S->getOperand(i), Ty); 967267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *ICmp = Builder.CreateICmpSGT(LHS, RHS, "tmp"); 968a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(ICmp); 969267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *Sel = Builder.CreateSelect(ICmp, LHS, RHS, "smax"); 970a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(Sel); 971cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman LHS = Sel; 972c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky } 9730196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // In the case of mixed integer and pointer types, cast the 9740196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // final result back to the pointer type. 9750196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman if (LHS->getType() != S->getType()) 9760196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman LHS = InsertNoopCastOfTo(LHS, S->getType()); 977c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky return LHS; 978c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky} 979c54c561c9f7270c055dd7ba75a3a003b771a42d9Nick Lewycky 980890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::visitUMaxExpr(const SCEVUMaxExpr *S) { 9810196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman Value *LHS = expand(S->getOperand(S->getNumOperands()-1)); 9820196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman const Type *Ty = LHS->getType(); 9830196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman for (int i = S->getNumOperands()-2; i >= 0; --i) { 9840196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // In the case of mixed integer and pointer types, do the 9850196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // rest of the comparisons as integer. 9860196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman if (S->getOperand(i)->getType() != Ty) { 9870196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman Ty = SE.getEffectiveSCEVType(Ty); 9880196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman LHS = InsertNoopCastOfTo(LHS, Ty); 9890196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman } 99092fcdcac543653a62949fe9e5a7bd008500c1380Dan Gohman Value *RHS = expandCodeFor(S->getOperand(i), Ty); 991267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *ICmp = Builder.CreateICmpUGT(LHS, RHS, "tmp"); 992a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(ICmp); 993267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Value *Sel = Builder.CreateSelect(ICmp, LHS, RHS, "umax"); 994a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman rememberInstruction(Sel); 995cf5ab820227dedd77fb91d0904b6dc3694a7c196Dan Gohman LHS = Sel; 9963e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky } 9970196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // In the case of mixed integer and pointer types, cast the 9980196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman // final result back to the pointer type. 9990196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman if (LHS->getType() != S->getType()) 10000196dc5733bf3c6a71f7de1f631f2c43e5809fd9Dan Gohman LHS = InsertNoopCastOfTo(LHS, S->getType()); 10013e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky return LHS; 10023e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky} 10033e6307698084e7adfc10b739442ae29742beefd0Nick Lewycky 10040bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan GohmanValue *SCEVExpander::expandCodeFor(const SCEV *SH, const Type *Ty) { 100511f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman // Expand the code for this SCEV. 10062d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman Value *V = expand(SH); 10075be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman if (Ty) { 10085be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman assert(SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(SH->getType()) && 10095be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman "non-trivial casts should be done with the SCEVs directly!"); 10105be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman V = InsertNoopCastOfTo(V, Ty); 10115be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman } 10125be18e84766fb495b0bde3c8244c1df459a18683Dan Gohman return V; 101311f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman} 101411f6d3b478c4fa09d126833c57fbac1d795ead31Dan Gohman 1015890f92b744fb074465bc2b7006ee753a181f62a4Dan GohmanValue *SCEVExpander::expand(const SCEV *S) { 101640a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // Compute an insertion point for this SCEV object. Hoist the instructions 101740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // as far out in the loop nest as possible. 1018267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Instruction *InsertPt = Builder.GetInsertPoint(); 1019267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman for (Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock()); ; 102040a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman L = L->getParentLoop()) 102140a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (S->isLoopInvariant(L)) { 102240a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (!L) break; 102340a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (BasicBlock *Preheader = L->getLoopPreheader()) 102440a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman InsertPt = Preheader->getTerminator(); 102540a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman } else { 102640a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // If the SCEV is computable at this level, insert it into the header 102740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // after the PHIs (and after any other instructions that we've inserted 102840a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman // there) so that it is guaranteed to dominate any user inside the loop. 102940a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman if (L && S->hasComputableLoopEvolution(L)) 103040a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman InsertPt = L->getHeader()->getFirstNonPHI(); 1031267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman while (isInsertedInstruction(InsertPt)) 10327896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner InsertPt = llvm::next(BasicBlock::iterator(InsertPt)); 103340a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman break; 103440a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman } 103540a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman 1036667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman // Check to see if we already expanded this here. 1037667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman std::map<std::pair<const SCEV *, Instruction *>, 1038667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman AssertingVH<Value> >::iterator I = 1039667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman InsertedExpressions.find(std::make_pair(S, InsertPt)); 1040267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (I != InsertedExpressions.end()) 1041667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman return I->second; 1042267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman 1043267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock *SaveInsertBB = Builder.GetInsertBlock(); 1044267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator SaveInsertPt = Builder.GetInsertPoint(); 1045267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Builder.SetInsertPoint(InsertPt->getParent(), InsertPt); 1046667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman 1047667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman // Expand the expression into instructions. 104896fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov Value *V = visit(S); 104940a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman 1050667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman // Remember the expanded value for this SCEV at this location. 1051a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman if (!PostIncLoop) 1052a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman InsertedExpressions[std::make_pair(S, InsertPt)] = V; 1053667d787c0a21cf3f5dfcde03ca471162ba35b614Dan Gohman 1054267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Builder.SetInsertPoint(SaveInsertBB, SaveInsertPt); 105596fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov return V; 105696fea337d27357e9b62abbf3d2d5ce29f1c8e870Anton Korobeynikov} 10571d09de3eca23267855e28297fcb40de3632ea47bDan Gohman 10581d09de3eca23267855e28297fcb40de3632ea47bDan Gohman/// getOrInsertCanonicalInductionVariable - This method returns the 10591d09de3eca23267855e28297fcb40de3632ea47bDan Gohman/// canonical induction variable of the specified type for the specified 10601d09de3eca23267855e28297fcb40de3632ea47bDan Gohman/// loop (inserting one if there is none). A canonical induction variable 10611d09de3eca23267855e28297fcb40de3632ea47bDan Gohman/// starts at zero and steps by one on each iteration. 10621d09de3eca23267855e28297fcb40de3632ea47bDan GohmanValue * 10631d09de3eca23267855e28297fcb40de3632ea47bDan GohmanSCEVExpander::getOrInsertCanonicalInductionVariable(const Loop *L, 10641d09de3eca23267855e28297fcb40de3632ea47bDan Gohman const Type *Ty) { 10651d09de3eca23267855e28297fcb40de3632ea47bDan Gohman assert(Ty->isInteger() && "Can only insert integer induction variables!"); 10660bba49cebc50c7bd4662a4807bcb3ee7f42cb470Dan Gohman const SCEV *H = SE.getAddRecExpr(SE.getIntegerSCEV(0, Ty), 106740a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman SE.getIntegerSCEV(1, Ty), L); 1068267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock *SaveInsertBB = Builder.GetInsertBlock(); 1069267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman BasicBlock::iterator SaveInsertPt = Builder.GetInsertPoint(); 107040a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman Value *V = expandCodeFor(H, 0, L->getHeader()->begin()); 1071267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman if (SaveInsertBB) 1072267a385342f2e7388f178b327dd87c5f29afd51bDan Gohman Builder.SetInsertPoint(SaveInsertBB, SaveInsertPt); 107340a5a1b39ee1cd40ff9d04740386b667fb27b340Dan Gohman return V; 10741d09de3eca23267855e28297fcb40de3632ea47bDan Gohman} 1075