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.
110 lines
3.1 KiB
110 lines
3.1 KiB
/**
|
|
* Copyright 2019-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.
|
|
*/
|
|
|
|
#ifndef GE_GRAPH_PASSES_NEXT_ITERATION_PASS_H_
|
|
#define GE_GRAPH_PASSES_NEXT_ITERATION_PASS_H_
|
|
|
|
#include "inc/graph_pass.h"
|
|
|
|
struct LoopCondGroup {
|
|
LoopCondGroup() : loop_cond(nullptr) {}
|
|
ge::NodePtr loop_cond; // LoopCond node
|
|
std::vector<ge::NodePtr> enter_nodes; // Enter nodes
|
|
std::vector<std::pair<ge::NodePtr, ge::NodePtr>> merge_next_pairs; // <Merge, NextIteration>
|
|
};
|
|
using LoopCondGroupPtr = std::shared_ptr<LoopCondGroup>;
|
|
|
|
namespace ge {
|
|
class NextIterationPass : public GraphPass {
|
|
public:
|
|
Status Run(ComputeGraphPtr graph);
|
|
|
|
///
|
|
/// @brief Clear Status, used for subgraph pass
|
|
/// @return SUCCESS
|
|
///
|
|
Status ClearStatus() override;
|
|
|
|
private:
|
|
///
|
|
/// @brief Group Enter node
|
|
/// @param [in] enter_node
|
|
/// @return Status
|
|
///
|
|
Status GroupEnterNode(const NodePtr &enter_node);
|
|
|
|
///
|
|
/// @brief Group Enter nodes without batch_label attr
|
|
/// @param [in] compute_graph
|
|
/// @return Status
|
|
///
|
|
Status GroupWithNoBatch(const ComputeGraphPtr &graph);
|
|
|
|
///
|
|
/// @brief Find while groups
|
|
/// @return Status
|
|
///
|
|
Status FindWhileGroups();
|
|
|
|
///
|
|
/// @brief Verify if valid
|
|
/// @return bool
|
|
///
|
|
bool VerifyWhileGroup();
|
|
|
|
///
|
|
/// @brief Handle while group
|
|
/// @param [in] graph
|
|
/// @return Status
|
|
///
|
|
Status HandleWhileGroup(ComputeGraphPtr &graph);
|
|
|
|
///
|
|
/// @brief Create Active Node
|
|
/// @param [in] graph
|
|
/// @param [in] name
|
|
/// @return ge::NodePtr
|
|
///
|
|
NodePtr CreateActiveNode(ComputeGraphPtr &graph, const std::string &name);
|
|
|
|
///
|
|
/// @brief Break NextIteration Link & add name to merge attr
|
|
/// @param [in] next_node
|
|
/// @param [in] merge_node
|
|
/// @return Status
|
|
///
|
|
Status BreakNextIteration(const NodePtr &next_node, NodePtr &merge_node);
|
|
|
|
///
|
|
/// @brief find target node
|
|
/// @param [in] node
|
|
/// @param [in] target_type
|
|
/// @param [in] is_input
|
|
/// @param [in] batch_label
|
|
/// @param [out] target_node
|
|
/// @return Status
|
|
///
|
|
Status FindTargetNode(const NodePtr &node, const std::string &target_type, bool is_input,
|
|
const std::string &batch_label, NodePtr &target_node);
|
|
|
|
// map<frame_name, vector<enter_node>>
|
|
std::unordered_map<std::string, std::vector<NodePtr>> frame_enter_map_;
|
|
// map<frame_name, map<batch_label, LoopCondGroup>>
|
|
std::unordered_map<std::string, std::unordered_map<std::string, LoopCondGroupPtr>> loop_group_map_;
|
|
};
|
|
} // namespace ge
|
|
#endif // GE_GRAPH_PASSES_NEXT_ITERATION_PASS_H_
|