graph_helper.h 2.0 KB
Newer Older
X
better  
Xin Pan 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/* 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 <map>
#include <memory>
#include <vector>

#include "paddle/fluid/framework/ir/graph.h"
#include "paddle/fluid/framework/ir/node.h"

namespace paddle {
namespace framework {
namespace ir {
D
dzhwinter 已提交
27

X
Xin Pan 已提交
28
// Test if the graph contains circle.
X
better  
Xin Pan 已提交
29 30
bool HasCircle(const Graph &graph);

C
chengduo 已提交
31 32
size_t GraphNum(const Graph &graph);

X
Xin Pan 已提交
33 34
// Topology Sort the operations in the graph from inputs to outputs.
// `graph` cannot contain circle.
X
Xin Pan 已提交
35
std::vector<ir::Node *> TopologySortOperations(const Graph &graph);
X
better  
Xin Pan 已提交
36

Y
Yan Chunwei 已提交
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
// Topological sort, but try to DFS.
std::vector<ir::Node *> 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<Node *> TopologyVarientSort(const Graph &graph, SortKind sort_kind);

// Clean the nodes that doesn't connect to others.
void CleanIndividualNodes(Graph *graph);

X
Xin Pan 已提交
54
// Build an adjacency list of operations for the `graph`.
X
Xin Pan 已提交
55
std::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationAdjList(
X
better  
Xin Pan 已提交
56
    const Graph &graph);
X
Xin Pan 已提交
57

X
Xin Pan 已提交
58
template <typename T>
X
Xin Pan 已提交
59
std::vector<T *> FilterByNodeWrapper(const Graph &graph) {
X
Xin Pan 已提交
60 61
  std::vector<T *> ret;
  for (ir::Node *n : graph.Nodes()) {
Y
Yancey1989 已提交
62 63 64
    if (n->IsWrappedBy<T>()) {
      ret.push_back(&n->Wrapper<T>());
    }
X
Xin Pan 已提交
65 66 67 68
  }
  return ret;
}

X
better  
Xin Pan 已提交
69 70 71
}  // namespace ir
}  // namespace framework
}  // namespace paddle