From 4eb7ee566a39184b01a9712b46be5b56fca3b6fc Mon Sep 17 00:00:00 2001 From: Preston Briggs Date: Thu, 29 Nov 2012 04:30:52 +0000 Subject: Cleaned up a couple of comments. llvm-svn: 168854 --- llvm/lib/Analysis/DependenceAnalysis.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'llvm/lib/Analysis/DependenceAnalysis.cpp') diff --git a/llvm/lib/Analysis/DependenceAnalysis.cpp b/llvm/lib/Analysis/DependenceAnalysis.cpp index 2068f1fb965..1bade20d634 100644 --- a/llvm/lib/Analysis/DependenceAnalysis.cpp +++ b/llvm/lib/Analysis/DependenceAnalysis.cpp @@ -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) -- cgit v1.2.3