1 //===- InductionVars.cpp - Induction Variable Cannonicalization code --------=//
3 // This file implements induction variable cannonicalization of loops.
5 // Specifically, after this executes, the following is true:
6 // - There is a single induction variable for each loop (at least loops that
7 // used to contain at least one induction variable)
8 // * This induction variable starts at 0 and steps by 1 per iteration
9 // * This induction variable is represented by the first PHI node in the
10 // Header block, allowing it to be found easily.
11 // - All other preexisting induction variables are adjusted to operate in
12 // terms of this primary induction variable
13 // - Induction variables with a step size of 0 have been eliminated.
15 // This code assumes the following is true to perform its full job:
16 // - The CFG has been simplified to not have multiple entrances into an
17 // interval header. Interval headers should only have two predecessors,
18 // one from inside of the loop and one from outside of the loop.
20 //===----------------------------------------------------------------------===//
22 #include "llvm/Transforms/Scalar/InductionVars.h"
23 #include "llvm/ConstantVals.h"
24 #include "llvm/Analysis/IntervalPartition.h"
25 #include "llvm/iPHINode.h"
26 #include "llvm/Function.h"
27 #include "llvm/BasicBlock.h"
28 #include "llvm/InstrTypes.h"
29 #include "llvm/Type.h"
30 #include "llvm/Support/CFG.h"
31 #include "Support/STLExtras.h"
36 // isLoopInvariant - Return true if the specified value/basic block source is
37 // an interval invariant computation.
39 static bool isLoopInvariant(cfg::Interval *Int, Value *V) {
40 assert(isa<Constant>(V) || isa<Instruction>(V) || isa<Argument>(V));
42 if (!isa<Instruction>(V))
43 return true; // Constants and arguments are always loop invariant
45 BasicBlock *ValueBlock = cast<Instruction>(V)->getParent();
46 assert(ValueBlock && "Instruction not embedded in basic block!");
48 // For now, only consider values from outside of the interval, regardless of
49 // whether the expression could be lifted out of the loop by some LICM.
51 // TODO: invoke LICM library if we find out it would be useful.
53 return !Int->contains(ValueBlock);
57 // isLinearInductionVariableH - Return isLIV if the expression V is a linear
58 // expression defined in terms of loop invariant computations, and a single
59 // instance of the PHI node PN. Return isLIC if the expression V is a loop
60 // invariant computation. Return isNLIV if the expression is a negated linear
61 // induction variable. Return isOther if it is neither.
63 // Currently allowed operators are: ADD, SUB, NEG
64 // TODO: This should allow casts!
66 enum LIVType { isLIV, isLIC, isNLIV, isOther };
68 // neg - Negate the sign of a LIV expression.
69 inline LIVType neg(LIVType T) {
70 assert(T == isLIV || T == isNLIV && "Negate Only works on LIV expressions");
71 return T == isLIV ? isNLIV : isLIV;
74 static LIVType isLinearInductionVariableH(cfg::Interval *Int, Value *V,
76 if (V == PN) { return isLIV; } // PHI node references are (0+PHI)
77 if (isLoopInvariant(Int, V)) return isLIC;
79 // loop variant computations must be instructions!
80 Instruction *I = cast<Instruction>(V);
81 switch (I->getOpcode()) { // Handle each instruction seperately
82 case Instruction::Add:
83 case Instruction::Sub: {
84 Value *SubV1 = cast<BinaryOperator>(I)->getOperand(0);
85 Value *SubV2 = cast<BinaryOperator>(I)->getOperand(1);
86 LIVType SubLIVType1 = isLinearInductionVariableH(Int, SubV1, PN);
87 if (SubLIVType1 == isOther) return isOther; // Early bailout
88 LIVType SubLIVType2 = isLinearInductionVariableH(Int, SubV2, PN);
90 switch (SubLIVType2) {
91 case isOther: return isOther; // Unknown subexpression type
92 case isLIC: return SubLIVType1; // Constant offset, return type #1
95 // So now we know that we have a linear induction variable on the RHS of
96 // the ADD or SUB instruction. SubLIVType1 cannot be isOther, so it is
97 // either a Loop Invariant computation, or a LIV type.
98 if (SubLIVType1 == isLIC) {
99 // Loop invariant computation, we know this is a LIV then.
100 return (I->getOpcode() == Instruction::Add) ?
101 SubLIVType2 : neg(SubLIVType2);
104 // If the LHS is also a LIV Expression, we cannot add two LIVs together
105 if (I->getOpcode() == Instruction::Add) return isOther;
107 // We can only subtract two LIVs if they are the same type, which yields
108 // a LIC, because the LIVs cancel each other out.
109 return (SubLIVType1 == SubLIVType2) ? isLIC : isOther;
114 default: // Any other instruction is not a LINEAR induction var
119 // isLinearInductionVariable - Return true if the specified expression is a
120 // "linear induction variable", which is an expression involving a single
121 // instance of the PHI node and a loop invariant value that is added or
122 // subtracted to the PHI node. This is calculated by walking the SSA graph
124 static inline bool isLinearInductionVariable(cfg::Interval *Int, Value *V,
126 return isLinearInductionVariableH(Int, V, PN) == isLIV;
130 // isSimpleInductionVar - Return true iff the cannonical induction variable PN
131 // has an initializer of the constant value 0, and has a step size of constant
133 static inline bool isSimpleInductionVar(PHINode *PN) {
134 assert(PN->getNumIncomingValues() == 2 && "Must have cannonical PHI node!");
135 Value *Initializer = PN->getIncomingValue(0);
136 if (!isa<Constant>(Initializer)) return false;
138 if (Initializer->getType()->isSigned()) { // Signed constant value...
139 if (((ConstantSInt*)Initializer)->getValue() != 0) return false;
140 } else if (Initializer->getType()->isUnsigned()) { // Unsigned constant value
141 if (((ConstantUInt*)Initializer)->getValue() != 0) return false;
143 return false; // Not signed or unsigned? Must be FP type or something
146 Value *StepExpr = PN->getIncomingValue(1);
147 if (!isa<Instruction>(StepExpr) ||
148 cast<Instruction>(StepExpr)->getOpcode() != Instruction::Add)
151 BinaryOperator *I = cast<BinaryOperator>(StepExpr);
152 assert(isa<PHINode>(I->getOperand(0)) &&
153 "PHI node should be first operand of ADD instruction!");
155 // Get the right hand side of the ADD node. See if it is a constant 1.
156 Value *StepSize = I->getOperand(1);
157 if (!isa<Constant>(StepSize)) return false;
159 if (StepSize->getType()->isSigned()) { // Signed constant value...
160 if (((ConstantSInt*)StepSize)->getValue() != 1) return false;
161 } else if (StepSize->getType()->isUnsigned()) { // Unsigned constant value
162 if (((ConstantUInt*)StepSize)->getValue() != 1) return false;
164 return false; // Not signed or unsigned? Must be FP type or something
167 // At this point, we know the initializer is a constant value 0 and the step
168 // size is a constant value 1. This is our simple induction variable!
172 // InjectSimpleInductionVariable - Insert a cannonical induction variable into
173 // the interval header Header. This assumes that the flow graph is in
174 // simplified form (so we know that the header block has exactly 2 predecessors)
176 // TODO: This should inherit the largest type that is being used by the already
177 // present induction variables (instead of always using uint)
179 static PHINode *InjectSimpleInductionVariable(cfg::Interval *Int) {
180 std::string PHIName, AddName;
182 BasicBlock *Header = Int->getHeaderNode();
183 Function *M = Header->getParent();
185 if (M->hasSymbolTable()) {
186 // Only name the induction variable if the method isn't stripped.
188 AddName = "ind_var_next";
191 // Create the neccesary instructions...
192 PHINode *PN = new PHINode(Type::UIntTy, PHIName);
193 Constant *One = ConstantUInt::get(Type::UIntTy, 1);
194 Constant *Zero = ConstantUInt::get(Type::UIntTy, 0);
195 BinaryOperator *AddNode = BinaryOperator::create(Instruction::Add,
198 // Figure out which predecessors I have to play with... there should be
199 // exactly two... one of which is a loop predecessor, and one of which is not.
201 pred_iterator PI = pred_begin(Header);
202 assert(PI != pred_end(Header) && "Header node should have 2 preds!");
203 BasicBlock *Pred1 = *PI; ++PI;
204 assert(PI != pred_end(Header) && "Header node should have 2 preds!");
205 BasicBlock *Pred2 = *PI;
206 assert(++PI == pred_end(Header) && "Header node should have 2 preds!");
208 // Make Pred1 be the loop entrance predecessor, Pred2 be the Loop predecessor
209 if (Int->contains(Pred1)) std::swap(Pred1, Pred2);
211 assert(!Int->contains(Pred1) && "Pred1 should be loop entrance!");
212 assert( Int->contains(Pred2) && "Pred2 should be looping edge!");
214 // Link the instructions into the PHI node...
215 PN->addIncoming(Zero, Pred1); // The initializer is first argument
216 PN->addIncoming(AddNode, Pred2); // The step size is second PHI argument
218 // Insert the PHI node into the Header of the loop. It shall be the first
219 // instruction, because the "Simple" Induction Variable must be first in the
222 BasicBlock::InstListType &IL = Header->getInstList();
225 // Insert the Add instruction as the first (non-phi) instruction in the
226 // header node's basic block.
227 BasicBlock::iterator I = IL.begin();
228 while (isa<PHINode>(*I)) ++I;
229 IL.insert(I, AddNode);
233 // ProcessInterval - This function is invoked once for each interval in the
234 // IntervalPartition of the program. It looks for auxilliary induction
235 // variables in loops. If it finds one, it:
236 // * Cannonicalizes the induction variable. This consists of:
237 // A. Making the first element of the PHI node be the loop invariant
238 // computation, and the second element be the linear induction portion.
239 // B. Changing the first element of the linear induction portion of the PHI
240 // node to be of the form ADD(PHI, <loop invariant expr>).
241 // * Add the induction variable PHI to a list of induction variables found.
243 // After this, a list of cannonical induction variables is known. This list
244 // is searched to see if there is an induction variable that counts from
245 // constant 0 with a step size of constant 1. If there is not one, one is
246 // injected into the loop. Thus a "simple" induction variable is always known
248 // One a simple induction variable is known, all other induction variables are
249 // modified to refer to the "simple" induction variable.
251 static bool ProcessInterval(cfg::Interval *Int) {
252 if (!Int->isLoop()) return false; // Not a loop? Ignore it!
254 std::vector<PHINode *> InductionVars;
256 BasicBlock *Header = Int->getHeaderNode();
257 // Loop over all of the PHI nodes in the interval header...
258 for (BasicBlock::iterator I = Header->begin(), E = Header->end();
259 I != E && isa<PHINode>(*I); ++I) {
260 PHINode *PN = cast<PHINode>(*I);
261 if (PN->getNumIncomingValues() != 2) { // These should be eliminated by now.
262 cerr << "Found interval header with more than 2 predecessors! Ignoring\n";
263 return false; // Todo, make an assertion.
266 // For this to be an induction variable, one of the arguments must be a
267 // loop invariant expression, and the other must be an expression involving
268 // the PHI node, along with possible additions and subtractions of loop
271 BasicBlock *BB1 = PN->getIncomingBlock(0);
272 Value *V1 = PN->getIncomingValue(0);
273 BasicBlock *BB2 = PN->getIncomingBlock(1);
274 Value *V2 = PN->getIncomingValue(1);
276 // Figure out which computation is loop invariant...
277 if (!isLoopInvariant(Int, V1)) {
278 // V1 is *not* loop invariant. Check to see if V2 is:
279 if (isLoopInvariant(Int, V2)) {
280 // They *are* loop invariant. Exchange BB1/BB2 and V1/V2 so that
281 // V1 is always the loop invariant computation.
282 std::swap(V1, V2); std::swap(BB1, BB2);
284 // Neither value is loop invariant. Must not be an induction variable.
285 // This case can happen if there is an unreachable loop in the CFG that
286 // has two tail loops in it that was not split by the cleanup phase
292 // At this point, we know that BB1/V1 are loop invariant. We don't know
293 // anything about BB2/V2. Check now to see if V2 is a linear induction
296 cerr << "Found loop invariant computation: " << V1 << "\n";
298 if (!isLinearInductionVariable(Int, V2, PN))
299 continue; // No, it is not a linear ind var, ignore the PHI node.
300 cerr << "Found linear induction variable: " << V2;
302 // TODO: Cannonicalize V2
304 // Add this PHI node to the list of induction variables found...
305 InductionVars.push_back(PN);
308 // No induction variables found?
309 if (InductionVars.empty()) return false;
311 // Search to see if there is already a "simple" induction variable.
312 std::vector<PHINode*>::iterator It =
313 find_if(InductionVars.begin(), InductionVars.end(), isSimpleInductionVar);
315 PHINode *PrimaryIndVar;
317 // A simple induction variable was not found, inject one now...
318 if (It == InductionVars.end()) {
319 PrimaryIndVar = InjectSimpleInductionVariable(Int);
321 // Move the PHI node for this induction variable to the start of the PHI
322 // list in HeaderNode... we do not need to do this for the inserted case
323 // because the inserted node will always be placed at the beginning of
327 BasicBlock::iterator i =
328 find(Header->begin(), Header->end(), PrimaryIndVar);
329 assert(i != Header->end() &&
330 "How could Primary IndVar not be in the header!?!!?");
332 if (i != Header->begin())
333 std::iter_swap(i, Header->begin());
336 // Now we know that there is a simple induction variable PrimaryIndVar.
337 // Simplify all of the other induction variables to use this induction
338 // variable as their counter, and destroy the PHI nodes that correspond to
344 cerr << "Found Interval Header with indvars (primary indvar should be first "
345 << "phi): \n" << Header << "\nPrimaryIndVar: " << PrimaryIndVar;
347 return false; // TODO: true;
351 // ProcessIntervalPartition - This function loops over the interval partition
352 // processing each interval with ProcessInterval
354 static bool ProcessIntervalPartition(cfg::IntervalPartition &IP) {
355 // This currently just prints out information about the interval structure
358 static unsigned N = 0;
359 cerr << "\n***********Interval Partition #" << (++N) << "************\n\n";
360 copy(IP.begin(), IP.end(), ostream_iterator<cfg::Interval*>(cerr, "\n"));
362 cerr << "\n*********** PERFORMING WORK ************\n\n";
364 // Loop over all of the intervals in the partition and look for induction
365 // variables in intervals that represent loops.
367 return reduce_apply(IP.begin(), IP.end(), bitwise_or<bool>(), false,
368 std::ptr_fun(ProcessInterval));
371 // DoInductionVariableCannonicalize - Simplify induction variables in loops.
372 // This function loops over an interval partition of a program, reducing it
373 // until the graph is gone.
375 bool InductionVariableCannonicalize::doIt(Function *M,
376 cfg::IntervalPartition &IP) {
377 bool Changed = false;
380 while (!IP->isDegeneratePartition()) {
381 Changed |= ProcessIntervalPartition(*IP);
383 // Calculate the reduced version of this graph until we get to an
384 // irreducible graph or a degenerate graph...
386 cfg::IntervalPartition *NewIP = new cfg::IntervalPartition(*IP, false);
387 if (NewIP->size() == IP->size()) {
388 cerr << "IRREDUCIBLE GRAPH FOUND!!!\n";
401 bool InductionVariableCannonicalize::runOnMethod(Function *F) {
402 return doIt(F, getAnalysis<cfg::IntervalPartition>());
405 // getAnalysisUsageInfo - This function works on the call graph of a module.
406 // It is capable of updating the call graph to reflect the new state of the
409 void InductionVariableCannonicalize::getAnalysisUsageInfo(
410 Pass::AnalysisSet &Required,
411 Pass::AnalysisSet &Destroyed,
412 Pass::AnalysisSet &Provided) {
413 Required.push_back(cfg::IntervalPartition::ID);