RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-25 12:50:00 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Minor cosmetics: indentation, formatting, naming.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@76839 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andreas Bolka 2009-07-23 01:57:06 +00:00
parent 4bf370698a
commit 3b59dd886a
2 changed files with 41 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
include/llvm/Analysis/LoopDependenceAnalysis.h
View File

@ -26,37 +26,37 @@
namespace llvm {
class AliasAnalysis;
class AnalysisUsage;
class ScalarEvolution;
class Value;
class AliasAnalysis;
class AnalysisUsage;
class ScalarEvolution;
class Value;
class LoopDependenceAnalysis : public LoopPass {
Loop *L;
AliasAnalysis *AA;
ScalarEvolution *SE;
class LoopDependenceAnalysis : public LoopPass {
Loop *L;
AliasAnalysis *AA;
ScalarEvolution *SE;
public:
static char ID; // Class identification, replacement for typeinfo
LoopDependenceAnalysis() : LoopPass(&ID) {}
public:
static char ID; // Class identification, replacement for typeinfo
LoopDependenceAnalysis() : LoopPass(&ID) {}
/// TODO: docs
bool isDependencePair(const Value*, const Value*) const;
bool depends(Value*, Value*);
/// 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;
void print(raw_ostream&, const Module* = 0) const;
virtual void print(std::ostream&, const Module* = 0) const;
}; // class LoopDependenceAnalysis
void print(raw_ostream&, const Module* = 0) const;
virtual void print(std::ostream&, const Module* = 0) const;
}; // class LoopDependenceAnalysis
// createLoopDependenceAnalysisPass - This creates an instance of the
// LoopDependenceAnalysis pass.
//
LoopPass *createLoopDependenceAnalysisPass();
// createLoopDependenceAnalysisPass - This creates an instance of the
// LoopDependenceAnalysis pass.
//
LoopPass *createLoopDependenceAnalysisPass();
} // namespace llvm

36
lib/Analysis/LoopDependenceAnalysis.cpp
View File

@ -45,14 +45,14 @@ static inline bool IsMemRefInstr(const Value *V) {
return I && (I->mayReadFromMemory() || I->mayWriteToMemory());
}
static void GetMemRefInstrs(
const Loop *L, SmallVectorImpl<Instruction*> &memrefs) {
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);
Memrefs.push_back(i);
}
static bool IsLoadOrStoreInst(Value *I) {
@ -73,25 +73,25 @@ static Value *GetPointerOperand(Value *I) {
// Dependence Testing
//===----------------------------------------------------------------------===//
bool LoopDependenceAnalysis::isDependencePair(const Value *x,
const Value *y) const {
return IsMemRefInstr(x) &&
IsMemRefInstr(y) &&
(cast<const Instruction>(x)->mayWriteToMemory() ||
cast<const Instruction>(y)->mayWriteToMemory());
bool LoopDependenceAnalysis::isDependencePair(const Value *A,
const Value *B) const {
return IsMemRefInstr(A) &&
IsMemRefInstr(B) &&
(cast<const Instruction>(A)->mayWriteToMemory() ||
cast<const Instruction>(B)->mayWriteToMemory());
}
bool LoopDependenceAnalysis::depends(Value *src, Value *dst) {
assert(isDependencePair(src, dst) && "Values form no dependence pair!");
DOUT << "== LDA test ==\n" << *src << *dst;
bool LoopDependenceAnalysis::depends(Value *Src, Value *Dst) {
assert(isDependencePair(Src, Dst) && "Values form no dependence pair!");
DOUT << "== LDA test ==\n" << *Src << *Dst;
// We only analyse loads and stores; for possible memory accesses by e.g.
// free, call, or invoke instructions we conservatively assume dependence.
if (!IsLoadOrStoreInst(src) || !IsLoadOrStoreInst(dst))
if (!IsLoadOrStoreInst(Src) || !IsLoadOrStoreInst(Dst))
return true;
Value *srcPtr = GetPointerOperand(src);
Value *dstPtr = GetPointerOperand(dst);
Value *srcPtr = GetPointerOperand(Src);
Value *dstPtr = GetPointerOperand(Dst);
const Value *srcObj = srcPtr->getUnderlyingObject();
const Value *dstObj = dstPtr->getUnderlyingObject();
AliasAnalysis::AliasResult alias = AA->alias(
@ -130,8 +130,8 @@ void LoopDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const {
AU.addRequiredTransitive<ScalarEvolution>();
}
static void PrintLoopInfo(
raw_ostream &OS, LoopDependenceAnalysis *LDA, const Loop *L) {
static void PrintLoopInfo(raw_ostream &OS,
LoopDependenceAnalysis *LDA, const Loop *L) {
if (!L->empty()) return; // ignore non-innermost loops
SmallVector<Instruction*, 8> memrefs;
@ -144,7 +144,7 @@ static void PrintLoopInfo(
OS << " Load/store instructions: " << memrefs.size() << "\n";
for (SmallVector<Instruction*, 8>::const_iterator x = memrefs.begin(),
end = memrefs.end(); x != end; ++x)
OS << "\t" << (x - memrefs.begin()) << ": " << **x;
OS << "\t" << (x - memrefs.begin()) << ": " << **x << "\n";
OS << " Pairwise dependence results:\n";
for (SmallVector<Instruction*, 8>::const_iterator x = memrefs.begin(),