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 ir_fprintf(F, " start of method of type %+F\n", tp);
228 for (i = 0; i < get_method_n_params(tp); ++i)
229 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
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,
238 get_irn_node_nr(cfgpred),
239 get_irg_dump_name(get_irn_irg(cfgpred)));
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",
248 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
252 ir_fprintf(F, " allocating entity of type: %+F\n", get_Alloc_type(n));
253 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
256 ir_fprintf(F, " freeing entity of type %+F\n", get_Free_type(n));
257 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
260 ir_entity *ent = get_Sel_entity(n);
262 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
263 ir_fprintf(F, " of type %+F\n", get_entity_type(ent));
264 ir_fprintf(F, " with owner %+F.\n", get_entity_owner(ent));
267 fprintf(F, " <NULL entity>\n");
272 ir_type *tp = get_Call_type(n);
273 if (get_Call_tail_call(n))
274 fprintf(F, " tail call\n");
275 ir_fprintf(F, " calling method of type %+F\n", tp);
276 if(get_unknown_type() != tp) {
277 for (i = 0; i < get_method_n_params(tp); ++i)
278 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
279 for (i = 0; i < get_method_n_ress(tp); ++i)
280 ir_fprintf(F, " result %d type: %+F\n", i, get_method_res_type(tp, i));
282 if (Call_has_callees(n)) {
283 fprintf(F, " possible callees:\n");
284 for (i = 0; i < get_Call_n_callees(n); i++) {
285 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
289 case iro_CallBegin: {
290 ir_node *call = get_CallBegin_call(n);
291 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
292 if (Call_has_callees(call)) {
293 fprintf(F, " possible callees:\n");
294 for (i = 0; i < get_Call_n_callees(call); i++) {
295 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
300 ir_fprintf(F, " cast to type: %+F\n", get_Cast_type(n));
303 if (!get_interprocedural_view()) {
304 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
305 ir_fprintf(F, " return in method of type %+F\n", tp);
306 for (i = 0; i < get_method_n_ress(tp); ++i) {
307 ir_fprintf(F, " result %d type: %+F\n", i,
308 get_method_res_type(tp, i));
313 assert(get_Const_type(n) != firm_none_type);
314 ir_fprintf(F, " Const of type %+F\n", get_Const_type(n));
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_const_name(get_SymConst_enum(n)));
352 ir_fprintf(F, " type of value: %+F\n", get_SymConst_value_type(n));
355 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
356 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
357 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
360 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
361 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
364 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
367 const ir_asm_constraint *cons;
371 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
372 l = get_ASM_n_input_constraints(n);
374 fprintf(F, "\n inputs: ");
375 cons = get_ASM_input_constraints(n);
376 for (i = 0; i < l; ++i)
377 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
379 l = get_ASM_n_output_constraints(n);
381 fprintf(F, "\n outputs: ");
382 cons = get_ASM_output_constraints(n);
383 for (i = 0; i < l; ++i)
384 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
386 l = get_ASM_n_clobbers(n);
388 fprintf(F, "\n clobber: ");
389 clobber = get_ASM_clobbers(n);
390 for (i = 0; i < l; ++i)
391 fprintf(F, "%s ", get_id_str(clobber[i]));
393 if (get_irn_pinned(n) != op_pin_state_floats)
394 fprintf(F, "\n volatile");
400 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
401 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
402 if (get_irn_typeinfo_type(n) != firm_none_type)
403 ir_fprintf (F, " Analysed type: %s\n", get_irn_typeinfo_type(n));
410 void dump_irnode(ir_node *n) {
411 dump_irnode_to_file(stdout, n);
415 void dump_graph_to_file(FILE *F, ir_graph *irg) {
416 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
419 void dump_graph(ir_graph *g) {
420 dump_graph_to_file(stdout, g);
423 static void dump_node_to_graph_file(ir_node *n, void *env) {
424 FILE *F = (FILE *)env;
426 dump_irnode_to_file(F, n);
430 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
431 const char *basename = get_irg_dump_name(irg);
434 F = text_open(basename, suffix, "", ".txt");
436 dump_graph_to_file(F, irg);
438 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
443 #ifdef EXTENDED_ACCESS_STATS
444 static int addr_is_alloc(ir_node *acc) {
445 ir_node *addr = NULL;
448 addr = get_memop_ptr(acc);
450 assert(is_Call(acc));
451 addr = get_Call_ptr(acc);
454 addr_op = get_irn_opcode(addr);
456 while (addr_op != iro_Alloc) {
459 addr = get_Sel_ptr(addr);
462 addr = get_Cast_op(addr);
465 addr = get_Proj_pred(addr);
480 //assert(0 && "unexpected address node");
483 addr_op = get_irn_opcode(addr);
486 /* In addition, the alloc must be in the same loop. */
491 /** dumps something like:
493 * "prefix" "Name" (x): node1, ... node7,\n
494 * "prefix" node8, ... node15,\n
495 * "prefix" node16, node17\n
497 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
498 int (*get_entity_n_nodes)(firm_kind *ent),
499 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
501 int i, n_nodes = get_entity_n_nodes(k);
504 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
505 for (i = 0; i < n_nodes; ++i) {
507 if (i > 7 && !(i & 7)) { /* line break every eight node. */
508 fprintf(F, ",\n%s ", prefix);
511 fprintf(F, "%s ", comma);
512 rem = opt_dump_analysed_type_info;
513 opt_dump_analysed_type_info = 0;
514 dump_node_label(F, get_entity_node(k, i));
515 opt_dump_analysed_type_info = rem;
521 /** dumps something like:
523 * "prefix" "Name" (x): node1, ... node7,\n
524 * "prefix" node8, ... node15,\n
525 * "prefix" node16, node17\n
527 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
528 int (*get_n_types)(const ir_type *tp),
529 ir_type *(*get_type)(const ir_type *tp, int pos),
531 int i, n_nodes = get_n_types(tp);
534 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
535 for (i = 0; i < n_nodes; ++i) {
536 if (i > 7 && !(i & 7)) { /* line break every eight node. */
537 fprintf(F, ",\n%s ", prefix);
540 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
546 static int need_nl = 1;
551 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
552 const ir_initializer_t *initializer, ir_type *type) {
557 fprintf(F, "\n%s ", prefix);
560 switch (get_initializer_kind(initializer)) {
561 case IR_INITIALIZER_NULL:
562 fprintf(F, "\t = <NOT_SET>");
564 case IR_INITIALIZER_TARVAL:
565 tv = get_initializer_tarval_value(initializer);
566 ir_fprintf(F, "\t = <TV>%F", tv);
568 case IR_INITIALIZER_CONST:
569 value = get_initializer_const_value(initializer);
570 fprintf(F, "\t = <CONST>");
571 dump_node_opcode(F, value);
573 case IR_INITIALIZER_COMPOUND:
574 if (is_Array_type(type)) {
575 size_t i, n = get_initializer_compound_n_entries(initializer);
576 ir_type *element_type = get_array_element_type(type);
577 for (i = 0; i < n; ++i) {
578 ir_initializer_t *sub_initializer
579 = get_initializer_compound_value(initializer, i);
582 fprintf(F, "\n%s ", prefix);
585 fprintf(F, "[%d]", (int) i);
586 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
590 assert(is_compound_type(type));
591 n = get_compound_n_members(type);
592 for (i = 0; i < n; ++i) {
593 ir_entity *member = get_compound_member(type, i);
594 ir_type *subtype = get_entity_type(member);
595 ir_initializer_t *sub_initializer;
597 assert(i < get_initializer_compound_n_entries(initializer));
599 = get_initializer_compound_value(initializer, i);
602 fprintf(F, "\n%s ", prefix);
605 ir_fprintf(F, ".%F", member);
606 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
611 panic("invalid ir_initializer kind found");
616 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
618 ir_linkage linkage = get_entity_linkage(entity);
620 if (linkage & IR_LINKAGE_CONSTANT)
621 fprintf(F, " constant");
622 if (linkage & IR_LINKAGE_WEAK)
624 if (linkage & IR_LINKAGE_LOCAL)
625 fprintf(F, " local");
626 if (linkage & IR_LINKAGE_EXTERN)
627 fprintf(F, " extern");
628 if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
629 fprintf(F, " garbage_collect");
630 if (linkage & IR_LINKAGE_MERGE)
631 fprintf(F, " merge");
632 if (linkage & IR_LINKAGE_HIDDEN_USER)
633 fprintf(F, " hidden_user");
636 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
638 ir_type *owner, *type;
640 assert(is_entity(ent));
641 owner = get_entity_owner(ent);
642 type = get_entity_type(ent);
643 if (verbosity & dump_verbosity_onlynames) {
644 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
645 get_entity_name(ent), get_entity_nr(ent));
649 if (verbosity & dump_verbosity_entattrs) {
650 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
651 ir_fprintf(F, "%s type: %+F\n", prefix, type);
652 ir_fprintf(F, "%s owner: %+F\n", prefix, owner);
654 if (is_Class_type(get_entity_owner(ent))) {
655 if (get_entity_n_overwrites(ent) > 0) {
656 fprintf(F, "%s overwrites:\n", prefix);
657 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
658 ir_entity *ov = get_entity_overwrites(ent, i);
659 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
660 get_entity_name(ov), get_entity_owner(ov));
663 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
665 if (get_entity_n_overwrittenby(ent) > 0) {
666 fprintf(F, "%s overwritten by:\n", prefix);
667 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
668 ir_entity *ov = get_entity_overwrittenby(ent, i);
669 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
670 get_entity_name(ov), get_entity_owner(ov));
673 fprintf(F, "%s Is not overwritten by other entities.\n",
677 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
679 fprintf(F, "%s transitive overwrites:\n", prefix);
680 for (ov = get_entity_trans_overwrites_first(ent);
682 ov = get_entity_trans_overwrites_next(ent)) {
683 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
684 get_entity_name(ov), get_entity_owner(ov));
686 fprintf(F, "%s transitive overwritten by:\n", prefix);
687 for (ov = get_entity_trans_overwrittenby_first(ent);
689 ov = get_entity_trans_overwrittenby_next(ent)) {
690 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
691 get_entity_name(ov), get_entity_owner(ov));
696 fprintf(F, "%s linkage:", prefix);
697 dump_entity_linkage(F, ent);
699 if (is_Method_type(get_entity_type(ent))) {
700 unsigned mask = get_entity_additional_properties(ent);
701 unsigned cc = get_method_calling_convention(get_entity_type(ent));
702 ir_graph *irg = get_entity_irg(ent);
705 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
706 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
710 fprintf(F, "\n%s additional prop: ", prefix);
712 if (mask & mtp_property_const) fputs("const_function, ", F);
713 if (mask & mtp_property_pure) fputs("pure_function, ", F);
714 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
715 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
716 if (mask & mtp_property_naked) fputs("naked_function, ", F);
717 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
718 if (mask & mtp_property_weak) fputs("weak_function, ", F);
719 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
720 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
721 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
722 if (mask & mtp_property_private) fputs("private_function, ", F);
723 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
725 fprintf(F, "\n%s calling convention: ", prefix);
726 if (cc & cc_reg_param) fputs("regparam, ", F);
727 if (cc & cc_this_call) fputs("thiscall, ", F);
728 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
729 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
730 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
733 else if (IS_STDCALL(cc))
736 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
737 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
739 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
743 } else { /* no entattrs */
744 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
745 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
746 get_entity_type(ent), get_entity_name(ent));
747 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
749 if (verbosity & dump_verbosity_accessStats) {
750 dump_entity_linkage(F, ent);
755 if (verbosity & dump_verbosity_entconsts) {
756 if (ent->initializer != NULL) {
757 const ir_initializer_t *initializer = get_entity_initializer(ent);
758 fprintf(F, "\n%s Initializers:", prefix);
760 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
761 } else if (entity_has_compound_ent_values(ent)) {
762 fprintf(F, "%s compound values:", prefix);
763 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
764 compound_graph_path *path = get_compound_ent_value_path(ent, i);
765 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
766 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
767 if (get_type_state(type) == layout_fixed)
768 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
769 fprintf(F, "%s", get_entity_name(ent));
770 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
771 ir_entity *node = get_compound_graph_path_node(path, j);
772 fprintf(F, ".%s", get_entity_name(node));
773 if (is_Array_type(get_entity_owner(node)))
774 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
777 dump_node_opcode(F, get_compound_ent_value(ent, i));
783 if (verbosity & dump_verbosity_entattrs) {
784 fprintf(F, "%s linkage:", prefix);
785 dump_entity_linkage(F, ent);
786 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
787 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
788 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
789 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
790 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
791 if (is_Method_type(get_entity_type(ent))) {
792 if (get_entity_irg(ent)) /* can be null */ {
793 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
794 #ifdef INTERPROCEDURAL_VIEW
795 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
796 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
797 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
801 fprintf(F, "\n%s irg = NULL", prefix);
807 if (get_trouts_state()) {
808 fprintf(F, "%s Entity outs:\n", prefix);
809 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
810 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
811 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
812 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
815 if (verbosity & dump_verbosity_accessStats) {
816 #ifdef EXTENDED_ACCESS_STATS
817 int n_acc = get_entity_n_accesses(ent);
821 int max_LA_freq = -1;
822 int max_SA_freq = -1;
828 /* Find maximal 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 max_depth = (depth > max_depth) ? depth : max_depth ;
835 L_freq = XMALLOCNZ(int, 4 * max_depth);
837 S_freq = L_freq + 1*max_depth;
838 LA_freq = L_freq + 2*max_depth;
839 SA_freq = L_freq + 3*max_depth;
841 for (i = 0; i < n_acc; ++i) {
842 ir_node *acc = get_entity_access(ent, i);
843 int depth = get_weighted_loop_depth(acc);
844 assert(depth < max_depth);
845 if (is_Load(acc) || is_Call(acc)) {
847 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
848 if (addr_is_alloc(acc)) {
850 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
852 } else if (is_Store(acc)) {
854 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
855 if (addr_is_alloc(acc)) {
857 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
864 if (max_L_freq >= 0) {
867 fprintf(F, "%s Load Stats", prefix);
868 for (i = 0; i <= max_L_freq; ++i) {
870 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
877 if (max_LA_freq >= 0) {
878 //fprintf(F, "%s LoadA Stats", prefix);
880 for (i = 0; i <= max_LA_freq; ++i) {
882 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
889 if (max_S_freq >= 0) {
892 fprintf(F, "%s Store Stats", prefix);
893 for (i = 0; i <= max_S_freq; ++i) {
895 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
902 if (max_SA_freq >= 0) {
903 //fprintf(F, "%s StoreAStats", prefix);
905 for (i = 0; i <= max_SA_freq; ++i) {
907 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
915 /* free allocated space */
918 if (get_trouts_state() != outs_none) {
919 #ifdef INTERPROCEDURAL_VIEW
920 if (is_Method_type(get_entity_type(ent))) {
921 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
922 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
924 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
925 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
932 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
933 dump_entity_to_file_prefix (F, ent, "", verbosity);
937 void dump_entity(ir_entity *ent) {
938 dump_entity_to_file(stdout, ent, dump_verbosity_max);
941 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
944 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
945 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
946 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
947 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
948 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
949 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
950 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
951 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
953 ir_fprintf(F, "%+F", tp);
954 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
956 switch (get_type_tpop_code(tp)) {
959 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
960 fprintf(F, "\n members:\n");
962 for (i = 0; i < get_class_n_members(tp); ++i) {
963 ir_entity *mem = get_class_member(tp, i);
964 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
965 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
966 if (!(verbosity & dump_verbosity_nostatic)) {
967 dump_entity_to_file_prefix(F, mem, " ", verbosity);
971 if (verbosity & dump_verbosity_typeattrs) {
972 fprintf(F, " supertypes: ");
973 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
974 ir_type *stp = get_class_supertype(tp, i);
975 ir_fprintf(F, "\n %d %+F", i, stp);
977 fprintf(F, "\n subtypes: ");
978 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
979 ir_type *stp = get_class_subtype(tp, i);
980 ir_fprintf(F, "\n %d %+F", i, stp);
983 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
985 fprintf(F, "\n transitive supertypes: ");
986 for (stp = get_class_trans_supertype_first(tp);
988 stp = get_class_trans_supertype_next(tp)) {
989 ir_fprintf(F, "\n %+F", stp);
991 fprintf(F, "\n transitive subtypes: ");
992 for (stp = get_class_trans_subtype_first(tp);
994 stp = get_class_trans_subtype_next(tp)) {
995 ir_fprintf(F, "\n %+F", stp);
999 fprintf(F, "\n flags: ");
1000 if (is_class_final(tp))
1001 fprintf(F, "final, ");
1002 if (is_class_interface(tp))
1003 fprintf(F, "interface, ");
1004 if (is_class_abstract(tp))
1005 fprintf(F, "abstract, ");
1012 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1013 for (i = 0; i < get_compound_n_members(tp); ++i) {
1014 ir_entity *mem = get_compound_member(tp, i);
1015 if (verbosity & dump_verbosity_fields) {
1016 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1022 if (verbosity & dump_verbosity_typeattrs) {
1024 ir_type *elem_tp = get_array_element_type(tp);
1026 fprintf(F, "\n array ");
1028 n_dim = get_array_n_dimensions(tp);
1029 for (i = 0; i < n_dim; ++i) {
1030 ir_node *lower, *upper;
1032 lower = get_array_lower_bound(tp, i);
1033 upper = get_array_upper_bound(tp, i);
1037 if (is_Const(lower)) {
1038 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1040 dump_node_opcode(F, lower);
1041 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1044 if (is_Const(upper)) {
1045 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1047 dump_node_opcode(F, upper);
1048 fprintf(F, " %ld]", get_irn_node_nr(upper));
1051 ir_fprintf(F, " of <%+F>", elem_tp);
1053 fprintf(F, "\n order: ");
1054 for (i = 0; i < n_dim; ++i)
1055 fprintf(F, "<%d>", get_array_order(tp, i));
1059 if (verbosity & dump_verbosity_fields) {
1060 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1067 if (verbosity & dump_verbosity_typeattrs) {
1068 ir_type *tt = get_pointer_points_to_type(tp);
1069 ir_fprintf(F, "\n points to %+F\n", tt);
1074 if (verbosity & dump_verbosity_typeattrs) {
1075 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1076 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1077 for (i = 0; i < get_method_n_ress(tp); ++i) {
1078 ir_type *rtp = get_method_res_type(tp, i);
1079 ir_fprintf(F, "\n %+F", rtp);
1082 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1083 for (i = 0; i < get_method_n_params(tp); ++i) {
1084 ir_type *ptp = get_method_param_type(tp, i);
1085 ir_fprintf(F, "\n %+F", ptp);
1087 if (get_method_variadicity(tp)) {
1088 fprintf(F, "\n ...");
1095 if (verbosity & dump_verbosity_typeattrs) {
1096 ir_type *base_tp = get_primitive_base_type(tp);
1097 if (base_tp != NULL)
1098 ir_fprintf(F, "\n base type: %+F", tp);
1109 if (verbosity & dump_verbosity_typeattrs) {
1110 fprintf(F, ": details not implemented\n");
1114 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1115 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1116 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1117 if (is_atomic_type(tp) || is_Method_type(tp))
1118 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1120 if (get_trouts_state()) {
1121 fprintf(F, "\n Type outs:\n");
1122 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1123 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1124 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1125 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1126 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1130 if (verbosity & dump_verbosity_accessStats) {
1132 int n_all = get_type_n_allocs(tp);
1137 /* Find maximal depth */
1138 for (i = 0; i < n_all; ++i) {
1139 ir_node *all = get_type_alloc(tp, i);
1140 int depth = get_weighted_loop_depth(all);
1141 max_depth = (depth > max_depth) ? depth : max_depth ;
1144 freq = XMALLOCNZ(int, max_depth + 1);
1146 for (i = 0; i < n_all; ++i) {
1147 ir_node *all = get_type_alloc(tp, i);
1148 int depth = get_weighted_loop_depth(all);
1149 assert(depth <= max_depth);
1151 max_freq = (depth > max_freq) ? depth : max_freq;
1152 assert(is_Alloc(all));
1155 if (max_freq >= 0) {
1158 fprintf(F, " Alloc Stats");
1159 for (i = 0; i <= max_freq; ++i) {
1160 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1168 #ifdef INTERPROCEDURAL_VIEW
1169 if (get_trouts_state() != outs_none) {
1170 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1171 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1172 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1173 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1174 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1175 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1185 void dump_type(ir_type *tp) {
1186 dump_type_to_file (stdout, tp, dump_verbosity_max);
1189 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1190 const char *basename;
1192 int i, n_types = get_irp_n_types();
1194 basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1195 F = text_open(basename, suffix, "-types", ".txt");
1197 for (i = 0; i < n_types; ++i) {
1198 ir_type *t = get_irp_type(i);
1200 //if (is_jack_rts_class(t)) continue;
1202 dump_type_to_file(F, t, verbosity);
1208 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1209 const char *basename;
1211 ir_type *g = get_glob_type();
1212 int i, n_mems = get_class_n_members(g);
1214 basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1215 F = text_open (basename, suffix, "-globals", ".txt");
1217 for (i = 0; i < n_mems; ++i) {
1218 ir_entity *e = get_class_member(g, i);
1220 dump_entity_to_file(F, e, verbosity);