+ /* 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));
+
+ /* 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: {
+ 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_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_size:
+ fprintf(F, " kind: size\n");
+ fprintf(F, " type: ");
+ dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
+ 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)));
+ break;
+ case iro_Store:
+ fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
+ break;
+ case iro_Confirm:
+ fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(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;
+
+ F = text_open (basename, suffix, "", ".txt");
+
+ dump_graph_to_file(F, irg);
+ fprintf(F, "\n\n");
+ irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
+
+ fclose (F);
+}