* 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/variable_optimize/variable_prepare_op_pass.h"
#include <map>
#include <memory>
#include <string>
#include "common/plugin/ge_make_unique_util.h"
#include "common/checker.h"
#include "graph/graph.h"
#include "framework/common/debug/ge_log.h"
#include "common/omg_util/omg_util.h"
#include "graph/debug/ge_attr_define.h"
#include "graph/node.h"
#include "graph/utils/tensor_utils.h"
#include "graph/utils/node_utils.h"
#include "graph/utils/op_desc_utils.h"
#include "graph/utils/op_type_utils.h"
namespace ge {
std::map<std::string, std::map<int32_t, std::vector<int32_t>>> VariablePrepareOpPass::ref_node_without_prototype_map_ {
{REFSWITCH, {{0, {0, 1}}}}
};
Status VariablePrepareOpPass::Run(ComputeGraphPtr graph) {
GE_CHECK_NOTNULL(graph);
for (const auto &node : graph->GetDirectNode()) {
const auto iter = ref_input_output_map_.find(node->GetType());
if (iter == ref_input_output_map_.end()) {
GenerateRefTypeAndInputOutputMap(node);
}
}
if (ref_input_output_map_.empty()) {
GELOGI("No need to add variable_ref.");
return SUCCESS;
}
for (auto &node : graph->GetDirectNode()) {
GE_IF_BOOL_EXEC(node->GetOpDesc() == nullptr, continue);
if (OpTypeUtils::IsVarLikeNode(node->GetOpDesc()->GetType())) {
Status ret = DealVariableNode(node);
if (ret != SUCCESS) {
GELOGE(ret, "[Deal][VariableNode] failed, node:%s(%s)", node->GetName().c_str(), node->GetType().c_str());
return FAILED;
}
}
}
return SUCCESS;
}
Status VariablePrepareOpPass::DealVariableNode(NodePtr &var_node) {
GE_CHECK_NOTNULL(var_node);
for (auto &dst_node_and_inanchor : var_node->GetOutDataNodesAndAnchors()) {
NodePtr dst_node = dst_node_and_inanchor.first;
GE_CHECK_NOTNULL(dst_node);
InDataAnchorPtr dst_in_data_anchor = dst_node_and_inanchor.second;
GE_CHECK_NOTNULL(dst_in_data_anchor);
auto input_index = dst_in_data_anchor->GetIdx();
std::vector<int32_t> ref_output_indexes;
GetWritableNodeOutIndex(dst_node, input_index, ref_output_indexes);
if (!ref_output_indexes.empty()) {
for (auto output_index : ref_output_indexes) {
Status ret = DealWritableNode(dst_node, input_index, output_index, var_node);
if (ret != SUCCESS) {
GELOGE(FAILED, "[Deal][WritableNode] [%s] failed, input index:%d, output index:%d var:%s.",
dst_node->GetName().c_str(), output_index, input_index, var_node->GetName().c_str());
return FAILED;
}
}
}
}
return SUCCESS;
}
中文翻译:
找到最后一个ref node
如果ref input有对应的ref输出,在后面加个var ref
如果ref input没有对应ref输出,插入refIdentity和一个var ref在前面
如果
*/
Status VariablePrepareOpPass::DealWritableNode(const NodePtr &writable_node, int32_t input_index, int32_t output_index,
const NodePtr &var_node) {
std::stack<std::pair<NodePtr, std::pair<int32_t, int32_t>>> nodes_to_check;
nodes_to_check.push({writable_node, {input_index, output_index}});
while (!nodes_to_check.empty()) {
auto node_index = nodes_to_check.top();
nodes_to_check.pop();
auto cur_node = node_index.first;
int32_t cur_input_index = node_index.second.first;
int32_t cur_output_index = node_index.second.second;
const auto nodes_size = nodes_to_check.size();
CHECK_FALSE_EXEC(GetPeerNodeOfRefOutput(cur_node, cur_output_index, nodes_to_check) == SUCCESS,
GELOGE(FAILED, "[Get][PeerNode] Of Ref Output for node[%s] failed, output index:%d.",
cur_node->GetName().c_str(), cur_output_index);
return FAILED);
if (nodes_size == nodes_to_check.size()) {
const auto &op_desc = cur_node->GetOpDesc();
GE_CHECK_NOTNULL(op_desc);
if (op_desc->GetType() == FRAMEWORKOP) {
GELOGD("No need to add variable_ref for frameworkop");
continue;
}
if (static_cast<uint32_t>(cur_output_index) < op_desc->GetOutputsSize()) {
CHECK_FALSE_EXEC(AddVariableRef(cur_node, var_node, cur_output_index) == SUCCESS,
GELOGE(FAILED, "[Add][VariableRef] for node:%s failed, output index:%d var:%s",
cur_node->GetName().c_str(), cur_output_index, var_node->GetName().c_str());
return FAILED);
} else {
CHECK_FALSE_EXEC(InsertVariableRef(cur_node, cur_input_index, var_node) == SUCCESS,
GELOGE(FAILED, "[Insert][VariableRef] and ref identity failed, node:%s, in index:%d, var:%s",
cur_node->GetName().c_str(), cur_input_index, var_node->GetName().c_str());
return FAILED);
}
continue;
}
if (HasControlOut(cur_node)) {
CHECK_FALSE_EXEC(AddVariableRef(cur_node, var_node, cur_output_index) == SUCCESS,
GELOGE(FAILED, "[Add][VariableRef] for node:%s failed, var:%s output index:%d",
cur_node->GetName().c_str(), var_node->GetName().c_str(), cur_output_index);
return FAILED);
}
}
return SUCCESS;
}
Status VariablePrepareOpPass::GetPeerNodeOfRefOutput(const NodePtr &node, int32_t output_index,
std::stack<std::pair<NodePtr, std::pair<int32_t, int32_t>>> &nodes) {
if (output_index < 0) {
REPORT_INNER_ERR_MSG("E19999", "Param output_index:%d < 0, check invalid", output_index);
GELOGE(PARAM_INVALID, "[Check][Param] Invalid ref output index: %s-%d.", node->GetName().c_str(), output_index);
return PARAM_INVALID;
}
const auto &op_desc = node->GetOpDesc();
GE_CHECK_NOTNULL(op_desc);
if (static_cast<uint32_t>(output_index) == op_desc->GetOutputsSize()) {
return SUCCESS;
}
if (output_index >= static_cast<int32_t>(node->GetAllOutDataAnchorsSize())) {
GELOGW("Cannot get %d th output anchor of %s", output_index, node->GetName().c_str());
return SUCCESS;
}
const auto &out_anchor = node->GetOutDataAnchor(output_index);
GE_CHECK_NOTNULL(out_anchor);
for (const auto &peer_in_anchor : out_anchor->GetPeerInDataAnchors()) {
auto peer_node = peer_in_anchor->GetOwnerNode();
if (peer_node == nullptr) {
continue;
}
const int32_t peer_in_index = peer_in_anchor->GetIdx();
std::vector<int32_t> ref_output_indexes;
GetWritableNodeOutIndex(peer_node, peer_in_index, ref_output_indexes);
for (auto ref_output_index : ref_output_indexes) {
nodes.push({peer_node, {peer_in_index, ref_output_index}});
}
}
return SUCCESS;
}
Status VariablePrepareOpPass::AddVariableRef(NodePtr &final_writable_node, const NodePtr &var_node,
int32_t index) const {
GE_CHECK_NOTNULL(final_writable_node);
GE_CHECK_NOTNULL(var_node);
if (index >= static_cast<int32_t>(final_writable_node->GetAllOutDataAnchorsSize())) {
GELOGW("Cannot get %d th output anchor of %s", index, final_writable_node->GetName().c_str());
return SUCCESS;
}
OutDataAnchorPtr out_anchor = final_writable_node->GetOutDataAnchor(index);
GE_CHECK_NOTNULL(out_anchor);
for (const auto peer_anchor : out_anchor->GetPeerAnchorsPtr()) {
NodePtr peer_node = peer_anchor->GetOwnerNode();
OpDescPtr peer_opdesc = peer_node->GetOpDesc();
GE_CHECK_NOTNULL(peer_opdesc);
std::string src_var_name;
(void)ge::AttrUtils::GetStr(peer_opdesc, REF_VAR_SRC_VAR_NAME, src_var_name);
if (OpTypeUtils::IsVarLikeNode(peer_node->GetType()) && var_node->GetName() == src_var_name) {
GELOGI("The corresponding variable_ref has been added to this connection.");
return SUCCESS;
}
}
std::stringstream variable_ref_name;
variable_ref_name << "_TO_" << final_writable_node->GetName() << "_REF_" << index;
NodePtr variable_ref_node = CreateVariableRef(var_node->GetName() + variable_ref_name.str(), var_node);
GE_CHECK_NOTNULL(variable_ref_node);
Status ret_check = CheckStreamLabel(variable_ref_node, final_writable_node);
if (ret_check != SUCCESS) {
GELOGE(FAILED, "[Check][StreamLabel] failed, var ref node:%s, writable node:%s",
variable_ref_node->GetName().c_str(), final_writable_node->GetName().c_str());
return FAILED;
}
GELOGI("Add variable_ref between [%s] and [%s]", var_node->GetName().c_str(), variable_ref_node->GetName().c_str());
CHECK_FALSE_EXEC(AddControlEdge(final_writable_node, variable_ref_node) == SUCCESS,
GELOGE(FAILED, "[Add][ControlEdge] between variable ref node:%s and final peer node:%s failed",
var_node->GetName().c_str(), variable_ref_node->GetName().c_str());
return FAILED);
graphStatus ret = ge::GraphUtils::AddEdge(out_anchor, variable_ref_node->GetInDataAnchor(0));
if (ret != GRAPH_SUCCESS) {
REPORT_INNER_ERR_MSG("E19999",
"add edge between variable_ref:%s(index:0) and final_writable peer node:%s(index:%d) failed",
variable_ref_node->GetName().c_str(), final_writable_node->GetName().c_str(), index);
GELOGE(FAILED, "[Add][Edge] between variable_ref:%s(index:0) and final_writable peer node:%s(index:%d) failed",
variable_ref_node->GetName().c_str(), final_writable_node->GetName().c_str(), index);
return FAILED;
}
return SUCCESS;
}
Status VariablePrepareOpPass::InsertVariableRef(ge::NodePtr &node, int32_t in_index,
const ge::NodePtr &var_node) const {
GE_CHECK_NOTNULL(node);
GE_CHECK_NOTNULL(var_node);
const auto in_anchor = node->GetInDataAnchor(in_index);
GE_CHECK_NOTNULL(in_anchor);
auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
GE_CHECK_NOTNULL(peer_out_anchor);
auto peer_in_node = peer_out_anchor->GetOwnerNode();
GE_CHECK_NOTNULL(peer_in_node);
std::stringstream ref_identity_name;
ref_identity_name << "RefIdentity_" << peer_in_node->GetName() << "_" << peer_out_anchor->GetIdx() << "_TO_"
<< node->GetName() << "_" << in_index;
NodePtr ref_identity_node = CreateRefIdentity(ref_identity_name.str(), node, static_cast<uint32_t>(in_index));
GE_CHECK_NOTNULL(ref_identity_node);
std::stringstream variable_ref_name;
variable_ref_name << "_TO_" << node->GetName() << "_REF_" << in_index;
NodePtr variable_ref_node = CreateVariableRef(var_node->GetName() + variable_ref_name.str(), var_node);
GE_CHECK_NOTNULL(variable_ref_node);
Status ret_check = CheckStreamLabel(variable_ref_node, node);
if (ret_check != SUCCESS) {
GELOGE(FAILED, "[Check][StreamLabel] failed, ref node:%s, writable node:%s",
variable_ref_node->GetName().c_str(), node->GetName().c_str());
return FAILED;
}
GELOGI("Insert variable_ref of [%s] between [%s] and [%s]", var_node->GetName().c_str(),
peer_in_node->GetName().c_str(), node->GetName().c_str());
CHECK_FALSE_EXEC(AddControlEdge(node, variable_ref_node) == SUCCESS,
GELOGE(FAILED, "[Add][ControlEdge] between variable ref node:%s and ref node:%s failed",
variable_ref_node->GetName().c_str(), node->GetName().c_str());
return FAILED);
CHECK_FALSE_EXEC(ge::GraphUtils::RemoveEdge(peer_out_anchor, in_anchor) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999", "remove edge between ref node:%s and its peer node:%s failed",
node->GetName().c_str(), peer_in_node->GetName().c_str());
GELOGE(FAILED, "[Remove][Edge] between ref node:%s and its peer node:%s failed",
node->GetName().c_str(), peer_in_node->GetName().c_str());
return FAILED);
CHECK_FALSE_EXEC(ge::GraphUtils::AddEdge(peer_out_anchor, ref_identity_node->GetInDataAnchor(0)) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999", "Add edge between pre node:%s and ref_identity:%s failed",
peer_in_node->GetName().c_str(), ref_identity_node->GetName().c_str());
GELOGE(FAILED, "[Add][Edge] between pre node:%s and ref_identity:%s failed",
peer_in_node->GetName().c_str(), ref_identity_node->GetName().c_str());
return FAILED);
CHECK_FALSE_EXEC(ge::GraphUtils::AddEdge(ref_identity_node->GetOutDataAnchor(0), in_anchor) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999", "Add edge between ref_identity:%s and ref node:%s failed",
ref_identity_node->GetName().c_str(), node->GetName().c_str());
GELOGE(FAILED, "[Add][Edge] between ref_identity:%s and ref node:%s failed",
ref_identity_node->GetName().c_str(), node->GetName().c_str());
return FAILED);
CHECK_FALSE_EXEC(ge::GraphUtils::AddEdge(ref_identity_node->GetOutDataAnchor(0),
variable_ref_node->GetInDataAnchor(0)) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999", "Add edge between ref_identity:%s and variable_ref:%s failed",
ref_identity_node->GetName().c_str(), variable_ref_node->GetName().c_str());
GELOGE(FAILED, "[Add][Edge] between ref_identity:%s and variable_ref:%s failed",
ref_identity_node->GetName().c_str(), variable_ref_node->GetName().c_str());
return FAILED);
CHECK_FALSE_EXEC(ge::GraphUtils::AddEdge(node->GetOutControlAnchor(),
variable_ref_node->GetInControlAnchor()) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999", "Add control edge between ref node:%s and variable_ref:%s failed",
node->GetName().c_str(), variable_ref_node->GetName().c_str());
GELOGE(FAILED, "[Add][ControlEdge] between ref node:%s and variable_ref:%s failed",
node->GetName().c_str(), variable_ref_node->GetName().c_str());
return FAILED);
return SUCCESS;
}
Status VariablePrepareOpPass::InsertIdentityNode(const NodePtr &src_node, const AnchorPtr &out_anchor,
const NodePtr &peer_node, const AnchorPtr &peer_in_anchor,
NodePtr &identity_node) const {
GE_CHECK_NOTNULL(src_node);
GE_CHECK_NOTNULL(out_anchor);
GE_CHECK_NOTNULL(peer_node);
GE_CHECK_NOTNULL(peer_in_anchor);
std::stringstream identity_name;
identity_name << IDENTITY << "_" << src_node->GetName() << "_TO_" << peer_node->GetName() << "_"
<< peer_in_anchor->GetIdx();
OpDescBuilder op_desc_builder(identity_name.str(), IDENTITY);
GE_CHECK_NOTNULL(src_node->GetOpDesc());
auto data_desc = src_node->GetOpDesc()->GetOutputDesc(out_anchor->GetIdx());
auto identity_op_desc = op_desc_builder.AddInput("x", data_desc)
.AddOutput("y", data_desc)
.Build();
GE_ASSERT_NOTNULL(identity_op_desc);
auto graph = src_node->GetOwnerComputeGraph();
GE_CHECK_NOTNULL(graph);
identity_node = graph->InsertNode(src_node, identity_op_desc);
GE_CHECK_NOTNULL(identity_node);
if (ge::GraphUtils::InsertNodeBetweenDataAnchors(Anchor::DynamicAnchorCast<OutDataAnchor>(out_anchor),
Anchor::DynamicAnchorCast<InDataAnchor>(peer_in_anchor),
identity_node) != GRAPH_SUCCESS) {
REPORT_INNER_ERR_MSG("E19999", "add data edge for %s failed", identity_op_desc->GetName().c_str());
GELOGE(FAILED, "[Insert][Identity] add data edge for %s failed", identity_op_desc->GetName().c_str());
return FAILED;
}
return SUCCESS;
}
Status VariablePrepareOpPass::AddControlEdge(const ge::NodePtr &node, const ge::NodePtr &variable_ref_node) const {
auto out_anchors = node->GetAllOutAnchors();
for (auto &out_anchor : out_anchors) {
GE_CHECK_NOTNULL(out_anchor);
for (auto &peer_in_anchor : out_anchor->GetPeerAnchors()) {
GE_CHECK_NOTNULL(peer_in_anchor);
NodePtr peer_node = peer_in_anchor->GetOwnerNode();
GE_CHECK_NOTNULL(peer_node);
std::string ori_type;
if (GetOriginalType(peer_node, ori_type) != SUCCESS) {
GELOGE(FAILED, "[Get][OriginalType] failed.");
return FAILED;
}
if (kMergeOpTypes.count(ori_type) > 0U) {
NodePtr identity_node = nullptr;
if (InsertIdentityNode(node, out_anchor, peer_node, peer_in_anchor, identity_node) != SUCCESS) {
GELOGE(FAILED, "[Insert][Identity] between node:%s and it's peer node:%s failed",
node->GetName().c_str(), peer_node->GetName().c_str());
return FAILED;
}
if (ge::GraphUtils::AddEdge(variable_ref_node->GetOutControlAnchor(),
identity_node->GetInControlAnchor()) != SUCCESS) {
REPORT_INNER_ERR_MSG("E19999", "Add control edge between variable_ref:%s and identity node:%s failed",
variable_ref_node->GetName().c_str(), identity_node->GetName().c_str());
GELOGE(FAILED, "[Add][ControlEdge] between variable_ref:%s and identity node:%s failed",
variable_ref_node->GetName().c_str(), identity_node->GetName().c_str());
return FAILED;
}
continue;
}
CHECK_FALSE_EXEC(ge::GraphUtils::AddEdge(variable_ref_node->GetOutControlAnchor(),
peer_node->GetInControlAnchor()) == SUCCESS,
REPORT_INNER_ERR_MSG("E19999",
"Add control edge between variable_ref:%s and ref node's peer node:%s failed",
variable_ref_node->GetName().c_str(), peer_node->GetName().c_str());
GELOGE(FAILED, "[Add][ControlEdge] between variable_ref:%s and ref node's peer node:%s failed",
variable_ref_node->GetName().c_str(), peer_node->GetName().c_str());
return FAILED);
}
}
return SUCCESS;
}
ge::NodePtr VariablePrepareOpPass::CreateRefIdentity(const std::string &ref_identity_name, const ge::NodePtr &node,
uint32_t input_index) const {
OpDescPtr op_desc = node->GetOpDesc();
if (op_desc == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "opdesc of param node is nullptr, check invalid");
GELOGE(FAILED, "[Get][OpDesc] failed, opdesc of param node is nullptr");
return nullptr;
}
OpDescPtr ref_identity_op_desc = MakeShared<OpDesc>(ref_identity_name.c_str(), REFIDENTITY);
if (ref_identity_op_desc == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "New OpDesc failed.");
GELOGE(FAILED, "[New][OpDesc] failed");
return nullptr;
}
GE_IF_BOOL_EXEC(ref_identity_op_desc->AddOutputDesc(op_desc->GetInputDesc(input_index)) != SUCCESS,
GELOGW("add output desc edge failed");
return nullptr);
GE_IF_BOOL_EXEC(ref_identity_op_desc->AddInputDesc(op_desc->GetInputDesc(input_index)) != SUCCESS,
GELOGW("add input desc edge failed");
return nullptr);
NodePtr ref_identity_node = node->GetOwnerComputeGraph()->AddNode(ref_identity_op_desc);
GE_IF_BOOL_EXEC(ref_identity_node == nullptr, GELOGW("ref_identity_node is null"); return nullptr);
GELOGI("Successfully created node[%s]", ref_identity_node->GetNamePtr());
return ref_identity_node;
}
ge::NodePtr VariablePrepareOpPass::CreateVariableRef(const std::string &variable_ref_name,
const ge::NodePtr &var_node) const {
OpDescPtr var_op_desc = var_node->GetOpDesc();
if (var_op_desc == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "param var_node's opdesc is nullptr, check invalid");
GELOGE(FAILED, "[Get][OpDesc] failed, var opdesc is nullptr");
return nullptr;
}
OpDescPtr var_ref_op_desc = MakeShared<OpDesc>(variable_ref_name.c_str(), var_op_desc->GetType());
if (var_ref_op_desc == nullptr) {
REPORT_INNER_ERR_MSG("E19999", "New OpDesc failed");
GELOGE(FAILED, "New OpDesc failed");
return nullptr;
}
GE_IF_BOOL_EXEC(var_ref_op_desc->AddOutputDesc(var_op_desc->GetOutputDesc(0)) != SUCCESS,
GELOGW("add output desc edge failed");
return nullptr);
GE_IF_BOOL_EXEC(var_ref_op_desc->AddInputDesc(var_op_desc->GetOutputDesc(0)) != SUCCESS,
GELOGW("add input desc edge failed");
return nullptr);
NodePtr variable_ref_node = var_node->GetOwnerComputeGraph()->AddNode(var_ref_op_desc);
GE_IF_BOOL_EXEC(variable_ref_node == nullptr, GELOGW("variable_ref_node is null"); return nullptr);
bool is_set_str = ge::AttrUtils::SetStr(var_ref_op_desc, REF_VAR_SRC_VAR_NAME, var_op_desc->GetName());
if (is_set_str) {
GELOGD("Set node [%s] REF_VAR_SRC_VAR_NAME [%s]", variable_ref_node->GetName().c_str(),
var_op_desc->GetName().c_str());
}
return variable_ref_node;
}
void VariablePrepareOpPass::GetWritableNodeOutIndex(const NodePtr &node, int32_t input_index,
std::vector<int32_t> &output_indexes) {
if (node == nullptr) {
return;
}
GELOGD("get writable node and input index %s:%d", node->GetName().c_str(), input_index);
auto node_type = node->GetType();
if (node_type == FRAMEWORKOP) {
std::string original_type;
GE_IF_BOOL_EXEC(GetOriginalType(node, original_type) != SUCCESS, GELOGW("Get node original type fail"));
GELOGD("find frameworkop: [%s], original type is %s", node->GetName().c_str(), original_type.c_str());
FindRefOutIndex(original_type, input_index, ref_node_without_prototype_map_, output_indexes);
return;
}
FindRefOutIndex(node_type, input_index, ref_input_output_map_, output_indexes);
return;
}
* 找到输入ref有两种方式
* 1、输入和输出有相同的name,表示ref关系
* 2、GetRefPortIndex。记这个干啥
* 疑问:满足1的情况下,在2里查能查到吗
*/
void VariablePrepareOpPass::GenerateRefTypeAndInputOutputMap(const NodePtr &node) {
auto op_desc = node->GetOpDesc();
if (op_desc == nullptr) {
GELOGW("op_desc in null, please check node:[%s]", node->GetName().c_str());
return;
}
for (const auto &name_index : op_desc->GetAllInputName()) {
const int32_t out_index = op_desc->GetOutputIndexByName(name_index.first);
if (out_index != -1) {
ref_input_output_map_[node->GetType()][name_index.second] = {out_index};
continue;
}
const auto &input_desc = op_desc->GetInputDesc(name_index.second);
if (!input_desc.GetRefPortIndex().empty()) {
ref_input_output_map_[node->GetType()][name_index.second] = {static_cast<int32_t>(op_desc->GetOutputsSize())};
}
}
}
void VariablePrepareOpPass::FindRefOutIndex(const std::string &node_type, int32_t input_index,
const std::map<std::string, std::map<int32_t, std::vector<int32_t>>> &ref_map,
std::vector<int32_t> &output_indexes) const {
auto node_iter = ref_map.find(node_type);
if (node_iter == ref_map.end()) {
return;
}
auto index_iter = node_iter->second.find(input_index);
if (index_iter == node_iter->second.end()) {
return;
}
for (const auto &out_index : index_iter->second) {
output_indexes.emplace_back(out_index);
}
}
Status VariablePrepareOpPass::CheckStreamLabel(const ge::NodePtr &var_ref_node,
const ge::NodePtr &final_writable_node) const {
OpDescPtr writable_desc = final_writable_node->GetOpDesc();
GE_CHECK_NOTNULL(writable_desc);
std::string stream_label;
(void)AttrUtils::GetStr(writable_desc, ATTR_NAME_STREAM_LABEL, stream_label);
if (!stream_label.empty()) {
GE_CHK_STATUS_RET(SetStreamLabel(var_ref_node, stream_label),
"[Set][StreamLabel] %s failed", stream_label.c_str());
}
return SUCCESS;
}
bool VariablePrepareOpPass::HasControlOut(const ge::NodePtr &node) const {
const auto &out_control_anchor = node->GetOutControlAnchor();
for (const auto &peer_in_control_anchor : out_control_anchor->GetPeerInControlAnchors()) {
if (peer_in_control_anchor == nullptr || peer_in_control_anchor->GetOwnerNode() == nullptr) {
continue;
}
return true;
}
return false;
}
REG_PASS_OPTION("VariablePrepareOpPass").LEVELS(OoLevel::kO3);
}