diff options
author | Dan Gohman <gohman@apple.com> | 2009-04-22 16:05:50 +0000 |
---|---|---|
committer | Dan Gohman <gohman@apple.com> | 2009-04-22 16:05:50 +0000 |
commit | 6cdc727f2d7f68734526ef078f4632798ad40791 (patch) | |
tree | 59bc5a27f03c90d1face64dc9f4b228c8b3793ea /lib/Analysis | |
parent | b928c57397f61e4c54274818dd63e61e21016d9d (diff) | |
download | external_llvm-6cdc727f2d7f68734526ef078f4632798ad40791.zip external_llvm-6cdc727f2d7f68734526ef078f4632798ad40791.tar.gz external_llvm-6cdc727f2d7f68734526ef078f4632798ad40791.tar.bz2 |
Use BasicBlock::iterator instead of Instruction* for insert points,
to better handle inserting instructions at the end of a block.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@69807 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis')
-rw-r--r-- | lib/Analysis/ScalarEvolutionExpander.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/lib/Analysis/ScalarEvolutionExpander.cpp b/lib/Analysis/ScalarEvolutionExpander.cpp index e3103fa..394ad6c 100644 --- a/lib/Analysis/ScalarEvolutionExpander.cpp +++ b/lib/Analysis/ScalarEvolutionExpander.cpp @@ -100,7 +100,7 @@ Value *SCEVExpander::InsertNoopCastOfTo(Value *V, const Type *Ty) { /// InsertBinop - Insert the specified binary operator, doing a small amount /// of work to avoid inserting an obviously redundant operation. Value *SCEVExpander::InsertBinop(Instruction::BinaryOps Opcode, Value *LHS, - Value *RHS, Instruction *InsertPt) { + Value *RHS, BasicBlock::iterator InsertPt) { // Fold a binop with constant operands. if (Constant *CLHS = dyn_cast<Constant>(LHS)) if (Constant *CRHS = dyn_cast<Constant>(RHS)) @@ -244,7 +244,7 @@ Value *SCEVExpander::visitAddRecExpr(const SCEVAddRecExpr *S) { // the insert point. Otherwise, L is a loop that is a parent of the insert // point loop. If we can, move the multiply to the outer most loop that it // is safe to be in. - Instruction *MulInsertPt = InsertPt; + BasicBlock::iterator MulInsertPt = getInsertionPoint(); Loop *InsertPtLoop = LI.getLoopFor(MulInsertPt->getParent()); if (InsertPtLoop != L && InsertPtLoop && L->contains(InsertPtLoop->getHeader())) { @@ -284,21 +284,21 @@ Value *SCEVExpander::visitTruncateExpr(const SCEVTruncateExpr *S) { const Type *Ty = SE.getEffectiveSCEVType(S->getType()); Value *V = expand(S->getOperand()); V = InsertNoopCastOfTo(V, SE.getEffectiveSCEVType(V->getType())); - return CastInst::CreateTruncOrBitCast(V, Ty, "tmp.", InsertPt); + return new TruncInst(V, Ty, "tmp.", InsertPt); } Value *SCEVExpander::visitZeroExtendExpr(const SCEVZeroExtendExpr *S) { const Type *Ty = SE.getEffectiveSCEVType(S->getType()); Value *V = expand(S->getOperand()); V = InsertNoopCastOfTo(V, SE.getEffectiveSCEVType(V->getType())); - return CastInst::CreateZExtOrBitCast(V, Ty, "tmp.", InsertPt); + return new ZExtInst(V, Ty, "tmp.", InsertPt); } Value *SCEVExpander::visitSignExtendExpr(const SCEVSignExtendExpr *S) { const Type *Ty = SE.getEffectiveSCEVType(S->getType()); Value *V = expand(S->getOperand()); V = InsertNoopCastOfTo(V, SE.getEffectiveSCEVType(V->getType())); - return CastInst::CreateSExtOrBitCast(V, Ty, "tmp.", InsertPt); + return new SExtInst(V, Ty, "tmp.", InsertPt); } Value *SCEVExpander::visitSMaxExpr(const SCEVSMaxExpr *S) { @@ -328,11 +328,11 @@ Value *SCEVExpander::visitUMaxExpr(const SCEVUMaxExpr *S) { } Value *SCEVExpander::expandCodeFor(SCEVHandle SH, const Type *Ty, - Instruction *IP) { + BasicBlock::iterator IP) { // Expand the code for this SCEV. assert(SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(SH->getType()) && "non-trivial casts should be done with the SCEVs directly!"); - this->InsertPt = IP; + InsertPt = IP; Value *V = expand(SH); return InsertNoopCastOfTo(V, Ty); } |