/*
* 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_t.h"
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 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" : " ");
fprintf(F, "\n");
}
- /* Loop node Someone else please tell me what's wrong ...
+ /* 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",
+ 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");
+ fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
+ fprintf(F, " dominator info: output not implemented\n");
/* not dumped: graph_arr */
/* not dumped: mature */
} break;
} break;
case iro_Const: {
type *tp = get_Const_type(n);
- assert(tp != none_type);
+ 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: {
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)
+ 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;
#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);
+ 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));
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 overwritten by other entities. \n", prefix);
+ fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
}
}
} 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)");
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(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, "\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));
- if (is_method_type(get_entity_type(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 (verbosity & dump_verbosity_accessStats) {
int n_acc = get_entity_n_accesses(ent);
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) {
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;
- }
+ 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;
- }
+ 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);
}
}
if (max_L_freq >= 0) {
- fprintf(F, "%s Load Stats", prefix);
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 = ',';
+ 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");
}
if (max_S_freq >= 0) {
- fprintf(F, "%s Store Stats", prefix);
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 = ',';
+ 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);
}
}
int *max_disp, int disp[], const char *comma) {
int i, max_depth = 0;
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;
/* Find maximal depth */
for (i = 0; i < n_acc; ++i) {
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;
- }
+ 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);
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);
}
}
- if (get_entity_allocation(ent) == allocation_static) return;
+ if (get_entity_allocation(ent) != allocation_static) {
- fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
+ 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_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]);
+ 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");
}
- fprintf(F, "\n");
+ free(L_freq);
}
/* 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;
+ int max_freq = -1;
+ int max_disp = -1;
+ int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
+
+ if (!is_Class_type(tp)) return;
if (verbosity & dump_verbosity_accessStats) {
int i, n_all = get_type_n_allocations(tp);
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;
- }
+ freq = xcalloc(2 * max_depth, sizeof(freq[0]));
+
+ disp = freq + max_depth;
for (i = 0; i < n_all; ++i) {
ir_node *all = get_type_allocation(tp, i);
if (max_freq >= 0) {
for (i = 0; i <= max_freq; ++i) {
- fprintf(F, "%s %d", comma, 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 (((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, "%s %d", comma, disp[i]);
}
fprintf(F, "\n");
}
+
+ /* free allocated space */
+ free(freq);
}
}
void dump_type_to_file (FILE *F, 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;
+ 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; }
}
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))) ) {
+ 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)));
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;
if (verbosity & dump_verbosity_accessStats) {
int n_all = get_type_n_allocations(tp);
int max_depth = 0;
+ int max_freq = -1;
+ int *freq;
/* Find maximal depth */
for (i = 0; i < n_all; ++i) {
max_depth = (depth > max_depth) ? depth : max_depth ;
}
- int freq[max_depth];
- int max_freq = -1;
- for (i = 0; i < max_depth; ++i) freq[i] = 0;
+ freq = xcalloc(max_depth, sizeof(freq[0]));
for (i = 0; i < n_all; ++i) {
ir_node *all = get_type_allocation(tp, i);
}
if (max_freq >= 0) {
- fprintf(F, " Alloc Stats");
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, "%c %d x A%d", comma, freq[i], i);
+ comma = ',';
}
fprintf(F, "\n");
}
+
+ free(freq);
}
fprintf(F, "\n\n");
void dump_types_as_text(unsigned verbosity, const char *suffix) {
const char *basename;
- FILE *F, *CSV;
+ FILE *F, *CSV = NULL;
int i, n_types = get_irp_n_types();
basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
if (is_jack_rts_class(t)) continue;
dump_type_to_file(F, t, verbosity);
- if (verbosity & dump_verbosity_csv) {
+ if (CSV) {
dump_typecsv_to_file(CSV, t, verbosity, "");
}
}
fclose (F);
- if (verbosity & dump_verbosity_csv) fclose (CSV);
+ if (CSV) fclose (CSV);
}