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-2006 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. */
42 * Just opens a file, mangling a file name.
44 * The file name results from the concatenation of the following parts:
46 * @param basename The basis of the name telling about the content.
47 * @param suffix1 The first suffix.
48 * @param suffix2 The second suffix.
49 * @param suffix3 The third suffix.
51 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
53 int len = strlen(basename), i, j;
54 char *fname; /* filename to put the vcg information in */
56 if (!basename) assert(basename);
57 if (!suffix1) suffix1 = "";
58 if (!suffix2) suffix2 = "";
59 if (!suffix3) suffix3 = ".txt";
61 /* open file for vcg graph */
62 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
65 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
66 if (basename[i] == '/') {
67 fname[j] = '@'; j++; fname[j] = '1'; j++;
68 } else if (basename[i] == '@') {
69 fname[j] = '@'; j++; fname[j] = '2'; j++;
71 fname[j] = basename[i]; j++;
75 strcat(fname, suffix1); /* append file suffix */
76 strcat(fname, suffix2); /* append file suffix */
77 strcat(fname, suffix3); /* append the .txt suffix */
79 F = fopen(fname, "w"); /* open file for writing */
89 /* Write the irnode and all its attributes to the file passed. */
90 int dump_irnode_to_file(FILE *F, ir_node *n) {
95 dump_node_opcode(F, n);
96 fprintf(F, " %ld\n", get_irn_node_nr(n));
98 fprintf(F, " index: %u\n", get_irn_idx(n));
99 if (opt_dump_pointer_values_to_info)
100 fprintf (F, " addr: %p \n", (void *)n);
101 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
102 fprintf (F, " visited: %ld \n", get_irn_visited(n));
103 irg = get_irn_irg(n);
104 if (irg != get_const_code_irg())
105 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
107 if (get_irn_pinned(n) == op_pin_state_floats &&
108 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
109 fprintf(F, " node was pinned in ");
110 dump_node_opcode(F, get_irn_n(n, -1));
111 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
114 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
115 /* show all predecessor nodes */
116 fprintf(F, " pred nodes: \n");
119 dump_node_opcode(F, get_irn_n(n, -1));
120 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
122 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
123 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
124 dump_node_opcode(F, get_irn_intra_n(n, i));
125 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
128 fprintf(F, " Private Attributes:\n");
130 if (get_irn_opcode(n) == iro_Proj)
131 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
133 if ((get_irp_ip_view_state() != ip_view_no)
134 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
135 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
136 fprintf(F, " inter pred nodes: \n");
137 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
138 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
139 dump_node_opcode(F, get_irn_inter_n(n, i));
140 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
144 if (is_fragile_op(n)) {
145 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
146 /* not dumped: frag array */
149 /* This is not nice, output it as a marker in the predecessor list. */
150 if ((get_irn_op(n) == op_Block) ||
151 (get_irn_op(n) == op_Phi) ||
152 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
153 fprintf(F, " backedges:");
155 for (i = 0; i < get_irn_arity(n); i++)
156 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
160 /* Loop node. Someone else please tell me what's wrong ... */
161 if (get_irn_loop(n)) {
162 ir_loop *loop = get_irn_loop(n);
164 fprintf(F, " in loop %d with depth %d\n",
165 get_loop_loop_nr(loop), get_loop_depth(loop));
170 switch (get_irn_opcode(n)) {
172 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
173 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
174 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
175 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
176 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
179 fprintf(F, " Execution freqency statistics:\n");
180 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
181 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
182 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
183 fprintf(F, " call freqency of procedure: %8.2lf\n",
184 get_irg_method_execution_frequency(get_irn_irg(n)));
185 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
186 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
187 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
188 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
189 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
190 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
192 /* not dumped: graph_arr */
193 /* not dumped: mature */
196 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
197 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
198 for (i = 0; i < get_method_n_params(tp); ++i)
199 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
200 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
201 ir_node *sbl = get_nodes_block(n);
202 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
203 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
204 for (i = 0; i < n_cfgpreds; ++i) {
205 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
206 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
207 get_irg_dump_name(get_irn_irg(cfgpred)));
212 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
213 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
214 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
215 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
218 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
219 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
222 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
223 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
226 entity *ent = get_Sel_entity(n);
228 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
229 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
230 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
233 fprintf(F, " <NULL entity>\n");
238 ir_type *tp = get_Call_type(n);
239 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
240 if(get_unknown_type() != tp) {
241 for (i = 0; i < get_method_n_params(tp); ++i)
242 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
243 for (i = 0; i < get_method_n_ress(tp); ++i)
244 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
246 if (Call_has_callees(n)) {
247 fprintf(F, " possible callees: \n");
248 for (i = 0; i < get_Call_n_callees(n); i++) {
249 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
253 case iro_CallBegin: {
254 ir_node *call = get_CallBegin_call(n);
255 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
256 if (Call_has_callees(call)) {
257 fprintf(F, " possible callees: \n");
258 for (i = 0; i < get_Call_n_callees(call); i++) {
259 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
264 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
267 if (!get_interprocedural_view()) {
268 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
269 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
270 for (i = 0; i < get_method_n_ress(tp); ++i)
271 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
275 ir_type *tp = get_Const_type(n);
276 assert(tp != firm_none_type);
277 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
280 switch(get_SymConst_kind(n)) {
281 case symconst_addr_name:
282 fprintf(F, " kind: addr_name\n");
283 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
285 case symconst_addr_ent:
286 fprintf(F, " kind: addr_ent\n");
287 fprintf(F, " entity: ");
288 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
290 case symconst_ofs_ent:
291 fprintf(F, " kind: offset\n");
292 fprintf(F, " entity: ");
293 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
295 case symconst_type_tag:
296 fprintf(F, " kind: type_tag\n");
297 fprintf(F, " type: ");
298 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
300 case symconst_type_size:
301 fprintf(F, " kind: size\n");
302 fprintf(F, " type: ");
303 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
305 case symconst_type_align:
306 fprintf(F, " kind: alignment\n");
307 fprintf(F, " type: ");
308 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
310 case symconst_enum_const:
311 fprintf(F, " kind: enumeration\n");
312 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
315 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
318 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
319 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
322 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
325 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
331 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
332 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
333 if (get_irn_typeinfo_type(n) != firm_none_type)
334 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
341 void dump_irnode(ir_node *n) {
342 dump_irnode_to_file(stdout, n);
346 void dump_graph_to_file(FILE *F, ir_graph *irg) {
347 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
350 void dump_graph(ir_graph *g) {
351 dump_graph_to_file(stdout, g);
354 static void dump_node_to_graph_file(ir_node *n, void *env) {
355 FILE *F = (FILE *)env;
357 dump_irnode_to_file(F, n);
361 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
362 const char *basename = get_irg_dump_name(irg);
365 F = text_open (basename, suffix, "", ".txt");
367 dump_graph_to_file(F, irg);
369 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
375 int addr_is_alloc(ir_node *acc) {
376 ir_node *addr = NULL;
379 addr = get_memop_ptr(acc);
381 assert(is_Call(acc));
382 addr = get_Call_ptr(acc);
385 addr_op = get_irn_opcode(addr);
387 while (addr_op != iro_Alloc) {
391 addr = get_Sel_ptr(addr);
394 addr = get_Cast_op(addr);
397 addr = get_Proj_pred(addr);
412 //assert(0 && "unexpected address node");
415 addr_op = get_irn_opcode(addr);
418 /* In addition, the alloc must be in the same loop. */
423 /** dumps something like:
425 * "prefix" "Name" (x): node1, ... node7,\n
426 * "prefix" node8, ... node15,\n
427 * "prefix" node16, node17\n
429 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
430 int (*get_entity_n_nodes)(firm_kind *ent),
431 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
433 int i, n_nodes = get_entity_n_nodes(k);
436 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
437 for (i = 0; i < n_nodes; ++i) {
439 if (i > 7 && !(i & 7)) { /* line break every eight node. */
440 fprintf(F, ",\n%s ", prefix);
443 fprintf(F, "%s ", comma);
444 rem = opt_dump_analysed_type_info;
445 opt_dump_analysed_type_info = 0;
446 dump_node_label(F, get_entity_node(k, i));
447 opt_dump_analysed_type_info = rem;
453 /** dumps something like:
455 * "prefix" "Name" (x): node1, ... node7,\n
456 * "prefix" node8, ... node15,\n
457 * "prefix" node16, node17\n
459 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
460 int (*get_n_types)(ir_type *tp),
461 ir_type *(*get_type)(ir_type *tp, int pos),
463 int i, n_nodes = get_n_types(tp);
466 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
467 for (i = 0; i < n_nodes; ++i) {
468 if (i > 7 && !(i & 7)) { /* line break every eight node. */
469 fprintf(F, ",\n%s ", prefix);
472 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
473 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
479 void dump_entity_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity) {
481 ir_type *owner, *type;
483 assert(is_entity(ent));
484 owner = get_entity_owner(ent);
485 type = get_entity_type(ent);
486 if (verbosity & dump_verbosity_onlynames) {
487 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
488 get_entity_name(ent), get_entity_nr(ent));
492 if (verbosity & dump_verbosity_entattrs) {
493 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
494 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
495 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
497 if (is_Class_type(get_entity_owner(ent))) {
498 if (get_entity_n_overwrites(ent) > 0) {
499 fprintf(F, "%s overwrites:\n", prefix);
500 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
501 entity *ov = get_entity_overwrites(ent, i);
502 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
503 get_type_name(get_entity_owner(ov)));
506 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
508 if (get_entity_n_overwrittenby(ent) > 0) {
509 fprintf(F, "%s overwritten by:\n", prefix);
510 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
511 entity *ov = get_entity_overwrittenby(ent, i);
512 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
513 get_type_name(get_entity_owner(ov)));
516 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
519 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
521 fprintf(F, "%s transitive overwrites:\n", prefix);
522 for (ov = get_entity_trans_overwrites_first(ent);
524 ov = get_entity_trans_overwrites_next(ent)) {
525 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
526 get_type_name(get_entity_owner(ov)));
528 fprintf(F, "%s transitive overwritten by:\n", prefix);
529 for (ov = get_entity_trans_overwrittenby_first(ent);
531 ov = get_entity_trans_overwrittenby_next(ent)) {
532 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
533 get_type_name(get_entity_owner(ov)));
538 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
539 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
540 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
542 if (is_Method_type(get_entity_type(ent))) {
543 unsigned mask = get_entity_additional_properties(ent);
544 unsigned cc = get_method_calling_convention(get_entity_type(ent));
545 ir_graph *irg = get_entity_irg(ent);
548 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
549 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
553 fprintf(F, "\n%s additional prop: ", prefix);
555 if (mask & mtp_property_const) fprintf(F, "const_function, ");
556 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
557 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
558 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
559 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
561 fprintf(F, "\n%s calling convention: ", prefix);
562 if (cc & cc_reg_param) fprintf(F, "regparam, ");
563 if (cc & cc_this_call) fprintf(F, "thiscall, ");
566 else if (IS_STDCALL(cc))
567 fprintf(F, "stdcall");
569 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
570 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
572 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
576 } else { /* no entattrs */
577 fprintf(F, "%s(%3d) %*s: %s", prefix,
578 get_entity_offset_bits(ent), -40, get_type_name(get_entity_type(ent)), get_entity_name(ent));
579 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
581 if (verbosity & dump_verbosity_accessStats) {
582 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
583 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
584 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
589 if (verbosity & dump_verbosity_entconsts) {
590 if (get_entity_variability(ent) != variability_uninitialized) {
591 if (is_atomic_entity(ent)) {
592 fprintf(F, "%s atomic value: ", prefix);
593 dump_node_opcode(F, get_atomic_ent_value(ent));
595 fprintf(F, "%s compound values:", prefix);
596 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
597 compound_graph_path *path = get_compound_ent_value_path(ent, i);
598 entity *ent0 = get_compound_graph_path_node(path, 0);
599 fprintf(F, "\n%s %3d ", prefix, get_entity_offset_bits(ent0));
600 if (get_type_state(type) == layout_fixed)
601 fprintf(F, "(%3d) ", get_compound_ent_value_offset_bits(ent, i));
602 fprintf(F, "%s", get_entity_name(ent));
603 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
604 entity *node = get_compound_graph_path_node(path, j);
605 fprintf(F, ".%s", get_entity_name(node));
606 if (is_Array_type(get_entity_owner(node)))
607 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
610 dump_node_opcode(F, get_compound_ent_value(ent, i));
617 if (verbosity & dump_verbosity_entattrs) {
618 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
619 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(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));
760 void dump_entity_to_file (FILE *F, entity *ent, unsigned verbosity) {
761 dump_entity_to_file_prefix (F, ent, "", verbosity);
765 void dump_entity (entity *ent) {
766 dump_entity_to_file(stdout, ent, dump_verbosity_max);
769 void dump_entitycsv_to_file_prefix (FILE *F, entity *ent, char *prefix, unsigned verbosity,
770 int *max_disp, int disp[], const char *comma) {
772 #if 0 /* Outputs loop depth of all occurrences. */
773 int n_acc = get_entity_n_accesses(ent);
776 int max_LA_freq = -1;
777 int max_SA_freq = -1;
782 int i, max_depth = 0;
784 /* Find maximal 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 max_depth = (depth > max_depth) ? depth : max_depth ;
791 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
793 S_freq = L_freq + 1*max_depth;
794 LA_freq = L_freq + 2*max_depth;
795 SA_freq = L_freq + 3*max_depth;
797 for (i = 0; i < n_acc; ++i) {
798 ir_node *acc = get_entity_access(ent, i);
799 int depth = get_weighted_loop_depth(acc);
800 assert(depth <= max_depth);
801 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
803 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
804 if (addr_is_alloc(acc)) {
806 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
808 if (get_entity_allocation(ent) == allocation_static) {
810 *max_disp = (depth > *max_disp) ? depth : *max_disp;
812 } else if (get_irn_op(acc) == op_Store) {
814 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
815 if (addr_is_alloc(acc)) {
817 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
819 if (get_entity_allocation(ent) == allocation_static) {
827 if (get_entity_allocation(ent) != allocation_static) {
829 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
831 if (max_L_freq >= 0) {
832 fprintf(F, "%s Load", comma);
833 for (i = 0; i <= max_L_freq; ++i) {
834 fprintf(F, "%s %d", comma, L_freq[i]);
837 if (max_S_freq >= 0) {
838 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
839 fprintf(F, "%s Store", comma);
840 for (i = 0; i <= max_S_freq; ++i) {
841 fprintf(F, "%s %d", comma, S_freq[i]);
849 if (get_entity_allocation(ent) != allocation_static) {
850 if (is_Method_type(get_entity_type(ent))) return;
852 /* Output the entity name. */
853 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
855 if (get_trouts_state() != outs_none) {
856 if (is_Method_type(get_entity_type(ent))) {
857 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
858 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
860 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
861 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
869 /* A fast hack to dump a CSV-file. */
870 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
873 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
875 if (verbosity & dump_verbosity_accessStats) {
877 #if 0 /* Outputs loop depth of all occurrences. */
880 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
881 int n_all = get_type_n_allocs(tp);
883 /* Find maximal depth */
884 for (i = 0; i < n_all; ++i) {
885 ir_node *all = get_type_alloc(tp, i);
886 int depth = get_weighted_loop_depth(all);
887 max_depth = (depth > max_depth) ? depth : max_depth ;
890 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
892 disp = freq + max_depth;
894 for (i = 0; i < n_all; ++i) {
895 ir_node *all = get_type_alloc(tp, i);
896 int depth = get_weighted_loop_depth(all);
897 assert(depth <= max_depth);
899 max_freq = (depth > max_freq) ? depth : max_freq;
900 assert(get_irn_op(all) == op_Alloc);
903 fprintf(F, "%s ", get_type_name(tp));
904 fprintf(F, "%s Alloc ", comma);
907 for (i = 0; i <= max_freq; ++i) {
908 fprintf(F, "%s %d", comma, freq[i]);
913 for (i = 0; i < get_class_n_members(tp); ++i) {
914 entity *mem = get_class_member(tp, i);
915 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
916 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
917 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
918 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
924 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
925 for (i = 0; i <= max_disp; ++i) {
926 fprintf(F, "%s %d", comma, disp[i]);
931 /* free allocated space */
935 #define DISP_TAB_SUFFIX "__disp_tab"
936 if (get_trouts_state() != outs_none) {
937 assert(strlen(get_type_name(tp)) < 1024);
938 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
939 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
940 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
943 for (i = 0; i < get_class_n_members(tp); ++i) {
944 entity *mem = get_class_member(tp, i);
945 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
946 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
947 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
948 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
955 void dump_type_to_file (FILE *F, ir_type *tp, dump_verbosity verbosity) {
958 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
959 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
960 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
961 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
962 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
963 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
964 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
965 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
967 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
968 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
970 switch (get_type_tpop_code(tp)) {
973 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
974 fprintf(F, "\n members: \n");
976 for (i = 0; i < get_class_n_members(tp); ++i) {
977 entity *mem = get_class_member(tp, i);
978 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
979 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
980 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
981 dump_entity_to_file_prefix(F, mem, " ", verbosity);
985 if (verbosity & dump_verbosity_typeattrs) {
986 fprintf(F, " supertypes: ");
987 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
988 ir_type *stp = get_class_supertype(tp, i);
989 fprintf(F, "\n %d %s", i, get_type_name(stp));
991 fprintf(F, "\n subtypes: ");
992 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
993 ir_type *stp = get_class_subtype(tp, i);
994 fprintf(F, "\n %d %s", i, get_type_name(stp));
997 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
999 fprintf(F, "\n transitive supertypes: ");
1000 for (stp = get_class_trans_supertype_first(tp);
1002 stp = get_class_trans_supertype_next(tp)) {
1003 fprintf(F, "\n %s", get_type_name(stp));
1005 fprintf(F, "\n transitive subtypes: ");
1006 for (stp = get_class_trans_subtype_first(tp);
1008 stp = get_class_trans_subtype_next(tp)) {
1009 fprintf(F, "\n %s", get_type_name(stp));
1013 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1014 fprintf(F, "\n flags: ");
1015 if (is_class_final(tp))
1016 fprintf(F, "final, ");
1017 if (is_class_interface(tp))
1018 fprintf(F, "interface, ");
1019 if (is_class_abstract(tp))
1020 fprintf(F, "abstract, ");
1027 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1028 for (i = 0; i < get_compound_n_members(tp); ++i) {
1029 entity *mem = get_compound_member(tp, i);
1030 if (verbosity & dump_verbosity_fields) {
1031 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1037 if (verbosity & dump_verbosity_typeattrs) {
1039 ir_type *elem_tp = get_array_element_type(tp);
1041 fprintf(F, "\n array ");
1043 n_dim = get_array_n_dimensions(tp);
1044 for (i = 0; i < n_dim; ++i) {
1045 ir_node *lower, *upper;
1047 lower = get_array_lower_bound(tp, i);
1048 upper = get_array_upper_bound(tp, i);
1052 if (get_irn_op(lower) == op_Const)
1053 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1055 dump_node_opcode(F, lower);
1056 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1059 if (get_irn_op(upper) == op_Const)
1060 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1062 dump_node_opcode(F, upper);
1063 fprintf(F, " %ld]", get_irn_node_nr(upper));
1066 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1068 fprintf(F, "\n order: ");
1069 for (i = 0; i < n_dim; ++i)
1070 fprintf(F, "<%d>", get_array_order(tp, i));
1074 if (verbosity & dump_verbosity_fields) {
1075 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1082 if (verbosity & dump_verbosity_typeattrs) {
1083 ir_type *tt = get_pointer_points_to_type(tp);
1084 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1089 if (verbosity & dump_verbosity_typeattrs) {
1090 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1091 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1092 for (i = 0; i < get_method_n_ress(tp); ++i) {
1093 ir_type *rtp = get_method_res_type(tp, i);
1094 fprintf(F, "\n %s", get_type_name(rtp));
1097 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1098 for (i = 0; i < get_method_n_params(tp); ++i) {
1099 ir_type *ptp = get_method_param_type(tp, i);
1100 fprintf(F, "\n %s", get_type_name(ptp));
1102 if (get_method_variadicity(tp)) {
1103 fprintf(F, "\n ...");
1117 if (verbosity & dump_verbosity_typeattrs) {
1118 fprintf(F, ": details not implemented\n");
1122 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1123 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1124 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1125 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1126 if (is_atomic_type(tp) || is_Method_type(tp))
1127 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1129 if (get_trouts_state()) {
1130 fprintf(F, "\n Type outs:\n");
1131 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1132 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1133 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1134 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1135 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1139 if (verbosity & dump_verbosity_accessStats) {
1141 int n_all = get_type_n_allocs(tp);
1146 /* Find maximal depth */
1147 for (i = 0; i < n_all; ++i) {
1148 ir_node *all = get_type_alloc(tp, i);
1149 int depth = get_weighted_loop_depth(all);
1150 max_depth = (depth > max_depth) ? depth : max_depth ;
1153 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1155 for (i = 0; i < n_all; ++i) {
1156 ir_node *all = get_type_alloc(tp, i);
1157 int depth = get_weighted_loop_depth(all);
1158 assert(depth <= max_depth);
1160 max_freq = (depth > max_freq) ? depth : max_freq;
1161 assert(get_irn_op(all) == op_Alloc);
1164 if (max_freq >= 0) {
1167 fprintf(F, " Alloc Stats");
1168 for (i = 0; i <= max_freq; ++i) {
1169 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1177 if (get_trouts_state() != outs_none) {
1178 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1179 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1180 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1181 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1182 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1183 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1192 void dump_type(ir_type *tp) {
1193 dump_type_to_file (stdout, tp, dump_verbosity_max);
1197 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1198 const char *basename;
1199 FILE *F, *CSV = NULL;
1200 int i, n_types = get_irp_n_types();
1202 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1203 F = text_open(basename, suffix, "-types", ".txt");
1205 if (verbosity & dump_verbosity_csv) {
1206 CSV = text_open(basename, suffix, "-types", ".csv");
1207 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1210 for (i = 0; i < n_types; ++i) {
1211 ir_type *t = get_irp_type(i);
1213 //if (is_jack_rts_class(t)) continue;
1215 dump_type_to_file(F, t, verbosity);
1217 dump_typecsv_to_file(CSV, t, verbosity, "");
1222 if (CSV) fclose(CSV);
1226 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1227 const char *basename;
1228 FILE *F, *CSV = NULL;
1229 ir_type *g = get_glob_type();
1230 int i, n_mems = get_class_n_members(g);
1232 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1233 F = text_open (basename, suffix, "-globals", ".txt");
1235 if (verbosity & dump_verbosity_csv) {
1236 CSV = text_open (basename, suffix, "-types", ".csv");
1237 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1240 for (i = 0; i < n_mems; ++i) {
1241 entity *e = get_class_member(g, i);
1243 dump_entity_to_file(F, e, verbosity);
1245 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1250 if (CSV) fclose (CSV);