** irdump.h: dumping of an intermediate representation graph
*/
+/* $Id$ */
+
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
# include "irdump.h"
# include "panic.h"
# include <string.h>
-# include "entity.h"
+# include "entity_t.h"
# include <stdlib.h>
# include "array.h"
# include "irop_t.h"
# include "type_or_entity.h"
# include "irgwalk.h"
# include "typewalk.h"
+# include "irouts.h"
+#include "irdom.h"
/* Attributes of nodes */
#define DEFAULT_NODE_ATTR ""
#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"
/* Attributes of edges between Firm nodes and type/entity nodes */
-#define NODE2TYPE_EDGE_ATTR ""
+#define NODE2TYPE_EDGE_ATTR "class: 2 priority: 2 linestyle: dotted"
/* Attributes of edges in type/entity graphs. */
#define TYPE_METH_NODE_ATTR "color: lightyellow"
#define TYPE_CLASS_NODE_ATTR "color: green"
#define ENTITY_NODE_ATTR "color: yellow"
-#define ENT_TYPE_EDGE_ATTR "label: \"type\" color: red"
-#define ENT_OWN_EDGE_ATTR "label: \"owner\" color: black"
-#define METH_PAR_EDGE_ATTR "label: \"param %d\" color: green"
-#define METH_RES_EDGE_ATTR "label: \"res %d\" color: green"
-#define TYPE_SUPER_EDGE_ATTR "label: \"supertype\" color: blue"
-#define UNION_EDGE_ATTR "label: \"component\" color: blue"
-#define PTR_PTS_TO_EDGE_ATTR "label: \"points to\" color:green"
-#define ARR_ELT_TYPE_EDGE_ATTR "label: \"arr elt\" color:green"
-
+#define ENT_TYPE_EDGE_ATTR "class: 3 label: \"type\" color: red"
+#define ENT_OWN_EDGE_ATTR "class: 4 label: \"owner\" color: black"
+#define METH_PAR_EDGE_ATTR "class: 5 label: \"param %d\" color: green"
+#define METH_RES_EDGE_ATTR "class: 6 label: \"res %d\" color: green"
+#define TYPE_SUPER_EDGE_ATTR "class: 7 label: \"supertype\" color: blue"
+#define UNION_EDGE_ATTR "class: 8 label: \"component\" color: blue"
+#define PTR_PTS_TO_EDGE_ATTR "class: 9 label: \"points to\" color:green"
+#define ARR_ELT_TYPE_EDGE_ATTR "class: 10 label: \"arr elt tp\" color:green"
+#define ARR_ENT_EDGE_ATTR "class: 10 label: \"arr ent\" color: green"
+#define ENT_OVERWRITES_EDGE_ATTR "class: 11 label: \"overwrites\" color:red"
+#define ENT_VALUE_EDGE_ATTR "label: \"value "
+#define ENT_CORR_EDGE_ATTR "label: \"value %d corresponds to \" "
+#define TYPE_MEMBER_EDGE_ATTR "class: 12 label: \"member\" color:blue"
+
+
+#if DEBUG_libfirm && NODEID_AS_LABEL
+#define PRINT_NODEID(X) fprintf(F, "%d", get_irn_node_nr(X))
+#else
#define PRINT_NODEID(X) fprintf(F, "%p", X)
+#endif
+
+/* A suffix to manipulate the file name. */
+char *dump_file_suffix = NULL;
/* file to dump to */
static FILE *F;
+/* A compiler option to turn off edge labels */
int edge_label = 1;
+/* A compiler option to turn off dumping values of constant entities */
+int const_entities = 1;
+/* A compiler option to dump the keep alive edges */
+int dump_keepalive = 0;
+/* A compiler option to dump the out edges in dump_ir_graph */
+int dump_out_edge_flag = 0;
+int dump_dominator_information_flag = 0;
+
+/* A global variable to record output of the Bad node. */
+int Bad_dumped;
+
+
+void dump_ir_blocks_nodes (ir_node *n, void *env);
+void dump_whole_node (ir_node *n, void* env);
/*******************************************************************/
/* routines to dump information about a single node */
/* SymConst */
} else if (n->op->code == iro_SymConst) {
if (get_SymConst_kind(n) == linkage_ptr_info) {
- xfprintf (F, "%I", get_SymConst_ptrinfo(n));
+ /* don't use get_SymConst_ptr_info as it mangles the name. */
+ xfprintf (F, "SymC %I", n->attr.i.tori.ptrinfo);
} else {
assert(get_kind(get_SymConst_type(n)) == k_type);
- assert(get_type_nameid(get_SymConst_type(n)));
- xfprintf (F, "%s ", id_to_str(get_type_nameid(get_SymConst_type(n))));
+ assert(get_type_ident(get_SymConst_type(n)));
+ xfprintf (F, "SymC %I ", get_type_ident(get_SymConst_type(n)));
if (get_SymConst_kind == type_tag)
xfprintf (F, "tag");
else
break;
case iro_Sel: {
assert(get_kind(get_Sel_entity(n)) == k_entity);
- xfprintf (F, "%s", id_to_str(get_entity_ident(get_Sel_entity(n))));
+ xfprintf (F, "%I", get_entity_ident(get_Sel_entity(n)));
} break;
default:
} /* end switch */
case iro_Sel:
assert(get_kind(get_Sel_entity(n)) == k_entity);
xfprintf (F, "\"%I ", get_irn_opident(n));
- xfprintf (F, "%s", id_to_str(get_entity_ident(get_Sel_entity(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_nameid(get_SymConst_type(n)));
+ assert(get_type_ident(get_SymConst_type(n)));
xfprintf (F, "\"%s ", get_type_name(get_SymConst_type(n)));
switch (n->attr.i.num){
case type_tag:
/* dump the edge to the block this node belongs to */
void
dump_ir_block_edge(ir_node *n) {
- if (is_no_Block(n))
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- BLOCK_EDGE_ATTR "}\n", n, get_nodes_Block(n));
+ if (is_no_Block(n)) {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ xfprintf (F, "\" targetname: \"");
+ PRINT_NODEID(get_nodes_Block(n));
+ xfprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
+ }
}
void print_edge_vcgattr(ir_node *from, int to) {
/* dump edges to our inputs */
void
dump_ir_data_edges(ir_node *n) {
- int i;
+ int i, max;
+
+ if ((get_irn_op(n) == op_End) && (!dump_keepalive))
+ return;
for (i = 0; i < get_irn_arity(n); i++) {
assert(get_irn_n(n, i));
- xfprintf (F, "edge: {sourcename: \"%p\" targetname: \"%p\"",
- n, get_irn_n(n, i));
- fprintf (F, " label: \"%d\" ", i+1);
+ fprintf (F, "edge: {sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"");
+ PRINT_NODEID(get_irn_n(n, i));
+ fprintf (F, "\"");
+ fprintf (F, " label: \"%d\" ", i);
print_edge_vcgattr(n, i);
fprintf (F, "}\n");
}
}
+/* dump out edges */
+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");
+ }
+}
+
+
/* dumps the edges between nodes and their type or entity attributes. */
void dump_node2type_edges (ir_node *n, void *env)
{
assert(n);
switch (get_irn_opcode(n)) {
+ case iro_Const :
+ /* @@@ some consts have an entity */
+ break;
case iro_SymConst:
if ( (get_SymConst_kind(n) == type_tag)
- || (get_SymConst_kind(n) == size))
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- NODE2TYPE_EDGE_ATTR "}\n", n, get_SymConst_type(n));
- break;
- case iro_Sel:
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- NODE2TYPE_EDGE_ATTR "}\n", n, get_Sel_entity(n));
- break;
- case iro_Call:
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- NODE2TYPE_EDGE_ATTR "}\n", n, get_Call_type(n));
- break;
- case iro_Alloc:
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- NODE2TYPE_EDGE_ATTR "}\n", n, get_Alloc_type(n));
- break;
- case iro_Free:
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- NODE2TYPE_EDGE_ATTR "}\n", n, get_Free_type(n));
+ || (get_SymConst_kind(n) == size)) {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"%p\" "
+ NODE2TYPE_EDGE_ATTR "}\n", get_SymConst_type(n));
+ }
break;
+ case iro_Sel: {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"%p\" "
+ NODE2TYPE_EDGE_ATTR "}\n", get_Sel_entity(n));
+ } break;
+ case iro_Call: {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"%p\" "
+ NODE2TYPE_EDGE_ATTR "}\n", get_Call_type(n));
+ } break;
+ case iro_Alloc: {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"%p\" "
+ NODE2TYPE_EDGE_ATTR "}\n", get_Alloc_type(n));
+ } break;
+ case iro_Free: {
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(n);
+ fprintf (F, "\" targetname: \"%p\" "
+ NODE2TYPE_EDGE_ATTR "}\n", get_Free_type(n));
+ } break;
default:
break;
}
}
+void dump_const_expression(ir_node *value) {
+ ir_graph *rem = current_ir_graph;
+ current_ir_graph = get_const_code_irg();
+ irg_walk(value, dump_ir_blocks_nodes, NULL, get_nodes_Block(value));
+ set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
+ current_ir_graph = rem;
+}
+
+
+void print_type_info(type *tp) {
+ if (get_type_state(tp) == layout_undefined) {
+ xfprintf(F, "state: layout_undefined\n");
+ } else {
+ xfprintf(F, "state: layout_fixed,\n");
+ }
+ if (get_type_mode(tp))
+ xfprintf(F, "mode: %s,\n", get_mode_name(get_type_mode(tp)));
+ xfprintf(F, "size: %dB,\n", get_type_size(tp));
+}
+
+
+void print_typespecific_info(type *tp) {
+ switch (get_type_tpop_code(tp)) {
+ case tpo_class:
+ {
+ xfprintf (F, " " TYPE_CLASS_NODE_ATTR);
+ } break;
+ case tpo_struct:
+ {
+ xfprintf (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 */
+}
+
+void print_type_node(type *tp) {
+ xfprintf (F, "node: {title: \"%p\" ", 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");
+}
+
/* dumps a type or entity and it's edges. */
void
dump_type_info (type_or_ent *tore, void *env) {
int i = 0; /* to shutup gcc */
/* dump this type or entity */
- xfprintf (F, "node: {title: \"%p\" ", tore);
- xfprintf (F, DEFAULT_TYPE_ATTRIBUTE);
- xfprintf (F, "label: ");
switch (get_kind(tore)) {
case k_entity:
{
entity *ent = (entity *)tore;
- xfprintf (F, "\"ent %I\" " ENTITY_NODE_ATTR "}\n", get_entity_ident(ent));
+ ir_node *value;
+ /* The node */
+ xfprintf (F, "node: {title: \"%p\" ", tore);
+ xfprintf (F, DEFAULT_TYPE_ATTRIBUTE);
+ xfprintf (F, "label: ");
+ xfprintf (F, "\"ent %I\" " ENTITY_NODE_ATTR , get_entity_ident(ent));
+ if(dynamic_allocated == get_entity_allocation(ent))
+ xfprintf (F, " info1:\"dynamic allocated\n");
+ else
+ xfprintf (F, " info1:\"static allocated\n");
+ switch (get_entity_visibility(ent)) {
+ case local: fprintf (F, "local\n"); break;
+ case external_visible: fprintf (F, "external_visible\n"); break;
+ case external_allocated: fprintf (F, "external_allocate\n");break;
+ }
+ 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;
+ }
+ if (is_method_type(get_entity_type(ent)))
+ xfprintf (F, "\n irg = %p ", get_entity_irg(ent));
+ xfprintf(F, "\"}\n");
+ /* The Edges */
+ /* skip this to reduce graph. Member edge of type is parallel to this edge. *
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- ENT_OWN_EDGE_ATTR "}\n", tore, get_entity_owner(ent));
+ ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- ENT_TYPE_EDGE_ATTR "}\n", tore, get_entity_type(ent));
+ ENT_TYPE_EDGE_ATTR "}\n", ent, get_entity_type(ent));
+ for(i = 0; i < get_entity_n_overwrites(ent); i++)
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
+ ENT_OVERWRITES_EDGE_ATTR "}\n", ent, get_entity_overwrites(ent, i));
+ /* attached subgraphs */
+ if (const_entities && (get_entity_variability(ent) != uninitialized)) {
+ if (is_atomic_entity(ent)) {
+ value = get_atomic_ent_value(ent);
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"", 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);
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"", ent);
+ PRINT_NODEID(value);
+ fprintf(F, "\" " ENT_VALUE_EDGE_ATTR " %d \"}\n", i);
+ dump_const_expression(value);
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
+ ENT_CORR_EDGE_ATTR "}\n", ent,
+ get_compound_ent_value_member(ent, i), i);
+ }
+ }
+ }
} break;
case k_type:
{
- /* why can't I cast here??? @@@ */
- type *type = tore;
- xfprintf (F, "\"%I %I", get_type_tpop_nameid(type), get_type_nameid(type));
-
- switch (get_type_tpop_code(type)) {
+ type *tp = (type *)tore;
+ print_type_node(tp);
+ /* and now the edges */
+ switch (get_type_tpop_code(tp)) {
case tpo_class:
{
- xfprintf (F, "\" " TYPE_CLASS_NODE_ATTR "}\n");
- for (i=0; i < get_class_n_supertype(type); i++)
+ for (i=0; i < get_class_n_supertype(tp); i++)
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
TYPE_SUPER_EDGE_ATTR "}\n",
- type, get_class_supertype(type, i));
+ tp, get_class_supertype(tp, i));
+ for (i=0; i < get_class_n_member(tp); i++)
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
+ TYPE_MEMBER_EDGE_ATTR "}\n",
+ tp, get_class_member(tp, i));
} break;
case tpo_struct:
{
- xfprintf (F, "\"}\n");
+ for (i=0; i < get_struct_n_member(tp); i++)
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
+ TYPE_MEMBER_EDGE_ATTR "}\n",
+ tp, get_struct_member(tp, i));
} break;
case tpo_method:
{
- xfprintf (F, "\" " TYPE_METH_NODE_ATTR "}\n");
- for (i = 0; i < get_method_n_params(type); i++)
+ for (i = 0; i < get_method_n_params(tp); i++)
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
METH_PAR_EDGE_ATTR "}\n",
- type, get_method_param_type(type, i), i);
- for (i = 0; i < get_method_n_res(type); i++)
+ tp, get_method_param_type(tp, i), i);
+ for (i = 0; i < get_method_n_res(tp); i++)
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
METH_RES_EDGE_ATTR "}\n",
- type, get_method_res_type(type, i), i);
+ tp, get_method_res_type(tp, i), i);
} break;
case tpo_union:
{
- xfprintf (F, "\"}\n");
- for (i = 0; i < get_union_n_members(type); i++)
+ for (i = 0; i < get_union_n_members(tp); i++)
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
"label: \"\"f" UNION_EDGE_ATTR "}\n",
- type, get_union_member(type, i));
+ tp, get_union_member(tp, i));
} break;
case tpo_array:
{
- xfprintf (F, "\"}\n");
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- ARR_ELT_TYPE_EDGE_ATTR "}\n", type, get_array_element_type(type), i);
+ ARR_ELT_TYPE_EDGE_ATTR "}\n", tp, get_array_element_type(tp), i);
+ xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
+ ARR_ENT_EDGE_ATTR "}\n", tp, get_array_element_entity(tp), i);
} break;
case tpo_enumeration:
{
- xfprintf (F, "\"}\n");
} break;
case tpo_pointer:
{
- xfprintf (F, "\"}\n");
xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
- PTR_PTS_TO_EDGE_ATTR "}\n", type,
- get_pointer_points_to_type(type), i);
+ PTR_PTS_TO_EDGE_ATTR "}\n", tp,
+ get_pointer_points_to_type(tp), i);
} break;
case tpo_primitive:
{
- xfprintf (F, "mode %I\"}\n", get_mode_ident(get_type_mode(type)));
} break;
default: break;
} /* switch type */
-
- } break; /* case k_type */
+ }
+ break; /* case k_type */
default:
{
- xfprintf (F, "\" faulty type \"}\n");
printf(" *** irdump, %s(l.%i), faulty type.\n", __FUNCTION__, __LINE__);
} break;
} /* switch kind_or_entity */
ident *id;
int len;
char label[4];
+ entity *ent;
/** open file for vcg graph */
- id = get_entity_ld_ident (get_irg_ent(irg));
+ 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);
-
- fname = malloc (len + 5 + strlen(suffix));
+ 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 + 5 + strlen(suffix));
- strncpy (fname, cp, len); /* copy the filename */
- fname[len] = '\0'; /* ensure string termination */
- /*strcpy (fname, cp); * copy the filename *
- this produces wrong, too long strings in conjuction with the
- jocca frontend. The \0 seems to be missing. */
- strcat (fname, suffix); /* append file suffix */
strcat (fname, ".vcg"); /* append the .vcg suffix */
F = fopen (fname, "w"); /* open file for writing */
if (!F) {
"port_sharing: no\n"
"orientation: bottom_to_top\n"
"classname 1: \"Data\"\n"
- "classname 2: \"Block\"\n", cp, label);
+ "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);
xfprintf (F, "\n"); /* a separator */
}
"port_sharing: no\n"
"orientation: bottom_to_top\n"
"classname 1: \"Data\"\n"
- "classname 2: \"Block\"\n", name, label);
+ "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);
xfprintf (F, "\n"); /* a separator */
}
void
dump_whole_node (ir_node *n, void* env) {
dump_node(n);
- dump_ir_block_edge(n);
+ if (!node_floats(n)) dump_ir_block_edge(n);
dump_ir_data_edges(n);
}
/* walk over the graph */
irg_walk(irg->end, dump_whole_node, NULL, 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);
+ }
+
vcg_close();
current_ir_graph = rem;
/* the following routines dump the nodes as attached to the blocks. */
/***********************************************************************/
+int node_floats(ir_node *n) {
+
+ return ((get_op_pinned(get_irn_op(n)) == floats) &&
+ (get_irg_pinned(current_ir_graph) == floats));
+}
+
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) {
+ if (is_no_Block(n) && get_nodes_Block(n) == block && !node_floats(n)) {
dump_node(n);
dump_ir_data_edges(n);
}
+ if (get_irn_op(n) == op_Bad)
+ Bad_dumped = 1;
}
void
#else
xfprintf (F, "%I", block->op->name);
#endif
- xfprintf(F, "\" status:clustered color:lightyellow \n");
+ xfprintf(F, "\" status:clustered color:%s \n",
+ get_Block_matured (block) ? "yellow" : "red");
/* dump the blocks edges */
dump_ir_data_edges(block);
}
}
+
+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);
+ 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);
+ dump_ir_data_edges(n);
+ if (get_irn_op(n) == op_Bad) Bad_dumped = 1;
+ }
+}
+
+void dump_ir_block_graph_2 (ir_graph *irg)
+{
+ Bad_dumped = 0;
+ /* walk over the blocks in the graph */
+ irg_block_walk(irg->end, dump_ir_block, NULL, irg);
+
+ /* dump all nodes that are not in a Block */
+ irg_walk(irg->end, dump_blockless_nodes, NULL, NULL);
+
+ /* dump the Bad node */
+ if (!Bad_dumped)
+ dump_node(get_irg_bad(irg));
+}
+
void
dump_ir_block_graph (ir_graph *irg)
{
vcg_open (irg, "");
- /* walk over the blocks in the graph */
- irg_block_walk(irg->end, dump_ir_block, NULL, irg);
+ dump_ir_block_graph_2 (irg);
vcg_close();
current_ir_graph = rem;
if (get_irn_opcode(block) == iro_Block) {
/* This is a block. Dump a node for the block. */
- xfprintf (F, "node: {title: \"%p\" label: \"%I\"}", block,
- block->op->name);
+ xfprintf (F, "node: {title:\""); PRINT_NODEID(block);
+ xfprintf (F, "\" label: \"%I ", block->op->name); PRINT_NODEID(block);
+ xfprintf (F, "\" ");
+ if (dump_dominator_information_flag)
+ xfprintf(F, "info1:\"dom depth %d\"", get_Block_dom_depth(block));
+ xfprintf (F, "}\n");
/* Dump the edges */
- for ( i = 0; i < get_Block_n_cfgpreds(block); i++) {
- pred = get_nodes_Block(skip_Proj(get_Block_cfgpred(block, i)));
- xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" }\n",
- block, pred);
+ 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)));
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(block);
+ fprintf (F, "\" targetname: \"");
+ PRINT_NODEID(pred);
+ fprintf (F, "\" }\n");
+ }
+
+ /* Dump dominator edge */
+ if (dump_dominator_information_flag && get_Block_idom(block)) {
+ pred = get_Block_idom(block);
+ xfprintf (F, "edge: { sourcename: \"");
+ PRINT_NODEID(block);
+ fprintf (F, "\" targetname: \"");
+ PRINT_NODEID(pred);
+ fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
}
}
}
void
dump_cfg (ir_graph *irg)
{
+ int rem = dump_dominator_information_flag;
vcg_open (irg, "-cfg");
+ 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_dominator_information_flag = rem;
vcg_close();
}
/* walk over the blocks in the graph */
type_walk_irg(irg, dump_type_info, NULL, NULL);
+ /* The walker for the const code can be called several times for the
+ same (sub) experssion. So that no nodes are dumped several times
+ we decrease the visited flag of the corresponding graph after each
+ walk. So now increase it finally. */
+ inc_irg_visited(get_const_code_irg());
vcg_close();
current_ir_graph = rem;
{
vcg_open_name ("All_types");
type_walk(dump_type_info, NULL, NULL);
+ inc_irg_visited(get_const_code_irg());
vcg_close();
}
vcg_open (irg, "-all");
/* dump common ir graph */
- /* irg_block_walk(irg->end, dump_ir_block, NULL, irg); */
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);
/* To turn off display of edge labels. Edge labels offen cause xvcg to
abort with a segmentation fault. */
-void turn_of_edge_labels() {
+void turn_off_edge_labels() {
edge_label = 0;
}
+
+void turn_off_constant_entity_values() {
+ const_entities = 0;
+}
+
+void dump_keepalive_edges() {
+ dump_keepalive = 1;
+}
+
+void dump_out_edges() {
+ dump_out_edge_flag = 1;
+}
+
+void dump_dominator_information() {
+ dump_dominator_information_flag = 1;
+}
projects / libfirm / blobdiff