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)));
341 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
344 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
347 const ir_asm_constraint *cons;
351 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
352 l = get_ASM_n_input_constraints(n);
354 fprintf(F, "\n inputs: ");
355 cons = get_ASM_input_constraints(n);
356 for (i = 0; i < l; ++i)
357 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
359 l = get_ASM_n_output_constraints(n);
361 fprintf(F, "\n outputs: ");
362 cons = get_ASM_output_constraints(n);
363 for (i = 0; i < l; ++i)
364 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
366 l = get_ASM_n_clobbers(n);
368 fprintf(F, "\n clobber: ");
369 clobber = get_ASM_clobbers(n);
370 for (i = 0; i < l; ++i)
371 fprintf(F, "%s ", get_id_str(clobber[i]));
373 if (get_irn_pinned(n) != op_pin_state_floats)
374 fprintf(F, "\n volatile");
380 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
381 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
382 if (get_irn_typeinfo_type(n) != firm_none_type)
383 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
390 void dump_irnode(ir_node *n) {
391 dump_irnode_to_file(stdout, n);
395 void dump_graph_to_file(FILE *F, ir_graph *irg) {
396 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
399 void dump_graph(ir_graph *g) {
400 dump_graph_to_file(stdout, g);
403 static void dump_node_to_graph_file(ir_node *n, void *env) {
404 FILE *F = (FILE *)env;
406 dump_irnode_to_file(F, n);
410 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
411 const char *basename = get_irg_dump_name(irg);
414 F = text_open(basename, suffix, "", ".txt");
416 dump_graph_to_file(F, irg);
418 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
423 #ifdef EXTENDED_ACCESS_STATS
424 static int addr_is_alloc(ir_node *acc) {
425 ir_node *addr = NULL;
428 addr = get_memop_ptr(acc);
430 assert(is_Call(acc));
431 addr = get_Call_ptr(acc);
434 addr_op = get_irn_opcode(addr);
436 while (addr_op != iro_Alloc) {
439 addr = get_Sel_ptr(addr);
442 addr = get_Cast_op(addr);
445 addr = get_Proj_pred(addr);
460 //assert(0 && "unexpected address node");
463 addr_op = get_irn_opcode(addr);
466 /* In addition, the alloc must be in the same loop. */
471 /** dumps something like:
473 * "prefix" "Name" (x): node1, ... node7,\n
474 * "prefix" node8, ... node15,\n
475 * "prefix" node16, node17\n
477 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
478 int (*get_entity_n_nodes)(firm_kind *ent),
479 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
481 int i, n_nodes = get_entity_n_nodes(k);
484 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
485 for (i = 0; i < n_nodes; ++i) {
487 if (i > 7 && !(i & 7)) { /* line break every eight node. */
488 fprintf(F, ",\n%s ", prefix);
491 fprintf(F, "%s ", comma);
492 rem = opt_dump_analysed_type_info;
493 opt_dump_analysed_type_info = 0;
494 dump_node_label(F, get_entity_node(k, i));
495 opt_dump_analysed_type_info = rem;
501 /** dumps something like:
503 * "prefix" "Name" (x): node1, ... node7,\n
504 * "prefix" node8, ... node15,\n
505 * "prefix" node16, node17\n
507 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
508 int (*get_n_types)(ir_type *tp),
509 ir_type *(*get_type)(ir_type *tp, int pos),
511 int i, n_nodes = get_n_types(tp);
514 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
515 for (i = 0; i < n_nodes; ++i) {
516 if (i > 7 && !(i & 7)) { /* line break every eight node. */
517 fprintf(F, ",\n%s ", prefix);
520 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
521 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
527 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
529 ir_type *owner, *type;
531 assert(is_entity(ent));
532 owner = get_entity_owner(ent);
533 type = get_entity_type(ent);
534 if (verbosity & dump_verbosity_onlynames) {
535 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
536 get_entity_name(ent), get_entity_nr(ent));
540 if (verbosity & dump_verbosity_entattrs) {
541 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
542 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
543 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
545 if (is_Class_type(get_entity_owner(ent))) {
546 if (get_entity_n_overwrites(ent) > 0) {
547 fprintf(F, "%s overwrites:\n", prefix);
548 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
549 ir_entity *ov = get_entity_overwrites(ent, i);
550 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
551 get_type_name(get_entity_owner(ov)));
554 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
556 if (get_entity_n_overwrittenby(ent) > 0) {
557 fprintf(F, "%s overwritten by:\n", prefix);
558 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
559 ir_entity *ov = get_entity_overwrittenby(ent, i);
560 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
561 get_type_name(get_entity_owner(ov)));
564 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
567 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
569 fprintf(F, "%s transitive overwrites:\n", prefix);
570 for (ov = get_entity_trans_overwrites_first(ent);
572 ov = get_entity_trans_overwrites_next(ent)) {
573 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
574 get_type_name(get_entity_owner(ov)));
576 fprintf(F, "%s transitive overwritten by:\n", prefix);
577 for (ov = get_entity_trans_overwrittenby_first(ent);
579 ov = get_entity_trans_overwrittenby_next(ent)) {
580 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
581 get_type_name(get_entity_owner(ov)));
586 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
587 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
588 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
590 if (is_Method_type(get_entity_type(ent))) {
591 unsigned mask = get_entity_additional_properties(ent);
592 unsigned cc = get_method_calling_convention(get_entity_type(ent));
593 ir_graph *irg = get_entity_irg(ent);
596 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
597 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
601 fprintf(F, "\n%s additional prop: ", prefix);
603 if (mask & mtp_property_const) fprintf(F, "const_function, ");
604 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
605 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
606 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
607 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
609 fprintf(F, "\n%s calling convention: ", prefix);
610 if (cc & cc_reg_param) fprintf(F, "regparam, ");
611 if (cc & cc_this_call) fprintf(F, "thiscall, ");
614 else if (IS_STDCALL(cc))
615 fprintf(F, "stdcall");
617 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
618 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
620 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
624 } else { /* no entattrs */
625 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
626 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
627 get_type_name(get_entity_type(ent)), get_entity_name(ent));
628 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
630 if (verbosity & dump_verbosity_accessStats) {
631 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
632 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
633 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
638 if (verbosity & dump_verbosity_entconsts) {
639 if (get_entity_variability(ent) != variability_uninitialized) {
640 if (is_atomic_entity(ent)) {
641 fprintf(F, "%s atomic value: ", prefix);
642 dump_node_opcode(F, get_atomic_ent_value(ent));
644 fprintf(F, "%s compound values:", prefix);
645 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
646 compound_graph_path *path = get_compound_ent_value_path(ent, i);
647 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
648 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
649 if (get_type_state(type) == layout_fixed)
650 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
651 fprintf(F, "%s", get_entity_name(ent));
652 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
653 ir_entity *node = get_compound_graph_path_node(path, j);
654 fprintf(F, ".%s", get_entity_name(node));
655 if (is_Array_type(get_entity_owner(node)))
656 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
659 dump_node_opcode(F, get_compound_ent_value(ent, i));
666 if (verbosity & dump_verbosity_entattrs) {
667 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
668 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
669 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
670 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
671 if (is_Method_type(get_entity_type(ent))) {
672 if (get_entity_irg(ent)) /* can be null */ {
673 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
674 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
675 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
676 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
679 fprintf(F, "\n%s irg = NULL", prefix);
685 if (get_trouts_state()) {
686 fprintf(F, "%s Entity outs:\n", prefix);
687 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
688 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
689 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
690 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
693 if (verbosity & dump_verbosity_accessStats) {
694 #ifdef EXTENDED_ACCESS_STATS
695 int n_acc = get_entity_n_accesses(ent);
699 int max_LA_freq = -1;
700 int max_SA_freq = -1;
706 /* Find maximal depth */
707 for (i = 0; i < n_acc; ++i) {
708 ir_node *acc = get_entity_access(ent, i);
709 int depth = get_weighted_loop_depth(acc);
710 max_depth = (depth > max_depth) ? depth : max_depth ;
713 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
715 S_freq = L_freq + 1*max_depth;
716 LA_freq = L_freq + 2*max_depth;
717 SA_freq = L_freq + 3*max_depth;
719 for (i = 0; i < n_acc; ++i) {
720 ir_node *acc = get_entity_access(ent, i);
721 int depth = get_weighted_loop_depth(acc);
722 assert(depth < max_depth);
723 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
725 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
726 if (addr_is_alloc(acc)) {
728 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
730 } else if (get_irn_op(acc) == op_Store) {
732 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
733 if (addr_is_alloc(acc)) {
735 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
742 if (max_L_freq >= 0) {
745 fprintf(F, "%s Load Stats", prefix);
746 for (i = 0; i <= max_L_freq; ++i) {
748 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
755 if (max_LA_freq >= 0) {
756 //fprintf(F, "%s LoadA Stats", prefix);
758 for (i = 0; i <= max_LA_freq; ++i) {
760 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
767 if (max_S_freq >= 0) {
770 fprintf(F, "%s Store Stats", prefix);
771 for (i = 0; i <= max_S_freq; ++i) {
773 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
780 if (max_SA_freq >= 0) {
781 //fprintf(F, "%s StoreAStats", prefix);
783 for (i = 0; i <= max_SA_freq; ++i) {
785 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
793 /* free allocated space */
796 if (get_trouts_state() != outs_none) {
797 if (is_Method_type(get_entity_type(ent))) {
798 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
799 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
801 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
802 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
808 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
809 dump_entity_to_file_prefix (F, ent, "", verbosity);
813 void dump_entity(ir_entity *ent) {
814 dump_entity_to_file(stdout, ent, dump_verbosity_max);
817 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
818 unsigned verbosity, int *max_disp,
819 int disp[], const char *comma)
825 #if 0 /* Outputs loop depth of all occurrences. */
826 int n_acc = get_entity_n_accesses(ent);
829 int max_LA_freq = -1;
830 int max_SA_freq = -1;
835 int i, max_depth = 0;
837 /* Find maximal depth */
838 for (i = 0; i < n_acc; ++i) {
839 ir_node *acc = get_entity_access(ent, i);
840 int depth = get_weighted_loop_depth(acc);
841 max_depth = (depth > max_depth) ? depth : max_depth ;
844 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
846 S_freq = L_freq + 1*max_depth;
847 LA_freq = L_freq + 2*max_depth;
848 SA_freq = L_freq + 3*max_depth;
850 for (i = 0; i < n_acc; ++i) {
851 ir_node *acc = get_entity_access(ent, i);
852 int depth = get_weighted_loop_depth(acc);
853 assert(depth <= max_depth);
854 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
856 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
857 if (addr_is_alloc(acc)) {
859 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
861 if (get_entity_allocation(ent) == allocation_static) {
863 *max_disp = (depth > *max_disp) ? depth : *max_disp;
865 } else if (get_irn_op(acc) == op_Store) {
867 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
868 if (addr_is_alloc(acc)) {
870 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
872 if (get_entity_allocation(ent) == allocation_static) {
880 if (get_entity_allocation(ent) != allocation_static) {
882 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
884 if (max_L_freq >= 0) {
885 fprintf(F, "%s Load", comma);
886 for (i = 0; i <= max_L_freq; ++i) {
887 fprintf(F, "%s %d", comma, L_freq[i]);
890 if (max_S_freq >= 0) {
891 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
892 fprintf(F, "%s Store", comma);
893 for (i = 0; i <= max_S_freq; ++i) {
894 fprintf(F, "%s %d", comma, S_freq[i]);
902 if (get_entity_allocation(ent) != allocation_static) {
903 if (is_Method_type(get_entity_type(ent))) return;
905 /* Output the entity name. */
906 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
908 if (get_trouts_state() != outs_none) {
909 if (is_Method_type(get_entity_type(ent))) {
910 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
911 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
913 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
914 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
922 /* A fast hack to dump a CSV-file. */
923 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
928 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
930 if (verbosity & dump_verbosity_accessStats) {
933 /* Outputs loop depth of all occurrences. */
936 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
937 int n_all = get_type_n_allocs(tp);
939 /* Find maximal depth */
940 for (i = 0; i < n_all; ++i) {
941 ir_node *all = get_type_alloc(tp, i);
942 int depth = get_weighted_loop_depth(all);
943 max_depth = (depth > max_depth) ? depth : max_depth ;
946 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
948 disp = freq + max_depth;
950 for (i = 0; i < n_all; ++i) {
951 ir_node *all = get_type_alloc(tp, i);
952 int depth = get_weighted_loop_depth(all);
953 assert(depth <= max_depth);
955 max_freq = (depth > max_freq) ? depth : max_freq;
956 assert(get_irn_op(all) == op_Alloc);
959 fprintf(F, "%s ", get_type_name(tp));
960 fprintf(F, "%s Alloc ", comma);
963 for (i = 0; i <= max_freq; ++i) {
964 fprintf(F, "%s %d", comma, freq[i]);
969 for (i = 0; i < get_class_n_members(tp); ++i) {
970 ir_entity *mem = get_class_member(tp, i);
971 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
972 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
973 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
974 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
980 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
981 for (i = 0; i <= max_disp; ++i) {
982 fprintf(F, "%s %d", comma, disp[i]);
987 /* free allocated space */
991 #define DISP_TAB_SUFFIX "__disp_tab"
992 if (get_trouts_state() != outs_none) {
993 assert(strlen(get_type_name(tp)) < 1024);
994 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
995 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
996 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
999 for (i = 0; i < get_class_n_members(tp); ++i) {
1000 ir_entity *mem = get_class_member(tp, i);
1001 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1002 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1003 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1004 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1011 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1014 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1015 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1016 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1017 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1018 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1019 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1020 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1021 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1023 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1024 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1026 switch (get_type_tpop_code(tp)) {
1029 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1030 fprintf(F, "\n members: \n");
1032 for (i = 0; i < get_class_n_members(tp); ++i) {
1033 ir_entity *mem = get_class_member(tp, i);
1034 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1035 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1036 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1037 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1041 if (verbosity & dump_verbosity_typeattrs) {
1042 fprintf(F, " supertypes: ");
1043 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1044 ir_type *stp = get_class_supertype(tp, i);
1045 fprintf(F, "\n %d %s", i, get_type_name(stp));
1047 fprintf(F, "\n subtypes: ");
1048 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1049 ir_type *stp = get_class_subtype(tp, i);
1050 fprintf(F, "\n %d %s", i, get_type_name(stp));
1053 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1055 fprintf(F, "\n transitive supertypes: ");
1056 for (stp = get_class_trans_supertype_first(tp);
1058 stp = get_class_trans_supertype_next(tp)) {
1059 fprintf(F, "\n %s", get_type_name(stp));
1061 fprintf(F, "\n transitive subtypes: ");
1062 for (stp = get_class_trans_subtype_first(tp);
1064 stp = get_class_trans_subtype_next(tp)) {
1065 fprintf(F, "\n %s", get_type_name(stp));
1069 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1070 fprintf(F, "\n flags: ");
1071 if (is_class_final(tp))
1072 fprintf(F, "final, ");
1073 if (is_class_interface(tp))
1074 fprintf(F, "interface, ");
1075 if (is_class_abstract(tp))
1076 fprintf(F, "abstract, ");
1083 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1084 for (i = 0; i < get_compound_n_members(tp); ++i) {
1085 ir_entity *mem = get_compound_member(tp, i);
1086 if (verbosity & dump_verbosity_fields) {
1087 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1093 if (verbosity & dump_verbosity_typeattrs) {
1095 ir_type *elem_tp = get_array_element_type(tp);
1097 fprintf(F, "\n array ");
1099 n_dim = get_array_n_dimensions(tp);
1100 for (i = 0; i < n_dim; ++i) {
1101 ir_node *lower, *upper;
1103 lower = get_array_lower_bound(tp, i);
1104 upper = get_array_upper_bound(tp, i);
1108 if (get_irn_op(lower) == op_Const)
1109 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1111 dump_node_opcode(F, lower);
1112 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1115 if (get_irn_op(upper) == op_Const)
1116 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1118 dump_node_opcode(F, upper);
1119 fprintf(F, " %ld]", get_irn_node_nr(upper));
1122 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1124 fprintf(F, "\n order: ");
1125 for (i = 0; i < n_dim; ++i)
1126 fprintf(F, "<%d>", get_array_order(tp, i));
1130 if (verbosity & dump_verbosity_fields) {
1131 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1138 if (verbosity & dump_verbosity_typeattrs) {
1139 ir_type *tt = get_pointer_points_to_type(tp);
1140 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1145 if (verbosity & dump_verbosity_typeattrs) {
1146 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1147 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1148 for (i = 0; i < get_method_n_ress(tp); ++i) {
1149 ir_type *rtp = get_method_res_type(tp, i);
1150 fprintf(F, "\n %s", get_type_name(rtp));
1153 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1154 for (i = 0; i < get_method_n_params(tp); ++i) {
1155 ir_type *ptp = get_method_param_type(tp, i);
1156 fprintf(F, "\n %s", get_type_name(ptp));
1158 if (get_method_variadicity(tp)) {
1159 fprintf(F, "\n ...");
1173 if (verbosity & dump_verbosity_typeattrs) {
1174 fprintf(F, ": details not implemented\n");
1178 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1179 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1180 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1181 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1182 if (is_atomic_type(tp) || is_Method_type(tp))
1183 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1185 if (get_trouts_state()) {
1186 fprintf(F, "\n Type outs:\n");
1187 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1188 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1189 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1190 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1191 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1195 if (verbosity & dump_verbosity_accessStats) {
1197 int n_all = get_type_n_allocs(tp);
1202 /* Find maximal depth */
1203 for (i = 0; i < n_all; ++i) {
1204 ir_node *all = get_type_alloc(tp, i);
1205 int depth = get_weighted_loop_depth(all);
1206 max_depth = (depth > max_depth) ? depth : max_depth ;
1209 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1211 for (i = 0; i < n_all; ++i) {
1212 ir_node *all = get_type_alloc(tp, i);
1213 int depth = get_weighted_loop_depth(all);
1214 assert(depth <= max_depth);
1216 max_freq = (depth > max_freq) ? depth : max_freq;
1217 assert(get_irn_op(all) == op_Alloc);
1220 if (max_freq >= 0) {
1223 fprintf(F, " Alloc Stats");
1224 for (i = 0; i <= max_freq; ++i) {
1225 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1233 if (get_trouts_state() != outs_none) {
1234 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1235 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1236 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1237 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1238 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1239 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1248 void dump_type(ir_type *tp) {
1249 dump_type_to_file (stdout, tp, dump_verbosity_max);
1253 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1254 const char *basename;
1255 FILE *F, *CSV = NULL;
1256 int i, n_types = get_irp_n_types();
1258 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1259 F = text_open(basename, suffix, "-types", ".txt");
1261 if (verbosity & dump_verbosity_csv) {
1262 CSV = text_open(basename, suffix, "-types", ".csv");
1263 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1266 for (i = 0; i < n_types; ++i) {
1267 ir_type *t = get_irp_type(i);
1269 //if (is_jack_rts_class(t)) continue;
1271 dump_type_to_file(F, t, verbosity);
1273 dump_typecsv_to_file(CSV, t, verbosity, "");
1278 if (CSV) fclose(CSV);
1282 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1283 const char *basename;
1284 FILE *F, *CSV = NULL;
1285 ir_type *g = get_glob_type();
1286 int i, n_mems = get_class_n_members(g);
1288 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1289 F = text_open (basename, suffix, "-globals", ".txt");
1291 if (verbosity & dump_verbosity_csv) {
1292 CSV = text_open (basename, suffix, "-types", ".csv");
1293 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1296 for (i = 0; i < n_mems; ++i) {
1297 ir_entity *e = get_class_member(g, i);
1299 dump_entity_to_file(F, e, verbosity);
1301 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1306 if (CSV) fclose (CSV);