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 /* Output text for new basic block. */
45 switch (graph_dump_format
)
49 graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n",
50 current_function_name
, current_function_name
);
62 switch (graph_dump_format
)
66 graph: {\ntitle: \"%s.BB%d\"\nfolding: 1\ncolor: lightblue\n\
67 label: \"basic block %d",
68 current_function_name
, bb
, bb
);
75 /* FIXME Should this be printed? It makes the graph significantly larger. */
77 /* Print the live-at-start register list. */
79 EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start
[bb
], 0, i
,
81 fprintf (fp
, " %d", i
);
82 if (i
< FIRST_PSEUDO_REGISTER
)
88 switch (graph_dump_format
)
99 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 print_rtl_single (fp
, PATTERN (tmp_rtx
));
173 print_rtl_single (fp
, tmp_rtx
);
175 switch (graph_dump_format
)
178 fputs ("\"\n}\n", fp
);
186 draw_edge (fp
, from
, to
, bb_edge
, class)
194 switch (graph_dump_format
)
199 color
= "color: red ";
201 color
= "color: blue ";
203 color
= "color: green ";
205 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
206 current_function_name
, from
,
207 current_function_name
, to
, color
);
209 fprintf (fp
, "class: %d ", class);
220 int bb ATTRIBUTE_UNUSED
;
222 switch (graph_dump_format
)
236 switch (graph_dump_format
)
239 fprintf (fp
, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
240 current_function_name
);
247 /* Like print_rtl, but also print out live information for the start of each
250 print_rtl_graph_with_bb (base
, suffix
, rtx_first
)
255 register rtx tmp_rtx
;
256 size_t namelen
= strlen (base
);
257 size_t suffixlen
= strlen (suffix
);
258 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
259 char *buf
= (char *) alloca (namelen
+ suffixlen
+ extlen
);
262 if (basic_block_info
== NULL
)
265 memcpy (buf
, base
, namelen
);
266 memcpy (buf
+ namelen
, suffix
, suffixlen
);
267 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
269 fp
= fopen (buf
, "a");
274 fprintf (fp
, "(nil)\n");
278 enum bb_state
{ NOT_IN_BB
, IN_ONE_BB
, IN_MULTIPLE_BB
};
279 int max_uid
= get_max_uid ();
280 int *start
= (int *) alloca (max_uid
* sizeof (int));
281 int *end
= (int *) alloca (max_uid
* sizeof (int));
282 enum bb_state
*in_bb_p
= (enum bb_state
*)
283 alloca (max_uid
* sizeof (enum bb_state
));
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 bb
= BASIC_BLOCK (i
);
296 start
[INSN_UID (bb
->head
)] = i
;
297 end
[INSN_UID (bb
->end
)] = i
;
298 for (x
= bb
->head
; x
!= NULL_RTX
; x
= NEXT_INSN (x
))
300 in_bb_p
[INSN_UID (x
)]
301 = (in_bb_p
[INSN_UID (x
)] == NOT_IN_BB
)
302 ? IN_ONE_BB
: IN_MULTIPLE_BB
;
308 /* Tell print-rtl that we want graph output. */
311 /* Start new function. */
314 for (tmp_rtx
= NEXT_INSN (rtx_first
); NULL
!= tmp_rtx
;
315 tmp_rtx
= NEXT_INSN (tmp_rtx
))
317 int edge_printed
= 0;
320 if (start
[INSN_UID (tmp_rtx
)] < 0 && end
[INSN_UID (tmp_rtx
)] < 0)
322 if (GET_CODE (tmp_rtx
) == BARRIER
)
324 if (GET_CODE (tmp_rtx
) == NOTE
325 && (1 || in_bb_p
[INSN_UID (tmp_rtx
)] == NOT_IN_BB
))
329 if ((i
= start
[INSN_UID (tmp_rtx
)]) >= 0)
331 /* We start a subgraph for each basic block. */
335 draw_edge (fp
, 0, INSN_UID (tmp_rtx
), 1, 0);
338 /* Print the data for this node. */
339 node_data (fp
, tmp_rtx
);
340 next_insn
= next_nonnote_insn (tmp_rtx
);
342 if ((i
= end
[INSN_UID (tmp_rtx
)]) >= 0)
346 bb
= BASIC_BLOCK (i
);
348 /* End of the basic block. */
351 /* Now specify the edges to all the successors of this
353 for (e
= bb
->succ
; e
; e
= e
->succ_next
)
355 if (e
->dest
!= EXIT_BLOCK_PTR
)
357 rtx block_head
= e
->dest
->head
;
359 draw_edge (fp
, INSN_UID (tmp_rtx
),
360 INSN_UID (block_head
),
361 next_insn
!= block_head
,
362 (e
->flags
& EDGE_ABNORMAL
? 2 : 0));
364 if (block_head
== next_insn
)
369 draw_edge (fp
, INSN_UID (tmp_rtx
), 999999,
371 (e
->flags
& EDGE_ABNORMAL
? 2 : 0));
381 /* Don't print edges to barriers. */
383 || GET_CODE (next_insn
) != BARRIER
)
384 draw_edge (fp
, XINT (tmp_rtx
, 0),
385 next_insn
? INSN_UID (next_insn
) : 999999, 0, 0);
388 /* We draw the remaining edges in class 3. We have
389 to skip over the barrier since these nodes are
390 not printed at all. */
392 next_insn
= NEXT_INSN (next_insn
);
394 && (GET_CODE (next_insn
) == NOTE
395 || GET_CODE (next_insn
) == BARRIER
));
397 draw_edge (fp
, XINT (tmp_rtx
, 0),
398 next_insn
? INSN_UID (next_insn
) : 999999, 0, 3);
412 /* Similar as clean_dump_file, but this time for graph output files. */
414 clean_graph_dump_file (base
, suffix
)
418 size_t namelen
= strlen (base
);
419 size_t suffixlen
= strlen (suffix
);
420 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
421 char *buf
= (char *) alloca (namelen
+ extlen
+ suffixlen
);
424 memcpy (buf
, base
, namelen
);
425 memcpy (buf
+ namelen
, suffix
, suffixlen
);
426 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
428 fp
= fopen (buf
, "w");
431 pfatal_with_name (buf
);
433 switch (graph_dump_format
)
436 fputs ("graph: {\nport_sharing: no\n", fp
);
446 /* Do final work on the graph output file. */
448 finish_graph_dump_file (base
, suffix
)
452 size_t namelen
= strlen (base
);
453 size_t suffixlen
= strlen (suffix
);
454 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
455 char *buf
= (char *) alloca (namelen
+ suffixlen
+ extlen
);
458 memcpy (buf
, base
, namelen
);
459 memcpy (buf
+ namelen
, suffix
, suffixlen
);
460 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
462 fp
= fopen (buf
, "a");
465 switch (graph_dump_format
)