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));
209 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
210 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
213 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
214 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
217 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
218 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
221 entity *ent = get_Sel_entity(n);
223 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
224 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
225 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
228 fprintf(F, " <NULL entity>\n");
233 type *tp = get_Call_type(n);
234 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
235 if(get_unknown_type() != tp) {
236 for (i = 0; i < get_method_n_params(tp); ++i)
237 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
238 for (i = 0; i < get_method_n_ress(tp); ++i)
239 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
241 if (Call_has_callees(n)) {
242 fprintf(F, " possible callees: \n");
243 for (i = 0; i < get_Call_n_callees(n); i++) {
244 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
248 case iro_CallBegin: {
249 ir_node *call = get_CallBegin_call(n);
250 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
251 if (Call_has_callees(call)) {
252 fprintf(F, " possible callees: \n");
253 for (i = 0; i < get_Call_n_callees(call); i++) {
254 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
259 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
262 if (!get_interprocedural_view()) {
263 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
264 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
265 for (i = 0; i < get_method_n_ress(tp); ++i)
266 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
270 type *tp = get_Const_type(n);
271 assert(tp != firm_none_type);
272 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
275 switch(get_SymConst_kind(n)) {
276 case symconst_addr_name:
277 fprintf(F, " kind: addr_name\n");
278 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
280 case symconst_addr_ent:
281 fprintf(F, " kind: addr_ent\n");
282 fprintf(F, " entity: ");
283 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
285 case symconst_type_tag:
286 fprintf(F, " kind: type_tag\n");
287 fprintf(F, " type: ");
288 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
291 fprintf(F, " kind: size\n");
292 fprintf(F, " type: ");
293 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
296 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
299 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
300 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
303 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
306 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
312 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
313 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
314 if (get_irn_typeinfo_type(n) != firm_none_type)
315 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
322 void dump_irnode(ir_node *n) {
323 dump_irnode_to_file(stdout, n);
327 void dump_graph_to_file(FILE *F, ir_graph *irg) {
328 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
331 void dump_graph(ir_graph *g) {
332 dump_graph_to_file(stdout, g);
335 static void dump_node_to_graph_file(ir_node *n, void *env) {
336 FILE *F = (FILE *)env;
338 dump_irnode_to_file(F, n);
342 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
343 const char *basename = get_irg_dump_name(irg);
346 F = text_open (basename, suffix, "", ".txt");
348 dump_graph_to_file(F, irg);
350 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
356 int addr_is_alloc(ir_node *acc) {
357 ir_node *addr = NULL;
360 addr = get_memop_ptr(acc);
362 assert(get_irn_op(acc) == op_Call);
363 addr = get_Call_ptr(acc);
366 addr_op = get_irn_opcode(addr);
368 while (addr_op != iro_Alloc) {
372 addr = get_Sel_ptr(addr);
375 addr = get_Cast_op(addr);
378 addr = get_Proj_pred(addr);
393 //assert(0 && "unexpected address node");
396 addr_op = get_irn_opcode(addr);
399 /* In addition, the alloc must be in the same loop. */
404 /** dumps something like:
406 * "prefix" "Name" (x): node1, ... node7,\n
407 * "prefix" node8, ... node15,\n
408 * "prefix" node16, node17\n
410 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
411 int (*get_entity_n_nodes)(firm_kind *ent),
412 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
414 int i, n_nodes = get_entity_n_nodes(k);
417 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
418 for (i = 0; i < n_nodes; ++i) {
420 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
421 fprintf(F, ",\n%s ", prefix);
424 fprintf(F, "%s ", comma);
425 rem = opt_dump_analysed_type_info;
426 opt_dump_analysed_type_info = 0;
427 dump_node_label(F, get_entity_node(k, i));
428 opt_dump_analysed_type_info = rem;
434 /** dumps something like:
436 * "prefix" "Name" (x): node1, ... node7,\n
437 * "prefix" node8, ... node15,\n
438 * "prefix" node16, node17\n
440 static void dump_type_list(FILE *F, type *tp, char *prefix,
441 int (*get_n_types)(type *tp),
442 type *(*get_type)(type *tp, int pos),
444 int i, n_nodes = get_n_types(tp);
447 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
448 for (i = 0; i < n_nodes; ++i) {
449 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
450 fprintf(F, ",\n%s ", prefix);
453 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
454 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
460 #define X(a) case a: fprintf(F, #a); break
461 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
465 assert(is_entity(ent));
466 owner = get_entity_owner(ent);
467 type = get_entity_type(ent);
468 if (verbosity & dump_verbosity_onlynames) {
469 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
470 get_entity_name(ent), get_entity_nr(ent));
474 if (verbosity & dump_verbosity_entattrs) {
475 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
476 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
477 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
479 if (is_Class_type(get_entity_owner(ent))) {
480 if (get_entity_n_overwrites(ent) > 0) {
481 fprintf(F, "%s overwrites:\n", prefix);
482 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
483 entity *ov = get_entity_overwrites(ent, i);
484 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
485 get_type_name(get_entity_owner(ov)));
488 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
490 if (get_entity_n_overwrittenby(ent) > 0) {
491 fprintf(F, "%s overwritten by:\n", prefix);
492 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
493 entity *ov = get_entity_overwrittenby(ent, i);
494 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
495 get_type_name(get_entity_owner(ov)));
498 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
501 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
503 fprintf(F, "%s transitive overwrites:\n", prefix);
504 for (ov = get_entity_trans_overwrites_first(ent);
506 ov = get_entity_trans_overwrites_next(ent)) {
507 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
508 get_type_name(get_entity_owner(ov)));
510 fprintf(F, "%s transitive overwritten by:\n", prefix);
511 for (ov = get_entity_trans_overwrittenby_first(ent);
513 ov = get_entity_trans_overwrittenby_next(ent)) {
514 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
515 get_type_name(get_entity_owner(ov)));
520 fprintf(F, "%s allocation: ", prefix);
521 switch (get_entity_allocation(ent)) {
522 X(allocation_dynamic);
523 X(allocation_automatic);
524 X(allocation_static);
525 X(allocation_parameter);
528 fprintf(F, "\n%s visibility: ", prefix);
529 switch (get_entity_visibility(ent)) {
531 X(visibility_external_visible);
532 X(visibility_external_allocated);
535 fprintf(F, "\n%s variability: ", prefix);
536 switch (get_entity_variability(ent)) {
537 X(variability_uninitialized);
538 X(variability_initialized);
539 X(variability_part_constant);
540 X(variability_constant);
543 if (is_Method_type(get_entity_type(ent))) {
544 unsigned mask = get_entity_additional_properties(ent);
547 fprintf(F, "\n%s additional prop: ", prefix);
549 if (mask & irg_const_function) fprintf(F, "const_function, ");
550 if (mask & irg_pure_function) fprintf(F, "pure_function, ");
551 if (mask & irg_noreturn_function) fprintf(F, "noreturn_function, ");
552 if (mask & irg_nothrow_function) fprintf(F, "nothrow_function, ");
553 if (mask & irg_naked_function) fprintf(F, "naked_function, ");
558 } else { /* no entattrs */
559 fprintf(F, "%s(%3d) %*s: %s", prefix,
560 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
561 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
563 if (verbosity & dump_verbosity_accessStats) {
564 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
565 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
566 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
571 if (verbosity & dump_verbosity_entconsts) {
572 if (get_entity_variability(ent) != variability_uninitialized) {
573 if (is_atomic_entity(ent)) {
574 fprintf(F, "%s atomic value: ", prefix);
575 dump_node_opcode(F, get_atomic_ent_value(ent));
577 fprintf(F, "%s compound values:", prefix);
578 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
579 compound_graph_path *path = get_compound_ent_value_path(ent, i);
580 entity *ent0 = get_compound_graph_path_node(path, 0);
581 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
582 if (get_type_state(type) == layout_fixed)
583 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
584 fprintf(F, "%s", get_entity_name(ent));
585 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
586 entity *node = get_compound_graph_path_node(path, j);
587 fprintf(F, ".%s", get_entity_name(node));
588 if (is_Array_type(get_entity_owner(node)))
589 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
592 dump_node_opcode(F, get_compound_ent_value(ent, i));
599 if (verbosity & dump_verbosity_entattrs) {
600 fprintf(F, "%s volatility: ", prefix);
601 switch (get_entity_volatility(ent)) {
602 X(volatility_non_volatile);
603 X(volatility_is_volatile);
606 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
607 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
608 fprintf(F, "\n%s offset: %d bits, %d bytes", prefix, get_entity_offset_bits(ent), get_entity_offset_bytes(ent));
609 if (is_Method_type(get_entity_type(ent))) {
610 if (get_entity_irg(ent)) /* can be null */ {
611 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
612 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
613 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
614 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
617 fprintf(F, "\n%s irg = NULL", prefix);
623 if (get_trouts_state()) {
624 fprintf(F, "%s Entity outs:\n", prefix);
625 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
626 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
627 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
628 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
631 if (verbosity & dump_verbosity_accessStats) {
633 int n_acc = get_entity_n_accesses(ent);
637 int max_LA_freq = -1;
638 int max_SA_freq = -1;
644 /* Find maximal depth */
645 for (i = 0; i < n_acc; ++i) {
646 ir_node *acc = get_entity_access(ent, i);
647 int depth = get_weighted_loop_depth(acc);
648 max_depth = (depth > max_depth) ? depth : max_depth ;
651 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
653 S_freq = L_freq + 1*max_depth;
654 LA_freq = L_freq + 2*max_depth;
655 SA_freq = L_freq + 3*max_depth;
657 for (i = 0; i < n_acc; ++i) {
658 ir_node *acc = get_entity_access(ent, i);
659 int depth = get_weighted_loop_depth(acc);
660 assert(depth < max_depth);
661 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
663 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
664 if (addr_is_alloc(acc)) {
666 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
668 } else if (get_irn_op(acc) == op_Store) {
670 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
671 if (addr_is_alloc(acc)) {
673 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
680 if (max_L_freq >= 0) {
683 fprintf(F, "%s Load Stats", prefix);
684 for (i = 0; i <= max_L_freq; ++i) {
686 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
693 if (max_LA_freq >= 0) {
694 //fprintf(F, "%s LoadA Stats", prefix);
696 for (i = 0; i <= max_LA_freq; ++i) {
698 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
705 if (max_S_freq >= 0) {
708 fprintf(F, "%s Store Stats", prefix);
709 for (i = 0; i <= max_S_freq; ++i) {
711 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
718 if (max_SA_freq >= 0) {
719 //fprintf(F, "%s StoreAStats", prefix);
721 for (i = 0; i <= max_SA_freq; ++i) {
723 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
731 /* free allocated space */
734 if (get_trouts_state() != outs_none) {
735 if (is_Method_type(get_entity_type(ent))) {
736 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
737 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
739 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
740 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
748 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
749 dump_entity_to_file_prefix (F, ent, "", verbosity);
753 void dump_entity (entity *ent) {
754 dump_entity_to_file(stdout, ent, dump_verbosity_max);
757 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
758 int *max_disp, int disp[], const char *comma) {
760 #if 0 /* Outputs loop depth of all occurrences. */
761 int n_acc = get_entity_n_accesses(ent);
764 int max_LA_freq = -1;
765 int max_SA_freq = -1;
770 int i, max_depth = 0;
772 /* Find maximal depth */
773 for (i = 0; i < n_acc; ++i) {
774 ir_node *acc = get_entity_access(ent, i);
775 int depth = get_weighted_loop_depth(acc);
776 max_depth = (depth > max_depth) ? depth : max_depth ;
779 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
781 S_freq = L_freq + 1*max_depth;
782 LA_freq = L_freq + 2*max_depth;
783 SA_freq = L_freq + 3*max_depth;
785 for (i = 0; i < n_acc; ++i) {
786 ir_node *acc = get_entity_access(ent, i);
787 int depth = get_weighted_loop_depth(acc);
788 assert(depth <= max_depth);
789 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
791 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
792 if (addr_is_alloc(acc)) {
794 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
796 if (get_entity_allocation(ent) == allocation_static) {
798 *max_disp = (depth > *max_disp) ? depth : *max_disp;
800 } else if (get_irn_op(acc) == op_Store) {
802 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
803 if (addr_is_alloc(acc)) {
805 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
807 if (get_entity_allocation(ent) == allocation_static) {
815 if (get_entity_allocation(ent) != allocation_static) {
817 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
819 if (max_L_freq >= 0) {
820 fprintf(F, "%s Load", comma);
821 for (i = 0; i <= max_L_freq; ++i) {
822 fprintf(F, "%s %d", comma, L_freq[i]);
825 if (max_S_freq >= 0) {
826 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
827 fprintf(F, "%s Store", comma);
828 for (i = 0; i <= max_S_freq; ++i) {
829 fprintf(F, "%s %d", comma, S_freq[i]);
837 if (get_entity_allocation(ent) != allocation_static) {
838 if (is_Method_type(get_entity_type(ent))) return;
840 /* Output the entity name. */
841 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
843 if (get_trouts_state() != outs_none) {
844 if (is_Method_type(get_entity_type(ent))) {
845 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
846 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
848 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
849 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
857 /* A fast hack to dump a csv. */
858 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
861 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
863 if (verbosity & dump_verbosity_accessStats) {
865 #if 0 /* Outputs loop depth of all occurrences. */
868 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
869 int n_all = get_type_n_allocs(tp);
871 /* Find maximal depth */
872 for (i = 0; i < n_all; ++i) {
873 ir_node *all = get_type_alloc(tp, i);
874 int depth = get_weighted_loop_depth(all);
875 max_depth = (depth > max_depth) ? depth : max_depth ;
878 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
880 disp = freq + max_depth;
882 for (i = 0; i < n_all; ++i) {
883 ir_node *all = get_type_alloc(tp, i);
884 int depth = get_weighted_loop_depth(all);
885 assert(depth <= max_depth);
887 max_freq = (depth > max_freq) ? depth : max_freq;
888 assert(get_irn_op(all) == op_Alloc);
891 fprintf(F, "%s ", get_type_name(tp));
892 fprintf(F, "%s Alloc ", comma);
895 for (i = 0; i <= max_freq; ++i) {
896 fprintf(F, "%s %d", comma, freq[i]);
901 for (i = 0; i < get_class_n_members(tp); ++i) {
902 entity *mem = get_class_member(tp, i);
903 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
904 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
905 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
906 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
912 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
913 for (i = 0; i <= max_disp; ++i) {
914 fprintf(F, "%s %d", comma, disp[i]);
919 /* free allocated space */
923 #define DISP_TAB_SUFFIX "__disp_tab"
924 if (get_trouts_state() != outs_none) {
925 assert(strlen(get_type_name(tp)) < 1024);
926 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
927 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
928 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
931 for (i = 0; i < get_class_n_members(tp); ++i) {
932 entity *mem = get_class_member(tp, i);
933 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
934 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
935 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
936 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
943 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
946 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
947 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
948 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
949 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
950 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
951 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
952 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
953 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
955 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
956 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
958 switch (get_type_tpop_code(tp)) {
961 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
962 fprintf(F, "\n members: \n");
964 for (i = 0; i < get_class_n_members(tp); ++i) {
965 entity *mem = get_class_member(tp, i);
966 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
967 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
968 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
969 dump_entity_to_file_prefix(F, mem, " ", verbosity);
973 if (verbosity & dump_verbosity_typeattrs) {
974 fprintf(F, " supertypes: ");
975 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
976 type *stp = get_class_supertype(tp, i);
977 fprintf(F, "\n %s", get_type_name(stp));
979 fprintf(F, "\n subtypes: ");
980 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
981 type *stp = get_class_subtype(tp, i);
982 fprintf(F, "\n %s", get_type_name(stp));
985 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
987 fprintf(F, "\n transitive supertypes: ");
988 for (stp = get_class_trans_supertype_first(tp);
990 stp = get_class_trans_supertype_next(tp)) {
991 fprintf(F, "\n %s", get_type_name(stp));
993 fprintf(F, "\n transitive subtypes: ");
994 for (stp = get_class_trans_subtype_first(tp);
996 stp = get_class_trans_subtype_next(tp)) {
997 fprintf(F, "\n %s", get_type_name(stp));
1001 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1008 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1009 for (i = 0; i < get_compound_n_members(tp); ++i) {
1010 entity *mem = get_compound_member(tp, i);
1011 if (verbosity & dump_verbosity_fields) {
1012 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1018 if (verbosity & dump_verbosity_typeattrs) {
1020 type *elem_tp = get_array_element_type(tp);
1022 fprintf(F, "\n array ");
1024 n_dim = get_array_n_dimensions(tp);
1025 for (i = 0; i < n_dim; ++i) {
1026 ir_node *lower, *upper;
1028 lower = get_array_lower_bound(tp, i);
1029 upper = get_array_upper_bound(tp, i);
1033 if (get_irn_op(lower) == op_Const)
1034 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1036 dump_node_opcode(F, lower);
1037 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1040 if (get_irn_op(upper) == op_Const)
1041 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1043 dump_node_opcode(F, upper);
1044 fprintf(F, " %ld]", get_irn_node_nr(upper));
1047 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1049 fprintf(F, "\n order: ");
1050 for (i = 0; i < n_dim; ++i)
1051 fprintf(F, "<%d>", get_array_order(tp, i));
1055 if (verbosity & dump_verbosity_fields) {
1056 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1063 if (verbosity & dump_verbosity_typeattrs) {
1064 type *tt = get_pointer_points_to_type(tp);
1065 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1070 if (verbosity & dump_verbosity_typeattrs) {
1071 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1072 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1073 for (i = 0; i < get_method_n_ress(tp); ++i) {
1074 type *rtp = get_method_res_type(tp, i);
1075 fprintf(F, "\n %s", get_type_name(rtp));
1078 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1079 for (i = 0; i < get_method_n_params(tp); ++i) {
1080 type *ptp = get_method_param_type(tp, i);
1081 fprintf(F, "\n %s", get_type_name(ptp));
1083 if (get_method_variadicity(tp)) {
1084 fprintf(F, "\n ...");
1098 if (verbosity & dump_verbosity_typeattrs) {
1099 fprintf(F, ": details not implemented\n");
1103 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1104 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1105 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1106 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1107 if (is_atomic_type(tp) || is_Method_type(tp))
1108 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1110 if (get_trouts_state()) {
1111 fprintf(F, "\n Type outs:\n");
1112 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1113 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1114 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1115 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1116 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1120 if (verbosity & dump_verbosity_accessStats) {
1122 int n_all = get_type_n_allocs(tp);
1127 /* Find maximal depth */
1128 for (i = 0; i < n_all; ++i) {
1129 ir_node *all = get_type_alloc(tp, i);
1130 int depth = get_weighted_loop_depth(all);
1131 max_depth = (depth > max_depth) ? depth : max_depth ;
1134 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1136 for (i = 0; i < n_all; ++i) {
1137 ir_node *all = get_type_alloc(tp, i);
1138 int depth = get_weighted_loop_depth(all);
1139 assert(depth <= max_depth);
1141 max_freq = (depth > max_freq) ? depth : max_freq;
1142 assert(get_irn_op(all) == op_Alloc);
1145 if (max_freq >= 0) {
1148 fprintf(F, " Alloc Stats");
1149 for (i = 0; i <= max_freq; ++i) {
1150 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1158 if (get_trouts_state() != outs_none) {
1159 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1160 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1161 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1162 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1163 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1164 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1173 void dump_type(type *tp) {
1174 dump_type_to_file (stdout, tp, dump_verbosity_max);
1178 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1179 const char *basename;
1180 FILE *F, *CSV = NULL;
1181 int i, n_types = get_irp_n_types();
1183 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1184 F = text_open (basename, suffix, "-types", ".txt");
1186 if (verbosity & dump_verbosity_csv) {
1187 CSV = text_open (basename, suffix, "-types", ".csv");
1188 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1191 for (i = 0; i < n_types; ++i) {
1192 type *t = get_irp_type(i);
1194 //if (is_jack_rts_class(t)) continue;
1196 dump_type_to_file(F, t, verbosity);
1198 dump_typecsv_to_file(CSV, t, verbosity, "");
1203 if (CSV) fclose (CSV);
1207 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1208 const char *basename;
1209 FILE *F, *CSV = NULL;
1210 type *g = get_glob_type();
1211 int i, n_mems = get_class_n_members(g);
1213 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1214 F = text_open (basename, suffix, "-globals", ".txt");
1216 if (verbosity & dump_verbosity_csv) {
1217 CSV = text_open (basename, suffix, "-types", ".csv");
1218 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1221 for (i = 0; i < n_mems; ++i) {
1222 entity *e = get_class_member(g, i);
1224 dump_entity_to_file(F, e, verbosity);
1226 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1231 if (CSV) fclose (CSV);