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"
34 static const char *graph_ext
[] =
40 static void start_fct
PARAMS ((FILE *));
41 static void start_bb
PARAMS ((FILE *, int));
42 static void node_data
PARAMS ((FILE *, rtx
));
43 static void draw_edge
PARAMS ((FILE *, int, int, int, int));
44 static void end_fct
PARAMS ((FILE *));
45 static void end_bb
PARAMS ((FILE *));
47 /* Output text for new basic block. */
53 switch (graph_dump_format
)
57 graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n",
58 current_function_name
, current_function_name
);
70 switch (graph_dump_format
)
74 graph: {\ntitle: \"%s.BB%d\"\nfolding: 1\ncolor: lightblue\n\
75 label: \"basic block %d",
76 current_function_name
, bb
, bb
);
83 /* FIXME Should this be printed? It makes the graph significantly larger. */
85 /* Print the live-at-start register list. */
87 EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start
[bb
], 0, i
,
89 fprintf (fp
, " %d", i
);
90 if (i
< FIRST_PSEUDO_REGISTER
)
96 switch (graph_dump_format
)
107 node_data (fp
, tmp_rtx
)
112 if (PREV_INSN (tmp_rtx
) == 0)
114 /* This is the first instruction. Add an edge from the starting
116 switch (graph_dump_format
)
120 edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n",
121 current_function_name
,
122 current_function_name
, XINT (tmp_rtx
, 0));
129 switch (graph_dump_format
)
132 fprintf (fp
, "node: {\n title: \"%s.%d\"\n color: %s\n \
134 current_function_name
, XINT (tmp_rtx
, 0),
135 GET_CODE (tmp_rtx
) == NOTE
? "lightgrey"
136 : GET_CODE (tmp_rtx
) == INSN
? "green"
137 : GET_CODE (tmp_rtx
) == JUMP_INSN
? "darkgreen"
138 : GET_CODE (tmp_rtx
) == CALL_INSN
? "darkgreen"
139 : GET_CODE (tmp_rtx
) == CODE_LABEL
? "\
140 darkgrey\n shape: ellipse" : "white",
141 GET_RTX_NAME (GET_CODE (tmp_rtx
)), XINT (tmp_rtx
, 0));
148 if (GET_CODE (tmp_rtx
) == NOTE
)
150 static const char *note_names
[] =
168 "repeated_line_number",
176 XINT (tmp_rtx
, 4) < 0 ? note_names
[-XINT (tmp_rtx
, 4)] : "");
178 else if (GET_RTX_CLASS (GET_CODE (tmp_rtx
)) == 'i')
179 print_rtl_single (fp
, PATTERN (tmp_rtx
));
181 print_rtl_single (fp
, tmp_rtx
);
183 switch (graph_dump_format
)
186 fputs ("\"\n}\n", fp
);
194 draw_edge (fp
, from
, to
, bb_edge
, class)
202 switch (graph_dump_format
)
207 color
= "color: red ";
209 color
= "color: blue ";
211 color
= "color: green ";
213 "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
214 current_function_name
, from
,
215 current_function_name
, to
, color
);
217 fprintf (fp
, "class: %d ", class);
229 switch (graph_dump_format
)
243 switch (graph_dump_format
)
246 fprintf (fp
, "node: { title: \"%s.999999\" label: \"END\" }\n}\n",
247 current_function_name
);
254 /* Like print_rtl, but also print out live information for the start of each
257 print_rtl_graph_with_bb (base
, suffix
, rtx_first
)
262 register rtx tmp_rtx
;
263 size_t namelen
= strlen (base
);
264 size_t suffixlen
= strlen (suffix
);
265 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
266 char *buf
= (char *) alloca (namelen
+ suffixlen
+ extlen
);
269 if (basic_block_info
== NULL
)
272 memcpy (buf
, base
, namelen
);
273 memcpy (buf
+ namelen
, suffix
, suffixlen
);
274 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
276 fp
= fopen (buf
, "a");
281 fprintf (fp
, "(nil)\n");
285 enum bb_state
{ NOT_IN_BB
, IN_ONE_BB
, IN_MULTIPLE_BB
};
286 int max_uid
= get_max_uid ();
287 int *start
= (int *) xmalloc (max_uid
* sizeof (int));
288 int *end
= (int *) xmalloc (max_uid
* sizeof (int));
289 enum bb_state
*in_bb_p
= (enum bb_state
*)
290 xmalloc (max_uid
* sizeof (enum bb_state
));
293 for (i
= 0; i
< max_uid
; ++i
)
295 start
[i
] = end
[i
] = -1;
296 in_bb_p
[i
] = NOT_IN_BB
;
299 for (i
= n_basic_blocks
- 1; i
>= 0; --i
)
302 bb
= BASIC_BLOCK (i
);
303 start
[INSN_UID (bb
->head
)] = i
;
304 end
[INSN_UID (bb
->end
)] = i
;
305 for (x
= bb
->head
; x
!= NULL_RTX
; x
= NEXT_INSN (x
))
307 in_bb_p
[INSN_UID (x
)]
308 = (in_bb_p
[INSN_UID (x
)] == NOT_IN_BB
)
309 ? IN_ONE_BB
: IN_MULTIPLE_BB
;
315 /* Tell print-rtl that we want graph output. */
318 /* Start new function. */
321 for (tmp_rtx
= NEXT_INSN (rtx_first
); NULL
!= tmp_rtx
;
322 tmp_rtx
= NEXT_INSN (tmp_rtx
))
324 int edge_printed
= 0;
327 if (start
[INSN_UID (tmp_rtx
)] < 0 && end
[INSN_UID (tmp_rtx
)] < 0)
329 if (GET_CODE (tmp_rtx
) == BARRIER
)
331 if (GET_CODE (tmp_rtx
) == NOTE
332 && (1 || in_bb_p
[INSN_UID (tmp_rtx
)] == NOT_IN_BB
))
336 if ((i
= start
[INSN_UID (tmp_rtx
)]) >= 0)
338 /* We start a subgraph for each basic block. */
342 draw_edge (fp
, 0, INSN_UID (tmp_rtx
), 1, 0);
345 /* Print the data for this node. */
346 node_data (fp
, tmp_rtx
);
347 next_insn
= next_nonnote_insn (tmp_rtx
);
349 if ((i
= end
[INSN_UID (tmp_rtx
)]) >= 0)
353 bb
= BASIC_BLOCK (i
);
355 /* End of the basic block. */
358 /* Now specify the edges to all the successors of this
360 for (e
= bb
->succ
; e
; e
= e
->succ_next
)
362 if (e
->dest
!= EXIT_BLOCK_PTR
)
364 rtx block_head
= e
->dest
->head
;
366 draw_edge (fp
, INSN_UID (tmp_rtx
),
367 INSN_UID (block_head
),
368 next_insn
!= block_head
,
369 (e
->flags
& EDGE_ABNORMAL
? 2 : 0));
371 if (block_head
== next_insn
)
376 draw_edge (fp
, INSN_UID (tmp_rtx
), 999999,
378 (e
->flags
& EDGE_ABNORMAL
? 2 : 0));
388 /* Don't print edges to barriers. */
390 || GET_CODE (next_insn
) != BARRIER
)
391 draw_edge (fp
, XINT (tmp_rtx
, 0),
392 next_insn
? INSN_UID (next_insn
) : 999999, 0, 0);
395 /* We draw the remaining edges in class 3. We have
396 to skip over the barrier since these nodes are
397 not printed at all. */
399 next_insn
= NEXT_INSN (next_insn
);
401 && (GET_CODE (next_insn
) == NOTE
402 || GET_CODE (next_insn
) == BARRIER
));
404 draw_edge (fp
, XINT (tmp_rtx
, 0),
405 next_insn
? INSN_UID (next_insn
) : 999999, 0, 3);
424 /* Similar as clean_dump_file, but this time for graph output files. */
426 clean_graph_dump_file (base
, suffix
)
430 size_t namelen
= strlen (base
);
431 size_t suffixlen
= strlen (suffix
);
432 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
433 char *buf
= (char *) alloca (namelen
+ extlen
+ suffixlen
);
436 memcpy (buf
, base
, namelen
);
437 memcpy (buf
+ namelen
, suffix
, suffixlen
);
438 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
440 fp
= fopen (buf
, "w");
443 pfatal_with_name (buf
);
445 switch (graph_dump_format
)
448 fputs ("graph: {\nport_sharing: no\n", fp
);
458 /* Do final work on the graph output file. */
460 finish_graph_dump_file (base
, suffix
)
464 size_t namelen
= strlen (base
);
465 size_t suffixlen
= strlen (suffix
);
466 size_t extlen
= strlen (graph_ext
[graph_dump_format
]) + 1;
467 char *buf
= (char *) alloca (namelen
+ suffixlen
+ extlen
);
470 memcpy (buf
, base
, namelen
);
471 memcpy (buf
+ namelen
, suffix
, suffixlen
);
472 memcpy (buf
+ namelen
+ suffixlen
, graph_ext
[graph_dump_format
], extlen
);
474 fp
= fopen (buf
, "a");
477 switch (graph_dump_format
)