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 assert(get_Const_type(n) != firm_none_type);
313 fprintf(F, " Const of type %s \n", get_type_name_ex(get_Const_type(n), &bad));
316 switch(get_SymConst_kind(n)) {
317 case symconst_addr_name:
318 fprintf(F, " kind: addr_name\n");
319 fprintf(F, " name: %s\n", get_id_str(get_SymConst_name(n)));
321 case symconst_addr_ent:
322 fprintf(F, " kind: addr_ent\n");
323 fprintf(F, " entity: ");
324 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
326 case symconst_ofs_ent:
327 fprintf(F, " kind: offset\n");
328 fprintf(F, " entity: ");
329 dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
331 case symconst_type_tag:
332 fprintf(F, " kind: type_tag\n");
333 fprintf(F, " type: ");
334 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
336 case symconst_type_size:
337 fprintf(F, " kind: size\n");
338 fprintf(F, " type: ");
339 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
341 case symconst_type_align:
342 fprintf(F, " kind: alignment\n");
343 fprintf(F, " type: ");
344 dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
346 case symconst_enum_const:
347 fprintf(F, " kind: enumeration\n");
348 fprintf(F, " name: %s\n", get_enumeration_name(get_SymConst_enum(n)));
351 fprintf(F, " kind: label\n");
352 fprintf(F, " label: %lu\n", get_SymConst_label(n));
355 fprintf(F, " type of value: %s \n", get_type_name_ex(get_SymConst_value_type(n), &bad));
358 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
359 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
360 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
363 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
364 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
367 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
370 const ir_asm_constraint *cons;
374 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
375 l = get_ASM_n_input_constraints(n);
377 fprintf(F, "\n inputs: ");
378 cons = get_ASM_input_constraints(n);
379 for (i = 0; i < l; ++i)
380 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
382 l = get_ASM_n_output_constraints(n);
384 fprintf(F, "\n outputs: ");
385 cons = get_ASM_output_constraints(n);
386 for (i = 0; i < l; ++i)
387 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
389 l = get_ASM_n_clobbers(n);
391 fprintf(F, "\n clobber: ");
392 clobber = get_ASM_clobbers(n);
393 for (i = 0; i < l; ++i)
394 fprintf(F, "%s ", get_id_str(clobber[i]));
396 if (get_irn_pinned(n) != op_pin_state_floats)
397 fprintf(F, "\n volatile");
403 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
404 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
405 if (get_irn_typeinfo_type(n) != firm_none_type)
406 fprintf (F, " Analysed type: %s\n", get_type_name_ex(get_irn_typeinfo_type(n), &bad));
413 void dump_irnode(ir_node *n) {
414 dump_irnode_to_file(stdout, n);
418 void dump_graph_to_file(FILE *F, ir_graph *irg) {
419 fprintf(F, "graph %s\n", get_irg_dump_name(irg));
422 void dump_graph(ir_graph *g) {
423 dump_graph_to_file(stdout, g);
426 static void dump_node_to_graph_file(ir_node *n, void *env) {
427 FILE *F = (FILE *)env;
429 dump_irnode_to_file(F, n);
433 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
434 const char *basename = get_irg_dump_name(irg);
437 F = text_open(basename, suffix, "", ".txt");
439 dump_graph_to_file(F, irg);
441 irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
446 #ifdef EXTENDED_ACCESS_STATS
447 static int addr_is_alloc(ir_node *acc) {
448 ir_node *addr = NULL;
451 addr = get_memop_ptr(acc);
453 assert(is_Call(acc));
454 addr = get_Call_ptr(acc);
457 addr_op = get_irn_opcode(addr);
459 while (addr_op != iro_Alloc) {
462 addr = get_Sel_ptr(addr);
465 addr = get_Cast_op(addr);
468 addr = get_Proj_pred(addr);
483 //assert(0 && "unexpected address node");
486 addr_op = get_irn_opcode(addr);
489 /* In addition, the alloc must be in the same loop. */
494 /** dumps something like:
496 * "prefix" "Name" (x): node1, ... node7,\n
497 * "prefix" node8, ... node15,\n
498 * "prefix" node16, node17\n
500 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
501 int (*get_entity_n_nodes)(firm_kind *ent),
502 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
504 int i, n_nodes = get_entity_n_nodes(k);
507 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
508 for (i = 0; i < n_nodes; ++i) {
510 if (i > 7 && !(i & 7)) { /* line break every eight node. */
511 fprintf(F, ",\n%s ", prefix);
514 fprintf(F, "%s ", comma);
515 rem = opt_dump_analysed_type_info;
516 opt_dump_analysed_type_info = 0;
517 dump_node_label(F, get_entity_node(k, i));
518 opt_dump_analysed_type_info = rem;
524 /** dumps something like:
526 * "prefix" "Name" (x): node1, ... node7,\n
527 * "prefix" node8, ... node15,\n
528 * "prefix" node16, node17\n
530 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
531 int (*get_n_types)(ir_type *tp),
532 ir_type *(*get_type)(ir_type *tp, int pos),
534 int i, n_nodes = get_n_types(tp);
537 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
538 for (i = 0; i < n_nodes; ++i) {
539 if (i > 7 && !(i & 7)) { /* line break every eight node. */
540 fprintf(F, ",\n%s ", prefix);
543 fprintf(F, "%s %s(%ld)", comma, get_type_name(get_type(tp, i)), get_type_nr(tp));
544 //dump_type_to_file(F, get_type(tp, i), dump_verbosity_onlynames);
550 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
552 ir_type *owner, *type;
554 assert(is_entity(ent));
555 owner = get_entity_owner(ent);
556 type = get_entity_type(ent);
557 if (verbosity & dump_verbosity_onlynames) {
558 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_type_name(get_entity_owner(ent)),
559 get_entity_name(ent), get_entity_nr(ent));
563 if (verbosity & dump_verbosity_entattrs) {
564 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
565 fprintf(F, "%s type: %s (%ld)\n", prefix, get_type_name(type), get_type_nr(type));
566 fprintf(F, "%s owner: %s (%ld)\n", prefix, get_type_name(owner), get_type_nr(owner));
568 if (is_Class_type(get_entity_owner(ent))) {
569 if (get_entity_n_overwrites(ent) > 0) {
570 fprintf(F, "%s overwrites:\n", prefix);
571 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
572 ir_entity *ov = get_entity_overwrites(ent, i);
573 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
574 get_type_name(get_entity_owner(ov)));
577 fprintf(F, "%s Does not overwrite other entities. \n", prefix);
579 if (get_entity_n_overwrittenby(ent) > 0) {
580 fprintf(F, "%s overwritten by:\n", prefix);
581 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
582 ir_entity *ov = get_entity_overwrittenby(ent, i);
583 fprintf(F, "%s %d: %s of class %s\n", prefix, i, get_entity_name(ov),
584 get_type_name(get_entity_owner(ov)));
587 fprintf(F, "%s Is not overwritten by other entities. \n", prefix);
590 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
592 fprintf(F, "%s transitive overwrites:\n", prefix);
593 for (ov = get_entity_trans_overwrites_first(ent);
595 ov = get_entity_trans_overwrites_next(ent)) {
596 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
597 get_type_name(get_entity_owner(ov)));
599 fprintf(F, "%s transitive overwritten by:\n", prefix);
600 for (ov = get_entity_trans_overwrittenby_first(ent);
602 ov = get_entity_trans_overwrittenby_next(ent)) {
603 fprintf(F, "%s : %s of class %s\n", prefix, get_entity_name(ov),
604 get_type_name(get_entity_owner(ov)));
609 fprintf(F, "%s allocation: %s", prefix, get_allocation_name(get_entity_allocation(ent)));
610 fprintf(F, "\n%s visibility: %s", prefix, get_visibility_name(get_entity_visibility(ent)));
611 fprintf(F, "\n%s variability: %s", prefix, get_variability_name(get_entity_variability(ent)));
613 if (is_Method_type(get_entity_type(ent))) {
614 unsigned mask = get_entity_additional_properties(ent);
615 unsigned cc = get_method_calling_convention(get_entity_type(ent));
616 ir_graph *irg = get_entity_irg(ent);
619 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
620 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
624 fprintf(F, "\n%s additional prop: ", prefix);
626 if (mask & mtp_property_const) fprintf(F, "const_function, ");
627 if (mask & mtp_property_pure) fprintf(F, "pure_function, ");
628 if (mask & mtp_property_noreturn) fprintf(F, "noreturn_function, ");
629 if (mask & mtp_property_nothrow) fprintf(F, "nothrow_function, ");
630 if (mask & mtp_property_naked) fprintf(F, "naked_function, ");
632 fprintf(F, "\n%s calling convention: ", prefix);
633 if (cc & cc_reg_param) fprintf(F, "regparam, ");
634 if (cc & cc_this_call) fprintf(F, "thiscall, ");
637 else if (IS_STDCALL(cc))
638 fprintf(F, "stdcall");
640 fprintf(F, (cc & cc_last_on_top) ? "last param on top, " : "first param on top, ");
641 fprintf(F, (cc & cc_callee_clear_stk) ? "callee clear stack" : "caller clear stack");
643 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
647 } else { /* no entattrs */
648 fprintf(F, "%s(%3d:%d) %-40s: %s", prefix,
649 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
650 get_type_name(get_entity_type(ent)), get_entity_name(ent));
651 if (is_Method_type(get_entity_type(ent))) fprintf(F, "(...)");
653 if (verbosity & dump_verbosity_accessStats) {
654 if (get_entity_allocation(ent) == allocation_static) fprintf(F, " (stat)");
655 if (get_entity_peculiarity(ent) == peculiarity_description) fprintf(F, " (desc)");
656 if (get_entity_peculiarity(ent) == peculiarity_inherited) fprintf(F, " (inh)");
661 if (verbosity & dump_verbosity_entconsts) {
662 if (get_entity_variability(ent) != variability_uninitialized) {
663 if (is_atomic_entity(ent)) {
664 fprintf(F, "%s atomic value: ", prefix);
665 dump_node_opcode(F, get_atomic_ent_value(ent));
667 fprintf(F, "%s compound values:", prefix);
668 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
669 compound_graph_path *path = get_compound_ent_value_path(ent, i);
670 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
671 fprintf(F, "\n%s %3d:%d ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
672 if (get_type_state(type) == layout_fixed)
673 fprintf(F, "(%3d:%d) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
674 fprintf(F, "%s", get_entity_name(ent));
675 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
676 ir_entity *node = get_compound_graph_path_node(path, j);
677 fprintf(F, ".%s", get_entity_name(node));
678 if (is_Array_type(get_entity_owner(node)))
679 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
682 dump_node_opcode(F, get_compound_ent_value(ent, i));
689 if (verbosity & dump_verbosity_entattrs) {
690 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
691 fprintf(F, "\n%s alignment: %s", prefix, get_align_name(get_entity_align(ent)));
692 fprintf(F, "\n%s peculiarity: %s", prefix, get_peculiarity_name(get_entity_peculiarity(ent)));
693 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
694 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
695 if (is_Method_type(get_entity_type(ent))) {
696 if (get_entity_irg(ent)) /* can be null */ {
697 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
698 #ifdef INTERPROCEDURAL_VIEW
699 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
700 fprintf(F, "\n%s recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
701 fprintf(F, "\n%s loop depth %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
705 fprintf(F, "\n%s irg = NULL", prefix);
711 if (get_trouts_state()) {
712 fprintf(F, "%s Entity outs:\n", prefix);
713 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
714 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
715 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
716 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
719 if (verbosity & dump_verbosity_accessStats) {
720 #ifdef EXTENDED_ACCESS_STATS
721 int n_acc = get_entity_n_accesses(ent);
725 int max_LA_freq = -1;
726 int max_SA_freq = -1;
732 /* Find maximal depth */
733 for (i = 0; i < n_acc; ++i) {
734 ir_node *acc = get_entity_access(ent, i);
735 int depth = get_weighted_loop_depth(acc);
736 max_depth = (depth > max_depth) ? depth : max_depth ;
739 L_freq = xcalloc(4 * max_depth, sizeof(L_freq[0]));
741 S_freq = L_freq + 1*max_depth;
742 LA_freq = L_freq + 2*max_depth;
743 SA_freq = L_freq + 3*max_depth;
745 for (i = 0; i < n_acc; ++i) {
746 ir_node *acc = get_entity_access(ent, i);
747 int depth = get_weighted_loop_depth(acc);
748 assert(depth < max_depth);
749 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
751 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
752 if (addr_is_alloc(acc)) {
754 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
756 } else if (get_irn_op(acc) == op_Store) {
758 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
759 if (addr_is_alloc(acc)) {
761 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
768 if (max_L_freq >= 0) {
771 fprintf(F, "%s Load Stats", prefix);
772 for (i = 0; i <= max_L_freq; ++i) {
774 fprintf(F, "%c %d x L%d", comma, L_freq[i], i);
781 if (max_LA_freq >= 0) {
782 //fprintf(F, "%s LoadA Stats", prefix);
784 for (i = 0; i <= max_LA_freq; ++i) {
786 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
793 if (max_S_freq >= 0) {
796 fprintf(F, "%s Store Stats", prefix);
797 for (i = 0; i <= max_S_freq; ++i) {
799 fprintf(F, "%c %d x S%d", comma, S_freq[i], i);
806 if (max_SA_freq >= 0) {
807 //fprintf(F, "%s StoreAStats", prefix);
809 for (i = 0; i <= max_SA_freq; ++i) {
811 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
819 /* free allocated space */
822 if (get_trouts_state() != outs_none) {
823 #ifdef INTERPROCEDURAL_VIEW
824 if (is_Method_type(get_entity_type(ent))) {
825 fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
826 fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
828 fprintf(F, "%s Estimated #Loads: %lf\n", prefix, get_entity_estimated_n_loads(ent));
829 fprintf(F, "%s Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
836 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
837 dump_entity_to_file_prefix (F, ent, "", verbosity);
841 void dump_entity(ir_entity *ent) {
842 dump_entity_to_file(stdout, ent, dump_verbosity_max);
845 void dump_entitycsv_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
846 unsigned verbosity, int *max_disp,
847 int disp[], const char *comma)
853 #if 0 /* Outputs loop depth of all occurrences. */
854 int n_acc = get_entity_n_accesses(ent);
857 int max_LA_freq = -1;
858 int max_SA_freq = -1;
863 int i, max_depth = 0;
865 /* Find maximal depth */
866 for (i = 0; i < n_acc; ++i) {
867 ir_node *acc = get_entity_access(ent, i);
868 int depth = get_weighted_loop_depth(acc);
869 max_depth = (depth > max_depth) ? depth : max_depth ;
872 L_freq = xcalloc(4 * (max_depth+1), sizeof(L_freq[0]));
874 S_freq = L_freq + 1*max_depth;
875 LA_freq = L_freq + 2*max_depth;
876 SA_freq = L_freq + 3*max_depth;
878 for (i = 0; i < n_acc; ++i) {
879 ir_node *acc = get_entity_access(ent, i);
880 int depth = get_weighted_loop_depth(acc);
881 assert(depth <= max_depth);
882 if ((get_irn_op(acc) == op_Load) || (get_irn_op(acc) == op_Call)) {
884 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
885 if (addr_is_alloc(acc)) {
887 max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
889 if (get_entity_allocation(ent) == allocation_static) {
891 *max_disp = (depth > *max_disp) ? depth : *max_disp;
893 } else if (get_irn_op(acc) == op_Store) {
895 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
896 if (addr_is_alloc(acc)) {
898 max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
900 if (get_entity_allocation(ent) == allocation_static) {
908 if (get_entity_allocation(ent) != allocation_static) {
910 fprintf(F, "%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
912 if (max_L_freq >= 0) {
913 fprintf(F, "%s Load", comma);
914 for (i = 0; i <= max_L_freq; ++i) {
915 fprintf(F, "%s %d", comma, L_freq[i]);
918 if (max_S_freq >= 0) {
919 if (max_L_freq >= 0) fprintf(F, "\n%s_%s", get_type_name(get_entity_owner(ent)), get_entity_name(ent));
920 fprintf(F, "%s Store", comma);
921 for (i = 0; i <= max_S_freq; ++i) {
922 fprintf(F, "%s %d", comma, S_freq[i]);
930 if (get_entity_allocation(ent) != allocation_static) {
931 if (is_Method_type(get_entity_type(ent))) return;
933 /* Output the entity name. */
934 fprintf(F, "%s%-40s ", prefix, get_entity_ld_name(ent));
936 #ifdef INTERPROCEDURAL_VIEW
937 if (get_trouts_state() != outs_none) {
938 if (is_Method_type(get_entity_type(ent))) {
939 //fprintf(F, "%s Estimated #Calls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
940 //fprintf(F, "%s Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
942 fprintf(F, "%6.2lf ", get_entity_estimated_n_loads(ent));
943 fprintf(F, "%6.2lf", get_entity_estimated_n_stores(ent));
952 #ifdef INTERPROCEDURAL_VIEW
953 /* A fast hack to dump a CSV-file. */
954 void dump_typecsv_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity, const char *comma) {
959 if (!is_Class_type(tp)) return; // we also want array types. Stupid, these are classes in java.
961 if (verbosity & dump_verbosity_accessStats) {
964 /* Outputs loop depth of all occurrences. */
967 int *freq, *disp; /* Accumulated accesses to static members: dispatch table. */
968 int n_all = get_type_n_allocs(tp);
970 /* Find maximal depth */
971 for (i = 0; i < n_all; ++i) {
972 ir_node *all = get_type_alloc(tp, i);
973 int depth = get_weighted_loop_depth(all);
974 max_depth = (depth > max_depth) ? depth : max_depth ;
977 freq = xcalloc(2 * (max_depth+1), sizeof(freq[0]));
979 disp = freq + max_depth;
981 for (i = 0; i < n_all; ++i) {
982 ir_node *all = get_type_alloc(tp, i);
983 int depth = get_weighted_loop_depth(all);
984 assert(depth <= max_depth);
986 max_freq = (depth > max_freq) ? depth : max_freq;
987 assert(get_irn_op(all) == op_Alloc);
990 fprintf(F, "%s ", get_type_name(tp));
991 fprintf(F, "%s Alloc ", comma);
994 for (i = 0; i <= max_freq; ++i) {
995 fprintf(F, "%s %d", comma, freq[i]);
1000 for (i = 0; i < get_class_n_members(tp); ++i) {
1001 ir_entity *mem = get_class_member(tp, i);
1002 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1003 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1004 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1005 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, &max_disp, disp, comma);
1010 if (max_disp >= 0) {
1011 fprintf(F, "%s__disp_tab%s Load", get_type_name(tp), comma);
1012 for (i = 0; i <= max_disp; ++i) {
1013 fprintf(F, "%s %d", comma, disp[i]);
1018 /* free allocated space */
1022 #define DISP_TAB_SUFFIX "__disp_tab"
1023 if (get_trouts_state() != outs_none) {
1024 assert(strlen(get_type_name(tp)) < 1024);
1025 fprintf(F, "%-44s %6.2lf -1.00\n", get_type_name(tp), get_type_estimated_n_instances(tp));
1026 sprintf(buf, "%s%s", get_type_name(tp), DISP_TAB_SUFFIX);
1027 fprintf(F, "%-44s %6.2lf 0.00\n", buf, get_class_estimated_n_dyncalls(tp));
1030 for (i = 0; i < get_class_n_members(tp); ++i) {
1031 ir_entity *mem = get_class_member(tp, i);
1032 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1033 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1034 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1035 dump_entitycsv_to_file_prefix(F, mem, " ", verbosity, NULL, 0, 0);
1043 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
1046 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
1047 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
1048 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
1049 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
1050 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
1051 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
1052 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
1053 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
1055 fprintf(F, "%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1056 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
1058 switch (get_type_tpop_code(tp)) {
1061 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
1062 fprintf(F, "\n members: \n");
1064 for (i = 0; i < get_class_n_members(tp); ++i) {
1065 ir_entity *mem = get_class_member(tp, i);
1066 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
1067 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
1068 if (!((verbosity & dump_verbosity_nostatic) && (get_entity_allocation(mem) == allocation_static))) {
1069 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1073 if (verbosity & dump_verbosity_typeattrs) {
1074 fprintf(F, " supertypes: ");
1075 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1076 ir_type *stp = get_class_supertype(tp, i);
1077 fprintf(F, "\n %d %s", i, get_type_name(stp));
1079 fprintf(F, "\n subtypes: ");
1080 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1081 ir_type *stp = get_class_subtype(tp, i);
1082 fprintf(F, "\n %d %s", i, get_type_name(stp));
1085 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1087 fprintf(F, "\n transitive supertypes: ");
1088 for (stp = get_class_trans_supertype_first(tp);
1090 stp = get_class_trans_supertype_next(tp)) {
1091 fprintf(F, "\n %s", get_type_name(stp));
1093 fprintf(F, "\n transitive subtypes: ");
1094 for (stp = get_class_trans_subtype_first(tp);
1096 stp = get_class_trans_subtype_next(tp)) {
1097 fprintf(F, "\n %s", get_type_name(stp));
1101 fprintf(F, "\n peculiarity: %s\n", get_peculiarity_name(get_class_peculiarity(tp)));
1102 fprintf(F, "\n flags: ");
1103 if (is_class_final(tp))
1104 fprintf(F, "final, ");
1105 if (is_class_interface(tp))
1106 fprintf(F, "interface, ");
1107 if (is_class_abstract(tp))
1108 fprintf(F, "abstract, ");
1115 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
1116 for (i = 0; i < get_compound_n_members(tp); ++i) {
1117 ir_entity *mem = get_compound_member(tp, i);
1118 if (verbosity & dump_verbosity_fields) {
1119 dump_entity_to_file_prefix(F, mem, " ", verbosity);
1125 if (verbosity & dump_verbosity_typeattrs) {
1127 ir_type *elem_tp = get_array_element_type(tp);
1129 fprintf(F, "\n array ");
1131 n_dim = get_array_n_dimensions(tp);
1132 for (i = 0; i < n_dim; ++i) {
1133 ir_node *lower, *upper;
1135 lower = get_array_lower_bound(tp, i);
1136 upper = get_array_upper_bound(tp, i);
1140 if (get_irn_op(lower) == op_Const)
1141 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1143 dump_node_opcode(F, lower);
1144 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1147 if (get_irn_op(upper) == op_Const)
1148 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1150 dump_node_opcode(F, upper);
1151 fprintf(F, " %ld]", get_irn_node_nr(upper));
1154 fprintf(F, " of <%s (%ld)>", get_type_name(elem_tp), get_type_nr(elem_tp));
1156 fprintf(F, "\n order: ");
1157 for (i = 0; i < n_dim; ++i)
1158 fprintf(F, "<%d>", get_array_order(tp, i));
1162 if (verbosity & dump_verbosity_fields) {
1163 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1170 if (verbosity & dump_verbosity_typeattrs) {
1171 ir_type *tt = get_pointer_points_to_type(tp);
1172 fprintf(F, "\n points to %s (%ld)\n", get_type_name(tt), get_type_nr(tt));
1177 if (verbosity & dump_verbosity_typeattrs) {
1178 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1179 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
1180 for (i = 0; i < get_method_n_ress(tp); ++i) {
1181 ir_type *rtp = get_method_res_type(tp, i);
1182 fprintf(F, "\n %s", get_type_name(rtp));
1185 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
1186 for (i = 0; i < get_method_n_params(tp); ++i) {
1187 ir_type *ptp = get_method_param_type(tp, i);
1188 fprintf(F, "\n %s", get_type_name(ptp));
1190 if (get_method_variadicity(tp)) {
1191 fprintf(F, "\n ...");
1198 if (verbosity & dump_verbosity_typeattrs) {
1199 ir_type *base_tp = get_primitive_base_type(tp);
1200 if (base_tp != NULL)
1201 fprintf(F, "\n base type: %s (%ld)", get_type_name(tp), get_type_nr(tp));
1213 if (verbosity & dump_verbosity_typeattrs) {
1214 fprintf(F, ": details not implemented\n");
1218 fprintf(F, " visibility: %s,\n", get_visibility_name(get_type_visibility(tp)));
1219 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
1220 fprintf(F, " size: %2d Bits,\n", get_type_size_bits(tp));
1221 fprintf(F, " alignment: %2d Bits,\n", get_type_alignment_bits(tp));
1222 if (is_atomic_type(tp) || is_Method_type(tp))
1223 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
1225 if (get_trouts_state()) {
1226 fprintf(F, "\n Type outs:\n");
1227 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
1228 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1229 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
1230 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1231 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1235 if (verbosity & dump_verbosity_accessStats) {
1237 int n_all = get_type_n_allocs(tp);
1242 /* Find maximal depth */
1243 for (i = 0; i < n_all; ++i) {
1244 ir_node *all = get_type_alloc(tp, i);
1245 int depth = get_weighted_loop_depth(all);
1246 max_depth = (depth > max_depth) ? depth : max_depth ;
1249 freq = xcalloc(max_depth+1, sizeof(freq[0]));
1251 for (i = 0; i < n_all; ++i) {
1252 ir_node *all = get_type_alloc(tp, i);
1253 int depth = get_weighted_loop_depth(all);
1254 assert(depth <= max_depth);
1256 max_freq = (depth > max_freq) ? depth : max_freq;
1257 assert(get_irn_op(all) == op_Alloc);
1260 if (max_freq >= 0) {
1263 fprintf(F, " Alloc Stats");
1264 for (i = 0; i <= max_freq; ++i) {
1265 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1273 #ifdef INTERPROCEDURAL_VIEW
1274 if (get_trouts_state() != outs_none) {
1275 fprintf(F, " Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1276 if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1277 fprintf(F, " Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1278 fprintf(F, " Estimated #Upcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1279 fprintf(F, " Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1280 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1290 void dump_type(ir_type *tp) {
1291 dump_type_to_file (stdout, tp, dump_verbosity_max);
1295 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1296 const char *basename;
1297 FILE *F, *CSV = NULL;
1298 int i, n_types = get_irp_n_types();
1300 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextTypes";
1301 F = text_open(basename, suffix, "-types", ".txt");
1303 if (verbosity & dump_verbosity_csv) {
1304 CSV = text_open(basename, suffix, "-types", ".csv");
1305 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1308 for (i = 0; i < n_types; ++i) {
1309 ir_type *t = get_irp_type(i);
1311 //if (is_jack_rts_class(t)) continue;
1313 dump_type_to_file(F, t, verbosity);
1314 #ifdef INTERPROCEDURAL_VIEW
1316 dump_typecsv_to_file(CSV, t, verbosity, "");
1322 if (CSV) fclose(CSV);
1326 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1327 const char *basename;
1328 FILE *F, *CSV = NULL;
1329 ir_type *g = get_glob_type();
1330 int i, n_mems = get_class_n_members(g);
1332 basename = irp_prog_name_is_set() ? get_irp_prog_name() : "TextGlobals";
1333 F = text_open (basename, suffix, "-globals", ".txt");
1335 if (verbosity & dump_verbosity_csv) {
1336 CSV = text_open (basename, suffix, "-types", ".csv");
1337 //fprintf(CSV, "Class, Field, Operation, L0, L1, L2, L3\n");
1340 for (i = 0; i < n_mems; ++i) {
1341 ir_entity *e = get_class_member(g, i);
1343 dump_entity_to_file(F, e, verbosity);
1345 //dump_entitycsv_to_file_prefix(CSV, e, "", verbosity, ""???);
1350 if (CSV) fclose (CSV);