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"
37 #include "field_temperature.h"
39 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
41 /* Just opens a file, mangling a file name.
43 * The name consists of the following parts:
45 * @arg basename The basis of the name telling about the content.
49 static FILE *text_open (const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
51 int len = strlen(basename), i, j;
52 char *fname; /* filename to put the vcg information in */
54 if (!basename) assert(basename);
55 if (!suffix1) suffix1 = "";
56 if (!suffix2) suffix2 = "";
57 if (!suffix3) suffix3 = ".txt";
59 /* open file for vcg graph */
60 fname = malloc (strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for excapes. */
63 for (i = 0; i < len; ++i) { /* replase '/' in the name: escape by @. */
64 if (basename[i] == '/') {
65 fname[j] = '@'; j++; fname[j] = '1'; j++;
66 } else if (basename[i] == '@') {
67 fname[j] = '@'; j++; fname[j] = '2'; j++;
69 fname[j] = basename[i]; j++;
73 strcat (fname, suffix1); /* append file suffix */
74 strcat (fname, suffix2); /* append file suffix */
75 strcat (fname, suffix3); /* append the .txt suffix */
77 F = fopen (fname, "w"); /* open file for writing */
86 int dump_irnode_to_file(FILE *F, ir_node *n) {
91 dump_node_opcode(F, n);
92 fprintf(F, " %ld\n", get_irn_node_nr(n));
94 if (opt_dump_pointer_values_to_info)
95 fprintf (F, " addr: %p \n", (void *)n);
96 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
97 fprintf (F, " visited: %ld \n", get_irn_visited(n));
99 if (irg != get_const_code_irg())
100 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
102 if (get_irn_pinned(n) == op_pin_state_floats &&
103 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
104 fprintf(F, " node was pinned in ");
105 dump_node_opcode(F, get_nodes_block(n));
106 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
109 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
110 /* show all predecessor nodes */
111 fprintf(F, " pred nodes: \n");
114 dump_node_opcode(F, get_nodes_block(n));
115 fprintf(F, " %ld\n", get_irn_node_nr(get_nodes_block(n)));
117 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
118 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
119 dump_node_opcode(F, get_irn_intra_n(n, i));
120 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
123 fprintf(F, " Private Attributes:\n");
125 if ((get_irp_ip_view_state() != ip_view_no)
126 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
127 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
128 fprintf(F, " inter pred nodes: \n");
129 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
130 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
131 dump_node_opcode(F, get_irn_inter_n(n, i));
132 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
136 if (is_fragile_op(n)) {
137 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
138 /* not dumped: frag array */
141 /* This is not nice, output it as a marker in the predecessor list. */
142 if ((get_irn_op(n) == op_Block) ||
143 (get_irn_op(n) == op_Phi) ||
144 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
145 fprintf(F, " backedges:");
147 for (i = 0; i < get_irn_arity(n); i++)
148 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
152 /* Loop node. Someone else please tell me what's wrong ... */
153 if (get_irn_loop(n)) {
154 ir_loop *loop = get_irn_loop(n);
156 fprintf(F, " in loop %d with depth %d\n",
157 get_loop_loop_nr(loop), get_loop_depth(loop));
162 switch (get_irn_opcode(n)) {
164 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
165 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
166 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
167 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
168 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
171 fprintf(F, " Execution freqency statistics:\n");
172 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
173 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
174 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
175 fprintf(F, " call freqency of procedure: %8.2lf\n",
176 get_irg_method_execution_frequency(get_irn_irg(n)));
177 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
178 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
179 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
180 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
181 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
182 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
184 /* not dumped: graph_arr */
185 /* not dumped: mature */
188 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
189 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
190 for (i = 0; i < get_method_n_params(tp); ++i)
191 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
192 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
193 ir_node *sbl = get_nodes_block(n);
194 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
195 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
196 for (i = 0; i < n_cfgpreds; ++i) {
197 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
198 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
199 get_irg_dump_name(get_irn_irg(cfgpred)));
204 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
205 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
208 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
209 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
212 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
215 entity *ent = get_Sel_entity(n);
218 fprintf(F, " Selecting entity of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
219 fprintf(F, " from entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
220 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_owner(ent), &bad));
223 fprintf(F, " <NULL entity>\n");
228 type *tp = get_Call_type(n);
229 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
230 if(get_unknown_type() != tp) {
231 for (i = 0; i < get_method_n_params(tp); ++i)
232 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
233 for (i = 0; i < get_method_n_ress(tp); ++i)
234 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
236 if (Call_has_callees(n)) {
237 fprintf(F, " possible callees: \n");
238 for (i = 0; i < get_Call_n_callees(n); i++) {
239 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
243 case iro_CallBegin: {
244 ir_node *call = get_CallBegin_call(n);
245 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
246 if (Call_has_callees(call)) {
247 fprintf(F, " possible callees: \n");
248 for (i = 0; i < get_Call_n_callees(call); i++) {
249 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
254 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
257 if (!get_interprocedural_view()) {
258 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
259 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
260 for (i = 0; i < get_method_n_ress(tp); ++i)
261 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
265 type *tp = get_Const_type(n);
266 assert(tp != firm_none_type);
267 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
270 switch(get_SymConst_kind(n)) {
271 case symconst_addr_name:
272 fprintf(F, " kind: addr_name\n");
273 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
275 case symconst_addr_ent:
276 fprintf(F, " kind: addr_ent\n");
277 fprintf(F, " entity: ");
278 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
280 case symconst_type_tag:
281 fprintf(F, " kind: type_tag\n");
282 fprintf(F, " type: ");
283 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
286 fprintf(F, " kind: size\n");
287 fprintf(F, " type: ");
288 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
291 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
294 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
295 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
298 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
301 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
307 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
308 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
309 if (get_irn_typeinfo_type(n) != firm_none_type)
310 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
317 void dump_irnode(ir_node *n) {
318 dump_irnode_to_file(stdout, n);
322 void dump_graph_to_file(FILE *F, ir_graph *irg) {
323 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
326 void dump_graph(ir_graph *g) {
327 dump_graph_to_file(stdout, g);
330 static void dump_node_to_graph_file(ir_node *n, void *env) {
331 FILE *F = (FILE *)env;
333 dump_irnode_to_file(F, n);
337 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
338 const char *basename = get_irg_dump_name(irg);
341 F = text_open (basename, suffix, "", ".txt");
343 dump_graph_to_file(F, irg);
345 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
351 int addr_is_alloc(ir_node *acc) {
352 ir_node *addr = NULL;
355 addr = get_memop_ptr(acc);
357 assert(get_irn_op(acc) == op_Call);
358 addr = get_Call_ptr(acc);
361 addr_op = get_irn_opcode(addr);
363 while (addr_op != iro_Alloc) {
367 addr = get_Sel_ptr(addr);
370 addr = get_Cast_op(addr);
373 addr = get_Proj_pred(addr);
388 //assert(0 && "unexpected address node");
391 addr_op = get_irn_opcode(addr);
394 /* In addition, the alloc must be in the same loop. */
399 /** dumps something like:
401 * "prefix" "Name" (x): node1, ... node7,\n
402 * "prefix" node8, ... node15,\n
403 * "prefix" node16, node17\n
405 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
406 int (*get_entity_n_nodes)(firm_kind *ent),
407 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
409 int i, n_nodes = get_entity_n_nodes(k);
412 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
413 for (i = 0; i < n_nodes; ++i) {
415 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
416 fprintf(F, ",\n%s ", prefix);
419 fprintf(F, "%s ", comma);
420 rem = opt_dump_analysed_type_info;
421 opt_dump_analysed_type_info = 0;
422 dump_node_label(F, get_entity_node(k, i));
423 opt_dump_analysed_type_info = rem;
429 /** dumps something like:
431 * "prefix" "Name" (x): node1, ... node7,\n
432 * "prefix" node8, ... node15,\n
433 * "prefix" node16, node17\n
435 static void dump_type_list(FILE *F, type *tp, char *prefix,
436 int (*get_n_types)(type *tp),
437 type *(*get_type)(type *tp, int pos),
439 int i, n_nodes = get_n_types(tp);
442 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
443 for (i = 0; i < n_nodes; ++i) {
444 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
445 fprintf(F, ",\n%s ", prefix);
448 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
449 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
455 #define X(a) case a: fprintf(F, #a); break
456 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
460 assert(is_entity(ent));
461 owner = get_entity_owner(ent);
462 type = get_entity_type(ent);
463 if (verbosity & dump_verbosity_onlynames) {
464 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
465 get_entity_name(ent), get_entity_nr(ent));
469 if (verbosity & dump_verbosity_entattrs) {
470 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
471 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
472 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
474 if (is_Class_type(get_entity_owner(ent))) {
475 if (get_entity_n_overwrites(ent) > 0) {
476 fprintf(F, "%s overwrites:\n", prefix);
477 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
478 entity *ov = get_entity_overwrites(ent, i);
479 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
480 get_type_name(get_entity_owner(ov)));
483 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
485 if (get_entity_n_overwrittenby(ent) > 0) {
486 fprintf(F, "%s overwritten by:\n", prefix);
487 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
488 entity *ov = get_entity_overwrittenby(ent, i);
489 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
490 get_type_name(get_entity_owner(ov)));
493 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
496 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
498 fprintf(F, "%s transitive overwrites:\n", prefix);
499 for (ov = get_entity_trans_overwrites_first(ent);
501 ov = get_entity_trans_overwrites_next(ent)) {
502 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
503 get_type_name(get_entity_owner(ov)));
505 fprintf(F, "%s transitive overwritten by:\n", prefix);
506 for (ov = get_entity_trans_overwrittenby_first(ent);
508 ov = get_entity_trans_overwrittenby_next(ent)) {
509 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
510 get_type_name(get_entity_owner(ov)));
515 fprintf(F, "%s allocation: ", prefix);
516 switch (get_entity_allocation(ent)) {
517 X(allocation_dynamic);
518 X(allocation_automatic);
519 X(allocation_static);
520 X(allocation_parameter);
523 fprintf(F, "\n%s visibility: ", prefix);
524 switch (get_entity_visibility(ent)) {
526 X(visibility_external_visible);
527 X(visibility_external_allocated);
530 fprintf(F, "\n%s variability: ", prefix);
531 switch (get_entity_variability(ent)) {
532 X(variability_uninitialized);
533 X(variability_initialized);
534 X(variability_part_constant);
535 X(variability_constant);
538 } else { /* no entattrs */
539 fprintf(F, "%s(%3d) %*s: %s", prefix,
540 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
541 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
543 if (verbosity & dump_verbosity_accessStats) {
544 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
545 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
546 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
551 if (verbosity & dump_verbosity_entconsts) {
552 if (get_entity_variability(ent) != variability_uninitialized) {
553 if (is_atomic_entity(ent)) {
554 fprintf(F, "%s atomic value: ", prefix);
555 dump_node_opcode(F, get_atomic_ent_value(ent));
557 fprintf(F, "%s compound values:", prefix);
558 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
559 compound_graph_path *path = get_compound_ent_value_path(ent, i);
560 entity *ent0 = get_compound_graph_path_node(path, 0);
561 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
562 if (get_type_state(type) == layout_fixed)
563 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
564 fprintf(F, "%s", get_entity_name(ent));
565 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
566 entity *node = get_compound_graph_path_node(path, j);
567 fprintf(F, ".%s", get_entity_name(node));
568 if (is_Array_type(get_entity_owner(node)))
569 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
572 dump_node_opcode(F, get_compound_ent_value(ent, i));
579 if (verbosity & dump_verbosity_entattrs) {
580 fprintf(F, "%s volatility: ", prefix);
581 switch (get_entity_volatility(ent)) {
582 X(volatility_non_volatile);
583 X(volatility_is_volatile);
586 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
587 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
588 fprintf(F, "\n%s offset: %d", prefix, get_entity_offset_bits(ent));
589 if (is_Method_type(get_entity_type(ent))) {
590 if (get_entity_irg(ent)) /* can be null */ {
591 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
592 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
593 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
594 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
597 fprintf(F, "\n%s irg = NULL", prefix);
603 if (get_trouts_state()) {
604 fprintf(F, "%s Entity outs:\n", prefix);
605 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
606 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
607 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
608 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
611 if (verbosity & dump_verbosity_accessStats) {
613 int n_acc = get_entity_n_accesses(ent);
617 int max_LA_freq = -1;
618 int max_SA_freq = -1;
624 /* Find maximal depth */
625 for (i = 0; i < n_acc; ++i) {
626 ir_node *acc = get_entity_access(ent, i);
627 int depth = get_weighted_loop_depth(acc);
628 max_depth = (depth > max_depth) ? depth : max_depth ;
631 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
633 S_freq = L_freq + 1*max_depth;
634 LA_freq = L_freq + 2*max_depth;
635 SA_freq = L_freq + 3*max_depth;
637 for (i = 0; i < n_acc; ++i) {
638 ir_node *acc = get_entity_access(ent, i);
639 int depth = get_weighted_loop_depth(acc);
640 assert(depth < max_depth);
641 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
643 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
644 if (addr_is_alloc(acc)) {
646 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
648 } else if (get_irn_op(acc) == op_Store) {
650 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
651 if (addr_is_alloc(acc)) {
653 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
660 if (max_L_freq >= 0) {
663 fprintf(F, "%s Load Stats", prefix);
664 for (i = 0; i <= max_L_freq; ++i) {
666 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
673 if (max_LA_freq >= 0) {
674 //fprintf(F, "%s LoadA Stats", prefix);
676 for (i = 0; i <= max_LA_freq; ++i) {
678 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
685 if (max_S_freq >= 0) {
688 fprintf(F, "%s Store Stats", prefix);
689 for (i = 0; i <= max_S_freq; ++i) {
691 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
698 if (max_SA_freq >= 0) {
699 //fprintf(F, "%s StoreAStats", prefix);
701 for (i = 0; i <= max_SA_freq; ++i) {
703 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
711 /* free allocated space */
714 if (get_trouts_state() != outs_none) {
715 if (is_Method_type(get_entity_type(ent))) {
716 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
717 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
719 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
720 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
728 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
729 dump_entity_to_file_prefix (F, ent, "", verbosity);
733 void dump_entity (entity *ent) {
734 dump_entity_to_file(stdout, ent, dump_verbosity_max);
737 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
738 int *max_disp, int disp[], const char *comma) {
740 #if 0 /* Outputs loop depth of all occurences. */
741 int n_acc = get_entity_n_accesses(ent);
744 int max_LA_freq = -1;
745 int max_SA_freq = -1;
750 int i, max_depth = 0;
752 /* Find maximal depth */
753 for (i = 0; i < n_acc; ++i) {
754 ir_node *acc = get_entity_access(ent, i);
755 int depth = get_weighted_loop_depth(acc);
756 max_depth = (depth > max_depth) ? depth : max_depth ;
759 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
761 S_freq = L_freq + 1*max_depth;
762 LA_freq = L_freq + 2*max_depth;
763 SA_freq = L_freq + 3*max_depth;
765 for (i = 0; i < n_acc; ++i) {
766 ir_node *acc = get_entity_access(ent, i);
767 int depth = get_weighted_loop_depth(acc);
768 assert(depth <= max_depth);
769 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
771 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
772 if (addr_is_alloc(acc)) {
774 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
776 if (get_entity_allocation(ent) == allocation_static) {
778 *max_disp = (depth > *max_disp) ? depth : *max_disp;
780 } else if (get_irn_op(acc) == op_Store) {
782 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
783 if (addr_is_alloc(acc)) {
785 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
787 if (get_entity_allocation(ent) == allocation_static) {
795 if (get_entity_allocation(ent) != allocation_static) {
797 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
799 if (max_L_freq >= 0) {
800 fprintf(F, "%s Load", comma);
801 for (i = 0; i <= max_L_freq; ++i) {
802 fprintf(F, "%s %d", comma, L_freq[i]);
805 if (max_S_freq >= 0) {
806 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
807 fprintf(F, "%s Store", comma);
808 for (i = 0; i <= max_S_freq; ++i) {
809 fprintf(F, "%s %d", comma, S_freq[i]);
817 if (get_entity_allocation(ent) != allocation_static) {
818 if (is_Method_type(get_entity_type(ent))) return;
820 /* Output the entity name. */
821 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
823 if (get_trouts_state() != outs_none) {
824 if (is_Method_type(get_entity_type(ent))) {
825 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
826 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
828 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
829 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
837 /* A fast hack to dump a csv. */
838 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
841 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
843 if (verbosity & dump_verbosity_accessStats) {
845 #if 0 /* Outputs loop depth of all occurences. */
848 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
849 int n_all = get_type_n_allocs(tp);
851 /* Find maximal depth */
852 for (i = 0; i < n_all; ++i) {
853 ir_node *all = get_type_alloc(tp, i);
854 int depth = get_weighted_loop_depth(all);
855 max_depth = (depth > max_depth) ? depth : max_depth ;
858 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
860 disp = freq + max_depth;
862 for (i = 0; i < n_all; ++i) {
863 ir_node *all = get_type_alloc(tp, i);
864 int depth = get_weighted_loop_depth(all);
865 assert(depth <= max_depth);
867 max_freq = (depth > max_freq) ? depth : max_freq;
868 assert(get_irn_op(all) == op_Alloc);
871 fprintf(F, "%s ", get_type_name(tp));
872 fprintf(F, "%s Alloc ", comma);
875 for (i = 0; i <= max_freq; ++i) {
876 fprintf(F, "%s %d", comma, freq[i]);
881 for (i = 0; i < get_class_n_members(tp); ++i) {
882 entity *mem = get_class_member(tp, i);
883 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
884 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
885 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
886 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
892 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
893 for (i = 0; i <= max_disp; ++i) {
894 fprintf(F, "%s %d", comma, disp[i]);
899 /* free allocated space */
903 #define DISP_TAB_SUFFIX "__disp_tab"
904 if (get_trouts_state() != outs_none) {
905 assert(strlen(get_type_name(tp)) < 1024);
906 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
907 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
908 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
911 for (i = 0; i < get_class_n_members(tp); ++i) {
912 entity *mem = get_class_member(tp, i);
913 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
914 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
915 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
916 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
923 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
926 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
927 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
928 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
929 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
930 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
931 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
932 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
933 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
935 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
936 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
938 switch (get_type_tpop_code(tp)) {
941 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
942 fprintf(F, "\n members: \n");
944 for (i = 0; i < get_class_n_members(tp); ++i) {
945 entity *mem = get_class_member(tp, i);
946 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
947 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
948 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
949 dump_entity_to_file_prefix(F, mem, " ", verbosity);
953 if (verbosity & dump_verbosity_typeattrs) {
954 fprintf(F, " supertypes: ");
955 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
956 type *stp = get_class_supertype(tp, i);
957 fprintf(F, "\n %s", get_type_name(stp));
959 fprintf(F, "\n subtypes: ");
960 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
961 type *stp = get_class_subtype(tp, i);
962 fprintf(F, "\n %s", get_type_name(stp));
965 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
967 fprintf(F, "\n transitive supertypes: ");
968 for (stp = get_class_trans_supertype_first(tp);
970 stp = get_class_trans_supertype_next(tp)) {
971 fprintf(F, "\n %s", get_type_name(stp));
973 fprintf(F, "\n transitive subtypes: ");
974 for (stp = get_class_trans_subtype_first(tp);
976 stp = get_class_trans_subtype_next(tp)) {
977 fprintf(F, "\n %s", get_type_name(stp));
981 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
988 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
989 for (i = 0; i < get_compound_n_members(tp); ++i) {
990 entity *mem = get_compound_member(tp, i);
991 if (verbosity & dump_verbosity_fields) {
992 dump_entity_to_file_prefix(F, mem, " ", verbosity);
998 if (verbosity & dump_verbosity_typeattrs) {
1000 type *elem_tp = get_array_element_type(tp);
1002 fprintf(F, "\n array ");
1004 n_dim = get_array_n_dimensions(tp);
1005 for (i = 0; i < n_dim; ++i) {
1006 ir_node *lower, *upper;
1008 lower = get_array_lower_bound(tp, i);
1009 upper = get_array_upper_bound(tp, i);
1013 if (get_irn_op(lower) == op_Const)
1014 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1016 dump_node_opcode(F, lower);
1017 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1020 if (get_irn_op(upper) == op_Const)
1021 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1023 dump_node_opcode(F, upper);
1024 fprintf(F, " %ld]", get_irn_node_nr(upper));
1027 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1029 fprintf(F, "\n order: ");
1030 for (i = 0; i < n_dim; ++i)
1031 fprintf(F, "<%d>", get_array_order(tp, i));
1035 if (verbosity & dump_verbosity_fields) {
1036 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1043 if (verbosity & dump_verbosity_typeattrs) {
1044 type *tt = get_pointer_points_to_type(tp);
1045 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1050 if (verbosity & dump_verbosity_typeattrs) {
1051 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1052 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1053 for (i = 0; i < get_method_n_ress(tp); ++i) {
1054 type *rtp = get_method_res_type(tp, i);
1055 fprintf(F, "\n %s", get_type_name(rtp));
1058 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1059 for (i = 0; i < get_method_n_params(tp); ++i) {
1060 type *ptp = get_method_param_type(tp, i);
1061 fprintf(F, "\n %s", get_type_name(ptp));
1063 if (get_method_variadicity(tp)) {
1064 fprintf(F, "\n ...");
1078 if (verbosity & dump_verbosity_typeattrs) {
1079 fprintf(F, ": details not implemented\n");
1083 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1084 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1085 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1086 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1087 if (is_atomic_type(tp) || is_Method_type(tp))
1088 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1089 fprintf(F, " dbg info: %p,\n", (void *)get_type_dbg_info(tp));
1091 if (get_trouts_state()) {
1092 fprintf(F, "\n Type outs:\n");
1093 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1094 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1095 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1096 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1097 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1101 if (verbosity & dump_verbosity_accessStats) {
1103 int n_all = get_type_n_allocs(tp);
1108 /* Find maximal depth */
1109 for (i = 0; i < n_all; ++i) {
1110 ir_node *all = get_type_alloc(tp, i);
1111 int depth = get_weighted_loop_depth(all);
1112 max_depth = (depth > max_depth) ? depth : max_depth ;
1115 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1117 for (i = 0; i < n_all; ++i) {
1118 ir_node *all = get_type_alloc(tp, i);
1119 int depth = get_weighted_loop_depth(all);
1120 assert(depth <= max_depth);
1122 max_freq = (depth > max_freq) ? depth : max_freq;
1123 assert(get_irn_op(all) == op_Alloc);
1126 if (max_freq >= 0) {
1129 fprintf(F, " Alloc Stats");
1130 for (i = 0; i <= max_freq; ++i) {
1131 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1139 if (get_trouts_state() != outs_none) {
1140 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1141 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1142 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1143 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1144 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1145 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1154 void dump_type(type *tp) {
1155 dump_type_to_file (stdout, tp, dump_verbosity_max);
1159 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1160 const char *basename;
1161 FILE *F, *CSV = NULL;
1162 int i, n_types = get_irp_n_types();
1164 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1165 F = text_open (basename, suffix, "-types", ".txt");
1167 if (verbosity & dump_verbosity_csv) {
1168 CSV = text_open (basename, suffix, "-types", ".csv");
1169 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1172 for (i = 0; i < n_types; ++i) {
1173 type *t = get_irp_type(i);
1175 //if (is_jack_rts_class(t)) continue;
1177 dump_type_to_file(F, t, verbosity);
1179 dump_typecsv_to_file(CSV, t, verbosity, "");
1184 if (CSV) fclose (CSV);
1188 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1189 const char *basename;
1190 FILE *F, *CSV = NULL;
1191 type *g = get_glob_type();
1192 int i, n_mems = get_class_n_members(g);
1194 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1195 F = text_open (basename, suffix, "-globals", ".txt");
1197 if (verbosity & dump_verbosity_csv) {
1198 CSV = text_open (basename, suffix, "-types", ".csv");
1199 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1202 for (i = 0; i < n_mems; ++i) {
1203 entity *e = get_class_member(g, i);
1205 dump_entity_to_file(F, e, verbosity);
1207 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1212 if (CSV) fclose (CSV);