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
|
//===- LinalgTransformOps.cpp - Implementation of Linalg match ops --------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "mlir/Dialect/Linalg/TransformOps/LinalgMatchOps.h"
#include "mlir/Analysis/SliceAnalysis.h"
#include "mlir/Dialect/Linalg/IR/Linalg.h"
#include "mlir/Dialect/Transform/IR/MatchInterfaces.h"
#include "mlir/IR/BuiltinAttributes.h"
#include "mlir/IR/FunctionImplementation.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/FormatVariadic.h"
using namespace mlir;
#define DEBUG_TYPE "linalg-transforms"
#define DBGS() (llvm::dbgs() << "[" DEBUG_TYPE "]: ")
//===----------------------------------------------------------------------===//
// StructuredMatchOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
// First, check if the payload operation is a structured Linalg operation.
if (!isa<linalg::LinalgOp>(current)) {
if (getFailurePropagationMode().value_or(
FailurePropagationMode::Propagate) ==
FailurePropagationMode::Propagate) {
return emitSilenceableError() << "expected a Linalg op";
}
// If errors are suppressed, succeed and set all results to empty lists.
LLVM_DEBUG(DBGS() << "optional nested matcher expected a Linalg op");
results.setRemainingToEmpty(cast<TransformOpInterface>(getOperation()));
return DiagnosedSilenceableFailure::success();
}
// Bind `current` to the block argument.
auto scope = state.make_region_scope(getBodyRegion());
if (failed(state.mapBlockArgument(getBody()->getArgument(0),
MappedValue(current)))) {
return DiagnosedSilenceableFailure::definiteFailure();
}
for (Operation &nested : getBody()->without_terminator()) {
DiagnosedSilenceableFailure diag =
state.applyTransform(cast<TransformOpInterface>(nested));
if (diag.isDefiniteFailure())
return diag;
if (diag.succeeded())
continue;
// If propagating errors, do this immediately.
assert(diag.isSilenceableFailure());
if (getFailurePropagationMode().value_or(
FailurePropagationMode::Propagate) ==
FailurePropagationMode::Propagate) {
return diag;
}
// If suppressing errors, print the message into the debug stream before
// silencing it. Then set all results value that are already known.
// Results come from the terminator operands, which may be defined in the
// (single) block of this operation or above it. When they are defined
// above, they are known to be mapped at this point per SSA dominance.
// When they are defined in this block, we additionally check if we have
// already applied the operation that defines them. If not, the
// corresponding results will be set to empty lists.
LLVM_DEBUG(DBGS() << "optional nested matcher failed: " << diag.getMessage()
<< "\n");
(void)diag.silence();
SmallVector<OpOperand *> undefinedOperands;
for (OpOperand &terminatorOperand :
getBody()->getTerminator()->getOpOperands()) {
Operation *definingOp = terminatorOperand.get().getDefiningOp();
if (!definingOp)
continue;
if (definingOp->getBlock() != getBody())
continue;
if (definingOp->isBeforeInBlock(&nested))
continue;
undefinedOperands.push_back(&terminatorOperand);
}
SmallVector<SmallVector<transform::MappedValue>> mappings;
auto filtered = llvm::make_filter_range(
getBody()->getTerminator()->getOpOperands(), [&](OpOperand &opOperand) {
return !llvm::is_contained(undefinedOperands, &opOperand);
});
SmallVector<Value> definedOperands = llvm::to_vector(llvm::map_range(
filtered, [](OpOperand &opOperand) { return opOperand.get(); }));
detail::prepareValueMappings(mappings, definedOperands, state);
for (auto &&[operand, mapping] : llvm::zip_equal(filtered, mappings)) {
results.setMappedValues(getResults()[operand.getOperandNumber()],
mapping);
}
results.setRemainingToEmpty(cast<TransformOpInterface>(getOperation()));
return DiagnosedSilenceableFailure::success();
}
// Set the results.
detail::forwardTerminatorOperands(getBody(), state, results);
return DiagnosedSilenceableFailure::success();
}
void transform::MatchStructuredOp::getEffects(
SmallVectorImpl<MemoryEffects::EffectInstance> &effects) {
onlyReadsHandle(getCurrent(), effects);
onlyReadsPayload(effects);
producesHandle(getOutputs(), effects);
}
LogicalResult transform::MatchStructuredOp::verify() {
if (getBody()->getNumArguments() != 1)
return emitOpError() << "expected one body argument";
if (!isa<TransformHandleTypeInterface>(getBody()->getArgument(0).getType())) {
return emitOpError() << "expected body argument to implement "
"TransformHandleTypeInterface";
}
for (Operation &nested : getBody()->without_terminator()) {
if (isa<MatchOpInterface>(nested))
continue;
InFlightDiagnostic diag =
emitOpError()
<< "expects nested operations to implement MatchOpInterface";
diag.attachNote(nested.getLoc()) << "offending operation";
return diag;
}
return success();
}
//===----------------------------------------------------------------------===//
// StructuredOpPredicateOpTrait
//===----------------------------------------------------------------------===//
LogicalResult transform::detail::verifyStructuredOpPredicateOpTrait(
Operation *op, Value structuredOpHandle) {
if (!isa_and_nonnull<MatchStructuredOp>(op->getParentOp())) {
return op->emitOpError() << "expects parent op to be '"
<< MatchStructuredOp::getOperationName() << "'";
}
// Bail out here, let the verifier of the parent complain.
Operation *parent = op->getParentOp();
if (parent->getNumRegions() < 1 || parent->getRegion(0).empty() ||
parent->getRegion(0).front().getNumArguments() < 1)
return success();
if (structuredOpHandle != parent->getRegion(0).front().getArgument(0)) {
return op->emitOpError()
<< "expected predicate to apply to the surrounding structured op";
}
return success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredBodyOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredBodyOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
if (std::optional<uint64_t> position = getReductionPosition()) {
SmallVector<Operation *> combinerOps;
if (!matchReduction(linalgOp.getRegionOutputArgs(), *position,
combinerOps)) {
return emitSilenceableError() << "could not match reduction";
}
if (combinerOps.size() != 1) {
return emitSilenceableError() << "reduction combiner is not a single op";
}
return DiagnosedSilenceableFailure::success();
}
if (getPassthrough()) {
Block &body = linalgOp->getRegion(0).front();
if (body.getTerminator()->getOperands() != linalgOp.getRegionInputArgs()) {
return emitSilenceableError() << "not a passthrough";
}
return DiagnosedSilenceableFailure::success();
}
return emitDefiniteFailure() << "unknown body condition";
}
LogicalResult transform::MatchStructuredBodyOp::verify() {
if (getReductionPosition() && getPassthrough()) {
return emitOpError() << "reduction position and passthrough conditions are "
"mutually exclusive";
}
return success();
}
//===----------------------------------------------------------------------===//
// Utilities for structured match predicates.
//===----------------------------------------------------------------------===//
/// Checks if all values from `list` are also contained in `reference`. Returns
/// a silenceable error with the given message at the given location when it is
/// not the case. The error message must contain the "{0}" placeholder that
/// will be substituted with the value from `list` that is not contained in
/// `reference`.
static DiagnosedSilenceableFailure containsAll(ArrayRef<unsigned> reference,
ArrayRef<int64_t> list,
Location loc,
const char *message) {
for (int64_t value : list) {
if (llvm::any_of(reference, [&](unsigned ref) {
return static_cast<int64_t>(ref) == value;
})) {
continue;
}
return emitSilenceableFailure(loc) << llvm::formatv(message, value);
}
return DiagnosedSilenceableFailure::success();
}
/// Populates `result` with the positional identifiers relative to `maxNumber`.
/// If `isAll` is set, the result will contain all numbers from `0` to
/// `maxNumber - 1` inclusive regardless of `rawList`. Otherwise, negative
/// values from `rawList` are are interpreted as counting backwards from
/// `maxNumber`, i.e., `-1` is interpreted a `maxNumber - 1`, while positive
/// numbers remain as is. If `isInverted` is set, populates `result` with those
/// values from the `0` to `maxNumber - 1` inclusive range that don't appear in
/// `rawList`. If `rawList` contains values that are greater than or equal to
/// `maxNumber` or less than `-maxNumber`, produces a silenceable error at the
/// given location. `maxNumber` must be positive. If `rawList` contains
/// duplicate numbers or numbers that become duplicate after negative value
/// remapping, emits a silenceable error.
static DiagnosedSilenceableFailure
expandTargetSpecification(Location loc, bool isAll, bool isInverted,
ArrayRef<int64_t> rawList, int64_t maxNumber,
SmallVectorImpl<int64_t> &result) {
assert(maxNumber > 0 && "expected size to be positive");
assert(!(isAll && isInverted) && "cannot invert all");
if (isAll) {
result = llvm::to_vector(llvm::seq<int64_t>(0, maxNumber));
return DiagnosedSilenceableFailure::success();
}
SmallVector<int64_t> expanded;
llvm::SmallDenseSet<int64_t> visited;
expanded.reserve(rawList.size());
SmallVectorImpl<int64_t> &target = isInverted ? expanded : result;
for (int64_t raw : rawList) {
int64_t updated = raw < 0 ? maxNumber + raw : raw;
if (updated >= maxNumber) {
return emitSilenceableFailure(loc)
<< "position overflow " << updated << " (updated from " << raw
<< ") for maximum " << maxNumber;
}
if (updated < 0) {
return emitSilenceableFailure(loc) << "position underflow " << updated
<< " (updated from " << raw << ")";
}
if (!visited.insert(updated).second) {
return emitSilenceableFailure(loc) << "repeated position " << updated
<< " (updated from " << raw << ")";
}
target.push_back(updated);
}
if (!isInverted)
return DiagnosedSilenceableFailure::success();
result.reserve(result.size() + (maxNumber - expanded.size()));
for (int64_t candidate : llvm::seq<int64_t>(0, maxNumber)) {
if (llvm::is_contained(expanded, candidate))
continue;
result.push_back(candidate);
}
return DiagnosedSilenceableFailure::success();
}
/// Checks if the positional specification defined is valid and reports errors
/// otherwise.
LogicalResult verifyStructuredTransformDimsOp(Operation *op,
ArrayRef<int64_t> raw,
bool inverted, bool all) {
if (all) {
if (inverted) {
return op->emitOpError()
<< "cannot request both 'all' and 'inverted' values in the list";
}
if (!raw.empty()) {
return op->emitOpError()
<< "cannot both request 'all' and specific values in the list";
}
}
if (!all && raw.empty()) {
return op->emitOpError() << "must request specific values in the list if "
"'all' is not specified";
}
SmallVector<int64_t> rawVector = llvm::to_vector(raw);
auto *it = std::unique(rawVector.begin(), rawVector.end());
if (it != rawVector.end())
return op->emitOpError() << "expected the listed values to be unique";
return success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredDimOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredDimOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
SmallVector<int64_t> dimensions;
DiagnosedSilenceableFailure diag = getDimensionsFor(linalgOp, dimensions);
if (!diag.succeeded())
return diag;
// If asked to check for the kind of dimension, perform the check.
if (getParallel() || getReduction()) {
SmallVector<unsigned> reference;
if (getParallel())
linalgOp.getParallelDims(reference);
else if (getReduction())
linalgOp.getReductionDims(reference);
DiagnosedSilenceableFailure diag =
containsAll(reference, dimensions, getLoc(),
getParallel() ? "expects dimension #{0} to be parallel"
: "expects dimension #{0} to be reduction");
if (!diag.succeeded())
return diag;
}
// If not capturing, we are done here.
if (!getResult())
return diag;
SmallVector<int64_t, 4> ranges = linalgOp.getStaticLoopRanges();
Builder builder(current);
SmallVector<Attribute> captured = llvm::to_vector(
llvm::map_range(dimensions, [&](int64_t dim) -> Attribute {
return builder.getI64IntegerAttr(ranges[dim]);
}));
results.setParams(cast<OpResult>(getResult()), captured);
return DiagnosedSilenceableFailure::success();
}
DiagnosedSilenceableFailure transform::MatchStructuredDimOp::getDimensionsFor(
linalg::LinalgOp op, SmallVectorImpl<int64_t> &dims) {
DiagnosedSilenceableFailure diag =
expandTargetSpecification(getLoc(), getIsAll(), getIsInverted(),
getRawDimList(), op.getNumLoops(), dims);
if (diag.isSilenceableFailure()) {
diag.attachNote(op->getLoc())
<< "while considering dimensions of this payload operation";
}
return diag;
}
LogicalResult transform::MatchStructuredDimOp::verify() {
if (getParallel() && getReduction()) {
return emitOpError() << "cannot request the same dimension to be both "
"parallel and reduction";
}
return verifyStructuredTransformDimsOp(getOperation(), getRawDimList(),
getIsInverted(), getIsAll());
}
//===----------------------------------------------------------------------===//
// MatchStructuredElementalBitwidthOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure
transform::MatchStructuredElementalBitwidthOp::matchValue(
Value current, transform::TransformResults &results,
transform::TransformState &state) {
auto setupResult = [&](int64_t bitwidth) {
Attribute attr = Builder(current.getContext()).getI64IntegerAttr(bitwidth);
results.setParams(cast<OpResult>(getResult()), {attr});
return DiagnosedSilenceableFailure::success();
};
Type type = current.getType();
if (type.isIntOrFloat())
return setupResult(type.getIntOrFloatBitWidth());
if (auto shapedType = dyn_cast<ShapedType>(type)) {
if (shapedType.getElementType().isIntOrFloat())
return setupResult(shapedType.getElementTypeBitWidth());
}
return emitSilenceableError()
<< "unsupported type for bitwidth extraction: " << type;
}
//===----------------------------------------------------------------------===//
// MatchStructuredInputOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredInputOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
SmallVector<int64_t> positions;
DiagnosedSilenceableFailure diag = getPositionsFor(linalgOp, positions);
if (!diag.succeeded())
return diag;
SmallVector<MappedValue> operandMapping;
operandMapping.reserve(positions.size());
for (int64_t position : positions) {
AffineMap indexingMap =
linalgOp.getMatchingIndexingMap(linalgOp.getDpsInputOperand(position));
if (getPermutation() && !indexingMap.isPermutation()) {
return emitSilenceableError() << "the indexing map for input #"
<< position << " is not a permutation";
}
if (getProjectedPermutation() && !indexingMap.isProjectedPermutation()) {
return emitSilenceableError()
<< "the indexing map for input #" << position
<< " is not a projected permutation";
}
// If capture not requested, skip it.
if (!getResult())
continue;
Value operand = linalgOp.getDpsInputOperand(position)->get();
if (isa<TransformValueHandleTypeInterface>(getResult().getType())) {
operandMapping.emplace_back(operand);
continue;
}
Operation *operandProducer = operand.getDefiningOp();
if (!operandProducer) {
return emitSilenceableError()
<< "input #" << position << " is not produced by an operation";
}
operandMapping.emplace_back(operandProducer);
}
if (getResult())
results.setMappedValues(cast<OpResult>(getResult()), operandMapping);
return DiagnosedSilenceableFailure::success();
}
DiagnosedSilenceableFailure transform::MatchStructuredInputOp::getPositionsFor(
linalg::LinalgOp op, SmallVectorImpl<int64_t> &positions) {
DiagnosedSilenceableFailure diag = expandTargetSpecification(
getLoc(), getIsAll(), getIsInverted(), getRawPositionList(),
op.getNumDpsInputs(), positions);
if (diag.isSilenceableFailure()) {
diag.attachNote(op->getLoc())
<< "while considering DPS inputs of this payload operation";
}
return diag;
}
/// Verifies a matcher op for structured input or output, specifically the
/// attributes specifying the operand positions.
template <typename OpTy>
LogicalResult verifyStructuredOperandOp(OpTy op) {
if (op.getPermutation() && op.getProjectedPermutation()) {
return op.emitOpError()
<< op.getPermutationAttrName() << " and "
<< op.getProjectedPermutationAttrName() << " are mutually exclusive";
}
if (op.getRawPositionList().size() > 1 && op.getResult()) {
return op.emitOpError()
<< "cannot bind multiple inputs/inits to the same value";
}
return success();
}
LogicalResult transform::MatchStructuredInputOp::verify() {
if (failed(verifyStructuredOperandOp(*this)))
return failure();
return verifyStructuredTransformDimsOp(getOperation(), getRawPositionList(),
getIsInverted(), getIsAll());
}
//===----------------------------------------------------------------------===//
// MatchStructuredInitOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredInitOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
SmallVector<int64_t> positions;
DiagnosedSilenceableFailure diag = getPositionsFor(linalgOp, positions);
if (!diag.succeeded())
return diag;
SmallVector<MappedValue> operandMapping;
operandMapping.reserve(positions.size());
for (int64_t position : positions) {
AffineMap indexingMap =
linalgOp.getMatchingIndexingMap(linalgOp.getDpsInitOperand(position));
if (getPermutation() && !indexingMap.isPermutation()) {
return emitSilenceableError() << "the indexing map for output(init) #"
<< position << " is not a permutation";
}
if (getProjectedPermutation() && !indexingMap.isProjectedPermutation()) {
return emitSilenceableError() << "the indexing map for output(init) #"
<< position << " is not a permutation";
}
// If capture not requested, skip it.
if (!getResult())
continue;
Value operand = linalgOp.getDpsInitOperand(position)->get();
if (isa<TransformValueHandleTypeInterface>(getResult().getType())) {
operandMapping.emplace_back(operand);
continue;
}
Operation *operandProducer = operand.getDefiningOp();
if (!operandProducer) {
return emitSilenceableError() << "output(init) #" << position
<< " is not produced by an operation";
}
operandMapping.emplace_back(operandProducer);
}
if (getResult())
results.setMappedValues(cast<OpResult>(getResult()), operandMapping);
return DiagnosedSilenceableFailure::success();
}
DiagnosedSilenceableFailure transform::MatchStructuredInitOp::getPositionsFor(
linalg::LinalgOp op, SmallVectorImpl<int64_t> &positions) {
DiagnosedSilenceableFailure diag = expandTargetSpecification(
getLoc(), getIsAll(), getIsInverted(), getRawPositionList(),
op.getNumDpsInits(), positions);
if (diag.isSilenceableFailure()) {
diag.attachNote(op->getLoc())
<< "while considering DPS inits (outputs) of this payload operation";
}
return diag;
}
LogicalResult transform::MatchStructuredInitOp::verify() {
if (failed(verifyStructuredOperandOp(*this)))
return failure();
return verifyStructuredTransformDimsOp(getOperation(), getRawPositionList(),
getIsInverted(), getIsAll());
}
//===----------------------------------------------------------------------===//
// MatchStructuredNumInputsOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure
transform::MatchStructuredNumInputsOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
Attribute attr =
Builder(current).getI64IntegerAttr(linalgOp.getNumDpsInputs());
results.setParams(cast<OpResult>(getResult()), {attr});
return DiagnosedSilenceableFailure::success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredNumInitsOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure
transform::MatchStructuredNumInitsOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
Attribute attr =
Builder(current).getI64IntegerAttr(linalgOp.getNumDpsInits());
results.setParams(cast<OpResult>(getResult()), {attr});
return DiagnosedSilenceableFailure::success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredRankOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredRankOp::matchOperation(
Operation *current, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(current);
int64_t numLoops = linalgOp.getNumLoops();
Attribute attr = Builder(linalgOp->getContext()).getI64IntegerAttr(numLoops);
results.setParams(cast<OpResult>(getRank()), {attr});
return DiagnosedSilenceableFailure::success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredResultOp
//===----------------------------------------------------------------------===//
DiagnosedSilenceableFailure transform::MatchStructuredResultOp::matchOperation(
Operation *op, transform::TransformResults &results,
transform::TransformState &state) {
auto linalgOp = cast<linalg::LinalgOp>(op);
int64_t position;
DiagnosedSilenceableFailure diag = getPositionFor(linalgOp, position);
if (!diag.succeeded())
return diag;
Value result = linalgOp.getTiedOpResult(linalgOp.getDpsInitOperand(position));
if (getResult().getType().isa<TransformValueHandleTypeInterface>()) {
results.setValues(cast<OpResult>(getResult()), result);
return DiagnosedSilenceableFailure::success();
}
if (result.getUsers().empty()) {
return emitSilenceableError()
<< "no users of the result #" << getPosition();
}
Operation *firstUser = *result.getUsers().begin();
if (getAny()) {
results.set(cast<OpResult>(getResult()), firstUser);
return DiagnosedSilenceableFailure::success();
}
if (getSingle()) {
if (!llvm::hasSingleElement(result.getUsers())) {
return emitSilenceableError()
<< "more than one result user with single user requested";
}
results.set(cast<OpResult>(getResult()), firstUser);
return DiagnosedSilenceableFailure::success();
}
return emitDefiniteFailure() << "unknown sub-predicate";
}
DiagnosedSilenceableFailure
transform::MatchStructuredResultOp::getPositionFor(linalg::LinalgOp op,
int64_t &position) {
auto rawPosition = static_cast<int64_t>(getPosition());
position = rawPosition < 0 ? op.getNumDpsInits() + rawPosition : rawPosition;
if (position >= op.getNumDpsInits() || position < 0) {
return emitSilenceableError()
<< "position " << rawPosition
<< " overflows the number of results(ints) of the payload operation";
}
return DiagnosedSilenceableFailure::success();
}
LogicalResult transform::MatchStructuredResultOp::verify() {
if ((getAny() || getSingle()) ^
getResult().getType().isa<TransformHandleTypeInterface>()) {
return emitOpError() << "expects either the any/single keyword or the type "
"value handle result type";
}
if (getAny() && getSingle()) {
return emitOpError() << "'any' and 'single' are mutually exclusive";
}
return success();
}
//===----------------------------------------------------------------------===//
// MatchStructuredYieldOp
//===----------------------------------------------------------------------===//
void transform::MatchStructuredYieldOp::getEffects(
SmallVectorImpl<MemoryEffects::EffectInstance> &effects) {
onlyReadsHandle(getHandles(), effects);
onlyReadsPayload(effects);
}
void transform::MatchStructuredYieldOp::build(OpBuilder &builder,
OperationState &state) {
build(builder, state, ValueRange());
}
//===----------------------------------------------------------------------===//
// Printing and parsing for structured match ops.
//===----------------------------------------------------------------------===//
/// Keyword syntax for positional specification inversion.
constexpr const static llvm::StringLiteral kDimExceptKeyword = "except";
/// Keyword syntax for full inclusion in positional specification.
constexpr const static llvm::StringLiteral kDimAllKeyword = "all";
/// Parses a positional specification for structured transform operations. The
/// following forms are accepted:
///
/// - `all`: sets `isAll` and returns;
/// - comma-separated-integer-list: populates `rawDimList` with the values;
/// - `except` `(` comma-separated-integer-list `)`: populates `rawDimList`
/// with the values and sets `isInverted`.
static ParseResult parseStructuredTransformDims(OpAsmParser &parser,
DenseI64ArrayAttr &rawDimList,
UnitAttr &isInverted,
UnitAttr &isAll) {
Builder &builder = parser.getBuilder();
if (parser.parseOptionalKeyword(kDimAllKeyword).succeeded()) {
rawDimList = builder.getDenseI64ArrayAttr({});
isInverted = nullptr;
isAll = builder.getUnitAttr();
return success();
}
isAll = nullptr;
isInverted = nullptr;
if (parser.parseOptionalKeyword(kDimExceptKeyword).succeeded()) {
isInverted = builder.getUnitAttr();
}
if (isInverted) {
if (parser.parseLParen().failed())
return failure();
}
SmallVector<int64_t> values;
ParseResult listResult = parser.parseCommaSeparatedList(
[&]() { return parser.parseInteger(values.emplace_back()); });
if (listResult.failed())
return failure();
rawDimList = builder.getDenseI64ArrayAttr(values);
if (isInverted) {
if (parser.parseRParen().failed())
return failure();
}
return success();
}
/// Prints a positional specification for structured transform operations.
static void printStructuredTransformDims(OpAsmPrinter &printer, Operation *op,
DenseI64ArrayAttr rawDimList,
UnitAttr isInverted, UnitAttr isAll) {
if (isAll) {
printer << kDimAllKeyword;
return;
}
if (isInverted) {
printer << kDimExceptKeyword << "(";
}
llvm::interleaveComma(rawDimList.asArrayRef(), printer.getStream(),
[&](int64_t value) { printer << value; });
if (isInverted) {
printer << ")";
}
}
/// Parses a single non-function type or a function type with at least one
/// argument. This allows for the following syntax:
///
/// - type: just the argument type;
/// - `(` type `)` `->` type: one argument and one result type;
/// - `(` type `)` `->` `(` comma-separated-type-list `)`: one argument and
/// multiple result types.
///
/// Unlike FunctionType, this allows and requires one to omit the parens around
/// the argument type in absence of result types, and does not accept the
/// trailing `-> ()` construct, which makes the syntax nicer for operations.
static ParseResult parseSemiFunctionType(OpAsmParser &parser,
Type &argumentType, Type &resultType) {
argumentType = resultType = nullptr;
bool hasLParen = parser.parseOptionalLParen().succeeded();
if (parser.parseType(argumentType).failed())
return failure();
if (!hasLParen)
return success();
return failure(parser.parseRParen().failed() ||
parser.parseArrow().failed() ||
parser.parseType(resultType).failed());
}
static ParseResult parseSemiFunctionType(OpAsmParser &parser,
Type &argumentType,
SmallVectorImpl<Type> &resultTypes) {
argumentType = nullptr;
bool hasLParen = parser.parseOptionalLParen().succeeded();
if (parser.parseType(argumentType).failed())
return failure();
if (!hasLParen)
return success();
if (parser.parseRParen().failed() || parser.parseArrow().failed())
return failure();
if (parser.parseOptionalLParen().failed()) {
Type type;
if (parser.parseType(type).failed())
return failure();
resultTypes.push_back(type);
return success();
}
if (parser.parseTypeList(resultTypes).failed() ||
parser.parseRParen().failed()) {
resultTypes.clear();
return failure();
}
return success();
}
/// Prints argument and result types in a syntax similar to that of FunctionType
/// but allowing and requiring one to omit the parens around the argument type
/// in absence of result types, and without the trailing `-> ()`.
static void printSemiFunctionType(OpAsmPrinter &printer, Operation *op,
Type argumentType, TypeRange resultType) {
if (!resultType.empty())
printer << "(";
printer << argumentType;
if (resultType.empty())
return;
printer << ") -> ";
if (resultType.size() > 1)
printer << "(";
llvm::interleaveComma(resultType, printer.getStream());
if (resultType.size() > 1)
printer << ")";
}
static void printSemiFunctionType(OpAsmPrinter &printer, Operation *op,
Type argumentType, Type resultType) {
return printSemiFunctionType(printer, op, argumentType,
resultType ? TypeRange(resultType)
: TypeRange());
}
#define GET_OP_CLASSES
#include "mlir/Dialect/Linalg/TransformOps/LinalgMatchOps.cpp.inc"
|