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"
45 #include "field_temperature.h"
47 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
50 * Just opens a file, mangling a file name.
52 * The file name results from the concatenation of the following parts:
54 * @param basename The basis of the name telling about the content.
55 * @param suffix1 The first suffix.
56 * @param suffix2 The second suffix.
57 * @param suffix3 The third suffix.
59 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3)
62 int len = strlen(basename), i, j;
63 char *fname; /* filename to put the vcg information in */
65 if (!basename) assert(basename);
66 if (!suffix1) suffix1 = "";
67 if (!suffix2) suffix2 = "";
68 if (!suffix3) suffix3 = ".txt";
70 /* open file for vcg graph */
71 fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
74 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
75 if (basename[i] == '/') {
76 fname[j] = '@'; j++; fname[j] = '1'; j++;
77 } else if (basename[i] == '@') {
78 fname[j] = '@'; j++; fname[j] = '2'; j++;
80 fname[j] = basename[i]; j++;
84 strcat(fname, suffix1); /* append file suffix */
85 strcat(fname, suffix2); /* append file suffix */
86 strcat(fname, suffix3); /* append the .txt suffix */
88 F = fopen(fname, "w"); /* open file for writing */
98 /* Write the irnode and all its attributes to the file passed. */
99 int dump_irnode_to_file(FILE *F, ir_node *n)
106 dump_node_opcode(F, n);
107 fprintf(F, " %ld\n", get_irn_node_nr(n));
109 fprintf(F, " index: %u\n", get_irn_idx(n));
110 if (opt_dump_pointer_values_to_info)
111 fprintf (F, " addr: %p\n", (void *)n);
112 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
113 fprintf (F, " visited: %ld\n", get_irn_visited(n));
114 irg = get_irn_irg(n);
115 if (irg != get_const_code_irg())
116 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
118 if (get_irn_pinned(n) == op_pin_state_floats &&
119 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
120 fprintf(F, " node was pinned in ");
121 dump_node_opcode(F, get_irn_n(n, -1));
122 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
125 #ifdef INTERPROCEDURAL_VIEW
126 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
127 /* show all predecessor nodes */
128 fprintf(F, " pred nodes:\n");
131 dump_node_opcode(F, get_irn_n(n, -1));
132 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
134 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
135 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
136 dump_node_opcode(F, get_irn_intra_n(n, i));
137 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
140 fprintf(F, " arity: %d\n", get_irn_arity(n));
141 /* show all predecessor nodes */
142 fprintf(F, " pred nodes:\n");
145 dump_node_opcode(F, get_irn_n(n, -1));
146 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
148 for ( i = 0; i < get_irn_arity(n); ++i) {
149 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
150 dump_node_opcode(F, get_irn_n(n, i));
151 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
155 fprintf(F, " Private Attributes:\n");
158 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
160 #ifdef INTERPROCEDURAL_VIEW
161 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
162 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
163 fprintf(F, " inter pred nodes:\n");
164 for (i = 0; i < get_irn_inter_arity(n); ++i) {
165 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
166 dump_node_opcode(F, get_irn_inter_n(n, i));
167 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
172 if (is_fragile_op(n)) {
173 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
174 /* not dumped: frag array */
177 /* This is not nice, output it as a marker in the predecessor list. */
179 get_irn_op(n) == op_Phi ||
180 (is_Filter(n) && get_interprocedural_view())) {
181 fprintf(F, " backedges:");
183 for (i = 0; i < get_irn_arity(n); i++)
184 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
188 /* Loop node. Someone else please tell me what's wrong ... */
189 if (get_irg_loopinfo_state(irg) & loopinfo_valid) {
190 ir_loop *loop = get_irn_loop(n);
192 fprintf(F, " in loop %d with depth %d\n",
193 get_loop_loop_nr(loop), get_loop_depth(loop));
198 switch (get_irn_opcode(n)) {
200 if (has_Block_entity(n))
201 fprintf(F, " Label: %lu\n", get_entity_label(get_Block_entity(n)));
202 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
203 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
204 fprintf(F, " block marked: %u\n", get_Block_mark(n));
205 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
206 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
207 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
208 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
211 fprintf(F, " Execution frequency statistics:\n");
212 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
213 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
214 #ifdef INTERPROCEDURAL_VIEW
215 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
216 fprintf(F, " call frequency of procedure: %8.2lf\n",
217 get_irg_method_execution_frequency(get_irn_irg(n)));
218 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
219 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
220 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
221 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
222 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
223 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
226 /* not dumped: graph_arr */
227 /* not dumped: mature */
230 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
231 ir_fprintf(F, " start of method of type %+F\n", tp);
232 for (i = 0; i < get_method_n_params(tp); ++i)
233 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
234 #ifdef INTERPROCEDURAL_VIEW
235 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
236 ir_node *sbl = get_nodes_block(n);
237 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
238 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
239 for (i = 0; i < n_cfgpreds; ++i) {
240 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
241 fprintf(F, " %d: Call %ld in graph %s\n", i,
242 get_irn_node_nr(cfgpred),
243 get_irg_dump_name(get_irn_irg(cfgpred)));
249 fprintf(F, " default ProjNr: %ld\n", get_Cond_default_proj(n));
250 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE) {
251 fprintf(F, " jump prediction: %s\n",
252 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
256 ir_fprintf(F, " allocating entity of type: %+F\n", get_Alloc_type(n));
257 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
260 ir_fprintf(F, " freeing entity of type %+F\n", get_Free_type(n));
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 ir_fprintf(F, " of type %+F\n", get_entity_type(ent));
268 ir_fprintf(F, " with owner %+F.\n", get_entity_owner(ent));
271 fprintf(F, " <NULL entity>\n");
276 ir_type *tp = get_Call_type(n);
277 if (get_Call_tail_call(n))
278 fprintf(F, " tail call\n");
279 ir_fprintf(F, " calling method of type %+F\n", tp);
280 if (get_unknown_type() != tp) {
281 for (i = 0; i < get_method_n_params(tp); ++i)
282 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
283 for (i = 0; i < get_method_n_ress(tp); ++i)
284 ir_fprintf(F, " result %d type: %+F\n", i, get_method_res_type(tp, i));
286 if (Call_has_callees(n)) {
287 fprintf(F, " possible callees:\n");
288 for (i = 0; i < get_Call_n_callees(n); i++) {
289 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
293 case iro_CallBegin: {
294 ir_node *call = get_CallBegin_call(n);
295 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
296 if (Call_has_callees(call)) {
297 fprintf(F, " possible callees:\n");
298 for (i = 0; i < get_Call_n_callees(call); i++) {
299 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
304 ir_fprintf(F, " cast to type: %+F\n", get_Cast_type(n));
307 if (!get_interprocedural_view()) {
308 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
309 ir_fprintf(F, " return in method of type %+F\n", tp);
310 for (i = 0; i < get_method_n_ress(tp); ++i) {
311 ir_fprintf(F, " result %d type: %+F\n", i,
312 get_method_res_type(tp, i));
317 assert(get_Const_type(n) != firm_none_type);
318 ir_fprintf(F, " Const of type %+F\n", get_Const_type(n));
321 switch (get_SymConst_kind(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");
402 vrp_info = vrp_get_info(n);
407 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
408 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
409 if (get_irn_typeinfo_type(n) != firm_none_type)
410 ir_fprintf (F, " Analysed type: %s\n", get_irn_typeinfo_type(n));
417 void dump_irnode(ir_node *n)
419 dump_irnode_to_file(stdout, n);
423 void dump_graph_to_file(FILE *F, ir_graph *irg)
425 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
428 void dump_graph(ir_graph *g)
430 dump_graph_to_file(stdout, g);
433 static void dump_node_to_graph_file(ir_node *n, void *env)
435 FILE *F = (FILE *)env;
437 dump_irnode_to_file(F, n);
441 void dump_graph_as_text(ir_graph *irg, const char *suffix)
443 const char *basename = get_irg_dump_name(irg);
446 F = text_open(basename, suffix, "", ".txt");
448 dump_graph_to_file(F, irg);
450 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
455 #ifdef EXTENDED_ACCESS_STATS
456 static int addr_is_alloc(ir_node *acc)
458 ir_node *addr = NULL;
461 addr = get_memop_ptr(acc);
463 assert(is_Call(acc));
464 addr = get_Call_ptr(acc);
467 addr_op = get_irn_opcode(addr);
469 while (addr_op != iro_Alloc) {
472 addr = get_Sel_ptr(addr);
475 addr = get_Cast_op(addr);
478 addr = get_Proj_pred(addr);
493 //assert(0 && "unexpected address node");
496 addr_op = get_irn_opcode(addr);
499 /* In addition, the alloc must be in the same loop. */
504 /** dumps something like:
506 * "prefix" "Name" (x): node1, ... node7,\n
507 * "prefix" node8, ... node15,\n
508 * "prefix" node16, node17\n
510 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
511 int (*get_entity_n_nodes)(firm_kind *ent),
512 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
515 int i, n_nodes = get_entity_n_nodes(k);
518 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
519 for (i = 0; i < n_nodes; ++i) {
521 if (i > 7 && !(i & 7)) { /* line break every eight node. */
522 fprintf(F, ",\n%s ", prefix);
525 fprintf(F, "%s ", comma);
526 rem = opt_dump_analysed_type_info;
527 opt_dump_analysed_type_info = 0;
528 dump_node_label(F, get_entity_node(k, i));
529 opt_dump_analysed_type_info = rem;
535 /** dumps something like:
537 * "prefix" "Name" (x): node1, ... node7,\n
538 * "prefix" node8, ... node15,\n
539 * "prefix" node16, node17\n
541 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
542 int (*get_n_types)(const ir_type *tp),
543 ir_type *(*get_type)(const ir_type *tp, int pos),
546 int i, n_nodes = get_n_types(tp);
549 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
550 for (i = 0; i < n_nodes; ++i) {
551 if (i > 7 && !(i & 7)) { /* line break every eight node. */
552 fprintf(F, ",\n%s ", prefix);
555 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
561 static int need_nl = 1;
566 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
567 const ir_initializer_t *initializer, ir_type *type)
573 fprintf(F, "\n%s ", prefix);
576 switch (get_initializer_kind(initializer)) {
577 case IR_INITIALIZER_NULL:
578 fprintf(F, "\t = <NOT_SET>");
580 case IR_INITIALIZER_TARVAL:
581 tv = get_initializer_tarval_value(initializer);
582 ir_fprintf(F, "\t = <TV>%F", tv);
584 case IR_INITIALIZER_CONST:
585 value = get_initializer_const_value(initializer);
586 fprintf(F, "\t = <CONST>");
587 dump_node_opcode(F, value);
589 case IR_INITIALIZER_COMPOUND:
590 if (is_Array_type(type)) {
591 size_t i, n = get_initializer_compound_n_entries(initializer);
592 ir_type *element_type = get_array_element_type(type);
593 for (i = 0; i < n; ++i) {
594 ir_initializer_t *sub_initializer
595 = get_initializer_compound_value(initializer, i);
598 fprintf(F, "\n%s ", prefix);
601 fprintf(F, "[%d]", (int) i);
602 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
606 assert(is_compound_type(type));
607 n = get_compound_n_members(type);
608 for (i = 0; i < n; ++i) {
609 ir_entity *member = get_compound_member(type, i);
610 ir_type *subtype = get_entity_type(member);
611 ir_initializer_t *sub_initializer;
613 assert(i < get_initializer_compound_n_entries(initializer));
615 = get_initializer_compound_value(initializer, i);
618 fprintf(F, "\n%s ", prefix);
621 ir_fprintf(F, ".%F", member);
622 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
627 panic("invalid ir_initializer kind found");
632 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
634 ir_linkage linkage = get_entity_linkage(entity);
636 if (linkage & IR_LINKAGE_CONSTANT)
637 fprintf(F, " constant");
638 if (linkage & IR_LINKAGE_WEAK)
640 if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
641 fprintf(F, " garbage_collect");
642 if (linkage & IR_LINKAGE_MERGE)
643 fprintf(F, " merge");
644 if (linkage & IR_LINKAGE_HIDDEN_USER)
645 fprintf(F, " hidden_user");
648 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity)
651 ir_type *owner, *type;
653 assert(is_entity(ent));
654 owner = get_entity_owner(ent);
655 type = get_entity_type(ent);
656 if (verbosity & dump_verbosity_onlynames) {
657 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
658 get_entity_name(ent), get_entity_nr(ent));
662 if (verbosity & dump_verbosity_entattrs) {
663 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
664 ir_fprintf(F, "%s type: %+F\n", prefix, type);
665 ir_fprintf(F, "%s owner: %+F\n", prefix, owner);
667 if (is_Class_type(get_entity_owner(ent))) {
668 if (get_entity_n_overwrites(ent) > 0) {
669 fprintf(F, "%s overwrites:\n", prefix);
670 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
671 ir_entity *ov = get_entity_overwrites(ent, i);
672 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
673 get_entity_name(ov), get_entity_owner(ov));
676 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
678 if (get_entity_n_overwrittenby(ent) > 0) {
679 fprintf(F, "%s overwritten by:\n", prefix);
680 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
681 ir_entity *ov = get_entity_overwrittenby(ent, i);
682 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
683 get_entity_name(ov), get_entity_owner(ov));
686 fprintf(F, "%s Is not overwritten by other entities.\n",
690 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
692 fprintf(F, "%s transitive overwrites:\n", prefix);
693 for (ov = get_entity_trans_overwrites_first(ent);
695 ov = get_entity_trans_overwrites_next(ent)) {
696 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
697 get_entity_name(ov), get_entity_owner(ov));
699 fprintf(F, "%s transitive overwritten by:\n", prefix);
700 for (ov = get_entity_trans_overwrittenby_first(ent);
702 ov = get_entity_trans_overwrittenby_next(ent)) {
703 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
704 get_entity_name(ov), get_entity_owner(ov));
709 fprintf(F, "%s linkage:", prefix);
710 dump_entity_linkage(F, ent);
712 if (is_Method_type(get_entity_type(ent))) {
713 unsigned mask = get_entity_additional_properties(ent);
714 unsigned cc = get_method_calling_convention(get_entity_type(ent));
715 ir_graph *irg = get_entity_irg(ent);
718 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
719 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
723 fprintf(F, "\n%s additional prop: ", prefix);
725 if (mask & mtp_property_const) fputs("const_function, ", F);
726 if (mask & mtp_property_pure) fputs("pure_function, ", F);
727 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
728 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
729 if (mask & mtp_property_naked) fputs("naked_function, ", F);
730 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
731 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
732 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
733 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
734 if (mask & mtp_property_private) fputs("private_function, ", F);
735 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
737 fprintf(F, "\n%s calling convention: ", prefix);
738 if (cc & cc_reg_param) fputs("regparam, ", F);
739 if (cc & cc_this_call) fputs("thiscall, ", F);
740 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
741 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
742 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
745 else if (IS_STDCALL(cc))
748 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
749 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
751 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
755 } else { /* no entattrs */
756 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
757 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
758 get_entity_type(ent), get_entity_name(ent));
759 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
761 if (verbosity & dump_verbosity_accessStats) {
762 dump_entity_linkage(F, ent);
767 if (verbosity & dump_verbosity_entconsts) {
768 if (ent->initializer != NULL) {
769 const ir_initializer_t *initializer = get_entity_initializer(ent);
770 fprintf(F, "\n%s Initializers:", prefix);
772 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
773 } else if (entity_has_compound_ent_values(ent)) {
774 fprintf(F, "%s compound values:", prefix);
775 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
776 compound_graph_path *path = get_compound_ent_value_path(ent, i);
777 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
778 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
779 if (get_type_state(type) == layout_fixed)
780 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
781 fprintf(F, "%s", get_entity_name(ent));
782 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
783 ir_entity *node = get_compound_graph_path_node(path, j);
784 fprintf(F, ".%s", get_entity_name(node));
785 if (is_Array_type(get_entity_owner(node)))
786 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
789 dump_node_opcode(F, get_compound_ent_value(ent, i));
795 if (verbosity & dump_verbosity_entattrs) {
796 fprintf(F, "%s linkage:", prefix);
797 dump_entity_linkage(F, ent);
798 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
799 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
800 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
801 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
802 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
803 if (is_Method_type(get_entity_type(ent))) {
804 if (get_entity_irg(ent)) /* can be null */ {
805 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
806 #ifdef INTERPROCEDURAL_VIEW
807 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
808 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
809 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
813 fprintf(F, "\n%s irg = NULL", prefix);
819 if (get_trouts_state()) {
820 fprintf(F, "%s Entity outs:\n", prefix);
821 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
822 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
823 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
824 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
827 if (verbosity & dump_verbosity_accessStats) {
828 #ifdef EXTENDED_ACCESS_STATS
829 int n_acc = get_entity_n_accesses(ent);
833 int max_LA_freq = -1;
834 int max_SA_freq = -1;
840 /* Find maximal 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 max_depth = (depth > max_depth) ? depth : max_depth ;
847 L_freq = XMALLOCNZ(int, 4 * max_depth);
849 S_freq = L_freq + 1*max_depth;
850 LA_freq = L_freq + 2*max_depth;
851 SA_freq = L_freq + 3*max_depth;
853 for (i = 0; i < n_acc; ++i) {
854 ir_node *acc = get_entity_access(ent, i);
855 int depth = get_weighted_loop_depth(acc);
856 assert(depth < max_depth);
857 if (is_Load(acc) || is_Call(acc)) {
859 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
860 if (addr_is_alloc(acc)) {
862 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
864 } else if (is_Store(acc)) {
866 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
867 if (addr_is_alloc(acc)) {
869 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
876 if (max_L_freq >= 0) {
879 fprintf(F, "%s Load Stats", prefix);
880 for (i = 0; i <= max_L_freq; ++i) {
882 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
889 if (max_LA_freq >= 0) {
890 //fprintf(F, "%s LoadA Stats", prefix);
892 for (i = 0; i <= max_LA_freq; ++i) {
894 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
901 if (max_S_freq >= 0) {
904 fprintf(F, "%s Store Stats", prefix);
905 for (i = 0; i <= max_S_freq; ++i) {
907 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
914 if (max_SA_freq >= 0) {
915 //fprintf(F, "%s StoreAStats", prefix);
917 for (i = 0; i <= max_SA_freq; ++i) {
919 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
927 /* free allocated space */
930 if (get_trouts_state() != outs_none) {
931 #ifdef INTERPROCEDURAL_VIEW
932 if (is_Method_type(get_entity_type(ent))) {
933 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
934 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
936 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
937 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
944 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity)
946 dump_entity_to_file_prefix (F, ent, "", verbosity);
950 void dump_entity(ir_entity *ent)
952 dump_entity_to_file(stdout, ent, dump_verbosity_max);
955 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity)
959 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
960 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
961 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
962 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
963 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
964 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
965 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
966 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
968 ir_fprintf(F, "%+F", tp);
969 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
971 switch (get_type_tpop_code(tp)) {
974 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
975 fprintf(F, "\n members:\n");
977 for (i = 0; i < get_class_n_members(tp); ++i) {
978 ir_entity *mem = get_class_member(tp, i);
979 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
980 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
981 if (!(verbosity & dump_verbosity_nostatic)) {
982 dump_entity_to_file_prefix(F, mem, " ", verbosity);
986 if (verbosity & dump_verbosity_typeattrs) {
987 fprintf(F, " supertypes: ");
988 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
989 ir_type *stp = get_class_supertype(tp, i);
990 ir_fprintf(F, "\n %d %+F", i, stp);
992 fprintf(F, "\n subtypes: ");
993 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
994 ir_type *stp = get_class_subtype(tp, i);
995 ir_fprintf(F, "\n %d %+F", i, stp);
998 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1000 fprintf(F, "\n transitive supertypes: ");
1001 for (stp = get_class_trans_supertype_first(tp);
1003 stp = get_class_trans_supertype_next(tp)) {
1004 ir_fprintf(F, "\n %+F", stp);
1006 fprintf(F, "\n transitive subtypes: ");
1007 for (stp = get_class_trans_subtype_first(tp);
1009 stp = get_class_trans_subtype_next(tp)) {
1010 ir_fprintf(F, "\n %+F", stp);
1014 fprintf(F, "\n flags: ");
1015 if (is_class_final(tp))
1016 fprintf(F, "final, ");
1017 if (is_class_interface(tp))
1018 fprintf(F, "interface, ");
1019 if (is_class_abstract(tp))
1020 fprintf(F, "abstract, ");
1027 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1028 for (i = 0; i < get_compound_n_members(tp); ++i) {
1029 ir_entity *mem = get_compound_member(tp, i);
1030 if (verbosity & dump_verbosity_fields) {
1031 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1037 if (verbosity & dump_verbosity_typeattrs) {
1039 ir_type *elem_tp = get_array_element_type(tp);
1041 fprintf(F, "\n array ");
1043 n_dim = get_array_n_dimensions(tp);
1044 for (i = 0; i < n_dim; ++i) {
1045 ir_node *lower, *upper;
1047 lower = get_array_lower_bound(tp, i);
1048 upper = get_array_upper_bound(tp, i);
1052 if (is_Const(lower)) {
1053 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1055 dump_node_opcode(F, lower);
1056 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1059 if (is_Const(upper)) {
1060 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1062 dump_node_opcode(F, upper);
1063 fprintf(F, " %ld]", get_irn_node_nr(upper));
1066 ir_fprintf(F, " of <%+F>", elem_tp);
1068 fprintf(F, "\n order: ");
1069 for (i = 0; i < n_dim; ++i)
1070 fprintf(F, "<%d>", get_array_order(tp, i));
1074 if (verbosity & dump_verbosity_fields) {
1075 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1082 if (verbosity & dump_verbosity_typeattrs) {
1083 ir_type *tt = get_pointer_points_to_type(tp);
1084 ir_fprintf(F, "\n points to %+F\n", tt);
1089 if (verbosity & dump_verbosity_typeattrs) {
1090 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1091 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1092 for (i = 0; i < get_method_n_ress(tp); ++i) {
1093 ir_type *rtp = get_method_res_type(tp, i);
1094 ir_fprintf(F, "\n %+F", rtp);
1097 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1098 for (i = 0; i < get_method_n_params(tp); ++i) {
1099 ir_type *ptp = get_method_param_type(tp, i);
1100 ir_fprintf(F, "\n %+F", ptp);
1102 if (get_method_variadicity(tp)) {
1103 fprintf(F, "\n ...");
1110 if (verbosity & dump_verbosity_typeattrs) {
1111 ir_type *base_tp = get_primitive_base_type(tp);
1112 if (base_tp != NULL)
1113 ir_fprintf(F, "\n base type: %+F", tp);
1124 if (verbosity & dump_verbosity_typeattrs) {
1125 fprintf(F, ": details not implemented\n");
1129 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1130 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1131 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1132 if (is_atomic_type(tp) || is_Method_type(tp))
1133 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1135 if (get_trouts_state()) {
1136 fprintf(F, "\n Type outs:\n");
1137 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1138 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1139 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1140 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1141 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1145 if (verbosity & dump_verbosity_accessStats) {
1147 int n_all = get_type_n_allocs(tp);
1152 /* Find maximal depth */
1153 for (i = 0; i < n_all; ++i) {
1154 ir_node *all = get_type_alloc(tp, i);
1155 int depth = get_weighted_loop_depth(all);
1156 max_depth = (depth > max_depth) ? depth : max_depth ;
1159 freq = XMALLOCNZ(int, max_depth + 1);
1161 for (i = 0; i < n_all; ++i) {
1162 ir_node *all = get_type_alloc(tp, i);
1163 int depth = get_weighted_loop_depth(all);
1164 assert(depth <= max_depth);
1166 max_freq = (depth > max_freq) ? depth : max_freq;
1167 assert(is_Alloc(all));
1170 if (max_freq >= 0) {
1173 fprintf(F, " Alloc Stats");
1174 for (i = 0; i <= max_freq; ++i) {
1175 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1183 #ifdef INTERPROCEDURAL_VIEW
1184 if (get_trouts_state() != outs_none) {
1185 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1186 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1187 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1188 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1189 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1190 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1200 void dump_type(ir_type *tp)
1202 dump_type_to_file (stdout, tp, dump_verbosity_max);
1205 void dump_types_as_text(unsigned verbosity, const char *suffix)
1207 const char *basename;
1209 int i, n_types = get_irp_n_types();
1211 basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1212 F = text_open(basename, suffix, "-types", ".txt");
1214 for (i = 0; i < n_types; ++i) {
1215 ir_type *t = get_irp_type(i);
1217 //if (is_jack_rts_class(t)) continue;
1219 dump_type_to_file(F, t, verbosity);
1225 void dump_globals_as_text(unsigned verbosity, const char *suffix)
1227 const char *basename;
1229 ir_type *g = get_glob_type();
1230 int i, n_mems = get_class_n_members(g);
1232 basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1233 F = text_open (basename, suffix, "-globals", ".txt");
1235 for (i = 0; i < n_mems; ++i) {
1236 ir_entity *e = get_class_member(g, i);
1238 dump_entity_to_file(F, e, verbosity);