/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "list.h"
-#include "irnode.h"
-#include "irgraph.h"
+#include "irnode_t.h"
+#include "irgraph_t.h"
#include "irprog_t.h"
#include "entity_t.h"
#include "irop.h"
#include "irhooks.h"
#include "dbginfo_t.h"
#include "irtools.h"
+#include "irprintf.h"
#include "irvrfy.h"
static int dump_anchors = 0;
/** An option to dump the macro block edges. */
static int dump_macro_block_edges = 0;
+/** An option to dump block marker in the block title */
+static int dump_block_marker = 0;
int dump_dominator_information_flag = 0;
int opt_dump_analysed_type_info = 1;
dump_macro_block_edges = flag;
}
+void dump_block_marker_in_title(int flag) {
+ dump_block_marker = flag;
+}
+
/* -------------- some extended helper functions ----------------- */
/**
#ifdef INTERPROCEDURAL_VIEW
int rem_view = get_interprocedural_view();
#endif
- int walk_flag = using_visited(irg);
+ int walk_flag = using_irn_visited(irg);
ir_graph *rem = current_ir_graph;
current_ir_graph = irg;
if(walk_flag)
- clear_using_visited(current_ir_graph);
+ clear_using_irn_visited(current_ir_graph);
for (i = get_irp_n_irgs() - 1; i >= 0; --i)
ird_set_irg_link(get_irp_irg(i), NULL);
#endif
if(walk_flag)
- set_using_visited(current_ir_graph);
+ set_using_irn_visited(current_ir_graph);
current_ir_graph = rem;
return ird_get_irg_link(irg);
/* implementation for default nodes */
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 < (int) sizeof(buf) && "buffer to small for tarval_snprintf");
- fprintf(F, buf);
- } break;
+ case iro_Const:
+ ir_fprintf(F, "%T", get_Const_tarval(n));
+ break;
- case iro_SymConst: {
+ case iro_SymConst:
switch (get_SymConst_kind(n)) {
case symconst_addr_name:
/* don't use get_SymConst_ptr_info as it mangles the name. */
fprintf(F, "SymC %lu label", get_SymConst_label(n));
break;
}
- } break;
+ break;
- case iro_Filter: {
+ case iro_Filter:
if (!get_interprocedural_view())
fprintf(F, "Proj'");
else
goto default_case;
- } break;
+ break;
case iro_Proj: {
ir_node *pred = get_Proj_pred(n);
case iro_Start:
case iro_End:
case iro_EndExcept:
- case iro_EndReg: {
+ case iro_EndReg:
if (get_interprocedural_view()) {
fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
break;
} else
goto default_case;
- }
+
case iro_CallBegin: {
ir_node *addr = get_CallBegin_ptr(n);
ir_entity *ent = NULL;
if (get_irn_op(addr) == op_Sel)
ent = get_Sel_entity(addr);
- else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
- ent = get_SymConst_entity(addr);
+ else if (is_Global(addr))
+ ent = get_Global_entity(addr);
fprintf(F, "%s", get_irn_opname(n));
if (ent) fprintf(F, " %s", get_entity_name(ent));
break;
fprintf(F, "%s", get_irn_opname(n));
break;
case iro_Block:
- fprintf(F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
+ fprintf(F, "%s%s%s",
+ is_Block_dead(n) ? "Dead " : "", get_irn_opname(n),
+ dump_block_marker ? (get_Block_mark(n) ? "*" : "") : "");
break;
case iro_Conv:
if (get_Conv_strict(n))
fprintf(F, "%s", get_irn_opname(n));
break;
case iro_Div:
- fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Div_resmode(n), &bad));
+ fprintf(F, "%s", get_irn_opname(n));
+ if (is_Div_remainderless(n))
+ fprintf(F, "RL");
+ fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), &bad));
break;
case iro_Mod:
fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), &bad));
#define X(a) { pn_Start_##a, #a }
X(X_initial_exec),
X(P_frame_base),
- X(P_globals),
X(P_tls),
X(T_args),
X(P_value_arg_base)
/**
* dumps the VCG header
*/
-void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
+void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation) {
int i;
char *label;
init_colors();
- if (edge_label) {
- label = "yes";
- } else {
- label = "no";
- }
-
+ label = edge_label ? "yes" : "no";
+ if (! layout) layout = "Compilergraph";
if (!orientation) orientation = "bottom_to_top";
/* print header */
fprintf(F,
"graph: { title: \"ir graph of %s\"\n"
"display_edge_labels: %s\n"
- "layoutalgorithm: mindepth\n"
+ "layoutalgorithm: mindepth //$ \"%s\"\n"
"manhattan_edges: yes\n"
"port_sharing: no\n"
"orientation: %s\n"
"infoname 1: \"Attribute\"\n"
"infoname 2: \"Verification errors\"\n"
"infoname 3: \"Debug info\"\n",
- name, label, orientation);
+ name, label, layout, orientation);
for (i = 0; i < ird_color_count; ++i) {
- if(color_rgb[i] != NULL) {
+ if (color_rgb[i] != NULL) {
fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
}
}
construct_backedges(irg);
}
- dump_vcg_header(out, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
/* call the dump graph hook */
if (dump_ir_graph_hook) {
{
int i;
- dump_vcg_header(out, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
construct_block_lists(irg);
if (get_irg_extblk_state(irg) != extblk_valid)
compute_extbb(irg);
- dump_vcg_header(F, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
construct_extblock_lists(irg);
/* dumping types does not work with local nodes */
dump_const_local = 0;
- dump_vcg_header(out, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
/* dump common ir graph */
irg_walk(get_irg_end(irg), NULL, dump_whole_node, out);
/* dumping types does not work with local nodes */
dump_const_local = 0;
- dump_vcg_header(out, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
/* dump common blocked ir graph */
construct_block_lists(irg);
#endif
current_ir_graph = irg;
- dump_vcg_header(f, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(f, get_irg_dump_name(irg), NULL, NULL);
#ifdef INTERPROCEDURAL_VIEW
if (ipv) {
F = vcg_open(get_irn_irg(root), suffix, buf);
if (F != NULL) {
pset *mark_set = pset_new_ptr(1);
- dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
+ dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL, NULL);
descend_and_dump(F, root, depth, mark_set);
dump_vcg_footer(F);
fclose(F);
ir_graph *rem = current_ir_graph;
current_ir_graph = irg;
- dump_vcg_header(f, get_irg_dump_name(irg), NULL);
+ dump_vcg_header(f, get_irg_dump_name(irg), "Hierarchic", NULL);
/* walk over the blocks in the graph */
type_walk_irg(irg, dump_type_info, NULL, f);
{
FILE *f = vcg_open_name("All_types", suffix);
if (f) {
- dump_vcg_header(f, "All_types", NULL);
+ dump_vcg_header(f, "All_types", "Hierarchic", NULL);
type_walk(dump_type_info, NULL, f);
inc_irg_visited(get_const_code_irg());
h_env_t env;
env.f = f;
env.dump_ent = entities;
- dump_vcg_header(f, "class_hierarchy", NULL);
+ dump_vcg_header(f, "class_hierarchy", "Hierarchic", NULL);
type_walk(dump_class_hierarchy_node, NULL, &env);
dump_vcg_footer(f);
dump_loop_node(F, loop);
/* Dump the loop elements. */
-
- for(i = 0; i < get_loop_n_elements(loop); i++) {
+ for (i = 0; i < get_loop_n_elements(loop); i++) {
le = get_loop_element(loop, i);
son = le.son;
if (get_kind(son) == k_ir_loop) {
/* We are a loop son -> Recurse */
- if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
+ if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
fprintf(F, "\" }\n");
fprintf(F, "edge: {sourcename: \"");
PRINT_LOOPID(loop);
assert(get_kind(son) == k_ir_graph);
/* We are a loop node -> Collect firm graphs */
- n = (ir_graph *)le.node;
+ n = le.irg;
if (!loop_node_started) {
/* Start a new node which contains all firm nodes of the current loop */
fprintf(F, "node: { title: \"");
current_ir_graph = irg;
edge_label = 1;
- dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
+ dump_vcg_header(f, get_irg_dump_name(irg), "Tree", "top_to_bottom");
- if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
+ if (get_irg_loop(irg))
+ dump_loops_standalone(f, get_irg_loop(irg));
dump_vcg_footer(f);
fclose(f);
void dump_callgraph_loop_tree(const char *suffix) {
FILE *F;
F = vcg_open_name("Callgraph_looptree", suffix);
- dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
+ dump_vcg_header(F, "callgraph looptree", "Tree", "top_to_bottom");
dump_loops_standalone(F, irp->outermost_cg_loop);
dump_vcg_footer(F);
fclose(F);
eset *extnodes = eset_create();
ir_node *n, *b;
- dump_vcg_header(F, name, NULL);
+ dump_vcg_header(F, name, NULL, NULL);
/* collect all nodes to dump */
collect_nodeloop(F, l, loopnodes);
projects / libfirm / blobdiff