diff options
| author | Kazuaki Ishizaki <ishizaki@jp.ibm.com> | 2019-12-09 09:23:15 -0800 |
|---|---|---|
| committer | A. Unique TensorFlower <gardener@tensorflow.org> | 2019-12-09 09:23:48 -0800 |
| commit | ae05cf27c62ad7f656f9ac1bf76d5bfe6fec81b6 (patch) | |
| tree | 787e4b0f9684a2dc13eda02b5f885e745ae4e4ca /mlir/lib/Transforms | |
| parent | 91c0074624a2ba7f3f56617da75afe70713b82b2 (diff) | |
| download | bcm5719-llvm-ae05cf27c62ad7f656f9ac1bf76d5bfe6fec81b6.tar.gz bcm5719-llvm-ae05cf27c62ad7f656f9ac1bf76d5bfe6fec81b6.zip | |
Minor spelling tweaks
Closes tensorflow/mlir#304
PiperOrigin-RevId: 284568358
Diffstat (limited to 'mlir/lib/Transforms')
| -rw-r--r-- | mlir/lib/Transforms/LoopTiling.cpp | 2 | ||||
| -rw-r--r-- | mlir/lib/Transforms/Utils/LoopUtils.cpp | 2 | ||||
| -rw-r--r-- | mlir/lib/Transforms/Utils/Utils.cpp | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/mlir/lib/Transforms/LoopTiling.cpp b/mlir/lib/Transforms/LoopTiling.cpp index 4ee7197f2df..10654783aa9 100644 --- a/mlir/lib/Transforms/LoopTiling.cpp +++ b/mlir/lib/Transforms/LoopTiling.cpp @@ -362,7 +362,7 @@ void LoopTiling::getTileSizes(ArrayRef<AffineForOp> band, // one possible approach. Or compute a polynomial in tile sizes and solve for // it. - // For an n-d tilable band, compute n^th root of the excess. + // For an n-d tileable band, compute n^th root of the excess. unsigned tSize = static_cast<unsigned>(floorl(std::pow(excessFactor, 1.0 / band.size()))); // We'll keep a running product to determine the last tile size better. diff --git a/mlir/lib/Transforms/Utils/LoopUtils.cpp b/mlir/lib/Transforms/Utils/LoopUtils.cpp index e9a6ee12eb6..50248b01359 100644 --- a/mlir/lib/Transforms/Utils/LoopUtils.cpp +++ b/mlir/lib/Transforms/Utils/LoopUtils.cpp @@ -933,7 +933,7 @@ static LogicalResult tryIsolateBands(const TileLoops &tileLoops) { TileLoops mlir::extractFixedOuterLoops(loop::ForOp rootForOp, ArrayRef<int64_t> sizes) { - // Collect prefectly nested loops. If more size values provided than nested + // Collect perfectly nested loops. If more size values provided than nested // loops available, truncate `sizes`. SmallVector<loop::ForOp, 4> forOps; forOps.reserve(sizes.size()); diff --git a/mlir/lib/Transforms/Utils/Utils.cpp b/mlir/lib/Transforms/Utils/Utils.cpp index 35a5273a28f..190b6c3155e 100644 --- a/mlir/lib/Transforms/Utils/Utils.cpp +++ b/mlir/lib/Transforms/Utils/Utils.cpp @@ -70,7 +70,7 @@ LogicalResult mlir::replaceAllMemRefUsesWith(Value *oldMemRef, Value *newMemRef, (void)oldMemRefRank; // unused in opt mode if (indexRemap) { assert(indexRemap.getNumSymbols() == symbolOperands.size() && - "symbolic operand count mistmatch"); + "symbolic operand count mismatch"); assert(indexRemap.getNumInputs() == extraOperands.size() + oldMemRefRank + symbolOperands.size()); assert(indexRemap.getNumResults() + extraIndices.size() == newMemRefRank); |

