/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved. 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. */ #pragma once #include #include #include #include "paddle/fluid/framework/ir/graph.h" #include "paddle/fluid/framework/ir/node.h" namespace paddle { namespace framework { namespace ir { // Test if the graph contains circle. bool HasCircle(const Graph &graph); size_t GraphNum(const Graph &graph); // Topology Sort the operations in the graph from inputs to outputs. // `graph` cannot contain circle. std::vector TopologySortOperations(const Graph &graph); // Topological sort, but try to DFS. std::vector TopologyDfsSortOperations(const Graph &graph); // Different kinds to sort the operators in a graph to a sequence. enum class SortKind { // Topological Search TS = 0, // Topological and Depth First Search TDFS }; // Several kinds of topological sort. std::vector TopologyVarientSort(const Graph &graph, SortKind sort_kind); // Clean the nodes that doesn't connect to others. void CleanIndividualNodes(Graph *graph); // Build an adjacency list of operations for the `graph`. std::map> BuildOperationAdjList( const Graph &graph); template std::vector FilterByNodeWrapper(const Graph &graph) { std::vector ret; for (ir::Node *n : graph.Nodes()) { if (n->IsWrappedBy()) { ret.push_back(&n->Wrapper()); } } return ret; } } // namespace ir } // namespace framework } // namespace paddle