LoopStrengthReduce.cpp revision fafb890ee204d60456d0780ff55a149fa082eaea
12d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman//===- LoopStrengthReduce.cpp - Strength Reduce IVs in Loops --------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman// The LLVM Compiler Infrastructure 4eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 8eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman//===----------------------------------------------------------------------===// 9eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman// 10cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// This transformation analyzes and transforms the induction variables (and 11cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// computations derived from them) into forms suitable for efficient execution 12cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// on the target. 13cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// 14eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman// This pass performs a strength reduction on array references inside loops that 15cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// have as one or more of their components the loop induction variable, it 16cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// rewrites expressions to take advantage of scaled-index addressing modes 17cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// available on the target, and it performs a variety of other optimizations 18cec8f9da54d3017e27c46ced38b859136655c198Dan Gohman// related to loop induction variables. 19eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman// 20572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// Terminology note: this code has a lot of handling for "post-increment" or 21572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// "post-inc" users. This is not talking about post-increment addressing modes; 22572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// it is instead talking about code like this: 23572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 24572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// %i = phi [ 0, %entry ], [ %i.next, %latch ] 25572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// ... 26572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// %i.next = add %i, 1 27572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// %c = icmp eq %i.next, %n 28572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 29572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// The SCEV for %i is {0,+,1}<%L>. The SCEV for %i.next is {1,+,1}<%L>, however 30572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// it's useful to think about these as the same register, with some uses using 31572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// the value of the register before the add and some using // it after. In this 32572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// example, the icmp is a post-increment user, since it uses %i.next, which is 33572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// the value of the induction variable after the increment. The other common 34572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// case of post-increment users is users outside the loop. 35572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 36572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// TODO: More sophistication in the way Formulae are generated and filtered. 37572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 38572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// TODO: Handle multiple loops at a time. 39572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 40572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// TODO: Should TargetLowering::AddrMode::BaseGV be changed to a ConstantExpr 41572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// instead of a GlobalValue? 42572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 43572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// TODO: When truncation is free, truncate ICmp users' operands to make it a 44572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// smaller encoding (on x86 at least). 45572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 46572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// TODO: When a negated register is used by an add (such as in a list of 47572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// multiple base registers, or as the increment expression in an addrec), 48572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// we may not actually need both reg and (-1 * reg) in registers; the 49572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// negation can be implemented by using a sub instead of an add. The 50572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// lack of support for taking this into consideration when making 51572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// register pressure decisions is partly worked around by the "Special" 52572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// use kind. 53572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman// 54eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman//===----------------------------------------------------------------------===// 55eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 56be3e5212e23edc9210f774fac18d801de252e906Chris Lattner#define DEBUG_TYPE "loop-reduce" 57eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman#include "llvm/Transforms/Scalar.h" 58eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman#include "llvm/Constants.h" 59eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman#include "llvm/Instructions.h" 60e5b01bea7b9b7dce7c24484d2d915b0c118d4d07Dan Gohman#include "llvm/IntrinsicInst.h" 612f3c9b7562bcdc1795b2bd0ca28b283a8e972826Jeff Cohen#include "llvm/DerivedTypes.h" 6281db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman#include "llvm/Analysis/IVUsers.h" 63572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#include "llvm/Analysis/Dominators.h" 640f54dcbf07c69e41ecaa6b4fbf0d94956d8e9ff5Devang Patel#include "llvm/Analysis/LoopPass.h" 65169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman#include "llvm/Analysis/ScalarEvolutionExpander.h" 66e0391beda88c6c441ce1aadbe223d6c0784061a2Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 67eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman#include "llvm/Transforms/Utils/Local.h" 68572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#include "llvm/ADT/SmallBitVector.h" 69572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#include "llvm/ADT/SetVector.h" 70572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#include "llvm/ADT/DenseSet.h" 71169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman#include "llvm/Support/Debug.h" 72afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman#include "llvm/Support/ValueHandle.h" 73460f656475738d1a95a6be95346908ce1597df25Daniel Dunbar#include "llvm/Support/raw_ostream.h" 74d277f2c66914aecb619c12855f6afae4c7ef883bEvan Cheng#include "llvm/Target/TargetLowering.h" 75cfb1d4235fe3291028341e6acf4139723b4749e3Jeff Cohen#include <algorithm> 76eaa13851a7fe604363577350c5cf65c257c4d41aNate Begemanusing namespace llvm; 77eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 78572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 79572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 80572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// RegSortData - This class holds data which is used to order reuse candidates. 81572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass RegSortData { 82572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 83572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// UsedByIndices - This represents the set of LSRUse indices which reference 84572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// a particular register. 85572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallBitVector UsedByIndices; 86572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 87572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegSortData() {} 88572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 89572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 90572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 91572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 92572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 93572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 94572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 95572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid RegSortData::print(raw_ostream &OS) const { 96572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "[NumUses=" << UsedByIndices.count() << ']'; 97572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 98dc42f48ea90132509e678028e7dbab5544ef0794Dale Johannesen 99572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid RegSortData::dump() const { 100572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 101572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 102dc42f48ea90132509e678028e7dbab5544ef0794Dale Johannesen 1037979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohmannamespace { 1047979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 105572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// RegUseTracker - Map register candidates to information about how they are 106572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// used. 107572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass RegUseTracker { 108572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef DenseMap<const SCEV *, RegSortData> RegUsesTy; 109d1d6b5cce260808deeac0227b00f6f81a20b2c6fEvan Cheng 110572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUsesTy RegUses; 111572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 16> RegSequence; 112d1d6b5cce260808deeac0227b00f6f81a20b2c6fEvan Cheng 113572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 114572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void CountRegister(const SCEV *Reg, size_t LUIdx); 115572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 116572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const; 117572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 118572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallBitVector &getUsedByIndices(const SCEV *Reg) const; 119572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 120572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void clear(); 121572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 122572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef SmallVectorImpl<const SCEV *>::iterator iterator; 123572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef SmallVectorImpl<const SCEV *>::const_iterator const_iterator; 124572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman iterator begin() { return RegSequence.begin(); } 125572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman iterator end() { return RegSequence.end(); } 126572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const_iterator begin() const { return RegSequence.begin(); } 127572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const_iterator end() const { return RegSequence.end(); } 128572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 129572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 130572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 131572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 132572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 133572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanRegUseTracker::CountRegister(const SCEV *Reg, size_t LUIdx) { 134572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<RegUsesTy::iterator, bool> Pair = 135572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.insert(std::make_pair(Reg, RegSortData())); 136572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegSortData &RSD = Pair.first->second; 137572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Pair.second) 138572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegSequence.push_back(Reg); 139572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RSD.UsedByIndices.resize(std::max(RSD.UsedByIndices.size(), LUIdx + 1)); 140572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RSD.UsedByIndices.set(LUIdx); 141572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 142572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 143572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool 144572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanRegUseTracker::isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const { 145572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!RegUses.count(Reg)) return false; 146572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallBitVector &UsedByIndices = 147572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.find(Reg)->second.UsedByIndices; 148572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int i = UsedByIndices.find_first(); 149572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (i == -1) return false; 150572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if ((size_t)i != LUIdx) return true; 151572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return UsedByIndices.find_next(i) != -1; 152572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 153572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 154572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanconst SmallBitVector &RegUseTracker::getUsedByIndices(const SCEV *Reg) const { 155572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUsesTy::const_iterator I = RegUses.find(Reg); 156572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(I != RegUses.end() && "Unknown register!"); 157572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return I->second.UsedByIndices; 158572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 159572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 160572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid RegUseTracker::clear() { 161572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.clear(); 162572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegSequence.clear(); 163572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 164572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 165572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 166572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 167572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// Formula - This class holds information that describes a formula for 168572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// computing satisfying a use. It may include broken-out immediates and scaled 169572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// registers. 170572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstruct Formula { 171572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// AM - This is used to represent complex addressing, as well as other kinds 172572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// of interesting uses. 173572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TargetLowering::AddrMode AM; 174572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 175572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// BaseRegs - The list of "base" registers for this use. When this is 176572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// non-empty, AM.HasBaseReg should be set to true. 177572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 2> BaseRegs; 178572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 179572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// ScaledReg - The 'scaled' register for this use. This should be non-null 180572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// when AM.Scale is not zero. 181572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *ScaledReg; 182572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 183572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula() : ScaledReg(0) {} 184572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 185572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void InitialMatch(const SCEV *S, Loop *L, 186572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT); 187572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 188572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned getNumRegs() const; 189572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *getType() const; 190572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 191572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool referencesReg(const SCEV *S) const; 192572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool hasRegsUsedByUsesOtherThan(size_t LUIdx, 193572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const RegUseTracker &RegUses) const; 194572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 195572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 196572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 197572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 198572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 199572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 200572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2013f46a3abeedba8d517b4182de34c821d752db058Dan Gohman/// DoInitialMatch - Recursion helper for InitialMatch. 202572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic void DoInitialMatch(const SCEV *S, Loop *L, 203572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<const SCEV *> &Good, 204572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<const SCEV *> &Bad, 205572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT) { 206572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Collect expressions which properly dominate the loop header. 207572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (S->properlyDominates(L->getHeader(), &DT)) { 208572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Good.push_back(S); 209572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 210572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 211d1d6b5cce260808deeac0227b00f6f81a20b2c6fEvan Cheng 212572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Look at add operands. 213572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) { 214572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end(); 215572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I != E; ++I) 216572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DoInitialMatch(*I, L, Good, Bad, SE, DT); 217572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 218572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 219169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman 220572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Look at addrec operands. 221572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) 222572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!AR->getStart()->isZero()) { 223572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DoInitialMatch(AR->getStart(), L, Good, Bad, SE, DT); 224572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DoInitialMatch(SE.getAddRecExpr(SE.getIntegerSCEV(0, AR->getType()), 225572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AR->getStepRecurrence(SE), 226572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AR->getLoop()), 227572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman L, Good, Bad, SE, DT); 228572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 2297979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 2302d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman 231572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Handle a multiplication by -1 (negation) if it didn't fold. 232572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) 233572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Mul->getOperand(0)->isAllOnesValue()) { 234572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end()); 235572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *NewMul = SE.getMulExpr(Ops); 236572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 237572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> MyGood; 238572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> MyBad; 239572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DoInitialMatch(NewMul, L, MyGood, MyBad, SE, DT); 240572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *NegOne = SE.getSCEV(ConstantInt::getAllOnesValue( 241572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getEffectiveSCEVType(NewMul->getType()))); 242572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = MyGood.begin(), 243572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = MyGood.end(); I != E; ++I) 244572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Good.push_back(SE.getMulExpr(NegOne, *I)); 245572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = MyBad.begin(), 246572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = MyBad.end(); I != E; ++I) 247572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Bad.push_back(SE.getMulExpr(NegOne, *I)); 248572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 2497979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 250eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 251572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ok, we can't do anything interesting. Just stuff the whole thing into a 252572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // register and hope for the best. 253572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Bad.push_back(S); 254a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 255844731a7f1909f55935e3514c9e713a62d67662eDan Gohman 256572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// InitialMatch - Incorporate loop-variant parts of S into this Formula, 257572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// attempting to keep all loop-invariant and loop-computable values in a 258572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// single base register. 259572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Formula::InitialMatch(const SCEV *S, Loop *L, 260572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT) { 261572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> Good; 262572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> Bad; 263572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DoInitialMatch(S, L, Good, Bad, SE, DT); 264572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Good.empty()) { 265e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman const SCEV *Sum = SE.getAddExpr(Good); 266e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman if (!Sum->isZero()) 267e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman BaseRegs.push_back(Sum); 268572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.HasBaseReg = true; 269572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 270572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Bad.empty()) { 271e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman const SCEV *Sum = SE.getAddExpr(Bad); 272e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman if (!Sum->isZero()) 273e60bb15982dc40517e078c3858fdc0716d43abb5Dan Gohman BaseRegs.push_back(Sum); 274572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.HasBaseReg = true; 275572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 276572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 277eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 278572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// getNumRegs - Return the total number of register operands used by this 279572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// formula. This does not include register uses implied by non-constant 280572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// addrec strides. 281572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanunsigned Formula::getNumRegs() const { 282572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return !!ScaledReg + BaseRegs.size(); 283a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 28456a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 285572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// getType - Return the type of this formula, if it has one, or null 286572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// otherwise. This type is meaningless except for the bit size. 287572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanconst Type *Formula::getType() const { 288572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return !BaseRegs.empty() ? BaseRegs.front()->getType() : 289572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScaledReg ? ScaledReg->getType() : 290572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseGV ? AM.BaseGV->getType() : 291572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 0; 292572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 29356a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 294572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// referencesReg - Test if this formula references the given register. 295572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool Formula::referencesReg(const SCEV *S) const { 296572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return S == ScaledReg || 297572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::find(BaseRegs.begin(), BaseRegs.end(), S) != BaseRegs.end(); 298572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 299eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 300572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// hasRegsUsedByUsesOtherThan - Test whether this formula uses registers 301572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// which are used by uses other than the use with the given index. 302572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool Formula::hasRegsUsedByUsesOtherThan(size_t LUIdx, 303572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const RegUseTracker &RegUses) const { 304572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ScaledReg) 305572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (RegUses.isRegUsedByUsesOtherThan(ScaledReg, LUIdx)) 306572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 307572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(), 308572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = BaseRegs.end(); I != E; ++I) 309572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (RegUses.isRegUsedByUsesOtherThan(*I, LUIdx)) 310572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 311572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 312572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 313572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 314572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Formula::print(raw_ostream &OS) const { 315572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool First = true; 316572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.BaseGV) { 317572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << " + "; else First = false; 318572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WriteAsOperand(OS, AM.BaseGV, /*PrintType=*/false); 319572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 320572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.BaseOffs != 0) { 321572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << " + "; else First = false; 322572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << AM.BaseOffs; 323572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 324572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(), 325572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = BaseRegs.end(); I != E; ++I) { 326572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << " + "; else First = false; 327572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "reg(" << **I << ')'; 328572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 329572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.Scale != 0) { 330572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << " + "; else First = false; 331572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << AM.Scale << "*reg("; 332572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ScaledReg) 333572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << *ScaledReg; 334572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 335572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "<unknown>"; 336572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ')'; 337572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 338572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 339572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 340572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Formula::dump() const { 341572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 342572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 343572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 344aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// isAddRecSExtable - Return true if the given addrec can be sign-extended 345aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// without changing its value. 346aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohmanstatic bool isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) { 347aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman const Type *WideTy = 348aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman IntegerType::get(SE.getContext(), 349aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman SE.getTypeSizeInBits(AR->getType()) + 1); 350aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman return isa<SCEVAddRecExpr>(SE.getSignExtendExpr(AR, WideTy)); 351aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman} 352aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman 353aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// isAddSExtable - Return true if the given add can be sign-extended 354aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// without changing its value. 355aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohmanstatic bool isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) { 356aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman const Type *WideTy = 357aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman IntegerType::get(SE.getContext(), 358aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman SE.getTypeSizeInBits(A->getType()) + 1); 359aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman return isa<SCEVAddExpr>(SE.getSignExtendExpr(A, WideTy)); 360aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman} 361aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman 362aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// isMulSExtable - Return true if the given add can be sign-extended 363aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman/// without changing its value. 364aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohmanstatic bool isMulSExtable(const SCEVMulExpr *A, ScalarEvolution &SE) { 365aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman const Type *WideTy = 366aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman IntegerType::get(SE.getContext(), 367aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman SE.getTypeSizeInBits(A->getType()) + 1); 368aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman return isa<SCEVMulExpr>(SE.getSignExtendExpr(A, WideTy)); 369aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman} 370aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman 371f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// getExactSDiv - Return an expression for LHS /s RHS, if it can be determined 372f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// and if the remainder is known to be zero, or null otherwise. If 373f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// IgnoreSignificantBits is true, expressions like (X * Y) /s Y are simplified 374f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// to Y, ignoring that the multiplication may overflow, which is useful when 375f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// the result will be used in a context where the most significant bits are 376f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman/// ignored. 377f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohmanstatic const SCEV *getExactSDiv(const SCEV *LHS, const SCEV *RHS, 378f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman ScalarEvolution &SE, 379f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman bool IgnoreSignificantBits = false) { 380572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Handle the trivial case, which works for any SCEV type. 381572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LHS == RHS) 382572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return SE.getIntegerSCEV(1, LHS->getType()); 383572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 384572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Handle x /s -1 as x * -1, to give ScalarEvolution a chance to do some 385572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // folding. 386572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (RHS->isAllOnesValue()) 387572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return SE.getMulExpr(LHS, RHS); 388572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 389572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for a division of a constant by a constant. 390572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(LHS)) { 391572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEVConstant *RC = dyn_cast<SCEVConstant>(RHS); 392572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!RC) 393572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return 0; 394572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (C->getValue()->getValue().srem(RC->getValue()->getValue()) != 0) 395572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return 0; 396572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return SE.getConstant(C->getValue()->getValue() 397572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman .sdiv(RC->getValue()->getValue())); 398572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 399572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 400aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman // Distribute the sdiv over addrec operands, if the addrec doesn't overflow. 401572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(LHS)) { 402aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (IgnoreSignificantBits || isAddRecSExtable(AR, SE)) { 403f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman const SCEV *Start = getExactSDiv(AR->getStart(), RHS, SE, 404f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman IgnoreSignificantBits); 405aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (!Start) return 0; 406f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, 407f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman IgnoreSignificantBits); 408aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (!Step) return 0; 409aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman return SE.getAddRecExpr(Start, Step, AR->getLoop()); 410aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman } 411572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 412572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 413aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman // Distribute the sdiv over add operands, if the add doesn't overflow. 414572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(LHS)) { 415aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (IgnoreSignificantBits || isAddSExtable(Add, SE)) { 416aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman SmallVector<const SCEV *, 8> Ops; 417aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end(); 418aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman I != E; ++I) { 419f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman const SCEV *Op = getExactSDiv(*I, RHS, SE, 420f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman IgnoreSignificantBits); 421aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (!Op) return 0; 422aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman Ops.push_back(Op); 423aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman } 424aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman return SE.getAddExpr(Ops); 425572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 426572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 427572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 428572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for a multiply operand that we can pull RHS out of. 429572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) 430aae01f17a639f863e73dcadd80ad690fdc37b468Dan Gohman if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) { 431572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> Ops; 432572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Found = false; 433572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SCEVMulExpr::op_iterator I = Mul->op_begin(), E = Mul->op_end(); 434572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I != E; ++I) { 435572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Found) 436f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman if (const SCEV *Q = getExactSDiv(*I, RHS, SE, 437f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman IgnoreSignificantBits)) { 438572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(Q); 439572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Found = true; 440572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 441572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 442572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(*I); 443a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 444572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Found ? SE.getMulExpr(Ops) : 0; 445572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 446a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 447572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Otherwise we don't know. 448572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return 0; 449572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 450572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 451572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// ExtractImmediate - If S involves the addition of a constant integer value, 452572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// return that integer value, and mutate S to point to a new SCEV with that 453572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// value excluded. 454572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) { 455572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(S)) { 456572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (C->getValue()->getValue().getMinSignedBits() <= 64) { 457572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getIntegerSCEV(0, C->getType()); 458572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return C->getValue()->getSExtValue(); 459572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 460572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) { 461572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end()); 462572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Result = ExtractImmediate(NewOps.front(), SE); 463572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getAddExpr(NewOps); 464572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Result; 465572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) { 466572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end()); 467572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Result = ExtractImmediate(NewOps.front(), SE); 468572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getAddRecExpr(NewOps, AR->getLoop()); 469572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Result; 47021e7722868378f67974e648ab21d0e3c69a0e379Dan Gohman } 471572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return 0; 472572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 473572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 474572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// ExtractSymbol - If S involves the addition of a GlobalValue address, 475572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// return that symbol, and mutate S to point to a new SCEV with that 476572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// value excluded. 477572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) { 478572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) { 479572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (GlobalValue *GV = dyn_cast<GlobalValue>(U->getValue())) { 480572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getIntegerSCEV(0, GV->getType()); 481572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return GV; 482572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 483572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) { 484572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end()); 485572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GlobalValue *Result = ExtractSymbol(NewOps.back(), SE); 486572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getAddExpr(NewOps); 487572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Result; 488572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) { 489572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end()); 490572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GlobalValue *Result = ExtractSymbol(NewOps.front(), SE); 491572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getAddRecExpr(NewOps, AR->getLoop()); 492572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Result; 493572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 494572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return 0; 495169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman} 496169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman 4977979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// isAddressUse - Returns true if the specified instruction is using the 4987979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// specified value as an address. 4997979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohmanstatic bool isAddressUse(Instruction *Inst, Value *OperandVal) { 5007979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman bool isAddress = isa<LoadInst>(Inst); 5017979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) { 5027979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (SI->getOperand(1) == OperandVal) 5037979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman isAddress = true; 5047979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) { 5057979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Addressing modes can also be folded into prefetches and a variety 5067979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // of intrinsics. 5077979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman switch (II->getIntrinsicID()) { 5087979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman default: break; 5097979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::prefetch: 5107979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_loadu_dq: 5117979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_loadu_pd: 5127979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse_loadu_ps: 5137979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse_storeu_ps: 5147979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storeu_pd: 5157979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storeu_dq: 5167979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storel_dq: 5177979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (II->getOperand(1) == OperandVal) 5187979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman isAddress = true; 5197979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman break; 5207979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 5217979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 5227979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return isAddress; 523169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman} 524169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman 5257979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// getAccessType - Return the type of the memory being accessed. 5267979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohmanstatic const Type *getAccessType(const Instruction *Inst) { 5277979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman const Type *AccessTy = Inst->getType(); 5287979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (const StoreInst *SI = dyn_cast<StoreInst>(Inst)) 5297979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman AccessTy = SI->getOperand(0)->getType(); 5307979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman else if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) { 5317979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Addressing modes can also be folded into prefetches and a variety 5327979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // of intrinsics. 5337979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman switch (II->getIntrinsicID()) { 5347979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman default: break; 5357979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse_storeu_ps: 5367979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storeu_pd: 5377979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storeu_dq: 5387979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman case Intrinsic::x86_sse2_storel_dq: 5397979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman AccessTy = II->getOperand(1)->getType(); 5407979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman break; 5417979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 5427979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 543572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 544572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // All pointers have the same requirements, so canonicalize them to an 545572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // arbitrary pointer type to minimize variation. 546572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const PointerType *PTy = dyn_cast<PointerType>(AccessTy)) 547572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AccessTy = PointerType::get(IntegerType::get(PTy->getContext(), 1), 548572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman PTy->getAddressSpace()); 549572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 5507979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return AccessTy; 551a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 55281db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 553572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// DeleteTriviallyDeadInstructions - If any of the instructions is the 554572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// specified set are trivially dead, delete them and see if this makes any of 555572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// their operands subsequently dead. 556572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic bool 557572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanDeleteTriviallyDeadInstructions(SmallVectorImpl<WeakVH> &DeadInsts) { 558572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Changed = false; 5592f09f519542202b8af227c2a524f8fe82378a934Dan Gohman 560572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman while (!DeadInsts.empty()) { 561572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *I = dyn_cast_or_null<Instruction>(DeadInsts.pop_back_val()); 56281db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 563572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (I == 0 || !isInstructionTriviallyDead(I)) 564572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 565221fc3c6d69bd3854e9121f51e3283492c222ab7Chris Lattner 566572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI) 567572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Instruction *U = dyn_cast<Instruction>(*OI)) { 568572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman *OI = 0; 569572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (U->use_empty()) 570572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DeadInsts.push_back(U); 571572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 572221fc3c6d69bd3854e9121f51e3283492c222ab7Chris Lattner 573572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I->eraseFromParent(); 574572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed = true; 575572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 5762f09f519542202b8af227c2a524f8fe82378a934Dan Gohman 577572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Changed; 5787979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman} 5792f46bb8178e30e3b845859a44b57c048db06ef84Dale Johannesen 580572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 5812f09f519542202b8af227c2a524f8fe82378a934Dan Gohman 582572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// Cost - This class is used to measure and compare candidate formulae. 583572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass Cost { 584572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// TODO: Some of these could be merged. Also, a lexical ordering 585572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// isn't always optimal. 586572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned NumRegs; 587572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned AddRecCost; 588572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned NumIVMuls; 589572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned NumBaseAdds; 590572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned ImmCost; 591572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned SetupCost; 592572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 593572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 594572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost() 595572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman : NumRegs(0), AddRecCost(0), NumIVMuls(0), NumBaseAdds(0), ImmCost(0), 596572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SetupCost(0) {} 597572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 598572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned getNumRegs() const { return NumRegs; } 599572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 600572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool operator<(const Cost &Other) const; 601572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 602572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void Loose(); 603572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 604572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void RateFormula(const Formula &F, 605572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 606572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const DenseSet<const SCEV *> &VisitedRegs, 607572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Loop *L, 608572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallVectorImpl<int64_t> &Offsets, 609572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT); 610572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 611572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 612572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 613572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 614572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanprivate: 615572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void RateRegister(const SCEV *Reg, 616572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 617572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Loop *L, 618572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT); 6199214b82c5446791b280821bbd892dca633130f80Dan Gohman void RatePrimaryRegister(const SCEV *Reg, 6209214b82c5446791b280821bbd892dca633130f80Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 6219214b82c5446791b280821bbd892dca633130f80Dan Gohman const Loop *L, 6229214b82c5446791b280821bbd892dca633130f80Dan Gohman ScalarEvolution &SE, DominatorTree &DT); 623572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 6240e0014d0499d6ec6402e07b71cf24af992a9d297Evan Cheng 625572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 6267979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 627572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// RateRegister - Tally up interesting quantities from the given register. 628572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Cost::RateRegister(const SCEV *Reg, 629572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 630572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Loop *L, 631572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT) { 6329214b82c5446791b280821bbd892dca633130f80Dan Gohman if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Reg)) { 6339214b82c5446791b280821bbd892dca633130f80Dan Gohman if (AR->getLoop() == L) 6349214b82c5446791b280821bbd892dca633130f80Dan Gohman AddRecCost += 1; /// TODO: This should be a function of the stride. 6359214b82c5446791b280821bbd892dca633130f80Dan Gohman 6369214b82c5446791b280821bbd892dca633130f80Dan Gohman // If this is an addrec for a loop that's already been visited by LSR, 6379214b82c5446791b280821bbd892dca633130f80Dan Gohman // don't second-guess its addrec phi nodes. LSR isn't currently smart 6389214b82c5446791b280821bbd892dca633130f80Dan Gohman // enough to reason about more than one loop at a time. Consider these 6399214b82c5446791b280821bbd892dca633130f80Dan Gohman // registers free and leave them alone. 6409214b82c5446791b280821bbd892dca633130f80Dan Gohman else if (L->contains(AR->getLoop()) || 6419214b82c5446791b280821bbd892dca633130f80Dan Gohman (!AR->getLoop()->contains(L) && 6429214b82c5446791b280821bbd892dca633130f80Dan Gohman DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))) { 6439214b82c5446791b280821bbd892dca633130f80Dan Gohman for (BasicBlock::iterator I = AR->getLoop()->getHeader()->begin(); 6449214b82c5446791b280821bbd892dca633130f80Dan Gohman PHINode *PN = dyn_cast<PHINode>(I); ++I) 6459214b82c5446791b280821bbd892dca633130f80Dan Gohman if (SE.isSCEVable(PN->getType()) && 6469214b82c5446791b280821bbd892dca633130f80Dan Gohman (SE.getEffectiveSCEVType(PN->getType()) == 6479214b82c5446791b280821bbd892dca633130f80Dan Gohman SE.getEffectiveSCEVType(AR->getType())) && 6489214b82c5446791b280821bbd892dca633130f80Dan Gohman SE.getSCEV(PN) == AR) 6499214b82c5446791b280821bbd892dca633130f80Dan Gohman return; 6509214b82c5446791b280821bbd892dca633130f80Dan Gohman 6519214b82c5446791b280821bbd892dca633130f80Dan Gohman // If this isn't one of the addrecs that the loop already has, it 6529214b82c5446791b280821bbd892dca633130f80Dan Gohman // would require a costly new phi and add. TODO: This isn't 6539214b82c5446791b280821bbd892dca633130f80Dan Gohman // precisely modeled right now. 6549214b82c5446791b280821bbd892dca633130f80Dan Gohman ++NumBaseAdds; 6559214b82c5446791b280821bbd892dca633130f80Dan Gohman if (!Regs.count(AR->getStart())) 656572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RateRegister(AR->getStart(), Regs, L, SE, DT); 6579214b82c5446791b280821bbd892dca633130f80Dan Gohman } 6587979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 6599214b82c5446791b280821bbd892dca633130f80Dan Gohman // Add the step value register, if it needs one. 6609214b82c5446791b280821bbd892dca633130f80Dan Gohman // TODO: The non-affine case isn't precisely modeled here. 6619214b82c5446791b280821bbd892dca633130f80Dan Gohman if (!AR->isAffine() || !isa<SCEVConstant>(AR->getOperand(1))) 6629214b82c5446791b280821bbd892dca633130f80Dan Gohman if (!Regs.count(AR->getStart())) 663572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RateRegister(AR->getOperand(1), Regs, L, SE, DT); 664a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 6659214b82c5446791b280821bbd892dca633130f80Dan Gohman ++NumRegs; 6669214b82c5446791b280821bbd892dca633130f80Dan Gohman 6679214b82c5446791b280821bbd892dca633130f80Dan Gohman // Rough heuristic; favor registers which don't require extra setup 6689214b82c5446791b280821bbd892dca633130f80Dan Gohman // instructions in the preheader. 6699214b82c5446791b280821bbd892dca633130f80Dan Gohman if (!isa<SCEVUnknown>(Reg) && 6709214b82c5446791b280821bbd892dca633130f80Dan Gohman !isa<SCEVConstant>(Reg) && 6719214b82c5446791b280821bbd892dca633130f80Dan Gohman !(isa<SCEVAddRecExpr>(Reg) && 6729214b82c5446791b280821bbd892dca633130f80Dan Gohman (isa<SCEVUnknown>(cast<SCEVAddRecExpr>(Reg)->getStart()) || 6739214b82c5446791b280821bbd892dca633130f80Dan Gohman isa<SCEVConstant>(cast<SCEVAddRecExpr>(Reg)->getStart())))) 6749214b82c5446791b280821bbd892dca633130f80Dan Gohman ++SetupCost; 6759214b82c5446791b280821bbd892dca633130f80Dan Gohman} 6769214b82c5446791b280821bbd892dca633130f80Dan Gohman 6779214b82c5446791b280821bbd892dca633130f80Dan Gohman/// RatePrimaryRegister - Record this register in the set. If we haven't seen it 6789214b82c5446791b280821bbd892dca633130f80Dan Gohman/// before, rate it. 6799214b82c5446791b280821bbd892dca633130f80Dan Gohmanvoid Cost::RatePrimaryRegister(const SCEV *Reg, 6807fca2294dad873aa7873e338ec3fcc4db49ea074Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 6817fca2294dad873aa7873e338ec3fcc4db49ea074Dan Gohman const Loop *L, 6827fca2294dad873aa7873e338ec3fcc4db49ea074Dan Gohman ScalarEvolution &SE, DominatorTree &DT) { 6839214b82c5446791b280821bbd892dca633130f80Dan Gohman if (Regs.insert(Reg)) 6849214b82c5446791b280821bbd892dca633130f80Dan Gohman RateRegister(Reg, Regs, L, SE, DT); 6857979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman} 6867979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 687572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Cost::RateFormula(const Formula &F, 688572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> &Regs, 689572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const DenseSet<const SCEV *> &VisitedRegs, 690572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Loop *L, 691572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallVectorImpl<int64_t> &Offsets, 692572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE, DominatorTree &DT) { 693572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Tally up the registers. 694572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEV *ScaledReg = F.ScaledReg) { 695572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (VisitedRegs.count(ScaledReg)) { 696572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Loose(); 697572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 6987979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 6999214b82c5446791b280821bbd892dca633130f80Dan Gohman RatePrimaryRegister(ScaledReg, Regs, L, SE, DT); 7003821e478a574b80d7f8bc96fa42731291cfccfe8Chris Lattner } 701572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(), 702572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = F.BaseRegs.end(); I != E; ++I) { 703572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BaseReg = *I; 704572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (VisitedRegs.count(BaseReg)) { 705572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Loose(); 706572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 7077979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 7089214b82c5446791b280821bbd892dca633130f80Dan Gohman RatePrimaryRegister(BaseReg, Regs, L, SE, DT); 7092d1be87ee40a4a0241d94448173879d9df2bc5b3Dan Gohman 710572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NumIVMuls += isa<SCEVMulExpr>(BaseReg) && 711572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BaseReg->hasComputableLoopEvolution(L); 712572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 713572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 714572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.BaseRegs.size() > 1) 715572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NumBaseAdds += F.BaseRegs.size() - 1; 716572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 717572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Tally up the non-zero immediates. 718572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(), 719572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Offsets.end(); I != E; ++I) { 720572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offset = (uint64_t)*I + F.AM.BaseOffs; 721572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.AM.BaseGV) 722572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImmCost += 64; // Handle symbolic values conservatively. 723572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: This should probably be the pointer size. 724572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (Offset != 0) 725572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImmCost += APInt(64, Offset, true).getMinSignedBits(); 726572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 727169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman} 728169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman 729572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// Loose - Set this cost to a loosing value. 730572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Cost::Loose() { 731572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NumRegs = ~0u; 732572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AddRecCost = ~0u; 733572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NumIVMuls = ~0u; 734572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NumBaseAdds = ~0u; 735572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImmCost = ~0u; 736572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SetupCost = ~0u; 737572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 73856a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 739572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// operator< - Choose the lower cost. 740572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool Cost::operator<(const Cost &Other) const { 741572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NumRegs != Other.NumRegs) 742572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return NumRegs < Other.NumRegs; 743572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AddRecCost != Other.AddRecCost) 744572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return AddRecCost < Other.AddRecCost; 745572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NumIVMuls != Other.NumIVMuls) 746572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return NumIVMuls < Other.NumIVMuls; 747572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NumBaseAdds != Other.NumBaseAdds) 748572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return NumBaseAdds < Other.NumBaseAdds; 749572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ImmCost != Other.ImmCost) 750572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return ImmCost < Other.ImmCost; 751572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SetupCost != Other.SetupCost) 752572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return SetupCost < Other.SetupCost; 753572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 754572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 7557979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 756572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Cost::print(raw_ostream &OS) const { 757572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << NumRegs << " reg" << (NumRegs == 1 ? "" : "s"); 758572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AddRecCost != 0) 759572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", with addrec cost " << AddRecCost; 760572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NumIVMuls != 0) 761572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", plus " << NumIVMuls << " IV mul" << (NumIVMuls == 1 ? "" : "s"); 762572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NumBaseAdds != 0) 763572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", plus " << NumBaseAdds << " base add" 764572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman << (NumBaseAdds == 1 ? "" : "s"); 765572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ImmCost != 0) 766572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", plus " << ImmCost << " imm cost"; 767572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SetupCost != 0) 768572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", plus " << SetupCost << " setup cost"; 769572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 77044b807e3c0b358d75f153066b2b7556710d9c7ccChris Lattner 771572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid Cost::dump() const { 772572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 77344b807e3c0b358d75f153066b2b7556710d9c7ccChris Lattner} 77444b807e3c0b358d75f153066b2b7556710d9c7ccChris Lattner 775572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 77644b807e3c0b358d75f153066b2b7556710d9c7ccChris Lattner 777572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// LSRFixup - An operand value in an instruction which is to be replaced 778572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// with some equivalent, possibly strength-reduced, replacement. 779572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstruct LSRFixup { 780572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// UserInst - The instruction which will be updated. 781572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *UserInst; 78256a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 783572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// OperandValToReplace - The operand of the instruction which will 784572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// be replaced. The operand may be used more than once; every instance 785572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// will be replaced. 786572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *OperandValToReplace; 78756a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 788448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman /// PostIncLoops - If this user is to use the post-incremented value of an 789572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// induction variable, this variable is non-null and holds the loop 790572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// associated with the induction variable. 791448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman PostIncLoopSet PostIncLoops; 79226d91f16464db56283087176a73981048331dd2dChris Lattner 793572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// LUIdx - The index of the LSRUse describing the expression which 794572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// this fixup needs, minus an offset (below). 795572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx; 79626d91f16464db56283087176a73981048331dd2dChris Lattner 797572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Offset - A constant offset to be added to the LSRUse expression. 798572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// This allows multiple fixups to share the same LSRUse with different 799572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// offsets, for example in an unrolled loop. 800572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offset; 801572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 802448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman bool isUseFullyOutsideLoop(const Loop *L) const; 803448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman 804572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRFixup(); 805572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 806572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 807572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 808572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 809572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 810572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 811572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 812572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRFixup::LSRFixup() 813448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman : UserInst(0), OperandValToReplace(0), 814572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LUIdx(~size_t(0)), Offset(0) {} 815572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 816448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman/// isUseFullyOutsideLoop - Test whether this fixup always uses its 817448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman/// value outside of the given loop. 818448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohmanbool LSRFixup::isUseFullyOutsideLoop(const Loop *L) const { 819448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman // PHI nodes use their value in their incoming blocks. 820448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (const PHINode *PN = dyn_cast<PHINode>(UserInst)) { 821448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 822448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (PN->getIncomingValue(i) == OperandValToReplace && 823448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman L->contains(PN->getIncomingBlock(i))) 824448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman return false; 825448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman return true; 826448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman } 827448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman 828448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman return !L->contains(UserInst); 829448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman} 830448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman 831572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRFixup::print(raw_ostream &OS) const { 832572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "UserInst="; 833572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Store is common and interesting enough to be worth special-casing. 834572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (StoreInst *Store = dyn_cast<StoreInst>(UserInst)) { 835572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "store "; 836572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WriteAsOperand(OS, Store->getOperand(0), /*PrintType=*/false); 837572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (UserInst->getType()->isVoidTy()) 838572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << UserInst->getOpcodeName(); 839572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 840572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WriteAsOperand(OS, UserInst, /*PrintType=*/false); 841572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 842572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", OperandValToReplace="; 843572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WriteAsOperand(OS, OperandValToReplace, /*PrintType=*/false); 844572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 845448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman for (PostIncLoopSet::const_iterator I = PostIncLoops.begin(), 846448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman E = PostIncLoops.end(); I != E; ++I) { 847572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", PostIncLoop="; 848448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman WriteAsOperand(OS, (*I)->getHeader(), /*PrintType=*/false); 849934520a747722ecf94f35768e5b88eeaf44c3b24Chris Lattner } 850a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 851572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LUIdx != ~size_t(0)) 852572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", LUIdx=" << LUIdx; 853572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 854572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Offset != 0) 855572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", Offset=" << Offset; 8567979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman} 8577979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 858572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRFixup::dump() const { 859572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 8607979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman} 8617979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 862572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 863a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 864572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// UniquifierDenseMapInfo - A DenseMapInfo implementation for holding 865572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// DenseMaps and DenseSets of sorted SmallVectors of const SCEV*. 866572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstruct UniquifierDenseMapInfo { 867572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman static SmallVector<const SCEV *, 2> getEmptyKey() { 868572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 2> V; 869572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman V.push_back(reinterpret_cast<const SCEV *>(-1)); 870572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return V; 871572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 872934520a747722ecf94f35768e5b88eeaf44c3b24Chris Lattner 873572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman static SmallVector<const SCEV *, 2> getTombstoneKey() { 874572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 2> V; 875572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman V.push_back(reinterpret_cast<const SCEV *>(-2)); 876572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return V; 877572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 878572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 879572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman static unsigned getHashValue(const SmallVector<const SCEV *, 2> &V) { 880572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned Result = 0; 881572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = V.begin(), 882572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = V.end(); I != E; ++I) 883572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Result ^= DenseMapInfo<const SCEV *>::getHashValue(*I); 8847979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Result; 885a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 886a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 887572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman static bool isEqual(const SmallVector<const SCEV *, 2> &LHS, 888572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallVector<const SCEV *, 2> &RHS) { 889572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return LHS == RHS; 890572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 891572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 892572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 893572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// LSRUse - This class holds the state that LSR keeps for each use in 894572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// IVUsers, as well as uses invented by LSR itself. It includes information 895572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// about what kinds of things can be folded into the user, information about 896572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the user itself, and information about how the use may be satisfied. 897572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// TODO: Represent multiple users of the same expression in common? 898572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass LSRUse { 899572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseSet<SmallVector<const SCEV *, 2>, UniquifierDenseMapInfo> Uniquifier; 900572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 901572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 902572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// KindType - An enum for a kind of use, indicating what types of 903572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// scaled and immediate operands it might support. 904572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman enum KindType { 905572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Basic, ///< A normal use, with no folding. 906572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Special, ///< A special case of basic, allowing -1 scales. 907572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Address, ///< An address use; folding according to TargetLowering 908572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpZero ///< An equality icmp with both operands folded into one. 909572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: Add a generic icmp too? 910572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman }; 9117979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 912572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman KindType Kind; 913572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *AccessTy; 9147979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 915572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<int64_t, 8> Offsets; 916572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t MinOffset; 917572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t MaxOffset; 918203af58aea3ae341d38e5c2c5b390b0c31d25557Dale Johannesen 919572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// AllFixupsOutsideLoop - This records whether all of the fixups using this 920572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// LSRUse are outside of the loop, in which case some special-case heuristics 921572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// may be used. 922572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool AllFixupsOutsideLoop; 9237979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 924572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Formulae - A list of ways to build a value that can satisfy this user. 925572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// After the list is populated, one of these is selected heuristically and 926572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// used to formulate a replacement for OperandValToReplace in UserInst. 927572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<Formula, 12> Formulae; 928589bf0865ccd10d36f406d622c0160be249343e1Dale Johannesen 929572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Regs - The set of register candidates used by all formulae in this LSRUse. 930572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 4> Regs; 931934520a747722ecf94f35768e5b88eeaf44c3b24Chris Lattner 932572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse(KindType K, const Type *T) : Kind(K), AccessTy(T), 933572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman MinOffset(INT64_MAX), 934572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman MaxOffset(INT64_MIN), 935572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AllFixupsOutsideLoop(true) {} 93656a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 937454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman bool InsertFormula(const Formula &F); 938572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 939572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void check() const; 940572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 941572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 942572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 943572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 944572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 945572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// InsertFormula - If the given formula has not yet been inserted, add it to 946572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the list, and return true. Return false otherwise. 947454d26dc43207ec537d843229db6f5e6a302e23dDan Gohmanbool LSRUse::InsertFormula(const Formula &F) { 948572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 2> Key = F.BaseRegs; 949572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) Key.push_back(F.ScaledReg); 950572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Unstable sort by host order ok, because this is only used for uniquifying. 951572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::sort(Key.begin(), Key.end()); 952572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 953572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Uniquifier.insert(Key).second) 954572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 955572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 956572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Using a register to hold the value of 0 is not profitable. 957572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert((!F.ScaledReg || !F.ScaledReg->isZero()) && 958572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "Zero allocated in a scaled register!"); 959572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#ifndef NDEBUG 960572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = 961572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) 962572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(!(*I)->isZero() && "Zero allocated in a base register!"); 963572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#endif 964572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 965572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Add the formula to the list. 966572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formulae.push_back(F); 96756a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 968572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Record registers now being used by this use. 969572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) Regs.insert(F.ScaledReg); 970572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); 971572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 972572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 973572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 974572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 975572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRUse::print(raw_ostream &OS) const { 976572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "LSR Use: Kind="; 977572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman switch (Kind) { 978572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case Basic: OS << "Basic"; break; 979572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case Special: OS << "Special"; break; 980572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case ICmpZero: OS << "ICmpZero"; break; 981572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case Address: 982572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "Address of "; 9831df9859c40492511b8aa4321eb76496005d3b75bDuncan Sands if (AccessTy->isPointerTy()) 984572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "pointer"; // the full pointer type could be really verbose 9857979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman else 986572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << *AccessTy; 9877979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 9881bbae0cbf212d0356f564d12e8f728be455bdc47Chris Lattner 989572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", Offsets={"; 990572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(), 991572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Offsets.end(); I != E; ++I) { 992572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << *I; 993572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (next(I) != E) 994572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ','; 995572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 996572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '}'; 997572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 998572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AllFixupsOutsideLoop) 999572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << ", all-fixups-outside-loop"; 10007979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman} 1001d6b62a572210aff965a55626cf36a68821838844Evan Cheng 1002572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRUse::dump() const { 1003572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 1004572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 100556a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 1006572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// isLegalUse - Test whether the use described by AM is "legal", meaning it can 1007572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// be completely folded into the user instruction at isel time. This includes 1008572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// address-mode folding and special icmp tricks. 1009572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic bool isLegalUse(const TargetLowering::AddrMode &AM, 1010572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy, 1011572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const TargetLowering *TLI) { 1012572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman switch (Kind) { 1013572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case LSRUse::Address: 1014572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If we have low-level target information, ask the target if it can 1015572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // completely fold this address. 1016572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (TLI) return TLI->isLegalAddressingMode(AM, AccessTy); 1017572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1018572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Otherwise, just guess that reg+reg addressing is legal. 1019572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return !AM.BaseGV && AM.BaseOffs == 0 && AM.Scale <= 1; 1020572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1021572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case LSRUse::ICmpZero: 1022572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // There's not even a target hook for querying whether it would be legal to 1023572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // fold a GV into an ICmp. 1024572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.BaseGV) 1025572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1026579633cd1006f6add1b022e9c2bc96f7f0e65777Chris Lattner 1027572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // ICmp only has two operands; don't allow more than two non-trivial parts. 1028572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.Scale != 0 && AM.HasBaseReg && AM.BaseOffs != 0) 1029572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 10301bbae0cbf212d0356f564d12e8f728be455bdc47Chris Lattner 1031572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // ICmp only supports no scale or a -1 scale, as we can "fold" a -1 scale by 1032572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // putting the scaled register in the other operand of the icmp. 1033572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.Scale != 0 && AM.Scale != -1) 10347979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return false; 103581db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 1036572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If we have low-level target information, ask the target if it can fold an 1037572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // integer immediate on an icmp. 1038572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AM.BaseOffs != 0) { 1039572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (TLI) return TLI->isLegalICmpImmediate(-AM.BaseOffs); 1040572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1041572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1042572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 10437979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return true; 104481db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 1045572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case LSRUse::Basic: 1046572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Only handle single-register values. 1047572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return !AM.BaseGV && AM.Scale == 0 && AM.BaseOffs == 0; 104881db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 1049572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman case LSRUse::Special: 1050572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Only handle -1 scales, or no scale. 1051572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return AM.Scale == 0 || AM.Scale == -1; 1052572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1053572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1054572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1055572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 105681db61a2e6d3c95a2738c3559a108e05e9d7a05aDan Gohman 1057572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic bool isLegalUse(TargetLowering::AddrMode AM, 1058572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t MinOffset, int64_t MaxOffset, 1059572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy, 1060572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const TargetLowering *TLI) { 1061572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for overflow. 1062572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (((int64_t)((uint64_t)AM.BaseOffs + MinOffset) > AM.BaseOffs) != 1063572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (MinOffset > 0)) 1064572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1065572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseOffs = (uint64_t)AM.BaseOffs + MinOffset; 1066572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (isLegalUse(AM, Kind, AccessTy, TLI)) { 1067572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseOffs = (uint64_t)AM.BaseOffs - MinOffset; 1068572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for overflow. 1069572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (((int64_t)((uint64_t)AM.BaseOffs + MaxOffset) > AM.BaseOffs) != 1070572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (MaxOffset > 0)) 10717979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return false; 1072572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseOffs = (uint64_t)AM.BaseOffs + MaxOffset; 1073572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return isLegalUse(AM, Kind, AccessTy, TLI); 10747979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 1075572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 10765f8ebaa5c0c216b7dbb16b781895e4af36bfa39aEvan Cheng} 10775f8ebaa5c0c216b7dbb16b781895e4af36bfa39aEvan Cheng 1078572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic bool isAlwaysFoldable(int64_t BaseOffs, 1079572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GlobalValue *BaseGV, 1080572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool HasBaseReg, 1081572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy, 1082454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman const TargetLowering *TLI) { 1083572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Fast-path: zero is always foldable. 1084572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (BaseOffs == 0 && !BaseGV) return true; 1085572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1086572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively, create an address with an immediate and a 1087572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // base and a scale. 1088572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TargetLowering::AddrMode AM; 1089572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseOffs = BaseOffs; 1090572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseGV = BaseGV; 1091572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.HasBaseReg = HasBaseReg; 1092572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1; 1093572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1094572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return isLegalUse(AM, Kind, AccessTy, TLI); 1095a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 1096a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1097572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic bool isAlwaysFoldable(const SCEV *S, 1098572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t MinOffset, int64_t MaxOffset, 1099572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool HasBaseReg, 1100572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy, 1101572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const TargetLowering *TLI, 1102572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE) { 1103572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Fast-path: zero is always foldable. 1104572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (S->isZero()) return true; 1105572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1106572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively, create an address with an immediate and a 1107572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // base and a scale. 1108572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t BaseOffs = ExtractImmediate(S, SE); 1109572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GlobalValue *BaseGV = ExtractSymbol(S, SE); 1110572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1111572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If there's anything else involved, it's not foldable. 1112572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!S->isZero()) return false; 1113572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1114572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Fast-path: zero is always foldable. 1115572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (BaseOffs == 0 && !BaseGV) return true; 1116572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1117572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively, create an address with an immediate and a 1118572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // base and a scale. 1119572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TargetLowering::AddrMode AM; 1120572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseOffs = BaseOffs; 1121572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.BaseGV = BaseGV; 1122572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.HasBaseReg = HasBaseReg; 1123572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1; 1124572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1125572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return isLegalUse(AM, MinOffset, MaxOffset, Kind, AccessTy, TLI); 1126572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 112756a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 1128572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// FormulaSorter - This class implements an ordering for formulae which sorts 1129572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the by their standalone cost. 1130572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass FormulaSorter { 1131572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// These two sets are kept empty, so that we compute standalone costs. 1132572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseSet<const SCEV *> VisitedRegs; 1133572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> Regs; 1134572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Loop *L; 1135572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse *LU; 1136572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE; 1137572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DominatorTree &DT; 1138572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1139572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 1140572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FormulaSorter(Loop *l, LSRUse &lu, ScalarEvolution &se, DominatorTree &dt) 1141572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman : L(l), LU(&lu), SE(se), DT(dt) {} 1142572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1143572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool operator()(const Formula &A, const Formula &B) { 1144572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost CostA; 1145572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CostA.RateFormula(A, Regs, VisitedRegs, L, LU->Offsets, SE, DT); 1146572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Regs.clear(); 1147572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost CostB; 1148572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CostB.RateFormula(B, Regs, VisitedRegs, L, LU->Offsets, SE, DT); 1149572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Regs.clear(); 1150572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return CostA < CostB; 1151572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1152572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 1153572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1154572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// LSRInstance - This class holds state for the main loop strength reduction 1155572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// logic. 1156572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass LSRInstance { 1157572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVUsers &IU; 1158572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE; 1159572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DominatorTree &DT; 1160e5f76877aee6f33964de105893f0ef338661ecadDan Gohman LoopInfo &LI; 1161572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const TargetLowering *const TLI; 1162572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Loop *const L; 1163572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Changed; 1164572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1165572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// IVIncInsertPos - This is the insert position that the current loop's 1166572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// induction variable increment should be placed. In simple loops, this is 1167572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// the latch block's terminator. But in more complicated cases, this is a 1168572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// position which will dominate all the in-loop post-increment users. 1169572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *IVIncInsertPos; 1170572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1171572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Factors - Interesting factors between use strides. 1172572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallSetVector<int64_t, 8> Factors; 1173572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1174572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Types - Interesting use types, to facilitate truncation reuse. 1175572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallSetVector<const Type *, 4> Types; 1176572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1177572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Fixups - The list of operands which are to be replaced. 1178572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<LSRFixup, 16> Fixups; 1179572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1180572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// Uses - The list of interesting uses. 1181572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<LSRUse, 16> Uses; 1182572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1183572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// RegUses - Track which uses use which register candidates. 1184572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUseTracker RegUses; 1185572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1186572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void OptimizeShadowIV(); 1187572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse); 1188572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpInst *OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse); 1189572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool OptimizeLoopTermCond(); 1190572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1191572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void CollectInterestingTypesAndFactors(); 1192572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void CollectFixupsAndInitialFormulae(); 1193572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1194572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRFixup &getNewFixup() { 1195572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Fixups.push_back(LSRFixup()); 1196572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Fixups.back(); 1197a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 119832e4c7c486084cdbed07925be4a0e9f3ab6caedeEvan Cheng 1199572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Support for sharing of LSRUses between LSRFixups. 1200572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef DenseMap<const SCEV *, size_t> UseMapTy; 1201572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UseMapTy UseMap; 1202572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1203572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, 1204572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy); 1205572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1206572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<size_t, int64_t> getUse(const SCEV *&Expr, 1207572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, 1208572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *AccessTy); 1209572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1210572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 1211454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx); 1212572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx); 1213572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void CountRegisters(const Formula &F, size_t LUIdx); 1214572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F); 1215572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1216572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void CollectLoopInvariantFixupsAndFormulae(); 1217572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1218572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base, 1219572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned Depth = 0); 1220572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base); 1221572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base); 1222572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base); 1223572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base); 1224572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base); 1225572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base); 1226572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateCrossUseConstantOffsets(); 1227572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void GenerateAllReuseFormulae(); 1228572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1229572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void FilterOutUndesirableDedicatedRegisters(); 1230572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void NarrowSearchSpaceUsingHeuristics(); 1231572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1232572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void SolveRecurse(SmallVectorImpl<const Formula *> &Solution, 1233572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost &SolutionCost, 1234572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<const Formula *> &Workspace, 1235572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Cost &CurCost, 1236572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallPtrSet<const SCEV *, 16> &CurRegs, 1237572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseSet<const SCEV *> &VisitedRegs) const; 1238572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void Solve(SmallVectorImpl<const Formula *> &Solution) const; 1239572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1240e5f76877aee6f33964de105893f0ef338661ecadDan Gohman BasicBlock::iterator 1241e5f76877aee6f33964de105893f0ef338661ecadDan Gohman HoistInsertPosition(BasicBlock::iterator IP, 1242e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const SmallVectorImpl<Instruction *> &Inputs) const; 1243e5f76877aee6f33964de105893f0ef338661ecadDan Gohman BasicBlock::iterator AdjustInsertPositionForExpand(BasicBlock::iterator IP, 1244e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const LSRFixup &LF, 1245e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const LSRUse &LU) const; 1246d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 1247572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *Expand(const LSRFixup &LF, 1248572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Formula &F, 1249454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman BasicBlock::iterator IP, 1250572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SCEVExpander &Rewriter, 1251454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman SmallVectorImpl<WeakVH> &DeadInsts) const; 12523a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman void RewriteForPHI(PHINode *PN, const LSRFixup &LF, 12533a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman const Formula &F, 12543a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman SCEVExpander &Rewriter, 12553a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman SmallVectorImpl<WeakVH> &DeadInsts, 12563a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman Pass *P) const; 1257572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void Rewrite(const LSRFixup &LF, 1258572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Formula &F, 1259572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SCEVExpander &Rewriter, 1260572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<WeakVH> &DeadInsts, 1261572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Pass *P) const; 1262572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void ImplementSolution(const SmallVectorImpl<const Formula *> &Solution, 1263572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Pass *P); 1264572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1265572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRInstance(const TargetLowering *tli, Loop *l, Pass *P); 1266572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1267572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool getChanged() const { return Changed; } 1268572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1269572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print_factors_and_types(raw_ostream &OS) const; 1270572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print_fixups(raw_ostream &OS) const; 1271572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print_uses(raw_ostream &OS) const; 1272572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 1273572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 1274572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 12757979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 1276a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 1277c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1278572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// OptimizeShadowIV - If IV is used in a int-to-float cast 12793f46a3abeedba8d517b4182de34c821d752db058Dan Gohman/// inside the loop then try to eliminate the cast operation. 1280572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::OptimizeShadowIV() { 1281572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); 1282572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) 1283572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 1284c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1285572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); 1286572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UI != E; /* empty */) { 1287572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVUsers::const_iterator CandidateUI = UI; 1288572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ++UI; 1289572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *ShadowUse = CandidateUI->getUser(); 1290572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *DestTy = NULL; 1291c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1292572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /* If shadow use is a int->float cast then insert a second IV 1293572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman to eliminate this cast. 1294c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1295572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (unsigned i = 0; i < n; ++i) 1296572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman foo((double)i); 1297c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1298572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman is transformed into 1299c17e0cf6c03a36f424fafe88497b5fdf351cd50aDan Gohman 1300572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman double d = 0.0; 1301572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (unsigned i = 0; i < n; ++i, ++d) 1302572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman foo(d); 1303572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman */ 1304572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->getUser())) 1305572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DestTy = UCast->getDestTy(); 1306572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->getUser())) 1307572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DestTy = SCast->getDestTy(); 1308572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!DestTy) continue; 13095792f51e12d9c8685399e9857799365854ab5bf6Evan Cheng 1310572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (TLI) { 1311572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If target does not support DestTy natively then do not apply 1312572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // this transformation. 1313572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman EVT DVT = TLI->getValueType(DestTy); 1314572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!TLI->isTypeLegal(DVT)) continue; 13157e79b3898ddd919170d367a516f51296017146c2Chris Lattner } 13167e79b3898ddd919170d367a516f51296017146c2Chris Lattner 1317572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0)); 1318572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!PH) continue; 1319572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (PH->getNumIncomingValues() != 2) continue; 1320a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1321572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *SrcTy = PH->getType(); 1322572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int Mantissa = DestTy->getFPMantissaWidth(); 1323572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Mantissa == -1) continue; 1324572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if ((int)SE.getTypeSizeInBits(SrcTy) > Mantissa) 1325572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 13262f46bb8178e30e3b845859a44b57c048db06ef84Dale Johannesen 1327572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned Entry, Latch; 1328572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (PH->getIncomingBlock(0) == L->getLoopPreheader()) { 1329572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Entry = 0; 1330572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Latch = 1; 1331572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 1332572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Entry = 1; 1333572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Latch = 0; 1334a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1335eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 1336572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry)); 1337572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Init) continue; 1338572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Constant *NewInit = ConstantFP::get(DestTy, Init->getZExtValue()); 1339a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1340572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BinaryOperator *Incr = 1341572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch)); 1342572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Incr) continue; 1343572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Incr->getOpcode() != Instruction::Add 1344572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman && Incr->getOpcode() != Instruction::Sub) 1345572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1346aed01d19315132daf68414ace410ec725b4b6d30Chris Lattner 1347572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /* Initialize new IV, double d = 0.0 in above example. */ 1348572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ConstantInt *C = NULL; 1349572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Incr->getOperand(0) == PH) 1350572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C = dyn_cast<ConstantInt>(Incr->getOperand(1)); 1351572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (Incr->getOperand(1) == PH) 1352572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C = dyn_cast<ConstantInt>(Incr->getOperand(0)); 1353572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 1354572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1355bc511725f08c45984be6ff47d069c3773a2f2eb0Dan Gohman 1356572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!C) continue; 1357a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1358572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore negative constants, as the code below doesn't handle them 1359572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // correctly. TODO: Remove this restriction. 1360572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!C->getValue().isStrictlyPositive()) continue; 1361a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1362572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /* Add new PHINode. */ 1363572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH); 1364a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1365572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /* create new increment. '++d' in above example. */ 1366572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Constant *CFP = ConstantFP::get(DestTy, C->getZExtValue()); 1367572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BinaryOperator *NewIncr = 1368572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BinaryOperator::Create(Incr->getOpcode() == Instruction::Add ? 1369572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction::FAdd : Instruction::FSub, 1370572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewPH, CFP, "IV.S.next.", Incr); 1371a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1372572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry)); 1373572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch)); 13748b0ade3eb8281f9b332d5764cfe5c4ed3b2b32d8Dan Gohman 1375572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /* Remove cast operation */ 1376572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ShadowUse->replaceAllUsesWith(NewPH); 1377572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ShadowUse->eraseFromParent(); 1378572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 13797979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman } 1380a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 1381cdf43b1fadac74ecf1cc858e72bde877a10ceca1Evan Cheng 13827979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// FindIVUserForCond - If Cond has an operand that is an expression of an IV, 13837979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// set the IV user and stride information and return true, otherwise return 13847979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// false. 1385572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool LSRInstance::FindIVUserForCond(ICmpInst *Cond, 1386572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVStrideUse *&CondUse) { 1387572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (IVUsers::iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) 1388572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (UI->getUser() == Cond) { 1389572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // NOTE: we could handle setcc instructions with multiple uses here, but 1390572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // InstCombine does it as well for simple uses, it's not clear that it 1391572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // occurs enough in real life to handle. 1392572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CondUse = UI; 1393572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 1394a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1395572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1396cdf43b1fadac74ecf1cc858e72bde877a10ceca1Evan Cheng} 1397cdf43b1fadac74ecf1cc858e72bde877a10ceca1Evan Cheng 13987979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// OptimizeMax - Rewrite the loop's terminating condition if it uses 13997979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// a max computation. 14007979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14017979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// This is a narrow solution to a specific, but acute, problem. For loops 14027979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// like this: 14037979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14047979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// i = 0; 14057979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// do { 14067979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// p[i] = 0.0; 14077979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// } while (++i < n); 14087979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14097979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// the trip count isn't just 'n', because 'n' might not be positive. And 14107979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// unfortunately this can come up even for loops where the user didn't use 14117979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// a C do-while loop. For example, seemingly well-behaved top-test loops 14127979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// will commonly be lowered like this: 14137979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman// 14147979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// if (n > 0) { 14157979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// i = 0; 14167979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// do { 14177979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// p[i] = 0.0; 14187979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// } while (++i < n); 14197979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// } 14207979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14217979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// and then it's possible for subsequent optimization to obscure the if 14227979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// test in such a way that indvars can't find it. 14237979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14247979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// When indvars can't find the if test in loops like this, it creates a 14257979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// max expression, which allows it to give the loop a canonical 14267979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// induction variable: 14277979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14287979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// i = 0; 14297979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// max = n < 1 ? 1 : n; 14307979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// do { 14317979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// p[i] = 0.0; 14327979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// } while (++i != max); 14337979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14347979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// Canonical induction variables are necessary because the loop passes 14357979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// are designed around them. The most obvious example of this is the 14367979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// LoopInfo analysis, which doesn't remember trip count values. It 14377979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// expects to be able to rediscover the trip count each time it is 1438572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// needed, and it does this using a simple analysis that only succeeds if 14397979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// the loop has a canonical induction variable. 14407979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14417979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// However, when it comes time to generate code, the maximum operation 14427979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// can be quite costly, especially if it's inside of an outer loop. 14437979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 14447979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// This function solves this problem by detecting this type of loop and 14457979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// rewriting their conditions from ICMP_NE back to ICMP_SLT, and deleting 14467979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// the instructions for the maximum computation. 14477979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman/// 1448572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanICmpInst *LSRInstance::OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse) { 14497979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Check that the loop matches the pattern we're looking for. 14507979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (Cond->getPredicate() != CmpInst::ICMP_EQ && 14517979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Cond->getPredicate() != CmpInst::ICMP_NE) 14527979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Cond; 1453ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 14547979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman SelectInst *Sel = dyn_cast<SelectInst>(Cond->getOperand(1)); 14557979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (!Sel || !Sel->hasOneUse()) return Cond; 1456ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 1457572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); 14587979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) 14597979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Cond; 1460572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *One = SE.getIntegerSCEV(1, BackedgeTakenCount->getType()); 1461ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 14627979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Add one to the backedge-taken count to get the trip count. 1463572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *IterationCount = SE.getAddExpr(BackedgeTakenCount, One); 14648b0ade3eb8281f9b332d5764cfe5c4ed3b2b32d8Dan Gohman 14657979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Check for a max calculation that matches the pattern. 14667979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (!isa<SCEVSMaxExpr>(IterationCount) && !isa<SCEVUMaxExpr>(IterationCount)) 14677979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Cond; 14687979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman const SCEVNAryExpr *Max = cast<SCEVNAryExpr>(IterationCount); 1469572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Max != SE.getSCEV(Sel)) return Cond; 1470ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 14717979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // To handle a max with more than two operands, this optimization would 14727979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // require additional checking and setup. 14737979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (Max->getNumOperands() != 2) 14747979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Cond; 14757979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 14767979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman const SCEV *MaxLHS = Max->getOperand(0); 14777979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman const SCEV *MaxRHS = Max->getOperand(1); 14787979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (!MaxLHS || MaxLHS != One) return Cond; 14797979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Check the relevant induction variable for conformance to 14807979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // the pattern. 1481572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *IV = SE.getSCEV(Cond->getOperand(0)); 14827979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV); 14837979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (!AR || !AR->isAffine() || 14847979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman AR->getStart() != One || 1485572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AR->getStepRecurrence(SE) != One) 14867979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return Cond; 1487ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 14887979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman assert(AR->getLoop() == L && 14897979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman "Loop condition operand is an addrec in a different loop!"); 1490bc10b8c6c7e85e44d8231dfb2fb41a60300857e3Dan Gohman 14917979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Check the right operand of the select, and remember it, as it will 14927979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // be used in the new comparison instruction. 14937979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Value *NewRHS = 0; 1494572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getSCEV(Sel->getOperand(1)) == MaxRHS) 14957979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman NewRHS = Sel->getOperand(1); 1496572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (SE.getSCEV(Sel->getOperand(2)) == MaxRHS) 14977979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman NewRHS = Sel->getOperand(2); 14987979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (!NewRHS) return Cond; 1499ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 15007979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Determine the new comparison opcode. It may be signed or unsigned, 15017979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // and the original comparison may be either equality or inequality. 15027979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman CmpInst::Predicate Pred = 15037979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman isa<SCEVSMaxExpr>(Max) ? CmpInst::ICMP_SLT : CmpInst::ICMP_ULT; 15047979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (Cond->getPredicate() == CmpInst::ICMP_EQ) 15057979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Pred = CmpInst::getInversePredicate(Pred); 15062781f30eac8647552638246c28ab07dd0fc2c560Dan Gohman 15077979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Ok, everything looks ok to change the condition into an SLT or SGE and 15087979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // delete the max calculation. 15097979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman ICmpInst *NewCond = 15107979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman new ICmpInst(Cond, Pred, Cond->getOperand(0), NewRHS, "scmp"); 1511ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 15127979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // Delete the max calculation instructions. 15137979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Cond->replaceAllUsesWith(NewCond); 15147979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman CondUse->setUser(NewCond); 15157979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Instruction *Cmp = cast<Instruction>(Sel->getOperand(0)); 15167979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Cond->eraseFromParent(); 15177979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Sel->eraseFromParent(); 15187979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman if (Cmp->use_empty()) 15197979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman Cmp->eraseFromParent(); 15207979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return NewCond; 1521ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman} 1522ad7321f58a485ae80fe3da1f400aa695e250b1a8Dan Gohman 152356a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach/// OptimizeLoopTermCond - Change loop terminating condition to use the 15242d85052f2bae5a5a31c03017c48ca8a9eba1453cEvan Cheng/// postinc iv when possible. 1525572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool 1526572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::OptimizeLoopTermCond() { 1527572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<Instruction *, 4> PostIncs; 1528572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 15295792f51e12d9c8685399e9857799365854ab5bf6Evan Cheng BasicBlock *LatchBlock = L->getLoopLatch(); 1530076e085698c484354c9e131f1bd8fd001581397bEvan Cheng SmallVector<BasicBlock*, 8> ExitingBlocks; 1531076e085698c484354c9e131f1bd8fd001581397bEvan Cheng L->getExitingBlocks(ExitingBlocks); 153256a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 1533076e085698c484354c9e131f1bd8fd001581397bEvan Cheng for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) { 1534076e085698c484354c9e131f1bd8fd001581397bEvan Cheng BasicBlock *ExitingBlock = ExitingBlocks[i]; 1535010de25f42dabbb7e0a2fe8b42aecc4285362e0cChris Lattner 1536572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Get the terminating condition for the loop if possible. If we 1537076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // can, we want to change it to use a post-incremented version of its 1538076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // induction variable, to allow coalescing the live ranges for the IV into 1539076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // one register value. 1540cdf43b1fadac74ecf1cc858e72bde877a10ceca1Evan Cheng 1541076e085698c484354c9e131f1bd8fd001581397bEvan Cheng BranchInst *TermBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); 1542076e085698c484354c9e131f1bd8fd001581397bEvan Cheng if (!TermBr) 1543076e085698c484354c9e131f1bd8fd001581397bEvan Cheng continue; 1544076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // FIXME: Overly conservative, termination condition could be an 'or' etc.. 1545076e085698c484354c9e131f1bd8fd001581397bEvan Cheng if (TermBr->isUnconditional() || !isa<ICmpInst>(TermBr->getCondition())) 1546076e085698c484354c9e131f1bd8fd001581397bEvan Cheng continue; 1547076e085698c484354c9e131f1bd8fd001581397bEvan Cheng 1548076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // Search IVUsesByStride to find Cond's IVUse if there is one. 1549076e085698c484354c9e131f1bd8fd001581397bEvan Cheng IVStrideUse *CondUse = 0; 1550076e085698c484354c9e131f1bd8fd001581397bEvan Cheng ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition()); 1551572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!FindIVUserForCond(Cond, CondUse)) 1552076e085698c484354c9e131f1bd8fd001581397bEvan Cheng continue; 1553076e085698c484354c9e131f1bd8fd001581397bEvan Cheng 15547979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // If the trip count is computed in terms of a max (due to ScalarEvolution 15557979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // being unable to find a sufficient guard, for example), change the loop 15567979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman // comparison to use SLT or ULT instead of NE. 1557572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // One consequence of doing this now is that it disrupts the count-down 1558572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // optimization. That's not always a bad thing though, because in such 1559572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // cases it may still be worthwhile to avoid a max. 1560572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cond = OptimizeMax(Cond, CondUse); 1561572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1562572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If this exiting block dominates the latch block, it may also use 1563572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // the post-inc value if it won't be shared with other uses. 1564572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for dominance. 1565572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!DT.dominates(ExitingBlock, LatchBlock)) 15667979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman continue; 15677979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman 1568572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively avoid trying to use the post-inc value in non-latch 1569572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // exits if there may be pre-inc users in intervening blocks. 1570590bfe8641631c136160fed7a9df9fe805938cbeDan Gohman if (LatchBlock != ExitingBlock) 1571572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) 1572572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Test if the use is reachable from the exiting block. This dominator 1573572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // query is a conservative approximation of reachability. 1574572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (&*UI != CondUse && 1575572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) { 1576572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively assume there may be reuse if the quotient of their 1577572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // strides could be a legal scale. 1578c056454ecfe66f7c646fedef594f4ed48a9f3bf0Dan Gohman const SCEV *A = IU.getStride(*CondUse, L); 1579c056454ecfe66f7c646fedef594f4ed48a9f3bf0Dan Gohman const SCEV *B = IU.getStride(*UI, L); 1580448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (!A || !B) continue; 1581572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getTypeSizeInBits(A->getType()) != 1582572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getTypeSizeInBits(B->getType())) { 1583572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getTypeSizeInBits(A->getType()) > 1584572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getTypeSizeInBits(B->getType())) 1585572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman B = SE.getSignExtendExpr(B, A->getType()); 1586572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 1587572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman A = SE.getSignExtendExpr(A, B->getType()); 1588572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1589572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *D = 1590f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman dyn_cast_or_null<SCEVConstant>(getExactSDiv(B, A, SE))) { 1591572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Stride of one or negative one can have reuse with non-addresses. 1592572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (D->getValue()->isOne() || 1593572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman D->getValue()->isAllOnesValue()) 1594572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto decline_post_inc; 1595572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Avoid weird situations. 1596572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (D->getValue()->getValue().getMinSignedBits() >= 64 || 1597572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman D->getValue()->getValue().isMinSignedValue()) 1598572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto decline_post_inc; 1599590bfe8641631c136160fed7a9df9fe805938cbeDan Gohman // Without TLI, assume that any stride might be valid, and so any 1600590bfe8641631c136160fed7a9df9fe805938cbeDan Gohman // use might be shared. 1601590bfe8641631c136160fed7a9df9fe805938cbeDan Gohman if (!TLI) 1602590bfe8641631c136160fed7a9df9fe805938cbeDan Gohman goto decline_post_inc; 1603572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for possible scaled-address reuse. 1604572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *AccessTy = getAccessType(UI->getUser()); 1605572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TargetLowering::AddrMode AM; 1606572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.Scale = D->getValue()->getSExtValue(); 16072763dfdc701964a01c4a0386fadd1c4e92be9021Dan Gohman if (TLI->isLegalAddressingMode(AM, AccessTy)) 1608572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto decline_post_inc; 1609572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AM.Scale = -AM.Scale; 16102763dfdc701964a01c4a0386fadd1c4e92be9021Dan Gohman if (TLI->isLegalAddressingMode(AM, AccessTy)) 1611572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto decline_post_inc; 1612572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1613572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1614572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 161563c9463c62fce8cbe02176dfa2d73f375a06f1f2David Greene DEBUG(dbgs() << " Change loop exiting icmp to use postinc iv: " 1616572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman << *Cond << '\n'); 161756a1f806aff00a8be6db4eb5c9cd5c751ff0f4c1Jim Grosbach 1618076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // It's possible for the setcc instruction to be anywhere in the loop, and 1619076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // possible for it to have multiple users. If it is not immediately before 1620076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // the exiting block branch, move it. 1621572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (&*++BasicBlock::iterator(Cond) != TermBr) { 1622572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Cond->hasOneUse()) { 1623076e085698c484354c9e131f1bd8fd001581397bEvan Cheng Cond->moveBefore(TermBr); 1624076e085698c484354c9e131f1bd8fd001581397bEvan Cheng } else { 1625572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Clone the terminating condition and insert into the loopend. 1626572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpInst *OldCond = Cond; 1627076e085698c484354c9e131f1bd8fd001581397bEvan Cheng Cond = cast<ICmpInst>(Cond->clone()); 1628076e085698c484354c9e131f1bd8fd001581397bEvan Cheng Cond->setName(L->getHeader()->getName() + ".termcond"); 1629076e085698c484354c9e131f1bd8fd001581397bEvan Cheng ExitingBlock->getInstList().insert(TermBr, Cond); 1630076e085698c484354c9e131f1bd8fd001581397bEvan Cheng 1631076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // Clone the IVUse, as the old use still exists! 1632c056454ecfe66f7c646fedef594f4ed48a9f3bf0Dan Gohman CondUse = &IU.AddUser(Cond, CondUse->getOperandValToReplace()); 1633572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TermBr->replaceUsesOfWith(OldCond, Cond); 1634076e085698c484354c9e131f1bd8fd001581397bEvan Cheng } 1635010de25f42dabbb7e0a2fe8b42aecc4285362e0cChris Lattner } 1636010de25f42dabbb7e0a2fe8b42aecc4285362e0cChris Lattner 1637076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // If we get to here, we know that we can transform the setcc instruction to 1638076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // use the post-incremented version of the IV, allowing us to coalesce the 1639076e085698c484354c9e131f1bd8fd001581397bEvan Cheng // live ranges for the IV correctly. 1640448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman CondUse->transformToPostInc(L); 1641076e085698c484354c9e131f1bd8fd001581397bEvan Cheng Changed = true; 16425792f51e12d9c8685399e9857799365854ab5bf6Evan Cheng 1643572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman PostIncs.insert(Cond); 1644572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman decline_post_inc:; 1645c1acc3f764804d25f70d88f937ef9c460143e0f1Dale Johannesen } 1646c1acc3f764804d25f70d88f937ef9c460143e0f1Dale Johannesen 1647572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Determine an insertion point for the loop induction variable increment. It 1648572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // must dominate all the post-inc comparisons we just set up, and it must 1649572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // dominate the loop latch edge. 1650572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVIncInsertPos = L->getLoopLatch()->getTerminator(); 1651572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallPtrSet<Instruction *, 4>::const_iterator I = PostIncs.begin(), 1652572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = PostIncs.end(); I != E; ++I) { 1653572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BasicBlock *BB = 1654572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DT.findNearestCommonDominator(IVIncInsertPos->getParent(), 1655572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (*I)->getParent()); 1656572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (BB == (*I)->getParent()) 1657572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVIncInsertPos = *I; 1658572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (BB != IVIncInsertPos->getParent()) 1659572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman IVIncInsertPos = BB->getTerminator(); 1660572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 16618b0ade3eb8281f9b332d5764cfe5c4ed3b2b32d8Dan Gohman 1662572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Changed; 1663572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1664a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1665572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool 1666572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::reconcileNewOffset(LSRUse &LU, int64_t NewOffset, 1667572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy) { 1668572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t NewMinOffset = LU.MinOffset; 1669572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t NewMaxOffset = LU.MaxOffset; 1670572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *NewAccessTy = AccessTy; 1671572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1672572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for a mismatched kind. It's tempting to collapse mismatched kinds to 1673572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // something conservative, however this can pessimize in the case that one of 1674572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // the uses will have all its uses outside the loop, for example. 1675572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind != Kind) 1676572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return false; 1677572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively assume HasBaseReg is true for now. 1678572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NewOffset < LU.MinOffset) { 1679572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isAlwaysFoldable(LU.MaxOffset - NewOffset, 0, /*HasBaseReg=*/true, 1680454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman Kind, AccessTy, TLI)) 16817979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return false; 1682572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewMinOffset = NewOffset; 1683572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (NewOffset > LU.MaxOffset) { 1684572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isAlwaysFoldable(NewOffset - LU.MinOffset, 0, /*HasBaseReg=*/true, 1685454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman Kind, AccessTy, TLI)) 16867979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return false; 1687572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewMaxOffset = NewOffset; 1688a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1689572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check for a mismatched access type, and fall back conservatively as needed. 1690572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Kind == LSRUse::Address && AccessTy != LU.AccessTy) 1691572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewAccessTy = Type::getVoidTy(AccessTy->getContext()); 1692572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1693572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Update the use. 1694572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.MinOffset = NewMinOffset; 1695572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.MaxOffset = NewMaxOffset; 1696572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.AccessTy = NewAccessTy; 1697572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NewOffset != LU.Offsets.back()) 1698572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Offsets.push_back(NewOffset); 1699572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 1700572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1701a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1702572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// getUse - Return an LSRUse index and an offset value for a fixup which 1703572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// needs the given expression, with the given kind and optional access type. 17043f46a3abeedba8d517b4182de34c821d752db058Dan Gohman/// Either reuse an existing use or create a new one, as needed. 1705572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstd::pair<size_t, int64_t> 1706572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::getUse(const SCEV *&Expr, 1707572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind, const Type *AccessTy) { 1708572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Copy = Expr; 1709572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offset = ExtractImmediate(Expr, SE); 1710572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1711572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Basic uses can't accept any offset, for example. 1712454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman if (!isAlwaysFoldable(Offset, 0, /*HasBaseReg=*/true, Kind, AccessTy, TLI)) { 1713572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Expr = Copy; 1714572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Offset = 0; 1715a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1716a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1717572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<UseMapTy::iterator, bool> P = 1718572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UseMap.insert(std::make_pair(Expr, 0)); 1719572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!P.second) { 1720572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // A use already existed with this base. 1721572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx = P.first->second; 1722572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 1723572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (reconcileNewOffset(LU, Offset, Kind, AccessTy)) 1724572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Reuse this use. 1725572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return std::make_pair(LUIdx, Offset); 1726572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1727a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1728572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Create a new use. 1729572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx = Uses.size(); 1730572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman P.first->second = LUIdx; 1731572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Uses.push_back(LSRUse(Kind, AccessTy)); 1732572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 1733a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1734572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // We don't need to track redundant offsets, but we don't need to go out 1735572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // of our way here to avoid them. 1736572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Offsets.empty() || Offset != LU.Offsets.back()) 1737572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Offsets.push_back(Offset); 1738a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1739572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.MinOffset = Offset; 1740572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.MaxOffset = Offset; 1741572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return std::make_pair(LUIdx, Offset); 1742a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman} 1743a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1744572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::CollectInterestingTypesAndFactors() { 1745572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallSetVector<const SCEV *, 4> Strides; 1746572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 17471b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman // Collect interesting types and strides. 1748448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman SmallVector<const SCEV *, 4> Worklist; 1749572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) { 1750c056454ecfe66f7c646fedef594f4ed48a9f3bf0Dan Gohman const SCEV *Expr = IU.getExpr(*UI); 1751572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1752572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Collect interesting types. 1753448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Types.insert(SE.getEffectiveSCEVType(Expr->getType())); 1754448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman 1755448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman // Add strides for mentioned loops. 1756448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Worklist.push_back(Expr); 1757448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman do { 1758448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman const SCEV *S = Worklist.pop_back_val(); 1759448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) { 1760448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Strides.insert(AR->getStepRecurrence(SE)); 1761448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Worklist.push_back(AR->getStart()); 1762448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) { 1763448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Worklist.insert(Worklist.end(), Add->op_begin(), Add->op_end()); 1764448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman } 1765448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman } while (!Worklist.empty()); 17661b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman } 17671b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman 17681b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman // Compute interesting factors from the set of interesting strides. 17691b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman for (SmallSetVector<const SCEV *, 4>::const_iterator 17701b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman I = Strides.begin(), E = Strides.end(); I != E; ++I) 1771572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<const SCEV *, 4>::const_iterator NewStrideIter = 17721b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman next(I); NewStrideIter != E; ++NewStrideIter) { 17731b7bf18def8db328bb4efa02c0958ea399e8d8cbDan Gohman const SCEV *OldStride = *I; 1774572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *NewStride = *NewStrideIter; 1775a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman 1776572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getTypeSizeInBits(OldStride->getType()) != 1777572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getTypeSizeInBits(NewStride->getType())) { 1778572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getTypeSizeInBits(OldStride->getType()) > 1779572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getTypeSizeInBits(NewStride->getType())) 1780572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewStride = SE.getSignExtendExpr(NewStride, OldStride->getType()); 1781572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 1782572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OldStride = SE.getSignExtendExpr(OldStride, NewStride->getType()); 1783572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1784572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *Factor = 1785f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman dyn_cast_or_null<SCEVConstant>(getExactSDiv(NewStride, OldStride, 1786f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman SE, true))) { 1787572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Factor->getValue()->getValue().getMinSignedBits() <= 64) 1788572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Factors.insert(Factor->getValue()->getValue().getSExtValue()); 1789572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVConstant *Factor = 1790454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman dyn_cast_or_null<SCEVConstant>(getExactSDiv(OldStride, 1791454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman NewStride, 1792f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman SE, true))) { 1793572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Factor->getValue()->getValue().getMinSignedBits() <= 64) 1794572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Factors.insert(Factor->getValue()->getValue().getSExtValue()); 1795a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1796a10756ee657a4d43a48cca5c166919093930ed6bDan Gohman } 1797586f69a11881d828c056ce017b3fb432341d9657Evan Cheng 1798572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If all uses use the same type, don't bother looking for truncation-based 1799572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // reuse. 1800572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Types.size() == 1) 1801572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Types.clear(); 1802572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1803572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(print_factors_and_types(dbgs())); 1804c1acc3f764804d25f70d88f937ef9c460143e0f1Dale Johannesen} 1805c1acc3f764804d25f70d88f937ef9c460143e0f1Dale Johannesen 1806572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::CollectFixupsAndInitialFormulae() { 1807572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) { 1808572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Record the uses. 1809572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRFixup &LF = getNewFixup(); 1810572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.UserInst = UI->getUser(); 1811572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.OperandValToReplace = UI->getOperandValToReplace(); 1812448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman LF.PostIncLoops = UI->getPostIncLoops(); 18130f54dcbf07c69e41ecaa6b4fbf0d94956d8e9ff5Devang Patel 1814572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::KindType Kind = LSRUse::Basic; 1815572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *AccessTy = 0; 1816572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (isAddressUse(LF.UserInst, LF.OperandValToReplace)) { 1817572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Kind = LSRUse::Address; 1818572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AccessTy = getAccessType(LF.UserInst); 1819572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1820572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1821c056454ecfe66f7c646fedef594f4ed48a9f3bf0Dan Gohman const SCEV *S = IU.getExpr(*UI); 1822572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1823572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Equality (== and !=) ICmps are special. We can rewrite (i == N) as 1824572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // (N - i == 0), and this allows (N - i) to be the expression that we work 1825572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // with rather than just N or i, so we can consider the register 1826572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // requirements for both N and i at the same time. Limiting this code to 1827572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // equality icmps is not a problem because all interesting loops use 1828572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // equality icmps, thanks to IndVarSimplify. 1829572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ICmpInst *CI = dyn_cast<ICmpInst>(LF.UserInst)) 1830572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (CI->isEquality()) { 1831572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Swap the operands if needed to put the OperandValToReplace on the 1832572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // left, for consistency. 1833572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *NV = CI->getOperand(1); 1834572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NV == LF.OperandValToReplace) { 1835572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CI->setOperand(1, CI->getOperand(0)); 1836572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CI->setOperand(0, NV); 1837572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1838572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1839572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // x == y --> x - y == 0 1840572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *N = SE.getSCEV(NV); 1841572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (N->isLoopInvariant(L)) { 1842572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Kind = LSRUse::ICmpZero; 1843572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman S = SE.getMinusSCEV(N, S); 1844572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1845572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1846572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // -1 and the negations of all interesting strides (except the negation 1847572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // of -1) are now also interesting. 1848572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Factors.size(); i != e; ++i) 1849572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Factors[i] != -1) 1850572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Factors.insert(-(uint64_t)Factors[i]); 1851572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Factors.insert(-1); 1852572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1853572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1854572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Set up the initial formula for this use. 1855572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<size_t, int64_t> P = getUse(S, Kind, AccessTy); 1856572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.LUIdx = P.first; 1857572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.Offset = P.second; 1858572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LF.LUIdx]; 1859448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L); 1860572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1861572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If this is the first use of this LSRUse, give it a formula. 1862572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Formulae.empty()) { 1863454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman InsertInitialFormula(S, LU, LF.LUIdx); 1864572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CountRegisters(LU.Formulae.back(), LF.LUIdx); 1865572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1866572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1867572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1868572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(print_fixups(dbgs())); 1869572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1870572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1871572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 1872454d26dc43207ec537d843229db6f5e6a302e23dDan GohmanLSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) { 1873572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F; 1874572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.InitialMatch(S, L, SE, DT); 1875572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Inserted = InsertFormula(LU, LUIdx, F); 1876572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(Inserted && "Initial formula already exists!"); (void)Inserted; 1877572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1878572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1879572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 1880572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::InsertSupplementalFormula(const SCEV *S, 1881572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU, size_t LUIdx) { 1882572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F; 1883572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.push_back(S); 1884572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.HasBaseReg = true; 1885572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Inserted = InsertFormula(LU, LUIdx, F); 1886572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(Inserted && "Supplemental formula already exists!"); (void)Inserted; 1887572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1888572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1889572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// CountRegisters - Note which registers are used by the given formula, 1890572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// updating RegUses. 1891572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::CountRegisters(const Formula &F, size_t LUIdx) { 1892572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) 1893572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.CountRegister(F.ScaledReg, LUIdx); 1894572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(), 1895572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = F.BaseRegs.end(); I != E; ++I) 1896572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.CountRegister(*I, LUIdx); 1897572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1898572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1899572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// InsertFormula - If the given formula has not yet been inserted, add it to 1900572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the list, and return true. Return false otherwise. 1901572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) { 1902454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman if (!LU.InsertFormula(F)) 19037979b72febb73f7bb1d1ed095a68f210822b2e7cDan Gohman return false; 190480b0f8c0628d848d36f04440687b61e3b2d3dff1Dan Gohman 1905572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CountRegisters(F, LUIdx); 1906572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return true; 1907572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1908572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1909572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// CollectLoopInvariantFixupsAndFormulae - Check for other uses of 1910572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// loop-invariant values which we're tracking. These other uses will pin these 1911572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// values in registers, making them less profitable for elimination. 1912572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// TODO: This currently misses non-constant addrec step registers. 1913572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// TODO: Should this give more weight to users inside the loop? 1914572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 1915572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::CollectLoopInvariantFixupsAndFormulae() { 1916572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); 1917572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 8> Inserted; 1918572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1919572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman while (!Worklist.empty()) { 1920572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *S = Worklist.pop_back_val(); 1921572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1922572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVNAryExpr *N = dyn_cast<SCEVNAryExpr>(S)) 1923572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.insert(Worklist.end(), N->op_begin(), N->op_end()); 1924572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(S)) 1925572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.push_back(C->getOperand()); 1926572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (const SCEVUDivExpr *D = dyn_cast<SCEVUDivExpr>(S)) { 1927572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.push_back(D->getLHS()); 1928572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.push_back(D->getRHS()); 1929572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) { 1930572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Inserted.insert(U)) continue; 1931572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Value *V = U->getValue(); 1932572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const Instruction *Inst = dyn_cast<Instruction>(V)) 1933572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (L->contains(Inst)) continue; 193460ad781c61815ca5b8dc2a45a102e1c8af65992fGabor Greif for (Value::const_use_iterator UI = V->use_begin(), UE = V->use_end(); 1935572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UI != UE; ++UI) { 1936572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Instruction *UserInst = dyn_cast<Instruction>(*UI); 1937572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore non-instructions. 1938572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!UserInst) 1939572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1940572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore instructions in other functions (as can happen with 1941572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Constants). 1942572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (UserInst->getParent()->getParent() != L->getHeader()->getParent()) 1943572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1944572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore instructions not dominated by the loop. 1945572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const BasicBlock *UseBB = !isa<PHINode>(UserInst) ? 1946572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UserInst->getParent() : 1947572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman cast<PHINode>(UserInst)->getIncomingBlock( 1948572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman PHINode::getIncomingValueNumForOperand(UI.getOperandNo())); 1949572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!DT.dominates(L->getHeader(), UseBB)) 1950572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1951572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore uses which are part of other SCEV expressions, to avoid 1952572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // analyzing them multiple times. 19534a2a68336638e99a475b09a9278399db6749618fDan Gohman if (SE.isSCEVable(UserInst->getType())) { 19544a2a68336638e99a475b09a9278399db6749618fDan Gohman const SCEV *UserS = SE.getSCEV(const_cast<Instruction *>(UserInst)); 19554a2a68336638e99a475b09a9278399db6749618fDan Gohman // If the user is a no-op, look through to its uses. 19564a2a68336638e99a475b09a9278399db6749618fDan Gohman if (!isa<SCEVUnknown>(UserS)) 19574a2a68336638e99a475b09a9278399db6749618fDan Gohman continue; 19584a2a68336638e99a475b09a9278399db6749618fDan Gohman if (UserS == U) { 19594a2a68336638e99a475b09a9278399db6749618fDan Gohman Worklist.push_back( 19604a2a68336638e99a475b09a9278399db6749618fDan Gohman SE.getUnknown(const_cast<Instruction *>(UserInst))); 19614a2a68336638e99a475b09a9278399db6749618fDan Gohman continue; 19624a2a68336638e99a475b09a9278399db6749618fDan Gohman } 19634a2a68336638e99a475b09a9278399db6749618fDan Gohman } 1964572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore icmp instructions which are already being analyzed. 1965572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const ICmpInst *ICI = dyn_cast<ICmpInst>(UserInst)) { 1966572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned OtherIdx = !UI.getOperandNo(); 1967572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *OtherOp = const_cast<Value *>(ICI->getOperand(OtherIdx)); 1968572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getSCEV(OtherOp)->hasComputableLoopEvolution(L)) 1969572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 1970572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1971572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1972572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRFixup &LF = getNewFixup(); 1973572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.UserInst = const_cast<Instruction *>(UserInst); 1974572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.OperandValToReplace = UI.getUse(); 1975572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<size_t, int64_t> P = getUse(S, LSRUse::Basic, 0); 1976572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.LUIdx = P.first; 1977572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.Offset = P.second; 1978572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LF.LUIdx]; 1979448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L); 1980572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman InsertSupplementalFormula(U, LU, LF.LUIdx); 1981572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CountRegisters(LU.Formulae.back(), Uses.size() - 1); 1982572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 1983572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1984572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1985572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 1986572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 1987572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 1988572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// CollectSubexprs - Split S into subexpressions which can be pulled out into 1989572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// separate registers. If C is non-null, multiply each subexpression by C. 1990572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic void CollectSubexprs(const SCEV *S, const SCEVConstant *C, 1991572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<const SCEV *> &Ops, 1992572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScalarEvolution &SE) { 1993572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) { 1994572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Break out add operands. 1995572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end(); 1996572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I != E; ++I) 1997572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectSubexprs(*I, C, Ops, SE); 1998572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 1999572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) { 2000572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Split a non-zero base out of an addrec. 2001572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!AR->getStart()->isZero()) { 2002572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectSubexprs(SE.getAddRecExpr(SE.getIntegerSCEV(0, AR->getType()), 2003572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AR->getStepRecurrence(SE), 2004572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AR->getLoop()), C, Ops, SE); 200568d6da1f33be3f0a55f7fa87204069cfa79247c6Dan Gohman CollectSubexprs(AR->getStart(), C, Ops, SE); 2006572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 2007572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2008572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) { 2009572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Break (C * (a + b + c)) into C*a + C*b + C*c. 2010572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Mul->getNumOperands() == 2) 2011572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *Op0 = 2012572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dyn_cast<SCEVConstant>(Mul->getOperand(0))) { 2013572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectSubexprs(Mul->getOperand(1), 2014572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C ? cast<SCEVConstant>(SE.getMulExpr(C, Op0)) : Op0, 2015572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops, SE); 2016572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return; 2017572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2018572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2019572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2020572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Otherwise use the value itself. 2021572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(C ? SE.getMulExpr(C, S) : S); 2022572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2023572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2024572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateReassociations - Split out subexpressions from adds and the bases of 2025572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// addrecs. 2026572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateReassociations(LSRUse &LU, unsigned LUIdx, 2027572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base, 2028572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned Depth) { 2029572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Arbitrarily cap recursion to protect compile time. 2030572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Depth >= 3) return; 2031572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2032572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { 2033572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BaseReg = Base.BaseRegs[i]; 2034572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2035572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> AddOps; 2036572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectSubexprs(BaseReg, 0, AddOps, SE); 2037572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (AddOps.size() == 1) continue; 2038572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2039572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator J = AddOps.begin(), 2040572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = AddOps.end(); J != JE; ++J) { 2041572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Don't pull a constant into a register if the constant could be folded 2042572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // into an immediate field. 2043572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (isAlwaysFoldable(*J, LU.MinOffset, LU.MaxOffset, 2044572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Base.getNumRegs() > 1, 2045572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI, SE)) 2046572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2047572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2048572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Collect all operands except *J. 2049572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> InnerAddOps; 2050572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator K = AddOps.begin(), 2051572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman KE = AddOps.end(); K != KE; ++K) 2052572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (K != J) 2053572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman InnerAddOps.push_back(*K); 2054572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2055572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Don't leave just a constant behind in a register if the constant could 2056572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // be folded into an immediate field. 2057572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (InnerAddOps.size() == 1 && 2058572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman isAlwaysFoldable(InnerAddOps[0], LU.MinOffset, LU.MaxOffset, 2059572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Base.getNumRegs() > 1, 2060572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI, SE)) 2061572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2062572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2063fafb890ee204d60456d0780ff55a149fa082eaeaDan Gohman const SCEV *InnerSum = SE.getAddExpr(InnerAddOps); 2064fafb890ee204d60456d0780ff55a149fa082eaeaDan Gohman if (InnerSum->isZero()) 2065fafb890ee204d60456d0780ff55a149fa082eaeaDan Gohman continue; 2066572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2067fafb890ee204d60456d0780ff55a149fa082eaeaDan Gohman F.BaseRegs[i] = InnerSum; 2068572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.push_back(*J); 2069572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (InsertFormula(LU, LUIdx, F)) 2070572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If that formula hadn't been seen before, recurse to find more like 2071572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // it. 2072572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateReassociations(LU, LUIdx, LU.Formulae.back(), Depth+1); 2073572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2074572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2075572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2076572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2077572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateCombinations - Generate a formula consisting of all of the 2078572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// loop-dominating registers added into a single register. 2079572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateCombinations(LSRUse &LU, unsigned LUIdx, 2080441a38993e89104c424e00c95cce63c7351f4fc3Dan Gohman Formula Base) { 20813f46a3abeedba8d517b4182de34c821d752db058Dan Gohman // This method is only interesting on a plurality of registers. 2082572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Base.BaseRegs.size() <= 1) return; 2083572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2084572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2085572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.clear(); 2086572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 4> Ops; 2087572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator 2088572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Base.BaseRegs.begin(), E = Base.BaseRegs.end(); I != E; ++I) { 2089572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BaseReg = *I; 2090572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (BaseReg->properlyDominates(L->getHeader(), &DT) && 2091572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman !BaseReg->hasComputableLoopEvolution(L)) 2092572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(BaseReg); 2093572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 2094572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.push_back(BaseReg); 2095572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2096572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Ops.size() > 1) { 2097ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman const SCEV *Sum = SE.getAddExpr(Ops); 2098ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman // TODO: If Sum is zero, it probably means ScalarEvolution missed an 2099ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman // opportunity to fold something. For now, just ignore such cases 21003f46a3abeedba8d517b4182de34c821d752db058Dan Gohman // rather than proceed with zero in a register. 2101ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman if (!Sum->isZero()) { 2102ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman F.BaseRegs.push_back(Sum); 2103ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2104ce947366ec07ed3e9b017f0f4a07fa668a799119Dan Gohman } 2105572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2106572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2107572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2108572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateSymbolicOffsets - Generate reuse formulae using symbolic offsets. 2109572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, 2110572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base) { 2111572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // We can't add a symbolic offset if the address already contains one. 2112572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Base.AM.BaseGV) return; 2113572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2114572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { 2115572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *G = Base.BaseRegs[i]; 2116572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GlobalValue *GV = ExtractSymbol(G, SE); 2117572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (G->isZero() || !GV) 2118572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2119572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2120572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.BaseGV = GV; 2121572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset, 2122572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) 2123572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2124572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs[i] = G; 2125572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2126572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2127572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2128572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2129572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateConstantOffsets - Generate reuse formulae using symbolic offsets. 2130572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, 2131572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base) { 2132572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: For now, just add the min and max offset, because it usually isn't 2133572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // worthwhile looking at everything inbetween. 2134572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<int64_t, 4> Worklist; 2135572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.push_back(LU.MinOffset); 2136572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.MaxOffset != LU.MinOffset) 2137572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Worklist.push_back(LU.MaxOffset); 2138572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2139572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { 2140572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *G = Base.BaseRegs[i]; 2141572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2142572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<int64_t>::const_iterator I = Worklist.begin(), 2143572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Worklist.end(); I != E; ++I) { 2144572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2145572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.BaseOffs = (uint64_t)Base.AM.BaseOffs - *I; 2146572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (isLegalUse(F.AM, LU.MinOffset - *I, LU.MaxOffset - *I, 2147572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) { 2148572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs[i] = SE.getAddExpr(G, SE.getIntegerSCEV(*I, G->getType())); 2149572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2150572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2151572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2152572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2153572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2154572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Imm = ExtractImmediate(G, SE); 2155572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (G->isZero() || Imm == 0) 2156572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2157572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2158572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Imm; 2159572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset, 2160572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) 2161572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2162572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs[i] = G; 2163572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2164572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2165572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2166572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2167572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateICmpZeroScales - For ICmpZero, check to see if we can scale up 2168572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the comparison. For example, x == y -> x*c == y*c. 2169572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, 2170572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base) { 2171572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind != LSRUse::ICmpZero) return; 2172572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2173572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Determine the integer type for the base formula. 2174572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *IntTy = Base.getType(); 2175572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!IntTy) return; 2176572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SE.getTypeSizeInBits(IntTy) > 64) return; 2177572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2178572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Don't do this if there is more than one offset. 2179572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.MinOffset != LU.MaxOffset) return; 2180572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2181572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(!Base.AM.BaseGV && "ICmpZero use is not legal!"); 2182572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2183572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check each interesting stride. 2184572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<int64_t, 8>::const_iterator 2185572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Factors.begin(), E = Factors.end(); I != E; ++I) { 2186572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Factor = *I; 2187572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2188572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2189572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check that the multiplication doesn't overflow. 2190968cb939e5a00cb06aefafc89581645790c590b3Dan Gohman if (F.AM.BaseOffs == INT64_MIN && Factor == -1) 2191968cb939e5a00cb06aefafc89581645790c590b3Dan Gohman continue; 2192572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.BaseOffs = (uint64_t)Base.AM.BaseOffs * Factor; 2193378c0b35a7b9884f1de2a9762825424fbf1813acDan Gohman if (F.AM.BaseOffs / Factor != Base.AM.BaseOffs) 2194572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2195572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2196572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check that multiplying with the use offset doesn't overflow. 2197572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offset = LU.MinOffset; 2198968cb939e5a00cb06aefafc89581645790c590b3Dan Gohman if (Offset == INT64_MIN && Factor == -1) 2199968cb939e5a00cb06aefafc89581645790c590b3Dan Gohman continue; 2200572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Offset = (uint64_t)Offset * Factor; 2201378c0b35a7b9884f1de2a9762825424fbf1813acDan Gohman if (Offset / Factor != LU.MinOffset) 2202572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2203572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2204572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check that this scale is legal. 2205572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(F.AM, Offset, Offset, LU.Kind, LU.AccessTy, TLI)) 2206572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2207572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2208572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Compensate for the use having MinOffset built into it. 2209572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Offset - LU.MinOffset; 2210572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2211572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *FactorS = SE.getIntegerSCEV(Factor, IntTy); 2212572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2213572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check that multiplying with each base register doesn't overflow. 2214572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { 2215572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); 2216f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) 2217572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto next; 2218572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2219572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2220572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check that multiplying with the scaled register doesn't overflow. 2221572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) { 2222572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.ScaledReg = SE.getMulExpr(F.ScaledReg, FactorS); 2223f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman if (getExactSDiv(F.ScaledReg, FactorS, SE) != Base.ScaledReg) 2224572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2225572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2226572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2227572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If we make it here and it's legal, add it. 2228572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2229572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman next:; 2230572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2231572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2232572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2233572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateScales - Generate stride factor reuse formulae by making use of 2234572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// scaled-offset address modes, for example. 2235572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, 2236572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base) { 2237572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Determine the integer type for the base formula. 2238572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *IntTy = Base.getType(); 2239572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!IntTy) return; 2240572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2241572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If this Formula already has a scaled register, we can't add another one. 2242572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Base.AM.Scale != 0) return; 2243572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2244572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check each interesting stride. 2245572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<int64_t, 8>::const_iterator 2246572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Factors.begin(), E = Factors.end(); I != E; ++I) { 2247572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Factor = *I; 2248572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2249572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Base.AM.Scale = Factor; 2250572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Base.AM.HasBaseReg = Base.BaseRegs.size() > 1; 2251572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Check whether this scale is going to be legal. 2252572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset, 2253572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) { 2254572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // As a special-case, handle special out-of-loop Basic users specially. 2255572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: Reconsider this special case. 2256572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::Basic && 2257572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset, 2258572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse::Special, LU.AccessTy, TLI) && 2259572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.AllFixupsOutsideLoop) 2260572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind = LSRUse::Special; 2261572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 2262572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2263572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2264572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // For an ICmpZero, negating a solitary base register won't lead to 2265572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // new solutions. 2266572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::ICmpZero && 2267572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman !Base.AM.HasBaseReg && Base.AM.BaseOffs == 0 && !Base.AM.BaseGV) 2268572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2269572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // For each addrec base reg, apply the scale, if possible. 2270572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) 2271572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVAddRecExpr *AR = 2272572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i])) { 2273572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *FactorS = SE.getIntegerSCEV(Factor, IntTy); 2274572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (FactorS->isZero()) 2275572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2276572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Divide out the factor, ignoring high bits, since we'll be 2277572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // scaling the value back up in the end. 2278f09b71233bc43cfcca5199e355cc1129f7c4f89aDan Gohman if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) { 2279572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: This could be optimized to avoid all the copying. 2280572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2281572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.ScaledReg = Quotient; 2282572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::swap(F.BaseRegs[i], F.BaseRegs.back()); 2283572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.pop_back(); 2284572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2285572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2286572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2287572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2288572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2289572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2290572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateTruncates - Generate reuse formulae from different IV types. 2291572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, 2292572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula Base) { 2293572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // This requires TargetLowering to tell us which truncates are free. 2294572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!TLI) return; 2295572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2296572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Don't bother truncating symbolic values. 2297572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Base.AM.BaseGV) return; 2298572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2299572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Determine the integer type for the base formula. 2300572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *DstTy = Base.getType(); 2301572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!DstTy) return; 2302572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DstTy = SE.getEffectiveSCEVType(DstTy); 2303572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2304572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<const Type *, 4>::const_iterator 2305572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Types.begin(), E = Types.end(); I != E; ++I) { 2306572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *SrcTy = *I; 2307572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (SrcTy != DstTy && TLI->isTruncateFree(SrcTy, DstTy)) { 2308572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = Base; 2309572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2310572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) F.ScaledReg = SE.getAnyExtendExpr(F.ScaledReg, *I); 2311572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::iterator J = F.BaseRegs.begin(), 2312572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = F.BaseRegs.end(); J != JE; ++J) 2313572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman *J = SE.getAnyExtendExpr(*J, SrcTy); 2314572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2315572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // TODO: This assumes we've done basic processing on all uses and 2316572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // have an idea what the register usage is. 2317572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!F.hasRegsUsedByUsesOtherThan(LUIdx, RegUses)) 2318572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2319572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2320572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, F); 2321572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2322572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2323572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2324572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2325572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 2326572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 23276020d85c41987b0b7890d91bf66187aac6e8a3a1Dan Gohman/// WorkItem - Helper class for GenerateCrossUseConstantOffsets. It's used to 2328572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// defer modifications so that the search phase doesn't have to worry about 2329572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the data structures moving underneath it. 2330572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstruct WorkItem { 2331572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx; 2332572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Imm; 2333572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *OrigReg; 2334572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2335572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WorkItem(size_t LI, int64_t I, const SCEV *R) 2336572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman : LUIdx(LI), Imm(I), OrigReg(R) {} 2337572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2338572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void print(raw_ostream &OS) const; 2339572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void dump() const; 2340572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 2341572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2342572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2343572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2344572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid WorkItem::print(raw_ostream &OS) const { 2345572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "in formulae referencing " << *OrigReg << " in use " << LUIdx 2346572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman << " , add offset " << Imm; 2347572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2348572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2349572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid WorkItem::dump() const { 2350572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 2351572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2352572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2353572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateCrossUseConstantOffsets - Look for registers which are a constant 2354572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// distance apart and try to form reuse opportunities between them. 2355572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::GenerateCrossUseConstantOffsets() { 2356572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Group the registers by their value without any added constant offset. 2357572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef std::map<int64_t, const SCEV *> ImmMapTy; 2358572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef DenseMap<const SCEV *, ImmMapTy> RegMapTy; 2359572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegMapTy Map; 2360572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseMap<const SCEV *, SmallBitVector> UsedByIndicesMap; 2361572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> Sequence; 2362572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end(); 2363572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I != E; ++I) { 2364572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *I; 2365572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Imm = ExtractImmediate(Reg, SE); 2366572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<RegMapTy::iterator, bool> Pair = 2367572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Map.insert(std::make_pair(Reg, ImmMapTy())); 2368572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Pair.second) 2369572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Sequence.push_back(Reg); 2370572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Pair.first->second.insert(std::make_pair(Imm, *I)); 2371572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UsedByIndicesMap[Reg] |= RegUses.getUsedByIndices(*I); 2372572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2373572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2374572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Now examine each set of registers with the same base value. Build up 2375572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // a list of work to do and do the work in a separate step so that we're 2376572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // not adding formulae and register counts while we're searching. 2377572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<WorkItem, 32> WorkItems; 2378572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallSet<std::pair<size_t, int64_t>, 32> UniqueItems; 2379572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = Sequence.begin(), 2380572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Sequence.end(); I != E; ++I) { 2381572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *I; 2382572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const ImmMapTy &Imms = Map.find(Reg)->second; 2383572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2384cd045c08cad9bc3e1e3e234453f5f4464b705e02Dan Gohman // It's not worthwhile looking for reuse if there's only one offset. 2385cd045c08cad9bc3e1e3e234453f5f4464b705e02Dan Gohman if (Imms.size() == 1) 2386cd045c08cad9bc3e1e3e234453f5f4464b705e02Dan Gohman continue; 2387cd045c08cad9bc3e1e3e234453f5f4464b705e02Dan Gohman 2388572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "Generating cross-use offsets for " << *Reg << ':'; 2389572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end(); 2390572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman J != JE; ++J) 2391572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << ' ' << J->first; 2392572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << '\n'); 2393572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2394572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Examine each offset. 2395572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end(); 2396572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman J != JE; ++J) { 2397572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *OrigReg = J->second; 2398572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2399572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t JImm = J->first; 2400572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallBitVector &UsedByIndices = RegUses.getUsedByIndices(OrigReg); 2401572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2402572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isa<SCEVConstant>(OrigReg) && 2403572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UsedByIndicesMap[Reg].count() == 1) { 2404572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "Skipping cross-use reuse for " << *OrigReg << '\n'); 2405572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2406572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2407572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2408572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Conservatively examine offsets between this orig reg a few selected 2409572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // other orig regs. 2410572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImmMapTy::const_iterator OtherImms[] = { 2411572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Imms.begin(), prior(Imms.end()), 2412572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Imms.upper_bound((Imms.begin()->first + prior(Imms.end())->first) / 2) 2413572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman }; 2414572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = array_lengthof(OtherImms); i != e; ++i) { 2415572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImmMapTy::const_iterator M = OtherImms[i]; 2416cd045c08cad9bc3e1e3e234453f5f4464b705e02Dan Gohman if (M == J || M == JE) continue; 2417572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2418572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Compute the difference between the two. 2419572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Imm = (uint64_t)JImm - M->first; 2420572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (int LUIdx = UsedByIndices.find_first(); LUIdx != -1; 2421572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LUIdx = UsedByIndices.find_next(LUIdx)) 2422572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Make a memo of this use, offset, and register tuple. 2423572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (UniqueItems.insert(std::make_pair(LUIdx, Imm))) 2424572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WorkItems.push_back(WorkItem(LUIdx, Imm, OrigReg)); 2425572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2426572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2427572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2428572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2429572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Map.clear(); 2430572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Sequence.clear(); 2431572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UsedByIndicesMap.clear(); 2432572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman UniqueItems.clear(); 2433572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2434572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Now iterate through the worklist and add new formulae. 2435572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<WorkItem>::const_iterator I = WorkItems.begin(), 2436572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = WorkItems.end(); I != E; ++I) { 2437572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const WorkItem &WI = *I; 2438572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx = WI.LUIdx; 2439572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 2440572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Imm = WI.Imm; 2441572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *OrigReg = WI.OrigReg; 2442572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2443572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *IntTy = SE.getEffectiveSCEVType(OrigReg->getType()); 2444572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *NegImmS = SE.getSCEV(ConstantInt::get(IntTy, -(uint64_t)Imm)); 2445572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned BitWidth = SE.getTypeSizeInBits(IntTy); 2446572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 24473f46a3abeedba8d517b4182de34c821d752db058Dan Gohman // TODO: Use a more targeted data structure. 2448572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) { 2449572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula F = LU.Formulae[L]; 2450572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Use the immediate in the scaled register. 2451572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg == OrigReg) { 2452572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offs = (uint64_t)F.AM.BaseOffs + 2453572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Imm * (uint64_t)F.AM.Scale; 2454572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Don't create 50 + reg(-50). 2455572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.referencesReg(SE.getSCEV( 2456572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ConstantInt::get(IntTy, -(uint64_t)Offs)))) 2457572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2458572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula NewF = F; 2459572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewF.AM.BaseOffs = Offs; 2460572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset, 2461572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) 2462572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2463572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewF.ScaledReg = SE.getAddExpr(NegImmS, NewF.ScaledReg); 2464572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2465572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If the new scale is a constant in a register, and adding the constant 2466572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // value to the immediate would produce a value closer to zero than the 2467572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // immediate itself, then the formula isn't worthwhile. 2468572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(NewF.ScaledReg)) 2469572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (C->getValue()->getValue().isNegative() != 2470572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (NewF.AM.BaseOffs < 0) && 2471572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (C->getValue()->getValue().abs() * APInt(BitWidth, F.AM.Scale)) 2472e05678132345eb8a632362dbd320ee7d36226e67Dan Gohman .ule(abs64(NewF.AM.BaseOffs))) 2473572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2474572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2475572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // OK, looks good. 2476572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, NewF); 2477572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 2478572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Use the immediate in a base register. 2479572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { 2480572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *BaseReg = F.BaseRegs[N]; 2481572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (BaseReg != OrigReg) 2482572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2483572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula NewF = F; 2484572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewF.AM.BaseOffs = (uint64_t)NewF.AM.BaseOffs + Imm; 2485572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset, 2486572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI)) 2487572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2488572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); 2489572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2490572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If the new formula has a constant in a register, and adding the 2491572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // constant value to the immediate would produce a value closer to 2492572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // zero than the immediate itself, then the formula isn't worthwhile. 2493572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator 2494572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman J = NewF.BaseRegs.begin(), JE = NewF.BaseRegs.end(); 2495572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman J != JE; ++J) 2496572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (const SCEVConstant *C = dyn_cast<SCEVConstant>(*J)) 2497572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (C->getValue()->getValue().isNegative() != 2498572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (NewF.AM.BaseOffs < 0) && 2499572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C->getValue()->getValue().abs() 2500e05678132345eb8a632362dbd320ee7d36226e67Dan Gohman .ule(abs64(NewF.AM.BaseOffs))) 2501572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto skip_formula; 2502572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2503572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ok, looks good. 2504572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman (void)InsertFormula(LU, LUIdx, NewF); 2505572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 2506572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman skip_formula:; 2507572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2508572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2509572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2510572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2511572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2512572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2513572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// GenerateAllReuseFormulae - Generate formulae for each use. 2514572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 2515572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::GenerateAllReuseFormulae() { 2516c2385a0741c43bd93eb2033e2f11eaae83cdb1cbDan Gohman // This is split into multiple loops so that hasRegsUsedByUsesOtherThan 2517572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // queries are more precise. 2518572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { 2519572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 2520572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2521572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateReassociations(LU, LUIdx, LU.Formulae[i]); 2522572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2523572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateCombinations(LU, LUIdx, LU.Formulae[i]); 2524572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2525572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { 2526572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 2527572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2528572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]); 2529572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2530572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]); 2531572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2532572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]); 2533572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2534572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateScales(LU, LUIdx, LU.Formulae[i]); 2535c2385a0741c43bd93eb2033e2f11eaae83cdb1cbDan Gohman } 2536c2385a0741c43bd93eb2033e2f11eaae83cdb1cbDan Gohman for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { 2537c2385a0741c43bd93eb2033e2f11eaae83cdb1cbDan Gohman LSRUse &LU = Uses[LUIdx]; 2538572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 2539572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateTruncates(LU, LUIdx, LU.Formulae[i]); 2540572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2541572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2542572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateCrossUseConstantOffsets(); 2543572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2544572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2545572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// If their are multiple formulae with the same set of registers used 2546572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// by other uses, pick the best one and delete the others. 2547572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::FilterOutUndesirableDedicatedRegisters() { 2548572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#ifndef NDEBUG 2549572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Changed = false; 2550572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#endif 2551572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2552572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Collect the best formula for each unique set of shared registers. This 2553572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // is reset for each use. 2554572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman typedef DenseMap<SmallVector<const SCEV *, 2>, size_t, UniquifierDenseMapInfo> 2555572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BestFormulaeTy; 2556572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BestFormulaeTy BestFormulae; 2557572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2558572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) { 2559572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = Uses[LUIdx]; 2560572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FormulaSorter Sorter(L, LU, SE, DT); 2561572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2562572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Clear out the set of used regs; it will be recomputed. 2563572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Regs.clear(); 2564572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2565572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t FIdx = 0, NumForms = LU.Formulae.size(); 2566572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FIdx != NumForms; ++FIdx) { 2567572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula &F = LU.Formulae[FIdx]; 2568572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2569572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 2> Key; 2570572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator J = F.BaseRegs.begin(), 2571572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = F.BaseRegs.end(); J != JE; ++J) { 2572572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *J; 2573572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (RegUses.isRegUsedByUsesOtherThan(Reg, LUIdx)) 2574572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Key.push_back(Reg); 2575572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2576572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg && 2577572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.isRegUsedByUsesOtherThan(F.ScaledReg, LUIdx)) 2578572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Key.push_back(F.ScaledReg); 2579572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Unstable sort by host order ok, because this is only used for 2580572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // uniquifying. 2581572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::sort(Key.begin(), Key.end()); 2582572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2583572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::pair<BestFormulaeTy::const_iterator, bool> P = 2584572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BestFormulae.insert(std::make_pair(Key, FIdx)); 2585572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!P.second) { 2586572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula &Best = LU.Formulae[P.first->second]; 2587572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Sorter.operator()(F, Best)) 2588572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::swap(F, Best); 2589572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "Filtering out "; F.print(dbgs()); 2590572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << "\n" 2591572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman " in favor of "; Best.print(dbgs()); 2592572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << '\n'); 2593572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#ifndef NDEBUG 2594572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed = true; 2595572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#endif 2596572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::swap(F, LU.Formulae.back()); 2597572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Formulae.pop_back(); 2598572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman --FIdx; 2599572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman --NumForms; 2600572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2601572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2602572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) LU.Regs.insert(F.ScaledReg); 2603572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); 2604572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2605572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BestFormulae.clear(); 2606572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2607572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2608572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(if (Changed) { 26099214b82c5446791b280821bbd892dca633130f80Dan Gohman dbgs() << "\n" 26109214b82c5446791b280821bbd892dca633130f80Dan Gohman "After filtering out undesirable candidates:\n"; 2611572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_uses(dbgs()); 2612572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman }); 2613572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2614572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 26153f46a3abeedba8d517b4182de34c821d752db058Dan Gohman/// NarrowSearchSpaceUsingHeuristics - If there are an extraordinary number of 2616572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// formulae to choose from, use some rough heuristics to prune down the number 26173f46a3abeedba8d517b4182de34c821d752db058Dan Gohman/// of formulae. This keeps the main solver from taking an extraordinary amount 2618572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// of time in some worst-case scenarios. 2619572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::NarrowSearchSpaceUsingHeuristics() { 2620572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // This is a rough guess that seems to work fairly well. 2621572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const size_t Limit = UINT16_MAX; 2622572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2623572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 4> Taken; 2624572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (;;) { 2625572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Estimate the worst-case number of solutions we might consider. We almost 2626572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // never consider this many solutions because we prune the search space, 2627572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // but the pruning isn't always sufficient. 2628572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman uint32_t Power = 1; 2629572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(), 2630572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Uses.end(); I != E; ++I) { 2631572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t FSize = I->Formulae.size(); 2632572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (FSize >= Limit) { 2633572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Power = Limit; 2634572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 2635572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2636572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Power *= FSize; 2637572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Power >= Limit) 2638572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 2639572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2640572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Power < Limit) 2641572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman break; 2642572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2643572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ok, we have too many of formulae on our hands to conveniently handle. 2644572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Use a rough heuristic to thin out the list. 2645572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2646572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Pick the register which is used by the most LSRUses, which is likely 2647572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // to be a good reuse register candidate. 2648572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Best = 0; 2649572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned BestNum = 0; 2650572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end(); 2651572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I != E; ++I) { 2652572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *I; 2653572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Taken.count(Reg)) 2654572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2655572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Best) 2656572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Best = Reg; 2657572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else { 2658572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman unsigned Count = RegUses.getUsedByIndices(Reg).count(); 2659572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Count > BestNum) { 2660572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Best = Reg; 2661572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman BestNum = Count; 2662572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2663572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2664572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2665572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2666572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best 26673f46a3abeedba8d517b4182de34c821d752db058Dan Gohman << " will yield profitable reuse.\n"); 2668572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Taken.insert(Best); 2669572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2670572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // In any use with formulae which references this register, delete formulae 2671572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // which don't reference it. 2672572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<LSRUse>::iterator I = Uses.begin(), 2673572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Uses.end(); I != E; ++I) { 2674572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LSRUse &LU = *I; 2675572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!LU.Regs.count(Best)) continue; 2676572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2677572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Clear out the set of used regs; it will be recomputed. 2678572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Regs.clear(); 2679572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2680572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { 2681572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Formula &F = LU.Formulae[i]; 2682572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!F.referencesReg(Best)) { 2683572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n'); 2684572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::swap(LU.Formulae.back(), F); 2685572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Formulae.pop_back(); 2686572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman --e; 2687572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman --i; 2688572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman continue; 2689572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2690572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2691572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.ScaledReg) LU.Regs.insert(F.ScaledReg); 2692572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); 2693572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2694572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2695572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2696572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "After pre-selection:\n"; 2697572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_uses(dbgs())); 2698572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2699572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2700572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2701572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// SolveRecurse - This is the recursive solver. 2702572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::SolveRecurse(SmallVectorImpl<const Formula *> &Solution, 2703572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost &SolutionCost, 2704572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<const Formula *> &Workspace, 2705572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Cost &CurCost, 2706572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SmallPtrSet<const SCEV *, 16> &CurRegs, 2707572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseSet<const SCEV *> &VisitedRegs) const { 2708572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Some ideas: 2709572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - prune more: 2710572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - use more aggressive filtering 2711572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - sort the formula so that the most profitable solutions are found first 2712572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - sort the uses too 2713572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - search faster: 27143f46a3abeedba8d517b4182de34c821d752db058Dan Gohman // - don't compute a cost, and then compare. compare while computing a cost 2715572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // and bail early. 2716572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // - track register sets with SmallBitVector 2717572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2718572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const LSRUse &LU = Uses[Workspace.size()]; 2719572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2720572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If this use references any register that's already a part of the 2721572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // in-progress solution, consider it a requirement that a formula must 2722572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // reference that register in order to be considered. This prunes out 2723572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // unprofitable searching. 2724572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallSetVector<const SCEV *, 4> ReqRegs; 2725572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallPtrSet<const SCEV *, 16>::const_iterator I = CurRegs.begin(), 2726572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = CurRegs.end(); I != E; ++I) 27279214b82c5446791b280821bbd892dca633130f80Dan Gohman if (LU.Regs.count(*I)) 2728572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ReqRegs.insert(*I); 2729572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 27309214b82c5446791b280821bbd892dca633130f80Dan Gohman bool AnySatisfiedReqRegs = false; 2731572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> NewRegs; 2732572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost NewCost; 27339214b82c5446791b280821bbd892dca633130f80Dan Gohmanretry: 2734572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(), 2735572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = LU.Formulae.end(); I != E; ++I) { 2736572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Formula &F = *I; 2737572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2738572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ignore formulae which do not use any of the required registers. 2739572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<const SCEV *, 4>::const_iterator J = ReqRegs.begin(), 2740572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = ReqRegs.end(); J != JE; ++J) { 2741572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *J; 2742572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if ((!F.ScaledReg || F.ScaledReg != Reg) && 2743572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman std::find(F.BaseRegs.begin(), F.BaseRegs.end(), Reg) == 2744572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman F.BaseRegs.end()) 2745572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman goto skip; 2746572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 27479214b82c5446791b280821bbd892dca633130f80Dan Gohman AnySatisfiedReqRegs = true; 2748572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2749572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Evaluate the cost of the current formula. If it's already worse than 2750572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // the current best, prune the search at that point. 2751572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewCost = CurCost; 2752572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewRegs = CurRegs; 2753572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewCost.RateFormula(F, NewRegs, VisitedRegs, L, LU.Offsets, SE, DT); 2754572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (NewCost < SolutionCost) { 2755572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Workspace.push_back(&F); 2756572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Workspace.size() != Uses.size()) { 2757572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SolveRecurse(Solution, SolutionCost, Workspace, NewCost, 2758572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NewRegs, VisitedRegs); 2759572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.getNumRegs() == 1 && Workspace.size() == 1) 2760572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); 2761572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 2762572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "New best at "; NewCost.print(dbgs()); 2763572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << ". Regs:"; 2764572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallPtrSet<const SCEV *, 16>::const_iterator 2765572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = NewRegs.begin(), E = NewRegs.end(); I != E; ++I) 2766572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << ' ' << **I; 2767572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << '\n'); 2768572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2769572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SolutionCost = NewCost; 2770572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Solution = Workspace; 2771572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2772572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Workspace.pop_back(); 2773572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2774572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman skip:; 2775572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 27769214b82c5446791b280821bbd892dca633130f80Dan Gohman 27779214b82c5446791b280821bbd892dca633130f80Dan Gohman // If none of the formulae had all of the required registers, relax the 27789214b82c5446791b280821bbd892dca633130f80Dan Gohman // constraint so that we don't exclude all formulae. 27799214b82c5446791b280821bbd892dca633130f80Dan Gohman if (!AnySatisfiedReqRegs) { 27809214b82c5446791b280821bbd892dca633130f80Dan Gohman ReqRegs.clear(); 27819214b82c5446791b280821bbd892dca633130f80Dan Gohman goto retry; 27829214b82c5446791b280821bbd892dca633130f80Dan Gohman } 2783572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2784572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2785572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::Solve(SmallVectorImpl<const Formula *> &Solution) const { 2786572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const Formula *, 8> Workspace; 2787572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost SolutionCost; 2788572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SolutionCost.Loose(); 2789572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Cost CurCost; 2790572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallPtrSet<const SCEV *, 16> CurRegs; 2791572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DenseSet<const SCEV *> VisitedRegs; 2792572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Workspace.reserve(Uses.size()); 2793572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2794572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SolveRecurse(Solution, SolutionCost, Workspace, CurCost, 2795572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CurRegs, VisitedRegs); 2796572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2797572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Ok, we've now made all our decisions. 2798572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "\n" 2799572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "The chosen solution requires "; SolutionCost.print(dbgs()); 2800572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << ":\n"; 2801572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Uses.size(); i != e; ++i) { 2802572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << " "; 2803572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Uses[i].print(dbgs()); 2804572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << "\n" 2805572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman " "; 2806572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Solution[i]->print(dbgs()); 2807572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << '\n'; 2808572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman }); 2809572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2810572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2811572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// getImmediateDominator - A handy utility for the specific DominatorTree 2812572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// query that we need here. 2813572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// 2814572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic BasicBlock *getImmediateDominator(BasicBlock *BB, DominatorTree &DT) { 2815572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DomTreeNode *Node = DT.getNode(BB); 2816572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Node) return 0; 2817572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Node = Node->getIDom(); 2818572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Node) return 0; 2819572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return Node->getBlock(); 2820572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 2821572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2822e5f76877aee6f33964de105893f0ef338661ecadDan Gohman/// HoistInsertPosition - Helper for AdjustInsertPositionForExpand. Climb up 2823e5f76877aee6f33964de105893f0ef338661ecadDan Gohman/// the dominator tree far as we can go while still being dominated by the 2824e5f76877aee6f33964de105893f0ef338661ecadDan Gohman/// input positions. This helps canonicalize the insert position, which 2825e5f76877aee6f33964de105893f0ef338661ecadDan Gohman/// encourages sharing. 2826e5f76877aee6f33964de105893f0ef338661ecadDan GohmanBasicBlock::iterator 2827e5f76877aee6f33964de105893f0ef338661ecadDan GohmanLSRInstance::HoistInsertPosition(BasicBlock::iterator IP, 2828e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const SmallVectorImpl<Instruction *> &Inputs) 2829e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const { 2830e5f76877aee6f33964de105893f0ef338661ecadDan Gohman for (;;) { 2831e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const Loop *IPLoop = LI.getLoopFor(IP->getParent()); 2832e5f76877aee6f33964de105893f0ef338661ecadDan Gohman unsigned IPLoopDepth = IPLoop ? IPLoop->getLoopDepth() : 0; 2833e5f76877aee6f33964de105893f0ef338661ecadDan Gohman 2834e5f76877aee6f33964de105893f0ef338661ecadDan Gohman BasicBlock *IDom; 2835e5f76877aee6f33964de105893f0ef338661ecadDan Gohman for (BasicBlock *Rung = IP->getParent(); ; Rung = IDom) { 2836e5f76877aee6f33964de105893f0ef338661ecadDan Gohman IDom = getImmediateDominator(Rung, DT); 2837e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (!IDom) return IP; 2838e5f76877aee6f33964de105893f0ef338661ecadDan Gohman 2839e5f76877aee6f33964de105893f0ef338661ecadDan Gohman // Don't climb into a loop though. 2840e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const Loop *IDomLoop = LI.getLoopFor(IDom); 2841e5f76877aee6f33964de105893f0ef338661ecadDan Gohman unsigned IDomDepth = IDomLoop ? IDomLoop->getLoopDepth() : 0; 2842e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (IDomDepth <= IPLoopDepth && 2843e5f76877aee6f33964de105893f0ef338661ecadDan Gohman (IDomDepth != IPLoopDepth || IDomLoop == IPLoop)) 2844e5f76877aee6f33964de105893f0ef338661ecadDan Gohman break; 2845e5f76877aee6f33964de105893f0ef338661ecadDan Gohman } 2846e5f76877aee6f33964de105893f0ef338661ecadDan Gohman 2847e5f76877aee6f33964de105893f0ef338661ecadDan Gohman bool AllDominate = true; 2848e5f76877aee6f33964de105893f0ef338661ecadDan Gohman Instruction *BetterPos = 0; 2849e5f76877aee6f33964de105893f0ef338661ecadDan Gohman Instruction *Tentative = IDom->getTerminator(); 2850e5f76877aee6f33964de105893f0ef338661ecadDan Gohman for (SmallVectorImpl<Instruction *>::const_iterator I = Inputs.begin(), 2851e5f76877aee6f33964de105893f0ef338661ecadDan Gohman E = Inputs.end(); I != E; ++I) { 2852e5f76877aee6f33964de105893f0ef338661ecadDan Gohman Instruction *Inst = *I; 2853e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (Inst == Tentative || !DT.dominates(Inst, Tentative)) { 2854e5f76877aee6f33964de105893f0ef338661ecadDan Gohman AllDominate = false; 2855e5f76877aee6f33964de105893f0ef338661ecadDan Gohman break; 2856e5f76877aee6f33964de105893f0ef338661ecadDan Gohman } 2857e5f76877aee6f33964de105893f0ef338661ecadDan Gohman // Attempt to find an insert position in the middle of the block, 2858e5f76877aee6f33964de105893f0ef338661ecadDan Gohman // instead of at the end, so that it can be used for other expansions. 2859e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (IDom == Inst->getParent() && 2860e5f76877aee6f33964de105893f0ef338661ecadDan Gohman (!BetterPos || DT.dominates(BetterPos, Inst))) 2861e5f76877aee6f33964de105893f0ef338661ecadDan Gohman BetterPos = next(BasicBlock::iterator(Inst)); 2862e5f76877aee6f33964de105893f0ef338661ecadDan Gohman } 2863e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (!AllDominate) 2864e5f76877aee6f33964de105893f0ef338661ecadDan Gohman break; 2865e5f76877aee6f33964de105893f0ef338661ecadDan Gohman if (BetterPos) 2866e5f76877aee6f33964de105893f0ef338661ecadDan Gohman IP = BetterPos; 2867e5f76877aee6f33964de105893f0ef338661ecadDan Gohman else 2868e5f76877aee6f33964de105893f0ef338661ecadDan Gohman IP = Tentative; 2869e5f76877aee6f33964de105893f0ef338661ecadDan Gohman } 2870e5f76877aee6f33964de105893f0ef338661ecadDan Gohman 2871e5f76877aee6f33964de105893f0ef338661ecadDan Gohman return IP; 2872e5f76877aee6f33964de105893f0ef338661ecadDan Gohman} 2873e5f76877aee6f33964de105893f0ef338661ecadDan Gohman 2874e5f76877aee6f33964de105893f0ef338661ecadDan Gohman/// AdjustInsertPositionForExpand - Determine an input position which will be 2875d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman/// dominated by the operands and which will dominate the result. 2876d96eae80107a0881e21d1dda97e5e848ed055ec2Dan GohmanBasicBlock::iterator 2877e5f76877aee6f33964de105893f0ef338661ecadDan GohmanLSRInstance::AdjustInsertPositionForExpand(BasicBlock::iterator IP, 2878e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const LSRFixup &LF, 2879e5f76877aee6f33964de105893f0ef338661ecadDan Gohman const LSRUse &LU) const { 2880d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman // Collect some instructions which must be dominated by the 2881448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman // expanding replacement. These must be dominated by any operands that 2882572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // will be required in the expansion. 2883572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<Instruction *, 4> Inputs; 2884572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Instruction *I = dyn_cast<Instruction>(LF.OperandValToReplace)) 2885572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Inputs.push_back(I); 2886572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::ICmpZero) 2887572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Instruction *I = 2888572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dyn_cast<Instruction>(cast<ICmpInst>(LF.UserInst)->getOperand(1))) 2889572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Inputs.push_back(I); 2890448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (LF.PostIncLoops.count(L)) { 2891448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman if (LF.isUseFullyOutsideLoop(L)) 2892069d6f3396856655d5d4ba155ee16eb0209d38b0Dan Gohman Inputs.push_back(L->getLoopLatch()->getTerminator()); 2893069d6f3396856655d5d4ba155ee16eb0209d38b0Dan Gohman else 2894069d6f3396856655d5d4ba155ee16eb0209d38b0Dan Gohman Inputs.push_back(IVIncInsertPos); 2895069d6f3396856655d5d4ba155ee16eb0209d38b0Dan Gohman } 2896701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman // The expansion must also be dominated by the increment positions of any 2897701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman // loops it for which it is using post-inc mode. 2898701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman for (PostIncLoopSet::const_iterator I = LF.PostIncLoops.begin(), 2899701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman E = LF.PostIncLoops.end(); I != E; ++I) { 2900701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman const Loop *PIL = *I; 2901701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman if (PIL == L) continue; 2902701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman 2903e5f76877aee6f33964de105893f0ef338661ecadDan Gohman // Be dominated by the loop exit. 2904701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman SmallVector<BasicBlock *, 4> ExitingBlocks; 2905701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman PIL->getExitingBlocks(ExitingBlocks); 2906701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman if (!ExitingBlocks.empty()) { 2907701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman BasicBlock *BB = ExitingBlocks[0]; 2908701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman for (unsigned i = 1, e = ExitingBlocks.size(); i != e; ++i) 2909701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]); 2910701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman Inputs.push_back(BB->getTerminator()); 2911701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman } 2912701a4aef7fa0ece4dc1fdbc88b981820564cb4e4Dan Gohman } 2913572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2914572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Then, climb up the immediate dominator tree as far as we can go while 2915572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // still being dominated by the input positions. 2916e5f76877aee6f33964de105893f0ef338661ecadDan Gohman IP = HoistInsertPosition(IP, Inputs); 2917d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 2918d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman // Don't insert instructions before PHI nodes. 2919572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman while (isa<PHINode>(IP)) ++IP; 2920d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 2921d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman // Ignore debug intrinsics. 2922449f31cb9dbf4762935b63946e8120dbe98808ffDan Gohman while (isa<DbgInfoIntrinsic>(IP)) ++IP; 2923572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2924d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman return IP; 2925d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman} 2926d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 2927d96eae80107a0881e21d1dda97e5e848ed055ec2Dan GohmanValue *LSRInstance::Expand(const LSRFixup &LF, 2928d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman const Formula &F, 2929d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman BasicBlock::iterator IP, 2930d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman SCEVExpander &Rewriter, 2931d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman SmallVectorImpl<WeakVH> &DeadInsts) const { 2932d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman const LSRUse &LU = Uses[LF.LUIdx]; 2933d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 2934d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman // Determine an input position which will be dominated by the operands and 2935d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman // which will dominate the result. 2936e5f76877aee6f33964de105893f0ef338661ecadDan Gohman IP = AdjustInsertPositionForExpand(IP, LF, LU); 2937d96eae80107a0881e21d1dda97e5e848ed055ec2Dan Gohman 2938572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Inform the Rewriter if we have a post-increment use, so that it can 2939572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // perform an advantageous expansion. 2940448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Rewriter.setPostInc(LF.PostIncLoops); 2941572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2942572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // This is the type that the user actually needs. 2943572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *OpTy = LF.OperandValToReplace->getType(); 2944572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // This will be the type that we'll initially expand to. 2945572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *Ty = F.getType(); 2946572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!Ty) 2947572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // No type known; just expand directly to the ultimate type. 2948572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ty = OpTy; 2949572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else if (SE.getEffectiveSCEVType(Ty) == SE.getEffectiveSCEVType(OpTy)) 2950572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Expand directly to the ultimate type if it's the right size. 2951572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ty = OpTy; 2952572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // This is the type to do integer arithmetic in. 2953572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Type *IntTy = SE.getEffectiveSCEVType(Ty); 2954572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2955572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Build up a list of operands to add together to form the full base. 2956572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const SCEV *, 8> Ops; 2957572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2958572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Expand the BaseRegs portion. 2959572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(), 2960572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = F.BaseRegs.end(); I != E; ++I) { 2961572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *Reg = *I; 2962572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(!Reg->isZero() && "Zero allocated in a base register!"); 2963572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2964448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman // If we're expanding for a post-inc user, make the post-inc adjustment. 2965448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops); 2966448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Reg = TransformForPostIncUse(Denormalize, Reg, 2967448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman LF.UserInst, LF.OperandValToReplace, 2968448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Loops, SE, DT); 2969572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2970572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(SE.getUnknown(Rewriter.expandCodeFor(Reg, 0, IP))); 2971572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 2972572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2973087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman // Flush the operand list to suppress SCEVExpander hoisting. 2974087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman if (!Ops.empty()) { 2975087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP); 2976087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.clear(); 2977087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.push_back(SE.getUnknown(FullV)); 2978087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman } 2979087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman 2980572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Expand the ScaledReg portion. 2981572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *ICmpScaledV = 0; 2982572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.AM.Scale != 0) { 2983572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *ScaledS = F.ScaledReg; 2984572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2985448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman // If we're expanding for a post-inc user, make the post-inc adjustment. 2986448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops); 2987448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman ScaledS = TransformForPostIncUse(Denormalize, ScaledS, 2988448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman LF.UserInst, LF.OperandValToReplace, 2989448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Loops, SE, DT); 2990572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 2991572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::ICmpZero) { 2992572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // An interesting way of "folding" with an icmp is to use a negated 2993572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // scale, which we'll implement by inserting it into the other operand 2994572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // of the icmp. 2995572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(F.AM.Scale == -1 && 2996572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "The only scale supported by ICmpZero uses is -1!"); 2997572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpScaledV = Rewriter.expandCodeFor(ScaledS, 0, IP); 2998572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 2999572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Otherwise just expand the scaled register and an explicit scale, 3000572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // which is expected to be matched as part of the address. 3001572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScaledS = SE.getUnknown(Rewriter.expandCodeFor(ScaledS, 0, IP)); 3002572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScaledS = SE.getMulExpr(ScaledS, 3003572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getIntegerSCEV(F.AM.Scale, 3004572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ScaledS->getType())); 3005572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(ScaledS); 3006087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman 3007087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman // Flush the operand list to suppress SCEVExpander hoisting. 3008087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP); 3009087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.clear(); 3010087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.push_back(SE.getUnknown(FullV)); 3011572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3012572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3013572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3014087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman // Expand the GV portion. 3015087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman if (F.AM.BaseGV) { 3016087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.push_back(SE.getUnknown(F.AM.BaseGV)); 3017087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman 3018087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman // Flush the operand list to suppress SCEVExpander hoisting. 3019087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP); 3020087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.clear(); 3021087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.push_back(SE.getUnknown(FullV)); 3022087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman } 3023087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman 3024087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman // Expand the immediate portion. 3025572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman int64_t Offset = (uint64_t)F.AM.BaseOffs + LF.Offset; 3026572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Offset != 0) { 3027572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::ICmpZero) { 3028572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // The other interesting way of "folding" with an ICmpZero is to use a 3029572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // negated immediate. 3030572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!ICmpScaledV) 3031572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpScaledV = ConstantInt::get(IntTy, -Offset); 3032572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else { 3033572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Ops.push_back(SE.getUnknown(ICmpScaledV)); 3034572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpScaledV = ConstantInt::get(IntTy, Offset); 3035572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3036572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 3037572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Just add the immediate values. These again are expected to be matched 3038572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // as part of the address. 3039087bd1e3a12893873761736bf0f905a350e9e708Dan Gohman Ops.push_back(SE.getUnknown(ConstantInt::getSigned(IntTy, Offset))); 3040572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3041572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3042572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3043572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Emit instructions summing all the operands. 3044572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const SCEV *FullS = Ops.empty() ? 3045572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getIntegerSCEV(0, IntTy) : 3046572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE.getAddExpr(Ops); 3047572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Value *FullV = Rewriter.expandCodeFor(FullS, Ty, IP); 3048572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3049572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // We're done expanding now, so reset the rewriter. 3050448db1cdef5872713ef77beffacf502ae3450cd7Dan Gohman Rewriter.clearPostInc(); 3051572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3052572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // An ICmpZero Formula represents an ICmp which we're handling as a 3053572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // comparison against zero. Now that we've expanded an expression for that 3054572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // form, update the ICmp's other operand. 3055572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (LU.Kind == LSRUse::ICmpZero) { 3056572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpInst *CI = cast<ICmpInst>(LF.UserInst); 3057572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DeadInsts.push_back(CI->getOperand(1)); 3058572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(!F.AM.BaseGV && "ICmp does not support folding a global value and " 3059572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "a scale at the same time!"); 3060572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (F.AM.Scale == -1) { 3061572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (ICmpScaledV->getType() != OpTy) { 3062572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *Cast = 3063572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CastInst::Create(CastInst::getCastOpcode(ICmpScaledV, false, 3064572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OpTy, false), 3065572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpScaledV, OpTy, "tmp", CI); 3066572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ICmpScaledV = Cast; 3067572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3068572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CI->setOperand(1, ICmpScaledV); 3069572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 3070572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(F.AM.Scale == 0 && 3071572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "ICmp does not support folding a global value and " 3072572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "a scale at the same time!"); 3073572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Constant *C = ConstantInt::getSigned(SE.getEffectiveSCEVType(OpTy), 3074572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman -(uint64_t)Offset); 3075572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (C->getType() != OpTy) 3076572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false, 3077572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OpTy, false), 3078572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman C, OpTy); 3079572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3080572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CI->setOperand(1, C); 3081572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3082572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3083572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3084572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return FullV; 3085572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3086572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 30873a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman/// RewriteForPHI - Helper for Rewrite. PHI nodes are special because the use 30883a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman/// of their operands effectively happens in their predecessor blocks, so the 30893a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman/// expression may need to be expanded in multiple places. 30903a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohmanvoid LSRInstance::RewriteForPHI(PHINode *PN, 30913a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman const LSRFixup &LF, 30923a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman const Formula &F, 30933a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman SCEVExpander &Rewriter, 30943a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman SmallVectorImpl<WeakVH> &DeadInsts, 30953a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman Pass *P) const { 30963a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman DenseMap<BasicBlock *, Value *> Inserted; 30973a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 30983a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman if (PN->getIncomingValue(i) == LF.OperandValToReplace) { 30993a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman BasicBlock *BB = PN->getIncomingBlock(i); 31003a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31013a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // If this is a critical edge, split the edge so that we do not insert 31023a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // the code on all predecessor/successor paths. We do this unless this 31033a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // is the canonical backedge for this loop, which complicates post-inc 31043a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // users. 31053a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman if (e != 1 && BB->getTerminator()->getNumSuccessors() > 1 && 31063a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman !isa<IndirectBrInst>(BB->getTerminator()) && 31073a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman (PN->getParent() != L->getHeader() || !L->contains(BB))) { 31083a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // Split the critical edge. 31093a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman BasicBlock *NewBB = SplitCriticalEdge(BB, PN->getParent(), P); 31103a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31113a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // If PN is outside of the loop and BB is in the loop, we want to 31123a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // move the block to be immediately before the PHI block, not 31133a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // immediately after BB. 31143a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman if (L->contains(BB) && !L->contains(PN)) 31153a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman NewBB->moveBefore(PN->getParent()); 31163a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31173a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // Splitting the edge can reduce the number of PHI entries we have. 31183a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman e = PN->getNumIncomingValues(); 31193a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman BB = NewBB; 31203a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman i = PN->getBasicBlockIndex(BB); 31213a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman } 31223a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31233a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman std::pair<DenseMap<BasicBlock *, Value *>::iterator, bool> Pair = 31243a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman Inserted.insert(std::make_pair(BB, static_cast<Value *>(0))); 31253a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman if (!Pair.second) 31263a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman PN->setIncomingValue(i, Pair.first->second); 31273a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman else { 3128454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman Value *FullV = Expand(LF, F, BB->getTerminator(), Rewriter, DeadInsts); 31293a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31303a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman // If this is reuse-by-noop-cast, insert the noop cast. 31313a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman const Type *OpTy = LF.OperandValToReplace->getType(); 31323a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman if (FullV->getType() != OpTy) 31333a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman FullV = 31343a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman CastInst::Create(CastInst::getCastOpcode(FullV, false, 31353a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman OpTy, false), 31363a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman FullV, LF.OperandValToReplace->getType(), 31373a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman "tmp", BB->getTerminator()); 31383a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 31393a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman PN->setIncomingValue(i, FullV); 31403a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman Pair.first->second = FullV; 31413a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman } 31423a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman } 31433a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman} 31443a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman 3145572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// Rewrite - Emit instructions for the leading candidate expression for this 3146572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// LSRUse (this is called "expanding"), and update the UserInst to reference 3147572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman/// the newly expanded value. 3148572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::Rewrite(const LSRFixup &LF, 3149572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const Formula &F, 3150572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SCEVExpander &Rewriter, 3151572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVectorImpl<WeakVH> &DeadInsts, 3152572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Pass *P) const { 3153572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // First, find an insertion point that dominates UserInst. For PHI nodes, 3154572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // find the nearest block which dominates all the relevant uses. 3155572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (PHINode *PN = dyn_cast<PHINode>(LF.UserInst)) { 3156454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman RewriteForPHI(PN, LF, F, Rewriter, DeadInsts, P); 3157572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } else { 3158454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman Value *FullV = Expand(LF, F, LF.UserInst, Rewriter, DeadInsts); 3159572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3160572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If this is reuse-by-noop-cast, insert the noop cast. 31613a02cbcd0310e6c63a4ac9b8d25fffc258c8b3e4Dan Gohman const Type *OpTy = LF.OperandValToReplace->getType(); 3162572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (FullV->getType() != OpTy) { 3163572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Instruction *Cast = 3164572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CastInst::Create(CastInst::getCastOpcode(FullV, false, OpTy, false), 3165572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FullV, OpTy, "tmp", LF.UserInst); 3166572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FullV = Cast; 3167572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3168572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3169572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Update the user. ICmpZero is handled specially here (for now) because 3170572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Expand may have updated one of the operands of the icmp already, and 3171572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // its new value may happen to be equal to LF.OperandValToReplace, in 3172572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // which case doing replaceUsesOfWith leads to replacing both operands 3173572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // with the same value. TODO: Reorganize this. 3174572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero) 3175572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.UserInst->setOperand(0, FullV); 3176572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman else 3177572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.UserInst->replaceUsesOfWith(LF.OperandValToReplace, FullV); 3178572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3179572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3180572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DeadInsts.push_back(LF.OperandValToReplace); 3181572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3182572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3183572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid 3184572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::ImplementSolution(const SmallVectorImpl<const Formula *> &Solution, 3185572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Pass *P) { 3186572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Keep track of instructions we may have made dead, so that 3187572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // we can remove them after we are done working. 3188572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<WeakVH, 16> DeadInsts; 3189572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3190572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SCEVExpander Rewriter(SE); 3191572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Rewriter.disableCanonicalMode(); 3192572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Rewriter.setIVIncInsertPos(L, IVIncInsertPos); 3193572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3194572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Expand the new value definitions and update the users. 3195572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (size_t i = 0, e = Fixups.size(); i != e; ++i) { 3196572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman size_t LUIdx = Fixups[i].LUIdx; 3197572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3198454d26dc43207ec537d843229db6f5e6a302e23dDan Gohman Rewrite(Fixups[i], *Solution[LUIdx], Rewriter, DeadInsts, P); 3199572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3200572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed = true; 3201572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3202572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3203572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Clean up after ourselves. This must be done before deleting any 3204572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // instructions. 3205572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Rewriter.clear(); 3206f7912df4cbdb44aeac9ac9907c192dfc1e22646dDan Gohman 3207572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed |= DeleteTriviallyDeadInstructions(DeadInsts); 3208572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3209010de25f42dabbb7e0a2fe8b42aecc4285362e0cChris Lattner 3210572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLSRInstance::LSRInstance(const TargetLowering *tli, Loop *l, Pass *P) 3211572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman : IU(P->getAnalysis<IVUsers>()), 3212572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SE(P->getAnalysis<ScalarEvolution>()), 3213572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DT(P->getAnalysis<DominatorTree>()), 3214e5f76877aee6f33964de105893f0ef338661ecadDan Gohman LI(P->getAnalysis<LoopInfo>()), 3215572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman TLI(tli), L(l), Changed(false), IVIncInsertPos(0) { 32165792f51e12d9c8685399e9857799365854ab5bf6Evan Cheng 3217572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If LoopSimplify form is not available, stay out of trouble. 3218572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!L->isLoopSimplifyForm()) return; 3219572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3220572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // If there's no interesting work to be done, bail early. 3221572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (IU.empty()) return; 3222572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3223572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "\nLSR on loop "; 3224572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman WriteAsOperand(dbgs(), L->getHeader(), /*PrintType=*/false); 3225572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << ":\n"); 3226572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3227572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// OptimizeShadowIV - If IV is used in a int-to-float cast 32283f46a3abeedba8d517b4182de34c821d752db058Dan Gohman /// inside the loop then try to eliminate the cast operation. 3229572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OptimizeShadowIV(); 3230572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3231572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Change loop terminating condition to use the postinc iv when possible. 3232572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed |= OptimizeLoopTermCond(); 3233572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3234572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectInterestingTypesAndFactors(); 3235572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectFixupsAndInitialFormulae(); 3236572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman CollectLoopInvariantFixupsAndFormulae(); 3237572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3238572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n"; 3239572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_uses(dbgs())); 3240572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3241572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Now use the reuse data to generate a bunch of interesting ways 3242572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // to formulate the values needed for the uses. 3243572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman GenerateAllReuseFormulae(); 3244572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3245572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman DEBUG(dbgs() << "\n" 3246572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "After generating reuse formulae:\n"; 3247572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_uses(dbgs())); 3248572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3249572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman FilterOutUndesirableDedicatedRegisters(); 3250572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman NarrowSearchSpaceUsingHeuristics(); 3251572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3252572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman SmallVector<const Formula *, 8> Solution; 3253572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Solve(Solution); 3254572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(Solution.size() == Uses.size() && "Malformed solution!"); 3255572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3256572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Release memory that is no longer needed. 3257572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Factors.clear(); 3258572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Types.clear(); 3259572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman RegUses.clear(); 3260572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3261572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#ifndef NDEBUG 3262572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Formulae should be legal. 3263572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(), 3264572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Uses.end(); I != E; ++I) { 3265572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const LSRUse &LU = *I; 3266572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(), 3267572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = LU.Formulae.end(); J != JE; ++J) 3268572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman assert(isLegalUse(J->AM, LU.MinOffset, LU.MaxOffset, 3269572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.Kind, LU.AccessTy, TLI) && 3270572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman "Illegal formula generated!"); 3271572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman }; 3272572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman#endif 3273010de25f42dabbb7e0a2fe8b42aecc4285362e0cChris Lattner 3274572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Now that we've decided what we want, make it so. 3275572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman ImplementSolution(Solution, P); 3276572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3277169974856781a1ce27af9ce6220c390b20c9e6ddNate Begeman 3278572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::print_factors_and_types(raw_ostream &OS) const { 3279572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (Factors.empty() && Types.empty()) return; 32801ce75dcbbcb6a67904a23b4ec701d1e994767c7eEvan Cheng 3281572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "LSR has identified the following interesting factors and types: "; 3282572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool First = true; 3283eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 3284572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<int64_t, 8>::const_iterator 3285572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Factors.begin(), E = Factors.end(); I != E; ++I) { 3286572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << ", "; 3287572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman First = false; 3288572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '*' << *I; 3289572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 32908b0ade3eb8281f9b332d5764cfe5c4ed3b2b32d8Dan Gohman 3291572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallSetVector<const Type *, 4>::const_iterator 3292572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman I = Types.begin(), E = Types.end(); I != E; ++I) { 3293572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman if (!First) OS << ", "; 3294572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman First = false; 3295572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '(' << **I << ')'; 3296572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3297572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '\n'; 3298572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3299c1acc3f764804d25f70d88f937ef9c460143e0f1Dale Johannesen 3300572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::print_fixups(raw_ostream &OS) const { 3301572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "LSR is examining the following fixup sites:\n"; 3302572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<LSRFixup>::const_iterator I = Fixups.begin(), 3303572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Fixups.end(); I != E; ++I) { 3304572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const LSRFixup &LF = *I; 3305572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << " "; 3306572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LF.print(OS); 3307572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '\n'; 3308572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 3309572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3310010ee2d95516fe13a574bce5d682a8f8997ab60bDan Gohman 3311572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::print_uses(raw_ostream &OS) const { 3312572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << "LSR is examining the following uses:\n"; 3313572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(), 3314572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman E = Uses.end(); I != E; ++I) { 3315572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const LSRUse &LU = *I; 3316572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman dbgs() << " "; 3317572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman LU.print(OS); 3318572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '\n'; 3319572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(), 3320572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman JE = LU.Formulae.end(); J != JE; ++J) { 3321572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << " "; 3322572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman J->print(OS); 3323572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman OS << '\n'; 3324572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman } 33256bec5bb344fc0374431aed1cb63418de607a1aecDan Gohman } 3326572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3327572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3328572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::print(raw_ostream &OS) const { 3329572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_factors_and_types(OS); 3330572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_fixups(OS); 3331572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print_uses(OS); 3332572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3333572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3334572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LSRInstance::dump() const { 3335572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman print(errs()); errs() << '\n'; 3336572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3337572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3338572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmannamespace { 3339572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3340572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanclass LoopStrengthReduce : public LoopPass { 3341572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// TLI - Keep a pointer of a TargetLowering to consult for determining 3342572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman /// transformation profitability. 3343572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman const TargetLowering *const TLI; 3344572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3345572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanpublic: 3346572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman static char ID; // Pass ID, replacement for typeid 3347572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman explicit LoopStrengthReduce(const TargetLowering *tli = 0); 3348572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3349572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanprivate: 3350572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool runOnLoop(Loop *L, LPPassManager &LPM); 3351572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman void getAnalysisUsage(AnalysisUsage &AU) const; 3352572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman}; 3353572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3354572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3355572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3356572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanchar LoopStrengthReduce::ID = 0; 3357572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanstatic RegisterPass<LoopStrengthReduce> 3358572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanX("loop-reduce", "Loop Strength Reduction"); 3359572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3360572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanPass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) { 3361572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman return new LoopStrengthReduce(TLI); 3362572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3363572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3364572645cf84060c0fc25cb91d38cb9079918b3a88Dan GohmanLoopStrengthReduce::LoopStrengthReduce(const TargetLowering *tli) 3365572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman : LoopPass(&ID), TLI(tli) {} 3366572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3367572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanvoid LoopStrengthReduce::getAnalysisUsage(AnalysisUsage &AU) const { 3368572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // We split critical edges, so we change the CFG. However, we do update 3369572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // many analyses if they are around. 3370572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addPreservedID(LoopSimplifyID); 3371572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addPreserved("domfrontier"); 3372572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3373e5f76877aee6f33964de105893f0ef338661ecadDan Gohman AU.addRequired<LoopInfo>(); 3374e5f76877aee6f33964de105893f0ef338661ecadDan Gohman AU.addPreserved<LoopInfo>(); 3375572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addRequiredID(LoopSimplifyID); 3376572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addRequired<DominatorTree>(); 3377572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addPreserved<DominatorTree>(); 3378572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addRequired<ScalarEvolution>(); 3379572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addPreserved<ScalarEvolution>(); 3380572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addRequired<IVUsers>(); 3381572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman AU.addPreserved<IVUsers>(); 3382572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman} 3383572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3384572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohmanbool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager & /*LPM*/) { 3385572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman bool Changed = false; 3386572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman 3387572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman // Run the main LSR transformation. 3388572645cf84060c0fc25cb91d38cb9079918b3a88Dan Gohman Changed |= LSRInstance(TLI, L, this).getChanged(); 3389eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman 3390afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman // At this point, it is worth checking to see if any recurrence PHIs are also 339135738ac150afafe2359268d4b2169498c6c98c5fDan Gohman // dead, so that we can remove them as well. 33929fff2187a21f765ed87a25c48552a6942450f3e2Dan Gohman Changed |= DeleteDeadPHIs(L->getHeader()); 3393afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman 33941ce75dcbbcb6a67904a23b4ec701d1e994767c7eEvan Cheng return Changed; 3395eaa13851a7fe604363577350c5cf65c257c4d41aNate Begeman} 3396