2 * Copyright (C) 1995-2007 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
41 #include "firm_common_t.h"
43 #include "irgraph_t.h"
51 #include "field_temperature.h"
53 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
56 * Just opens a file, mangling a file name.
58 * The file name results from the concatenation of the following parts:
60 * @param basename The basis of the name telling about the content.
61 * @param suffix1 The first suffix.
62 * @param suffix2 The second suffix.
63 * @param suffix3 The third suffix.
65 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
67 int len = strlen(basename), i, j;
68 char *fname; /* filename to put the vcg information in */
70 if (!basename) assert(basename);
71 if (!suffix1) suffix1 = "";
72 if (!suffix2) suffix2 = "";
73 if (!suffix3) suffix3 = ".txt";
75 /* open file for vcg graph */
76 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
79 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
80 if (basename[i] == '/') {
81 fname[j] = '@'; j++; fname[j] = '1'; j++;
82 } else if (basename[i] == '@') {
83 fname[j] = '@'; j++; fname[j] = '2'; j++;
85 fname[j] = basename[i]; j++;
89 strcat(fname, suffix1); /* append file suffix */
90 strcat(fname, suffix2); /* append file suffix */
91 strcat(fname, suffix3); /* append the .txt suffix */
93 F = fopen(fname, "w"); /* open file for writing */
103 /* Write the irnode and all its attributes to the file passed. */
104 int dump_irnode_to_file(FILE *F, ir_node *n) {
109 dump_node_opcode(F, n);
110 fprintf(F, " %ld\n", get_irn_node_nr(n));
112 fprintf(F, " index: %u\n", get_irn_idx(n));
113 if (opt_dump_pointer_values_to_info)
114 fprintf (F, " addr: %p \n", (void *)n);
115 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
116 fprintf (F, " visited: %ld \n", get_irn_visited(n));
117 irg = get_irn_irg(n);
118 if (irg != get_const_code_irg())
119 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
121 if (get_irn_pinned(n) == op_pin_state_floats &&
122 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
123 fprintf(F, " node was pinned in ");
124 dump_node_opcode(F, get_irn_n(n, -1));
125 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
128 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
129 /* show all predecessor nodes */
130 fprintf(F, " pred nodes: \n");
133 dump_node_opcode(F, get_irn_n(n, -1));
134 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
136 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
137 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
138 dump_node_opcode(F, get_irn_intra_n(n, i));
139 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
142 fprintf(F, " Private Attributes:\n");
144 if (get_irn_opcode(n) == iro_Proj)
145 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
147 if ((get_irp_ip_view_state() != ip_view_no)
148 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
149 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
150 fprintf(F, " inter pred nodes: \n");
151 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
152 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
153 dump_node_opcode(F, get_irn_inter_n(n, i));
154 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
158 if (is_fragile_op(n)) {
159 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
160 /* not dumped: frag array */
163 /* This is not nice, output it as a marker in the predecessor list. */
164 if ((get_irn_op(n) == op_Block) ||
165 (get_irn_op(n) == op_Phi) ||
166 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
167 fprintf(F, " backedges:");
169 for (i = 0; i < get_irn_arity(n); i++)
170 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
174 /* Loop node. Someone else please tell me what's wrong ... */
175 if (get_irn_loop(n)) {
176 ir_loop *loop = get_irn_loop(n);
178 fprintf(F, " in loop %d with depth %d\n",
179 get_loop_loop_nr(loop), get_loop_depth(loop));
183 switch (get_irn_opcode(n)) {
185 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
186 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
187 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
188 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
189 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
192 fprintf(F, " Execution freqency statistics:\n");
193 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
194 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
195 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
196 fprintf(F, " call freqency of procedure: %8.2lf\n",
197 get_irg_method_execution_frequency(get_irn_irg(n)));
198 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
199 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
200 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
201 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
202 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
203 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
204 if (has_Block_label(n))
205 fprintf(F, " Label: %lu\n", get_Block_label(n));
207 /* not dumped: graph_arr */
208 /* not dumped: mature */
211 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
212 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
213 for (i = 0; i < get_method_n_params(tp); ++i)
214 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
215 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
216 ir_node *sbl = get_nodes_block(n);
217 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
218 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
219 for (i = 0; i < n_cfgpreds; ++i) {
220 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
221 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
222 get_irg_dump_name(get_irn_irg(cfgpred)));
227 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
228 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
229 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
230 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
233 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
234 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
237 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
238 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
241 ir_entity *ent = get_Sel_entity(n);
243 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
244 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
245 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
248 fprintf(F, " <NULL entity>\n");
253 ir_type *tp = get_Call_type(n);
254 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
255 if(get_unknown_type() != tp) {
256 for (i = 0; i < get_method_n_params(tp); ++i)
257 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
258 for (i = 0; i < get_method_n_ress(tp); ++i)
259 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
261 if (Call_has_callees(n)) {
262 fprintf(F, " possible callees: \n");
263 for (i = 0; i < get_Call_n_callees(n); i++) {
264 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
268 case iro_CallBegin: {
269 ir_node *call = get_CallBegin_call(n);
270 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
271 if (Call_has_callees(call)) {
272 fprintf(F, " possible callees: \n");
273 for (i = 0; i < get_Call_n_callees(call); i++) {
274 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
279 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
282 if (!get_interprocedural_view()) {
283 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
284 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
285 for (i = 0; i < get_method_n_ress(tp); ++i)
286 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
290 ir_type *tp = get_Const_type(n);
291 assert(tp != firm_none_type);
292 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
295 switch(get_SymConst_kind(n)) {
296 case symconst_addr_name:
297 fprintf(F, " kind: addr_name\n");
298 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
300 case symconst_addr_ent:
301 fprintf(F, " kind: addr_ent\n");
302 fprintf(F, " entity: ");
303 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
305 case symconst_ofs_ent:
306 fprintf(F, " kind: offset\n");
307 fprintf(F, " entity: ");
308 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
310 case symconst_type_tag:
311 fprintf(F, " kind: type_tag\n");
312 fprintf(F, " type: ");
313 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
315 case symconst_type_size:
316 fprintf(F, " kind: size\n");
317 fprintf(F, " type: ");
318 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
320 case symconst_type_align:
321 fprintf(F, " kind: alignment\n");
322 fprintf(F, " type: ");
323 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
325 case symconst_enum_const:
326 fprintf(F, " kind: enumeration\n");
327 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
330 fprintf(F, " kind: label\n");
331 fprintf(F, " label: %lu\n", get_SymConst_label(n));
334 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
337 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
338 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
339 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
342 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
343 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
346 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
349 const ir_asm_constraint *cons;
353 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
354 l = get_ASM_n_input_constraints(n);
356 fprintf(F, "\n inputs: ");
357 cons = get_ASM_input_constraints(n);
358 for (i = 0; i < l; ++i)
359 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
361 l = get_ASM_n_output_constraints(n);
363 fprintf(F, "\n outputs: ");
364 cons = get_ASM_output_constraints(n);
365 for (i = 0; i < l; ++i)
366 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
368 l = get_ASM_n_clobbers(n);
370 fprintf(F, "\n clobber: ");
371 clobber = get_ASM_clobbers(n);
372 for (i = 0; i < l; ++i)
373 fprintf(F, "%s ", get_id_str(clobber[i]));
375 if (get_irn_pinned(n) != op_pin_state_floats)
376 fprintf(F, "\n volatile");
382 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
383 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
384 if (get_irn_typeinfo_type(n) != firm_none_type)
385 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
392 void dump_irnode(ir_node *n) {
393 dump_irnode_to_file(stdout, n);
397 void dump_graph_to_file(FILE *F, ir_graph *irg) {
398 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
401 void dump_graph(ir_graph *g) {
402 dump_graph_to_file(stdout, g);
405 static void dump_node_to_graph_file(ir_node *n, void *env) {
406 FILE *F = (FILE *)env;
408 dump_irnode_to_file(F, n);
412 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
413 const char *basename = get_irg_dump_name(irg);
416 F = text_open(basename, suffix, "", ".txt");
418 dump_graph_to_file(F, irg);
420 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
425 #ifdef EXTENDED_ACCESS_STATS
426 static int addr_is_alloc(ir_node *acc) {
427 ir_node *addr = NULL;
430 addr = get_memop_ptr(acc);
432 assert(is_Call(acc));
433 addr = get_Call_ptr(acc);
436 addr_op = get_irn_opcode(addr);
438 while (addr_op != iro_Alloc) {
441 addr = get_Sel_ptr(addr);
444 addr = get_Cast_op(addr);
447 addr = get_Proj_pred(addr);
462 //assert(0 && "unexpected address node");
465 addr_op = get_irn_opcode(addr);
468 /* In addition, the alloc must be in the same loop. */
473 /** dumps something like:
475 * "prefix" "Name" (x): node1, ... node7,\n
476 * "prefix" node8, ... node15,\n
477 * "prefix" node16, node17\n
479 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
480 int (*get_entity_n_nodes)(firm_kind *ent),
481 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
483 int i, n_nodes = get_entity_n_nodes(k);
486 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
487 for (i = 0; i < n_nodes; ++i) {
489 if (i > 7 && !(i & 7)) { /* line break every eight node. */
490 fprintf(F, ",\n%s ", prefix);
493 fprintf(F, "%s ", comma);
494 rem = opt_dump_analysed_type_info;
495 opt_dump_analysed_type_info = 0;
496 dump_node_label(F, get_entity_node(k, i));
497 opt_dump_analysed_type_info = rem;
503 /** dumps something like:
505 * "prefix" "Name" (x): node1, ... node7,\n
506 * "prefix" node8, ... node15,\n
507 * "prefix" node16, node17\n
509 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
510 int (*get_n_types)(ir_type *tp),
511 ir_type *(*get_type)(ir_type *tp, int pos),
513 int i, n_nodes = get_n_types(tp);
516 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
517 for (i = 0; i < n_nodes; ++i) {
518 if (i > 7 && !(i & 7)) { /* line break every eight node. */
519 fprintf(F, ",\n%s ", prefix);
522 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
523 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
529 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
531 ir_type *owner, *type;
533 assert(is_entity(ent));
534 owner = get_entity_owner(ent);
535 type = get_entity_type(ent);
536 if (verbosity & dump_verbosity_onlynames) {
537 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
538 get_entity_name(ent), get_entity_nr(ent));
542 if (verbosity & dump_verbosity_entattrs) {
543 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
544 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
545 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
547 if (is_Class_type(get_entity_owner(ent))) {
548 if (get_entity_n_overwrites(ent) > 0) {
549 fprintf(F, "%s overwrites:\n", prefix);
550 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
551 ir_entity *ov = get_entity_overwrites(ent, i);
552 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
553 get_type_name(get_entity_owner(ov)));
556 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
558 if (get_entity_n_overwrittenby(ent) > 0) {
559 fprintf(F, "%s overwritten by:\n", prefix);
560 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
561 ir_entity *ov = get_entity_overwrittenby(ent, i);
562 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
563 get_type_name(get_entity_owner(ov)));
566 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
569 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
571 fprintf(F, "%s transitive overwrites:\n", prefix);
572 for (ov = get_entity_trans_overwrites_first(ent);
574 ov = get_entity_trans_overwrites_next(ent)) {
575 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
576 get_type_name(get_entity_owner(ov)));
578 fprintf(F, "%s transitive overwritten by:\n", prefix);
579 for (ov = get_entity_trans_overwrittenby_first(ent);
581 ov = get_entity_trans_overwrittenby_next(ent)) {
582 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
583 get_type_name(get_entity_owner(ov)));
588 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
589 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
590 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
592 if (is_Method_type(get_entity_type(ent))) {
593 unsigned mask = get_entity_additional_properties(ent);
594 unsigned cc = get_method_calling_convention(get_entity_type(ent));
595 ir_graph *irg = get_entity_irg(ent);
598 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
599 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
603 fprintf(F, "\n%s additional prop: ", prefix);
605 if (mask & mtp_property_const) fprintf(F, "const_function, ");
606 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
607 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
608 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
609 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
611 fprintf(F, "\n%s calling convention: ", prefix);
612 if (cc & cc_reg_param) fprintf(F, "regparam, ");
613 if (cc & cc_this_call) fprintf(F, "thiscall, ");
616 else if (IS_STDCALL(cc))
617 fprintf(F, "stdcall");
619 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
620 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
622 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
626 } else { /* no entattrs */
627 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
628 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
629 get_type_name(get_entity_type(ent)), get_entity_name(ent));
630 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
632 if (verbosity & dump_verbosity_accessStats) {
633 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
634 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
635 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
640 if (verbosity & dump_verbosity_entconsts) {
641 if (get_entity_variability(ent) != variability_uninitialized) {
642 if (is_atomic_entity(ent)) {
643 fprintf(F, "%s atomic value: ", prefix);
644 dump_node_opcode(F, get_atomic_ent_value(ent));
646 fprintf(F, "%s compound values:", prefix);
647 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
648 compound_graph_path *path = get_compound_ent_value_path(ent, i);
649 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
650 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
651 if (get_type_state(type) == layout_fixed)
652 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
653 fprintf(F, "%s", get_entity_name(ent));
654 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
655 ir_entity *node = get_compound_graph_path_node(path, j);
656 fprintf(F, ".%s", get_entity_name(node));
657 if (is_Array_type(get_entity_owner(node)))
658 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
661 dump_node_opcode(F, get_compound_ent_value(ent, i));
668 if (verbosity & dump_verbosity_entattrs) {
669 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
670 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
671 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
672 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
673 if (is_Method_type(get_entity_type(ent))) {
674 if (get_entity_irg(ent)) /* can be null */ {
675 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
676 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
677 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
678 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
681 fprintf(F, "\n%s irg = NULL", prefix);
687 if (get_trouts_state()) {
688 fprintf(F, "%s Entity outs:\n", prefix);
689 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
690 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
691 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
692 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
695 if (verbosity & dump_verbosity_accessStats) {
696 #ifdef EXTENDED_ACCESS_STATS
697 int n_acc = get_entity_n_accesses(ent);
701 int max_LA_freq = -1;
702 int max_SA_freq = -1;
708 /* Find maximal depth */
709 for (i = 0; i < n_acc; ++i) {
710 ir_node *acc = get_entity_access(ent, i);
711 int depth = get_weighted_loop_depth(acc);
712 max_depth = (depth > max_depth) ? depth : max_depth ;
715 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
717 S_freq = L_freq + 1*max_depth;
718 LA_freq = L_freq + 2*max_depth;
719 SA_freq = L_freq + 3*max_depth;
721 for (i = 0; i < n_acc; ++i) {
722 ir_node *acc = get_entity_access(ent, i);
723 int depth = get_weighted_loop_depth(acc);
724 assert(depth < max_depth);
725 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
727 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
728 if (addr_is_alloc(acc)) {
730 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
732 } else if (get_irn_op(acc) == op_Store) {
734 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
735 if (addr_is_alloc(acc)) {
737 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
744 if (max_L_freq >= 0) {
747 fprintf(F, "%s Load Stats", prefix);
748 for (i = 0; i <= max_L_freq; ++i) {
750 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
757 if (max_LA_freq >= 0) {
758 //fprintf(F, "%s LoadA Stats", prefix);
760 for (i = 0; i <= max_LA_freq; ++i) {
762 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
769 if (max_S_freq >= 0) {
772 fprintf(F, "%s Store Stats", prefix);
773 for (i = 0; i <= max_S_freq; ++i) {
775 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
782 if (max_SA_freq >= 0) {
783 //fprintf(F, "%s StoreAStats", prefix);
785 for (i = 0; i <= max_SA_freq; ++i) {
787 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
795 /* free allocated space */
798 if (get_trouts_state() != outs_none) {
799 if (is_Method_type(get_entity_type(ent))) {
800 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
801 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
803 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
804 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
810 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
811 dump_entity_to_file_prefix (F, ent, "", verbosity);
815 void dump_entity(ir_entity *ent) {
816 dump_entity_to_file(stdout, ent, dump_verbosity_max);
819 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
820 unsigned verbosity, int *max_disp,
821 int disp[], const char *comma)
827 #if 0 /* Outputs loop depth of all occurrences. */
828 int n_acc = get_entity_n_accesses(ent);
831 int max_LA_freq = -1;
832 int max_SA_freq = -1;
837 int i, max_depth = 0;
839 /* Find maximal depth */
840 for (i = 0; i < n_acc; ++i) {
841 ir_node *acc = get_entity_access(ent, i);
842 int depth = get_weighted_loop_depth(acc);
843 max_depth = (depth > max_depth) ? depth : max_depth ;
846 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
848 S_freq = L_freq + 1*max_depth;
849 LA_freq = L_freq + 2*max_depth;
850 SA_freq = L_freq + 3*max_depth;
852 for (i = 0; i < n_acc; ++i) {
853 ir_node *acc = get_entity_access(ent, i);
854 int depth = get_weighted_loop_depth(acc);
855 assert(depth <= max_depth);
856 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
858 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
859 if (addr_is_alloc(acc)) {
861 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
863 if (get_entity_allocation(ent) == allocation_static) {
865 *max_disp = (depth > *max_disp) ? depth : *max_disp;
867 } else if (get_irn_op(acc) == op_Store) {
869 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
870 if (addr_is_alloc(acc)) {
872 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
874 if (get_entity_allocation(ent) == allocation_static) {
882 if (get_entity_allocation(ent) != allocation_static) {
884 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
886 if (max_L_freq >= 0) {
887 fprintf(F, "%s Load", comma);
888 for (i = 0; i <= max_L_freq; ++i) {
889 fprintf(F, "%s %d", comma, L_freq[i]);
892 if (max_S_freq >= 0) {
893 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
894 fprintf(F, "%s Store", comma);
895 for (i = 0; i <= max_S_freq; ++i) {
896 fprintf(F, "%s %d", comma, S_freq[i]);
904 if (get_entity_allocation(ent) != allocation_static) {
905 if (is_Method_type(get_entity_type(ent))) return;
907 /* Output the entity name. */
908 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
910 if (get_trouts_state() != outs_none) {
911 if (is_Method_type(get_entity_type(ent))) {
912 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
913 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
915 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
916 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
924 /* A fast hack to dump a CSV-file. */
925 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
930 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
932 if (verbosity & dump_verbosity_accessStats) {
935 /* Outputs loop depth of all occurrences. */
938 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
939 int n_all = get_type_n_allocs(tp);
941 /* Find maximal depth */
942 for (i = 0; i < n_all; ++i) {
943 ir_node *all = get_type_alloc(tp, i);
944 int depth = get_weighted_loop_depth(all);
945 max_depth = (depth > max_depth) ? depth : max_depth ;
948 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
950 disp = freq + max_depth;
952 for (i = 0; i < n_all; ++i) {
953 ir_node *all = get_type_alloc(tp, i);
954 int depth = get_weighted_loop_depth(all);
955 assert(depth <= max_depth);
957 max_freq = (depth > max_freq) ? depth : max_freq;
958 assert(get_irn_op(all) == op_Alloc);
961 fprintf(F, "%s ", get_type_name(tp));
962 fprintf(F, "%s Alloc ", comma);
965 for (i = 0; i <= max_freq; ++i) {
966 fprintf(F, "%s %d", comma, freq[i]);
971 for (i = 0; i < get_class_n_members(tp); ++i) {
972 ir_entity *mem = get_class_member(tp, i);
973 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
974 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
975 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
976 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
982 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
983 for (i = 0; i <= max_disp; ++i) {
984 fprintf(F, "%s %d", comma, disp[i]);
989 /* free allocated space */
993 #define DISP_TAB_SUFFIX "__disp_tab"
994 if (get_trouts_state() != outs_none) {
995 assert(strlen(get_type_name(tp)) < 1024);
996 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
997 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
998 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1001 for (i = 0; i < get_class_n_members(tp); ++i) {
1002 ir_entity *mem = get_class_member(tp, i);
1003 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1004 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1005 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1006 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1013 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1016 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1017 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1018 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1019 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1020 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1021 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1022 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1023 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1025 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1026 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1028 switch (get_type_tpop_code(tp)) {
1031 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1032 fprintf(F, "\n members: \n");
1034 for (i = 0; i < get_class_n_members(tp); ++i) {
1035 ir_entity *mem = get_class_member(tp, i);
1036 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1037 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1038 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1039 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1043 if (verbosity & dump_verbosity_typeattrs) {
1044 fprintf(F, " supertypes: ");
1045 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1046 ir_type *stp = get_class_supertype(tp, i);
1047 fprintf(F, "\n %d %s", i, get_type_name(stp));
1049 fprintf(F, "\n subtypes: ");
1050 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1051 ir_type *stp = get_class_subtype(tp, i);
1052 fprintf(F, "\n %d %s", i, get_type_name(stp));
1055 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1057 fprintf(F, "\n transitive supertypes: ");
1058 for (stp = get_class_trans_supertype_first(tp);
1060 stp = get_class_trans_supertype_next(tp)) {
1061 fprintf(F, "\n %s", get_type_name(stp));
1063 fprintf(F, "\n transitive subtypes: ");
1064 for (stp = get_class_trans_subtype_first(tp);
1066 stp = get_class_trans_subtype_next(tp)) {
1067 fprintf(F, "\n %s", get_type_name(stp));
1071 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1072 fprintf(F, "\n flags: ");
1073 if (is_class_final(tp))
1074 fprintf(F, "final, ");
1075 if (is_class_interface(tp))
1076 fprintf(F, "interface, ");
1077 if (is_class_abstract(tp))
1078 fprintf(F, "abstract, ");
1085 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1086 for (i = 0; i < get_compound_n_members(tp); ++i) {
1087 ir_entity *mem = get_compound_member(tp, i);
1088 if (verbosity & dump_verbosity_fields) {
1089 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1095 if (verbosity & dump_verbosity_typeattrs) {
1097 ir_type *elem_tp = get_array_element_type(tp);
1099 fprintf(F, "\n array ");
1101 n_dim = get_array_n_dimensions(tp);
1102 for (i = 0; i < n_dim; ++i) {
1103 ir_node *lower, *upper;
1105 lower = get_array_lower_bound(tp, i);
1106 upper = get_array_upper_bound(tp, i);
1110 if (get_irn_op(lower) == op_Const)
1111 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1113 dump_node_opcode(F, lower);
1114 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1117 if (get_irn_op(upper) == op_Const)
1118 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1120 dump_node_opcode(F, upper);
1121 fprintf(F, " %ld]", get_irn_node_nr(upper));
1124 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1126 fprintf(F, "\n order: ");
1127 for (i = 0; i < n_dim; ++i)
1128 fprintf(F, "<%d>", get_array_order(tp, i));
1132 if (verbosity & dump_verbosity_fields) {
1133 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1140 if (verbosity & dump_verbosity_typeattrs) {
1141 ir_type *tt = get_pointer_points_to_type(tp);
1142 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1147 if (verbosity & dump_verbosity_typeattrs) {
1148 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1149 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1150 for (i = 0; i < get_method_n_ress(tp); ++i) {
1151 ir_type *rtp = get_method_res_type(tp, i);
1152 fprintf(F, "\n %s", get_type_name(rtp));
1155 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1156 for (i = 0; i < get_method_n_params(tp); ++i) {
1157 ir_type *ptp = get_method_param_type(tp, i);
1158 fprintf(F, "\n %s", get_type_name(ptp));
1160 if (get_method_variadicity(tp)) {
1161 fprintf(F, "\n ...");
1168 if (verbosity & dump_verbosity_typeattrs) {
1169 ir_type *base_tp = get_primitive_base_type(tp);
1170 if (base_tp != NULL)
1171 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1183 if (verbosity & dump_verbosity_typeattrs) {
1184 fprintf(F, ": details not implemented\n");
1188 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1189 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1190 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1191 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1192 if (is_atomic_type(tp) || is_Method_type(tp))
1193 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1195 if (get_trouts_state()) {
1196 fprintf(F, "\n Type outs:\n");
1197 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1198 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1199 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1200 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1201 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1205 if (verbosity & dump_verbosity_accessStats) {
1207 int n_all = get_type_n_allocs(tp);
1212 /* Find maximal depth */
1213 for (i = 0; i < n_all; ++i) {
1214 ir_node *all = get_type_alloc(tp, i);
1215 int depth = get_weighted_loop_depth(all);
1216 max_depth = (depth > max_depth) ? depth : max_depth ;
1219 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1221 for (i = 0; i < n_all; ++i) {
1222 ir_node *all = get_type_alloc(tp, i);
1223 int depth = get_weighted_loop_depth(all);
1224 assert(depth <= max_depth);
1226 max_freq = (depth > max_freq) ? depth : max_freq;
1227 assert(get_irn_op(all) == op_Alloc);
1230 if (max_freq >= 0) {
1233 fprintf(F, " Alloc Stats");
1234 for (i = 0; i <= max_freq; ++i) {
1235 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1243 if (get_trouts_state() != outs_none) {
1244 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1245 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1246 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1247 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1248 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1249 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1258 void dump_type(ir_type *tp) {
1259 dump_type_to_file (stdout, tp, dump_verbosity_max);
1263 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1264 const char *basename;
1265 FILE *F, *CSV = NULL;
1266 int i, n_types = get_irp_n_types();
1268 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1269 F = text_open(basename, suffix, "-types", ".txt");
1271 if (verbosity & dump_verbosity_csv) {
1272 CSV = text_open(basename, suffix, "-types", ".csv");
1273 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1276 for (i = 0; i < n_types; ++i) {
1277 ir_type *t = get_irp_type(i);
1279 //if (is_jack_rts_class(t)) continue;
1281 dump_type_to_file(F, t, verbosity);
1283 dump_typecsv_to_file(CSV, t, verbosity, "");
1288 if (CSV) fclose(CSV);
1292 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1293 const char *basename;
1294 FILE *F, *CSV = NULL;
1295 ir_type *g = get_glob_type();
1296 int i, n_mems = get_class_n_members(g);
1298 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1299 F = text_open (basename, suffix, "-globals", ".txt");
1301 if (verbosity & dump_verbosity_csv) {
1302 CSV = text_open (basename, suffix, "-types", ".csv");
1303 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1306 for (i = 0; i < n_mems; ++i) {
1307 ir_entity *e = get_class_member(g, i);
1309 dump_entity_to_file(F, e, verbosity);
1311 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1316 if (CSV) fclose (CSV);