X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fgraph.c;h=38e72946789ce44e93932d69580fbf6c7be13576;hb=6fe60bfdba8c1d684d9de61f4a39162ff7cfa33d;hp=4f8929d2c6374c5a80ae7fdd16e36ec0a425e6c7;hpb=fdeac5cec68297213b829b922bc6dea485688a5b;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/graph.c b/gcc/graph.c index 4f8929d2c63..38e72946789 100644 --- a/gcc/graph.c +++ b/gcc/graph.c @@ -1,60 +1,61 @@ /* Output routines for graphical representation. - Copyright (C) 1998, 1999 Free Software Foundation, Inc. + Copyright (C) 1998, 1999, 2000, 2001, 2003, 2004, 2007, 2008 + Free Software Foundation, Inc. Contributed by Ulrich Drepper , 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 3, 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 COPYING3. If not see +. */ #include #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 "obstack.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 PROTO ((FILE *)); -static void start_bb PROTO ((FILE *, int)); -static void node_data PROTO ((FILE *, rtx)); -static void draw_edge PROTO ((FILE *, int, int, int, int)); -static void end_fct PROTO ((FILE *)); -static void end_bb PROTO ((FILE *)); +static void start_fct (FILE *); +static void start_bb (FILE *, int); +static void node_data (FILE *, rtx); +static void draw_edge (FILE *, int, int, int, int); +static void end_fct (FILE *); +static void end_bb (FILE *); /* Output text for new basic block. */ static void -start_fct (fp) - FILE *fp; +start_fct (FILE *fp) { - switch (graph_dump_format) { case vcg: fprintf (fp, "\ graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n", - current_function_name, current_function_name); + current_function_name (), current_function_name ()); break; case no_graph: break; @@ -62,34 +63,35 @@ graph: { title: \"%s\"\nfolding: 1\nhidden: 2\nnode: { title: \"%s.0\" }\n", } static void -start_bb (fp, bb) - FILE *fp; - int bb; +start_bb (FILE *fp, int bb) { +#if 0 + reg_set_iterator rsi; +#endif + switch (graph_dump_format) { case vcg: fprintf (fp, "\ graph: {\ntitle: \"%s.BB%d\"\nfolding: 1\ncolor: lightblue\n\ label: \"basic block %d", - current_function_name, bb, bb); + current_function_name (), bb, bb); break; case no_graph: break; } #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); - EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start[bb], 0, i, - { - fprintf (fp, " %d", i); - if (i < FIRST_PSEUDO_REGISTER) - fprintf (fp, " [%s]", - reg_names[i]); - }); + EXECUTE_IF_SET_IN_REG_SET (basic_block_live_at_start[bb], 0, i, rsi) + { + fprintf (fp, " %d", i); + if (i < FIRST_PSEUDO_REGISTER) + fprintf (fp, " [%s]", reg_names[i]); + } #endif switch (graph_dump_format) @@ -103,11 +105,8 @@ label: \"basic block %d", } static void -node_data (fp, tmp_rtx) - FILE *fp; - rtx tmp_rtx; +node_data (FILE *fp, rtx tmp_rtx) { - if (PREV_INSN (tmp_rtx) == 0) { /* This is the first instruction. Add an edge from the starting @@ -117,8 +116,8 @@ node_data (fp, tmp_rtx) case vcg: fprintf (fp, "\ edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n", - current_function_name, - current_function_name, XINT (tmp_rtx, 0)); + current_function_name (), + current_function_name (), XINT (tmp_rtx, 0)); break; case no_graph: break; @@ -130,12 +129,12 @@ edge: { sourcename: \"%s.0\" targetname: \"%s.%d\" }\n", case vcg: fprintf (fp, "node: {\n title: \"%s.%d\"\n color: %s\n \ label: \"%s %d\n", - current_function_name, XINT (tmp_rtx, 0), - GET_CODE (tmp_rtx) == NOTE ? "lightgrey" - : GET_CODE (tmp_rtx) == INSN ? "green" - : GET_CODE (tmp_rtx) == JUMP_INSN ? "darkgreen" - : GET_CODE (tmp_rtx) == CALL_INSN ? "darkgreen" - : GET_CODE (tmp_rtx) == CODE_LABEL ? "\ + current_function_name (), XINT (tmp_rtx, 0), + NOTE_P (tmp_rtx) ? "lightgrey" + : NONJUMP_INSN_P (tmp_rtx) ? "green" + : JUMP_P (tmp_rtx) ? "darkgreen" + : CALL_P (tmp_rtx) ? "darkgreen" + : LABEL_P (tmp_rtx) ? "\ darkgrey\n shape: ellipse" : "white", GET_RTX_NAME (GET_CODE (tmp_rtx)), XINT (tmp_rtx, 0)); break; @@ -144,37 +143,13 @@ darkgrey\n shape: ellipse" : "white", } /* Print the RTL. */ - if (GET_CODE (tmp_rtx) == NOTE) + if (NOTE_P (tmp_rtx)) { - 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", - "basic_block" - }; - - fprintf (fp, " %s", - XINT (tmp_rtx, 4) < 0 ? note_names[-XINT (tmp_rtx, 4)] : ""); + const char *name; + name = GET_NOTE_INSN_NAME (NOTE_KIND (tmp_rtx)); + fprintf (fp, " %s", name); } - else if (GET_RTX_CLASS (GET_CODE (tmp_rtx)) == 'i') + else if (INSN_P (tmp_rtx)) print_rtl_single (fp, PATTERN (tmp_rtx)); else print_rtl_single (fp, tmp_rtx); @@ -190,30 +165,25 @@ darkgrey\n shape: ellipse" : "white", } static void -draw_edge (fp, from, to, bb_edge, class) - FILE *fp; - int from; - int to; - int bb_edge; - int class; +draw_edge (FILE *fp, int from, int to, int bb_edge, int color_class) { const char * color; switch (graph_dump_format) { case vcg: color = ""; - if (class == 2) + if (color_class == 2) color = "color: red "; else if (bb_edge) color = "color: blue "; - else if (class == 3) + else if (color_class == 3) color = "color: green "; fprintf (fp, "edge: { sourcename: \"%s.%d\" targetname: \"%s.%d\" %s", - current_function_name, from, - current_function_name, to, color); - if (class) - fprintf (fp, "class: %d ", class); + current_function_name (), from, + current_function_name (), to, color); + if (color_class) + fprintf (fp, "class: %d ", color_class); fputs ("}\n", fp); break; case no_graph: @@ -222,8 +192,7 @@ draw_edge (fp, from, to, bb_edge, class) } static void -end_bb (fp) - FILE *fp; +end_bb (FILE *fp) { switch (graph_dump_format) { @@ -236,14 +205,13 @@ end_bb (fp) } static void -end_fct (fp) - FILE *fp; +end_fct (FILE *fp) { switch (graph_dump_format) { case vcg: fprintf (fp, "node: { title: \"%s.999999\" label: \"END\" }\n}\n", - current_function_name); + current_function_name ()); break; case no_graph: break; @@ -253,24 +221,19 @@ end_fct (fp) /* Like print_rtl, but also print out live information for the start of each basic block. */ void -print_rtl_graph_with_bb (base, suffix, rtx_first) - const char *base; - const char *suffix; - rtx rtx_first; +print_rtl_graph_with_bb (const char *base, 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); + char *buf = XALLOCAVEC (char, namelen + extlen); FILE *fp; if (basic_block_info == NULL) return; memcpy (buf, base, namelen); - memcpy (buf + namelen, suffix, suffixlen); - memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen); + memcpy (buf + namelen, graph_ext[graph_dump_format], extlen); fp = fopen (buf, "a"); if (fp == NULL) @@ -280,14 +243,13 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) fprintf (fp, "(nil)\n"); else { - int i; 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)); - enum bb_state *in_bb_p = (enum bb_state *) - alloca (max_uid * sizeof (enum bb_state)); + int *start = XNEWVEC (int, max_uid); + int *end = XNEWVEC (int, max_uid); + enum bb_state *in_bb_p = XNEWVEC (enum bb_state, max_uid); basic_block bb; + int i; for (i = 0; i < max_uid; ++i) { @@ -295,18 +257,17 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) in_bb_p[i] = NOT_IN_BB; } - for (i = n_basic_blocks - 1; i >= 0; --i) + FOR_EACH_BB_REVERSE (bb) { rtx x; - bb = BASIC_BLOCK (i); - start[INSN_UID (bb->head)] = i; - end[INSN_UID (bb->end)] = i; - for (x = bb->head; x != NULL_RTX; x = NEXT_INSN (x)) + start[INSN_UID (BB_HEAD (bb))] = bb->index; + end[INSN_UID (BB_END (bb))] = bb->index; + for (x = BB_HEAD (bb); 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 == bb->end) + if (x == BB_END (bb)) break; } } @@ -325,9 +286,9 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) if (start[INSN_UID (tmp_rtx)] < 0 && end[INSN_UID (tmp_rtx)] < 0) { - if (GET_CODE (tmp_rtx) == BARRIER) + if (BARRIER_P (tmp_rtx)) continue; - if (GET_CODE (tmp_rtx) == NOTE + if (NOTE_P (tmp_rtx) && (1 || in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB)) continue; } @@ -348,6 +309,7 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) if ((i = end[INSN_UID (tmp_rtx)]) >= 0) { edge e; + edge_iterator ei; bb = BASIC_BLOCK (i); @@ -356,11 +318,11 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) /* Now specify the edges to all the successors of this basic block. */ - for (e = bb->succ; e ; e = e->succ_next) + FOR_EACH_EDGE (e, ei, bb->succs) { if (e->dest != EXIT_BLOCK_PTR) { - rtx block_head = e->dest->head; + rtx block_head = BB_HEAD (e->dest); draw_edge (fp, INSN_UID (tmp_rtx), INSN_UID (block_head), @@ -386,7 +348,7 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) { /* Don't print edges to barriers. */ if (next_insn == 0 - || GET_CODE (next_insn) != BARRIER) + || !BARRIER_P (next_insn)) draw_edge (fp, XINT (tmp_rtx, 0), next_insn ? INSN_UID (next_insn) : 999999, 0, 0); else @@ -397,8 +359,8 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) do next_insn = NEXT_INSN (next_insn); while (next_insn - && (GET_CODE (next_insn) == NOTE - || GET_CODE (next_insn) == BARRIER)); + && (NOTE_P (next_insn) + || BARRIER_P (next_insn))); draw_edge (fp, XINT (tmp_rtx, 0), next_insn ? INSN_UID (next_insn) : 999999, 0, 3); @@ -409,6 +371,11 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) dump_for_graph = 0; end_fct (fp); + + /* Clean up. */ + free (start); + free (end); + free (in_bb_p); } fclose (fp); @@ -416,34 +383,25 @@ print_rtl_graph_with_bb (base, suffix, rtx_first) /* Similar as clean_dump_file, but this time for graph output files. */ + void -clean_graph_dump_file (base, suffix) - const char *base; - const char *suffix; +clean_graph_dump_file (const char *base) { 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 + extlen + suffixlen); + char *buf = XALLOCAVEC (char, namelen + extlen); FILE *fp; memcpy (buf, base, namelen); - memcpy (buf + namelen, suffix, suffixlen); - memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen); + memcpy (buf + namelen, graph_ext[graph_dump_format], extlen); fp = fopen (buf, "w"); if (fp == NULL) - pfatal_with_name (buf); + fatal_error ("can't open %s: %m", buf); - switch (graph_dump_format) - { - case vcg: - fputs ("graph: {\nport_sharing: no\n", fp); - break; - case no_graph: - abort (); - } + gcc_assert (graph_dump_format == vcg); + fputs ("graph: {\nport_sharing: no\n", fp); fclose (fp); } @@ -451,32 +409,21 @@ clean_graph_dump_file (base, suffix) /* Do final work on the graph output file. */ void -finish_graph_dump_file (base, suffix) - const char *base; - const char *suffix; +finish_graph_dump_file (const char *base) { 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); + char *buf = XALLOCAVEC (char, namelen + extlen); FILE *fp; memcpy (buf, base, namelen); - memcpy (buf + namelen, suffix, suffixlen); - memcpy (buf + namelen + suffixlen, graph_ext[graph_dump_format], extlen); + memcpy (buf + namelen, graph_ext[graph_dump_format], extlen); fp = fopen (buf, "a"); if (fp != NULL) { - switch (graph_dump_format) - { - case vcg: - fputs ("}\n", fp); - break; - case no_graph: - abort (); - } - + gcc_assert (graph_dump_format == vcg); + fputs ("}\n", fp); fclose (fp); } }