graph_viz_pass.cc 3.9 KB
Newer Older
X
Xin Pan 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/* 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. */

#include <algorithm>
#include <unordered_set>

#include "paddle/fluid/framework/ir/graph_viz_pass.h"
19
#include "paddle/fluid/framework/op_proto_maker.h"
X
Xin Pan 已提交
20
#include "paddle/fluid/inference/analysis/dot.h"
21
#include "paddle/fluid/string/printf.h"
X
Xin Pan 已提交
22 23 24 25

namespace paddle {
namespace framework {
namespace ir {
26
using inference::analysis::Dot;
27 28 29
namespace {
const char kGraphVizPath[] = "graph_viz_path";

X
fix  
Xin Pan 已提交
30 31 32 33
std::string FormatName(const Node* node) {
  if (!node->IsOp() || !node->Op() ||
      !node->Op()->HasAttr(OpProtoAndCheckerMaker::OpNamescopeAttrName())) {
    return node->Name();
34 35
  }
  const std::string full_scope = boost::get<std::string>(
X
fix  
Xin Pan 已提交
36 37
      node->Op()->GetAttr(OpProtoAndCheckerMaker::OpNamescopeAttrName()));
  return string::Sprintf("%s%s", full_scope.c_str(), node->Name().c_str());
38 39
}
}  // namespace
X
Xin Pan 已提交
40

X
Xin Pan 已提交
41
std::unique_ptr<ir::Graph> GraphVizPass::ApplyImpl(
X
Xin Pan 已提交
42
    std::unique_ptr<ir::Graph> graph) const {
X
Xin Pan 已提交
43
  const std::string graph_viz_path = Get<std::string>(kGraphVizPath);
44
  VLOG(3) << "draw IR graph viz to " << graph_viz_path;
X
Xin Pan 已提交
45
  std::unique_ptr<std::ostream> fout(new std::ofstream(graph_viz_path));
X
Xin Pan 已提交
46 47 48
  PADDLE_ENFORCE(fout->good());
  std::ostream& sout = *fout;

49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
  std::unordered_map<const ir::Node*, std::string> node2dot;

  Dot dot;

  std::vector<Dot::Attr> op_attrs({Dot::Attr("style", "filled"),
                                   Dot::Attr("shape", "box"),
                                   Dot::Attr("fillcolor", "red")});
  std::vector<Dot::Attr> var_attrs({Dot::Attr("style", "filled,rounded"),
                                    // Dot::Attr("shape", "diamond"),
                                    Dot::Attr("fillcolor", "yellow")});

  std::vector<Dot::Attr> marked_op_attrs({Dot::Attr("style", "filled"),
                                          Dot::Attr("shape", "box"),
                                          Dot::Attr("fillcolor", "lightgray")});
  std::vector<Dot::Attr> marked_var_attrs(
      {Dot::Attr("style", "filled,rounded"),
       // Dot::Attr("shape", "diamond"),
       Dot::Attr("fillcolor", "lightgray")});

  auto marked_nodes = ConsumeMarkedNodes(graph.get());
  // Create nodes
  for (const Node* n : graph->Nodes()) {
71
    std::string node_id = FormatName(n) + "(" + std::to_string(n->id()) + ")";
72 73 74 75 76 77 78 79
    if (n->IsOp()) {
      decltype(op_attrs) attr =
          marked_nodes.count(n) ? marked_op_attrs : op_attrs;
      dot.AddNode(node_id, attr, node_id);
    } else if (n->IsVar()) {
      decltype(op_attrs) attr =
          marked_nodes.count(n) ? marked_var_attrs : var_attrs;
      dot.AddNode(node_id, attr, node_id);
X
Xin Pan 已提交
80
    }
81 82 83 84 85 86 87 88
    node2dot[n] = node_id;
  }
  // Create edges
  for (const Node* n : graph->Nodes()) {
    const auto& src_id = node2dot.at(n);
    for (auto* out : n->outputs) {
      const auto& trg_id = node2dot.at(out);
      dot.AddEdge(src_id, trg_id, {});
X
Xin Pan 已提交
89 90 91
    }
  }

92 93
  sout << dot.Build();

X
Xin Pan 已提交
94 95
  return graph;
}
X
Xin Pan 已提交
96

97 98 99 100 101 102 103 104 105 106 107
GraphVizPass::marked_nodes_t GraphVizPass::ConsumeMarkedNodes(
    Graph* graph) const {
  marked_nodes_t res;
  if (graph->Has(kGraphvizMarkedNodeAttr)) {
    auto& attr = graph->Get<marked_nodes_t>(kGraphvizMarkedNodeAttr);
    res = attr;
    attr.clear();
  }
  return res;
}

X
Xin Pan 已提交
108 109 110
}  // namespace ir
}  // namespace framework
}  // namespace paddle
X
Xin Pan 已提交
111

X
Xin Pan 已提交
112 113
REGISTER_PASS(graph_viz_pass, paddle::framework::ir::GraphVizPass)
    .RequirePassAttr(paddle::framework::ir::kGraphVizPath);