mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
d15cdb7b13
Summary: After r249211, `getSCEV(X) == getSCEV(Y)` does not guarantee that X and Y are related in the dominator tree, even if X is an operand to Y (I've included a toy example in comments, and a real example as a test case). This commit changes `SimplifyIndVar` to require a `DominatorTree`. I don't think this is a problem because `ScalarEvolution` requires it anyway. Fixes PR25051. Depends on D13459. Reviewers: atrick, hfinkel Subscribers: joker.eph, llvm-commits, sanjoy Differential Revision: http://reviews.llvm.org/D13460 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@249471 91177308-0d34-0410-b5e6-96231b3b80d8
72 lines
2.2 KiB
C++
72 lines
2.2 KiB
C++
//===-- llvm/Transforms/Utils/SimplifyIndVar.h - Indvar Utils ---*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines in interface for induction variable simplification. It does
|
|
// not define any actual pass or policy, but provides a single function to
|
|
// simplify a loop's induction variables based on ScalarEvolution.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_UTILS_SIMPLIFYINDVAR_H
|
|
#define LLVM_TRANSFORMS_UTILS_SIMPLIFYINDVAR_H
|
|
|
|
#include "llvm/IR/ValueHandle.h"
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
namespace llvm {
|
|
|
|
class CastInst;
|
|
class DominatorTree;
|
|
class IVUsers;
|
|
class Loop;
|
|
class LPPassManager;
|
|
class PHINode;
|
|
class ScalarEvolution;
|
|
|
|
/// Interface for visiting interesting IV users that are recognized but not
|
|
/// simplified by this utility.
|
|
class IVVisitor {
|
|
protected:
|
|
const DominatorTree *DT;
|
|
bool ShouldSplitOverflowIntrinsics;
|
|
|
|
virtual void anchor();
|
|
|
|
public:
|
|
IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
|
|
virtual ~IVVisitor() {}
|
|
|
|
const DominatorTree *getDomTree() const { return DT; }
|
|
|
|
bool shouldSplitOverflowInstrinsics() const {
|
|
return ShouldSplitOverflowIntrinsics;
|
|
}
|
|
void setSplitOverflowIntrinsics() {
|
|
ShouldSplitOverflowIntrinsics = true;
|
|
assert(DT && "Splitting overflow intrinsics requires a DomTree.");
|
|
}
|
|
|
|
virtual void visitCast(CastInst *Cast) = 0;
|
|
};
|
|
|
|
/// simplifyUsersOfIV - Simplify instructions that use this induction variable
|
|
/// by using ScalarEvolution to analyze the IV's recurrence.
|
|
bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
|
|
LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead,
|
|
IVVisitor *V = nullptr);
|
|
|
|
/// SimplifyLoopIVs - Simplify users of induction variables within this
|
|
/// loop. This does not actually change or add IVs.
|
|
bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
|
LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead);
|
|
|
|
} // namespace llvm
|
|
|
|
#endif
|