| 1 | //===- ArmSMEToSCF.cpp - Convert ArmSME to SCF dialect ----------*- C++ -*-===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | // |
| 9 | // This file implements lowering of ArmSME operations to SCF. |
| 10 | // |
| 11 | //===----------------------------------------------------------------------===// |
| 12 | #include "mlir/Conversion/ArmSMEToSCF/ArmSMEToSCF.h" |
| 13 | |
| 14 | #include "mlir/Dialect/Arith/IR/Arith.h" |
| 15 | #include "mlir/Dialect/ArmSME/IR/ArmSME.h" |
| 16 | #include "mlir/Dialect/ArmSME/Utils/Utils.h" |
| 17 | #include "mlir/Dialect/SCF/IR/SCF.h" |
| 18 | #include "mlir/Pass/Pass.h" |
| 19 | #include "mlir/Transforms/DialectConversion.h" |
| 20 | |
| 21 | namespace mlir { |
| 22 | #define GEN_PASS_DEF_CONVERTARMSMETOSCFPASS |
| 23 | #include "mlir/Conversion/Passes.h.inc" |
| 24 | } // namespace mlir |
| 25 | |
| 26 | using namespace mlir; |
| 27 | |
| 28 | namespace { |
| 29 | /// Returns adjusted (1-D or 2-D) `indices` for a tile slice as follows: |
| 30 | /// rank 1: (indices[0] + (tileSliceIndex * tileSliceNumElts)) |
| 31 | /// rank 2: (indices[0] + tileSliceIndex, indices[1]) |
| 32 | SmallVector<Value, 2> getMemrefIndices(ValueRange indices, unsigned rank, |
| 33 | Value tileSliceIndex, |
| 34 | Value tileSliceNumElts, Location loc, |
| 35 | PatternRewriter &rewriter) { |
| 36 | assert(rank == 2 && "memref has unexpected rank!" ); |
| 37 | SmallVector<Value, 2> outIndices; |
| 38 | |
| 39 | auto tileSliceOffset = tileSliceIndex; |
| 40 | |
| 41 | auto baseIndexPlusTileSliceOffset = |
| 42 | arith::AddIOp::create(builder&: rewriter, location: loc, lhs: indices[0], rhs: tileSliceOffset); |
| 43 | outIndices.push_back(Elt: baseIndexPlusTileSliceOffset); |
| 44 | outIndices.push_back(Elt: indices[1]); |
| 45 | |
| 46 | return outIndices; |
| 47 | } |
| 48 | |
| 49 | /// Creates an scf.for for the load/store of an ArmSME tile. |
| 50 | FailureOr<scf::ForOp> createLoadStoreForOverTileSlices( |
| 51 | PatternRewriter &rewriter, Location loc, VectorType tileType, |
| 52 | ValueRange memrefIndices, int memrefRank, Value mask, Value initTile, |
| 53 | function_ref<Value(/*index=*/Value, ValueRange, /*predicate=*/Value, |
| 54 | /*currentTile=*/Value)> |
| 55 | makeLoopBody) { |
| 56 | PatternRewriter::InsertionGuard guard(rewriter); |
| 57 | |
| 58 | // TODO: This case should be captured and rejected by a verifier. |
| 59 | if (memrefIndices.size() != 2) |
| 60 | return rewriter.notifyMatchFailure(arg&: loc, msg: "invalid number of indices" ); |
| 61 | |
| 62 | auto minTileSlices = arith::ConstantIndexOp::create( |
| 63 | builder&: rewriter, location: loc, |
| 64 | value: arm_sme::getSMETileSliceMinNumElts(type: tileType.getElementType())); |
| 65 | auto vscale = |
| 66 | vector::VectorScaleOp::create(builder&: rewriter, location: loc, result: rewriter.getIndexType()); |
| 67 | auto predicateType = |
| 68 | VectorType::get(shape: tileType.getDimSize(idx: 1), elementType: rewriter.getI1Type(), scalableDims: true); |
| 69 | |
| 70 | // This describes both the number of ZA tile slices and the number of |
| 71 | // elements in a vector of SVL bits for a given element type (SVL_B, |
| 72 | // SVL_H, ..., SVL_Q). |
| 73 | auto numTileSlices = |
| 74 | arith::MulIOp::create(builder&: rewriter, location: loc, lhs: minTileSlices, rhs: vscale); |
| 75 | |
| 76 | Value predicate; |
| 77 | Value upperBound; |
| 78 | if (mask) { |
| 79 | auto createMaskOp = mask.getDefiningOp<vector::CreateMaskOp>(); |
| 80 | auto maskDim0 = createMaskOp.getOperands()[0]; |
| 81 | auto maskDim1 = createMaskOp.getOperands()[1]; |
| 82 | |
| 83 | // The upper bound of the loop must be clamped at `numTileSlices` as |
| 84 | // `vector.create_mask` allows operands to be greater than the size of a |
| 85 | // dimension. |
| 86 | auto numRowI64 = arith::IndexCastOp::create( |
| 87 | builder&: rewriter, location: loc, out: rewriter.getI64Type(), in: maskDim0); |
| 88 | auto numTileSlicesI64 = arith::IndexCastOp::create( |
| 89 | builder&: rewriter, location: loc, out: rewriter.getI64Type(), in: numTileSlices); |
| 90 | auto upperBoundI64 = |
| 91 | arith::MinSIOp::create(builder&: rewriter, location: loc, lhs: numRowI64, rhs: numTileSlicesI64); |
| 92 | upperBound = arith::IndexCastOp::create( |
| 93 | builder&: rewriter, location: loc, out: rewriter.getIndexType(), in: upperBoundI64); |
| 94 | |
| 95 | predicate = |
| 96 | vector::CreateMaskOp::create(builder&: rewriter, location: loc, resultType0: predicateType, mask_dim_sizes: maskDim1); |
| 97 | } else { |
| 98 | upperBound = numTileSlices; |
| 99 | // No mask. Create an 'all true' predicate for the tile slice. |
| 100 | predicate = arith::ConstantOp::create( |
| 101 | builder&: rewriter, location: loc, value: DenseElementsAttr::get(type: predicateType, value: true)); |
| 102 | } |
| 103 | |
| 104 | bool hasCarriedArgs = bool(initTile); |
| 105 | auto lowerBound = arith::ConstantIndexOp::create(builder&: rewriter, location: loc, value: 0); |
| 106 | auto step = arith::ConstantIndexOp::create(builder&: rewriter, location: loc, value: 1); |
| 107 | auto forOp = |
| 108 | scf::ForOp::create(builder&: rewriter, location: loc, lowerBound, upperBound, step, |
| 109 | initArgs: hasCarriedArgs ? ValueRange{initTile} : ValueRange{}); |
| 110 | |
| 111 | rewriter.setInsertionPointToStart(forOp.getBody()); |
| 112 | Value tileSliceIndex = forOp.getInductionVar(); |
| 113 | |
| 114 | auto adjustedIndices = getMemrefIndices( |
| 115 | indices: memrefIndices, rank: memrefRank, tileSliceIndex, tileSliceNumElts: numTileSlices, loc, rewriter); |
| 116 | auto nextTile = makeLoopBody( |
| 117 | tileSliceIndex, adjustedIndices, predicate, |
| 118 | /*currentTile=*/hasCarriedArgs ? forOp.getRegionIterArg(index: 0) : Value{}); |
| 119 | |
| 120 | assert(bool(nextTile) == hasCarriedArgs); |
| 121 | if (nextTile) |
| 122 | scf::YieldOp::create(builder&: rewriter, location: loc, results: nextTile); |
| 123 | |
| 124 | return forOp; |
| 125 | } |
| 126 | |
| 127 | FailureOr<scf::ForOp> createLoadStoreForOverTileSlices( |
| 128 | PatternRewriter &rewriter, Location loc, VectorType tileType, |
| 129 | ValueRange memrefIndices, int memrefRank, Value mask, |
| 130 | function_ref<void(/*index=*/Value, ValueRange, /*predicate=*/Value)> |
| 131 | makeLoopBody) { |
| 132 | return createLoadStoreForOverTileSlices( |
| 133 | rewriter, loc, tileType, memrefIndices, memrefRank, mask, initTile: Value{}, |
| 134 | makeLoopBody: [&](Value index, ValueRange adjustedIndices, Value predicate, |
| 135 | Value) -> Value { |
| 136 | makeLoopBody(index, adjustedIndices, predicate); |
| 137 | return {}; |
| 138 | }); |
| 139 | } |
| 140 | |
| 141 | /// Lower `arm_sme.tile_load` without a mask, or with a mask and a zero pad. |
| 142 | /// |
| 143 | /// With a mask: |
| 144 | /// |
| 145 | /// BEFORE: |
| 146 | /// ```mlir |
| 147 | /// %pad = arith.constant 0 : i32 |
| 148 | /// %mask = vector.create_mask %num_rows, %num_cols : vector<[4]x[4]xi1> |
| 149 | /// %tile = arm_sme.tile_load %src[%c0, %c0], %pad, %mask : |
| 150 | /// memref<?x?xi32>, vector<[4]x[4]xi32> |
| 151 | /// ``` |
| 152 | /// |
| 153 | /// AFTER: |
| 154 | /// ```mlir |
| 155 | /// %init_tile = arm_sme.zero : vector<[4]x[4]xi32> |
| 156 | /// %mask_cols = vector.create_mask %num_cols : vector<[4]xi1> |
| 157 | /// %loop_rows = arith.minsi %num_rows, %svl_s : index |
| 158 | /// %tile = scf.for %tile_slice_idx = %c0 to %loop_rows step %c1 |
| 159 | /// iter_args(%iter_tile = %init_tile) -> (vector<[4]x[4]xi32>) { |
| 160 | /// %tile_update = arm_sme.load_tile_slice |
| 161 | /// %src[%tile_slice_idx], %num_cols, %iter_tile, %tile_slice_idx : |
| 162 | /// memref<?x?xi32>, vector<[1]xi32>, vector<[4]x[4]xi32> |
| 163 | /// scf.yield %tile_update : vector<[4]x[4]xi32> |
| 164 | /// } |
| 165 | /// ``` |
| 166 | /// |
| 167 | /// Without a mask the lowering is pretty much identical. The only difference is |
| 168 | /// %mask_cols becomes an all-true mask, and %loop_rows becomes %svl_s. |
| 169 | /// |
| 170 | /// NOTE: Only mask of 'vector.create_mask' op is currently supported. |
| 171 | struct TileLoadOpConversion : public OpRewritePattern<arm_sme::TileLoadOp> { |
| 172 | using OpRewritePattern<arm_sme::TileLoadOp>::OpRewritePattern; |
| 173 | |
| 174 | LogicalResult matchAndRewrite(arm_sme::TileLoadOp tileLoadOp, |
| 175 | PatternRewriter &rewriter) const override { |
| 176 | auto loc = tileLoadOp.getLoc(); |
| 177 | auto tileType = tileLoadOp.getVectorType(); |
| 178 | auto mask = tileLoadOp.getMask(); |
| 179 | |
| 180 | Value initTile; |
| 181 | if (mask) { |
| 182 | if (!mask.getDefiningOp<vector::CreateMaskOp>()) |
| 183 | return rewriter.notifyMatchFailure( |
| 184 | arg&: loc, msg: "unsupported mask op, only 'vector.create_mask' is " |
| 185 | "currently supported" ); |
| 186 | auto padOp = tileLoadOp.getPadding(); |
| 187 | assert(padOp && "expected padding when masking!" ); |
| 188 | |
| 189 | auto constPadOp = padOp.getDefiningOp<arith::ConstantOp>(); |
| 190 | if (!constPadOp || constPadOp.getValue() != |
| 191 | rewriter.getZeroAttr(type: tileType.getElementType())) |
| 192 | return rewriter.notifyMatchFailure( |
| 193 | arg&: tileLoadOp, msg: "op has non-zero pad, needs non-zero pad pattern" ); |
| 194 | |
| 195 | // Initialize tile with zero to satisfy padding. Inactive cols will be |
| 196 | // zeroed anyway since the loads use zeroing predication. For inactive |
| 197 | // rows however, no load will occur so these need to be zeroed. |
| 198 | initTile = arm_sme::ZeroOp::create(builder&: rewriter, location: loc, res: tileType); |
| 199 | } else { |
| 200 | initTile = arm_sme::GetTileOp::create(builder&: rewriter, location: loc, tile: tileType); |
| 201 | } |
| 202 | |
| 203 | // Create a loop to load the active tile slices from memory. |
| 204 | auto forOp = createLoadStoreForOverTileSlices( |
| 205 | rewriter, loc, tileType, memrefIndices: tileLoadOp.getIndices(), |
| 206 | memrefRank: tileLoadOp.getMemRefType().getRank(), mask, initTile, |
| 207 | makeLoopBody: [&](Value tileSliceIndex, ValueRange memrefIndices, Value predicate, |
| 208 | Value currentTile) -> Value { |
| 209 | // Create 'arm_sme.load_tile_slice' to load tile slice from memory |
| 210 | // into tile. |
| 211 | return arm_sme::LoadTileSliceOp::create( |
| 212 | builder&: rewriter, location: loc, result: tileType, base: tileLoadOp.getBase(), mask: predicate, |
| 213 | tile: currentTile, indices: memrefIndices, tile_slice_index: tileSliceIndex, |
| 214 | layout: tileLoadOp.getLayout()); |
| 215 | }); |
| 216 | |
| 217 | if (failed(Result: forOp)) |
| 218 | return forOp; |
| 219 | |
| 220 | // Replace 'arm_sme.tile_load' with the result. |
| 221 | rewriter.replaceOp(op: tileLoadOp, newValues: forOp->getResult(i: 0)); |
| 222 | |
| 223 | return success(); |
| 224 | } |
| 225 | }; |
| 226 | |
| 227 | /// Lower `arm_sme.tile_load` with mask and non-zero pad. |
| 228 | /// |
| 229 | /// BEFORE: |
| 230 | /// ```mlir |
| 231 | /// %mask = vector.create_mask %num_rows, %num_cols : vector<[4]x[4]xi1> |
| 232 | /// %tile = arm_sme.tile_load %src[%c0, %c0], %pad, %mask : |
| 233 | /// memref<?x?xi32>, vector<[4]x[4]xi32> |
| 234 | /// ``` |
| 235 | /// |
| 236 | /// AFTER: |
| 237 | /// ```mlir |
| 238 | /// ... |
| 239 | /// %pad_1d = vector.broadcast %pad : i32 to vector<[4]xi32> |
| 240 | /// %tile = scf.for %tile_slice_idx = %c0 to %svl_s step %c1 |
| 241 | /// iter_args(%iter_tile = %init_tile) -> (vector<[4]x[4]xi32>) { |
| 242 | /// ... |
| 243 | /// %mask_1d = vector.create_mask <combined_mask> : vector<[4]xi1> |
| 244 | /// %slice = vector.maskedload %base[%tile_slice_idx, %c0], %mask_1d, %pad_1d |
| 245 | /// : memref<?x?xi32>, vector<[4]xi1>, |
| 246 | /// vector<[4]xi32> into vector<[4]xi32> |
| 247 | /// // Insert slice into tile |
| 248 | /// %tile_update = arm_sme.insert_tile_slice |
| 249 | /// %slice, %iter_tile[%tile_slice_idx] : |
| 250 | /// vector<[4]xi32> into vector<[4]x[4]xi32> |
| 251 | /// scf.yield %tile_update : vector<[4]x[4]xi32> |
| 252 | /// } |
| 253 | /// ``` |
| 254 | struct TileLoadOpWithMaskAndPadNonZeroConversion |
| 255 | : public OpRewritePattern<arm_sme::TileLoadOp> { |
| 256 | using OpRewritePattern<arm_sme::TileLoadOp>::OpRewritePattern; |
| 257 | |
| 258 | LogicalResult matchAndRewrite(arm_sme::TileLoadOp tileLoadOp, |
| 259 | PatternRewriter &rewriter) const override { |
| 260 | OpBuilder::InsertionGuard g(rewriter); |
| 261 | auto loc = tileLoadOp.getLoc(); |
| 262 | auto tileType = tileLoadOp.getVectorType(); |
| 263 | auto tileElementType = tileType.getElementType(); |
| 264 | |
| 265 | auto maskOp = tileLoadOp.getMask(); |
| 266 | if (!maskOp) |
| 267 | return rewriter.notifyMatchFailure( |
| 268 | arg&: tileLoadOp, msg: "op has no mask, needs unmasked pattern" ); |
| 269 | |
| 270 | auto padOp = tileLoadOp.getPadding(); |
| 271 | assert(padOp && "expected padding when masking!" ); |
| 272 | |
| 273 | auto createMaskOp = maskOp.getDefiningOp<vector::CreateMaskOp>(); |
| 274 | if (!createMaskOp) |
| 275 | return rewriter.notifyMatchFailure( |
| 276 | arg&: tileLoadOp, msg: "unsupported mask op, only 'vector.create_mask' is " |
| 277 | "currently supported" ); |
| 278 | |
| 279 | auto constPadOp = padOp.getDefiningOp<arith::ConstantOp>(); |
| 280 | if (constPadOp && |
| 281 | constPadOp.getValue() == rewriter.getZeroAttr(type: tileElementType)) |
| 282 | return rewriter.notifyMatchFailure( |
| 283 | arg&: tileLoadOp, msg: "op has constant zero pad, needs zero pad pattern" ); |
| 284 | |
| 285 | auto numRows = createMaskOp.getOperands()[0]; |
| 286 | auto numCols = createMaskOp.getOperands()[1]; |
| 287 | |
| 288 | auto numColsI32 = arith::IndexCastUIOp::create( |
| 289 | builder&: rewriter, location: loc, out: rewriter.getI32Type(), in: numCols); |
| 290 | |
| 291 | auto initTile = arm_sme::GetTileOp::create(builder&: rewriter, location: loc, tile: tileType); |
| 292 | |
| 293 | // Create a loop that loads each ZA tile slice from memory. |
| 294 | auto step = arith::ConstantIndexOp::create(builder&: rewriter, location: loc, value: 1); |
| 295 | auto minTileSlices = arith::ConstantIndexOp::create( |
| 296 | builder&: rewriter, location: loc, value: arm_sme::getSMETileSliceMinNumElts(type: tileElementType)); |
| 297 | auto vscale = |
| 298 | vector::VectorScaleOp::create(builder&: rewriter, location: loc, result: rewriter.getIndexType()); |
| 299 | auto lowerBound = arith::ConstantIndexOp::create(builder&: rewriter, location: loc, value: 0); |
| 300 | auto numTileSlices = |
| 301 | arith::MulIOp::create(builder&: rewriter, location: loc, lhs: minTileSlices, rhs: vscale); |
| 302 | auto forOp = scf::ForOp::create(builder&: rewriter, location: loc, lowerBound, upperBound: numTileSlices, |
| 303 | step, initArgs: ValueRange{initTile}); |
| 304 | |
| 305 | rewriter.setInsertionPointToStart(forOp.getBody()); |
| 306 | |
| 307 | auto tileSliceIndex = forOp.getInductionVar(); |
| 308 | auto currentTile = forOp.getRegionIterArg(index: 0); |
| 309 | |
| 310 | // Combine masks. |
| 311 | auto rowIsActive = arith::CmpIOp::create( |
| 312 | builder&: rewriter, location: loc, predicate: arith::CmpIPredicate::slt, lhs: tileSliceIndex, rhs: numRows); |
| 313 | auto rowIsActiveI32 = arith::ExtSIOp::create( |
| 314 | builder&: rewriter, location: loc, out: rewriter.getI32Type(), in: rowIsActive); |
| 315 | auto mask = |
| 316 | arith::AndIOp::create(builder&: rewriter, location: loc, lhs: rowIsActiveI32, rhs: numColsI32); |
| 317 | auto maskIndex = arith::IndexCastOp::create(builder&: rewriter, location: loc, |
| 318 | out: rewriter.getIndexType(), in: mask); |
| 319 | auto predicateType = |
| 320 | VectorType::get(shape: tileType.getDimSize(idx: 1), elementType: rewriter.getI1Type(), scalableDims: true); |
| 321 | auto maskOp1D = vector::CreateMaskOp::create(builder&: rewriter, location: loc, resultType0: predicateType, |
| 322 | mask_dim_sizes: maskIndex.getResult()); |
| 323 | |
| 324 | auto memrefIndices = getMemrefIndices( |
| 325 | indices: tileLoadOp.getIndices(), rank: tileLoadOp.getMemRefType().getRank(), |
| 326 | tileSliceIndex, tileSliceNumElts: numTileSlices, loc, rewriter); |
| 327 | |
| 328 | // Splat pad into 1-D vector matching type of tile slice. |
| 329 | VectorType tileSliceType = VectorType::Builder(tileType).dropDim(pos: 0); |
| 330 | auto pad1DOp = |
| 331 | vector::BroadcastOp::create(builder&: rewriter, location: loc, result: tileSliceType, source: padOp); |
| 332 | |
| 333 | auto loadSlice = vector::MaskedLoadOp::create(builder&: rewriter, location: loc, resultType: tileSliceType, |
| 334 | base: tileLoadOp.getBase(), |
| 335 | indices: memrefIndices, mask: maskOp1D, |
| 336 | /*passthrough=*/pad1DOp); |
| 337 | |
| 338 | // Create 'arm_sme.insert_tile_slice' to insert slice into tile. |
| 339 | auto insertSlice = arm_sme::InsertTileSliceOp::create( |
| 340 | builder&: rewriter, location: loc, result: tileType, vector: loadSlice->getResult(idx: 0), tile: currentTile, |
| 341 | tile_slice_index: tileSliceIndex, layout: tileLoadOp.getLayout()); |
| 342 | scf::YieldOp::create(builder&: rewriter, location: loc, results: insertSlice.getResult()); |
| 343 | |
| 344 | rewriter.setInsertionPointAfter(forOp); |
| 345 | |
| 346 | // Replace 'arm_sme.tile_load' with the result. |
| 347 | rewriter.replaceOp(op: tileLoadOp, newValues: forOp.getResult(i: 0)); |
| 348 | |
| 349 | return success(); |
| 350 | } |
| 351 | }; |
| 352 | |
| 353 | /// Lower `arm_sme.tile_store` to a loop over the tile slices and store each |
| 354 | /// slice using `arm_sme.store_tile_slice`. |
| 355 | /// |
| 356 | /// BEFORE: |
| 357 | /// ```mlir |
| 358 | /// arm_sme.tile_store %tile, %dest[%c0, %c0] layout<vertical> |
| 359 | /// : memref<?x?xi32>, vector<[4]x[4]xi32 |
| 360 | /// ``` |
| 361 | /// |
| 362 | /// AFTER: |
| 363 | /// ```mlir |
| 364 | /// %vscale = vector.vscale |
| 365 | /// %c0 = arith.constant 0 : index |
| 366 | /// %c1 = arith.constant 1 : index |
| 367 | /// %min_svl_s = arith.constant 4 : index |
| 368 | /// %svl_s = arith.muli %min_svl_s, %vscale : index |
| 369 | /// scf.for %tile_slice_idx = %c0 to %svl_s step %c1 { |
| 370 | /// arm_sme.store_tile_slice %tile, %tile_slice_idx, %dest[%tile_slice_idx], |
| 371 | /// layout<vertical> : memref<?x?xi32>, vector<[4]x[4]xi32> |
| 372 | /// } |
| 373 | /// ``` |
| 374 | struct TileStoreOpConversion : public OpRewritePattern<arm_sme::TileStoreOp> { |
| 375 | using OpRewritePattern<arm_sme::TileStoreOp>::OpRewritePattern; |
| 376 | |
| 377 | LogicalResult matchAndRewrite(arm_sme::TileStoreOp tileStoreOp, |
| 378 | PatternRewriter &rewriter) const override { |
| 379 | if (Value mask = tileStoreOp.getMask()) { |
| 380 | if (!mask.getDefiningOp<vector::CreateMaskOp>()) |
| 381 | return rewriter.notifyMatchFailure( |
| 382 | arg: tileStoreOp.getLoc(), |
| 383 | msg: "unsupported mask op, only 'vector.create_mask' is " |
| 384 | "currently supported" ); |
| 385 | } |
| 386 | |
| 387 | // Create a loop that stores each active ZA tile slice from memory. |
| 388 | return createLoadStoreForOverTileSlices( |
| 389 | rewriter, loc: tileStoreOp.getLoc(), tileType: tileStoreOp.getVectorType(), |
| 390 | memrefIndices: tileStoreOp.getIndices(), memrefRank: tileStoreOp.getMemRefType().getRank(), |
| 391 | mask: tileStoreOp.getMask(), |
| 392 | makeLoopBody: [&](Value tileSliceIndex, ValueRange memrefIndices, Value predicate) { |
| 393 | rewriter.replaceOpWithNewOp<arm_sme::StoreTileSliceOp>( |
| 394 | op: tileStoreOp, args: tileStoreOp.getValueToStore(), args&: tileSliceIndex, |
| 395 | args&: predicate, args: tileStoreOp.getBase(), args&: memrefIndices, |
| 396 | args: tileStoreOp.getLayout()); |
| 397 | }); |
| 398 | } |
| 399 | }; |
| 400 | |
| 401 | } // namespace |
| 402 | |
| 403 | void mlir::populateArmSMEToSCFConversionPatterns(RewritePatternSet &patterns) { |
| 404 | patterns.add<TileLoadOpConversion, TileLoadOpWithMaskAndPadNonZeroConversion, |
| 405 | TileStoreOpConversion>(arg: patterns.getContext()); |
| 406 | } |
| 407 | |
| 408 | namespace { |
| 409 | |
| 410 | struct ConvertArmSMEToSCFPass |
| 411 | : public impl::ConvertArmSMEToSCFPassBase<ConvertArmSMEToSCFPass> { |
| 412 | void runOnOperation() override { |
| 413 | RewritePatternSet patterns(&getContext()); |
| 414 | ConversionTarget target(getContext()); |
| 415 | populateArmSMEToSCFConversionPatterns(patterns); |
| 416 | target.addLegalDialect<arm_sme::ArmSMEDialect, vector::VectorDialect, |
| 417 | arith::ArithDialect, scf::SCFDialect>(); |
| 418 | target.addIllegalOp<arm_sme::TileLoadOp, arm_sme::TileStoreOp>(); |
| 419 | if (failed(Result: applyPartialConversion(op: getOperation(), target, |
| 420 | patterns: std::move(patterns)))) |
| 421 | signalPassFailure(); |
| 422 | } |
| 423 | }; |
| 424 | |
| 425 | } // namespace |
| 426 | |