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 /* Write the irnode and all its attributes to the file passed. */
87 int dump_irnode_to_file(FILE *F, ir_node *n) {
92 dump_node_opcode(F, n);
93 fprintf(F, " %ld\n", get_irn_node_nr(n));
95 fprintf(F, " index: %u\n", get_irn_idx(n));
96 if (opt_dump_pointer_values_to_info)
97 fprintf (F, " addr: %p \n", (void *)n);
98 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
99 fprintf (F, " visited: %ld \n", get_irn_visited(n));
100 irg = get_irn_irg(n);
101 if (irg != get_const_code_irg())
102 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
104 if (get_irn_pinned(n) == op_pin_state_floats &&
105 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
106 fprintf(F, " node was pinned in ");
107 dump_node_opcode(F, get_irn_n(n, -1));
108 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
111 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
112 /* show all predecessor nodes */
113 fprintf(F, " pred nodes: \n");
116 dump_node_opcode(F, get_irn_n(n, -1));
117 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
119 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
120 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
121 dump_node_opcode(F, get_irn_intra_n(n, i));
122 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
125 fprintf(F, " Private Attributes:\n");
127 if (get_irn_opcode(n) == iro_Proj)
128 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
130 if ((get_irp_ip_view_state() != ip_view_no)
131 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
132 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
133 fprintf(F, " inter pred nodes: \n");
134 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
135 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
136 dump_node_opcode(F, get_irn_inter_n(n, i));
137 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
141 if (is_fragile_op(n)) {
142 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
143 /* not dumped: frag array */
146 /* This is not nice, output it as a marker in the predecessor list. */
147 if ((get_irn_op(n) == op_Block) ||
148 (get_irn_op(n) == op_Phi) ||
149 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
150 fprintf(F, " backedges:");
152 for (i = 0; i < get_irn_arity(n); i++)
153 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
157 /* Loop node. Someone else please tell me what's wrong ... */
158 if (get_irn_loop(n)) {
159 ir_loop *loop = get_irn_loop(n);
161 fprintf(F, " in loop %d with depth %d\n",
162 get_loop_loop_nr(loop), get_loop_depth(loop));
167 switch (get_irn_opcode(n)) {
169 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
170 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
171 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
172 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
173 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
176 fprintf(F, " Execution freqency statistics:\n");
177 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
178 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
179 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
180 fprintf(F, " call freqency of procedure: %8.2lf\n",
181 get_irg_method_execution_frequency(get_irn_irg(n)));
182 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
183 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
184 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
185 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
186 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
187 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
189 /* not dumped: graph_arr */
190 /* not dumped: mature */
193 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
194 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
195 for (i = 0; i < get_method_n_params(tp); ++i)
196 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
197 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
198 ir_node *sbl = get_nodes_block(n);
199 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
200 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
201 for (i = 0; i < n_cfgpreds; ++i) {
202 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
203 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
204 get_irg_dump_name(get_irn_irg(cfgpred)));
209 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
210 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
211 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
212 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
215 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
216 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
219 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
220 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
223 entity *ent = get_Sel_entity(n);
225 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
226 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
227 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
230 fprintf(F, " <NULL entity>\n");
235 ir_type *tp = get_Call_type(n);
236 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
237 if(get_unknown_type() != tp) {
238 for (i = 0; i < get_method_n_params(tp); ++i)
239 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
240 for (i = 0; i < get_method_n_ress(tp); ++i)
241 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
243 if (Call_has_callees(n)) {
244 fprintf(F, " possible callees: \n");
245 for (i = 0; i < get_Call_n_callees(n); i++) {
246 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
250 case iro_CallBegin: {
251 ir_node *call = get_CallBegin_call(n);
252 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
253 if (Call_has_callees(call)) {
254 fprintf(F, " possible callees: \n");
255 for (i = 0; i < get_Call_n_callees(call); i++) {
256 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
261 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
264 if (!get_interprocedural_view()) {
265 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
266 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
267 for (i = 0; i < get_method_n_ress(tp); ++i)
268 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
272 ir_type *tp = get_Const_type(n);
273 assert(tp != firm_none_type);
274 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
277 switch(get_SymConst_kind(n)) {
278 case symconst_addr_name:
279 fprintf(F, " kind: addr_name\n");
280 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
282 case symconst_addr_ent:
283 fprintf(F, " kind: addr_ent\n");
284 fprintf(F, " entity: ");
285 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
287 case symconst_type_tag:
288 fprintf(F, " kind: type_tag\n");
289 fprintf(F, " type: ");
290 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
293 fprintf(F, " kind: size\n");
294 fprintf(F, " type: ");
295 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
298 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
301 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
302 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
305 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
308 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
314 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
315 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
316 if (get_irn_typeinfo_type(n) != firm_none_type)
317 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
324 void dump_irnode(ir_node *n) {
325 dump_irnode_to_file(stdout, n);
329 void dump_graph_to_file(FILE *F, ir_graph *irg) {
330 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
333 void dump_graph(ir_graph *g) {
334 dump_graph_to_file(stdout, g);
337 static void dump_node_to_graph_file(ir_node *n, void *env) {
338 FILE *F = (FILE *)env;
340 dump_irnode_to_file(F, n);
344 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
345 const char *basename = get_irg_dump_name(irg);
348 F = text_open (basename, suffix, "", ".txt");
350 dump_graph_to_file(F, irg);
352 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
358 int addr_is_alloc(ir_node *acc) {
359 ir_node *addr = NULL;
362 addr = get_memop_ptr(acc);
364 assert(is_Call(acc));
365 addr = get_Call_ptr(acc);
368 addr_op = get_irn_opcode(addr);
370 while (addr_op != iro_Alloc) {
374 addr = get_Sel_ptr(addr);
377 addr = get_Cast_op(addr);
380 addr = get_Proj_pred(addr);
395 //assert(0 && "unexpected address node");
398 addr_op = get_irn_opcode(addr);
401 /* In addition, the alloc must be in the same loop. */
406 /** dumps something like:
408 * "prefix" "Name" (x): node1, ... node7,\n
409 * "prefix" node8, ... node15,\n
410 * "prefix" node16, node17\n
412 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
413 int (*get_entity_n_nodes)(firm_kind *ent),
414 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
416 int i, n_nodes = get_entity_n_nodes(k);
419 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
420 for (i = 0; i < n_nodes; ++i) {
422 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
423 fprintf(F, ",\n%s ", prefix);
426 fprintf(F, "%s ", comma);
427 rem = opt_dump_analysed_type_info;
428 opt_dump_analysed_type_info = 0;
429 dump_node_label(F, get_entity_node(k, i));
430 opt_dump_analysed_type_info = rem;
436 /** dumps something like:
438 * "prefix" "Name" (x): node1, ... node7,\n
439 * "prefix" node8, ... node15,\n
440 * "prefix" node16, node17\n
442 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
443 int (*get_n_types)(ir_type *tp),
444 ir_type *(*get_type)(ir_type *tp, int pos),
446 int i, n_nodes = get_n_types(tp);
449 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
450 for (i = 0; i < n_nodes; ++i) {
451 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
452 fprintf(F, ",\n%s ", prefix);
455 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
456 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
462 #define X(a) case a: fprintf(F, #a); break
463 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
465 ir_type *owner, *type;
467 assert(is_entity(ent));
468 owner = get_entity_owner(ent);
469 type = get_entity_type(ent);
470 if (verbosity & dump_verbosity_onlynames) {
471 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
472 get_entity_name(ent), get_entity_nr(ent));
476 if (verbosity & dump_verbosity_entattrs) {
477 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
478 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
479 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
481 if (is_Class_type(get_entity_owner(ent))) {
482 if (get_entity_n_overwrites(ent) > 0) {
483 fprintf(F, "%s overwrites:\n", prefix);
484 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
485 entity *ov = get_entity_overwrites(ent, i);
486 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
487 get_type_name(get_entity_owner(ov)));
490 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
492 if (get_entity_n_overwrittenby(ent) > 0) {
493 fprintf(F, "%s overwritten by:\n", prefix);
494 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
495 entity *ov = get_entity_overwrittenby(ent, i);
496 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
497 get_type_name(get_entity_owner(ov)));
500 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
503 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
505 fprintf(F, "%s transitive overwrites:\n", prefix);
506 for (ov = get_entity_trans_overwrites_first(ent);
508 ov = get_entity_trans_overwrites_next(ent)) {
509 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
510 get_type_name(get_entity_owner(ov)));
512 fprintf(F, "%s transitive overwritten by:\n", prefix);
513 for (ov = get_entity_trans_overwrittenby_first(ent);
515 ov = get_entity_trans_overwrittenby_next(ent)) {
516 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
517 get_type_name(get_entity_owner(ov)));
522 fprintf(F, "%s allocation: ", prefix);
523 switch (get_entity_allocation(ent)) {
524 X(allocation_dynamic);
525 X(allocation_automatic);
526 X(allocation_static);
527 X(allocation_parameter);
530 fprintf(F, "\n%s visibility: ", prefix);
531 switch (get_entity_visibility(ent)) {
533 X(visibility_external_visible);
534 X(visibility_external_allocated);
537 fprintf(F, "\n%s variability: ", prefix);
538 switch (get_entity_variability(ent)) {
539 X(variability_uninitialized);
540 X(variability_initialized);
541 X(variability_part_constant);
542 X(variability_constant);
545 if (is_Method_type(get_entity_type(ent))) {
546 unsigned mask = get_entity_additional_properties(ent);
547 unsigned cc = get_method_calling_convention(get_entity_type(ent));
548 ir_graph *irg = get_entity_irg(ent);
551 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
552 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
556 fprintf(F, "\n%s additional prop: ", prefix);
558 if (mask & mtp_property_const) fprintf(F, "const_function, ");
559 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
560 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
561 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
562 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
564 fprintf(F, "\n%s calling convention: ", prefix);
565 if (cc & cc_reg_param) fprintf(F, "regparam, ");
566 if (cc & cc_this_call) fprintf(F, "thiscall, ");
569 else if (IS_STDCALL(cc))
570 fprintf(F, "stdcall");
572 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
573 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
578 } else { /* no entattrs */
579 fprintf(F, "%s(%3d) %*s: %s", prefix,
580 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
581 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
583 if (verbosity & dump_verbosity_accessStats) {
584 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
585 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
586 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
591 if (verbosity & dump_verbosity_entconsts) {
592 if (get_entity_variability(ent) != variability_uninitialized) {
593 if (is_atomic_entity(ent)) {
594 fprintf(F, "%s atomic value: ", prefix);
595 dump_node_opcode(F, get_atomic_ent_value(ent));
597 fprintf(F, "%s compound values:", prefix);
598 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
599 compound_graph_path *path = get_compound_ent_value_path(ent, i);
600 entity *ent0 = get_compound_graph_path_node(path, 0);
601 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
602 if (get_type_state(type) == layout_fixed)
603 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
604 fprintf(F, "%s", get_entity_name(ent));
605 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
606 entity *node = get_compound_graph_path_node(path, j);
607 fprintf(F, ".%s", get_entity_name(node));
608 if (is_Array_type(get_entity_owner(node)))
609 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
612 dump_node_opcode(F, get_compound_ent_value(ent, i));
619 if (verbosity & dump_verbosity_entattrs) {
620 fprintf(F, "%s volatility: ", prefix);
621 switch (get_entity_volatility(ent)) {
622 X(volatility_non_volatile);
623 X(volatility_is_volatile);
626 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
627 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
628 fprintf(F, "\n%s offset: %d bits, %d bytes", prefix, get_entity_offset_bits(ent), get_entity_offset_bytes(ent));
629 if (is_Method_type(get_entity_type(ent))) {
630 if (get_entity_irg(ent)) /* can be null */ {
631 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
632 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
633 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
634 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
637 fprintf(F, "\n%s irg = NULL", prefix);
643 if (get_trouts_state()) {
644 fprintf(F, "%s Entity outs:\n", prefix);
645 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
646 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
647 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
648 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
651 if (verbosity & dump_verbosity_accessStats) {
653 int n_acc = get_entity_n_accesses(ent);
657 int max_LA_freq = -1;
658 int max_SA_freq = -1;
664 /* Find maximal depth */
665 for (i = 0; i < n_acc; ++i) {
666 ir_node *acc = get_entity_access(ent, i);
667 int depth = get_weighted_loop_depth(acc);
668 max_depth = (depth > max_depth) ? depth : max_depth ;
671 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
673 S_freq = L_freq + 1*max_depth;
674 LA_freq = L_freq + 2*max_depth;
675 SA_freq = L_freq + 3*max_depth;
677 for (i = 0; i < n_acc; ++i) {
678 ir_node *acc = get_entity_access(ent, i);
679 int depth = get_weighted_loop_depth(acc);
680 assert(depth < max_depth);
681 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
683 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
684 if (addr_is_alloc(acc)) {
686 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
688 } else if (get_irn_op(acc) == op_Store) {
690 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
691 if (addr_is_alloc(acc)) {
693 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
700 if (max_L_freq >= 0) {
703 fprintf(F, "%s Load Stats", prefix);
704 for (i = 0; i <= max_L_freq; ++i) {
706 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
713 if (max_LA_freq >= 0) {
714 //fprintf(F, "%s LoadA Stats", prefix);
716 for (i = 0; i <= max_LA_freq; ++i) {
718 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
725 if (max_S_freq >= 0) {
728 fprintf(F, "%s Store Stats", prefix);
729 for (i = 0; i <= max_S_freq; ++i) {
731 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
738 if (max_SA_freq >= 0) {
739 //fprintf(F, "%s StoreAStats", prefix);
741 for (i = 0; i <= max_SA_freq; ++i) {
743 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
751 /* free allocated space */
754 if (get_trouts_state() != outs_none) {
755 if (is_Method_type(get_entity_type(ent))) {
756 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
757 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
759 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
760 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
768 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
769 dump_entity_to_file_prefix (F, ent, "", verbosity);
773 void dump_entity (entity *ent) {
774 dump_entity_to_file(stdout, ent, dump_verbosity_max);
777 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
778 int *max_disp, int disp[], const char *comma) {
780 #if 0 /* Outputs loop depth of all occurrences. */
781 int n_acc = get_entity_n_accesses(ent);
784 int max_LA_freq = -1;
785 int max_SA_freq = -1;
790 int i, max_depth = 0;
792 /* Find maximal depth */
793 for (i = 0; i < n_acc; ++i) {
794 ir_node *acc = get_entity_access(ent, i);
795 int depth = get_weighted_loop_depth(acc);
796 max_depth = (depth > max_depth) ? depth : max_depth ;
799 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
801 S_freq = L_freq + 1*max_depth;
802 LA_freq = L_freq + 2*max_depth;
803 SA_freq = L_freq + 3*max_depth;
805 for (i = 0; i < n_acc; ++i) {
806 ir_node *acc = get_entity_access(ent, i);
807 int depth = get_weighted_loop_depth(acc);
808 assert(depth <= max_depth);
809 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
811 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
812 if (addr_is_alloc(acc)) {
814 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
816 if (get_entity_allocation(ent) == allocation_static) {
818 *max_disp = (depth > *max_disp) ? depth : *max_disp;
820 } else if (get_irn_op(acc) == op_Store) {
822 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
823 if (addr_is_alloc(acc)) {
825 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
827 if (get_entity_allocation(ent) == allocation_static) {
835 if (get_entity_allocation(ent) != allocation_static) {
837 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
839 if (max_L_freq >= 0) {
840 fprintf(F, "%s Load", comma);
841 for (i = 0; i <= max_L_freq; ++i) {
842 fprintf(F, "%s %d", comma, L_freq[i]);
845 if (max_S_freq >= 0) {
846 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
847 fprintf(F, "%s Store", comma);
848 for (i = 0; i <= max_S_freq; ++i) {
849 fprintf(F, "%s %d", comma, S_freq[i]);
857 if (get_entity_allocation(ent) != allocation_static) {
858 if (is_Method_type(get_entity_type(ent))) return;
860 /* Output the entity name. */
861 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
863 if (get_trouts_state() != outs_none) {
864 if (is_Method_type(get_entity_type(ent))) {
865 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
866 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
868 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
869 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
877 /* A fast hack to dump a csv. */
878 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
881 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
883 if (verbosity & dump_verbosity_accessStats) {
885 #if 0 /* Outputs loop depth of all occurrences. */
888 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
889 int n_all = get_type_n_allocs(tp);
891 /* Find maximal depth */
892 for (i = 0; i < n_all; ++i) {
893 ir_node *all = get_type_alloc(tp, i);
894 int depth = get_weighted_loop_depth(all);
895 max_depth = (depth > max_depth) ? depth : max_depth ;
898 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
900 disp = freq + max_depth;
902 for (i = 0; i < n_all; ++i) {
903 ir_node *all = get_type_alloc(tp, i);
904 int depth = get_weighted_loop_depth(all);
905 assert(depth <= max_depth);
907 max_freq = (depth > max_freq) ? depth : max_freq;
908 assert(get_irn_op(all) == op_Alloc);
911 fprintf(F, "%s ", get_type_name(tp));
912 fprintf(F, "%s Alloc ", comma);
915 for (i = 0; i <= max_freq; ++i) {
916 fprintf(F, "%s %d", comma, freq[i]);
921 for (i = 0; i < get_class_n_members(tp); ++i) {
922 entity *mem = get_class_member(tp, i);
923 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
924 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
925 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
926 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
932 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
933 for (i = 0; i <= max_disp; ++i) {
934 fprintf(F, "%s %d", comma, disp[i]);
939 /* free allocated space */
943 #define DISP_TAB_SUFFIX "__disp_tab"
944 if (get_trouts_state() != outs_none) {
945 assert(strlen(get_type_name(tp)) < 1024);
946 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
947 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
948 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
951 for (i = 0; i < get_class_n_members(tp); ++i) {
952 entity *mem = get_class_member(tp, i);
953 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
954 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
955 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
956 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
963 void dump_type_to_file (FILE *F, ir_type *tp, dump_verbosity verbosity) {
966 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
967 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
968 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
969 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
970 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
971 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
972 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
973 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
975 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
976 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
978 switch (get_type_tpop_code(tp)) {
981 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
982 fprintf(F, "\n members: \n");
984 for (i = 0; i < get_class_n_members(tp); ++i) {
985 entity *mem = get_class_member(tp, i);
986 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
987 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
988 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
989 dump_entity_to_file_prefix(F, mem, " ", verbosity);
993 if (verbosity & dump_verbosity_typeattrs) {
994 fprintf(F, " supertypes: ");
995 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
996 ir_type *stp = get_class_supertype(tp, i);
997 fprintf(F, "\n %s", get_type_name(stp));
999 fprintf(F, "\n subtypes: ");
1000 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1001 ir_type *stp = get_class_subtype(tp, i);
1002 fprintf(F, "\n %s", get_type_name(stp));
1005 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1007 fprintf(F, "\n transitive supertypes: ");
1008 for (stp = get_class_trans_supertype_first(tp);
1010 stp = get_class_trans_supertype_next(tp)) {
1011 fprintf(F, "\n %s", get_type_name(stp));
1013 fprintf(F, "\n transitive subtypes: ");
1014 for (stp = get_class_trans_subtype_first(tp);
1016 stp = get_class_trans_subtype_next(tp)) {
1017 fprintf(F, "\n %s", get_type_name(stp));
1021 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1028 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1029 for (i = 0; i < get_compound_n_members(tp); ++i) {
1030 entity *mem = get_compound_member(tp, i);
1031 if (verbosity & dump_verbosity_fields) {
1032 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1038 if (verbosity & dump_verbosity_typeattrs) {
1040 ir_type *elem_tp = get_array_element_type(tp);
1042 fprintf(F, "\n array ");
1044 n_dim = get_array_n_dimensions(tp);
1045 for (i = 0; i < n_dim; ++i) {
1046 ir_node *lower, *upper;
1048 lower = get_array_lower_bound(tp, i);
1049 upper = get_array_upper_bound(tp, i);
1053 if (get_irn_op(lower) == op_Const)
1054 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1056 dump_node_opcode(F, lower);
1057 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1060 if (get_irn_op(upper) == op_Const)
1061 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1063 dump_node_opcode(F, upper);
1064 fprintf(F, " %ld]", get_irn_node_nr(upper));
1067 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1069 fprintf(F, "\n order: ");
1070 for (i = 0; i < n_dim; ++i)
1071 fprintf(F, "<%d>", get_array_order(tp, i));
1075 if (verbosity & dump_verbosity_fields) {
1076 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1083 if (verbosity & dump_verbosity_typeattrs) {
1084 ir_type *tt = get_pointer_points_to_type(tp);
1085 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1090 if (verbosity & dump_verbosity_typeattrs) {
1091 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1092 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1093 for (i = 0; i < get_method_n_ress(tp); ++i) {
1094 ir_type *rtp = get_method_res_type(tp, i);
1095 fprintf(F, "\n %s", get_type_name(rtp));
1098 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1099 for (i = 0; i < get_method_n_params(tp); ++i) {
1100 ir_type *ptp = get_method_param_type(tp, i);
1101 fprintf(F, "\n %s", get_type_name(ptp));
1103 if (get_method_variadicity(tp)) {
1104 fprintf(F, "\n ...");
1118 if (verbosity & dump_verbosity_typeattrs) {
1119 fprintf(F, ": details not implemented\n");
1123 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1124 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1125 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1126 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1127 if (is_atomic_type(tp) || is_Method_type(tp))
1128 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1130 if (get_trouts_state()) {
1131 fprintf(F, "\n Type outs:\n");
1132 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1133 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1134 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1135 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1136 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1140 if (verbosity & dump_verbosity_accessStats) {
1142 int n_all = get_type_n_allocs(tp);
1147 /* Find maximal depth */
1148 for (i = 0; i < n_all; ++i) {
1149 ir_node *all = get_type_alloc(tp, i);
1150 int depth = get_weighted_loop_depth(all);
1151 max_depth = (depth > max_depth) ? depth : max_depth ;
1154 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1156 for (i = 0; i < n_all; ++i) {
1157 ir_node *all = get_type_alloc(tp, i);
1158 int depth = get_weighted_loop_depth(all);
1159 assert(depth <= max_depth);
1161 max_freq = (depth > max_freq) ? depth : max_freq;
1162 assert(get_irn_op(all) == op_Alloc);
1165 if (max_freq >= 0) {
1168 fprintf(F, " Alloc Stats");
1169 for (i = 0; i <= max_freq; ++i) {
1170 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1178 if (get_trouts_state() != outs_none) {
1179 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1180 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1181 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1182 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1183 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1184 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1193 void dump_type(ir_type *tp) {
1194 dump_type_to_file (stdout, tp, dump_verbosity_max);
1198 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1199 const char *basename;
1200 FILE *F, *CSV = NULL;
1201 int i, n_types = get_irp_n_types();
1203 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1204 F = text_open (basename, suffix, "-types", ".txt");
1206 if (verbosity & dump_verbosity_csv) {
1207 CSV = text_open (basename, suffix, "-types", ".csv");
1208 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1211 for (i = 0; i < n_types; ++i) {
1212 ir_type *t = get_irp_type(i);
1214 //if (is_jack_rts_class(t)) continue;
1216 dump_type_to_file(F, t, verbosity);
1218 dump_typecsv_to_file(CSV, t, verbosity, "");
1223 if (CSV) fclose (CSV);
1227 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1228 const char *basename;
1229 FILE *F, *CSV = NULL;
1230 ir_type *g = get_glob_type();
1231 int i, n_mems = get_class_n_members(g);
1233 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1234 F = text_open (basename, suffix, "-globals", ".txt");
1236 if (verbosity & dump_verbosity_csv) {
1237 CSV = text_open (basename, suffix, "-types", ".csv");
1238 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1241 for (i = 0; i < n_mems; ++i) {
1242 entity *e = get_class_member(g, i);
1244 dump_entity_to_file(F, e, verbosity);
1246 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1251 if (CSV) fclose (CSV);