bdd2ac279e96d1b3dda2ac61be52d79de4418aad
[libfirm] / ir / ir / irdumptxt.c
1 /*
2  * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
3  *
4  * This file is part of libFirm.
5  *
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.
10  *
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.
14  *
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
17  * PURPOSE.
18  */
19
20 /**
21  * @file
22  * @brief   Write vcg representation of firm to file.
23  * @author  Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt
24  * @version $Id$
25  */
26 #include "config.h"
27
28 #include <string.h>
29 #include <stdlib.h>
30 #include <stdarg.h>
31
32 #include "irdump_t.h"
33 #include "irgraph_t.h"
34
35 #include "irprog_t.h"
36 #include "entity_t.h"
37 #include "trouts.h"
38 #include "irgwalk.h"
39 #include "tv_t.h"
40 #include "vrp.h"
41 #include "irprintf.h"
42 #include "error.h"
43
44 #include "irdom.h"
45 #include "field_temperature.h"
46
47 #define MY_SIZE 1024     /* Size of an array that actually should be computed. */
48
49 /**
50  * Just opens a file, mangling a file name.
51  *
52  * The file name results from the concatenation of the following parts:
53  *
54  * @param basename  The basis of the name telling about the content.
55  * @param suffix1   The first suffix.
56  * @param suffix2   The second suffix.
57  * @param suffix3   The third suffix.
58  */
59 static FILE *text_open(const char *basename, const char * suffix1, const char *suffix2, const char *suffix3)
60 {
61         FILE *F;
62         int len = strlen(basename), i, j;
63         char *fname;  /* filename to put the vcg information in */
64
65         if (!basename) assert(basename);
66         if (!suffix1) suffix1 = "";
67         if (!suffix2) suffix2 = "";
68         if (!suffix3) suffix3 = ".txt";
69
70         /* open file for vcg graph */
71         fname = XMALLOCN(char, strlen(basename)*2 + strlen(suffix1) + strlen(suffix2) + 5); /* *2: space for escapes. */
72
73         j = 0;
74         for (i = 0; i < len; ++i) {  /* replace '/' in the name: escape by @. */
75                 if (basename[i] == '/') {
76                         fname[j] = '@'; j++; fname[j] = '1'; j++;
77                 } else if (basename[i] == '@') {
78                         fname[j] = '@'; j++; fname[j] = '2'; j++;
79                 } else {
80                         fname[j] = basename[i]; j++;
81                 }
82         }
83         fname[j] = '\0';
84         strcat(fname, suffix1);  /* append file suffix */
85         strcat(fname, suffix2);  /* append file suffix */
86         strcat(fname, suffix3);  /* append the .txt suffix */
87
88         F = fopen(fname, "w");   /* open file for writing */
89         if (!F) {
90                 perror(fname);
91                 abort();
92         }
93         free(fname);
94
95         return F;
96 }
97
98 static inline int is_ip_Filter(ir_node *n)
99 {
100 #ifdef INTERPROCEDURAL_VIEW
101         return is_Filter(n) && get_interprocedural_view();
102 #else
103         (void) n;
104         return 0;
105 #endif
106 }
107
108 /* Write the irnode and all its attributes to the file passed. */
109 int dump_irnode_to_file(FILE *F, ir_node *n)
110 {
111         int      i, bad = 0;
112         char     comma;
113         ir_graph *irg;
114         vrp_attr *vrp_info;
115
116         dump_node_opcode(F, n);
117         fprintf(F, " %ld\n", get_irn_node_nr(n));
118
119         fprintf(F, "  index: %u\n", get_irn_idx(n));
120         if (opt_dump_pointer_values_to_info)
121                 fprintf (F, "  addr:    %p\n", (void *)n);
122         fprintf (F, "  mode:    %s\n", get_mode_name(get_irn_mode(n)));
123         fprintf (F, "  visited: %ld\n", get_irn_visited(n));
124         irg = get_irn_irg(n);
125         if (irg != get_const_code_irg())
126                 fprintf (F, "  irg:     %s\n", get_ent_dump_name(get_irg_entity(irg)));
127
128         if (get_irn_pinned(n) == op_pin_state_floats &&
129                 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
130                 fprintf(F, "  node was pinned in ");
131                 dump_node_opcode(F, get_irn_n(n, -1));
132                 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
133         }
134
135 #ifdef INTERPROCEDURAL_VIEW
136         fprintf(F, "  arity:   %d\n", get_irn_intra_arity(n));
137         /* show all predecessor nodes */
138         fprintf(F, "  pred nodes:\n");
139         if (!is_Block(n)) {
140                 fprintf(F, "    -1:    ");
141                 dump_node_opcode(F, get_irn_n(n, -1));
142                 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
143         }
144         for ( i = 0; i < get_irn_intra_arity(n); ++i) {
145                 fprintf(F, "     %d: %s ", i, is_intra_backedge(n, i) ? "be" : "  ");
146                 dump_node_opcode(F, get_irn_intra_n(n, i));
147                 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_intra_n(n, i)));
148         }
149 #else
150         fprintf(F, "  arity:   %d\n", get_irn_arity(n));
151         /* show all predecessor nodes */
152         fprintf(F, "  pred nodes:\n");
153         if (!is_Block(n)) {
154                 fprintf(F, "    -1:    ");
155                 dump_node_opcode(F, get_irn_n(n, -1));
156                 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
157         }
158         for ( i = 0; i < get_irn_arity(n); ++i) {
159                 fprintf(F, "     %d: %s ", i, is_backedge(n, i) ? "be" : "  ");
160                 dump_node_opcode(F, get_irn_n(n, i));
161                 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
162         }
163 #endif
164
165         fprintf(F, "  Private Attributes:\n");
166
167         if (is_Proj(n))
168                 fprintf(F, "  proj nr: %ld\n", get_Proj_proj(n));
169
170 #ifdef INTERPROCEDURAL_VIEW
171         if ((get_irp_ip_view_state() != ip_view_no) && (is_Filter(n) || is_Block(n))) {
172                 fprintf(F, "  inter arity: %d\n", get_irn_inter_arity(n));
173                 fprintf(F, "  inter pred nodes:\n");
174                 for (i = 0; i < get_irn_inter_arity(n); ++i) {
175                         fprintf(F, "     %d: %s ", i, is_intra_backedge(n, i) ? "be" : "  ");
176                         dump_node_opcode(F, get_irn_inter_n(n, i));
177                         fprintf(F, " %ld\n", get_irn_node_nr(get_irn_inter_n(n, i)));
178                 }
179         }
180 #endif
181
182         if (is_fragile_op(n)) {
183                 fprintf(F, "  pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
184                 /* not dumped: frag array */
185         }
186
187         /* This is not nice, output it as a marker in the predecessor list. */
188         if (is_Block(n)             ||
189             get_irn_op(n) == op_Phi ||
190             (is_ip_Filter(n))) {
191                 fprintf(F, "  backedges:");
192                 comma = ' ';
193                 for (i = 0; i < get_irn_arity(n); i++)
194                         if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
195                         fprintf(F, "\n");
196         }
197
198         /* Loop node.   Someone else please tell me what's wrong ... */
199         if (get_irg_loopinfo_state(irg) & loopinfo_valid) {
200                 ir_loop *loop = get_irn_loop(n);
201                 if (loop != NULL) {
202                         fprintf(F, "  in loop %d with depth %d\n",
203                                 get_loop_loop_nr(loop), get_loop_depth(loop));
204                 }
205         }
206
207         /* Source types */
208         switch (get_irn_opcode(n)) {
209         case iro_Block: {
210                 if (has_Block_entity(n))
211                         fprintf(F, "  Label: %lu\n", get_entity_label(get_Block_entity(n)));
212                 ir_fprintf(F, "  macro Block: %+F\n", get_Block_MacroBlock(n));
213                 fprintf(F, "  block visited: %ld\n", get_Block_block_visited(n));
214                 fprintf(F, "  block marked: %u\n", get_Block_mark(n));
215                 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
216                         fprintf(F, "  dom depth %d\n", get_Block_dom_depth(n));
217                         fprintf(F, "  tree pre num %d\n", get_Block_dom_tree_pre_num(n));
218                         fprintf(F, "  max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
219                 }
220
221                 fprintf(F, "  Execution frequency statistics:\n");
222                 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
223                         fprintf(F, "    procedure local evaluation:   %8.2lf\n", get_irn_exec_freq(n));
224 #ifdef INTERPROCEDURAL_VIEW
225                 if (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none)
226                         fprintf(F, "    call frequency of procedure:   %8.2lf\n",
227                         get_irg_method_execution_frequency(get_irn_irg(n)));
228                 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent)
229                         fprintf(F, "    recursion depth of procedure: %8.2lf\n", (double)get_irn_recursion_depth(n));
230                 if ((get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none) &&
231                         (get_irp_loop_nesting_depth_state() != loop_nesting_depth_none) &&
232                         (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent))
233                         fprintf(F, "    final evaluation:           **%8.2lf**\n", get_irn_final_cost(n));
234 #endif
235
236                 /* not dumped: graph_arr */
237                 /* not dumped: mature    */
238         }  break;
239         case iro_Start: {
240                 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
241                 ir_fprintf(F, "  start of method of type %+F\n", tp);
242                 for (i = 0; i < get_method_n_params(tp); ++i)
243                         ir_fprintf(F, "    param %d type: %+F\n", i, get_method_param_type(tp, i));
244 #ifdef INTERPROCEDURAL_VIEW
245                 if ((get_irp_ip_view_state() == ip_view_valid) && !get_interprocedural_view()) {
246                         ir_node *sbl = get_nodes_block(n);
247                         int i, n_cfgpreds = get_Block_cg_n_cfgpreds(sbl);
248                         fprintf(F, "  graph has %d interprocedural predecessors:\n", n_cfgpreds);
249                         for (i = 0; i < n_cfgpreds; ++i) {
250                                 ir_node *cfgpred = get_Block_cg_cfgpred(sbl, i);
251                                 fprintf(F, "    %d: Call %ld in graph %s\n", i,
252                                         get_irn_node_nr(cfgpred),
253                                         get_irg_dump_name(get_irn_irg(cfgpred)));
254                         }
255                 }
256 #endif
257         } break;
258         case iro_Cond: {
259                 fprintf(F, "  default ProjNr: %ld\n", get_Cond_default_proj(n));
260                 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE) {
261                         fprintf(F, "  jump prediction: %s\n",
262                                 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
263                 }
264         } break;
265         case iro_Alloc: {
266                 ir_fprintf(F, "  allocating entity of type: %+F\n", get_Alloc_type(n));
267                 fprintf(F, "  allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
268         } break;
269         case iro_Free: {
270                 ir_fprintf(F, "  freeing entity of type %+F\n", get_Free_type(n));
271                 fprintf(F, "  allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
272         } break;
273         case iro_Sel: {
274                 ir_entity *ent = get_Sel_entity(n);
275                 if (ent) {
276                         fprintf(F, "  Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
277                         ir_fprintf(F, "    of type    %+F\n",  get_entity_type(ent));
278                         ir_fprintf(F, "    with owner %+F.\n", get_entity_owner(ent));
279                 }
280                 else {
281                         fprintf(F, "  <NULL entity>\n");
282                         bad = 1;
283                 }
284         } break;
285         case iro_Call: {
286                 ir_type *tp = get_Call_type(n);
287                 if (get_Call_tail_call(n))
288                         fprintf(F, "  tail call\n");
289                 ir_fprintf(F, "  calling method of type %+F\n", tp);
290                 if (get_unknown_type() != tp) {
291                         for (i = 0; i < get_method_n_params(tp); ++i)
292                                 ir_fprintf(F, "    param %d type: %+F\n", i, get_method_param_type(tp, i));
293                         for (i = 0; i < get_method_n_ress(tp); ++i)
294                                 ir_fprintf(F, "    result %d type: %+F\n", i, get_method_res_type(tp, i));
295                 }
296                 if (Call_has_callees(n)) {
297                         fprintf(F, "  possible callees:\n");
298                         for (i = 0; i < get_Call_n_callees(n); i++) {
299                                 fprintf(F, "    %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
300                         }
301                 }
302         } break;
303         case iro_CallBegin: {
304                 ir_node *call = get_CallBegin_call(n);
305                 fprintf(F, "  Call: %ld\n", get_irn_node_nr(call));
306                 if (Call_has_callees(call)) {
307                         fprintf(F, "  possible callees:\n");
308                         for (i = 0; i < get_Call_n_callees(call); i++) {
309                                 fprintf(F, "    %d: %s\n", i, get_ent_dump_name(get_Call_callee(call, i)));
310                         }
311                 }
312         } break;
313         case iro_Cast: {
314                 ir_fprintf(F, "  cast to type: %+F\n", get_Cast_type(n));
315         } break;
316         case iro_Return: {
317 #ifdef INTERPROCEDURAL_VIEW
318                 if (!get_interprocedural_view()) {
319 #endif
320                         ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
321                         ir_fprintf(F, "  return in method of type %+F\n", tp);
322                         for (i = 0; i < get_method_n_ress(tp); ++i) {
323                                 ir_fprintf(F, "    result %d type: %+F\n", i,
324                                            get_method_res_type(tp, i));
325                         }
326 #ifdef INTERPROCEDURAL_VIEW
327                 }
328 #endif
329         } break;
330         case iro_Const: {
331                 assert(get_Const_type(n) != firm_none_type);
332                 ir_fprintf(F, "  Const of type %+F\n", get_Const_type(n));
333         } break;
334         case iro_SymConst: {
335                 switch (get_SymConst_kind(n)) {
336                 case symconst_addr_ent:
337                         fprintf(F, "  kind:   addr_ent\n");
338                         fprintf(F, "  entity: ");
339                         dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
340                         break;
341                 case symconst_ofs_ent:
342                         fprintf(F, "  kind:   offset\n");
343                         fprintf(F, "  entity: ");
344                         dump_entity_to_file(F, get_SymConst_entity(n), dump_verbosity_onlynames);
345                         break;
346                 case symconst_type_tag:
347                         fprintf(F, "  kind: type_tag\n");
348                         fprintf(F, "  type: ");
349                         dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
350                         break;
351                 case symconst_type_size:
352                         fprintf(F, "  kind: size\n");
353                         fprintf(F, "  type: ");
354                         dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
355                         break;
356                 case symconst_type_align:
357                         fprintf(F, "  kind: alignment\n");
358                         fprintf(F, "  type: ");
359                         dump_type_to_file(F, get_SymConst_type(n), dump_verbosity_onlynames);
360                         break;
361                 case symconst_enum_const:
362                         fprintf(F, "  kind: enumeration\n");
363                         fprintf(F, "  name: %s\n", get_enumeration_const_name(get_SymConst_enum(n)));
364                         break;
365                 }
366                 ir_fprintf(F, "  type of value: %+F\n", get_SymConst_value_type(n));
367         } break;
368         case iro_Load:
369                 fprintf(F, "  mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), &bad));
370                 fprintf(F, "  volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
371                 fprintf(F, "  align: %s\n", get_align_name(get_Load_align(n)));
372                 break;
373         case iro_Store:
374                 fprintf(F, "  volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
375                 fprintf(F, "  align: %s\n", get_align_name(get_Store_align(n)));
376                 break;
377         case iro_Confirm:
378                 fprintf(F, "  compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
379                 break;
380         case iro_ASM: {
381                 const ir_asm_constraint *cons;
382                 ident **clobber;
383                 int l;
384
385                 fprintf(F, "  assembler text: %s", get_id_str(get_ASM_text(n)));
386                 l = get_ASM_n_input_constraints(n);
387                 if (l > 0) {
388                         fprintf(F, "\n  inputs:  ");
389                         cons = get_ASM_input_constraints(n);
390                         for (i = 0; i < l; ++i)
391                                 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
392                 }
393                 l = get_ASM_n_output_constraints(n);
394                 if (l > 0) {
395                         fprintf(F, "\n  outputs: ");
396                         cons = get_ASM_output_constraints(n);
397                         for (i = 0; i < l; ++i)
398                                 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
399                 }
400                 l = get_ASM_n_clobbers(n);
401                 if (l > 0) {
402                         fprintf(F, "\n  clobber: ");
403                         clobber = get_ASM_clobbers(n);
404                         for (i = 0; i < l; ++i)
405                                 fprintf(F, "%s ", get_id_str(clobber[i]));
406                 }
407                 if (get_irn_pinned(n) != op_pin_state_floats)
408                         fprintf(F, "\n  volatile");
409                 fprintf(F, "\n");
410         } break;
411
412         default:
413                 break;
414         }
415
416         vrp_info = vrp_get_info(n);
417         if (vrp_info) {
418                 dump_vrp_info(F, n);
419         }
420
421         if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent  ||
422                 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent  )
423                 if (get_irn_typeinfo_type(n) != firm_none_type)
424                         ir_fprintf (F, "  Analysed type: %s\n", get_irn_typeinfo_type(n));
425
426         return bad;
427 }
428
429
430
431 void dump_irnode(ir_node *n)
432 {
433         dump_irnode_to_file(stdout, n);
434 }
435
436
437 void dump_graph_to_file(FILE *F, ir_graph *irg)
438 {
439         fprintf(F, "graph %s\n", get_irg_dump_name(irg));
440 }
441
442 void dump_graph(ir_graph *g)
443 {
444         dump_graph_to_file(stdout, g);
445 }
446
447 static void dump_node_to_graph_file(ir_node *n, void *env)
448 {
449         FILE *F = (FILE *)env;
450
451         dump_irnode_to_file(F, n);
452         fprintf(F, "\n");
453 }
454
455 void dump_graph_as_text(ir_graph *irg, const char *suffix)
456 {
457         const char *basename = get_irg_dump_name(irg);
458         FILE *F;
459
460         F = text_open(basename, suffix, "", ".txt");
461
462         dump_graph_to_file(F, irg);
463         fprintf(F, "\n\n");
464         irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
465
466         fclose (F);
467 }
468
469 #ifdef EXTENDED_ACCESS_STATS
470 static int addr_is_alloc(ir_node *acc)
471 {
472         ir_node *addr = NULL;
473         ir_opcode addr_op;
474         if (is_memop(acc)) {
475                 addr = get_memop_ptr(acc);
476         } else {
477                 assert(is_Call(acc));
478                 addr = get_Call_ptr(acc);
479         }
480
481         addr_op = get_irn_opcode(addr);
482
483         while (addr_op != iro_Alloc) {
484                 switch (addr_op) {
485                 case iro_Sel:
486                         addr = get_Sel_ptr(addr);
487                         break;
488                 case iro_Cast:
489                         addr = get_Cast_op(addr);
490                         break;
491                 case iro_Proj:
492                         addr = get_Proj_pred(addr);
493                         break;
494                 case iro_SymConst:
495                 case iro_Const:
496                         return 0;
497                         break;
498                 case iro_Phi:
499                 case iro_Load:
500                 case iro_Call:
501                 case iro_Start:
502                         return 0;
503                         break;
504
505                 default:
506                         //DDMN(addr);
507                         //assert(0 && "unexpected address node");
508                         ;
509                 }
510                 addr_op = get_irn_opcode(addr);
511         }
512
513         /* In addition, the alloc must be in the same loop. */
514         return 1;
515 }
516 #endif
517
518 /** dumps something like:
519  *
520  *  "prefix"  "Name" (x): node1, ... node7,\n
521  *  "prefix"    node8, ... node15,\n
522  *  "prefix"    node16, node17\n
523  */
524 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
525                            int (*get_entity_n_nodes)(firm_kind *ent),
526                            ir_node *(*get_entity_node)(firm_kind *ent, int pos),
527                            char *name)
528 {
529         int i, n_nodes = get_entity_n_nodes(k);
530         char *comma = "";
531
532         fprintf(F, "%s  %s (%d):", prefix, name, n_nodes);
533         for (i = 0; i < n_nodes; ++i) {
534                 int rem;
535                 if (i > 7 && !(i & 7)) { /* line break every eight node. */
536                         fprintf(F, ",\n%s   ", prefix);
537                         comma = "";
538                 }
539                 fprintf(F, "%s ", comma);
540                 rem = opt_dump_analysed_type_info;
541                 opt_dump_analysed_type_info = 0;
542                 dump_node_label(F, get_entity_node(k, i));
543                 opt_dump_analysed_type_info = rem;
544                 comma = ",";
545         }
546         fprintf(F, "\n");
547 }
548
549 /** dumps something like:
550  *
551  *  "prefix"  "Name" (x): node1, ... node7,\n
552  *  "prefix"    node8, ... node15,\n
553  *  "prefix"    node16, node17\n
554  */
555 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
556                            int (*get_n_types)(const ir_type *tp),
557                            ir_type *(*get_type)(const ir_type *tp, int pos),
558                            const char *name)
559 {
560         int i, n_nodes = get_n_types(tp);
561         char *comma = "";
562
563         fprintf(F, "%s  %s (%d):", prefix, name, n_nodes);
564         for (i = 0; i < n_nodes; ++i) {
565                 if (i > 7 && !(i & 7)) { /* line break every eight node. */
566                         fprintf(F, ",\n%s   ", prefix);
567                         comma = "";
568                 }
569                 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
570                 comma = ",";
571         }
572         fprintf(F, "\n");
573 }
574
575 static int need_nl = 1;
576
577 /**
578  * Dump initializers.
579  */
580 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
581                                                                                  const ir_initializer_t *initializer, ir_type *type)
582 {
583         tarval  *tv;
584         ir_node *value;
585
586         if (need_nl) {
587                 fprintf(F, "\n%s    ", prefix);
588                 need_nl = 0;
589         }
590         switch (get_initializer_kind(initializer)) {
591         case IR_INITIALIZER_NULL:
592                 fprintf(F, "\t = <NOT_SET>");
593                 break;
594         case IR_INITIALIZER_TARVAL:
595                 tv = get_initializer_tarval_value(initializer);
596                 ir_fprintf(F, "\t = <TV>%F", tv);
597                 break;
598         case IR_INITIALIZER_CONST:
599                 value = get_initializer_const_value(initializer);
600                 fprintf(F, "\t = <CONST>");
601                 dump_node_opcode(F, value);
602                 break;
603         case IR_INITIALIZER_COMPOUND:
604                 if (is_Array_type(type)) {
605                         size_t i, n = get_initializer_compound_n_entries(initializer);
606                         ir_type *element_type = get_array_element_type(type);
607                         for (i = 0; i < n; ++i) {
608                                 ir_initializer_t *sub_initializer
609                                         = get_initializer_compound_value(initializer, i);
610
611                                 if (need_nl) {
612                                         fprintf(F, "\n%s    ", prefix);
613                                         need_nl = 0;
614                                 }
615                                 fprintf(F, "[%d]", (int) i);
616                                 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
617                         }
618                 } else {
619                         size_t i, n;
620                         assert(is_compound_type(type));
621                         n = get_compound_n_members(type);
622                         for (i = 0; i < n; ++i) {
623                                 ir_entity        *member    = get_compound_member(type, i);
624                                 ir_type          *subtype   = get_entity_type(member);
625                                 ir_initializer_t *sub_initializer;
626
627                                 assert(i < get_initializer_compound_n_entries(initializer));
628                                 sub_initializer
629                                         = get_initializer_compound_value(initializer, i);
630
631                                 if (need_nl) {
632                                         fprintf(F, "\n%s    ", prefix);
633                                         need_nl = 0;
634                                 }
635                                 ir_fprintf(F, ".%F", member);
636                                 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
637                         }
638                 }
639                 break;
640         default:
641                 panic("invalid ir_initializer kind found");
642         }
643         need_nl = 1;
644 }
645
646 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
647 {
648         ir_linkage linkage = get_entity_linkage(entity);
649
650         if (linkage & IR_LINKAGE_CONSTANT)
651                 fprintf(F, " constant");
652         if (linkage & IR_LINKAGE_WEAK)
653                 fprintf(F, " weak");
654         if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
655                 fprintf(F, " garbage_collect");
656         if (linkage & IR_LINKAGE_MERGE)
657                 fprintf(F, " merge");
658         if (linkage & IR_LINKAGE_HIDDEN_USER)
659                 fprintf(F, " hidden_user");
660 }
661
662 static void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix,
663                                        unsigned verbosity)
664 {
665         int i, j;
666         ir_type *owner, *type;
667
668         assert(is_entity(ent));
669         owner = get_entity_owner(ent);
670         type  = get_entity_type(ent);
671         if (verbosity & dump_verbosity_onlynames) {
672                 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
673                         get_entity_name(ent), get_entity_nr(ent));
674                 return;
675         }
676
677         if (verbosity & dump_verbosity_entattrs) {
678                 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
679                 ir_fprintf(F, "%s  type:  %+F\n", prefix, type);
680                 ir_fprintf(F, "%s  owner: %+F\n", prefix, owner);
681
682                 if (is_Class_type(get_entity_owner(ent))) {
683                         if (get_entity_n_overwrites(ent) > 0) {
684                                 fprintf(F, "%s  overwrites:\n", prefix);
685                                 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
686                                         ir_entity *ov = get_entity_overwrites(ent, i);
687                                         ir_fprintf(F, "%s    %d: %s of class %+F\n", prefix, i,
688                                                 get_entity_name(ov), get_entity_owner(ov));
689                                 }
690                         } else {
691                                 fprintf(F, "%s  Does not overwrite other entities.\n", prefix);
692                         }
693                         if (get_entity_n_overwrittenby(ent) > 0) {
694                                 fprintf(F, "%s  overwritten by:\n", prefix);
695                                 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
696                                         ir_entity *ov = get_entity_overwrittenby(ent, i);
697                                         ir_fprintf(F, "%s    %d: %s of class %+F\n", prefix, i,
698                                                    get_entity_name(ov), get_entity_owner(ov));
699                                 }
700                         } else {
701                                 fprintf(F, "%s  Is not overwritten by other entities.\n",
702                                         prefix);
703                         }
704
705                         if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
706                                 ir_entity *ov;
707                                 fprintf(F, "%s  transitive overwrites:\n", prefix);
708                                 for (ov = get_entity_trans_overwrites_first(ent);
709                                 ov;
710                                 ov = get_entity_trans_overwrites_next(ent)) {
711                                         ir_fprintf(F, "%s    : %s of class %+F\n", prefix,
712                                                    get_entity_name(ov), get_entity_owner(ov));
713                                 }
714                                 fprintf(F, "%s  transitive overwritten by:\n", prefix);
715                                 for (ov = get_entity_trans_overwrittenby_first(ent);
716                                 ov;
717                                 ov = get_entity_trans_overwrittenby_next(ent)) {
718                                         ir_fprintf(F, "%s    : %s of class %+F\n", prefix,
719                                                    get_entity_name(ov), get_entity_owner(ov));
720                                 }
721                         }
722                 }
723
724                 fprintf(F, "%s  linkage:", prefix);
725                 dump_entity_linkage(F, ent);
726
727                 if (is_Method_type(get_entity_type(ent))) {
728                         unsigned mask = get_entity_additional_properties(ent);
729                         unsigned cc   = get_method_calling_convention(get_entity_type(ent));
730                         ir_graph *irg = get_entity_irg(ent);
731
732                         if (irg) {
733                                 fprintf(F, "\n%s  estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
734                                 fprintf(F, "\n%s  maximum node index:   %u", prefix, get_irg_last_idx(irg));
735                         }
736
737                         if (mask) {
738                                 fprintf(F, "\n%s  additional prop: ", prefix);
739
740                                 if (mask & mtp_property_const)         fputs("const_function, ", F);
741                                 if (mask & mtp_property_pure)          fputs("pure_function, ", F);
742                                 if (mask & mtp_property_noreturn)      fputs("noreturn_function, ", F);
743                                 if (mask & mtp_property_nothrow)       fputs("nothrow_function, ", F);
744                                 if (mask & mtp_property_naked)         fputs("naked_function, ", F);
745                                 if (mask & mtp_property_malloc)        fputs("malloc_function, ", F);
746                                 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
747                                 if (mask & mtp_property_intrinsic)     fputs("intrinsic_function, ", F);
748                                 if (mask & mtp_property_runtime)       fputs("runtime_function, ", F);
749                                 if (mask & mtp_property_private)       fputs("private_function, ", F);
750                                 if (mask & mtp_property_has_loop)      fputs("has_loop_function, ", F);
751                         }
752                         fprintf(F, "\n%s  calling convention: ", prefix);
753                         if (cc & cc_reg_param)           fputs("regparam, ", F);
754                         if (cc & cc_this_call)           fputs("thiscall, ", F);
755                         if (cc & cc_compound_ret)        fputs("compound_ret, ", F);
756                         if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
757                         cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
758                         if (IS_CDECL(cc))
759                                 fputs("cdecl", F);
760                         else if (IS_STDCALL(cc))
761                                 fputs("stdcall", F);
762                         else {
763                                 fputs(cc & cc_last_on_top      ? "last param on top, " : "first param on top, ", F);
764                                 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
765                         }
766                         fprintf(F, "\n%s  vtable number:        %u", prefix, get_entity_vtable_number(ent));
767                 }
768
769                 fputc('\n', F);
770         } else {  /* no entattrs */
771                 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
772                         get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
773                         get_entity_type(ent), get_entity_name(ent));
774                 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
775
776                 if (verbosity & dump_verbosity_accessStats) {
777                         dump_entity_linkage(F, ent);
778                 }
779                 fputc('\n', F);
780         }
781
782         if (verbosity & dump_verbosity_entconsts) {
783                 if (ent->initializer != NULL) {
784                         const ir_initializer_t *initializer = get_entity_initializer(ent);
785                         fprintf(F, "\n%s  Initializers:", prefix);
786                         need_nl = 1;
787                         dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
788                 } else if (entity_has_compound_ent_values(ent)) {
789                         fprintf(F, "%s  compound values:", prefix);
790                         for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
791                                 compound_graph_path *path = get_compound_ent_value_path(ent, i);
792                                 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
793                                 fprintf(F, "\n%s    %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
794                                 if (get_type_state(type) == layout_fixed)
795                                         fprintf(F, "(%3u:%u) ",   get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
796                                 fprintf(F, "%s", get_entity_name(ent));
797                                 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
798                                         ir_entity *node = get_compound_graph_path_node(path, j);
799                                         fprintf(F, ".%s", get_entity_name(node));
800                                         if (is_Array_type(get_entity_owner(node)))
801                                                 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
802                                 }
803                                 fprintf(F, "\t = ");
804                                 dump_node_opcode(F, get_compound_ent_value(ent, i));
805                         }
806                         fputc('\n', F);
807                 }
808         }
809
810         if (verbosity & dump_verbosity_entattrs) {
811                 fprintf(F, "%s  linkage:", prefix);
812                 dump_entity_linkage(F, ent);
813                 fprintf(F, "%s  volatility:  %s", prefix, get_volatility_name(get_entity_volatility(ent)));
814                 fprintf(F, "\n%s  aligned:  %s", prefix, get_align_name(get_entity_aligned(ent)));
815                 fprintf(F, "\n%s  alignment:  %u", prefix, get_entity_alignment(ent));
816                 fprintf(F, "\n%s  ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
817                 fprintf(F, "\n%s  offset:  %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
818                 if (is_Method_type(get_entity_type(ent))) {
819                         if (get_entity_irg(ent))   /* can be null */ {
820                                 fprintf(F, "\n%s  irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
821 #ifdef INTERPROCEDURAL_VIEW
822                                 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
823                                         fprintf(F, "\n%s    recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
824                                         fprintf(F, "\n%s    loop depth      %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
825                                 }
826 #endif
827                         } else {
828                                 fprintf(F, "\n%s  irg = NULL", prefix);
829                         }
830                 }
831                 fputc('\n', F);
832         }
833
834         if (get_trouts_state()) {
835                 fprintf(F, "%s  Entity outs:\n", prefix);
836                 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
837                         (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
838                 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
839                         (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
840         }
841
842         if (verbosity & dump_verbosity_accessStats) {
843 #ifdef EXTENDED_ACCESS_STATS
844                 int n_acc = get_entity_n_accesses(ent);
845                 int max_depth = 0;
846                 int max_L_freq = -1;
847                 int max_S_freq = -1;
848                 int max_LA_freq = -1;
849                 int max_SA_freq = -1;
850                 int *L_freq;
851                 int *S_freq;
852                 int *LA_freq;
853                 int *SA_freq;
854
855                 /* Find maximal depth */
856                 for (i = 0; i < n_acc; ++i) {
857                         ir_node *acc = get_entity_access(ent, i);
858                         int depth = get_weighted_loop_depth(acc);
859                         max_depth = (depth > max_depth) ? depth : max_depth ;
860                 }
861
862                 L_freq = XMALLOCNZ(int, 4 * max_depth);
863
864                 S_freq  = L_freq + 1*max_depth;
865                 LA_freq = L_freq + 2*max_depth;
866                 SA_freq = L_freq + 3*max_depth;
867
868                 for (i = 0; i < n_acc; ++i) {
869                         ir_node *acc = get_entity_access(ent, i);
870                         int depth = get_weighted_loop_depth(acc);
871                         assert(depth < max_depth);
872                         if (is_Load(acc) || is_Call(acc)) {
873                                 L_freq[depth]++;
874                                 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
875                                 if (addr_is_alloc(acc)) {
876                                         LA_freq[depth]++;
877                                         max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
878                                 }
879                         } else if (is_Store(acc)) {
880                                 S_freq[depth]++;
881                                 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
882                                 if (addr_is_alloc(acc)) {
883                                         SA_freq[depth]++;
884                                         max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
885                                 }
886                         } else {
887                                 assert(0);
888                         }
889                 }
890
891                 if (max_L_freq >= 0) {
892                         char comma = ':';
893
894                         fprintf(F, "%s  Load  Stats", prefix);
895                         for (i = 0; i <= max_L_freq; ++i) {
896                                 if (L_freq[i])
897                                         fprintf(F, "%c %d x  L%d", comma, L_freq[i], i);
898                                 else
899                                         fprintf(F, "         ");
900                                 comma = ',';
901                         }
902                         fprintf(F, "\n");
903                 }
904                 if (max_LA_freq >= 0) {
905                         //fprintf(F, "%s  LoadA Stats", prefix);
906                         char comma = ':';
907                         for (i = 0; i <= max_LA_freq; ++i) {
908                                 //if (LA_freq[i])
909                                 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
910                                 //else
911                                 //fprintf(F, "         ");
912                                 comma = ',';
913                         }
914                         fprintf(F, "\n");
915                 }
916                 if (max_S_freq >= 0) {
917                         char comma = ':';
918
919                         fprintf(F, "%s  Store Stats", prefix);
920                         for (i = 0; i <= max_S_freq; ++i) {
921                                 if (S_freq[i])
922                                         fprintf(F, "%c %d x  S%d", comma, S_freq[i], i);
923                                 else
924                                         fprintf(F, "         ");
925                                 comma = ',';
926                         }
927                         fprintf(F, "\n");
928                 }
929                 if (max_SA_freq >= 0) {
930                         //fprintf(F, "%s  StoreAStats", prefix);
931                         char comma = ':';
932                         for (i = 0; i <= max_SA_freq; ++i) {
933                                 //if (SA_freq[i])
934                                 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
935                                 //else
936                                 //fprintf(F, "         ");
937                                 comma = ',';
938                         }
939                         fprintf(F, "\n");
940                 }
941
942                 /* free allocated space */
943                 free(L_freq);
944 #endif
945                 if (get_trouts_state() != outs_none) {
946 #ifdef INTERPROCEDURAL_VIEW
947                         if (is_Method_type(get_entity_type(ent))) {
948                                 fprintf(F, "%s  Estimated #Calls:    %lf\n", prefix, get_entity_estimated_n_calls(ent));
949                                 fprintf(F, "%s  Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
950                         } else {
951                                 fprintf(F, "%s  Estimated #Loads:  %lf\n", prefix, get_entity_estimated_n_loads(ent));
952                                 fprintf(F, "%s  Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
953                         }
954 #endif
955                 }
956         }
957 }
958
959 void dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity)
960 {
961         dump_entity_to_file_prefix (F, ent, "", verbosity);
962         fprintf(F, "\n");
963 }
964
965 void dump_entity(ir_entity *ent)
966 {
967   dump_entity_to_file(stdout, ent, dump_verbosity_max);
968 }
969
970 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity)
971 {
972         int i;
973
974         if ((is_Class_type(tp))       && (verbosity & dump_verbosity_noClassTypes)) return;
975         if ((is_Struct_type(tp))      && (verbosity & dump_verbosity_noStructTypes)) return;
976         if ((is_Union_type(tp))       && (verbosity & dump_verbosity_noUnionTypes)) return;
977         if ((is_Array_type(tp))       && (verbosity & dump_verbosity_noArrayTypes)) return;
978         if ((is_Pointer_type(tp))     && (verbosity & dump_verbosity_noPointerTypes)) return;
979         if ((is_Method_type(tp))      && (verbosity & dump_verbosity_noMethodTypes)) return;
980         if ((is_Primitive_type(tp))   && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
981         if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
982
983         ir_fprintf(F, "%+F", tp);
984         if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
985
986         switch (get_type_tpop_code(tp)) {
987
988         case tpo_class:
989                 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
990                         fprintf(F, "\n  members:\n");
991                 }
992                 for (i = 0; i < get_class_n_members(tp); ++i) {
993                         ir_entity *mem = get_class_member(tp, i);
994                         if (((verbosity & dump_verbosity_methods) &&  is_Method_type(get_entity_type(mem))) ||
995                                 ((verbosity & dump_verbosity_fields)  && !is_Method_type(get_entity_type(mem)))   ) {
996                                 if (!(verbosity & dump_verbosity_nostatic)) {
997                                         dump_entity_to_file_prefix(F, mem, "    ", verbosity);
998                                 }
999                         }
1000                 }
1001                 if (verbosity & dump_verbosity_typeattrs) {
1002                         fprintf(F, "  supertypes: ");
1003                         for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1004                                 ir_type *stp = get_class_supertype(tp, i);
1005                                 ir_fprintf(F, "\n    %d %+F", i, stp);
1006                         }
1007                         fprintf(F, "\n  subtypes: ");
1008                         for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1009                                 ir_type *stp = get_class_subtype(tp, i);
1010                                 ir_fprintf(F, "\n    %d %+F", i, stp);
1011                         }
1012
1013                         if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
1014                                 ir_type *stp;
1015                                 fprintf(F, "\n  transitive supertypes: ");
1016                                 for (stp = get_class_trans_supertype_first(tp);
1017                                 stp;
1018                                 stp = get_class_trans_supertype_next(tp)) {
1019                                         ir_fprintf(F, "\n    %+F", stp);
1020                                 }
1021                                 fprintf(F, "\n  transitive subtypes: ");
1022                                 for (stp = get_class_trans_subtype_first(tp);
1023                                 stp;
1024                                 stp = get_class_trans_subtype_next(tp)) {
1025                                         ir_fprintf(F, "\n    %+F", stp);
1026                                 }
1027                         }
1028
1029                         fprintf(F, "\n  flags:       ");
1030                         if (is_class_final(tp))
1031                                 fprintf(F, "final, ");
1032                         if (is_class_interface(tp))
1033                                 fprintf(F, "interface, ");
1034                         if (is_class_abstract(tp))
1035                                 fprintf(F, "abstract, ");
1036                         fprintf(F, "\n");
1037                 }
1038                 break;
1039
1040         case tpo_union:
1041         case tpo_struct:
1042                 if (verbosity & dump_verbosity_fields) fprintf(F, "\n  members: ");
1043                 for (i = 0; i < get_compound_n_members(tp); ++i) {
1044                         ir_entity *mem = get_compound_member(tp, i);
1045                         if (verbosity & dump_verbosity_fields) {
1046                                 dump_entity_to_file_prefix(F, mem, "    ", verbosity);
1047                         }
1048                 }
1049                 break;
1050
1051         case tpo_array:
1052                 if (verbosity & dump_verbosity_typeattrs) {
1053                         int i, n_dim;
1054                         ir_type *elem_tp = get_array_element_type(tp);
1055
1056                         fprintf(F, "\n  array ");
1057
1058                         n_dim = get_array_n_dimensions(tp);
1059                         for (i = 0; i < n_dim; ++i) {
1060                                 ir_node *lower, *upper;
1061
1062                                 lower = get_array_lower_bound(tp, i);
1063                                 upper = get_array_upper_bound(tp, i);
1064
1065                                 fprintf(F, "[");
1066
1067                                 if (is_Const(lower)) {
1068                                         fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1069                                 } else {
1070                                         dump_node_opcode(F, lower);
1071                                         fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1072                                 }
1073
1074                                 if (is_Const(upper)) {
1075                                         fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1076                                 } else {
1077                                         dump_node_opcode(F, upper);
1078                                         fprintf(F, " %ld]", get_irn_node_nr(upper));
1079                                 }
1080                         }
1081                         ir_fprintf(F, " of <%+F>", elem_tp);
1082
1083                         fprintf(F, "\n  order: ");
1084                         for (i = 0; i < n_dim; ++i)
1085                                 fprintf(F, "<%d>", get_array_order(tp, i));
1086
1087                         fprintf(F, "\n");
1088
1089                         if (verbosity & dump_verbosity_fields) {
1090                                 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1091                                         "    ", verbosity);
1092                         }
1093                 }
1094                 break;
1095
1096         case tpo_pointer:
1097                 if (verbosity & dump_verbosity_typeattrs) {
1098                         ir_type *tt = get_pointer_points_to_type(tp);
1099                         ir_fprintf(F, "\n  points to %+F\n", tt);
1100                 }
1101                 break;
1102
1103         case tpo_method:
1104                 if (verbosity & dump_verbosity_typeattrs) {
1105                         fprintf(F, "\n  variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1106                         fprintf(F, "\n  return types: %d", get_method_n_ress(tp));
1107                         for (i = 0; i < get_method_n_ress(tp); ++i) {
1108                                 ir_type *rtp = get_method_res_type(tp, i);
1109                                 ir_fprintf(F, "\n    %+F", rtp);
1110                         }
1111
1112                         fprintf(F, "\n  parameter types: %d", get_method_n_params(tp));
1113                         for (i = 0; i < get_method_n_params(tp); ++i) {
1114                                 ir_type *ptp = get_method_param_type(tp, i);
1115                                 ir_fprintf(F, "\n    %+F", ptp);
1116                         }
1117                         if (get_method_variadicity(tp)) {
1118                                 fprintf(F, "\n    ...");
1119                         }
1120                         fprintf(F, "\n");
1121                 }
1122                 break;
1123
1124         case tpo_primitive:
1125                 if (verbosity & dump_verbosity_typeattrs) {
1126                         ir_type *base_tp = get_primitive_base_type(tp);
1127                         if (base_tp != NULL)
1128                                 ir_fprintf(F, "\n  base type: %+F", tp);
1129                         fprintf(F, "\n");
1130                 }
1131                 break;
1132
1133         case tpo_none:
1134         case tpo_unknown:
1135                 fprintf(F, "\n");
1136                 break;
1137
1138         default:
1139                 if (verbosity & dump_verbosity_typeattrs) {
1140                         fprintf(F, ": details not implemented\n");
1141                 }
1142         }
1143
1144         fprintf(F, "  state:      %s,\n", get_type_state_name(get_type_state(tp)));
1145         fprintf(F, "  size:       %2u Bytes,\n", get_type_size_bytes(tp));
1146         fprintf(F, "  alignment:  %2u Bytes,\n", get_type_alignment_bytes(tp));
1147         if (is_atomic_type(tp) || is_Method_type(tp))
1148                 fprintf(F, "  mode:       %s,\n",  get_mode_name(get_type_mode(tp)));
1149
1150         if (get_trouts_state()) {
1151                 fprintf(F, "\n  Type outs:\n");
1152                 dump_node_list(F, (firm_kind *)tp, "  ", (int(*)(firm_kind *))get_type_n_allocs,
1153                         (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1154                 dump_node_list(F, (firm_kind *)tp, "  ", (int(*)(firm_kind *))get_type_n_casts,
1155                         (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1156                 dump_type_list(F, tp, "  ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1157         }
1158
1159
1160         if (verbosity & dump_verbosity_accessStats) {
1161 #if 0
1162                 int n_all = get_type_n_allocs(tp);
1163                 int max_depth = 0;
1164                 int max_freq = -1;
1165                 int *freq;
1166
1167                 /* Find maximal depth */
1168                 for (i = 0; i < n_all; ++i) {
1169                         ir_node *all = get_type_alloc(tp, i);
1170                         int depth = get_weighted_loop_depth(all);
1171                         max_depth = (depth > max_depth) ? depth : max_depth ;
1172                 }
1173
1174                 freq = XMALLOCNZ(int, max_depth + 1);
1175
1176                 for (i = 0; i < n_all; ++i) {
1177                         ir_node *all = get_type_alloc(tp, i);
1178                         int depth = get_weighted_loop_depth(all);
1179                         assert(depth <= max_depth);
1180                         freq[depth]++;
1181                         max_freq = (depth > max_freq) ? depth : max_freq;
1182                         assert(is_Alloc(all));
1183                 }
1184
1185                 if (max_freq >= 0) {
1186                         char comma = ':';
1187
1188                         fprintf(F, "  Alloc Stats");
1189                         for (i = 0; i <= max_freq; ++i) {
1190                                 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1191                                 comma = ',';
1192                         }
1193                         fprintf(F, "\n");
1194                 }
1195
1196                 free(freq);
1197 #endif
1198 #ifdef INTERPROCEDURAL_VIEW
1199                 if (get_trouts_state() != outs_none) {
1200                         fprintf(F, "  Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1201                         if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1202                                 fprintf(F, "  Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1203                                 fprintf(F, "  Estimated #Upcasts:   %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1204                                 fprintf(F, "  Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1205                                 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1206                         }
1207                 }
1208 #endif
1209
1210         }
1211
1212         fprintf(F, "\n\n");
1213 }
1214
1215 void dump_type(ir_type *tp)
1216 {
1217         dump_type_to_file (stdout, tp, dump_verbosity_max);
1218 }
1219
1220 void dump_types_as_text(unsigned verbosity, const char *suffix)
1221 {
1222         const char *basename;
1223         FILE *F;
1224         int i, n_types = get_irp_n_types();
1225
1226         basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1227         F = text_open(basename, suffix, "-types", ".txt");
1228
1229         for (i = 0; i < n_types; ++i) {
1230                 ir_type *t = get_irp_type(i);
1231
1232                 dump_type_to_file(F, t, verbosity);
1233         }
1234
1235         fclose(F);
1236 }
1237
1238 void dump_globals_as_text(unsigned verbosity, const char *suffix)
1239 {
1240         const char *basename;
1241         FILE *F;
1242         ir_type *g = get_glob_type();
1243         int i, n_mems = get_class_n_members(g);
1244
1245         basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1246         F = text_open (basename, suffix, "-globals", ".txt");
1247
1248         for (i = 0; i < n_mems; ++i) {
1249                 ir_entity *e = get_class_member(g, i);
1250
1251                 dump_entity_to_file(F, e, verbosity);
1252         }
1253
1254         fclose (F);
1255 }