3 * File name: ir/ir/irdump.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.
19 #include "firm_common_t.h"
21 #include "irgraph_t.h"
27 #include "field_temperature.h"
29 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
31 int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
34 /* Just opens a file, mangling a file name.
36 * The name consists of the following parts:
38 * @arg basename The basis of the name telling about the content.
42 static FILE *text_open (const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
44 int len = strlen(basename), i, j;
45 char *fname; /* filename to put the vcg information in */
47 if (!basename) assert(basename);
48 if (!suffix1) suffix1 = "";
49 if (!suffix2) suffix2 = "";
50 if (!suffix3) suffix3 = ".txt";
52 /* open file for vcg graph */
53 fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
56 for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */
57 if (basename[i] == '/') {
58 fname[j] = '@'; j++; fname[j] = '1'; j++;
59 } else if (basename[i] == '@') {
60 fname[j] = '@'; j++; fname[j] = '2'; j++;
62 fname[j] = basename[i]; j++;
66 strcat (fname, suffix1); /* append file suffix */
67 strcat (fname, suffix2); /* append file suffix */
68 strcat (fname, suffix3); /* append the .txt suffix */
70 F = fopen (fname, "w"); /* open file for writing */
79 int dump_irnode_to_file(FILE *F, ir_node *n) {
84 dump_node_opcode(F, n);
85 fprintf(F, " %ld\n", get_irn_node_nr(n));
87 if (opt_dump_pointer_values_to_info)
88 fprintf (F, " addr: %p \n", (void *)n);
89 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
90 fprintf (F, " visited: %ld \n", get_irn_visited(n));
92 if (irg != get_const_code_irg())
93 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
95 if (get_irn_pinned(n) == op_pin_state_floats &&
96 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
97 fprintf(F, " node was pinned in ");
98 dump_node_opcode(F, get_nodes_block(n));
99 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
102 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
103 /* show all predecessor nodes */
104 fprintf(F, " pred nodes: \n");
107 dump_node_opcode(F, get_nodes_block(n));
108 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
110 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
111 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
112 dump_node_opcode(F, get_irn_intra_n(n, i));
113 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
116 fprintf(F, " Private Attributes:\n");
118 if ((get_irp_ip_view_state() != ip_view_no)
119 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
120 fprintf(F, " inter arity: %d", get_irn_inter_arity(n));
121 fprintf(F, " inter pred nodes: \n");
122 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
123 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
124 dump_node_opcode(F, get_irn_inter_n(n, i));
125 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
129 if (is_fragile_op(n)) {
130 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
131 /* not dumped: frag array */
134 /* This is not nice, output it as a marker in the predecessor list. */
135 if ((get_irn_op(n) == op_Block) ||
136 (get_irn_op(n) == op_Phi) ||
137 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
138 fprintf(F, " backedges:");
140 for (i = 0; i < get_irn_arity(n); i++)
141 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
145 /* Loop node Someone else please tell me what's wrong ...
146 if (get_irn_loop(n)) {
147 ir_loop *loop = get_irn_loop(n);
149 fprintf(F, " in loop %d with depth %d\n",
150 get_loop_loop_nr(loop), get_loop_depth(loop));
155 switch (get_irn_opcode(n)) {
157 fprintf(F, " block visited: %ld", get_Block_block_visited(n));
158 fprintf(F, " dominator info: not implemented\n");
159 /* not dumped: graph_arr */
160 /* not dumped: mature */
163 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
164 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
165 for (i = 0; i < get_method_n_params(tp); ++i)
166 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
167 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
168 ir_node *sbl = get_nodes_block(n);
169 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
170 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
171 for (i = 0; i < n_cfgpreds; ++i) {
172 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
173 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
174 get_irg_dump_name(get_irn_irg(cfgpred)));
179 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
180 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
183 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
184 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
187 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
190 entity *ent = get_Sel_entity(n);
193 fprintf(F, " Selecting entity of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
194 fprintf(F, " from entity of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
197 fprintf(F, " <NULL entity>\n");
202 type *tp = get_Call_type(n);
203 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
204 if(get_unknown_type() != tp) {
205 for (i = 0; i < get_method_n_params(tp); ++i)
206 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
207 for (i = 0; i < get_method_n_ress(tp); ++i)
208 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
210 if (Call_has_callees(n)) {
211 fprintf(F, " possible callees: \n");
212 for (i = 0; i < get_Call_n_callees(n); i++) {
213 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
217 case iro_CallBegin: {
218 ir_node *call = get_CallBegin_call(n);
219 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
220 if (Call_has_callees(call)) {
221 fprintf(F, " possible callees: \n");
222 for (i = 0; i < get_Call_n_callees(call); i++) {
223 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
228 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
231 if (!get_interprocedural_view()) {
232 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
233 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
234 for (i = 0; i < get_method_n_ress(tp); ++i)
235 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
239 type *tp = get_Const_type(n);
240 assert(tp != none_type);
241 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
244 switch(get_SymConst_kind(n)) {
245 case symconst_addr_name:
246 fprintf(F, " kind: addr_name\n");
247 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
249 case symconst_addr_ent:
250 fprintf(F, " kind: addr_ent\n");
251 fprintf(F, " entity: ");
252 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
254 case symconst_type_tag:
255 fprintf(F, " kind: type_tag\n");
256 fprintf(F, " type: ");
257 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
260 fprintf(F, " kind: size\n");
261 fprintf(F, " type: ");
262 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
265 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
268 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
269 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
272 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
275 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
281 if (get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_consistent ||
282 get_irg_typeinfo_state(get_irn_irg(n)) == irg_typeinfo_inconsistent )
283 if (get_irn_typeinfo_type(n) != none_type)
284 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
291 void dump_irnode(ir_node *n) {
292 dump_irnode_to_file(stdout, n);
296 void dump_graph_to_file(FILE *F, ir_graph *irg) {
297 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
300 void dump_graph(ir_graph *g) {
301 dump_graph_to_file(stdout, g);
304 static void dump_node_to_graph_file(ir_node *n, void *env) {
305 FILE *F = (FILE *)env;
307 dump_irnode_to_file(F, n);
311 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
312 const char *basename = get_irg_dump_name(irg);
315 F = text_open (basename, suffix, "", ".txt");
317 dump_graph_to_file(F, irg);
319 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
325 int addr_is_alloc(ir_node *acc) {
326 ir_node *addr = NULL;
329 addr = get_memop_ptr(acc);
331 assert(get_irn_op(acc) == op_Call);
332 addr = get_Call_ptr(acc);
335 addr_op = get_irn_opcode(addr);
337 while (addr_op != iro_Alloc) {
341 addr = get_Sel_ptr(addr);
344 addr = get_Cast_op(addr);
347 addr = get_Proj_pred(addr);
362 assert(0 && "unexpected address node");
364 addr_op = get_irn_opcode(addr);
367 /* In addition, the alloc must be in the same loop. */
372 #define X(a) case a: fprintf(F, #a); break
373 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
375 assert(ent && ent->kind == k_entity);
376 type *owner = get_entity_owner(ent);
377 type *type = get_entity_type(ent);
378 if (verbosity & dump_verbosity_onlynames) {
379 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
380 get_entity_name(ent), get_entity_nr(ent));
384 if (verbosity & dump_verbosity_entattrs) {
385 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
386 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
387 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
389 if (is_class_type(get_entity_owner(ent))) {
390 if (get_entity_n_overwrites(ent) > 0) {
391 fprintf(F, "%s overwrites:\n", prefix);
392 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
393 entity *ov = get_entity_overwrites(ent, i);
394 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
395 get_type_name(get_entity_owner(ov)));
398 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
400 if (get_entity_n_overwrittenby(ent) > 0) {
401 fprintf(F, "%s overwritten by:\n", prefix);
402 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
403 entity *ov = get_entity_overwrittenby(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 Is not overwritten by other entities. \n", prefix);
412 fprintf(F, "%s allocation: ", prefix);
413 switch (get_entity_allocation(ent)) {
414 X(allocation_dynamic);
415 X(allocation_automatic);
416 X(allocation_static);
417 X(allocation_parameter);
420 fprintf(F, "\n%s visibility: ", prefix);
421 switch (get_entity_visibility(ent)) {
423 X(visibility_external_visible);
424 X(visibility_external_allocated);
427 fprintf(F, "\n%s variability: ", prefix);
428 switch (get_entity_variability(ent)) {
429 X(variability_uninitialized);
430 X(variability_initialized);
431 X(variability_part_constant);
432 X(variability_constant);
435 } else { /* no entattrs */
436 fprintf(F, "%s(%3d) %*s: %s", prefix,
437 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
438 if (is_method_type(get_entity_type(ent))) fprintf(F, "(...)");
440 if (verbosity & dump_verbosity_accessStats) {
441 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
442 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
443 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
448 if (verbosity & dump_verbosity_entconsts) {
449 if (get_entity_variability(ent) != variability_uninitialized) {
450 if (is_atomic_entity(ent)) {
451 fprintf(F, "%s atomic value: ", prefix);
452 dump_node_opcode(F, get_atomic_ent_value(ent));
454 fprintf(F, "%s compound values:", prefix);
455 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
456 compound_graph_path *path = get_compound_ent_value_path(ent, i);
457 entity *ent0 = get_compound_graph_path_node(path, 0);
458 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
459 if (get_type_state(type) == layout_fixed)
460 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
461 fprintf(F, "%s", get_entity_name(ent0));
462 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
463 entity *node = get_compound_graph_path_node(path, j);
464 fprintf(F, ".%s", get_entity_name(node));
465 if (is_array_type(get_entity_owner(node)))
466 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
469 dump_node_opcode(F, get_compound_ent_value(ent, i));
476 if (verbosity & dump_verbosity_entattrs) {
477 fprintf(F, "%s volatility: ", prefix);
478 switch (get_entity_volatility(ent)) {
479 X(volatility_non_volatile);
480 X(volatility_is_volatile);
483 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
484 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
485 fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
486 if (is_method_type(get_entity_type(ent))) {
487 if (get_entity_irg(ent)) /* can be null */ {
488 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
489 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
490 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
491 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
494 fprintf(F, "\n%s irg = NULL", prefix);
500 if (verbosity & dump_verbosity_accessStats) {
501 int n_acc = get_entity_n_accesses(ent);
504 /* Find maximal depth */
505 for (i = 0; i < n_acc; ++i) {
506 ir_node *acc = get_entity_access(ent, i);
507 int depth = get_weighted_loop_depth(acc);
508 max_depth = (depth > max_depth) ? depth : max_depth ;
511 int L_freq[max_depth];
513 int S_freq[max_depth];
515 int LA_freq[max_depth];
516 int max_LA_freq = -1;
517 int SA_freq[max_depth];
518 int max_SA_freq = -1;
519 for (i = 0; i < max_depth; ++i) {
526 for (i = 0; i < n_acc; ++i) {
527 ir_node *acc = get_entity_access(ent, i);
528 int depth = get_weighted_loop_depth(acc);
529 assert(depth < max_depth);
530 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
532 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
533 if (addr_is_alloc(acc)) {
535 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
537 } else if (get_irn_op(acc) == op_Store) {
539 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
540 if (addr_is_alloc(acc)) {
542 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
549 if (max_L_freq >= 0) {
550 fprintf(F, "%s Load Stats", prefix);
552 for (i = 0; i <= max_L_freq; ++i) {
554 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
561 if (max_LA_freq >= 0) {
562 //fprintf(F, "%s LoadA Stats", prefix);
564 for (i = 0; i <= max_LA_freq; ++i) {
566 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
573 if (max_S_freq >= 0) {
574 fprintf(F, "%s Store Stats", prefix);
576 for (i = 0; i <= max_S_freq; ++i) {
578 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
585 if (max_SA_freq >= 0) {
586 //fprintf(F, "%s StoreAStats", prefix);
588 for (i = 0; i <= max_SA_freq; ++i) {
590 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
602 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
603 dump_entity_to_file_prefix (F, ent, "", verbosity);
607 void dump_entity (entity *ent) {
608 dump_entity_to_file(stdout, ent, dump_verbosity_max);
611 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
612 int *max_disp, int disp[], const char *comma) {
613 int i, max_depth = 0;
614 int n_acc = get_entity_n_accesses(ent);
616 /* Find maximal depth */
617 for (i = 0; i < n_acc; ++i) {
618 ir_node *acc = get_entity_access(ent, i);
619 int depth = get_weighted_loop_depth(acc);
620 max_depth = (depth > max_depth) ? depth : max_depth ;
623 int L_freq[max_depth];
625 int S_freq[max_depth];
627 int LA_freq[max_depth];
628 int max_LA_freq = -1;
629 int SA_freq[max_depth];
630 int max_SA_freq = -1;
631 for (i = 0; i < max_depth; ++i) {
638 for (i = 0; i < n_acc; ++i) {
639 ir_node *acc = get_entity_access(ent, i);
640 int depth = get_weighted_loop_depth(acc);
641 assert(depth < max_depth);
642 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
644 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
645 if (addr_is_alloc(acc)) {
647 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
649 if (get_entity_allocation(ent) == allocation_static) {
651 *max_disp = (depth > *max_disp) ? depth : *max_disp;
653 } else if (get_irn_op(acc) == op_Store) {
655 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
656 if (addr_is_alloc(acc)) {
658 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
660 if (get_entity_allocation(ent) == allocation_static) {
668 if (get_entity_allocation(ent) == allocation_static) return;
670 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
672 if (max_L_freq >= 0) {
673 fprintf(F, "%s Load", comma);
674 for (i = 0; i <= max_L_freq; ++i) {
675 fprintf(F, "%s %d", comma, L_freq[i]);
678 if (max_S_freq >= 0) {
679 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
680 fprintf(F, "%s Store", comma);
681 for (i = 0; i <= max_S_freq; ++i) {
682 fprintf(F, "%s %d", comma, S_freq[i]);
688 /* A fast hack to dump a csv. */
689 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
690 if (!is_class_type(tp)) return;
692 if (verbosity & dump_verbosity_accessStats) {
693 int i, n_all = get_type_n_allocations(tp);
696 /* Find maximal depth */
697 for (i = 0; i < n_all; ++i) {
698 ir_node *all = get_type_allocation(tp, i);
699 int depth = get_weighted_loop_depth(all);
700 max_depth = (depth > max_depth) ? depth : max_depth ;
705 int disp[max_depth]; /* Accumulated accesses to static members: dispatch table. */
707 for (i = 0; i < max_depth; ++i) {
712 for (i = 0; i < n_all; ++i) {
713 ir_node *all = get_type_allocation(tp, i);
714 int depth = get_weighted_loop_depth(all);
715 assert(depth < max_depth);
717 max_freq = (depth > max_freq) ? depth : max_freq;
718 assert(get_irn_op(all) == op_Alloc);
721 fprintf(F, "%s ", get_type_name(tp));
722 fprintf(F, "%s Alloc ", comma);
725 for (i = 0; i <= max_freq; ++i) {
726 fprintf(F, "%s %d", comma, freq[i]);
731 for (i = 0; i < get_class_n_members(tp); ++i) {
732 entity *mem = get_class_member(tp, i);
733 if (((verbosity & dump_verbosity_methods) && is_method_type(get_entity_type(mem))) ||
734 ((verbosity & dump_verbosity_fields) && !is_method_type(get_entity_type(mem))) ) {
735 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
740 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
741 for (i = 0; i <= max_disp; ++i) {
742 fprintf(F, "%s %d", comma, disp[i]);
749 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
752 if ((is_class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
753 if ((is_struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
754 if ((is_union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
755 if ((is_array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
756 if ((is_pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
757 if ((is_method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
758 if ((is_primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
759 if ((is_enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
761 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
762 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
764 switch (get_type_tpop_code(tp)) {
767 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
768 fprintf(F, "\n members: \n");
770 for (i = 0; i < get_class_n_members(tp); ++i) {
771 entity *mem = get_class_member(tp, i);
772 if (((verbosity & dump_verbosity_methods) && is_method_type(get_entity_type(mem))) ||
773 ((verbosity & dump_verbosity_fields) && !is_method_type(get_entity_type(mem))) ) {
774 dump_entity_to_file_prefix(F, mem, " ", verbosity);
777 if (verbosity & dump_verbosity_typeattrs) {
778 fprintf(F, " supertypes: ");
779 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
780 type *stp = get_class_supertype(tp, i);
781 fprintf(F, "\n %s", get_type_name(stp));
783 fprintf(F, "\n subtypes: ");
784 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
785 type *stp = get_class_subtype(tp, i);
786 fprintf(F, "\n %s", get_type_name(stp));
789 fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
795 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
796 for (i = 0; i < get_compound_n_members(tp); ++i) {
797 entity *mem = get_compound_member(tp, i);
798 if (verbosity & dump_verbosity_fields) {
799 dump_entity_to_file_prefix(F, mem, " ", verbosity);
805 if (verbosity & dump_verbosity_typeattrs) {
806 type *tt = get_pointer_points_to_type(tp);
807 fprintf(F, "\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt));
813 if (verbosity & dump_verbosity_typeattrs) {
814 fprintf(F, ": details not implemented\n");
818 if (verbosity & dump_verbosity_accessStats) {
819 int n_all = get_type_n_allocations(tp);
822 /* Find maximal depth */
823 for (i = 0; i < n_all; ++i) {
824 ir_node *all = get_type_allocation(tp, i);
825 int depth = get_weighted_loop_depth(all);
826 max_depth = (depth > max_depth) ? depth : max_depth ;
831 for (i = 0; i < max_depth; ++i) freq[i] = 0;
833 for (i = 0; i < n_all; ++i) {
834 ir_node *all = get_type_allocation(tp, i);
835 int depth = get_weighted_loop_depth(all);
836 assert(depth < max_depth);
838 max_freq = (depth > max_freq) ? depth : max_freq;
839 assert(get_irn_op(all) == op_Alloc);
843 fprintf(F, " Alloc Stats");
845 for (i = 0; i <= max_freq; ++i) {
846 fprintf(F, "%c %d x A%d", comma, freq[i], i);
856 void dump_type(type *tp) {
857 dump_type_to_file (stdout, tp, dump_verbosity_max);
861 void dump_types_as_text(unsigned verbosity, const char *suffix) {
862 const char *basename;
864 int i, n_types = get_irp_n_types();
866 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
867 F = text_open (basename, suffix, "-types", ".txt");
869 if (verbosity & dump_verbosity_csv) {
870 CSV = text_open (basename, suffix, "-types", ".csv");
871 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
874 for (i = 0; i < n_types; ++i) {
875 type *t = get_irp_type(i);
877 if (is_jack_rts_class(t)) continue;
879 dump_type_to_file(F, t, verbosity);
880 if (verbosity & dump_verbosity_csv) {
881 dump_typecsv_to_file(CSV, t, verbosity, "");
886 if (verbosity & dump_verbosity_csv) fclose (CSV);