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 * File name: ir/ir/irdumptxt.c
23 * Purpose: Write vcg representation of firm to file.
24 * Author: Martin Trapp, Christian Schaefer
25 * Modified by: Goetz Lindenmaier, Hubert Schmidt
28 * Copyright: (c) 1998-2006 Universität Karlsruhe
45 #include "firm_common_t.h"
47 #include "irgraph_t.h"
55 #include "field_temperature.h"
57 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
60 * Just opens a file, mangling a file name.
62 * The file name results from the concatenation of the following parts:
64 * @param basename The basis of the name telling about the content.
65 * @param suffix1 The first suffix.
66 * @param suffix2 The second suffix.
67 * @param suffix3 The third suffix.
69 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
71 int len = strlen(basename), i, j;
72 char *fname; /* filename to put the vcg information in */
74 if (!basename) assert(basename);
75 if (!suffix1) suffix1 = "";
76 if (!suffix2) suffix2 = "";
77 if (!suffix3) suffix3 = ".txt";
79 /* open file for vcg graph */
80 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
83 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
84 if (basename[i] == '/') {
85 fname[j] = '@'; j++; fname[j] = '1'; j++;
86 } else if (basename[i] == '@') {
87 fname[j] = '@'; j++; fname[j] = '2'; j++;
89 fname[j] = basename[i]; j++;
93 strcat(fname, suffix1); /* append file suffix */
94 strcat(fname, suffix2); /* append file suffix */
95 strcat(fname, suffix3); /* append the .txt suffix */
97 F = fopen(fname, "w"); /* open file for writing */
107 /* Write the irnode and all its attributes to the file passed. */
108 int dump_irnode_to_file(FILE *F, ir_node *n) {
113 dump_node_opcode(F, n);
114 fprintf(F, " %ld\n", get_irn_node_nr(n));
116 fprintf(F, " index: %u\n", get_irn_idx(n));
117 if (opt_dump_pointer_values_to_info)
118 fprintf (F, " addr: %p \n", (void *)n);
119 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
120 fprintf (F, " visited: %ld \n", get_irn_visited(n));
121 irg = get_irn_irg(n);
122 if (irg != get_const_code_irg())
123 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
125 if (get_irn_pinned(n) == op_pin_state_floats &&
126 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
127 fprintf(F, " node was pinned in ");
128 dump_node_opcode(F, get_irn_n(n, -1));
129 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
132 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
133 /* show all predecessor nodes */
134 fprintf(F, " pred nodes: \n");
137 dump_node_opcode(F, get_irn_n(n, -1));
138 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
140 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
141 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
142 dump_node_opcode(F, get_irn_intra_n(n, i));
143 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
146 fprintf(F, " Private Attributes:\n");
148 if (get_irn_opcode(n) == iro_Proj)
149 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
151 if ((get_irp_ip_view_state() != ip_view_no)
152 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
153 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
154 fprintf(F, " inter pred nodes: \n");
155 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
156 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
157 dump_node_opcode(F, get_irn_inter_n(n, i));
158 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
162 if (is_fragile_op(n)) {
163 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
164 /* not dumped: frag array */
167 /* This is not nice, output it as a marker in the predecessor list. */
168 if ((get_irn_op(n) == op_Block) ||
169 (get_irn_op(n) == op_Phi) ||
170 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
171 fprintf(F, " backedges:");
173 for (i = 0; i < get_irn_arity(n); i++)
174 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
178 /* Loop node. Someone else please tell me what's wrong ... */
179 if (get_irn_loop(n)) {
180 ir_loop *loop = get_irn_loop(n);
182 fprintf(F, " in loop %d with depth %d\n",
183 get_loop_loop_nr(loop), get_loop_depth(loop));
188 switch (get_irn_opcode(n)) {
190 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
191 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
192 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
193 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
194 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
197 fprintf(F, " Execution freqency statistics:\n");
198 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
199 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
200 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
201 fprintf(F, " call freqency of procedure: %8.2lf\n",
202 get_irg_method_execution_frequency(get_irn_irg(n)));
203 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
204 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
205 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
206 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
207 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
208 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
210 /* not dumped: graph_arr */
211 /* not dumped: mature */
214 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
215 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
216 for (i = 0; i < get_method_n_params(tp); ++i)
217 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
218 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
219 ir_node *sbl = get_nodes_block(n);
220 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
221 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
222 for (i = 0; i < n_cfgpreds; ++i) {
223 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
224 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
225 get_irg_dump_name(get_irn_irg(cfgpred)));
230 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
231 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
232 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
233 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
236 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
237 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
240 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
241 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
244 ir_entity *ent = get_Sel_entity(n);
246 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
247 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
248 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
251 fprintf(F, " <NULL entity>\n");
256 ir_type *tp = get_Call_type(n);
257 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
258 if(get_unknown_type() != tp) {
259 for (i = 0; i < get_method_n_params(tp); ++i)
260 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
261 for (i = 0; i < get_method_n_ress(tp); ++i)
262 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
264 if (Call_has_callees(n)) {
265 fprintf(F, " possible callees: \n");
266 for (i = 0; i < get_Call_n_callees(n); i++) {
267 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
271 case iro_CallBegin: {
272 ir_node *call = get_CallBegin_call(n);
273 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
274 if (Call_has_callees(call)) {
275 fprintf(F, " possible callees: \n");
276 for (i = 0; i < get_Call_n_callees(call); i++) {
277 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
282 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
285 if (!get_interprocedural_view()) {
286 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
287 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
288 for (i = 0; i < get_method_n_ress(tp); ++i)
289 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
293 ir_type *tp = get_Const_type(n);
294 assert(tp != firm_none_type);
295 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
298 switch(get_SymConst_kind(n)) {
299 case symconst_addr_name:
300 fprintf(F, " kind: addr_name\n");
301 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
303 case symconst_addr_ent:
304 fprintf(F, " kind: addr_ent\n");
305 fprintf(F, " entity: ");
306 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
308 case symconst_ofs_ent:
309 fprintf(F, " kind: offset\n");
310 fprintf(F, " entity: ");
311 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
313 case symconst_type_tag:
314 fprintf(F, " kind: type_tag\n");
315 fprintf(F, " type: ");
316 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
318 case symconst_type_size:
319 fprintf(F, " kind: size\n");
320 fprintf(F, " type: ");
321 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
323 case symconst_type_align:
324 fprintf(F, " kind: alignment\n");
325 fprintf(F, " type: ");
326 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
328 case symconst_enum_const:
329 fprintf(F, " kind: enumeration\n");
330 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
333 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
336 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
337 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
340 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
343 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
349 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
350 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
351 if (get_irn_typeinfo_type(n) != firm_none_type)
352 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
359 void dump_irnode(ir_node *n) {
360 dump_irnode_to_file(stdout, n);
364 void dump_graph_to_file(FILE *F, ir_graph *irg) {
365 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
368 void dump_graph(ir_graph *g) {
369 dump_graph_to_file(stdout, g);
372 static void dump_node_to_graph_file(ir_node *n, void *env) {
373 FILE *F = (FILE *)env;
375 dump_irnode_to_file(F, n);
379 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
380 const char *basename = get_irg_dump_name(irg);
383 F = text_open (basename, suffix, "", ".txt");
385 dump_graph_to_file(F, irg);
387 irg_walk_graph (irg, NULL, dump_node_to_graph_file, F);
393 int addr_is_alloc(ir_node *acc) {
394 ir_node *addr = NULL;
397 addr = get_memop_ptr(acc);
399 assert(is_Call(acc));
400 addr = get_Call_ptr(acc);
403 addr_op = get_irn_opcode(addr);
405 while (addr_op != iro_Alloc) {
409 addr = get_Sel_ptr(addr);
412 addr = get_Cast_op(addr);
415 addr = get_Proj_pred(addr);
430 //assert(0 && "unexpected address node");
433 addr_op = get_irn_opcode(addr);
436 /* In addition, the alloc must be in the same loop. */
441 /** dumps something like:
443 * "prefix" "Name" (x): node1, ... node7,\n
444 * "prefix" node8, ... node15,\n
445 * "prefix" node16, node17\n
447 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
448 int (*get_entity_n_nodes)(firm_kind *ent),
449 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
451 int i, n_nodes = get_entity_n_nodes(k);
454 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
455 for (i = 0; i < n_nodes; ++i) {
457 if (i > 7 && !(i & 7)) { /* line break every eight node. */
458 fprintf(F, ",\n%s ", prefix);
461 fprintf(F, "%s ", comma);
462 rem = opt_dump_analysed_type_info;
463 opt_dump_analysed_type_info = 0;
464 dump_node_label(F, get_entity_node(k, i));
465 opt_dump_analysed_type_info = rem;
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_type_list(FILE *F, ir_type *tp, char *prefix,
478 int (*get_n_types)(ir_type *tp),
479 ir_type *(*get_type)(ir_type *tp, int pos),
481 int i, n_nodes = get_n_types(tp);
484 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
485 for (i = 0; i < n_nodes; ++i) {
486 if (i > 7 && !(i & 7)) { /* line break every eight node. */
487 fprintf(F, ",\n%s ", prefix);
490 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
491 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
497 void dump_entity_to_file_prefix (FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
499 ir_type *owner, *type;
501 assert(is_entity(ent));
502 owner = get_entity_owner(ent);
503 type = get_entity_type(ent);
504 if (verbosity & dump_verbosity_onlynames) {
505 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
506 get_entity_name(ent), get_entity_nr(ent));
510 if (verbosity & dump_verbosity_entattrs) {
511 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
512 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
513 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
515 if (is_Class_type(get_entity_owner(ent))) {
516 if (get_entity_n_overwrites(ent) > 0) {
517 fprintf(F, "%s overwrites:\n", prefix);
518 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
519 ir_entity *ov = get_entity_overwrites(ent, i);
520 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
521 get_type_name(get_entity_owner(ov)));
524 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
526 if (get_entity_n_overwrittenby(ent) > 0) {
527 fprintf(F, "%s overwritten by:\n", prefix);
528 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
529 ir_entity *ov = get_entity_overwrittenby(ent, i);
530 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
531 get_type_name(get_entity_owner(ov)));
534 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
537 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
539 fprintf(F, "%s transitive overwrites:\n", prefix);
540 for (ov = get_entity_trans_overwrites_first(ent);
542 ov = get_entity_trans_overwrites_next(ent)) {
543 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
544 get_type_name(get_entity_owner(ov)));
546 fprintf(F, "%s transitive overwritten by:\n", prefix);
547 for (ov = get_entity_trans_overwrittenby_first(ent);
549 ov = get_entity_trans_overwrittenby_next(ent)) {
550 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
551 get_type_name(get_entity_owner(ov)));
556 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
557 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
558 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
560 if (is_Method_type(get_entity_type(ent))) {
561 unsigned mask = get_entity_additional_properties(ent);
562 unsigned cc = get_method_calling_convention(get_entity_type(ent));
563 ir_graph *irg = get_entity_irg(ent);
566 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
567 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
571 fprintf(F, "\n%s additional prop: ", prefix);
573 if (mask & mtp_property_const) fprintf(F, "const_function, ");
574 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
575 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
576 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
577 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
579 fprintf(F, "\n%s calling convention: ", prefix);
580 if (cc & cc_reg_param) fprintf(F, "regparam, ");
581 if (cc & cc_this_call) fprintf(F, "thiscall, ");
584 else if (IS_STDCALL(cc))
585 fprintf(F, "stdcall");
587 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
588 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
590 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
594 } else { /* no entattrs */
595 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
596 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
597 get_type_name(get_entity_type(ent)), get_entity_name(ent));
598 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
600 if (verbosity & dump_verbosity_accessStats) {
601 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
602 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
603 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
608 if (verbosity & dump_verbosity_entconsts) {
609 if (get_entity_variability(ent) != variability_uninitialized) {
610 if (is_atomic_entity(ent)) {
611 fprintf(F, "%s atomic value: ", prefix);
612 dump_node_opcode(F, get_atomic_ent_value(ent));
614 fprintf(F, "%s compound values:", prefix);
615 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
616 compound_graph_path *path = get_compound_ent_value_path(ent, i);
617 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
618 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
619 if (get_type_state(type) == layout_fixed)
620 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
621 fprintf(F, "%s", get_entity_name(ent));
622 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
623 ir_entity *node = get_compound_graph_path_node(path, j);
624 fprintf(F, ".%s", get_entity_name(node));
625 if (is_Array_type(get_entity_owner(node)))
626 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
629 dump_node_opcode(F, get_compound_ent_value(ent, i));
636 if (verbosity & dump_verbosity_entattrs) {
637 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
638 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
639 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
640 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
641 if (is_Method_type(get_entity_type(ent))) {
642 if (get_entity_irg(ent)) /* can be null */ {
643 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
644 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
645 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
646 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
649 fprintf(F, "\n%s irg = NULL", prefix);
655 if (get_trouts_state()) {
656 fprintf(F, "%s Entity outs:\n", prefix);
657 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
658 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
659 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
660 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
663 if (verbosity & dump_verbosity_accessStats) {
665 int n_acc = get_entity_n_accesses(ent);
669 int max_LA_freq = -1;
670 int max_SA_freq = -1;
676 /* Find maximal depth */
677 for (i = 0; i < n_acc; ++i) {
678 ir_node *acc = get_entity_access(ent, i);
679 int depth = get_weighted_loop_depth(acc);
680 max_depth = (depth > max_depth) ? depth : max_depth ;
683 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
685 S_freq = L_freq + 1*max_depth;
686 LA_freq = L_freq + 2*max_depth;
687 SA_freq = L_freq + 3*max_depth;
689 for (i = 0; i < n_acc; ++i) {
690 ir_node *acc = get_entity_access(ent, i);
691 int depth = get_weighted_loop_depth(acc);
692 assert(depth < max_depth);
693 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
695 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
696 if (addr_is_alloc(acc)) {
698 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
700 } else if (get_irn_op(acc) == op_Store) {
702 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
703 if (addr_is_alloc(acc)) {
705 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
712 if (max_L_freq >= 0) {
715 fprintf(F, "%s Load Stats", prefix);
716 for (i = 0; i <= max_L_freq; ++i) {
718 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
725 if (max_LA_freq >= 0) {
726 //fprintf(F, "%s LoadA Stats", prefix);
728 for (i = 0; i <= max_LA_freq; ++i) {
730 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
737 if (max_S_freq >= 0) {
740 fprintf(F, "%s Store Stats", prefix);
741 for (i = 0; i <= max_S_freq; ++i) {
743 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
750 if (max_SA_freq >= 0) {
751 //fprintf(F, "%s StoreAStats", prefix);
753 for (i = 0; i <= max_SA_freq; ++i) {
755 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
763 /* free allocated space */
766 if (get_trouts_state() != outs_none) {
767 if (is_Method_type(get_entity_type(ent))) {
768 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
769 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
771 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
772 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
779 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
780 dump_entity_to_file_prefix (F, ent, "", verbosity);
784 void dump_entity (ir_entity *ent) {
785 dump_entity_to_file(stdout, ent, dump_verbosity_max);
788 void dump_entitycsv_to_file_prefix (FILE *F, ir_entity *ent, char *prefix, unsigned verbosity,
789 int *max_disp, int disp[], const char *comma) {
791 #if 0 /* Outputs loop depth of all occurrences. */
792 int n_acc = get_entity_n_accesses(ent);
795 int max_LA_freq = -1;
796 int max_SA_freq = -1;
801 int i, max_depth = 0;
803 /* Find maximal depth */
804 for (i = 0; i < n_acc; ++i) {
805 ir_node *acc = get_entity_access(ent, i);
806 int depth = get_weighted_loop_depth(acc);
807 max_depth = (depth > max_depth) ? depth : max_depth ;
810 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
812 S_freq = L_freq + 1*max_depth;
813 LA_freq = L_freq + 2*max_depth;
814 SA_freq = L_freq + 3*max_depth;
816 for (i = 0; i < n_acc; ++i) {
817 ir_node *acc = get_entity_access(ent, i);
818 int depth = get_weighted_loop_depth(acc);
819 assert(depth <= max_depth);
820 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
822 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
823 if (addr_is_alloc(acc)) {
825 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
827 if (get_entity_allocation(ent) == allocation_static) {
829 *max_disp = (depth > *max_disp) ? depth : *max_disp;
831 } else if (get_irn_op(acc) == op_Store) {
833 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
834 if (addr_is_alloc(acc)) {
836 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
838 if (get_entity_allocation(ent) == allocation_static) {
846 if (get_entity_allocation(ent) != allocation_static) {
848 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
850 if (max_L_freq >= 0) {
851 fprintf(F, "%s Load", comma);
852 for (i = 0; i <= max_L_freq; ++i) {
853 fprintf(F, "%s %d", comma, L_freq[i]);
856 if (max_S_freq >= 0) {
857 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
858 fprintf(F, "%s Store", comma);
859 for (i = 0; i <= max_S_freq; ++i) {
860 fprintf(F, "%s %d", comma, S_freq[i]);
868 if (get_entity_allocation(ent) != allocation_static) {
869 if (is_Method_type(get_entity_type(ent))) return;
871 /* Output the entity name. */
872 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
874 if (get_trouts_state() != outs_none) {
875 if (is_Method_type(get_entity_type(ent))) {
876 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
877 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
879 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
880 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
888 /* A fast hack to dump a CSV-file. */
889 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
892 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
894 if (verbosity & dump_verbosity_accessStats) {
896 #if 0 /* Outputs loop depth of all occurrences. */
899 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
900 int n_all = get_type_n_allocs(tp);
902 /* Find maximal depth */
903 for (i = 0; i < n_all; ++i) {
904 ir_node *all = get_type_alloc(tp, i);
905 int depth = get_weighted_loop_depth(all);
906 max_depth = (depth > max_depth) ? depth : max_depth ;
909 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
911 disp = freq + max_depth;
913 for (i = 0; i < n_all; ++i) {
914 ir_node *all = get_type_alloc(tp, i);
915 int depth = get_weighted_loop_depth(all);
916 assert(depth <= max_depth);
918 max_freq = (depth > max_freq) ? depth : max_freq;
919 assert(get_irn_op(all) == op_Alloc);
922 fprintf(F, "%s ", get_type_name(tp));
923 fprintf(F, "%s Alloc ", comma);
926 for (i = 0; i <= max_freq; ++i) {
927 fprintf(F, "%s %d", comma, freq[i]);
932 for (i = 0; i < get_class_n_members(tp); ++i) {
933 ir_entity *mem = get_class_member(tp, i);
934 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
935 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
936 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
937 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
943 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
944 for (i = 0; i <= max_disp; ++i) {
945 fprintf(F, "%s %d", comma, disp[i]);
950 /* free allocated space */
954 #define DISP_TAB_SUFFIX "__disp_tab"
955 if (get_trouts_state() != outs_none) {
956 assert(strlen(get_type_name(tp)) < 1024);
957 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
958 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
959 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
962 for (i = 0; i < get_class_n_members(tp); ++i) {
963 ir_entity *mem = get_class_member(tp, i);
964 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
965 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
966 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
967 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
974 void dump_type_to_file (FILE *F, ir_type *tp, dump_verbosity verbosity) {
977 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
978 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
979 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
980 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
981 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
982 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
983 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
984 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
986 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
987 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
989 switch (get_type_tpop_code(tp)) {
992 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
993 fprintf(F, "\n members: \n");
995 for (i = 0; i < get_class_n_members(tp); ++i) {
996 ir_entity *mem = get_class_member(tp, i);
997 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
998 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
999 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1000 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1004 if (verbosity & dump_verbosity_typeattrs) {
1005 fprintf(F, " supertypes: ");
1006 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1007 ir_type *stp = get_class_supertype(tp, i);
1008 fprintf(F, "\n %d %s", i, get_type_name(stp));
1010 fprintf(F, "\n subtypes: ");
1011 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1012 ir_type *stp = get_class_subtype(tp, i);
1013 fprintf(F, "\n %d %s", i, get_type_name(stp));
1016 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1018 fprintf(F, "\n transitive supertypes: ");
1019 for (stp = get_class_trans_supertype_first(tp);
1021 stp = get_class_trans_supertype_next(tp)) {
1022 fprintf(F, "\n %s", get_type_name(stp));
1024 fprintf(F, "\n transitive subtypes: ");
1025 for (stp = get_class_trans_subtype_first(tp);
1027 stp = get_class_trans_subtype_next(tp)) {
1028 fprintf(F, "\n %s", get_type_name(stp));
1032 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1033 fprintf(F, "\n flags: ");
1034 if (is_class_final(tp))
1035 fprintf(F, "final, ");
1036 if (is_class_interface(tp))
1037 fprintf(F, "interface, ");
1038 if (is_class_abstract(tp))
1039 fprintf(F, "abstract, ");
1046 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1047 for (i = 0; i < get_compound_n_members(tp); ++i) {
1048 ir_entity *mem = get_compound_member(tp, i);
1049 if (verbosity & dump_verbosity_fields) {
1050 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1056 if (verbosity & dump_verbosity_typeattrs) {
1058 ir_type *elem_tp = get_array_element_type(tp);
1060 fprintf(F, "\n array ");
1062 n_dim = get_array_n_dimensions(tp);
1063 for (i = 0; i < n_dim; ++i) {
1064 ir_node *lower, *upper;
1066 lower = get_array_lower_bound(tp, i);
1067 upper = get_array_upper_bound(tp, i);
1071 if (get_irn_op(lower) == op_Const)
1072 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1074 dump_node_opcode(F, lower);
1075 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1078 if (get_irn_op(upper) == op_Const)
1079 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1081 dump_node_opcode(F, upper);
1082 fprintf(F, " %ld]", get_irn_node_nr(upper));
1085 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1087 fprintf(F, "\n order: ");
1088 for (i = 0; i < n_dim; ++i)
1089 fprintf(F, "<%d>", get_array_order(tp, i));
1093 if (verbosity & dump_verbosity_fields) {
1094 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1101 if (verbosity & dump_verbosity_typeattrs) {
1102 ir_type *tt = get_pointer_points_to_type(tp);
1103 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1108 if (verbosity & dump_verbosity_typeattrs) {
1109 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1110 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1111 for (i = 0; i < get_method_n_ress(tp); ++i) {
1112 ir_type *rtp = get_method_res_type(tp, i);
1113 fprintf(F, "\n %s", get_type_name(rtp));
1116 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1117 for (i = 0; i < get_method_n_params(tp); ++i) {
1118 ir_type *ptp = get_method_param_type(tp, i);
1119 fprintf(F, "\n %s", get_type_name(ptp));
1121 if (get_method_variadicity(tp)) {
1122 fprintf(F, "\n ...");
1136 if (verbosity & dump_verbosity_typeattrs) {
1137 fprintf(F, ": details not implemented\n");
1141 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1142 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1143 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1144 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1145 if (is_atomic_type(tp) || is_Method_type(tp))
1146 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1148 if (get_trouts_state()) {
1149 fprintf(F, "\n Type outs:\n");
1150 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1151 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1152 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1153 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1154 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1158 if (verbosity & dump_verbosity_accessStats) {
1160 int n_all = get_type_n_allocs(tp);
1165 /* Find maximal depth */
1166 for (i = 0; i < n_all; ++i) {
1167 ir_node *all = get_type_alloc(tp, i);
1168 int depth = get_weighted_loop_depth(all);
1169 max_depth = (depth > max_depth) ? depth : max_depth ;
1172 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1174 for (i = 0; i < n_all; ++i) {
1175 ir_node *all = get_type_alloc(tp, i);
1176 int depth = get_weighted_loop_depth(all);
1177 assert(depth <= max_depth);
1179 max_freq = (depth > max_freq) ? depth : max_freq;
1180 assert(get_irn_op(all) == op_Alloc);
1183 if (max_freq >= 0) {
1186 fprintf(F, " Alloc Stats");
1187 for (i = 0; i <= max_freq; ++i) {
1188 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1196 if (get_trouts_state() != outs_none) {
1197 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1198 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1199 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1200 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1201 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1202 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1211 void dump_type(ir_type *tp) {
1212 dump_type_to_file (stdout, tp, dump_verbosity_max);
1216 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1217 const char *basename;
1218 FILE *F, *CSV = NULL;
1219 int i, n_types = get_irp_n_types();
1221 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1222 F = text_open(basename, suffix, "-types", ".txt");
1224 if (verbosity & dump_verbosity_csv) {
1225 CSV = text_open(basename, suffix, "-types", ".csv");
1226 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1229 for (i = 0; i < n_types; ++i) {
1230 ir_type *t = get_irp_type(i);
1232 //if (is_jack_rts_class(t)) continue;
1234 dump_type_to_file(F, t, verbosity);
1236 dump_typecsv_to_file(CSV, t, verbosity, "");
1241 if (CSV) fclose(CSV);
1245 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1246 const char *basename;
1247 FILE *F, *CSV = NULL;
1248 ir_type *g = get_glob_type();
1249 int i, n_mems = get_class_n_members(g);
1251 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1252 F = text_open (basename, suffix, "-globals", ".txt");
1254 if (verbosity & dump_verbosity_csv) {
1255 CSV = text_open (basename, suffix, "-types", ".csv");
1256 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1259 for (i = 0; i < n_mems; ++i) {
1260 ir_entity *e = get_class_member(g, i);
1262 dump_entity_to_file(F, e, verbosity);
1264 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1269 if (CSV) fclose (CSV);