2006-05-27 05:11:53 +08:00
|
|
|
//===-- LCSSA.cpp - Convert loops into loop-closed SSA form ---------------===//
|
2006-05-26 21:58:26 +08:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-05-26 21:58:26 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This pass transforms loops by placing phi nodes at the end of the loops for
|
|
|
|
// all values that are live across the loop boundary. For example, it turns
|
|
|
|
// the left into the right code:
|
|
|
|
//
|
|
|
|
// for (...) for (...)
|
2007-05-12 05:10:54 +08:00
|
|
|
// if (c) if (c)
|
2006-05-26 21:58:26 +08:00
|
|
|
// X1 = ... X1 = ...
|
|
|
|
// else else
|
|
|
|
// X2 = ... X2 = ...
|
|
|
|
// X3 = phi(X1, X2) X3 = phi(X1, X2)
|
2008-06-03 08:57:21 +08:00
|
|
|
// ... = X3 + 4 X4 = phi(X3)
|
|
|
|
// ... = X4 + 4
|
2006-05-26 21:58:26 +08:00
|
|
|
//
|
|
|
|
// This is still valid LLVM; the extra phi nodes are purely redundant, and will
|
|
|
|
// be trivially eliminated by InstCombine. The major benefit of this
|
|
|
|
// transformation is that it makes many other loop optimizations, such as
|
|
|
|
// LoopUnswitching, simpler.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-12-20 06:17:40 +08:00
|
|
|
#define DEBUG_TYPE "lcssa"
|
2006-05-27 05:11:53 +08:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
2006-07-09 16:14:06 +08:00
|
|
|
#include "llvm/Constants.h"
|
2006-05-26 21:58:26 +08:00
|
|
|
#include "llvm/Pass.h"
|
|
|
|
#include "llvm/Function.h"
|
|
|
|
#include "llvm/Instructions.h"
|
2009-07-06 06:41:43 +08:00
|
|
|
#include "llvm/LLVMContext.h"
|
2006-06-04 08:02:23 +08:00
|
|
|
#include "llvm/ADT/SetVector.h"
|
2006-05-27 08:31:37 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2006-05-27 05:11:53 +08:00
|
|
|
#include "llvm/Analysis/Dominators.h"
|
2007-07-14 07:57:11 +08:00
|
|
|
#include "llvm/Analysis/LoopPass.h"
|
|
|
|
#include "llvm/Analysis/ScalarEvolution.h"
|
2006-05-26 21:58:26 +08:00
|
|
|
#include "llvm/Support/CFG.h"
|
2007-02-06 07:32:05 +08:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2009-04-22 16:09:13 +08:00
|
|
|
#include "llvm/Support/PredIteratorCache.h"
|
2006-05-27 05:11:53 +08:00
|
|
|
#include <algorithm>
|
2007-02-05 13:23:32 +08:00
|
|
|
#include <map>
|
2006-05-26 21:58:26 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2006-12-20 06:17:40 +08:00
|
|
|
STATISTIC(NumLCSSA, "Number of live out of a loop variables");
|
|
|
|
|
2006-05-26 21:58:26 +08:00
|
|
|
namespace {
|
2007-07-14 07:57:11 +08:00
|
|
|
struct VISIBILITY_HIDDEN LCSSA : public LoopPass {
|
2007-05-06 21:37:16 +08:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2008-09-05 01:05:41 +08:00
|
|
|
LCSSA() : LoopPass(&ID) {}
|
2007-05-02 05:15:47 +08:00
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// Cached analysis information for the current function.
|
|
|
|
LoopInfo *LI;
|
2007-04-19 06:39:00 +08:00
|
|
|
DominatorTree *DT;
|
2006-06-06 12:28:30 +08:00
|
|
|
std::vector<BasicBlock*> LoopBlocks;
|
2009-04-22 16:09:13 +08:00
|
|
|
PredIteratorCache PredCache;
|
2006-05-26 21:58:26 +08:00
|
|
|
|
2007-07-14 07:57:11 +08:00
|
|
|
virtual bool runOnLoop(Loop *L, LPPassManager &LPM);
|
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
void ProcessInstruction(Instruction* Instr,
|
2007-08-21 08:31:24 +08:00
|
|
|
const SmallVector<BasicBlock*, 8>& exitBlocks);
|
2006-05-26 21:58:26 +08:00
|
|
|
|
|
|
|
/// This transformation requires natural loop information & requires that
|
2006-05-27 08:31:37 +08:00
|
|
|
/// loop preheaders be inserted into the CFG. It maintains both of these,
|
|
|
|
/// as well as the CFG. It also requires dominator information.
|
2006-05-26 21:58:26 +08:00
|
|
|
///
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
2006-05-27 05:11:53 +08:00
|
|
|
AU.setPreservesCFG();
|
2006-05-26 21:58:26 +08:00
|
|
|
AU.addRequiredID(LoopSimplifyID);
|
|
|
|
AU.addPreservedID(LoopSimplifyID);
|
|
|
|
AU.addRequired<LoopInfo>();
|
2007-07-14 07:57:11 +08:00
|
|
|
AU.addPreserved<LoopInfo>();
|
2007-04-19 06:39:00 +08:00
|
|
|
AU.addRequired<DominatorTree>();
|
2007-07-14 07:57:11 +08:00
|
|
|
AU.addPreserved<ScalarEvolution>();
|
2007-07-31 04:23:45 +08:00
|
|
|
AU.addPreserved<DominatorTree>();
|
|
|
|
|
|
|
|
// Request DominanceFrontier now, even though LCSSA does
|
|
|
|
// not use it. This allows Pass Manager to schedule Dominance
|
|
|
|
// Frontier early enough such that one LPPassManager can handle
|
|
|
|
// multiple loop transformation passes.
|
|
|
|
AU.addRequired<DominanceFrontier>();
|
|
|
|
AU.addPreserved<DominanceFrontier>();
|
2006-05-26 21:58:26 +08:00
|
|
|
}
|
|
|
|
private:
|
2007-04-15 06:10:17 +08:00
|
|
|
void getLoopValuesUsedOutsideLoop(Loop *L,
|
2009-04-22 16:50:12 +08:00
|
|
|
SetVector<Instruction*> &AffectedValues,
|
|
|
|
const SmallVector<BasicBlock*, 8>& exitBlocks);
|
2006-08-02 08:06:09 +08:00
|
|
|
|
2007-06-04 08:32:22 +08:00
|
|
|
Value *GetValueForBlock(DomTreeNode *BB, Instruction *OrigInst,
|
2008-05-26 18:07:43 +08:00
|
|
|
DenseMap<DomTreeNode*, Value*> &Phis);
|
2006-08-02 08:06:09 +08:00
|
|
|
|
2006-06-06 12:28:30 +08:00
|
|
|
/// inLoop - returns true if the given block is within the current loop
|
2008-02-20 20:07:57 +08:00
|
|
|
bool inLoop(BasicBlock* B) {
|
2006-06-06 12:36:36 +08:00
|
|
|
return std::binary_search(LoopBlocks.begin(), LoopBlocks.end(), B);
|
|
|
|
}
|
2006-05-26 21:58:26 +08:00
|
|
|
};
|
|
|
|
}
|
2008-05-13 08:00:25 +08:00
|
|
|
|
|
|
|
char LCSSA::ID = 0;
|
|
|
|
static RegisterPass<LCSSA> X("lcssa", "Loop-Closed SSA Form Pass");
|
2006-05-26 21:58:26 +08:00
|
|
|
|
2008-10-23 07:32:42 +08:00
|
|
|
Pass *llvm::createLCSSAPass() { return new LCSSA(); }
|
2008-05-13 10:05:11 +08:00
|
|
|
const PassInfo *const llvm::LCSSAID = &X;
|
2006-05-26 21:58:26 +08:00
|
|
|
|
2006-06-09 04:02:53 +08:00
|
|
|
/// runOnFunction - Process all loops in the function, inner-most out.
|
2007-07-14 07:57:11 +08:00
|
|
|
bool LCSSA::runOnLoop(Loop *L, LPPassManager &LPM) {
|
2009-04-22 16:09:13 +08:00
|
|
|
PredCache.clear();
|
2006-06-14 03:37:18 +08:00
|
|
|
|
2007-07-14 07:57:11 +08:00
|
|
|
LI = &LPM.getAnalysis<LoopInfo>();
|
2007-04-19 06:39:00 +08:00
|
|
|
DT = &getAnalysis<DominatorTree>();
|
2007-08-18 05:59:16 +08:00
|
|
|
|
2006-05-27 05:11:53 +08:00
|
|
|
// Speed up queries by creating a sorted list of blocks
|
2006-06-06 12:28:30 +08:00
|
|
|
LoopBlocks.clear();
|
|
|
|
LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end());
|
|
|
|
std::sort(LoopBlocks.begin(), LoopBlocks.end());
|
2006-05-27 05:11:53 +08:00
|
|
|
|
2009-04-22 16:50:12 +08:00
|
|
|
SmallVector<BasicBlock*, 8> exitBlocks;
|
|
|
|
L->getExitBlocks(exitBlocks);
|
|
|
|
|
2007-04-15 06:10:17 +08:00
|
|
|
SetVector<Instruction*> AffectedValues;
|
2009-04-22 16:50:12 +08:00
|
|
|
getLoopValuesUsedOutsideLoop(L, AffectedValues, exitBlocks);
|
2006-05-26 21:58:26 +08:00
|
|
|
|
2006-06-01 04:55:06 +08:00
|
|
|
// If no values are affected, we can save a lot of work, since we know that
|
|
|
|
// nothing will be changed.
|
|
|
|
if (AffectedValues.empty())
|
|
|
|
return false;
|
|
|
|
|
2006-05-28 02:47:11 +08:00
|
|
|
// Iterate over all affected values for this loop and insert Phi nodes
|
|
|
|
// for them in the appropriate exit blocks
|
2006-06-01 04:55:06 +08:00
|
|
|
|
2006-06-04 08:02:23 +08:00
|
|
|
for (SetVector<Instruction*>::iterator I = AffectedValues.begin(),
|
2006-08-02 08:06:09 +08:00
|
|
|
E = AffectedValues.end(); I != E; ++I)
|
|
|
|
ProcessInstruction(*I, exitBlocks);
|
2006-06-01 04:55:06 +08:00
|
|
|
|
2006-06-12 03:22:28 +08:00
|
|
|
assert(L->isLCSSAForm());
|
|
|
|
|
2006-06-06 12:28:30 +08:00
|
|
|
return true;
|
2006-06-01 04:55:06 +08:00
|
|
|
}
|
|
|
|
|
2006-06-09 04:02:53 +08:00
|
|
|
/// processInstruction - Given a live-out instruction, insert LCSSA Phi nodes,
|
|
|
|
/// eliminate all out-of-loop uses.
|
2006-08-02 08:06:09 +08:00
|
|
|
void LCSSA::ProcessInstruction(Instruction *Instr,
|
2007-08-21 08:31:24 +08:00
|
|
|
const SmallVector<BasicBlock*, 8>& exitBlocks) {
|
2006-06-01 04:55:06 +08:00
|
|
|
++NumLCSSA; // We are applying the transformation
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Keep track of the blocks that have the value available already.
|
2008-05-26 18:07:43 +08:00
|
|
|
DenseMap<DomTreeNode*, Value*> Phis;
|
2006-08-02 08:06:09 +08:00
|
|
|
|
2009-06-26 08:31:13 +08:00
|
|
|
BasicBlock *DomBB = Instr->getParent();
|
|
|
|
|
|
|
|
// Invoke instructions are special in that their result value is not available
|
|
|
|
// along their unwind edge. The code below tests to see whether DomBB dominates
|
|
|
|
// the value, so adjust DomBB to the normal destination block, which is
|
|
|
|
// effectively where the value is first usable.
|
|
|
|
if (InvokeInst *Inv = dyn_cast<InvokeInst>(Instr))
|
|
|
|
DomBB = Inv->getNormalDest();
|
|
|
|
|
|
|
|
DomTreeNode *DomNode = DT->getNode(DomBB);
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Insert the LCSSA phi's into the exit blocks (dominated by the value), and
|
|
|
|
// add them to the Phi's map.
|
2007-08-21 08:31:24 +08:00
|
|
|
for (SmallVector<BasicBlock*, 8>::const_iterator BBI = exitBlocks.begin(),
|
2006-06-12 15:10:16 +08:00
|
|
|
BBE = exitBlocks.end(); BBI != BBE; ++BBI) {
|
2006-08-02 08:06:09 +08:00
|
|
|
BasicBlock *BB = *BBI;
|
2007-06-04 08:32:22 +08:00
|
|
|
DomTreeNode *ExitBBNode = DT->getNode(BB);
|
2007-04-19 06:39:00 +08:00
|
|
|
Value *&Phi = Phis[ExitBBNode];
|
2009-06-26 08:31:13 +08:00
|
|
|
if (!Phi && DT->dominates(DomNode, ExitBBNode)) {
|
2008-04-07 04:25:17 +08:00
|
|
|
PHINode *PN = PHINode::Create(Instr->getType(), Instr->getName()+".lcssa",
|
|
|
|
BB->begin());
|
2009-04-22 16:50:12 +08:00
|
|
|
PN->reserveOperandSpace(PredCache.GetNumPreds(BB));
|
2006-11-01 02:56:48 +08:00
|
|
|
|
|
|
|
// Remember that this phi makes the value alive in this block.
|
|
|
|
Phi = PN;
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Add inputs from inside the loop for this PHI.
|
2009-04-22 16:09:13 +08:00
|
|
|
for (BasicBlock** PI = PredCache.GetPreds(BB); *PI; ++PI)
|
2006-11-01 02:56:48 +08:00
|
|
|
PN->addIncoming(Instr, *PI);
|
2006-05-29 03:33:28 +08:00
|
|
|
}
|
2006-06-04 07:22:50 +08:00
|
|
|
}
|
|
|
|
|
2006-05-29 09:00:00 +08:00
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// Record all uses of Instr outside the loop. We need to rewrite these. The
|
|
|
|
// LCSSA phis won't be included because they use the value in the loop.
|
|
|
|
for (Value::use_iterator UI = Instr->use_begin(), E = Instr->use_end();
|
|
|
|
UI != E;) {
|
|
|
|
BasicBlock *UserBB = cast<Instruction>(*UI)->getParent();
|
|
|
|
if (PHINode *P = dyn_cast<PHINode>(*UI)) {
|
2009-01-24 03:40:15 +08:00
|
|
|
UserBB = P->getIncomingBlock(UI);
|
2006-06-14 04:50:09 +08:00
|
|
|
}
|
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// If the user is in the loop, don't rewrite it!
|
2006-08-02 08:16:47 +08:00
|
|
|
if (UserBB == Instr->getParent() || inLoop(UserBB)) {
|
2006-08-02 08:06:09 +08:00
|
|
|
++UI;
|
|
|
|
continue;
|
2006-06-01 14:05:47 +08:00
|
|
|
}
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Otherwise, patch up uses of the value with the appropriate LCSSA Phi,
|
|
|
|
// inserting PHI nodes into join points where needed.
|
2007-04-19 06:39:00 +08:00
|
|
|
Value *Val = GetValueForBlock(DT->getNode(UserBB), Instr, Phis);
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Preincrement the iterator to avoid invalidating it when we change the
|
|
|
|
// value.
|
|
|
|
Use &U = UI.getUse();
|
|
|
|
++UI;
|
|
|
|
U.set(Val);
|
2006-06-01 04:55:06 +08:00
|
|
|
}
|
2006-05-26 21:58:26 +08:00
|
|
|
}
|
|
|
|
|
2006-05-27 05:11:53 +08:00
|
|
|
/// getLoopValuesUsedOutsideLoop - Return any values defined in the loop that
|
|
|
|
/// are used by instructions outside of it.
|
2007-04-15 06:10:17 +08:00
|
|
|
void LCSSA::getLoopValuesUsedOutsideLoop(Loop *L,
|
2009-04-22 16:50:12 +08:00
|
|
|
SetVector<Instruction*> &AffectedValues,
|
|
|
|
const SmallVector<BasicBlock*, 8>& exitBlocks) {
|
2006-06-01 04:55:06 +08:00
|
|
|
// FIXME: For large loops, we may be able to avoid a lot of use-scanning
|
|
|
|
// by using dominance information. In particular, if a block does not
|
|
|
|
// dominate any of the loop exits, then none of the values defined in the
|
|
|
|
// block could be used outside the loop.
|
2009-04-22 16:50:12 +08:00
|
|
|
for (Loop::block_iterator BB = L->block_begin(), BE = L->block_end();
|
|
|
|
BB != BE; ++BB) {
|
2006-05-26 21:58:26 +08:00
|
|
|
for (BasicBlock::iterator I = (*BB)->begin(), E = (*BB)->end(); I != E; ++I)
|
2009-04-22 16:50:12 +08:00
|
|
|
for (Value::use_iterator UI = I->use_begin(), UE = I->use_end(); UI != UE;
|
2006-05-26 21:58:26 +08:00
|
|
|
++UI) {
|
|
|
|
BasicBlock *UserBB = cast<Instruction>(*UI)->getParent();
|
2006-06-14 03:37:18 +08:00
|
|
|
if (PHINode* p = dyn_cast<PHINode>(*UI)) {
|
2009-01-24 03:40:15 +08:00
|
|
|
UserBB = p->getIncomingBlock(UI);
|
2006-06-14 03:37:18 +08:00
|
|
|
}
|
|
|
|
|
2006-08-02 08:16:47 +08:00
|
|
|
if (*BB != UserBB && !inLoop(UserBB)) {
|
2008-07-23 08:34:11 +08:00
|
|
|
AffectedValues.insert(I);
|
2006-06-01 04:55:06 +08:00
|
|
|
break;
|
|
|
|
}
|
2006-05-26 21:58:26 +08:00
|
|
|
}
|
|
|
|
}
|
2006-05-27 05:11:53 +08:00
|
|
|
}
|
2006-06-01 04:55:06 +08:00
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
/// GetValueForBlock - Get the value to use within the specified basic block.
|
|
|
|
/// available values are in Phis.
|
2007-06-04 08:32:22 +08:00
|
|
|
Value *LCSSA::GetValueForBlock(DomTreeNode *BB, Instruction *OrigInst,
|
2008-05-26 18:07:43 +08:00
|
|
|
DenseMap<DomTreeNode*, Value*> &Phis) {
|
2006-11-01 02:56:48 +08:00
|
|
|
// If there is no dominator info for this BB, it is unreachable.
|
|
|
|
if (BB == 0)
|
2009-07-31 07:03:37 +08:00
|
|
|
return UndefValue::get(OrigInst->getType());
|
2006-11-01 02:56:48 +08:00
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// If we have already computed this value, return the previously computed val.
|
2008-05-31 01:31:01 +08:00
|
|
|
if (Phis.count(BB)) return Phis[BB];
|
2006-08-02 08:06:09 +08:00
|
|
|
|
2007-06-04 08:32:22 +08:00
|
|
|
DomTreeNode *IDom = BB->getIDom();
|
2006-08-02 08:06:09 +08:00
|
|
|
|
|
|
|
// Otherwise, there are two cases: we either have to insert a PHI node or we
|
|
|
|
// don't. We need to insert a PHI node if this block is not dominated by one
|
|
|
|
// of the exit nodes from the loop (the loop could have multiple exits, and
|
|
|
|
// though the value defined *inside* the loop dominated all its uses, each
|
|
|
|
// exit by itself may not dominate all the uses).
|
|
|
|
//
|
|
|
|
// The simplest way to check for this condition is by checking to see if the
|
|
|
|
// idom is in the loop. If so, we *know* that none of the exit blocks
|
|
|
|
// dominate this block. Note that we *know* that the block defining the
|
|
|
|
// original instruction is in the idom chain, because if it weren't, then the
|
|
|
|
// original value didn't dominate this use.
|
2007-04-19 06:39:00 +08:00
|
|
|
if (!inLoop(IDom->getBlock())) {
|
2006-08-02 08:06:09 +08:00
|
|
|
// Idom is not in the loop, we must still be "below" the exit block and must
|
|
|
|
// be fully dominated by the value live in the idom.
|
2008-05-31 01:31:01 +08:00
|
|
|
Value* val = GetValueForBlock(IDom, OrigInst, Phis);
|
|
|
|
Phis.insert(std::make_pair(BB, val));
|
|
|
|
return val;
|
2006-08-02 08:06:09 +08:00
|
|
|
}
|
2006-07-09 16:14:06 +08:00
|
|
|
|
2007-04-19 06:39:00 +08:00
|
|
|
BasicBlock *BBN = BB->getBlock();
|
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// Otherwise, the idom is the loop, so we need to insert a PHI node. Do so
|
|
|
|
// now, then get values to fill in the incoming values for the PHI.
|
2008-05-15 18:04:30 +08:00
|
|
|
PHINode *PN = PHINode::Create(OrigInst->getType(),
|
|
|
|
OrigInst->getName() + ".lcssa", BBN->begin());
|
2009-04-22 16:50:12 +08:00
|
|
|
PN->reserveOperandSpace(PredCache.GetNumPreds(BBN));
|
2008-05-31 01:31:01 +08:00
|
|
|
Phis.insert(std::make_pair(BB, PN));
|
2006-11-01 02:56:48 +08:00
|
|
|
|
2006-08-02 08:06:09 +08:00
|
|
|
// Fill in the incoming values for the block.
|
2009-04-22 16:09:13 +08:00
|
|
|
for (BasicBlock** PI = PredCache.GetPreds(BBN); *PI; ++PI)
|
2007-04-19 06:39:00 +08:00
|
|
|
PN->addIncoming(GetValueForBlock(DT->getNode(*PI), OrigInst, Phis), *PI);
|
2006-11-01 02:56:48 +08:00
|
|
|
return PN;
|
2006-06-01 04:55:06 +08:00
|
|
|
}
|
2006-08-02 08:06:09 +08:00
|
|
|
|