RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Reformat.

Browse Source 
llvm-svn: 231336
This commit is contained in:
NAKAMURA Takumi 2015-03-05 01:25:19 +00:00
parent c1ae07142e
commit b01e007df4
2 changed files with 14 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
include/llvm/Analysis/DependenceAnalysis.h
View File

@ -217,13 +217,9 @@ namespace llvm {
/// input dependences are unordered. /// input dependences are unordered.
class FullDependence : public Dependence { class FullDependence : public Dependence {
public: public:
FullDependence(Instruction *Src, FullDependence(Instruction *Src, Instruction *Dst, bool LoopIndependent,
Instruction *Dst,
bool LoopIndependent,
unsigned Levels); unsigned Levels);
~FullDependence() { ~FullDependence() { delete[] DV; }
delete[] DV;
}
/// isLoopIndependent - Returns true if this is a loop-independent /// isLoopIndependent - Returns true if this is a loop-independent
/// dependence. /// dependence.
@ -266,6 +262,7 @@ namespace llvm {
/// if no subscript in the source or destination mention the induction /// if no subscript in the source or destination mention the induction
/// variable associated with the loop at this level. /// variable associated with the loop at this level.
bool isScalar(unsigned Level) const override; bool isScalar(unsigned Level) const override;
private: private:
unsigned short Levels; unsigned short Levels;
bool LoopIndependent; bool LoopIndependent;

25
lib/Analysis/DependenceAnalysis.cpp
View File

@ -226,13 +226,11 @@ bool Dependence::isScalar(unsigned level) const {
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// FullDependence methods // FullDependence methods
FullDependence::FullDependence(Instruction *Source, FullDependence::FullDependence(Instruction *Source, Instruction *Destination,
Instruction *Destination,
bool PossiblyLoopIndependent, bool PossiblyLoopIndependent,
unsigned CommonLevels) : unsigned CommonLevels)
Dependence(Source, Destination), : Dependence(Source, Destination), Levels(CommonLevels),
Levels(CommonLevels), LoopIndependent(PossiblyLoopIndependent) {
LoopIndependent(PossiblyLoopIndependent) {
Consistent = true; Consistent = true;
DV = CommonLevels ? new DVEntry[CommonLevels] : nullptr; DV = CommonLevels ? new DVEntry[CommonLevels] : nullptr;
} }
@ -3473,8 +3471,7 @@ DependenceAnalysis::depends(Instruction *Src, Instruction *Dst,
LI->getLoopFor(Dst->getParent()), LI->getLoopFor(Dst->getParent()),
Pair[SI].Loops); Pair[SI].Loops);
Result.Consistent = false; Result.Consistent = false;
} } else if (Pair[SI].Classification == Subscript::ZIV) {
else if (Pair[SI].Classification == Subscript::ZIV) {
// always separable // always separable
Separable.set(SI); Separable.set(SI);
} }
@ -3526,8 +3523,8 @@ DependenceAnalysis::depends(Instruction *Src, Instruction *Dst,
DEBUG(dbgs() << ", SIV\n"); DEBUG(dbgs() << ", SIV\n");
unsigned Level; unsigned Level;
const SCEV *SplitIter = nullptr; const SCEV *SplitIter = nullptr;
if (testSIV(Pair[SI].Src, Pair[SI].Dst, Level, if (testSIV(Pair[SI].Src, Pair[SI].Dst, Level, Result, NewConstraint,
Result, NewConstraint, SplitIter)) SplitIter))
return nullptr; return nullptr;
break; break;
} }
@ -3575,8 +3572,8 @@ DependenceAnalysis::depends(Instruction *Src, Instruction *Dst,
unsigned Level; unsigned Level;
const SCEV *SplitIter = nullptr; const SCEV *SplitIter = nullptr;
DEBUG(dbgs() << "SIV\n"); DEBUG(dbgs() << "SIV\n");
if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, Result, NewConstraint,
Result, NewConstraint, SplitIter)) SplitIter))
return nullptr; return nullptr;
ConstrainedLevels.set(Level); ConstrainedLevels.set(Level);
if (intersectConstraints(&Constraints[Level], &NewConstraint)) { if (intersectConstraints(&Constraints[Level], &NewConstraint)) {
@ -3652,8 +3649,8 @@ DependenceAnalysis::depends(Instruction *Src, Instruction *Dst,
// update Result.DV from constraint vector // update Result.DV from constraint vector
DEBUG(dbgs() << " updating\n"); DEBUG(dbgs() << " updating\n");
for (int SJ = ConstrainedLevels.find_first(); for (int SJ = ConstrainedLevels.find_first(); SJ >= 0;
SJ >= 0; SJ = ConstrainedLevels.find_next(SJ)) { SJ = ConstrainedLevels.find_next(SJ)) {
updateDirection(Result.DV[SJ - 1], Constraints[SJ]); updateDirection(Result.DV[SJ - 1], Constraints[SJ]);
if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE) if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE)
return nullptr; return nullptr;