1 /* Output routines for graphical representation.
2 Copyright (C) 1998, 1999 Free Software Foundation, Inc.
3 Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
28 #include "hard-reg-set.h"
29 #include "basic-block.h"
32 static const char *graph_ext[] =
38 /* Output text for new basic block. */
44 switch (graph_dump_format)
48 graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n",
49 current_function_name, current_function_name);
61 switch (graph_dump_format)
65 graph: {\ntitle: \"%s.BB%d\"\nfolding: 1\ncolor: lightblue\n\
66 label: \"basic block %d",
67 current_function_name, bb, bb);
74 /* FIXME Should this be printed? It makes the graph significantly larger. */
76 /* Print the live-at-start register list. */
78 EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start[bb], 0, i,
80 fprintf (fp, " %d", i);
81 if (i < FIRST_PSEUDO_REGISTER)
87 switch (graph_dump_format)
98 node_data (fp, tmp_rtx)
104 if (PREV_INSN (tmp_rtx) == 0)
106 /* This is the first instruction. Add an edge from the starting
108 switch (graph_dump_format)
112 edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n",
113 current_function_name,
114 current_function_name, XINT (tmp_rtx, 0));
121 switch (graph_dump_format)
124 fprintf (fp, "node: {\n title: \"%s.%d\"\n color: %s\n \
126 current_function_name, XINT (tmp_rtx, 0),
127 GET_CODE (tmp_rtx) == NOTE ? "lightgrey"
128 : GET_CODE (tmp_rtx) == INSN ? "green"
129 : GET_CODE (tmp_rtx) == JUMP_INSN ? "darkgreen"
130 : GET_CODE (tmp_rtx) == CALL_INSN ? "darkgreen"
131 : GET_CODE (tmp_rtx) == CODE_LABEL ? "\
132 darkgrey\n shape: ellipse" : "white",
133 GET_RTX_NAME (GET_CODE (tmp_rtx)), XINT (tmp_rtx, 0));
140 if (GET_CODE (tmp_rtx) == NOTE)
142 static const char *note_names[] =
160 "repeated_line_number",
168 XINT (tmp_rtx, 4) < 0 ? note_names[-XINT (tmp_rtx, 4)] : "");
170 else if (GET_RTX_CLASS (GET_CODE (tmp_rtx)) == 'i')
171 result = print_rtl_single (fp, PATTERN (tmp_rtx));
173 result = print_rtl_single (fp, tmp_rtx);
175 switch (graph_dump_format)
178 fputs ("\"\n}\n", fp);
188 draw_edge (fp, from, to, bb_edge, class)
196 switch (graph_dump_format)
201 color = "color: red ";
203 color = "color: blue ";
205 color = "color: green ";
207 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
208 current_function_name, from,
209 current_function_name, to, color);
211 fprintf (fp, "class: %d ", class);
222 int bb ATTRIBUTE_UNUSED;
224 switch (graph_dump_format)
238 switch (graph_dump_format)
241 fprintf (fp, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
242 current_function_name);
249 /* Like print_rtl, but also print out live information for the start of each
252 print_rtl_graph_with_bb (base, suffix, rtx_first)
257 register rtx tmp_rtx;
258 size_t namelen = strlen (base);
259 size_t suffixlen = strlen (suffix);
260 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
261 char *buf = (char *) alloca (namelen + suffixlen + extlen);
264 if (basic_block_info == NULL)
267 memcpy (buf, base, namelen);
268 memcpy (buf + namelen, suffix, suffixlen);
269 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
271 fp = fopen (buf, "a");
276 fprintf (fp, "(nil)\n");
280 enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
281 int max_uid = get_max_uid ();
282 int *start = (int *) alloca (max_uid * sizeof (int));
283 int *end = (int *) alloca (max_uid * sizeof (int));
284 enum bb_state *in_bb_p = (enum bb_state *)
285 alloca (max_uid * sizeof (enum bb_state));
288 for (i = 0; i < max_uid; ++i)
290 start[i] = end[i] = -1;
291 in_bb_p[i] = NOT_IN_BB;
294 for (i = n_basic_blocks - 1; i >= 0; --i)
297 bb = BASIC_BLOCK (i);
298 start[INSN_UID (bb->head)] = i;
299 end[INSN_UID (bb->end)] = i;
300 for (x = bb->head; x != NULL_RTX; x = NEXT_INSN (x))
302 in_bb_p[INSN_UID (x)]
303 = (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
304 ? IN_ONE_BB : IN_MULTIPLE_BB;
310 /* Tell print-rtl that we want graph output. */
313 /* Start new function. */
316 for (tmp_rtx = NEXT_INSN (rtx_first); NULL != tmp_rtx;
317 tmp_rtx = NEXT_INSN (tmp_rtx))
320 int edge_printed = 0;
323 if (start[INSN_UID (tmp_rtx)] < 0 && end[INSN_UID (tmp_rtx)] < 0)
325 if (GET_CODE (tmp_rtx) == BARRIER)
327 if (GET_CODE (tmp_rtx) == NOTE
328 && (1 || in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB))
332 if ((i = start[INSN_UID (tmp_rtx)]) >= 0)
334 /* We start a subgraph for each basic block. */
338 draw_edge (fp, 0, INSN_UID (tmp_rtx), 1, 0);
341 /* Print the data for this node. */
342 did_output = node_data (fp, tmp_rtx);
343 next_insn = next_nonnote_insn (tmp_rtx);
345 if ((i = end[INSN_UID (tmp_rtx)]) >= 0)
349 bb = BASIC_BLOCK (i);
351 /* End of the basic block. */
354 /* Now specify the edges to all the successors of this
356 for (e = bb->succ; e ; e = e->succ_next)
358 if (e->dest != EXIT_BLOCK_PTR)
360 rtx block_head = e->dest->head;
362 draw_edge (fp, INSN_UID (tmp_rtx),
363 INSN_UID (block_head),
364 next_insn != block_head,
365 (e->flags & EDGE_ABNORMAL ? 2 : 0));
367 if (block_head == next_insn)
372 draw_edge (fp, INSN_UID (tmp_rtx), 999999,
374 (e->flags & EDGE_ABNORMAL ? 2 : 0));
384 /* Don't print edges to barriers. */
386 || GET_CODE (next_insn) != BARRIER)
387 draw_edge (fp, XINT (tmp_rtx, 0),
388 next_insn ? INSN_UID (next_insn) : 999999, 0, 0);
391 /* We draw the remaining edges in class 3. We have
392 to skip over the barrier since these nodes are
393 not printed at all. */
395 next_insn = NEXT_INSN (next_insn);
397 && (GET_CODE (next_insn) == NOTE
398 || GET_CODE (next_insn) == BARRIER));
400 draw_edge (fp, XINT (tmp_rtx, 0),
401 next_insn ? INSN_UID (next_insn) : 999999, 0, 3);
415 /* Similar as clean_dump_file, but this time for graph output files. */
417 clean_graph_dump_file (base, suffix)
421 size_t namelen = strlen (base);
422 size_t suffixlen = strlen (suffix);
423 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
424 char *buf = (char *) alloca (namelen + extlen + suffixlen);
427 memcpy (buf, base, namelen);
428 memcpy (buf + namelen, suffix, suffixlen);
429 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
431 fp = fopen (buf, "w");
434 pfatal_with_name (buf);
436 switch (graph_dump_format)
439 fputs ("graph: {\nport_sharing: no\n", fp);
449 /* Do final work on the graph output file. */
451 finish_graph_dump_file (base, suffix)
455 size_t namelen = strlen (base);
456 size_t suffixlen = strlen (suffix);
457 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
458 char *buf = (char *) alloca (namelen + suffixlen + extlen);
461 memcpy (buf, base, namelen);
462 memcpy (buf + namelen, suffix, suffixlen);
463 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
465 fp = fopen (buf, "a");
468 switch (graph_dump_format)