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