You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
graphengine/ge/graph/passes/var_is_initialized_op_pass.cc

312 lines
10 KiB

/**
* Copyright 2020 Huawei Technologies Co., Ltd
*
* 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 "graph/passes/var_is_initialized_op_pass.h"
#include <memory>
#include <utility>
#include "framework/common/debug/ge_log.h"
#include "common/ge/ge_util.h"
#include "graph/anchor.h"
#include "graph/debug/ge_attr_define.h"
#include "graph/manager/graph_var_manager.h"
#include "graph/node.h"
#include "graph/utils/graph_utils.h"
#include "graph/utils/node_utils.h"
namespace ge {
namespace {
const int kAssignVarRefIndex = 0;
const int kVarIsInitializedIOCnt = 1;
const int kVarIsInitVarInputIndex = 0;
} // namespace
Status VarIsInitializedOpPass::Run(NodePtr &node) {
GE_CHECK_NOTNULL(node);
auto ret = UpdateInitedVars(node);
if (ret != SUCCESS) {
GELOGE(ret, "Failed to run var is init pass on node %s", node->GetName().c_str());
return ret;
}
if (node->GetType() != VARISINITIALIZEDOP) {
return SUCCESS;
}
bool inited = false;
if (CheckSrcNode(node, inited) != SUCCESS) {
return FAILED;
}
GELOGI("The variable inited status %s on node %s",
inited ? "true" : "false", node->GetName().c_str());
ret = ChangeNodeToConstant(node, inited);
GELOGI("Change VarIsInitializedOp %s to be Constant %s end.",
node->GetName().c_str(), inited ? "true" : "false");
return ret;
}
Status VarIsInitializedOpPass::CheckSrcNode(const NodePtr &node, bool &inited) const {
GE_CHECK_NOTNULL(node);
auto input_nodes = node->GetInDataNodes();
if (input_nodes.size() != kVarIsInitializedIOCnt) {
GELOGE(FAILED,
"[%s] Node input data nodes size [%zu] is not equal 1.",
node->GetName().c_str(),
input_nodes.size());
return FAILED;
}
auto &input_node = input_nodes.at(kVarIsInitVarInputIndex);
GE_CHECK_NOTNULL(input_node);
auto input_node_name = input_node->GetName();
auto input_node_type = input_node->GetType();
if (input_node_type != VARIABLE) {
GELOGE(FAILED, "[%s] Src node %s is not Variable, is %s.", node->GetName().c_str(), input_node_name.c_str(),
input_node_type.c_str());
return FAILED;
}
// initialized and initialized check graph must not be in the same graph
ComputeGraphPtr compute_graph = node->GetOwnerComputeGraph();
auto session_id = compute_graph->GetSessionID();
if (VarManager::Instance(session_id)->IsVarExist(input_node_name)) {
inited = true;
return SUCCESS;
}
GE_CHECK_NOTNULL(input_node->GetOpDesc());
inited = IsVarInitedOnTheGraphAndNode(node, input_node->GetOpDesc()->GetId());
return SUCCESS;
}
Status VarIsInitializedOpPass::CreateConstant(NodePtr &node, OpDescPtr &op_desc, bool inited) {
GE_CHECK_NOTNULL(node);
// 1. create Constant OpDesc
op_desc = MakeShared<OpDesc>(node->GetName().c_str(), CONSTANT);
if (op_desc == nullptr) {
GELOGE(FAILED, "[%s] Make shared of Constant op desc failed.", node->GetName().c_str());
return FAILED;
}
// 2. get OpDesc of VarIsInitializedOp
OpDescPtr original_op_desc = node->GetOpDesc();
if (original_op_desc == nullptr) {
GELOGE(FAILED, "[%s] Op desc must not be null.", node->GetName().c_str());
return FAILED;
}
GeTensorDesc original_desc = original_op_desc->GetOutputDesc(0);
// 3. create attr value of Constant, is a tensor
bool val = inited;
GeTensorPtr const_tensor_ptr = MakeShared<GeTensor>(original_desc, reinterpret_cast<uint8_t *>(&val), sizeof(bool));
if (const_tensor_ptr == nullptr) {
GELOGE(FAILED, "[%s] Make shared of Constant tensor failed.", node->GetName().c_str());
return FAILED;
}
if (!AttrUtils::SetTensor(op_desc, ATTR_NAME_WEIGHTS, const_tensor_ptr)) {
GELOGE(INTERNAL_ERROR, "get ATTR_NAME_WEIGHTS failed");
return FAILED;
}
// 4. set Constant output desc
GE_CHK_STATUS_RET(op_desc->AddOutputDesc(original_desc), "add out put desc failed");
return SUCCESS;
}
Status VarIsInitializedOpPass::ProcessInAnchor(NodePtr &node, NodePtr &new_node) {
GE_CHECK_NOTNULL(node);
GE_CHECK_NOTNULL(new_node);
auto in_anchors = node->GetAllInDataAnchors();
auto out_anchors = node->GetAllOutDataAnchors();
if ((in_anchors.size() != kVarIsInitializedIOCnt) ||
(out_anchors.size() != kVarIsInitializedIOCnt)) {
GELOGE(FAILED,
"[%s] Node input/output data anchors"
" size [%lu][%lu] is not all equal 1.",
node->GetName().c_str(), in_anchors.size(), out_anchors.size());
return FAILED;
}
// 1. delete in data anchor of VarIsInitializedOp node
auto &in_anchor = in_anchors.at(kVarIsInitVarInputIndex);
GE_CHECK_NOTNULL(in_anchor);
auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
GE_CHECK_NOTNULL(peer_out_anchor);
if (GraphUtils::RemoveEdge(in_anchor, peer_out_anchor) != GRAPH_SUCCESS) {
GELOGE(FAILED, "[%s] Remove in data edge failed.", node->GetName().c_str());
return FAILED;
}
auto src_node = peer_out_anchor->GetOwnerNode();
if (GraphUtils::AddEdge(src_node->GetOutControlAnchor(), new_node->GetInControlAnchor()) != GRAPH_SUCCESS) {
GELOGE(FAILED, "Failed to link control edges from var %s to new const %s",
src_node->GetName().c_str(), new_node->GetName().c_str());
return FAILED;
}
if (GraphUtils::MoveInCtrlEdges(node, new_node) != GRAPH_SUCCESS) {
GELOGE(FAILED, "Failed to move in ctrl edges from %s to new const", node->GetName().c_str());
return FAILED;
}
if (GraphUtils::MoveOutCtrlEdges(node, new_node) != GRAPH_SUCCESS) {
GELOGE(FAILED, "Failed to move out ctrl edges from %s to new const", node->GetName().c_str());
return FAILED;
}
return SUCCESS;
}
Status VarIsInitializedOpPass::ChangeNodeToConstant(NodePtr &node, bool inited) {
GE_CHECK_NOTNULL(node);
ComputeGraphPtr graph = node->GetOwnerComputeGraph();
OpDescPtr constant_op_desc = nullptr;
if (CreateConstant(node, constant_op_desc, inited) != SUCCESS) {
return FAILED;
}
NodePtr const_node = graph->AddNodeFront(constant_op_desc);
if (const_node == nullptr) {
return FAILED;
}
if (ProcessInAnchor(node, const_node) != SUCCESS) {
return FAILED;
}
if (NodeUtils::MoveOutputEdges(node, const_node) != GRAPH_SUCCESS) {
GELOGE(FAILED, "[%s] Move output edges to new node failed.", node->GetName().c_str());
return FAILED;
}
if (GraphUtils::RemoveNodeWithoutRelink(graph, node) != SUCCESS) {
GELOGE(FAILED, "[%s] RemoveNodeWithoutRelink failed.", node->GetName().c_str());
return FAILED;
}
AddRePassNodesWithInOut(const_node);
// delete VarIsInitializedOp node from the graph
AddNodeDeleted(node);
return SUCCESS;
}
Status VarIsInitializedOpPass::UpdateInitedVars(const NodePtr &node) {
GE_CHECK_NOTNULL(node);
std::set<int64_t> *inited_vars = nullptr;
bool inited_vars_merged = false;
bool init_var = false;
int64_t inited_var_id;
auto ret = CheckAndSetVarInited(node, init_var, inited_var_id);
if (ret != SUCCESS) {
return ret;
}
if (init_var) {
inited_vars = CreateInitedVars();
if (inited_vars == nullptr) {
return OUT_OF_MEMORY;
}
inited_vars_merged = true;
inited_vars->insert(inited_var_id);
}
for (auto &in_node : node->GetInNodes()) {
GE_CHECK_NOTNULL(in_node->GetOpDesc());
auto iter = nodes_to_inited_vars_.find(in_node->GetOpDesc()->GetId());
if (iter == nodes_to_inited_vars_.end()) {
continue;
}
if (inited_vars == nullptr) {
inited_vars = iter->second;
continue;
}
if (inited_vars == iter->second) {
continue;
}
// if there are multiple different inited_vars set, we should merge them to a new one
if (inited_vars_merged) {
inited_vars->insert(iter->second->begin(), iter->second->end());
} else {
auto origin_inited_vars = inited_vars;
inited_vars = CreateInitedVars();
if (inited_vars == nullptr) {
return OUT_OF_MEMORY;
}
inited_vars_merged = true;
inited_vars->insert(origin_inited_vars->begin(), origin_inited_vars->end());
inited_vars->insert(iter->second->begin(), iter->second->end());
}
}
if (inited_vars != nullptr) {
GE_CHECK_NOTNULL(node->GetOpDesc());
nodes_to_inited_vars_[node->GetOpDesc()->GetId()] = inited_vars;
GELOGD("Inited vars on this graph when node %s, inited vars count %zu",
node->GetName().c_str(), inited_vars->size());
}
return SUCCESS;
}
std::set<int64_t> *VarIsInitializedOpPass::CreateInitedVars() {
std::unique_ptr<std::set<int64_t>> inited_vars_keeper(new(std::nothrow) std::set<int64_t>());
if (inited_vars_keeper == nullptr) {
GELOGE(OUT_OF_MEMORY, "Failed to alloc set memory");
return nullptr;
}
auto inited_vars = inited_vars_keeper.get();
var_inited_keeper_.emplace_back(std::move(inited_vars_keeper));
return inited_vars;
}
bool VarIsInitializedOpPass::IsVarInitedOnTheGraphAndNode(const NodePtr &node, int64_t var_id) const {
if (node == nullptr || node->GetOpDesc() == nullptr) {
return false;
}
auto iter = nodes_to_inited_vars_.find(node->GetOpDesc()->GetId());
if (iter == nodes_to_inited_vars_.end()) {
return false;
}
return iter->second->count(var_id) > 0;
}
Status VarIsInitializedOpPass::CheckAndSetVarInited(const NodePtr &node, bool &inited, int64_t &inited_var) {
GE_CHECK_NOTNULL(node);
inited = false;
if (node->GetType() != ASSIGN) {
return SUCCESS;
}
auto ref_in_anchor = node->GetInDataAnchor(kAssignVarRefIndex);
if (ref_in_anchor == nullptr) {
GELOGW("Invalid assign node on graph, no ref input. name %s", node->GetName().c_str());
return PARAM_INVALID;
}
auto var_out_anchor = ref_in_anchor->GetPeerOutAnchor();
if (var_out_anchor == nullptr) {
GELOGW("Invalid assign node on graph, no variable peer. name %s", node->GetName().c_str());
return PARAM_INVALID;
}
auto var = var_out_anchor->GetOwnerNode();
if (var == nullptr) {
GELOGW("Invalid assign node on graph, no variable peer. name %s", node->GetName().c_str());
return PARAM_INVALID;
}
inited = true;
GE_CHECK_NOTNULL(var->GetOpDesc());
inited_var = var->GetOpDesc()->GetId();
return SUCCESS;
}
} // namespace ge