From e803d05bd87d1181c971fb719fef5638dd44ce99 Mon Sep 17 00:00:00 2001 From: Benjamin Kramer Date: Wed, 31 Oct 2012 11:25:32 +0000 Subject: [PATCH] Fix a couple of comment typos. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167113 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Analysis/DependenceAnalysis.h | 18 +++++++++--------- lib/Analysis/DependenceAnalysis.cpp | 4 ++-- 2 files changed, 11 insertions(+), 11 deletions(-) diff --git a/include/llvm/Analysis/DependenceAnalysis.h b/include/llvm/Analysis/DependenceAnalysis.h index 3818428a5e4..b4327eeb0b1 100644 --- a/include/llvm/Analysis/DependenceAnalysis.h +++ b/include/llvm/Analysis/DependenceAnalysis.h @@ -49,7 +49,7 @@ namespace llvm { /// determine anything beyond the existence of a dependence; that is, it /// represents a confused dependence (see also FullDependence). In most /// cases (for output, flow, and anti dependences), the dependence implies - /// an ordering, where the source must preceed the destination; in contrast, + /// an ordering, where the source must precede the destination; in contrast, /// input dependences are unordered. class Dependence { public: @@ -126,7 +126,7 @@ namespace llvm { virtual bool isConsistent() const { return false; } /// getLevels - Returns the number of common loops surrounding the - /// souce and destination of the dependence. + /// source and destination of the dependence. virtual unsigned getLevels() const { return 0; } /// getDirection - Returns the direction associated with a particular @@ -169,7 +169,7 @@ namespace llvm { /// able to accurately analyze the interaction of the references; that is, /// it is not a confused dependence (see Dependence). In most cases /// (for output, flow, and anti dependences), the dependence implies an - /// ordering, where the source must preceed the destination; in contrast, + /// ordering, where the source must precede the destination; in contrast, /// input dependences are unordered. class FullDependence : public Dependence { public: @@ -195,7 +195,7 @@ namespace llvm { bool isConsistent() const { return Consistent; } /// getLevels - Returns the number of common loops surrounding the - /// souce and destination of the dependence. + /// source and destination of the dependence. unsigned getLevels() const { return Levels; } /// getDirection - Returns the direction associated with a particular @@ -505,7 +505,7 @@ namespace llvm { /// isKnownPredicate - Compare X and Y using the predicate Pred. /// Basically a wrapper for SCEV::isKnownPredicate, - /// but tries harder, especially in the presense of sign and zero + /// but tries harder, especially in the presence of sign and zero /// extensions and symbolics. bool isKnownPredicate(ICmpInst::Predicate Pred, const SCEV *X, @@ -673,7 +673,7 @@ namespace llvm { /// where i and j are induction variable, c1 and c2 are loop invariant, /// and a and b are constants. /// Returns true if any possible dependence is disproved. - /// Marks the result as inconsistant. + /// Marks the result as inconsistent. /// Works in some cases that symbolicRDIVtest doesn't, /// and vice versa. bool exactRDIVtest(const SCEV *SrcCoeff, @@ -689,7 +689,7 @@ namespace llvm { /// where i and j are induction variable, c1 and c2 are loop invariant, /// and a and b are constants. /// Returns true if any possible dependence is disproved. - /// Marks the result as inconsistant. + /// Marks the result as inconsistent. /// Works in some cases that exactRDIVtest doesn't, /// and vice versa. Can also be used as a backup for /// ordinary SIV tests. @@ -702,7 +702,7 @@ namespace llvm { /// gcdMIVtest - Tests an MIV subscript pair for dependence. /// Returns true if any possible dependence is disproved. - /// Marks the result as inconsistant. + /// Marks the result as inconsistent. /// Can sometimes disprove the equal direction for 1 or more loops. // Can handle some symbolics that even the SIV tests don't get, /// so we use it as a backup for everything. @@ -712,7 +712,7 @@ namespace llvm { /// banerjeeMIVtest - Tests an MIV subscript pair for dependence. /// Returns true if any possible dependence is disproved. - /// Marks the result as inconsistant. + /// Marks the result as inconsistent. /// Computes directions. bool banerjeeMIVtest(const SCEV *Src, const SCEV *Dst, diff --git a/lib/Analysis/DependenceAnalysis.cpp b/lib/Analysis/DependenceAnalysis.cpp index c1321b63f28..95ac5ea233b 100644 --- a/lib/Analysis/DependenceAnalysis.cpp +++ b/lib/Analysis/DependenceAnalysis.cpp @@ -1773,7 +1773,7 @@ bool DependenceAnalysis::weakZeroDstSIVtest(const SCEV *SrcCoeff, // where i and j are induction variable, c1 and c2 are loop invariant, // and a and b are constants. // Returns true if any possible dependence is disproved. -// Marks the result as inconsistant. +// Marks the result as inconsistent. // Works in some cases that symbolicRDIVtest doesn't, and vice versa. bool DependenceAnalysis::exactRDIVtest(const SCEV *SrcCoeff, const SCEV *DstCoeff, @@ -2202,7 +2202,7 @@ const SCEVConstant *getConstantPart(const SCEVMulExpr *Product) { // gcdMIVtest - // Tests an MIV subscript pair for dependence. // Returns true if any possible dependence is disproved. -// Marks the result as inconsistant. +// Marks the result as inconsistent. // Can sometimes disprove the equal direction for 1 or more loops, // as discussed in Michael Wolfe's book, // High Performance Compilers for Parallel Computing, page 235. -- 2.34.1