Looks good to me.<div><br></div><div>Thanks,</div><div>Preston</div><div><br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
From: Benjamin Kramer <<a href="mailto:benny.kra@googlemail.com">benny.kra@googlemail.com</a>><br>
To: <a href="mailto:llvm-commits@cs.uiuc.edu">llvm-commits@cs.uiuc.edu</a><br>
Subject: [llvm-commits] [llvm] r167113 - in /llvm/trunk:<br>
include/llvm/Analysis/DependenceAnalysis.h<br>
lib/Analysis/DependenceAnalysis.cpp<br>
Message-ID: <<a href="mailto:20121031112533.1E2CE2A6C065@llvm.org">20121031112533.1E2CE2A6C065@llvm.org</a>><br>
Content-Type: text/plain; charset="utf-8"<br>
<br>
Author: d0k<br>
Date: Wed Oct 31 06:25:32 2012<br>
New Revision: 167113<br>
<br>
URL: <a href="http://llvm.org/viewvc/llvm-project?rev=167113&view=rev" target="_blank">http://llvm.org/viewvc/llvm-project?rev=167113&view=rev</a><br>
Log:<br>
Fix a couple of comment typos.<br>
<br>
Modified:<br>
llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h<br>
llvm/trunk/lib/Analysis/DependenceAnalysis.cpp<br>
<br>
Modified: llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h?rev=167113&r1=167112&r2=167113&view=diff" target="_blank">http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h?rev=167113&r1=167112&r2=167113&view=diff</a><br>
==============================================================================<br>
--- llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h (original)<br>
+++ llvm/trunk/include/llvm/Analysis/DependenceAnalysis.h Wed Oct 31 06:25:32 2012<br>
@@ -49,7 +49,7 @@<br>
/// determine anything beyond the existence of a dependence; that is, it<br>
/// represents a confused dependence (see also FullDependence). In most<br>
/// cases (for output, flow, and anti dependences), the dependence implies<br>
- /// an ordering, where the source must preceed the destination; in contrast,<br>
+ /// an ordering, where the source must precede the destination; in contrast,<br>
/// input dependences are unordered.<br>
class Dependence {<br>
public:<br>
@@ -126,7 +126,7 @@<br>
virtual bool isConsistent() const { return false; }<br>
<br>
/// getLevels - Returns the number of common loops surrounding the<br>
- /// souce and destination of the dependence.<br>
+ /// source and destination of the dependence.<br>
virtual unsigned getLevels() const { return 0; }<br>
<br>
/// getDirection - Returns the direction associated with a particular<br>
@@ -169,7 +169,7 @@<br>
/// able to accurately analyze the interaction of the references; that is,<br>
/// it is not a confused dependence (see Dependence). In most cases<br>
/// (for output, flow, and anti dependences), the dependence implies an<br>
- /// ordering, where the source must preceed the destination; in contrast,<br>
+ /// ordering, where the source must precede the destination; in contrast,<br>
/// input dependences are unordered.<br>
class FullDependence : public Dependence {<br>
public:<br>
@@ -195,7 +195,7 @@<br>
bool isConsistent() const { return Consistent; }<br>
<br>
/// getLevels - Returns the number of common loops surrounding the<br>
- /// souce and destination of the dependence.<br>
+ /// source and destination of the dependence.<br>
unsigned getLevels() const { return Levels; }<br>
<br>
/// getDirection - Returns the direction associated with a particular<br>
@@ -505,7 +505,7 @@<br>
<br>
/// isKnownPredicate - Compare X and Y using the predicate Pred.<br>
/// Basically a wrapper for SCEV::isKnownPredicate,<br>
- /// but tries harder, especially in the presense of sign and zero<br>
+ /// but tries harder, especially in the presence of sign and zero<br>
/// extensions and symbolics.<br>
bool isKnownPredicate(ICmpInst::Predicate Pred,<br>
const SCEV *X,<br>
@@ -673,7 +673,7 @@<br>
/// where i and j are induction variable, c1 and c2 are loop invariant,<br>
/// and a and b are constants.<br>
/// Returns true if any possible dependence is disproved.<br>
- /// Marks the result as inconsistant.<br>
+ /// Marks the result as inconsistent.<br>
/// Works in some cases that symbolicRDIVtest doesn't,<br>
/// and vice versa.<br>
bool exactRDIVtest(const SCEV *SrcCoeff,<br>
@@ -689,7 +689,7 @@<br>
/// where i and j are induction variable, c1 and c2 are loop invariant,<br>
/// and a and b are constants.<br>
/// Returns true if any possible dependence is disproved.<br>
- /// Marks the result as inconsistant.<br>
+ /// Marks the result as inconsistent.<br>
/// Works in some cases that exactRDIVtest doesn't,<br>
/// and vice versa. Can also be used as a backup for<br>
/// ordinary SIV tests.<br>
@@ -702,7 +702,7 @@<br>
<br>
/// gcdMIVtest - Tests an MIV subscript pair for dependence.<br>
/// Returns true if any possible dependence is disproved.<br>
- /// Marks the result as inconsistant.<br>
+ /// Marks the result as inconsistent.<br>
/// Can sometimes disprove the equal direction for 1 or more loops.<br>
// Can handle some symbolics that even the SIV tests don't get,<br>
/// so we use it as a backup for everything.<br>
@@ -712,7 +712,7 @@<br>
<br>
/// banerjeeMIVtest - Tests an MIV subscript pair for dependence.<br>
/// Returns true if any possible dependence is disproved.<br>
- /// Marks the result as inconsistant.<br>
+ /// Marks the result as inconsistent.<br>
/// Computes directions.<br>
bool banerjeeMIVtest(const SCEV *Src,<br>
const SCEV *Dst,<br>
<br>
Modified: llvm/trunk/lib/Analysis/DependenceAnalysis.cpp<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/DependenceAnalysis.cpp?rev=167113&r1=167112&r2=167113&view=diff" target="_blank">http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/DependenceAnalysis.cpp?rev=167113&r1=167112&r2=167113&view=diff</a><br>
==============================================================================<br>
--- llvm/trunk/lib/Analysis/DependenceAnalysis.cpp (original)<br>
+++ llvm/trunk/lib/Analysis/DependenceAnalysis.cpp Wed Oct 31 06:25:32 2012<br>
@@ -1773,7 +1773,7 @@<br>
// where i and j are induction variable, c1 and c2 are loop invariant,<br>
// and a and b are constants.<br>
// Returns true if any possible dependence is disproved.<br>
-// Marks the result as inconsistant.<br>
+// Marks the result as inconsistent.<br>
// Works in some cases that symbolicRDIVtest doesn't, and vice versa.<br>
bool DependenceAnalysis::exactRDIVtest(const SCEV *SrcCoeff,<br>
const SCEV *DstCoeff,<br>
@@ -2202,7 +2202,7 @@<br>
// gcdMIVtest -<br>
// Tests an MIV subscript pair for dependence.<br>
// Returns true if any possible dependence is disproved.<br>
-// Marks the result as inconsistant.<br>
+// Marks the result as inconsistent.<br>
// Can sometimes disprove the equal direction for 1 or more loops,<br>
// as discussed in Michael Wolfe's book,<br>
// High Performance Compilers for Parallel Computing, page 235.<br></blockquote></div></div>