192 lines
7.1 KiB
C++
192 lines
7.1 KiB
C++
// Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved.
|
|
//
|
|
// 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.
|
|
|
|
#include "paddle/phi/kernels/deformable_conv_grad_kernel.h"
|
|
|
|
#include "paddle/phi/backends/xpu/enforce_xpu.h"
|
|
#include "paddle/phi/core/kernel_registry.h"
|
|
#include "paddle/phi/kernels/full_kernel.h"
|
|
|
|
namespace phi {
|
|
|
|
template <typename T, typename Context>
|
|
void DeformableConvGradKernel(const Context& dev_ctx,
|
|
const DenseTensor& x,
|
|
const DenseTensor& offset,
|
|
const DenseTensor& filter,
|
|
const optional<DenseTensor>& mask,
|
|
const DenseTensor& out_grad,
|
|
const std::vector<int>& strides,
|
|
const std::vector<int>& paddings,
|
|
const std::vector<int>& dilations,
|
|
int deformable_groups,
|
|
int groups,
|
|
int im2col_step,
|
|
DenseTensor* dx,
|
|
DenseTensor* offset_grad,
|
|
DenseTensor* filter_grad,
|
|
DenseTensor* mask_grad) {
|
|
if (x.numel() == 0 || filter.numel() == 0) {
|
|
if (dx) Full<T, Context>(dev_ctx, dx->dims(), 0, dx);
|
|
if (offset_grad)
|
|
Full<T, Context>(dev_ctx, offset_grad->dims(), 0, offset_grad);
|
|
if (filter_grad)
|
|
Full<T, Context>(dev_ctx, filter_grad->dims(), 0, filter_grad);
|
|
if (mask_grad) Full<T, Context>(dev_ctx, mask_grad->dims(), 0, mask_grad);
|
|
return;
|
|
}
|
|
xpu::ctx_guard RAII_GUARD(dev_ctx.x_context());
|
|
T* dx_data = nullptr;
|
|
T* dw_data = nullptr;
|
|
T* dmask_data = nullptr;
|
|
T* doffset_data = nullptr;
|
|
|
|
if (dx != nullptr) {
|
|
dx_data = dev_ctx.template Alloc<T>(dx);
|
|
}
|
|
if (filter_grad != nullptr) {
|
|
dw_data = dev_ctx.template Alloc<T>(filter_grad);
|
|
}
|
|
if (offset_grad != nullptr) {
|
|
doffset_data = dev_ctx.template Alloc<T>(offset_grad);
|
|
}
|
|
if (mask_grad != nullptr) {
|
|
dmask_data = dev_ctx.template Alloc<T>(mask_grad);
|
|
}
|
|
|
|
if (backends::xpu::get_xpu_version(dev_ctx.GetPlace().GetDeviceId()) ==
|
|
backends::xpu::XPUVersion::XPU1) {
|
|
PADDLE_ENFORCE_EQ(
|
|
deformable_groups == 1,
|
|
true,
|
|
errors::InvalidArgument(("XPU1 only support deformable_groups == 1 in "
|
|
"deformable_conv_grad op.")));
|
|
}
|
|
PADDLE_ENFORCE_EQ(
|
|
groups == 1,
|
|
true,
|
|
errors::InvalidArgument(
|
|
("XPU only support groups == 1 in deformable_conv_grad op.")));
|
|
PADDLE_ENFORCE_EQ(filter.dims()[2] <= 8 && filter.dims()[3] <= 8,
|
|
true,
|
|
errors::InvalidArgument(
|
|
"Filter high and weight should less than 8 on xpu "
|
|
"in deformable_conv_grad op."));
|
|
|
|
const int64_t batch_size = x.dims()[0];
|
|
std::vector<int64_t> output_shape_vec(vectorize(out_grad.dims()));
|
|
const T* output_grad_ptr = out_grad.data<T>();
|
|
const T* input_ptr = x.data<T>();
|
|
const T* filter_ptr = filter.data<T>();
|
|
const float* offset_ptr = offset.data<float>();
|
|
const float* mask_ptr = mask->data<float>();
|
|
if (dx_data == nullptr) {
|
|
dx_data = RAII_GUARD.alloc_l3_or_gm<T>(x.numel());
|
|
PADDLE_ENFORCE_NOT_NULL(
|
|
dx_data, errors::ResourceExhausted("XPU has no enough memory"));
|
|
}
|
|
if (dw_data == nullptr) {
|
|
dw_data = RAII_GUARD.alloc_l3_or_gm<T>(filter.numel());
|
|
PADDLE_ENFORCE_NOT_NULL(
|
|
dw_data, errors::ResourceExhausted("XPU has no enough memory"));
|
|
}
|
|
if (doffset_data == nullptr) {
|
|
doffset_data = RAII_GUARD.alloc_l3_or_gm<T>(offset.numel());
|
|
PADDLE_ENFORCE_NOT_NULL(
|
|
doffset_data, errors::ResourceExhausted("XPU has no enough memory"));
|
|
}
|
|
if (dmask_data == nullptr) {
|
|
dmask_data = RAII_GUARD.alloc_l3_or_gm<T>(mask->numel());
|
|
PADDLE_ENFORCE_NOT_NULL(
|
|
dmask_data, errors::ResourceExhausted("XPU has no enough memory"));
|
|
}
|
|
|
|
int64_t input_dim = x.numel() / x.dims()[0];
|
|
int64_t input_offset_dim = offset.numel() / offset.dims()[0];
|
|
int64_t input_mask_dim = mask->numel() / mask->dims()[0];
|
|
int64_t output_dim =
|
|
output_shape_vec[1] * output_shape_vec[2] * output_shape_vec[3];
|
|
std::vector<int64_t> ksize{filter.dims()[2], filter.dims()[3]};
|
|
int64_t n = static_cast<int64_t>(im2col_step);
|
|
int64_t c = x.dims()[1];
|
|
int64_t h = x.dims()[2];
|
|
int64_t w = x.dims()[3];
|
|
int64_t f = filter.dims()[0];
|
|
|
|
T* filter_grad_tmp = RAII_GUARD.alloc_l3_or_gm<T>(filter_grad->numel());
|
|
PADDLE_ENFORCE_NOT_NULL(
|
|
filter_grad_tmp, errors::ResourceExhausted("XPU has no enough memory"));
|
|
|
|
// set zeros for d_table_data
|
|
const int zero = 0;
|
|
int r_dx = xpu::constant<T>(dev_ctx.x_context(), dx_data, x.numel(), zero);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r_dx, "constant");
|
|
int r_dw =
|
|
xpu::constant<T>(dev_ctx.x_context(), dw_data, filter.numel(), zero);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r_dw, "constant");
|
|
int r_doffset =
|
|
xpu::constant<T>(dev_ctx.x_context(), doffset_data, offset.numel(), zero);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r_doffset, "constant");
|
|
int r_dmask =
|
|
xpu::constant<T>(dev_ctx.x_context(), dmask_data, mask->numel(), zero);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r_dmask, "constant");
|
|
int r_filter = xpu::constant<T>(
|
|
dev_ctx.x_context(), filter_grad_tmp, filter.numel(), zero);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r_filter, "constant");
|
|
|
|
for (int64_t i = 0; i < batch_size / n; ++i) {
|
|
int r = xpu::deformable_conv_grad<float, float, float, int>(
|
|
dev_ctx.x_context(),
|
|
input_ptr + i * n * input_dim,
|
|
filter_ptr,
|
|
offset_ptr + i * n * input_offset_dim,
|
|
mask_ptr + i * n * input_mask_dim,
|
|
output_grad_ptr + i * n * output_dim,
|
|
dx_data + i * n * input_dim,
|
|
filter_grad_tmp,
|
|
doffset_data + i * n * input_offset_dim,
|
|
dmask_data + i * n * input_mask_dim,
|
|
n,
|
|
c,
|
|
h,
|
|
w,
|
|
f,
|
|
ksize,
|
|
std::vector<int64_t>{strides.begin(), strides.end()},
|
|
std::vector<int64_t>{paddings.begin(), paddings.end()},
|
|
std::vector<int64_t>{dilations.begin(), dilations.end()},
|
|
groups,
|
|
deformable_groups,
|
|
nullptr,
|
|
nullptr,
|
|
nullptr,
|
|
nullptr,
|
|
nullptr,
|
|
true);
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r, "deformable_conv_grad");
|
|
|
|
r = baidu::xpu::api::add<T>(
|
|
dev_ctx.x_context(), filter_grad_tmp, dw_data, dw_data, filter.numel());
|
|
PADDLE_ENFORCE_XDNN_SUCCESS(r, "add");
|
|
}
|
|
}
|
|
|
|
} // namespace phi
|
|
|
|
PD_REGISTER_KERNEL(deformable_conv_grad,
|
|
XPU,
|
|
ALL_LAYOUT,
|
|
phi::DeformableConvGradKernel,
|
|
float) {}
|