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
33 #include "irgraph_t.h"
44 #include "field_temperature.h"
46 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
49 * Just opens a file, mangling a file name.
51 * The file name results from the concatenation of the following parts:
53 * @param basename The basis of the name telling about the content.
54 * @param suffix1 The first suffix.
55 * @param suffix2 The second suffix.
56 * @param suffix3 The third suffix.
58 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
60 int len = strlen(basename), i, j;
61 char *fname; /* filename to put the vcg information in */
63 if (!basename) assert(basename);
64 if (!suffix1) suffix1 = "";
65 if (!suffix2) suffix2 = "";
66 if (!suffix3) suffix3 = ".txt";
68 /* open file for vcg graph */
69 fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
72 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
73 if (basename[i] == '/') {
74 fname[j] = '@'; j++; fname[j] = '1'; j++;
75 } else if (basename[i] == '@') {
76 fname[j] = '@'; j++; fname[j] = '2'; j++;
78 fname[j] = basename[i]; j++;
82 strcat(fname, suffix1); /* append file suffix */
83 strcat(fname, suffix2); /* append file suffix */
84 strcat(fname, suffix3); /* append the .txt suffix */
86 F = fopen(fname, "w"); /* open file for writing */
96 /* Write the irnode and all its attributes to the file passed. */
97 int dump_irnode_to_file(FILE *F, ir_node *n) {
102 dump_node_opcode(F, n);
103 fprintf(F, " %ld\n", get_irn_node_nr(n));
105 fprintf(F, " index: %u\n", get_irn_idx(n));
106 if (opt_dump_pointer_values_to_info)
107 fprintf (F, " addr: %p\n", (void *)n);
108 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
109 fprintf (F, " visited: %ld\n", get_irn_visited(n));
110 irg = get_irn_irg(n);
111 if (irg != get_const_code_irg())
112 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
114 if (get_irn_pinned(n) == op_pin_state_floats &&
115 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
116 fprintf(F, " node was pinned in ");
117 dump_node_opcode(F, get_irn_n(n, -1));
118 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
121 #ifdef INTERPROCEDURAL_VIEW
122 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
123 /* show all predecessor nodes */
124 fprintf(F, " pred nodes:\n");
127 dump_node_opcode(F, get_irn_n(n, -1));
128 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
130 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
131 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
132 dump_node_opcode(F, get_irn_intra_n(n, i));
133 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
136 fprintf(F, " arity: %d\n", get_irn_arity(n));
137 /* show all predecessor nodes */
138 fprintf(F, " pred nodes:\n");
141 dump_node_opcode(F, get_irn_n(n, -1));
142 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
144 for ( i = 0; i < get_irn_arity(n); ++i) {
145 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
146 dump_node_opcode(F, get_irn_n(n, i));
147 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
151 fprintf(F, " Private Attributes:\n");
154 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
156 #ifdef INTERPROCEDURAL_VIEW
157 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
158 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
159 fprintf(F, " inter pred nodes:\n");
160 for (i = 0; i < get_irn_inter_arity(n); ++i) {
161 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
162 dump_node_opcode(F, get_irn_inter_n(n, i));
163 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
168 if (is_fragile_op(n)) {
169 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
170 /* not dumped: frag array */
173 /* This is not nice, output it as a marker in the predecessor list. */
175 get_irn_op(n) == op_Phi ||
176 (is_Filter(n) && get_interprocedural_view())) {
177 fprintf(F, " backedges:");
179 for (i = 0; i < get_irn_arity(n); i++)
180 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
184 /* Loop node. Someone else please tell me what's wrong ... */
185 if (get_irg_loopinfo_state(irg) & loopinfo_valid) {
186 ir_loop *loop = get_irn_loop(n);
188 fprintf(F, " in loop %d with depth %d\n",
189 get_loop_loop_nr(loop), get_loop_depth(loop));
194 switch (get_irn_opcode(n)) {
196 if (has_Block_entity(n))
197 fprintf(F, " Label: %lu\n", get_entity_label(get_Block_entity(n)));
198 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
199 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
200 fprintf(F, " block marked: %u\n", get_Block_mark(n));
201 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
202 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
203 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
204 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
207 fprintf(F, " Execution frequency statistics:\n");
208 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
209 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
210 #ifdef INTERPROCEDURAL_VIEW
211 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
212 fprintf(F, " call frequency of procedure: %8.2lf\n",
213 get_irg_method_execution_frequency(get_irn_irg(n)));
214 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
215 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
216 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
217 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
218 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
219 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
222 /* not dumped: graph_arr */
223 /* not dumped: mature */
226 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
227 fprintf(F, " start of method of type %s\n", get_type_name_ex(tp, &bad));
228 for (i = 0; i < get_method_n_params(tp); ++i)
229 fprintf(F, " param %d type: %s\n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
230 #ifdef INTERPROCEDURAL_VIEW
231 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
232 ir_node *sbl = get_nodes_block(n);
233 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
234 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
235 for (i = 0; i < n_cfgpreds; ++i) {
236 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
237 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
238 get_irg_dump_name(get_irn_irg(cfgpred)));
244 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
245 fprintf(F, " default ProjNr: %ld\n", get_Cond_default_proj(n));
246 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
247 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
250 fprintf(F, " allocating entity of type: %s\n", get_type_name_ex(get_Alloc_type(n), &bad));
251 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
254 fprintf(F, " freeing entity of type %s\n", get_type_name_ex(get_Free_type(n), &bad));
255 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
258 ir_entity *ent = get_Sel_entity(n);
260 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
261 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
262 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
265 fprintf(F, " <NULL entity>\n");
270 ir_type *tp = get_Call_type(n);
271 if (get_Call_tail_call(n))
272 fprintf(F, " tail call\n");
273 fprintf(F, " calling method of type %s\n", get_type_name_ex(tp, &bad));
274 if(get_unknown_type() != tp) {
275 for (i = 0; i < get_method_n_params(tp); ++i)
276 fprintf(F, " param %d type: %s\n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
277 for (i = 0; i < get_method_n_ress(tp); ++i)
278 fprintf(F, " resul %d type: %s\n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
280 if (Call_has_callees(n)) {
281 fprintf(F, " possible callees:\n");
282 for (i = 0; i < get_Call_n_callees(n); i++) {
283 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
287 case iro_CallBegin: {
288 ir_node *call = get_CallBegin_call(n);
289 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
290 if (Call_has_callees(call)) {
291 fprintf(F, " possible callees:\n");
292 for (i = 0; i < get_Call_n_callees(call); i++) {
293 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
298 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
301 if (!get_interprocedural_view()) {
302 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
303 fprintf(F, " return in method of type %s\n", get_type_name_ex(tp, &bad));
304 for (i = 0; i < get_method_n_ress(tp); ++i)
305 fprintf(F, " res %d type: %s\n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
309 assert(get_Const_type(n) != firm_none_type);
310 fprintf(F, " Const of type %s\n", get_type_name_ex(get_Const_type(n), &bad));
313 switch(get_SymConst_kind(n)) {
314 case symconst_addr_name:
315 fprintf(F, " kind: addr_name\n");
316 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
318 case symconst_addr_ent:
319 fprintf(F, " kind: addr_ent\n");
320 fprintf(F, " entity: ");
321 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
323 case symconst_ofs_ent:
324 fprintf(F, " kind: offset\n");
325 fprintf(F, " entity: ");
326 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
328 case symconst_type_tag:
329 fprintf(F, " kind: type_tag\n");
330 fprintf(F, " type: ");
331 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
333 case symconst_type_size:
334 fprintf(F, " kind: size\n");
335 fprintf(F, " type: ");
336 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
338 case symconst_type_align:
339 fprintf(F, " kind: alignment\n");
340 fprintf(F, " type: ");
341 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
343 case symconst_enum_const:
344 fprintf(F, " kind: enumeration\n");
345 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
348 fprintf(F, " type of value: %s\n", get_type_name_ex(get_SymConst_value_type(n), &bad));
351 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
352 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
353 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
356 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
357 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
360 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
363 const ir_asm_constraint *cons;
367 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
368 l = get_ASM_n_input_constraints(n);
370 fprintf(F, "\n inputs: ");
371 cons = get_ASM_input_constraints(n);
372 for (i = 0; i < l; ++i)
373 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
375 l = get_ASM_n_output_constraints(n);
377 fprintf(F, "\n outputs: ");
378 cons = get_ASM_output_constraints(n);
379 for (i = 0; i < l; ++i)
380 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
382 l = get_ASM_n_clobbers(n);
384 fprintf(F, "\n clobber: ");
385 clobber = get_ASM_clobbers(n);
386 for (i = 0; i < l; ++i)
387 fprintf(F, "%s ", get_id_str(clobber[i]));
389 if (get_irn_pinned(n) != op_pin_state_floats)
390 fprintf(F, "\n volatile");
396 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
397 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
398 if (get_irn_typeinfo_type(n) != firm_none_type)
399 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
406 void dump_irnode(ir_node *n) {
407 dump_irnode_to_file(stdout, n);
411 void dump_graph_to_file(FILE *F, ir_graph *irg) {
412 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
415 void dump_graph(ir_graph *g) {
416 dump_graph_to_file(stdout, g);
419 static void dump_node_to_graph_file(ir_node *n, void *env) {
420 FILE *F = (FILE *)env;
422 dump_irnode_to_file(F, n);
426 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
427 const char *basename = get_irg_dump_name(irg);
430 F = text_open(basename, suffix, "", ".txt");
432 dump_graph_to_file(F, irg);
434 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
439 #ifdef EXTENDED_ACCESS_STATS
440 static int addr_is_alloc(ir_node *acc) {
441 ir_node *addr = NULL;
444 addr = get_memop_ptr(acc);
446 assert(is_Call(acc));
447 addr = get_Call_ptr(acc);
450 addr_op = get_irn_opcode(addr);
452 while (addr_op != iro_Alloc) {
455 addr = get_Sel_ptr(addr);
458 addr = get_Cast_op(addr);
461 addr = get_Proj_pred(addr);
476 //assert(0 && "unexpected address node");
479 addr_op = get_irn_opcode(addr);
482 /* In addition, the alloc must be in the same loop. */
487 /** dumps something like:
489 * "prefix" "Name" (x): node1, ... node7,\n
490 * "prefix" node8, ... node15,\n
491 * "prefix" node16, node17\n
493 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
494 int (*get_entity_n_nodes)(firm_kind *ent),
495 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
497 int i, n_nodes = get_entity_n_nodes(k);
500 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
501 for (i = 0; i < n_nodes; ++i) {
503 if (i > 7 && !(i & 7)) { /* line break every eight node. */
504 fprintf(F, ",\n%s ", prefix);
507 fprintf(F, "%s ", comma);
508 rem = opt_dump_analysed_type_info;
509 opt_dump_analysed_type_info = 0;
510 dump_node_label(F, get_entity_node(k, i));
511 opt_dump_analysed_type_info = rem;
517 /** dumps something like:
519 * "prefix" "Name" (x): node1, ... node7,\n
520 * "prefix" node8, ... node15,\n
521 * "prefix" node16, node17\n
523 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
524 int (*get_n_types)(const ir_type *tp),
525 ir_type *(*get_type)(const ir_type *tp, int pos),
527 int i, n_nodes = get_n_types(tp);
530 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
531 for (i = 0; i < n_nodes; ++i) {
532 if (i > 7 && !(i & 7)) { /* line break every eight node. */
533 fprintf(F, ",\n%s ", prefix);
536 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
537 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
543 static int need_nl = 1;
548 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
549 const ir_initializer_t *initializer, ir_type *type) {
554 fprintf(F, "\n%s ", prefix);
557 switch (get_initializer_kind(initializer)) {
558 case IR_INITIALIZER_NULL:
559 fprintf(F, "\t = <NOT_SET>");
561 case IR_INITIALIZER_TARVAL:
562 tv = get_initializer_tarval_value(initializer);
563 ir_fprintf(F, "\t = <TV>%F", tv);
565 case IR_INITIALIZER_CONST:
566 value = get_initializer_const_value(initializer);
567 fprintf(F, "\t = <CONST>");
568 dump_node_opcode(F, value);
570 case IR_INITIALIZER_COMPOUND:
571 if (is_Array_type(type)) {
572 size_t i, n = get_initializer_compound_n_entries(initializer);
573 ir_type *element_type = get_array_element_type(type);
574 for (i = 0; i < n; ++i) {
575 ir_initializer_t *sub_initializer
576 = get_initializer_compound_value(initializer, i);
579 fprintf(F, "\n%s ", prefix);
582 fprintf(F, "[%d]", (int) i);
583 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
587 assert(is_compound_type(type));
588 n = get_compound_n_members(type);
589 for (i = 0; i < n; ++i) {
590 ir_entity *member = get_compound_member(type, i);
591 ir_type *subtype = get_entity_type(member);
592 ir_initializer_t *sub_initializer;
594 assert(i < get_initializer_compound_n_entries(initializer));
596 = get_initializer_compound_value(initializer, i);
599 fprintf(F, "\n%s ", prefix);
602 ir_fprintf(F, ".%F", member);
603 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
608 panic("invalid ir_initializer kind found");
614 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
616 ir_type *owner, *type;
618 assert(is_entity(ent));
619 owner = get_entity_owner(ent);
620 type = get_entity_type(ent);
621 if (verbosity & dump_verbosity_onlynames) {
622 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
623 get_entity_name(ent), get_entity_nr(ent));
627 if (verbosity & dump_verbosity_entattrs) {
628 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
629 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
630 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
632 if (is_Class_type(get_entity_owner(ent))) {
633 if (get_entity_n_overwrites(ent) > 0) {
634 fprintf(F, "%s overwrites:\n", prefix);
635 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
636 ir_entity *ov = get_entity_overwrites(ent, i);
637 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
638 get_type_name(get_entity_owner(ov)));
641 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
643 if (get_entity_n_overwrittenby(ent) > 0) {
644 fprintf(F, "%s overwritten by:\n", prefix);
645 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
646 ir_entity *ov = get_entity_overwrittenby(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 Is not overwritten by other entities.\n", prefix);
654 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
656 fprintf(F, "%s transitive overwrites:\n", prefix);
657 for (ov = get_entity_trans_overwrites_first(ent);
659 ov = get_entity_trans_overwrites_next(ent)) {
660 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
661 get_type_name(get_entity_owner(ov)));
663 fprintf(F, "%s transitive overwritten by:\n", prefix);
664 for (ov = get_entity_trans_overwrittenby_first(ent);
666 ov = get_entity_trans_overwrittenby_next(ent)) {
667 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
668 get_type_name(get_entity_owner(ov)));
673 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
674 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
675 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
677 if (is_Method_type(get_entity_type(ent))) {
678 unsigned mask = get_entity_additional_properties(ent);
679 unsigned cc = get_method_calling_convention(get_entity_type(ent));
680 ir_graph *irg = get_entity_irg(ent);
683 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
684 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
688 fprintf(F, "\n%s additional prop: ", prefix);
690 if (mask & mtp_property_const) fputs("const_function, ", F);
691 if (mask & mtp_property_pure) fputs("pure_function, ", F);
692 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
693 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
694 if (mask & mtp_property_naked) fputs("naked_function, ", F);
695 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
696 if (mask & mtp_property_weak) fputs("weak_function, ", F);
697 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
698 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
699 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
700 if (mask & mtp_property_private) fputs("private_function, ", F);
701 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
703 fprintf(F, "\n%s calling convention: ", prefix);
704 if (cc & cc_reg_param) fputs("regparam, ", F);
705 if (cc & cc_this_call) fputs("thiscall, ", F);
706 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
707 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
708 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
711 else if (IS_STDCALL(cc))
714 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
715 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
717 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
721 } else { /* no entattrs */
722 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
723 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
724 get_type_name(get_entity_type(ent)), get_entity_name(ent));
725 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
727 if (verbosity & dump_verbosity_accessStats) {
728 if (get_entity_allocation(ent) == allocation_static) fputs(" (stat)", F);
729 if (get_entity_peculiarity(ent) == peculiarity_description) fputs(" (desc)", F);
730 if (get_entity_peculiarity(ent) == peculiarity_inherited) fputs(" (inh)", F);
735 if (verbosity & dump_verbosity_entconsts) {
736 if (get_entity_variability(ent) != variability_uninitialized) {
737 if (ent->has_initializer) {
738 const ir_initializer_t *initializer = get_entity_initializer(ent);
739 fprintf(F, "\n%s Initializers:", prefix);
741 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
743 /* old compound_graph_path based initializers */
744 if (is_atomic_entity(ent)) {
745 fprintf(F, "%s atomic value: ", prefix);
746 dump_node_opcode(F, get_atomic_ent_value(ent));
748 fprintf(F, "%s compound values:", prefix);
749 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
750 compound_graph_path *path = get_compound_ent_value_path(ent, i);
751 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
752 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
753 if (get_type_state(type) == layout_fixed)
754 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
755 fprintf(F, "%s", get_entity_name(ent));
756 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
757 ir_entity *node = get_compound_graph_path_node(path, j);
758 fprintf(F, ".%s", get_entity_name(node));
759 if (is_Array_type(get_entity_owner(node)))
760 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
763 dump_node_opcode(F, get_compound_ent_value(ent, i));
771 if (verbosity & dump_verbosity_entattrs) {
772 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
773 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
774 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
775 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
776 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
777 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
778 if (is_Method_type(get_entity_type(ent))) {
779 if (get_entity_irg(ent)) /* can be null */ {
780 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
781 #ifdef INTERPROCEDURAL_VIEW
782 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
783 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
784 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
788 fprintf(F, "\n%s irg = NULL", prefix);
794 if (get_trouts_state()) {
795 fprintf(F, "%s Entity outs:\n", prefix);
796 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
797 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
798 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
799 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
802 if (verbosity & dump_verbosity_accessStats) {
803 #ifdef EXTENDED_ACCESS_STATS
804 int n_acc = get_entity_n_accesses(ent);
808 int max_LA_freq = -1;
809 int max_SA_freq = -1;
815 /* Find maximal depth */
816 for (i = 0; i < n_acc; ++i) {
817 ir_node *acc = get_entity_access(ent, i);
818 int depth = get_weighted_loop_depth(acc);
819 max_depth = (depth > max_depth) ? depth : max_depth ;
822 L_freq = XMALLOCNZ(int, 4 * max_depth);
824 S_freq = L_freq + 1*max_depth;
825 LA_freq = L_freq + 2*max_depth;
826 SA_freq = L_freq + 3*max_depth;
828 for (i = 0; i < n_acc; ++i) {
829 ir_node *acc = get_entity_access(ent, i);
830 int depth = get_weighted_loop_depth(acc);
831 assert(depth < max_depth);
832 if (is_Load(acc) || is_Call(acc)) {
834 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
835 if (addr_is_alloc(acc)) {
837 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
839 } else if (is_Store(acc)) {
841 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
842 if (addr_is_alloc(acc)) {
844 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
851 if (max_L_freq >= 0) {
854 fprintf(F, "%s Load Stats", prefix);
855 for (i = 0; i <= max_L_freq; ++i) {
857 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
864 if (max_LA_freq >= 0) {
865 //fprintf(F, "%s LoadA Stats", prefix);
867 for (i = 0; i <= max_LA_freq; ++i) {
869 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
876 if (max_S_freq >= 0) {
879 fprintf(F, "%s Store Stats", prefix);
880 for (i = 0; i <= max_S_freq; ++i) {
882 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
889 if (max_SA_freq >= 0) {
890 //fprintf(F, "%s StoreAStats", prefix);
892 for (i = 0; i <= max_SA_freq; ++i) {
894 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
902 /* free allocated space */
905 if (get_trouts_state() != outs_none) {
906 #ifdef INTERPROCEDURAL_VIEW
907 if (is_Method_type(get_entity_type(ent))) {
908 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
909 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
911 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
912 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
919 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
920 dump_entity_to_file_prefix (F, ent, "", verbosity);
924 void dump_entity(ir_entity *ent) {
925 dump_entity_to_file(stdout, ent, dump_verbosity_max);
928 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
929 unsigned verbosity, int *max_disp,
930 int disp[], const char *comma)
936 #if 0 /* Outputs loop depth of all occurrences. */
937 int n_acc = get_entity_n_accesses(ent);
940 int max_LA_freq = -1;
941 int max_SA_freq = -1;
946 int i, max_depth = 0;
948 /* Find maximal depth */
949 for (i = 0; i < n_acc; ++i) {
950 ir_node *acc = get_entity_access(ent, i);
951 int depth = get_weighted_loop_depth(acc);
952 max_depth = (depth > max_depth) ? depth : max_depth ;
955 L_freq = XMALLOCNZ(int, 4 * (max_depth + 1));
957 S_freq = L_freq + 1*max_depth;
958 LA_freq = L_freq + 2*max_depth;
959 SA_freq = L_freq + 3*max_depth;
961 for (i = 0; i < n_acc; ++i) {
962 ir_node *acc = get_entity_access(ent, i);
963 int depth = get_weighted_loop_depth(acc);
964 assert(depth <= max_depth);
965 if (is_Load(acc) || is_Call(acc)) {
967 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
968 if (addr_is_alloc(acc)) {
970 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
972 if (get_entity_allocation(ent) == allocation_static) {
974 *max_disp = (depth > *max_disp) ? depth : *max_disp;
976 } else if (is_Store(acc)) {
978 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
979 if (addr_is_alloc(acc)) {
981 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
983 if (get_entity_allocation(ent) == allocation_static) {
991 if (get_entity_allocation(ent) != allocation_static) {
993 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
995 if (max_L_freq >= 0) {
996 fprintf(F, "%s Load", comma);
997 for (i = 0; i <= max_L_freq; ++i) {
998 fprintf(F, "%s %d", comma, L_freq[i]);
1001 if (max_S_freq >= 0) {
1002 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
1003 fprintf(F, "%s Store", comma);
1004 for (i = 0; i <= max_S_freq; ++i) {
1005 fprintf(F, "%s %d", comma, S_freq[i]);
1013 if (get_entity_allocation(ent) != allocation_static) {
1014 if (is_Method_type(get_entity_type(ent))) return;
1016 /* Output the entity name. */
1017 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
1019 #ifdef INTERPROCEDURAL_VIEW
1020 if (get_trouts_state() != outs_none) {
1021 if (is_Method_type(get_entity_type(ent))) {
1022 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1023 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1025 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
1026 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
1035 #ifdef INTERPROCEDURAL_VIEW
1036 /* A fast hack to dump a CSV-file. */
1037 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
1039 char buf[1024 + 10];
1042 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
1044 if (verbosity & dump_verbosity_accessStats) {
1047 /* Outputs loop depth of all occurrences. */
1050 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
1051 int n_all = get_type_n_allocs(tp);
1053 /* Find maximal depth */
1054 for (i = 0; i < n_all; ++i) {
1055 ir_node *all = get_type_alloc(tp, i);
1056 int depth = get_weighted_loop_depth(all);
1057 max_depth = (depth > max_depth) ? depth : max_depth ;
1060 freq = XMALLOCNZ(int, 2 * (max_depth + 1));
1062 disp = freq + max_depth;
1064 for (i = 0; i < n_all; ++i) {
1065 ir_node *all = get_type_alloc(tp, i);
1066 int depth = get_weighted_loop_depth(all);
1067 assert(depth <= max_depth);
1069 max_freq = (depth > max_freq) ? depth : max_freq;
1070 assert(is_Alloc(all));
1073 fprintf(F, "%s ", get_type_name(tp));
1074 fprintf(F, "%s Alloc ", comma);
1076 if (max_freq >= 0) {
1077 for (i = 0; i <= max_freq; ++i) {
1078 fprintf(F, "%s %d", comma, freq[i]);
1083 for (i = 0; i < get_class_n_members(tp); ++i) {
1084 ir_entity *mem = get_class_member(tp, i);
1085 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1086 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1087 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1088 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1093 if (max_disp >= 0) {
1094 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1095 for (i = 0; i <= max_disp; ++i) {
1096 fprintf(F, "%s %d", comma, disp[i]);
1101 /* free allocated space */
1105 #define DISP_TAB_SUFFIX "__disp_tab"
1106 if (get_trouts_state() != outs_none) {
1107 assert(strlen(get_type_name(tp)) < 1024);
1108 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1109 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1110 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1113 for (i = 0; i < get_class_n_members(tp); ++i) {
1114 ir_entity *mem = get_class_member(tp, i);
1115 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1116 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1117 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1118 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1126 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1129 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1130 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1131 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1132 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1133 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1134 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1135 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1136 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1138 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1139 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1141 switch (get_type_tpop_code(tp)) {
1144 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1145 fprintf(F, "\n members:\n");
1147 for (i = 0; i < get_class_n_members(tp); ++i) {
1148 ir_entity *mem = get_class_member(tp, i);
1149 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1150 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1151 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1152 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1156 if (verbosity & dump_verbosity_typeattrs) {
1157 fprintf(F, " supertypes: ");
1158 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1159 ir_type *stp = get_class_supertype(tp, i);
1160 fprintf(F, "\n %d %s", i, get_type_name(stp));
1162 fprintf(F, "\n subtypes: ");
1163 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1164 ir_type *stp = get_class_subtype(tp, i);
1165 fprintf(F, "\n %d %s", i, get_type_name(stp));
1168 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1170 fprintf(F, "\n transitive supertypes: ");
1171 for (stp = get_class_trans_supertype_first(tp);
1173 stp = get_class_trans_supertype_next(tp)) {
1174 fprintf(F, "\n %s", get_type_name(stp));
1176 fprintf(F, "\n transitive subtypes: ");
1177 for (stp = get_class_trans_subtype_first(tp);
1179 stp = get_class_trans_subtype_next(tp)) {
1180 fprintf(F, "\n %s", get_type_name(stp));
1184 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1185 fprintf(F, "\n flags: ");
1186 if (is_class_final(tp))
1187 fprintf(F, "final, ");
1188 if (is_class_interface(tp))
1189 fprintf(F, "interface, ");
1190 if (is_class_abstract(tp))
1191 fprintf(F, "abstract, ");
1198 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1199 for (i = 0; i < get_compound_n_members(tp); ++i) {
1200 ir_entity *mem = get_compound_member(tp, i);
1201 if (verbosity & dump_verbosity_fields) {
1202 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1208 if (verbosity & dump_verbosity_typeattrs) {
1210 ir_type *elem_tp = get_array_element_type(tp);
1212 fprintf(F, "\n array ");
1214 n_dim = get_array_n_dimensions(tp);
1215 for (i = 0; i < n_dim; ++i) {
1216 ir_node *lower, *upper;
1218 lower = get_array_lower_bound(tp, i);
1219 upper = get_array_upper_bound(tp, i);
1223 if (is_Const(lower)) {
1224 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1226 dump_node_opcode(F, lower);
1227 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1230 if (is_Const(upper)) {
1231 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1233 dump_node_opcode(F, upper);
1234 fprintf(F, " %ld]", get_irn_node_nr(upper));
1237 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1239 fprintf(F, "\n order: ");
1240 for (i = 0; i < n_dim; ++i)
1241 fprintf(F, "<%d>", get_array_order(tp, i));
1245 if (verbosity & dump_verbosity_fields) {
1246 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1253 if (verbosity & dump_verbosity_typeattrs) {
1254 ir_type *tt = get_pointer_points_to_type(tp);
1255 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1260 if (verbosity & dump_verbosity_typeattrs) {
1261 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1262 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1263 for (i = 0; i < get_method_n_ress(tp); ++i) {
1264 ir_type *rtp = get_method_res_type(tp, i);
1265 fprintf(F, "\n %s", get_type_name(rtp));
1268 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1269 for (i = 0; i < get_method_n_params(tp); ++i) {
1270 ir_type *ptp = get_method_param_type(tp, i);
1271 fprintf(F, "\n %s", get_type_name(ptp));
1273 if (get_method_variadicity(tp)) {
1274 fprintf(F, "\n ...");
1281 if (verbosity & dump_verbosity_typeattrs) {
1282 ir_type *base_tp = get_primitive_base_type(tp);
1283 if (base_tp != NULL)
1284 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1296 if (verbosity & dump_verbosity_typeattrs) {
1297 fprintf(F, ": details not implemented\n");
1301 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1302 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1303 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1304 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1305 if (is_atomic_type(tp) || is_Method_type(tp))
1306 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1308 if (get_trouts_state()) {
1309 fprintf(F, "\n Type outs:\n");
1310 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1311 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1312 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1313 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1314 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1318 if (verbosity & dump_verbosity_accessStats) {
1320 int n_all = get_type_n_allocs(tp);
1325 /* Find maximal depth */
1326 for (i = 0; i < n_all; ++i) {
1327 ir_node *all = get_type_alloc(tp, i);
1328 int depth = get_weighted_loop_depth(all);
1329 max_depth = (depth > max_depth) ? depth : max_depth ;
1332 freq = XMALLOCNZ(int, max_depth + 1);
1334 for (i = 0; i < n_all; ++i) {
1335 ir_node *all = get_type_alloc(tp, i);
1336 int depth = get_weighted_loop_depth(all);
1337 assert(depth <= max_depth);
1339 max_freq = (depth > max_freq) ? depth : max_freq;
1340 assert(is_Alloc(all));
1343 if (max_freq >= 0) {
1346 fprintf(F, " Alloc Stats");
1347 for (i = 0; i <= max_freq; ++i) {
1348 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1356 #ifdef INTERPROCEDURAL_VIEW
1357 if (get_trouts_state() != outs_none) {
1358 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1359 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1360 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1361 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1362 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1363 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1373 void dump_type(ir_type *tp) {
1374 dump_type_to_file (stdout, tp, dump_verbosity_max);
1378 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1379 const char *basename;
1380 FILE *F, *CSV = NULL;
1381 int i, n_types = get_irp_n_types();
1383 basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1384 F = text_open(basename, suffix, "-types", ".txt");
1386 if (verbosity & dump_verbosity_csv) {
1387 CSV = text_open(basename, suffix, "-types", ".csv");
1388 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1391 for (i = 0; i < n_types; ++i) {
1392 ir_type *t = get_irp_type(i);
1394 //if (is_jack_rts_class(t)) continue;
1396 dump_type_to_file(F, t, verbosity);
1397 #ifdef INTERPROCEDURAL_VIEW
1399 dump_typecsv_to_file(CSV, t, verbosity, "");
1405 if (CSV) fclose(CSV);
1409 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1410 const char *basename;
1411 FILE *F, *CSV = NULL;
1412 ir_type *g = get_glob_type();
1413 int i, n_mems = get_class_n_members(g);
1415 basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1416 F = text_open (basename, suffix, "-globals", ".txt");
1418 if (verbosity & dump_verbosity_csv) {
1419 CSV = text_open (basename, suffix, "-types", ".csv");
1420 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1423 for (i = 0; i < n_mems; ++i) {
1424 ir_entity *e = get_class_member(g, i);
1426 dump_entity_to_file(F, e, verbosity);
1428 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1433 if (CSV) fclose (CSV);