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