3 * File name: ir/ir/irdumptxt.c
4 * Purpose: Write vcg representation of firm to file.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier, Hubert Schmidt
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
27 #include "firm_common_t.h"
29 #include "irgraph_t.h"
35 #include "field_temperature.h"
37 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
39 int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
42 /* Just opens a file, mangling a file name.
44 * The name consists of the following parts:
46 * @arg basename The basis of the name telling about the content.
50 static FILE *text_open (const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
52 int len = strlen(basename), i, j;
53 char *fname; /* filename to put the vcg information in */
55 if (!basename) assert(basename);
56 if (!suffix1) suffix1 = "";
57 if (!suffix2) suffix2 = "";
58 if (!suffix3) suffix3 = ".txt";
60 /* open file for vcg graph */
61 fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
64 for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */
65 if (basename[i] == '/') {
66 fname[j] = '@'; j++; fname[j] = '1'; j++;
67 } else if (basename[i] == '@') {
68 fname[j] = '@'; j++; fname[j] = '2'; j++;
70 fname[j] = basename[i]; j++;
74 strcat (fname, suffix1); /* append file suffix */
75 strcat (fname, suffix2); /* append file suffix */
76 strcat (fname, suffix3); /* append the .txt suffix */
78 F = fopen (fname, "w"); /* open file for writing */
87 int dump_irnode_to_file(FILE *F, ir_node *n) {
92 dump_node_opcode(F, n);
93 fprintf(F, " %ld\n", get_irn_node_nr(n));
95 if (opt_dump_pointer_values_to_info)
96 fprintf (F, " addr: %p \n", (void *)n);
97 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
98 fprintf (F, " visited: %ld \n", get_irn_visited(n));
100 if (irg != get_const_code_irg())
101 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
103 if (get_irn_pinned(n) == op_pin_state_floats &&
104 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
105 fprintf(F, " node was pinned in ");
106 dump_node_opcode(F, get_nodes_block(n));
107 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
110 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
111 /* show all predecessor nodes */
112 fprintf(F, " pred nodes: \n");
115 dump_node_opcode(F, get_nodes_block(n));
116 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
118 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
119 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
120 dump_node_opcode(F, get_irn_intra_n(n, i));
121 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
124 fprintf(F, " Private Attributes:\n");
126 if ((get_irp_ip_view_state() != ip_view_no)
127 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
128 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
129 fprintf(F, " inter pred nodes: \n");
130 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
131 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
132 dump_node_opcode(F, get_irn_inter_n(n, i));
133 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
137 if (is_fragile_op(n)) {
138 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
139 /* not dumped: frag array */
142 /* This is not nice, output it as a marker in the predecessor list. */
143 if ((get_irn_op(n) == op_Block) ||
144 (get_irn_op(n) == op_Phi) ||
145 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
146 fprintf(F, " backedges:");
148 for (i = 0; i < get_irn_arity(n); i++)
149 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
153 /* Loop node. Someone else please tell me what's wrong ... */
154 if (get_irn_loop(n)) {
155 ir_loop *loop = get_irn_loop(n);
157 fprintf(F, " in loop %d with depth %d\n",
158 get_loop_loop_nr(loop), get_loop_depth(loop));
163 switch (get_irn_opcode(n)) {
165 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
166 fprintf(F, " dominator info: output not implemented\n");
167 /* not dumped: graph_arr */
168 /* not dumped: mature */
171 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
172 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
173 for (i = 0; i < get_method_n_params(tp); ++i)
174 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
175 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
176 ir_node *sbl = get_nodes_block(n);
177 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
178 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
179 for (i = 0; i < n_cfgpreds; ++i) {
180 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
181 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
182 get_irg_dump_name(get_irn_irg(cfgpred)));
187 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
188 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
191 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
192 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
195 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
198 entity *ent = get_Sel_entity(n);
201 fprintf(F, " Selecting entity of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
202 fprintf(F, " from entity of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
205 fprintf(F, " <NULL entity>\n");
210 type *tp = get_Call_type(n);
211 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
212 if(get_unknown_type() != tp) {
213 for (i = 0; i < get_method_n_params(tp); ++i)
214 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
215 for (i = 0; i < get_method_n_ress(tp); ++i)
216 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
218 if (Call_has_callees(n)) {
219 fprintf(F, " possible callees: \n");
220 for (i = 0; i < get_Call_n_callees(n); i++) {
221 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
225 case iro_CallBegin: {
226 ir_node *call = get_CallBegin_call(n);
227 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
228 if (Call_has_callees(call)) {
229 fprintf(F, " possible callees: \n");
230 for (i = 0; i < get_Call_n_callees(call); i++) {
231 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
236 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
239 if (!get_interprocedural_view()) {
240 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
241 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
242 for (i = 0; i < get_method_n_ress(tp); ++i)
243 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
247 type *tp = get_Const_type(n);
248 assert(tp != firm_none_type);
249 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
252 switch(get_SymConst_kind(n)) {
253 case symconst_addr_name:
254 fprintf(F, " kind: addr_name\n");
255 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
257 case symconst_addr_ent:
258 fprintf(F, " kind: addr_ent\n");
259 fprintf(F, " entity: ");
260 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
262 case symconst_type_tag:
263 fprintf(F, " kind: type_tag\n");
264 fprintf(F, " type: ");
265 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
268 fprintf(F, " kind: size\n");
269 fprintf(F, " type: ");
270 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
273 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
276 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
277 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
280 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
283 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
289 if (get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_consistent ||
290 get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_inconsistent )
291 if (get_irn_typeinfo_type(n) != firm_none_type)
292 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
299 void dump_irnode(ir_node *n) {
300 dump_irnode_to_file(stdout, n);
304 void dump_graph_to_file(FILE *F, ir_graph *irg) {
305 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
308 void dump_graph(ir_graph *g) {
309 dump_graph_to_file(stdout, g);
312 static void dump_node_to_graph_file(ir_node *n, void *env) {
313 FILE *F = (FILE *)env;
315 dump_irnode_to_file(F, n);
319 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
320 const char *basename = get_irg_dump_name(irg);
323 F = text_open (basename, suffix, "", ".txt");
325 dump_graph_to_file(F, irg);
327 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
333 int addr_is_alloc(ir_node *acc) {
334 ir_node *addr = NULL;
337 addr = get_memop_ptr(acc);
339 assert(get_irn_op(acc) == op_Call);
340 addr = get_Call_ptr(acc);
343 addr_op = get_irn_opcode(addr);
345 while (addr_op != iro_Alloc) {
349 addr = get_Sel_ptr(addr);
352 addr = get_Cast_op(addr);
355 addr = get_Proj_pred(addr);
370 assert(0 && "unexpected address node");
372 addr_op = get_irn_opcode(addr);
375 /* In addition, the alloc must be in the same loop. */
380 #define X(a) case a: fprintf(F, #a); break
381 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
385 assert(is_entity(ent));
386 owner = get_entity_owner(ent);
387 type = get_entity_type(ent);
388 if (verbosity & dump_verbosity_onlynames) {
389 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
390 get_entity_name(ent), get_entity_nr(ent));
394 if (verbosity & dump_verbosity_entattrs) {
395 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
396 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
397 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
399 if (is_class_type(get_entity_owner(ent))) {
400 if (get_entity_n_overwrites(ent) > 0) {
401 fprintf(F, "%s overwrites:\n", prefix);
402 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
403 entity *ov = get_entity_overwrites(ent, i);
404 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
405 get_type_name(get_entity_owner(ov)));
408 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
410 if (get_entity_n_overwrittenby(ent) > 0) {
411 fprintf(F, "%s overwritten by:\n", prefix);
412 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
413 entity *ov = get_entity_overwrittenby(ent, i);
414 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
415 get_type_name(get_entity_owner(ov)));
418 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
422 fprintf(F, "%s allocation: ", prefix);
423 switch (get_entity_allocation(ent)) {
424 X(allocation_dynamic);
425 X(allocation_automatic);
426 X(allocation_static);
427 X(allocation_parameter);
430 fprintf(F, "\n%s visibility: ", prefix);
431 switch (get_entity_visibility(ent)) {
433 X(visibility_external_visible);
434 X(visibility_external_allocated);
437 fprintf(F, "\n%s variability: ", prefix);
438 switch (get_entity_variability(ent)) {
439 X(variability_uninitialized);
440 X(variability_initialized);
441 X(variability_part_constant);
442 X(variability_constant);
445 } else { /* no entattrs */
446 fprintf(F, "%s(%3d) %*s: %s", prefix,
447 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
448 if (is_method_type(get_entity_type(ent))) fprintf(F, "(...)");
450 if (verbosity & dump_verbosity_accessStats) {
451 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
452 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
453 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
458 if (verbosity & dump_verbosity_entconsts) {
459 if (get_entity_variability(ent) != variability_uninitialized) {
460 if (is_atomic_entity(ent)) {
461 fprintf(F, "%s atomic value: ", prefix);
462 dump_node_opcode(F, get_atomic_ent_value(ent));
464 fprintf(F, "%s compound values:", prefix);
465 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
466 compound_graph_path *path = get_compound_ent_value_path(ent, i);
467 entity *ent0 = get_compound_graph_path_node(path, 0);
468 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
469 if (get_type_state(type) == layout_fixed)
470 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
471 fprintf(F, "%s", get_entity_name(ent0));
472 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
473 entity *node = get_compound_graph_path_node(path, j);
474 fprintf(F, ".%s", get_entity_name(node));
475 if (is_array_type(get_entity_owner(node)))
476 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
479 dump_node_opcode(F, get_compound_ent_value(ent, i));
486 if (verbosity & dump_verbosity_entattrs) {
487 fprintf(F, "%s volatility: ", prefix);
488 switch (get_entity_volatility(ent)) {
489 X(volatility_non_volatile);
490 X(volatility_is_volatile);
493 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
494 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
495 fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
496 if (is_method_type(get_entity_type(ent))) {
497 if (get_entity_irg(ent)) /* can be null */ {
498 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
499 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
500 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
501 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
504 fprintf(F, "\n%s irg = NULL", prefix);
510 if (verbosity & dump_verbosity_accessStats) {
511 int n_acc = get_entity_n_accesses(ent);
515 int max_LA_freq = -1;
516 int max_SA_freq = -1;
522 /* Find maximal depth */
523 for (i = 0; i < n_acc; ++i) {
524 ir_node *acc = get_entity_access(ent, i);
525 int depth = get_weighted_loop_depth(acc);
526 max_depth = (depth > max_depth) ? depth : max_depth ;
529 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
531 S_freq = L_freq + 1*max_depth;
532 LA_freq = L_freq + 2*max_depth;
533 SA_freq = L_freq + 3*max_depth;
535 for (i = 0; i < n_acc; ++i) {
536 ir_node *acc = get_entity_access(ent, i);
537 int depth = get_weighted_loop_depth(acc);
538 assert(depth < max_depth);
539 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
541 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
542 if (addr_is_alloc(acc)) {
544 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
546 } else if (get_irn_op(acc) == op_Store) {
548 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
549 if (addr_is_alloc(acc)) {
551 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
558 if (max_L_freq >= 0) {
561 fprintf(F, "%s Load Stats", prefix);
562 for (i = 0; i <= max_L_freq; ++i) {
564 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
571 if (max_LA_freq >= 0) {
572 //fprintf(F, "%s LoadA Stats", prefix);
574 for (i = 0; i <= max_LA_freq; ++i) {
576 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
583 if (max_S_freq >= 0) {
586 fprintf(F, "%s Store Stats", prefix);
587 for (i = 0; i <= max_S_freq; ++i) {
589 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
596 if (max_SA_freq >= 0) {
597 //fprintf(F, "%s StoreAStats", prefix);
599 for (i = 0; i <= max_SA_freq; ++i) {
601 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
609 /* free allocated space */
616 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
617 dump_entity_to_file_prefix (F, ent, "", verbosity);
621 void dump_entity (entity *ent) {
622 dump_entity_to_file(stdout, ent, dump_verbosity_max);
625 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
626 int *max_disp, int disp[], const char *comma) {
627 int i, max_depth = 0;
628 int n_acc = get_entity_n_accesses(ent);
631 int max_LA_freq = -1;
632 int max_SA_freq = -1;
638 /* Find maximal depth */
639 for (i = 0; i < n_acc; ++i) {
640 ir_node *acc = get_entity_access(ent, i);
641 int depth = get_weighted_loop_depth(acc);
642 max_depth = (depth > max_depth) ? depth : max_depth ;
645 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
647 S_freq = L_freq + 1*max_depth;
648 LA_freq = L_freq + 2*max_depth;
649 SA_freq = L_freq + 3*max_depth;
651 for (i = 0; i < n_acc; ++i) {
652 ir_node *acc = get_entity_access(ent, i);
653 int depth = get_weighted_loop_depth(acc);
654 assert(depth < max_depth);
655 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
657 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
658 if (addr_is_alloc(acc)) {
660 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
662 if (get_entity_allocation(ent) == allocation_static) {
664 *max_disp = (depth > *max_disp) ? depth : *max_disp;
666 } else if (get_irn_op(acc) == op_Store) {
668 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
669 if (addr_is_alloc(acc)) {
671 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
673 if (get_entity_allocation(ent) == allocation_static) {
681 if (get_entity_allocation(ent) != allocation_static) {
683 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
685 if (max_L_freq >= 0) {
686 fprintf(F, "%s Load", comma);
687 for (i = 0; i <= max_L_freq; ++i) {
688 fprintf(F, "%s %d", comma, L_freq[i]);
691 if (max_S_freq >= 0) {
692 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
693 fprintf(F, "%s Store", comma);
694 for (i = 0; i <= max_S_freq; ++i) {
695 fprintf(F, "%s %d", comma, S_freq[i]);
703 /* A fast hack to dump a csv. */
704 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
707 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
709 if (!is_class_type(tp)) return;
711 if (verbosity & dump_verbosity_accessStats) {
712 int i, n_all = get_type_n_allocations(tp);
715 /* Find maximal depth */
716 for (i = 0; i < n_all; ++i) {
717 ir_node *all = get_type_allocation(tp, i);
718 int depth = get_weighted_loop_depth(all);
719 max_depth = (depth > max_depth) ? depth : max_depth ;
722 freq = xcalloc(2 * max_depth, sizeof(freq[0]));
724 disp = freq + max_depth;
726 for (i = 0; i < n_all; ++i) {
727 ir_node *all = get_type_allocation(tp, i);
728 int depth = get_weighted_loop_depth(all);
729 assert(depth < max_depth);
731 max_freq = (depth > max_freq) ? depth : max_freq;
732 assert(get_irn_op(all) == op_Alloc);
735 fprintf(F, "%s ", get_type_name(tp));
736 fprintf(F, "%s Alloc ", comma);
739 for (i = 0; i <= max_freq; ++i) {
740 fprintf(F, "%s %d", comma, freq[i]);
745 for (i = 0; i < get_class_n_members(tp); ++i) {
746 entity *mem = get_class_member(tp, i);
747 if (((verbosity & dump_verbosity_methods) && is_method_type(get_entity_type(mem))) ||
748 ((verbosity & dump_verbosity_fields) && !is_method_type(get_entity_type(mem))) ) {
749 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
754 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
755 for (i = 0; i <= max_disp; ++i) {
756 fprintf(F, "%s %d", comma, disp[i]);
761 /* free allocated space */
766 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
769 if ((is_class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
770 if ((is_struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
771 if ((is_union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
772 if ((is_array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
773 if ((is_pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
774 if ((is_method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
775 if ((is_primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
776 if ((is_enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
778 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
779 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
781 switch (get_type_tpop_code(tp)) {
784 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
785 fprintf(F, "\n members: \n");
787 for (i = 0; i < get_class_n_members(tp); ++i) {
788 entity *mem = get_class_member(tp, i);
789 if (((verbosity & dump_verbosity_methods) && is_method_type(get_entity_type(mem))) ||
790 ((verbosity & dump_verbosity_fields) && !is_method_type(get_entity_type(mem))) ) {
791 dump_entity_to_file_prefix(F, mem, " ", verbosity);
794 if (verbosity & dump_verbosity_typeattrs) {
795 fprintf(F, " supertypes: ");
796 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
797 type *stp = get_class_supertype(tp, i);
798 fprintf(F, "\n %s", get_type_name(stp));
800 fprintf(F, "\n subtypes: ");
801 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
802 type *stp = get_class_subtype(tp, i);
803 fprintf(F, "\n %s", get_type_name(stp));
806 fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
812 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
813 for (i = 0; i < get_compound_n_members(tp); ++i) {
814 entity *mem = get_compound_member(tp, i);
815 if (verbosity & dump_verbosity_fields) {
816 dump_entity_to_file_prefix(F, mem, " ", verbosity);
822 if (verbosity & dump_verbosity_typeattrs) {
823 type *tt = get_pointer_points_to_type(tp);
824 fprintf(F, "\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt));
830 if (verbosity & dump_verbosity_typeattrs) {
831 fprintf(F, ": details not implemented\n");
835 if (verbosity & dump_verbosity_accessStats) {
836 int n_all = get_type_n_allocations(tp);
841 /* Find maximal depth */
842 for (i = 0; i < n_all; ++i) {
843 ir_node *all = get_type_allocation(tp, i);
844 int depth = get_weighted_loop_depth(all);
845 max_depth = (depth > max_depth) ? depth : max_depth ;
848 freq = xcalloc(max_depth, sizeof(freq[0]));
850 for (i = 0; i < n_all; ++i) {
851 ir_node *all = get_type_allocation(tp, i);
852 int depth = get_weighted_loop_depth(all);
853 assert(depth < max_depth);
855 max_freq = (depth > max_freq) ? depth : max_freq;
856 assert(get_irn_op(all) == op_Alloc);
862 fprintf(F, " Alloc Stats");
863 for (i = 0; i <= max_freq; ++i) {
864 fprintf(F, "%c %d x A%d", comma, freq[i], i);
876 void dump_type(type *tp) {
877 dump_type_to_file (stdout, tp, dump_verbosity_max);
881 void dump_types_as_text(unsigned verbosity, const char *suffix) {
882 const char *basename;
884 int i, n_types = get_irp_n_types();
886 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
887 F = text_open (basename, suffix, "-types", ".txt");
889 if (verbosity & dump_verbosity_csv) {
890 CSV = text_open (basename, suffix, "-types", ".csv");
891 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
894 for (i = 0; i < n_types; ++i) {
895 type *t = get_irp_type(i);
897 if (is_jack_rts_class(t)) continue;
899 dump_type_to_file(F, t, verbosity);
900 if (verbosity & dump_verbosity_csv) {
901 dump_typecsv_to_file(CSV, t, verbosity, "");
906 if (verbosity & dump_verbosity_csv) fclose (CSV);