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 if (opt_dump_pointer_values_to_info)
96 fprintf (F, " addr: %p \n", (void *)n);
97 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
98 fprintf (F, " visited: %ld \n", get_irn_visited(n));
100 if (irg != get_const_code_irg())
101 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
103 if (get_irn_pinned(n) == op_pin_state_floats &&
104 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
105 fprintf(F, " node was pinned in ");
106 dump_node_opcode(F, get_irn_n(n, -1));
107 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
110 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
111 /* show all predecessor nodes */
112 fprintf(F, " pred nodes: \n");
115 dump_node_opcode(F, get_irn_n(n, -1));
116 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
118 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
119 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
120 dump_node_opcode(F, get_irn_intra_n(n, i));
121 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
124 fprintf(F, " Private Attributes:\n");
126 if (get_irn_opcode(n) == iro_Proj)
127 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
129 if ((get_irp_ip_view_state() != ip_view_no)
130 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
131 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
132 fprintf(F, " inter pred nodes: \n");
133 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
134 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
135 dump_node_opcode(F, get_irn_inter_n(n, i));
136 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
140 if (is_fragile_op(n)) {
141 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
142 /* not dumped: frag array */
145 /* This is not nice, output it as a marker in the predecessor list. */
146 if ((get_irn_op(n) == op_Block) ||
147 (get_irn_op(n) == op_Phi) ||
148 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
149 fprintf(F, " backedges:");
151 for (i = 0; i < get_irn_arity(n); i++)
152 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
156 /* Loop node. Someone else please tell me what's wrong ... */
157 if (get_irn_loop(n)) {
158 ir_loop *loop = get_irn_loop(n);
160 fprintf(F, " in loop %d with depth %d\n",
161 get_loop_loop_nr(loop), get_loop_depth(loop));
166 switch (get_irn_opcode(n)) {
168 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
169 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
170 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
171 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
172 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
175 fprintf(F, " Execution freqency statistics:\n");
176 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
177 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
178 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
179 fprintf(F, " call freqency of procedure: %8.2lf\n",
180 get_irg_method_execution_frequency(get_irn_irg(n)));
181 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
182 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
183 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
184 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
185 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
186 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
188 /* not dumped: graph_arr */
189 /* not dumped: mature */
192 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
193 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
194 for (i = 0; i < get_method_n_params(tp); ++i)
195 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
196 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
197 ir_node *sbl = get_nodes_block(n);
198 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
199 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
200 for (i = 0; i < n_cfgpreds; ++i) {
201 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
202 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
203 get_irg_dump_name(get_irn_irg(cfgpred)));
208 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
209 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
210 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
211 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
214 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
215 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
218 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
219 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
222 entity *ent = get_Sel_entity(n);
224 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
225 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
226 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
229 fprintf(F, " <NULL entity>\n");
234 type *tp = get_Call_type(n);
235 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
236 if(get_unknown_type() != tp) {
237 for (i = 0; i < get_method_n_params(tp); ++i)
238 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
239 for (i = 0; i < get_method_n_ress(tp); ++i)
240 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
242 if (Call_has_callees(n)) {
243 fprintf(F, " possible callees: \n");
244 for (i = 0; i < get_Call_n_callees(n); i++) {
245 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
249 case iro_CallBegin: {
250 ir_node *call = get_CallBegin_call(n);
251 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
252 if (Call_has_callees(call)) {
253 fprintf(F, " possible callees: \n");
254 for (i = 0; i < get_Call_n_callees(call); i++) {
255 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
260 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
263 if (!get_interprocedural_view()) {
264 type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
265 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
266 for (i = 0; i < get_method_n_ress(tp); ++i)
267 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
271 type *tp = get_Const_type(n);
272 assert(tp != firm_none_type);
273 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
276 switch(get_SymConst_kind(n)) {
277 case symconst_addr_name:
278 fprintf(F, " kind: addr_name\n");
279 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
281 case symconst_addr_ent:
282 fprintf(F, " kind: addr_ent\n");
283 fprintf(F, " entity: ");
284 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
286 case symconst_type_tag:
287 fprintf(F, " kind: type_tag\n");
288 fprintf(F, " type: ");
289 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
292 fprintf(F, " kind: size\n");
293 fprintf(F, " type: ");
294 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
297 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
300 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
301 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
304 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
307 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
313 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
314 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
315 if (get_irn_typeinfo_type(n) != firm_none_type)
316 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
323 void dump_irnode(ir_node *n) {
324 dump_irnode_to_file(stdout, n);
328 void dump_graph_to_file(FILE *F, ir_graph *irg) {
329 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
332 void dump_graph(ir_graph *g) {
333 dump_graph_to_file(stdout, g);
336 static void dump_node_to_graph_file(ir_node *n, void *env) {
337 FILE *F = (FILE *)env;
339 dump_irnode_to_file(F, n);
343 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
344 const char *basename = get_irg_dump_name(irg);
347 F = text_open (basename, suffix, "", ".txt");
349 dump_graph_to_file(F, irg);
351 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
357 int addr_is_alloc(ir_node *acc) {
358 ir_node *addr = NULL;
361 addr = get_memop_ptr(acc);
363 assert(get_irn_op(acc) == op_Call);
364 addr = get_Call_ptr(acc);
367 addr_op = get_irn_opcode(addr);
369 while (addr_op != iro_Alloc) {
373 addr = get_Sel_ptr(addr);
376 addr = get_Cast_op(addr);
379 addr = get_Proj_pred(addr);
394 //assert(0 && "unexpected address node");
397 addr_op = get_irn_opcode(addr);
400 /* In addition, the alloc must be in the same loop. */
405 /** dumps something like:
407 * "prefix" "Name" (x): node1, ... node7,\n
408 * "prefix" node8, ... node15,\n
409 * "prefix" node16, node17\n
411 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
412 int (*get_entity_n_nodes)(firm_kind *ent),
413 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
415 int i, n_nodes = get_entity_n_nodes(k);
418 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
419 for (i = 0; i < n_nodes; ++i) {
421 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
422 fprintf(F, ",\n%s ", prefix);
425 fprintf(F, "%s ", comma);
426 rem = opt_dump_analysed_type_info;
427 opt_dump_analysed_type_info = 0;
428 dump_node_label(F, get_entity_node(k, i));
429 opt_dump_analysed_type_info = rem;
435 /** dumps something like:
437 * "prefix" "Name" (x): node1, ... node7,\n
438 * "prefix" node8, ... node15,\n
439 * "prefix" node16, node17\n
441 static void dump_type_list(FILE *F, type *tp, char *prefix,
442 int (*get_n_types)(type *tp),
443 type *(*get_type)(type *tp, int pos),
445 int i, n_nodes = get_n_types(tp);
448 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
449 for (i = 0; i < n_nodes; ++i) {
450 if (i > 7 && !(i & 7)) { /* line break every eigth node. */
451 fprintf(F, ",\n%s ", prefix);
454 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
455 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
461 #define X(a) case a: fprintf(F, #a); break
462 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
466 assert(is_entity(ent));
467 owner = get_entity_owner(ent);
468 type = get_entity_type(ent);
469 if (verbosity & dump_verbosity_onlynames) {
470 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
471 get_entity_name(ent), get_entity_nr(ent));
475 if (verbosity & dump_verbosity_entattrs) {
476 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
477 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
478 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
480 if (is_Class_type(get_entity_owner(ent))) {
481 if (get_entity_n_overwrites(ent) > 0) {
482 fprintf(F, "%s overwrites:\n", prefix);
483 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
484 entity *ov = get_entity_overwrites(ent, i);
485 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
486 get_type_name(get_entity_owner(ov)));
489 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
491 if (get_entity_n_overwrittenby(ent) > 0) {
492 fprintf(F, "%s overwritten by:\n", prefix);
493 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
494 entity *ov = get_entity_overwrittenby(ent, i);
495 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
496 get_type_name(get_entity_owner(ov)));
499 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
502 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
504 fprintf(F, "%s transitive overwrites:\n", prefix);
505 for (ov = get_entity_trans_overwrites_first(ent);
507 ov = get_entity_trans_overwrites_next(ent)) {
508 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
509 get_type_name(get_entity_owner(ov)));
511 fprintf(F, "%s transitive overwritten by:\n", prefix);
512 for (ov = get_entity_trans_overwrittenby_first(ent);
514 ov = get_entity_trans_overwrittenby_next(ent)) {
515 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
516 get_type_name(get_entity_owner(ov)));
521 fprintf(F, "%s allocation: ", prefix);
522 switch (get_entity_allocation(ent)) {
523 X(allocation_dynamic);
524 X(allocation_automatic);
525 X(allocation_static);
526 X(allocation_parameter);
529 fprintf(F, "\n%s visibility: ", prefix);
530 switch (get_entity_visibility(ent)) {
532 X(visibility_external_visible);
533 X(visibility_external_allocated);
536 fprintf(F, "\n%s variability: ", prefix);
537 switch (get_entity_variability(ent)) {
538 X(variability_uninitialized);
539 X(variability_initialized);
540 X(variability_part_constant);
541 X(variability_constant);
544 if (is_Method_type(get_entity_type(ent))) {
545 unsigned mask = get_entity_additional_properties(ent);
546 unsigned cc = get_method_calling_convention(get_entity_type(ent));
549 fprintf(F, "\n%s additional prop: ", prefix);
551 if (mask & mtp_property_const) fprintf(F, "const_function, ");
552 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
553 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
554 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
555 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
557 fprintf(F, "\n%s calling convention: ", prefix);
558 if (cc & cc_reg_param) fprintf(F, "regparam, ");
559 if (cc & cc_this_call) fprintf(F, "thiscall, ");
562 else if (IS_STDCALL(cc))
563 fprintf(F, "stdcall");
565 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
566 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
571 } else { /* no entattrs */
572 fprintf(F, "%s(%3d) %*s: %s", prefix,
573 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
574 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
576 if (verbosity & dump_verbosity_accessStats) {
577 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
578 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
579 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
584 if (verbosity & dump_verbosity_entconsts) {
585 if (get_entity_variability(ent) != variability_uninitialized) {
586 if (is_atomic_entity(ent)) {
587 fprintf(F, "%s atomic value: ", prefix);
588 dump_node_opcode(F, get_atomic_ent_value(ent));
590 fprintf(F, "%s compound values:", prefix);
591 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
592 compound_graph_path *path = get_compound_ent_value_path(ent, i);
593 entity *ent0 = get_compound_graph_path_node(path, 0);
594 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
595 if (get_type_state(type) == layout_fixed)
596 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
597 fprintf(F, "%s", get_entity_name(ent));
598 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
599 entity *node = get_compound_graph_path_node(path, j);
600 fprintf(F, ".%s", get_entity_name(node));
601 if (is_Array_type(get_entity_owner(node)))
602 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
605 dump_node_opcode(F, get_compound_ent_value(ent, i));
612 if (verbosity & dump_verbosity_entattrs) {
613 fprintf(F, "%s volatility: ", prefix);
614 switch (get_entity_volatility(ent)) {
615 X(volatility_non_volatile);
616 X(volatility_is_volatile);
619 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_string(get_entity_peculiarity(ent)));
620 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
621 fprintf(F, "\n%s offset: %d bits, %d bytes", prefix, get_entity_offset_bits(ent), get_entity_offset_bytes(ent));
622 if (is_Method_type(get_entity_type(ent))) {
623 if (get_entity_irg(ent)) /* can be null */ {
624 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
625 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
626 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
627 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
630 fprintf(F, "\n%s irg = NULL", prefix);
636 if (get_trouts_state()) {
637 fprintf(F, "%s Entity outs:\n", prefix);
638 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
639 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
640 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
641 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
644 if (verbosity & dump_verbosity_accessStats) {
646 int n_acc = get_entity_n_accesses(ent);
650 int max_LA_freq = -1;
651 int max_SA_freq = -1;
657 /* Find maximal depth */
658 for (i = 0; i < n_acc; ++i) {
659 ir_node *acc = get_entity_access(ent, i);
660 int depth = get_weighted_loop_depth(acc);
661 max_depth = (depth > max_depth) ? depth : max_depth ;
664 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
666 S_freq = L_freq + 1*max_depth;
667 LA_freq = L_freq + 2*max_depth;
668 SA_freq = L_freq + 3*max_depth;
670 for (i = 0; i < n_acc; ++i) {
671 ir_node *acc = get_entity_access(ent, i);
672 int depth = get_weighted_loop_depth(acc);
673 assert(depth < max_depth);
674 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
676 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
677 if (addr_is_alloc(acc)) {
679 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
681 } else if (get_irn_op(acc) == op_Store) {
683 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
684 if (addr_is_alloc(acc)) {
686 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
693 if (max_L_freq >= 0) {
696 fprintf(F, "%s Load Stats", prefix);
697 for (i = 0; i <= max_L_freq; ++i) {
699 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
706 if (max_LA_freq >= 0) {
707 //fprintf(F, "%s LoadA Stats", prefix);
709 for (i = 0; i <= max_LA_freq; ++i) {
711 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
718 if (max_S_freq >= 0) {
721 fprintf(F, "%s Store Stats", prefix);
722 for (i = 0; i <= max_S_freq; ++i) {
724 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
731 if (max_SA_freq >= 0) {
732 //fprintf(F, "%s StoreAStats", prefix);
734 for (i = 0; i <= max_SA_freq; ++i) {
736 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
744 /* free allocated space */
747 if (get_trouts_state() != outs_none) {
748 if (is_Method_type(get_entity_type(ent))) {
749 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
750 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
752 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
753 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
761 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
762 dump_entity_to_file_prefix (F, ent, "", verbosity);
766 void dump_entity (entity *ent) {
767 dump_entity_to_file(stdout, ent, dump_verbosity_max);
770 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
771 int *max_disp, int disp[], const char *comma) {
773 #if 0 /* Outputs loop depth of all occurrences. */
774 int n_acc = get_entity_n_accesses(ent);
777 int max_LA_freq = -1;
778 int max_SA_freq = -1;
783 int i, max_depth = 0;
785 /* Find maximal depth */
786 for (i = 0; i < n_acc; ++i) {
787 ir_node *acc = get_entity_access(ent, i);
788 int depth = get_weighted_loop_depth(acc);
789 max_depth = (depth > max_depth) ? depth : max_depth ;
792 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
794 S_freq = L_freq + 1*max_depth;
795 LA_freq = L_freq + 2*max_depth;
796 SA_freq = L_freq + 3*max_depth;
798 for (i = 0; i < n_acc; ++i) {
799 ir_node *acc = get_entity_access(ent, i);
800 int depth = get_weighted_loop_depth(acc);
801 assert(depth <= max_depth);
802 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
804 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
805 if (addr_is_alloc(acc)) {
807 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
809 if (get_entity_allocation(ent) == allocation_static) {
811 *max_disp = (depth > *max_disp) ? depth : *max_disp;
813 } else if (get_irn_op(acc) == op_Store) {
815 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
816 if (addr_is_alloc(acc)) {
818 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
820 if (get_entity_allocation(ent) == allocation_static) {
828 if (get_entity_allocation(ent) != allocation_static) {
830 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
832 if (max_L_freq >= 0) {
833 fprintf(F, "%s Load", comma);
834 for (i = 0; i <= max_L_freq; ++i) {
835 fprintf(F, "%s %d", comma, L_freq[i]);
838 if (max_S_freq >= 0) {
839 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
840 fprintf(F, "%s Store", comma);
841 for (i = 0; i <= max_S_freq; ++i) {
842 fprintf(F, "%s %d", comma, S_freq[i]);
850 if (get_entity_allocation(ent) != allocation_static) {
851 if (is_Method_type(get_entity_type(ent))) return;
853 /* Output the entity name. */
854 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
856 if (get_trouts_state() != outs_none) {
857 if (is_Method_type(get_entity_type(ent))) {
858 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
859 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
861 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
862 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
870 /* A fast hack to dump a csv. */
871 void dump_typecsv_to_file(FILE *F, type *tp, dump_verbosity verbosity, const char *comma) {
874 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
876 if (verbosity & dump_verbosity_accessStats) {
878 #if 0 /* Outputs loop depth of all occurrences. */
881 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
882 int n_all = get_type_n_allocs(tp);
884 /* Find maximal depth */
885 for (i = 0; i < n_all; ++i) {
886 ir_node *all = get_type_alloc(tp, i);
887 int depth = get_weighted_loop_depth(all);
888 max_depth = (depth > max_depth) ? depth : max_depth ;
891 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
893 disp = freq + max_depth;
895 for (i = 0; i < n_all; ++i) {
896 ir_node *all = get_type_alloc(tp, i);
897 int depth = get_weighted_loop_depth(all);
898 assert(depth <= max_depth);
900 max_freq = (depth > max_freq) ? depth : max_freq;
901 assert(get_irn_op(all) == op_Alloc);
904 fprintf(F, "%s ", get_type_name(tp));
905 fprintf(F, "%s Alloc ", comma);
908 for (i = 0; i <= max_freq; ++i) {
909 fprintf(F, "%s %d", comma, freq[i]);
914 for (i = 0; i < get_class_n_members(tp); ++i) {
915 entity *mem = get_class_member(tp, i);
916 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
917 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
918 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
919 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
925 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
926 for (i = 0; i <= max_disp; ++i) {
927 fprintf(F, "%s %d", comma, disp[i]);
932 /* free allocated space */
936 #define DISP_TAB_SUFFIX "__disp_tab"
937 if (get_trouts_state() != outs_none) {
938 assert(strlen(get_type_name(tp)) < 1024);
939 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
940 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
941 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
944 for (i = 0; i < get_class_n_members(tp); ++i) {
945 entity *mem = get_class_member(tp, i);
946 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
947 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
948 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
949 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
956 void dump_type_to_file (FILE *F, type *tp, dump_verbosity verbosity) {
959 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
960 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
961 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
962 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
963 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
964 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
965 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
966 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
968 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
969 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
971 switch (get_type_tpop_code(tp)) {
974 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
975 fprintf(F, "\n members: \n");
977 for (i = 0; i < get_class_n_members(tp); ++i) {
978 entity *mem = get_class_member(tp, i);
979 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
980 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
981 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
982 dump_entity_to_file_prefix(F, mem, " ", verbosity);
986 if (verbosity & dump_verbosity_typeattrs) {
987 fprintf(F, " supertypes: ");
988 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
989 type *stp = get_class_supertype(tp, i);
990 fprintf(F, "\n %s", get_type_name(stp));
992 fprintf(F, "\n subtypes: ");
993 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
994 type *stp = get_class_subtype(tp, i);
995 fprintf(F, "\n %s", get_type_name(stp));
998 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1000 fprintf(F, "\n transitive supertypes: ");
1001 for (stp = get_class_trans_supertype_first(tp);
1003 stp = get_class_trans_supertype_next(tp)) {
1004 fprintf(F, "\n %s", get_type_name(stp));
1006 fprintf(F, "\n transitive subtypes: ");
1007 for (stp = get_class_trans_subtype_first(tp);
1009 stp = get_class_trans_subtype_next(tp)) {
1010 fprintf(F, "\n %s", get_type_name(stp));
1014 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1021 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1022 for (i = 0; i < get_compound_n_members(tp); ++i) {
1023 entity *mem = get_compound_member(tp, i);
1024 if (verbosity & dump_verbosity_fields) {
1025 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1031 if (verbosity & dump_verbosity_typeattrs) {
1033 type *elem_tp = get_array_element_type(tp);
1035 fprintf(F, "\n array ");
1037 n_dim = get_array_n_dimensions(tp);
1038 for (i = 0; i < n_dim; ++i) {
1039 ir_node *lower, *upper;
1041 lower = get_array_lower_bound(tp, i);
1042 upper = get_array_upper_bound(tp, i);
1046 if (get_irn_op(lower) == op_Const)
1047 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1049 dump_node_opcode(F, lower);
1050 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1053 if (get_irn_op(upper) == op_Const)
1054 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1056 dump_node_opcode(F, upper);
1057 fprintf(F, " %ld]", get_irn_node_nr(upper));
1060 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1062 fprintf(F, "\n order: ");
1063 for (i = 0; i < n_dim; ++i)
1064 fprintf(F, "<%d>", get_array_order(tp, i));
1068 if (verbosity & dump_verbosity_fields) {
1069 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1076 if (verbosity & dump_verbosity_typeattrs) {
1077 type *tt = get_pointer_points_to_type(tp);
1078 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1083 if (verbosity & dump_verbosity_typeattrs) {
1084 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1085 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1086 for (i = 0; i < get_method_n_ress(tp); ++i) {
1087 type *rtp = get_method_res_type(tp, i);
1088 fprintf(F, "\n %s", get_type_name(rtp));
1091 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1092 for (i = 0; i < get_method_n_params(tp); ++i) {
1093 type *ptp = get_method_param_type(tp, i);
1094 fprintf(F, "\n %s", get_type_name(ptp));
1096 if (get_method_variadicity(tp)) {
1097 fprintf(F, "\n ...");
1111 if (verbosity & dump_verbosity_typeattrs) {
1112 fprintf(F, ": details not implemented\n");
1116 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1117 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1118 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1119 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1120 if (is_atomic_type(tp) || is_Method_type(tp))
1121 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1123 if (get_trouts_state()) {
1124 fprintf(F, "\n Type outs:\n");
1125 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1126 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1127 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1128 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1129 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1133 if (verbosity & dump_verbosity_accessStats) {
1135 int n_all = get_type_n_allocs(tp);
1140 /* Find maximal depth */
1141 for (i = 0; i < n_all; ++i) {
1142 ir_node *all = get_type_alloc(tp, i);
1143 int depth = get_weighted_loop_depth(all);
1144 max_depth = (depth > max_depth) ? depth : max_depth ;
1147 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1149 for (i = 0; i < n_all; ++i) {
1150 ir_node *all = get_type_alloc(tp, i);
1151 int depth = get_weighted_loop_depth(all);
1152 assert(depth <= max_depth);
1154 max_freq = (depth > max_freq) ? depth : max_freq;
1155 assert(get_irn_op(all) == op_Alloc);
1158 if (max_freq >= 0) {
1161 fprintf(F, " Alloc Stats");
1162 for (i = 0; i <= max_freq; ++i) {
1163 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1171 if (get_trouts_state() != outs_none) {
1172 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1173 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1174 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1175 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1176 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1177 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1186 void dump_type(type *tp) {
1187 dump_type_to_file (stdout, tp, dump_verbosity_max);
1191 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1192 const char *basename;
1193 FILE *F, *CSV = NULL;
1194 int i, n_types = get_irp_n_types();
1196 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1197 F = text_open (basename, suffix, "-types", ".txt");
1199 if (verbosity & dump_verbosity_csv) {
1200 CSV = text_open (basename, suffix, "-types", ".csv");
1201 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1204 for (i = 0; i < n_types; ++i) {
1205 type *t = get_irp_type(i);
1207 //if (is_jack_rts_class(t)) continue;
1209 dump_type_to_file(F, t, verbosity);
1211 dump_typecsv_to_file(CSV, t, verbosity, "");
1216 if (CSV) fclose (CSV);
1220 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1221 const char *basename;
1222 FILE *F, *CSV = NULL;
1223 type *g = get_glob_type();
1224 int i, n_mems = get_class_n_members(g);
1226 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1227 F = text_open (basename, suffix, "-globals", ".txt");
1229 if (verbosity & dump_verbosity_csv) {
1230 CSV = text_open (basename, suffix, "-types", ".csv");
1231 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1234 for (i = 0; i < n_mems; ++i) {
1235 entity *e = get_class_member(g, i);
1237 dump_entity_to_file(F, e, verbosity);
1239 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1244 if (CSV) fclose (CSV);