|
|
|
@ -36,50 +36,54 @@ class SubgraphConstMigrationPass : public GraphPass {
|
|
|
|
|
private:
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Get all Data nodes for all subgraph.
|
|
|
|
|
/// @brief Get all Const/Data nodes for all subgraph.
|
|
|
|
|
/// @param [in] graph: Root compute graph.
|
|
|
|
|
/// @param [in] func_desc: functional OpDesc of Case.
|
|
|
|
|
/// @param [out] graph_datas: Data groups of subgraph.
|
|
|
|
|
/// @param [out] all_const_nodes: Const groups of subgraph.
|
|
|
|
|
/// @param [out] all_data_nodes: Data groups of subgraph.
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status ClassifyDataNodes(const ComputeGraphPtr &graph, const OpDescPtr &func_desc,
|
|
|
|
|
map<ComputeGraphPtr, map<uint32_t, NodePtr>> &graph_datas);
|
|
|
|
|
Status ClassifyGraphNodes(const ComputeGraphPtr &graph, const OpDescPtr &func_desc,
|
|
|
|
|
map<ComputeGraphPtr, map<string, NodePtr>> &all_const_nodes,
|
|
|
|
|
map<ComputeGraphPtr, map<uint32_t, NodePtr>> &all_data_nodes);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Get all Data nodes for all subgraph.
|
|
|
|
|
/// @param [in] node: Const node of subgraph.
|
|
|
|
|
/// @param [in] func_desc: functional OpDesc of Case.
|
|
|
|
|
/// @param [out] graph_nodes: Data groups of subgraph.
|
|
|
|
|
/// @brief Get parent_index for Const node migration.
|
|
|
|
|
/// @param [in] all_data_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] const_node: Const node will process.
|
|
|
|
|
/// @param [out] parent_index: parent index for replace Data.
|
|
|
|
|
/// @return true: SUCCESS / false: FAILED
|
|
|
|
|
///
|
|
|
|
|
bool GetAssociatedNodes(const NodePtr &node, map<uint32_t, uint32_t> &inputs, map<uint32_t, uint32_t> &outputs);
|
|
|
|
|
bool GetAssociatedNodes(const map<ComputeGraphPtr, map<uint32_t, NodePtr>> &all_data_nodes,
|
|
|
|
|
const NodePtr &const_node, uint32_t &parent_index);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Get all Data nodes for all subgraph.
|
|
|
|
|
/// @param [in] graph_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] data_base: Data Node for migration.
|
|
|
|
|
/// @param [in] data_idx: Data groups of subgraph.
|
|
|
|
|
/// @param [in] data_idx: Data groups of subgraph.
|
|
|
|
|
/// @brief Check parallel node is same for all subgraph.
|
|
|
|
|
/// @param [in] all_const_nodes: Const groups of subgraph.
|
|
|
|
|
/// @param [in] const_node: Const Node for migration.
|
|
|
|
|
/// @param [in] node_key: Key of Const node.
|
|
|
|
|
/// @return true: Same / false: not same
|
|
|
|
|
///
|
|
|
|
|
bool IsParallelNodeSame(const map<ComputeGraphPtr, map<uint32_t, NodePtr>> &graph_nodes,
|
|
|
|
|
const NodePtr &const_node, uint32_t parent_index, size_t index);
|
|
|
|
|
bool IsParallelNodeSame(const map<ComputeGraphPtr, map<string, NodePtr>> &all_const_nodes,
|
|
|
|
|
const NodePtr &const_node, const string &node_key);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Migration subgraph Node to Root
|
|
|
|
|
/// @param [in] graph: Root compute graph.
|
|
|
|
|
/// @param [in] func_node: functional Node of Case.
|
|
|
|
|
/// @param [in] graph_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] data_base: Data Node for migration.
|
|
|
|
|
/// @param [in] data_idx: Data groups of subgraph.
|
|
|
|
|
/// @param [in] all_const_nodes: Const groups of subgraph.
|
|
|
|
|
/// @param [in] all_data_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] const_node: Const Node for migration.
|
|
|
|
|
/// @param [in] node_key: Key of Const node for migration.
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status GraphNodeMigration(const ComputeGraphPtr &graph, const NodePtr &func_node,
|
|
|
|
|
map<ComputeGraphPtr, map<uint32_t, NodePtr>> &graph_nodes,
|
|
|
|
|
const NodePtr &data_base, uint32_t data_idx);
|
|
|
|
|
const map<ComputeGraphPtr, map<string, NodePtr>> &all_const_nodes,
|
|
|
|
|
map<ComputeGraphPtr, map<uint32_t, NodePtr>> &all_data_nodes,
|
|
|
|
|
const NodePtr &const_node, const string &node_key);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
@ -93,46 +97,42 @@ class SubgraphConstMigrationPass : public GraphPass {
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status MoveNodeToParent(const ComputeGraphPtr &graph, const NodePtr &func_node,
|
|
|
|
|
const map<ComputeGraphPtr, map<uint32_t, NodePtr>> &graph_nodes,
|
|
|
|
|
uint32_t parent_index, uint32_t anchor_idx,
|
|
|
|
|
const map<uint32_t, uint32_t> &inputs, const map<uint32_t, uint32_t> &outputs);
|
|
|
|
|
const map<ComputeGraphPtr, map<string, NodePtr>> &all_const_nodes,
|
|
|
|
|
const map<ComputeGraphPtr, map<uint32_t, NodePtr>> &all_data_nodes,
|
|
|
|
|
const string &node_key, uint32_t parent_index);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Append Input Tensor for functional node.
|
|
|
|
|
/// @param [in] graph_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] func_node: functional Node of Case.
|
|
|
|
|
/// @param [in] outputs: Parent index of Node output.
|
|
|
|
|
/// @param [in] graph_nodes: Const groups of subgraph.
|
|
|
|
|
/// @param [in/out] parent_index: Parent index for migration.
|
|
|
|
|
/// @param [in/out] all_data_nodes: Data groups of subgraph.
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status AppendParallelNode(map<ComputeGraphPtr, map<uint32_t, NodePtr>> &graph_nodes,
|
|
|
|
|
const NodePtr &func_node, map<uint32_t, uint32_t> &outputs);
|
|
|
|
|
Status AppendParallelNode(const NodePtr &func_node, uint32_t &parent_index,
|
|
|
|
|
map<ComputeGraphPtr, map<uint32_t, NodePtr>> &all_data_nodes);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Delete Node from all subgraph.
|
|
|
|
|
/// @param [in] graph_nodes: Data groups of subgraph.
|
|
|
|
|
/// @param [in] detach: Node will move to parent.
|
|
|
|
|
/// @param [in] outputs: Parent index of Node output.
|
|
|
|
|
/// @brief Delete Node from subgraph.
|
|
|
|
|
/// @param [in] graph: subgraph for process.
|
|
|
|
|
/// @param [in] const_node: Node will move to parent.
|
|
|
|
|
/// @param [in] data_node: Place holder for Const.
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status DetachParallelNode(const map<uint32_t, NodePtr> &graph_datas, const NodePtr &detach,
|
|
|
|
|
const map<uint32_t, uint32_t> &outputs);
|
|
|
|
|
Status DetachParallelNode(const ComputeGraphPtr &graph, const NodePtr &const_node, const NodePtr &data_node);
|
|
|
|
|
|
|
|
|
|
///
|
|
|
|
|
/// @ingroup ge
|
|
|
|
|
/// @brief Move Node to Parent Graph.
|
|
|
|
|
/// @param [in] graph: Parent compute graph.
|
|
|
|
|
/// @param [in] func_node: functional Node of Case.
|
|
|
|
|
/// @param [in] attach: Node will move to parent.
|
|
|
|
|
/// @param [in] inputs: Parent index of Node input.
|
|
|
|
|
/// @param [in] outputs: Parent index of Node output.
|
|
|
|
|
/// @param [in] const_node: Node will move to parent.
|
|
|
|
|
/// @param [in] parent_index: Parent index of Node input.
|
|
|
|
|
/// @return 0: SUCCESS / others: FAILED
|
|
|
|
|
///
|
|
|
|
|
Status AttachParallelNode(const ComputeGraphPtr &graph, const NodePtr &func_node, const NodePtr &attach,
|
|
|
|
|
const map<uint32_t, uint32_t> &inputs, const map<uint32_t, uint32_t> &outputs);
|
|
|
|
|
|
|
|
|
|
bool migration_append_{false};
|
|
|
|
|
Status AttachParallelNode(const ComputeGraphPtr &graph, const NodePtr &func_node,
|
|
|
|
|
const NodePtr &const_node, uint32_t parent_index);
|
|
|
|
|
};
|
|
|
|
|
} // namespace ge
|
|
|
|
|
#endif // GE_COMMON_SUBGRAPH_CONST_MIGRATION_H_
|