Fix more typos

Author: VitalyAnkh

mlir/include/mlir/Analysis/Presburger/PWMAFunction.h

@@ -119,7 +119,7 @@ class MultiAffineFunction {
   /// The space of this function. The domain variables are considered as the
   /// input variables of the function. The range variables are considered as
   /// the outputs. The symbols parametrize the function and locals are used to
-  /// represent divisions. Each local variable has a corressponding division
+  /// represent divisions. Each local variable has a corresponding division
   /// representation stored in `divs`.
   PresburgerSpace space;
 

mlir/include/mlir/TableGen/Class.h

@@ -143,7 +143,7 @@ class MethodSignature {
 
   /// Determine whether a method with this signature makes a method with
   /// `other` signature redundant. This occurs if the signatures have the same
-  /// name and this signature's parameteres subsume the other's.
+  /// name and this signature's parameters subsume the other's.
   ///
   /// A method that makes another method redundant with a different return type
   /// can replace the other, the assumption being that the subsuming method
@@ -325,7 +325,7 @@ class Method : public ClassDeclarationBase<ClassDeclaration::Method> {
   };
 
   /// Create a method with a return type, a name, method properties, and a some
-  /// parameters. The parameteres may be passed as a list or as a variadic pack.
+  /// parameters. The parameters may be passed as a list or as a variadic pack.
   template <typename RetTypeT, typename NameT, typename... Args>
   Method(RetTypeT &&retType, NameT &&name, Properties properties,
          Args &&...args)

mlir/include/mlir/TableGen/Constraint.h

@@ -58,12 +58,12 @@ class Constraint {
   // not provided, returns an empty string.
   StringRef getDescription() const;
 
-  /// Returns the name of the TablGen def of this constraint. In some cases
+  /// Returns the name of the TableGen def of this constraint. In some cases
   /// where the current def is anonymous, the name of the base def is used (e.g.
   /// `std::optional<>`/`Variadic<>` type constraints).
   StringRef getDefName() const;
 
-  /// Returns a unique name for the TablGen def of this constraint. This is
+  /// Returns a unique name for the TableGen def of this constraint. This is
   /// generally just the name of the def, but in some cases where the current
   /// def is anonymous, the name of the base def is attached (to provide more
   /// context on the def).

mlir/lib/Analysis/Presburger/PWMAFunction.cpp

@@ -416,7 +416,7 @@ static void addDivisionConstraints(IntegerRelation &rel,
 }
 
 IntegerRelation MultiAffineFunction::getAsRelation() const {
-  // Create a relation corressponding to the input space plus the divisions
+  // Create a relation corresponding to the input space plus the divisions
   // used in outputs.
   IntegerRelation result(PresburgerSpace::getRelationSpace(
       space.getNumDomainVars(), 0, space.getNumSymbolVars(),

mlir/lib/Conversion/ArithToSPIRV/ArithToSPIRV.cpp

@@ -1057,10 +1057,10 @@ class CmpFOpNanNonePattern final : public OpConversionPattern<arith::CmpFOp> {
     Value replace;
     if (bitEnumContainsAll(op.getFastmath(), arith::FastMathFlags::nnan)) {
       if (op.getPredicate() == arith::CmpFPredicate::ORD) {
-        // Ordered comparsion checks if neither operand is NaN.
+        // Ordered comparison checks if neither operand is NaN.
         replace = spirv::ConstantOp::getOne(op.getType(), loc, rewriter);
       } else {
-        // Unordered comparsion checks if either operand is NaN.
+        // Unordered comparison checks if either operand is NaN.
         replace = spirv::ConstantOp::getZero(op.getType(), loc, rewriter);
       }
     } else {

mlir/lib/Dialect/SparseTensor/Transforms/Utils/LoopEmitter.h

@@ -367,7 +367,7 @@ class LoopEmitter {
 
   void initSubSectIterator(OpBuilder &builder, Location loc);
 
-  /// Get the reduced number of contraints on tensor[tid][lvl].
+  /// Get the reduced number of constraints on tensor[tid][lvl].
   unsigned redDepOnLevel(TensorId tid, Level lvl) const {
     return levelReducedDep[tid][lvl];
   };

mlir/unittests/Analysis/Presburger/IntegerPolyhedronTest.cpp

@@ -317,7 +317,7 @@ TEST(IntegerPolyhedronTest, FindSampleTest) {
   checkPermutationsSample(
       true /* not empty */, 5,
       {
-          // Tetrahedron contraints:
+          // Tetrahedron constraints:
           {0, 1, 0, 0, 0, 0},  // y >= 0
           {0, -1, 1, 0, 0, 0}, // z >= y
                                // -300000x + 299998y + 100000 + z <= 0.
@@ -338,7 +338,7 @@ TEST(IntegerPolyhedronTest, FindSampleTest) {
   checkPermutationsSample(
       false /* empty */, 5,
       {
-          // Tetrahedron contraints:
+          // Tetrahedron constraints:
           {0, 1, 0, 0, 0, 0},  // y >= 0
           {0, -1, 1, 0, 0, 0}, // z >= y
                                // -300000x + 299998y + 100000 + z <= 0.
@@ -360,7 +360,7 @@ TEST(IntegerPolyhedronTest, FindSampleTest) {
   checkPermutationsSample(
       false /* empty */, 5,
       {
-          // Tetrahedron contraints:
+          // Tetrahedron constraints:
           {0, 1, 0, 0, 0, 0, 0},  // y >= 0
           {0, -1, 1, 0, 0, 0, 0}, // z >= y
                                   // -300000x + 299998y + 100000 + z <= 0.
@@ -386,7 +386,7 @@ TEST(IntegerPolyhedronTest, FindSampleTest) {
   // Since the tetrahedron is empty, the Cartesian product is too.
   checkPermutationsSample(false /* empty */, 5,
                           {
-                              // Tetrahedron contraints:
+                              // Tetrahedron constraints:
                               {0, 1, 0, 0, 0, 0},
                               {0, -300, 299, 0, 0, 0},
                               {300 * 299, -89400, -299, 0, 0, -100 * 299},
@@ -404,7 +404,7 @@ TEST(IntegerPolyhedronTest, FindSampleTest) {
   // {(p, q) : 1/3 <= p <= 2/3}.
   checkPermutationsSample(false /* empty */, 5,
                           {
-                              // Tetrahedron contraints:
+                              // Tetrahedron constraints:
                               {0, 1, 0, 0, 0, 0},
                               {0, -300, 299, 0, 0, 0},
                               {300 * 299, -89400, -299, 0, 0, -100 * 299},
@@ -622,7 +622,7 @@ TEST(IntegerPolyhedronTest, addConstantLowerBound) {
 
 /// Check if the expected division representation of local variables matches the
 /// computed representation. The expected division representation is given as
-/// a vector of expressions set in `expectedDividends` and the corressponding
+/// a vector of expressions set in `expectedDividends` and the corresponding
 /// denominator in `expectedDenominators`. The `denominators` and `dividends`
 /// obtained through `getLocalRepr` function is verified against the
 /// `expectedDenominators` and `expectedDividends` respectively.

mlir/unittests/Dialect/SparseTensor/MergerTest.cpp

@@ -791,7 +791,7 @@ TEST_P(MergerTest3T1L, vector_cmp) {
                             loopsToBits({{l0, t1}}));
 }
 
-/// Vector element-wise comparsion (disjunction) of 2 vectors, i.e.;
+/// Vector element-wise comparison (disjunction) of 2 vectors, i.e.;
 ///   a(i) = b(i) cmp c(i)
 /// which should form the 3 lattice points
 /// {