+void dump_entity(ir_entity *ent) {
+ dump_entity_to_file(stdout, ent, dump_verbosity_max);
+}
+
+void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
+ unsigned verbosity, int *max_disp,
+ int disp[], const char *comma)
+{
+ (void) verbosity;
+ (void) max_disp;
+ (void) disp;
+ (void) 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));
+
+#ifdef INTERPROCEDURAL_VIEW
+ 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));
+ }
+ }
+#endif
+
+ fprintf(F, "\n");
+ }
+}
+
+#ifdef INTERPROCEDURAL_VIEW
+/* 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];
+ (void) comma;
+
+ if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
+
+ 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) {
+ ir_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) {
+ ir_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);
+ }
+ }
+ }
+ }
+}
+#endif
+
+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; }
+
+ switch (get_type_tpop_code(tp)) {
+
+ case tpo_class:
+ if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
+ fprintf(F, "\n members: \n");
+ }
+ for (i = 0; i < get_class_n_members(tp); ++i) {
+ ir_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_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) {
+ ir_type *stp = get_class_supertype(tp, i);
+ fprintf(F, "\n %d %s", i, get_type_name(stp));
+ }
+ fprintf(F, "\n subtypes: ");
+ for (i = 0; i < get_class_n_subtypes(tp); ++i) {
+ ir_type *stp = get_class_subtype(tp, i);
+ fprintf(F, "\n %d %s", i, 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\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;
+
+ case tpo_union:
+ case tpo_struct:
+ if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
+ for (i = 0; i < get_compound_n_members(tp); ++i) {
+ ir_entity *mem = get_compound_member(tp, i);
+ if (verbosity & dump_verbosity_fields) {
+ 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:
+ if (verbosity & dump_verbosity_typeattrs) {
+ 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;
+
+ 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:
+ if (verbosity & dump_verbosity_typeattrs) {
+ ir_type *base_tp = get_primitive_base_type(tp);
+ if (base_tp != NULL)
+ fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
+ fprintf(F, "\n");
+ }
+ break;
+
+ case tpo_id:
+ case tpo_none:
+ case tpo_unknown:
+ fprintf(F, "\n");
+ break;
+
+ default:
+ if (verbosity & dump_verbosity_typeattrs) {
+ fprintf(F, ": details not implemented\n");
+ }
+ }
+
+ 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: %2u Bytes,\n", get_type_size_bytes(tp));
+ fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(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) {
+#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_alloc(tp, i);
+ int depth = get_weighted_loop_depth(all);
+ max_depth = (depth > max_depth) ? depth : max_depth ;
+ }
+
+ 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
+#ifdef INTERPROCEDURAL_VIEW
+ 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));
+ }
+ }
+#endif
+
+ }
+
+ fprintf(F, "\n\n");
+}
+
+void dump_type(ir_type *tp) {
+ dump_type_to_file (stdout, tp, dump_verbosity_max);
+}
+
+