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
38 #include "irgraph_t.h"
40 #include "firm_common_t.h"
51 #include "field_temperature.h"
53 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
56 * Just opens a file, mangling a file name.
58 * The file name results from the concatenation of the following parts:
60 * @param basename The basis of the name telling about the content.
61 * @param suffix1 The first suffix.
62 * @param suffix2 The second suffix.
63 * @param suffix3 The third suffix.
65 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
67 int len = strlen(basename), i, j;
68 char *fname; /* filename to put the vcg information in */
70 if (!basename) assert(basename);
71 if (!suffix1) suffix1 = "";
72 if (!suffix2) suffix2 = "";
73 if (!suffix3) suffix3 = ".txt";
75 /* open file for vcg graph */
76 fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
79 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
80 if (basename[i] == '/') {
81 fname[j] = '@'; j++; fname[j] = '1'; j++;
82 } else if (basename[i] == '@') {
83 fname[j] = '@'; j++; fname[j] = '2'; j++;
85 fname[j] = basename[i]; j++;
89 strcat(fname, suffix1); /* append file suffix */
90 strcat(fname, suffix2); /* append file suffix */
91 strcat(fname, suffix3); /* append the .txt suffix */
93 F = fopen(fname, "w"); /* open file for writing */
103 /* Write the irnode and all its attributes to the file passed. */
104 int dump_irnode_to_file(FILE *F, ir_node *n) {
109 dump_node_opcode(F, n);
110 fprintf(F, " %ld\n", get_irn_node_nr(n));
112 fprintf(F, " index: %u\n", get_irn_idx(n));
113 if (opt_dump_pointer_values_to_info)
114 fprintf (F, " addr: %p \n", (void *)n);
115 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
116 fprintf (F, " visited: %ld \n", get_irn_visited(n));
117 irg = get_irn_irg(n);
118 if (irg != get_const_code_irg())
119 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
121 if (get_irn_pinned(n) == op_pin_state_floats &&
122 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
123 fprintf(F, " node was pinned in ");
124 dump_node_opcode(F, get_irn_n(n, -1));
125 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
128 #ifdef INTERPROCEDURAL_VIEW
129 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
130 /* show all predecessor nodes */
131 fprintf(F, " pred nodes: \n");
134 dump_node_opcode(F, get_irn_n(n, -1));
135 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
137 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
138 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
139 dump_node_opcode(F, get_irn_intra_n(n, i));
140 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
143 fprintf(F, " arity: %d\n", get_irn_arity(n));
144 /* show all predecessor nodes */
145 fprintf(F, " pred nodes: \n");
148 dump_node_opcode(F, get_irn_n(n, -1));
149 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
151 for ( i = 0; i < get_irn_arity(n); ++i) {
152 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
153 dump_node_opcode(F, get_irn_n(n, i));
154 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
158 fprintf(F, " Private Attributes:\n");
161 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
163 #ifdef INTERPROCEDURAL_VIEW
164 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
165 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
166 fprintf(F, " inter pred nodes: \n");
167 for (i = 0; i < get_irn_inter_arity(n); ++i) {
168 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
169 dump_node_opcode(F, get_irn_inter_n(n, i));
170 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
175 if (is_fragile_op(n)) {
176 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
177 /* not dumped: frag array */
180 /* This is not nice, output it as a marker in the predecessor list. */
182 get_irn_op(n) == op_Phi ||
183 (is_Filter(n) && get_interprocedural_view())) {
184 fprintf(F, " backedges:");
186 for (i = 0; i < get_irn_arity(n); i++)
187 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
191 /* Loop node. Someone else please tell me what's wrong ... */
192 if (get_irn_loop(n)) {
193 ir_loop *loop = get_irn_loop(n);
195 fprintf(F, " in loop %d with depth %d\n",
196 get_loop_loop_nr(loop), get_loop_depth(loop));
200 switch (get_irn_opcode(n)) {
202 if (has_Block_label(n))
203 fprintf(F, " Label: %lu\n", get_Block_label(n));
204 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
205 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
206 fprintf(F, " block marked: %u\n", get_Block_mark(n));
207 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
208 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
209 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
210 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
213 fprintf(F, " Execution frequency statistics:\n");
214 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
215 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
216 #ifdef INTERPROCEDURAL_VIEW
217 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
218 fprintf(F, " call frequency of procedure: %8.2lf\n",
219 get_irg_method_execution_frequency(get_irn_irg(n)));
220 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
221 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
222 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
223 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
224 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
225 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
228 /* not dumped: graph_arr */
229 /* not dumped: mature */
232 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
233 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
234 for (i = 0; i < get_method_n_params(tp); ++i)
235 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
236 #ifdef INTERPROCEDURAL_VIEW
237 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
238 ir_node *sbl = get_nodes_block(n);
239 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
240 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
241 for (i = 0; i < n_cfgpreds; ++i) {
242 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
243 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
244 get_irg_dump_name(get_irn_irg(cfgpred)));
250 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
251 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
252 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
253 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
256 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
257 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
260 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
261 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
264 ir_entity *ent = get_Sel_entity(n);
266 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
267 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
268 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
271 fprintf(F, " <NULL entity>\n");
276 ir_type *tp = get_Call_type(n);
277 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
278 if(get_unknown_type() != tp) {
279 for (i = 0; i < get_method_n_params(tp); ++i)
280 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
281 for (i = 0; i < get_method_n_ress(tp); ++i)
282 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
284 if (Call_has_callees(n)) {
285 fprintf(F, " possible callees: \n");
286 for (i = 0; i < get_Call_n_callees(n); i++) {
287 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
291 case iro_CallBegin: {
292 ir_node *call = get_CallBegin_call(n);
293 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
294 if (Call_has_callees(call)) {
295 fprintf(F, " possible callees: \n");
296 for (i = 0; i < get_Call_n_callees(call); i++) {
297 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
302 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
305 if (!get_interprocedural_view()) {
306 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
307 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
308 for (i = 0; i < get_method_n_ress(tp); ++i)
309 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
313 assert(get_Const_type(n) != firm_none_type);
314 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
317 switch(get_SymConst_kind(n)) {
318 case symconst_addr_name:
319 fprintf(F, " kind: addr_name\n");
320 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
322 case symconst_addr_ent:
323 fprintf(F, " kind: addr_ent\n");
324 fprintf(F, " entity: ");
325 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
327 case symconst_ofs_ent:
328 fprintf(F, " kind: offset\n");
329 fprintf(F, " entity: ");
330 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
332 case symconst_type_tag:
333 fprintf(F, " kind: type_tag\n");
334 fprintf(F, " type: ");
335 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
337 case symconst_type_size:
338 fprintf(F, " kind: size\n");
339 fprintf(F, " type: ");
340 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
342 case symconst_type_align:
343 fprintf(F, " kind: alignment\n");
344 fprintf(F, " type: ");
345 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
347 case symconst_enum_const:
348 fprintf(F, " kind: enumeration\n");
349 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
352 fprintf(F, " kind: label\n");
353 fprintf(F, " label: %lu\n", get_SymConst_label(n));
356 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
359 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
360 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
361 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
364 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
365 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
368 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
371 const ir_asm_constraint *cons;
375 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
376 l = get_ASM_n_input_constraints(n);
378 fprintf(F, "\n inputs: ");
379 cons = get_ASM_input_constraints(n);
380 for (i = 0; i < l; ++i)
381 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
383 l = get_ASM_n_output_constraints(n);
385 fprintf(F, "\n outputs: ");
386 cons = get_ASM_output_constraints(n);
387 for (i = 0; i < l; ++i)
388 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
390 l = get_ASM_n_clobbers(n);
392 fprintf(F, "\n clobber: ");
393 clobber = get_ASM_clobbers(n);
394 for (i = 0; i < l; ++i)
395 fprintf(F, "%s ", get_id_str(clobber[i]));
397 if (get_irn_pinned(n) != op_pin_state_floats)
398 fprintf(F, "\n volatile");
404 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
405 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
406 if (get_irn_typeinfo_type(n) != firm_none_type)
407 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
414 void dump_irnode(ir_node *n) {
415 dump_irnode_to_file(stdout, n);
419 void dump_graph_to_file(FILE *F, ir_graph *irg) {
420 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
423 void dump_graph(ir_graph *g) {
424 dump_graph_to_file(stdout, g);
427 static void dump_node_to_graph_file(ir_node *n, void *env) {
428 FILE *F = (FILE *)env;
430 dump_irnode_to_file(F, n);
434 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
435 const char *basename = get_irg_dump_name(irg);
438 F = text_open(basename, suffix, "", ".txt");
440 dump_graph_to_file(F, irg);
442 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
447 #ifdef EXTENDED_ACCESS_STATS
448 static int addr_is_alloc(ir_node *acc) {
449 ir_node *addr = NULL;
452 addr = get_memop_ptr(acc);
454 assert(is_Call(acc));
455 addr = get_Call_ptr(acc);
458 addr_op = get_irn_opcode(addr);
460 while (addr_op != iro_Alloc) {
463 addr = get_Sel_ptr(addr);
466 addr = get_Cast_op(addr);
469 addr = get_Proj_pred(addr);
484 //assert(0 && "unexpected address node");
487 addr_op = get_irn_opcode(addr);
490 /* In addition, the alloc must be in the same loop. */
495 /** dumps something like:
497 * "prefix" "Name" (x): node1, ... node7,\n
498 * "prefix" node8, ... node15,\n
499 * "prefix" node16, node17\n
501 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
502 int (*get_entity_n_nodes)(firm_kind *ent),
503 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
505 int i, n_nodes = get_entity_n_nodes(k);
508 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
509 for (i = 0; i < n_nodes; ++i) {
511 if (i > 7 && !(i & 7)) { /* line break every eight node. */
512 fprintf(F, ",\n%s ", prefix);
515 fprintf(F, "%s ", comma);
516 rem = opt_dump_analysed_type_info;
517 opt_dump_analysed_type_info = 0;
518 dump_node_label(F, get_entity_node(k, i));
519 opt_dump_analysed_type_info = rem;
525 /** dumps something like:
527 * "prefix" "Name" (x): node1, ... node7,\n
528 * "prefix" node8, ... node15,\n
529 * "prefix" node16, node17\n
531 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
532 int (*get_n_types)(const ir_type *tp),
533 ir_type *(*get_type)(const ir_type *tp, int pos),
535 int i, n_nodes = get_n_types(tp);
538 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
539 for (i = 0; i < n_nodes; ++i) {
540 if (i > 7 && !(i & 7)) { /* line break every eight node. */
541 fprintf(F, ",\n%s ", prefix);
544 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
545 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
551 static int need_nl = 1;
556 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
557 const ir_initializer_t *initializer, ir_type *type) {
562 fprintf(F, "\n%s ", prefix);
565 switch (get_initializer_kind(initializer)) {
566 case IR_INITIALIZER_NULL:
567 fprintf(F, "\t = <NOT_SET>");
569 case IR_INITIALIZER_TARVAL:
570 tv = get_initializer_tarval_value(initializer);
571 ir_fprintf(F, "\t = <TV>%F", tv);
573 case IR_INITIALIZER_CONST:
574 value = get_initializer_const_value(initializer);
575 fprintf(F, "\t = <CONST>");
576 dump_node_opcode(F, value);
578 case IR_INITIALIZER_COMPOUND:
579 if (is_Array_type(type)) {
580 size_t i, n = get_initializer_compound_n_entries(initializer);
581 ir_type *element_type = get_array_element_type(type);
582 for (i = 0; i < n; ++i) {
583 ir_initializer_t *sub_initializer
584 = get_initializer_compound_value(initializer, i);
587 fprintf(F, "\n%s ", prefix);
590 fprintf(F, "[%d]", (int) i);
591 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
595 assert(is_compound_type(type));
596 n = get_compound_n_members(type);
597 for (i = 0; i < n; ++i) {
598 ir_entity *member = get_compound_member(type, i);
599 ir_type *subtype = get_entity_type(member);
600 ir_initializer_t *sub_initializer;
602 assert(i < get_initializer_compound_n_entries(initializer));
604 = get_initializer_compound_value(initializer, i);
607 fprintf(F, "\n%s ", prefix);
610 ir_fprintf(F, ".%F", member);
611 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
616 panic("invalid ir_initializer kind found");
622 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
624 ir_type *owner, *type;
626 assert(is_entity(ent));
627 owner = get_entity_owner(ent);
628 type = get_entity_type(ent);
629 if (verbosity & dump_verbosity_onlynames) {
630 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
631 get_entity_name(ent), get_entity_nr(ent));
635 if (verbosity & dump_verbosity_entattrs) {
636 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
637 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
638 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
640 if (is_Class_type(get_entity_owner(ent))) {
641 if (get_entity_n_overwrites(ent) > 0) {
642 fprintf(F, "%s overwrites:\n", prefix);
643 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
644 ir_entity *ov = get_entity_overwrites(ent, i);
645 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
646 get_type_name(get_entity_owner(ov)));
649 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
651 if (get_entity_n_overwrittenby(ent) > 0) {
652 fprintf(F, "%s overwritten by:\n", prefix);
653 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
654 ir_entity *ov = get_entity_overwrittenby(ent, i);
655 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
656 get_type_name(get_entity_owner(ov)));
659 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
662 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
664 fprintf(F, "%s transitive overwrites:\n", prefix);
665 for (ov = get_entity_trans_overwrites_first(ent);
667 ov = get_entity_trans_overwrites_next(ent)) {
668 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
669 get_type_name(get_entity_owner(ov)));
671 fprintf(F, "%s transitive overwritten by:\n", prefix);
672 for (ov = get_entity_trans_overwrittenby_first(ent);
674 ov = get_entity_trans_overwrittenby_next(ent)) {
675 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
676 get_type_name(get_entity_owner(ov)));
681 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
682 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
683 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
685 if (is_Method_type(get_entity_type(ent))) {
686 unsigned mask = get_entity_additional_properties(ent);
687 unsigned cc = get_method_calling_convention(get_entity_type(ent));
688 ir_graph *irg = get_entity_irg(ent);
691 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
692 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
696 fprintf(F, "\n%s additional prop: ", prefix);
698 if (mask & mtp_property_const) fprintf(F, "const_function, ");
699 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
700 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
701 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
702 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
703 if (mask & mtp_property_weak) fprintf(F, "weak_function, ");
705 fprintf(F, "\n%s calling convention: ", prefix);
706 if (cc & cc_reg_param) fprintf(F, "regparam, ");
707 if (cc & cc_this_call) fprintf(F, "thiscall, ");
708 if (cc & cc_compound_ret) fprintf(F, "compound_ret, ");
709 if (cc & cc_frame_on_caller_stk) fprintf(F, "frame on caller's stack, ");
710 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
713 else if (IS_STDCALL(cc))
714 fprintf(F, "stdcall");
716 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
717 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
719 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
723 } else { /* no entattrs */
724 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
725 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
726 get_type_name(get_entity_type(ent)), get_entity_name(ent));
727 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
729 if (verbosity & dump_verbosity_accessStats) {
730 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
731 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
732 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
737 if (verbosity & dump_verbosity_entconsts) {
738 if (get_entity_variability(ent) != variability_uninitialized) {
739 if (ent->has_initializer) {
740 const ir_initializer_t *initializer = get_entity_initializer(ent);
741 fprintf(F, "\n%s Initializers:", prefix);
743 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
745 /* old compound_graph_path based initializers */
746 if (is_atomic_entity(ent)) {
747 fprintf(F, "%s atomic value: ", prefix);
748 dump_node_opcode(F, get_atomic_ent_value(ent));
750 fprintf(F, "%s compound values:", prefix);
751 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
752 compound_graph_path *path = get_compound_ent_value_path(ent, i);
753 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
754 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
755 if (get_type_state(type) == layout_fixed)
756 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
757 fprintf(F, "%s", get_entity_name(ent));
758 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
759 ir_entity *node = get_compound_graph_path_node(path, j);
760 fprintf(F, ".%s", get_entity_name(node));
761 if (is_Array_type(get_entity_owner(node)))
762 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
765 dump_node_opcode(F, get_compound_ent_value(ent, i));
773 if (verbosity & dump_verbosity_entattrs) {
774 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
775 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
776 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
777 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
778 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
779 if (is_Method_type(get_entity_type(ent))) {
780 if (get_entity_irg(ent)) /* can be null */ {
781 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
782 #ifdef INTERPROCEDURAL_VIEW
783 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
784 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
785 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
789 fprintf(F, "\n%s irg = NULL", prefix);
795 if (get_trouts_state()) {
796 fprintf(F, "%s Entity outs:\n", prefix);
797 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
798 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
799 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
800 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
803 if (verbosity & dump_verbosity_accessStats) {
804 #ifdef EXTENDED_ACCESS_STATS
805 int n_acc = get_entity_n_accesses(ent);
809 int max_LA_freq = -1;
810 int max_SA_freq = -1;
816 /* Find maximal depth */
817 for (i = 0; i < n_acc; ++i) {
818 ir_node *acc = get_entity_access(ent, i);
819 int depth = get_weighted_loop_depth(acc);
820 max_depth = (depth > max_depth) ? depth : max_depth ;
823 L_freq = XMALLOCNZ(int, 4 * max_depth);
825 S_freq = L_freq + 1*max_depth;
826 LA_freq = L_freq + 2*max_depth;
827 SA_freq = L_freq + 3*max_depth;
829 for (i = 0; i < n_acc; ++i) {
830 ir_node *acc = get_entity_access(ent, i);
831 int depth = get_weighted_loop_depth(acc);
832 assert(depth < max_depth);
833 if (is_Load(acc) || is_Call(acc)) {
835 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
836 if (addr_is_alloc(acc)) {
838 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
840 } else if (is_Store(acc)) {
842 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
843 if (addr_is_alloc(acc)) {
845 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
852 if (max_L_freq >= 0) {
855 fprintf(F, "%s Load Stats", prefix);
856 for (i = 0; i <= max_L_freq; ++i) {
858 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
865 if (max_LA_freq >= 0) {
866 //fprintf(F, "%s LoadA Stats", prefix);
868 for (i = 0; i <= max_LA_freq; ++i) {
870 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
877 if (max_S_freq >= 0) {
880 fprintf(F, "%s Store Stats", prefix);
881 for (i = 0; i <= max_S_freq; ++i) {
883 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
890 if (max_SA_freq >= 0) {
891 //fprintf(F, "%s StoreAStats", prefix);
893 for (i = 0; i <= max_SA_freq; ++i) {
895 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
903 /* free allocated space */
906 if (get_trouts_state() != outs_none) {
907 #ifdef INTERPROCEDURAL_VIEW
908 if (is_Method_type(get_entity_type(ent))) {
909 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
910 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
912 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
913 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
920 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
921 dump_entity_to_file_prefix (F, ent, "", verbosity);
925 void dump_entity(ir_entity *ent) {
926 dump_entity_to_file(stdout, ent, dump_verbosity_max);
929 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
930 unsigned verbosity, int *max_disp,
931 int disp[], const char *comma)
937 #if 0 /* Outputs loop depth of all occurrences. */
938 int n_acc = get_entity_n_accesses(ent);
941 int max_LA_freq = -1;
942 int max_SA_freq = -1;
947 int i, max_depth = 0;
949 /* Find maximal depth */
950 for (i = 0; i < n_acc; ++i) {
951 ir_node *acc = get_entity_access(ent, i);
952 int depth = get_weighted_loop_depth(acc);
953 max_depth = (depth > max_depth) ? depth : max_depth ;
956 L_freq = XMALLOCNZ(int, 4 * (max_depth + 1));
958 S_freq = L_freq + 1*max_depth;
959 LA_freq = L_freq + 2*max_depth;
960 SA_freq = L_freq + 3*max_depth;
962 for (i = 0; i < n_acc; ++i) {
963 ir_node *acc = get_entity_access(ent, i);
964 int depth = get_weighted_loop_depth(acc);
965 assert(depth <= max_depth);
966 if (is_Load(acc) || is_Call(acc)) {
968 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
969 if (addr_is_alloc(acc)) {
971 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
973 if (get_entity_allocation(ent) == allocation_static) {
975 *max_disp = (depth > *max_disp) ? depth : *max_disp;
977 } else if (is_Store(acc)) {
979 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
980 if (addr_is_alloc(acc)) {
982 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
984 if (get_entity_allocation(ent) == allocation_static) {
992 if (get_entity_allocation(ent) != allocation_static) {
994 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
996 if (max_L_freq >= 0) {
997 fprintf(F, "%s Load", comma);
998 for (i = 0; i <= max_L_freq; ++i) {
999 fprintf(F, "%s %d", comma, L_freq[i]);
1002 if (max_S_freq >= 0) {
1003 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
1004 fprintf(F, "%s Store", comma);
1005 for (i = 0; i <= max_S_freq; ++i) {
1006 fprintf(F, "%s %d", comma, S_freq[i]);
1014 if (get_entity_allocation(ent) != allocation_static) {
1015 if (is_Method_type(get_entity_type(ent))) return;
1017 /* Output the entity name. */
1018 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
1020 #ifdef INTERPROCEDURAL_VIEW
1021 if (get_trouts_state() != outs_none) {
1022 if (is_Method_type(get_entity_type(ent))) {
1023 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1024 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1026 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
1027 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
1036 #ifdef INTERPROCEDURAL_VIEW
1037 /* A fast hack to dump a CSV-file. */
1038 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
1040 char buf[1024 + 10];
1043 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
1045 if (verbosity & dump_verbosity_accessStats) {
1048 /* Outputs loop depth of all occurrences. */
1051 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
1052 int n_all = get_type_n_allocs(tp);
1054 /* Find maximal depth */
1055 for (i = 0; i < n_all; ++i) {
1056 ir_node *all = get_type_alloc(tp, i);
1057 int depth = get_weighted_loop_depth(all);
1058 max_depth = (depth > max_depth) ? depth : max_depth ;
1061 freq = XMALLOCNZ(int, 2 * (max_depth + 1));
1063 disp = freq + max_depth;
1065 for (i = 0; i < n_all; ++i) {
1066 ir_node *all = get_type_alloc(tp, i);
1067 int depth = get_weighted_loop_depth(all);
1068 assert(depth <= max_depth);
1070 max_freq = (depth > max_freq) ? depth : max_freq;
1071 assert(is_Alloc(all));
1074 fprintf(F, "%s ", get_type_name(tp));
1075 fprintf(F, "%s Alloc ", comma);
1077 if (max_freq >= 0) {
1078 for (i = 0; i <= max_freq; ++i) {
1079 fprintf(F, "%s %d", comma, freq[i]);
1084 for (i = 0; i < get_class_n_members(tp); ++i) {
1085 ir_entity *mem = get_class_member(tp, i);
1086 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1087 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1088 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1089 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1094 if (max_disp >= 0) {
1095 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1096 for (i = 0; i <= max_disp; ++i) {
1097 fprintf(F, "%s %d", comma, disp[i]);
1102 /* free allocated space */
1106 #define DISP_TAB_SUFFIX "__disp_tab"
1107 if (get_trouts_state() != outs_none) {
1108 assert(strlen(get_type_name(tp)) < 1024);
1109 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1110 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1111 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1114 for (i = 0; i < get_class_n_members(tp); ++i) {
1115 ir_entity *mem = get_class_member(tp, i);
1116 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1117 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1118 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1119 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1127 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1130 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1131 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1132 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1133 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1134 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1135 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1136 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1137 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1139 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1140 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1142 switch (get_type_tpop_code(tp)) {
1145 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1146 fprintf(F, "\n members: \n");
1148 for (i = 0; i < get_class_n_members(tp); ++i) {
1149 ir_entity *mem = get_class_member(tp, i);
1150 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1151 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1152 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1153 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1157 if (verbosity & dump_verbosity_typeattrs) {
1158 fprintf(F, " supertypes: ");
1159 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1160 ir_type *stp = get_class_supertype(tp, i);
1161 fprintf(F, "\n %d %s", i, get_type_name(stp));
1163 fprintf(F, "\n subtypes: ");
1164 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1165 ir_type *stp = get_class_subtype(tp, i);
1166 fprintf(F, "\n %d %s", i, get_type_name(stp));
1169 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1171 fprintf(F, "\n transitive supertypes: ");
1172 for (stp = get_class_trans_supertype_first(tp);
1174 stp = get_class_trans_supertype_next(tp)) {
1175 fprintf(F, "\n %s", get_type_name(stp));
1177 fprintf(F, "\n transitive subtypes: ");
1178 for (stp = get_class_trans_subtype_first(tp);
1180 stp = get_class_trans_subtype_next(tp)) {
1181 fprintf(F, "\n %s", get_type_name(stp));
1185 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1186 fprintf(F, "\n flags: ");
1187 if (is_class_final(tp))
1188 fprintf(F, "final, ");
1189 if (is_class_interface(tp))
1190 fprintf(F, "interface, ");
1191 if (is_class_abstract(tp))
1192 fprintf(F, "abstract, ");
1199 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1200 for (i = 0; i < get_compound_n_members(tp); ++i) {
1201 ir_entity *mem = get_compound_member(tp, i);
1202 if (verbosity & dump_verbosity_fields) {
1203 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1209 if (verbosity & dump_verbosity_typeattrs) {
1211 ir_type *elem_tp = get_array_element_type(tp);
1213 fprintf(F, "\n array ");
1215 n_dim = get_array_n_dimensions(tp);
1216 for (i = 0; i < n_dim; ++i) {
1217 ir_node *lower, *upper;
1219 lower = get_array_lower_bound(tp, i);
1220 upper = get_array_upper_bound(tp, i);
1224 if (is_Const(lower)) {
1225 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1227 dump_node_opcode(F, lower);
1228 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1231 if (is_Const(upper)) {
1232 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1234 dump_node_opcode(F, upper);
1235 fprintf(F, " %ld]", get_irn_node_nr(upper));
1238 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1240 fprintf(F, "\n order: ");
1241 for (i = 0; i < n_dim; ++i)
1242 fprintf(F, "<%d>", get_array_order(tp, i));
1246 if (verbosity & dump_verbosity_fields) {
1247 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1254 if (verbosity & dump_verbosity_typeattrs) {
1255 ir_type *tt = get_pointer_points_to_type(tp);
1256 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1261 if (verbosity & dump_verbosity_typeattrs) {
1262 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1263 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1264 for (i = 0; i < get_method_n_ress(tp); ++i) {
1265 ir_type *rtp = get_method_res_type(tp, i);
1266 fprintf(F, "\n %s", get_type_name(rtp));
1269 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1270 for (i = 0; i < get_method_n_params(tp); ++i) {
1271 ir_type *ptp = get_method_param_type(tp, i);
1272 fprintf(F, "\n %s", get_type_name(ptp));
1274 if (get_method_variadicity(tp)) {
1275 fprintf(F, "\n ...");
1282 if (verbosity & dump_verbosity_typeattrs) {
1283 ir_type *base_tp = get_primitive_base_type(tp);
1284 if (base_tp != NULL)
1285 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1297 if (verbosity & dump_verbosity_typeattrs) {
1298 fprintf(F, ": details not implemented\n");
1302 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1303 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1304 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1305 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1306 if (is_atomic_type(tp) || is_Method_type(tp))
1307 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1309 if (get_trouts_state()) {
1310 fprintf(F, "\n Type outs:\n");
1311 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1312 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1313 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1314 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1315 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1319 if (verbosity & dump_verbosity_accessStats) {
1321 int n_all = get_type_n_allocs(tp);
1326 /* Find maximal depth */
1327 for (i = 0; i < n_all; ++i) {
1328 ir_node *all = get_type_alloc(tp, i);
1329 int depth = get_weighted_loop_depth(all);
1330 max_depth = (depth > max_depth) ? depth : max_depth ;
1333 freq = XMALLOCNZ(int, max_depth + 1);
1335 for (i = 0; i < n_all; ++i) {
1336 ir_node *all = get_type_alloc(tp, i);
1337 int depth = get_weighted_loop_depth(all);
1338 assert(depth <= max_depth);
1340 max_freq = (depth > max_freq) ? depth : max_freq;
1341 assert(is_Alloc(all));
1344 if (max_freq >= 0) {
1347 fprintf(F, " Alloc Stats");
1348 for (i = 0; i <= max_freq; ++i) {
1349 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1357 #ifdef INTERPROCEDURAL_VIEW
1358 if (get_trouts_state() != outs_none) {
1359 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1360 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1361 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1362 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1363 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1364 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1374 void dump_type(ir_type *tp) {
1375 dump_type_to_file (stdout, tp, dump_verbosity_max);
1379 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1380 const char *basename;
1381 FILE *F, *CSV = NULL;
1382 int i, n_types = get_irp_n_types();
1384 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1385 F = text_open(basename, suffix, "-types", ".txt");
1387 if (verbosity & dump_verbosity_csv) {
1388 CSV = text_open(basename, suffix, "-types", ".csv");
1389 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1392 for (i = 0; i < n_types; ++i) {
1393 ir_type *t = get_irp_type(i);
1395 //if (is_jack_rts_class(t)) continue;
1397 dump_type_to_file(F, t, verbosity);
1398 #ifdef INTERPROCEDURAL_VIEW
1400 dump_typecsv_to_file(CSV, t, verbosity, "");
1406 if (CSV) fclose(CSV);
1410 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1411 const char *basename;
1412 FILE *F, *CSV = NULL;
1413 ir_type *g = get_glob_type();
1414 int i, n_mems = get_class_n_members(g);
1416 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1417 F = text_open (basename, suffix, "-globals", ".txt");
1419 if (verbosity & dump_verbosity_csv) {
1420 CSV = text_open (basename, suffix, "-types", ".csv");
1421 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1424 for (i = 0; i < n_mems; ++i) {
1425 ir_entity *e = get_class_member(g, i);
1427 dump_entity_to_file(F, e, verbosity);
1429 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1434 if (CSV) fclose (CSV);