* 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/feature/link_gen_mask_nodes_pass.h"
#include <set>
#include "framework/common/ge_inner_error_codes.h"
#include "framework/common/debug/ge_log.h"
#include "framework/common/framework_types_internal.h"
#include "api/gelib/gelib.h"
namespace ge {
namespace {
const size_t kGenMaskInputIndex = 1;
const size_t kDefaultMaxParallelNum = 1;
const std::set<std::string> kDropOutDoMaskTypes = {
DROPOUTDOMASK, DROPOUTDOMASKV3, DROPOUTDOMASKV3D, SOFTMAXV2WITHDROPOUTDOMASKV3D,
AXPYWITHSOFTMAXANDDROPOUTDOMASK, ATTENTIONSCORE, ATTENTIONSCOREGRAD
};
const std::set<std::string> kDropOutGenMaskTypes = {DROPOUTGENMASK, DROPOUTGENMASKV3};
}
bool LinkGenMaskNodesPass::IsExpectedType(const NodePtr &node, const std::set<std::string> &expected_types) const {
if (expected_types.count(node->GetType()) > 0U) {
return true;
}
std::vector<std::string> original_types;
const auto &op_desc = node->GetOpDesc();
if ((op_desc == nullptr) ||
(!ge::AttrUtils::GetListStr(op_desc, ATTR_NAME_DATA_DUMP_ORIGIN_OP_TYPES, original_types))) {
return false;
}
for (const auto &original_type : original_types) {
if (expected_types.count(original_type) > 0U) {
return true;
}
}
return false;
}
LinkGenMaskNodesPass::LinkGenMaskNodesPass(const std::map<std::string, int32_t> &stream_max_parallel_num)
: GraphPass(), stream_max_parallel_num_(stream_max_parallel_num) {}
Status LinkGenMaskNodesPass::Run(ComputeGraphPtr graph) {
GE_CHECK_NOTNULL(graph);
std::vector<NodePtr> gen_mask_nodes;
GetAllGenMaskNodes(graph, gen_mask_nodes);
size_t gen_mask_group_size = gen_mask_nodes.size();
Status status = GetGenMaskGroupSize(gen_mask_nodes, gen_mask_group_size);
if (status != SUCCESS) {
GELOGE(FAILED, "[Get][GenMaskGroupSize] failed.");
return FAILED;
}
if (gen_mask_group_size < 1) {
gen_mask_group_size = 1;
}
for (size_t index = 1; index < gen_mask_nodes.size(); ++index) {
if (index % gen_mask_group_size == 0) {
GELOGI("skiped index: %zu.", index);
continue;
}
NodePtr &src_node = gen_mask_nodes[index - 1];
auto src_anchor = src_node->GetOutControlAnchor();
GE_CHECK_NOTNULL(src_anchor);
NodePtr &dest_node = gen_mask_nodes[index];
auto dest_anchor = dest_node->GetInControlAnchor();
GE_CHECK_NOTNULL(dest_anchor);
graphStatus status_link_to = src_anchor->LinkTo(dest_anchor);
if (status_link_to != GRAPH_SUCCESS) {
REPORT_INNER_ERR_MSG("E19999", "Op:%s(%s) link control to op:%s(%s) failed",
src_node->GetName().c_str(), src_node->GetType().c_str(),
dest_node->GetName().c_str(), dest_node->GetType().c_str());
GELOGE(FAILED, "[Add][Edge] Op:%s(%s) link control to op:%s(%s) failed",
src_node->GetName().c_str(), src_node->GetType().c_str(),
dest_node->GetName().c_str(), dest_node->GetType().c_str());
return FAILED;
}
GELOGD("Link from %s to %s.", src_node->GetName().c_str(), dest_node->GetName().c_str());
}
return SUCCESS;
}
bool LinkGenMaskNodesPass::AreAllInputsConst(const NodePtr &node) const {
for (const NodePtr &in_node : node->GetInDataNodes()) {
std::string op_type = NodeUtils::GetInConstNodeTypeCrossSubgraph(in_node);
if ((op_type != CONSTANT) && (op_type != CONSTANTOP)) {
return false;
}
}
return true;
}
void LinkGenMaskNodesPass::GetAllGenMaskNodes(ComputeGraphPtr graph, std::vector<NodePtr> &gen_mask_nodes) const {
std::set<NodePtr> nodes_set;
for (const NodePtr &node : graph->GetDirectNode()) {
if (!IsExpectedType(node, kDropOutDoMaskTypes)) {
continue;
}
if ((node->GetOpDesc() == nullptr) || (node->GetOpDesc()->HasAttr(ATTR_NAME_STREAM_LABEL))) {
continue;
}
auto in_data_nodes = node->GetInDataNodes();
if (in_data_nodes.size() > kGenMaskInputIndex) {
NodePtr &gen_mask = in_data_nodes.at(kGenMaskInputIndex);
for (auto &in_data_node : in_data_nodes) {
if (IsExpectedType(in_data_node, kDropOutGenMaskTypes)) {
gen_mask = in_data_node;
GELOGD("The fused node type [%s], paired with the input node name [%s].",
node->GetType().c_str(), gen_mask->GetName().c_str());
break;
}
}
if ((gen_mask->GetOpDesc() == nullptr) || (gen_mask->GetOpDesc()->HasAttr(ATTR_NAME_STREAM_LABEL))) {
continue;
}
if (AreAllInputsConst(gen_mask) && nodes_set.count(gen_mask) == 0) {
gen_mask_nodes.emplace_back(gen_mask);
nodes_set.emplace(gen_mask);
}
}
}
}
Status LinkGenMaskNodesPass::GetGenMaskGroupSize(std::vector<NodePtr> &gen_mask_nodes,
size_t &gen_mask_group_size) const {
if (gen_mask_nodes.empty()) {
return SUCCESS;
}
NodePtr gen_mask_node = gen_mask_nodes.front();
GE_CHECK_NOTNULL(gen_mask_node);
OpDescPtr gen_mask_op = gen_mask_node->GetOpDesc();
GE_CHECK_NOTNULL(gen_mask_op);
auto ge_lib = GELib::GetInstance();
if ((ge_lib != nullptr) && ge_lib->InitFlag()) {
(void)ge_lib->DNNEngineManagerObj().GetDNNEngineName(gen_mask_node);
}
size_t gen_mask_group_num = kDefaultMaxParallelNum;
std::string engine_name = gen_mask_op->GetOpEngineName();
auto iter = stream_max_parallel_num_.find(engine_name);
if (iter != stream_max_parallel_num_.end()) {
gen_mask_group_num = static_cast<size_t>(iter->second);
}
GELOGI("gen_mask_group_num: %zu.", gen_mask_group_num);
if (gen_mask_group_num > 0) {
gen_mask_group_size = (gen_mask_nodes.size() + 1) / gen_mask_group_num;
}
GELOGI("gen_mask_group_size: %zu.", gen_mask_group_size);
return SUCCESS;
}
REG_PASS_OPTION("LinkGenMaskNodesPass").LEVELS(OoLevel::kO3);
}