2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt
40 #include "irgraph_t.h"
42 #include "firm_common_t.h"
52 #include "field_temperature.h"
54 #define MY_SIZE 1024 /* Size of an array that actually should be computed. */
57 * Just opens a file, mangling a file name.
59 * The file name results from the concatenation of the following parts:
61 * @param basename The basis of the name telling about the content.
62 * @param suffix1 The first suffix.
63 * @param suffix2 The second suffix.
64 * @param suffix3 The third suffix.
66 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3) {
68 int len = strlen(basename), i, j;
69 char *fname; /* filename to put the vcg information in */
71 if (!basename) assert(basename);
72 if (!suffix1) suffix1 = "";
73 if (!suffix2) suffix2 = "";
74 if (!suffix3) suffix3 = ".txt";
76 /* open file for vcg graph */
77 fname = xmalloc(strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
80 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
81 if (basename[i] == '/') {
82 fname[j] = '@'; j++; fname[j] = '1'; j++;
83 } else if (basename[i] == '@') {
84 fname[j] = '@'; j++; fname[j] = '2'; j++;
86 fname[j] = basename[i]; j++;
90 strcat(fname, suffix1); /* append file suffix */
91 strcat(fname, suffix2); /* append file suffix */
92 strcat(fname, suffix3); /* append the .txt suffix */
94 F = fopen(fname, "w"); /* open file for writing */
104 /* Write the irnode and all its attributes to the file passed. */
105 int dump_irnode_to_file(FILE *F, ir_node *n) {
110 dump_node_opcode(F, n);
111 fprintf(F, " %ld\n", get_irn_node_nr(n));
113 fprintf(F, " index: %u\n", get_irn_idx(n));
114 if (opt_dump_pointer_values_to_info)
115 fprintf (F, " addr: %p \n", (void *)n);
116 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
117 fprintf (F, " visited: %ld \n", get_irn_visited(n));
118 irg = get_irn_irg(n);
119 if (irg != get_const_code_irg())
120 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
122 if (get_irn_pinned(n) == op_pin_state_floats &&
123 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
124 fprintf(F, " node was pinned in ");
125 dump_node_opcode(F, get_irn_n(n, -1));
126 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
129 #ifdef INTERPROCEDURAL_VIEW
130 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
131 /* show all predecessor nodes */
132 fprintf(F, " pred nodes: \n");
135 dump_node_opcode(F, get_irn_n(n, -1));
136 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
138 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
139 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
140 dump_node_opcode(F, get_irn_intra_n(n, i));
141 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
144 fprintf(F, " arity: %d\n", get_irn_arity(n));
145 /* show all predecessor nodes */
146 fprintf(F, " pred nodes: \n");
149 dump_node_opcode(F, get_irn_n(n, -1));
150 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
152 for ( i = 0; i < get_irn_arity(n); ++i) {
153 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
154 dump_node_opcode(F, get_irn_n(n, i));
155 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
159 fprintf(F, " Private Attributes:\n");
161 if (get_irn_opcode(n) == iro_Proj)
162 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
164 #ifdef INTERPROCEDURAL_VIEW
165 if ((get_irp_ip_view_state() != ip_view_no)
166 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
167 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
168 fprintf(F, " inter pred nodes: \n");
169 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
170 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
171 dump_node_opcode(F, get_irn_inter_n(n, i));
172 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
177 if (is_fragile_op(n)) {
178 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
179 /* not dumped: frag array */
182 /* This is not nice, output it as a marker in the predecessor list. */
183 if ((get_irn_op(n) == op_Block) ||
184 (get_irn_op(n) == op_Phi) ||
185 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
186 fprintf(F, " backedges:");
188 for (i = 0; i < get_irn_arity(n); i++)
189 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
193 /* Loop node. Someone else please tell me what's wrong ... */
194 if (get_irn_loop(n)) {
195 ir_loop *loop = get_irn_loop(n);
197 fprintf(F, " in loop %d with depth %d\n",
198 get_loop_loop_nr(loop), get_loop_depth(loop));
202 switch (get_irn_opcode(n)) {
204 ir_fprintf(F, " macro Block: %+F\n", get_Block_MacroBlock(n));
205 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
206 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
207 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
208 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
209 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
212 fprintf(F, " Execution frequency statistics:\n");
213 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
214 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
215 #ifdef INTERPROCEDURAL_VIEW
216 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
217 fprintf(F, " call frequency of procedure: %8.2lf\n",
218 get_irg_method_execution_frequency(get_irn_irg(n)));
219 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
220 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
221 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
222 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
223 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
224 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
226 if (has_Block_label(n))
227 fprintf(F, " Label: %lu\n", get_Block_label(n));
229 /* not dumped: graph_arr */
230 /* not dumped: mature */
233 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
234 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
235 for (i = 0; i < get_method_n_params(tp); ++i)
236 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
237 #ifdef INTERPROCEDURAL_VIEW
238 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
239 ir_node *sbl = get_nodes_block(n);
240 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
241 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
242 for (i = 0; i < n_cfgpreds; ++i) {
243 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
244 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
245 get_irg_dump_name(get_irn_irg(cfgpred)));
251 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
252 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
253 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
254 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
257 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
258 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
261 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
262 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
265 ir_entity *ent = get_Sel_entity(n);
267 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
268 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
269 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
272 fprintf(F, " <NULL entity>\n");
277 ir_type *tp = get_Call_type(n);
278 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
279 if(get_unknown_type() != tp) {
280 for (i = 0; i < get_method_n_params(tp); ++i)
281 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
282 for (i = 0; i < get_method_n_ress(tp); ++i)
283 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
285 if (Call_has_callees(n)) {
286 fprintf(F, " possible callees: \n");
287 for (i = 0; i < get_Call_n_callees(n); i++) {
288 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
292 case iro_CallBegin: {
293 ir_node *call = get_CallBegin_call(n);
294 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
295 if (Call_has_callees(call)) {
296 fprintf(F, " possible callees: \n");
297 for (i = 0; i < get_Call_n_callees(call); i++) {
298 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
303 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
306 if (!get_interprocedural_view()) {
307 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
308 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
309 for (i = 0; i < get_method_n_ress(tp); ++i)
310 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
314 assert(get_Const_type(n) != firm_none_type);
315 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
318 switch(get_SymConst_kind(n)) {
319 case symconst_addr_name:
320 fprintf(F, " kind: addr_name\n");
321 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
323 case symconst_addr_ent:
324 fprintf(F, " kind: addr_ent\n");
325 fprintf(F, " entity: ");
326 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
328 case symconst_ofs_ent:
329 fprintf(F, " kind: offset\n");
330 fprintf(F, " entity: ");
331 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
333 case symconst_type_tag:
334 fprintf(F, " kind: type_tag\n");
335 fprintf(F, " type: ");
336 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
338 case symconst_type_size:
339 fprintf(F, " kind: size\n");
340 fprintf(F, " type: ");
341 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
343 case symconst_type_align:
344 fprintf(F, " kind: alignment\n");
345 fprintf(F, " type: ");
346 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
348 case symconst_enum_const:
349 fprintf(F, " kind: enumeration\n");
350 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
353 fprintf(F, " kind: label\n");
354 fprintf(F, " label: %lu\n", get_SymConst_label(n));
357 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
360 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
361 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
362 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
365 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
366 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
369 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
372 const ir_asm_constraint *cons;
376 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
377 l = get_ASM_n_input_constraints(n);
379 fprintf(F, "\n inputs: ");
380 cons = get_ASM_input_constraints(n);
381 for (i = 0; i < l; ++i)
382 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
384 l = get_ASM_n_output_constraints(n);
386 fprintf(F, "\n outputs: ");
387 cons = get_ASM_output_constraints(n);
388 for (i = 0; i < l; ++i)
389 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
391 l = get_ASM_n_clobbers(n);
393 fprintf(F, "\n clobber: ");
394 clobber = get_ASM_clobbers(n);
395 for (i = 0; i < l; ++i)
396 fprintf(F, "%s ", get_id_str(clobber[i]));
398 if (get_irn_pinned(n) != op_pin_state_floats)
399 fprintf(F, "\n volatile");
405 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
406 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
407 if (get_irn_typeinfo_type(n) != firm_none_type)
408 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
415 void dump_irnode(ir_node *n) {
416 dump_irnode_to_file(stdout, n);
420 void dump_graph_to_file(FILE *F, ir_graph *irg) {
421 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
424 void dump_graph(ir_graph *g) {
425 dump_graph_to_file(stdout, g);
428 static void dump_node_to_graph_file(ir_node *n, void *env) {
429 FILE *F = (FILE *)env;
431 dump_irnode_to_file(F, n);
435 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
436 const char *basename = get_irg_dump_name(irg);
439 F = text_open(basename, suffix, "", ".txt");
441 dump_graph_to_file(F, irg);
443 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
448 #ifdef EXTENDED_ACCESS_STATS
449 static int addr_is_alloc(ir_node *acc) {
450 ir_node *addr = NULL;
453 addr = get_memop_ptr(acc);
455 assert(is_Call(acc));
456 addr = get_Call_ptr(acc);
459 addr_op = get_irn_opcode(addr);
461 while (addr_op != iro_Alloc) {
464 addr = get_Sel_ptr(addr);
467 addr = get_Cast_op(addr);
470 addr = get_Proj_pred(addr);
485 //assert(0 && "unexpected address node");
488 addr_op = get_irn_opcode(addr);
491 /* In addition, the alloc must be in the same loop. */
496 /** dumps something like:
498 * "prefix" "Name" (x): node1, ... node7,\n
499 * "prefix" node8, ... node15,\n
500 * "prefix" node16, node17\n
502 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
503 int (*get_entity_n_nodes)(firm_kind *ent),
504 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
506 int i, n_nodes = get_entity_n_nodes(k);
509 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
510 for (i = 0; i < n_nodes; ++i) {
512 if (i > 7 && !(i & 7)) { /* line break every eight node. */
513 fprintf(F, ",\n%s ", prefix);
516 fprintf(F, "%s ", comma);
517 rem = opt_dump_analysed_type_info;
518 opt_dump_analysed_type_info = 0;
519 dump_node_label(F, get_entity_node(k, i));
520 opt_dump_analysed_type_info = rem;
526 /** dumps something like:
528 * "prefix" "Name" (x): node1, ... node7,\n
529 * "prefix" node8, ... node15,\n
530 * "prefix" node16, node17\n
532 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
533 int (*get_n_types)(const ir_type *tp),
534 ir_type *(*get_type)(const ir_type *tp, int pos),
536 int i, n_nodes = get_n_types(tp);
539 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
540 for (i = 0; i < n_nodes; ++i) {
541 if (i > 7 && !(i & 7)) { /* line break every eight node. */
542 fprintf(F, ",\n%s ", prefix);
545 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
546 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
552 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
554 ir_type *owner, *type;
556 assert(is_entity(ent));
557 owner = get_entity_owner(ent);
558 type = get_entity_type(ent);
559 if (verbosity & dump_verbosity_onlynames) {
560 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
561 get_entity_name(ent), get_entity_nr(ent));
565 if (verbosity & dump_verbosity_entattrs) {
566 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
567 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
568 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
570 if (is_Class_type(get_entity_owner(ent))) {
571 if (get_entity_n_overwrites(ent) > 0) {
572 fprintf(F, "%s overwrites:\n", prefix);
573 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
574 ir_entity *ov = get_entity_overwrites(ent, i);
575 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
576 get_type_name(get_entity_owner(ov)));
579 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
581 if (get_entity_n_overwrittenby(ent) > 0) {
582 fprintf(F, "%s overwritten by:\n", prefix);
583 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
584 ir_entity *ov = get_entity_overwrittenby(ent, i);
585 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
586 get_type_name(get_entity_owner(ov)));
589 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
592 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
594 fprintf(F, "%s transitive overwrites:\n", prefix);
595 for (ov = get_entity_trans_overwrites_first(ent);
597 ov = get_entity_trans_overwrites_next(ent)) {
598 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
599 get_type_name(get_entity_owner(ov)));
601 fprintf(F, "%s transitive overwritten by:\n", prefix);
602 for (ov = get_entity_trans_overwrittenby_first(ent);
604 ov = get_entity_trans_overwrittenby_next(ent)) {
605 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
606 get_type_name(get_entity_owner(ov)));
611 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
612 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
613 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
615 if (is_Method_type(get_entity_type(ent))) {
616 unsigned mask = get_entity_additional_properties(ent);
617 unsigned cc = get_method_calling_convention(get_entity_type(ent));
618 ir_graph *irg = get_entity_irg(ent);
621 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
622 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
626 fprintf(F, "\n%s additional prop: ", prefix);
628 if (mask & mtp_property_const) fprintf(F, "const_function, ");
629 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
630 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
631 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
632 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
634 fprintf(F, "\n%s calling convention: ", prefix);
635 if (cc & cc_reg_param) fprintf(F, "regparam, ");
636 if (cc & cc_this_call) fprintf(F, "thiscall, ");
637 if (cc & cc_compound_ret) fprintf(F, "compound_ret, ");
638 if (cc & cc_frame_on_caller_stk) fprintf(F, "frame on caller's stack, ");
639 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
642 else if (IS_STDCALL(cc))
643 fprintf(F, "stdcall");
645 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
646 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
648 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
652 } else { /* no entattrs */
653 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
654 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
655 get_type_name(get_entity_type(ent)), get_entity_name(ent));
656 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
658 if (verbosity & dump_verbosity_accessStats) {
659 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
660 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
661 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
666 if (verbosity & dump_verbosity_entconsts) {
667 if (get_entity_variability(ent) != variability_uninitialized) {
668 if (is_atomic_entity(ent)) {
669 fprintf(F, "%s atomic value: ", prefix);
670 dump_node_opcode(F, get_atomic_ent_value(ent));
672 fprintf(F, "%s compound values:", prefix);
673 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
674 compound_graph_path *path = get_compound_ent_value_path(ent, i);
675 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
676 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
677 if (get_type_state(type) == layout_fixed)
678 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
679 fprintf(F, "%s", get_entity_name(ent));
680 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
681 ir_entity *node = get_compound_graph_path_node(path, j);
682 fprintf(F, ".%s", get_entity_name(node));
683 if (is_Array_type(get_entity_owner(node)))
684 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
687 dump_node_opcode(F, get_compound_ent_value(ent, i));
694 if (verbosity & dump_verbosity_entattrs) {
695 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
696 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
697 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
698 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
699 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
700 if (is_Method_type(get_entity_type(ent))) {
701 if (get_entity_irg(ent)) /* can be null */ {
702 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
703 #ifdef INTERPROCEDURAL_VIEW
704 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
705 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
706 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
710 fprintf(F, "\n%s irg = NULL", prefix);
716 if (get_trouts_state()) {
717 fprintf(F, "%s Entity outs:\n", prefix);
718 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
719 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
720 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
721 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
724 if (verbosity & dump_verbosity_accessStats) {
725 #ifdef EXTENDED_ACCESS_STATS
726 int n_acc = get_entity_n_accesses(ent);
730 int max_LA_freq = -1;
731 int max_SA_freq = -1;
737 /* Find maximal depth */
738 for (i = 0; i < n_acc; ++i) {
739 ir_node *acc = get_entity_access(ent, i);
740 int depth = get_weighted_loop_depth(acc);
741 max_depth = (depth > max_depth) ? depth : max_depth ;
744 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
746 S_freq = L_freq + 1*max_depth;
747 LA_freq = L_freq + 2*max_depth;
748 SA_freq = L_freq + 3*max_depth;
750 for (i = 0; i < n_acc; ++i) {
751 ir_node *acc = get_entity_access(ent, i);
752 int depth = get_weighted_loop_depth(acc);
753 assert(depth < max_depth);
754 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
756 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
757 if (addr_is_alloc(acc)) {
759 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
761 } else if (get_irn_op(acc) == op_Store) {
763 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
764 if (addr_is_alloc(acc)) {
766 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
773 if (max_L_freq >= 0) {
776 fprintf(F, "%s Load Stats", prefix);
777 for (i = 0; i <= max_L_freq; ++i) {
779 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
786 if (max_LA_freq >= 0) {
787 //fprintf(F, "%s LoadA Stats", prefix);
789 for (i = 0; i <= max_LA_freq; ++i) {
791 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
798 if (max_S_freq >= 0) {
801 fprintf(F, "%s Store Stats", prefix);
802 for (i = 0; i <= max_S_freq; ++i) {
804 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
811 if (max_SA_freq >= 0) {
812 //fprintf(F, "%s StoreAStats", prefix);
814 for (i = 0; i <= max_SA_freq; ++i) {
816 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
824 /* free allocated space */
827 if (get_trouts_state() != outs_none) {
828 #ifdef INTERPROCEDURAL_VIEW
829 if (is_Method_type(get_entity_type(ent))) {
830 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
831 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
833 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
834 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
841 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
842 dump_entity_to_file_prefix (F, ent, "", verbosity);
846 void dump_entity(ir_entity *ent) {
847 dump_entity_to_file(stdout, ent, dump_verbosity_max);
850 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
851 unsigned verbosity, int *max_disp,
852 int disp[], const char *comma)
858 #if 0 /* Outputs loop depth of all occurrences. */
859 int n_acc = get_entity_n_accesses(ent);
862 int max_LA_freq = -1;
863 int max_SA_freq = -1;
868 int i, max_depth = 0;
870 /* Find maximal depth */
871 for (i = 0; i < n_acc; ++i) {
872 ir_node *acc = get_entity_access(ent, i);
873 int depth = get_weighted_loop_depth(acc);
874 max_depth = (depth > max_depth) ? depth : max_depth ;
877 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
879 S_freq = L_freq + 1*max_depth;
880 LA_freq = L_freq + 2*max_depth;
881 SA_freq = L_freq + 3*max_depth;
883 for (i = 0; i < n_acc; ++i) {
884 ir_node *acc = get_entity_access(ent, i);
885 int depth = get_weighted_loop_depth(acc);
886 assert(depth <= max_depth);
887 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
889 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
890 if (addr_is_alloc(acc)) {
892 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
894 if (get_entity_allocation(ent) == allocation_static) {
896 *max_disp = (depth > *max_disp) ? depth : *max_disp;
898 } else if (get_irn_op(acc) == op_Store) {
900 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
901 if (addr_is_alloc(acc)) {
903 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
905 if (get_entity_allocation(ent) == allocation_static) {
913 if (get_entity_allocation(ent) != allocation_static) {
915 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
917 if (max_L_freq >= 0) {
918 fprintf(F, "%s Load", comma);
919 for (i = 0; i <= max_L_freq; ++i) {
920 fprintf(F, "%s %d", comma, L_freq[i]);
923 if (max_S_freq >= 0) {
924 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
925 fprintf(F, "%s Store", comma);
926 for (i = 0; i <= max_S_freq; ++i) {
927 fprintf(F, "%s %d", comma, S_freq[i]);
935 if (get_entity_allocation(ent) != allocation_static) {
936 if (is_Method_type(get_entity_type(ent))) return;
938 /* Output the entity name. */
939 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
941 #ifdef INTERPROCEDURAL_VIEW
942 if (get_trouts_state() != outs_none) {
943 if (is_Method_type(get_entity_type(ent))) {
944 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
945 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
947 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
948 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
957 #ifdef INTERPROCEDURAL_VIEW
958 /* A fast hack to dump a CSV-file. */
959 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
964 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
966 if (verbosity & dump_verbosity_accessStats) {
969 /* Outputs loop depth of all occurrences. */
972 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
973 int n_all = get_type_n_allocs(tp);
975 /* Find maximal depth */
976 for (i = 0; i < n_all; ++i) {
977 ir_node *all = get_type_alloc(tp, i);
978 int depth = get_weighted_loop_depth(all);
979 max_depth = (depth > max_depth) ? depth : max_depth ;
982 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
984 disp = freq + max_depth;
986 for (i = 0; i < n_all; ++i) {
987 ir_node *all = get_type_alloc(tp, i);
988 int depth = get_weighted_loop_depth(all);
989 assert(depth <= max_depth);
991 max_freq = (depth > max_freq) ? depth : max_freq;
992 assert(get_irn_op(all) == op_Alloc);
995 fprintf(F, "%s ", get_type_name(tp));
996 fprintf(F, "%s Alloc ", comma);
999 for (i = 0; i <= max_freq; ++i) {
1000 fprintf(F, "%s %d", comma, freq[i]);
1005 for (i = 0; i < get_class_n_members(tp); ++i) {
1006 ir_entity *mem = get_class_member(tp, i);
1007 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1008 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1009 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1010 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1015 if (max_disp >= 0) {
1016 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1017 for (i = 0; i <= max_disp; ++i) {
1018 fprintf(F, "%s %d", comma, disp[i]);
1023 /* free allocated space */
1027 #define DISP_TAB_SUFFIX "__disp_tab"
1028 if (get_trouts_state() != outs_none) {
1029 assert(strlen(get_type_name(tp)) < 1024);
1030 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1031 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1032 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1035 for (i = 0; i < get_class_n_members(tp); ++i) {
1036 ir_entity *mem = get_class_member(tp, i);
1037 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1038 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1039 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1040 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1048 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1051 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1052 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1053 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1054 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1055 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1056 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1057 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1058 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1060 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1061 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1063 switch (get_type_tpop_code(tp)) {
1066 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1067 fprintf(F, "\n members: \n");
1069 for (i = 0; i < get_class_n_members(tp); ++i) {
1070 ir_entity *mem = get_class_member(tp, i);
1071 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1072 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1073 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1074 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1078 if (verbosity & dump_verbosity_typeattrs) {
1079 fprintf(F, " supertypes: ");
1080 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1081 ir_type *stp = get_class_supertype(tp, i);
1082 fprintf(F, "\n %d %s", i, get_type_name(stp));
1084 fprintf(F, "\n subtypes: ");
1085 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1086 ir_type *stp = get_class_subtype(tp, i);
1087 fprintf(F, "\n %d %s", i, get_type_name(stp));
1090 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1092 fprintf(F, "\n transitive supertypes: ");
1093 for (stp = get_class_trans_supertype_first(tp);
1095 stp = get_class_trans_supertype_next(tp)) {
1096 fprintf(F, "\n %s", get_type_name(stp));
1098 fprintf(F, "\n transitive subtypes: ");
1099 for (stp = get_class_trans_subtype_first(tp);
1101 stp = get_class_trans_subtype_next(tp)) {
1102 fprintf(F, "\n %s", get_type_name(stp));
1106 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1107 fprintf(F, "\n flags: ");
1108 if (is_class_final(tp))
1109 fprintf(F, "final, ");
1110 if (is_class_interface(tp))
1111 fprintf(F, "interface, ");
1112 if (is_class_abstract(tp))
1113 fprintf(F, "abstract, ");
1120 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1121 for (i = 0; i < get_compound_n_members(tp); ++i) {
1122 ir_entity *mem = get_compound_member(tp, i);
1123 if (verbosity & dump_verbosity_fields) {
1124 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1130 if (verbosity & dump_verbosity_typeattrs) {
1132 ir_type *elem_tp = get_array_element_type(tp);
1134 fprintf(F, "\n array ");
1136 n_dim = get_array_n_dimensions(tp);
1137 for (i = 0; i < n_dim; ++i) {
1138 ir_node *lower, *upper;
1140 lower = get_array_lower_bound(tp, i);
1141 upper = get_array_upper_bound(tp, i);
1145 if (get_irn_op(lower) == op_Const)
1146 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1148 dump_node_opcode(F, lower);
1149 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1152 if (get_irn_op(upper) == op_Const)
1153 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1155 dump_node_opcode(F, upper);
1156 fprintf(F, " %ld]", get_irn_node_nr(upper));
1159 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1161 fprintf(F, "\n order: ");
1162 for (i = 0; i < n_dim; ++i)
1163 fprintf(F, "<%d>", get_array_order(tp, i));
1167 if (verbosity & dump_verbosity_fields) {
1168 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1175 if (verbosity & dump_verbosity_typeattrs) {
1176 ir_type *tt = get_pointer_points_to_type(tp);
1177 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1182 if (verbosity & dump_verbosity_typeattrs) {
1183 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1184 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1185 for (i = 0; i < get_method_n_ress(tp); ++i) {
1186 ir_type *rtp = get_method_res_type(tp, i);
1187 fprintf(F, "\n %s", get_type_name(rtp));
1190 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1191 for (i = 0; i < get_method_n_params(tp); ++i) {
1192 ir_type *ptp = get_method_param_type(tp, i);
1193 fprintf(F, "\n %s", get_type_name(ptp));
1195 if (get_method_variadicity(tp)) {
1196 fprintf(F, "\n ...");
1203 if (verbosity & dump_verbosity_typeattrs) {
1204 ir_type *base_tp = get_primitive_base_type(tp);
1205 if (base_tp != NULL)
1206 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1218 if (verbosity & dump_verbosity_typeattrs) {
1219 fprintf(F, ": details not implemented\n");
1223 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1224 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1225 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
1226 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
1227 if (is_atomic_type(tp) || is_Method_type(tp))
1228 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1230 if (get_trouts_state()) {
1231 fprintf(F, "\n Type outs:\n");
1232 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1233 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1234 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1235 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1236 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1240 if (verbosity & dump_verbosity_accessStats) {
1242 int n_all = get_type_n_allocs(tp);
1247 /* Find maximal depth */
1248 for (i = 0; i < n_all; ++i) {
1249 ir_node *all = get_type_alloc(tp, i);
1250 int depth = get_weighted_loop_depth(all);
1251 max_depth = (depth > max_depth) ? depth : max_depth ;
1254 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1256 for (i = 0; i < n_all; ++i) {
1257 ir_node *all = get_type_alloc(tp, i);
1258 int depth = get_weighted_loop_depth(all);
1259 assert(depth <= max_depth);
1261 max_freq = (depth > max_freq) ? depth : max_freq;
1262 assert(get_irn_op(all) == op_Alloc);
1265 if (max_freq >= 0) {
1268 fprintf(F, " Alloc Stats");
1269 for (i = 0; i <= max_freq; ++i) {
1270 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1278 #ifdef INTERPROCEDURAL_VIEW
1279 if (get_trouts_state() != outs_none) {
1280 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1281 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1282 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1283 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1284 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1285 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1295 void dump_type(ir_type *tp) {
1296 dump_type_to_file (stdout, tp, dump_verbosity_max);
1300 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1301 const char *basename;
1302 FILE *F, *CSV = NULL;
1303 int i, n_types = get_irp_n_types();
1305 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1306 F = text_open(basename, suffix, "-types", ".txt");
1308 if (verbosity & dump_verbosity_csv) {
1309 CSV = text_open(basename, suffix, "-types", ".csv");
1310 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1313 for (i = 0; i < n_types; ++i) {
1314 ir_type *t = get_irp_type(i);
1316 //if (is_jack_rts_class(t)) continue;
1318 dump_type_to_file(F, t, verbosity);
1319 #ifdef INTERPROCEDURAL_VIEW
1321 dump_typecsv_to_file(CSV, t, verbosity, "");
1327 if (CSV) fclose(CSV);
1331 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1332 const char *basename;
1333 FILE *F, *CSV = NULL;
1334 ir_type *g = get_glob_type();
1335 int i, n_mems = get_class_n_members(g);
1337 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1338 F = text_open (basename, suffix, "-globals", ".txt");
1340 if (verbosity & dump_verbosity_csv) {
1341 CSV = text_open (basename, suffix, "-types", ".csv");
1342 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1345 for (i = 0; i < n_mems; ++i) {
1346 ir_entity *e = get_class_member(g, i);
1348 dump_entity_to_file(F, e, verbosity);
1350 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1355 if (CSV) fclose (CSV);