177 lines
6.7 KiB
C++
177 lines
6.7 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/send_u_recv_grad_kernel.h"
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
|
|
#include "paddle/phi/core/kernel_registry.h"
|
|
#include "paddle/phi/kernels/cpu/graph_send_recv_funcs.h"
|
|
#include "paddle/phi/kernels/full_kernel.h"
|
|
|
|
namespace phi {
|
|
|
|
template <typename T, typename IndexT, typename Functor>
|
|
void GraphSendRecvCpuGradLoop(const int& index_size,
|
|
const IndexT* s_index,
|
|
const IndexT* d_index,
|
|
const DenseTensor& src,
|
|
const DenseTensor& input,
|
|
DenseTensor* dst,
|
|
const std::string& reduce_op,
|
|
const int* dst_count = nullptr,
|
|
const DenseTensor* output = nullptr) {
|
|
if (reduce_op == "SUM") {
|
|
Functor functor;
|
|
for (int i = 0; i < index_size; ++i) {
|
|
const IndexT& src_idx = s_index[i];
|
|
const IndexT& dst_idx = d_index[i];
|
|
ElementwiseInnerOperation<T, IndexT, Functor>(
|
|
src, dst, src_idx, dst_idx, false, functor);
|
|
}
|
|
} else if (reduce_op == "MEAN") {
|
|
for (int i = 0; i < index_size; ++i) {
|
|
const IndexT& src_idx = s_index[i];
|
|
const IndexT& dst_idx = d_index[i];
|
|
auto src_slice = src.Slice(src_idx, src_idx + 1);
|
|
auto dst_slice = dst->Slice(dst_idx, dst_idx + 1);
|
|
auto eigen_src = EigenVector<T>::Flatten(src_slice);
|
|
auto eigen_dst = EigenVector<T>::Flatten(dst_slice);
|
|
eigen_dst += (eigen_src / static_cast<T>(dst_count[src_idx]));
|
|
}
|
|
} else if (reduce_op == "MIN" || reduce_op == "MAX") {
|
|
for (int i = 0; i < index_size; ++i) {
|
|
const IndexT& forward_src_idx = d_index[i];
|
|
const IndexT& forward_dst_idx = s_index[i];
|
|
auto input_slice = input.Slice(forward_src_idx, forward_src_idx + 1);
|
|
auto output_slice =
|
|
output->Slice(forward_dst_idx, forward_dst_idx + 1); // NOLINT
|
|
auto eigen_input = EigenVector<T>::Flatten(input_slice);
|
|
auto eigen_output = EigenVector<T>::Flatten(output_slice);
|
|
|
|
auto src_slice = src.Slice(forward_dst_idx, forward_dst_idx + 1);
|
|
auto dst_slice = dst->Slice(forward_src_idx, forward_src_idx + 1);
|
|
auto eigen_src = EigenVector<T>::Flatten(src_slice);
|
|
auto eigen_dst = EigenVector<T>::Flatten(dst_slice);
|
|
eigen_dst += eigen_src * (eigen_output == eigen_input);
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename Context, typename T, typename IndexT>
|
|
void GraphSendRecvGradOpKernelLaunchHelper(
|
|
const Context& dev_ctx,
|
|
const DenseTensor& out_grad,
|
|
const DenseTensor& x,
|
|
const DenseTensor& src_index,
|
|
const DenseTensor& dst_index,
|
|
const std::string& reduce_op,
|
|
DenseTensor* x_grad,
|
|
const DenseTensor* dst_count = nullptr,
|
|
const DenseTensor* out = nullptr) {
|
|
// TODO(large-tensor): downstream functors may still use int; guard until
|
|
// upgraded.
|
|
const int64_t& index_size = dst_index.dims()[0];
|
|
// NOLINT
|
|
|
|
dev_ctx.template Alloc<T>(x_grad);
|
|
T* p_output = x_grad->data<T>();
|
|
const auto& src_dims = x.dims();
|
|
int64_t memset_size = 1;
|
|
for (int i = 0; i < src_dims.size(); ++i) memset_size *= src_dims[i];
|
|
const size_t& memset_bytes = memset_size * sizeof(T);
|
|
memset(p_output, 0, memset_bytes);
|
|
|
|
if (index_size == 0) return;
|
|
|
|
const IndexT* s_index = src_index.data<IndexT>();
|
|
const IndexT* d_index = dst_index.data<IndexT>();
|
|
|
|
if (reduce_op == "SUM") {
|
|
GraphSendRecvCpuGradLoop<T, IndexT, GraphSendRecvSumFunctor<T>>(
|
|
index_size, d_index, s_index, out_grad, x, x_grad, reduce_op);
|
|
} else if (reduce_op == "MEAN") {
|
|
const int* s_count = dst_count->data<int>();
|
|
// Functor not used here.
|
|
GraphSendRecvCpuGradLoop<T, IndexT, GraphSendRecvSumFunctor<T>>(
|
|
index_size, d_index, s_index, out_grad, x, x_grad, reduce_op, s_count);
|
|
} else if (reduce_op == "MIN" || reduce_op == "MAX") {
|
|
// Functor not used here.
|
|
GraphSendRecvCpuGradLoop<T, IndexT, GraphSendRecvMinFunctor<T>>(index_size,
|
|
d_index,
|
|
s_index,
|
|
out_grad,
|
|
x,
|
|
x_grad,
|
|
reduce_op,
|
|
nullptr,
|
|
out);
|
|
}
|
|
}
|
|
|
|
template <typename T, typename Context>
|
|
void SendURecvGradKernel(const Context& dev_ctx,
|
|
const DenseTensor& x,
|
|
const DenseTensor& src_index,
|
|
const DenseTensor& dst_index,
|
|
const optional<DenseTensor>& out,
|
|
const optional<DenseTensor>& dst_count,
|
|
const DenseTensor& out_grad,
|
|
const std::string& reduce_op,
|
|
DenseTensor* x_grad) {
|
|
auto index_type = src_index.dtype();
|
|
|
|
if (out_grad.numel() == 0 || x.numel() == 0 || src_index.numel() == 0 ||
|
|
dst_index.numel() == 0) {
|
|
Full<T, Context>(dev_ctx, x_grad->dims(), 0, x_grad);
|
|
return;
|
|
}
|
|
|
|
if (index_type == DataType::INT32) {
|
|
GraphSendRecvGradOpKernelLaunchHelper<Context, T, int32_t>(
|
|
dev_ctx,
|
|
out_grad,
|
|
x,
|
|
src_index,
|
|
dst_index,
|
|
reduce_op,
|
|
x_grad,
|
|
dst_count.get_ptr(),
|
|
out.get_ptr());
|
|
} else if (index_type == DataType::INT64) {
|
|
GraphSendRecvGradOpKernelLaunchHelper<Context, T, int64_t>(
|
|
dev_ctx,
|
|
out_grad,
|
|
x,
|
|
src_index,
|
|
dst_index,
|
|
reduce_op,
|
|
x_grad,
|
|
dst_count.get_ptr(),
|
|
out.get_ptr());
|
|
}
|
|
}
|
|
|
|
} // namespace phi
|
|
|
|
PD_REGISTER_KERNEL(send_u_recv_grad,
|
|
CPU,
|
|
ALL_LAYOUT,
|
|
phi::SendURecvGradKernel,
|
|
float,
|
|
double,
|
|
int,
|
|
int64_t) {}
|