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 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
272 if(get_unknown_type() != tp) {
273 for (i = 0; i < get_method_n_params(tp); ++i)
274 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
275 for (i = 0; i < get_method_n_ress(tp); ++i)
276 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
278 if (Call_has_callees(n)) {
279 fprintf(F, " possible callees: \n");
280 for (i = 0; i < get_Call_n_callees(n); i++) {
281 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
285 case iro_CallBegin: {
286 ir_node *call = get_CallBegin_call(n);
287 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
288 if (Call_has_callees(call)) {
289 fprintf(F, " possible callees: \n");
290 for (i = 0; i < get_Call_n_callees(call); i++) {
291 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
296 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
299 if (!get_interprocedural_view()) {
300 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
301 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
302 for (i = 0; i < get_method_n_ress(tp); ++i)
303 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
307 assert(get_Const_type(n) != firm_none_type);
308 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
311 switch(get_SymConst_kind(n)) {
312 case symconst_addr_name:
313 fprintf(F, " kind: addr_name\n");
314 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
316 case symconst_addr_ent:
317 fprintf(F, " kind: addr_ent\n");
318 fprintf(F, " entity: ");
319 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
321 case symconst_ofs_ent:
322 fprintf(F, " kind: offset\n");
323 fprintf(F, " entity: ");
324 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
326 case symconst_type_tag:
327 fprintf(F, " kind: type_tag\n");
328 fprintf(F, " type: ");
329 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
331 case symconst_type_size:
332 fprintf(F, " kind: size\n");
333 fprintf(F, " type: ");
334 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
336 case symconst_type_align:
337 fprintf(F, " kind: alignment\n");
338 fprintf(F, " type: ");
339 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
341 case symconst_enum_const:
342 fprintf(F, " kind: enumeration\n");
343 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
346 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
349 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
350 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
351 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
354 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
355 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
358 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
361 const ir_asm_constraint *cons;
365 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
366 l = get_ASM_n_input_constraints(n);
368 fprintf(F, "\n inputs: ");
369 cons = get_ASM_input_constraints(n);
370 for (i = 0; i < l; ++i)
371 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
373 l = get_ASM_n_output_constraints(n);
375 fprintf(F, "\n outputs: ");
376 cons = get_ASM_output_constraints(n);
377 for (i = 0; i < l; ++i)
378 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
380 l = get_ASM_n_clobbers(n);
382 fprintf(F, "\n clobber: ");
383 clobber = get_ASM_clobbers(n);
384 for (i = 0; i < l; ++i)
385 fprintf(F, "%s ", get_id_str(clobber[i]));
387 if (get_irn_pinned(n) != op_pin_state_floats)
388 fprintf(F, "\n volatile");
394 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
395 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
396 if (get_irn_typeinfo_type(n) != firm_none_type)
397 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
404 void dump_irnode(ir_node *n) {
405 dump_irnode_to_file(stdout, n);
409 void dump_graph_to_file(FILE *F, ir_graph *irg) {
410 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
413 void dump_graph(ir_graph *g) {
414 dump_graph_to_file(stdout, g);
417 static void dump_node_to_graph_file(ir_node *n, void *env) {
418 FILE *F = (FILE *)env;
420 dump_irnode_to_file(F, n);
424 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
425 const char *basename = get_irg_dump_name(irg);
428 F = text_open(basename, suffix, "", ".txt");
430 dump_graph_to_file(F, irg);
432 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
437 #ifdef EXTENDED_ACCESS_STATS
438 static int addr_is_alloc(ir_node *acc) {
439 ir_node *addr = NULL;
442 addr = get_memop_ptr(acc);
444 assert(is_Call(acc));
445 addr = get_Call_ptr(acc);
448 addr_op = get_irn_opcode(addr);
450 while (addr_op != iro_Alloc) {
453 addr = get_Sel_ptr(addr);
456 addr = get_Cast_op(addr);
459 addr = get_Proj_pred(addr);
474 //assert(0 && "unexpected address node");
477 addr_op = get_irn_opcode(addr);
480 /* In addition, the alloc must be in the same loop. */
485 /** dumps something like:
487 * "prefix" "Name" (x): node1, ... node7,\n
488 * "prefix" node8, ... node15,\n
489 * "prefix" node16, node17\n
491 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
492 int (*get_entity_n_nodes)(firm_kind *ent),
493 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
495 int i, n_nodes = get_entity_n_nodes(k);
498 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
499 for (i = 0; i < n_nodes; ++i) {
501 if (i > 7 && !(i & 7)) { /* line break every eight node. */
502 fprintf(F, ",\n%s ", prefix);
505 fprintf(F, "%s ", comma);
506 rem = opt_dump_analysed_type_info;
507 opt_dump_analysed_type_info = 0;
508 dump_node_label(F, get_entity_node(k, i));
509 opt_dump_analysed_type_info = rem;
515 /** dumps something like:
517 * "prefix" "Name" (x): node1, ... node7,\n
518 * "prefix" node8, ... node15,\n
519 * "prefix" node16, node17\n
521 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
522 int (*get_n_types)(const ir_type *tp),
523 ir_type *(*get_type)(const ir_type *tp, int pos),
525 int i, n_nodes = get_n_types(tp);
528 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
529 for (i = 0; i < n_nodes; ++i) {
530 if (i > 7 && !(i & 7)) { /* line break every eight node. */
531 fprintf(F, ",\n%s ", prefix);
534 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
535 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
541 static int need_nl = 1;
546 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
547 const ir_initializer_t *initializer, ir_type *type) {
552 fprintf(F, "\n%s ", prefix);
555 switch (get_initializer_kind(initializer)) {
556 case IR_INITIALIZER_NULL:
557 fprintf(F, "\t = <NOT_SET>");
559 case IR_INITIALIZER_TARVAL:
560 tv = get_initializer_tarval_value(initializer);
561 ir_fprintf(F, "\t = <TV>%F", tv);
563 case IR_INITIALIZER_CONST:
564 value = get_initializer_const_value(initializer);
565 fprintf(F, "\t = <CONST>");
566 dump_node_opcode(F, value);
568 case IR_INITIALIZER_COMPOUND:
569 if (is_Array_type(type)) {
570 size_t i, n = get_initializer_compound_n_entries(initializer);
571 ir_type *element_type = get_array_element_type(type);
572 for (i = 0; i < n; ++i) {
573 ir_initializer_t *sub_initializer
574 = get_initializer_compound_value(initializer, i);
577 fprintf(F, "\n%s ", prefix);
580 fprintf(F, "[%d]", (int) i);
581 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
585 assert(is_compound_type(type));
586 n = get_compound_n_members(type);
587 for (i = 0; i < n; ++i) {
588 ir_entity *member = get_compound_member(type, i);
589 ir_type *subtype = get_entity_type(member);
590 ir_initializer_t *sub_initializer;
592 assert(i < get_initializer_compound_n_entries(initializer));
594 = get_initializer_compound_value(initializer, i);
597 fprintf(F, "\n%s ", prefix);
600 ir_fprintf(F, ".%F", member);
601 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
606 panic("invalid ir_initializer kind found");
612 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
614 ir_type *owner, *type;
616 assert(is_entity(ent));
617 owner = get_entity_owner(ent);
618 type = get_entity_type(ent);
619 if (verbosity & dump_verbosity_onlynames) {
620 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
621 get_entity_name(ent), get_entity_nr(ent));
625 if (verbosity & dump_verbosity_entattrs) {
626 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
627 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
628 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
630 if (is_Class_type(get_entity_owner(ent))) {
631 if (get_entity_n_overwrites(ent) > 0) {
632 fprintf(F, "%s overwrites:\n", prefix);
633 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
634 ir_entity *ov = get_entity_overwrites(ent, i);
635 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
636 get_type_name(get_entity_owner(ov)));
639 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
641 if (get_entity_n_overwrittenby(ent) > 0) {
642 fprintf(F, "%s overwritten by:\n", prefix);
643 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
644 ir_entity *ov = get_entity_overwrittenby(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 Is not overwritten by other entities. \n", prefix);
652 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
654 fprintf(F, "%s transitive overwrites:\n", prefix);
655 for (ov = get_entity_trans_overwrites_first(ent);
657 ov = get_entity_trans_overwrites_next(ent)) {
658 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
659 get_type_name(get_entity_owner(ov)));
661 fprintf(F, "%s transitive overwritten by:\n", prefix);
662 for (ov = get_entity_trans_overwrittenby_first(ent);
664 ov = get_entity_trans_overwrittenby_next(ent)) {
665 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
666 get_type_name(get_entity_owner(ov)));
671 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
672 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
673 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
675 if (is_Method_type(get_entity_type(ent))) {
676 unsigned mask = get_entity_additional_properties(ent);
677 unsigned cc = get_method_calling_convention(get_entity_type(ent));
678 ir_graph *irg = get_entity_irg(ent);
681 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
682 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
686 fprintf(F, "\n%s additional prop: ", prefix);
688 if (mask & mtp_property_const) fputs("const_function, ", F);
689 if (mask & mtp_property_pure) fputs("pure_function, ", F);
690 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
691 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
692 if (mask & mtp_property_naked) fputs("naked_function, ", F);
693 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
694 if (mask & mtp_property_weak) fputs("weak_function, ", F);
695 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
696 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
697 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
698 if (mask & mtp_property_private) fputs("private_function, ", F);
699 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
701 fprintf(F, "\n%s calling convention: ", prefix);
702 if (cc & cc_reg_param) fputs("regparam, ", F);
703 if (cc & cc_this_call) fputs("thiscall, ", F);
704 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
705 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
706 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
709 else if (IS_STDCALL(cc))
712 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
713 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
715 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
719 } else { /* no entattrs */
720 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
721 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
722 get_type_name(get_entity_type(ent)), get_entity_name(ent));
723 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
725 if (verbosity & dump_verbosity_accessStats) {
726 if (get_entity_allocation(ent) == allocation_static) fputs(" (stat)", F);
727 if (get_entity_peculiarity(ent) == peculiarity_description) fputs(" (desc)", F);
728 if (get_entity_peculiarity(ent) == peculiarity_inherited) fputs(" (inh)", F);
733 if (verbosity & dump_verbosity_entconsts) {
734 if (get_entity_variability(ent) != variability_uninitialized) {
735 if (ent->has_initializer) {
736 const ir_initializer_t *initializer = get_entity_initializer(ent);
737 fprintf(F, "\n%s Initializers:", prefix);
739 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
741 /* old compound_graph_path based initializers */
742 if (is_atomic_entity(ent)) {
743 fprintf(F, "%s atomic value: ", prefix);
744 dump_node_opcode(F, get_atomic_ent_value(ent));
746 fprintf(F, "%s compound values:", prefix);
747 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
748 compound_graph_path *path = get_compound_ent_value_path(ent, i);
749 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
750 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
751 if (get_type_state(type) == layout_fixed)
752 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
753 fprintf(F, "%s", get_entity_name(ent));
754 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
755 ir_entity *node = get_compound_graph_path_node(path, j);
756 fprintf(F, ".%s", get_entity_name(node));
757 if (is_Array_type(get_entity_owner(node)))
758 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
761 dump_node_opcode(F, get_compound_ent_value(ent, i));
769 if (verbosity & dump_verbosity_entattrs) {
770 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
771 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
772 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
773 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
774 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
775 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
776 if (is_Method_type(get_entity_type(ent))) {
777 if (get_entity_irg(ent)) /* can be null */ {
778 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
779 #ifdef INTERPROCEDURAL_VIEW
780 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
781 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
782 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
786 fprintf(F, "\n%s irg = NULL", prefix);
792 if (get_trouts_state()) {
793 fprintf(F, "%s Entity outs:\n", prefix);
794 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
795 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
796 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
797 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
800 if (verbosity & dump_verbosity_accessStats) {
801 #ifdef EXTENDED_ACCESS_STATS
802 int n_acc = get_entity_n_accesses(ent);
806 int max_LA_freq = -1;
807 int max_SA_freq = -1;
813 /* Find maximal depth */
814 for (i = 0; i < n_acc; ++i) {
815 ir_node *acc = get_entity_access(ent, i);
816 int depth = get_weighted_loop_depth(acc);
817 max_depth = (depth > max_depth) ? depth : max_depth ;
820 L_freq = XMALLOCNZ(int, 4 * max_depth);
822 S_freq = L_freq + 1*max_depth;
823 LA_freq = L_freq + 2*max_depth;
824 SA_freq = L_freq + 3*max_depth;
826 for (i = 0; i < n_acc; ++i) {
827 ir_node *acc = get_entity_access(ent, i);
828 int depth = get_weighted_loop_depth(acc);
829 assert(depth < max_depth);
830 if (is_Load(acc) || is_Call(acc)) {
832 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
833 if (addr_is_alloc(acc)) {
835 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
837 } else if (is_Store(acc)) {
839 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
840 if (addr_is_alloc(acc)) {
842 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
849 if (max_L_freq >= 0) {
852 fprintf(F, "%s Load Stats", prefix);
853 for (i = 0; i <= max_L_freq; ++i) {
855 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
862 if (max_LA_freq >= 0) {
863 //fprintf(F, "%s LoadA Stats", prefix);
865 for (i = 0; i <= max_LA_freq; ++i) {
867 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
874 if (max_S_freq >= 0) {
877 fprintf(F, "%s Store Stats", prefix);
878 for (i = 0; i <= max_S_freq; ++i) {
880 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
887 if (max_SA_freq >= 0) {
888 //fprintf(F, "%s StoreAStats", prefix);
890 for (i = 0; i <= max_SA_freq; ++i) {
892 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
900 /* free allocated space */
903 if (get_trouts_state() != outs_none) {
904 #ifdef INTERPROCEDURAL_VIEW
905 if (is_Method_type(get_entity_type(ent))) {
906 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
907 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
909 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
910 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
917 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
918 dump_entity_to_file_prefix (F, ent, "", verbosity);
922 void dump_entity(ir_entity *ent) {
923 dump_entity_to_file(stdout, ent, dump_verbosity_max);
926 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
927 unsigned verbosity, int *max_disp,
928 int disp[], const char *comma)
934 #if 0 /* Outputs loop depth of all occurrences. */
935 int n_acc = get_entity_n_accesses(ent);
938 int max_LA_freq = -1;
939 int max_SA_freq = -1;
944 int i, max_depth = 0;
946 /* Find maximal depth */
947 for (i = 0; i < n_acc; ++i) {
948 ir_node *acc = get_entity_access(ent, i);
949 int depth = get_weighted_loop_depth(acc);
950 max_depth = (depth > max_depth) ? depth : max_depth ;
953 L_freq = XMALLOCNZ(int, 4 * (max_depth + 1));
955 S_freq = L_freq + 1*max_depth;
956 LA_freq = L_freq + 2*max_depth;
957 SA_freq = L_freq + 3*max_depth;
959 for (i = 0; i < n_acc; ++i) {
960 ir_node *acc = get_entity_access(ent, i);
961 int depth = get_weighted_loop_depth(acc);
962 assert(depth <= max_depth);
963 if (is_Load(acc) || is_Call(acc)) {
965 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
966 if (addr_is_alloc(acc)) {
968 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
970 if (get_entity_allocation(ent) == allocation_static) {
972 *max_disp = (depth > *max_disp) ? depth : *max_disp;
974 } else if (is_Store(acc)) {
976 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
977 if (addr_is_alloc(acc)) {
979 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
981 if (get_entity_allocation(ent) == allocation_static) {
989 if (get_entity_allocation(ent) != allocation_static) {
991 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
993 if (max_L_freq >= 0) {
994 fprintf(F, "%s Load", comma);
995 for (i = 0; i <= max_L_freq; ++i) {
996 fprintf(F, "%s %d", comma, L_freq[i]);
999 if (max_S_freq >= 0) {
1000 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
1001 fprintf(F, "%s Store", comma);
1002 for (i = 0; i <= max_S_freq; ++i) {
1003 fprintf(F, "%s %d", comma, S_freq[i]);
1011 if (get_entity_allocation(ent) != allocation_static) {
1012 if (is_Method_type(get_entity_type(ent))) return;
1014 /* Output the entity name. */
1015 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
1017 #ifdef INTERPROCEDURAL_VIEW
1018 if (get_trouts_state() != outs_none) {
1019 if (is_Method_type(get_entity_type(ent))) {
1020 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1021 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
1023 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
1024 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
1033 #ifdef INTERPROCEDURAL_VIEW
1034 /* A fast hack to dump a CSV-file. */
1035 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
1037 char buf[1024 + 10];
1040 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
1042 if (verbosity & dump_verbosity_accessStats) {
1045 /* Outputs loop depth of all occurrences. */
1048 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
1049 int n_all = get_type_n_allocs(tp);
1051 /* Find maximal depth */
1052 for (i = 0; i < n_all; ++i) {
1053 ir_node *all = get_type_alloc(tp, i);
1054 int depth = get_weighted_loop_depth(all);
1055 max_depth = (depth > max_depth) ? depth : max_depth ;
1058 freq = XMALLOCNZ(int, 2 * (max_depth + 1));
1060 disp = freq + max_depth;
1062 for (i = 0; i < n_all; ++i) {
1063 ir_node *all = get_type_alloc(tp, i);
1064 int depth = get_weighted_loop_depth(all);
1065 assert(depth <= max_depth);
1067 max_freq = (depth > max_freq) ? depth : max_freq;
1068 assert(is_Alloc(all));
1071 fprintf(F, "%s ", get_type_name(tp));
1072 fprintf(F, "%s Alloc ", comma);
1074 if (max_freq >= 0) {
1075 for (i = 0; i <= max_freq; ++i) {
1076 fprintf(F, "%s %d", comma, freq[i]);
1081 for (i = 0; i < get_class_n_members(tp); ++i) {
1082 ir_entity *mem = get_class_member(tp, i);
1083 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1084 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1085 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1086 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1091 if (max_disp >= 0) {
1092 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1093 for (i = 0; i <= max_disp; ++i) {
1094 fprintf(F, "%s %d", comma, disp[i]);
1099 /* free allocated space */
1103 #define DISP_TAB_SUFFIX "__disp_tab"
1104 if (get_trouts_state() != outs_none) {
1105 assert(strlen(get_type_name(tp)) < 1024);
1106 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1107 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1108 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1111 for (i = 0; i < get_class_n_members(tp); ++i) {
1112 ir_entity *mem = get_class_member(tp, i);
1113 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1114 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1115 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1116 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1124 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1127 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1128 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1129 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1130 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1131 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1132 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1133 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1134 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1136 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1137 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1139 switch (get_type_tpop_code(tp)) {
1142 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1143 fprintf(F, "\n members: \n");
1145 for (i = 0; i < get_class_n_members(tp); ++i) {
1146 ir_entity *mem = get_class_member(tp, i);
1147 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1148 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1149 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1150 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1154 if (verbosity & dump_verbosity_typeattrs) {
1155 fprintf(F, " supertypes: ");
1156 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1157 ir_type *stp = get_class_supertype(tp, i);
1158 fprintf(F, "\n %d %s", i, get_type_name(stp));
1160 fprintf(F, "\n subtypes: ");
1161 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1162 ir_type *stp = get_class_subtype(tp, i);
1163 fprintf(F, "\n %d %s", i, get_type_name(stp));
1166 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1168 fprintf(F, "\n transitive supertypes: ");
1169 for (stp = get_class_trans_supertype_first(tp);
1171 stp = get_class_trans_supertype_next(tp)) {
1172 fprintf(F, "\n %s", get_type_name(stp));
1174 fprintf(F, "\n transitive subtypes: ");
1175 for (stp = get_class_trans_subtype_first(tp);
1177 stp = get_class_trans_subtype_next(tp)) {
1178 fprintf(F, "\n %s", get_type_name(stp));
1182 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1183 fprintf(F, "\n flags: ");
1184 if (is_class_final(tp))
1185 fprintf(F, "final, ");
1186 if (is_class_interface(tp))
1187 fprintf(F, "interface, ");
1188 if (is_class_abstract(tp))
1189 fprintf(F, "abstract, ");
1196 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1197 for (i = 0; i < get_compound_n_members(tp); ++i) {
1198 ir_entity *mem = get_compound_member(tp, i);
1199 if (verbosity & dump_verbosity_fields) {
1200 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1206 if (verbosity & dump_verbosity_typeattrs) {
1208 ir_type *elem_tp = get_array_element_type(tp);
1210 fprintf(F, "\n array ");
1212 n_dim = get_array_n_dimensions(tp);
1213 for (i = 0; i < n_dim; ++i) {
1214 ir_node *lower, *upper;
1216 lower = get_array_lower_bound(tp, i);
1217 upper = get_array_upper_bound(tp, i);
1221 if (is_Const(lower)) {
1222 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1224 dump_node_opcode(F, lower);
1225 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1228 if (is_Const(upper)) {
1229 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1231 dump_node_opcode(F, upper);
1232 fprintf(F, " %ld]", get_irn_node_nr(upper));
1235 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1237 fprintf(F, "\n order: ");
1238 for (i = 0; i < n_dim; ++i)
1239 fprintf(F, "<%d>", get_array_order(tp, i));
1243 if (verbosity & dump_verbosity_fields) {
1244 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1251 if (verbosity & dump_verbosity_typeattrs) {
1252 ir_type *tt = get_pointer_points_to_type(tp);
1253 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1258 if (verbosity & dump_verbosity_typeattrs) {
1259 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1260 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1261 for (i = 0; i < get_method_n_ress(tp); ++i) {
1262 ir_type *rtp = get_method_res_type(tp, i);
1263 fprintf(F, "\n %s", get_type_name(rtp));
1266 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1267 for (i = 0; i < get_method_n_params(tp); ++i) {
1268 ir_type *ptp = get_method_param_type(tp, i);
1269 fprintf(F, "\n %s", get_type_name(ptp));
1271 if (get_method_variadicity(tp)) {
1272 fprintf(F, "\n ...");
1279 if (verbosity & dump_verbosity_typeattrs) {
1280 ir_type *base_tp = get_primitive_base_type(tp);
1281 if (base_tp != NULL)
1282 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1294 if (verbosity & dump_verbosity_typeattrs) {
1295 fprintf(F, ": details not implemented\n");
1299 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1300 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1301 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1302 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1303 if (is_atomic_type(tp) || is_Method_type(tp))
1304 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1306 if (get_trouts_state()) {
1307 fprintf(F, "\n Type outs:\n");
1308 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1309 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1310 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1311 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1312 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1316 if (verbosity & dump_verbosity_accessStats) {
1318 int n_all = get_type_n_allocs(tp);
1323 /* Find maximal depth */
1324 for (i = 0; i < n_all; ++i) {
1325 ir_node *all = get_type_alloc(tp, i);
1326 int depth = get_weighted_loop_depth(all);
1327 max_depth = (depth > max_depth) ? depth : max_depth ;
1330 freq = XMALLOCNZ(int, max_depth + 1);
1332 for (i = 0; i < n_all; ++i) {
1333 ir_node *all = get_type_alloc(tp, i);
1334 int depth = get_weighted_loop_depth(all);
1335 assert(depth <= max_depth);
1337 max_freq = (depth > max_freq) ? depth : max_freq;
1338 assert(is_Alloc(all));
1341 if (max_freq >= 0) {
1344 fprintf(F, " Alloc Stats");
1345 for (i = 0; i <= max_freq; ++i) {
1346 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1354 #ifdef INTERPROCEDURAL_VIEW
1355 if (get_trouts_state() != outs_none) {
1356 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1357 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1358 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1359 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1360 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1361 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1371 void dump_type(ir_type *tp) {
1372 dump_type_to_file (stdout, tp, dump_verbosity_max);
1376 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1377 const char *basename;
1378 FILE *F, *CSV = NULL;
1379 int i, n_types = get_irp_n_types();
1381 basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1382 F = text_open(basename, suffix, "-types", ".txt");
1384 if (verbosity & dump_verbosity_csv) {
1385 CSV = text_open(basename, suffix, "-types", ".csv");
1386 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1389 for (i = 0; i < n_types; ++i) {
1390 ir_type *t = get_irp_type(i);
1392 //if (is_jack_rts_class(t)) continue;
1394 dump_type_to_file(F, t, verbosity);
1395 #ifdef INTERPROCEDURAL_VIEW
1397 dump_typecsv_to_file(CSV, t, verbosity, "");
1403 if (CSV) fclose(CSV);
1407 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1408 const char *basename;
1409 FILE *F, *CSV = NULL;
1410 ir_type *g = get_glob_type();
1411 int i, n_mems = get_class_n_members(g);
1413 basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1414 F = text_open (basename, suffix, "-globals", ".txt");
1416 if (verbosity & dump_verbosity_csv) {
1417 CSV = text_open (basename, suffix, "-types", ".csv");
1418 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1421 for (i = 0; i < n_mems; ++i) {
1422 ir_entity *e = get_class_member(g, i);
1424 dump_entity_to_file(F, e, verbosity);
1426 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1431 if (CSV) fclose (CSV);