Minor change

Author: yzhang93

mlir/include/mlir/Dialect/Linalg/TransformOps/LinalgTransformOps.td

@@ -1191,7 +1191,7 @@ def PadTilingInterfaceOp : Op<Transform_Dialect, "structured.pad_tiling_interfac
     iteration domain induces a padding of the operands that is consistent
     across the op semantics and, unlike for simple elementwise ops, may not be
     trivially deducible or specifiable on operands only (e.g. convolutions).
-    Currently, only a limited set of projected permutation map is supported.
+    Currently, only a limited set of projected permutation maps are supported.
 
     The specification of `padding_sizes` follows that of `tile_sizes` during
     tiling: the value "0" on a particular iterator encode "no padding". Like in

mlir/include/mlir/Dialect/Linalg/Transforms/Transforms.h

@@ -614,7 +614,7 @@ LogicalResult rewriteAsPaddedOp(RewriterBase &rewriter, LinalgOp opToPad,
 /// The padded shape is computed by evaluating the maximum accessed index per
 /// dimension, which may involve multiplying by constant factors derived from
 /// the affine indexing expressions. Currently, only a limited set of projected
-/// permuation indexing map is supported, such as
+/// permuation indexing maps are supported, such as
 /// - affine_map<(d0, d1, d2) -> (d0, d1)>
 /// - affine_map<(d0, d1, d2) -> (d0, d1 + d2)>
 /// - affine_map<(d0, d1) -> (d0 * 3 + d1)>

mlir/lib/Dialect/Linalg/Transforms/PadTilingInterface.cpp

@@ -88,7 +88,7 @@ static int64_t extractConstantMultiplier(AffineExpr expr) {
 /// The padded shape is computed by evaluating the maximum accessed index per
 /// dimension, which may involve multiplying by constant factors derived from
 /// the affine indexing expressions. Currently, only a limited set of projected
-/// permutation indexing map is supported, such as
+/// permutation indexing maps are supported, such as
 /// - affine_map<(d0, d1, d2) -> (d0, d1)>
 /// - affine_map<(d0, d1, d2) -> (d0, d1 + d2)>
 /// - affine_map<(d0, d1) -> (d0 * 3 + d1)>