1 /** 2 * Copyright 2023 Huawei Technologies Co., Ltd 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17 #ifndef MINDSPORE_CCSRC_FRONTEND_PARALLEL_GRAPH_UTIL_FOLD_PIPELINE_SPLIT_UTILS_H_ 18 #define MINDSPORE_CCSRC_FRONTEND_PARALLEL_GRAPH_UTIL_FOLD_PIPELINE_SPLIT_UTILS_H_ 19 20 #include <utility> 21 #include <vector> 22 #include <string> 23 #include "ir/anf.h" 24 #include "ir/manager.h" 25 #include "frontend/parallel/graph_util/pipeline_split_utils.h" 26 27 namespace mindspore { 28 namespace parallel { 29 void FoldPipelineReorder(const FuncGraphPtr &root); 30 void ReorderForBackwardOtherSeg(const PipelinePair &backward_start_pair, const PipelinePair &backward_end_pair, 31 int64_t micro_max, int64_t stage_num, const FuncGraphPtr &root); 32 void InsertVirtualFoldPipelineEndNode(const AnfNodePtr &temp_node, const FuncGraphManagerPtr &manager); 33 bool CompFuncBySegAscending(const AnfNodePtr &node1, const AnfNodePtr &node2); 34 bool CompFuncBySegDescending(const AnfNodePtr &node1, const AnfNodePtr &node2); 35 AnfNodePtr GetPreNode(const AnfNodePtr &node); 36 PipelinePair Deduplicate(const std::vector<AnfNodePtr> &node_vector, const FuncGraphPtr &root, int64_t micro_max, 37 int64_t seg_max, bool is_train); 38 } // namespace parallel 39 } // namespace mindspore 40 41 #endif // MINDSPORE_CCSRC_FRONTEND_PARALLEL_GRAPH_UTIL_FOLD_PIPELINE_SPLIT_UTILS_H_ 42