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 %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
203 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
206 fprintf(F, " <NULL entity>\n");
211 type *tp = get_Call_type(n);
212 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
213 if(get_unknown_type() != tp) {
214 for (i = 0; i < get_method_n_params(tp); ++i)
215 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
216 for (i = 0; i < get_method_n_ress(tp); ++i)
217 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
219 if (Call_has_callees(n)) {
220 fprintf(F, " possible callees: \n");
221 for (i = 0; i < get_Call_n_callees(n); i++) {
222 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
226 case iro_CallBegin: {
227 ir_node *call = get_CallBegin_call(n);
228 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
229 if (Call_has_callees(call)) {
230 fprintf(F, " possible callees: \n");
231 for (i = 0; i < get_Call_n_callees(call); i++) {
232 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
237 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
240 if (!get_interprocedural_view()) {
241 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
242 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
243 for (i = 0; i < get_method_n_ress(tp); ++i)
244 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
248 type *tp = get_Const_type(n);
249 assert(tp != firm_none_type);
250 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
253 switch(get_SymConst_kind(n)) {
254 case symconst_addr_name:
255 fprintf(F, " kind: addr_name\n");
256 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
258 case symconst_addr_ent:
259 fprintf(F, " kind: addr_ent\n");
260 fprintf(F, " entity: ");
261 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
263 case symconst_type_tag:
264 fprintf(F, " kind: type_tag\n");
265 fprintf(F, " type: ");
266 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
269 fprintf(F, " kind: size\n");
270 fprintf(F, " type: ");
271 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
274 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
277 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
278 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
281 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
284 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
290 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
291 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
292 if (get_irn_typeinfo_type(n) != firm_none_type)
293 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
300 void dump_irnode(ir_node *n) {
301 dump_irnode_to_file(stdout, n);
305 void dump_graph_to_file(FILE *F, ir_graph *irg) {
306 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
309 void dump_graph(ir_graph *g) {
310 dump_graph_to_file(stdout, g);
313 static void dump_node_to_graph_file(ir_node *n, void *env) {
314 FILE *F = (FILE *)env;
316 dump_irnode_to_file(F, n);
320 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
321 const char *basename = get_irg_dump_name(irg);
324 F = text_open (basename, suffix, "", ".txt");
326 dump_graph_to_file(F, irg);
328 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
334 int addr_is_alloc(ir_node *acc) {
335 ir_node *addr = NULL;
338 addr = get_memop_ptr(acc);
340 assert(get_irn_op(acc) == op_Call);
341 addr = get_Call_ptr(acc);
344 addr_op = get_irn_opcode(addr);
346 while (addr_op != iro_Alloc) {
350 addr = get_Sel_ptr(addr);
353 addr = get_Cast_op(addr);
356 addr = get_Proj_pred(addr);
371 //assert(0 && "unexpected address node");
374 addr_op = get_irn_opcode(addr);
377 /* In addition, the alloc must be in the same loop. */
382 #define X(a) case a: fprintf(F, #a); break
383 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
387 assert(is_entity(ent));
388 owner = get_entity_owner(ent);
389 type = get_entity_type(ent);
390 if (verbosity & dump_verbosity_onlynames) {
391 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
392 get_entity_name(ent), get_entity_nr(ent));
396 if (verbosity & dump_verbosity_entattrs) {
397 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
398 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
399 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
401 if (is_Class_type(get_entity_owner(ent))) {
402 if (get_entity_n_overwrites(ent) > 0) {
403 fprintf(F, "%s overwrites:\n", prefix);
404 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
405 entity *ov = get_entity_overwrites(ent, i);
406 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
407 get_type_name(get_entity_owner(ov)));
410 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
412 if (get_entity_n_overwrittenby(ent) > 0) {
413 fprintf(F, "%s overwritten by:\n", prefix);
414 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
415 entity *ov = get_entity_overwrittenby(ent, i);
416 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
417 get_type_name(get_entity_owner(ov)));
420 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
424 fprintf(F, "%s allocation: ", prefix);
425 switch (get_entity_allocation(ent)) {
426 X(allocation_dynamic);
427 X(allocation_automatic);
428 X(allocation_static);
429 X(allocation_parameter);
432 fprintf(F, "\n%s visibility: ", prefix);
433 switch (get_entity_visibility(ent)) {
435 X(visibility_external_visible);
436 X(visibility_external_allocated);
439 fprintf(F, "\n%s variability: ", prefix);
440 switch (get_entity_variability(ent)) {
441 X(variability_uninitialized);
442 X(variability_initialized);
443 X(variability_part_constant);
444 X(variability_constant);
447 } else { /* no entattrs */
448 fprintf(F, "%s(%3d) %*s: %s", prefix,
449 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
450 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
452 if (verbosity & dump_verbosity_accessStats) {
453 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
454 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
455 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
460 if (verbosity & dump_verbosity_entconsts) {
461 if (get_entity_variability(ent) != variability_uninitialized) {
462 if (is_atomic_entity(ent)) {
463 fprintf(F, "%s atomic value: ", prefix);
464 dump_node_opcode(F, get_atomic_ent_value(ent));
466 fprintf(F, "%s compound values:", prefix);
467 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
468 compound_graph_path *path = get_compound_ent_value_path(ent, i);
469 entity *ent0 = get_compound_graph_path_node(path, 0);
470 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
471 if (get_type_state(type) == layout_fixed)
472 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
473 fprintf(F, "%s", get_entity_name(ent0));
474 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
475 entity *node = get_compound_graph_path_node(path, j);
476 fprintf(F, ".%s", get_entity_name(node));
477 if (is_Array_type(get_entity_owner(node)))
478 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
481 dump_node_opcode(F, get_compound_ent_value(ent, i));
488 if (verbosity & dump_verbosity_entattrs) {
489 fprintf(F, "%s volatility: ", prefix);
490 switch (get_entity_volatility(ent)) {
491 X(volatility_non_volatile);
492 X(volatility_is_volatile);
495 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
496 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
497 fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
498 if (is_Method_type(get_entity_type(ent))) {
499 if (get_entity_irg(ent)) /* can be null */ {
500 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
501 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
502 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
503 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
506 fprintf(F, "\n%s irg = NULL", prefix);
512 if (verbosity & dump_verbosity_accessStats) {
514 int n_acc = get_entity_n_accesses(ent);
518 int max_LA_freq = -1;
519 int max_SA_freq = -1;
525 /* Find maximal depth */
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 max_depth = (depth > max_depth) ? depth : max_depth ;
532 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
534 S_freq = L_freq + 1*max_depth;
535 LA_freq = L_freq + 2*max_depth;
536 SA_freq = L_freq + 3*max_depth;
538 for (i = 0; i < n_acc; ++i) {
539 ir_node *acc = get_entity_access(ent, i);
540 int depth = get_weighted_loop_depth(acc);
541 assert(depth < max_depth);
542 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
544 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
545 if (addr_is_alloc(acc)) {
547 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
549 } else if (get_irn_op(acc) == op_Store) {
551 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
552 if (addr_is_alloc(acc)) {
554 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
561 if (max_L_freq >= 0) {
564 fprintf(F, "%s Load Stats", prefix);
565 for (i = 0; i <= max_L_freq; ++i) {
567 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
574 if (max_LA_freq >= 0) {
575 //fprintf(F, "%s LoadA Stats", prefix);
577 for (i = 0; i <= max_LA_freq; ++i) {
579 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
586 if (max_S_freq >= 0) {
589 fprintf(F, "%s Store Stats", prefix);
590 for (i = 0; i <= max_S_freq; ++i) {
592 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
599 if (max_SA_freq >= 0) {
600 //fprintf(F, "%s StoreAStats", prefix);
602 for (i = 0; i <= max_SA_freq; ++i) {
604 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
612 /* free allocated space */
615 if (get_trouts_state() != outs_none) {
616 if (is_Method_type(get_entity_type(ent))) {
617 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
618 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
620 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
621 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
629 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
630 dump_entity_to_file_prefix (F, ent, "", verbosity);
634 void dump_entity (entity *ent) {
635 dump_entity_to_file(stdout, ent, dump_verbosity_max);
638 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
639 int *max_disp, int disp[], const char *comma) {
641 #if 0 /* Outputs loop depth of all occurences. */
642 int n_acc = get_entity_n_accesses(ent);
645 int max_LA_freq = -1;
646 int max_SA_freq = -1;
651 int i, max_depth = 0;
653 /* Find maximal depth */
654 for (i = 0; i < n_acc; ++i) {
655 ir_node *acc = get_entity_access(ent, i);
656 int depth = get_weighted_loop_depth(acc);
657 max_depth = (depth > max_depth) ? depth : max_depth ;
660 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
662 S_freq = L_freq + 1*max_depth;
663 LA_freq = L_freq + 2*max_depth;
664 SA_freq = L_freq + 3*max_depth;
666 for (i = 0; i < n_acc; ++i) {
667 ir_node *acc = get_entity_access(ent, i);
668 int depth = get_weighted_loop_depth(acc);
669 assert(depth <= max_depth);
670 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
672 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
673 if (addr_is_alloc(acc)) {
675 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
677 if (get_entity_allocation(ent) == allocation_static) {
679 *max_disp = (depth > *max_disp) ? depth : *max_disp;
681 } else if (get_irn_op(acc) == op_Store) {
683 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
684 if (addr_is_alloc(acc)) {
686 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
688 if (get_entity_allocation(ent) == allocation_static) {
696 if (get_entity_allocation(ent) != allocation_static) {
698 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
700 if (max_L_freq >= 0) {
701 fprintf(F, "%s Load", comma);
702 for (i = 0; i <= max_L_freq; ++i) {
703 fprintf(F, "%s %d", comma, L_freq[i]);
706 if (max_S_freq >= 0) {
707 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
708 fprintf(F, "%s Store", comma);
709 for (i = 0; i <= max_S_freq; ++i) {
710 fprintf(F, "%s %d", comma, S_freq[i]);
718 if (get_entity_allocation(ent) != allocation_static) {
719 if (is_Method_type(get_entity_type(ent))) return;
721 /* Output the entity name. */
722 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
724 if (get_trouts_state() != outs_none) {
725 if (is_Method_type(get_entity_type(ent))) {
726 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
727 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
729 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
730 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
738 /* A fast hack to dump a csv. */
739 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
742 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
744 if (verbosity & dump_verbosity_accessStats) {
746 #if 0 /* Outputs loop depth of all occurences. */
749 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
750 int n_all = get_type_n_allocs(tp);
752 /* Find maximal depth */
753 for (i = 0; i < n_all; ++i) {
754 ir_node *all = get_type_alloc(tp, i);
755 int depth = get_weighted_loop_depth(all);
756 max_depth = (depth > max_depth) ? depth : max_depth ;
759 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
761 disp = freq + max_depth;
763 for (i = 0; i < n_all; ++i) {
764 ir_node *all = get_type_alloc(tp, i);
765 int depth = get_weighted_loop_depth(all);
766 assert(depth <= max_depth);
768 max_freq = (depth > max_freq) ? depth : max_freq;
769 assert(get_irn_op(all) == op_Alloc);
772 fprintf(F, "%s ", get_type_name(tp));
773 fprintf(F, "%s Alloc ", comma);
776 for (i = 0; i <= max_freq; ++i) {
777 fprintf(F, "%s %d", comma, freq[i]);
782 for (i = 0; i < get_class_n_members(tp); ++i) {
783 entity *mem = get_class_member(tp, i);
784 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
785 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
786 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
787 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
793 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
794 for (i = 0; i <= max_disp; ++i) {
795 fprintf(F, "%s %d", comma, disp[i]);
800 /* free allocated space */
804 #define DISP_TAB_SUFFIX "__disp_tab"
805 if (get_trouts_state() != outs_none) {
806 assert(strlen(get_type_name(tp)) < 1024);
807 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
808 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
809 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
812 for (i = 0; i < get_class_n_members(tp); ++i) {
813 entity *mem = get_class_member(tp, i);
814 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
815 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
816 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
817 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
824 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
827 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
828 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
829 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
830 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
831 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
832 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
833 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
834 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
836 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
837 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
839 switch (get_type_tpop_code(tp)) {
842 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
843 fprintf(F, "\n members: \n");
845 for (i = 0; i < get_class_n_members(tp); ++i) {
846 entity *mem = get_class_member(tp, i);
847 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
848 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
849 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
850 dump_entity_to_file_prefix(F, mem, " ", verbosity);
854 if (verbosity & dump_verbosity_typeattrs) {
855 fprintf(F, " supertypes: ");
856 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
857 type *stp = get_class_supertype(tp, i);
858 fprintf(F, "\n %s", get_type_name(stp));
860 fprintf(F, "\n subtypes: ");
861 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
862 type *stp = get_class_subtype(tp, i);
863 fprintf(F, "\n %s", get_type_name(stp));
866 fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
872 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
873 for (i = 0; i < get_compound_n_members(tp); ++i) {
874 entity *mem = get_compound_member(tp, i);
875 if (verbosity & dump_verbosity_fields) {
876 dump_entity_to_file_prefix(F, mem, " ", verbosity);
882 if (verbosity & dump_verbosity_typeattrs) {
883 type *tt = get_pointer_points_to_type(tp);
884 fprintf(F, "\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt));
890 if (verbosity & dump_verbosity_typeattrs) {
891 fprintf(F, ": details not implemented\n");
895 if (verbosity & dump_verbosity_accessStats) {
897 int n_all = get_type_n_allocs(tp);
902 /* Find maximal depth */
903 for (i = 0; i < n_all; ++i) {
904 ir_node *all = get_type_alloc(tp, i);
905 int depth = get_weighted_loop_depth(all);
906 max_depth = (depth > max_depth) ? depth : max_depth ;
909 freq = xcalloc(max_depth+1, sizeof(freq[0]));
911 for (i = 0; i < n_all; ++i) {
912 ir_node *all = get_type_alloc(tp, i);
913 int depth = get_weighted_loop_depth(all);
914 assert(depth <= max_depth);
916 max_freq = (depth > max_freq) ? depth : max_freq;
917 assert(get_irn_op(all) == op_Alloc);
923 fprintf(F, " Alloc Stats");
924 for (i = 0; i <= max_freq; ++i) {
925 fprintf(F, "%c %d x A%d", comma, freq[i], i);
933 if (get_trouts_state() != outs_none) {
934 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
935 if (is_Class_type(tp)) {
936 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
937 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
938 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
939 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
948 void dump_type(type *tp) {
949 dump_type_to_file (stdout, tp, dump_verbosity_max);
953 void dump_types_as_text(unsigned verbosity, const char *suffix) {
954 const char *basename;
955 FILE *F, *CSV = NULL;
956 int i, n_types = get_irp_n_types();
958 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
959 F = text_open (basename, suffix, "-types", ".txt");
961 if (verbosity & dump_verbosity_csv) {
962 CSV = text_open (basename, suffix, "-types", ".csv");
963 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
966 for (i = 0; i < n_types; ++i) {
967 type *t = get_irp_type(i);
969 //if (is_jack_rts_class(t)) continue;
971 dump_type_to_file(F, t, verbosity);
973 dump_typecsv_to_file(CSV, t, verbosity, "");
978 if (CSV) fclose (CSV);
982 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
983 const char *basename;
984 FILE *F, *CSV = NULL;
985 type *g = get_glob_type();
986 int i, n_mems = get_class_n_members(g);
988 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
989 F = text_open (basename, suffix, "-globals", ".txt");
991 if (verbosity & dump_verbosity_csv) {
992 CSV = text_open (basename, suffix, "-types", ".csv");
993 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
996 for (i = 0; i < n_mems; ++i) {
997 entity *e = get_class_member(g, i);
999 dump_entity_to_file(F, e, verbosity);
1001 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1006 if (CSV) fclose (CSV);