X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firdump.c;h=337c091a67260c5e4eef05ae2a102dd5d2ffe2c0;hb=30b120caf1fbc6fcb13c6b3bef8f7132ebff72aa;hp=16e8fc52625bceb963ade8fce44fe9d746ba425d;hpb=f1b9fb1a497a51d1856aa95b1e39e8b7663e983c;p=libfirm diff --git a/ir/ir/irdump.c b/ir/ir/irdump.c index 16e8fc526..337c091a6 100644 --- a/ir/ir/irdump.c +++ b/ir/ir/irdump.c @@ -1,54 +1,74 @@ -/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -* All rights reserved. -* -* Authors: Martin Trapp, Christian Schaefer -* -* irdump.h: dumping of an intermediate representation graph -*/ +/* + * Project: libFIRM + * File name: ir/ir/irdump.c + * Purpose: Write vcg representation of firm to file. + * Author: Martin Trapp, Christian Schaefer + * Modified by: Goetz Lindenmaier, Hubert Schmidt + * Created: + * CVS-ID: $Id$ + * Copyright: (c) 1998-2003 Universität Karlsruhe + * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + */ -/* $Id$ */ #ifdef HAVE_CONFIG_H # include #endif +# include +# include +# include + # include "irnode_t.h" # include "irgraph_t.h" -# include "irprog.h" -# include "irdump.h" -# include "panic.h" -# include # include "entity_t.h" -# include -# include "array.h" # include "irop_t.h" -# include "tv.h" -# include "type_or_entity.h" +# include "firm_common_t.h" + +# include "irdump.h" + # include "irgwalk.h" # include "typewalk.h" +# include "irprog.h" +# include "tv_t.h" +# include "type_or_entity.h" # include "irouts.h" # include "irdom.h" -# include "firm_common_t.h" -# include "irloop.h" - -# include "exc.h" +# include "irloop.h" +# include "irvrfy.h" +# include "panic.h" +# include "array.h" # include "pmap.h" +# include "eset.h" + +#if DO_HEAPANALYSIS +void dump_chi_term(FILE *FL, ir_node *n); +void dump_state(FILE *FL, ir_node *n); +int get_opt_dump_abstvals(void); +typedef unsigned long SeqNo; +SeqNo get_Block_seqno(ir_node *n); +#endif /* Attributes of nodes */ -#define DEFAULT_NODE_ATTR "" -#define DEFAULT_TYPE_ATTRIBUTE "" +#define PRINT_DEFAULT_NODE_ATTR +#define DEFAULT_NODE_ATTR " " +#define DEFAULT_TYPE_ATTRIBUTE " " +#define DEFAULT_ENUM_ITEM_ATTRIBUTE " " /* Attributes of edges between Firm nodes */ -#define BLOCK_EDGE_ATTR "class: 2 priority: 2 linestyle: dotted" -#define CF_EDGE_ATTR "color: red" -#define MEM_EDGE_ATTR "color: blue" -#define DOMINATOR_EDGE_ATTR "color: red" +#define INTRA_DATA_EDGE_ATTR "class:1 priority:50" +#define INTER_DATA_EDGE_ATTR "class:16 priority:10" +#define BLOCK_EDGE_ATTR "class:2 priority:50 linestyle:dotted" +#define CF_EDGE_ATTR "class:13 priority:60 color:red" +#define INTRA_MEM_EDGE_ATTR "class:14 priority:50 color:blue" +#define INTER_MEM_EDGE_ATTR "class:17 priority:10 color:blue" +#define DOMINATOR_EDGE_ATTR "class:15 color:red" -#define BACK_EDGE_ATTR "linestyle: dashed " +#define BACK_EDGE_ATTR "linestyle:dashed " /* Attributes of edges between Firm nodes and type/entity nodes */ -#define NODE2TYPE_EDGE_ATTR "class: 2 priority: 2 linestyle: dotted" +#define NODE2TYPE_EDGE_ATTR "class:2 priority:2 linestyle:dotted" /* Attributes of edges in type/entity graphs. */ #define TYPE_METH_NODE_ATTR "color: lightyellow" @@ -68,35 +88,272 @@ #define ENT_VALUE_EDGE_ATTR "label: \"value %d\"" #define ENT_CORR_EDGE_ATTR "label: \"value %d corresponds to \" " #define TYPE_MEMBER_EDGE_ATTR "class: 12 label: \"member\" color:blue" - +#define ENUM_ITEM_NODE_ATTR "color: green" #if DEBUG_libfirm && NODEID_AS_LABEL #define PRINT_NODEID(X) fprintf(F, "n%ld", get_irn_node_nr(X)) -#define PRINT_TYPEID(X) fprintf(F, "t%ld", get_type_nr(X)) -#define PRINT_ENTID(X) fprintf(F, "e%ld", get_entity_nr(X)) -#define PRINT_IRGID(X) fprintf(F,"g%ld", get_irg_graph_nr(X)) +#define PRINT_TYPEID(X) fprintf(F, "\"t%ld\"", get_type_nr(X)) +#define PRINT_ENTID(X) fprintf(F, "e%ld", get_entity_nr(X)) +#define PRINT_IRGID(X) fprintf(F, "g%ld", get_irg_graph_nr(X)) +#define PRINT_CONSTID(X,Y) fprintf(F, "\"n%ldn%ld\"", get_irn_node_nr(X),get_irn_node_nr(Y)) +#define PRINT_LOOPID(X) fprintf(F, "l%d", get_loop_loop_nr(X)) +#define PRINT_ITEMID(X,Y) fprintf(F, "i%ldT%d", get_type_nr(X), (Y)) + #else -#define PRINT_NODEID(X) fprintf(F, "%p", X) -#define PRINT_TYPEID(X) fprintf(F, "%p", X) -#define PRINT_ENTID(X) fprintf(F, "%p", X) -#define PRINT_IRGID(X) fprintf(F,"%p",X) +#define PRINT_NODEID(X) fprintf(F, "n%p", (void *)(X)) +#define PRINT_TYPEID(X) fprintf(F, "\"t%p\"", (void *)(X)) +#define PRINT_ENTID(X) fprintf(F, "e%p", (void *)(X)) +#define PRINT_IRGID(X) fprintf(F, "g%p",(void *)(X)) +#define PRINT_CONSTID(X,Y) fprintf(F, "\"n%pn%p\"", (void*)(X), (void*)(Y)) +#define PRINT_LOOPID(X) fprintf(F, "l%p", (void *)(X)) +#define PRINT_ITEMID(X,Y) fprintf(F, "i%pT%d", (void *) (X), (Y)) #endif -#define PRINT_TYPE_TYPE_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_TYPEID(S); fprintf (F, "\" targetname: \""); PRINT_TYPEID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_TYPE_ENT_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_TYPEID(S); fprintf (F, "\" targetname: \""); PRINT_ENTID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_ENT_ENT_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_ENTID(S); fprintf (F, "\" targetname: \""); PRINT_ENTID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_ENT_TYPE_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_ENTID(S); fprintf (F, "\" targetname: \""); PRINT_TYPEID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_NODE_TYPE_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_NODEID(S); fprintf (F, "\" targetname: \""); PRINT_TYPEID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_NODE_ENT_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_NODEID(S); fprintf (F, "\" targetname: \""); PRINT_ENTID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} -#define PRINT_ENT_NODE_EDGE(S,T,ATR,...) {fprintf (F, "edge: { sourcename:\""); PRINT_ENTID(S); fprintf (F, "\" targetname: \""); PRINT_NODEID(T); fprintf (F,"\" " ATR "}\n",##__VA_ARGS__);} +static const char *get_mode_name_ex(ir_mode *mode, int *bad) +{ + if (is_mode(mode)) + return get_mode_name(mode); + *bad |= 1; + return ""; +} + +static const char *get_type_name_ex(type *tp, int *bad) +{ + if (is_type(tp)) + return get_type_name(tp); + *bad |= 1; + return ""; +} + +static void print_type_type_edge(FILE *F, type *S, type *T, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S); + fprintf(F, " targetname: "); PRINT_TYPEID(T); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} + +static void print_type_ent_edge(FILE *F, type *T, entity *E, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T); + fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\""); + vfprintf(F, fmt, ap); + fprintf(F, "}\n"); + va_end(ap); +} + +static void print_ent_ent_edge(FILE *F, entity *E, entity *T, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E); + fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\""); + vfprintf(F, fmt, ap); + fprintf(F, "}\n"); + va_end(ap); +} + +static void print_ent_type_edge(FILE *F, entity *E, type *T, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E); + fprintf(F, "\" targetname: "); PRINT_TYPEID(T); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} + +static void print_node_type_edge(FILE *F, const ir_node *N, type *T, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N); + fprintf(F, "\" targetname: "); PRINT_TYPEID(T); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} + +static void print_node_ent_edge(FILE *F, const ir_node *N, entity *E, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N); + fprintf(F, "\" targetname: \""); PRINT_ENTID(E); + fprintf(F, "\""); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} + +static void print_ent_node_edge(FILE *F, entity *E, const ir_node *N, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E); + fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\""); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} + +static void print_enum_item_edge(FILE *F, type *E, int item, const char *fmt, ...) +{ + va_list ap; + + va_start(ap, fmt); + fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E); + fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" "); + vfprintf(F, fmt, ap); + fprintf(F,"}\n"); + va_end(ap); +} +/*******************************************************************/ +/* global and ahead declarations */ +/*******************************************************************/ /* A suffix to manipulate the file name. */ -char *dump_file_suffix = NULL; +char *dump_file_suffix = ""; + +char *dump_file_filter = ""; /* file to dump to */ static FILE *F; +static void dump_whole_node(ir_node *n, void* env); +static INLINE void dump_loop_nodes_into_graph(ir_graph *irg); + +/*******************************************************************/ +/* Helper functions. */ +/*******************************************************************/ + +/* Use private link attr to be able to call dumper anywhere without + destroying link fields. */ + +static pmap *irdump_link_map = NULL; + +static void init_irdump(void) { + /* We need a new, empty map. */ + if (irdump_link_map) pmap_destroy(irdump_link_map); + irdump_link_map = pmap_create(); +} + + +void *ird_get_irn_link(ir_node *n) { + void *res = NULL; + if (!irdump_link_map) return NULL; + + if (pmap_contains(irdump_link_map, (void *)n)) + res = pmap_get(irdump_link_map, (void *)n); + return res; +} + +void ird_set_irn_link(ir_node *n, void *x) { + if (!irdump_link_map) init_irdump(); + pmap_insert(irdump_link_map, (void *)n, x); +} + +void *ird_get_irg_link(ir_graph *irg) { + void *res = NULL; + if (!irdump_link_map) return NULL; + + if (pmap_contains(irdump_link_map, (void *)irg)) + res = pmap_get(irdump_link_map, (void *)irg); + return res; +} + +void ird_set_irg_link(ir_graph *irg, void *x) { + if (!irdump_link_map) init_irdump(); + pmap_insert(irdump_link_map, (void *)irg, x); +} + +static void clear_link(ir_node * node, void * env) { + ird_set_irn_link(node, NULL); +} + + +static int node_floats(ir_node *n) { + return ((get_op_pinned(get_irn_op(n)) == floats) && + (get_irg_pinned(current_ir_graph) == floats)); +} + +static const char *get_ent_dump_name(entity *ent) { + if (! ent) + return ""; + /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */ + if (ent->ld_name) return get_id_str(ent->ld_name); + return get_id_str(ent->name); +} + +static const char *get_irg_dump_name(ir_graph *irg) { + /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */ + entity *ent = get_irg_ent(irg); + return get_ent_dump_name(ent); +} + +static void collect_node(ir_node * node, void *env) { + if (is_Block(node) + || node_floats(node) + || get_irn_op(node) == op_Bad + || get_irn_op(node) == op_Unknown) { + ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node)); + if (!arr) arr = NEW_ARR_F(ir_node *, 0); + ARR_APP1(ir_node *, arr, node); + ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */ + } else { + ir_node * block = get_nodes_block(node); + ird_set_irn_link(node, ird_get_irn_link(block)); + ird_set_irn_link(block, node); + } +} + +/** Construct lists to walk ir block-wise. + * + * Collects all blocks, nodes not pinned, + * Bad and Unknown into a flexible array in link field of + * irg they belong to. Sets the irg link field to NULL in all + * graphs not visited. + * Free the list with DEL_ARR_F. */ +static ir_node ** construct_block_lists(ir_graph *irg) { + int i, rem_view = interprocedural_view; + ir_graph *rem = current_ir_graph; + current_ir_graph = irg; + + for (i = 0; i < get_irp_n_irgs(); i++) + ird_set_irg_link(get_irp_irg(i), NULL); + + irg_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph); + + /* Collect also EndReg and EndExcept. We do not want to change the walker. */ + interprocedural_view = 0; + set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1); + irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph); + set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1); + irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph); + interprocedural_view = rem_view; + + current_ir_graph = rem; + return ird_get_irg_link(irg); +} + +/*******************************************************************/ +/* flags to steer output */ +/*******************************************************************/ + /* A compiler option to turn off edge labels */ int edge_label = 1; /* A compiler option to turn off dumping values of constant entities */ @@ -107,65 +364,149 @@ int dump_keepalive = 0; int dump_out_edge_flag = 0; int dump_dominator_information_flag = 0; int dump_loop_information_flag = 0; +int dump_backedge_information_flag = 1; int dump_const_local = 0; +bool opt_dump_analysed_type_info = 1; +bool opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */ + +char* overrule_nodecolor = NULL; -static INLINE bool dump_const_local_set(void) { +INLINE bool get_opt_dump_const_local(void) { if (!dump_out_edge_flag && !dump_loop_information_flag) return dump_const_local; else return false; } -/* A global variable to record output of the Bad node. */ -static int Bad_dumped; +/* To turn off display of edge labels. Edge labels offen cause xvcg to + abort with a segmentation fault. */ +void turn_off_edge_labels(void) { + edge_label = 0; +} -static void dump_ir_blocks_nodes (ir_node *n, void *env); -static void dump_whole_node(ir_node *n, void* env); +void dump_consts_local(bool b) { + dump_const_local = b; +} -/*******************************************************************/ -/* routines to dump information about a single node */ -/*******************************************************************/ +void turn_off_constant_entity_values(void) { + const_entities = 0; +} +void dump_keepalive_edges(bool b) { + dump_keepalive = b; +} +bool get_opt_dump_keepalive_edges(void) { + return dump_keepalive; +} -static INLINE void -dump_node_opcode (ir_node *n) +void dump_out_edges(void) { + dump_out_edge_flag = 1; +} + +void dump_dominator_information(void) { + dump_dominator_information_flag = 1; +} + +void dump_loop_information(void) { + dump_loop_information_flag = 1; +} + +void dont_dump_loop_information(void) { + dump_loop_information_flag = 0; +} + +void dump_backedge_information(bool b) { + dump_backedge_information_flag = b; +} + +/* Dump the information of type field specified in ana/irtypeinfo.h. + * If the flag is set, the type name is output in [] in the node label, + * else it is output as info. + */ +void dump_analysed_type_info(bool b) { + opt_dump_analysed_type_info = b; +} + +void dump_pointer_values_to_info(bool b) { + opt_dump_pointer_values_to_info = b; +} + +/*******************************************************************/ +/* Routines to dump information about a single ir node. */ +/*******************************************************************/ + +INLINE int +dump_node_opcode(FILE *F, ir_node *n) { - assert(n && n->op); + int bad = 0; - /* Const */ - if (n->op->code == iro_Const) { - xfprintf (F, "%v", n->attr.con); + switch(get_irn_opcode(n)) { - /* SymConst */ - } else if (n->op->code == iro_SymConst) { - if (get_SymConst_kind(n) == linkage_ptr_info) { + case iro_Const: { + int res; + char buf[1024]; + res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n)); + assert(res < sizeof(buf) && "buffer to small for tarval_snprintf"); + fprintf(F, buf); + } break; + + case iro_SymConst: { + if (get_SymConst_kind(n) == symconst_addr_name) { /* don't use get_SymConst_ptr_info as it mangles the name. */ - xfprintf (F, "SymC %I", n->attr.i.tori.ptrinfo); + fprintf (F, "SymC %s", get_id_str(get_SymConst_name(n))); + } else if (get_SymConst_kind(n) == symconst_addr_ent) { + assert(get_SymConst_entity(n)); + assert(is_entity(get_SymConst_entity(n))); + fprintf (F, "SymC &%s", get_entity_name(get_SymConst_entity(n))); } else { assert(get_kind(get_SymConst_type(n)) == k_type); assert(get_type_ident(get_SymConst_type(n))); - xfprintf (F, "SymC %I ", get_type_ident(get_SymConst_type(n))); - if (get_SymConst_kind(n) == type_tag) + fprintf (F, "SymC %s ", get_type_name_ex(get_SymConst_type(n), &bad)); + if (get_SymConst_kind(n) == symconst_type_tag) fprintf (F, "tag"); else fprintf (F, "size"); } + } break; - /* Filter */ - } else if (n->op->code == iro_Filter && !interprocedural_view) { - fprintf(F, "Proj'"); + case iro_Filter: { + if (!interprocedural_view) fprintf(F, "Proj'"); + else fprintf(F, "%s", get_irn_opname(n)); + } break; - /* all others */ - } else { - xfprintf (F, "%I", get_irn_opident(n)); + case iro_Proj: { + ir_node *cond = get_Proj_pred(n); + + if (get_irn_opcode(cond) == iro_Cond + && get_Proj_proj(n) == get_Cond_defaultProj(cond) + && get_irn_mode(get_Cond_selector(cond)) != mode_b) + fprintf (F, "defProj"); + else + fprintf (F, "%s", get_irn_opname(n)); + } break; + + case iro_Start: { + if (interprocedural_view) { + fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_ent(get_irn_irg(n)))); + break; + } + } /* fall through */ + + default: { + fprintf (F, "%s", get_irn_opname(n)); } + + } /* end switch */ + return bad; } -static INLINE void +static INLINE int dump_node_mode (ir_node *n) { - switch (n->op->code) { + int bad = 0; + + switch (get_irn_opcode(n)) { case iro_Phi: case iro_Const: case iro_Id: @@ -183,45 +524,76 @@ dump_node_mode (ir_node *n) case iro_Shr: case iro_Abs: case iro_Cmp: - xfprintf (F, "%I", get_mode_ident(n->mode)); + case iro_Confirm: + fprintf (F, "%s", get_mode_name_ex(get_irn_mode(n), &bad)); break; default: ; } + return bad; } -static INLINE void +static int dump_node_typeinfo(ir_node *n) { + int bad = 0; + + if (opt_dump_analysed_type_info) { + if (get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_consistent || + get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_inconsistent ) { + type *tp = get_irn_type(n); + if (tp != none_type) + fprintf(F, " [%s]", get_type_name_ex(tp, &bad)); + else + fprintf(F, " []"); + } + } + return bad; +} + +static INLINE int dump_node_nodeattr (ir_node *n) { - switch (n->op->code) { + int bad = 0; + + switch (get_irn_opcode(n)) { case iro_Start: if (false && interprocedural_view) { - xfprintf (F, "%I", get_entity_ident(get_irg_ent(current_ir_graph))); + fprintf (F, "%s", get_ent_dump_name(get_irg_ent(current_ir_graph))); } break; case iro_Proj: - if (n->in[1]->op->code == iro_Cmp) { - fprintf (F, "%s", get_pnc_string(n->attr.proj)); + if (get_irn_opcode(get_Proj_pred(n)) == iro_Cmp) { + fprintf (F, "%s", get_pnc_string(get_Proj_proj(n))); } else { - xfprintf (F, "%ld", n->attr.proj); + fprintf (F, "%ld", get_Proj_proj(n)); } break; case iro_Filter: - xfprintf (F, "%ld", n->attr.filter.proj); + fprintf (F, "%ld", get_Filter_proj(n)); break; case iro_Sel: { - assert(get_kind(get_Sel_entity(n)) == k_entity); - xfprintf (F, "%I", get_entity_ident(get_Sel_entity(n))); + fprintf (F, "%s", get_ent_dump_name(get_Sel_entity(n))); + } break; + case iro_Cast: { + fprintf (F, "(%s)", get_type_name_ex(get_Cast_type(n), &bad)); } break; + case iro_Confirm: { + fprintf (F, "%s", get_pnc_string(get_Confirm_cmp(n))); + } break; + default: ; } /* end switch */ + + return bad; } -static INLINE void -dump_node_vcgattr (ir_node *n) +static INLINE void dump_node_vcgattr(ir_node *n, int bad) { - switch (n->op->code) { + if (bad) { + fprintf(F, "color: red"); + return; + } + switch (get_irn_opcode(n)) { case iro_Start: case iro_EndReg: /* fall through */ @@ -243,377 +615,379 @@ dump_node_vcgattr (ir_node *n) fprintf (F, "color: yellow"); break; default: - xfprintf (F, DEFAULT_NODE_ATTR); + PRINT_DEFAULT_NODE_ATTR; } + + if (overrule_nodecolor) fprintf(F, " color: %s", overrule_nodecolor); } -static bool pred_in_wrong_graph(ir_node *n, int pos, pmap *irgmap) { - ir_node *block = (is_Block(n)) ? n : get_nodes_Block(n); +static INLINE int dump_node_info(ir_node *n) +{ + int i, bad = 0; + char comma; + ir_graph *irg; + + fprintf (F, " info1: \""); + if (opt_dump_pointer_values_to_info) + fprintf (F, "addr: %p \n", (void *)n); + fprintf (F, "mode: %s\n", get_mode_name(get_irn_mode(n))); + fprintf (F, "visited: %ld \n", get_irn_visited(n)); + irg = get_irn_irg(n); + if (irg != get_const_code_irg()) + fprintf (F, "irg: %s\n", get_ent_dump_name(get_irg_entity(irg))); + + fprintf(F, "arity: %d", get_irn_arity(n)); + if ((get_irn_op(n) == op_Block) || + (get_irn_op(n) == op_Phi) || + ((get_irn_op(n) == op_Filter) && interprocedural_view)) { + fprintf(F, " backedges:"); + comma = ' '; + for (i = 0; i < get_irn_arity(n); i++) + if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; } + } + fprintf(F, "\n"); + + /* Loop node Someone else please tell me what's wrong ... + if (get_irn_loop(n)) { + ir_loop *loop = get_irn_loop(n); + assert(loop); + fprintf(F, " in loop %d with depth %d\n", + get_loop_loop_nr(loop), get_loop_depth(loop)); + } + */ + + /* Source types */ + switch (get_irn_opcode(n)) { + case iro_Start: { + type *tp = get_entity_type(get_irg_ent(get_irn_irg(n))); + fprintf(F, "start of method of type %s \n", get_type_name_ex(tp, &bad)); + for (i = 0; i < get_method_n_params(tp); ++i) + fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad)); + } break; + case iro_Alloc: { + fprintf(F, "allocating entity of type %s \n", get_type_name_ex(get_Alloc_type(n), &bad)); + } break; + case iro_Free: { + fprintf(F, "freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad)); + } break; + case iro_Sel: { + entity *ent = get_Sel_entity(n); - if (irgmap && - ((get_irn_op(n) == op_Filter) || (get_irn_op(n) == op_Block))) { - ir_node *pred = skip_Proj(get_Block_cfgpred(block, pos)); - if (is_ip_cfop(pred)) { - ir_graph *irg = get_ip_cfop_irg(pred); - if (pmap_find(irgmap, irg) == NULL) return true; + if (ent) { + fprintf(F, "Selecting entity of type %s\n", get_type_name_ex(get_entity_type(ent), &bad)); + fprintf(F, " from entity of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad)); + } + else { + fprintf(F, "\n"); + bad = 1; + } + } break; + case iro_Call: { + type *tp = get_Call_type(n); + fprintf(F, "calling method of type %s \n", get_type_name_ex(tp, &bad)); + for (i = 0; i < get_method_n_params(tp); ++i) + fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad)); + for (i = 0; i < get_method_n_ress(tp); ++i) + fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad)); + if (Call_has_callees(n)) { + fprintf(F, "possible callees: \n"); + for (i = 0; i < get_Call_n_callees(n); i++) { + if (!get_Call_callee(n, i)) { + fprintf(F, " %d external method\n", i); + } else { + fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i))); + } + } + } + } break; + case iro_CallBegin: { + ir_node *call = get_CallBegin_call(n); + if (Call_has_callees(call)) { + fprintf(F, "possible callees: \n"); + for (i = 0; i < get_Call_n_callees(call); i++) { + if (!get_Call_callee(call, i)) { + fprintf(F, " %d external method\n", i); + } else { + fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i))); + } + } + } + } break; + case iro_Return: { + if (!interprocedural_view) { + type *tp = get_entity_type(get_irg_ent(get_irn_irg(n))); + fprintf(F, "return in method of type %s \n", get_type_name_ex(tp, &bad)); + for (i = 0; i < get_method_n_ress(tp); ++i) + fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad)); + } + } break; + case iro_Const: { + type *tp = get_Const_type(n); + assert(tp != none_type); + fprintf(F, "Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad)); + } break; + case iro_Filter: { + int i; + if (interprocedural_view) { + fprintf(F, "intra predecessor nodes:\n"); + for (i = 0; i < get_irn_intra_arity(n); i++) { + ir_node *pred = get_irn_intra_n(n, i); + fprintf(F, " %s%s %ld\n", get_irn_opname(pred), get_irn_modename(pred), get_irn_node_nr(pred)); + } + } else { + fprintf(F, "inter predecessor nodes:\n"); + for (i = 0; i < get_irn_inter_arity(n); i++) { + ir_node *pred = get_irn_inter_n(n, i); + fprintf(F, " %s%s %ld \tin graph %s\n", get_irn_opname(pred), get_irn_modename(pred), + get_irn_node_nr(pred), get_ent_dump_name(get_irg_entity(get_irn_irg(pred)))); + } } + } break; + default: ; } - return false; + if (get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_consistent || + get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_inconsistent ) + if (get_irn_type(n) != none_type) + fprintf (F, "\nAnalysed type: %s", get_type_name_ex(get_irn_type(n), &bad)); + + fprintf (F, "\""); + + return bad; } static INLINE bool is_constlike_node(ir_node *n) { ir_op *op = get_irn_op(n); - return (op == op_Const || op == op_Bad || op == op_SymConst); + return (op == op_Const || op == op_Bad || op == op_SymConst || op == op_Unknown); } -static void dump_const_node_local(ir_node *n, pmap *irgmap) { +/* outputs the predecessors of n, that are constants, local. I.e., + generates a copy of the constant predecessors for each node called with. */ +static void dump_const_node_local(ir_node *n) { int i; - if (!dump_const_local_set()) return; + if (!get_opt_dump_const_local()) return; + /* Use visited flag to avoid outputting nodes twice. initialize it first. */ for (i = 0; i < get_irn_arity(n); i++) { ir_node *con = get_irn_n(n, i); if (is_constlike_node(con)) { - if (pred_in_wrong_graph(n, i, irgmap)) continue; /* pred not dumped */ set_irn_visited(con, get_irg_visited(current_ir_graph)-1); } } + for (i = 0; i < get_irn_arity(n); i++) { ir_node *con = get_irn_n(n, i); if (is_constlike_node(con) && irn_not_visited(con)) { - if (pred_in_wrong_graph(n, i, irgmap)) continue; /* pred not dumped */ + int bad = 0; + mark_irn_visited(con); /* Generate a new name for the node by appending the names of - n and const. */ - fprintf (F, "node: {title: \""); PRINT_NODEID(n); PRINT_NODEID(con); - fprintf(F, "\" label: \""); - dump_node_opcode(con); - dump_node_mode (con); + n and const. */ + fprintf(F, "node: {title: "); PRINT_CONSTID(n, con); + fprintf(F, " label: \""); + bad |= dump_node_opcode(F, con); + bad |= dump_node_mode (con); + bad |= dump_node_typeinfo(con); fprintf (F, " "); - dump_node_nodeattr(con); -#ifdef DEBUG_libfirm - xfprintf (F, " %ld", get_irn_node_nr(con)); -#endif - fprintf (F, "\" "); - dump_node_vcgattr(con); - fprintf (F, "}\n"); + bad |= dump_node_nodeattr(con); + fprintf(F, " %ld", get_irn_node_nr(con)); + fprintf(F, "\" "); + bad |= dump_node_info(con); + dump_node_vcgattr(con, bad); + fprintf(F, "}\n"); } } } -static void -dump_node (ir_node *n, pmap * map) { - if (dump_const_local_set() && is_constlike_node(n)) return; +static void print_node_error(const char *p) +{ + if (! p) + return; + + fprintf (F, " info2: \"%s\"", p); +} +static void dump_node(ir_node *n) +{ + int bad = 0; + const char *p; + + if (get_opt_dump_const_local() && is_constlike_node(n)) return; /* dump this node */ - fprintf (F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \""); - - dump_node_opcode(n); - dump_node_mode (n); - fprintf (F, " "); - dump_node_nodeattr(n); -#ifdef DEBUG_libfirm - xfprintf (F, " %ld", get_irn_node_nr(n)); + fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \""); + + bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p); + bad |= dump_node_opcode(F, n); + bad |= dump_node_mode (n); + bad |= dump_node_typeinfo(n); + fprintf(F, " "); + bad |= dump_node_nodeattr(n); + fprintf(F, " %ld", get_irn_node_nr(n)); + fprintf(F, "\" "); + bad |= dump_node_info(n); + print_node_error(p); + dump_node_vcgattr(n, bad); + fprintf(F, "}\n"); + dump_const_node_local(n); +#if DO_HEAPANALYSIS + dump_chi_term(F, n); + dump_state(F, n); #endif - fprintf (F, "\" "); - dump_node_vcgattr(n); - fprintf (F, "}\n"); - dump_const_node_local(n, map); } +/* dump the edge to the block this node belongs to */ static void -dump_ir_node (ir_node *n) -{ - /* dump this node */ - fprintf (F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: "); +dump_ir_block_edge(ir_node *n) { + if (get_opt_dump_const_local() && is_constlike_node(n)) return; + if (is_no_Block(n)) { + fprintf (F, "edge: { sourcename: \""); + PRINT_NODEID(n); + fprintf (F, "\" targetname: \""); + PRINT_NODEID(get_nodes_block(n)); + fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n"); + } +} - switch (n->op->code) { /* node label */ - case iro_Start: - xfprintf (F, "\"%I\" color: blue ", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_EndReg: - /* fall through */ - case iro_EndExcept: - /* fall through */ - case iro_End: - xfprintf (F, "\"%I\" color: blue ", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Block: - xfprintf (F, "\"%I\" color: lightyellow ", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Phi: - xfprintf (F, "\"%I%I\" color: green", get_irn_opident(n), get_irn_modeident(n)); - if (get_irn_modecode(n) == irm_M) - xfprintf (F, DEFAULT_NODE_ATTR " color: green"); - else - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Const: - xfprintf (F, "\"%v%I\" color: yellow ", n->attr.con, get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Id: - xfprintf (F, "\"%I%I\" ", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Proj: - if (n->in[1]->op->code == iro_Cmp) { - xfprintf (F, "\"%I%I %s\" color: yellow", get_irn_opident(n), get_irn_modeident(n), - get_pnc_string(n->attr.proj)); - } else { - xfprintf (F, "\"%I%I %ld\"", get_irn_opident(n), get_irn_modeident(n), n->attr.proj); - } - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Filter: - xfprintf (F, "\"%I%I %ld\"", get_irn_opident(n), get_irn_modeident(n), n->attr.filter.proj); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Conv: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Tuple: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Add: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Sub: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Mul: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Quot: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_DivMod: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Div: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Mod: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_And: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Or: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Eor: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Shl: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Shr: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Abs: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Cmp: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Jmp: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Break: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Cond: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Call: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_CallBegin: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Return: - xfprintf (F, "\"%I\"", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Raise: - xfprintf (F, "\"%I%I\"", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Load: - case iro_Store: - xfprintf (F, "\"%R\"", n); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Alloc: - xfprintf (F, "\"%I\" ", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Sel: - assert(get_kind(get_Sel_entity(n)) == k_entity); - xfprintf (F, "\"%I ", get_irn_opident(n)); - xfprintf (F, "%I", get_entity_ident(get_Sel_entity(n))); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_SymConst: - assert(get_kind(get_SymConst_type(n)) == k_type); - assert(get_type_ident(get_SymConst_type(n))); - fprintf (F, "\"%s ", get_type_name(get_SymConst_type(n))); - switch (n->attr.i.num){ - case type_tag: - fprintf (F, "tag\" "); - break; - case size: - fprintf (F, "size\" "); - break; - default: - assert(0); - break; - } - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Sync: - xfprintf (F, "\"%I\" ", get_irn_opident(n)); - xfprintf (F, DEFAULT_NODE_ATTR " color: green"); - break; - case iro_Bad: - xfprintf (F, "\"%I%I\" ", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - case iro_Unknown: - xfprintf (F, "\"%I%I\" ", get_irn_opident(n), get_irn_modeident(n)); - xfprintf (F, DEFAULT_NODE_ATTR); - break; - default: - xfprintf (F, "\"%I%I\" ", get_irn_opident(n), get_irn_modeident(n)); - } - fprintf (F, "}\n"); /* footer */ +static void +print_data_edge_vcgattr(FILE *F, ir_node *from, int to) { + if (get_nodes_block(from) == get_nodes_block(get_irn_n(from, to))) + fprintf (F, INTRA_DATA_EDGE_ATTR); + else + fprintf (F, INTER_DATA_EDGE_ATTR); } - -/* dump the edge to the block this node belongs to */ static void -dump_ir_block_edge(ir_node *n) { - if (dump_const_local_set() && is_constlike_node(n)) return; - if (is_no_Block(n)) { - fprintf (F, "edge: { sourcename: \""); - PRINT_NODEID(n); - fprintf (F, "\" targetname: \""); - PRINT_NODEID(get_nodes_Block(n)); - xfprintf (F, "\" " BLOCK_EDGE_ATTR "}\n"); - } +print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) { + if (get_nodes_block(from) == get_nodes_block(get_irn_n(from, to))) + fprintf (F, INTRA_MEM_EDGE_ATTR); + else + fprintf (F, INTER_MEM_EDGE_ATTR); } -static void print_edge_vcgattr(ir_node *from, int to) { +static void +print_edge_vcgattr(ir_node *from, int to) { assert(from); - if (is_backedge(from, to)) xfprintf (F, BACK_EDGE_ATTR); + if (dump_backedge_information_flag && is_backedge(from, to)) + fprintf (F, BACK_EDGE_ATTR); switch (get_irn_opcode(from)) { case iro_Block: - xfprintf (F, CF_EDGE_ATTR); + fprintf (F, CF_EDGE_ATTR); break; case iro_Start: break; case iro_End: if (to >= 0) { if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB) - xfprintf (F, CF_EDGE_ATTR); + fprintf (F, CF_EDGE_ATTR); if (get_irn_mode(get_End_keepalive(from, to)) == mode_X) - xfprintf (F, MEM_EDGE_ATTR); + fprintf (F, INTER_MEM_EDGE_ATTR); } break; - case iro_EndReg: break; - case iro_EndExcept: break; - case iro_Jmp: break; - case iro_Break: break; - case iro_Cond: break; + case iro_EndReg: + case iro_EndExcept: + case iro_Jmp: + case iro_Break: + case iro_Cond: + print_data_edge_vcgattr(F, from, to); + break; case iro_Return: case iro_Raise: - if (to == 0) xfprintf (F, MEM_EDGE_ATTR); + if (to == 0) + print_mem_edge_vcgattr(F, from, to); + else + print_data_edge_vcgattr(F, from, to); + break; + case iro_Const: + case iro_SymConst: + print_data_edge_vcgattr(F, from, to); break; - case iro_Const: break; - case iro_SymConst:break; case iro_Sel: case iro_Call: - if (to == 0) xfprintf (F, MEM_EDGE_ATTR); + if (to == 0) + print_mem_edge_vcgattr(F, from, to); + else + print_data_edge_vcgattr(F, from, to); + break; + case iro_CallBegin: + case iro_Add: + case iro_Sub: + case iro_Minus: + case iro_Mul: + print_data_edge_vcgattr(F, from, to); break; - case iro_CallBegin: break; - case iro_Add: break; - case iro_Sub: break; - case iro_Minus: break; - case iro_Mul: break; case iro_Quot: case iro_DivMod: case iro_Div: case iro_Mod: - if (to == 0) xfprintf (F, MEM_EDGE_ATTR); + if (to == 0) + print_mem_edge_vcgattr(F, from, to); + else + print_data_edge_vcgattr(F, from, to); + break; + case iro_Abs: + case iro_And: + case iro_Or: + case iro_Eor: + case iro_Shl: + case iro_Shr: + case iro_Shrs: + case iro_Rot: + case iro_Cmp: + case iro_Conv: + print_data_edge_vcgattr(F, from, to); break; - case iro_Abs: break; - case iro_And: break; - case iro_Or: break; - case iro_Eor: break; - case iro_Shl: break; - case iro_Shr: break; - case iro_Shrs: break; - case iro_Rot: break; - case iro_Cmp: break; - case iro_Conv: break; case iro_Phi: - if (get_irn_modecode(from) == irm_M) xfprintf (F, MEM_EDGE_ATTR); + if (get_irn_modecode(from) == irm_M) + fprintf (F, INTER_MEM_EDGE_ATTR); + else + print_data_edge_vcgattr(F, from, to); break; case iro_Load: case iro_Store: case iro_Alloc: case iro_Free: - if (to == 0) xfprintf (F, MEM_EDGE_ATTR); + if (to == 0) + print_mem_edge_vcgattr(F, from, to); + else + print_data_edge_vcgattr(F, from, to); break; case iro_Sync: - xfprintf (F, MEM_EDGE_ATTR); + print_mem_edge_vcgattr(F, from, to); break; case iro_Tuple: break; case iro_Proj: case iro_Filter: switch (get_irn_modecode(from)) { case irm_X: - xfprintf (F, CF_EDGE_ATTR); + fprintf (F, CF_EDGE_ATTR); break; case irm_M: - xfprintf (F, MEM_EDGE_ATTR); + fprintf (F, INTER_MEM_EDGE_ATTR); + break; + default: + print_data_edge_vcgattr(F, from, to); break; - default: break; } break; - case iro_Bad: break; + case iro_Bad: break; case iro_Unknown: break; - case iro_Id: break; + case iro_Id: + switch (get_irn_modecode(from)) { + case irm_M: + fprintf (F, INTRA_MEM_EDGE_ATTR); + break; + case irm_X: + fprintf (F, CF_EDGE_ATTR); + break; + default: + print_data_edge_vcgattr(F, from, to); + break; + } break; default: ; } @@ -630,76 +1004,155 @@ dump_ir_data_edges(ir_node *n) { for (i = 0; i < get_irn_arity(n); i++) { ir_node * pred = get_irn_n(n, i); assert(pred); + if ((interprocedural_view && get_irn_visited(pred) < visited)) continue; /* pred not dumped */ - if (is_backedge(n, i)) + + if (dump_backedge_information_flag && is_backedge(n, i)) fprintf (F, "backedge: {sourcename: \""); else fprintf (F, "edge: {sourcename: \""); PRINT_NODEID(n); - fprintf (F, "\" targetname: \""); - if ((dump_const_local_set()) && is_constlike_node(pred)) - PRINT_NODEID(n); - PRINT_NODEID(pred); - fprintf (F, "\""); + fprintf (F, "\" targetname: "); + if ((get_opt_dump_const_local()) && is_constlike_node(pred)) { + PRINT_CONSTID(n, pred); + } else { + fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\""); + } fprintf (F, " label: \"%d\" ", i); print_edge_vcgattr(n, i); fprintf (F, "}\n"); } } -/* dump out edges */ +/** Dumps a node and its edges but not the block edge + */ +static INLINE void +dump_node_wo_blockedge (ir_node *n, void* env) { + dump_node(n); + dump_ir_data_edges(n); +} + +/** Dumps a node and its edges. + */ static void -dump_out_edge (ir_node *n, void* env) { - int i; - for (i = 0; i < get_irn_n_outs(n); i++) { - assert(get_irn_out(n, i)); - fprintf (F, "edge: {sourcename: \""); - PRINT_NODEID(n); - fprintf (F, "\" targetname: \""); - PRINT_NODEID(get_irn_out(n, i)); - fprintf (F, "\" color: red linestyle: dashed"); - fprintf (F, "}\n"); - } +dump_whole_node (ir_node *n, void* env) { + dump_node_wo_blockedge(n, env); + if (!node_floats(n)) dump_ir_block_edge(n); } -static INLINE void -dump_loop_node_edge (ir_loop *loop, int i) { - assert(loop); - fprintf (F, "edge: {sourcename: \"%p\" targetname: \"", loop); - PRINT_NODEID(get_loop_node(loop, i)); - fprintf (F, "\" color: green"); - fprintf (F, "}\n"); +static void +dump_const_node(ir_node *n, void *env) { + if (is_Block(n)) return; + dump_node_wo_blockedge(n, env); } -static -void dump_loops (ir_loop *loop) { - int i; - /* dump this loop node */ - fprintf (F, "node: {title: \"%p\" label: \"loop %d, %d sons, %d nodes\" }\n", - loop, get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop)); - /* dump edges to nodes in loop -- only if it is a real loop */ - if (get_loop_depth(loop) != 0) { - for (i = 0; i < get_loop_n_nodes(loop); i++) { - dump_loop_node_edge(loop, i); - } - } - for (i = 0; i < get_loop_n_sons(loop); i++) { - dump_loops(get_loop_son(loop, i)); +/***********************************************************************/ +/* the following routines dump the nodes/irgs bracketed to graphs. */ +/***********************************************************************/ + +/** Dumps a constant expression as entity initializer, array bound ... + */ +static void dump_const_expression(ir_node *value) { + ir_graph *rem = current_ir_graph; + int rem_dump_const_local = dump_const_local; + dump_const_local = 0; + current_ir_graph = get_const_code_irg(); + irg_walk(value, dump_const_node, NULL, NULL); + /* Decrease visited flag so that we walk with the same flag for the next + expresssion. This guarantees that we don't dump the same node twice, + as for const expressions cse is performed to save memory. */ + set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1); + current_ir_graph = rem; + dump_const_local = rem_dump_const_local; +} + +/** Dump a block as graph containing its nodes. + * + * Expects to find nodes belonging to the block as list in its + * link field. + * Dumps the edges of all nodes including itself. */ +static void +dump_whole_block(ir_node *block) { + ir_node *node; + assert(is_Block(block)); + + fprintf(F, "graph: { title: \""); + PRINT_NODEID(block); + fprintf(F, "\" label: \""); + dump_node_opcode(F, block); + fprintf (F, " %ld", get_irn_node_nr(block)); +#if DO_HEAPANALYSIS + if (get_opt_dump_abstvals()) + fprintf (F, " seqno: %d", (int)get_Block_seqno(block)); +#endif + fprintf(F, "\" status:clustered color:%s \n", + get_Block_matured(block) ? "yellow" : "red"); + + /* dump the blocks edges */ + dump_ir_data_edges(block); + + /* dump the nodes that go into the block */ + for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) { + dump_node(node); + dump_ir_data_edges(node); } + + /* Close the vcg information for the block */ + fprintf(F, "}\n"); + dump_const_node_local(block); +#if DO_HEAPANALYSIS + dump_chi_term(F, block); +#endif + fprintf(F, "\n"); } -static INLINE -void dump_loop_info(ir_graph *irg) { +/** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link. + * The outermost nodes: blocks and nodes not pinned, Bad, Unknown. */ +static void +dump_block_graph(ir_graph *irg) { + int i; ir_graph *rem = current_ir_graph; + ir_node **arr = ird_get_irg_link(irg); current_ir_graph = irg; - if (get_irg_loop(irg)) - dump_loops(get_irg_loop(irg)); + for (i = ARR_LEN(arr) - 1; i >= 0; --i) { + ir_node * node = arr[i]; + if (is_Block(node)) { + /* Dumps the block and all the nodes in the block, which are to + be found in Block->link. */ + dump_whole_block(node); + } else { + /* Nodes that are not in a Block. */ + dump_node(node); + dump_ir_data_edges(node); + } + } + + if (dump_loop_information_flag) dump_loop_nodes_into_graph(irg); current_ir_graph = rem; } +/** Dumps an irg as a graph. + * If interprocedural view edges can point to nodes out of this graph. + */ +static void dump_graph(ir_graph *irg) { + + fprintf(F, "graph: { title: \""); + PRINT_IRGID(irg); + fprintf(F, "\" label: \"%s\" status:clustered color:white \n", + get_ent_dump_name(get_irg_ent(irg))); + + dump_block_graph (irg); + + /* Close the vcg information for the irg */ + fprintf(F, "}\n\n"); +} + +/*******************************************************************/ +/* Basic type and entity nodes and edges. */ +/*******************************************************************/ /* dumps the edges between nodes and their type or entity attributes. */ static void dump_node2type_edges (ir_node *n, void *env) @@ -711,23 +1164,26 @@ static void dump_node2type_edges (ir_node *n, void *env) /* @@@ some consts have an entity */ break; case iro_SymConst: - if ( (get_SymConst_kind(n) == type_tag) - || (get_SymConst_kind(n) == size)) - { - PRINT_NODE_TYPE_EDGE(n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR); - } + if ( (get_SymConst_kind(n) ==symconst_type_tag) + || (get_SymConst_kind(n) ==symconst_size)) + { + print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR); + } break; case iro_Sel: { - PRINT_NODE_ENT_EDGE(n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR); + print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR); } break; case iro_Call: { - PRINT_NODE_TYPE_EDGE(n,get_Call_type(n),NODE2TYPE_EDGE_ATTR); + print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR); } break; case iro_Alloc: { - PRINT_NODE_TYPE_EDGE(n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR); + print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR); } break; case iro_Free: { - PRINT_NODE_TYPE_EDGE(n,get_Free_type(n),NODE2TYPE_EDGE_ATTR); + print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR); + } break; + case iro_Cast: { + print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR); } break; default: break; @@ -735,48 +1191,35 @@ static void dump_node2type_edges (ir_node *n, void *env) } -static void dump_const_expression(ir_node *value) { - ir_graph *rem = current_ir_graph; - int rem_dump_const_local = dump_const_local; - dump_const_local = 0; - current_ir_graph = get_const_code_irg(); - irg_walk(value, dump_ir_blocks_nodes, NULL, get_nodes_Block(value)); - /* Decrease visited flag so that we walk with the same flag for the next - expresssion. This guarantees that we don't dump the same node twice, - as for const expressions cse is performed to save memory. */ - set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1); - current_ir_graph = rem; - dump_const_local = rem_dump_const_local; -} - +static int print_type_info(type *tp) { + int bad = 0; -static void print_type_info(type *tp) { if (get_type_state(tp) == layout_undefined) { fprintf(F, "state: layout_undefined\n"); } else { fprintf(F, "state: layout_fixed,\n"); } if (get_type_mode(tp)) - xfprintf(F, "mode: %I,\n", get_mode_ident(get_type_mode(tp))); - fprintf(F, "size: %dB,\n", get_type_size(tp)); -} + fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad)); + fprintf(F, "size: %db,\n", get_type_size_bits(tp)); + return bad; +} static void print_typespecific_info(type *tp) { switch (get_type_tpop_code(tp)) { case tpo_class: { - if(existent == get_class_peculiarity(tp)) - xfprintf (F, " " TYPE_CLASS_NODE_ATTR); - else - xfprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR); + fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp))); } break; case tpo_struct: { - xfprintf (F, " " TYPE_METH_NODE_ATTR); } break; case tpo_method: { + fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp))); + fprintf(F, "params: %d\n", get_method_n_params(tp)); + fprintf(F, "results: %d\n", get_method_n_ress(tp)); } break; case tpo_union: { @@ -797,60 +1240,126 @@ static void print_typespecific_info(type *tp) { } /* switch type */ } -static void print_type_node(type *tp) { - xfprintf (F, "node: {title: \""); - PRINT_TYPEID(tp); - xfprintf (F, "\" label: \"%I %I\"", get_type_tpop_nameid(tp), get_type_ident(tp)); - xfprintf (F, "info1: \""); - print_type_info(tp); - xfprintf (F, "\""); - print_typespecific_info(tp); - xfprintf (F, "}\n"); -} -void dump_entity_node(entity *ent) { - xfprintf (F, "node: {title: \""); - PRINT_ENTID(ent); - xfprintf (F, "\"" DEFAULT_TYPE_ATTRIBUTE); - xfprintf (F, "label: "); - xfprintf (F, "\"ent %I\" " ENTITY_NODE_ATTR , get_entity_ident(ent)); - fprintf (F, "\n info1:\"\nallocation: "); - switch (get_entity_allocation(ent)) { - case dynamic_allocated: fprintf (F, "dynamic allocated"); break; - case automatic_allocated: fprintf (F, "automatic allocated"); break; - case static_allocated: fprintf (F, "static allocated"); break; - case parameter_allocated: fprintf (F, "parameter allocated"); break; - } - fprintf (F, "\nvisibility: "); - switch (get_entity_visibility(ent)) { - case local: fprintf (F, "local"); break; - case external_visible: fprintf (F, "external_visible"); break; - case external_allocated: fprintf (F, "external_allocate"); break; - } - fprintf (F, "\nvariability: "); - switch (get_entity_variability(ent)) { - case uninitialized: fprintf (F, "uninitialized");break; - case initialized: fprintf (F, "initialized"); break; - case part_constant: fprintf (F, "part_constant");break; - case constant: fprintf (F, "constant"); break; - } - fprintf (F, "\nvolatility: "); - switch (get_entity_volatility(ent)) { - case non_volatile: fprintf (F, "non_volatile"); break; - case is_volatile: fprintf (F, "is_volatile"); break; - } - fprintf (F, "\npeculiarity: "); - switch (get_entity_peculiarity(ent)) { - case description: fprintf (F, "description"); break; - case inherited: fprintf (F, "inherited"); break; - case existent: fprintf (F, "existent"); break; - } - xfprintf(F, "\nname: %I\nld_name: %I", get_entity_ident(ent), get_entity_ld_ident(ent)); - fprintf(F, "\noffset: %d", get_entity_offset(ent)); - if (is_method_type(get_entity_type(ent))) - { fprintf (F, "\nirg = "); PRINT_IRGID(get_entity_irg(ent)); } +static void print_typespecific_vcgattr(type *tp) { + switch (get_type_tpop_code(tp)) { + case tpo_class: + { + if (peculiarity_existent == get_class_peculiarity(tp)) + fprintf (F, " " TYPE_CLASS_NODE_ATTR); + else + fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR); + } break; + case tpo_struct: + { + fprintf (F, " " TYPE_METH_NODE_ATTR); + } break; + case tpo_method: + { + } break; + case tpo_union: + { + } break; + case tpo_array: + { + } break; + case tpo_enumeration: + { + } break; + case tpo_pointer: + { + } break; + case tpo_primitive: + { + } break; + default: break; + } /* switch type */ +} + +static int print_type_node(type *tp) +{ + int bad = 0; + + fprintf (F, "node: {title: "); + PRINT_TYPEID(tp); + fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad)); + fprintf (F, " info1: \""); + bad |= print_type_info(tp); + print_typespecific_info(tp); + fprintf (F, "\""); + print_typespecific_vcgattr(tp); + fprintf (F, "}\n"); + + return bad; +} + +#define X(a) case a: fprintf(F, #a); break +void dump_entity_node(entity *ent) +{ + fprintf (F, "node: {title: \""); + PRINT_ENTID(ent); fprintf(F, "\""); + fprintf (F, DEFAULT_TYPE_ATTRIBUTE); + fprintf (F, "label: "); + fprintf (F, "\"ent %s\" " ENTITY_NODE_ATTR , get_ent_dump_name(ent)); + fprintf (F, "\n info1: \"\nid: "); PRINT_ENTID(ent); + + fprintf (F, "\nallocation: "); + switch (get_entity_allocation(ent)) { + X(allocation_dynamic); + X(allocation_automatic); + X(allocation_static); + X(allocation_parameter); + } + + fprintf (F, "\nvisibility: "); + switch (get_entity_visibility(ent)) { + X(visibility_local); + X(visibility_external_visible); + X(visibility_external_allocated); + } + + fprintf (F, "\nvariability: "); + switch (get_entity_variability(ent)) { + X(variability_uninitialized); + X(variability_initialized); + X(variability_part_constant); + X(variability_constant); + } + + fprintf (F, "\nvolatility: "); + switch (get_entity_volatility(ent)) { + X(volatility_non_volatile); + X(volatility_is_volatile); + } + + fprintf(F, "\npeculiarity: %s", get_peculiarity_string(get_entity_peculiarity(ent))); + fprintf(F, "\nname: %s\nld_name: %s", + get_entity_name(ent), ent->ld_name ? get_entity_ld_name(ent) : "no yet set"); + fprintf(F, "\noffset(bits): %d", get_entity_offset_bits(ent)); + if (is_method_type(get_entity_type(ent))) { + if (get_entity_irg(ent)) /* can be null */ + { fprintf (F, "\nirg = "); PRINT_IRGID(get_entity_irg(ent)); } + else + { fprintf (F, "\nirg = NULL"); } + } fprintf(F, "\"\n}\n"); } +#undef X + +static void dump_enum_item(type *tp, int pos) +{ + char buf[1024]; + ident *id = get_enumeration_nameid(tp, pos); + tarval *tv = get_enumeration_enum(tp, pos); + + tarval_snprintf(buf, sizeof(buf), tv); + fprintf (F, "node: {title: \""); + PRINT_ITEMID(tp, pos); fprintf(F, "\""); + fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE); + fprintf (F, "label: "); + fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id)); + fprintf (F, "\n info1: \"value: %s\"}\n", buf); +} /* dumps a type or entity and it's edges. */ static void @@ -870,105 +1379,107 @@ dump_type_info (type_or_ent *tore, void *env) { /* skip this to reduce graph. Member edge of type is parallel to this edge. * fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" " ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/ - PRINT_ENT_TYPE_EDGE(ent,get_entity_type(ent),ENT_TYPE_EDGE_ATTR); + print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR); if(is_class_type(get_entity_owner(ent))) { - for(i = 0; i < get_entity_n_overwrites(ent); i++){ - PRINT_ENT_ENT_EDGE(ent,get_entity_overwrites(ent, i), ENT_OVERWRITES_EDGE_ATTR); - } + for(i = 0; i < get_entity_n_overwrites(ent); i++){ + print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), ENT_OVERWRITES_EDGE_ATTR); + } } /* attached subgraphs */ - if (const_entities && (get_entity_variability(ent) != uninitialized)) { - if (is_atomic_entity(ent)) { - value = get_atomic_ent_value(ent); - if (value) { - PRINT_ENT_NODE_EDGE(ent,value,ENT_VALUE_EDGE_ATTR,i); - /* - fprintf (F, "edge: { sourcename: \"%p\" targetname: \"", GET_ENTID(ent)); - PRINT_NODEID(value); - fprintf(F, "\" " ENT_VALUE_EDGE_ATTR "\"}\n"); - */ - dump_const_expression(value); - } - } - if (is_compound_entity(ent)) { - for (i = 0; i < get_compound_ent_n_values(ent); i++) { - value = get_compound_ent_value(ent, i); - if (value) { - PRINT_ENT_NODE_EDGE(ent,value,ENT_VALUE_EDGE_ATTR,i); - dump_const_expression(value); - PRINT_ENT_ENT_EDGE(ent,get_compound_ent_value_member(ent, i),ENT_CORR_EDGE_ATTR,i); - /* - fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" " - ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent), - get_compound_ent_value_member(ent, i), i); - */ - } - } - } + if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) { + if (is_atomic_entity(ent)) { + value = get_atomic_ent_value(ent); + if (value) { + print_ent_node_edge(F,ent, value, ENT_VALUE_EDGE_ATTR, i); + /* DDMN(value); $$$ */ + dump_const_expression(value); + } + } + if (is_compound_entity(ent)) { + for (i = 0; i < get_compound_ent_n_values(ent); i++) { + value = get_compound_ent_value(ent, i); + if (value) { + print_ent_node_edge(F,ent,value,ENT_VALUE_EDGE_ATTR,i); + dump_const_expression(value); + print_ent_ent_edge(F,ent, get_compound_ent_value_member(ent, i), ENT_CORR_EDGE_ATTR, i); + /* + fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" " + ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent), + get_compound_ent_value_member(ent, i), i); + */ + } + } + } } } break; case k_type: { -#ifndef DEBUG type *tp = (type *)tore; -#endif - - print_type_node(tp); /* and now the edges */ switch (get_type_tpop_code(tp)) { case tpo_class: - { - for (i=0; i < get_class_n_supertypes(tp); i++) - { - PRINT_TYPE_TYPE_EDGE(tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR); - } - - for (i=0; i < get_class_n_members(tp); i++) - { - PRINT_TYPE_ENT_EDGE(tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR); - } - } break; + { + for (i=0; i < get_class_n_supertypes(tp); i++) { + print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR); + } + + for (i=0; i < get_class_n_members(tp); i++) { + print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR); + } + } break; case tpo_struct: - { - for (i=0; i < get_struct_n_members(tp); i++) - { - PRINT_TYPE_ENT_EDGE(tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR); - } - } break; + { + for (i=0; i < get_struct_n_members(tp); i++) { + print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR); + } + } break; case tpo_method: - { - for (i = 0; i < get_method_n_params(tp); i++) - { - PRINT_TYPE_TYPE_EDGE(tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i); - } - for (i = 0; i < get_method_n_ress(tp); i++) - { - PRINT_TYPE_TYPE_EDGE(tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i); - } - } break; + { + for (i = 0; i < get_method_n_params(tp); i++) + { + print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i); + } + for (i = 0; i < get_method_n_ress(tp); i++) + { + print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i); + } + } break; case tpo_union: - { - for (i = 0; i < get_union_n_members(tp); i++) - { - PRINT_TYPE_ENT_EDGE(tp,get_union_member(tp, i),UNION_EDGE_ATTR); - } - } break; + { + for (i = 0; i < get_union_n_members(tp); i++) + { + print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR); + } + } break; case tpo_array: - { - PRINT_TYPE_TYPE_EDGE(tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR); - PRINT_TYPE_ENT_EDGE(tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR); - } break; + { + print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR); + print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR); + for (i = 0; i < get_array_n_dimensions(tp); i++) { + ir_node *upper = get_array_upper_bound(tp, i); + ir_node *lower = get_array_lower_bound(tp, i); + print_node_type_edge(F,upper, tp, "label: \"upper %d\"", get_array_order(tp, i)); + print_node_type_edge(F,lower, tp, "label: \"lower %d\"", get_array_order(tp, i)); + dump_const_expression(upper); + dump_const_expression(lower); + } + + } break; case tpo_enumeration: - { - } break; + { + for (i = 0; i < get_enumeration_n_enums(tp); ++i) { + dump_enum_item(tp, i); + print_enum_item_edge(F, tp, i, "label: \"item %d\"", i); + } + } break; case tpo_pointer: - { - PRINT_TYPE_TYPE_EDGE(tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR); - } break; + { + print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR); + } break; case tpo_primitive: - { - } break; + { + } break; default: break; } /* switch type */ } @@ -980,8 +1491,10 @@ dump_type_info (type_or_ent *tore, void *env) { } /* switch kind_or_entity */ } -/* dumps a class type node and a superclass edge. - If env != null dumps entities of classes and overwrites edges. */ +/** For dumping class hierarchies. + * Dumps a class type node and a superclass edge. + * If env != null dumps entities of classes and overwrites edges. + */ static void dump_class_hierarchy_node (type_or_ent *tore, void *env) { int i = 0; /* to shutup gcc */ @@ -995,10 +1508,10 @@ dump_class_hierarchy_node (type_or_ent *tore, void *env) { /* The node */ dump_entity_node(ent); /* The edges */ - PRINT_TYPE_ENT_EDGE(get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR); + print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR); for(i = 0; i < get_entity_n_overwrites(ent); i++) { - PRINT_ENT_ENT_EDGE(get_entity_overwrites(ent, i),ent, ENT_OVERWRITES_EDGE_ATTR); + print_ent_ent_edge(F,get_entity_overwrites(ent, i),ent, ENT_OVERWRITES_EDGE_ATTR); } } } break; /* case k_entity */ @@ -1008,12 +1521,12 @@ dump_class_hierarchy_node (type_or_ent *tore, void *env) { if (tp == get_glob_type()) break; switch (get_type_tpop_code(tp)) { case tpo_class: { - print_type_node(tp); - /* and now the edges */ - for (i=0; i < get_class_n_supertypes(tp); i++) - { - PRINT_TYPE_TYPE_EDGE(tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR); - } + print_type_node(tp); + /* and now the edges */ + for (i=0; i < get_class_n_supertypes(tp); i++) + { + print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR); + } } break; default: break; } /* switch type */ @@ -1026,158 +1539,257 @@ dump_class_hierarchy_node (type_or_ent *tore, void *env) { } /* switch kind_or_entity */ } +/*******************************************************************/ +/* dump analysis information that is expressed in graph terms. */ +/*******************************************************************/ + +/* dump out edges */ +static void +dump_out_edge (ir_node *n, void* env) { + int i; + for (i = 0; i < get_irn_n_outs(n); i++) { + assert(get_irn_out(n, i)); + fprintf (F, "edge: {sourcename: \""); + PRINT_NODEID(n); + fprintf (F, "\" targetname: \""); + PRINT_NODEID(get_irn_out(n, i)); + fprintf (F, "\" color: red linestyle: dashed"); + fprintf (F, "}\n"); + } +} + +static INLINE void +dump_loop_label(ir_loop *loop) { + fprintf (F, "loop %d, %d sons, %d nodes", + get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop)); +} + +static INLINE void dump_loop_info(ir_loop *loop) { + fprintf (F, " info1: \""); + fprintf (F, " loop nr: %d", get_loop_loop_nr(loop)); +#if DEBUG_libfirm /* GL @@@ debug analyses */ + fprintf (F, "\n The loop was analyzed %d times.", (int)get_loop_link(loop)); +#endif + fprintf (F, "\""); +} + +static INLINE void +dump_loop_node(ir_loop *loop) { + fprintf (F, "node: {title: \""); + PRINT_LOOPID(loop); + fprintf (F, "\" label: \""); + dump_loop_label(loop); + fprintf (F, "\" "); + dump_loop_info(loop); + fprintf (F, "}\n"); + +} + +static INLINE void +dump_loop_node_edge (ir_loop *loop, int i) { + assert(loop); + fprintf (F, "edge: {sourcename: \""); + PRINT_LOOPID(loop); + fprintf (F, "\" targetname: \""); + PRINT_NODEID(get_loop_node(loop, i)); + fprintf (F, "\" color: green"); + fprintf (F, "}\n"); +} + +static INLINE void +dump_loop_son_edge (ir_loop *loop, int i) { + assert(loop); + fprintf (F, "edge: {sourcename: \""); + PRINT_LOOPID(loop); + fprintf (F, "\" targetname: \""); + PRINT_LOOPID(get_loop_son(loop, i)); + fprintf (F, "\" color: darkgreen label: \"%d\"}\n", + get_loop_element_pos(loop, get_loop_son(loop, i))); +} + +static +void dump_loops (ir_loop *loop) { + int i; + /* dump this loop node */ + dump_loop_node(loop); + + /* dump edges to nodes in loop -- only if it is a real loop */ + if (get_loop_depth(loop) != 0) { + for (i = 0; i < get_loop_n_nodes(loop); i++) { + dump_loop_node_edge(loop, i); + } + } + for (i = 0; i < get_loop_n_sons(loop); i++) { + dump_loops(get_loop_son(loop, i)); + dump_loop_son_edge(loop, i); + } +} + +static INLINE +void dump_loop_nodes_into_graph(ir_graph *irg) { + ir_graph *rem = current_ir_graph; + current_ir_graph = irg; + + if (get_irg_loop(irg)) dump_loops(get_irg_loop(irg)); + + current_ir_graph = rem; +} + + /************************************************************************/ /* open and close vcg file */ /************************************************************************/ -static void vcg_open (ir_graph *irg, char *suffix) { +static INLINE void +dump_vcg_header(const char *name, const char *orientation) { + char *label; + + if (edge_label) { + label = "yes"; + } else { + label = "no"; + } + + if (!orientation) orientation = "bottom_to_top"; + + /* print header */ + fprintf (F, + "graph: { title: \"ir graph of %s\"\n" + "display_edge_labels: %s\n" + "layoutalgorithm: mindepth\n" + "manhattan_edges: yes\n" + "port_sharing: no\n" + "orientation: %s\n" + "classname 1: \"intrablock Data\"\n" + "classname 16: \"interblock Data\"\n" + "classname 2: \"Block\"\n" + "classname 13: \"Control Flow\"\n" + "classname 14: \"intrablock Memory\"\n" + "classname 17: \"interblock Memory\"\n" + "classname 15: \"Dominators\"\n" + "classname 3: \"Entity type\"\n" + "classname 4: \"Entity owner\"\n" + "classname 5: \"Method Param\"\n" + "classname 6: \"Method Res\"\n" + "classname 7: \"Super\"\n" + "classname 8: \"Union\"\n" + "classname 9: \"Points-to\"\n" + "classname 10: \"Array Element Type\"\n" + "classname 11: \"Overwrites\"\n" + "classname 12: \"Member\"\n" + "infoname 1: \"Attribute\"\n" + "infoname 2: \"Verification errors\"\n", + name, label, orientation); + + fprintf (F, "\n"); /* a separator */ +} + +static void vcg_open (ir_graph *irg, char * suffix1, char *suffix2) { + const char *nm = get_irg_dump_name(irg); + int len = strlen(nm), i, j; char *fname; /* filename to put the vcg information in */ - const char *cp; - ident *id; - int len; - char label[4]; - entity *ent; + + if (!suffix1) suffix1 = ""; + if (!suffix2) suffix2 = ""; /** open file for vcg graph */ - ent = get_irg_ent(irg); - id = ent->ld_name ? ent->ld_name : ent->name; - /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */ - len = id_to_strlen (id); - cp = id_to_str (id); - if (dump_file_suffix) - fname = malloc (len + 5 + strlen(suffix) + strlen(dump_file_suffix)); - else - fname = malloc (len + 5 + strlen(suffix)); - strncpy (fname, cp, len); /* copy the filename */ - fname[len] = '\0'; - if (dump_file_suffix) strcat (fname, dump_file_suffix); /* append file suffix */ - strcat (fname, suffix); /* append file suffix */ + fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5); + + /* strncpy (fname, nm, len); */ /* copy the filename */ + j = 0; + for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */ + if (nm[i] == '/') { + fname[j] = '@'; j++; fname[j] = '1'; j++; + } else if (nm[i] == '@') { + fname[j] = '@'; j++; fname[j] = '2'; j++; + } else { + fname[j] = nm[i]; j++; + } + } + fname[j] = '\0'; + strcat (fname, suffix1); /* append file suffix */ + strcat (fname, suffix2); /* append file suffix */ strcat (fname, ".vcg"); /* append the .vcg suffix */ F = fopen (fname, "w"); /* open file for writing */ if (!F) { panic ("cannot open %s for writing (%m)", fname); /* not reached */ } + free(fname); +} - if (edge_label) { - strcpy(label, "yes"); - } else { - strcpy (label, "no"); - } - - /* print header */ - fprintf (F, - "graph: { title: \"ir graph of %s\"\n" - "display_edge_labels: %s\n" - "layoutalgorithm: mindepth\n" - "manhattan_edges: yes\n" - "port_sharing: no\n" - "orientation: bottom_to_top\n" - "classname 1: \"Data\"\n" - "classname 2: \"Block\"\n" - "classname 3: \"Entity type\"" - "classname 4: \"Entity owner\"" - "classname 5: \"Method Param\"" - "classname 6: \"Method Res\"" - "classname 7: \"Super\"" - "classname 8: \"Union\"" - "classname 9: \"Points-to\"" - "classname 10: \"Array Element Type\"" - "classname 11: \"Overwrites\"" - "classname 12: \"Member\"" - , cp, label); - - fprintf (F, "\n"); /* a separator */ -} - -static void vcg_open_name (const char *name) { +static void vcg_open_name (const char *name, char *suffix) { char *fname; /* filename to put the vcg information in */ - int len; - char label[4]; + int i, j, len = strlen(name); + + if (!suffix) suffix = ""; /** open file for vcg graph */ - len = strlen(name); - fname = malloc (len + 5); - if (dump_file_suffix) - fname = malloc (len + 5 + strlen(dump_file_suffix)); - else - fname = malloc (len + 5); - strcpy (fname, name); /* copy the filename */ - if (dump_file_suffix) strcat (fname, dump_file_suffix); + fname = malloc (len * 2 + 5 + strlen(suffix)); + /* strcpy (fname, name);*/ /* copy the filename */ + j = 0; + for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */ + if (name[i] == '/') { + fname[j] = '@'; j++; fname[j] = '1'; j++; + } else if (name[i] == '@') { + fname[j] = '@'; j++; fname[j] = '2'; j++; + } else { + fname[j] = name[i]; j++; + } + } + fname[j] = '\0'; + strcat (fname, suffix); strcat (fname, ".vcg"); /* append the .vcg suffix */ F = fopen (fname, "w"); /* open file for writing */ if (!F) { panic ("cannot open %s for writing (%m)", fname); /* not reached */ } + free(fname); +} - if (edge_label) { - strcpy(label, "yes"); - } else { - strcpy (label, "no"); - } - - /* print header */ - fprintf (F, - "graph: { title: \"ir graph of %s\"\n" - "display_edge_labels: %s\n" - "layoutalgorithm: mindepth\n" - "manhattan_edges: yes\n" - "port_sharing: no\n" - "orientation: bottom_to_top\n" - "classname 1: \"Data\"\n" - "classname 2: \"Block\"\n" - "classname 3: \"Entity type\"\n" - "classname 4: \"Entity owner\"\n" - "classname 5: \"Method Param\"\n" - "classname 6: \"Method Res\"\n" - "classname 7: \"Super\"\n" - "classname 8: \"Union\"\n" - "classname 9: \"Points-to\"\n" - "classname 10: \"Array Element Type\"\n" - "classname 11: \"Overwrites\"\n" - "classname 12: \"Member\"\n" - , name, label); - - fprintf (F, "\n"); /* a separator */ +static INLINE void dump_vcg_footer (void) { + fprintf (F, "}\n"); } static void vcg_close (void) { - fprintf (F, "}\n"); /* print footer */ + dump_vcg_footer(); /* print footer */ fclose (F); /* close vcg file */ } /************************************************************************/ -/* routines to dump a graph, blocks as conventional nodes. */ +/************************************************************************/ +/* Routines that dump all or parts of the firm representation to a file */ +/************************************************************************/ /************************************************************************/ -static int node_floats(ir_node *n) { - return ((get_op_pinned(get_irn_op(n)) == floats) && - (get_irg_pinned(current_ir_graph) == floats)); -} - -static void -dump_whole_node (ir_node *n, void* env) { - dump_node(n, NULL); - if (!node_floats(n)) dump_ir_block_edge(n); - dump_ir_data_edges(n); -} +/************************************************************************/ +/* Dump ir graphs, differnt formats and additional information. */ +/************************************************************************/ +/** Routine to dump a graph, blocks as conventional nodes. + */ void dump_ir_graph (ir_graph *irg) { ir_graph *rem; + char *suffix; rem = current_ir_graph; - current_ir_graph = irg; - vcg_open (irg, ""); + if(strncmp(get_entity_name(get_irg_ent(irg)),dump_file_filter,strlen(dump_file_filter))!=0) return; + + current_ir_graph = irg; + if (interprocedural_view) suffix = "-pure-ip"; + else suffix = "-pure"; + vcg_open (irg, dump_file_suffix, suffix); + dump_vcg_header(get_irg_dump_name(irg), NULL); /* walk over the graph */ /* dump_whole_node must be called in post visiting predecessors */ - irg_walk(irg->end, NULL, dump_whole_node, NULL); + irg_walk(get_irg_end(irg), NULL, dump_whole_node, NULL); /* dump the out edges in a separate walk */ if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != no_outs)) { - irg_out_walk(irg->start, dump_out_edge, NULL, NULL); + irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, NULL); } vcg_close(); @@ -1185,134 +1797,126 @@ dump_ir_graph (ir_graph *irg) current_ir_graph = rem; } -/***********************************************************************/ -/* the following routines dump the nodes as attached to the blocks. */ -/***********************************************************************/ - -static void -dump_ir_blocks_nodes (ir_node *n, void *env) { - ir_node *block = (ir_node *)env; - - if (is_no_Block(n) && get_nodes_Block(n) == block && !node_floats(n)) { - dump_node(n, NULL); - dump_ir_data_edges(n); - } - if (get_irn_op(n) == op_Bad) - Bad_dumped = 1; -} - -static void -dump_ir_block (ir_node *block, void *env) { - ir_graph *irg = (ir_graph *)env; - if (get_irn_opcode(block) == iro_Block) { +void +dump_ir_block_graph (ir_graph *irg) +{ + int i; + char *suffix; - /* This is a block. So dump the vcg information to make a block. */ - fprintf(F, "graph: { title: \""); - PRINT_NODEID(block); - fprintf(F, "\" label: \""); -#ifdef DEBUG_libfirm - fprintf (F, "%ld", get_irn_node_nr(block)); -#else - xfprintf (F, "%I", block->op->name); -#endif - if (exc_normal != get_Block_exc (block)) - fprintf (F, " (%s)", exc_to_string (get_Block_exc (block))); + if(strncmp(get_entity_name(get_irg_ent(irg)),dump_file_filter,strlen(dump_file_filter))!=0) return; - fprintf(F, "\" status:clustered color:%s \n", - get_Block_matured (block) ? "yellow" : "red"); - /* dump the blocks edges */ - dump_ir_data_edges(block); + if (interprocedural_view) suffix = "-ip"; + else suffix = ""; + vcg_open (irg, dump_file_suffix, suffix); + dump_vcg_header(get_irg_dump_name(irg), NULL); - /* dump the nodes that go into the block */ - irg_walk(irg->end, dump_ir_blocks_nodes, NULL, block); + construct_block_lists(irg); - /* Close the vcg information for the block */ - fprintf(F, "}\n\n"); - dump_const_node_local(block, NULL); + for (i = 0; i < get_irp_n_irgs(); i++) { + ir_node **arr = ird_get_irg_link(get_irp_irg(i)); + if (arr) { + dump_graph(get_irp_irg(i)); + DEL_ARR_F(arr); + } } -} - -static void -dump_blockless_nodes (ir_node *n, void *env) { - if (is_no_Block(n) && get_irn_op(get_nodes_Block(n)) == op_Bad) { - dump_node(n, NULL); - dump_ir_data_edges(n); - dump_ir_block_edge(n); - if (get_irn_op(n) == op_Bad) Bad_dumped = 1; - return; - } - if (node_floats(n)) { - dump_node(n, NULL); - dump_ir_data_edges(n); - if (get_irn_op(n) == op_Bad) Bad_dumped = 1; - } + vcg_close(); } -static void dump_ir_block_graph_2 (ir_graph *irg) +/** dumps a graph with type information + */ +void +dump_ir_graph_w_types (ir_graph *irg) { - Bad_dumped = 0; - /* walk over the blocks in the graph */ - irg_block_walk(irg->end, dump_ir_block, NULL, irg); + ir_graph *rem = current_ir_graph; + char *suffix; + + if(strncmp(get_irg_dump_name(irg),dump_file_filter,strlen(dump_file_filter))!=0) return; + + current_ir_graph = irg; + + if (interprocedural_view) suffix = "-pure-wtypes-ip"; + else suffix = "-pure-wtypes"; + vcg_open (irg, dump_file_suffix, suffix); + dump_vcg_header(get_irg_dump_name(irg), NULL); - /* dump all nodes that are not in a Block */ - irg_walk(irg->end, dump_blockless_nodes, NULL, NULL); + /* dump common ir graph */ + irg_walk(get_irg_end(irg), NULL, dump_whole_node, NULL); + /* dump type info */ + type_walk_irg(irg, dump_type_info, NULL, NULL); + inc_irg_visited(get_const_code_irg()); + /* dump edges from graph to type info */ + irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, NULL); - /* dump the Bad node */ - if (!Bad_dumped) - dump_node(get_irg_bad(irg), NULL); + vcg_close(); + current_ir_graph = rem; } void -dump_ir_block_graph (ir_graph *irg) +dump_ir_block_graph_w_types (ir_graph *irg) { - ir_graph *rem; - rem = current_ir_graph; - current_ir_graph = irg; + int i; + char *suffix; + ir_graph *rem = current_ir_graph; - vcg_open (irg, ""); + if(strncmp(get_irg_dump_name(irg),dump_file_filter,strlen(dump_file_filter))!=0) return; - dump_ir_block_graph_2 (irg); + if (interprocedural_view) suffix = "-wtypes-ip"; + else suffix = "-wtypes"; + vcg_open (irg, dump_file_suffix, suffix); + dump_vcg_header(get_irg_dump_name(irg), NULL); - if (dump_loop_information_flag) dump_loop_info(irg); + /* dump common blocked ir graph */ + construct_block_lists(irg); + + for (i = 0; i < get_irp_n_irgs(); i++) { + ir_node **arr = ird_get_irg_link(get_irp_irg(i)); + if (arr) { + dump_graph(get_irp_irg(i)); + DEL_ARR_F(arr); + } + } + + /* dump type info */ + current_ir_graph = irg; + type_walk_irg(irg, dump_type_info, NULL, NULL); + inc_irg_visited(get_const_code_irg()); + + /* dump edges from graph to type info */ + irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, NULL); - vcg_close(); current_ir_graph = rem; + vcg_close(); } - /***********************************************************************/ -/* the following routines dump a control flow graph */ +/* The following routines dump a control flow graph. */ /***********************************************************************/ - static void dump_block_to_cfg (ir_node *block, void *env) { int i; ir_node *pred; - if (get_irn_opcode(block) == iro_Block) { + if (is_Block(block)) { /* This is a block. Dump a node for the block. */ - fprintf (F, "node: {title:\""); PRINT_NODEID(block); - xfprintf (F, "\" label: \"%I ", block->op->name); PRINT_NODEID(block); - - if (exc_normal != get_Block_exc (block)) - fprintf (F, " (%s)", exc_to_string (get_Block_exc (block))); - + fprintf (F, "node: {title: \""); PRINT_NODEID(block); + fprintf (F, "\" label: \"%s ", get_op_name(get_irn_op(block))); + PRINT_NODEID(block); fprintf (F, "\" "); if (dump_dominator_information_flag) - fprintf(F, "info1:\"dom depth %d\"", get_Block_dom_depth(block)); + fprintf(F, "info1:dom depth %d", get_Block_dom_depth(block)); fprintf (F, "}\n"); /* Dump the edges */ for ( i = 0; i < get_Block_n_cfgpreds(block); i++) if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) { - pred = get_nodes_Block(skip_Proj(get_Block_cfgpred(block, i))); - fprintf (F, "edge: { sourcename: \""); - PRINT_NODEID(block); - fprintf (F, "\" targetname: \""); - PRINT_NODEID(pred); - fprintf (F, "\" }\n"); + pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i))); + fprintf (F, "edge: { sourcename: \""); + PRINT_NODEID(block); + fprintf (F, "\" targetname: \""); + PRINT_NODEID(pred); + fprintf (F, "\"}\n"); } /* Dump dominator edge */ @@ -1332,36 +1936,78 @@ dump_cfg (ir_graph *irg) { ir_graph *rem = current_ir_graph; int ddif = dump_dominator_information_flag; + int ipv = interprocedural_view; + + if(strncmp(get_irg_dump_name(irg),dump_file_filter,strlen(dump_file_filter))!=0) return; + current_ir_graph = irg; - vcg_open (irg, "-cfg"); + + vcg_open (irg, dump_file_suffix, "-cfg"); + dump_vcg_header(get_irg_dump_name(irg), NULL); + + if (interprocedural_view) { + printf("Warning: dumping cfg not in interprocedural view!\n"); + interprocedural_view = 0; + } if (get_irg_dom_state(irg) != dom_consistent) dump_dominator_information_flag = 0; /* walk over the blocks in the graph */ - irg_block_walk(irg->end, dump_block_to_cfg, NULL, NULL); - dump_ir_node (irg->bad); + irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, NULL); + dump_node (get_irg_bad(irg)); dump_dominator_information_flag = ddif; + interprocedural_view = ipv; vcg_close(); current_ir_graph = rem; } + +/* Dump all irgs in interprocedural view to a single file. */ +void dump_all_cg_block_graph(void) { + int i; + int rem_view = interprocedural_view; + interprocedural_view = 1; + + vcg_open_name ("All_graphs", dump_file_suffix); + dump_vcg_header("All_graphs", NULL); + + /* collect nodes in all irgs reachable in call graph*/ + for (i = 0; i < get_irp_n_irgs(); i++) + ird_set_irg_link(get_irp_irg(i), NULL); + + cg_walk(clear_link, collect_node, NULL); + + /* dump all graphs */ + for (i = 0; i < get_irp_n_irgs(); i++) { + current_ir_graph = get_irp_irg(i); + assert(ird_get_irg_link(current_ir_graph)); + dump_graph(current_ir_graph); + DEL_ARR_F(ird_get_irg_link(current_ir_graph)); + } + + vcg_close(); + interprocedural_view = rem_view; +} + /***********************************************************************/ -/* the following routine dumps all type information reachable from an */ -/* irg */ +/* the following routines dumps type information without any ir nodes. */ /***********************************************************************/ - void dump_type_graph (ir_graph *irg) { ir_graph *rem; rem = current_ir_graph; + + if(strncmp(get_irg_dump_name(irg),dump_file_filter,strlen(dump_file_filter))!=0) return; + current_ir_graph = irg; - vcg_open (irg, "-type"); + vcg_open (irg, dump_file_suffix, "-type"); + dump_vcg_header(get_irg_dump_name(irg), NULL); /* walk over the blocks in the graph */ type_walk_irg(irg, dump_type_info, NULL, NULL); @@ -1375,15 +2021,11 @@ dump_type_graph (ir_graph *irg) current_ir_graph = rem; } -/***********************************************************************/ -/* the following routine dumps all type information */ -/***********************************************************************/ - - void dump_all_types (void) { - vcg_open_name ("All_types"); + vcg_open_name ("All_types", dump_file_suffix); + dump_vcg_header("All_types", NULL); type_walk(dump_type_info, NULL, NULL); inc_irg_visited(get_const_code_irg()); vcg_close(); @@ -1392,7 +2034,8 @@ dump_all_types (void) void dump_class_hierarchy (bool entities) { - vcg_open_name ("class_hierarchy"); + vcg_open_name ("class_hierarchy", dump_file_suffix); + dump_vcg_header("class_hierarchy", NULL); if (entities) type_walk(dump_class_hierarchy_node, NULL, (void *)1); else @@ -1400,53 +2043,6 @@ dump_class_hierarchy (bool entities) vcg_close(); } -/***********************************************************************/ -/* dumps a graph with type information */ -/***********************************************************************/ - - -void -dump_ir_graph_w_types (ir_graph *irg) -{ - ir_graph *rem; - rem = current_ir_graph; - current_ir_graph = irg; - - vcg_open (irg, "-all"); - - /* dump common ir graph */ - irg_walk(irg->end, dump_whole_node, NULL, NULL); - /* dump type info */ - type_walk_irg(irg, dump_type_info, NULL, NULL); - inc_irg_visited(get_const_code_irg()); - /* dump edges from graph to type info */ - irg_walk(irg->end, dump_node2type_edges, NULL, NULL); - - vcg_close(); - current_ir_graph = rem; -} - -void -dump_ir_block_graph_w_types (ir_graph *irg) -{ - ir_graph *rem; - rem = current_ir_graph; - current_ir_graph = irg; - - vcg_open (irg, "-all"); - - /* dump common blocked ir graph */ - dump_ir_block_graph_2(irg); - /* dump type info */ - type_walk_irg(irg, dump_type_info, NULL, NULL); - inc_irg_visited(get_const_code_irg()); - /* dump edges from graph to type info */ - irg_walk(irg->end, dump_node2type_edges, NULL, NULL); - - vcg_close(); - current_ir_graph = rem; -} - /***********************************************************************/ /* dumps all graphs with the graph-dumper passed. Possible dumpers: */ /* dump_ir_graph */ @@ -1455,241 +2051,239 @@ dump_ir_block_graph_w_types (ir_graph *irg) /* dump_type_graph */ /* dump_ir_graph_w_types */ /***********************************************************************/ -void dump_all_ir_graphs (dump_graph_func *dump_graph) { + +void dump_all_ir_graphs (dump_graph_func *dmp_grph) { int i; for (i=0; i < get_irp_n_irgs(); i++) { - dump_graph(get_irp_irg(i)); + dmp_grph(get_irp_irg(i)); } } -/* To turn off display of edge labels. Edge labels offen cause xvcg to - abort with a segmentation fault. */ -void turn_off_edge_labels(void) { - edge_label = 0; -} +/********************************************************************************** + * Dumps a stand alone loop graph with firm nodes which belong to one loop nodes * + * packed together in one subgraph * + **********************************************************************************/ -void dump_consts_local(bool b) { - dump_const_local = b; -} - -void turn_off_constant_entity_values(void) { - const_entities = 0; -} -void dump_keepalive_edges(bool b) { - dump_keepalive = b; -} +void dump_loops_standalone (ir_loop *loop) { + int i = 0, loop_node_started = 0, son_number = 0, first = 0; + loop_element le; + ir_loop *son = NULL; -void dump_out_edges(void) { - dump_out_edge_flag = 1; -} + /* Dump a new loop node. */ + dump_loop_node(loop); -void dump_dominator_information(void) { - dump_dominator_information_flag = 1; -} + /* Dump the loop elements. */ -void dump_loop_information(void) { - dump_loop_information_flag = 1; -} - -void dont_dump_loop_information(void) { - dump_loop_information_flag = 0; -} - -static void clear_link(ir_node * node, void * env) { - set_irn_link(node, NULL); -} - -static void collect_blocks_floats_cg(ir_node * node, pmap * map) { - if (is_Block(node) - || node_floats(node) - || get_irn_op(node) == op_Bad - || get_irn_op(node) == op_Unknown) { - pmap_entry * entry = pmap_find(map, current_ir_graph); - if (entry) { - ARR_APP1(ir_node *, (ir_node **) entry->value, node); - } else { - ir_node ** arr = NEW_ARR_F(ir_node *, 1); - arr[0] = node; - pmap_insert(map, current_ir_graph, arr); + for(i = 0; i < get_loop_n_elements(loop); i++) + { + le = get_loop_element(loop, i); + son = le.son; + if (get_kind(son) == k_ir_loop) { + + /* We are a loop son -> Recurse */ + + if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */ + fprintf(F, "\" }\n"); + fprintf (F, "edge: {sourcename: \""); + PRINT_LOOPID(loop); + fprintf (F, "\" targetname: \""); + PRINT_LOOPID(loop); + fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1); + loop_node_started = 0; + } + dump_loop_son_edge(loop, son_number++); + dump_loops_standalone(son); + } + else { + /* We are a loop node -> Collect firm nodes */ + + ir_node *n = le.node; + int bad = 0; + + if (!loop_node_started) { + /* Start a new node which contains all firm nodes of the current loop */ + fprintf (F, "node: { title: \""); + PRINT_LOOPID(loop); + fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i); + loop_node_started = 1; + first = i; + } + else + fprintf(F, "\n"); + + bad |= dump_node_opcode(F, n); + bad |= dump_node_mode (n); + bad |= dump_node_typeinfo(n); + fprintf (F, " "); + bad |= dump_node_nodeattr(n); + fprintf (F, " %ld", get_irn_node_nr(n)); + } } - } else { - ir_node * block = get_nodes_Block(node); - set_irn_link(node, get_irn_link(block)); - set_irn_link(block, node); - } -} - -static void dump_cg_ir_block(ir_node * block, void * env) { - ir_node *node; - pmap *irgmap = (pmap *)env; - assert(is_Block(block)); - fprintf(F, "graph: { title: \""); - PRINT_NODEID(block); - fprintf(F, "\" label: \""); -#ifdef DEBUG_libfirm - fprintf (F, "%ld", get_irn_node_nr(block)); -#else - xfprintf (F, "%I", block->op->name); -#endif - if (exc_normal != get_Block_exc(block)) { - fprintf (F, " (%s)", exc_to_string (get_Block_exc(block))); + if (loop_node_started) { + fprintf(F, "\" }\n"); + fprintf (F, "edge: {sourcename: \""); + PRINT_LOOPID(loop); + fprintf (F, "\" targetname: \""); + PRINT_LOOPID(loop); + fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1); + loop_node_started = 0; } +} - fprintf(F, "\" status:clustered color:%s \n", - get_Block_matured(block) ? "yellow" : "red"); +void dump_loop_tree(ir_graph *irg, char *suffix) +{ + ir_graph *rem = current_ir_graph; + int el_rem = edge_label; + edge_label = 1; - /* dump the blocks edges */ - dump_ir_data_edges(block); + /* @@@ AS: What does that do? */ + if(strncmp(get_irg_dump_name(irg),dump_file_filter,strlen(dump_file_filter))!=0) return; - /* dump the nodes that go into the block */ - for (node = get_irn_link(block); node; node = get_irn_link(node)) { - dump_node(node, irgmap); - dump_ir_data_edges(node); - } + current_ir_graph = irg; - /* Close the vcg information for the block */ - fprintf(F, "}\n\n"); -} + vcg_open(irg, suffix, "-looptree"); + dump_vcg_header(get_irg_dump_name(irg), "top_to_bottom"); -static void d_cg_block_graph(ir_graph *irg, ir_node **arr, pmap *irgmap) { - int i; + if (get_irg_loop(irg)) dump_loops_standalone(get_irg_loop(irg)); - xfprintf(F, "graph: { title: \"%p\" label: \"%I\" status:clustered color:white \n", - irg, get_entity_ident(get_irg_ent(irg))); + vcg_close(); - for (i = ARR_LEN(arr) - 1; i >= 0; --i) { - ir_node * node = arr[i]; - if (is_Block(node)) { - /* Dumps the block and all the nodes in the block , which are to - be found in Block->link. */ - dump_cg_ir_block(node, irgmap); - } else { - /* Nodes that are not in a Block. */ - dump_node(node, NULL); - dump_ir_data_edges(node); - } - } - /* Close the vcg information for the irg */ - fprintf(F, "}\n\n"); + edge_label = el_rem; + current_ir_graph = rem; } -/* dump interprocedural graph with surrounding methods */ -void dump_cg_block_graph(ir_graph * irg) { - pmap * map = pmap_create(); - pmap * map2 = pmap_create(); - pmap_entry * entry; - vcg_open(irg, ""); +/*******************************************************************************/ +/* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */ +/*******************************************************************************/ - irg_walk_graph(irg, clear_link, (irg_walk_func *) collect_blocks_floats_cg, map); - for (entry = pmap_first(map); entry; entry = pmap_next(map)) - pmap_insert(map2, entry->key, entry->value); - for (entry = pmap_first(map); entry; entry = pmap_next(map)) { - d_cg_block_graph(entry->key, entry->value, map2); - DEL_ARR_F(entry->value); - } - - pmap_destroy(map); - pmap_destroy(map2); +void collect_nodeloop(ir_loop *loop, eset *loopnodes) { + int i, son_number = 0, node_number = 0; - if (dump_loop_information_flag) dump_loop_info(irg); - vcg_close(); -} + if (dump_loop_information_flag) dump_loop_node(loop); -static void collect_node(ir_node * node, void *env) { - if (is_Block(node) - || node_floats(node) - || get_irn_op(node) == op_Bad - || get_irn_op(node) == op_Unknown) { - ir_node ** arr = (ir_node **) get_irg_link(current_ir_graph); - ARR_APP1(ir_node *, arr, node); - set_irg_link(current_ir_graph, arr); /* arr is an l-value, APP_ARR might change it! */ - } else { - ir_node * block = get_nodes_Block(node); - set_irn_link(node, get_irn_link(block)); - set_irn_link(block, node); + for (i = 0; i < get_loop_n_elements(loop); i++) { + loop_element le = get_loop_element(loop, i); + if (*(le.kind) == k_ir_loop) { + if (dump_loop_information_flag) dump_loop_son_edge(loop, son_number++); + /* Recur */ + collect_nodeloop(le.son, loopnodes); + } else { + if (dump_loop_information_flag) dump_loop_node_edge(loop, node_number++); + eset_insert(loopnodes, le.node); + } } } -/* Links all nodes that have the block field set in the link field of - the block. Adds all blocks and nodes not associated with a block - in a array in irg->link. */ -static void collect_nodes(void) { - int i; - for (i = 0; i < get_irp_n_irgs(); i++) - set_irg_link(get_irp_irg(i), NEW_ARR_F(ir_node *, 0)); - cg_walk(clear_link, collect_node, NULL); -} +void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) { + int i, j, start; -static void dump_graphs(void) { - int i; - for (i = 0; i < get_irp_n_irgs(); i++) { - current_ir_graph = get_irp_irg(i); - d_cg_block_graph(current_ir_graph, get_irg_link(current_ir_graph), NULL); + for(i = 0; i < get_loop_n_elements(loop); i++) { + loop_element le = get_loop_element(loop, i); + if (*(le.kind) == k_ir_loop) { + /* Recur */ + collect_nodeloop_external_nodes(le.son, loopnodes, extnodes); + } else { + if (is_Block(le.node)) start = 0; else start = -1; + for (j = start; j < get_irn_arity(le.node); j++) { + ir_node *pred = get_irn_n(le.node, j); + if (!eset_contains(loopnodes, pred)) { + eset_insert(extnodes, pred); + if (!is_Block(pred)) { + pred = get_nodes_block(pred); + if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred); + } + } + } + } } } -/* Dump all irgs in interprocedural view to a single file. */ -void dump_all_cg_block_graph(void) { - int i; - int rem_view = interprocedural_view; - interprocedural_view = 1; - vcg_open_name ("All_graphs"); - - collect_nodes(); - dump_graphs(); - - if (dump_loop_information_flag) - for (i = 0; i < get_irp_n_irgs(); i++) - dump_loop_info(get_irp_irg(i)); - - vcg_close(); - interprocedural_view = rem_view; -} - -/* dump interprocedural block graph with surrounding methods */ -void dump_cg_graph(ir_graph * irg) { - pmap * map = pmap_create(); - pmap * map2 = pmap_create(); /* We can not iterate in the same map twice! */ - pmap_entry * entry; - vcg_open(irg, ""); - - irg_walk_graph(irg, clear_link, (irg_walk_func *) collect_blocks_floats_cg, map); - for (entry = pmap_first(map); entry; entry = pmap_next(map)) - pmap_insert(map2, entry->key, entry->value); - for (entry = pmap_first(map); entry; entry = pmap_next(map)) { - ir_node ** arr = entry->value; - int i; - ident * irg_ident = get_entity_ident(get_irg_ent(entry->key)); - - xfprintf(F, "graph: { title: \"%I\" label: \"%I\" status:clustered color:white \n", - irg_ident, irg_ident); - - for (i = ARR_LEN(arr) - 1; i >= 0; --i) { - ir_node * node = arr[i]; - dump_node(node, map2); - dump_ir_data_edges(node); - if (is_Block(node)) { - for (node = get_irn_link(node); node; node = get_irn_link(node)) { - dump_node(node, map2); - dump_ir_block_edge(node); - dump_ir_data_edges(node); - } - } +void dump_loop (ir_loop *l, char *suffix) { + char name[50]; + eset *loopnodes = eset_create(); + eset *extnodes = eset_create(); + ir_node *n, *b; + + sprintf(name, "loop_%d", get_loop_loop_nr(l)); + vcg_open_name (name, suffix); + dump_vcg_header(name, NULL); + + /* collect all nodes to dump */ + collect_nodeloop(l, loopnodes); + collect_nodeloop_external_nodes(l, loopnodes, extnodes); + + /* build block lists */ + for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) + set_irn_link(n, NULL); + for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) + set_irn_link(n, NULL); + for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) + if (!is_Block(n)) { + b = get_nodes_block(n); + set_irn_link(n, get_irn_link(b)); + set_irn_link(b, n); + } + for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) + if (!is_Block(n)) { + b = get_nodes_block(n); + set_irn_link(n, get_irn_link(b)); + set_irn_link(b, n); } - DEL_ARR_F(arr); + for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) + if (is_Block(b)) { + fprintf(F, "graph: { title: \""); + PRINT_NODEID(b); + fprintf(F, "\" label: \""); + dump_node_opcode(F, b); + fprintf (F, " %ld", get_irn_node_nr(b)); + fprintf(F, "\" status:clustered color:yellow\n"); + + /* dump the blocks edges */ + dump_ir_data_edges(b); + + /* dump the nodes that go into the block */ + for (n = get_irn_link(b); n; n = get_irn_link(n)) { + if (eset_contains(extnodes, n)) overrule_nodecolor = "lightblue"; + dump_node(n); + overrule_nodecolor = NULL; + if (!eset_contains(extnodes, n)) dump_ir_data_edges(n); + } - /* Close the vcg information for the irg */ - fprintf(F, "}\n\n"); - } + /* Close the vcg information for the block */ + fprintf(F, "}\n"); + dump_const_node_local(b); + fprintf(F, "\n"); + } + for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) + if (is_Block(b)) { + fprintf(F, "graph: { title: \""); + PRINT_NODEID(b); + fprintf(F, "\" label: \""); + dump_node_opcode(F, b); + fprintf (F, " %ld", get_irn_node_nr(b)); + fprintf(F, "\" status:clustered color:lightblue\n"); + + /* dump the nodes that go into the block */ + for (n = get_irn_link(b); n; n = get_irn_link(n)) { + if (!eset_contains(loopnodes, n)) overrule_nodecolor = "lightblue"; + dump_node(n); + overrule_nodecolor = NULL; + if (eset_contains(loopnodes, n)) dump_ir_data_edges(n); + } - pmap_destroy(map); - pmap_destroy(map2); + /* Close the vcg information for the block */ + fprintf(F, "}\n"); + dump_const_node_local(b); + fprintf(F, "\n"); + } + eset_destroy(loopnodes); + eset_destroy(extnodes); vcg_close(); }