/*
* 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
* 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 <string.h>
+#endif
+#ifdef HAVE_STDLIB_H
#include <stdlib.h>
+#endif
+
#include <stdarg.h>
-#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 "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:
+ *
+ * @arg basename The basis of the name telling about the content.
+ * @arg
+ *
+ */
+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 = 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 @. */
+ 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) {
+ assert(0);
+ }
+ free(fname);
+
+ return F;
+}
+
+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));
+
+ 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_nodes_block(n));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
+ }
+
+ 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_nodes_block(n));
+ fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
+ }
+ 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_irp_ip_view_state() != ip_view_no)
+ && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
+ fprintf(F, " inter arity: %d", 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", get_Block_block_visited(n));
+ fprintf(F, " dominator info: not implemented\n");
+ /* not dumped: graph_arr */
+ /* not dumped: mature */
+ } break;
+ case iro_Start: {
+ 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));
+ } 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));
+ } 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));
+ }
+ else {
+ fprintf(F, " <NULL entity>\n");
+ bad = 1;
+ }
+ } break;
+ case iro_Call: {
+ 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()) {
+ 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: {
+ type *tp = get_Const_type(n);
+ assert(tp != 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)) == irg_typeinfo_consistent ||
+ get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_inconsistent )
+ if (get_irn_typeinfo_type(n) != 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(get_irn_op(acc) == op_Call);
+ 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;
+}
#define X(a) case a: fprintf(F, #a); break
void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
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));
+ fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
+ get_entity_name(ent), get_entity_nr(ent));
return;
}
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);
}
}
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");
}
}
}
-
if (verbosity & dump_verbosity_entattrs) {
fprintf(F, "%s volatility: ", prefix);
switch (get_entity_volatility(ent)) {
if (verbosity & dump_verbosity_accessStats) {
int n_acc = get_entity_n_accesses(ent);
- fprintf(F, "%s Access Stats", prefix);
- char comma = ':';
+ int max_depth = 0;
+
+ /* 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 ;
+ }
+
+ int L_freq[max_depth];
+ int max_L_freq = -1;
+ int S_freq[max_depth];
+ int max_S_freq = -1;
+ int LA_freq[max_depth];
+ int max_LA_freq = -1;
+ int SA_freq[max_depth];
+ int max_SA_freq = -1;
+ for (i = 0; i < max_depth; ++i) {
+ L_freq[i] = 0;
+ LA_freq[i] = 0;
+ S_freq[i] = 0;
+ SA_freq[i] = 0;
+ }
+
+ 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);
}
- fprintf(F, " %d", get_weighted_loop_depth(acc));
- comma = ',';
}
- fprintf(F, "\n");
- }
+ if (max_L_freq >= 0) {
+ fprintf(F, "%s Load Stats", prefix);
+ char comma = ':';
+ 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) {
+ fprintf(F, "%s Store Stats", prefix);
+ char comma = ':';
+ 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");
+ }
+ }
}
#undef X
dump_entity_to_file(stdout, ent, dump_verbosity_max);
}
+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;
+ int n_acc = get_entity_n_accesses(ent);
+
+ /* 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 ;
+ }
+
+ int L_freq[max_depth];
+ int max_L_freq = -1;
+ int S_freq[max_depth];
+ int max_S_freq = -1;
+ int LA_freq[max_depth];
+ int max_LA_freq = -1;
+ int SA_freq[max_depth];
+ int max_SA_freq = -1;
+ for (i = 0; i < max_depth; ++i) {
+ L_freq[i] = 0;
+ LA_freq[i] = 0;
+ S_freq[i] = 0;
+ SA_freq[i] = 0;
+ }
+
+ 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) return;
+
+ 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");
+}
+
+/* A fast hack to dump a csv. */
+void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
+ if (!is_class_type(tp)) return;
+
+ if (verbosity & dump_verbosity_accessStats) {
+ int i, n_all = get_type_n_allocations(tp);
+ int max_depth = 0;
+
+ /* Find maximal depth */
+ for (i = 0; i < n_all; ++i) {
+ ir_node *all = get_type_allocation(tp, i);
+ int depth = get_weighted_loop_depth(all);
+ max_depth = (depth > max_depth) ? depth : max_depth ;
+ }
+
+ int freq[max_depth];
+ int max_freq = -1;
+ int disp[max_depth]; /* Accumulated accesses to static members: dispatch table. */
+ int max_disp = -1;
+ for (i = 0; i < max_depth; ++i) {
+ freq[i] = 0;
+ disp[i] = 0;
+ }
+
+ for (i = 0; i < n_all; ++i) {
+ ir_node *all = get_type_allocation(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))) ) {
+ 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");
+ }
+ }
+}
+
void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
int i;
fprintf(F, ": details not implemented\n");
}
}
- fprintf(F, "\n\n");
-}
-
-void dump_type(type *tp) {
- dump_type_to_file (stdout, tp, dump_verbosity_max);
-}
-
+ if (verbosity & dump_verbosity_accessStats) {
+ int n_all = get_type_n_allocations(tp);
+ int max_depth = 0;
+
+ /* Find maximal depth */
+ for (i = 0; i < n_all; ++i) {
+ ir_node *all = get_type_allocation(tp, i);
+ int depth = get_weighted_loop_depth(all);
+ max_depth = (depth > max_depth) ? depth : max_depth ;
+ }
-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 */
-
- if (!basename) assert(basename);
- if (!suffix1) suffix1 = "";
- if (!suffix2) suffix2 = "";
-
- /* open file for vcg graph */
- fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
+ int freq[max_depth];
+ int max_freq = -1;
+ for (i = 0; i < max_depth; ++i) freq[i] = 0;
+
+ for (i = 0; i < n_all; ++i) {
+ ir_node *all = get_type_allocation(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);
+ }
- 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++;
+ if (max_freq >= 0) {
+ fprintf(F, " Alloc Stats");
+ char comma = ':';
+ for (i = 0; i <= max_freq; ++i) {
+ fprintf(F, "%c %d x A%d", comma, freq[i], i);
+ comma = ',';
+ }
+ fprintf(F, "\n");
}
}
- fname[j] = '\0';
- strcat (fname, suffix1); /* append file suffix */
- strcat (fname, suffix2); /* append file suffix */
- strcat (fname, ".txt"); /* append the .txt suffix */
- F = fopen (fname, "w"); /* open file for writing */
- if (!F) {
- assert(0);
- }
- free(fname);
+ fprintf(F, "\n\n");
+}
- return F;
+void dump_type(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;
+ FILE *F, *CSV;
int i, n_types = get_irp_n_types();
- if (get_irp_prog_ident() == new_id_from_str("no_name_set")) {
- basename = "TextTypes";
- } else {
- basename = get_irp_prog_name();
+ basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
+ F = text_open (basename, suffix, "-types", ".txt");
+
+ if (verbosity & dump_verbosity_csv) {
+ CSV = text_open (basename, suffix, "-types", ".csv");
+ //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
}
- F = text_open (basename, suffix, "-types");
for (i = 0; i < n_types; ++i) {
type *t = get_irp_type(i);
if (is_jack_rts_class(t)) continue;
dump_type_to_file(F, t, verbosity);
+ if (verbosity & dump_verbosity_csv) {
+ dump_typecsv_to_file(CSV, t, verbosity, "");
+ }
}
fclose (F);
+ if (verbosity & dump_verbosity_csv) fclose (CSV);
}
projects / libfirm / blobdiff