maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Revert r111031. The way LLVM defines loop invariance, the property of an 

expression being loop invariant is not equivalent to the property of
properly dominating the loop header.

Other optimizations have also made this optimization less important.

llvm-svn: 111160
This commit is contained in:
Dan Gohman 2010-08-16 17:34:25 +00:00
parent a3ae3eb690
commit a573c41435
1 changed files with 0 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
llvm/include/llvm/Analysis/ScalarEvolutionExpressions.h
View File

@ -126,12 +126,6 @@ namespace llvm {
public:
virtual void print(raw_ostream &OS) const;
virtual bool hasComputableLoopEvolution(const Loop *QL) const {
// Not computable. A truncate of an addrec is always folded into
// the addrec.
return false;
}
/// Methods for support type inquiry through isa, cast, and dyn_cast:
static inline bool classof(const SCEVTruncateExpr *S) { return true; }
static inline bool classof(const SCEV *S) {
@ -281,12 +275,6 @@ namespace llvm {
}
public:
virtual bool hasComputableLoopEvolution(const Loop *QL) const {
// Not computable. An add of an addrec is always folded into the addrec
// if the other operands are loop-variant or loop-computable.
return false;
}
virtual const char *getOperationStr() const { return " + "; }
virtual const Type *getType() const {
@ -315,12 +303,6 @@ namespace llvm {
}
public:
virtual bool hasComputableLoopEvolution(const Loop *QL) const {
// Not computable. A mul of an addrec is always folded into the addrec
// if the other operands are loop-variant or loop-computable.
return false;
}
virtual const char *getOperationStr() const { return " * "; }
/// Methods for support type inquiry through isa, cast, and dyn_cast: