代码拉取完成,页面将自动刷新
// Copyright (c) 2023 Huawei Technologies Co., Ltd
// All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// 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 <ATen/native/ForeachUtils.h>
#include "op_plugin/OpApiInterface.h"
#include "op_plugin/utils/op_api_common.h"
#include "op_plugin/utils/OpUtils.h"
#include "torch_npu/csrc/framework/utils/UtilForOpAdapter.h"
namespace op_api {
using npu_preparation = at_npu::native::OpPreparation;
void _split_and_exec_npu_cmd_erf(at::TensorList tensors1, at::TensorList result_list, bool is_inplace)
{
size_t tensor_count = tensors1.size();
size_t max_tensor_count = is_inplace ? 48 : 24;
size_t loop_time = tensor_count / max_tensor_count;
if (tensor_count <= max_tensor_count) {
EXEC_NPU_CMD(aclnnForeachErf, tensors1, result_list);
return;
}
for (size_t i = 0; i < loop_time; i++) {
at::TensorList temp_tensors1(tensors1.data() + i * max_tensor_count, max_tensor_count);
at::TensorList temp_result(result_list.data() + i * max_tensor_count, max_tensor_count);
EXEC_NPU_CMD(aclnnForeachErf, temp_tensors1, temp_result);
}
size_t remaining_count = tensor_count % max_tensor_count;
if (remaining_count) {
at::TensorList temp_tensors1(tensors1.data() + loop_time * max_tensor_count, remaining_count);
at::TensorList temp_result(result_list.data() + loop_time * max_tensor_count, remaining_count);
EXEC_NPU_CMD(aclnnForeachErf, temp_tensors1, temp_result);
}
}
void _foreach_erf_(const at::TensorList self)
{
DO_COMPATIBILITY(aclnnForeachErf, at::native::foreach_tensor_erf_slow_(self));
static const bool is_support_nd_out = (c10_npu::GetSocVersion() >= c10_npu::SocVersion::Ascend910B1 &&
c10_npu::GetSocVersion() < c10_npu::SocVersion::Ascend310B1) ||
(c10_npu::GetSocVersion() > c10_npu::SocVersion::Ascend310B4);
if (!is_support_nd_out) {
return at::native::foreach_tensor_erf_slow_(self);
}
// datatype check
if (!op_plugin::utils::check_dtype_foreach(
self[0].scalar_type(),
op_plugin::utils::ForeachTensorDtypeSupport::BASE_DTYPE,
op_plugin::utils::ForeachInputType::TYPE_TENSOR)) {
return at::native::foreach_tensor_erf_slow_(self);
}
at::native::check_foreach_api_restrictions(self);
if (!at::native::can_use_fast_route(self) || at::native::has_integral_tensor(self, true)) {
return at::native::foreach_tensor_erf_slow_(self);
}
_split_and_exec_npu_cmd_erf(self, self, true);
}
std::vector<at::Tensor> _foreach_erf(const at::TensorList self)
{
DO_COMPATIBILITY(aclnnForeachErf, at::native::foreach_tensor_erf_slow(self));
static const bool is_support_nd_out = (c10_npu::GetSocVersion() >= c10_npu::SocVersion::Ascend910B1 &&
c10_npu::GetSocVersion() < c10_npu::SocVersion::Ascend310B1) ||
(c10_npu::GetSocVersion() > c10_npu::SocVersion::Ascend310B4);
if (!is_support_nd_out) {
return at::native::foreach_tensor_erf_slow(self);
}
// datatype check
if (!op_plugin::utils::check_dtype_foreach(
self[0].scalar_type(),
op_plugin::utils::ForeachTensorDtypeSupport::BASE_DTYPE,
op_plugin::utils::ForeachInputType::TYPE_TENSOR)) {
return at::native::foreach_tensor_erf_slow(self);
}
at::native::check_foreach_api_restrictions(self);
if (!at::native::can_use_fast_route(self) || at::native::has_integral_tensor(self, true)) {
return at::native::foreach_tensor_erf_slow(self);
}
auto scalar_type = self[0].scalar_type();
// construct output tensorlist
std::vector<at::Tensor> result;
result.reserve(self.size());
for (const at::Tensor &tensor : self) {
auto output_size = op_infer::input_same_output_size(tensor);
result.push_back(
npu_preparation::apply_tensor_without_format(
output_size,
tensor.options().dtype(scalar_type)));
}
at::TensorList result_ = at::TensorList(result);
_split_and_exec_npu_cmd_erf(self, result_, false);
return result;
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。