X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firdumptxt.c;h=5d793eeee5946a4726ad13dd37340fae5d56e9a2;hb=5c49d04cab6ac76955eb0e417dd36ba29c112f58;hp=b66d51ff8286fd9cd96b7f3779e7c2de5568205b;hpb=13b742c94a08566a0a8183f86490fa6292460eb7;p=libfirm diff --git a/ir/ir/irdumptxt.c b/ir/ir/irdumptxt.c index b66d51ff8..5d793eeee 100644 --- a/ir/ir/irdumptxt.c +++ b/ir/ir/irdumptxt.c @@ -1,6 +1,6 @@ /* * Project: libFIRM - * File name: ir/ir/irdump.c + * File name: ir/ir/irdumptxt.c * Purpose: Write vcg representation of firm to file. * Author: Martin Trapp, Christian Schaefer * Modified by: Goetz Lindenmaier, Hubert Schmidt @@ -9,32 +9,471 @@ * Copyright: (c) 1998-2003 Universität Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. */ +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#ifdef HAVE_STRING_H #include +#endif +#ifdef HAVE_STDLIB_H #include +#endif + #include -#include "irdump.h" +#include "irdump_t.h" #include "firm_common_t.h" #include "irgraph_t.h" #include "irprog_t.h" #include "entity_t.h" +#include "trouts.h" +#include "irgwalk.h" +#include "tv_t.h" +#include "irdom.h" #include "field_temperature.h" -int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */ +#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)); + + /* 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, " \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_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; + } + 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); +} + + +int addr_is_alloc(ir_node *acc) { + ir_node *addr = NULL; + opcode addr_op; + if (is_memop(acc)) { + addr = get_memop_ptr(acc); + } else { + assert(is_Call(acc)); + addr = get_Call_ptr(acc); + } + + addr_op = get_irn_opcode(addr); + + while (addr_op != iro_Alloc) { + + switch (addr_op) { + case iro_Sel: + addr = get_Sel_ptr(addr); + break; + case iro_Cast: + addr = get_Cast_op(addr); + break; + case iro_Proj: + addr = get_Proj_pred(addr); + break; + case iro_SymConst: + case iro_Const: + return 0; + break; + case iro_Phi: + case iro_Load: + case iro_Call: + case iro_Start: + return 0; + break; + + default: + //DDMN(addr); + //assert(0 && "unexpected address node"); + ; + } + addr_op = get_irn_opcode(addr); + } + + /* In addition, the alloc must be in the same loop. */ + + return 1; +} + +/** dumps something like: + * + * "prefix" "Name" (x): node1, ... node7,\n + * "prefix" node8, ... node15,\n + * "prefix" node16, node17\n + */ +static void dump_node_list(FILE *F, firm_kind *k, char *prefix, + int (*get_entity_n_nodes)(firm_kind *ent), + ir_node *(*get_entity_node)(firm_kind *ent, int pos), + char *name) { + int i, n_nodes = get_entity_n_nodes(k); + char *comma = ""; + + fprintf(F, "%s %s (%d):", prefix, name, n_nodes); + for (i = 0; i < n_nodes; ++i) { + int rem; + if (i > 7 && !(i & 7)) { /* line break every eight node. */ + fprintf(F, ",\n%s ", prefix); + comma = ""; + } + fprintf(F, "%s ", comma); + rem = opt_dump_analysed_type_info; + opt_dump_analysed_type_info = 0; + dump_node_label(F, get_entity_node(k, i)); + opt_dump_analysed_type_info = rem; + comma = ","; + } + fprintf(F, "\n"); +} + +/** dumps something like: + * + * "prefix" "Name" (x): node1, ... node7,\n + * "prefix" node8, ... node15,\n + * "prefix" node16, node17\n + */ +static void dump_type_list(FILE *F, ir_type *tp, char *prefix, + int (*get_n_types)(ir_type *tp), + ir_type *(*get_type)(ir_type *tp, int pos), + char *name) { + int i, n_nodes = get_n_types(tp); + char *comma = ""; + + fprintf(F, "%s %s (%d):", prefix, name, n_nodes); + for (i = 0; i < n_nodes; ++i) { + if (i > 7 && !(i & 7)) { /* line break every eight node. */ + fprintf(F, ",\n%s ", prefix); + comma = ""; + } + fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp)); + //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames); + comma = ","; + } + fprintf(F, "\n"); +} -#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); + ir_type *owner, *type; + assert(is_entity(ent)); + owner = get_entity_owner(ent); + type = get_entity_type(ent); if (verbosity & dump_verbosity_onlynames) { fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)), get_entity_name(ent), get_entity_nr(ent)); @@ -46,64 +485,93 @@ void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned 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 (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))); - } + 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); + 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))); - } + 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 Is not overwritten 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); + if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) { + entity *ov; + fprintf(F, "%s transitive overwrites:\n", prefix); + for (ov = get_entity_trans_overwrites_first(ent); + ov; + ov = get_entity_trans_overwrites_next(ent)) { + fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov), + get_type_name(get_entity_owner(ov))); + } + fprintf(F, "%s transitive overwritten by:\n", prefix); + for (ov = get_entity_trans_overwrittenby_first(ent); + ov; + ov = get_entity_trans_overwrittenby_next(ent)) { + fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov), + get_type_name(get_entity_owner(ov))); + } + } } - fprintf(F, "\n%s visibility: ", prefix); - switch (get_entity_visibility(ent)) { - X(visibility_local); - X(visibility_external_visible); - X(visibility_external_allocated); - } + fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent))); + fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent))); + fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent))); + + if (is_Method_type(get_entity_type(ent))) { + unsigned mask = get_entity_additional_properties(ent); + unsigned cc = get_method_calling_convention(get_entity_type(ent)); + ir_graph *irg = get_entity_irg(ent); + + if (irg) { + fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg)); + fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg)); + } + + if (mask) { + fprintf(F, "\n%s additional prop: ", prefix); - fprintf(F, "\n%s variability: ", prefix); - switch (get_entity_variability(ent)) { - X(variability_uninitialized); - X(variability_initialized); - X(variability_part_constant); - X(variability_constant); + if (mask & mtp_property_const) fprintf(F, "const_function, "); + if (mask & mtp_property_pure) fprintf(F, "pure_function, "); + if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, "); + if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, "); + if (mask & mtp_property_naked) fprintf(F, "naked_function, "); + } + fprintf(F, "\n%s calling convention: ", prefix); + if (cc & cc_reg_param) fprintf(F, "regparam, "); + if (cc & cc_this_call) fprintf(F, "thiscall, "); + if (IS_CDECL(cc)) + fprintf(F, "cdecl"); + else if (IS_STDCALL(cc)) + fprintf(F, "stdcall"); + else { + fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, "); + fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack"); + } } + 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 (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)"); - } + if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)"); + if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)"); + if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)"); } fprintf(F, "\n"); } @@ -111,78 +579,173 @@ void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned 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)); + 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, "%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(ent)); + 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, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent))); + fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(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))) { + fprintf(F, "\n%s offset: %d bits, %d bytes", prefix, get_entity_offset_bits(ent), get_entity_offset_bytes(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))); - } + 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%s irg = NULL", prefix); } } fprintf(F, "\n"); } + if (get_trouts_state()) { + fprintf(F, "%s Entity outs:\n", prefix); + dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses, + (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses"); + dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references, + (ir_node *(*)(firm_kind *, int))get_entity_reference, "References"); + } + if (verbosity & dump_verbosity_accessStats) { +#if 0 int n_acc = get_entity_n_accesses(ent); - fprintf(F, "%s Access Stats", prefix); - char comma = ':'; + int max_depth = 0; + int max_L_freq = -1; + int max_S_freq = -1; + int max_LA_freq = -1; + int max_SA_freq = -1; + int *L_freq; + int *S_freq; + int *LA_freq; + int *SA_freq; + + /* Find maximal depth */ 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); + int depth = get_weighted_loop_depth(acc); + max_depth = (depth > max_depth) ? depth : max_depth ; + } + + L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0])); + + S_freq = L_freq + 1*max_depth; + LA_freq = L_freq + 2*max_depth; + SA_freq = L_freq + 3*max_depth; + + for (i = 0; i < n_acc; ++i) { + ir_node *acc = get_entity_access(ent, i); + int depth = get_weighted_loop_depth(acc); + assert(depth < max_depth); + if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) { + L_freq[depth]++; + max_L_freq = (depth > max_L_freq) ? depth : max_L_freq; + if (addr_is_alloc(acc)) { + LA_freq[depth]++; + max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq; + } } else if (get_irn_op(acc) == op_Store) { - fprintf(F, "%c S", comma); + S_freq[depth]++; + max_S_freq = (depth > max_S_freq) ? depth : max_S_freq; + if (addr_is_alloc(acc)) { + SA_freq[depth]++; + max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq; + } } else { - assert(0); + assert(0); } - fprintf(F, " %d", get_weighted_loop_depth(acc)); - comma = ','; } - fprintf(F, "\n"); - } + if (max_L_freq >= 0) { + char comma = ':'; + + fprintf(F, "%s Load Stats", prefix); + for (i = 0; i <= max_L_freq; ++i) { + if (L_freq[i]) + fprintf(F, "%c %d x L%d", comma, L_freq[i], i); + else + fprintf(F, " "); + comma = ','; + } + fprintf(F, "\n"); + } + if (max_LA_freq >= 0) { + //fprintf(F, "%s LoadA Stats", prefix); + char comma = ':'; + for (i = 0; i <= max_LA_freq; ++i) { + //if (LA_freq[i]) + //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i); + //else + //fprintf(F, " "); + comma = ','; + } + fprintf(F, "\n"); + } + if (max_S_freq >= 0) { + char comma = ':'; + + fprintf(F, "%s Store Stats", prefix); + for (i = 0; i <= max_S_freq; ++i) { + if (S_freq[i]) + fprintf(F, "%c %d x S%d", comma, S_freq[i], i); + else + fprintf(F, " "); + comma = ','; + } + fprintf(F, "\n"); + } + if (max_SA_freq >= 0) { + //fprintf(F, "%s StoreAStats", prefix); + char comma = ':'; + for (i = 0; i <= max_SA_freq; ++i) { + //if (SA_freq[i]) + //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i); + //else + //fprintf(F, " "); + comma = ','; + } + fprintf(F, "\n"); + } + + /* free allocated space */ + free(L_freq); +#endif + if (get_trouts_state() != outs_none) { + if (is_Method_type(get_entity_type(ent))) { + fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent)); + fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent)); + } else { + fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent)); + fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent)); + } + } + } } -#undef X void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) { dump_entity_to_file_prefix (F, ent, "", verbosity); @@ -193,17 +756,203 @@ void dump_entity (entity *ent) { dump_entity_to_file(stdout, ent, dump_verbosity_max); } -void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) { +void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity, + int *max_disp, int disp[], const char *comma) { + +#if 0 /* Outputs loop depth of all occurrences. */ + int n_acc = get_entity_n_accesses(ent); + int max_L_freq = -1; + int max_S_freq = -1; + int max_LA_freq = -1; + int max_SA_freq = -1; + int *L_freq; + int *S_freq; + int *LA_freq; + int *SA_freq; + int i, max_depth = 0; + + /* Find maximal depth */ + for (i = 0; i < n_acc; ++i) { + ir_node *acc = get_entity_access(ent, i); + int depth = get_weighted_loop_depth(acc); + max_depth = (depth > max_depth) ? depth : max_depth ; + } + + L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0])); + + S_freq = L_freq + 1*max_depth; + LA_freq = L_freq + 2*max_depth; + SA_freq = L_freq + 3*max_depth; + + for (i = 0; i < n_acc; ++i) { + ir_node *acc = get_entity_access(ent, i); + int depth = get_weighted_loop_depth(acc); + assert(depth <= max_depth); + if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) { + L_freq[depth]++; + max_L_freq = (depth > max_L_freq) ? depth : max_L_freq; + if (addr_is_alloc(acc)) { + LA_freq[depth]++; + max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq; + } + if (get_entity_allocation(ent) == allocation_static) { + disp[depth]++; + *max_disp = (depth > *max_disp) ? depth : *max_disp; + } + } else if (get_irn_op(acc) == op_Store) { + S_freq[depth]++; + max_S_freq = (depth > max_S_freq) ? depth : max_S_freq; + if (addr_is_alloc(acc)) { + SA_freq[depth]++; + max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq; + } + if (get_entity_allocation(ent) == allocation_static) { + assert(0); + } + } else { + assert(0); + } + } + + if (get_entity_allocation(ent) != allocation_static) { + + fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent)); + + if (max_L_freq >= 0) { + fprintf(F, "%s Load", comma); + for (i = 0; i <= max_L_freq; ++i) { + fprintf(F, "%s %d", comma, L_freq[i]); + } + } + if (max_S_freq >= 0) { + if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent)); + fprintf(F, "%s Store", comma); + for (i = 0; i <= max_S_freq; ++i) { + fprintf(F, "%s %d", comma, S_freq[i]); + } + } + fprintf(F, "\n"); + } + free(L_freq); +#endif + + if (get_entity_allocation(ent) != allocation_static) { + if (is_Method_type(get_entity_type(ent))) return; + + /* Output the entity name. */ + fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent)); + + if (get_trouts_state() != outs_none) { + if (is_Method_type(get_entity_type(ent))) { + //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent)); + //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent)); + } else { + fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent)); + fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent)); + } + } + + fprintf(F, "\n"); + } +} + +/* A fast hack to dump a CSV-file. */ +void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) { int i; + char buf[1024 + 10]; + if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java. - if ((is_class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return; - if ((is_struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return; - if ((is_union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return; - if ((is_array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return; - if ((is_pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return; - if ((is_method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return; - if ((is_primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return; - if ((is_enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return; + if (verbosity & dump_verbosity_accessStats) { + +#if 0 /* Outputs loop depth of all occurrences. */ + int max_freq = -1; + int max_disp = -1; + int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */ + int n_all = get_type_n_allocs(tp); + int max_depth = 0; + /* Find maximal depth */ + for (i = 0; i < n_all; ++i) { + ir_node *all = get_type_alloc(tp, i); + int depth = get_weighted_loop_depth(all); + max_depth = (depth > max_depth) ? depth : max_depth ; + } + + freq = xcalloc(2 * (max_depth+1), sizeof(freq[0])); + + disp = freq + max_depth; + + for (i = 0; i < n_all; ++i) { + ir_node *all = get_type_alloc(tp, i); + int depth = get_weighted_loop_depth(all); + assert(depth <= max_depth); + freq[depth]++; + max_freq = (depth > max_freq) ? depth : max_freq; + assert(get_irn_op(all) == op_Alloc); + } + + fprintf(F, "%s ", get_type_name(tp)); + fprintf(F, "%s Alloc ", comma); + + if (max_freq >= 0) { + for (i = 0; i <= max_freq; ++i) { + fprintf(F, "%s %d", comma, freq[i]); + } + } + fprintf(F, "\n"); + + for (i = 0; i < get_class_n_members(tp); ++i) { + entity *mem = get_class_member(tp, i); + if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) || + ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) { + if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) { + dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma); + } + } + } + + if (max_disp >= 0) { + fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma); + for (i = 0; i <= max_disp; ++i) { + fprintf(F, "%s %d", comma, disp[i]); + } + fprintf(F, "\n"); + } + + /* free allocated space */ + free(freq); +#endif + +#define DISP_TAB_SUFFIX "__disp_tab" + if (get_trouts_state() != outs_none) { + assert(strlen(get_type_name(tp)) < 1024); + fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp)); + sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX); + fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp)); + } + + for (i = 0; i < get_class_n_members(tp); ++i) { + entity *mem = get_class_member(tp, i); + if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) || + ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) { + if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) { + dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0); + } + } + } + } +} + +void dump_type_to_file (FILE *F, ir_type *tp, dump_verbosity verbosity) { + int i; + + if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return; + if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return; + if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return; + if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return; + if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return; + if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return; + if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return; + if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return; fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp)); if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; } @@ -216,24 +965,50 @@ void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) { } for (i = 0; i < get_class_n_members(tp); ++i) { entity *mem = get_class_member(tp, i); - if (((verbosity & dump_verbosity_methods) && is_method_type(get_entity_type(mem))) || - ((verbosity & dump_verbosity_fields) && !is_method_type(get_entity_type(mem))) ) { - dump_entity_to_file_prefix(F, mem, " ", verbosity); + if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) || + ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) { + if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) { + dump_entity_to_file_prefix(F, mem, " ", verbosity); + } } } if (verbosity & dump_verbosity_typeattrs) { fprintf(F, " supertypes: "); for (i = 0; i < get_class_n_supertypes(tp); ++i) { - type *stp = get_class_supertype(tp, i); - fprintf(F, "\n %s", get_type_name(stp)); + ir_type *stp = get_class_supertype(tp, i); + fprintf(F, "\n %s", get_type_name(stp)); } fprintf(F, "\n subtypes: "); for (i = 0; i < get_class_n_subtypes(tp); ++i) { - type *stp = get_class_subtype(tp, i); - fprintf(F, "\n %s", get_type_name(stp)); + ir_type *stp = get_class_subtype(tp, i); + fprintf(F, "\n %s", get_type_name(stp)); + } + + if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) { + ir_type *stp; + fprintf(F, "\n transitive supertypes: "); + for (stp = get_class_trans_supertype_first(tp); + stp; + stp = get_class_trans_supertype_next(tp)) { + fprintf(F, "\n %s", get_type_name(stp)); + } + fprintf(F, "\n transitive subtypes: "); + for (stp = get_class_trans_subtype_first(tp); + stp; + stp = get_class_trans_subtype_next(tp)) { + fprintf(F, "\n %s", get_type_name(stp)); + } } - fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp))); + fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp))); + fprintf(F, "\n flags: "); + if (is_class_final(tp)) + fprintf(F, "final, "); + if (is_class_interface(tp)) + fprintf(F, "interface, "); + if (is_class_abstract(tp)) + fprintf(F, "abstract, "); + fprintf(F, "\n"); } break; @@ -243,18 +1018,90 @@ void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) { for (i = 0; i < get_compound_n_members(tp); ++i) { entity *mem = get_compound_member(tp, i); if (verbosity & dump_verbosity_fields) { - dump_entity_to_file_prefix(F, mem, " ", verbosity); + dump_entity_to_file_prefix(F, mem, " ", verbosity); + } + } + break; + + case tpo_array: + if (verbosity & dump_verbosity_typeattrs) { + int i, n_dim; + ir_type *elem_tp = get_array_element_type(tp); + + fprintf(F, "\n array "); + + n_dim = get_array_n_dimensions(tp); + for (i = 0; i < n_dim; ++i) { + ir_node *lower, *upper; + + lower = get_array_lower_bound(tp, i); + upper = get_array_upper_bound(tp, i); + + fprintf(F, "["); + + if (get_irn_op(lower) == op_Const) + fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower))); + else { + dump_node_opcode(F, lower); + fprintf(F, " %ld .. ", get_irn_node_nr(lower)); + } + + if (get_irn_op(upper) == op_Const) + fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower))); + else { + dump_node_opcode(F, upper); + fprintf(F, " %ld]", get_irn_node_nr(upper)); + } + } + fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp)); + + fprintf(F, "\n order: "); + for (i = 0; i < n_dim; ++i) + fprintf(F, "<%d>", get_array_order(tp, i)); + + fprintf(F, "\n"); + + if (verbosity & dump_verbosity_fields) { + dump_entity_to_file_prefix(F, get_array_element_entity(tp), + " ", verbosity); } } break; - case tpo_pointer: { + case tpo_pointer: if (verbosity & dump_verbosity_typeattrs) { - type *tt = get_pointer_points_to_type(tp); - fprintf(F, "\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt)); + ir_type *tt = get_pointer_points_to_type(tp); + fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt)); } + break; - } break; + case tpo_method: + if (verbosity & dump_verbosity_typeattrs) { + fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp))); + fprintf(F, "\n return types: %d", get_method_n_ress(tp)); + for (i = 0; i < get_method_n_ress(tp); ++i) { + ir_type *rtp = get_method_res_type(tp, i); + fprintf(F, "\n %s", get_type_name(rtp)); + } + + fprintf(F, "\n parameter types: %d", get_method_n_params(tp)); + for (i = 0; i < get_method_n_params(tp); ++i) { + ir_type *ptp = get_method_param_type(tp, i); + fprintf(F, "\n %s", get_type_name(ptp)); + } + if (get_method_variadicity(tp)) { + fprintf(F, "\n ..."); + } + fprintf(F, "\n"); + } + break; + + case tpo_primitive: + case tpo_id: + case tpo_none: + case tpo_unknown: + fprintf(F, "\n"); + break; default: if (verbosity & dump_verbosity_typeattrs) { @@ -262,83 +1109,133 @@ void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) { } } + fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp))); + fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp))); + fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp)); + fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp)); + if (is_atomic_type(tp) || is_Method_type(tp)) + fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp))); + + if (get_trouts_state()) { + fprintf(F, "\n Type outs:\n"); + dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs, + (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations"); + dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts, + (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts"); + dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo"); + } + + if (verbosity & dump_verbosity_accessStats) { - int n_all = get_type_n_allocations(tp); - fprintf(F, " Access Stats"); - char comma = ':'; +#if 0 + int n_all = get_type_n_allocs(tp); + int max_depth = 0; + int max_freq = -1; + int *freq; + + /* Find maximal depth */ for (i = 0; i < n_all; ++i) { - ir_node *all = get_type_allocation(tp, i); - fprintf(F, "%c A", comma); - fprintf(F, " %d", get_weighted_loop_depth(all)); - comma = ','; + ir_node *all = get_type_alloc(tp, i); + int depth = get_weighted_loop_depth(all); + max_depth = (depth > max_depth) ? depth : max_depth ; } - fprintf(F, "\n"); + + freq = xcalloc(max_depth+1, sizeof(freq[0])); + + for (i = 0; i < n_all; ++i) { + ir_node *all = get_type_alloc(tp, i); + int depth = get_weighted_loop_depth(all); + assert(depth <= max_depth); + freq[depth]++; + max_freq = (depth > max_freq) ? depth : max_freq; + assert(get_irn_op(all) == op_Alloc); + } + + if (max_freq >= 0) { + char comma = ':'; + + fprintf(F, " Alloc Stats"); + for (i = 0; i <= max_freq; ++i) { + fprintf(F, "%c %d x A%d", comma, freq[i], i); + comma = ','; + } + fprintf(F, "\n"); + } + + free(freq); +#endif + if (get_trouts_state() != outs_none) { + fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp)); + if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) { + fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp)); + fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp)); + fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp)); + assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp)); + } + } + } fprintf(F, "\n\n"); } -void dump_type(type *tp) { +void dump_type(ir_type *tp) { dump_type_to_file (stdout, tp, dump_verbosity_max); } +void dump_types_as_text(unsigned verbosity, const char *suffix) { + const char *basename; + FILE *F, *CSV = NULL; + int i, n_types = get_irp_n_types(); -static FILE *text_open (const char *basename, const char * suffix1, const char *suffix2) { - FILE *F; - int len = strlen(basename), i, j; - char *fname; /* filename to put the vcg information in */ + basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes"; + F = text_open (basename, suffix, "-types", ".txt"); - if (!basename) assert(basename); - if (!suffix1) suffix1 = ""; - if (!suffix2) suffix2 = ""; + if (verbosity & dump_verbosity_csv) { + CSV = text_open (basename, suffix, "-types", ".csv"); + //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n"); + } - /* open file for vcg graph */ - fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */ + for (i = 0; i < n_types; ++i) { + ir_type *t = get_irp_type(i); - j = 0; - for (i = 0; i < len; ++i) { /* replase '/' 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, ".txt"); /* append the .txt suffix */ + //if (is_jack_rts_class(t)) continue; - F = fopen (fname, "w"); /* open file for writing */ - if (!F) { - assert(0); + dump_type_to_file(F, t, verbosity); + if (CSV) { + dump_typecsv_to_file(CSV, t, verbosity, ""); + } } - free(fname); - return F; + fclose (F); + if (CSV) fclose (CSV); } -void dump_types_as_text(unsigned verbosity, const char *suffix) { + +void dump_globals_as_text(unsigned verbosity, const char *suffix) { const char *basename; - FILE *F; - int i, n_types = get_irp_n_types(); + FILE *F, *CSV = NULL; + ir_type *g = get_glob_type(); + int i, n_mems = get_class_n_members(g); - if (get_irp_prog_ident() == new_id_from_str("no_name_set")) { - basename = "TextTypes"; - } else { - basename = get_irp_prog_name(); - } - F = text_open (basename, suffix, "-types"); + basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals"; + F = text_open (basename, suffix, "-globals", ".txt"); - for (i = 0; i < n_types; ++i) { - type *t = get_irp_type(i); + if (verbosity & dump_verbosity_csv) { + CSV = text_open (basename, suffix, "-types", ".csv"); + //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n"); + } - if (is_jack_rts_class(t)) continue; + for (i = 0; i < n_mems; ++i) { + entity *e = get_class_member(g, i); - dump_type_to_file(F, t, verbosity); + dump_entity_to_file(F, e, verbosity); + if (CSV) { + //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???); + } } fclose (F); + if (CSV) fclose (CSV); }