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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
// Copyright 2011 Google Inc. 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 "graphviz.h"
#include <stdio.h>
#include <algorithm>
#include "dyndep.h"
#include "graph.h"
using namespace std;
void GraphViz::AddTarget(Node* node) {
if (visited_nodes_.find(node) != visited_nodes_.end())
return;
string pathstr = node->path();
replace(pathstr.begin(), pathstr.end(), '\\', '/');
printf("\"%p\" [label=\"%s\"]\n", node, pathstr.c_str());
visited_nodes_.insert(node);
Edge* edge = node->in_edge();
if (!edge) {
// Leaf node.
// Draw as a rect?
return;
}
if (visited_edges_.find(edge) != visited_edges_.end())
return;
visited_edges_.insert(edge);
if (edge->dyndep_ && edge->dyndep_->dyndep_pending()) {
std::string err;
if (!dyndep_loader_.LoadDyndeps(edge->dyndep_, &err)) {
Warning("%s\n", err.c_str());
}
}
if (edge->inputs_.size() == 1 && edge->outputs_.size() == 1) {
// Can draw simply.
// Note extra space before label text -- this is cosmetic and feels
// like a graphviz bug.
printf("\"%p\" -> \"%p\" [label=\" %s\"]\n",
edge->inputs_[0], edge->outputs_[0], edge->rule_->name().c_str());
} else {
printf("\"%p\" [label=\"%s\", shape=ellipse]\n",
edge, edge->rule_->name().c_str());
for (vector<Node*>::iterator out = edge->outputs_.begin();
out != edge->outputs_.end(); ++out) {
printf("\"%p\" -> \"%p\"\n", edge, *out);
}
for (vector<Node*>::iterator in = edge->inputs_.begin();
in != edge->inputs_.end(); ++in) {
const char* order_only = "";
if (edge->is_order_only(in - edge->inputs_.begin()))
order_only = " style=dotted";
printf("\"%p\" -> \"%p\" [arrowhead=none%s]\n", (*in), edge, order_only);
}
}
for (vector<Node*>::iterator in = edge->inputs_.begin();
in != edge->inputs_.end(); ++in) {
AddTarget(*in);
}
}
void GraphViz::Start() {
printf("digraph ninja {\n");
printf("rankdir=\"LR\"\n");
printf("node [fontsize=10, shape=box, height=0.25]\n");
printf("edge [fontsize=10]\n");
}
void GraphViz::Finish() {
printf("}\n");
}
|
