# include <string.h>
# include <stdlib.h>
+# include <stdarg.h>
# include "irnode_t.h"
# include "irgraph_t.h"
# include "panic.h"
# include "array.h"
# include "pmap.h"
-
-# include "exc.h"
-
+# include "eset.h"
+
+#undef HEAPANAL
+#ifdef HEAPANAL
+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 PRINT_DEFAULT_NODE_ATTR
#define DEFAULT_TYPE_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 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 BACK_EDGE_ATTR "linestyle: dashed "
#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))
#else
#define PRINT_NODEID(X) fprintf(F, "n%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)
#endif
-#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"); }
+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);
+}
/*******************************************************************/
/* global and ahead declarations */
/*******************************************************************/
/* A suffix to manipulate the file name. */
-char *dump_file_suffix = NULL;
+char *dump_file_suffix = "";
/* file to dump to */
static FILE *F;
static void dump_whole_node(ir_node *n, void* env);
-static INLINE void dump_loop_info(ir_graph *irg);
+static INLINE void dump_loop_nodes_into_graph(ir_graph *irg);
/*******************************************************************/
-/* Helper funcions. */
+/* 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) {
- set_irn_link(node, NULL);
+ 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 ident *get_irg_dump_name (ir_graph *irg) {
+static const char *get_ent_dump_name (entity *ent) {
+ /* 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);
- if (ent->ld_name) return ent->ld_name;
- return ent->name;
+ return get_ent_dump_name(ent);
}
static void collect_node(ir_node * node, void *env) {
|| node_floats(node)
|| get_irn_op(node) == op_Bad
|| get_irn_op(node) == op_Unknown) {
- ir_node ** arr = (ir_node **) get_irg_link(get_irn_irg(node));
+ 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);
- set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
+ 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);
- set_irn_link(node, get_irn_link(block));
- set_irn_link(block, node);
+ ird_set_irn_link(node, ird_get_irn_link(block));
+ ird_set_irn_link(block, node);
}
}
current_ir_graph = irg;
for (i = 0; i < get_irp_n_irgs(); i++)
- set_irg_link(get_irp_irg(i), NULL);
+ ird_set_irg_link(get_irp_irg(i), NULL);
irg_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
current_ir_graph = rem;
- return get_irg_link(irg);
+ return ird_get_irg_link(irg);
}
/*******************************************************************/
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;
INLINE bool get_opt_dump_const_local(void) {
if (!dump_out_edge_flag && !dump_loop_information_flag)
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. */
static INLINE void
dump_node_opcode (ir_node *n)
{
- int res;
switch(get_irn_opcode(n)) {
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");
case iro_Start: {
if (interprocedural_view) {
- fprintf(F, "%s %s", get_irn_opname(n), get_entity_name(get_irg_ent(get_irn_irg(n))));
+ fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_ent(get_irn_irg(n))));
break;
}
} /* fall through */
switch (get_irn_opcode(n)) {
case iro_Start:
if (false && interprocedural_view) {
- fprintf (F, "%s", get_entity_name(get_irg_ent(current_ir_graph)));
+ fprintf (F, "%s", get_ent_dump_name(get_irg_ent(current_ir_graph)));
}
break;
case iro_Proj:
fprintf (F, "%ld", get_Filter_proj(n));
break;
case iro_Sel: {
- fprintf (F, "%s", get_entity_name(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(get_Cast_type(n)));
default:
PRINT_DEFAULT_NODE_ATTR;
}
+
+ if (overrule_nodecolor) fprintf(F, " color: %s", overrule_nodecolor);
}
static INLINE void
dump_node_info (ir_node *n) {
int i;
+ char comma;
+ ir_graph *irg;
fprintf (F, " info1: \"");
+ if (opt_dump_pointer_values_to_info)
+ fprintf (F, "addr: %p \n", (void *)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");
+
/* Source types */
- switch(get_irn_opcode(n)) {
+ switch (get_irn_opcode(n)) {
case iro_Start: {
- type *tp = get_entity_type(get_irg_ent(get_Start_irg(n)));
+ type *tp = get_entity_type(get_irg_ent(get_irn_irg(n)));
fprintf(F, "start of method of type %s \n", get_type_name(tp));
for (i = 0; i < get_method_n_params(tp); ++i)
fprintf(F, " param %d type: %s \n", i, get_type_name(get_method_param_type(tp, i)));
fprintf(F, " param %d type: %s \n", i, get_type_name(get_method_param_type(tp, i)));
for (i = 0; i < get_method_n_ress(tp); ++i)
fprintf(F, " resul %d type: %s \n", i, get_type_name(get_method_res_type(tp, i)));
+ 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(current_ir_graph));
+ type *tp = get_entity_type(get_irg_ent(get_irn_irg(n)));
fprintf(F, "return in method of type %s \n", get_type_name(tp));
for (i = 0; i < get_method_n_ress(tp); ++i)
fprintf(F, " res %d type: %s \n", i, get_type_name(get_method_res_type(tp, i)));
assert(tp != none_type);
fprintf(F, "Const of type %s \n", get_type_name(get_Const_type(n)));
} 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: ;
}
- if (get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_consistent ||
- get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_inconsistent )
+
+ 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(get_irn_type(n)));
fprintf (F, "\"");
-
-}
-
-/* Returns true if n and pred pos are in different graphs. */
-static bool pred_in_wrong_graph(ir_node *n, int pos) {
- ir_node *pred = get_irn_n(n, pos);
-
- if (get_irn_irg(n) != get_irn_irg(pred)) return true;
- return false;
}
/* outputs the predecessors of n, that are constants, local. I.e.,
- generates a copy of the constant for each node called with. */
+ generates a copy of the constant predecessors for each node called with. */
static void dump_const_node_local(ir_node *n) {
int i;
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)) 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)) continue; /* pred not dumped */
mark_irn_visited(con);
/* Generate a new name for the node by appending the names of
n and const. */
- fprintf (F, "node: {title: "); PRINT_CONSTID(n,con);
+ fprintf (F, "node: {title: "); PRINT_CONSTID(n, con);
fprintf(F, " label: \"");
dump_node_opcode(con);
dump_node_mode (con);
dump_node_typeinfo(con);
fprintf (F, " ");
dump_node_nodeattr(con);
-#ifdef DEBUG_libfirm
fprintf (F, " %ld", get_irn_node_nr(con));
-#endif
fprintf (F, "\" ");
dump_node_vcgattr(con);
dump_node_info(con);
static void
dump_node (ir_node *n) {
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_typeinfo(n);
fprintf (F, " ");
dump_node_nodeattr(n);
-#ifdef DEBUG_libfirm
fprintf (F, " %ld", get_irn_node_nr(n));
-#endif
fprintf (F, "\" ");
dump_node_vcgattr(n);
dump_node_info(n);
fprintf (F, "}\n");
dump_const_node_local(n);
+#ifdef HEAPANAL
+ dump_chi_term(F, n);
+ dump_state(F, n);
+#endif
}
/* dump the edge to the block this node belongs to */
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 (dump_backedge_information_flag && is_backedge(n, i))
fprintf (F, "backedge: {sourcename: \"");
else
fprintf (F, "edge: {sourcename: \"");
PRINT_NODEID(n);
fprintf (F, "\" targetname: ");
- if ((get_opt_dump_const_local()) && is_constlike_node(pred) &&
- !pred_in_wrong_graph(n, i)) {
+ 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: \"");
dump_node_opcode(block);
fprintf (F, " %ld", get_irn_node_nr(block));
-
+#ifdef HEAPANAL
+ 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_ir_data_edges(block);
/* dump the nodes that go into the block */
- for (node = get_irn_link(block); node; node = get_irn_link(node)) {
+ 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);
+#ifdef HEAPANAL
+ dump_chi_term(F, block);
+#endif
fprintf(F, "\n");
}
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;
- ir_node **arr = get_irg_link(irg);
for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
ir_node * node = arr[i];
}
}
- if (dump_loop_information_flag) dump_loop_info(irg);
+ if (dump_loop_information_flag) dump_loop_nodes_into_graph(irg);
current_ir_graph = rem;
}
fprintf(F, "graph: { title: \"");
PRINT_IRGID(irg);
fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
- get_entity_name(get_irg_ent(irg)));
+ get_ent_dump_name(get_irg_ent(irg)));
dump_block_graph (irg);
if ( (get_SymConst_kind(n) == type_tag)
|| (get_SymConst_kind(n) == size))
{
- PRINT_NODE_TYPE_EDGE(n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
+ 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(n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
+ print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
} break;
default:
break;
fprintf(F, "size: %dB,\n", get_type_size(tp));
}
-
static void print_typespecific_info(type *tp) {
+ switch (get_type_tpop_code(tp)) {
+ case tpo_class:
+ {
+ fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
+ } break;
+ case tpo_struct:
+ {
+ } 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 void print_typespecific_vcgattr(type *tp) {
switch (get_type_tpop_code(tp)) {
case tpo_class:
{
fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name(tp));
fprintf (F, " info1: \"");
print_type_info(tp);
- fprintf (F, "\"");
print_typespecific_info(tp);
+ fprintf (F, "\"");
+ print_typespecific_vcgattr(tp);
fprintf (F, "}\n");
}
PRINT_ENTID(ent); fprintf(F, "\"");
fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
fprintf (F, "label: ");
- fprintf (F, "\"ent %s\" " ENTITY_NODE_ATTR , get_entity_name(ent));
+ fprintf (F, "\"ent %s\" " ENTITY_NODE_ATTR , get_ent_dump_name(ent));
fprintf (F, "\n info1: \"\nid: "); PRINT_ENTID(ent);
fprintf (F, "\nallocation: ");
X(volatility_is_volatile);
}
- fprintf (F, "\npeculiarity: ");
- switch (get_entity_peculiarity(ent)) {
- X(peculiarity_description);
- X(peculiarity_inherited);
- X(peculiarity_existent);
- }
+ 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");
+ get_ent_dump_name(ent), ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
fprintf(F, "\noffset: %d", get_entity_offset(ent));
if (is_method_type(get_entity_type(ent))) {
if (get_entity_irg(ent)) /* can be null */
/* 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);
+ print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), ENT_OVERWRITES_EDGE_ATTR);
}
}
/* attached subgraphs */
if (is_atomic_entity(ent)) {
value = get_atomic_ent_value(ent);
if (value) {
- PRINT_ENT_NODE_EDGE(ent, value, ENT_VALUE_EDGE_ATTR, i);
+ print_ent_node_edge(F,ent, value, ENT_VALUE_EDGE_ATTR, i);
/* DDMN(value); $$$ */
dump_const_expression(value);
}
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);
+ print_ent_node_edge(F,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);
+ 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),
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);
+ 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(tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
+ 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);
+ 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);
+ 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(tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,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);
+ 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);
+ 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(upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
- PRINT_NODE_TYPE_EDGE(lower, tp, "label: \"lower %d\"", get_array_order(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_pointer:
{
- PRINT_TYPE_TYPE_EDGE(tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
+ print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
} break;
case tpo_primitive:
{
/* 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 */
/* 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_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
}
} break;
default: break;
}
}
+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: \"%p\" targetname: \"", (void*) 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: \"%p\" targetname: \"%p\" color: darkgreen}\n",
- (void *)loop, (void *)get_loop_son(loop, i));
+ 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 */
- fprintf (F, "node: {title: \"%p\" label: \"loop %d, %d sons, %d nodes\" }\n",
- (void*)loop, get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
+ 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++) {
}
static INLINE
-void dump_loop_info(ir_graph *irg) {
+void dump_loop_nodes_into_graph(ir_graph *irg) {
ir_graph *rem = current_ir_graph;
current_ir_graph = irg;
/************************************************************************/
static INLINE void
-dump_vcg_header(const char *name) {
+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"
"layoutalgorithm: mindepth\n"
"manhattan_edges: yes\n"
"port_sharing: no\n"
- "orientation: bottom_to_top\n"
+ "orientation: %s\n"
"classname 1: \"Data\"\n"
"classname 2: \"Block\"\n"
"classname 3: \"Entity type\"\n"
"classname 10: \"Array Element Type\"\n"
"classname 11: \"Overwrites\"\n"
"classname 12: \"Member\"\n",
- name, label);
+ name, label, orientation);
fprintf (F, "\n"); /* a separator */
}
-static void vcg_open (ir_graph *irg, char *suffix) {
+static void vcg_open (ir_graph *irg, char * suffix1, char *suffix2) {
+ const char *nm = get_irg_dump_name(irg);
+ int len = strlen(nm);
char *fname; /* filename to put the vcg information in */
- const char *cp;
- ident *id;
- int len;
+
+ if (!suffix1) suffix1 = "";
+ if (!suffix2) suffix2 = "";
/** open file for vcg graph */
- id = get_irg_dump_name(irg);
- /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
- len = get_id_strlen (id);
- cp = get_id_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 = malloc (len + strlen(suffix1) + strlen(suffix2) + 5);
+ strncpy (fname, nm, 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 */
+ 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 */
}
- dump_vcg_header(cp);
+ free(fname);
}
-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;
+
+ 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);
+ fname = malloc (strlen(name) + 5 + strlen(suffix));
strcpy (fname, name); /* copy the filename */
- if (dump_file_suffix) strcat (fname, dump_file_suffix);
+ 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);
+}
- dump_vcg_header(name);
+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 */
}
if (interprocedural_view) suffix = "-pure-ip";
else suffix = "-pure";
- vcg_open (irg, suffix);
+ 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 */
int i;
char *suffix;
- construct_block_lists(irg);
-
if (interprocedural_view) suffix = "-ip";
else suffix = "";
- vcg_open (irg, suffix);
+ vcg_open (irg, dump_file_suffix, suffix);
+ dump_vcg_header(get_irg_dump_name(irg), NULL);
+
+ construct_block_lists(irg);
for (i = 0; i < get_irp_n_irgs(); i++) {
- ir_node **arr = get_irg_link(get_irp_irg(i));
+ ir_node **arr = ird_get_irg_link(get_irp_irg(i));
if (arr) {
dump_graph(get_irp_irg(i));
DEL_ARR_F(arr);
void
dump_ir_graph_w_types (ir_graph *irg)
{
- ir_graph *rem;
- rem = current_ir_graph;
+ ir_graph *rem = current_ir_graph;
char *suffix;
current_ir_graph = irg;
if (interprocedural_view) suffix = "-pure-wtypes-ip";
else suffix = "-pure-wtypes";
- vcg_open (irg, suffix);
+ vcg_open (irg, dump_file_suffix, suffix);
+ dump_vcg_header(get_irg_dump_name(irg), NULL);
/* dump common ir graph */
irg_walk(get_irg_end(irg), NULL, dump_whole_node, NULL);
if (interprocedural_view) suffix = "-wtypes-ip";
else suffix = "-wtypes";
- vcg_open (irg, suffix);
+ vcg_open (irg, dump_file_suffix, suffix);
+ dump_vcg_header(get_irg_dump_name(irg), NULL);
/* dump common blocked ir graph */
construct_block_lists(irg);
for (i = 0; i < get_irp_n_irgs(); i++) {
- ir_node **arr = get_irg_link(get_irp_irg(i));
+ ir_node **arr = ird_get_irg_link(get_irp_irg(i));
if (arr) {
dump_graph(get_irp_irg(i));
DEL_ARR_F(arr);
{
ir_graph *rem = current_ir_graph;
int ddif = dump_dominator_information_flag;
+ int ipv = interprocedural_view;
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;
dump_node (get_irg_bad(irg));
dump_dominator_information_flag = ddif;
+ interprocedural_view = ipv;
vcg_close();
current_ir_graph = rem;
}
int i;
int rem_view = interprocedural_view;
interprocedural_view = 1;
- vcg_open_name ("All_graphs");
+
+ 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++)
- set_irg_link(get_irp_irg(i), NULL);
+ 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(get_irg_link(current_ir_graph));
+ DEL_ARR_F(ird_get_irg_link(current_ir_graph));
}
vcg_close();
rem = current_ir_graph;
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);
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();
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
dmp_grph(get_irp_irg(i));
}
}
+
+
+/**********************************************************************************
+ * Dumps a stand alone loop graph with firm nodes which belong to one loop nodes *
+ * packed together in one subgraph *
+ **********************************************************************************/
+
+
+
+void dump_loops_standalone (ir_loop *loop) {
+ int i, loop_node_started = 0, son_number = 0, first;
+ loop_element le;
+
+ /* Dump a new loop node. */
+ dump_loop_node(loop);
+
+ /* Dump the loop elements. */
+ for(i = 0; i < get_loop_n_elements(loop); i++)
+ {
+ le = get_loop_element(loop, i);
+
+ ir_loop *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;
+
+ 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");
+
+ dump_node_opcode(n);
+ dump_node_mode (n);
+ dump_node_typeinfo(n);
+ fprintf (F, " ");
+ dump_node_nodeattr(n);
+ fprintf (F, " %ld", get_irn_node_nr(n));
+
+ }
+ }
+
+ 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;
+ }
+}
+
+void dump_loop_tree(ir_graph *irg, char *suffix)
+{
+ ir_graph *rem = current_ir_graph;
+ int el_rem = edge_label;
+ edge_label = 1;
+
+ current_ir_graph = irg;
+
+ vcg_open(irg, suffix, "-looptree");
+ dump_vcg_header(get_irg_dump_name(irg), "top_to_bottom");
+
+ if (get_irg_loop(irg)) dump_loops_standalone(get_irg_loop(irg));
+
+ vcg_close();
+
+ edge_label = el_rem;
+ current_ir_graph = rem;
+}
+
+
+/*******************************************************************************/
+/* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
+/*******************************************************************************/
+
+void collect_nodeloop(ir_loop *loop, eset *loopnodes) {
+ int i, son_number = 0, node_number = 0;
+
+ if (dump_loop_information_flag) dump_loop_node(loop);
+
+ 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);
+ }
+ }
+}
+
+void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
+ int i, j, start;
+
+ 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);
+ }
+ }
+ }
+ }
+ }
+}
+
+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);
+ }
+
+ 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(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 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(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);
+ }
+
+ /* 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();
+}
projects / libfirm / blobdiff