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