1 /* Output routines for graphical representation.
2 Copyright (C) 1998 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",
167 XINT (tmp_rtx, 4) < 0 ? note_names[-XINT (tmp_rtx, 4)] : "");
169 else if (GET_RTX_CLASS (GET_CODE (tmp_rtx)) == 'i')
170 result = print_rtl_single (fp, PATTERN (tmp_rtx));
172 result = print_rtl_single (fp, tmp_rtx);
174 switch (graph_dump_format)
177 fputs ("\"\n}\n", fp);
187 draw_edge (fp, from, to, bb_edge, class)
194 switch (graph_dump_format)
198 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
199 current_function_name, from,
200 current_function_name, to,
201 bb_edge ? "color: blue " : class ? "color: red " : "");
203 fprintf (fp, "class: %d ", class);
214 int bb ATTRIBUTE_UNUSED;
216 switch (graph_dump_format)
230 switch (graph_dump_format)
233 fprintf (fp, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
234 current_function_name);
241 /* Like print_rtl, but also print out live information for the start of each
244 print_rtl_graph_with_bb (base, suffix, rtx_first)
249 register rtx tmp_rtx;
250 size_t namelen = strlen (base);
251 size_t suffixlen = strlen (suffix);
252 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
253 char *buf = (char *) alloca (namelen + suffixlen + extlen);
256 /* Regenerate the basic block information. */
257 find_basic_blocks (rtx_first, max_reg_num (), NULL);
259 memcpy (buf, base, namelen);
260 memcpy (buf + namelen, suffix, suffixlen);
261 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
263 fp = fopen (buf, "a");
268 fprintf (fp, "(nil)\n");
272 enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
273 int max_uid = get_max_uid ();
274 int *start = (int *) alloca (max_uid * sizeof (int));
275 int *end = (int *) alloca (max_uid * sizeof (int));
276 enum bb_state *in_bb_p = (enum bb_state *)
277 alloca (max_uid * sizeof (enum bb_state));
278 /* Element I is a list of I's predecessors/successors. */
279 int_list_ptr *s_preds;
280 int_list_ptr *s_succs;
281 /* Element I is the number of predecessors/successors of basic
286 for (i = 0; i < max_uid; ++i)
288 start[i] = end[i] = -1;
289 in_bb_p[i] = NOT_IN_BB;
292 for (i = n_basic_blocks - 1; i >= 0; --i)
295 start[INSN_UID (basic_block_head[i])] = i;
296 end[INSN_UID (basic_block_end[i])] = i;
297 for (x = basic_block_head[i]; x != NULL_RTX; x = NEXT_INSN (x))
299 in_bb_p[INSN_UID (x)]
300 = (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
301 ? IN_ONE_BB : IN_MULTIPLE_BB;
302 if (x == basic_block_end[i])
307 /* Get the information about the basic blocks predecessors and
309 s_preds = (int_list_ptr *) alloca (n_basic_blocks
310 * sizeof (int_list_ptr));
311 s_succs = (int_list_ptr *) alloca (n_basic_blocks
312 * sizeof (int_list_ptr));
313 num_preds = (int *) alloca (n_basic_blocks * sizeof (int));
314 num_succs = (int *) alloca (n_basic_blocks * sizeof (int));
315 compute_preds_succs (s_preds, s_succs, num_preds, num_succs);
317 /* Tell print-rtl that we want graph output. */
320 /* Start new function. */
323 for (tmp_rtx = NEXT_INSN (rtx_first); NULL != tmp_rtx;
324 tmp_rtx = NEXT_INSN (tmp_rtx))
327 int edge_printed = 0;
330 if (start[INSN_UID (tmp_rtx)] < 0 && end[INSN_UID (tmp_rtx)] < 0)
332 if (GET_CODE (tmp_rtx) == BARRIER)
334 if (GET_CODE (tmp_rtx) == NOTE
335 && (1 || in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB))
339 if ((bb = start[INSN_UID (tmp_rtx)]) >= 0)
341 /* We start a subgraph for each basic block. */
345 draw_edge (fp, 0, INSN_UID (tmp_rtx), 1, 0);
348 /* Print the data for this node. */
349 did_output = node_data (fp, tmp_rtx);
350 next_insn = next_nonnote_insn (tmp_rtx);
352 if ((bb = end[INSN_UID (tmp_rtx)]) >= 0)
356 /* End of the basic block. */
359 /* Now specify the edges to all the successors of this
361 for (p = s_succs[bb]; p != NULL; p = p->next)
363 int bb_succ = INT_LIST_VAL (p);
367 rtx block_head = BLOCK_HEAD (bb_succ);
369 draw_edge (fp, INSN_UID (tmp_rtx),
370 INSN_UID (block_head),
371 next_insn != block_head, 0);
373 if (BLOCK_HEAD (bb_succ) == next_insn)
376 else if (bb_succ == EXIT_BLOCK)
378 draw_edge (fp, INSN_UID (tmp_rtx), 999999,
391 /* Don't print edges to barriers. */
393 || GET_CODE (next_insn) != BARRIER)
394 draw_edge (fp, XINT (tmp_rtx, 0),
395 next_insn ? INSN_UID (next_insn) : 999999, 0, 0);
398 /* We draw the remaining edges in class 2. We have
399 to skip oevr the barrier since these nodes are
400 not printed at all. */
402 next_insn = NEXT_INSN (next_insn);
404 && (GET_CODE (next_insn) == NOTE
405 || GET_CODE (next_insn) == BARRIER));
407 draw_edge (fp, XINT (tmp_rtx, 0),
408 next_insn ? INSN_UID (next_insn) : 999999, 0, 2);
422 /* Similar as clean_dump_file, but this time for graph output files. */
424 clean_graph_dump_file (base, suffix)
428 size_t namelen = strlen (base);
429 size_t suffixlen = strlen (suffix);
430 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
431 char *buf = (char *) alloca (namelen + extlen + suffixlen);
434 memcpy (buf, base, namelen);
435 memcpy (buf + namelen, suffix, suffixlen);
436 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
438 fp = fopen (buf, "w");
441 pfatal_with_name (buf);
443 switch (graph_dump_format)
446 fputs ("graph: {\nport_sharing: no\n", fp);
456 /* Do final work on the graph output file. */
458 finish_graph_dump_file (base, suffix)
462 size_t namelen = strlen (base);
463 size_t suffixlen = strlen (suffix);
464 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
465 char *buf = (char *) alloca (namelen + suffixlen + extlen);
468 memcpy (buf, base, namelen);
469 memcpy (buf + namelen, suffix, suffixlen);
470 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
472 fp = fopen (buf, "a");
475 switch (graph_dump_format)