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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
|
/* Output routines for graphical representation.
Copyright (C) 1998-2012
Free Software Foundation, Inc.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
Rewritten for DOT output by Steven Bosscher, 2012.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "diagnostic-core.h" /* for fatal_error */
#include "sbitmap.h"
#include "basic-block.h"
#include "rtl.h"
#include "tree.h"
#include "gimple.h"
#include "graph.h"
#include "dumpfile.h"
#include "pretty-print.h"
#include "gimple-pretty-print.h"
/* DOT files with the .dot extension are recognized as document templates
by a well-known piece of word processing software out of Redmond, WA.
Therefore some recommend using the .gv extension instead. Obstinately
ignore that recommendatition... */
static const char *const graph_ext = ".dot";
/* Open a file with MODE for dumping our graph to.
Return the file pointer. */
static FILE *
open_graph_file (const char *base, const char *mode)
{
size_t namelen = strlen (base);
size_t extlen = strlen (graph_ext) + 1;
char *buf = XALLOCAVEC (char, namelen + extlen);
FILE *fp;
memcpy (buf, base, namelen);
memcpy (buf + namelen, graph_ext, extlen);
fp = fopen (buf, mode);
if (fp == NULL)
fatal_error ("can%'t open %s: %m", buf);
return fp;
}
/* Return a pretty-print buffer for output to file FP. */
static pretty_printer *
init_graph_slim_pretty_print (FILE *fp)
{
static bool initialized = false;
static pretty_printer graph_slim_pp;
if (! initialized)
{
pp_construct (&graph_slim_pp, /*prefix=*/NULL, /*linewidth=*/0);
initialized = true;
}
else
gcc_assert (! pp_last_position_in_text (&graph_slim_pp));
graph_slim_pp.buffer->stream = fp;
return &graph_slim_pp;
}
/* Draw a basic block BB belonging to the function with FNDECL_UID
as its unique number. */
static void
draw_cfg_node (pretty_printer *pp, int fndecl_uid, basic_block bb)
{
const char *shape;
const char *fillcolor;
if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
{
shape = "Mdiamond";
fillcolor = "white";
}
else
{
shape = "record";
fillcolor =
BB_PARTITION (bb) == BB_HOT_PARTITION ? "lightpink"
: BB_PARTITION (bb) == BB_COLD_PARTITION ? "lightblue"
: "lightgrey";
}
pp_printf (pp,
"\tfn_%d_basic_block_%d "
"[shape=%s,style=filled,fillcolor=%s,label=\"",
fndecl_uid, bb->index, shape, fillcolor);
if (bb->index == ENTRY_BLOCK)
pp_string (pp, "ENTRY");
else if (bb->index == EXIT_BLOCK)
pp_string (pp, "EXIT");
else
{
pp_character (pp, '{');
pp_write_text_to_stream (pp);
/* This would be easier if there'd be an IR independent iterator... */
if (current_ir_type () == IR_GIMPLE)
gimple_dump_bb_for_graph (pp, bb);
else
{
rtx insn;
bool first = true;
/* TODO: inter-bb stuff. */
FOR_BB_INSNS (bb, insn)
{
if (! first)
{
pp_character (pp, '|');
pp_write_text_to_stream (pp);
}
first = false;
print_insn_with_notes (pp, insn);
pp_write_text_as_dot_label_to_stream (pp, /*for_record=*/true);
}
}
pp_character (pp, '}');
}
pp_string (pp, "\"];\n\n");
pp_flush (pp);
}
/* Draw all successor edges of a basic block BB belonging to the function
with FNDECL_UID as its unique number. */
static void
draw_cfg_node_succ_edges (pretty_printer *pp, int fndecl_uid, basic_block bb)
{
edge e;
edge_iterator ei;
FOR_EACH_EDGE (e, ei, bb->succs)
{
const char *style = "\"solid,bold\"";
const char *color = "black";
int weight = 10;
if (e->flags & EDGE_FAKE)
{
style = "dotted";
color = "green";
weight = 0;
}
else if (e->flags & EDGE_DFS_BACK)
{
style = "\"dotted,bold\"";
color = "blue";
weight = 10;
}
else if (e->flags & EDGE_FALLTHRU)
{
color = "blue";
weight = 100;
}
if (e->flags & EDGE_ABNORMAL)
color = "red";
pp_printf (pp,
"\tfn_%d_basic_block_%d:s -> fn_%d_basic_block_%d:n "
"[style=%s,color=%s,weight=%d,constraint=%s];\n",
fndecl_uid, e->src->index,
fndecl_uid, e->dest->index,
style, color, weight,
(e->flags & (EDGE_FAKE | EDGE_DFS_BACK)) ? "false" : "true");
}
pp_flush (pp);
}
/* Print a graphical representation of the CFG of function FUN. */
void
print_graph_cfg (const char *base, tree fndecl)
{
const char *funcname = fndecl_name (fndecl);
int fndecl_uid = DECL_UID (fndecl);
FILE *fp = open_graph_file (base, "a");
int *rpo = XNEWVEC (int, n_basic_blocks);
basic_block bb;
int i, n;
pretty_printer *pp = init_graph_slim_pretty_print (fp);
pp_printf (pp, "subgraph \"%s\" {\n"
"\tcolor=\"black\";\n"
"\tlabel=\"%s\";\n",
funcname, funcname);
/* First print all basic blocks.
Visit the blocks in reverse post order to get a good ranking
of the nodes. */
n = pre_and_rev_post_order_compute (NULL, rpo, true);
for (i = 0; i < n; i++)
draw_cfg_node (pp, fndecl_uid, BASIC_BLOCK (rpo[i]));
/* Draw all edges at the end to get subgraphs right for GraphViz,
which requires nodes to be defined before edges to cluster
nodes properly.
Draw retreating edges as not constraining, this makes the layout
of the graph better. (??? Calling mark_dfs_back may change the
compiler's behavior when dumping, but computing back edges here
for ourselves is also not desirable.) */
mark_dfs_back_edges ();
FOR_ALL_BB (bb)
draw_cfg_node_succ_edges (pp, fndecl_uid, bb);
pp_printf (pp, "\t}\n");
pp_flush (pp);
fclose (fp);
}
/* Start the dump of a graph. */
static void
start_graph_dump (FILE *fp)
{
fputs ("digraph \"\" {\n"
"overlap=false;\n",
fp);
}
/* End the dump of a graph. */
static void
end_graph_dump (FILE *fp)
{
fputs ("}\n", fp);
}
/* Similar as clean_dump_file, but this time for graph output files. */
void
clean_graph_dump_file (const char *base)
{
FILE *fp = open_graph_file (base, "w");
start_graph_dump (fp);
fclose (fp);
}
/* Do final work on the graph output file. */
void
finish_graph_dump_file (const char *base)
{
FILE *fp = open_graph_file (base, "a");
end_graph_dump (fp);
fclose (fp);
}
|