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