-
Notifications
You must be signed in to change notification settings - Fork 13.3k
/
Copy pathVectorEmulateMaskedLoadStore.cpp
161 lines (140 loc) · 5.41 KB
/
VectorEmulateMaskedLoadStore.cpp
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
//=- VectorEmulateMaskedLoadStore.cpp - Emulate 'vector.maskedload/store' op =//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// This file implements target-independent rewrites and utilities to emulate the
// 'vector.maskedload' and 'vector.maskedstore' operation.
//
//===----------------------------------------------------------------------===//
#include "mlir/Dialect/MemRef/IR/MemRef.h"
#include "mlir/Dialect/SCF/IR/SCF.h"
#include "mlir/Dialect/Vector/Transforms/LoweringPatterns.h"
using namespace mlir;
namespace {
/// Convert vector.maskedload
///
/// Before:
///
/// vector.maskedload %base[%idx_0, %idx_1], %mask, %pass_thru
///
/// After:
///
/// %ivalue = %pass_thru
/// %m = vector.extract %mask[0]
/// %result0 = scf.if %m {
/// %v = memref.load %base[%idx_0, %idx_1]
/// %combined = vector.insert %v, %ivalue[0]
/// scf.yield %combined
/// } else {
/// scf.yield %ivalue
/// }
/// %m = vector.extract %mask[1]
/// %result1 = scf.if %m {
/// %v = memref.load %base[%idx_0, %idx_1 + 1]
/// %combined = vector.insert %v, %result0[1]
/// scf.yield %combined
/// } else {
/// scf.yield %result0
/// }
/// ...
///
struct VectorMaskedLoadOpConverter final
: OpRewritePattern<vector::MaskedLoadOp> {
using OpRewritePattern::OpRewritePattern;
LogicalResult matchAndRewrite(vector::MaskedLoadOp maskedLoadOp,
PatternRewriter &rewriter) const override {
VectorType maskVType = maskedLoadOp.getMaskVectorType();
if (maskVType.getShape().size() != 1)
return rewriter.notifyMatchFailure(
maskedLoadOp, "expected vector.maskedstore with 1-D mask");
Location loc = maskedLoadOp.getLoc();
int64_t maskLength = maskVType.getShape()[0];
Type indexType = rewriter.getIndexType();
Value mask = maskedLoadOp.getMask();
Value base = maskedLoadOp.getBase();
Value iValue = maskedLoadOp.getPassThru();
auto indices = llvm::to_vector_of<Value>(maskedLoadOp.getIndices());
Value one = rewriter.create<arith::ConstantOp>(
loc, indexType, IntegerAttr::get(indexType, 1));
for (int64_t i = 0; i < maskLength; ++i) {
auto maskBit = rewriter.create<vector::ExtractOp>(loc, mask, i);
auto ifOp = rewriter.create<scf::IfOp>(
loc, maskBit,
[&](OpBuilder &builder, Location loc) {
auto loadedValue =
builder.create<memref::LoadOp>(loc, base, indices);
auto combinedValue =
builder.create<vector::InsertOp>(loc, loadedValue, iValue, i);
builder.create<scf::YieldOp>(loc, combinedValue.getResult());
},
[&](OpBuilder &builder, Location loc) {
builder.create<scf::YieldOp>(loc, iValue);
});
iValue = ifOp.getResult(0);
indices.back() = rewriter.create<arith::AddIOp>(loc, indices.back(), one);
}
rewriter.replaceOp(maskedLoadOp, iValue);
return success();
}
};
/// Convert vector.maskedstore
///
/// Before:
///
/// vector.maskedstore %base[%idx_0, %idx_1], %mask, %value
///
/// After:
///
/// %m = vector.extract %mask[0]
/// scf.if %m {
/// %extracted = vector.extract %value[0]
/// memref.store %extracted, %base[%idx_0, %idx_1]
/// }
/// %m = vector.extract %mask[1]
/// scf.if %m {
/// %extracted = vector.extract %value[1]
/// memref.store %extracted, %base[%idx_0, %idx_1 + 1]
/// }
/// ...
///
struct VectorMaskedStoreOpConverter final
: OpRewritePattern<vector::MaskedStoreOp> {
using OpRewritePattern::OpRewritePattern;
LogicalResult matchAndRewrite(vector::MaskedStoreOp maskedStoreOp,
PatternRewriter &rewriter) const override {
VectorType maskVType = maskedStoreOp.getMaskVectorType();
if (maskVType.getShape().size() != 1)
return rewriter.notifyMatchFailure(
maskedStoreOp, "expected vector.maskedstore with 1-D mask");
Location loc = maskedStoreOp.getLoc();
int64_t maskLength = maskVType.getShape()[0];
Type indexType = rewriter.getIndexType();
Value mask = maskedStoreOp.getMask();
Value base = maskedStoreOp.getBase();
Value value = maskedStoreOp.getValueToStore();
auto indices = llvm::to_vector_of<Value>(maskedStoreOp.getIndices());
Value one = rewriter.create<arith::ConstantOp>(
loc, indexType, IntegerAttr::get(indexType, 1));
for (int64_t i = 0; i < maskLength; ++i) {
auto maskBit = rewriter.create<vector::ExtractOp>(loc, mask, i);
auto ifOp = rewriter.create<scf::IfOp>(loc, maskBit, /*else=*/false);
rewriter.setInsertionPointToStart(&ifOp.getThenRegion().front());
auto extractedValue = rewriter.create<vector::ExtractOp>(loc, value, i);
rewriter.create<memref::StoreOp>(loc, extractedValue, base, indices);
rewriter.setInsertionPointAfter(ifOp);
indices.back() = rewriter.create<arith::AddIOp>(loc, indices.back(), one);
}
rewriter.eraseOp(maskedStoreOp);
return success();
}
};
} // namespace
void mlir::vector::populateVectorMaskedLoadStoreEmulationPatterns(
RewritePatternSet &patterns, PatternBenefit benefit) {
patterns.add<VectorMaskedLoadOpConverter, VectorMaskedStoreOpConverter>(
patterns.getContext(), benefit);
}