Home
last modified time | relevance | path

Searched refs:visited_nodes (Results 1 – 5 of 5) sorted by relevance

/third_party/mindspore/mindspore/lite/tools/optimizer/graph/
Dcontrol_flow_pass.h37 void VisitedNodesUsedByAfterParts(const std::set<AnfNodePtr> &visited_nodes,
40 …itGraph(const FuncGraphPtr &fg, AnfNodePtr *control_flow_node, std::set<AnfNodePtr> *visited_nodes,
42 …size_t GetItemVisitedNums(const std::set<AnfNodePtr> &visited_nodes, const AnfNodePtr &tuple_node);
43 …Visited(const size_t &need_size, const AnfNodePtr &tuple_node, std::set<AnfNodePtr> *visited_nodes,
45 void BindGetItemNodes(std::set<AnfNodePtr> *visited_nodes, std::vector<AnfNodePtr> *remain_nodes);
60 int ProcessWhileOp(const FuncGraphPtr &fg, const std::set<AnfNodePtr> &visited_nodes,
75 int ProcessIfOp(const FuncGraphPtr &fg, const std::set<AnfNodePtr> &visited_nodes,
Dcontrol_flow_pass.cc48 void ControlFlowPass::VisitedNodesUsedByAfterParts(const std::set<AnfNodePtr> &visited_nodes, in VisitedNodesUsedByAfterParts() argument
65 if (visited_nodes.find(input) != visited_nodes.end() && in VisitedNodesUsedByAfterParts()
74 size_t ControlFlowPass::GetItemVisitedNums(const std::set<AnfNodePtr> &visited_nodes, const AnfNode… in GetItemVisitedNums() argument
76 for (auto &node : visited_nodes) { in GetItemVisitedNums()
93 … std::set<AnfNodePtr> *visited_nodes, std::vector<AnfNodePtr> *remain_nodes) { in MoveGetItemToVisited() argument
111 visited_nodes->insert(*it); in MoveGetItemToVisited()
120 void ControlFlowPass::BindGetItemNodes(std::set<AnfNodePtr> *visited_nodes, std::vector<AnfNodePtr>… in BindGetItemNodes() argument
122 for (auto &node : *visited_nodes) { in BindGetItemNodes()
135 size_t visited_getitem_size = GetItemVisitedNums(*visited_nodes, cur_node); in BindGetItemNodes()
141 MoveGetItemToVisited(need_getitem_size, cur_node, visited_nodes, remain_nodes); in BindGetItemNodes()
[all …]
/third_party/mindspore/mindspore/ccsrc/backend/session/
Dkernel_graph.cc42 std::unordered_set<AnfNodePtr> *visited_nodes) { in PushNoVisitedNode() argument
45 MS_EXCEPTION_IF_NULL(visited_nodes); in PushNoVisitedNode()
46 if (visited_nodes->find(node) == visited_nodes->end()) { in PushNoVisitedNode()
48 (void)visited_nodes->insert(node); in PushNoVisitedNode()
166 … std::unordered_set<AnfNodePtr> *visited_nodes, bool comm_first) { in EnqueueActiveNodes() argument
168 MS_EXCEPTION_IF_NULL(visited_nodes); in EnqueueActiveNodes()
194 if (node_input_num_[next_node] == 0 && visited_nodes->find(next_node) == visited_nodes->end()) { in EnqueueActiveNodes()
195 (void)visited_nodes->insert(next_node); in EnqueueActiveNodes()
198 EnqueueActiveNodes(next_node, visit_queue, visited_nodes); in EnqueueActiveNodes()
216 std::unordered_set<AnfNodePtr> visited_nodes; in SetExecOrderByDefault() local
[all …]
Dkernel_graph.h386 std::unordered_set<AnfNodePtr> *visited_nodes, bool comm_first = true);
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/
Drecompute.cc452 std::unordered_set<CNodePtr> visited_nodes; in InsertRecomputedNodes() local
454 if (visited_nodes.find(candidate_recomputed_node) != visited_nodes.end()) { in InsertRecomputedNodes()
460 visited_nodes.insert(max_recomputed_sub_graph.begin(), max_recomputed_sub_graph.end()); in InsertRecomputedNodes()