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));
205 /* not dumped: graph_arr */
206 /* not dumped: mature */
209 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
210 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
211 for (i = 0; i < get_method_n_params(tp); ++i)
212 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
213 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
214 ir_node *sbl = get_nodes_block(n);
215 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
216 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
217 for (i = 0; i < n_cfgpreds; ++i) {
218 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
219 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
220 get_irg_dump_name(get_irn_irg(cfgpred)));
225 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
226 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
227 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
228 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
231 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
232 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
235 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
236 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
239 ir_entity *ent = get_Sel_entity(n);
241 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
242 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
243 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
246 fprintf(F, " <NULL entity>\n");
251 ir_type *tp = get_Call_type(n);
252 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
253 if(get_unknown_type() != tp) {
254 for (i = 0; i < get_method_n_params(tp); ++i)
255 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
256 for (i = 0; i < get_method_n_ress(tp); ++i)
257 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
259 if (Call_has_callees(n)) {
260 fprintf(F, " possible callees: \n");
261 for (i = 0; i < get_Call_n_callees(n); i++) {
262 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
266 case iro_CallBegin: {
267 ir_node *call = get_CallBegin_call(n);
268 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
269 if (Call_has_callees(call)) {
270 fprintf(F, " possible callees: \n");
271 for (i = 0; i < get_Call_n_callees(call); i++) {
272 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
277 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
280 if (!get_interprocedural_view()) {
281 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
282 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
283 for (i = 0; i < get_method_n_ress(tp); ++i)
284 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
288 ir_type *tp = get_Const_type(n);
289 assert(tp != firm_none_type);
290 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
293 switch(get_SymConst_kind(n)) {
294 case symconst_addr_name:
295 fprintf(F, " kind: addr_name\n");
296 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
298 case symconst_addr_ent:
299 fprintf(F, " kind: addr_ent\n");
300 fprintf(F, " entity: ");
301 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
303 case symconst_ofs_ent:
304 fprintf(F, " kind: offset\n");
305 fprintf(F, " entity: ");
306 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
308 case symconst_type_tag:
309 fprintf(F, " kind: type_tag\n");
310 fprintf(F, " type: ");
311 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
313 case symconst_type_size:
314 fprintf(F, " kind: size\n");
315 fprintf(F, " type: ");
316 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
318 case symconst_type_align:
319 fprintf(F, " kind: alignment\n");
320 fprintf(F, " type: ");
321 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
323 case symconst_enum_const:
324 fprintf(F, " kind: enumeration\n");
325 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
328 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
331 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
332 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
335 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
338 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
341 const ir_asm_constraint *cons;
345 fprintf(F, " assembler text: %s", get_ASM_text(n));
346 l = get_ASM_n_input_constraints(n);
348 fprintf(F, "\n inputs: ");
349 cons = get_ASM_input_constraints(n);
350 for (i = 0; i < l; ++i)
351 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
353 l = get_ASM_n_output_constraints(n);
355 fprintf(F, "\n outputs: ");
356 cons = get_ASM_output_constraints(n);
357 for (i = 0; i < l; ++i)
358 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
360 l = get_ASM_n_clobbers(n);
362 fprintf(F, "\n clobber: ");
363 clobber = get_ASM_clobbers(n);
364 for (i = 0; i < l; ++i)
365 fprintf(F, "%s ", get_id_str(clobber[i]));
367 if (get_irn_pinned(n) != op_pin_state_floats)
368 fprintf(F, "\n volatile");
374 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
375 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
376 if (get_irn_typeinfo_type(n) != firm_none_type)
377 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
384 void dump_irnode(ir_node *n) {
385 dump_irnode_to_file(stdout, n);
389 void dump_graph_to_file(FILE *F, ir_graph *irg) {
390 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
393 void dump_graph(ir_graph *g) {
394 dump_graph_to_file(stdout, g);
397 static void dump_node_to_graph_file(ir_node *n, void *env) {
398 FILE *F = (FILE *)env;
400 dump_irnode_to_file(F, n);
404 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
405 const char *basename = get_irg_dump_name(irg);
408 F = text_open(basename, suffix, "", ".txt");
410 dump_graph_to_file(F, irg);
412 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
417 static int addr_is_alloc(ir_node *acc) {
418 ir_node *addr = NULL;
421 addr = get_memop_ptr(acc);
423 assert(is_Call(acc));
424 addr = get_Call_ptr(acc);
427 addr_op = get_irn_opcode(addr);
429 while (addr_op != iro_Alloc) {
432 addr = get_Sel_ptr(addr);
435 addr = get_Cast_op(addr);
438 addr = get_Proj_pred(addr);
453 //assert(0 && "unexpected address node");
456 addr_op = get_irn_opcode(addr);
459 /* In addition, the alloc must be in the same loop. */
463 /** dumps something like:
465 * "prefix" "Name" (x): node1, ... node7,\n
466 * "prefix" node8, ... node15,\n
467 * "prefix" node16, node17\n
469 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
470 int (*get_entity_n_nodes)(firm_kind *ent),
471 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
473 int i, n_nodes = get_entity_n_nodes(k);
476 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
477 for (i = 0; i < n_nodes; ++i) {
479 if (i > 7 && !(i & 7)) { /* line break every eight node. */
480 fprintf(F, ",\n%s ", prefix);
483 fprintf(F, "%s ", comma);
484 rem = opt_dump_analysed_type_info;
485 opt_dump_analysed_type_info = 0;
486 dump_node_label(F, get_entity_node(k, i));
487 opt_dump_analysed_type_info = rem;
493 /** dumps something like:
495 * "prefix" "Name" (x): node1, ... node7,\n
496 * "prefix" node8, ... node15,\n
497 * "prefix" node16, node17\n
499 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
500 int (*get_n_types)(ir_type *tp),
501 ir_type *(*get_type)(ir_type *tp, int pos),
503 int i, n_nodes = get_n_types(tp);
506 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
507 for (i = 0; i < n_nodes; ++i) {
508 if (i > 7 && !(i & 7)) { /* line break every eight node. */
509 fprintf(F, ",\n%s ", prefix);
512 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
513 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
519 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
521 ir_type *owner, *type;
523 assert(is_entity(ent));
524 owner = get_entity_owner(ent);
525 type = get_entity_type(ent);
526 if (verbosity & dump_verbosity_onlynames) {
527 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
528 get_entity_name(ent), get_entity_nr(ent));
532 if (verbosity & dump_verbosity_entattrs) {
533 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
534 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
535 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
537 if (is_Class_type(get_entity_owner(ent))) {
538 if (get_entity_n_overwrites(ent) > 0) {
539 fprintf(F, "%s overwrites:\n", prefix);
540 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
541 ir_entity *ov = get_entity_overwrites(ent, i);
542 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
543 get_type_name(get_entity_owner(ov)));
546 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
548 if (get_entity_n_overwrittenby(ent) > 0) {
549 fprintf(F, "%s overwritten by:\n", prefix);
550 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
551 ir_entity *ov = get_entity_overwrittenby(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 Is not overwritten by other entities. \n", prefix);
559 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
561 fprintf(F, "%s transitive overwrites:\n", prefix);
562 for (ov = get_entity_trans_overwrites_first(ent);
564 ov = get_entity_trans_overwrites_next(ent)) {
565 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
566 get_type_name(get_entity_owner(ov)));
568 fprintf(F, "%s transitive overwritten by:\n", prefix);
569 for (ov = get_entity_trans_overwrittenby_first(ent);
571 ov = get_entity_trans_overwrittenby_next(ent)) {
572 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
573 get_type_name(get_entity_owner(ov)));
578 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
579 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
580 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
582 if (is_Method_type(get_entity_type(ent))) {
583 unsigned mask = get_entity_additional_properties(ent);
584 unsigned cc = get_method_calling_convention(get_entity_type(ent));
585 ir_graph *irg = get_entity_irg(ent);
588 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
589 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
593 fprintf(F, "\n%s additional prop: ", prefix);
595 if (mask & mtp_property_const) fprintf(F, "const_function, ");
596 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
597 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
598 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
599 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
601 fprintf(F, "\n%s calling convention: ", prefix);
602 if (cc & cc_reg_param) fprintf(F, "regparam, ");
603 if (cc & cc_this_call) fprintf(F, "thiscall, ");
606 else if (IS_STDCALL(cc))
607 fprintf(F, "stdcall");
609 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
610 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
612 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
616 } else { /* no entattrs */
617 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
618 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
619 get_type_name(get_entity_type(ent)), get_entity_name(ent));
620 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
622 if (verbosity & dump_verbosity_accessStats) {
623 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
624 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
625 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
630 if (verbosity & dump_verbosity_entconsts) {
631 if (get_entity_variability(ent) != variability_uninitialized) {
632 if (is_atomic_entity(ent)) {
633 fprintf(F, "%s atomic value: ", prefix);
634 dump_node_opcode(F, get_atomic_ent_value(ent));
636 fprintf(F, "%s compound values:", prefix);
637 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
638 compound_graph_path *path = get_compound_ent_value_path(ent, i);
639 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
640 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
641 if (get_type_state(type) == layout_fixed)
642 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
643 fprintf(F, "%s", get_entity_name(ent));
644 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
645 ir_entity *node = get_compound_graph_path_node(path, j);
646 fprintf(F, ".%s", get_entity_name(node));
647 if (is_Array_type(get_entity_owner(node)))
648 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
651 dump_node_opcode(F, get_compound_ent_value(ent, i));
658 if (verbosity & dump_verbosity_entattrs) {
659 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
660 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
661 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
662 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
663 if (is_Method_type(get_entity_type(ent))) {
664 if (get_entity_irg(ent)) /* can be null */ {
665 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
666 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
667 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
668 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
671 fprintf(F, "\n%s irg = NULL", prefix);
677 if (get_trouts_state()) {
678 fprintf(F, "%s Entity outs:\n", prefix);
679 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
680 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
681 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
682 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
685 if (verbosity & dump_verbosity_accessStats) {
687 int n_acc = get_entity_n_accesses(ent);
691 int max_LA_freq = -1;
692 int max_SA_freq = -1;
698 /* Find maximal depth */
699 for (i = 0; i < n_acc; ++i) {
700 ir_node *acc = get_entity_access(ent, i);
701 int depth = get_weighted_loop_depth(acc);
702 max_depth = (depth > max_depth) ? depth : max_depth ;
705 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
707 S_freq = L_freq + 1*max_depth;
708 LA_freq = L_freq + 2*max_depth;
709 SA_freq = L_freq + 3*max_depth;
711 for (i = 0; i < n_acc; ++i) {
712 ir_node *acc = get_entity_access(ent, i);
713 int depth = get_weighted_loop_depth(acc);
714 assert(depth < max_depth);
715 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
717 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
718 if (addr_is_alloc(acc)) {
720 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
722 } else if (get_irn_op(acc) == op_Store) {
724 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
725 if (addr_is_alloc(acc)) {
727 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
734 if (max_L_freq >= 0) {
737 fprintf(F, "%s Load Stats", prefix);
738 for (i = 0; i <= max_L_freq; ++i) {
740 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
747 if (max_LA_freq >= 0) {
748 //fprintf(F, "%s LoadA Stats", prefix);
750 for (i = 0; i <= max_LA_freq; ++i) {
752 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
759 if (max_S_freq >= 0) {
762 fprintf(F, "%s Store Stats", prefix);
763 for (i = 0; i <= max_S_freq; ++i) {
765 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
772 if (max_SA_freq >= 0) {
773 //fprintf(F, "%s StoreAStats", prefix);
775 for (i = 0; i <= max_SA_freq; ++i) {
777 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
785 /* free allocated space */
788 if (get_trouts_state() != outs_none) {
789 if (is_Method_type(get_entity_type(ent))) {
790 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
791 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
793 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
794 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
800 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
801 dump_entity_to_file_prefix (F, ent, "", verbosity);
805 void dump_entity(ir_entity *ent) {
806 dump_entity_to_file(stdout, ent, dump_verbosity_max);
809 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity,
810 int *max_disp, int disp[], const char *comma) {
812 #if 0 /* Outputs loop depth of all occurrences. */
813 int n_acc = get_entity_n_accesses(ent);
816 int max_LA_freq = -1;
817 int max_SA_freq = -1;
822 int i, max_depth = 0;
824 /* Find maximal depth */
825 for (i = 0; i < n_acc; ++i) {
826 ir_node *acc = get_entity_access(ent, i);
827 int depth = get_weighted_loop_depth(acc);
828 max_depth = (depth > max_depth) ? depth : max_depth ;
831 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
833 S_freq = L_freq + 1*max_depth;
834 LA_freq = L_freq + 2*max_depth;
835 SA_freq = L_freq + 3*max_depth;
837 for (i = 0; i < n_acc; ++i) {
838 ir_node *acc = get_entity_access(ent, i);
839 int depth = get_weighted_loop_depth(acc);
840 assert(depth <= max_depth);
841 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
843 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
844 if (addr_is_alloc(acc)) {
846 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
848 if (get_entity_allocation(ent) == allocation_static) {
850 *max_disp = (depth > *max_disp) ? depth : *max_disp;
852 } else if (get_irn_op(acc) == op_Store) {
854 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
855 if (addr_is_alloc(acc)) {
857 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
859 if (get_entity_allocation(ent) == allocation_static) {
867 if (get_entity_allocation(ent) != allocation_static) {
869 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
871 if (max_L_freq >= 0) {
872 fprintf(F, "%s Load", comma);
873 for (i = 0; i <= max_L_freq; ++i) {
874 fprintf(F, "%s %d", comma, L_freq[i]);
877 if (max_S_freq >= 0) {
878 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
879 fprintf(F, "%s Store", comma);
880 for (i = 0; i <= max_S_freq; ++i) {
881 fprintf(F, "%s %d", comma, S_freq[i]);
889 if (get_entity_allocation(ent) != allocation_static) {
890 if (is_Method_type(get_entity_type(ent))) return;
892 /* Output the entity name. */
893 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
895 if (get_trouts_state() != outs_none) {
896 if (is_Method_type(get_entity_type(ent))) {
897 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
898 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
900 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
901 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
909 /* A fast hack to dump a CSV-file. */
910 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
913 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
915 if (verbosity & dump_verbosity_accessStats) {
918 /* Outputs loop depth of all occurrences. */
921 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
922 int n_all = get_type_n_allocs(tp);
924 /* Find maximal depth */
925 for (i = 0; i < n_all; ++i) {
926 ir_node *all = get_type_alloc(tp, i);
927 int depth = get_weighted_loop_depth(all);
928 max_depth = (depth > max_depth) ? depth : max_depth ;
931 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
933 disp = freq + max_depth;
935 for (i = 0; i < n_all; ++i) {
936 ir_node *all = get_type_alloc(tp, i);
937 int depth = get_weighted_loop_depth(all);
938 assert(depth <= max_depth);
940 max_freq = (depth > max_freq) ? depth : max_freq;
941 assert(get_irn_op(all) == op_Alloc);
944 fprintf(F, "%s ", get_type_name(tp));
945 fprintf(F, "%s Alloc ", comma);
948 for (i = 0; i <= max_freq; ++i) {
949 fprintf(F, "%s %d", comma, freq[i]);
954 for (i = 0; i < get_class_n_members(tp); ++i) {
955 ir_entity *mem = get_class_member(tp, i);
956 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
957 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
958 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
959 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
965 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
966 for (i = 0; i <= max_disp; ++i) {
967 fprintf(F, "%s %d", comma, disp[i]);
972 /* free allocated space */
976 #define DISP_TAB_SUFFIX "__disp_tab"
977 if (get_trouts_state() != outs_none) {
978 assert(strlen(get_type_name(tp)) < 1024);
979 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
980 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
981 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
984 for (i = 0; i < get_class_n_members(tp); ++i) {
985 ir_entity *mem = get_class_member(tp, i);
986 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
987 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
988 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
989 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
996 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
999 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1000 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1001 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1002 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1003 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1004 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1005 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1006 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1008 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1009 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1011 switch (get_type_tpop_code(tp)) {
1014 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1015 fprintf(F, "\n members: \n");
1017 for (i = 0; i < get_class_n_members(tp); ++i) {
1018 ir_entity *mem = get_class_member(tp, i);
1019 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1020 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1021 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1022 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1026 if (verbosity & dump_verbosity_typeattrs) {
1027 fprintf(F, " supertypes: ");
1028 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1029 ir_type *stp = get_class_supertype(tp, i);
1030 fprintf(F, "\n %d %s", i, get_type_name(stp));
1032 fprintf(F, "\n subtypes: ");
1033 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1034 ir_type *stp = get_class_subtype(tp, i);
1035 fprintf(F, "\n %d %s", i, get_type_name(stp));
1038 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1040 fprintf(F, "\n transitive supertypes: ");
1041 for (stp = get_class_trans_supertype_first(tp);
1043 stp = get_class_trans_supertype_next(tp)) {
1044 fprintf(F, "\n %s", get_type_name(stp));
1046 fprintf(F, "\n transitive subtypes: ");
1047 for (stp = get_class_trans_subtype_first(tp);
1049 stp = get_class_trans_subtype_next(tp)) {
1050 fprintf(F, "\n %s", get_type_name(stp));
1054 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1055 fprintf(F, "\n flags: ");
1056 if (is_class_final(tp))
1057 fprintf(F, "final, ");
1058 if (is_class_interface(tp))
1059 fprintf(F, "interface, ");
1060 if (is_class_abstract(tp))
1061 fprintf(F, "abstract, ");
1068 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1069 for (i = 0; i < get_compound_n_members(tp); ++i) {
1070 ir_entity *mem = get_compound_member(tp, i);
1071 if (verbosity & dump_verbosity_fields) {
1072 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1078 if (verbosity & dump_verbosity_typeattrs) {
1080 ir_type *elem_tp = get_array_element_type(tp);
1082 fprintf(F, "\n array ");
1084 n_dim = get_array_n_dimensions(tp);
1085 for (i = 0; i < n_dim; ++i) {
1086 ir_node *lower, *upper;
1088 lower = get_array_lower_bound(tp, i);
1089 upper = get_array_upper_bound(tp, i);
1093 if (get_irn_op(lower) == op_Const)
1094 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1096 dump_node_opcode(F, lower);
1097 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1100 if (get_irn_op(upper) == op_Const)
1101 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1103 dump_node_opcode(F, upper);
1104 fprintf(F, " %ld]", get_irn_node_nr(upper));
1107 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1109 fprintf(F, "\n order: ");
1110 for (i = 0; i < n_dim; ++i)
1111 fprintf(F, "<%d>", get_array_order(tp, i));
1115 if (verbosity & dump_verbosity_fields) {
1116 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1123 if (verbosity & dump_verbosity_typeattrs) {
1124 ir_type *tt = get_pointer_points_to_type(tp);
1125 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1130 if (verbosity & dump_verbosity_typeattrs) {
1131 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1132 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1133 for (i = 0; i < get_method_n_ress(tp); ++i) {
1134 ir_type *rtp = get_method_res_type(tp, i);
1135 fprintf(F, "\n %s", get_type_name(rtp));
1138 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1139 for (i = 0; i < get_method_n_params(tp); ++i) {
1140 ir_type *ptp = get_method_param_type(tp, i);
1141 fprintf(F, "\n %s", get_type_name(ptp));
1143 if (get_method_variadicity(tp)) {
1144 fprintf(F, "\n ...");
1158 if (verbosity & dump_verbosity_typeattrs) {
1159 fprintf(F, ": details not implemented\n");
1163 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1164 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1165 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1166 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1167 if (is_atomic_type(tp) || is_Method_type(tp))
1168 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1170 if (get_trouts_state()) {
1171 fprintf(F, "\n Type outs:\n");
1172 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1173 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1174 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1175 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1176 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1180 if (verbosity & dump_verbosity_accessStats) {
1182 int n_all = get_type_n_allocs(tp);
1187 /* Find maximal depth */
1188 for (i = 0; i < n_all; ++i) {
1189 ir_node *all = get_type_alloc(tp, i);
1190 int depth = get_weighted_loop_depth(all);
1191 max_depth = (depth > max_depth) ? depth : max_depth ;
1194 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1196 for (i = 0; i < n_all; ++i) {
1197 ir_node *all = get_type_alloc(tp, i);
1198 int depth = get_weighted_loop_depth(all);
1199 assert(depth <= max_depth);
1201 max_freq = (depth > max_freq) ? depth : max_freq;
1202 assert(get_irn_op(all) == op_Alloc);
1205 if (max_freq >= 0) {
1208 fprintf(F, " Alloc Stats");
1209 for (i = 0; i <= max_freq; ++i) {
1210 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1218 if (get_trouts_state() != outs_none) {
1219 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1220 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1221 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1222 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1223 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1224 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1233 void dump_type(ir_type *tp) {
1234 dump_type_to_file (stdout, tp, dump_verbosity_max);
1238 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1239 const char *basename;
1240 FILE *F, *CSV = NULL;
1241 int i, n_types = get_irp_n_types();
1243 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1244 F = text_open(basename, suffix, "-types", ".txt");
1246 if (verbosity & dump_verbosity_csv) {
1247 CSV = text_open(basename, suffix, "-types", ".csv");
1248 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1251 for (i = 0; i < n_types; ++i) {
1252 ir_type *t = get_irp_type(i);
1254 //if (is_jack_rts_class(t)) continue;
1256 dump_type_to_file(F, t, verbosity);
1258 dump_typecsv_to_file(CSV, t, verbosity, "");
1263 if (CSV) fclose(CSV);
1267 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1268 const char *basename;
1269 FILE *F, *CSV = NULL;
1270 ir_type *g = get_glob_type();
1271 int i, n_mems = get_class_n_members(g);
1273 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1274 F = text_open (basename, suffix, "-globals", ".txt");
1276 if (verbosity & dump_verbosity_csv) {
1277 CSV = text_open (basename, suffix, "-types", ".csv");
1278 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1281 for (i = 0; i < n_mems; ++i) {
1282 ir_entity *e = get_class_member(g, i);
1284 dump_entity_to_file(F, e, verbosity);
1286 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1291 if (CSV) fclose (CSV);