2005-07-30 00:12:19 +00:00
|
|
|
//===---- llvm/Analysis/ScalarEvolutionExpander.h - SCEV Exprs --*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-07-30 00:12:19 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the classes used to generate code from scalar expressions.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_ANALYSIS_SCALAREVOLUTION_EXPANDER_H
|
|
|
|
#define LLVM_ANALYSIS_SCALAREVOLUTION_EXPANDER_H
|
|
|
|
|
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/Type.h"
|
|
|
|
#include "llvm/Analysis/ScalarEvolution.h"
|
|
|
|
#include "llvm/Analysis/ScalarEvolutionExpressions.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
/// SCEVExpander - This class uses information about analyze scalars to
|
|
|
|
/// rewrite expressions in canonical form.
|
|
|
|
///
|
|
|
|
/// Clients should create an instance of this class when rewriting is needed,
|
2006-11-27 01:05:10 +00:00
|
|
|
/// and destroy it when finished to allow the release of the associated
|
2005-07-30 00:12:19 +00:00
|
|
|
/// memory.
|
|
|
|
struct SCEVExpander : public SCEVVisitor<SCEVExpander, Value*> {
|
|
|
|
ScalarEvolution &SE;
|
|
|
|
LoopInfo &LI;
|
|
|
|
std::map<SCEVHandle, Value*> InsertedExpressions;
|
|
|
|
std::set<Instruction*> InsertedInstructions;
|
|
|
|
|
|
|
|
Instruction *InsertPt;
|
|
|
|
|
|
|
|
friend struct SCEVVisitor<SCEVExpander, Value*>;
|
|
|
|
public:
|
|
|
|
SCEVExpander(ScalarEvolution &se, LoopInfo &li) : SE(se), LI(li) {}
|
|
|
|
|
2006-02-04 05:49:01 +00:00
|
|
|
LoopInfo &getLoopInfo() const { return LI; }
|
|
|
|
|
2005-07-30 00:12:19 +00:00
|
|
|
/// clear - Erase the contents of the InsertedExpressions map so that users
|
2005-07-30 18:33:25 +00:00
|
|
|
/// trying to expand the same expression into multiple BasicBlocks or
|
2005-07-30 00:12:19 +00:00
|
|
|
/// different places within the same BasicBlock can do so.
|
|
|
|
void clear() { InsertedExpressions.clear(); }
|
2005-07-30 18:33:25 +00:00
|
|
|
|
2005-07-30 00:12:19 +00:00
|
|
|
/// isInsertedInstruction - Return true if the specified instruction was
|
|
|
|
/// inserted by the code rewriter. If so, the client should not modify the
|
|
|
|
/// instruction.
|
|
|
|
bool isInsertedInstruction(Instruction *I) const {
|
|
|
|
return InsertedInstructions.count(I);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getOrInsertCanonicalInductionVariable - This method returns the
|
|
|
|
/// canonical induction variable of the specified type for the specified
|
|
|
|
/// loop (inserting one if there is none). A canonical induction variable
|
|
|
|
/// starts at zero and steps by one on each iteration.
|
|
|
|
Value *getOrInsertCanonicalInductionVariable(const Loop *L, const Type *Ty){
|
2007-01-21 00:29:26 +00:00
|
|
|
assert(Ty->isInteger() && "Can only insert integer induction variables!");
|
2007-10-22 18:31:58 +00:00
|
|
|
SCEVHandle H = SE.getAddRecExpr(SE.getIntegerSCEV(0, Ty),
|
|
|
|
SE.getIntegerSCEV(1, Ty), L);
|
2005-07-30 00:12:19 +00:00
|
|
|
return expand(H);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// addInsertedValue - Remember the specified instruction as being the
|
|
|
|
/// canonical form for the specified SCEV.
|
|
|
|
void addInsertedValue(Instruction *I, SCEV *S) {
|
|
|
|
InsertedExpressions[S] = (Value*)I;
|
|
|
|
InsertedInstructions.insert(I);
|
|
|
|
}
|
|
|
|
|
2007-06-06 01:22:09 +00:00
|
|
|
Instruction *getInsertionPoint() const { return InsertPt; }
|
|
|
|
|
2005-07-30 00:12:19 +00:00
|
|
|
/// expandCodeFor - Insert code to directly compute the specified SCEV
|
|
|
|
/// expression into the program. The inserted code is inserted into the
|
|
|
|
/// specified block.
|
2008-06-22 19:09:18 +00:00
|
|
|
Value *expandCodeFor(SCEVHandle SH, Instruction *IP);
|
2005-07-30 00:12:19 +00:00
|
|
|
|
2006-02-04 09:51:33 +00:00
|
|
|
/// InsertCastOfTo - Insert a cast of V to the specified type, doing what
|
|
|
|
/// we can to share the casts.
|
2006-12-13 08:06:42 +00:00
|
|
|
static Value *InsertCastOfTo(Instruction::CastOps opcode, Value *V,
|
|
|
|
const Type *Ty);
|
2007-04-13 05:04:18 +00:00
|
|
|
/// InsertBinop - Insert the specified binary operator, doing a small amount
|
|
|
|
/// of work to avoid inserting an obviously redundant operation.
|
|
|
|
static Value *InsertBinop(Instruction::BinaryOps Opcode, Value *LHS,
|
2008-06-15 19:07:39 +00:00
|
|
|
Value *RHS, Instruction *InsertPt);
|
2005-07-30 00:12:19 +00:00
|
|
|
protected:
|
2007-08-20 21:17:26 +00:00
|
|
|
Value *expand(SCEV *S);
|
|
|
|
|
2005-07-30 00:12:19 +00:00
|
|
|
Value *visitConstant(SCEVConstant *S) {
|
|
|
|
return S->getValue();
|
|
|
|
}
|
|
|
|
|
2008-06-22 19:09:18 +00:00
|
|
|
Value *visitTruncateExpr(SCEVTruncateExpr *S);
|
2005-07-30 00:12:19 +00:00
|
|
|
|
2008-06-22 19:09:18 +00:00
|
|
|
Value *visitZeroExtendExpr(SCEVZeroExtendExpr *S);
|
2005-07-30 00:12:19 +00:00
|
|
|
|
2008-06-22 19:09:18 +00:00
|
|
|
Value *visitSignExtendExpr(SCEVSignExtendExpr *S);
|
2007-06-15 14:38:12 +00:00
|
|
|
|
2008-06-18 16:37:11 +00:00
|
|
|
Value *visitAddExpr(SCEVAddExpr *S);
|
2005-07-30 00:12:19 +00:00
|
|
|
|
|
|
|
Value *visitMulExpr(SCEVMulExpr *S);
|
|
|
|
|
2008-02-11 11:03:14 +00:00
|
|
|
Value *visitUDivExpr(SCEVUDivExpr *S) {
|
2007-06-15 14:38:12 +00:00
|
|
|
Value *LHS = expand(S->getLHS());
|
|
|
|
Value *RHS = expand(S->getRHS());
|
2008-02-11 11:03:14 +00:00
|
|
|
return InsertBinop(Instruction::UDiv, LHS, RHS, InsertPt);
|
2005-07-30 00:12:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Value *visitAddRecExpr(SCEVAddRecExpr *S);
|
|
|
|
|
2007-11-25 22:41:31 +00:00
|
|
|
Value *visitSMaxExpr(SCEVSMaxExpr *S);
|
|
|
|
|
2008-02-20 06:48:22 +00:00
|
|
|
Value *visitUMaxExpr(SCEVUMaxExpr *S);
|
|
|
|
|
2005-07-30 00:12:19 +00:00
|
|
|
Value *visitUnknown(SCEVUnknown *S) {
|
|
|
|
return S->getValue();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|