#include "entity_t.h"
#include "trouts.h"
#include "irgwalk.h"
+#include "tv_t.h"
+#include "irdom.h"
#include "field_temperature.h"
#define MY_SIZE 1024 /* Size of an array that actually should be computed. */
-int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
-
-
/* Just opens a file, mangling a file name.
*
* The name consists of the following parts:
fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
j = 0;
- for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */
+ 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] == '@') {
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;
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_nodes_block(n));
- fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
+ 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));
fprintf(F, " pred nodes: \n");
if (!is_Block(n)) {
fprintf(F, " -1: ");
- dump_node_opcode(F, get_nodes_block(n));
- fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
+ 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" : " ");
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));
switch (get_irn_opcode(n)) {
case iro_Block: {
fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
- fprintf(F, " dominator info: output not implemented\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_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));
} 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 of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
- fprintf(F, " from entity of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
+ 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");
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));
+ 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));
+ 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)));
+ fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
}
}
} break;
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)));
+ fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
}
}
} break;
default: ;
}
- 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_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));
break;
default:
- DDMN(addr);
- assert(0 && "unexpected address node");
+ //DDMN(addr);
+ //assert(0 && "unexpected address node");
+ ;
}
addr_op = get_irn_opcode(addr);
}
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 eigth 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, type *tp, char *prefix,
+ int (*get_n_types)(type *tp),
+ type *(*get_type)(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 eigth 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;
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 overwritten by other entities. \n", prefix);
+ fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
+ }
+
+ 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)));
+ }
}
}
X(variability_part_constant);
X(variability_constant);
}
+
+ if (is_Method_type(get_entity_type(ent))) {
+ unsigned mask = get_entity_additional_properties(ent);
+ unsigned cc = get_entity_calling_convention(ent);
+
+ if (mask) {
+ fprintf(F, "\n%s additional prop: ", prefix);
+
+ if (mask & irg_const_function) fprintf(F, "const_function, ");
+ if (mask & irg_pure_function) fprintf(F, "pure_function, ");
+ if (mask & irg_noreturn_function) fprintf(F, "noreturn_function, ");
+ if (mask & irg_nothrow_function) fprintf(F, "nothrow_function, ");
+ if (mask & irg_naked_function) fprintf(F, "naked_function, ");
+ }
+ fprintf(F, "\n%s calling convention: ", prefix);
+ if (cc & irg_cc_reg_param) fprintf(F, "regparam, ");
+ if (cc & irg_cc_this_call) fprintf(F, "thiscall, ");
+ if ((cc & (irg_cc_last_on_top|irg_cc_callee_clear_stk)) == 0)
+ fprintf(F, "cdecl");
+ else if ((cc & (irg_cc_last_on_top|irg_cc_callee_clear_stk)) == (irg_cc_last_on_top|irg_cc_callee_clear_stk))
+ fprintf(F, "stdcall");
+ else {
+ fprintf(F, (cc & irg_cc_last_on_top) ? "last param on top, " : "first param on top, ");
+ fprintf(F, (cc & irg_cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
+ }
+ }
+
fprintf(F, "\n");
} else { /* no entattrs */
fprintf(F, "%s(%3d) %*s: %s", prefix,
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");
}
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));
+ 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");
}
+ 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);
int max_depth = 0;
int max_L_freq = -1;
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;
- }
+ 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) {
- 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;
- }
+ 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, "%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 = ',';
+ if (L_freq[i])
+ fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
+ else
+ fprintf(F, " ");
+ comma = ',';
}
fprintf(F, "\n");
}
//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 = ',';
+ //if (LA_freq[i])
+ //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
+ //else
+ //fprintf(F, " ");
+ comma = ',';
}
fprintf(F, "\n");
}
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 = ',';
+ if (S_freq[i])
+ fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
+ else
+ fprintf(F, " ");
+ comma = ',';
}
fprintf(F, "\n");
}
//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 = ',';
+ //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));
+ }
+ }
}
}
void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
int *max_disp, int disp[], const char *comma) {
- int i, max_depth = 0;
+
+#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 *S_freq;
int *LA_freq;
int *SA_freq;
+ int i, max_depth = 0;
/* Find maximal depth */
for (i = 0; i < n_acc; ++i) {
max_depth = (depth > max_depth) ? depth : max_depth ;
}
- L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
+ 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;
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);
+ 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;
+ 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;
+ 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;
+ SA_freq[depth]++;
+ max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
}
if (get_entity_allocation(ent) == allocation_static) {
- assert(0);
+ assert(0);
}
} else {
assert(0);
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. */
void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
- int max_freq = -1;
- int max_disp = -1;
- int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
-
- if (!is_Class_type(tp)) return;
+ int i;
+ char buf[1024 + 10];
+ if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
if (verbosity & dump_verbosity_accessStats) {
- int i, n_all = get_type_n_allocations(tp);
- int max_depth = 0;
+#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_allocation(tp, 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, sizeof(freq[0]));
+ 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_allocation(tp, i);
+ ir_node *all = get_type_alloc(tp, i);
int depth = get_weighted_loop_depth(all);
- assert(depth < max_depth);
+ assert(depth <= max_depth);
freq[depth]++;
max_freq = (depth > max_freq) ? depth : max_freq;
assert(get_irn_op(all) == op_Alloc);
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_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
+ ((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);
+ }
}
}
/* 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);
+ }
+ }
+ }
}
}
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);
+ ((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));
+ 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));
+ type *stp = get_class_subtype(tp, i);
+ fprintf(F, "\n %s", get_type_name(stp));
}
- fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
+ if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
+ 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\n", get_peculiarity_string(get_class_peculiarity(tp)));
+
}
break;
}
break;
- case tpo_pointer: {
+ case tpo_array:
+ if (verbosity & dump_verbosity_typeattrs) {
+ int i, n_dim;
+ 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:
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));
+ 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) {
+ 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) {
+ 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) {
}
}
+ 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);
+#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);
+ 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(max_depth, sizeof(freq[0]));
+ freq = xcalloc(max_depth+1, sizeof(freq[0]));
for (i = 0; i < n_all; ++i) {
- ir_node *all = get_type_allocation(tp, i);
+ ir_node *all = get_type_alloc(tp, i);
int depth = get_weighted_loop_depth(all);
- assert(depth < max_depth);
+ assert(depth <= max_depth);
freq[depth]++;
max_freq = (depth > max_freq) ? depth : max_freq;
assert(get_irn_op(all) == op_Alloc);
}
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");
for (i = 0; i < n_types; ++i) {
type *t = get_irp_type(i);
- if (is_jack_rts_class(t)) continue;
+ //if (is_jack_rts_class(t)) continue;
dump_type_to_file(F, t, verbosity);
if (CSV) {
fclose (F);
if (CSV) fclose (CSV);
}
+
+
+void dump_globals_as_text(unsigned verbosity, const char *suffix) {
+ const char *basename;
+ FILE *F, *CSV = NULL;
+ type *g = get_glob_type();
+ int i, n_mems = get_class_n_members(g);
+
+ basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
+ F = text_open (basename, suffix, "-globals", ".txt");
+
+ if (verbosity & dump_verbosity_csv) {
+ CSV = text_open (basename, suffix, "-types", ".csv");
+ //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
+ }
+
+ for (i = 0; i < n_mems; ++i) {
+ entity *e = get_class_member(g, i);
+
+ dump_entity_to_file(F, e, verbosity);
+ if (CSV) {
+ //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
+ }
+ }
+
+ fclose (F);
+ if (CSV) fclose (CSV);
+}
projects / libfirm / blobdiff