2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt
41 #include "firm_common_t.h"
43 #include "irgraph_t.h"
51 #include "field_temperature.h"
53 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
56 * Just opens a file, mangling a file name.
58 * The file name results from the concatenation of the following parts:
60 * @param basename The basis of the name telling about the content.
61 * @param suffix1 The first suffix.
62 * @param suffix2 The second suffix.
63 * @param suffix3 The third suffix.
65 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
67 int len = strlen(basename), i, j;
68 char *fname; /* filename to put the vcg information in */
70 if (!basename) assert(basename);
71 if (!suffix1) suffix1 = "";
72 if (!suffix2) suffix2 = "";
73 if (!suffix3) suffix3 = ".txt";
75 /* open file for vcg graph */
76 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
79 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
80 if (basename[i] == '/') {
81 fname[j] = '@'; j++; fname[j] = '1'; j++;
82 } else if (basename[i] == '@') {
83 fname[j] = '@'; j++; fname[j] = '2'; j++;
85 fname[j] = basename[i]; j++;
89 strcat(fname, suffix1); /* append file suffix */
90 strcat(fname, suffix2); /* append file suffix */
91 strcat(fname, suffix3); /* append the .txt suffix */
93 F = fopen(fname, "w"); /* open file for writing */
103 /* Write the irnode and all its attributes to the file passed. */
104 int dump_irnode_to_file(FILE *F, ir_node *n) {
109 dump_node_opcode(F, n);
110 fprintf(F, " %ld\n", get_irn_node_nr(n));
112 fprintf(F, " index: %u\n", get_irn_idx(n));
113 if (opt_dump_pointer_values_to_info)
114 fprintf (F, " addr: %p \n", (void *)n);
115 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
116 fprintf (F, " visited: %ld \n", get_irn_visited(n));
117 irg = get_irn_irg(n);
118 if (irg != get_const_code_irg())
119 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
121 if (get_irn_pinned(n) == op_pin_state_floats &&
122 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
123 fprintf(F, " node was pinned in ");
124 dump_node_opcode(F, get_irn_n(n, -1));
125 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
128 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
129 /* show all predecessor nodes */
130 fprintf(F, " pred nodes: \n");
133 dump_node_opcode(F, get_irn_n(n, -1));
134 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
136 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
137 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
138 dump_node_opcode(F, get_irn_intra_n(n, i));
139 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
142 fprintf(F, " Private Attributes:\n");
144 if (get_irn_opcode(n) == iro_Proj)
145 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
147 if ((get_irp_ip_view_state() != ip_view_no)
148 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
149 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
150 fprintf(F, " inter pred nodes: \n");
151 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
152 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
153 dump_node_opcode(F, get_irn_inter_n(n, i));
154 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
158 if (is_fragile_op(n)) {
159 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
160 /* not dumped: frag array */
163 /* This is not nice, output it as a marker in the predecessor list. */
164 if ((get_irn_op(n) == op_Block) ||
165 (get_irn_op(n) == op_Phi) ||
166 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
167 fprintf(F, " backedges:");
169 for (i = 0; i < get_irn_arity(n); i++)
170 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
174 /* Loop node. Someone else please tell me what's wrong ... */
175 if (get_irn_loop(n)) {
176 ir_loop *loop = get_irn_loop(n);
178 fprintf(F, " in loop %d with depth %d\n",
179 get_loop_loop_nr(loop), get_loop_depth(loop));
184 switch (get_irn_opcode(n)) {
186 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
187 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
188 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
189 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
190 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
193 fprintf(F, " Execution freqency statistics:\n");
194 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
195 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
196 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
197 fprintf(F, " call freqency of procedure: %8.2lf\n",
198 get_irg_method_execution_frequency(get_irn_irg(n)));
199 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
200 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
201 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
202 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
203 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
204 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
206 /* not dumped: graph_arr */
207 /* not dumped: mature */
210 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
211 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
212 for (i = 0; i < get_method_n_params(tp); ++i)
213 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
214 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
215 ir_node *sbl = get_nodes_block(n);
216 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
217 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
218 for (i = 0; i < n_cfgpreds; ++i) {
219 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
220 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
221 get_irg_dump_name(get_irn_irg(cfgpred)));
226 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
227 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
228 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
229 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
232 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
233 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
236 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
237 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
240 ir_entity *ent = get_Sel_entity(n);
242 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
243 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
244 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
247 fprintf(F, " <NULL entity>\n");
252 ir_type *tp = get_Call_type(n);
253 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
254 if(get_unknown_type() != tp) {
255 for (i = 0; i < get_method_n_params(tp); ++i)
256 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
257 for (i = 0; i < get_method_n_ress(tp); ++i)
258 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
260 if (Call_has_callees(n)) {
261 fprintf(F, " possible callees: \n");
262 for (i = 0; i < get_Call_n_callees(n); i++) {
263 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
267 case iro_CallBegin: {
268 ir_node *call = get_CallBegin_call(n);
269 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
270 if (Call_has_callees(call)) {
271 fprintf(F, " possible callees: \n");
272 for (i = 0; i < get_Call_n_callees(call); i++) {
273 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
278 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
281 if (!get_interprocedural_view()) {
282 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
283 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
284 for (i = 0; i < get_method_n_ress(tp); ++i)
285 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
289 ir_type *tp = get_Const_type(n);
290 assert(tp != firm_none_type);
291 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
294 switch(get_SymConst_kind(n)) {
295 case symconst_addr_name:
296 fprintf(F, " kind: addr_name\n");
297 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
299 case symconst_addr_ent:
300 fprintf(F, " kind: addr_ent\n");
301 fprintf(F, " entity: ");
302 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
304 case symconst_ofs_ent:
305 fprintf(F, " kind: offset\n");
306 fprintf(F, " entity: ");
307 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
309 case symconst_type_tag:
310 fprintf(F, " kind: type_tag\n");
311 fprintf(F, " type: ");
312 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
314 case symconst_type_size:
315 fprintf(F, " kind: size\n");
316 fprintf(F, " type: ");
317 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
319 case symconst_type_align:
320 fprintf(F, " kind: alignment\n");
321 fprintf(F, " type: ");
322 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
324 case symconst_enum_const:
325 fprintf(F, " kind: enumeration\n");
326 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
329 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
332 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
333 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
336 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
339 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
345 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
346 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
347 if (get_irn_typeinfo_type(n) != firm_none_type)
348 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
355 void dump_irnode(ir_node *n) {
356 dump_irnode_to_file(stdout, n);
360 void dump_graph_to_file(FILE *F, ir_graph *irg) {
361 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
364 void dump_graph(ir_graph *g) {
365 dump_graph_to_file(stdout, g);
368 static void dump_node_to_graph_file(ir_node *n, void *env) {
369 FILE *F = (FILE *)env;
371 dump_irnode_to_file(F, n);
375 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
376 const char *basename = get_irg_dump_name(irg);
379 F = text_open (basename, suffix, "", ".txt");
381 dump_graph_to_file(F, irg);
383 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
389 int addr_is_alloc(ir_node *acc) {
390 ir_node *addr = NULL;
393 addr = get_memop_ptr(acc);
395 assert(is_Call(acc));
396 addr = get_Call_ptr(acc);
399 addr_op = get_irn_opcode(addr);
401 while (addr_op != iro_Alloc) {
405 addr = get_Sel_ptr(addr);
408 addr = get_Cast_op(addr);
411 addr = get_Proj_pred(addr);
426 //assert(0 && "unexpected address node");
429 addr_op = get_irn_opcode(addr);
432 /* In addition, the alloc must be in the same loop. */
437 /** dumps something like:
439 * "prefix" "Name" (x): node1, ... node7,\n
440 * "prefix" node8, ... node15,\n
441 * "prefix" node16, node17\n
443 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
444 int (*get_entity_n_nodes)(firm_kind *ent),
445 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
447 int i, n_nodes = get_entity_n_nodes(k);
450 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
451 for (i = 0; i < n_nodes; ++i) {
453 if (i > 7 && !(i & 7)) { /* line break every eight node. */
454 fprintf(F, ",\n%s ", prefix);
457 fprintf(F, "%s ", comma);
458 rem = opt_dump_analysed_type_info;
459 opt_dump_analysed_type_info = 0;
460 dump_node_label(F, get_entity_node(k, i));
461 opt_dump_analysed_type_info = rem;
467 /** dumps something like:
469 * "prefix" "Name" (x): node1, ... node7,\n
470 * "prefix" node8, ... node15,\n
471 * "prefix" node16, node17\n
473 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
474 int (*get_n_types)(ir_type *tp),
475 ir_type *(*get_type)(ir_type *tp, int pos),
477 int i, n_nodes = get_n_types(tp);
480 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
481 for (i = 0; i < n_nodes; ++i) {
482 if (i > 7 && !(i & 7)) { /* line break every eight node. */
483 fprintf(F, ",\n%s ", prefix);
486 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
487 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
493 void dump_entity_to_file_prefix (FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
495 ir_type *owner, *type;
497 assert(is_entity(ent));
498 owner = get_entity_owner(ent);
499 type = get_entity_type(ent);
500 if (verbosity & dump_verbosity_onlynames) {
501 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
502 get_entity_name(ent), get_entity_nr(ent));
506 if (verbosity & dump_verbosity_entattrs) {
507 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
508 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
509 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
511 if (is_Class_type(get_entity_owner(ent))) {
512 if (get_entity_n_overwrites(ent) > 0) {
513 fprintf(F, "%s overwrites:\n", prefix);
514 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
515 ir_entity *ov = get_entity_overwrites(ent, i);
516 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
517 get_type_name(get_entity_owner(ov)));
520 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
522 if (get_entity_n_overwrittenby(ent) > 0) {
523 fprintf(F, "%s overwritten by:\n", prefix);
524 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
525 ir_entity *ov = get_entity_overwrittenby(ent, i);
526 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
527 get_type_name(get_entity_owner(ov)));
530 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
533 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
535 fprintf(F, "%s transitive overwrites:\n", prefix);
536 for (ov = get_entity_trans_overwrites_first(ent);
538 ov = get_entity_trans_overwrites_next(ent)) {
539 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
540 get_type_name(get_entity_owner(ov)));
542 fprintf(F, "%s transitive overwritten by:\n", prefix);
543 for (ov = get_entity_trans_overwrittenby_first(ent);
545 ov = get_entity_trans_overwrittenby_next(ent)) {
546 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
547 get_type_name(get_entity_owner(ov)));
552 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
553 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
554 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
556 if (is_Method_type(get_entity_type(ent))) {
557 unsigned mask = get_entity_additional_properties(ent);
558 unsigned cc = get_method_calling_convention(get_entity_type(ent));
559 ir_graph *irg = get_entity_irg(ent);
562 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
563 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
567 fprintf(F, "\n%s additional prop: ", prefix);
569 if (mask & mtp_property_const) fprintf(F, "const_function, ");
570 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
571 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
572 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
573 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
575 fprintf(F, "\n%s calling convention: ", prefix);
576 if (cc & cc_reg_param) fprintf(F, "regparam, ");
577 if (cc & cc_this_call) fprintf(F, "thiscall, ");
580 else if (IS_STDCALL(cc))
581 fprintf(F, "stdcall");
583 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
584 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
586 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
590 } else { /* no entattrs */
591 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
592 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
593 get_type_name(get_entity_type(ent)), get_entity_name(ent));
594 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
596 if (verbosity & dump_verbosity_accessStats) {
597 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
598 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
599 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
604 if (verbosity & dump_verbosity_entconsts) {
605 if (get_entity_variability(ent) != variability_uninitialized) {
606 if (is_atomic_entity(ent)) {
607 fprintf(F, "%s atomic value: ", prefix);
608 dump_node_opcode(F, get_atomic_ent_value(ent));
610 fprintf(F, "%s compound values:", prefix);
611 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
612 compound_graph_path *path = get_compound_ent_value_path(ent, i);
613 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
614 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
615 if (get_type_state(type) == layout_fixed)
616 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
617 fprintf(F, "%s", get_entity_name(ent));
618 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
619 ir_entity *node = get_compound_graph_path_node(path, j);
620 fprintf(F, ".%s", get_entity_name(node));
621 if (is_Array_type(get_entity_owner(node)))
622 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
625 dump_node_opcode(F, get_compound_ent_value(ent, i));
632 if (verbosity & dump_verbosity_entattrs) {
633 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
634 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
635 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
636 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
637 if (is_Method_type(get_entity_type(ent))) {
638 if (get_entity_irg(ent)) /* can be null */ {
639 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
640 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
641 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
642 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
645 fprintf(F, "\n%s irg = NULL", prefix);
651 if (get_trouts_state()) {
652 fprintf(F, "%s Entity outs:\n", prefix);
653 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
654 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
655 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
656 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
659 if (verbosity & dump_verbosity_accessStats) {
661 int n_acc = get_entity_n_accesses(ent);
665 int max_LA_freq = -1;
666 int max_SA_freq = -1;
672 /* Find maximal depth */
673 for (i = 0; i < n_acc; ++i) {
674 ir_node *acc = get_entity_access(ent, i);
675 int depth = get_weighted_loop_depth(acc);
676 max_depth = (depth > max_depth) ? depth : max_depth ;
679 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
681 S_freq = L_freq + 1*max_depth;
682 LA_freq = L_freq + 2*max_depth;
683 SA_freq = L_freq + 3*max_depth;
685 for (i = 0; i < n_acc; ++i) {
686 ir_node *acc = get_entity_access(ent, i);
687 int depth = get_weighted_loop_depth(acc);
688 assert(depth < max_depth);
689 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
691 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
692 if (addr_is_alloc(acc)) {
694 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
696 } else if (get_irn_op(acc) == op_Store) {
698 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
699 if (addr_is_alloc(acc)) {
701 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
708 if (max_L_freq >= 0) {
711 fprintf(F, "%s Load Stats", prefix);
712 for (i = 0; i <= max_L_freq; ++i) {
714 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
721 if (max_LA_freq >= 0) {
722 //fprintf(F, "%s LoadA Stats", prefix);
724 for (i = 0; i <= max_LA_freq; ++i) {
726 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
733 if (max_S_freq >= 0) {
736 fprintf(F, "%s Store Stats", prefix);
737 for (i = 0; i <= max_S_freq; ++i) {
739 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
746 if (max_SA_freq >= 0) {
747 //fprintf(F, "%s StoreAStats", prefix);
749 for (i = 0; i <= max_SA_freq; ++i) {
751 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
759 /* free allocated space */
762 if (get_trouts_state() != outs_none) {
763 if (is_Method_type(get_entity_type(ent))) {
764 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
765 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
767 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
768 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
775 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
776 dump_entity_to_file_prefix (F, ent, "", verbosity);
780 void dump_entity (ir_entity *ent) {
781 dump_entity_to_file(stdout, ent, dump_verbosity_max);
784 void dump_entitycsv_to_file_prefix (FILE *F, ir_entity *ent, char *prefix, unsigned verbosity,
785 int *max_disp, int disp[], const char *comma) {
787 #if 0 /* Outputs loop depth of all occurrences. */
788 int n_acc = get_entity_n_accesses(ent);
791 int max_LA_freq = -1;
792 int max_SA_freq = -1;
797 int i, max_depth = 0;
799 /* Find maximal depth */
800 for (i = 0; i < n_acc; ++i) {
801 ir_node *acc = get_entity_access(ent, i);
802 int depth = get_weighted_loop_depth(acc);
803 max_depth = (depth > max_depth) ? depth : max_depth ;
806 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
808 S_freq = L_freq + 1*max_depth;
809 LA_freq = L_freq + 2*max_depth;
810 SA_freq = L_freq + 3*max_depth;
812 for (i = 0; i < n_acc; ++i) {
813 ir_node *acc = get_entity_access(ent, i);
814 int depth = get_weighted_loop_depth(acc);
815 assert(depth <= max_depth);
816 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
818 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
819 if (addr_is_alloc(acc)) {
821 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
823 if (get_entity_allocation(ent) == allocation_static) {
825 *max_disp = (depth > *max_disp) ? depth : *max_disp;
827 } else if (get_irn_op(acc) == op_Store) {
829 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
830 if (addr_is_alloc(acc)) {
832 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
834 if (get_entity_allocation(ent) == allocation_static) {
842 if (get_entity_allocation(ent) != allocation_static) {
844 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
846 if (max_L_freq >= 0) {
847 fprintf(F, "%s Load", comma);
848 for (i = 0; i <= max_L_freq; ++i) {
849 fprintf(F, "%s %d", comma, L_freq[i]);
852 if (max_S_freq >= 0) {
853 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
854 fprintf(F, "%s Store", comma);
855 for (i = 0; i <= max_S_freq; ++i) {
856 fprintf(F, "%s %d", comma, S_freq[i]);
864 if (get_entity_allocation(ent) != allocation_static) {
865 if (is_Method_type(get_entity_type(ent))) return;
867 /* Output the entity name. */
868 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
870 if (get_trouts_state() != outs_none) {
871 if (is_Method_type(get_entity_type(ent))) {
872 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
873 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
875 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
876 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
884 /* A fast hack to dump a CSV-file. */
885 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
888 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
890 if (verbosity & dump_verbosity_accessStats) {
892 #if 0 /* Outputs loop depth of all occurrences. */
895 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
896 int n_all = get_type_n_allocs(tp);
898 /* Find maximal depth */
899 for (i = 0; i < n_all; ++i) {
900 ir_node *all = get_type_alloc(tp, i);
901 int depth = get_weighted_loop_depth(all);
902 max_depth = (depth > max_depth) ? depth : max_depth ;
905 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
907 disp = freq + max_depth;
909 for (i = 0; i < n_all; ++i) {
910 ir_node *all = get_type_alloc(tp, i);
911 int depth = get_weighted_loop_depth(all);
912 assert(depth <= max_depth);
914 max_freq = (depth > max_freq) ? depth : max_freq;
915 assert(get_irn_op(all) == op_Alloc);
918 fprintf(F, "%s ", get_type_name(tp));
919 fprintf(F, "%s Alloc ", comma);
922 for (i = 0; i <= max_freq; ++i) {
923 fprintf(F, "%s %d", comma, freq[i]);
928 for (i = 0; i < get_class_n_members(tp); ++i) {
929 ir_entity *mem = get_class_member(tp, i);
930 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
931 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
932 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
933 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
939 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
940 for (i = 0; i <= max_disp; ++i) {
941 fprintf(F, "%s %d", comma, disp[i]);
946 /* free allocated space */
950 #define DISP_TAB_SUFFIX "__disp_tab"
951 if (get_trouts_state() != outs_none) {
952 assert(strlen(get_type_name(tp)) < 1024);
953 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
954 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
955 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
958 for (i = 0; i < get_class_n_members(tp); ++i) {
959 ir_entity *mem = get_class_member(tp, i);
960 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
961 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
962 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
963 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
970 void dump_type_to_file (FILE *F, ir_type *tp, dump_verbosity verbosity) {
973 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
974 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
975 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
976 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
977 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
978 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
979 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
980 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
982 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
983 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
985 switch (get_type_tpop_code(tp)) {
988 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
989 fprintf(F, "\n members: \n");
991 for (i = 0; i < get_class_n_members(tp); ++i) {
992 ir_entity *mem = get_class_member(tp, i);
993 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
994 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
995 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
996 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1000 if (verbosity & dump_verbosity_typeattrs) {
1001 fprintf(F, " supertypes: ");
1002 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1003 ir_type *stp = get_class_supertype(tp, i);
1004 fprintf(F, "\n %d %s", i, get_type_name(stp));
1006 fprintf(F, "\n subtypes: ");
1007 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1008 ir_type *stp = get_class_subtype(tp, i);
1009 fprintf(F, "\n %d %s", i, get_type_name(stp));
1012 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1014 fprintf(F, "\n transitive supertypes: ");
1015 for (stp = get_class_trans_supertype_first(tp);
1017 stp = get_class_trans_supertype_next(tp)) {
1018 fprintf(F, "\n %s", get_type_name(stp));
1020 fprintf(F, "\n transitive subtypes: ");
1021 for (stp = get_class_trans_subtype_first(tp);
1023 stp = get_class_trans_subtype_next(tp)) {
1024 fprintf(F, "\n %s", get_type_name(stp));
1028 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1029 fprintf(F, "\n flags: ");
1030 if (is_class_final(tp))
1031 fprintf(F, "final, ");
1032 if (is_class_interface(tp))
1033 fprintf(F, "interface, ");
1034 if (is_class_abstract(tp))
1035 fprintf(F, "abstract, ");
1042 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1043 for (i = 0; i < get_compound_n_members(tp); ++i) {
1044 ir_entity *mem = get_compound_member(tp, i);
1045 if (verbosity & dump_verbosity_fields) {
1046 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1052 if (verbosity & dump_verbosity_typeattrs) {
1054 ir_type *elem_tp = get_array_element_type(tp);
1056 fprintf(F, "\n array ");
1058 n_dim = get_array_n_dimensions(tp);
1059 for (i = 0; i < n_dim; ++i) {
1060 ir_node *lower, *upper;
1062 lower = get_array_lower_bound(tp, i);
1063 upper = get_array_upper_bound(tp, i);
1067 if (get_irn_op(lower) == op_Const)
1068 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1070 dump_node_opcode(F, lower);
1071 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1074 if (get_irn_op(upper) == op_Const)
1075 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1077 dump_node_opcode(F, upper);
1078 fprintf(F, " %ld]", get_irn_node_nr(upper));
1081 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1083 fprintf(F, "\n order: ");
1084 for (i = 0; i < n_dim; ++i)
1085 fprintf(F, "<%d>", get_array_order(tp, i));
1089 if (verbosity & dump_verbosity_fields) {
1090 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1097 if (verbosity & dump_verbosity_typeattrs) {
1098 ir_type *tt = get_pointer_points_to_type(tp);
1099 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1104 if (verbosity & dump_verbosity_typeattrs) {
1105 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1106 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1107 for (i = 0; i < get_method_n_ress(tp); ++i) {
1108 ir_type *rtp = get_method_res_type(tp, i);
1109 fprintf(F, "\n %s", get_type_name(rtp));
1112 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1113 for (i = 0; i < get_method_n_params(tp); ++i) {
1114 ir_type *ptp = get_method_param_type(tp, i);
1115 fprintf(F, "\n %s", get_type_name(ptp));
1117 if (get_method_variadicity(tp)) {
1118 fprintf(F, "\n ...");
1132 if (verbosity & dump_verbosity_typeattrs) {
1133 fprintf(F, ": details not implemented\n");
1137 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1138 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1139 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1140 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1141 if (is_atomic_type(tp) || is_Method_type(tp))
1142 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1144 if (get_trouts_state()) {
1145 fprintf(F, "\n Type outs:\n");
1146 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1147 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1148 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1149 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1150 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1154 if (verbosity & dump_verbosity_accessStats) {
1156 int n_all = get_type_n_allocs(tp);
1161 /* Find maximal depth */
1162 for (i = 0; i < n_all; ++i) {
1163 ir_node *all = get_type_alloc(tp, i);
1164 int depth = get_weighted_loop_depth(all);
1165 max_depth = (depth > max_depth) ? depth : max_depth ;
1168 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1170 for (i = 0; i < n_all; ++i) {
1171 ir_node *all = get_type_alloc(tp, i);
1172 int depth = get_weighted_loop_depth(all);
1173 assert(depth <= max_depth);
1175 max_freq = (depth > max_freq) ? depth : max_freq;
1176 assert(get_irn_op(all) == op_Alloc);
1179 if (max_freq >= 0) {
1182 fprintf(F, " Alloc Stats");
1183 for (i = 0; i <= max_freq; ++i) {
1184 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1192 if (get_trouts_state() != outs_none) {
1193 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1194 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1195 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1196 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1197 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1198 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1207 void dump_type(ir_type *tp) {
1208 dump_type_to_file (stdout, tp, dump_verbosity_max);
1212 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1213 const char *basename;
1214 FILE *F, *CSV = NULL;
1215 int i, n_types = get_irp_n_types();
1217 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1218 F = text_open(basename, suffix, "-types", ".txt");
1220 if (verbosity & dump_verbosity_csv) {
1221 CSV = text_open(basename, suffix, "-types", ".csv");
1222 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1225 for (i = 0; i < n_types; ++i) {
1226 ir_type *t = get_irp_type(i);
1228 //if (is_jack_rts_class(t)) continue;
1230 dump_type_to_file(F, t, verbosity);
1232 dump_typecsv_to_file(CSV, t, verbosity, "");
1237 if (CSV) fclose(CSV);
1241 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1242 const char *basename;
1243 FILE *F, *CSV = NULL;
1244 ir_type *g = get_glob_type();
1245 int i, n_mems = get_class_n_members(g);
1247 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1248 F = text_open (basename, suffix, "-globals", ".txt");
1250 if (verbosity & dump_verbosity_csv) {
1251 CSV = text_open (basename, suffix, "-types", ".csv");
1252 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1255 for (i = 0; i < n_mems; ++i) {
1256 ir_entity *e = get_class_member(g, i);
1258 dump_entity_to_file(F, e, verbosity);
1260 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1265 if (CSV) fclose (CSV);