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) { /* replace '/' 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_irn_n(n, -1));
106 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
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_irn_n(n, -1));
115 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
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_irn_opcode(n) == iro_Proj)
126 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
128 if ((get_irp_ip_view_state() != ip_view_no)
129 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
130 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
131 fprintf(F, " inter pred nodes: \n");
132 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
133 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
134 dump_node_opcode(F, get_irn_inter_n(n, i));
135 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
139 if (is_fragile_op(n)) {
140 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
141 /* not dumped: frag array */
144 /* This is not nice, output it as a marker in the predecessor list. */
145 if ((get_irn_op(n) == op_Block) ||
146 (get_irn_op(n) == op_Phi) ||
147 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
148 fprintf(F, " backedges:");
150 for (i = 0; i < get_irn_arity(n); i++)
151 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
155 /* Loop node. Someone else please tell me what's wrong ... */
156 if (get_irn_loop(n)) {
157 ir_loop *loop = get_irn_loop(n);
159 fprintf(F, " in loop %d with depth %d\n",
160 get_loop_loop_nr(loop), get_loop_depth(loop));
165 switch (get_irn_opcode(n)) {
167 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
168 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
169 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
170 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
171 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
174 fprintf(F, " Execution freqency statistics:\n");
175 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
176 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
177 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
178 fprintf(F, " call freqency of procedure: %8.2lf\n",
179 get_irg_method_execution_frequency(get_irn_irg(n)));
180 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
181 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
182 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
183 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
184 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
185 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
187 /* not dumped: graph_arr */
188 /* not dumped: mature */
191 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
192 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
193 for (i = 0; i < get_method_n_params(tp); ++i)
194 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
195 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
196 ir_node *sbl = get_nodes_block(n);
197 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
198 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
199 for (i = 0; i < n_cfgpreds; ++i) {
200 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
201 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
202 get_irg_dump_name(get_irn_irg(cfgpred)));
207 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
208 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
211 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
212 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
215 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
218 entity *ent = get_Sel_entity(n);
220 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
221 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
222 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
225 fprintf(F, " <NULL entity>\n");
230 type *tp = get_Call_type(n);
231 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
232 if(get_unknown_type() != tp) {
233 for (i = 0; i < get_method_n_params(tp); ++i)
234 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
235 for (i = 0; i < get_method_n_ress(tp); ++i)
236 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
238 if (Call_has_callees(n)) {
239 fprintf(F, " possible callees: \n");
240 for (i = 0; i < get_Call_n_callees(n); i++) {
241 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
245 case iro_CallBegin: {
246 ir_node *call = get_CallBegin_call(n);
247 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
248 if (Call_has_callees(call)) {
249 fprintf(F, " possible callees: \n");
250 for (i = 0; i < get_Call_n_callees(call); i++) {
251 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
256 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
259 if (!get_interprocedural_view()) {
260 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
261 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
262 for (i = 0; i < get_method_n_ress(tp); ++i)
263 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
267 type *tp = get_Const_type(n);
268 assert(tp != firm_none_type);
269 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
272 switch(get_SymConst_kind(n)) {
273 case symconst_addr_name:
274 fprintf(F, " kind: addr_name\n");
275 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
277 case symconst_addr_ent:
278 fprintf(F, " kind: addr_ent\n");
279 fprintf(F, " entity: ");
280 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
282 case symconst_type_tag:
283 fprintf(F, " kind: type_tag\n");
284 fprintf(F, " type: ");
285 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
288 fprintf(F, " kind: size\n");
289 fprintf(F, " type: ");
290 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
293 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
296 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
297 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
300 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
303 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
309 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
310 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
311 if (get_irn_typeinfo_type(n) != firm_none_type)
312 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
319 void dump_irnode(ir_node *n) {
320 dump_irnode_to_file(stdout, n);
324 void dump_graph_to_file(FILE *F, ir_graph *irg) {
325 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
328 void dump_graph(ir_graph *g) {
329 dump_graph_to_file(stdout, g);
332 static void dump_node_to_graph_file(ir_node *n, void *env) {
333 FILE *F = (FILE *)env;
335 dump_irnode_to_file(F, n);
339 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
340 const char *basename = get_irg_dump_name(irg);
343 F = text_open (basename, suffix, "", ".txt");
345 dump_graph_to_file(F, irg);
347 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
353 int addr_is_alloc(ir_node *acc) {
354 ir_node *addr = NULL;
357 addr = get_memop_ptr(acc);
359 assert(get_irn_op(acc) == op_Call);
360 addr = get_Call_ptr(acc);
363 addr_op = get_irn_opcode(addr);
365 while (addr_op != iro_Alloc) {
369 addr = get_Sel_ptr(addr);
372 addr = get_Cast_op(addr);
375 addr = get_Proj_pred(addr);
390 //assert(0 && "unexpected address node");
393 addr_op = get_irn_opcode(addr);
396 /* In addition, the alloc must be in the same loop. */
401 /** dumps something like:
403 * "prefix" "Name" (x): node1, ... node7,\n
404 * "prefix" node8, ... node15,\n
405 * "prefix" node16, node17\n
407 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
408 int (*get_entity_n_nodes)(firm_kind *ent),
409 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
411 int i, n_nodes = get_entity_n_nodes(k);
414 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
415 for (i = 0; i < n_nodes; ++i) {
417 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
418 fprintf(F, ",\n%s ", prefix);
421 fprintf(F, "%s ", comma);
422 rem = opt_dump_analysed_type_info;
423 opt_dump_analysed_type_info = 0;
424 dump_node_label(F, get_entity_node(k, i));
425 opt_dump_analysed_type_info = rem;
431 /** dumps something like:
433 * "prefix" "Name" (x): node1, ... node7,\n
434 * "prefix" node8, ... node15,\n
435 * "prefix" node16, node17\n
437 static void dump_type_list(FILE *F, type *tp, char *prefix,
438 int (*get_n_types)(type *tp),
439 type *(*get_type)(type *tp, int pos),
441 int i, n_nodes = get_n_types(tp);
444 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
445 for (i = 0; i < n_nodes; ++i) {
446 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
447 fprintf(F, ",\n%s ", prefix);
450 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
451 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
457 #define X(a) case a: fprintf(F, #a); break
458 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
462 assert(is_entity(ent));
463 owner = get_entity_owner(ent);
464 type = get_entity_type(ent);
465 if (verbosity & dump_verbosity_onlynames) {
466 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
467 get_entity_name(ent), get_entity_nr(ent));
471 if (verbosity & dump_verbosity_entattrs) {
472 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
473 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
474 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
476 if (is_Class_type(get_entity_owner(ent))) {
477 if (get_entity_n_overwrites(ent) > 0) {
478 fprintf(F, "%s overwrites:\n", prefix);
479 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
480 entity *ov = get_entity_overwrites(ent, i);
481 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
482 get_type_name(get_entity_owner(ov)));
485 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
487 if (get_entity_n_overwrittenby(ent) > 0) {
488 fprintf(F, "%s overwritten by:\n", prefix);
489 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
490 entity *ov = get_entity_overwrittenby(ent, i);
491 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
492 get_type_name(get_entity_owner(ov)));
495 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
498 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
500 fprintf(F, "%s transitive overwrites:\n", prefix);
501 for (ov = get_entity_trans_overwrites_first(ent);
503 ov = get_entity_trans_overwrites_next(ent)) {
504 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
505 get_type_name(get_entity_owner(ov)));
507 fprintf(F, "%s transitive overwritten by:\n", prefix);
508 for (ov = get_entity_trans_overwrittenby_first(ent);
510 ov = get_entity_trans_overwrittenby_next(ent)) {
511 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
512 get_type_name(get_entity_owner(ov)));
517 fprintf(F, "%s allocation: ", prefix);
518 switch (get_entity_allocation(ent)) {
519 X(allocation_dynamic);
520 X(allocation_automatic);
521 X(allocation_static);
522 X(allocation_parameter);
525 fprintf(F, "\n%s visibility: ", prefix);
526 switch (get_entity_visibility(ent)) {
528 X(visibility_external_visible);
529 X(visibility_external_allocated);
532 fprintf(F, "\n%s variability: ", prefix);
533 switch (get_entity_variability(ent)) {
534 X(variability_uninitialized);
535 X(variability_initialized);
536 X(variability_part_constant);
537 X(variability_constant);
540 } else { /* no entattrs */
541 fprintf(F, "%s(%3d) %*s: %s", prefix,
542 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
543 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
545 if (verbosity & dump_verbosity_accessStats) {
546 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
547 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
548 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
553 if (verbosity & dump_verbosity_entconsts) {
554 if (get_entity_variability(ent) != variability_uninitialized) {
555 if (is_atomic_entity(ent)) {
556 fprintf(F, "%s atomic value: ", prefix);
557 dump_node_opcode(F, get_atomic_ent_value(ent));
559 fprintf(F, "%s compound values:", prefix);
560 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
561 compound_graph_path *path = get_compound_ent_value_path(ent, i);
562 entity *ent0 = get_compound_graph_path_node(path, 0);
563 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
564 if (get_type_state(type) == layout_fixed)
565 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
566 fprintf(F, "%s", get_entity_name(ent));
567 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
568 entity *node = get_compound_graph_path_node(path, j);
569 fprintf(F, ".%s", get_entity_name(node));
570 if (is_Array_type(get_entity_owner(node)))
571 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
574 dump_node_opcode(F, get_compound_ent_value(ent, i));
581 if (verbosity & dump_verbosity_entattrs) {
582 fprintf(F, "%s volatility: ", prefix);
583 switch (get_entity_volatility(ent)) {
584 X(volatility_non_volatile);
585 X(volatility_is_volatile);
588 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
589 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
590 fprintf(F, "\n%s offset: %d bits, %d bytes", prefix, get_entity_offset_bits(ent), get_entity_offset_bytes(ent));
591 if (is_Method_type(get_entity_type(ent))) {
592 if (get_entity_irg(ent)) /* can be null */ {
593 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
594 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
595 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
596 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
599 fprintf(F, "\n%s irg = NULL", prefix);
605 if (get_trouts_state()) {
606 fprintf(F, "%s Entity outs:\n", prefix);
607 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
608 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
609 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
610 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
613 if (verbosity & dump_verbosity_accessStats) {
615 int n_acc = get_entity_n_accesses(ent);
619 int max_LA_freq = -1;
620 int max_SA_freq = -1;
626 /* Find maximal depth */
627 for (i = 0; i < n_acc; ++i) {
628 ir_node *acc = get_entity_access(ent, i);
629 int depth = get_weighted_loop_depth(acc);
630 max_depth = (depth > max_depth) ? depth : max_depth ;
633 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
635 S_freq = L_freq + 1*max_depth;
636 LA_freq = L_freq + 2*max_depth;
637 SA_freq = L_freq + 3*max_depth;
639 for (i = 0; i < n_acc; ++i) {
640 ir_node *acc = get_entity_access(ent, i);
641 int depth = get_weighted_loop_depth(acc);
642 assert(depth < max_depth);
643 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
645 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
646 if (addr_is_alloc(acc)) {
648 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
650 } else if (get_irn_op(acc) == op_Store) {
652 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
653 if (addr_is_alloc(acc)) {
655 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
662 if (max_L_freq >= 0) {
665 fprintf(F, "%s Load Stats", prefix);
666 for (i = 0; i <= max_L_freq; ++i) {
668 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
675 if (max_LA_freq >= 0) {
676 //fprintf(F, "%s LoadA Stats", prefix);
678 for (i = 0; i <= max_LA_freq; ++i) {
680 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
687 if (max_S_freq >= 0) {
690 fprintf(F, "%s Store Stats", prefix);
691 for (i = 0; i <= max_S_freq; ++i) {
693 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
700 if (max_SA_freq >= 0) {
701 //fprintf(F, "%s StoreAStats", prefix);
703 for (i = 0; i <= max_SA_freq; ++i) {
705 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
713 /* free allocated space */
716 if (get_trouts_state() != outs_none) {
717 if (is_Method_type(get_entity_type(ent))) {
718 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
719 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
721 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
722 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
730 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
731 dump_entity_to_file_prefix (F, ent, "", verbosity);
735 void dump_entity (entity *ent) {
736 dump_entity_to_file(stdout, ent, dump_verbosity_max);
739 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
740 int *max_disp, int disp[], const char *comma) {
742 #if 0 /* Outputs loop depth of all occurences. */
743 int n_acc = get_entity_n_accesses(ent);
746 int max_LA_freq = -1;
747 int max_SA_freq = -1;
752 int i, max_depth = 0;
754 /* Find maximal depth */
755 for (i = 0; i < n_acc; ++i) {
756 ir_node *acc = get_entity_access(ent, i);
757 int depth = get_weighted_loop_depth(acc);
758 max_depth = (depth > max_depth) ? depth : max_depth ;
761 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
763 S_freq = L_freq + 1*max_depth;
764 LA_freq = L_freq + 2*max_depth;
765 SA_freq = L_freq + 3*max_depth;
767 for (i = 0; i < n_acc; ++i) {
768 ir_node *acc = get_entity_access(ent, i);
769 int depth = get_weighted_loop_depth(acc);
770 assert(depth <= max_depth);
771 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
773 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
774 if (addr_is_alloc(acc)) {
776 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
778 if (get_entity_allocation(ent) == allocation_static) {
780 *max_disp = (depth > *max_disp) ? depth : *max_disp;
782 } else if (get_irn_op(acc) == op_Store) {
784 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
785 if (addr_is_alloc(acc)) {
787 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
789 if (get_entity_allocation(ent) == allocation_static) {
797 if (get_entity_allocation(ent) != allocation_static) {
799 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
801 if (max_L_freq >= 0) {
802 fprintf(F, "%s Load", comma);
803 for (i = 0; i <= max_L_freq; ++i) {
804 fprintf(F, "%s %d", comma, L_freq[i]);
807 if (max_S_freq >= 0) {
808 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
809 fprintf(F, "%s Store", comma);
810 for (i = 0; i <= max_S_freq; ++i) {
811 fprintf(F, "%s %d", comma, S_freq[i]);
819 if (get_entity_allocation(ent) != allocation_static) {
820 if (is_Method_type(get_entity_type(ent))) return;
822 /* Output the entity name. */
823 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
825 if (get_trouts_state() != outs_none) {
826 if (is_Method_type(get_entity_type(ent))) {
827 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
828 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
830 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
831 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
839 /* A fast hack to dump a csv. */
840 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
843 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
845 if (verbosity & dump_verbosity_accessStats) {
847 #if 0 /* Outputs loop depth of all occurences. */
850 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
851 int n_all = get_type_n_allocs(tp);
853 /* Find maximal depth */
854 for (i = 0; i < n_all; ++i) {
855 ir_node *all = get_type_alloc(tp, i);
856 int depth = get_weighted_loop_depth(all);
857 max_depth = (depth > max_depth) ? depth : max_depth ;
860 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
862 disp = freq + max_depth;
864 for (i = 0; i < n_all; ++i) {
865 ir_node *all = get_type_alloc(tp, i);
866 int depth = get_weighted_loop_depth(all);
867 assert(depth <= max_depth);
869 max_freq = (depth > max_freq) ? depth : max_freq;
870 assert(get_irn_op(all) == op_Alloc);
873 fprintf(F, "%s ", get_type_name(tp));
874 fprintf(F, "%s Alloc ", comma);
877 for (i = 0; i <= max_freq; ++i) {
878 fprintf(F, "%s %d", comma, freq[i]);
883 for (i = 0; i < get_class_n_members(tp); ++i) {
884 entity *mem = get_class_member(tp, i);
885 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
886 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
887 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
888 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
894 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
895 for (i = 0; i <= max_disp; ++i) {
896 fprintf(F, "%s %d", comma, disp[i]);
901 /* free allocated space */
905 #define DISP_TAB_SUFFIX "__disp_tab"
906 if (get_trouts_state() != outs_none) {
907 assert(strlen(get_type_name(tp)) < 1024);
908 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
909 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
910 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
913 for (i = 0; i < get_class_n_members(tp); ++i) {
914 entity *mem = get_class_member(tp, i);
915 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
916 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
917 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
918 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
925 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
928 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
929 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
930 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
931 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
932 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
933 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
934 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
935 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
937 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
938 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
940 switch (get_type_tpop_code(tp)) {
943 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
944 fprintf(F, "\n members: \n");
946 for (i = 0; i < get_class_n_members(tp); ++i) {
947 entity *mem = get_class_member(tp, i);
948 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
949 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
950 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
951 dump_entity_to_file_prefix(F, mem, " ", verbosity);
955 if (verbosity & dump_verbosity_typeattrs) {
956 fprintf(F, " supertypes: ");
957 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
958 type *stp = get_class_supertype(tp, i);
959 fprintf(F, "\n %s", get_type_name(stp));
961 fprintf(F, "\n subtypes: ");
962 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
963 type *stp = get_class_subtype(tp, i);
964 fprintf(F, "\n %s", get_type_name(stp));
967 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
969 fprintf(F, "\n transitive supertypes: ");
970 for (stp = get_class_trans_supertype_first(tp);
972 stp = get_class_trans_supertype_next(tp)) {
973 fprintf(F, "\n %s", get_type_name(stp));
975 fprintf(F, "\n transitive subtypes: ");
976 for (stp = get_class_trans_subtype_first(tp);
978 stp = get_class_trans_subtype_next(tp)) {
979 fprintf(F, "\n %s", get_type_name(stp));
983 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
990 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
991 for (i = 0; i < get_compound_n_members(tp); ++i) {
992 entity *mem = get_compound_member(tp, i);
993 if (verbosity & dump_verbosity_fields) {
994 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1000 if (verbosity & dump_verbosity_typeattrs) {
1002 type *elem_tp = get_array_element_type(tp);
1004 fprintf(F, "\n array ");
1006 n_dim = get_array_n_dimensions(tp);
1007 for (i = 0; i < n_dim; ++i) {
1008 ir_node *lower, *upper;
1010 lower = get_array_lower_bound(tp, i);
1011 upper = get_array_upper_bound(tp, i);
1015 if (get_irn_op(lower) == op_Const)
1016 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1018 dump_node_opcode(F, lower);
1019 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1022 if (get_irn_op(upper) == op_Const)
1023 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1025 dump_node_opcode(F, upper);
1026 fprintf(F, " %ld]", get_irn_node_nr(upper));
1029 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1031 fprintf(F, "\n order: ");
1032 for (i = 0; i < n_dim; ++i)
1033 fprintf(F, "<%d>", get_array_order(tp, i));
1037 if (verbosity & dump_verbosity_fields) {
1038 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1045 if (verbosity & dump_verbosity_typeattrs) {
1046 type *tt = get_pointer_points_to_type(tp);
1047 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1052 if (verbosity & dump_verbosity_typeattrs) {
1053 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1054 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1055 for (i = 0; i < get_method_n_ress(tp); ++i) {
1056 type *rtp = get_method_res_type(tp, i);
1057 fprintf(F, "\n %s", get_type_name(rtp));
1060 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1061 for (i = 0; i < get_method_n_params(tp); ++i) {
1062 type *ptp = get_method_param_type(tp, i);
1063 fprintf(F, "\n %s", get_type_name(ptp));
1065 if (get_method_variadicity(tp)) {
1066 fprintf(F, "\n ...");
1080 if (verbosity & dump_verbosity_typeattrs) {
1081 fprintf(F, ": details not implemented\n");
1085 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1086 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1087 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1088 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1089 if (is_atomic_type(tp) || is_Method_type(tp))
1090 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1092 if (get_trouts_state()) {
1093 fprintf(F, "\n Type outs:\n");
1094 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1095 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1096 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1097 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1098 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1102 if (verbosity & dump_verbosity_accessStats) {
1104 int n_all = get_type_n_allocs(tp);
1109 /* Find maximal depth */
1110 for (i = 0; i < n_all; ++i) {
1111 ir_node *all = get_type_alloc(tp, i);
1112 int depth = get_weighted_loop_depth(all);
1113 max_depth = (depth > max_depth) ? depth : max_depth ;
1116 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1118 for (i = 0; i < n_all; ++i) {
1119 ir_node *all = get_type_alloc(tp, i);
1120 int depth = get_weighted_loop_depth(all);
1121 assert(depth <= max_depth);
1123 max_freq = (depth > max_freq) ? depth : max_freq;
1124 assert(get_irn_op(all) == op_Alloc);
1127 if (max_freq >= 0) {
1130 fprintf(F, " Alloc Stats");
1131 for (i = 0; i <= max_freq; ++i) {
1132 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1140 if (get_trouts_state() != outs_none) {
1141 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1142 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1143 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1144 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1145 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1146 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1155 void dump_type(type *tp) {
1156 dump_type_to_file (stdout, tp, dump_verbosity_max);
1160 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1161 const char *basename;
1162 FILE *F, *CSV = NULL;
1163 int i, n_types = get_irp_n_types();
1165 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1166 F = text_open (basename, suffix, "-types", ".txt");
1168 if (verbosity & dump_verbosity_csv) {
1169 CSV = text_open (basename, suffix, "-types", ".csv");
1170 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1173 for (i = 0; i < n_types; ++i) {
1174 type *t = get_irp_type(i);
1176 //if (is_jack_rts_class(t)) continue;
1178 dump_type_to_file(F, t, verbosity);
1180 dump_typecsv_to_file(CSV, t, verbosity, "");
1185 if (CSV) fclose (CSV);
1189 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1190 const char *basename;
1191 FILE *F, *CSV = NULL;
1192 type *g = get_glob_type();
1193 int i, n_mems = get_class_n_members(g);
1195 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1196 F = text_open (basename, suffix, "-globals", ".txt");
1198 if (verbosity & dump_verbosity_csv) {
1199 CSV = text_open (basename, suffix, "-types", ".csv");
1200 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1203 for (i = 0; i < n_mems; ++i) {
1204 entity *e = get_class_member(g, i);
1206 dump_entity_to_file(F, e, verbosity);
1208 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1213 if (CSV) fclose (CSV);