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
40 #include "irgraph_t.h"
42 #include "firm_common_t.h"
53 #include "field_temperature.h"
55 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
58 * Just opens a file, mangling a file name.
60 * The file name results from the concatenation of the following parts:
62 * @param basename The basis of the name telling about the content.
63 * @param suffix1 The first suffix.
64 * @param suffix2 The second suffix.
65 * @param suffix3 The third suffix.
67 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
69 int len = strlen(basename), i, j;
70 char *fname; /* filename to put the vcg information in */
72 if (!basename) assert(basename);
73 if (!suffix1) suffix1 = "";
74 if (!suffix2) suffix2 = "";
75 if (!suffix3) suffix3 = ".txt";
77 /* open file for vcg graph */
78 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
81 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
82 if (basename[i] == '/') {
83 fname[j] = '@'; j++; fname[j] = '1'; j++;
84 } else if (basename[i] == '@') {
85 fname[j] = '@'; j++; fname[j] = '2'; j++;
87 fname[j] = basename[i]; j++;
91 strcat(fname, suffix1); /* append file suffix */
92 strcat(fname, suffix2); /* append file suffix */
93 strcat(fname, suffix3); /* append the .txt suffix */
95 F = fopen(fname, "w"); /* open file for writing */
105 /* Write the irnode and all its attributes to the file passed. */
106 int dump_irnode_to_file(FILE *F, ir_node *n) {
111 dump_node_opcode(F, n);
112 fprintf(F, " %ld\n", get_irn_node_nr(n));
114 fprintf(F, " index: %u\n", get_irn_idx(n));
115 if (opt_dump_pointer_values_to_info)
116 fprintf (F, " addr: %p \n", (void *)n);
117 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
118 fprintf (F, " visited: %ld \n", get_irn_visited(n));
119 irg = get_irn_irg(n);
120 if (irg != get_const_code_irg())
121 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
123 if (get_irn_pinned(n) == op_pin_state_floats &&
124 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
125 fprintf(F, " node was pinned in ");
126 dump_node_opcode(F, get_irn_n(n, -1));
127 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
130 #ifdef INTERPROCEDURAL_VIEW
131 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
132 /* show all predecessor nodes */
133 fprintf(F, " pred nodes: \n");
136 dump_node_opcode(F, get_irn_n(n, -1));
137 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
139 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
140 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
141 dump_node_opcode(F, get_irn_intra_n(n, i));
142 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
145 fprintf(F, " arity: %d\n", get_irn_arity(n));
146 /* show all predecessor nodes */
147 fprintf(F, " pred nodes: \n");
150 dump_node_opcode(F, get_irn_n(n, -1));
151 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
153 for ( i = 0; i < get_irn_arity(n); ++i) {
154 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
155 dump_node_opcode(F, get_irn_n(n, i));
156 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
160 fprintf(F, " Private Attributes:\n");
163 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
165 #ifdef INTERPROCEDURAL_VIEW
166 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
167 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
168 fprintf(F, " inter pred nodes: \n");
169 for (i = 0; i < get_irn_inter_arity(n); ++i) {
170 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
171 dump_node_opcode(F, get_irn_inter_n(n, i));
172 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
177 if (is_fragile_op(n)) {
178 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
179 /* not dumped: frag array */
182 /* This is not nice, output it as a marker in the predecessor list. */
184 get_irn_op(n) == op_Phi ||
185 (is_Filter(n) && get_interprocedural_view())) {
186 fprintf(F, " backedges:");
188 for (i = 0; i < get_irn_arity(n); i++)
189 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
193 /* Loop node. Someone else please tell me what's wrong ... */
194 if (get_irn_loop(n)) {
195 ir_loop *loop = get_irn_loop(n);
197 fprintf(F, " in loop %d with depth %d\n",
198 get_loop_loop_nr(loop), get_loop_depth(loop));
202 switch (get_irn_opcode(n)) {
204 if (has_Block_label(n))
205 fprintf(F, " Label: %lu\n", get_Block_label(n));
206 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
207 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
208 fprintf(F, " block marked: %u\n", get_Block_mark(n));
209 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
210 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
211 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
212 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
215 fprintf(F, " Execution frequency statistics:\n");
216 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
217 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
218 #ifdef INTERPROCEDURAL_VIEW
219 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
220 fprintf(F, " call frequency of procedure: %8.2lf\n",
221 get_irg_method_execution_frequency(get_irn_irg(n)));
222 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
223 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
224 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
225 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
226 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
227 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
230 /* not dumped: graph_arr */
231 /* not dumped: mature */
234 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
235 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
236 for (i = 0; i < get_method_n_params(tp); ++i)
237 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
238 #ifdef INTERPROCEDURAL_VIEW
239 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
240 ir_node *sbl = get_nodes_block(n);
241 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
242 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
243 for (i = 0; i < n_cfgpreds; ++i) {
244 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
245 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
246 get_irg_dump_name(get_irn_irg(cfgpred)));
252 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
253 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
254 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
255 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
258 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
259 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
262 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
263 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
266 ir_entity *ent = get_Sel_entity(n);
268 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
269 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
270 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
273 fprintf(F, " <NULL entity>\n");
278 ir_type *tp = get_Call_type(n);
279 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
280 if(get_unknown_type() != tp) {
281 for (i = 0; i < get_method_n_params(tp); ++i)
282 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
283 for (i = 0; i < get_method_n_ress(tp); ++i)
284 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
286 if (Call_has_callees(n)) {
287 fprintf(F, " possible callees: \n");
288 for (i = 0; i < get_Call_n_callees(n); i++) {
289 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
293 case iro_CallBegin: {
294 ir_node *call = get_CallBegin_call(n);
295 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
296 if (Call_has_callees(call)) {
297 fprintf(F, " possible callees: \n");
298 for (i = 0; i < get_Call_n_callees(call); i++) {
299 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
304 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
307 if (!get_interprocedural_view()) {
308 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
309 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
310 for (i = 0; i < get_method_n_ress(tp); ++i)
311 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
315 assert(get_Const_type(n) != firm_none_type);
316 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
319 switch(get_SymConst_kind(n)) {
320 case symconst_addr_name:
321 fprintf(F, " kind: addr_name\n");
322 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
324 case symconst_addr_ent:
325 fprintf(F, " kind: addr_ent\n");
326 fprintf(F, " entity: ");
327 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
329 case symconst_ofs_ent:
330 fprintf(F, " kind: offset\n");
331 fprintf(F, " entity: ");
332 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
334 case symconst_type_tag:
335 fprintf(F, " kind: type_tag\n");
336 fprintf(F, " type: ");
337 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
339 case symconst_type_size:
340 fprintf(F, " kind: size\n");
341 fprintf(F, " type: ");
342 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
344 case symconst_type_align:
345 fprintf(F, " kind: alignment\n");
346 fprintf(F, " type: ");
347 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
349 case symconst_enum_const:
350 fprintf(F, " kind: enumeration\n");
351 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
354 fprintf(F, " kind: label\n");
355 fprintf(F, " label: %lu\n", get_SymConst_label(n));
358 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
361 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
362 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
363 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
366 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
367 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
370 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
373 const ir_asm_constraint *cons;
377 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
378 l = get_ASM_n_input_constraints(n);
380 fprintf(F, "\n inputs: ");
381 cons = get_ASM_input_constraints(n);
382 for (i = 0; i < l; ++i)
383 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
385 l = get_ASM_n_output_constraints(n);
387 fprintf(F, "\n outputs: ");
388 cons = get_ASM_output_constraints(n);
389 for (i = 0; i < l; ++i)
390 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
392 l = get_ASM_n_clobbers(n);
394 fprintf(F, "\n clobber: ");
395 clobber = get_ASM_clobbers(n);
396 for (i = 0; i < l; ++i)
397 fprintf(F, "%s ", get_id_str(clobber[i]));
399 if (get_irn_pinned(n) != op_pin_state_floats)
400 fprintf(F, "\n volatile");
406 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
407 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
408 if (get_irn_typeinfo_type(n) != firm_none_type)
409 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
416 void dump_irnode(ir_node *n) {
417 dump_irnode_to_file(stdout, n);
421 void dump_graph_to_file(FILE *F, ir_graph *irg) {
422 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
425 void dump_graph(ir_graph *g) {
426 dump_graph_to_file(stdout, g);
429 static void dump_node_to_graph_file(ir_node *n, void *env) {
430 FILE *F = (FILE *)env;
432 dump_irnode_to_file(F, n);
436 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
437 const char *basename = get_irg_dump_name(irg);
440 F = text_open(basename, suffix, "", ".txt");
442 dump_graph_to_file(F, irg);
444 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
449 #ifdef EXTENDED_ACCESS_STATS
450 static int addr_is_alloc(ir_node *acc) {
451 ir_node *addr = NULL;
454 addr = get_memop_ptr(acc);
456 assert(is_Call(acc));
457 addr = get_Call_ptr(acc);
460 addr_op = get_irn_opcode(addr);
462 while (addr_op != iro_Alloc) {
465 addr = get_Sel_ptr(addr);
468 addr = get_Cast_op(addr);
471 addr = get_Proj_pred(addr);
486 //assert(0 && "unexpected address node");
489 addr_op = get_irn_opcode(addr);
492 /* In addition, the alloc must be in the same loop. */
497 /** dumps something like:
499 * "prefix" "Name" (x): node1, ... node7,\n
500 * "prefix" node8, ... node15,\n
501 * "prefix" node16, node17\n
503 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
504 int (*get_entity_n_nodes)(firm_kind *ent),
505 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
507 int i, n_nodes = get_entity_n_nodes(k);
510 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
511 for (i = 0; i < n_nodes; ++i) {
513 if (i > 7 && !(i & 7)) { /* line break every eight node. */
514 fprintf(F, ",\n%s ", prefix);
517 fprintf(F, "%s ", comma);
518 rem = opt_dump_analysed_type_info;
519 opt_dump_analysed_type_info = 0;
520 dump_node_label(F, get_entity_node(k, i));
521 opt_dump_analysed_type_info = rem;
527 /** dumps something like:
529 * "prefix" "Name" (x): node1, ... node7,\n
530 * "prefix" node8, ... node15,\n
531 * "prefix" node16, node17\n
533 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
534 int (*get_n_types)(const ir_type *tp),
535 ir_type *(*get_type)(const ir_type *tp, int pos),
537 int i, n_nodes = get_n_types(tp);
540 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
541 for (i = 0; i < n_nodes; ++i) {
542 if (i > 7 && !(i & 7)) { /* line break every eight node. */
543 fprintf(F, ",\n%s ", prefix);
546 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
547 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
553 static int need_nl = 1;
558 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
559 const ir_initializer_t *initializer, ir_type *type) {
564 fprintf(F, "\n%s ", prefix);
567 switch (get_initializer_kind(initializer)) {
568 case IR_INITIALIZER_NULL:
569 fprintf(F, "\t = <NOT_SET>");
571 case IR_INITIALIZER_TARVAL:
572 tv = get_initializer_tarval_value(initializer);
573 ir_fprintf(F, "\t = <TV>%F", tv);
575 case IR_INITIALIZER_CONST:
576 value = get_initializer_const_value(initializer);
577 fprintf(F, "\t = <CONST>");
578 dump_node_opcode(F, value);
580 case IR_INITIALIZER_COMPOUND:
581 if (is_Array_type(type)) {
582 size_t i, n = get_initializer_compound_n_entries(initializer);
583 ir_type *element_type = get_array_element_type(type);
584 for (i = 0; i < n; ++i) {
585 ir_initializer_t *sub_initializer
586 = get_initializer_compound_value(initializer, i);
589 fprintf(F, "\n%s ", prefix);
592 fprintf(F, "[%d]", i);
593 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
597 assert(is_compound_type(type));
598 n = get_compound_n_members(type);
599 for (i = 0; i < n; ++i) {
600 ir_entity *member = get_compound_member(type, i);
601 ir_type *subtype = get_entity_type(member);
602 ir_initializer_t *sub_initializer;
604 assert(i < get_initializer_compound_n_entries(initializer));
606 = get_initializer_compound_value(initializer, i);
609 fprintf(F, "\n%s ", prefix);
612 ir_fprintf(F, ".%F", member);
613 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
618 panic("invalid ir_initializer kind found");
624 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
626 ir_type *owner, *type;
628 assert(is_entity(ent));
629 owner = get_entity_owner(ent);
630 type = get_entity_type(ent);
631 if (verbosity & dump_verbosity_onlynames) {
632 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
633 get_entity_name(ent), get_entity_nr(ent));
637 if (verbosity & dump_verbosity_entattrs) {
638 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
639 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
640 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
642 if (is_Class_type(get_entity_owner(ent))) {
643 if (get_entity_n_overwrites(ent) > 0) {
644 fprintf(F, "%s overwrites:\n", prefix);
645 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
646 ir_entity *ov = get_entity_overwrites(ent, i);
647 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
648 get_type_name(get_entity_owner(ov)));
651 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
653 if (get_entity_n_overwrittenby(ent) > 0) {
654 fprintf(F, "%s overwritten by:\n", prefix);
655 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
656 ir_entity *ov = get_entity_overwrittenby(ent, i);
657 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
658 get_type_name(get_entity_owner(ov)));
661 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
664 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
666 fprintf(F, "%s transitive overwrites:\n", prefix);
667 for (ov = get_entity_trans_overwrites_first(ent);
669 ov = get_entity_trans_overwrites_next(ent)) {
670 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
671 get_type_name(get_entity_owner(ov)));
673 fprintf(F, "%s transitive overwritten by:\n", prefix);
674 for (ov = get_entity_trans_overwrittenby_first(ent);
676 ov = get_entity_trans_overwrittenby_next(ent)) {
677 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
678 get_type_name(get_entity_owner(ov)));
683 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
684 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
685 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
687 if (is_Method_type(get_entity_type(ent))) {
688 unsigned mask = get_entity_additional_properties(ent);
689 unsigned cc = get_method_calling_convention(get_entity_type(ent));
690 ir_graph *irg = get_entity_irg(ent);
693 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
694 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
698 fprintf(F, "\n%s additional prop: ", prefix);
700 if (mask & mtp_property_const) fprintf(F, "const_function, ");
701 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
702 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
703 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
704 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
706 fprintf(F, "\n%s calling convention: ", prefix);
707 if (cc & cc_reg_param) fprintf(F, "regparam, ");
708 if (cc & cc_this_call) fprintf(F, "thiscall, ");
709 if (cc & cc_compound_ret) fprintf(F, "compound_ret, ");
710 if (cc & cc_frame_on_caller_stk) fprintf(F, "frame on caller's stack, ");
711 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
714 else if (IS_STDCALL(cc))
715 fprintf(F, "stdcall");
717 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
718 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
720 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
724 } else { /* no entattrs */
725 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
726 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
727 get_type_name(get_entity_type(ent)), get_entity_name(ent));
728 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
730 if (verbosity & dump_verbosity_accessStats) {
731 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
732 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
733 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
738 if (verbosity & dump_verbosity_entconsts) {
739 if (get_entity_variability(ent) != variability_uninitialized) {
740 if (ent->has_initializer) {
741 const ir_initializer_t *initializer = get_entity_initializer(ent);
742 fprintf(F, "\n%s Initializers:", prefix);
744 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
746 /* old compound_graph_path based initializers */
747 if (is_atomic_entity(ent)) {
748 fprintf(F, "%s atomic value: ", prefix);
749 dump_node_opcode(F, get_atomic_ent_value(ent));
751 fprintf(F, "%s compound values:", prefix);
752 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
753 compound_graph_path *path = get_compound_ent_value_path(ent, i);
754 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
755 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
756 if (get_type_state(type) == layout_fixed)
757 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
758 fprintf(F, "%s", get_entity_name(ent));
759 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
760 ir_entity *node = get_compound_graph_path_node(path, j);
761 fprintf(F, ".%s", get_entity_name(node));
762 if (is_Array_type(get_entity_owner(node)))
763 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
766 dump_node_opcode(F, get_compound_ent_value(ent, i));
774 if (verbosity & dump_verbosity_entattrs) {
775 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
776 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
777 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
778 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
779 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
780 if (is_Method_type(get_entity_type(ent))) {
781 if (get_entity_irg(ent)) /* can be null */ {
782 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
783 #ifdef INTERPROCEDURAL_VIEW
784 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
785 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
786 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
790 fprintf(F, "\n%s irg = NULL", prefix);
796 if (get_trouts_state()) {
797 fprintf(F, "%s Entity outs:\n", prefix);
798 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
799 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
800 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
801 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
804 if (verbosity & dump_verbosity_accessStats) {
805 #ifdef EXTENDED_ACCESS_STATS
806 int n_acc = get_entity_n_accesses(ent);
810 int max_LA_freq = -1;
811 int max_SA_freq = -1;
817 /* Find maximal depth */
818 for (i = 0; i < n_acc; ++i) {
819 ir_node *acc = get_entity_access(ent, i);
820 int depth = get_weighted_loop_depth(acc);
821 max_depth = (depth > max_depth) ? depth : max_depth ;
824 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
826 S_freq = L_freq + 1*max_depth;
827 LA_freq = L_freq + 2*max_depth;
828 SA_freq = L_freq + 3*max_depth;
830 for (i = 0; i < n_acc; ++i) {
831 ir_node *acc = get_entity_access(ent, i);
832 int depth = get_weighted_loop_depth(acc);
833 assert(depth < max_depth);
834 if (is_Load(acc) || is_Call(acc)) {
836 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
837 if (addr_is_alloc(acc)) {
839 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
841 } else if (is_Store(acc)) {
843 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
844 if (addr_is_alloc(acc)) {
846 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
853 if (max_L_freq >= 0) {
856 fprintf(F, "%s Load Stats", prefix);
857 for (i = 0; i <= max_L_freq; ++i) {
859 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
866 if (max_LA_freq >= 0) {
867 //fprintf(F, "%s LoadA Stats", prefix);
869 for (i = 0; i <= max_LA_freq; ++i) {
871 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
878 if (max_S_freq >= 0) {
881 fprintf(F, "%s Store Stats", prefix);
882 for (i = 0; i <= max_S_freq; ++i) {
884 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
891 if (max_SA_freq >= 0) {
892 //fprintf(F, "%s StoreAStats", prefix);
894 for (i = 0; i <= max_SA_freq; ++i) {
896 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
904 /* free allocated space */
907 if (get_trouts_state() != outs_none) {
908 #ifdef INTERPROCEDURAL_VIEW
909 if (is_Method_type(get_entity_type(ent))) {
910 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
911 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
913 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
914 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
921 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
922 dump_entity_to_file_prefix (F, ent, "", verbosity);
926 void dump_entity(ir_entity *ent) {
927 dump_entity_to_file(stdout, ent, dump_verbosity_max);
930 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
931 unsigned verbosity, int *max_disp,
932 int disp[], const char *comma)
938 #if 0 /* Outputs loop depth of all occurrences. */
939 int n_acc = get_entity_n_accesses(ent);
942 int max_LA_freq = -1;
943 int max_SA_freq = -1;
948 int i, max_depth = 0;
950 /* Find maximal depth */
951 for (i = 0; i < n_acc; ++i) {
952 ir_node *acc = get_entity_access(ent, i);
953 int depth = get_weighted_loop_depth(acc);
954 max_depth = (depth > max_depth) ? depth : max_depth ;
957 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
959 S_freq = L_freq + 1*max_depth;
960 LA_freq = L_freq + 2*max_depth;
961 SA_freq = L_freq + 3*max_depth;
963 for (i = 0; i < n_acc; ++i) {
964 ir_node *acc = get_entity_access(ent, i);
965 int depth = get_weighted_loop_depth(acc);
966 assert(depth <= max_depth);
967 if (is_Load(acc) || is_Call(acc)) {
969 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
970 if (addr_is_alloc(acc)) {
972 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
974 if (get_entity_allocation(ent) == allocation_static) {
976 *max_disp = (depth > *max_disp) ? depth : *max_disp;
978 } else if (is_Store(acc)) {
980 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
981 if (addr_is_alloc(acc)) {
983 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
985 if (get_entity_allocation(ent) == allocation_static) {
993 if (get_entity_allocation(ent) != allocation_static) {
995 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
997 if (max_L_freq >= 0) {
998 fprintf(F, "%s Load", comma);
999 for (i = 0; i <= max_L_freq; ++i) {
1000 fprintf(F, "%s %d", comma, L_freq[i]);
1003 if (max_S_freq >= 0) {
1004 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
1005 fprintf(F, "%s Store", comma);
1006 for (i = 0; i <= max_S_freq; ++i) {
1007 fprintf(F, "%s %d", comma, S_freq[i]);
1015 if (get_entity_allocation(ent) != allocation_static) {
1016 if (is_Method_type(get_entity_type(ent))) return;
1018 /* Output the entity name. */
1019 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
1021 #ifdef INTERPROCEDURAL_VIEW
1022 if (get_trouts_state() != outs_none) {
1023 if (is_Method_type(get_entity_type(ent))) {
1024 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1025 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1027 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
1028 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
1037 #ifdef INTERPROCEDURAL_VIEW
1038 /* A fast hack to dump a CSV-file. */
1039 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
1041 char buf[1024 + 10];
1044 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
1046 if (verbosity & dump_verbosity_accessStats) {
1049 /* Outputs loop depth of all occurrences. */
1052 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
1053 int n_all = get_type_n_allocs(tp);
1055 /* Find maximal depth */
1056 for (i = 0; i < n_all; ++i) {
1057 ir_node *all = get_type_alloc(tp, i);
1058 int depth = get_weighted_loop_depth(all);
1059 max_depth = (depth > max_depth) ? depth : max_depth ;
1062 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
1064 disp = freq + max_depth;
1066 for (i = 0; i < n_all; ++i) {
1067 ir_node *all = get_type_alloc(tp, i);
1068 int depth = get_weighted_loop_depth(all);
1069 assert(depth <= max_depth);
1071 max_freq = (depth > max_freq) ? depth : max_freq;
1072 assert(is_Alloc(all));
1075 fprintf(F, "%s ", get_type_name(tp));
1076 fprintf(F, "%s Alloc ", comma);
1078 if (max_freq >= 0) {
1079 for (i = 0; i <= max_freq; ++i) {
1080 fprintf(F, "%s %d", comma, freq[i]);
1085 for (i = 0; i < get_class_n_members(tp); ++i) {
1086 ir_entity *mem = get_class_member(tp, i);
1087 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1088 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1089 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1090 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1095 if (max_disp >= 0) {
1096 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1097 for (i = 0; i <= max_disp; ++i) {
1098 fprintf(F, "%s %d", comma, disp[i]);
1103 /* free allocated space */
1107 #define DISP_TAB_SUFFIX "__disp_tab"
1108 if (get_trouts_state() != outs_none) {
1109 assert(strlen(get_type_name(tp)) < 1024);
1110 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1111 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1112 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1115 for (i = 0; i < get_class_n_members(tp); ++i) {
1116 ir_entity *mem = get_class_member(tp, i);
1117 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1118 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1119 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1120 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1128 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1131 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1132 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1133 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1134 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1135 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1136 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1137 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1138 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1140 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1141 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1143 switch (get_type_tpop_code(tp)) {
1146 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1147 fprintf(F, "\n members: \n");
1149 for (i = 0; i < get_class_n_members(tp); ++i) {
1150 ir_entity *mem = get_class_member(tp, i);
1151 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1152 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1153 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1154 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1158 if (verbosity & dump_verbosity_typeattrs) {
1159 fprintf(F, " supertypes: ");
1160 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1161 ir_type *stp = get_class_supertype(tp, i);
1162 fprintf(F, "\n %d %s", i, get_type_name(stp));
1164 fprintf(F, "\n subtypes: ");
1165 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1166 ir_type *stp = get_class_subtype(tp, i);
1167 fprintf(F, "\n %d %s", i, get_type_name(stp));
1170 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1172 fprintf(F, "\n transitive supertypes: ");
1173 for (stp = get_class_trans_supertype_first(tp);
1175 stp = get_class_trans_supertype_next(tp)) {
1176 fprintf(F, "\n %s", get_type_name(stp));
1178 fprintf(F, "\n transitive subtypes: ");
1179 for (stp = get_class_trans_subtype_first(tp);
1181 stp = get_class_trans_subtype_next(tp)) {
1182 fprintf(F, "\n %s", get_type_name(stp));
1186 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1187 fprintf(F, "\n flags: ");
1188 if (is_class_final(tp))
1189 fprintf(F, "final, ");
1190 if (is_class_interface(tp))
1191 fprintf(F, "interface, ");
1192 if (is_class_abstract(tp))
1193 fprintf(F, "abstract, ");
1200 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1201 for (i = 0; i < get_compound_n_members(tp); ++i) {
1202 ir_entity *mem = get_compound_member(tp, i);
1203 if (verbosity & dump_verbosity_fields) {
1204 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1210 if (verbosity & dump_verbosity_typeattrs) {
1212 ir_type *elem_tp = get_array_element_type(tp);
1214 fprintf(F, "\n array ");
1216 n_dim = get_array_n_dimensions(tp);
1217 for (i = 0; i < n_dim; ++i) {
1218 ir_node *lower, *upper;
1220 lower = get_array_lower_bound(tp, i);
1221 upper = get_array_upper_bound(tp, i);
1225 if (is_Const(lower)) {
1226 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1228 dump_node_opcode(F, lower);
1229 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1232 if (is_Const(upper)) {
1233 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1235 dump_node_opcode(F, upper);
1236 fprintf(F, " %ld]", get_irn_node_nr(upper));
1239 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1241 fprintf(F, "\n order: ");
1242 for (i = 0; i < n_dim; ++i)
1243 fprintf(F, "<%d>", get_array_order(tp, i));
1247 if (verbosity & dump_verbosity_fields) {
1248 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1255 if (verbosity & dump_verbosity_typeattrs) {
1256 ir_type *tt = get_pointer_points_to_type(tp);
1257 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1262 if (verbosity & dump_verbosity_typeattrs) {
1263 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1264 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1265 for (i = 0; i < get_method_n_ress(tp); ++i) {
1266 ir_type *rtp = get_method_res_type(tp, i);
1267 fprintf(F, "\n %s", get_type_name(rtp));
1270 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1271 for (i = 0; i < get_method_n_params(tp); ++i) {
1272 ir_type *ptp = get_method_param_type(tp, i);
1273 fprintf(F, "\n %s", get_type_name(ptp));
1275 if (get_method_variadicity(tp)) {
1276 fprintf(F, "\n ...");
1283 if (verbosity & dump_verbosity_typeattrs) {
1284 ir_type *base_tp = get_primitive_base_type(tp);
1285 if (base_tp != NULL)
1286 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1298 if (verbosity & dump_verbosity_typeattrs) {
1299 fprintf(F, ": details not implemented\n");
1303 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1304 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1305 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1306 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1307 if (is_atomic_type(tp) || is_Method_type(tp))
1308 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1310 if (get_trouts_state()) {
1311 fprintf(F, "\n Type outs:\n");
1312 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1313 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1314 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1315 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1316 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1320 if (verbosity & dump_verbosity_accessStats) {
1322 int n_all = get_type_n_allocs(tp);
1327 /* Find maximal depth */
1328 for (i = 0; i < n_all; ++i) {
1329 ir_node *all = get_type_alloc(tp, i);
1330 int depth = get_weighted_loop_depth(all);
1331 max_depth = (depth > max_depth) ? depth : max_depth ;
1334 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1336 for (i = 0; i < n_all; ++i) {
1337 ir_node *all = get_type_alloc(tp, i);
1338 int depth = get_weighted_loop_depth(all);
1339 assert(depth <= max_depth);
1341 max_freq = (depth > max_freq) ? depth : max_freq;
1342 assert(is_Alloc(all));
1345 if (max_freq >= 0) {
1348 fprintf(F, " Alloc Stats");
1349 for (i = 0; i <= max_freq; ++i) {
1350 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1358 #ifdef INTERPROCEDURAL_VIEW
1359 if (get_trouts_state() != outs_none) {
1360 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1361 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1362 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1363 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1364 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1365 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1375 void dump_type(ir_type *tp) {
1376 dump_type_to_file (stdout, tp, dump_verbosity_max);
1380 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1381 const char *basename;
1382 FILE *F, *CSV = NULL;
1383 int i, n_types = get_irp_n_types();
1385 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1386 F = text_open(basename, suffix, "-types", ".txt");
1388 if (verbosity & dump_verbosity_csv) {
1389 CSV = text_open(basename, suffix, "-types", ".csv");
1390 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1393 for (i = 0; i < n_types; ++i) {
1394 ir_type *t = get_irp_type(i);
1396 //if (is_jack_rts_class(t)) continue;
1398 dump_type_to_file(F, t, verbosity);
1399 #ifdef INTERPROCEDURAL_VIEW
1401 dump_typecsv_to_file(CSV, t, verbosity, "");
1407 if (CSV) fclose(CSV);
1411 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1412 const char *basename;
1413 FILE *F, *CSV = NULL;
1414 ir_type *g = get_glob_type();
1415 int i, n_mems = get_class_n_members(g);
1417 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1418 F = text_open (basename, suffix, "-globals", ".txt");
1420 if (verbosity & dump_verbosity_csv) {
1421 CSV = text_open (basename, suffix, "-types", ".csv");
1422 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1425 for (i = 0; i < n_mems; ++i) {
1426 ir_entity *e = get_class_member(g, i);
1428 dump_entity_to_file(F, e, verbosity);
1430 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1435 if (CSV) fclose (CSV);