-
Notifications
You must be signed in to change notification settings - Fork 1k
Expand file tree
/
Copy pathop_convolution.cpp
More file actions
447 lines (387 loc) · 13.8 KB
/
op_convolution.cpp
File metadata and controls
447 lines (387 loc) · 13.8 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
/*
* Copyright (c) Meta Platforms, Inc. and affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <c10/util/irange.h>
#include <cstring>
#include <executorch/kernels/portable/cpu/util/dtype_util.h>
#include <executorch/kernels/portable/cpu/util/kernel_ops_util.h>
#include <executorch/runtime/core/exec_aten/util/dim_order_util.h>
#include <executorch/runtime/kernel/kernel_includes.h>
namespace torch {
namespace executor {
namespace native {
using Tensor = executorch::aten::Tensor;
using ScalarType = executorch::aten::ScalarType;
using IntArrayRef = executorch::aten::ArrayRef<int64_t>;
using SizesArrayRef = executorch::aten::ArrayRef<executorch::aten::SizesType>;
using DimOrderArrayRef =
executorch::aten::ArrayRef<executorch::aten::DimOrderType>;
using StridesArrayRef =
executorch::aten::ArrayRef<executorch::aten::StridesType>;
namespace {
/**
* Computes 2D convolution out results for a given group and channel. The
* computation can be thought of as a stencil computation: we iterate over an
* in of size in_C_per_group x in_H x in_W, with a stencil of size
* in_C_per_group x in_H x in_W, to compute an out channel of size 1 x out_H x
* out_W.
*/
template <typename CTYPE, typename LoadFn = CTYPE (*)(const void*)>
void conv2d_impl(
const CTYPE* const in_ptr,
SizesArrayRef in_sizes,
StridesArrayRef in_strides,
const CTYPE* const w_ptr,
SizesArrayRef w_sizes,
StridesArrayRef w_strides,
const std::optional<Tensor>& bias,
const char* const bias_ptr,
LoadFn load_bias,
IntArrayRef stride,
IntArrayRef padding,
IntArrayRef dilation,
const int64_t groups,
CTYPE* const out_ptr,
SizesArrayRef out_sizes,
StridesArrayRef out_strides,
const size_t batch,
const size_t group,
const size_t out_c,
bool transposed) {
size_t in_C = in_sizes[1];
size_t out_C = out_sizes[1];
size_t out_H = out_sizes[2];
size_t in_H = in_sizes[2];
size_t w_H = w_sizes[2];
size_t out_W = out_sizes[3];
size_t in_W = in_sizes[3];
size_t w_W = w_sizes[3];
size_t in_C_per_group = in_C / groups;
size_t in_c_start = group * in_C_per_group;
size_t out_C_per_group = out_C / groups;
size_t out_c_start = group * out_C_per_group;
executorch::aten::SizesType in_coord[kTensorDimensionLimit];
in_coord[0] = batch;
executorch::aten::SizesType out_coord[kTensorDimensionLimit];
out_coord[0] = batch;
out_coord[1] = out_c;
executorch::aten::SizesType w_coord[kTensorDimensionLimit];
const int64_t stride_y = val_at(stride, 0);
const int64_t padding_y = val_at(padding, 0, /*default_value=*/0);
const int64_t dilation_y = val_at(dilation, 0);
const int64_t stride_x = val_at(stride, 1);
const int64_t padding_x = val_at(padding, 1, /*default_value=*/0);
const int64_t dilation_x = val_at(dilation, 1);
if (!transposed) {
w_coord[0] = out_c;
// Compute 2D output region
for (const auto out_y : c10::irange(out_H)) {
out_coord[2] = out_y;
for (const auto out_x : c10::irange(out_W)) {
out_coord[3] = out_x;
CTYPE accum = 0.0f;
for (const auto in_c :
c10::irange(in_c_start, in_c_start + in_C_per_group)) {
in_coord[1] = in_c;
w_coord[1] = in_c - in_c_start;
for (const auto w_y : c10::irange(w_H)) {
w_coord[2] = w_y;
ssize_t in_y = stride_y * out_y + dilation_y * w_y - padding_y;
in_coord[2] = in_y;
// Only proceed if input y coordinate is within bounds
if (in_y >= 0 && in_y < static_cast<ssize_t>(in_H)) {
for (const auto w_x : c10::irange(w_W)) {
w_coord[3] = w_x;
ssize_t in_x = stride_x * out_x + dilation_x * w_x - padding_x;
in_coord[3] = in_x;
// Only proceed if input x coordinate is within bounds
if (in_x >= 0 && in_x < static_cast<ssize_t>(in_W)) {
size_t in_idx =
calculate_linear_index(in_coord, in_strides.data(), 4);
CTYPE in_val = in_ptr[in_idx];
size_t w_idx =
calculate_linear_index(w_coord, w_strides.data(), 4);
CTYPE w_val = w_ptr[w_idx];
accum += in_val * w_val;
}
}
}
}
}
if (bias_ptr != nullptr) {
accum += load_bias(&bias_ptr[out_c * bias.value().element_size()]);
}
size_t out_idx =
calculate_linear_index(out_coord, out_strides.data(), 4);
out_ptr[out_idx] = accum;
}
}
} else { // transposed convolution
w_coord[1] = out_c - out_c_start;
for (const auto in_y : c10::irange(in_H)) {
in_coord[2] = in_y;
for (const auto in_x : c10::irange(in_W)) {
in_coord[3] = in_x;
for (const auto in_c :
c10::irange(in_c_start, in_c_start + in_C_per_group)) {
in_coord[1] = in_c;
size_t in_idx =
calculate_linear_index(in_coord, in_strides.data(), 4);
CTYPE in_val = in_ptr[in_idx];
w_coord[0] = in_c;
for (const auto w_y : c10::irange(w_H)) {
w_coord[2] = w_y;
ssize_t out_y = stride_y * in_y + dilation_y * w_y - padding_y;
out_coord[2] = out_y;
// Only proceed if output y coordinate is within bounds
if (out_y >= 0 && out_y < static_cast<ssize_t>(out_H)) {
for (const auto w_x : c10::irange(w_W)) {
w_coord[3] = w_x;
ssize_t out_x = stride_x * in_x + dilation_x * w_x - padding_x;
out_coord[3] = out_x;
// Only proceed if output x coordinate is within bounds
if (out_x >= 0 && out_x < static_cast<ssize_t>(out_W)) {
size_t w_idx =
calculate_linear_index(w_coord, w_strides.data(), 4);
CTYPE w_val = w_ptr[w_idx];
size_t out_idx =
calculate_linear_index(out_coord, out_strides.data(), 4);
out_ptr[out_idx] += in_val * w_val;
}
}
}
}
}
}
}
}
}
template <typename CTYPE, typename LoadFn = CTYPE (*)(const void*)>
void convolution_wrapper(
const Tensor& in,
const Tensor& weight,
const std::optional<Tensor>& bias,
LoadFn load_bias,
IntArrayRef stride,
IntArrayRef padding,
IntArrayRef dilation,
bool transposed,
int64_t groups,
Tensor& out) {
// Defense-in-depth: get_load_to_compute_fn returns nullptr (and sets
// ctx.fail()) when bias' scalar_type is outside the dispatcher's
// supported set. check_convolution_args() in kernel_ops_util.cpp now
// rejects such bias tensors at the trust boundary, but we keep this guard
// so any future caller of convolution_wrapper is safe; load_bias is
// dereferenced inside the wrapper / conv2d_impl whenever bias has data.
if (bias.has_value() && load_bias == nullptr) {
return;
}
SizesArrayRef in_sizes = in.sizes();
SizesArrayRef weight_sizes = weight.sizes();
SizesArrayRef out_sizes = out.sizes();
DimOrderArrayRef in_dim_order = in.dim_order();
DimOrderArrayRef weight_dim_order = weight.dim_order();
DimOrderArrayRef out_dim_order = out.dim_order();
IntArrayRef stride_ = stride;
IntArrayRef padding_ = padding;
IntArrayRef dilation_ = dilation;
// Define arrays for modified sizes, etc. which will potentially be used
executorch::aten::SizesType in_sizes_arr[kTensorDimensionLimit];
executorch::aten::DimOrderType in_dim_order_arr[kTensorDimensionLimit];
size_t in_ndim;
executorch::aten::SizesType weight_sizes_arr[kTensorDimensionLimit];
executorch::aten::DimOrderType weight_dim_order_arr[kTensorDimensionLimit];
size_t weight_ndim;
executorch::aten::SizesType out_sizes_arr[kTensorDimensionLimit];
executorch::aten::DimOrderType out_dim_order_arr[kTensorDimensionLimit];
size_t out_ndim;
int64_t stride_arr[2];
int64_t padding_arr[2];
int64_t dilation_arr[2];
// If in has a dim of 3, then a 1D convolution will be performed. A 1D
// convolution is equivalent to a 2D convolution where the height dim of
// all tensors is 1, and stride = 1, padding = 0, and dilation = 1 for
// the height dimension. Therefore the tensor sizes are unsqueezed and
// the stride, padding, and dilation are adjusted so that a 2D
// convolution implementation can be used.
if (in.dim() == 3) {
get_unsqueezed_sizes(in, 2, in_sizes_arr, in_ndim);
in_sizes = {in_sizes_arr, in_ndim};
get_unsqueezed_dim_order(in, 2, in_dim_order_arr);
in_dim_order = {in_dim_order_arr, in_ndim};
get_unsqueezed_sizes(weight, 2, weight_sizes_arr, weight_ndim);
weight_sizes = {weight_sizes_arr, weight_ndim};
get_unsqueezed_dim_order(weight, 2, weight_dim_order_arr);
weight_dim_order = {weight_dim_order_arr, weight_ndim};
get_unsqueezed_sizes(out, 2, out_sizes_arr, out_ndim);
out_sizes = {out_sizes_arr, out_ndim};
get_unsqueezed_dim_order(out, 2, out_dim_order_arr);
out_dim_order = {out_dim_order_arr, out_ndim};
stride_arr[0] = 1;
stride_arr[1] = stride[0];
stride_ = {stride_arr, 2};
padding_arr[0] = 0;
padding_arr[1] = padding[0];
padding_ = {padding_arr, 2};
dilation_arr[0] = 1;
if (dilation.size() > 0) {
dilation_arr[1] = dilation[0];
} else {
dilation_arr[1] = 1;
}
dilation_ = {dilation_arr, 2};
}
executorch::aten::StridesType in_strides[kTensorDimensionLimit];
dim_order_to_stride_nocheck(
in_sizes.data(), in_dim_order.data(), in_sizes.size(), in_strides);
executorch::aten::StridesType weight_strides[kTensorDimensionLimit];
dim_order_to_stride_nocheck(
weight_sizes.data(),
weight_dim_order.data(),
weight_sizes.size(),
weight_strides);
executorch::aten::StridesType out_strides[kTensorDimensionLimit];
dim_order_to_stride_nocheck(
out_sizes.data(), out_dim_order.data(), out_sizes.size(), out_strides);
CTYPE* const out_ptr = out.mutable_data_ptr<CTYPE>();
const CTYPE* const in_ptr = in.const_data_ptr<CTYPE>();
const CTYPE* const w_ptr = weight.const_data_ptr<CTYPE>();
const char* const bias_ptr = bias.has_value()
? reinterpret_cast<const char*>(bias.value().const_data_ptr())
: nullptr;
size_t out_N = out.size(0);
size_t out_C = out.size(1);
size_t out_C_per_group = out_C / groups;
if (transposed) {
// For transposed convolution, we need to initialized the output before we
// can accumulate into it.
if (bias_ptr == nullptr) {
// If bias is not present, we need to initialize the output to 0
memset(out_ptr, 0, out.nbytes());
} else {
// If bias is present, we initialize the output to the bias value
for (const auto out_ix : c10::irange(out.numel())) {
out_ptr[out_ix] = load_bias(&bias_ptr
[((out_ix / out_strides[1]) % out_C) *
bias.value().element_size()]);
}
}
}
for (const auto batch : c10::irange(out_N)) {
for (const auto group : c10::irange(groups)) {
// Align channel offset based on the group
size_t out_c_start = group * out_C_per_group;
// Populate all the out channels in the group
for (const auto out_c :
c10::irange(out_c_start, out_c_start + out_C_per_group)) {
conv2d_impl(
in_ptr,
in_sizes,
{in_strides, 4},
w_ptr,
weight_sizes,
{weight_strides, 4},
bias,
bias_ptr,
load_bias,
stride_,
padding_,
dilation_,
groups,
out_ptr,
out_sizes,
{out_strides, 4},
batch,
group,
out_c,
transposed);
}
}
}
}
} // namespace
Tensor& convolution_out(
KernelRuntimeContext& ctx,
const Tensor& in,
const Tensor& weight,
const std::optional<Tensor>& bias,
IntArrayRef stride,
IntArrayRef padding,
IntArrayRef dilation,
bool transposed,
IntArrayRef output_padding,
int64_t groups,
Tensor& out) {
(void)ctx;
ET_KERNEL_CHECK(
ctx,
check_convolution_args(
in,
weight,
bias,
stride,
padding,
dilation,
transposed,
output_padding,
groups,
out),
InvalidArgument,
out);
ET_KERNEL_CHECK(
ctx, tensors_have_same_dim_order(in, out), InvalidArgument, out);
size_t output_ndim = 0;
executorch::aten::SizesType output_sizes[kTensorDimensionLimit];
get_convolution_out_target_size(
in,
weight,
stride,
padding,
dilation,
transposed,
output_padding,
groups,
output_sizes,
&output_ndim);
ET_KERNEL_CHECK(
ctx,
output_size_is_valid({output_sizes, output_ndim}, in.dim() - 2),
InvalidArgument,
out);
ET_KERNEL_CHECK(
ctx,
resize_tensor(out, {output_sizes, output_ndim}) == Error::Ok,
InvalidArgument,
out);
if (out.numel() == 0) {
return out;
}
// @lint-ignore CLANGTIDY facebook-hte-CArray
static constexpr const char name[] = "convolution.out";
ET_SWITCH_REALHBF16_TYPES(in.scalar_type(), ctx, name, CTYPE, [&]() {
const auto load_bias = bias.has_value()
? utils::internal::get_load_to_compute_fn<CTYPE, name>(
ctx, bias.value(), utils::SupportedTensorDtypes::REALHBF16)
: nullptr;
convolution_wrapper<CTYPE>(
in,
weight,
bias,
load_bias,
stride,
padding,
dilation,
transposed,
groups,
out);
});
return out;
}
} // namespace native
} // namespace executor
} // namespace torch