diff options
| author | Jakub Staszak <kubastaszak@gmail.com> | 2013-03-05 22:05:16 +0000 | 
|---|---|---|
| committer | Jakub Staszak <kubastaszak@gmail.com> | 2013-03-05 22:05:16 +0000 | 
| commit | f18c92b0d7e7051c1cc989598e09db77c34c2e35 (patch) | |
| tree | 1b1481eae98ffcf4b00abb0094fe3724c0bfb80d | |
| parent | 87c5af309c6a1e9535d825d01863030c56f2efaf (diff) | |
| download | bcm5719-llvm-f18c92b0d7e7051c1cc989598e09db77c34c2e35.tar.gz bcm5719-llvm-f18c92b0d7e7051c1cc989598e09db77c34c2e35.zip  | |
Fix a few typos in comments.
llvm-svn: 176519
| -rw-r--r-- | llvm/include/llvm/Analysis/DependenceAnalysis.h | 4 | ||||
| -rw-r--r-- | llvm/include/llvm/Analysis/IntervalIterator.h | 2 | ||||
| -rw-r--r-- | llvm/include/llvm/Analysis/ScalarEvolution.h | 2 | ||||
| -rw-r--r-- | llvm/include/llvm/Analysis/TargetTransformInfo.h | 8 | 
4 files changed, 8 insertions, 8 deletions
diff --git a/llvm/include/llvm/Analysis/DependenceAnalysis.h b/llvm/include/llvm/Analysis/DependenceAnalysis.h index d0ead396947..a78ac5919ac 100644 --- a/llvm/include/llvm/Analysis/DependenceAnalysis.h +++ b/llvm/include/llvm/Analysis/DependenceAnalysis.h @@ -175,7 +175,7 @@ namespace llvm {    /// FullDependence - This class represents a dependence between two memory    /// references in a function. It contains detailed information about the -  /// dependence (direction vectors, etc) and is used when the compiler is +  /// dependence (direction vectors, etc.) and is used when the compiler is    /// 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 @@ -257,7 +257,7 @@ namespace llvm {                          Instruction *Dst,                          bool PossiblyLoopIndependent); -    /// getSplitIteration - Give a dependence that's splitable at some +    /// getSplitIteration - Give a dependence that's splittable at some      /// particular level, return the iteration that should be used to split      /// the loop.      /// diff --git a/llvm/include/llvm/Analysis/IntervalIterator.h b/llvm/include/llvm/Analysis/IntervalIterator.h index 333f289ee1b..22067c4f3c8 100644 --- a/llvm/include/llvm/Analysis/IntervalIterator.h +++ b/llvm/include/llvm/Analysis/IntervalIterator.h @@ -157,7 +157,7 @@ public:  private:    // ProcessInterval - This method is used during the construction of the    // interval graph.  It walks through the source graph, recursively creating -  // an interval per invokation until the entire graph is covered.  This uses +  // an interval per invocation until the entire graph is covered.  This uses    // the ProcessNode method to add all of the nodes to the interval.    //    // This method is templated because it may operate on two different source diff --git a/llvm/include/llvm/Analysis/ScalarEvolution.h b/llvm/include/llvm/Analysis/ScalarEvolution.h index f8f261fa198..42fd3927c85 100644 --- a/llvm/include/llvm/Analysis/ScalarEvolution.h +++ b/llvm/include/llvm/Analysis/ScalarEvolution.h @@ -831,7 +831,7 @@ namespace llvm {      /// SimplifyICmpOperands - Simplify LHS and RHS in a comparison with      /// predicate Pred. Return true iff any changes were made. If the -    /// operands are provably equal or inequal, LHS and RHS are set to +    /// operands are provably equal or unequal, LHS and RHS are set to      /// the same value and Pred is set to either ICMP_EQ or ICMP_NE.      ///      bool SimplifyICmpOperands(ICmpInst::Predicate &Pred, diff --git a/llvm/include/llvm/Analysis/TargetTransformInfo.h b/llvm/include/llvm/Analysis/TargetTransformInfo.h index e1331a16b3b..7a1c5cb391b 100644 --- a/llvm/include/llvm/Analysis/TargetTransformInfo.h +++ b/llvm/include/llvm/Analysis/TargetTransformInfo.h @@ -77,7 +77,7 @@ public:    /// fundamental values that should be used to interpret (and produce) those    /// costs. The costs are returned as an unsigned rather than a member of this    /// enumeration because it is expected that the cost of one IR instruction -  /// may have a multiplicative factor to it or otherwise won't fit dircetly +  /// may have a multiplicative factor to it or otherwise won't fit directly    /// into the enum. Moreover, it is common to sum or average costs which works    /// better as simple integral values. Thus this enum only provides constants.    /// @@ -194,7 +194,7 @@ public:    /// significantly boost the performance when the population is dense, and it    /// may or may not degrade performance if the population is sparse. A HW    /// support is considered as "Fast" if it can outperform, or is on a par -  /// with, SW implementaion when the population is sparse; otherwise, it is +  /// with, SW implementation when the population is sparse; otherwise, it is    /// considered as "Slow".    enum PopcntSupportKind {      PSK_Software, @@ -288,7 +288,7 @@ public:    virtual unsigned getCastInstrCost(unsigned Opcode, Type *Dst,                                      Type *Src) const; -  /// \return The expected cost of control-flow related instrutctions such as +  /// \return The expected cost of control-flow related instructions such as    /// Phi, Ret, Br.    virtual unsigned getCFInstrCost(unsigned Opcode) const; @@ -328,7 +328,7 @@ public:  /// \brief Create the base case instance of a pass in the TTI analysis group.  /// -/// This class provides the base case for the stack of TTI analyses. It doesn't +/// This class provides the base case for the stack of TTI analyzes. It doesn't  /// delegate to anything and uses the STTI and VTTI objects passed in to  /// satisfy the queries.  ImmutablePass *createNoTargetTransformInfoPass();  | 

