Searched refs:forward_end (Results 1 – 2 of 2) sorted by relevance
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/graph_util/ |
| D | pipeline_split_utils.cc | 287 …orForward(const std::vector<AnfNodePtr> &forward_start, const std::vector<AnfNodePtr> &forward_end, in ReorderForForward() argument
296 auto prior_node = forward_end[i - 1]; in ReorderForForward()
580 void GetBorderNode(std::vector<AnfNodePtr> *forward_start, std::vector<AnfNodePtr> *forward_end, in GetBorderNode() argument
624 forward_end->push_back(node); in GetBorderNode()
634 std::sort((*forward_end).begin(), (*forward_end).end(), CompFunc); in GetBorderNode()
663 std::vector<AnfNodePtr> forward_end; in Reorder() local
669 …GetBorderNode(&forward_start, &forward_end, &backward_start, &backward_end, &forward_params, &back… in Reorder()
673 auto forward_end_cnode = forward_end.back()->cast<CNodePtr>(); in Reorder()
681 auto forward_end_pair = Deduplicate(forward_end, root, micro_max); in Reorder()
710 std::vector<AnfNodePtr> forward_end; in ReorderForPredict() local
[all …]
|
| D | pipeline_split_utils.h | 38 …orForward(const std::vector<AnfNodePtr> &forward_start, const std::vector<AnfNodePtr> &forward_end,
52 void GetBorderNode(std::vector<AnfNodePtr> *forward_start, std::vector<AnfNodePtr> *forward_end,
|