92 lines
3.1 KiB
C++
92 lines
3.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/shard_index_kernel.h"
|
|
|
|
#include "paddle/phi/backends/cpu/cpu_context.h"
|
|
#include "paddle/phi/core/kernel_registry.h"
|
|
|
|
namespace phi {
|
|
|
|
template <typename T, typename Context>
|
|
void ShardIndexKernel(const Context& dev_ctx,
|
|
const DenseTensor& in,
|
|
int index_num,
|
|
int nshards,
|
|
int shard_id,
|
|
int ignore_value,
|
|
DenseTensor* out) {
|
|
PADDLE_ENFORCE_GT(
|
|
index_num,
|
|
0,
|
|
errors::InvalidArgument(
|
|
"The value 'index_num' for Op(shard_index) must be greater than 0, "
|
|
"but the value given is %d.",
|
|
index_num));
|
|
PADDLE_ENFORCE_GT(
|
|
nshards,
|
|
0,
|
|
errors::InvalidArgument("The value 'nshards' for Op(shard_index) must be "
|
|
"greater than 0, but the value given is %d.",
|
|
nshards));
|
|
PADDLE_ENFORCE_GE(
|
|
shard_id,
|
|
0,
|
|
errors::InvalidArgument(
|
|
"The value 'shard_id' for Op(shard_index) must be greater or "
|
|
"equal to 0, but the value given is %d.",
|
|
shard_id));
|
|
PADDLE_ENFORCE_LT(
|
|
shard_id,
|
|
nshards,
|
|
errors::InvalidArgument(
|
|
"The value 'shard_id' for Op(shard_index) must be less than "
|
|
"nshards (%d), but the value given is %d.",
|
|
nshards,
|
|
shard_id));
|
|
|
|
int shard_size = (index_num + nshards - 1) / nshards;
|
|
|
|
out->Resize(in.dims());
|
|
out->set_lod(in.lod());
|
|
auto* in_data = in.data<T>();
|
|
auto* out_data = dev_ctx.template Alloc<T>(out);
|
|
int64_t numel = in.numel();
|
|
for (int64_t i = 0; i < numel; ++i) {
|
|
PADDLE_ENFORCE_GE(in_data[i],
|
|
0,
|
|
errors::InvalidArgument(
|
|
"The input_index for Op(shard_index) must be "
|
|
"greater or equal to 0, but the value given is %d.",
|
|
in_data[i]));
|
|
PADDLE_ENFORCE_LT(in_data[i],
|
|
index_num,
|
|
errors::InvalidArgument(
|
|
"The input_index for Op(shard_index) must be less "
|
|
"than index_num (%d), but the value given is %d.",
|
|
index_num,
|
|
in_data[i]));
|
|
if (in_data[i] / shard_size == shard_id) {
|
|
out_data[i] = in_data[i] % shard_size;
|
|
} else {
|
|
out_data[i] = ignore_value;
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace phi
|
|
|
|
PD_REGISTER_KERNEL(
|
|
shard_index, CPU, ALL_LAYOUT, phi::ShardIndexKernel, int, int64_t) {}
|