Minimal LDA interface, maximally conservative tester.

llvm-svn: 74401
This commit is contained in:
Andreas Bolka 2009-06-28 00:21:21 +00:00
parent 8976d3bc7e
commit 9fee7f86ad
2 changed files with 29 additions and 0 deletions

View File

@ -28,6 +28,7 @@ namespace llvm {
class AnalysisUsage; class AnalysisUsage;
class ScalarEvolution; class ScalarEvolution;
class Value;
class LoopDependenceAnalysis : public LoopPass { class LoopDependenceAnalysis : public LoopPass {
Loop *L; Loop *L;
@ -37,6 +38,10 @@ namespace llvm {
static char ID; // Class identification, replacement for typeinfo static char ID; // Class identification, replacement for typeinfo
LoopDependenceAnalysis() : LoopPass(&ID) {} LoopDependenceAnalysis() : LoopPass(&ID) {}
/// TODO: docs
bool isDependencePair(const Value*, const Value*) const;
bool depends(Value*, Value*);
bool runOnLoop(Loop*, LPPassManager&); bool runOnLoop(Loop*, LPPassManager&);
virtual void getAnalysisUsage(AnalysisUsage&) const; virtual void getAnalysisUsage(AnalysisUsage&) const;

View File

@ -21,6 +21,7 @@
#include "llvm/Analysis/LoopDependenceAnalysis.h" #include "llvm/Analysis/LoopDependenceAnalysis.h"
#include "llvm/Analysis/LoopPass.h" #include "llvm/Analysis/LoopPass.h"
#include "llvm/Analysis/ScalarEvolution.h" #include "llvm/Analysis/ScalarEvolution.h"
#include "llvm/Instructions.h"
using namespace llvm; using namespace llvm;
LoopPass *llvm::createLoopDependenceAnalysisPass() { LoopPass *llvm::createLoopDependenceAnalysisPass() {
@ -31,6 +32,29 @@ static RegisterPass<LoopDependenceAnalysis>
R("lda", "Loop Dependence Analysis", false, true); R("lda", "Loop Dependence Analysis", false, true);
char LoopDependenceAnalysis::ID = 0; char LoopDependenceAnalysis::ID = 0;
//===----------------------------------------------------------------------===//
// Utility Functions
//===----------------------------------------------------------------------===//
static inline bool isMemRefInstr(const Value *I) {
return isa<LoadInst>(I) || isa<StoreInst>(I);
}
//===----------------------------------------------------------------------===//
// Dependence Testing
//===----------------------------------------------------------------------===//
bool LoopDependenceAnalysis::isDependencePair(const Value *x,
const Value *y) const {
return isMemRefInstr(x) && isMemRefInstr(y)
&& (isa<StoreInst>(x) || isa<StoreInst>(y));
}
bool LoopDependenceAnalysis::depends(Value *src, Value *dst) {
assert(isDependencePair(src, dst) && "Values form no dependence pair!");
return true;
}
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// LoopDependenceAnalysis Implementation // LoopDependenceAnalysis Implementation
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//