-
Notifications
You must be signed in to change notification settings - Fork 55
Expand file tree
/
Copy pathBlockwiseGemmToThreadwise.cpp
More file actions
1557 lines (1421 loc) · 71.7 KB
/
BlockwiseGemmToThreadwise.cpp
File metadata and controls
1557 lines (1421 loc) · 71.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//===- BlockwiseGemmToThreadwise - MLIR Rock ops lowering passes ---===//
//
// Copyright 2020 The MLIR Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ============================================================
//
// This pass converts rock.blockwise_* ops to rock.threadwise_*
// and lowers other higher-level ops like transform and fill in preparation for
// the threadwise lowering
//
//===-----------------------------------------------------===//
#include "mlir/Dialect/Arith/IR/Arith.h"
#include "mlir/Dialect/Rock/IR/AmdArchDb.h"
#include "mlir/Dialect/Rock/IR/GetRockInfo.h"
#include "mlir/Dialect/Rock/IR/Rock.h"
#include "mlir/Dialect/Rock/IR/TransformMapBuilder.h"
#include "mlir/Dialect/Rock/Passes.h"
#include "mlir/Dialect/Rock/Tuning/GeneralGemmBlockStructure.h"
#include "mlir/Dialect/Rock/utility/builderUtils.h"
#include "mlir/Dialect/Rock/utility/loweringUtils.h"
#include "mlir/Dialect/Rock/utility/math.h"
#include "mlir/Dialect/Rock/utility/transformMapUtils.h"
#include "mlir/Dialect/Affine/IR/AffineOps.h"
#include "mlir/Dialect/GPU/IR/GPUDialect.h"
#include "mlir/Dialect/MemRef/IR/MemRef.h"
#include "mlir/Dialect/Rock/IR/AccelEmitter.h"
#include "mlir/Dialect/Rock/utility/LdsTransposeLoad.h"
#include "mlir/Dialect/SCF/IR/SCF.h"
#include "mlir/Dialect/Vector/IR/VectorOps.h"
#include "mlir/IR/BuiltinTypes.h"
#include "mlir/Transforms/DialectConversion.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
namespace mlir {
namespace rock {
#define GEN_PASS_DEF_ROCKBLOCKWISEGEMMTOTHREADWISEPASS
#include "mlir/Dialect/Rock/Passes.h.inc"
} // namespace rock
} // namespace mlir
#define DEBUG_TYPE "rock-blockwise-to-threadwise"
using namespace mlir;
using namespace mlir::arith;
using namespace mlir::rock;
using namespace mlir::affine;
namespace {
struct RockLowerBlockwiseGemmToThreadwisePass
: public rock::impl::RockBlockwiseGemmToThreadwisePassBase<
RockLowerBlockwiseGemmToThreadwisePass> {
void runOnOperation() override;
};
//===----------------------------------------------------------------------===//
// Fill lowering.
//===----------------------------------------------------------------------===//
struct FillRewritePattern : public OpConversionPattern<FillOp> {
using OpConversionPattern<FillOp>::OpConversionPattern;
LogicalResult matchAndRewrite(FillOp op, FillOpAdaptor adaptor,
ConversionPatternRewriter &b) const override {
Location loc = op.getLoc();
MemRefType inputType = op.getInput().getType();
ArrayRef<int64_t> inputShape = inputType.getShape();
llvm::SmallVector<int64_t> lbs(inputShape.size(), 0);
llvm::SmallVector<int64_t> strides(inputShape.size(), 1);
affine::buildAffineLoopNest(
b, loc, lbs, inputShape, strides,
[value = adaptor.getValue(), input = adaptor.getInput()](
OpBuilder &b, Location loc, ValueRange ivs) {
memref::StoreOp::create(b, loc, value, input, ivs);
});
b.eraseOp(op);
return success();
}
};
//===----------------------------------------------------------------------===//
// BlockwiseFill lowering.
//===----------------------------------------------------------------------===//
struct BlockwiseFillRewritePattern
: public OpConversionPattern<BlockwiseFillOp> {
using OpConversionPattern<BlockwiseFillOp>::OpConversionPattern;
LogicalResult
matchAndRewrite(BlockwiseFillOp op, BlockwiseFillOpAdaptor adaptor,
ConversionPatternRewriter &rewriter) const override {
Location loc = op.getLoc();
MemRefType memrefType = op.getMemref().getType();
ArrayRef<int64_t> memrefShape = memrefType.getShape();
BottomUpTMBuilder threadsToMemrefTrBuilder(rewriter, memrefShape, loc);
SmallVector<StringRef, 1> lowerNameRefs;
threadsToMemrefTrBuilder.getStartNames(lowerNameRefs);
int64_t blockSize = op.getBlockSize();
Value val = op.getValue();
int64_t numElements = memrefType.getNumElements();
Type valueType = val.getType();
int64_t valueItems = 1;
Type valueElementType = valueType;
if (VectorType valueVecType = dyn_cast<VectorType>(val.getType())) {
valueItems = valueVecType.getNumElements();
valueElementType = valueVecType.getElementType();
}
// guranteed by op verifier that vector length is a factor of memref size
int64_t numValues = numElements / valueItems;
int64_t iterLen = ((numValues + blockSize - 1) / blockSize) * valueItems;
threadsToMemrefTrBuilder.pad(lowerNameRefs[0],
{0, blockSize * iterLen - numElements});
TransformMapAttr pad = threadsToMemrefTrBuilder.get();
threadsToMemrefTrBuilder =
BottomUpTMBuilder::above(threadsToMemrefTrBuilder, pad);
threadsToMemrefTrBuilder.unmerge({"tid", "iter"}, {0, 1}, lowerNameRefs[0],
{blockSize, iterLen});
TransformMapAttr unmerge = threadsToMemrefTrBuilder.get();
gpu::AddressSpaceAttr privateMemoryAddressSpace =
rewriter.getAttr<gpu::AddressSpaceAttr>(
gpu::GPUDialect::getPrivateAddressSpace());
MemRefType valueRegType = MemRefType::get(
valueItems, valueElementType, AffineMap{}, privateMemoryAddressSpace);
GpuAllocOp valueReg = GpuAllocOp::create(rewriter, loc, valueRegType);
Value zero = rewriter.createOrFold<ConstantIndexOp>(loc, 0);
InBoundsStoreOp::create(rewriter, loc, val, valueReg, zero);
Value tid =
rewriter.createOrFold<rock::WorkitemIdOp>(loc, rewriter.getIndexType());
ThreadwiseWriteAllOp::create(rewriter, loc, valueReg, op.getMemref(),
rewriter.getArrayAttr({unmerge, pad}),
/*extraIndices=*/ValueRange{tid},
StoreMethod::Set, true, true);
rewriter.eraseOp(op);
return success();
}
};
//===----------------------------------------------------------------------===//
// BlockwiseGemm lowering.
//===----------------------------------------------------------------------===//
// The structure of this lowing is documented at
// https://github.com/ROCm/rocMLIR/issues/719
struct BlockwiseGemmRewritePattern
: public OpConversionPattern<BlockwiseGemmOp> {
using OpConversionPattern<BlockwiseGemmOp>::OpConversionPattern;
LogicalResult matchAndRewrite(BlockwiseGemmOp op,
BlockwiseGemmOpAdaptor adaptor,
ConversionPatternRewriter &b) const override {
Location loc = op.getLoc();
// Prepare some useful constants.
Value zeroConstantOp = b.createOrFold<ConstantIndexOp>(loc, 0);
MemRefType blockAType = op.getMatrixA().getType(),
blockBType = op.getMatrixB().getType(),
bufferCType = op.getMatrixC().getType();
auto elementType = bufferCType.getElementType();
int64_t k = blockAType.getShape()[0];
int64_t m = blockAType.getShape()[1];
int64_t n = blockBType.getShape()[1];
int64_t kPack = blockAType.getShape()[2];
// Non-accelerator path.
// Obtain critical attributes.
int64_t mC = bufferCType.getShape()[0];
int64_t nC = bufferCType.getShape()[1];
GeneralGemmParamsAttr params = op.getParams();
uint32_t blockSize = params.getBlockSize();
int64_t kPerThread = params.getKPerThread();
int64_t mPerThread = params.getMPerThread();
int64_t nPerThread = params.getNPerThread();
GeneralGemmBlockStructure blockStructure =
*deriveGeneralGemmBlockStructure(blockSize);
int64_t mThreadsPerCuwave = blockStructure.mThreadsPerCuwave;
int64_t nThreadsPerCuwave = blockStructure.nThreadsPerCuwave;
int64_t cuwaveLen = mThreadsPerCuwave * nThreadsPerCuwave;
int64_t mCuwavesPerBlock = blockStructure.mCuwavesPerBlock;
int64_t nCuwavesPerBlock = blockStructure.nCuwavesPerBlock;
int64_t numCuwaves = mCuwavesPerBlock * nCuwavesPerBlock;
int64_t derivedBlockSize = numCuwaves * cuwaveLen;
assert(blockSize == derivedBlockSize &&
"block structure parameters must multiply to block size");
int64_t mRepeat = mC / mPerThread;
int64_t nRepeat = nC / nPerThread;
if (mRepeat * mCuwavesPerBlock * mThreadsPerCuwave * mPerThread != m)
return op.emitOpError("The m turing attributes don't multiply to M_LDS");
if (nRepeat * nCuwavesPerBlock * nThreadsPerCuwave * nPerThread != n)
return op.emitOpError("The n turing parameters don't multiply to N_LDS");
LLVM_DEBUG(llvm::dbgs()
<< "M: " << m << "\n"
<< "mRepeat: " << mRepeat << "\n"
<< "mCuwavesPerBlock: " << mCuwavesPerBlock << "\n"
<< "mThreadsPerCuwave: " << mThreadsPerCuwave << "\n"
<< "mPerThread: " << mPerThread << "\n"
<< "n: " << n << "\n"
<< "nRepeat: " << nRepeat << "\n"
<< "nCuwavesPerBlock: " << nCuwavesPerBlock << "\n"
<< "nThreadsPerCuwave: " << nThreadsPerCuwave << "\n"
<< "nPerThread: " << nPerThread << "\n");
auto ldsTidSplitter = [&](StringRef repeatName, int64_t repeatLen,
StringRef perThreadName,
int64_t perThreadLen) -> TopDownTMBuilder {
TopDownTMBuilder splitTidForLDS(
b, {"k", repeatName, "tid", perThreadName, "kpack"},
{k, repeatLen, blockSize, perThreadLen, kPack}, loc);
splitTidForLDS.passThrough({"k", repeatName});
splitTidForLDS.merge({"m_cuwaves", "n_cuwaves", "m_cuwave", "n_cuwave"},
{2, 3, 4, 5}, "tid",
{mCuwavesPerBlock, nCuwavesPerBlock,
mThreadsPerCuwave, nThreadsPerCuwave});
splitTidForLDS.passThrough({perThreadName, "kpack"}, {6, 7},
{perThreadName, "kpack"});
return splitTidForLDS;
};
int64_t copyMPerThread = op.getInMPerThread();
int64_t copyNPerThread = op.getInNPerThread();
TopDownTMBuilder splitTidA =
ldsTidSplitter("m_repeat", mRepeat, "m_thread", mPerThread);
TransformMapAttr splitTidAAttr = splitTidA.get();
auto toLdsIndexA = TopDownTMBuilder::below(splitTidA, splitTidAAttr);
toLdsIndexA.passThrough("k");
toLdsIndexA.unmerge(
"m", 1, {"m_repeat", "m_cuwaves", "m_cuwave", "m_thread"},
{mRepeat, mCuwavesPerBlock, mThreadsPerCuwave, mPerThread});
toLdsIndexA.ignore("n_cuwaves");
toLdsIndexA.ignore("n_cuwave");
toLdsIndexA.passThrough({"kpack"}, {2}, {"kpack"});
TransformMapAttr toLdsIndexAAttr = toLdsIndexA.get();
SmallVector<Attribute> transformAttrsA{splitTidAAttr, toLdsIndexAAttr};
// If the dimension `m` has been rotated to minimize bank conflicts we want
// to apply the same rotation reading from LDS. This rotation happens in
// `wrapLDSforStore` from
// mlir/lib/Dialect/Rock/Transforms/GridwiseGemmToBlockwise.cpp which needs
// to be kept in sync with this function
int64_t strideA = (kPack == 1 ? copyMPerThread : 1);
rotateIf(op.getRotateMWithK(), toLdsIndexA, toLdsIndexAAttr, strideA, "m",
m, 1, "k", k, {"k"}, {"kpack"}, transformAttrsA);
TopDownTMBuilder splitTidB =
ldsTidSplitter("n_repeat", nRepeat, "n_thread", nPerThread);
TransformMapAttr splitTidBAttr = splitTidB.get();
auto toLdsIndexB = TopDownTMBuilder::below(splitTidB, splitTidBAttr);
toLdsIndexB.passThrough("k");
toLdsIndexB.unmerge(
"n", 1, {"n_repeat", "n_cuwaves", "n_cuwave", "n_thread"},
{nRepeat, nCuwavesPerBlock, nThreadsPerCuwave, nPerThread});
toLdsIndexB.ignore("m_cuwaves");
toLdsIndexB.ignore("m_cuwave");
toLdsIndexB.passThrough({"kpack"}, {2}, {"kpack"});
TransformMapAttr toLdsIndexBAttr = toLdsIndexB.get();
SmallVector<Attribute> transformAttrsB{splitTidBAttr, toLdsIndexBAttr};
// If the dimension `d` has been rotated to minimize bank conflicts we want
// to apply the same rotation reading from LDS. This rotation happens in
// `wrapLDSforStore` from
// mlir/lib/Dialect/Rock/Transforms/GridwiseGemmToBlockwise.cpp which needs
// to be kept in sync with this function
int64_t strideB = (kPack == 1 ? copyNPerThread : 1);
rotateIf(op.getRotateNWithK(), toLdsIndexB, toLdsIndexBAttr, strideB, "n",
n, 1, "k", k, {"k"}, {"kpack"}, transformAttrsB);
Value matrixA, matrixB;
ArrayAttr transformsA, transformsB;
bool ldsANeedsi64, ldsBNeedsi64;
std::tie(matrixA, transformsA, ldsANeedsi64) =
untransform(b, adaptor.getMatrixA(), b.getArrayAttr(transformAttrsA));
std::tie(matrixB, transformsB, ldsBNeedsi64) =
untransform(b, adaptor.getMatrixB(), b.getArrayAttr(transformAttrsB));
if (ldsANeedsi64 || ldsBNeedsi64)
return b.notifyMatchFailure(loc, "LDS map can't need 64-bit indexing");
int64_t threadANumRegisters = kPerThread * mC * kPack;
int64_t threadBNumRegisters = kPerThread * nC * kPack;
// Alloc register for thread_a and thread_b.
auto privateMemoryAddressSpace = b.getAttr<gpu::AddressSpaceAttr>(
gpu::GPUDialect::getPrivateAddressSpace());
auto threadARegisterMemRefType =
MemRefType::get(threadANumRegisters, elementType, AffineMap{},
privateMemoryAddressSpace);
auto threadAAllocOp = GpuAllocOp::create(b, loc, threadARegisterMemRefType);
auto threadBRegisterMemRefType =
MemRefType::get(threadBNumRegisters, elementType, AffineMap{},
privateMemoryAddressSpace);
auto threadBAllocOp = GpuAllocOp::create(b, loc, threadBRegisterMemRefType);
// Define views of register tiles for copies
BottomUpTMBuilder viewA(b, {"raw"}, {threadANumRegisters}, loc);
viewA.unmerge({"k", "m_repeat", "tid", "m_thread", "kpack"},
{0, 1, 2, 3, 4}, "raw",
{kPerThread, mRepeat, 1, mPerThread, kPack});
TransformMapAttr threadACopyViewAttr = viewA.get();
BottomUpTMBuilder viewB(b, {"raw"}, {threadBNumRegisters}, loc);
viewB.unmerge({"k", "n_repeat", "tid", "n_thread", "kpack"},
{0, 1, 2, 3, 4}, "raw",
{kPerThread, nRepeat, 1, nPerThread, kPack});
TransformMapAttr threadBCopyViewAttr = viewB.get();
// Main loop.
Value workitem = b.createOrFold<rock::WorkitemIdOp>(loc, b.getIndexType());
LLVM_DEBUG(llvm::dbgs() << "Outer loop:\n "
<< "k = " << k << "\n"
<< " kPerThread = " << kPerThread << "\n");
auto loopOp =
b.replaceOpWithNewOp<affine::AffineForOp>(op, 0, k, kPerThread);
OpBuilder::InsertionGuard guard(b);
b.setInsertionPointToStart(loopOp.getBody());
Value kOffset = loopOp.getInductionVar();
SmallVector<Value, 5> registerStartCoords(5, zeroConstantOp);
SmallVector<Value, 5> ldsBufferAStartCoords = {
kOffset, zeroConstantOp, workitem, zeroConstantOp, zeroConstantOp};
auto copyALoop = TransformingForOp::create(
b, loc,
ArrayRef<ValueRange>{ldsBufferAStartCoords, registerStartCoords},
ArrayRef<Attribute>{transformsA, b.getArrayAttr(threadACopyViewAttr)},
ArrayRef<int64_t>{kPerThread, mRepeat, 1, mPerThread, kPack},
/*strides=*/std::nullopt, /*forceUnroll=*/true, /*useIndexDiffs=*/true);
{
OpBuilder::InsertionGuard copyAGuard(b);
b.setInsertionPointToStart(copyALoop.getBody());
Value aCopy = memref::LoadOp::create(
b, loc, matrixA, copyALoop.getLowerCoords(/*domain=*/0));
Value aCast = createTypeConversionOp(b, loc, aCopy, elementType);
memref::StoreOp::create(b, loc, aCast, threadAAllocOp,
copyALoop.getLowerCoords(/*domain=*/1));
}
SmallVector<Value, 5> ldsBufferBStartCoords = {
kOffset, zeroConstantOp, workitem, zeroConstantOp, zeroConstantOp};
auto copyBLoop = TransformingForOp::create(
b, loc,
ArrayRef<ValueRange>{ldsBufferBStartCoords, registerStartCoords},
ArrayRef<Attribute>{transformsB, b.getArrayAttr(threadBCopyViewAttr)},
ArrayRef<int64_t>{kPerThread, nRepeat, 1, nPerThread, kPack},
/*strides=*/std::nullopt, /*forceUnroll=*/true, /*useIndexDiffs=*/true);
{
OpBuilder::InsertionGuard copyBGuard(b);
b.setInsertionPointToStart(copyBLoop.getBody());
Value bCopy = memref::LoadOp::create(
b, loc, matrixB, copyBLoop.getLowerCoords(/*domain=*/0));
Value bCast = createTypeConversionOp(b, loc, bCopy, elementType);
memref::StoreOp::create(b, loc, bCast, threadBAllocOp,
copyBLoop.getLowerCoords(/*domain=*/1));
}
Value reshapedARegisters = reshapeBuffer(
b, loc, threadAAllocOp, {"k", "m", "kpack"}, {kPerThread, mC, kPack});
Value reshapedBRegisters = reshapeBuffer(
b, loc, threadBAllocOp, {"k", "n", "kpack"}, {kPerThread, nC, kPack});
// Actually do the gemm - this goes inside the look over kOffset
ThreadwiseGemmOp::create(b, loc, reshapedARegisters, reshapedBRegisters,
op.getMatrixC());
return success();
}
};
//===----------------------------------------------------------------------===//
// BlockwiseGemmAccel lowering.
//===----------------------------------------------------------------------===//
struct BlockwiseGemmAccelRewritePattern
: public OpConversionPattern<BlockwiseGemmAccelOp> {
using OpConversionPattern<BlockwiseGemmAccelOp>::OpConversionPattern;
LogicalResult matchAndRewrite(BlockwiseGemmAccelOp op,
BlockwiseGemmAccelOpAdaptor adaptor,
ConversionPatternRewriter &b) const override {
Location loc = op.getLoc();
StringAttr arch = rock::getArchValue(op);
RockAccelTuningParamAttrInterface tuningParams = op.getParams();
int64_t kpackPerBlock = tuningParams.getKpackPerBlock();
int64_t mPerWave = tuningParams.getMPerWave();
int64_t nPerWave = tuningParams.getNPerWave();
int64_t mPerBlock = tuningParams.getMPerBlock();
int64_t nPerBlock = tuningParams.getNPerBlock();
bool loadAFromLDS = adaptor.getMatrixA() != nullptr;
bool loadBFromLDS = adaptor.getMatrixB() != nullptr;
BlockwiseMatrixParamsAttr matrixParamsA = op.getMatrixParamsA();
BlockwiseMatrixParamsAttr matrixParamsB = op.getMatrixParamsB();
Value scaleA = adaptor.getBufferScaleA();
Value scaleB = adaptor.getBufferScaleB();
bool isScaledGemm = (scaleA != Value{} && scaleB != Value{});
Type dataTypeA = matrixParamsA.getElementType();
Type dataTypeB = matrixParamsB.getElementType();
rock::AmdArchInfo archInfo = rock::lookupArchInfo(arch);
GemmFeatures features = archInfo.defaultFeatures;
auto accelEmitterPtr = rock::accel::AccelEmitter::select(
features, dataTypeA, dataTypeB, arch, tuningParams);
if (!accelEmitterPtr)
return op.emitOpError("Unable to emit accelerator code.");
// Extract relevant accelerator parameters
rock::accel::AccelEmitterParams params = accelEmitterPtr->getParams();
Type argTypeA = params.argTypeA;
Type argTypeB = params.argTypeB;
int64_t mRepeats = params.mRepeats;
int64_t nRepeats = params.nRepeats;
int64_t kBase = params.kBase;
int64_t kBasePerThread = params.kBasePerThread;
int64_t kPerBlock = kpackPerBlock * tuningParams.getKpack();
auto tid = WorkitemIdOp::create(b, loc, b.getIndexType());
// Build LDS-transpose config attribute using decision from
// GridwiseGemmToBlockwise
auto buildTransposeAttr = [&](bool isOperandA) -> LDSTransposeConfigAttr {
const auto &matrixParams = isOperandA ? matrixParamsA : matrixParamsB;
// Check if LDS transpose is enabled for this operand
if (!matrixParams.getLdsTransposeEnabled())
return nullptr;
// Get accelerator dimensions from matrix params and tuning params
// accelDDim = accelDDim (for MFMA instructions with blocksMfma=1)
// accelKDim = accelKDim from BlockwiseMatrixParamsAttr
int64_t accelDDim = matrixParams.getAccelDDim();
int64_t accelKDim = matrixParams.getAccelKDim();
if (accelDDim <= 0 || accelKDim <= 0)
return nullptr;
// Build transpose config attribute using precomputed accelerator geometry
// Note: doubleBuffering=false because this lowering pass operates in
// single-buffer mode.
return hwtranspose::buildTransposeAttrFromParams(
b, accelDDim, accelKDim, mPerBlock, nPerBlock, kPerBlock, mPerWave,
nPerWave,
/*doubleBuffering=*/false, isOperandA);
};
LDSTransposeConfigAttr transposeAttrA =
buildTransposeAttr(/*isOperandA=*/true);
LDSTransposeConfigAttr transposeAttrB =
buildTransposeAttr(/*isOperandA=*/false);
LLVM_DEBUG(llvm::dbgs()
<< "argVectorType A: " << argTypeA << "\n"
<< "argVectorType B: " << argTypeB << "\n"
<< "kBase: " << kBase << "\n"
<< "mPerWave: " << mPerWave << "\n"
<< "nPerWave: " << nPerWave << "\n"
<< "mRepeat: " << mRepeats << "\n"
<< "nRepeat: " << nRepeats << "\n"
<< "kBasePerThread: " << kBasePerThread << "\n"
<< "kpackPerBlock: " << kpackPerBlock << "\n"
<< "loadAFromLDS: " << loadAFromLDS << "\n"
<< "loadBFromLDS: " << loadBFromLDS << "\n"
<< "rotateMWithK: " << matrixParamsA.getRotateDWithK() << "\n"
<< "rotateNWithK: " << matrixParamsB.getRotateDWithK() << "\n"
<< "bufferA type: " << adaptor.getBufferA().getType() << "\n"
<< "bufferB type: " << adaptor.getBufferB().getType() << "\n");
// The following loop nest hardcodes the following loop schedule:
//
// for(index_t m_i = 0; m_i < mRepeats; ++m_i)
// regsA = threadwise_readinto[m_i, :]
// for(index_t n_i = 0; n_i<nRepeats; ++n_i)
// regsB = threadwise_readint[n_i, :]
// threadwise_gemm(regsA, regsB)
//
// Which mimics:
// https://github.com/ROCm/composable_kernel/blob/develop/include/ck/tensor_operation/gpu/block/blockwise_gemm_xdlops.hpp#L304
//
// Please note that different schedules might exist, so this can be
// considered a temporary hack until we have a proper way of "searching"
// through different schedules (either heuristically or automatically)
// Determine if the other operand uses LDS transpose load
// This is needed to select the correct K access pattern for regular loads
bool bUsesLdsTranspose = matrixParamsB.getLdsTransposeEnabled();
bool aUsesLdsTranspose = matrixParamsA.getLdsTransposeEnabled();
Value wrappedLDSBufferForLoadA, wrappedLDSBufferForLoadB;
if (loadAFromLDS) {
// When loading A, check if B uses transpose load
wrappedLDSBufferForLoadA = accelEmitterPtr->wrapLDSBufferForLoad(
b, loc, op.getMatrixA(), matrixParamsA, op.getBlockSize(), "m",
/*useLdsTransposeLoad=*/bUsesLdsTranspose);
}
if (loadBFromLDS) {
// When loading B, check if A uses transpose load
wrappedLDSBufferForLoadB = accelEmitterPtr->wrapLDSBufferForLoad(
b, loc, op.getMatrixB(), matrixParamsB, op.getBlockSize(), "n",
/*useLdsTransposeLoad=*/aUsesLdsTranspose);
}
Value wrappedLDSBufferForScaleA, wrappedLDSBufferForScaleB;
if (isScaledGemm) {
// Scaled GEMM (FP4) doesn't support LDS transpose load yet
if (loadAFromLDS) {
wrappedLDSBufferForScaleA = accelEmitterPtr->wrapLDSBufferForLoad(
b, loc, op.getScaleA(), matrixParamsA, op.getBlockSize(), "m",
/*useLdsTransposeLoad=*/false);
}
if (loadBFromLDS) {
wrappedLDSBufferForScaleB = accelEmitterPtr->wrapLDSBufferForLoad(
b, loc, op.getScaleB(), matrixParamsB, op.getBlockSize(), "n",
/*useLdsTransposeLoad=*/false);
}
}
auto loadBuffer =
[&](Value buffer, Value wrappedLDSBufferForLoad, Value loopVar,
Type argType, int64_t repeats, bool loadFromLDS, bool directToLDS,
bool isA, LDSTransposeConfigAttr transposeAttr = nullptr) -> Value {
Value inputBuffer = buffer;
SmallVector<int64_t> shape;
if (directToLDS) {
shape.push_back(kBasePerThread);
auto memrefType = cast<MemRefType>(buffer.getType());
assert(memrefType.getRank() == 1);
assert(memrefType.getElementType() == b.getI8Type());
int64_t numBytes = getPackedByteSize(kBasePerThread, argType);
if (memrefType.getShape()[0] > numBytes) {
assert(memrefType.getShape()[0] == numBytes * repeats);
shape.insert(shape.begin(), repeats);
} else {
assert(memrefType.getShape()[0] == numBytes);
}
// view for generateThreadwiseViewBuffer()
buffer = viewBufferAs(b, buffer, argType, shape);
}
if (loadFromLDS) {
Value viewForReadInto = buffer;
if (directToLDS) {
SmallVector<int64_t> shapeForLoad(shape);
if (auto vectorType = dyn_cast<VectorType>(argType)) {
assert(vectorType.hasRank() == 1 && "Expected rank 1");
shapeForLoad[shapeForLoad.size() - 1] =
vectorType.getDimSize(0) *
shapeForLoad[shapeForLoad.size() - 1];
}
viewForReadInto = viewBufferAs(
b, inputBuffer, getElementTypeOrSelf(argType), shapeForLoad);
}
assert(wrappedLDSBufferForLoad != Value{} &&
"Wrapped LDS buffer for load is empty");
// regs = read from LDS
ThreadwiseReadIntoOp::create(
b, loc, wrappedLDSBufferForLoad, viewForReadInto,
b.getArrayAttr({}), ValueRange{tid, loopVar}, /*forceUnroll=*/true,
/*useIndexDiffs=*/true,
/*ldsTransposeConfig=*/transposeAttr);
} else {
if (cast<ShapedType>(buffer.getType()).getRank() == 1) {
StringRef dk = isA ? "mk" : "nk";
StringRef indexStr = isA ? "iidx" : "jidx";
BottomUpTMBuilder regsBuilder(b, {dk}, {repeats * kBasePerThread},
loc);
regsBuilder.unmerge({indexStr, "k"}, {0, 1}, dk,
{repeats, kBasePerThread});
buffer =
rock::transform(b, buffer, b.getArrayAttr({regsBuilder.get()}));
}
buffer = rock::createSliceOfFirstDim(b, loc, buffer, loopVar);
}
return buffer;
};
auto mLoop = affine::AffineForOp::create(b, loc, 0, mRepeats);
{
OpBuilder::InsertionGuard guard(b);
b.setInsertionPointToStart(mLoop.getBody());
Value i = mLoop.getInductionVar();
Value bufferA = adaptor.getBufferA();
bufferA = loadBuffer(
bufferA, wrappedLDSBufferForLoadA, i, argTypeA, mRepeats,
loadAFromLDS, matrixParamsA.getDirectToLDS(), true, transposeAttrA);
Value viewA =
accelEmitterPtr->generateThreadwiseViewBufferA(b, loc, bufferA);
Value viewScaleA = nullptr, viewScaleB = nullptr;
if (isScaledGemm) {
if (matrixParamsA.getDirectToLDS()) {
op->emitOpError("Direct to LDS scaled GEMM is not supported yet.");
return failure();
}
Value bufferScaleA = adaptor.getBufferScaleA();
bufferScaleA =
loadBuffer(bufferScaleA, wrappedLDSBufferForScaleA, i,
getElementTypeOrSelf(scaleA), mRepeats, loadAFromLDS,
matrixParamsA.getDirectToLDS(), true, nullptr);
viewScaleA = accelEmitterPtr->generateThreadwiseViewBufferA(
b, loc, bufferScaleA);
}
auto nLoop = affine::AffineForOp::create(b, loc, 0, nRepeats);
{
OpBuilder::InsertionGuard guard(b);
b.setInsertionPointToStart(nLoop.getBody());
Value j = nLoop.getInductionVar();
Value bufferB = adaptor.getBufferB();
bufferB =
loadBuffer(bufferB, wrappedLDSBufferForLoadB, j, argTypeB, nRepeats,
loadBFromLDS, matrixParamsB.getDirectToLDS(), false,
transposeAttrB);
Value viewB =
accelEmitterPtr->generateThreadwiseViewBufferB(b, loc, bufferB);
if (isScaledGemm) {
if (matrixParamsB.getDirectToLDS()) {
op->emitOpError("Direct to LDS scaled GEMM is not supported yet.");
return failure();
}
Value bufferScaleB = adaptor.getBufferScaleB();
bufferScaleB =
loadBuffer(bufferScaleB, wrappedLDSBufferForScaleB, j,
getElementTypeOrSelf(scaleB), nRepeats, loadBFromLDS,
matrixParamsB.getDirectToLDS(), false, nullptr);
viewScaleB = accelEmitterPtr->generateThreadwiseViewBufferB(
b, loc, bufferScaleB);
}
// regsC += regsA * regsB
auto kLoop = affine::AffineForOp::create(b, loc, 0, kBasePerThread);
{
OpBuilder::InsertionGuard guard(b);
b.setInsertionPointToStart(kLoop.getBody());
Value viewC = accelEmitterPtr->generateThreadwiseViewBufferC(
b, loc, adaptor.getMatrixC());
Value k = kLoop.getInductionVar();
ThreadwiseGemmAccelOp::create(b, loc, viewA, viewB, viewC, viewScaleA,
viewScaleB, ValueRange{i, j, k},
op.getFeaturesAttr(), tuningParams);
}
}
}
b.eraseOp(op);
return success();
}
};
namespace {
struct ThreadwiseReadIntoRewritePattern
: public OpConversionPattern<ThreadwiseReadIntoOp> {
using OpConversionPattern<ThreadwiseReadIntoOp>::OpConversionPattern;
LogicalResult matchAndRewrite(ThreadwiseReadIntoOp op, OpAdaptor adaptor,
ConversionPatternRewriter &b) const final;
};
struct ThreadwiseWriteAllRewritePattern
: public OpConversionPattern<ThreadwiseWriteAllOp> {
using OpConversionPattern<ThreadwiseWriteAllOp>::OpConversionPattern;
LogicalResult matchAndRewrite(ThreadwiseWriteAllOp op, OpAdaptor adaptor,
ConversionPatternRewriter &b) const final;
};
} // end anonymous namespace
//===----------------------------------------------------------------------===//
// BlockwiseReduce lowering.
//===----------------------------------------------------------------------===//
struct BlockwiseReduceRewritePattern
: public OpConversionPattern<BlockwiseBroadcastReduceOp> {
using OpConversionPattern<BlockwiseBroadcastReduceOp>::OpConversionPattern;
int64_t calculateNonReductionDimProduct(ArrayRef<int64_t> toReduceShape,
int64_t axis) const {
int64_t dimProduct = 1;
for (size_t i = 0; i < toReduceShape.size(); i++) {
if (i != (size_t)axis) {
dimProduct *= toReduceShape[i];
}
}
return dimProduct;
}
// This function will make a 2d view from a multi-dimensional tensors
// where one axis needs to be reduced.
ArrayAttr createInput2DView(Location loc, PatternRewriter &rewriter,
ArrayAttr regTensorView, int64_t reduceAxis,
bool makeRDimZero = false) const {
TransformMapAttr lowestTr =
cast<TransformMapAttr>(regTensorView[regTensorView.size() - 1]);
ArrayRef<int64_t> lowestShape = lowestTr.getLowerBounds().asArrayRef();
TopDownTMBuilder tensorToLDSViewBuilder(rewriter, lowestShape, loc);
SmallVector<StringRef, 4> upperNameRefs;
tensorToLDSViewBuilder.getStartNames(upperNameRefs);
SmallVector<StringRef, 4> nonReduceNameRefs;
SmallVector<unsigned, 4> nonReduceDims;
SmallVector<int64_t, 4> nonReduceDimSizes;
for (auto [dim, dimSize] : llvm::enumerate(lowestShape)) {
if (dim != (size_t)reduceAxis) {
nonReduceNameRefs.push_back(upperNameRefs[dim]);
nonReduceDims.push_back(dim);
nonReduceDimSizes.push_back(dimSize);
}
}
tensorToLDSViewBuilder.unmerge("nrDim", 0, nonReduceNameRefs,
nonReduceDimSizes);
if (makeRDimZero) {
tensorToLDSViewBuilder.constDim("rDim", 1, 0, lowestShape[reduceAxis]);
} else {
tensorToLDSViewBuilder.passThrough({"rDim"}, {1},
{upperNameRefs[reduceAxis]});
}
TransformMapAttr twoDimLDSView = tensorToLDSViewBuilder.get();
return prependUpperViews(rewriter, regTensorView,
rewriter.getArrayAttr({twoDimLDSView}));
}
ArrayAttr create2DToFlatLDSView(Location loc, PatternRewriter &rewriter,
int64_t dim0, int64_t dim1) const {
TopDownTMBuilder toLDSViewBuilder(rewriter, {dim0, dim1}, loc);
SmallVector<StringRef, 4> upperNameRefs;
toLDSViewBuilder.getStartNames(upperNameRefs);
toLDSViewBuilder.unmerge("flatDim", 0, upperNameRefs, {dim0, dim1});
return rewriter.getArrayAttr({toLDSViewBuilder.get()});
}
// This function will append views to target a flat LDS buffer
// where non-reduction dims are laid contiguously as they are expected
// function on parallel.
ArrayAttr createLDSWorkspaceView(
Location loc, PatternRewriter &rewriter, ArrayAttr regTensorView,
int64_t reduceAxis, bool makeRDimZero = false,
std::optional<int64_t> rDimZeroLen = std::nullopt) const {
TransformMapAttr lowestTr =
cast<TransformMapAttr>(regTensorView[regTensorView.size() - 1]);
ArrayRef<int64_t> lowestShape = lowestTr.getLowerBounds().asArrayRef();
TopDownTMBuilder tensorToLDSViewBuilder(rewriter, lowestShape, loc);
SmallVector<StringRef, 4> upperNameRefs;
tensorToLDSViewBuilder.getStartNames(upperNameRefs);
int64_t rDimLen = rDimZeroLen.value_or(lowestShape[reduceAxis]);
int64_t nonReduceMergeDimSize = 1;
SmallVector<StringRef, 4> nonReduceNameRefs;
SmallVector<unsigned, 4> nonReduceDims;
SmallVector<int64_t, 4> nonReduceDimSizes;
for (auto [dim, dimSize] : llvm::enumerate(lowestShape)) {
if (dim != (size_t)reduceAxis) {
nonReduceMergeDimSize *= dimSize;
nonReduceNameRefs.push_back(upperNameRefs[dim]);
nonReduceDims.push_back(dim);
nonReduceDimSizes.push_back(dimSize);
}
}
tensorToLDSViewBuilder.unmerge("nrDim", 0, nonReduceNameRefs,
nonReduceDimSizes);
if (makeRDimZero) {
tensorToLDSViewBuilder.constDim("rDim", 1, 0, rDimLen);
} else {
tensorToLDSViewBuilder.passThrough({"rDim"}, {1},
{upperNameRefs[reduceAxis]});
}
TransformMapAttr twoDimLDSView = tensorToLDSViewBuilder.get();
TopDownTMBuilder flatLDSViewBuilder =
TopDownTMBuilder::below(tensorToLDSViewBuilder, twoDimLDSView);
flatLDSViewBuilder.unmerge("flatDim", 0, {"nrDim", "rDim"},
{nonReduceMergeDimSize, rDimLen});
TransformMapAttr flatLDSView = flatLDSViewBuilder.get();
SmallVector<Attribute> threadsToLDSViewAttrs;
for (Attribute trMap : regTensorView) {
threadsToLDSViewAttrs.push_back(trMap);
}
threadsToLDSViewAttrs.push_back(twoDimLDSView);
threadsToLDSViewAttrs.push_back(flatLDSView);
return rewriter.getArrayAttr(threadsToLDSViewAttrs);
}
// This should only be used if product non-reduction dims is
// equal or larger than number threads in a block.
//
// Given a input tensor : D0, ... , Dr , ... , DN to reduce,
// This function creates a view that maps the space of
// [D0, ... , Dr , ... , DN] --> [tid, nrIter, rIter] where
// tid is threads within the block, nrIter is non-reducing
// iterations within a thread and rIter is reducing iterations
// within a thread.
ArrayAttr createThreadViewForNRLargerThanThreads(
Location loc, ArrayRef<int64_t> toReduceShape, int64_t blockSize,
int64_t reduceAxis, PatternRewriter &rewriter) const {
BottomUpTMBuilder threadsToTensor(rewriter, toReduceShape, loc);
SmallVector<StringRef, 4> lowerNameRefs;
threadsToTensor.getStartNames(lowerNameRefs);
int64_t nonReduceMergeDimSize = 1;
SmallVector<StringRef, 4> nonReduceNameRefs;
for (auto dimAndSize : llvm::enumerate(toReduceShape)) {
int64_t dim = dimAndSize.index();
int64_t dimSize = dimAndSize.value();
if (dim != reduceAxis) {
nonReduceMergeDimSize *= dimSize;
nonReduceNameRefs.push_back(lowerNameRefs[dim]);
}
}
threadsToTensor.merge("nrDim", 0, nonReduceNameRefs);
threadsToTensor.passThrough({"rIter"}, {1}, {lowerNameRefs[reduceAxis]});
TransformMapAttr mergeTrMap = threadsToTensor.get();
threadsToTensor = BottomUpTMBuilder::above(threadsToTensor, mergeTrMap);
int64_t nrThreads = (nonReduceMergeDimSize + (blockSize - 1)) / blockSize;
threadsToTensor.pad({"nrDim"},
{0, blockSize * nrThreads - nonReduceMergeDimSize});
threadsToTensor.passThrough({"rIter"}, {1}, {"rIter"});
TransformMapAttr padTrMap = threadsToTensor.get();
threadsToTensor = BottomUpTMBuilder::above(threadsToTensor, padTrMap);
threadsToTensor.unmerge({"tid", "nrIter"}, {0, 1}, "nrDim",
{blockSize, nrThreads});
threadsToTensor.passThrough({"rIter"}, {2}, {"rIter"});
TransformMapAttr unmergeTrMap = threadsToTensor.get();
return rewriter.getArrayAttr({unmergeTrMap, padTrMap, mergeTrMap});
}
// This should only be used if product non-reduction dims is
// less than number threads in a block.
//
// Given a input tensor : D0, ... , Dr , ... , DN to reduce,
// This function creates a view that maps the space of
// [D0, ... , Dr , ... , DN] --> [nrtid, rtid, rIter] where
// nrtid = tid / product(non-reduction dims) is a reduction subgroup leader.
// rtid = tid % product(non-reduction dims) is thread idx within a reduction
// subgroup. Size of the dimension 'rtid' is the number of threads
// that'd participate in the reduction
ArrayAttr createThreadViewforNRSmallerThanThreads(
Location loc, ArrayRef<int64_t> toReduceShape, int64_t blockSize,
size_t reduceAxis, PatternRewriter &rewriter) const {
BottomUpTMBuilder threadsToTensor(rewriter, toReduceShape, loc);
SmallVector<StringRef, 4> lowerNameRefs;
threadsToTensor.getStartNames(lowerNameRefs);
int64_t nonReduceMergeDimSize = 1;
SmallVector<StringRef, 4> nonReduceNameRefs;
for (auto [dim, dimSize] : llvm::enumerate(toReduceShape)) {
if (dim != reduceAxis) {
nonReduceMergeDimSize *= dimSize;
nonReduceNameRefs.push_back(lowerNameRefs[dim]);
}
}
threadsToTensor.merge("nrDim", 0, nonReduceNameRefs);
threadsToTensor.passThrough({"rDim"}, {1}, {lowerNameRefs[reduceAxis]});
TransformMapAttr mergeTrMap = threadsToTensor.get();
threadsToTensor = BottomUpTMBuilder::above(threadsToTensor, mergeTrMap);
// If this function is being called, then the number of threads is larger
// than the product of non reduction dimensions. Therefore, we create thread
// groups (rthreads) per a point in merge(non reduction dimensions).
int64_t rthreads = blockSize / nonReduceMergeDimSize;
// Find the largest rthreads that evenly divides rDimSize to avoid LDS
// aliasing: when rthreads * ceil(rDimSize/rthreads) > rDimSize, padded
// positions alias into adjacent rows in the flat LDS layout.
while (rthreads > 1 && toReduceShape[reduceAxis] % rthreads != 0) {
rthreads--;
}
int64_t rDimPerRThread =
(toReduceShape[reduceAxis] + (rthreads - 1)) / rthreads;
threadsToTensor.pad(
{"rDim"}, {0, rthreads * rDimPerRThread - toReduceShape[reduceAxis]});
threadsToTensor.passThrough({"nrDim"}, {0}, {"nrDim"});
TransformMapAttr padTrMap = threadsToTensor.get();
threadsToTensor = BottomUpTMBuilder::above(threadsToTensor, padTrMap);
threadsToTensor.unmerge({"rtid", "rIter"}, {1, 2}, "rDim",
{rthreads, rDimPerRThread});
threadsToTensor.passThrough({"nrtid"}, {0}, {"nrDim"});
TransformMapAttr unmergeTrMap = threadsToTensor.get();
return rewriter.getArrayAttr({unmergeTrMap, padTrMap, mergeTrMap});
}
Value getReductionInitValue(BlockwiseBroadcastReduceOp op,
ConversionPatternRewriter &rewriter) const {
ReduceMethod rMethod = op.getReduceMethod();
Type elementType = op.getInput().getType().getElementType();
if (elementType.isIntOrIndex()) {
if (rMethod == ReduceMethod::Sum) {
return createConstantIntOp(rewriter, op.getLoc(), elementType,
elementType, 0);
} else {
// Op verifier gurantees this.
assert(rMethod == ReduceMethod::Max);
unsigned bitWidth = elementType.getIntOrFloatBitWidth();
int64_t signedMin = APInt::getSignedMinValue(bitWidth).getSExtValue();
return createConstantIntOp(rewriter, op.getLoc(), elementType,
elementType, signedMin);
}
} else {
if (rMethod == ReduceMethod::Sum) {
// Use -0.0 (negative zero) instead of +0.0. In IEEE 754, -0.0 is the
// true additive identity: fadd(-0.0, x) = x for ALL x (including -0.0
// and NaN). LLVM can fold `fadd -0.0, x → x`, eliminating the
// redundant `v_add_f32 v, 0, v` that +0.0 generates via
// llvm.vector.reduce.fadd.
return createConstantFloatOp(rewriter, op.getLoc(), elementType,
elementType, -0.0f);
} else {
// Op verifier gurantees this.
assert(rMethod == ReduceMethod::Max);
return createConstantFloatOp(rewriter, op.getLoc(), elementType,
elementType,
-std::numeric_limits<float>::infinity());
}
}
}
Value createReducingOp(BlockwiseBroadcastReduceOp op, Value input, Value acc,
OpBuilder &builder) const {
ReduceMethod rMethod = op.getReduceMethod();
Location loc = op.getLoc();
// Value loadAcc = InBoundsLoadOp::create(rewriter, loc, input.getType(),
// acc, zeroConstantOp);
Type elementType = op.getInput().getType().getElementType();
if (!isa<VectorType>(acc.getType()) && isa<VectorType>(input.getType())) {
// This means accumulator is a scalar type and input is a vector type,
// therefore its a elementwise reduction between two operands.
vector::CombiningKind kind;
if (rMethod == ReduceMethod::Sum) {
kind = vector::CombiningKind::ADD;
} else {
// Op verifier gurantees this.
assert(rMethod == ReduceMethod::Max);
if (elementType.isIntOrIndex()) {
kind = vector::CombiningKind::MAXSI;
} else {
kind = vector::CombiningKind::MAXNUMF;
}
}
return vector::ReductionOp::create(builder, loc, kind, input, acc);
}
if (rMethod == ReduceMethod::Sum) {
Value reduced;
if (elementType.isIntOrIndex()) {
reduced = arith::AddIOp::create(builder, loc, acc, input);
} else {
reduced = arith::AddFOp::create(builder, loc, acc, input);
}
return reduced;
} else {
assert(rMethod == ReduceMethod::Max);
Value reduced;
if (elementType.isIntOrIndex()) {
reduced = arith::MaxSIOp::create(builder, loc, acc, input);
} else {
// Use MaxNumFOp (not MaximumFOp) so that NaN does not propagate
// through the max reduction.
reduced = arith::MaxNumFOp::create(builder, loc, acc, input);
}
return reduced;
}
}
ArrayAttr createReducedView(PatternRewriter &rewriter, Location loc,
ArrayAttr subTileView, int64_t axis) const {
ArrayRef<int64_t> threadSubTileShape = getLowerShape(subTileView);
TopDownTMBuilder viewBuilder(rewriter, threadSubTileShape, loc);