graph_visualize_pass.cc

// Copyright (c) 2019 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 "lite/core/mir/graph_visualize_pass.h"
#include <map>
#include <memory>
#include <set>
#include <string>
#include <utility>
#include "lite/core/mir/pass_registry.h"
#include "lite/utils/string.h"

namespace paddle {
namespace lite {
namespace mir {

using inference::analysis::Dot;

void GraphVisualizePass::Apply(const std::unique_ptr<SSAGraph>& graph) {
  Visualize(graph.get());
}

std::string Visualize(mir::SSAGraph* graph) {
  inference::analysis::Dot dot;

  int id = 0;
  std::set<std::string> exists_args;
  std::map<int, std::string> graph_col;  // Different colors of subgraphs
  graph_col.insert({{1, "red"},
                    {2, "green"},
                    {3, "cyan"},
                    {4, "bisque3"},
                    {5, "coral"},
                    {6, "darkseagreen1"},
                    {7, "goldenrod1"},
                    {8, "darkorchid"}});
  for (auto& node : graph->mutable_nodes()) {
    std::string key;
    if (node.IsArg()) {
      key = node.AsArg().name;
    } else {
      key = string_format("%s%d", node.AsStmt().op_type().c_str(), id++);
    }

    if (node.IsStmt()) {
      auto& stmt = node.AsStmt();
      auto sub_id = stmt.subgraph_id();
      auto it = graph_col.find(sub_id);
      if (sub_id > 0 && it != graph_col.end()) {
        dot.AddNode(key,
                    {Dot::Attr("shape", "box"),
                     Dot::Attr("style", "filled"),
                     Dot::Attr("color", "black"),
                     Dot::Attr("fillcolor", it->second)});
      } else {
        dot.AddNode(key,
                    {Dot::Attr("shape", "box"),
                     Dot::Attr("style", "filled"),
                     Dot::Attr("color", "black"),
                     Dot::Attr("fillcolor", "yellow")});
      }
      for (auto& x : node.inlinks) {
        auto name = x->AsArg().name;
        if (!exists_args.count(name)) {
          dot.AddNode(name, {});
        }
        dot.AddEdge(name, key, {});
        exists_args.insert(name);
      }
      for (auto& x : node.outlinks) {
        auto name = x->AsArg().name;
        if (!exists_args.count(name)) {
          dot.AddNode(name, {});
        }
        dot.AddEdge(key, name, {});
        exists_args.insert(name);
      }
    }
  }

  auto res = dot.Build();
  // If we use VLOG here, we can not type all graph out.
  // So we change VLOG to std::cout.
  std::cout << "dot:\n" << res << std::endl;
  return res;
}

}  // namespace mir
}  // namespace lite
}  // namespace paddle

REGISTER_MIR_PASS(graph_visualze, paddle::lite::mir::GraphVisualizePass)
    .BindTargets({TARGET(kAny)});