-int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
-
-
-
-#define X(a) case a: fprintf(F, #a); break
-void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
- int i, j;
- assert(ent && ent->kind == k_entity);
- type *owner = get_entity_owner(ent);
- type *type = get_entity_type(ent);
-
- if (verbosity & dump_verbosity_onlynames) {
- fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
- return;
- }
-
- if (verbosity & dump_verbosity_entattrs) {
- fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
- fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
- fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
-
- if (is_class_type(get_entity_owner(ent))) {
- if (get_entity_n_overwrites(ent) > 0) {
- fprintf(F, "%s overwrites:\n", prefix);
- for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
- entity *ov = get_entity_overwrites(ent, i);
- fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
- get_type_name(get_entity_owner(ov)));
- }
- } else {
- fprintf(F, "%s Does not overwrite other entities. \n", prefix);
- }
- if (get_entity_n_overwrittenby(ent) > 0) {
- fprintf(F, "%s overwritten by:\n", prefix);
- for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
- entity *ov = get_entity_overwrittenby(ent, i);
- fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
- get_type_name(get_entity_owner(ov)));
- }
- } else {
- fprintf(F, "%s Is not overwriten by other entities. \n", prefix);
- }
- }
-
- fprintf(F, "%s allocation: ", prefix);
- switch (get_entity_allocation(ent)) {
- X(allocation_dynamic);
- X(allocation_automatic);
- X(allocation_static);
- X(allocation_parameter);
- }
-
- fprintf(F, "\n%s visibility: ", prefix);
- switch (get_entity_visibility(ent)) {
- X(visibility_local);
- X(visibility_external_visible);
- X(visibility_external_allocated);
- }
-
- fprintf(F, "\n%s variability: ", prefix);
- switch (get_entity_variability(ent)) {
- X(variability_uninitialized);
- X(variability_initialized);
- X(variability_part_constant);
- X(variability_constant);
- }
- fprintf(F, "\n");
- } else { /* no entattrs */
- fprintf(F, "%s(%3d) %*s: %s", prefix,
- get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
- if (is_method_type(get_entity_type(ent))) fprintf(F, "(...)");
-
- if (verbosity & dump_verbosity_accessStats) {
- if (get_entity_allocation(ent) == allocation_static) {
- fprintf(F, " (stat)");
- } else {
- if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
- if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
- }
- }
- fprintf(F, "\n");
- }
-
- if (verbosity & dump_verbosity_entconsts) {
- if (get_entity_variability(ent) != variability_uninitialized) {
- if (is_atomic_entity(ent)) {
- fprintf(F, "%s atomic value: ", prefix);
- dump_node_opcode(F, get_atomic_ent_value(ent));
- } else {
- fprintf(F, "%s compound values:", prefix);
- for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
- compound_graph_path *path = get_compound_ent_value_path(ent, i);
- entity *ent0 = get_compound_graph_path_node(path, 0);
- fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
- if (get_type_state(type) == layout_fixed)
- fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
- fprintf(F, "%s", get_entity_name(ent0));
- for (j = 0; j < get_compound_graph_path_length(path); ++j) {
- entity *node = get_compound_graph_path_node(path, j);
- fprintf(F, ".%s", get_entity_name(node));
- if (is_array_type(get_entity_owner(node)))
- fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
- }
- fprintf(F, "\t = ");
- dump_node_opcode(F, get_compound_ent_value(ent, i));
- }
- }
- fprintf(F, "\n");
- }
- }
-
-
- if (verbosity & dump_verbosity_entattrs) {
- fprintf(F, "%s volatility: ", prefix);
- switch (get_entity_volatility(ent)) {
- X(volatility_non_volatile);
- X(volatility_is_volatile);
- }
-
- fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
- fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
- fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
- if (is_method_type(get_entity_type(ent))) {
- if (get_entity_irg(ent)) /* can be null */ {
- fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
- if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
- fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
- fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
- }
- } else {
- fprintf(F, "\n%s irg = NULL", prefix);
- }
- }
- fprintf(F, "\n");
- }
-
- if (verbosity & dump_verbosity_accessStats) {
- int n_acc = get_entity_n_accesses(ent);
- fprintf(F, "%s Access Stats", prefix);
- char comma = ':';
- for (i = 0; i < n_acc; ++i) {
- ir_node *acc = get_entity_access(ent, i);
- if (get_irn_op(acc) == op_Load) {
- fprintf(F, "%c L", comma);
- } else if (get_irn_op(acc) == op_Store) {
- fprintf(F, "%c S", comma);
- } else {
- assert(0);
- }
- fprintf(F, " %d", get_weighted_loop_depth(acc));
- comma = ',';
- }
- fprintf(F, "\n");
- }
+#define MY_SIZE 1024 /* Size of an array that actually should be computed. */
+
+/**
+ * Just opens a file, mangling a file name.
+ *
+ * The file name results from the concatenation of the following parts:
+ *
+ * @param basename The basis of the name telling about the content.
+ * @param suffix1 The first suffix.
+ * @param suffix2 The second suffix.
+ * @param suffix3 The third suffix.
+ */
+static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
+ FILE *F;
+ int len = strlen(basename), i, j;
+ char *fname; /* filename to put the vcg information in */
+
+ if (!basename) assert(basename);
+ if (!suffix1) suffix1 = "";
+ if (!suffix2) suffix2 = "";
+ if (!suffix3) suffix3 = ".txt";
+
+ /* open file for vcg graph */
+ fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
+
+ j = 0;
+ for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
+ if (basename[i] == '/') {
+ fname[j] = '@'; j++; fname[j] = '1'; j++;
+ } else if (basename[i] == '@') {
+ fname[j] = '@'; j++; fname[j] = '2'; j++;
+ } else {
+ fname[j] = basename[i]; j++;
+ }
+ }
+ fname[j] = '\0';
+ strcat(fname, suffix1); /* append file suffix */
+ strcat(fname, suffix2); /* append file suffix */
+ strcat(fname, suffix3); /* append the .txt suffix */
+
+ F = fopen(fname, "w"); /* open file for writing */
+ if (!F) {
+ perror(fname);
+ assert(0);
+ }
+ free(fname);
+
+ return F;
+}
+
+/* Write the irnode and all its attributes to the file passed. */
+int dump_irnode_to_file(FILE *F, ir_node *n) {
+ int i, bad = 0;
+ char comma;
+ ir_graph *irg;
+
+ dump_node_opcode(F, n);
+ fprintf(F, " %ld\n", get_irn_node_nr(n));
+
+ fprintf(F, " index: %u\n", get_irn_idx(n));
+ if (opt_dump_pointer_values_to_info)
+ fprintf (F, " addr: %p \n", (void *)n);
+ fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(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)));
+
+ if (get_irn_pinned(n) == op_pin_state_floats &&
+ get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
+ fprintf(F, " node was pinned in ");
+ dump_node_opcode(F, get_irn_n(n, -1));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
+ }
+
+ fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
+ /* show all predecessor nodes */
+ fprintf(F, " pred nodes: \n");
+ if (!is_Block(n)) {
+ fprintf(F, " -1: ");
+ dump_node_opcode(F, get_irn_n(n, -1));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
+ }
+ for ( i = 0; i < get_irn_intra_arity(n); ++i) {
+ fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
+ dump_node_opcode(F, get_irn_intra_n(n, i));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
+ }
+
+ fprintf(F, " Private Attributes:\n");
+
+ if (get_irn_opcode(n) == iro_Proj)
+ fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
+
+ if ((get_irp_ip_view_state() != ip_view_no)
+ && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
+ fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
+ fprintf(F, " inter pred nodes: \n");
+ for ( i = 0; i < get_irn_inter_arity(n); ++i) {
+ fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
+ dump_node_opcode(F, get_irn_inter_n(n, i));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
+ }
+ }
+
+ if (is_fragile_op(n)) {
+ fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
+ /* not dumped: frag array */
+ }
+
+ /* This is not nice, output it as a marker in the predecessor list. */
+ if ((get_irn_op(n) == op_Block) ||
+ (get_irn_op(n) == op_Phi) ||
+ ((get_irn_op(n) == op_Filter) && get_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");
+ }
+
+ /* Loop node. Someone else please tell me what's wrong ... */
+ if (get_irn_loop(n)) {
+ ir_loop *loop = get_irn_loop(n);
+ assert(loop);
+ fprintf(F, " in loop %d with depth %d\n",
+ get_loop_loop_nr(loop), get_loop_depth(loop));
+ }
+
+ /* Source types */
+ switch (get_irn_opcode(n)) {
+ case iro_Block: {
+ fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
+ if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
+ fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
+ fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
+ fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
+ }
+
+ fprintf(F, " Execution freqency statistics:\n");
+ if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
+ fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
+ if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
+ fprintf(F, " call freqency of procedure: %8.2lf\n",
+ get_irg_method_execution_frequency(get_irn_irg(n)));
+ if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
+ fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
+ if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
+ (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
+ (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
+ fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
+ if (has_Block_label(n))
+ fprintf(F, " Label: %lu\n", get_Block_label(n));
+
+ /* not dumped: graph_arr */
+ /* not dumped: mature */
+ } break;
+ case iro_Start: {
+ ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
+ fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
+ for (i = 0; i < get_method_n_params(tp); ++i)
+ fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
+ if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
+ ir_node *sbl = get_nodes_block(n);
+ int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
+ fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
+ for (i = 0; i < n_cfgpreds; ++i) {
+ ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
+ fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
+ get_irg_dump_name(get_irn_irg(cfgpred)));
+ }
+ }
+ } break;
+ case iro_Cond: {
+ fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
+ fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
+ if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
+ fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
+ } break;
+ case iro_Alloc: {
+ fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
+ fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
+ } break;
+ case iro_Free: {
+ fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
+ fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
+ } break;
+ case iro_Sel: {
+ ir_entity *ent = get_Sel_entity(n);
+ if (ent) {
+ fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
+ fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
+ fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
+ }
+ else {
+ fprintf(F, " <NULL entity>\n");
+ bad = 1;
+ }
+ } break;
+ case iro_Call: {
+ ir_type *tp = get_Call_type(n);
+ fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
+ if(get_unknown_type() != tp) {
+ for (i = 0; i < get_method_n_params(tp); ++i)
+ fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
+ for (i = 0; i < get_method_n_ress(tp); ++i)
+ fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
+ }
+ if (Call_has_callees(n)) {
+ fprintf(F, " possible callees: \n");
+ for (i = 0; i < get_Call_n_callees(n); i++) {
+ 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);
+ fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
+ if (Call_has_callees(call)) {
+ fprintf(F, " possible callees: \n");
+ for (i = 0; i < get_Call_n_callees(call); i++) {
+ fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
+ }
+ }
+ } break;
+ case iro_Cast: {
+ fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
+ } break;
+ case iro_Return: {
+ if (!get_interprocedural_view()) {
+ ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
+ fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
+ for (i = 0; i < get_method_n_ress(tp); ++i)
+ fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
+ }
+ } break;
+ case iro_Const: {
+ ir_type *tp = get_Const_type(n);
+ assert(tp != firm_none_type);
+ fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
+ } break;
+ case iro_SymConst: {
+ switch(get_SymConst_kind(n)) {
+ case symconst_addr_name:
+ fprintf(F, " kind: addr_name\n");
+ fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
+ break;
+ case symconst_addr_ent:
+ fprintf(F, " kind: addr_ent\n");
+ fprintf(F, " entity: ");
+ dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
+ break;
+ case symconst_ofs_ent:
+ fprintf(F, " kind: offset\n");
+ fprintf(F, " entity: ");
+ dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
+ break;
+ case symconst_type_tag:
+ fprintf(F, " kind: type_tag\n");
+ fprintf(F, " type: ");
+ dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
+ break;
+ case symconst_type_size:
+ fprintf(F, " kind: size\n");
+ fprintf(F, " type: ");
+ dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
+ break;
+ case symconst_type_align:
+ fprintf(F, " kind: alignment\n");
+ fprintf(F, " type: ");
+ dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
+ break;
+ case symconst_enum_const:
+ fprintf(F, " kind: enumeration\n");
+ fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
+ break;
+ case symconst_label:
+ fprintf(F, " kind: label\n");
+ fprintf(F, " label: %lu\n", get_SymConst_label(n));
+ break;
+ }
+ fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
+ } break;
+ case iro_Load:
+ fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
+ fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
+ fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
+ break;
+ case iro_Store:
+ fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
+ fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
+ break;
+ case iro_Confirm:
+ fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
+ break;
+ case iro_ASM: {
+ const ir_asm_constraint *cons;
+ ident **clobber;
+ int l;
+
+ fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
+ l = get_ASM_n_input_constraints(n);
+ if (l > 0) {
+ fprintf(F, "\n inputs: ");
+ cons = get_ASM_input_constraints(n);
+ for (i = 0; i < l; ++i)
+ fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
+ }
+ l = get_ASM_n_output_constraints(n);
+ if (l > 0) {
+ fprintf(F, "\n outputs: ");
+ cons = get_ASM_output_constraints(n);
+ for (i = 0; i < l; ++i)
+ fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
+ }
+ l = get_ASM_n_clobbers(n);
+ if (l > 0) {
+ fprintf(F, "\n clobber: ");
+ clobber = get_ASM_clobbers(n);
+ for (i = 0; i < l; ++i)
+ fprintf(F, "%s ", get_id_str(clobber[i]));
+ }
+ if (get_irn_pinned(n) != op_pin_state_floats)
+ fprintf(F, "\n volatile");
+ fprintf(F, "\n");
+ } break;
+ default: ;
+ }
+
+ if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
+ get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
+ if (get_irn_typeinfo_type(n) != firm_none_type)
+ fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
+
+ return bad;
+}
+
+
+
+void dump_irnode(ir_node *n) {
+ dump_irnode_to_file(stdout, n);
+}
+
+
+void dump_graph_to_file(FILE *F, ir_graph *irg) {
+ fprintf(F, "graph %s\n", get_irg_dump_name(irg));
+}
+
+void dump_graph(ir_graph *g) {
+ dump_graph_to_file(stdout, g);
+}
+
+static void dump_node_to_graph_file(ir_node *n, void *env) {
+ FILE *F = (FILE *)env;
+
+ dump_irnode_to_file(F, n);
+ fprintf(F, "\n");
+}
+
+void dump_graph_as_text(ir_graph *irg, const char *suffix) {
+ const char *basename = get_irg_dump_name(irg);
+ FILE *F;