Cleaned up a couple of comments.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@168854 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Preston Briggs 2012-11-29 04:30:52 +00:00
parent 39b5c0c049
commit a18d377e73

View File

@ -2212,7 +2212,7 @@ const SCEVConstant *getConstantPart(const SCEVMulExpr *Product) {
//
// 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 @@ Dependence *DependenceAnalysis::depends(Instruction *Src,
}
}
// 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 @@ Dependence *DependenceAnalysis::depends(Instruction *Src,
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)