2 * Copyright (C) 1995-2008 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
35 #include "irgraph_t.h"
37 #include "firm_common_t.h"
48 #include "field_temperature.h"
50 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
53 * Just opens a file, mangling a file name.
55 * The file name results from the concatenation of the following parts:
57 * @param basename The basis of the name telling about the content.
58 * @param suffix1 The first suffix.
59 * @param suffix2 The second suffix.
60 * @param suffix3 The third suffix.
62 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
64 int len = strlen(basename), i, j;
65 char *fname; /* filename to put the vcg information in */
67 if (!basename) assert(basename);
68 if (!suffix1) suffix1 = "";
69 if (!suffix2) suffix2 = "";
70 if (!suffix3) suffix3 = ".txt";
72 /* open file for vcg graph */
73 fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
76 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
77 if (basename[i] == '/') {
78 fname[j] = '@'; j++; fname[j] = '1'; j++;
79 } else if (basename[i] == '@') {
80 fname[j] = '@'; j++; fname[j] = '2'; j++;
82 fname[j] = basename[i]; j++;
86 strcat(fname, suffix1); /* append file suffix */
87 strcat(fname, suffix2); /* append file suffix */
88 strcat(fname, suffix3); /* append the .txt suffix */
90 F = fopen(fname, "w"); /* open file for writing */
100 /* Write the irnode and all its attributes to the file passed. */
101 int dump_irnode_to_file(FILE *F, ir_node *n) {
106 dump_node_opcode(F, n);
107 fprintf(F, " %ld\n", get_irn_node_nr(n));
109 fprintf(F, " index: %u\n", get_irn_idx(n));
110 if (opt_dump_pointer_values_to_info)
111 fprintf (F, " addr: %p \n", (void *)n);
112 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
113 fprintf (F, " visited: %ld \n", get_irn_visited(n));
114 irg = get_irn_irg(n);
115 if (irg != get_const_code_irg())
116 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
118 if (get_irn_pinned(n) == op_pin_state_floats &&
119 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
120 fprintf(F, " node was pinned in ");
121 dump_node_opcode(F, get_irn_n(n, -1));
122 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
125 #ifdef INTERPROCEDURAL_VIEW
126 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
127 /* show all predecessor nodes */
128 fprintf(F, " pred nodes: \n");
131 dump_node_opcode(F, get_irn_n(n, -1));
132 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
134 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
135 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
136 dump_node_opcode(F, get_irn_intra_n(n, i));
137 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
140 fprintf(F, " arity: %d\n", get_irn_arity(n));
141 /* show all predecessor nodes */
142 fprintf(F, " pred nodes: \n");
145 dump_node_opcode(F, get_irn_n(n, -1));
146 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
148 for ( i = 0; i < get_irn_arity(n); ++i) {
149 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
150 dump_node_opcode(F, get_irn_n(n, i));
151 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
155 fprintf(F, " Private Attributes:\n");
158 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
160 #ifdef INTERPROCEDURAL_VIEW
161 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
162 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
163 fprintf(F, " inter pred nodes: \n");
164 for (i = 0; i < get_irn_inter_arity(n); ++i) {
165 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
166 dump_node_opcode(F, get_irn_inter_n(n, i));
167 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
172 if (is_fragile_op(n)) {
173 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
174 /* not dumped: frag array */
177 /* This is not nice, output it as a marker in the predecessor list. */
179 get_irn_op(n) == op_Phi ||
180 (is_Filter(n) && get_interprocedural_view())) {
181 fprintf(F, " backedges:");
183 for (i = 0; i < get_irn_arity(n); i++)
184 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
188 /* Loop node. Someone else please tell me what's wrong ... */
189 if (get_irn_loop(n)) {
190 ir_loop *loop = get_irn_loop(n);
192 fprintf(F, " in loop %d with depth %d\n",
193 get_loop_loop_nr(loop), get_loop_depth(loop));
197 switch (get_irn_opcode(n)) {
199 if (has_Block_label(n))
200 fprintf(F, " Label: %lu\n", get_Block_label(n));
201 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
202 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
203 fprintf(F, " block marked: %u\n", get_Block_mark(n));
204 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
205 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
206 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
207 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
210 fprintf(F, " Execution frequency statistics:\n");
211 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
212 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
213 #ifdef INTERPROCEDURAL_VIEW
214 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
215 fprintf(F, " call frequency of procedure: %8.2lf\n",
216 get_irg_method_execution_frequency(get_irn_irg(n)));
217 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
218 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
219 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
220 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
221 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
222 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
225 /* not dumped: graph_arr */
226 /* not dumped: mature */
229 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
230 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
231 for (i = 0; i < get_method_n_params(tp); ++i)
232 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
233 #ifdef INTERPROCEDURAL_VIEW
234 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
235 ir_node *sbl = get_nodes_block(n);
236 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
237 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
238 for (i = 0; i < n_cfgpreds; ++i) {
239 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
240 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
241 get_irg_dump_name(get_irn_irg(cfgpred)));
247 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
248 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
249 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
250 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
253 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
254 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
257 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
258 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
261 ir_entity *ent = get_Sel_entity(n);
263 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
264 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
265 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
268 fprintf(F, " <NULL entity>\n");
273 ir_type *tp = get_Call_type(n);
274 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
275 if(get_unknown_type() != tp) {
276 for (i = 0; i < get_method_n_params(tp); ++i)
277 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
278 for (i = 0; i < get_method_n_ress(tp); ++i)
279 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
281 if (Call_has_callees(n)) {
282 fprintf(F, " possible callees: \n");
283 for (i = 0; i < get_Call_n_callees(n); i++) {
284 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
288 case iro_CallBegin: {
289 ir_node *call = get_CallBegin_call(n);
290 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
291 if (Call_has_callees(call)) {
292 fprintf(F, " possible callees: \n");
293 for (i = 0; i < get_Call_n_callees(call); i++) {
294 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
299 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
302 if (!get_interprocedural_view()) {
303 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
304 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
305 for (i = 0; i < get_method_n_ress(tp); ++i)
306 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
310 assert(get_Const_type(n) != firm_none_type);
311 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
314 switch(get_SymConst_kind(n)) {
315 case symconst_addr_name:
316 fprintf(F, " kind: addr_name\n");
317 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
319 case symconst_addr_ent:
320 fprintf(F, " kind: addr_ent\n");
321 fprintf(F, " entity: ");
322 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
324 case symconst_ofs_ent:
325 fprintf(F, " kind: offset\n");
326 fprintf(F, " entity: ");
327 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
329 case symconst_type_tag:
330 fprintf(F, " kind: type_tag\n");
331 fprintf(F, " type: ");
332 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
334 case symconst_type_size:
335 fprintf(F, " kind: size\n");
336 fprintf(F, " type: ");
337 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
339 case symconst_type_align:
340 fprintf(F, " kind: alignment\n");
341 fprintf(F, " type: ");
342 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
344 case symconst_enum_const:
345 fprintf(F, " kind: enumeration\n");
346 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
349 fprintf(F, " kind: label\n");
350 fprintf(F, " label: %lu\n", get_SymConst_label(n));
353 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
356 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
357 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
358 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
361 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
362 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
365 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
368 const ir_asm_constraint *cons;
372 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
373 l = get_ASM_n_input_constraints(n);
375 fprintf(F, "\n inputs: ");
376 cons = get_ASM_input_constraints(n);
377 for (i = 0; i < l; ++i)
378 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
380 l = get_ASM_n_output_constraints(n);
382 fprintf(F, "\n outputs: ");
383 cons = get_ASM_output_constraints(n);
384 for (i = 0; i < l; ++i)
385 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
387 l = get_ASM_n_clobbers(n);
389 fprintf(F, "\n clobber: ");
390 clobber = get_ASM_clobbers(n);
391 for (i = 0; i < l; ++i)
392 fprintf(F, "%s ", get_id_str(clobber[i]));
394 if (get_irn_pinned(n) != op_pin_state_floats)
395 fprintf(F, "\n volatile");
401 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
402 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
403 if (get_irn_typeinfo_type(n) != firm_none_type)
404 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
411 void dump_irnode(ir_node *n) {
412 dump_irnode_to_file(stdout, n);
416 void dump_graph_to_file(FILE *F, ir_graph *irg) {
417 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
420 void dump_graph(ir_graph *g) {
421 dump_graph_to_file(stdout, g);
424 static void dump_node_to_graph_file(ir_node *n, void *env) {
425 FILE *F = (FILE *)env;
427 dump_irnode_to_file(F, n);
431 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
432 const char *basename = get_irg_dump_name(irg);
435 F = text_open(basename, suffix, "", ".txt");
437 dump_graph_to_file(F, irg);
439 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
444 #ifdef EXTENDED_ACCESS_STATS
445 static int addr_is_alloc(ir_node *acc) {
446 ir_node *addr = NULL;
449 addr = get_memop_ptr(acc);
451 assert(is_Call(acc));
452 addr = get_Call_ptr(acc);
455 addr_op = get_irn_opcode(addr);
457 while (addr_op != iro_Alloc) {
460 addr = get_Sel_ptr(addr);
463 addr = get_Cast_op(addr);
466 addr = get_Proj_pred(addr);
481 //assert(0 && "unexpected address node");
484 addr_op = get_irn_opcode(addr);
487 /* In addition, the alloc must be in the same loop. */
492 /** dumps something like:
494 * "prefix" "Name" (x): node1, ... node7,\n
495 * "prefix" node8, ... node15,\n
496 * "prefix" node16, node17\n
498 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
499 int (*get_entity_n_nodes)(firm_kind *ent),
500 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
502 int i, n_nodes = get_entity_n_nodes(k);
505 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
506 for (i = 0; i < n_nodes; ++i) {
508 if (i > 7 && !(i & 7)) { /* line break every eight node. */
509 fprintf(F, ",\n%s ", prefix);
512 fprintf(F, "%s ", comma);
513 rem = opt_dump_analysed_type_info;
514 opt_dump_analysed_type_info = 0;
515 dump_node_label(F, get_entity_node(k, i));
516 opt_dump_analysed_type_info = rem;
522 /** dumps something like:
524 * "prefix" "Name" (x): node1, ... node7,\n
525 * "prefix" node8, ... node15,\n
526 * "prefix" node16, node17\n
528 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
529 int (*get_n_types)(const ir_type *tp),
530 ir_type *(*get_type)(const ir_type *tp, int pos),
532 int i, n_nodes = get_n_types(tp);
535 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
536 for (i = 0; i < n_nodes; ++i) {
537 if (i > 7 && !(i & 7)) { /* line break every eight node. */
538 fprintf(F, ",\n%s ", prefix);
541 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
542 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
548 static int need_nl = 1;
553 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
554 const ir_initializer_t *initializer, ir_type *type) {
559 fprintf(F, "\n%s ", prefix);
562 switch (get_initializer_kind(initializer)) {
563 case IR_INITIALIZER_NULL:
564 fprintf(F, "\t = <NOT_SET>");
566 case IR_INITIALIZER_TARVAL:
567 tv = get_initializer_tarval_value(initializer);
568 ir_fprintf(F, "\t = <TV>%F", tv);
570 case IR_INITIALIZER_CONST:
571 value = get_initializer_const_value(initializer);
572 fprintf(F, "\t = <CONST>");
573 dump_node_opcode(F, value);
575 case IR_INITIALIZER_COMPOUND:
576 if (is_Array_type(type)) {
577 size_t i, n = get_initializer_compound_n_entries(initializer);
578 ir_type *element_type = get_array_element_type(type);
579 for (i = 0; i < n; ++i) {
580 ir_initializer_t *sub_initializer
581 = get_initializer_compound_value(initializer, i);
584 fprintf(F, "\n%s ", prefix);
587 fprintf(F, "[%d]", (int) i);
588 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
592 assert(is_compound_type(type));
593 n = get_compound_n_members(type);
594 for (i = 0; i < n; ++i) {
595 ir_entity *member = get_compound_member(type, i);
596 ir_type *subtype = get_entity_type(member);
597 ir_initializer_t *sub_initializer;
599 assert(i < get_initializer_compound_n_entries(initializer));
601 = get_initializer_compound_value(initializer, i);
604 fprintf(F, "\n%s ", prefix);
607 ir_fprintf(F, ".%F", member);
608 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
613 panic("invalid ir_initializer kind found");
619 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
621 ir_type *owner, *type;
623 assert(is_entity(ent));
624 owner = get_entity_owner(ent);
625 type = get_entity_type(ent);
626 if (verbosity & dump_verbosity_onlynames) {
627 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
628 get_entity_name(ent), get_entity_nr(ent));
632 if (verbosity & dump_verbosity_entattrs) {
633 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
634 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
635 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
637 if (is_Class_type(get_entity_owner(ent))) {
638 if (get_entity_n_overwrites(ent) > 0) {
639 fprintf(F, "%s overwrites:\n", prefix);
640 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
641 ir_entity *ov = get_entity_overwrites(ent, i);
642 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
643 get_type_name(get_entity_owner(ov)));
646 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
648 if (get_entity_n_overwrittenby(ent) > 0) {
649 fprintf(F, "%s overwritten by:\n", prefix);
650 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
651 ir_entity *ov = get_entity_overwrittenby(ent, i);
652 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
653 get_type_name(get_entity_owner(ov)));
656 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
659 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
661 fprintf(F, "%s transitive overwrites:\n", prefix);
662 for (ov = get_entity_trans_overwrites_first(ent);
664 ov = get_entity_trans_overwrites_next(ent)) {
665 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
666 get_type_name(get_entity_owner(ov)));
668 fprintf(F, "%s transitive overwritten by:\n", prefix);
669 for (ov = get_entity_trans_overwrittenby_first(ent);
671 ov = get_entity_trans_overwrittenby_next(ent)) {
672 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
673 get_type_name(get_entity_owner(ov)));
678 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
679 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
680 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
682 if (is_Method_type(get_entity_type(ent))) {
683 unsigned mask = get_entity_additional_properties(ent);
684 unsigned cc = get_method_calling_convention(get_entity_type(ent));
685 ir_graph *irg = get_entity_irg(ent);
688 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
689 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
693 fprintf(F, "\n%s additional prop: ", prefix);
695 if (mask & mtp_property_const) fprintf(F, "const_function, ");
696 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
697 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
698 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
699 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
700 if (mask & mtp_property_weak) fprintf(F, "weak_function, ");
702 fprintf(F, "\n%s calling convention: ", prefix);
703 if (cc & cc_reg_param) fprintf(F, "regparam, ");
704 if (cc & cc_this_call) fprintf(F, "thiscall, ");
705 if (cc & cc_compound_ret) fprintf(F, "compound_ret, ");
706 if (cc & cc_frame_on_caller_stk) fprintf(F, "frame on caller's stack, ");
707 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
710 else if (IS_STDCALL(cc))
711 fprintf(F, "stdcall");
713 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
714 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
716 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
720 } else { /* no entattrs */
721 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
722 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
723 get_type_name(get_entity_type(ent)), get_entity_name(ent));
724 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
726 if (verbosity & dump_verbosity_accessStats) {
727 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
728 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
729 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
734 if (verbosity & dump_verbosity_entconsts) {
735 if (get_entity_variability(ent) != variability_uninitialized) {
736 if (ent->has_initializer) {
737 const ir_initializer_t *initializer = get_entity_initializer(ent);
738 fprintf(F, "\n%s Initializers:", prefix);
740 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
742 /* old compound_graph_path based initializers */
743 if (is_atomic_entity(ent)) {
744 fprintf(F, "%s atomic value: ", prefix);
745 dump_node_opcode(F, get_atomic_ent_value(ent));
747 fprintf(F, "%s compound values:", prefix);
748 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
749 compound_graph_path *path = get_compound_ent_value_path(ent, i);
750 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
751 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
752 if (get_type_state(type) == layout_fixed)
753 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
754 fprintf(F, "%s", get_entity_name(ent));
755 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
756 ir_entity *node = get_compound_graph_path_node(path, j);
757 fprintf(F, ".%s", get_entity_name(node));
758 if (is_Array_type(get_entity_owner(node)))
759 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
762 dump_node_opcode(F, get_compound_ent_value(ent, i));
770 if (verbosity & dump_verbosity_entattrs) {
771 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
772 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
773 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
774 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
775 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
776 if (is_Method_type(get_entity_type(ent))) {
777 if (get_entity_irg(ent)) /* can be null */ {
778 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
779 #ifdef INTERPROCEDURAL_VIEW
780 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
781 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
782 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
786 fprintf(F, "\n%s irg = NULL", prefix);
792 if (get_trouts_state()) {
793 fprintf(F, "%s Entity outs:\n", prefix);
794 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
795 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
796 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
797 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
800 if (verbosity & dump_verbosity_accessStats) {
801 #ifdef EXTENDED_ACCESS_STATS
802 int n_acc = get_entity_n_accesses(ent);
806 int max_LA_freq = -1;
807 int max_SA_freq = -1;
813 /* Find maximal depth */
814 for (i = 0; i < n_acc; ++i) {
815 ir_node *acc = get_entity_access(ent, i);
816 int depth = get_weighted_loop_depth(acc);
817 max_depth = (depth > max_depth) ? depth : max_depth ;
820 L_freq = XMALLOCNZ(int, 4 * max_depth);
822 S_freq = L_freq + 1*max_depth;
823 LA_freq = L_freq + 2*max_depth;
824 SA_freq = L_freq + 3*max_depth;
826 for (i = 0; i < n_acc; ++i) {
827 ir_node *acc = get_entity_access(ent, i);
828 int depth = get_weighted_loop_depth(acc);
829 assert(depth < max_depth);
830 if (is_Load(acc) || is_Call(acc)) {
832 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
833 if (addr_is_alloc(acc)) {
835 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
837 } else if (is_Store(acc)) {
839 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
840 if (addr_is_alloc(acc)) {
842 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
849 if (max_L_freq >= 0) {
852 fprintf(F, "%s Load Stats", prefix);
853 for (i = 0; i <= max_L_freq; ++i) {
855 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
862 if (max_LA_freq >= 0) {
863 //fprintf(F, "%s LoadA Stats", prefix);
865 for (i = 0; i <= max_LA_freq; ++i) {
867 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
874 if (max_S_freq >= 0) {
877 fprintf(F, "%s Store Stats", prefix);
878 for (i = 0; i <= max_S_freq; ++i) {
880 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
887 if (max_SA_freq >= 0) {
888 //fprintf(F, "%s StoreAStats", prefix);
890 for (i = 0; i <= max_SA_freq; ++i) {
892 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
900 /* free allocated space */
903 if (get_trouts_state() != outs_none) {
904 #ifdef INTERPROCEDURAL_VIEW
905 if (is_Method_type(get_entity_type(ent))) {
906 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
907 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
909 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
910 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
917 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
918 dump_entity_to_file_prefix (F, ent, "", verbosity);
922 void dump_entity(ir_entity *ent) {
923 dump_entity_to_file(stdout, ent, dump_verbosity_max);
926 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
927 unsigned verbosity, int *max_disp,
928 int disp[], const char *comma)
934 #if 0 /* Outputs loop depth of all occurrences. */
935 int n_acc = get_entity_n_accesses(ent);
938 int max_LA_freq = -1;
939 int max_SA_freq = -1;
944 int i, max_depth = 0;
946 /* Find maximal depth */
947 for (i = 0; i < n_acc; ++i) {
948 ir_node *acc = get_entity_access(ent, i);
949 int depth = get_weighted_loop_depth(acc);
950 max_depth = (depth > max_depth) ? depth : max_depth ;
953 L_freq = XMALLOCNZ(int, 4 * (max_depth + 1));
955 S_freq = L_freq + 1*max_depth;
956 LA_freq = L_freq + 2*max_depth;
957 SA_freq = L_freq + 3*max_depth;
959 for (i = 0; i < n_acc; ++i) {
960 ir_node *acc = get_entity_access(ent, i);
961 int depth = get_weighted_loop_depth(acc);
962 assert(depth <= max_depth);
963 if (is_Load(acc) || is_Call(acc)) {
965 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
966 if (addr_is_alloc(acc)) {
968 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
970 if (get_entity_allocation(ent) == allocation_static) {
972 *max_disp = (depth > *max_disp) ? depth : *max_disp;
974 } else if (is_Store(acc)) {
976 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
977 if (addr_is_alloc(acc)) {
979 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
981 if (get_entity_allocation(ent) == allocation_static) {
989 if (get_entity_allocation(ent) != allocation_static) {
991 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
993 if (max_L_freq >= 0) {
994 fprintf(F, "%s Load", comma);
995 for (i = 0; i <= max_L_freq; ++i) {
996 fprintf(F, "%s %d", comma, L_freq[i]);
999 if (max_S_freq >= 0) {
1000 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
1001 fprintf(F, "%s Store", comma);
1002 for (i = 0; i <= max_S_freq; ++i) {
1003 fprintf(F, "%s %d", comma, S_freq[i]);
1011 if (get_entity_allocation(ent) != allocation_static) {
1012 if (is_Method_type(get_entity_type(ent))) return;
1014 /* Output the entity name. */
1015 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
1017 #ifdef INTERPROCEDURAL_VIEW
1018 if (get_trouts_state() != outs_none) {
1019 if (is_Method_type(get_entity_type(ent))) {
1020 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1021 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1023 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
1024 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
1033 #ifdef INTERPROCEDURAL_VIEW
1034 /* A fast hack to dump a CSV-file. */
1035 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
1037 char buf[1024 + 10];
1040 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
1042 if (verbosity & dump_verbosity_accessStats) {
1045 /* Outputs loop depth of all occurrences. */
1048 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
1049 int n_all = get_type_n_allocs(tp);
1051 /* Find maximal depth */
1052 for (i = 0; i < n_all; ++i) {
1053 ir_node *all = get_type_alloc(tp, i);
1054 int depth = get_weighted_loop_depth(all);
1055 max_depth = (depth > max_depth) ? depth : max_depth ;
1058 freq = XMALLOCNZ(int, 2 * (max_depth + 1));
1060 disp = freq + max_depth;
1062 for (i = 0; i < n_all; ++i) {
1063 ir_node *all = get_type_alloc(tp, i);
1064 int depth = get_weighted_loop_depth(all);
1065 assert(depth <= max_depth);
1067 max_freq = (depth > max_freq) ? depth : max_freq;
1068 assert(is_Alloc(all));
1071 fprintf(F, "%s ", get_type_name(tp));
1072 fprintf(F, "%s Alloc ", comma);
1074 if (max_freq >= 0) {
1075 for (i = 0; i <= max_freq; ++i) {
1076 fprintf(F, "%s %d", comma, freq[i]);
1081 for (i = 0; i < get_class_n_members(tp); ++i) {
1082 ir_entity *mem = get_class_member(tp, i);
1083 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1084 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1085 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1086 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1091 if (max_disp >= 0) {
1092 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1093 for (i = 0; i <= max_disp; ++i) {
1094 fprintf(F, "%s %d", comma, disp[i]);
1099 /* free allocated space */
1103 #define DISP_TAB_SUFFIX "__disp_tab"
1104 if (get_trouts_state() != outs_none) {
1105 assert(strlen(get_type_name(tp)) < 1024);
1106 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1107 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1108 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1111 for (i = 0; i < get_class_n_members(tp); ++i) {
1112 ir_entity *mem = get_class_member(tp, i);
1113 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1114 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1115 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1116 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1124 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1127 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1128 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1129 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1130 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1131 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1132 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1133 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1134 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1136 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1137 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1139 switch (get_type_tpop_code(tp)) {
1142 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1143 fprintf(F, "\n members: \n");
1145 for (i = 0; i < get_class_n_members(tp); ++i) {
1146 ir_entity *mem = get_class_member(tp, i);
1147 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1148 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1149 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1150 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1154 if (verbosity & dump_verbosity_typeattrs) {
1155 fprintf(F, " supertypes: ");
1156 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1157 ir_type *stp = get_class_supertype(tp, i);
1158 fprintf(F, "\n %d %s", i, get_type_name(stp));
1160 fprintf(F, "\n subtypes: ");
1161 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1162 ir_type *stp = get_class_subtype(tp, i);
1163 fprintf(F, "\n %d %s", i, get_type_name(stp));
1166 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1168 fprintf(F, "\n transitive supertypes: ");
1169 for (stp = get_class_trans_supertype_first(tp);
1171 stp = get_class_trans_supertype_next(tp)) {
1172 fprintf(F, "\n %s", get_type_name(stp));
1174 fprintf(F, "\n transitive subtypes: ");
1175 for (stp = get_class_trans_subtype_first(tp);
1177 stp = get_class_trans_subtype_next(tp)) {
1178 fprintf(F, "\n %s", get_type_name(stp));
1182 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1183 fprintf(F, "\n flags: ");
1184 if (is_class_final(tp))
1185 fprintf(F, "final, ");
1186 if (is_class_interface(tp))
1187 fprintf(F, "interface, ");
1188 if (is_class_abstract(tp))
1189 fprintf(F, "abstract, ");
1196 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1197 for (i = 0; i < get_compound_n_members(tp); ++i) {
1198 ir_entity *mem = get_compound_member(tp, i);
1199 if (verbosity & dump_verbosity_fields) {
1200 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1206 if (verbosity & dump_verbosity_typeattrs) {
1208 ir_type *elem_tp = get_array_element_type(tp);
1210 fprintf(F, "\n array ");
1212 n_dim = get_array_n_dimensions(tp);
1213 for (i = 0; i < n_dim; ++i) {
1214 ir_node *lower, *upper;
1216 lower = get_array_lower_bound(tp, i);
1217 upper = get_array_upper_bound(tp, i);
1221 if (is_Const(lower)) {
1222 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1224 dump_node_opcode(F, lower);
1225 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1228 if (is_Const(upper)) {
1229 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1231 dump_node_opcode(F, upper);
1232 fprintf(F, " %ld]", get_irn_node_nr(upper));
1235 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1237 fprintf(F, "\n order: ");
1238 for (i = 0; i < n_dim; ++i)
1239 fprintf(F, "<%d>", get_array_order(tp, i));
1243 if (verbosity & dump_verbosity_fields) {
1244 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1251 if (verbosity & dump_verbosity_typeattrs) {
1252 ir_type *tt = get_pointer_points_to_type(tp);
1253 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1258 if (verbosity & dump_verbosity_typeattrs) {
1259 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1260 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1261 for (i = 0; i < get_method_n_ress(tp); ++i) {
1262 ir_type *rtp = get_method_res_type(tp, i);
1263 fprintf(F, "\n %s", get_type_name(rtp));
1266 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1267 for (i = 0; i < get_method_n_params(tp); ++i) {
1268 ir_type *ptp = get_method_param_type(tp, i);
1269 fprintf(F, "\n %s", get_type_name(ptp));
1271 if (get_method_variadicity(tp)) {
1272 fprintf(F, "\n ...");
1279 if (verbosity & dump_verbosity_typeattrs) {
1280 ir_type *base_tp = get_primitive_base_type(tp);
1281 if (base_tp != NULL)
1282 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1294 if (verbosity & dump_verbosity_typeattrs) {
1295 fprintf(F, ": details not implemented\n");
1299 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1300 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1301 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1302 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1303 if (is_atomic_type(tp) || is_Method_type(tp))
1304 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1306 if (get_trouts_state()) {
1307 fprintf(F, "\n Type outs:\n");
1308 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1309 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1310 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1311 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1312 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1316 if (verbosity & dump_verbosity_accessStats) {
1318 int n_all = get_type_n_allocs(tp);
1323 /* Find maximal depth */
1324 for (i = 0; i < n_all; ++i) {
1325 ir_node *all = get_type_alloc(tp, i);
1326 int depth = get_weighted_loop_depth(all);
1327 max_depth = (depth > max_depth) ? depth : max_depth ;
1330 freq = XMALLOCNZ(int, max_depth + 1);
1332 for (i = 0; i < n_all; ++i) {
1333 ir_node *all = get_type_alloc(tp, i);
1334 int depth = get_weighted_loop_depth(all);
1335 assert(depth <= max_depth);
1337 max_freq = (depth > max_freq) ? depth : max_freq;
1338 assert(is_Alloc(all));
1341 if (max_freq >= 0) {
1344 fprintf(F, " Alloc Stats");
1345 for (i = 0; i <= max_freq; ++i) {
1346 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1354 #ifdef INTERPROCEDURAL_VIEW
1355 if (get_trouts_state() != outs_none) {
1356 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1357 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1358 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1359 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1360 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1361 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1371 void dump_type(ir_type *tp) {
1372 dump_type_to_file (stdout, tp, dump_verbosity_max);
1376 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1377 const char *basename;
1378 FILE *F, *CSV = NULL;
1379 int i, n_types = get_irp_n_types();
1381 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1382 F = text_open(basename, suffix, "-types", ".txt");
1384 if (verbosity & dump_verbosity_csv) {
1385 CSV = text_open(basename, suffix, "-types", ".csv");
1386 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1389 for (i = 0; i < n_types; ++i) {
1390 ir_type *t = get_irp_type(i);
1392 //if (is_jack_rts_class(t)) continue;
1394 dump_type_to_file(F, t, verbosity);
1395 #ifdef INTERPROCEDURAL_VIEW
1397 dump_typecsv_to_file(CSV, t, verbosity, "");
1403 if (CSV) fclose(CSV);
1407 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1408 const char *basename;
1409 FILE *F, *CSV = NULL;
1410 ir_type *g = get_glob_type();
1411 int i, n_mems = get_class_n_members(g);
1413 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1414 F = text_open (basename, suffix, "-globals", ".txt");
1416 if (verbosity & dump_verbosity_csv) {
1417 CSV = text_open (basename, suffix, "-types", ".csv");
1418 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1421 for (i = 0; i < n_mems; ++i) {
1422 ir_entity *e = get_class_member(g, i);
1424 dump_entity_to_file(F, e, verbosity);
1426 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1431 if (CSV) fclose (CSV);