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"
36 #include "field_temperature.h"
38 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
40 int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
43 /* Just opens a file, mangling a file name.
45 * The name consists of the following parts:
47 * @arg basename The basis of the name telling about the content.
51 static FILE *text_open (const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
53 int len = strlen(basename), i, j;
54 char *fname; /* filename to put the vcg information in */
56 if (!basename) assert(basename);
57 if (!suffix1) suffix1 = "";
58 if (!suffix2) suffix2 = "";
59 if (!suffix3) suffix3 = ".txt";
61 /* open file for vcg graph */
62 fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
65 for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */
66 if (basename[i] == '/') {
67 fname[j] = '@'; j++; fname[j] = '1'; j++;
68 } else if (basename[i] == '@') {
69 fname[j] = '@'; j++; fname[j] = '2'; j++;
71 fname[j] = basename[i]; j++;
75 strcat (fname, suffix1); /* append file suffix */
76 strcat (fname, suffix2); /* append file suffix */
77 strcat (fname, suffix3); /* append the .txt suffix */
79 F = fopen (fname, "w"); /* open file for writing */
88 int dump_irnode_to_file(FILE *F, ir_node *n) {
93 dump_node_opcode(F, n);
94 fprintf(F, " %ld\n", get_irn_node_nr(n));
96 if (opt_dump_pointer_values_to_info)
97 fprintf (F, " addr: %p \n", (void *)n);
98 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
99 fprintf (F, " visited: %ld \n", get_irn_visited(n));
100 irg = get_irn_irg(n);
101 if (irg != get_const_code_irg())
102 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
104 if (get_irn_pinned(n) == op_pin_state_floats &&
105 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
106 fprintf(F, " node was pinned in ");
107 dump_node_opcode(F, get_nodes_block(n));
108 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
111 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
112 /* show all predecessor nodes */
113 fprintf(F, " pred nodes: \n");
116 dump_node_opcode(F, get_nodes_block(n));
117 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
119 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
120 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
121 dump_node_opcode(F, get_irn_intra_n(n, i));
122 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
125 fprintf(F, " Private Attributes:\n");
127 if ((get_irp_ip_view_state() != ip_view_no)
128 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
129 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
130 fprintf(F, " inter pred nodes: \n");
131 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
132 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
133 dump_node_opcode(F, get_irn_inter_n(n, i));
134 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
138 if (is_fragile_op(n)) {
139 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
140 /* not dumped: frag array */
143 /* This is not nice, output it as a marker in the predecessor list. */
144 if ((get_irn_op(n) == op_Block) ||
145 (get_irn_op(n) == op_Phi) ||
146 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
147 fprintf(F, " backedges:");
149 for (i = 0; i < get_irn_arity(n); i++)
150 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
154 /* Loop node. Someone else please tell me what's wrong ... */
155 if (get_irn_loop(n)) {
156 ir_loop *loop = get_irn_loop(n);
158 fprintf(F, " in loop %d with depth %d\n",
159 get_loop_loop_nr(loop), get_loop_depth(loop));
164 switch (get_irn_opcode(n)) {
166 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
167 fprintf(F, " dominator info: output not implemented\n");
168 /* not dumped: graph_arr */
169 /* not dumped: mature */
172 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
173 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
174 for (i = 0; i < get_method_n_params(tp); ++i)
175 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
176 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
177 ir_node *sbl = get_nodes_block(n);
178 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
179 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
180 for (i = 0; i < n_cfgpreds; ++i) {
181 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
182 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
183 get_irg_dump_name(get_irn_irg(cfgpred)));
188 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
189 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
192 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
193 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
196 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
199 entity *ent = get_Sel_entity(n);
202 fprintf(F, " Selecting entity of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
203 fprintf(F, " from entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
204 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
207 fprintf(F, " <NULL entity>\n");
212 type *tp = get_Call_type(n);
213 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
214 if(get_unknown_type() != tp) {
215 for (i = 0; i < get_method_n_params(tp); ++i)
216 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
217 for (i = 0; i < get_method_n_ress(tp); ++i)
218 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
220 if (Call_has_callees(n)) {
221 fprintf(F, " possible callees: \n");
222 for (i = 0; i < get_Call_n_callees(n); i++) {
223 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
227 case iro_CallBegin: {
228 ir_node *call = get_CallBegin_call(n);
229 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
230 if (Call_has_callees(call)) {
231 fprintf(F, " possible callees: \n");
232 for (i = 0; i < get_Call_n_callees(call); i++) {
233 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
238 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
241 if (!get_interprocedural_view()) {
242 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
243 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
244 for (i = 0; i < get_method_n_ress(tp); ++i)
245 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
249 type *tp = get_Const_type(n);
250 assert(tp != firm_none_type);
251 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
254 switch(get_SymConst_kind(n)) {
255 case symconst_addr_name:
256 fprintf(F, " kind: addr_name\n");
257 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
259 case symconst_addr_ent:
260 fprintf(F, " kind: addr_ent\n");
261 fprintf(F, " entity: ");
262 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
264 case symconst_type_tag:
265 fprintf(F, " kind: type_tag\n");
266 fprintf(F, " type: ");
267 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
270 fprintf(F, " kind: size\n");
271 fprintf(F, " type: ");
272 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
275 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
278 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
279 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
282 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
285 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
291 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
292 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
293 if (get_irn_typeinfo_type(n) != firm_none_type)
294 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
301 void dump_irnode(ir_node *n) {
302 dump_irnode_to_file(stdout, n);
306 void dump_graph_to_file(FILE *F, ir_graph *irg) {
307 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
310 void dump_graph(ir_graph *g) {
311 dump_graph_to_file(stdout, g);
314 static void dump_node_to_graph_file(ir_node *n, void *env) {
315 FILE *F = (FILE *)env;
317 dump_irnode_to_file(F, n);
321 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
322 const char *basename = get_irg_dump_name(irg);
325 F = text_open (basename, suffix, "", ".txt");
327 dump_graph_to_file(F, irg);
329 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
335 int addr_is_alloc(ir_node *acc) {
336 ir_node *addr = NULL;
339 addr = get_memop_ptr(acc);
341 assert(get_irn_op(acc) == op_Call);
342 addr = get_Call_ptr(acc);
345 addr_op = get_irn_opcode(addr);
347 while (addr_op != iro_Alloc) {
351 addr = get_Sel_ptr(addr);
354 addr = get_Cast_op(addr);
357 addr = get_Proj_pred(addr);
372 //assert(0 && "unexpected address node");
375 addr_op = get_irn_opcode(addr);
378 /* In addition, the alloc must be in the same loop. */
383 #define X(a) case a: fprintf(F, #a); break
384 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
388 assert(is_entity(ent));
389 owner = get_entity_owner(ent);
390 type = get_entity_type(ent);
391 if (verbosity & dump_verbosity_onlynames) {
392 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
393 get_entity_name(ent), get_entity_nr(ent));
397 if (verbosity & dump_verbosity_entattrs) {
398 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
399 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
400 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
402 if (is_Class_type(get_entity_owner(ent))) {
403 if (get_entity_n_overwrites(ent) > 0) {
404 fprintf(F, "%s overwrites:\n", prefix);
405 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
406 entity *ov = get_entity_overwrites(ent, i);
407 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
408 get_type_name(get_entity_owner(ov)));
411 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
413 if (get_entity_n_overwrittenby(ent) > 0) {
414 fprintf(F, "%s overwritten by:\n", prefix);
415 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
416 entity *ov = get_entity_overwrittenby(ent, i);
417 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
418 get_type_name(get_entity_owner(ov)));
421 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
425 fprintf(F, "%s allocation: ", prefix);
426 switch (get_entity_allocation(ent)) {
427 X(allocation_dynamic);
428 X(allocation_automatic);
429 X(allocation_static);
430 X(allocation_parameter);
433 fprintf(F, "\n%s visibility: ", prefix);
434 switch (get_entity_visibility(ent)) {
436 X(visibility_external_visible);
437 X(visibility_external_allocated);
440 fprintf(F, "\n%s variability: ", prefix);
441 switch (get_entity_variability(ent)) {
442 X(variability_uninitialized);
443 X(variability_initialized);
444 X(variability_part_constant);
445 X(variability_constant);
448 } else { /* no entattrs */
449 fprintf(F, "%s(%3d) %*s: %s", prefix,
450 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
451 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
453 if (verbosity & dump_verbosity_accessStats) {
454 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
455 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
456 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
461 if (verbosity & dump_verbosity_entconsts) {
462 if (get_entity_variability(ent) != variability_uninitialized) {
463 if (is_atomic_entity(ent)) {
464 fprintf(F, "%s atomic value: ", prefix);
465 dump_node_opcode(F, get_atomic_ent_value(ent));
467 fprintf(F, "%s compound values:", prefix);
468 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
469 compound_graph_path *path = get_compound_ent_value_path(ent, i);
470 entity *ent0 = get_compound_graph_path_node(path, 0);
471 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
472 if (get_type_state(type) == layout_fixed)
473 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
474 fprintf(F, "%s", get_entity_name(ent));
475 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
476 entity *node = get_compound_graph_path_node(path, j);
477 fprintf(F, ".%s", get_entity_name(node));
478 if (is_Array_type(get_entity_owner(node)))
479 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
482 dump_node_opcode(F, get_compound_ent_value(ent, i));
489 if (verbosity & dump_verbosity_entattrs) {
490 fprintf(F, "%s volatility: ", prefix);
491 switch (get_entity_volatility(ent)) {
492 X(volatility_non_volatile);
493 X(volatility_is_volatile);
496 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
497 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
498 fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
499 if (is_Method_type(get_entity_type(ent))) {
500 if (get_entity_irg(ent)) /* can be null */ {
501 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
502 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
503 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
504 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
507 fprintf(F, "\n%s irg = NULL", prefix);
513 if (verbosity & dump_verbosity_accessStats) {
515 int n_acc = get_entity_n_accesses(ent);
519 int max_LA_freq = -1;
520 int max_SA_freq = -1;
526 /* Find maximal depth */
527 for (i = 0; i < n_acc; ++i) {
528 ir_node *acc = get_entity_access(ent, i);
529 int depth = get_weighted_loop_depth(acc);
530 max_depth = (depth > max_depth) ? depth : max_depth ;
533 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
535 S_freq = L_freq + 1*max_depth;
536 LA_freq = L_freq + 2*max_depth;
537 SA_freq = L_freq + 3*max_depth;
539 for (i = 0; i < n_acc; ++i) {
540 ir_node *acc = get_entity_access(ent, i);
541 int depth = get_weighted_loop_depth(acc);
542 assert(depth < max_depth);
543 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
545 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
546 if (addr_is_alloc(acc)) {
548 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
550 } else if (get_irn_op(acc) == op_Store) {
552 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
553 if (addr_is_alloc(acc)) {
555 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
562 if (max_L_freq >= 0) {
565 fprintf(F, "%s Load Stats", prefix);
566 for (i = 0; i <= max_L_freq; ++i) {
568 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
575 if (max_LA_freq >= 0) {
576 //fprintf(F, "%s LoadA Stats", prefix);
578 for (i = 0; i <= max_LA_freq; ++i) {
580 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
587 if (max_S_freq >= 0) {
590 fprintf(F, "%s Store Stats", prefix);
591 for (i = 0; i <= max_S_freq; ++i) {
593 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
600 if (max_SA_freq >= 0) {
601 //fprintf(F, "%s StoreAStats", prefix);
603 for (i = 0; i <= max_SA_freq; ++i) {
605 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
613 /* free allocated space */
616 if (get_trouts_state() != outs_none) {
617 if (is_Method_type(get_entity_type(ent))) {
618 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
619 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
621 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
622 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
630 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
631 dump_entity_to_file_prefix (F, ent, "", verbosity);
635 void dump_entity (entity *ent) {
636 dump_entity_to_file(stdout, ent, dump_verbosity_max);
639 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
640 int *max_disp, int disp[], const char *comma) {
642 #if 0 /* Outputs loop depth of all occurences. */
643 int n_acc = get_entity_n_accesses(ent);
646 int max_LA_freq = -1;
647 int max_SA_freq = -1;
652 int i, max_depth = 0;
654 /* Find maximal depth */
655 for (i = 0; i < n_acc; ++i) {
656 ir_node *acc = get_entity_access(ent, i);
657 int depth = get_weighted_loop_depth(acc);
658 max_depth = (depth > max_depth) ? depth : max_depth ;
661 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
663 S_freq = L_freq + 1*max_depth;
664 LA_freq = L_freq + 2*max_depth;
665 SA_freq = L_freq + 3*max_depth;
667 for (i = 0; i < n_acc; ++i) {
668 ir_node *acc = get_entity_access(ent, i);
669 int depth = get_weighted_loop_depth(acc);
670 assert(depth <= max_depth);
671 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
673 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
674 if (addr_is_alloc(acc)) {
676 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
678 if (get_entity_allocation(ent) == allocation_static) {
680 *max_disp = (depth > *max_disp) ? depth : *max_disp;
682 } else if (get_irn_op(acc) == op_Store) {
684 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
685 if (addr_is_alloc(acc)) {
687 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
689 if (get_entity_allocation(ent) == allocation_static) {
697 if (get_entity_allocation(ent) != allocation_static) {
699 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
701 if (max_L_freq >= 0) {
702 fprintf(F, "%s Load", comma);
703 for (i = 0; i <= max_L_freq; ++i) {
704 fprintf(F, "%s %d", comma, L_freq[i]);
707 if (max_S_freq >= 0) {
708 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
709 fprintf(F, "%s Store", comma);
710 for (i = 0; i <= max_S_freq; ++i) {
711 fprintf(F, "%s %d", comma, S_freq[i]);
719 if (get_entity_allocation(ent) != allocation_static) {
720 if (is_Method_type(get_entity_type(ent))) return;
722 /* Output the entity name. */
723 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
725 if (get_trouts_state() != outs_none) {
726 if (is_Method_type(get_entity_type(ent))) {
727 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
728 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
730 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
731 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
739 /* A fast hack to dump a csv. */
740 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
743 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
745 if (verbosity & dump_verbosity_accessStats) {
747 #if 0 /* Outputs loop depth of all occurences. */
750 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
751 int n_all = get_type_n_allocs(tp);
753 /* Find maximal depth */
754 for (i = 0; i < n_all; ++i) {
755 ir_node *all = get_type_alloc(tp, i);
756 int depth = get_weighted_loop_depth(all);
757 max_depth = (depth > max_depth) ? depth : max_depth ;
760 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
762 disp = freq + max_depth;
764 for (i = 0; i < n_all; ++i) {
765 ir_node *all = get_type_alloc(tp, i);
766 int depth = get_weighted_loop_depth(all);
767 assert(depth <= max_depth);
769 max_freq = (depth > max_freq) ? depth : max_freq;
770 assert(get_irn_op(all) == op_Alloc);
773 fprintf(F, "%s ", get_type_name(tp));
774 fprintf(F, "%s Alloc ", comma);
777 for (i = 0; i <= max_freq; ++i) {
778 fprintf(F, "%s %d", comma, freq[i]);
783 for (i = 0; i < get_class_n_members(tp); ++i) {
784 entity *mem = get_class_member(tp, i);
785 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
786 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
787 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
788 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
794 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
795 for (i = 0; i <= max_disp; ++i) {
796 fprintf(F, "%s %d", comma, disp[i]);
801 /* free allocated space */
805 #define DISP_TAB_SUFFIX "__disp_tab"
806 if (get_trouts_state() != outs_none) {
807 assert(strlen(get_type_name(tp)) < 1024);
808 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
809 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
810 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
813 for (i = 0; i < get_class_n_members(tp); ++i) {
814 entity *mem = get_class_member(tp, i);
815 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
816 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
817 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
818 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
825 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
828 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
829 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
830 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
831 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
832 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
833 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
834 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
835 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
837 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
838 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
840 switch (get_type_tpop_code(tp)) {
843 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
844 fprintf(F, "\n members: \n");
846 for (i = 0; i < get_class_n_members(tp); ++i) {
847 entity *mem = get_class_member(tp, i);
848 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
849 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
850 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
851 dump_entity_to_file_prefix(F, mem, " ", verbosity);
855 if (verbosity & dump_verbosity_typeattrs) {
856 fprintf(F, " supertypes: ");
857 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
858 type *stp = get_class_supertype(tp, i);
859 fprintf(F, "\n %s", get_type_name(stp));
861 fprintf(F, "\n subtypes: ");
862 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
863 type *stp = get_class_subtype(tp, i);
864 fprintf(F, "\n %s", get_type_name(stp));
867 fprintf(F, "\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
873 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
874 for (i = 0; i < get_compound_n_members(tp); ++i) {
875 entity *mem = get_compound_member(tp, i);
876 if (verbosity & dump_verbosity_fields) {
877 dump_entity_to_file_prefix(F, mem, " ", verbosity);
883 if (verbosity & dump_verbosity_typeattrs) {
885 type *elem_tp = get_array_element_type(tp);
887 fprintf(F, "\n array ");
889 n_dim = get_array_n_dimensions(tp);
890 for (i = 0; i < n_dim; ++i) {
891 ir_node *lower, *upper;
893 lower = get_array_lower_bound(tp, i);
894 upper = get_array_upper_bound(tp, i);
898 if (get_irn_op(lower) == op_Const)
899 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
901 dump_node_opcode(F, lower);
902 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
905 if (get_irn_op(upper) == op_Const)
906 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
908 dump_node_opcode(F, upper);
909 fprintf(F, " %ld]", get_irn_node_nr(upper));
912 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
914 fprintf(F, "\n order: ");
915 for (i = 0; i < n_dim; ++i)
916 fprintf(F, "<%d>", get_array_order(tp, i));
920 if (verbosity & dump_verbosity_fields) {
921 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
928 if (verbosity & dump_verbosity_typeattrs) {
929 type *tt = get_pointer_points_to_type(tp);
930 fprintf(F, "\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt));
941 if (verbosity & dump_verbosity_typeattrs) {
942 fprintf(F, ": details not implemented\n");
946 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
947 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
948 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
949 if (is_atomic_type(tp))
950 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
951 fprintf(F, " dbg info: %p,", (void *)get_type_dbg_info(tp));
953 if (verbosity & dump_verbosity_accessStats) {
955 int n_all = get_type_n_allocs(tp);
960 /* Find maximal depth */
961 for (i = 0; i < n_all; ++i) {
962 ir_node *all = get_type_alloc(tp, i);
963 int depth = get_weighted_loop_depth(all);
964 max_depth = (depth > max_depth) ? depth : max_depth ;
967 freq = xcalloc(max_depth+1, sizeof(freq[0]));
969 for (i = 0; i < n_all; ++i) {
970 ir_node *all = get_type_alloc(tp, i);
971 int depth = get_weighted_loop_depth(all);
972 assert(depth <= max_depth);
974 max_freq = (depth > max_freq) ? depth : max_freq;
975 assert(get_irn_op(all) == op_Alloc);
981 fprintf(F, " Alloc Stats");
982 for (i = 0; i <= max_freq; ++i) {
983 fprintf(F, "%c %d x A%d", comma, freq[i], i);
991 if (get_trouts_state() != outs_none) {
992 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
993 if (is_Class_type(tp)) {
994 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
995 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
996 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
997 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1006 void dump_type(type *tp) {
1007 dump_type_to_file (stdout, tp, dump_verbosity_max);
1011 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1012 const char *basename;
1013 FILE *F, *CSV = NULL;
1014 int i, n_types = get_irp_n_types();
1016 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1017 F = text_open (basename, suffix, "-types", ".txt");
1019 if (verbosity & dump_verbosity_csv) {
1020 CSV = text_open (basename, suffix, "-types", ".csv");
1021 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1024 for (i = 0; i < n_types; ++i) {
1025 type *t = get_irp_type(i);
1027 //if (is_jack_rts_class(t)) continue;
1029 dump_type_to_file(F, t, verbosity);
1031 dump_typecsv_to_file(CSV, t, verbosity, "");
1036 if (CSV) fclose (CSV);
1040 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1041 const char *basename;
1042 FILE *F, *CSV = NULL;
1043 type *g = get_glob_type();
1044 int i, n_mems = get_class_n_members(g);
1046 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1047 F = text_open (basename, suffix, "-globals", ".txt");
1049 if (verbosity & dump_verbosity_csv) {
1050 CSV = text_open (basename, suffix, "-types", ".csv");
1051 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1054 for (i = 0; i < n_mems; ++i) {
1055 entity *e = get_class_member(g, i);
1057 dump_entity_to_file(F, e, verbosity);
1059 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1064 if (CSV) fclose (CSV);