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 #ifdef INTERPROCEDURAL_VIEW
129 fprintf(F, " arity: %d\n", get_irn_intra_arity(n));
130 /* show all predecessor nodes */
131 fprintf(F, " pred nodes: \n");
134 dump_node_opcode(F, get_irn_n(n, -1));
135 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
137 for ( i = 0; i < get_irn_intra_arity(n); ++i) {
138 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
139 dump_node_opcode(F, get_irn_intra_n(n, i));
140 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
143 fprintf(F, " arity: %d\n", get_irn_arity(n));
144 /* show all predecessor nodes */
145 fprintf(F, " pred nodes: \n");
148 dump_node_opcode(F, get_irn_n(n, -1));
149 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
151 for ( i = 0; i < get_irn_arity(n); ++i) {
152 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
153 dump_node_opcode(F, get_irn_n(n, i));
154 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
158 fprintf(F, " Private Attributes:\n");
160 if (get_irn_opcode(n) == iro_Proj)
161 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
163 #ifdef INTERPROCEDURAL_VIEW
164 if ((get_irp_ip_view_state() != ip_view_no)
165 && (get_irn_opcode(n) == iro_Filter || get_irn_opcode(n) == iro_Block)) {
166 fprintf(F, " inter arity: %d\n", get_irn_inter_arity(n));
167 fprintf(F, " inter pred nodes: \n");
168 for ( i = 0; i < get_irn_inter_arity(n); ++i) {
169 fprintf(F, " %d: %s ", i, is_intra_backedge(n, i) ? "be" : " ");
170 dump_node_opcode(F, get_irn_inter_n(n, i));
171 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
176 if (is_fragile_op(n)) {
177 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
178 /* not dumped: frag array */
181 /* This is not nice, output it as a marker in the predecessor list. */
182 if ((get_irn_op(n) == op_Block) ||
183 (get_irn_op(n) == op_Phi) ||
184 ((get_irn_op(n) == op_Filter) && get_interprocedural_view())) {
185 fprintf(F, " backedges:");
187 for (i = 0; i < get_irn_arity(n); i++)
188 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
192 /* Loop node. Someone else please tell me what's wrong ... */
193 if (get_irn_loop(n)) {
194 ir_loop *loop = get_irn_loop(n);
196 fprintf(F, " in loop %d with depth %d\n",
197 get_loop_loop_nr(loop), get_loop_depth(loop));
201 switch (get_irn_opcode(n)) {
203 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
204 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
205 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
206 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
207 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
210 fprintf(F, " Execution freqency statistics:\n");
211 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
212 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
213 #ifdef INTERPROCEDURAL_VIEW
214 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
215 fprintf(F, " call freqency of procedure: %8.2lf\n",
216 get_irg_method_execution_frequency(get_irn_irg(n)));
217 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
218 fprintf(F, " recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
219 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
220 (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
221 (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
222 fprintf(F, " final evaluation: **%8.2lf**\n", get_irn_final_cost(n));
224 if (has_Block_label(n))
225 fprintf(F, " Label: %lu\n", get_Block_label(n));
227 /* not dumped: graph_arr */
228 /* not dumped: mature */
231 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
232 fprintf(F, " start of method of type %s \n", get_type_name_ex(tp, &bad));
233 for (i = 0; i < get_method_n_params(tp); ++i)
234 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
235 #ifdef INTERPROCEDURAL_VIEW
236 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
237 ir_node *sbl = get_nodes_block(n);
238 int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
239 fprintf(F, " graph has %d interprocedural predecessors:\n", n_cfgpreds);
240 for (i = 0; i < n_cfgpreds; ++i) {
241 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
242 fprintf(F, " %d: Call %ld in graph %s\n", i, get_irn_node_nr(cfgpred),
243 get_irg_dump_name(get_irn_irg(cfgpred)));
249 fprintf(F, " condition kind: %s\n", get_Cond_kind(n) == dense ? "dense" : "fragmentary");
250 fprintf(F, " default ProjNr: %ld\n", get_Cond_defaultProj(n));
251 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE)
252 fprintf(F, " jump prediction: %s\n", get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
255 fprintf(F, " allocating entity of type: %s \n", get_type_name_ex(get_Alloc_type(n), &bad));
256 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
259 fprintf(F, " freeing entity of type %s \n", get_type_name_ex(get_Free_type(n), &bad));
260 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
263 ir_entity *ent = get_Sel_entity(n);
265 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
266 fprintf(F, " of type %s\n", get_type_name_ex(get_entity_type(ent), &bad));
267 fprintf(F, " with owner %s.\n", get_type_name_ex(get_entity_owner(ent), &bad));
270 fprintf(F, " <NULL entity>\n");
275 ir_type *tp = get_Call_type(n);
276 fprintf(F, " calling method of type %s \n", get_type_name_ex(tp, &bad));
277 if(get_unknown_type() != tp) {
278 for (i = 0; i < get_method_n_params(tp); ++i)
279 fprintf(F, " param %d type: %s \n", i, get_type_name_ex(get_method_param_type(tp, i), &bad));
280 for (i = 0; i < get_method_n_ress(tp); ++i)
281 fprintf(F, " resul %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
283 if (Call_has_callees(n)) {
284 fprintf(F, " possible callees: \n");
285 for (i = 0; i < get_Call_n_callees(n); i++) {
286 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
290 case iro_CallBegin: {
291 ir_node *call = get_CallBegin_call(n);
292 fprintf(F, " Call: %ld\n", get_irn_node_nr(call));
293 if (Call_has_callees(call)) {
294 fprintf(F, " possible callees: \n");
295 for (i = 0; i < get_Call_n_callees(call); i++) {
296 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
301 fprintf(F, " cast to type: %s\n", get_type_name_ex(get_Cast_type(n), &bad));
304 if (!get_interprocedural_view()) {
305 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
306 fprintf(F, " return in method of type %s \n", get_type_name_ex(tp, &bad));
307 for (i = 0; i < get_method_n_ress(tp); ++i)
308 fprintf(F, " res %d type: %s \n", i, get_type_name_ex(get_method_res_type(tp, i), &bad));
312 ir_type *tp = get_Const_type(n);
313 assert(tp != firm_none_type);
314 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
317 switch(get_SymConst_kind(n)) {
318 case symconst_addr_name:
319 fprintf(F, " kind: addr_name\n");
320 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
322 case symconst_addr_ent:
323 fprintf(F, " kind: addr_ent\n");
324 fprintf(F, " entity: ");
325 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
327 case symconst_ofs_ent:
328 fprintf(F, " kind: offset\n");
329 fprintf(F, " entity: ");
330 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
332 case symconst_type_tag:
333 fprintf(F, " kind: type_tag\n");
334 fprintf(F, " type: ");
335 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
337 case symconst_type_size:
338 fprintf(F, " kind: size\n");
339 fprintf(F, " type: ");
340 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
342 case symconst_type_align:
343 fprintf(F, " kind: alignment\n");
344 fprintf(F, " type: ");
345 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
347 case symconst_enum_const:
348 fprintf(F, " kind: enumeration\n");
349 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
352 fprintf(F, " kind: label\n");
353 fprintf(F, " label: %lu\n", get_SymConst_label(n));
356 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
359 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
360 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
361 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
364 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
365 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
368 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
371 const ir_asm_constraint *cons;
375 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
376 l = get_ASM_n_input_constraints(n);
378 fprintf(F, "\n inputs: ");
379 cons = get_ASM_input_constraints(n);
380 for (i = 0; i < l; ++i)
381 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
383 l = get_ASM_n_output_constraints(n);
385 fprintf(F, "\n outputs: ");
386 cons = get_ASM_output_constraints(n);
387 for (i = 0; i < l; ++i)
388 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
390 l = get_ASM_n_clobbers(n);
392 fprintf(F, "\n clobber: ");
393 clobber = get_ASM_clobbers(n);
394 for (i = 0; i < l; ++i)
395 fprintf(F, "%s ", get_id_str(clobber[i]));
397 if (get_irn_pinned(n) != op_pin_state_floats)
398 fprintf(F, "\n volatile");
404 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
405 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
406 if (get_irn_typeinfo_type(n) != firm_none_type)
407 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
414 void dump_irnode(ir_node *n) {
415 dump_irnode_to_file(stdout, n);
419 void dump_graph_to_file(FILE *F, ir_graph *irg) {
420 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
423 void dump_graph(ir_graph *g) {
424 dump_graph_to_file(stdout, g);
427 static void dump_node_to_graph_file(ir_node *n, void *env) {
428 FILE *F = (FILE *)env;
430 dump_irnode_to_file(F, n);
434 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
435 const char *basename = get_irg_dump_name(irg);
438 F = text_open(basename, suffix, "", ".txt");
440 dump_graph_to_file(F, irg);
442 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
447 #ifdef EXTENDED_ACCESS_STATS
448 static int addr_is_alloc(ir_node *acc) {
449 ir_node *addr = NULL;
452 addr = get_memop_ptr(acc);
454 assert(is_Call(acc));
455 addr = get_Call_ptr(acc);
458 addr_op = get_irn_opcode(addr);
460 while (addr_op != iro_Alloc) {
463 addr = get_Sel_ptr(addr);
466 addr = get_Cast_op(addr);
469 addr = get_Proj_pred(addr);
484 //assert(0 && "unexpected address node");
487 addr_op = get_irn_opcode(addr);
490 /* In addition, the alloc must be in the same loop. */
495 /** dumps something like:
497 * "prefix" "Name" (x): node1, ... node7,\n
498 * "prefix" node8, ... node15,\n
499 * "prefix" node16, node17\n
501 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
502 int (*get_entity_n_nodes)(firm_kind *ent),
503 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
505 int i, n_nodes = get_entity_n_nodes(k);
508 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
509 for (i = 0; i < n_nodes; ++i) {
511 if (i > 7 && !(i & 7)) { /* line break every eight node. */
512 fprintf(F, ",\n%s ", prefix);
515 fprintf(F, "%s ", comma);
516 rem = opt_dump_analysed_type_info;
517 opt_dump_analysed_type_info = 0;
518 dump_node_label(F, get_entity_node(k, i));
519 opt_dump_analysed_type_info = rem;
525 /** dumps something like:
527 * "prefix" "Name" (x): node1, ... node7,\n
528 * "prefix" node8, ... node15,\n
529 * "prefix" node16, node17\n
531 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
532 int (*get_n_types)(ir_type *tp),
533 ir_type *(*get_type)(ir_type *tp, int pos),
535 int i, n_nodes = get_n_types(tp);
538 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
539 for (i = 0; i < n_nodes; ++i) {
540 if (i > 7 && !(i & 7)) { /* line break every eight node. */
541 fprintf(F, ",\n%s ", prefix);
544 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
545 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
551 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
553 ir_type *owner, *type;
555 assert(is_entity(ent));
556 owner = get_entity_owner(ent);
557 type = get_entity_type(ent);
558 if (verbosity & dump_verbosity_onlynames) {
559 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
560 get_entity_name(ent), get_entity_nr(ent));
564 if (verbosity & dump_verbosity_entattrs) {
565 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
566 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
567 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
569 if (is_Class_type(get_entity_owner(ent))) {
570 if (get_entity_n_overwrites(ent) > 0) {
571 fprintf(F, "%s overwrites:\n", prefix);
572 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
573 ir_entity *ov = get_entity_overwrites(ent, i);
574 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
575 get_type_name(get_entity_owner(ov)));
578 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
580 if (get_entity_n_overwrittenby(ent) > 0) {
581 fprintf(F, "%s overwritten by:\n", prefix);
582 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
583 ir_entity *ov = get_entity_overwrittenby(ent, i);
584 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
585 get_type_name(get_entity_owner(ov)));
588 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
591 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
593 fprintf(F, "%s transitive overwrites:\n", prefix);
594 for (ov = get_entity_trans_overwrites_first(ent);
596 ov = get_entity_trans_overwrites_next(ent)) {
597 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
598 get_type_name(get_entity_owner(ov)));
600 fprintf(F, "%s transitive overwritten by:\n", prefix);
601 for (ov = get_entity_trans_overwrittenby_first(ent);
603 ov = get_entity_trans_overwrittenby_next(ent)) {
604 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
605 get_type_name(get_entity_owner(ov)));
610 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
611 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
612 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
614 if (is_Method_type(get_entity_type(ent))) {
615 unsigned mask = get_entity_additional_properties(ent);
616 unsigned cc = get_method_calling_convention(get_entity_type(ent));
617 ir_graph *irg = get_entity_irg(ent);
620 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
621 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
625 fprintf(F, "\n%s additional prop: ", prefix);
627 if (mask & mtp_property_const) fprintf(F, "const_function, ");
628 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
629 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
630 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
631 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
633 fprintf(F, "\n%s calling convention: ", prefix);
634 if (cc & cc_reg_param) fprintf(F, "regparam, ");
635 if (cc & cc_this_call) fprintf(F, "thiscall, ");
638 else if (IS_STDCALL(cc))
639 fprintf(F, "stdcall");
641 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
642 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
644 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
648 } else { /* no entattrs */
649 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
650 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
651 get_type_name(get_entity_type(ent)), get_entity_name(ent));
652 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
654 if (verbosity & dump_verbosity_accessStats) {
655 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
656 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
657 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
662 if (verbosity & dump_verbosity_entconsts) {
663 if (get_entity_variability(ent) != variability_uninitialized) {
664 if (is_atomic_entity(ent)) {
665 fprintf(F, "%s atomic value: ", prefix);
666 dump_node_opcode(F, get_atomic_ent_value(ent));
668 fprintf(F, "%s compound values:", prefix);
669 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
670 compound_graph_path *path = get_compound_ent_value_path(ent, i);
671 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
672 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
673 if (get_type_state(type) == layout_fixed)
674 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
675 fprintf(F, "%s", get_entity_name(ent));
676 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
677 ir_entity *node = get_compound_graph_path_node(path, j);
678 fprintf(F, ".%s", get_entity_name(node));
679 if (is_Array_type(get_entity_owner(node)))
680 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
683 dump_node_opcode(F, get_compound_ent_value(ent, i));
690 if (verbosity & dump_verbosity_entattrs) {
691 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
692 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
693 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
694 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
695 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
696 if (is_Method_type(get_entity_type(ent))) {
697 if (get_entity_irg(ent)) /* can be null */ {
698 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
699 #ifdef INTERPROCEDURAL_VIEW
700 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
701 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
702 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
706 fprintf(F, "\n%s irg = NULL", prefix);
712 if (get_trouts_state()) {
713 fprintf(F, "%s Entity outs:\n", prefix);
714 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
715 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
716 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
717 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
720 if (verbosity & dump_verbosity_accessStats) {
721 #ifdef EXTENDED_ACCESS_STATS
722 int n_acc = get_entity_n_accesses(ent);
726 int max_LA_freq = -1;
727 int max_SA_freq = -1;
733 /* Find maximal depth */
734 for (i = 0; i < n_acc; ++i) {
735 ir_node *acc = get_entity_access(ent, i);
736 int depth = get_weighted_loop_depth(acc);
737 max_depth = (depth > max_depth) ? depth : max_depth ;
740 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
742 S_freq = L_freq + 1*max_depth;
743 LA_freq = L_freq + 2*max_depth;
744 SA_freq = L_freq + 3*max_depth;
746 for (i = 0; i < n_acc; ++i) {
747 ir_node *acc = get_entity_access(ent, i);
748 int depth = get_weighted_loop_depth(acc);
749 assert(depth < max_depth);
750 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
752 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
753 if (addr_is_alloc(acc)) {
755 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
757 } else if (get_irn_op(acc) == op_Store) {
759 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
760 if (addr_is_alloc(acc)) {
762 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
769 if (max_L_freq >= 0) {
772 fprintf(F, "%s Load Stats", prefix);
773 for (i = 0; i <= max_L_freq; ++i) {
775 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
782 if (max_LA_freq >= 0) {
783 //fprintf(F, "%s LoadA Stats", prefix);
785 for (i = 0; i <= max_LA_freq; ++i) {
787 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
794 if (max_S_freq >= 0) {
797 fprintf(F, "%s Store Stats", prefix);
798 for (i = 0; i <= max_S_freq; ++i) {
800 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
807 if (max_SA_freq >= 0) {
808 //fprintf(F, "%s StoreAStats", prefix);
810 for (i = 0; i <= max_SA_freq; ++i) {
812 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
820 /* free allocated space */
823 if (get_trouts_state() != outs_none) {
824 #ifdef INTERPROCEDURAL_VIEW
825 if (is_Method_type(get_entity_type(ent))) {
826 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
827 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
829 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
830 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
837 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
838 dump_entity_to_file_prefix (F, ent, "", verbosity);
842 void dump_entity(ir_entity *ent) {
843 dump_entity_to_file(stdout, ent, dump_verbosity_max);
846 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
847 unsigned verbosity, int *max_disp,
848 int disp[], const char *comma)
854 #if 0 /* Outputs loop depth of all occurrences. */
855 int n_acc = get_entity_n_accesses(ent);
858 int max_LA_freq = -1;
859 int max_SA_freq = -1;
864 int i, max_depth = 0;
866 /* Find maximal depth */
867 for (i = 0; i < n_acc; ++i) {
868 ir_node *acc = get_entity_access(ent, i);
869 int depth = get_weighted_loop_depth(acc);
870 max_depth = (depth > max_depth) ? depth : max_depth ;
873 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
875 S_freq = L_freq + 1*max_depth;
876 LA_freq = L_freq + 2*max_depth;
877 SA_freq = L_freq + 3*max_depth;
879 for (i = 0; i < n_acc; ++i) {
880 ir_node *acc = get_entity_access(ent, i);
881 int depth = get_weighted_loop_depth(acc);
882 assert(depth <= max_depth);
883 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
885 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
886 if (addr_is_alloc(acc)) {
888 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
890 if (get_entity_allocation(ent) == allocation_static) {
892 *max_disp = (depth > *max_disp) ? depth : *max_disp;
894 } else if (get_irn_op(acc) == op_Store) {
896 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
897 if (addr_is_alloc(acc)) {
899 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
901 if (get_entity_allocation(ent) == allocation_static) {
909 if (get_entity_allocation(ent) != allocation_static) {
911 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
913 if (max_L_freq >= 0) {
914 fprintf(F, "%s Load", comma);
915 for (i = 0; i <= max_L_freq; ++i) {
916 fprintf(F, "%s %d", comma, L_freq[i]);
919 if (max_S_freq >= 0) {
920 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
921 fprintf(F, "%s Store", comma);
922 for (i = 0; i <= max_S_freq; ++i) {
923 fprintf(F, "%s %d", comma, S_freq[i]);
931 if (get_entity_allocation(ent) != allocation_static) {
932 if (is_Method_type(get_entity_type(ent))) return;
934 /* Output the entity name. */
935 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
937 #ifdef INTERPROCEDURAL_VIEW
938 if (get_trouts_state() != outs_none) {
939 if (is_Method_type(get_entity_type(ent))) {
940 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
941 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
943 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
944 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
953 #ifdef INTERPROCEDURAL_VIEW
954 /* A fast hack to dump a CSV-file. */
955 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
960 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
962 if (verbosity & dump_verbosity_accessStats) {
965 /* Outputs loop depth of all occurrences. */
968 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
969 int n_all = get_type_n_allocs(tp);
971 /* Find maximal depth */
972 for (i = 0; i < n_all; ++i) {
973 ir_node *all = get_type_alloc(tp, i);
974 int depth = get_weighted_loop_depth(all);
975 max_depth = (depth > max_depth) ? depth : max_depth ;
978 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
980 disp = freq + max_depth;
982 for (i = 0; i < n_all; ++i) {
983 ir_node *all = get_type_alloc(tp, i);
984 int depth = get_weighted_loop_depth(all);
985 assert(depth <= max_depth);
987 max_freq = (depth > max_freq) ? depth : max_freq;
988 assert(get_irn_op(all) == op_Alloc);
991 fprintf(F, "%s ", get_type_name(tp));
992 fprintf(F, "%s Alloc ", comma);
995 for (i = 0; i <= max_freq; ++i) {
996 fprintf(F, "%s %d", comma, freq[i]);
1001 for (i = 0; i < get_class_n_members(tp); ++i) {
1002 ir_entity *mem = get_class_member(tp, i);
1003 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1004 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1005 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1006 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1011 if (max_disp >= 0) {
1012 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1013 for (i = 0; i <= max_disp; ++i) {
1014 fprintf(F, "%s %d", comma, disp[i]);
1019 /* free allocated space */
1023 #define DISP_TAB_SUFFIX "__disp_tab"
1024 if (get_trouts_state() != outs_none) {
1025 assert(strlen(get_type_name(tp)) < 1024);
1026 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1027 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1028 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1031 for (i = 0; i < get_class_n_members(tp); ++i) {
1032 ir_entity *mem = get_class_member(tp, i);
1033 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1034 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1035 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1036 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1044 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1047 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1048 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1049 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1050 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1051 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1052 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1053 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1054 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1056 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1057 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1059 switch (get_type_tpop_code(tp)) {
1062 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1063 fprintf(F, "\n members: \n");
1065 for (i = 0; i < get_class_n_members(tp); ++i) {
1066 ir_entity *mem = get_class_member(tp, i);
1067 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1068 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1069 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1070 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1074 if (verbosity & dump_verbosity_typeattrs) {
1075 fprintf(F, " supertypes: ");
1076 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1077 ir_type *stp = get_class_supertype(tp, i);
1078 fprintf(F, "\n %d %s", i, get_type_name(stp));
1080 fprintf(F, "\n subtypes: ");
1081 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1082 ir_type *stp = get_class_subtype(tp, i);
1083 fprintf(F, "\n %d %s", i, get_type_name(stp));
1086 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1088 fprintf(F, "\n transitive supertypes: ");
1089 for (stp = get_class_trans_supertype_first(tp);
1091 stp = get_class_trans_supertype_next(tp)) {
1092 fprintf(F, "\n %s", get_type_name(stp));
1094 fprintf(F, "\n transitive subtypes: ");
1095 for (stp = get_class_trans_subtype_first(tp);
1097 stp = get_class_trans_subtype_next(tp)) {
1098 fprintf(F, "\n %s", get_type_name(stp));
1102 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1103 fprintf(F, "\n flags: ");
1104 if (is_class_final(tp))
1105 fprintf(F, "final, ");
1106 if (is_class_interface(tp))
1107 fprintf(F, "interface, ");
1108 if (is_class_abstract(tp))
1109 fprintf(F, "abstract, ");
1116 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1117 for (i = 0; i < get_compound_n_members(tp); ++i) {
1118 ir_entity *mem = get_compound_member(tp, i);
1119 if (verbosity & dump_verbosity_fields) {
1120 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1126 if (verbosity & dump_verbosity_typeattrs) {
1128 ir_type *elem_tp = get_array_element_type(tp);
1130 fprintf(F, "\n array ");
1132 n_dim = get_array_n_dimensions(tp);
1133 for (i = 0; i < n_dim; ++i) {
1134 ir_node *lower, *upper;
1136 lower = get_array_lower_bound(tp, i);
1137 upper = get_array_upper_bound(tp, i);
1141 if (get_irn_op(lower) == op_Const)
1142 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1144 dump_node_opcode(F, lower);
1145 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1148 if (get_irn_op(upper) == op_Const)
1149 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1151 dump_node_opcode(F, upper);
1152 fprintf(F, " %ld]", get_irn_node_nr(upper));
1155 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1157 fprintf(F, "\n order: ");
1158 for (i = 0; i < n_dim; ++i)
1159 fprintf(F, "<%d>", get_array_order(tp, i));
1163 if (verbosity & dump_verbosity_fields) {
1164 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1171 if (verbosity & dump_verbosity_typeattrs) {
1172 ir_type *tt = get_pointer_points_to_type(tp);
1173 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1178 if (verbosity & dump_verbosity_typeattrs) {
1179 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1180 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1181 for (i = 0; i < get_method_n_ress(tp); ++i) {
1182 ir_type *rtp = get_method_res_type(tp, i);
1183 fprintf(F, "\n %s", get_type_name(rtp));
1186 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1187 for (i = 0; i < get_method_n_params(tp); ++i) {
1188 ir_type *ptp = get_method_param_type(tp, i);
1189 fprintf(F, "\n %s", get_type_name(ptp));
1191 if (get_method_variadicity(tp)) {
1192 fprintf(F, "\n ...");
1199 if (verbosity & dump_verbosity_typeattrs) {
1200 ir_type *base_tp = get_primitive_base_type(tp);
1201 if (base_tp != NULL)
1202 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1214 if (verbosity & dump_verbosity_typeattrs) {
1215 fprintf(F, ": details not implemented\n");
1219 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1220 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1221 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1222 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1223 if (is_atomic_type(tp) || is_Method_type(tp))
1224 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1226 if (get_trouts_state()) {
1227 fprintf(F, "\n Type outs:\n");
1228 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1229 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1230 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1231 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1232 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1236 if (verbosity & dump_verbosity_accessStats) {
1238 int n_all = get_type_n_allocs(tp);
1243 /* Find maximal depth */
1244 for (i = 0; i < n_all; ++i) {
1245 ir_node *all = get_type_alloc(tp, i);
1246 int depth = get_weighted_loop_depth(all);
1247 max_depth = (depth > max_depth) ? depth : max_depth ;
1250 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1252 for (i = 0; i < n_all; ++i) {
1253 ir_node *all = get_type_alloc(tp, i);
1254 int depth = get_weighted_loop_depth(all);
1255 assert(depth <= max_depth);
1257 max_freq = (depth > max_freq) ? depth : max_freq;
1258 assert(get_irn_op(all) == op_Alloc);
1261 if (max_freq >= 0) {
1264 fprintf(F, " Alloc Stats");
1265 for (i = 0; i <= max_freq; ++i) {
1266 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1274 #ifdef INTERPROCEDURAL_VIEW
1275 if (get_trouts_state() != outs_none) {
1276 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1277 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1278 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1279 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1280 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1281 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1291 void dump_type(ir_type *tp) {
1292 dump_type_to_file (stdout, tp, dump_verbosity_max);
1296 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1297 const char *basename;
1298 FILE *F, *CSV = NULL;
1299 int i, n_types = get_irp_n_types();
1301 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1302 F = text_open(basename, suffix, "-types", ".txt");
1304 if (verbosity & dump_verbosity_csv) {
1305 CSV = text_open(basename, suffix, "-types", ".csv");
1306 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1309 for (i = 0; i < n_types; ++i) {
1310 ir_type *t = get_irp_type(i);
1312 //if (is_jack_rts_class(t)) continue;
1314 dump_type_to_file(F, t, verbosity);
1315 #ifdef INTERPROCEDURAL_VIEW
1317 dump_typecsv_to_file(CSV, t, verbosity, "");
1323 if (CSV) fclose(CSV);
1327 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1328 const char *basename;
1329 FILE *F, *CSV = NULL;
1330 ir_type *g = get_glob_type();
1331 int i, n_mems = get_class_n_members(g);
1333 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1334 F = text_open (basename, suffix, "-globals", ".txt");
1336 if (verbosity & dump_verbosity_csv) {
1337 CSV = text_open (basename, suffix, "-types", ".csv");
1338 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1341 for (i = 0; i < n_mems; ++i) {
1342 ir_entity *e = get_class_member(g, i);
1344 dump_entity_to_file(F, e, verbosity);
1346 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1351 if (CSV) fclose (CSV);