/* Output routines for graphical representation.
- Copyright (C) 1998 Free Software Foundation, Inc.
+ Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
- This file is part of GNU CC.
+This file is part of GCC.
- GNU CC is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2, or (at your option)
- any later version.
+GCC is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free
+Software Foundation; either version 2, or (at your option) any later
+version.
- GNU CC is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
+GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+for more details.
- You should have received a copy of the GNU General Public License
- along with GNU CC; see the file COPYING. If not, write to
- the Free Software Foundation, 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
+You should have received a copy of the GNU General Public License
+along with GCC; see the file COPYING. If not, write to the Free
+Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+02111-1307, USA. */
#include <config.h>
#include "system.h"
+#include "coretypes.h"
+#include "tm.h"
#include "rtl.h"
#include "flags.h"
#include "output.h"
+#include "function.h"
#include "hard-reg-set.h"
#include "basic-block.h"
#include "toplev.h"
+#include "graph.h"
-static const char *graph_ext[] =
+static const char *const graph_ext[] =
{
/* no_graph */ "",
/* vcg */ ".vcg",
};
+static void start_fct PARAMS ((FILE *));
+static void start_bb PARAMS ((FILE *, int));
+static void node_data PARAMS ((FILE *, rtx));
+static void draw_edge PARAMS ((FILE *, int, int, int, int));
+static void end_fct PARAMS ((FILE *));
+static void end_bb PARAMS ((FILE *));
+
/* Output text for new basic block. */
static void
start_fct (fp)
}
#if 0
- /* FIXME Should this be printed? It makes the graph significantly larger. */
+ /* FIXME Should this be printed? It makes the graph significantly larger. */
/* Print the live-at-start register list. */
fputc ('\n', fp);
}
}
-static int
+static void
node_data (fp, tmp_rtx)
FILE *fp;
rtx tmp_rtx;
{
- int result;
if (PREV_INSN (tmp_rtx) == 0)
{
/* Print the RTL. */
if (GET_CODE (tmp_rtx) == NOTE)
{
- static const char *note_names[] =
- {
- NULL,
- "deleted",
- "block_beg",
- "block_end",
- "loop_beg",
- "loop_end",
- "function_end",
- "setjmp",
- "loop_cont",
- "loop_vtop",
- "prologue_end",
- "epilogue_beg",
- "deleted_label",
- "function_beg",
- "eh_region_beg",
- "eh_region_end",
- "repeated_line_number",
- "range_start",
- "range_end",
- "live"
- };
-
- fprintf (fp, " %s",
- XINT (tmp_rtx, 4) < 0 ? note_names[-XINT (tmp_rtx, 4)] : "");
+ const char *name = "";
+ if (NOTE_LINE_NUMBER (tmp_rtx) < 0)
+ name = GET_NOTE_INSN_NAME (NOTE_LINE_NUMBER (tmp_rtx));
+ fprintf (fp, " %s", name);
}
- else if (GET_RTX_CLASS (GET_CODE (tmp_rtx)) == 'i')
- result = print_rtl_single (fp, PATTERN (tmp_rtx));
+ else if (INSN_P (tmp_rtx))
+ print_rtl_single (fp, PATTERN (tmp_rtx));
else
- result = print_rtl_single (fp, tmp_rtx);
+ print_rtl_single (fp, tmp_rtx);
switch (graph_dump_format)
{
case no_graph:
break;
}
-
- return result;
}
static void
int bb_edge;
int class;
{
+ const char * color;
switch (graph_dump_format)
{
case vcg:
+ color = "";
+ if (class == 2)
+ color = "color: red ";
+ else if (bb_edge)
+ color = "color: blue ";
+ else if (class == 3)
+ color = "color: green ";
fprintf (fp,
"edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s",
current_function_name, from,
- current_function_name, to,
- bb_edge ? "color: blue " : class ? "color: red " : "");
+ current_function_name, to, color);
if (class)
fprintf (fp, "class: %d ", class);
fputs ("}\n", fp);
}
static void
-end_bb (fp, bb)
+end_bb (fp)
FILE *fp;
- int bb ATTRIBUTE_UNUSED;
{
switch (graph_dump_format)
{
const char *suffix;
rtx rtx_first;
{
- register rtx tmp_rtx;
+ rtx tmp_rtx;
size_t namelen = strlen (base);
size_t suffixlen = strlen (suffix);
size_t extlen = strlen (graph_ext[graph_dump_format]) + 1;
char *buf = (char *) alloca (namelen + suffixlen + extlen);
FILE *fp;
- /* Regenerate the basic block information. */
- find_basic_blocks (rtx_first, max_reg_num (), NULL);
+ if (basic_block_info == NULL)
+ return;
memcpy (buf, base, namelen);
memcpy (buf + namelen, suffix, suffixlen);
fprintf (fp, "(nil)\n");
else
{
- int i, bb;
enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
int max_uid = get_max_uid ();
- int *start = (int *) alloca (max_uid * sizeof (int));
- int *end = (int *) alloca (max_uid * sizeof (int));
+ int *start = (int *) xmalloc (max_uid * sizeof (int));
+ int *end = (int *) xmalloc (max_uid * sizeof (int));
enum bb_state *in_bb_p = (enum bb_state *)
- alloca (max_uid * sizeof (enum bb_state));
- /* Element I is a list of I's predecessors/successors. */
- int_list_ptr *s_preds;
- int_list_ptr *s_succs;
- /* Element I is the number of predecessors/successors of basic
- block I. */
- int *num_preds;
- int *num_succs;
+ xmalloc (max_uid * sizeof (enum bb_state));
+ basic_block bb;
+ int i;
for (i = 0; i < max_uid; ++i)
{
in_bb_p[i] = NOT_IN_BB;
}
- for (i = n_basic_blocks - 1; i >= 0; --i)
+ FOR_EACH_BB_REVERSE (bb)
{
rtx x;
- start[INSN_UID (BLOCK_HEAD (i))] = i;
- end[INSN_UID (BLOCK_END (i))] = i;
- for (x = BLOCK_HEAD (i); x != NULL_RTX; x = NEXT_INSN (x))
+ start[INSN_UID (bb->head)] = bb->index;
+ end[INSN_UID (bb->end)] = bb->index;
+ for (x = bb->head; x != NULL_RTX; x = NEXT_INSN (x))
{
in_bb_p[INSN_UID (x)]
= (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
? IN_ONE_BB : IN_MULTIPLE_BB;
- if (x == BLOCK_END (i))
+ if (x == bb->end)
break;
}
}
- /* Get the information about the basic blocks predecessors and
- successors. */
- s_preds = (int_list_ptr *) alloca (n_basic_blocks
- * sizeof (int_list_ptr));
- s_succs = (int_list_ptr *) alloca (n_basic_blocks
- * sizeof (int_list_ptr));
- num_preds = (int *) alloca (n_basic_blocks * sizeof (int));
- num_succs = (int *) alloca (n_basic_blocks * sizeof (int));
- compute_preds_succs (s_preds, s_succs, num_preds, num_succs);
-
/* Tell print-rtl that we want graph output. */
dump_for_graph = 1;
for (tmp_rtx = NEXT_INSN (rtx_first); NULL != tmp_rtx;
tmp_rtx = NEXT_INSN (tmp_rtx))
{
- int did_output;
int edge_printed = 0;
rtx next_insn;
continue;
}
- if ((bb = start[INSN_UID (tmp_rtx)]) >= 0)
+ if ((i = start[INSN_UID (tmp_rtx)]) >= 0)
{
/* We start a subgraph for each basic block. */
- start_bb (fp, bb);
+ start_bb (fp, i);
- if (bb == 0)
+ if (i == 0)
draw_edge (fp, 0, INSN_UID (tmp_rtx), 1, 0);
}
/* Print the data for this node. */
- did_output = node_data (fp, tmp_rtx);
+ node_data (fp, tmp_rtx);
next_insn = next_nonnote_insn (tmp_rtx);
- if ((bb = end[INSN_UID (tmp_rtx)]) >= 0)
+ if ((i = end[INSN_UID (tmp_rtx)]) >= 0)
{
- int_list_ptr p;
+ edge e;
+
+ bb = BASIC_BLOCK (i);
/* End of the basic block. */
- end_bb (fp, bb);
+ end_bb (fp);
/* Now specify the edges to all the successors of this
basic block. */
- for (p = s_succs[bb]; p != NULL; p = p->next)
+ for (e = bb->succ; e ; e = e->succ_next)
{
- int bb_succ = INT_LIST_VAL (p);
-
- if (bb_succ >= 0)
+ if (e->dest != EXIT_BLOCK_PTR)
{
- rtx block_head = BLOCK_HEAD (bb_succ);
+ rtx block_head = e->dest->head;
draw_edge (fp, INSN_UID (tmp_rtx),
INSN_UID (block_head),
- next_insn != block_head, 0);
+ next_insn != block_head,
+ (e->flags & EDGE_ABNORMAL ? 2 : 0));
- if (BLOCK_HEAD (bb_succ) == next_insn)
+ if (block_head == next_insn)
edge_printed = 1;
}
- else if (bb_succ == EXIT_BLOCK)
+ else
{
draw_edge (fp, INSN_UID (tmp_rtx), 999999,
- next_insn != 0, 0);
+ next_insn != 0,
+ (e->flags & EDGE_ABNORMAL ? 2 : 0));
if (next_insn == 0)
edge_printed = 1;
}
- else
- abort ();
}
}
next_insn ? INSN_UID (next_insn) : 999999, 0, 0);
else
{
- /* We draw the remaining edges in class 2. We have
- to skip oevr the barrier since these nodes are
+ /* We draw the remaining edges in class 3. We have
+ to skip over the barrier since these nodes are
not printed at all. */
do
next_insn = NEXT_INSN (next_insn);
|| GET_CODE (next_insn) == BARRIER));
draw_edge (fp, XINT (tmp_rtx, 0),
- next_insn ? INSN_UID (next_insn) : 999999, 0, 2);
+ next_insn ? INSN_UID (next_insn) : 999999, 0, 3);
}
}
}
dump_for_graph = 0;
end_fct (fp);
+
+ /* Clean up. */
+ free (start);
+ free (end);
+ free (in_bb_p);
}
fclose (fp);
/* Similar as clean_dump_file, but this time for graph output files. */
+
void
clean_graph_dump_file (base, suffix)
const char *base;
fp = fopen (buf, "w");
if (fp == NULL)
- pfatal_with_name (buf);
+ fatal_io_error ("can't open %s", buf);
switch (graph_dump_format)
{
OSDN Git Service
