mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-28 19:31:58 +00:00
c6a303052b
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@74402 91177308-0d34-0410-b5e6-96231b3b80d8
114 lines
4.0 KiB
C++
114 lines
4.0 KiB
C++
//===- LoopDependenceAnalysis.cpp - LDA Implementation ----------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This is the (beginning) of an implementation of a loop dependence analysis
|
|
// framework, which is used to detect dependences in memory accesses in loops.
|
|
//
|
|
// Please note that this is work in progress and the interface is subject to
|
|
// change.
|
|
//
|
|
// TODO: adapt as implementation progresses.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#define DEBUG_TYPE "lda"
|
|
#include "llvm/Analysis/LoopDependenceAnalysis.h"
|
|
#include "llvm/Analysis/LoopPass.h"
|
|
#include "llvm/Analysis/ScalarEvolution.h"
|
|
#include "llvm/Instructions.h"
|
|
using namespace llvm;
|
|
|
|
LoopPass *llvm::createLoopDependenceAnalysisPass() {
|
|
return new LoopDependenceAnalysis();
|
|
}
|
|
|
|
static RegisterPass<LoopDependenceAnalysis>
|
|
R("lda", "Loop Dependence Analysis", false, true);
|
|
char LoopDependenceAnalysis::ID = 0;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Utility Functions
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
static inline bool isMemRefInstr(const Value *I) {
|
|
return isa<LoadInst>(I) || isa<StoreInst>(I);
|
|
}
|
|
|
|
static void getMemRefInstrs(
|
|
const Loop *L, SmallVectorImpl<Instruction*> &memrefs) {
|
|
for (Loop::block_iterator b = L->block_begin(), be = L->block_end();
|
|
b != be; ++b)
|
|
for (BasicBlock::iterator i = (*b)->begin(), ie = (*b)->end();
|
|
i != ie; ++i)
|
|
if (isMemRefInstr(i))
|
|
memrefs.push_back(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
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
bool LoopDependenceAnalysis::runOnLoop(Loop *L, LPPassManager &) {
|
|
this->L = L;
|
|
SE = &getAnalysis<ScalarEvolution>();
|
|
return false;
|
|
}
|
|
|
|
void LoopDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesAll();
|
|
AU.addRequiredTransitive<ScalarEvolution>();
|
|
}
|
|
|
|
static void PrintLoopInfo(
|
|
raw_ostream &OS, LoopDependenceAnalysis *LDA, const Loop *L) {
|
|
if (!L->empty()) return; // ignore non-innermost loops
|
|
|
|
OS << "Loop at depth " << L->getLoopDepth() << ", header block: ";
|
|
WriteAsOperand(OS, L->getHeader(), false);
|
|
OS << "\n";
|
|
|
|
SmallVector<Instruction*, 8> memrefs;
|
|
getMemRefInstrs(L, memrefs);
|
|
OS << " Load/store instructions: " << memrefs.size() << "\n";
|
|
OS << " Pairwise dependence results:\n";
|
|
for (SmallVector<Instruction*, 8>::const_iterator x = memrefs.begin(),
|
|
end = memrefs.end(); x != end; ++x)
|
|
for (SmallVector<Instruction*, 8>::const_iterator y = x + 1;
|
|
y != end; ++y)
|
|
if (LDA->isDependencePair(*x, *y))
|
|
OS << "\t" << (x - memrefs.begin()) << "," << (y - memrefs.begin())
|
|
<< ": " << (LDA->depends(*x, *y) ? "dependent" : "independent")
|
|
<< "\n";
|
|
}
|
|
|
|
void LoopDependenceAnalysis::print(raw_ostream &OS, const Module*) const {
|
|
// TODO: doc why const_cast is safe
|
|
PrintLoopInfo(OS, const_cast<LoopDependenceAnalysis*>(this), this->L);
|
|
}
|
|
|
|
void LoopDependenceAnalysis::print(std::ostream &OS, const Module *M) const {
|
|
raw_os_ostream os(OS);
|
|
print(os, M);
|
|
}
|