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. */
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
33 static const char *graph_ext[] =
39 static void start_fct PROTO ((FILE *));
40 static void start_bb PROTO ((FILE *, int));
41 static void node_data PROTO ((FILE *, rtx));
42 static void draw_edge PROTO ((FILE *, int, int, int, int));
43 static void end_fct PROTO ((FILE *));
44 static void end_bb PROTO ((FILE *));
46 /* Output text for new basic block. */
52 switch (graph_dump_format)
56 graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n",
57 current_function_name, current_function_name);
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 (fp, tmp_rtx)
111 if (PREV_INSN (tmp_rtx) == 0)
113 /* This is the first instruction. Add an edge from the starting
115 switch (graph_dump_format)
119 edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n",
120 current_function_name,
121 current_function_name, XINT (tmp_rtx, 0));
128 switch (graph_dump_format)
131 fprintf (fp, "node: {\n title: \"%s.%d\"\n color: %s\n \
133 current_function_name, XINT (tmp_rtx, 0),
134 GET_CODE (tmp_rtx) == NOTE ? "lightgrey"
135 : GET_CODE (tmp_rtx) == INSN ? "green"
136 : GET_CODE (tmp_rtx) == JUMP_INSN ? "darkgreen"
137 : GET_CODE (tmp_rtx) == CALL_INSN ? "darkgreen"
138 : GET_CODE (tmp_rtx) == CODE_LABEL ? "\
139 darkgrey\n shape: ellipse" : "white",
140 GET_RTX_NAME (GET_CODE (tmp_rtx)), XINT (tmp_rtx, 0));
147 if (GET_CODE (tmp_rtx) == NOTE)
149 static const char *note_names[] =
167 "repeated_line_number",
175 XINT (tmp_rtx, 4) < 0 ? note_names[-XINT (tmp_rtx, 4)] : "");
177 else if (GET_RTX_CLASS (GET_CODE (tmp_rtx)) == 'i')
178 print_rtl_single (fp, PATTERN (tmp_rtx));
180 print_rtl_single (fp, tmp_rtx);
182 switch (graph_dump_format)
185 fputs ("\"\n}\n", fp);
193 draw_edge (fp, from, to, bb_edge, class)
201 switch (graph_dump_format)
206 color = "color: red ";
208 color = "color: blue ";
210 color = "color: green ";
212 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
213 current_function_name, from,
214 current_function_name, to, color);
216 fprintf (fp, "class: %d ", class);
228 switch (graph_dump_format)
242 switch (graph_dump_format)
245 fprintf (fp, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
246 current_function_name);
253 /* Like print_rtl, but also print out live information for the start of each
256 print_rtl_graph_with_bb (base, suffix, rtx_first)
261 register rtx tmp_rtx;
262 size_t namelen = strlen (base);
263 size_t suffixlen = strlen (suffix);
264 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
265 char *buf = (char *) alloca (namelen + suffixlen + extlen);
268 if (basic_block_info == NULL)
271 memcpy (buf, base, namelen);
272 memcpy (buf + namelen, suffix, suffixlen);
273 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
275 fp = fopen (buf, "a");
280 fprintf (fp, "(nil)\n");
284 enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
285 int max_uid = get_max_uid ();
286 int *start = (int *) alloca (max_uid * sizeof (int));
287 int *end = (int *) alloca (max_uid * sizeof (int));
288 enum bb_state *in_bb_p = (enum bb_state *)
289 alloca (max_uid * sizeof (enum bb_state));
292 for (i = 0; i < max_uid; ++i)
294 start[i] = end[i] = -1;
295 in_bb_p[i] = NOT_IN_BB;
298 for (i = n_basic_blocks - 1; i >= 0; --i)
301 bb = BASIC_BLOCK (i);
302 start[INSN_UID (bb->head)] = i;
303 end[INSN_UID (bb->end)] = i;
304 for (x = bb->head; x != NULL_RTX; x = NEXT_INSN (x))
306 in_bb_p[INSN_UID (x)]
307 = (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
308 ? IN_ONE_BB : IN_MULTIPLE_BB;
314 /* Tell print-rtl that we want graph output. */
317 /* Start new function. */
320 for (tmp_rtx = NEXT_INSN (rtx_first); NULL != tmp_rtx;
321 tmp_rtx = NEXT_INSN (tmp_rtx))
323 int edge_printed = 0;
326 if (start[INSN_UID (tmp_rtx)] < 0 && end[INSN_UID (tmp_rtx)] < 0)
328 if (GET_CODE (tmp_rtx) == BARRIER)
330 if (GET_CODE (tmp_rtx) == NOTE
331 && (1 || in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB))
335 if ((i = start[INSN_UID (tmp_rtx)]) >= 0)
337 /* We start a subgraph for each basic block. */
341 draw_edge (fp, 0, INSN_UID (tmp_rtx), 1, 0);
344 /* Print the data for this node. */
345 node_data (fp, tmp_rtx);
346 next_insn = next_nonnote_insn (tmp_rtx);
348 if ((i = end[INSN_UID (tmp_rtx)]) >= 0)
352 bb = BASIC_BLOCK (i);
354 /* End of the basic block. */
357 /* Now specify the edges to all the successors of this
359 for (e = bb->succ; e ; e = e->succ_next)
361 if (e->dest != EXIT_BLOCK_PTR)
363 rtx block_head = e->dest->head;
365 draw_edge (fp, INSN_UID (tmp_rtx),
366 INSN_UID (block_head),
367 next_insn != block_head,
368 (e->flags & EDGE_ABNORMAL ? 2 : 0));
370 if (block_head == next_insn)
375 draw_edge (fp, INSN_UID (tmp_rtx), 999999,
377 (e->flags & EDGE_ABNORMAL ? 2 : 0));
387 /* Don't print edges to barriers. */
389 || GET_CODE (next_insn) != BARRIER)
390 draw_edge (fp, XINT (tmp_rtx, 0),
391 next_insn ? INSN_UID (next_insn) : 999999, 0, 0);
394 /* We draw the remaining edges in class 3. We have
395 to skip over the barrier since these nodes are
396 not printed at all. */
398 next_insn = NEXT_INSN (next_insn);
400 && (GET_CODE (next_insn) == NOTE
401 || GET_CODE (next_insn) == BARRIER));
403 draw_edge (fp, XINT (tmp_rtx, 0),
404 next_insn ? INSN_UID (next_insn) : 999999, 0, 3);
418 /* Similar as clean_dump_file, but this time for graph output files. */
420 clean_graph_dump_file (base, suffix)
424 size_t namelen = strlen (base);
425 size_t suffixlen = strlen (suffix);
426 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
427 char *buf = (char *) alloca (namelen + extlen + suffixlen);
430 memcpy (buf, base, namelen);
431 memcpy (buf + namelen, suffix, suffixlen);
432 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
434 fp = fopen (buf, "w");
437 pfatal_with_name (buf);
439 switch (graph_dump_format)
442 fputs ("graph: {\nport_sharing: no\n", fp);
452 /* Do final work on the graph output file. */
454 finish_graph_dump_file (base, suffix)
458 size_t namelen = strlen (base);
459 size_t suffixlen = strlen (suffix);
460 size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
461 char *buf = (char *) alloca (namelen + suffixlen + extlen);
464 memcpy (buf, base, namelen);
465 memcpy (buf + namelen, suffix, suffixlen);
466 memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen);
468 fp = fopen (buf, "a");
471 switch (graph_dump_format)