[llvm-commits] [llvm] r168854 - /llvm/trunk/lib/Analysis/DependenceAnalysis.cpp
Preston Briggs
preston.briggs at gmail.com
Wed Nov 28 20:30:52 PST 2012
Author: prestonbriggs
Date: Wed Nov 28 22:30:52 2012
New Revision: 168854
URL: http://llvm.org/viewvc/llvm-project?rev=168854&view=rev
Log:
Cleaned up a couple of comments.
Modified:
llvm/trunk/lib/Analysis/DependenceAnalysis.cpp
Modified: llvm/trunk/lib/Analysis/DependenceAnalysis.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/DependenceAnalysis.cpp?rev=168854&r1=168853&r2=168854&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/DependenceAnalysis.cpp (original)
+++ llvm/trunk/lib/Analysis/DependenceAnalysis.cpp Wed Nov 28 22:30:52 2012
@@ -2212,7 +2212,7 @@
//
// It occurs to me that the presence of loop-invariant variables
// changes the nature of the test from "greatest common divisor"
-// to "a common divisor!"
+// to "a common divisor".
bool DependenceAnalysis::gcdMIVtest(const SCEV *Src,
const SCEV *Dst,
FullDependence &Result) const {
@@ -3555,7 +3555,7 @@
}
}
- // make sure Scalar flags are set correctly
+ // Make sure the Scalar flags are set correctly.
SmallBitVector CompleteLoops(MaxLevels + 1);
for (unsigned SI = 0; SI < Pairs; ++SI)
CompleteLoops |= Pair[SI].Loops;
@@ -3580,8 +3580,8 @@
bool AllEqual = true;
for (unsigned II = 1; II <= CommonLevels; ++II) {
if (Result.getDirection(II) != Dependence::DVEntry::EQ) {
- AllEqual = false;
- break;
+ AllEqual = false;
+ break;
}
}
if (AllEqual)
More information about the llvm-commits
mailing list