nsz Git - libfirm/blob - ir/ir/irdumptxt.c

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