1 /* Output routines for graphical representation.
2 Copyright (C) 1998, 1999, 2000, 2001, 2003, 2004
3 Free Software Foundation, Inc.
4 Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 #include "coretypes.h"
32 #include "hard-reg-set.h"
33 #include "basic-block.h"
37 static const char *const graph_ext[] =
43 static void start_fct (FILE *);
44 static void start_bb (FILE *, int);
45 static void node_data (FILE *, rtx);
46 static void draw_edge (FILE *, int, int, int, int);
47 static void end_fct (FILE *);
48 static void end_bb (FILE *);
50 /* Output text for new basic block. */
54 switch (graph_dump_format)
58 graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n",
59 current_function_name (), current_function_name ());
67 start_bb (FILE *fp, int bb)
69 switch (graph_dump_format)
73 graph: {\ntitle: \"%s.BB%d\"\nfolding: 1\ncolor: lightblue\n\
74 label: \"basic block %d",
75 current_function_name (), bb, bb);
82 /* FIXME Should this be printed? It makes the graph significantly larger. */
84 /* Print the live-at-start register list. */
86 EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start[bb], 0, i,
88 fprintf (fp, " %d", i);
89 if (i < FIRST_PSEUDO_REGISTER)
95 switch (graph_dump_format)
106 node_data (FILE *fp, rtx tmp_rtx)
108 if (PREV_INSN (tmp_rtx) == 0)
110 /* This is the first instruction. Add an edge from the starting
112 switch (graph_dump_format)
116 edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n",
117 current_function_name (),
118 current_function_name (), XINT (tmp_rtx, 0));
125 switch (graph_dump_format)
128 fprintf (fp, "node: {\n title: \"%s.%d\"\n color: %s\n \
130 current_function_name (), XINT (tmp_rtx, 0),
131 GET_CODE (tmp_rtx) == NOTE ? "lightgrey"
132 : GET_CODE (tmp_rtx) == INSN ? "green"
133 : GET_CODE (tmp_rtx) == JUMP_INSN ? "darkgreen"
134 : GET_CODE (tmp_rtx) == CALL_INSN ? "darkgreen"
135 : GET_CODE (tmp_rtx) == CODE_LABEL ? "\
136 darkgrey\n shape: ellipse" : "white",
137 GET_RTX_NAME (GET_CODE (tmp_rtx)), XINT (tmp_rtx, 0));
144 if (GET_CODE (tmp_rtx) == NOTE)
146 const char *name = "";
147 if (NOTE_LINE_NUMBER (tmp_rtx) < 0)
148 name = GET_NOTE_INSN_NAME (NOTE_LINE_NUMBER (tmp_rtx));
149 fprintf (fp, " %s", name);
151 else if (INSN_P (tmp_rtx))
152 print_rtl_single (fp, PATTERN (tmp_rtx));
154 print_rtl_single (fp, tmp_rtx);
156 switch (graph_dump_format)
159 fputs ("\"\n}\n", fp);
167 draw_edge (FILE *fp, int from, int to, int bb_edge, int class)
170 switch (graph_dump_format)
175 color = "color: red ";
177 color = "color: blue ";
179 color = "color: green ";
181 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
182 current_function_name (), from,
183 current_function_name (), to, color);
185 fprintf (fp, "class: %d ", class);
196 switch (graph_dump_format)
209 switch (graph_dump_format)
212 fprintf (fp, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
213 current_function_name ());
220 /* Like print_rtl, but also print out live information for the start of each
223 print_rtl_graph_with_bb (const char *base, const char *suffix, rtx rtx_first)
226 size_t namelen = strlen (base);
227 size_t suffixlen = strlen (suffix);
228 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
229 char *buf = alloca (namelen + suffixlen + extlen);
232 if (basic_block_info == NULL)
235 memcpy (buf, base, namelen);
236 memcpy (buf + namelen, suffix, suffixlen);
237 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
239 fp = fopen (buf, "a");
244 fprintf (fp, "(nil)\n");
247 enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
248 int max_uid = get_max_uid ();
249 int *start = xmalloc (max_uid * sizeof (int));
250 int *end = xmalloc (max_uid * sizeof (int));
251 enum bb_state *in_bb_p = xmalloc (max_uid * sizeof (enum bb_state));
255 for (i = 0; i < max_uid; ++i)
257 start[i] = end[i] = -1;
258 in_bb_p[i] = NOT_IN_BB;
261 FOR_EACH_BB_REVERSE (bb)
264 start[INSN_UID (BB_HEAD (bb))] = bb->index;
265 end[INSN_UID (BB_END (bb))] = bb->index;
266 for (x = BB_HEAD (bb); x != NULL_RTX; x = NEXT_INSN (x))
268 in_bb_p[INSN_UID (x)]
269 = (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
270 ? IN_ONE_BB : IN_MULTIPLE_BB;
271 if (x == BB_END (bb))
276 /* Tell print-rtl that we want graph output. */
279 /* Start new function. */
282 for (tmp_rtx = NEXT_INSN (rtx_first); NULL != tmp_rtx;
283 tmp_rtx = NEXT_INSN (tmp_rtx))
285 int edge_printed = 0;
288 if (start[INSN_UID (tmp_rtx)] < 0 && end[INSN_UID (tmp_rtx)] < 0)
290 if (GET_CODE (tmp_rtx) == BARRIER)
292 if (GET_CODE (tmp_rtx) == NOTE
293 && (1 || in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB))
297 if ((i = start[INSN_UID (tmp_rtx)]) >= 0)
299 /* We start a subgraph for each basic block. */
303 draw_edge (fp, 0, INSN_UID (tmp_rtx), 1, 0);
306 /* Print the data for this node. */
307 node_data (fp, tmp_rtx);
308 next_insn = next_nonnote_insn (tmp_rtx);
310 if ((i = end[INSN_UID (tmp_rtx)]) >= 0)
314 bb = BASIC_BLOCK (i);
316 /* End of the basic block. */
319 /* Now specify the edges to all the successors of this
321 for (e = bb->succ; e ; e = e->succ_next)
323 if (e->dest != EXIT_BLOCK_PTR)
325 rtx block_head = BB_HEAD (e->dest);
327 draw_edge (fp, INSN_UID (tmp_rtx),
328 INSN_UID (block_head),
329 next_insn != block_head,
330 (e->flags & EDGE_ABNORMAL ? 2 : 0));
332 if (block_head == next_insn)
337 draw_edge (fp, INSN_UID (tmp_rtx), 999999,
339 (e->flags & EDGE_ABNORMAL ? 2 : 0));
349 /* Don't print edges to barriers. */
351 || GET_CODE (next_insn) != BARRIER)
352 draw_edge (fp, XINT (tmp_rtx, 0),
353 next_insn ? INSN_UID (next_insn) : 999999, 0, 0);
356 /* We draw the remaining edges in class 3. We have
357 to skip over the barrier since these nodes are
358 not printed at all. */
360 next_insn = NEXT_INSN (next_insn);
362 && (GET_CODE (next_insn) == NOTE
363 || GET_CODE (next_insn) == BARRIER));
365 draw_edge (fp, XINT (tmp_rtx, 0),
366 next_insn ? INSN_UID (next_insn) : 999999, 0, 3);
385 /* Similar as clean_dump_file, but this time for graph output files. */
388 clean_graph_dump_file (const char *base, const char *suffix)
390 size_t namelen = strlen (base);
391 size_t suffixlen = strlen (suffix);
392 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
393 char *buf = alloca (namelen + extlen + suffixlen);
396 memcpy (buf, base, namelen);
397 memcpy (buf + namelen, suffix, suffixlen);
398 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
400 fp = fopen (buf, "w");
403 fatal_error ("can't open %s: %m", buf);
405 switch (graph_dump_format)
408 fputs ("graph: {\nport_sharing: no\n", fp);
418 /* Do final work on the graph output file. */
420 finish_graph_dump_file (const char *base, const char *suffix)
422 size_t namelen = strlen (base);
423 size_t suffixlen = strlen (suffix);
424 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
425 char *buf = alloca (namelen + suffixlen + extlen);
428 memcpy (buf, base, namelen);
429 memcpy (buf + namelen, suffix, suffixlen);
430 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
432 fp = fopen (buf, "a");
435 switch (graph_dump_format)