RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity

Implement hasComputableLoopEvolution for Add, Mul, and Trunc operators,

Browse Source 
since they can support trivial implementations. This avoids potentially
expensive traversals of the operands.

llvm-svn: 111031
This commit is contained in:
Dan Gohman 2010-08-13 20:03:15 +00:00
parent c044a43293
commit c58d128eb8
1 changed files with 18 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -126,6 +126,12 @@ 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) {
@ -294,6 +300,12 @@ 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 {
@ -322,6 +334,12 @@ 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: