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