* Copyright (c) 2025 Huawei Technologies Co., Ltd.
* This program is free software, you can redistribute it and/or modify it under the terms and conditions of
* CANN Open Software License Agreement Version 2.0 (the "License").
* Please refer to the License for details. You may not use this file except in compliance with the License.
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED,
* INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE.
* See LICENSE in the root of the software repository for the full text of the License.
*/
#include "graph/passes/format_optimize/transpose_transdata_pass.h"
#include <memory>
#include <string>
#include <vector>
#include "formats/utils/formats_trans_utils.h"
#include "framework/common/debug/ge_log.h"
#include "graph/utils/type_utils.h"
#include "graph/debug/ge_attr_define.h"
#include "graph/utils/node_utils.h"
#include "api/gelib/gelib.h"
#include "engines/manager/opskernel_manager/ops_kernel_manager.h"
#include "graph/common/trans_op_creator.h"
namespace {
const char *const kAttrNameSrcFormat = "src_format";
}
namespace ge {
Status TransposeTransDataPass::FusionTranspose(NodePtr &node) {
auto op_desc = node->GetOpDesc();
auto out_nodes = node->GetOutDataNodes();
bool is_add_flag = false;
uint32_t transdata_input_num = 1U;
uint32_t transdata_output_num = 1U;
for (auto &out_node : out_nodes) {
GE_CHECK_NOTNULL(out_node);
OpDescPtr out_op_desc = out_node->GetOpDesc();
GE_CHECK_NOTNULL(out_op_desc);
if (out_op_desc->GetType() != TRANSDATA) {
continue;
}
if (CheckInOutDataAnchorValid(out_node, transdata_input_num, transdata_output_num) != SUCCESS) {
return FAILED;
}
if (!FusionIfNeed(op_desc, out_node)) {
continue;
}
CopyInputEdges(node, out_node);
is_add_flag = true;
}
if (is_add_flag) {
AddRePassNode(node->GetInDataNodes().at(0));
}
if (node->GetOutDataNodesSize() == 0) {
return RemoveTranspose(node);
}
return SUCCESS;
}
Status TransposeTransDataPass::Run(NodePtr &node) {
if (node == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "Param node is nullptr, check invalid");
GELOGE(PARAM_INVALID, "[Check][Param] param [node] must not be null.");
return PARAM_INVALID;
}
auto op_desc = node->GetOpDesc();
if (op_desc == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "Param node's op_desc is nullptr, check invalid");
GELOGE(PARAM_INVALID, "[Get][OpDesc] failed, OpDesc of param [node] must not be null.");
return PARAM_INVALID;
}
if ((op_desc->GetType() != TRANSPOSED) && (op_desc->GetType() != TRANSPOSE)) {
return SUCCESS;
}
GE_ASSERT_NOTNULL(op_desc->GetInputDescPtr(0));
auto input_format = op_desc->GetInputDescPtr(0)->GetFormat();
GE_ASSERT_NOTNULL(op_desc->GetOutputDescPtr(0));
auto output_format = op_desc->GetOutputDescPtr(0)->GetFormat();
if (input_format == output_format) {
GELOGW("Node %s input format is %s, output format is %s, should not happend. Ignore pass.",
op_desc->GetName().c_str(),
TypeUtils::FormatToSerialString(input_format).c_str(),
TypeUtils::FormatToSerialString(output_format).c_str());
return SUCCESS;
}
uint32_t transposed_input_num = 1U;
uint32_t output_num = 1U;
uint32_t transpose_input_num = 2U;
if ((op_desc->GetType() == TRANSPOSED) &&
(CheckInOutDataAnchorValid(node, transposed_input_num, output_num) != SUCCESS)) {
return FAILED;
}
if ((op_desc->GetType() == TRANSPOSE) &&
(CheckInOutDataAnchorValid(node, transpose_input_num, output_num) != SUCCESS)) {
return FAILED;
}
bool is_unknown = false;
auto ret = NodeUtils::GetNodeUnknownShapeStatus(*node, is_unknown);
if (ret != GRAPH_SUCCESS) {
GELOGW("Get node unknown status failed, node name:%s, type:%s.", node->GetName().c_str(), node->GetType().c_str());
return INTERNAL_ERROR;
}
if (is_unknown) {
GELOGI("Current node %s, type %s is unknown shape which should be skip.", node->GetName().c_str(),
node->GetType().c_str());
return SUCCESS;
}
GELOGD("[%s] TransposeTransDataPass in.", node->GetName().c_str());
return FusionTranspose(node);
}
Status TransposeTransDataPass::CheckInOutDataAnchorValid(const NodePtr &node, uint32_t input_data_num,
uint32_t output_data_num) const {
GE_CHECK_NOTNULL(node);
uint32_t in_data_anchor_nums = node->GetAllInDataAnchorsSize();
uint32_t out_data_anchor_nums = node->GetAllOutDataAnchorsSize();
uint32_t in_data_node_nums = node->GetInDataNodes().size();
if (in_data_anchor_nums != input_data_num || out_data_anchor_nums != output_data_num ||
in_data_node_nums != input_data_num) {
REPORT_INNER_ERR_MSG("E19999", "In data anchor num:%u should be %u, out data anchor num:%u should be %u,"
"in data node num:%u should be %u, node is:%s(%s), check invalid", in_data_anchor_nums,
input_data_num, out_data_anchor_nums, output_data_num, in_data_node_nums, input_data_num,
node->GetName().c_str(), node->GetType().c_str());
GELOGE(FAILED, "In data anchor num:%u should be %u, out data anchor num:%u should be %u,"
"in data node num:%u should be %u, node is:%s(%s), check invalid", in_data_anchor_nums,
input_data_num, out_data_anchor_nums, output_data_num, in_data_node_nums, input_data_num,
node->GetName().c_str(), node->GetType().c_str());
return FAILED;
}
return SUCCESS;
}
Status TransposeTransDataPass::RemoveTranspose(const NodePtr &node) {
GE_CHECK_NOTNULL(node);
ComputeGraphPtr graph = node->GetOwnerComputeGraph();
if (graph == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "Owner graph of node:%s(%s) is nullptr, check invalid",
node->GetName().c_str(), node->GetType().c_str());
GELOGE(FAILED, "[Get][OwnerComputeGraph] failed, The owner graph of node:%s(%s) must not be null.",
node->GetName().c_str(), node->GetType().c_str());
return FAILED;
}
auto origin_node_in = node->GetInDataNodes().at(0);
GE_CHECK_NOTNULL(node->GetOutControlAnchor());
for (auto &peer_anchor : node->GetOutControlAnchor()->GetPeerInControlAnchors()) {
GE_CHECK_NOTNULL(origin_node_in);
GE_CHECK_NOTNULL(origin_node_in->GetOutControlAnchor());
GE_CHK_STATUS_RET(origin_node_in->GetOutControlAnchor()->LinkTo(peer_anchor),
"[Link][Anchor] between %s and %s failed",
origin_node_in->GetName().c_str(), peer_anchor->GetOwnerNode()->GetName().c_str());
}
for (const auto &anchor : node->GetAllInAnchors()) {
GE_CHECK_NOTNULL(anchor);
anchor->UnlinkAll();
}
for (const auto &anchor : node->GetAllOutAnchors()) {
GE_CHECK_NOTNULL(anchor);
anchor->UnlinkAll();
}
AddNodeDeleted(node);
if (GraphUtils::RemoveNodeWithoutRelink(graph, node) != GRAPH_SUCCESS) {
REPORT_INNER_ERR_MSG("E19999", "Remove node:%s(%s) without relink in graph:%s failed",
node->GetName().c_str(), node->GetType().c_str(), graph->GetName().c_str());
GELOGE(FAILED, "[Remove][Node] %s(%s) without relink in graph:%s failed",
node->GetName().c_str(), node->GetType().c_str(), graph->GetName().c_str());
return FAILED;
}
return SUCCESS;
}
bool TransposeTransDataPass::FusionIfNeed(const OpDescPtr &op_desc, const NodePtr &node) const {
auto transdata_op_desc = node->GetOpDesc();
GE_CHECK_NOTNULL(op_desc);
GE_CHECK_NOTNULL(transdata_op_desc);
auto out_input_desc = transdata_op_desc->MutableInputDesc(0);
GE_CHECK_NOTNULL(out_input_desc);
auto out_input_format = out_input_desc->GetFormat();
auto out_input_shape = out_input_desc->GetShape();
auto input_desc = op_desc->MutableInputDesc(0);
auto out_desc = op_desc->MutableOutputDesc(0);
GE_CHECK_NOTNULL(input_desc);
GE_CHECK_NOTNULL(out_desc);
auto src_format = input_desc->GetFormat();
auto dst_format = out_desc->GetFormat();
auto &dst_shape = out_desc->MutableShape();
if (dst_format != out_input_format || !formats::IsShapeEqual(dst_shape, out_input_shape) || src_format == FORMAT_ND) {
GELOGD("Output of transpose isn't the same as input of transdata, or transpose input format must not be ND.");
GELOGD("Transpose input format %s, output format %s shape %s. transdata in %s %s.",
TypeUtils::FormatToSerialString(src_format).c_str(), TypeUtils::FormatToSerialString(dst_format).c_str(),
formats::ShapeToString(dst_shape.GetDims()).c_str(),
TypeUtils::FormatToSerialString(out_input_format).c_str(),
formats::ShapeToString(out_input_shape.GetDims()).c_str());
return false;
}
auto &src_shape = input_desc->MutableShape();
GELOGI("Begin to fuse transpose transdata, transpose in format %s shape %s, transdata in %s %s",
TypeUtils::FormatToSerialString(src_format).c_str(), formats::ShapeToString(src_shape.GetDims()).c_str(),
TypeUtils::FormatToSerialString(out_input_format).c_str(),
formats::ShapeToString(out_input_shape.GetDims()).c_str());
out_input_desc->SetFormat(src_format);
out_input_desc->SetShape(src_shape);
bool is_support = false;
(void)TransOpCreator::CheckAccuracySupported(node->GetOpDesc(), is_support);
if (!is_support) {
out_input_desc->SetFormat(out_input_format);
out_input_desc->SetShape(out_input_shape);
return false;
}
std::string new_node_name = op_desc->GetName() + transdata_op_desc->GetName();
transdata_op_desc->SetName(new_node_name);
std::string format_val = TypeUtils::FormatToSerialString(src_format);
GE_IF_BOOL_EXEC(!AttrUtils::SetStr(transdata_op_desc, kAttrNameSrcFormat, format_val),
GELOGW("set kAttrNameSrcFormat failed");
return false);
GELOGI("TransposeTransDataPass, fuse to be node %s.", transdata_op_desc->GetName().c_str());
return true;
}
void TransposeTransDataPass::CopyInputEdges(NodePtr &origin_node, NodePtr &new_node) const {
if (origin_node == nullptr || new_node == nullptr) {
return;
}
InDataAnchorPtr new_in_data_anchor = new_node->GetInDataAnchor(0);
if (new_in_data_anchor == nullptr || origin_node->GetInDataAnchor(0) == nullptr) {
return;
}
if (origin_node->GetType() == TRANSPOSE) {
auto perm_node_in = origin_node->GetInDataNodes().at(1);
auto perm_out_anchor = perm_node_in->GetOutControlAnchor();
auto new_control_in_anchor = new_node->GetInControlAnchor();
if (GraphUtils::AddEdge(perm_out_anchor, new_control_in_anchor) != GRAPH_SUCCESS) {
return;
}
}
OutDataAnchorPtr out_anchor = origin_node->GetInDataAnchor(0)->GetPeerOutAnchor();
new_in_data_anchor->UnlinkAll();
GE_IF_BOOL_EXEC(new_in_data_anchor->LinkFrom(out_anchor) != GRAPH_SUCCESS, GELOGW("Link failed"); return);
GE_IF_BOOL_EXEC(
GraphUtils::CopyInCtrlEdges(origin_node, new_node) != GRAPH_SUCCESS, GELOGW("Copy in ctrl edges failed"); return);
}
REG_PASS_OPTION("TransposeTransDataPass").LEVELS(OoLevel::kO3);
}