/* Attributes of nodes */
#define PRINT_DEFAULT_NODE_ATTR
-#define DEFAULT_NODE_ATTR ""
-#define DEFAULT_TYPE_ATTRIBUTE ""
+#define DEFAULT_NODE_ATTR " "
+#define DEFAULT_TYPE_ATTRIBUTE " "
/* Attributes of edges between Firm nodes */
#define BLOCK_EDGE_ATTR "class: 2 priority: 2 linestyle: dotted"
#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))
+
#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, "\"%p%p\"", (void*) X, (void*) 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__);}
+#define PRINT_TYPE_TYPE_EDGE(S,T,...){fprintf (F, "edge: { sourcename: "); PRINT_TYPEID(S); fprintf (F, " targetname: "); PRINT_TYPEID(T); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_TYPE_ENT_EDGE(S,T,...) {fprintf (F, "edge: { sourcename: "); PRINT_TYPEID(S); fprintf (F, " targetname: \""); PRINT_ENTID(T); fprintf(F, "\""); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_ENT_ENT_EDGE(S,T,...) {fprintf (F, "edge: { sourcename: \""); PRINT_ENTID(S); fprintf (F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\""); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_ENT_TYPE_EDGE(S,T,...) {fprintf (F, "edge: { sourcename: \""); PRINT_ENTID(S); fprintf (F, "\" targetname: "); PRINT_TYPEID(T); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_NODE_TYPE_EDGE(S,T,...){fprintf (F, "edge: { sourcename: \""); PRINT_NODEID(S); fprintf (F, "\" targetname: "); PRINT_TYPEID(T); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_NODE_ENT_EDGE(S,T,...) {fprintf (F, "edge: { sourcename: \""); PRINT_NODEID(S); fprintf (F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\""); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
+#define PRINT_ENT_NODE_EDGE(S,T,...) {fprintf (F, "edge: { sourcename: \""); PRINT_ENTID(S); fprintf (F, "\" targetname: \""); PRINT_NODEID(T); fprintf(F, "\""); fprintf (F, ##__VA_ARGS__); fprintf(F,"}\n"); }
/* A suffix to manipulate the file name. */
int dump_loop_information_flag = 0;
int dump_const_local = 0;
-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
char buf[1024];
int res;
- assert(n && n->op);
-
/* Const */
- if (n->op->code == iro_Const) {
- res = tarval_snprintf(buf, sizeof(buf), n->attr.con);
+ if (get_irn_opcode(n) == iro_Const) { res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
fprintf(F, buf);
/* SymConst */
- } else if (n->op->code == iro_SymConst) {
+ } else if (get_irn_opcode(n) == iro_SymConst) {
if (get_SymConst_kind(n) == linkage_ptr_info) {
/* don't use get_SymConst_ptr_info as it mangles the name. */
- fprintf (F, "SymC %s", id_to_str(n->attr.i.tori.ptrinfo));
+ fprintf (F, "SymC %s", id_to_str(get_SymConst_ptrinfo(n)));
} else {
assert(get_kind(get_SymConst_type(n)) == k_type);
assert(get_type_ident(get_SymConst_type(n)));
}
/* Filter */
- } else if (n->op->code == iro_Filter && !interprocedural_view) {
+ } else if (get_irn_opcode(n) == iro_Filter && !interprocedural_view) {
fprintf(F, "Proj'");
/* all others */
static INLINE void
dump_node_mode (ir_node *n)
{
- switch (n->op->code) {
+ switch (get_irn_opcode(n)) {
case iro_Phi:
case iro_Const:
case iro_Id:
case iro_Shr:
case iro_Abs:
case iro_Cmp:
- fprintf (F, "%s", id_to_str(get_mode_ident(n->mode)));
+ fprintf (F, "%s", id_to_str(get_mode_ident(get_irn_mode(n))));
break;
default:
;
static INLINE void
dump_node_nodeattr (ir_node *n)
{
- switch (n->op->code) {
+ switch (get_irn_opcode(n)) {
case iro_Start:
if (false && interprocedural_view) {
fprintf (F, "%s", id_to_str(get_entity_ident(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 {
- fprintf (F, "%ld", n->attr.proj);
+ fprintf (F, "%ld", get_Proj_proj(n));
}
break;
case iro_Filter:
- fprintf (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);
static INLINE void
dump_node_vcgattr (ir_node *n)
{
- switch (n->op->code) {
+ switch (get_irn_opcode(n)) {
case iro_Start:
case iro_EndReg:
/* fall through */
}
}
+static INLINE void
+dump_node_info (ir_node *n) {
+ fprintf (F, " info1: \"visited: %ld\n\"", get_irn_visited(n));
+}
+
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 void dump_const_node_local(ir_node *n, pmap *irgmap) {
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++) {
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: \"");
+ fprintf (F, "node: {title: "); PRINT_CONSTID(n,con);
+ fprintf(F, " label: \"");
dump_node_opcode(con);
dump_node_mode (con);
fprintf (F, " ");
#endif
fprintf (F, "\" ");
dump_node_vcgattr(con);
+ dump_node_info(con);
fprintf (F, "}\n");
}
}
static void
dump_node (ir_node *n, pmap * map) {
- if (dump_const_local_set() && is_constlike_node(n)) return;
+ if (get_opt_dump_const_local() && is_constlike_node(n)) return;
/* dump this node */
fprintf (F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
#endif
fprintf (F, "\" ");
dump_node_vcgattr(n);
+ dump_node_info(n);
fprintf (F, "}\n");
dump_const_node_local(n, map);
}
-static void
-dump_ir_node (ir_node *n)
-{
- char buf[1024];
- int res;
-
- /* dump this node */
- fprintf (F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: ");
-
- switch (n->op->code) { /* node label */
- case iro_Start:
- fprintf (F, "\"%s\" color: blue ", id_to_str(get_irn_opident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_EndReg:
- /* fall through */
- case iro_EndExcept:
- /* fall through */
- case iro_End:
- fprintf (F, "\"%s\" color: blue ", id_to_str(get_irn_opident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Block:
- fprintf (F, "\"%s\" color: lightyellow ", id_to_str(get_irn_opident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Phi:
- fprintf (F, "\"%s%s\" color: green", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)));
- if (get_irn_modecode(n) == irm_M)
- fprintf (F, DEFAULT_NODE_ATTR " color: green");
- else
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Const:
- res = tarval_snprintf(buf, sizeof(buf), n->attr.con);
- assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
-
- fprintf (F, "\"%s%s\" color: yellow ", buf, id_to_str(get_irn_modeident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Proj:
- if (n->in[1]->op->code == iro_Cmp) {
- fprintf (F, "\"%s%s %s\" color: yellow", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)),
- get_pnc_string(n->attr.proj));
- } else {
- fprintf (F, "\"%s%s %ld\"", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)), n->attr.proj);
- }
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Filter:
- fprintf (F, "\"%s%s %ld\"", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)), n->attr.filter.proj);
- PRINT_DEFAULT_NODE_ATTR;
- break;
-#if 0
- case iro_Id:
- /* fall through */
- case iro_Conv:
- /* fall through */
- case iro_Tuple:
- /* fall through */
- case iro_Add:
- /* fall through */
- case iro_Sub:
- /* fall through */
- case iro_Mul:
- /* fall through */
- case iro_Quot:
- /* fall through */
- case iro_DivMod:
- /* fall through */
- case iro_Div:
- /* fall through */
- case iro_Mod:
- /* fall through */
- case iro_And:
- /* fall through */
- case iro_Or:
- /* fall through */
- case iro_Eor:
- /* fall through */
- case iro_Shl:
- /* fall through */
- case iro_Shr:
- /* fall through */
- case iro_Abs:
- /* fall through */
- case iro_Cmp:
- /* fall through */
- case iro_Raise:
- /* fall through */
- case iro_Unknown:
- /* fall through */
- case iro_Bad:
- /* fall through */
- case iro_Load:
- /* fall through */
- case iro_Store:
- fprintf (F, "\"%s%s\"", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
-#endif
- case iro_Jmp:
- /* fall through */
- case iro_Break:
- /* fall through */
- case iro_Cond:
- /* fall through */
- case iro_Call:
- /* fall through */
- case iro_CallBegin:
- /* fall through */
- case iro_Return:
- /* fall through */
- case iro_Alloc:
- fprintf (F, "\"%s\"", id_to_str(get_irn_opident(n)));
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Sel:
- assert(get_kind(get_Sel_entity(n)) == k_entity);
- fprintf (F, "\"%s ", id_to_str(get_irn_opident(n)));
- fprintf (F, "%s", id_to_str(get_entity_ident(get_Sel_entity(n))));
- PRINT_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;
- }
- PRINT_DEFAULT_NODE_ATTR;
- break;
- case iro_Sync:
- fprintf (F, "\"%s\" ", id_to_str(get_irn_opident(n)));
- fprintf (F, DEFAULT_NODE_ATTR " color: green");
- break;
- default:
- fprintf (F, "\"%s%s\" ", id_to_str(get_irn_opident(n)), id_to_str(get_irn_modeident(n)));
- }
- fprintf (F, "}\n"); /* footer */
-}
-
-
/* 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 (get_opt_dump_const_local() && is_constlike_node(n)) return;
if (is_no_Block(n)) {
fprintf (F, "edge: { sourcename: \"");
PRINT_NODEID(n);
if ((interprocedural_view && get_irn_visited(pred) < visited))
continue; /* pred not dumped */
if (is_backedge(n, i))
- fprintf (F, "backedge: {sourcename: \"");
+ 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");
static INLINE void
dump_loop_node_edge (ir_loop *loop, int i) {
assert(loop);
- fprintf (F, "edge: {sourcename: \"%p\" targetname: \"", loop);
+ fprintf (F, "edge: {sourcename: \"%p\" targetname: \"", (void*) loop);
PRINT_NODEID(get_loop_node(loop, i));
fprintf (F, "\" color: green");
fprintf (F, "}\n");
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));
+ (void*)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++) {
}
+/* @@@@ Does not work as someone kills the visited flag. */
static void dump_const_expression(ir_node *value) {
ir_graph *rem = current_ir_graph;
int rem_dump_const_local = dump_const_local;
}
static void print_type_node(type *tp) {
- fprintf (F, "node: {title: \"");
+ fprintf (F, "node: {title: ");
PRINT_TYPEID(tp);
- fprintf (F, "\" label: \"%s %s\"", id_to_str(get_type_tpop_nameid(tp)), id_to_str(get_type_ident(tp)));
- fprintf (F, "info1: \"");
+ fprintf (F, " label: \"%s %s\"", id_to_str(get_type_tpop_nameid(tp)), id_to_str(get_type_ident(tp)));
+ fprintf (F, " info1: \"");
print_type_info(tp);
fprintf (F, "\"");
print_typespecific_info(tp);
void dump_entity_node(entity *ent) {
fprintf (F, "node: {title: \"");
- PRINT_ENTID(ent);
- fprintf (F, "\"" DEFAULT_TYPE_ATTRIBUTE);
+ PRINT_ENTID(ent); fprintf(F, "\"");
+ fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
fprintf (F, "label: ");
fprintf (F, "\"ent %s\" " ENTITY_NODE_ATTR , id_to_str(get_entity_ident(ent)));
- fprintf (F, "\n info1:\"\nallocation: ");
+ fprintf (F, "\n info1: \"\nid: "); PRINT_ENTID(ent);
+ fprintf (F, "\nallocation: ");
switch (get_entity_allocation(ent)) {
case dynamic_allocated: fprintf (F, "dynamic allocated"); break;
case automatic_allocated: fprintf (F, "automatic 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;
+ case external_visible: fprintf (F, "external visible"); break;
+ case external_allocated: fprintf (F, "external allocated"); break;
}
fprintf (F, "\nvariability: ");
switch (get_entity_variability(ent)) {
case inherited: fprintf (F, "inherited"); break;
case existent: fprintf (F, "existent"); break;
}
- fprintf(F, "\nname: %s\nld_name: %s", id_to_str(get_entity_ident(ent)), id_to_str(get_entity_ld_ident(ent)));
+ fprintf(F, "\nname: %s\nld_name: %s",
+ id_to_str(get_entity_ident(ent)),
+ id_to_str(get_entity_ld_ident(ent)));
fprintf(F, "\noffset: %d", get_entity_offset(ent));
if (is_method_type(get_entity_type(ent))) {
if (get_entity_irg(ent)) /* can be null */
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");
- */
+ /* DDMN(value); $$$ */
dump_const_expression(value);
}
}
/* 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();
/* This is a block. So dump the vcg information to make a block. */
fprintf(F, "graph: { title: \"");
PRINT_NODEID(block);
- fprintf(F, "\" label: \"");
+ fprintf(F, "\" label: \"");
#ifdef DEBUG_libfirm
fprintf (F, "%ld", get_irn_node_nr(block));
#else
- fprintf (F, "%s", id_to_str(block->op->name));
+ fprintf (F, "%s", get_op_name(get_irn_op(block)));
#endif
if (exc_normal != get_Block_exc (block))
fprintf (F, " (%s)", exc_to_string (get_Block_exc (block)));
dump_ir_data_edges(block);
/* dump the nodes that go into the block */
- irg_walk(irg->end, dump_ir_blocks_nodes, NULL, block);
+ irg_walk(get_irg_end(irg), dump_ir_blocks_nodes, NULL, block);
/* Close the vcg information for the block */
fprintf(F, "}\n\n");
{
Bad_dumped = 0;
/* walk over the blocks in the graph */
- irg_block_walk(irg->end, dump_ir_block, NULL, irg);
+ irg_block_walk(get_irg_end(irg), dump_ir_block, NULL, irg);
/* dump all nodes that are not in a Block */
- irg_walk(irg->end, dump_blockless_nodes, NULL, NULL);
+ irg_walk(get_irg_end(irg), dump_blockless_nodes, NULL, NULL);
/* dump the Bad node */
if (!Bad_dumped)
if (get_irn_opcode(block) == iro_Block) {
/* This is a block. Dump a node for the block. */
- fprintf (F, "node: {title:\""); PRINT_NODEID(block);
- fprintf (F, "\" label: \"%s ", id_to_str(block->op->name)); PRINT_NODEID(block);
+ fprintf (F, "node: {title: \""); PRINT_NODEID(block);
+ fprintf (F, "\" label: \"%s ", get_op_name(get_irn_op(block)));
+#ifdef DEBUG_libfirm
+ fprintf (F, "%ld", get_irn_node_nr(block));
+#else
+ fprintf (F, "%p", (void*) block);
+#endif
- if (exc_normal != get_Block_exc (block))
- fprintf (F, " (%s)", exc_to_string (get_Block_exc (block)));
+ if (exc_normal != get_Block_exc (block))
+ fprintf (F, " (%s)", exc_to_string (get_Block_exc (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++)
PRINT_NODEID(block);
fprintf (F, "\" targetname: \"");
PRINT_NODEID(pred);
- fprintf (F, "\" }\n");
+ fprintf (F, "\"}\n");
}
/* Dump dominator edge */
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), NULL);
dump_dominator_information_flag = ddif;
vcg_close();
vcg_open (irg, "-all");
/* dump common ir graph */
- irg_walk(irg->end, dump_whole_node, NULL, NULL);
+ irg_walk(get_irg_end(irg), 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);
+ irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, NULL);
vcg_close();
current_ir_graph = rem;
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);
+ irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, NULL);
vcg_close();
current_ir_graph = rem;
dump_keepalive = b;
}
+bool get_opt_dump_keepalive_edges(void) {
+ return dump_keepalive;
+}
+
void dump_out_edges(void) {
dump_out_edge_flag = 1;
}
}
static void collect_blocks_floats_cg(ir_node * node, pmap * map) {
+ assert(node); assert(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);
+ if (entry)
+ {
+ ir_node ** arr;
+ arr = entry->value;
+ assert(arr);
+ ARR_APP1(ir_node *, arr , node);
} else {
ir_node ** arr = NEW_ARR_F(ir_node *, 1);
+ assert(arr);
arr[0] = node;
pmap_insert(map, current_ir_graph, arr);
}
fprintf(F, "graph: { title: \"");
PRINT_NODEID(block);
fprintf(F, "\" label: \"");
+ fprintf (F, "%s ", get_op_name(get_irn_op(block)));
#ifdef DEBUG_libfirm
fprintf (F, "%ld", get_irn_node_nr(block));
#else
- fprintf (F, "%s", id_to_str(block->op->name));
+ fprintf (F, "%p", (void*) block);
#endif
if (exc_normal != get_Block_exc(block)) {
fprintf (F, " (%s)", exc_to_string (get_Block_exc(block)));
static void d_cg_block_graph(ir_graph *irg, ir_node **arr, pmap *irgmap) {
int i;
- fprintf(F, "graph: { title: \"%p\" label: \"%s\" status:clustered color:white \n",
- irg, id_to_str(get_entity_ident(get_irg_ent(irg))));
+ fprintf(F, "graph: { title: %p label: %s status:clustered color:white \n",
+ (void*) irg, id_to_str(get_entity_ident(get_irg_ent(irg))));
for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
ir_node * node = arr[i];
int i;
ident * irg_ident = get_entity_ident(get_irg_ent(entry->key));
- fprintf(F, "graph: { title: \"%s\" label: \"%s\" status:clustered color:white \n",
+ fprintf(F, "graph: { title: %s label: %s status:clustered color:white \n",
id_to_str(irg_ident), id_to_str(irg_ident));
for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
projects / libfirm / blobdiff