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)
61 int len = strlen(basename), i, j;
62 char *fname; /* filename to put the vcg information in */
64 if (!basename) assert(basename);
65 if (!suffix1) suffix1 = "";
66 if (!suffix2) suffix2 = "";
67 if (!suffix3) suffix3 = ".txt";
69 /* open file for vcg graph */
70 fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
73 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
74 if (basename[i] == '/') {
75 fname[j] = '@'; j++; fname[j] = '1'; j++;
76 } else if (basename[i] == '@') {
77 fname[j] = '@'; j++; fname[j] = '2'; j++;
79 fname[j] = basename[i]; j++;
83 strcat(fname, suffix1); /* append file suffix */
84 strcat(fname, suffix2); /* append file suffix */
85 strcat(fname, suffix3); /* append the .txt suffix */
87 F = fopen(fname, "w"); /* open file for writing */
97 /* Write the irnode and all its attributes to the file passed. */
98 int dump_irnode_to_file(FILE *F, ir_node *n)
104 dump_node_opcode(F, n);
105 fprintf(F, " %ld\n", get_irn_node_nr(n));
107 fprintf(F, " index: %u\n", get_irn_idx(n));
108 if (opt_dump_pointer_values_to_info)
109 fprintf (F, " addr: %p\n", (void *)n);
110 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
111 fprintf (F, " visited: %ld\n", get_irn_visited(n));
112 irg = get_irn_irg(n);
113 if (irg != get_const_code_irg())
114 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
116 if (get_irn_pinned(n) == op_pin_state_floats &&
117 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
118 fprintf(F, " node was pinned in ");
119 dump_node_opcode(F, get_irn_n(n, -1));
120 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
123 #ifdef INTERPROCEDURAL_VIEW
124 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
125 /* show all predecessor nodes */
126 fprintf(F, " pred nodes:\n");
129 dump_node_opcode(F, get_irn_n(n, -1));
130 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
132 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
133 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
134 dump_node_opcode(F, get_irn_intra_n(n, i));
135 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
138 fprintf(F, " arity: %d\n", get_irn_arity(n));
139 /* show all predecessor nodes */
140 fprintf(F, " pred nodes:\n");
143 dump_node_opcode(F, get_irn_n(n, -1));
144 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
146 for ( i = 0; i < get_irn_arity(n); ++i) {
147 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
148 dump_node_opcode(F, get_irn_n(n, i));
149 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
153 fprintf(F, " Private Attributes:\n");
156 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
158 #ifdef INTERPROCEDURAL_VIEW
159 if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
160 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
161 fprintf(F, " inter pred nodes:\n");
162 for (i = 0; i < get_irn_inter_arity(n); ++i) {
163 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
164 dump_node_opcode(F, get_irn_inter_n(n, i));
165 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
170 if (is_fragile_op(n)) {
171 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
172 /* not dumped: frag array */
175 /* This is not nice, output it as a marker in the predecessor list. */
177 get_irn_op(n) == op_Phi ||
178 (is_Filter(n) && get_interprocedural_view())) {
179 fprintf(F, " backedges:");
181 for (i = 0; i < get_irn_arity(n); i++)
182 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
186 /* Loop node. Someone else please tell me what's wrong ... */
187 if (get_irg_loopinfo_state(irg) & loopinfo_valid) {
188 ir_loop *loop = get_irn_loop(n);
190 fprintf(F, " in loop %d with depth %d\n",
191 get_loop_loop_nr(loop), get_loop_depth(loop));
196 switch (get_irn_opcode(n)) {
198 if (has_Block_entity(n))
199 fprintf(F, " Label: %lu\n", get_entity_label(get_Block_entity(n)));
200 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
201 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
202 fprintf(F, " block marked: %u\n", get_Block_mark(n));
203 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
204 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
205 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
206 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
209 fprintf(F, " Execution frequency statistics:\n");
210 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
211 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
212 #ifdef INTERPROCEDURAL_VIEW
213 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
214 fprintf(F, " call frequency of procedure: %8.2lf\n",
215 get_irg_method_execution_frequency(get_irn_irg(n)));
216 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
217 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
218 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
219 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
220 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
221 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
224 /* not dumped: graph_arr */
225 /* not dumped: mature */
228 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
229 ir_fprintf(F, " start of method of type %+F\n", tp);
230 for (i = 0; i < get_method_n_params(tp); ++i)
231 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
232 #ifdef INTERPROCEDURAL_VIEW
233 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
234 ir_node *sbl = get_nodes_block(n);
235 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
236 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
237 for (i = 0; i < n_cfgpreds; ++i) {
238 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
239 fprintf(F, " %d: Call %ld in graph %s\n", i,
240 get_irn_node_nr(cfgpred),
241 get_irg_dump_name(get_irn_irg(cfgpred)));
247 fprintf(F, " default ProjNr: %ld\n", get_Cond_default_proj(n));
248 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE) {
249 fprintf(F, " jump prediction: %s\n",
250 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
254 ir_fprintf(F, " allocating entity of type: %+F\n", get_Alloc_type(n));
255 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
258 ir_fprintf(F, " freeing entity of type %+F\n", get_Free_type(n));
259 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
262 ir_entity *ent = get_Sel_entity(n);
264 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
265 ir_fprintf(F, " of type %+F\n", get_entity_type(ent));
266 ir_fprintf(F, " with owner %+F.\n", get_entity_owner(ent));
269 fprintf(F, " <NULL entity>\n");
274 ir_type *tp = get_Call_type(n);
275 if (get_Call_tail_call(n))
276 fprintf(F, " tail call\n");
277 ir_fprintf(F, " calling method of type %+F\n", tp);
278 if (get_unknown_type() != tp) {
279 for (i = 0; i < get_method_n_params(tp); ++i)
280 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
281 for (i = 0; i < get_method_n_ress(tp); ++i)
282 ir_fprintf(F, " result %d type: %+F\n", i, get_method_res_type(tp, i));
284 if (Call_has_callees(n)) {
285 fprintf(F, " possible callees:\n");
286 for (i = 0; i < get_Call_n_callees(n); i++) {
287 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
291 case iro_CallBegin: {
292 ir_node *call = get_CallBegin_call(n);
293 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
294 if (Call_has_callees(call)) {
295 fprintf(F, " possible callees:\n");
296 for (i = 0; i < get_Call_n_callees(call); i++) {
297 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
302 ir_fprintf(F, " cast to type: %+F\n", get_Cast_type(n));
305 if (!get_interprocedural_view()) {
306 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
307 ir_fprintf(F, " return in method of type %+F\n", tp);
308 for (i = 0; i < get_method_n_ress(tp); ++i) {
309 ir_fprintf(F, " result %d type: %+F\n", i,
310 get_method_res_type(tp, i));
315 assert(get_Const_type(n) != firm_none_type);
316 ir_fprintf(F, " Const of type %+F\n", get_Const_type(n));
319 switch (get_SymConst_kind(n)) {
320 case symconst_addr_ent:
321 fprintf(F, " kind: addr_ent\n");
322 fprintf(F, " entity: ");
323 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
325 case symconst_ofs_ent:
326 fprintf(F, " kind: offset\n");
327 fprintf(F, " entity: ");
328 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
330 case symconst_type_tag:
331 fprintf(F, " kind: type_tag\n");
332 fprintf(F, " type: ");
333 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
335 case symconst_type_size:
336 fprintf(F, " kind: size\n");
337 fprintf(F, " type: ");
338 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
340 case symconst_type_align:
341 fprintf(F, " kind: alignment\n");
342 fprintf(F, " type: ");
343 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
345 case symconst_enum_const:
346 fprintf(F, " kind: enumeration\n");
347 fprintf(F, " name: %s\n", get_enumeration_const_name(get_SymConst_enum(n)));
350 ir_fprintf(F, " type of value: %+F\n", get_SymConst_value_type(n));
353 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
354 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
355 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
358 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
359 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
362 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
365 const ir_asm_constraint *cons;
369 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
370 l = get_ASM_n_input_constraints(n);
372 fprintf(F, "\n inputs: ");
373 cons = get_ASM_input_constraints(n);
374 for (i = 0; i < l; ++i)
375 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
377 l = get_ASM_n_output_constraints(n);
379 fprintf(F, "\n outputs: ");
380 cons = get_ASM_output_constraints(n);
381 for (i = 0; i < l; ++i)
382 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
384 l = get_ASM_n_clobbers(n);
386 fprintf(F, "\n clobber: ");
387 clobber = get_ASM_clobbers(n);
388 for (i = 0; i < l; ++i)
389 fprintf(F, "%s ", get_id_str(clobber[i]));
391 if (get_irn_pinned(n) != op_pin_state_floats)
392 fprintf(F, "\n volatile");
398 vrp_attr *vrp_info = vrp_get_info(n);
403 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
404 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
405 if (get_irn_typeinfo_type(n) != firm_none_type)
406 ir_fprintf (F, " Analysed type: %s\n", get_irn_typeinfo_type(n));
413 void dump_irnode(ir_node *n)
415 dump_irnode_to_file(stdout, n);
419 void dump_graph_to_file(FILE *F, ir_graph *irg)
421 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
424 void dump_graph(ir_graph *g)
426 dump_graph_to_file(stdout, g);
429 static void dump_node_to_graph_file(ir_node *n, void *env)
431 FILE *F = (FILE *)env;
433 dump_irnode_to_file(F, n);
437 void dump_graph_as_text(ir_graph *irg, const char *suffix)
439 const char *basename = get_irg_dump_name(irg);
442 F = text_open(basename, suffix, "", ".txt");
444 dump_graph_to_file(F, irg);
446 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
451 #ifdef EXTENDED_ACCESS_STATS
452 static int addr_is_alloc(ir_node *acc)
454 ir_node *addr = NULL;
457 addr = get_memop_ptr(acc);
459 assert(is_Call(acc));
460 addr = get_Call_ptr(acc);
463 addr_op = get_irn_opcode(addr);
465 while (addr_op != iro_Alloc) {
468 addr = get_Sel_ptr(addr);
471 addr = get_Cast_op(addr);
474 addr = get_Proj_pred(addr);
489 //assert(0 && "unexpected address node");
492 addr_op = get_irn_opcode(addr);
495 /* In addition, the alloc must be in the same loop. */
500 /** dumps something like:
502 * "prefix" "Name" (x): node1, ... node7,\n
503 * "prefix" node8, ... node15,\n
504 * "prefix" node16, node17\n
506 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
507 int (*get_entity_n_nodes)(firm_kind *ent),
508 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
511 int i, n_nodes = get_entity_n_nodes(k);
514 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
515 for (i = 0; i < n_nodes; ++i) {
517 if (i > 7 && !(i & 7)) { /* line break every eight node. */
518 fprintf(F, ",\n%s ", prefix);
521 fprintf(F, "%s ", comma);
522 rem = opt_dump_analysed_type_info;
523 opt_dump_analysed_type_info = 0;
524 dump_node_label(F, get_entity_node(k, i));
525 opt_dump_analysed_type_info = rem;
531 /** dumps something like:
533 * "prefix" "Name" (x): node1, ... node7,\n
534 * "prefix" node8, ... node15,\n
535 * "prefix" node16, node17\n
537 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
538 int (*get_n_types)(const ir_type *tp),
539 ir_type *(*get_type)(const ir_type *tp, int pos),
542 int i, n_nodes = get_n_types(tp);
545 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
546 for (i = 0; i < n_nodes; ++i) {
547 if (i > 7 && !(i & 7)) { /* line break every eight node. */
548 fprintf(F, ",\n%s ", prefix);
551 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
557 static int need_nl = 1;
562 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
563 const ir_initializer_t *initializer, ir_type *type)
569 fprintf(F, "\n%s ", prefix);
572 switch (get_initializer_kind(initializer)) {
573 case IR_INITIALIZER_NULL:
574 fprintf(F, "\t = <NOT_SET>");
576 case IR_INITIALIZER_TARVAL:
577 tv = get_initializer_tarval_value(initializer);
578 ir_fprintf(F, "\t = <TV>%F", tv);
580 case IR_INITIALIZER_CONST:
581 value = get_initializer_const_value(initializer);
582 fprintf(F, "\t = <CONST>");
583 dump_node_opcode(F, value);
585 case IR_INITIALIZER_COMPOUND:
586 if (is_Array_type(type)) {
587 size_t i, n = get_initializer_compound_n_entries(initializer);
588 ir_type *element_type = get_array_element_type(type);
589 for (i = 0; i < n; ++i) {
590 ir_initializer_t *sub_initializer
591 = get_initializer_compound_value(initializer, i);
594 fprintf(F, "\n%s ", prefix);
597 fprintf(F, "[%d]", (int) i);
598 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
602 assert(is_compound_type(type));
603 n = get_compound_n_members(type);
604 for (i = 0; i < n; ++i) {
605 ir_entity *member = get_compound_member(type, i);
606 ir_type *subtype = get_entity_type(member);
607 ir_initializer_t *sub_initializer;
609 assert(i < get_initializer_compound_n_entries(initializer));
611 = get_initializer_compound_value(initializer, i);
614 fprintf(F, "\n%s ", prefix);
617 ir_fprintf(F, ".%F", member);
618 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
623 panic("invalid ir_initializer kind found");
628 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
630 ir_linkage linkage = get_entity_linkage(entity);
632 if (linkage & IR_LINKAGE_CONSTANT)
633 fprintf(F, " constant");
634 if (linkage & IR_LINKAGE_WEAK)
636 if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
637 fprintf(F, " garbage_collect");
638 if (linkage & IR_LINKAGE_MERGE)
639 fprintf(F, " merge");
640 if (linkage & IR_LINKAGE_HIDDEN_USER)
641 fprintf(F, " hidden_user");
644 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity)
647 ir_type *owner, *type;
649 assert(is_entity(ent));
650 owner = get_entity_owner(ent);
651 type = get_entity_type(ent);
652 if (verbosity & dump_verbosity_onlynames) {
653 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
654 get_entity_name(ent), get_entity_nr(ent));
658 if (verbosity & dump_verbosity_entattrs) {
659 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
660 ir_fprintf(F, "%s type: %+F\n", prefix, type);
661 ir_fprintf(F, "%s owner: %+F\n", prefix, owner);
663 if (is_Class_type(get_entity_owner(ent))) {
664 if (get_entity_n_overwrites(ent) > 0) {
665 fprintf(F, "%s overwrites:\n", prefix);
666 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
667 ir_entity *ov = get_entity_overwrites(ent, i);
668 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
669 get_entity_name(ov), get_entity_owner(ov));
672 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
674 if (get_entity_n_overwrittenby(ent) > 0) {
675 fprintf(F, "%s overwritten by:\n", prefix);
676 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
677 ir_entity *ov = get_entity_overwrittenby(ent, i);
678 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
679 get_entity_name(ov), get_entity_owner(ov));
682 fprintf(F, "%s Is not overwritten by other entities.\n",
686 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
688 fprintf(F, "%s transitive overwrites:\n", prefix);
689 for (ov = get_entity_trans_overwrites_first(ent);
691 ov = get_entity_trans_overwrites_next(ent)) {
692 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
693 get_entity_name(ov), get_entity_owner(ov));
695 fprintf(F, "%s transitive overwritten by:\n", prefix);
696 for (ov = get_entity_trans_overwrittenby_first(ent);
698 ov = get_entity_trans_overwrittenby_next(ent)) {
699 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
700 get_entity_name(ov), get_entity_owner(ov));
705 fprintf(F, "%s linkage:", prefix);
706 dump_entity_linkage(F, ent);
708 if (is_Method_type(get_entity_type(ent))) {
709 unsigned mask = get_entity_additional_properties(ent);
710 unsigned cc = get_method_calling_convention(get_entity_type(ent));
711 ir_graph *irg = get_entity_irg(ent);
714 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
715 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
719 fprintf(F, "\n%s additional prop: ", prefix);
721 if (mask & mtp_property_const) fputs("const_function, ", F);
722 if (mask & mtp_property_pure) fputs("pure_function, ", F);
723 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
724 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
725 if (mask & mtp_property_naked) fputs("naked_function, ", F);
726 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
727 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
728 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
729 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
730 if (mask & mtp_property_private) fputs("private_function, ", F);
731 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
733 fprintf(F, "\n%s calling convention: ", prefix);
734 if (cc & cc_reg_param) fputs("regparam, ", F);
735 if (cc & cc_this_call) fputs("thiscall, ", F);
736 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
737 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
738 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
741 else if (IS_STDCALL(cc))
744 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
745 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
747 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
751 } else { /* no entattrs */
752 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
753 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
754 get_entity_type(ent), get_entity_name(ent));
755 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
757 if (verbosity & dump_verbosity_accessStats) {
758 dump_entity_linkage(F, ent);
763 if (verbosity & dump_verbosity_entconsts) {
764 if (ent->initializer != NULL) {
765 const ir_initializer_t *initializer = get_entity_initializer(ent);
766 fprintf(F, "\n%s Initializers:", prefix);
768 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
769 } else if (entity_has_compound_ent_values(ent)) {
770 fprintf(F, "%s compound values:", prefix);
771 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
772 compound_graph_path *path = get_compound_ent_value_path(ent, i);
773 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
774 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
775 if (get_type_state(type) == layout_fixed)
776 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
777 fprintf(F, "%s", get_entity_name(ent));
778 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
779 ir_entity *node = get_compound_graph_path_node(path, j);
780 fprintf(F, ".%s", get_entity_name(node));
781 if (is_Array_type(get_entity_owner(node)))
782 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
785 dump_node_opcode(F, get_compound_ent_value(ent, i));
791 if (verbosity & dump_verbosity_entattrs) {
792 fprintf(F, "%s linkage:", prefix);
793 dump_entity_linkage(F, ent);
794 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
795 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
796 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
797 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
798 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
799 if (is_Method_type(get_entity_type(ent))) {
800 if (get_entity_irg(ent)) /* can be null */ {
801 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
802 #ifdef INTERPROCEDURAL_VIEW
803 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
804 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
805 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
809 fprintf(F, "\n%s irg = NULL", prefix);
815 if (get_trouts_state()) {
816 fprintf(F, "%s Entity outs:\n", prefix);
817 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
818 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
819 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
820 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
823 if (verbosity & dump_verbosity_accessStats) {
824 #ifdef EXTENDED_ACCESS_STATS
825 int n_acc = get_entity_n_accesses(ent);
829 int max_LA_freq = -1;
830 int max_SA_freq = -1;
836 /* Find maximal depth */
837 for (i = 0; i < n_acc; ++i) {
838 ir_node *acc = get_entity_access(ent, i);
839 int depth = get_weighted_loop_depth(acc);
840 max_depth = (depth > max_depth) ? depth : max_depth ;
843 L_freq = XMALLOCNZ(int, 4 * max_depth);
845 S_freq = L_freq + 1*max_depth;
846 LA_freq = L_freq + 2*max_depth;
847 SA_freq = L_freq + 3*max_depth;
849 for (i = 0; i < n_acc; ++i) {
850 ir_node *acc = get_entity_access(ent, i);
851 int depth = get_weighted_loop_depth(acc);
852 assert(depth < max_depth);
853 if (is_Load(acc) || is_Call(acc)) {
855 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
856 if (addr_is_alloc(acc)) {
858 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
860 } else if (is_Store(acc)) {
862 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
863 if (addr_is_alloc(acc)) {
865 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
872 if (max_L_freq >= 0) {
875 fprintf(F, "%s Load Stats", prefix);
876 for (i = 0; i <= max_L_freq; ++i) {
878 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
885 if (max_LA_freq >= 0) {
886 //fprintf(F, "%s LoadA Stats", prefix);
888 for (i = 0; i <= max_LA_freq; ++i) {
890 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
897 if (max_S_freq >= 0) {
900 fprintf(F, "%s Store Stats", prefix);
901 for (i = 0; i <= max_S_freq; ++i) {
903 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
910 if (max_SA_freq >= 0) {
911 //fprintf(F, "%s StoreAStats", prefix);
913 for (i = 0; i <= max_SA_freq; ++i) {
915 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
923 /* free allocated space */
926 if (get_trouts_state() != outs_none) {
927 #ifdef INTERPROCEDURAL_VIEW
928 if (is_Method_type(get_entity_type(ent))) {
929 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
930 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
932 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
933 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
940 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity)
942 dump_entity_to_file_prefix (F, ent, "", verbosity);
946 void dump_entity(ir_entity *ent)
948 dump_entity_to_file(stdout, ent, dump_verbosity_max);
951 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity)
955 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
956 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
957 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
958 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
959 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
960 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
961 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
962 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
964 ir_fprintf(F, "%+F", tp);
965 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
967 switch (get_type_tpop_code(tp)) {
970 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
971 fprintf(F, "\n members:\n");
973 for (i = 0; i < get_class_n_members(tp); ++i) {
974 ir_entity *mem = get_class_member(tp, i);
975 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
976 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
977 if (!(verbosity & dump_verbosity_nostatic)) {
978 dump_entity_to_file_prefix(F, mem, " ", verbosity);
982 if (verbosity & dump_verbosity_typeattrs) {
983 fprintf(F, " supertypes: ");
984 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
985 ir_type *stp = get_class_supertype(tp, i);
986 ir_fprintf(F, "\n %d %+F", i, stp);
988 fprintf(F, "\n subtypes: ");
989 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
990 ir_type *stp = get_class_subtype(tp, i);
991 ir_fprintf(F, "\n %d %+F", i, stp);
994 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
996 fprintf(F, "\n transitive supertypes: ");
997 for (stp = get_class_trans_supertype_first(tp);
999 stp = get_class_trans_supertype_next(tp)) {
1000 ir_fprintf(F, "\n %+F", stp);
1002 fprintf(F, "\n transitive subtypes: ");
1003 for (stp = get_class_trans_subtype_first(tp);
1005 stp = get_class_trans_subtype_next(tp)) {
1006 ir_fprintf(F, "\n %+F", stp);
1010 fprintf(F, "\n flags: ");
1011 if (is_class_final(tp))
1012 fprintf(F, "final, ");
1013 if (is_class_interface(tp))
1014 fprintf(F, "interface, ");
1015 if (is_class_abstract(tp))
1016 fprintf(F, "abstract, ");
1023 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1024 for (i = 0; i < get_compound_n_members(tp); ++i) {
1025 ir_entity *mem = get_compound_member(tp, i);
1026 if (verbosity & dump_verbosity_fields) {
1027 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1033 if (verbosity & dump_verbosity_typeattrs) {
1035 ir_type *elem_tp = get_array_element_type(tp);
1037 fprintf(F, "\n array ");
1039 n_dim = get_array_n_dimensions(tp);
1040 for (i = 0; i < n_dim; ++i) {
1041 ir_node *lower, *upper;
1043 lower = get_array_lower_bound(tp, i);
1044 upper = get_array_upper_bound(tp, i);
1048 if (is_Const(lower)) {
1049 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1051 dump_node_opcode(F, lower);
1052 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1055 if (is_Const(upper)) {
1056 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1058 dump_node_opcode(F, upper);
1059 fprintf(F, " %ld]", get_irn_node_nr(upper));
1062 ir_fprintf(F, " of <%+F>", elem_tp);
1064 fprintf(F, "\n order: ");
1065 for (i = 0; i < n_dim; ++i)
1066 fprintf(F, "<%d>", get_array_order(tp, i));
1070 if (verbosity & dump_verbosity_fields) {
1071 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1078 if (verbosity & dump_verbosity_typeattrs) {
1079 ir_type *tt = get_pointer_points_to_type(tp);
1080 ir_fprintf(F, "\n points to %+F\n", tt);
1085 if (verbosity & dump_verbosity_typeattrs) {
1086 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1087 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1088 for (i = 0; i < get_method_n_ress(tp); ++i) {
1089 ir_type *rtp = get_method_res_type(tp, i);
1090 ir_fprintf(F, "\n %+F", rtp);
1093 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1094 for (i = 0; i < get_method_n_params(tp); ++i) {
1095 ir_type *ptp = get_method_param_type(tp, i);
1096 ir_fprintf(F, "\n %+F", ptp);
1098 if (get_method_variadicity(tp)) {
1099 fprintf(F, "\n ...");
1106 if (verbosity & dump_verbosity_typeattrs) {
1107 ir_type *base_tp = get_primitive_base_type(tp);
1108 if (base_tp != NULL)
1109 ir_fprintf(F, "\n base type: %+F", tp);
1120 if (verbosity & dump_verbosity_typeattrs) {
1121 fprintf(F, ": details not implemented\n");
1125 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1126 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1127 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1128 if (is_atomic_type(tp) || is_Method_type(tp))
1129 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1131 if (get_trouts_state()) {
1132 fprintf(F, "\n Type outs:\n");
1133 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1134 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1135 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1136 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1137 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1141 if (verbosity & dump_verbosity_accessStats) {
1143 int n_all = get_type_n_allocs(tp);
1148 /* Find maximal depth */
1149 for (i = 0; i < n_all; ++i) {
1150 ir_node *all = get_type_alloc(tp, i);
1151 int depth = get_weighted_loop_depth(all);
1152 max_depth = (depth > max_depth) ? depth : max_depth ;
1155 freq = XMALLOCNZ(int, max_depth + 1);
1157 for (i = 0; i < n_all; ++i) {
1158 ir_node *all = get_type_alloc(tp, i);
1159 int depth = get_weighted_loop_depth(all);
1160 assert(depth <= max_depth);
1162 max_freq = (depth > max_freq) ? depth : max_freq;
1163 assert(is_Alloc(all));
1166 if (max_freq >= 0) {
1169 fprintf(F, " Alloc Stats");
1170 for (i = 0; i <= max_freq; ++i) {
1171 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1179 #ifdef INTERPROCEDURAL_VIEW
1180 if (get_trouts_state() != outs_none) {
1181 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1182 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1183 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1184 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1185 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1186 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1196 void dump_type(ir_type *tp)
1198 dump_type_to_file (stdout, tp, dump_verbosity_max);
1201 void dump_types_as_text(unsigned verbosity, const char *suffix)
1203 const char *basename;
1205 int i, n_types = get_irp_n_types();
1207 basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1208 F = text_open(basename, suffix, "-types", ".txt");
1210 for (i = 0; i < n_types; ++i) {
1211 ir_type *t = get_irp_type(i);
1213 //if (is_jack_rts_class(t)) continue;
1215 dump_type_to_file(F, t, verbosity);
1221 void dump_globals_as_text(unsigned verbosity, const char *suffix)
1223 const char *basename;
1225 ir_type *g = get_glob_type();
1226 int i, n_mems = get_class_n_members(g);
1228 basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1229 F = text_open (basename, suffix, "-globals", ".txt");
1231 for (i = 0; i < n_mems; ++i) {
1232 ir_entity *e = get_class_member(g, i);
1234 dump_entity_to_file(F, e, verbosity);