#include "firm_common_t.h"
-#include "irnode_t.h"
-#include "irgraph_t.h"
+#include "irnode.h"
+#include "irgraph.h"
#include "irprog_t.h"
#include "entity_t.h"
-#include "irop_t.h"
+#include "irop.h"
#include "irdump_t.h"
#include "callgraph.h"
#include "irextbb_t.h"
#include "dbginfo_t.h"
+#include "irtools.h"
#include "irvrfy.h"
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!! */
+int opt_dump_analysed_type_info = 1;
+int opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */
-static const char *overrule_nodecolor = NULL;
+static dumper_colors overrule_nodecolor = ird_color_default;
/** An additional edge hook. */
static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func)
{
- dump_node_edge_hook = func;
+ dump_node_edge_hook = func;
}
DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void)
{
- return dump_node_edge_hook;
+ return dump_node_edge_hook;
}
-/** The vcg attribute hook. */
+/** The vcg node attribute hook. */
+static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
+/** The vcg node attribute hook. */
static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
+/** The vcg edge attribute hook. */
+static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
-/* set the hook */
+/* set the ir graph hook */
+void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
+ dump_ir_graph_hook = hook;
+}
+/* set the node attribute hook */
void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
dump_node_vcgattr_hook = hook;
}
+/* set the edge attribute hook */
+void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
+ dump_edge_vcgattr_hook = hook;
+}
-INLINE bool get_opt_dump_const_local(void) {
+INLINE int get_opt_dump_const_local(void) {
if (!dump_out_edge_flag && !dump_loop_information_flag)
return dump_const_local;
else
- return false;
+ return 0;
}
void only_dump_method_with_name(ident *name) {
return dump_file_filter_id;
}
-/** Returns true if dump file filter is not set, or if it is a
+/** Returns non-zero if dump file filter is not set, or if it is a
* prefix of name. */
int is_filtered_dump_name(ident *name) {
if (!dump_file_filter_id) return 1;
return id_is_prefix(dump_file_filter_id, name);
}
-/* To turn off display of edge labels. Edge labels offen cause xvcg to
+/* To turn off display of edge labels. Edge labels often cause xvcg to
abort with a segmentation fault. */
void turn_off_edge_labels(void) {
edge_label = 0;
}
-void dump_consts_local(bool b) {
- dump_const_local = b;
+void dump_consts_local(int flag) {
+ dump_const_local = flag;
}
-void dump_constant_entity_values(bool b) {
- const_entities = b;
+void dump_constant_entity_values(int flag) {
+ const_entities = flag;
}
-void dump_keepalive_edges(bool b) {
- dump_keepalive = b;
+void dump_keepalive_edges(int flag) {
+ dump_keepalive = flag;
}
-bool get_opt_dump_keepalive_edges(void) {
+int get_opt_dump_keepalive_edges(void) {
return dump_keepalive;
}
-void dump_out_edges(bool b) {
- dump_out_edge_flag = b;
+void dump_out_edges(int flag) {
+ dump_out_edge_flag = flag;
}
-void dump_dominator_information(bool b) {
- dump_dominator_information_flag = b;
+void dump_dominator_information(int flag) {
+ dump_dominator_information_flag = flag;
}
-void dump_loop_information(bool b) {
- dump_loop_information_flag = b;
+void dump_loop_information(int flag) {
+ dump_loop_information_flag = flag;
}
-void dump_backedge_information(bool b) {
- dump_backedge_information_flag = b;
+void dump_backedge_information(int flag) {
+ dump_backedge_information_flag = flag;
}
/* 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 set_opt_dump_analysed_type_info(bool b) {
- opt_dump_analysed_type_info = b;
+void set_opt_dump_analysed_type_info(int flag) {
+ opt_dump_analysed_type_info = flag;
}
-void dump_pointer_values_to_info(bool b) {
- opt_dump_pointer_values_to_info = b;
+void dump_pointer_values_to_info(int flag) {
+ opt_dump_pointer_values_to_info = flag;
}
-void dump_ld_names(bool b) {
- dump_ld_name = b;
+void dump_ld_names(int flag) {
+ dump_ld_name = flag;
}
/* -------------- some extended helper functions ----------------- */
return ERROR_TXT;
}
+/**
+ * printf the VCG color
+ */
+static void print_vcg_color(FILE *F, dumper_colors color) {
+ static const char *color_names[32] = {
+ "white", "blue", "red", "green",
+ "yellow", "magenta", "cyan", "darkgray",
+ "darkblue", "darkred", "darkgreen", "darkyellow",
+ "darkmagenta", "darkcyan", "gold", "lightgray",
+ "lightblue", "lightred", "lightgreen", "lightyellow",
+ "lightmagenta", "lightcyan", "lilac", "turquoise",
+ "aquamarine", "khaki", "purple", "yellowgreen",
+ "pink", "orange", "orchid", "black"
+ };
+
+ if (color != ird_color_default)
+ fprintf(F, "color:%s", color_names[color]);
+}
+
/**
* prints the edge from a type S to a type T with additional info fmt, ...
* to the file F
* Sets the private link field.
*/
static void ird_set_irn_link(ir_node *n, void *x) {
- if (!irdump_link_map) init_irdump();
+ if (!irdump_link_map)
+ init_irdump();
pmap_insert(irdump_link_map, (void *)n, x);
}
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. */
- set_interprocedural_view(false);
+ set_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);
/*
* dump the name of a node n to the File F.
*/
-int
-dump_node_opcode(FILE *F, ir_node *n)
+int dump_node_opcode(FILE *F, ir_node *n)
{
int bad = 0;
+ const ir_op_ops *ops = get_op_ops(get_irn_op(n));
- switch(get_irn_opcode(n)) {
+ /* call the dump_node operation if available */
+ if (ops->dump_node)
+ return ops->dump_node(n, F, dump_node_opcode_txt);
+
+ /* implementation for default nodes */
+ switch (get_irn_opcode(n)) {
case iro_Const: {
int res;
case iro_Load:
fprintf (F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
break;
+ case iro_Block:
+ fprintf (F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
+ break;
- default: {
+ default:
default_case:
fprintf (F, "%s", get_irn_opname(n));
- }
} /* end switch */
return bad;
* Dump the mode of a node n to a file F.
* Ignore modes that are "always known".
*/
-static INLINE int
-dump_node_mode(FILE *F, ir_node *n)
+static int dump_node_mode(FILE *F, ir_node *n)
{
int bad = 0;
- opcode iro = get_irn_opcode(n);
+ const ir_op_ops *ops = get_op_ops(get_irn_op(n));
+ opcode iro;
+
+ /* call the dump_node operation if available */
+ if (ops->dump_node)
+ return ops->dump_node(n, F, dump_node_mode_txt);
+ /* default implementation */
+ iro = get_irn_opcode(n);
switch (iro) {
case iro_SymConst:
case iro_Sel:
/**
* Dump additional node attributes of some nodes to a file F.
*/
-static INLINE int
+static int
dump_node_nodeattr(FILE *F, ir_node *n)
{
int bad = 0;
ir_node *pred;
opcode code;
long proj_nr;
+ const ir_op_ops *ops = get_op_ops(get_irn_op(n));
+
+ /* call the dump_node operation if available */
+ if (ops->dump_node)
+ return ops->dump_node(n, F, dump_node_nodeattr_txt);
switch (get_irn_opcode(n)) {
case iro_Start:
- if (false && get_interprocedural_view()) {
+ if (0 && get_interprocedural_view()) {
fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
}
break;
}
if (! f)
fprintf (F, "%ld ", proj_nr);
+ if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
+ if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
+ fprintf(F, "PRED ");
+ if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
+ fprintf(F, "PRED ");
+ }
}
break;
case iro_Filter:
case iro_Confirm:
fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
break;
+ case iro_CopyB:
+ fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
+ break;
default:
;
ir_node *n;
if (bad) {
- fprintf(F, "color: red");
+ print_vcg_color(F, ird_color_red);
return;
}
n = local ? local : node;
+ if (overrule_nodecolor != ird_color_default) {
+ print_vcg_color(F, overrule_nodecolor);
+ return;
+ }
+
switch (get_irn_opcode(n)) {
case iro_Start:
case iro_EndReg:
case iro_EndExcept:
/* fall through */
case iro_End:
- fprintf (F, "color: blue");
+ print_vcg_color(F, ird_color_blue);
break;
case iro_Block:
if (is_Block_dead(n))
- fprintf (F, "color: lightred");
+ print_vcg_color(F, ird_color_lightred);
else
- fprintf (F, "color: lightyellow");
+ print_vcg_color(F, ird_color_lightyellow);
break;
case iro_Phi:
- fprintf (F, "color: green");
+ print_vcg_color(F, ird_color_green);
break;
case iro_Const:
case iro_Proj:
case iro_Filter:
case iro_Tuple:
- fprintf (F, "color: yellow");
+ print_vcg_color(F, ird_color_yellow);
break;
default:
PRINT_DEFAULT_NODE_ATTR;
}
-
- if (overrule_nodecolor) fprintf(F, " color: %s", overrule_nodecolor);
}
* Dump the node information of a node n to a file F.
*/
static INLINE int dump_node_info(FILE *F, ir_node *n)
-{ int bad = 0;
+{
+ int bad = 0;
+ const ir_op_ops *ops = get_op_ops(get_irn_op(n));
+
fprintf (F, " info1: \"");
bad = dump_irnode_to_file(F, n);
+ /* call the dump_node operation if available */
+ if (ops->dump_node)
+ bad = ops->dump_node(n, F, dump_node_info_txt);
fprintf(F, "\"\n");
+
return bad;
}
* checks whether a node is "constant-like" ie can be treated "block-less"
*/
static INLINE
-bool is_constlike_node(ir_node *n) {
+int is_constlike_node(ir_node *n) {
ir_op *op = get_irn_op(n);
return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
}
fprintf (F, "edge: { sourcename: \"");
PRINT_NODEID(n);
fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
+
+ if (dump_edge_vcgattr_hook) {
+ fprintf (F, "\" ");
+ if (dump_edge_vcgattr_hook(F, n, -1)) {
+ fprintf (F, "}\n");
+ return;
+ }
+ else {
+ fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
+ return;
+ }
+ }
+
fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
}
}
/**
* prints debug messages of a node to file F as info3.
*/
-static void print_node_dbg_info(FILE *F, dbg_info *dbg)
+static void print_dbg_info(FILE *F, dbg_info *dbg)
{
char buf[1024];
fprintf(F, "\" ");
bad |= dump_node_info(F, n);
print_node_error(F, p);
- print_node_dbg_info(F, get_irn_dbg_info(n));
+ print_dbg_info(F, get_irn_dbg_info(n));
dump_node_vcgattr(F, n, NULL, bad);
fprintf(F, "}\n");
dump_const_node_local(F, n);
PRINT_NODEID(n);
fprintf (F, "\" targetname: ");
fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
+
+ if (dump_edge_vcgattr_hook) {
+ fprintf (F, " ");
+ if (dump_edge_vcgattr_hook(F, n, -1)) {
+ fprintf (F, "}\n");
+ return;
+ }
+ else {
+ fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
+ return;
+ }
+ }
+
fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
}
}
static void
print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
- /*
- * do not use get_nodes_block() here, will fail
- * if the irg is not pinned.
- */
+ /*
+ * do not use get_nodes_block() here, will fail
+ * if the irg is not pinned.
+ */
if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
fprintf (F, INTRA_DATA_EDGE_ATTR);
else
static void
print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
- /*
- * do not use get_nodes_block() here, will fail
- * if the irg is not pinned.
- */
+ /*
+ * do not use get_nodes_block() here, will fail
+ * if the irg is not pinned.
+ */
if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
fprintf (F, INTRA_MEM_EDGE_ATTR);
else
print_edge_vcgattr(FILE *F, ir_node *from, int to) {
assert(from);
+ if (dump_edge_vcgattr_hook)
+ if (dump_edge_vcgattr_hook(F, from, to))
+ return;
+
if (dump_backedge_information_flag && is_backedge(from, to))
fprintf (F, BACK_EDGE_ATTR);
static void
dump_whole_block(FILE *F, ir_node *block) {
ir_node *node;
+ dumper_colors color = ird_color_yellow;
+
assert(is_Block(block));
fprintf(F, "graph: { title: \"");
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");
+
+ /* colorize blocks */
+ if (! get_Block_matured(block))
+ color = ird_color_red;
+ if (is_Block_dead(block))
+ color = ird_color_orange;
+
+ fprintf(F, "\" status:clustered ");
+ print_vcg_color(F, color);
+ fprintf(F, "\n");
+
+ /* yComp can show attributes for blocks, XVCG parses but ignores them */
+ dump_node_info(F, block);
+ print_dbg_info(F, get_irn_dbg_info(block));
/* dump the blocks edges */
dump_ir_data_edges(F, block);
current_ir_graph = rem;
}
+/**
+ * Dump the info for an irg.
+ * Parsed by XVCG but not shown. use yComp.
+ */
+static void dump_graph_info(FILE *F, ir_graph *irg) {
+ fprintf(F, "info1: \"");
+ dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
+ fprintf(F, "\"\n");
+}
+
/** Dumps an irg as a graph clustered by block nodes.
* If interprocedural view edges can point to nodes out of this graph.
*/
static void dump_graph_from_list(FILE *F, ir_graph *irg) {
+ entity *ent = get_irg_entity(irg);
fprintf(F, "graph: { title: \"");
PRINT_IRGID(irg);
fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
- get_ent_dump_name(get_irg_entity(irg)));
+ get_ent_dump_name(ent));
+
+ dump_graph_info(F, irg);
+ print_dbg_info(F, get_entity_dbg_info(ent));
dump_block_graph(F, irg);
compute_extbb(irg);
for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
ir_extblk *extbb = arr[i];
- ir_node *leader = extbb->blks[0];
+ ir_node *leader = get_extbb_leader(extbb);
int j;
fprintf(F, "graph: { title: \"");
dump_type_to_file(F, tp, dump_verbosity_max);
#endif
fprintf (F, "\"\n");
- print_node_dbg_info(F, get_type_dbg_info(tp));
+ print_dbg_info(F, get_type_dbg_info(tp));
print_typespecific_vcgattr(F, tp);
fprintf (F, "}\n");
fprintf (F, "label: ");
fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
if (color)
- fprintf(F, "color: %d", color);
+ fprintf(F, "color:%d", color);
else
fprintf (F, ENTITY_NODE_ATTR);
fprintf (F, "\n info1: \"");
dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
fprintf(F, "\"\n");
- print_node_dbg_info(F, get_entity_dbg_info(ent));
+ print_dbg_info(F, get_entity_dbg_info(ent));
fprintf(F, "}\n");
}
#undef X
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));
+ fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
#endif
fprintf (F, "\"");
}
f = vcg_open(irg, suffix, suffix1);
dump_vcg_header(f, get_irg_dump_name(irg), NULL);
+ /* call the dump graph hook */
+ if (dump_ir_graph_hook)
+ if (dump_ir_graph_hook(f, irg))
+ return;
+
/* walk over the graph */
/* dump_whole_node must be called in post visiting predecessors */
irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
FILE *F;
int i;
char *suffix1;
+ entity *ent;
if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
return;
if (get_interprocedural_view()) suffix1 = "-ip";
else suffix1 = "";
+
+ ent = get_irg_entity(irg);
+
F = vcg_open(irg, suffix, suffix1);
dump_vcg_header(F, get_irg_dump_name(irg), NULL);
fprintf(F, "graph: { title: \"");
PRINT_IRGID(irg);
- fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
- get_ent_dump_name(get_irg_entity(irg)));
+ fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
+ get_ent_dump_name(ent));
+
+ dump_graph_info(F, irg);
+ print_dbg_info(F, get_entity_dbg_info(ent));
for (i = 0; i < get_irp_n_irgs(); i++) {
ir_graph *irg = get_irp_irg(i);
FILE *f;
ir_graph *rem = current_ir_graph;
char *suffix1;
+ int rem_dump_const_local;
/* if a filter is set, dump only the irg's that match the filter */
if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
return;
current_ir_graph = irg;
+ rem_dump_const_local = dump_const_local;
+ /* dumping types does not work with local nodes */
+ dump_const_local = 0;
if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
else suffix1 = "-pure-wtypes";
irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
vcg_close(f);
+ dump_const_local = rem_dump_const_local;
current_ir_graph = rem;
}
int i;
char *suffix1;
ir_graph *rem = current_ir_graph;
+ int rem_dump_const_local;
/* if a filter is set, dump only the irg's that match the filter */
if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
return;
+ rem_dump_const_local = dump_const_local;
+ /* dumping types does not work with local nodes */
+ dump_const_local = 0;
+
if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
else suffix1 = "-wtypes";
f = vcg_open(irg, suffix, suffix1);
/* dump edges from graph to type info */
irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
- current_ir_graph = rem;
vcg_close(f);
+ dump_const_local = rem_dump_const_local;
+ current_ir_graph = rem;
}
/*---------------------------------------------------------------------*/
if (ipv) {
printf("Warning: dumping cfg not in interprocedural view!\n");
- set_interprocedural_view(false);
+ set_interprocedural_view(0);
}
if (get_irg_dom_state(irg) != dom_consistent)
int be = is_irg_callee_backedge(irg, j);
char *attr;
attr = (be) ?
- "label:\"recursion %d\" color: %d" :
- "label:\"calls %d\" color: %d";
+ "label:\"recursion %d\" color:%d" :
+ "label:\"calls %d\" color:%d";
print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
}
}
FILE *f;
int i;
int rem_view = get_interprocedural_view();
- set_interprocedural_view(true);
+ set_interprocedural_view(1);
f = vcg_open_name("All_graphs", suffix);
dump_vcg_header(f, "All_graphs", NULL);
}
void
-dump_class_hierarchy (bool entities, const char *suffix)
+dump_class_hierarchy (int entities, const char *suffix)
{
FILE *f = vcg_open_name("class_hierarchy", suffix);
h_env_t env;
- env.f = f;
+ env.f = f;
+ env.dump_ent = entities;
dump_vcg_header(f, "class_hierarchy", NULL);
- if (entities)
- env.dump_ent = 1;
- else
- env.dump_ent = 0;
type_walk(dump_class_hierarchy_node, NULL, &env);
vcg_close(f);
}
/*---------------------------------------------------------------------*/
void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
- int i, n_irgs = get_irp_n_irgs();
- for (i = 0; i < n_irgs; ++i) {
+ int i;
+ for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
dmp_grph(get_irp_irg(i), suffix);
}
}
/* 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";
+ if (eset_contains(extnodes, n))
+ overrule_nodecolor = ird_color_lightblue;
dump_node(F, n);
- overrule_nodecolor = NULL;
+ overrule_nodecolor = ird_color_default;
if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, 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";
+ if (!eset_contains(loopnodes, n))
+ overrule_nodecolor = ird_color_lightblue;
dump_node(F, n);
- overrule_nodecolor = NULL;
+ overrule_nodecolor = ird_color_default;
if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
}
projects / libfirm / blobdiff