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

Simplify LDA-internal interface.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77359 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andreas Bolka 2009-07-28 19:50:13 +00:00
parent 328fb3d210
commit c3cc45aa8b
2 changed files with 9 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -62,7 +62,7 @@ class LoopDependenceAnalysis : public LoopPass {
bool findOrInsertDependencePair(Value*, Value*, DependencePair*&);
/// TODO: doc
void analysePair(DependencePair *P) const;
DependenceResult analysePair(DependencePair *P) const;
public:
static char ID; // Class identification, replacement for typeinfo

20
lib/Analysis/LoopDependenceAnalysis.cpp
View File

@ -116,18 +116,15 @@ bool LoopDependenceAnalysis::findOrInsertDependencePair(Value *A,
return false;
}
void LoopDependenceAnalysis::analysePair(DependencePair *P) const {
LoopDependenceAnalysis::DependenceResult
LoopDependenceAnalysis::analysePair(DependencePair *P) const {
DEBUG(errs() << "Analysing:\n" << *P->A << "\n" << *P->B << "\n");
// Our default answer: we don't know anything, i.e. we failed to analyse this
// pair to get a more specific answer (dependent, independent).
P->Result = Unknown;
// We only analyse loads and stores but no possible memory accesses by e.g.
// free, call, or invoke instructions.
if (!IsLoadOrStoreInst(P->A) || !IsLoadOrStoreInst(P->B)) {
DEBUG(errs() << "--> [?] no load/store\n");
return;
return Unknown;
}
Value *aPtr = GetPointerOperand(P->A);
@ -137,20 +134,20 @@ void LoopDependenceAnalysis::analysePair(DependencePair *P) const {
case AliasAnalysis::MayAlias:
// We can not analyse objects if we do not know about their aliasing.
DEBUG(errs() << "---> [?] may alias\n");
return;
return Unknown;
case AliasAnalysis::NoAlias:
// If the objects noalias, they are distinct, accesses are independent.
DEBUG(errs() << "---> [I] no alias\n");
P->Result = Independent;
return;
return Independent;
case AliasAnalysis::MustAlias:
break; // The underlying objects alias, test accesses for dependence.
}
// We failed to analyse this pair to get a more specific answer.
DEBUG(errs() << "---> [?] cannot analyse\n");
return;
return Unknown;
}
bool LoopDependenceAnalysis::depends(Value *A, Value *B) {
@ -161,8 +158,7 @@ bool LoopDependenceAnalysis::depends(Value *A, Value *B) {
if (!findOrInsertDependencePair(A, B, p)) {
// The pair is not cached, so analyse it.
++NumAnalysed;
analysePair(p);
switch (p->Result) {
switch (p->Result = analysePair(p)) {
case Dependent: ++NumDependent; break;
case Independent: ++NumIndependent; break;
case Unknown: ++NumUnknown; break;