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 (n->vrp.valid) {
 401                 dump_vrp_info(F, n);
 402         }
 403
 404         if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent  ||
 405                 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent  )
 406                 if (get_irn_typeinfo_type(n) != firm_none_type)
 407                         ir_fprintf (F, "  Analysed type: %s\n", get_irn_typeinfo_type(n));
 408
 409         return bad;
 410 }
 411
 412
 413
 414 void dump_irnode(ir_node *n) {
 415         dump_irnode_to_file(stdout, n);
 416 }
 417
 418
 419 void dump_graph_to_file(FILE *F, ir_graph *irg) {
 420         fprintf(F, "graph %s\n", get_irg_dump_name(irg));
 421 }
 422
 423 void dump_graph(ir_graph *g) {
 424         dump_graph_to_file(stdout, g);
 425 }
 426
 427 static void dump_node_to_graph_file(ir_node *n, void *env) {
 428         FILE *F = (FILE *)env;
 429
 430         dump_irnode_to_file(F, n);
 431         fprintf(F, "\n");
 432 }
 433
 434 void dump_graph_as_text(ir_graph *irg, const char *suffix) {
 435         const char *basename = get_irg_dump_name(irg);
 436         FILE *F;
 437
 438         F = text_open(basename, suffix, "", ".txt");
 439
 440         dump_graph_to_file(F, irg);
 441         fprintf(F, "\n\n");
 442         irg_walk_graph(irg, NULL, dump_node_to_graph_file, F);
 443
 444         fclose (F);
 445 }
 446
 447 #ifdef EXTENDED_ACCESS_STATS
 448 static int addr_is_alloc(ir_node *acc) {
 449         ir_node *addr = NULL;
 450         ir_opcode addr_op;
 451         if (is_memop(acc)) {
 452                 addr = get_memop_ptr(acc);
 453         } else {
 454                 assert(is_Call(acc));
 455                 addr = get_Call_ptr(acc);
 456         }
 457
 458         addr_op = get_irn_opcode(addr);
 459
 460         while (addr_op != iro_Alloc) {
 461                 switch (addr_op) {
 462                 case iro_Sel:
 463                         addr = get_Sel_ptr(addr);
 464                         break;
 465                 case iro_Cast:
 466                         addr = get_Cast_op(addr);
 467                         break;
 468                 case iro_Proj:
 469                         addr = get_Proj_pred(addr);
 470                         break;
 471                 case iro_SymConst:
 472                 case iro_Const:
 473                         return 0;
 474                         break;
 475                 case iro_Phi:
 476                 case iro_Load:
 477                 case iro_Call:
 478                 case iro_Start:
 479                         return 0;
 480                         break;
 481
 482                 default:
 483                         //DDMN(addr);
 484                         //assert(0 && "unexpected address node");
 485                         ;
 486                 }
 487                 addr_op = get_irn_opcode(addr);
 488         }
 489
 490         /* In addition, the alloc must be in the same loop. */
 491         return 1;
 492 }
 493 #endif
 494
 495 /** dumps something like:
 496  *
 497  *  "prefix"  "Name" (x): node1, ... node7,\n
 498  *  "prefix"    node8, ... node15,\n
 499  *  "prefix"    node16, node17\n
 500  */
 501 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
 502                            int (*get_entity_n_nodes)(firm_kind *ent),
 503                            ir_node *(*get_entity_node)(firm_kind *ent, int pos),
 504                            char *name) {
 505         int i, n_nodes = get_entity_n_nodes(k);
 506         char *comma = "";
 507
 508         fprintf(F, "%s  %s (%d):", prefix, name, n_nodes);
 509         for (i = 0; i < n_nodes; ++i) {
 510                 int rem;
 511                 if (i > 7 && !(i & 7)) { /* line break every eight node. */
 512                         fprintf(F, ",\n%s   ", prefix);
 513                         comma = "";
 514                 }
 515                 fprintf(F, "%s ", comma);
 516                 rem = opt_dump_analysed_type_info;
 517                 opt_dump_analysed_type_info = 0;
 518                 dump_node_label(F, get_entity_node(k, i));
 519                 opt_dump_analysed_type_info = rem;
 520                 comma = ",";
 521         }
 522         fprintf(F, "\n");
 523 }
 524
 525 /** dumps something like:
 526  *
 527  *  "prefix"  "Name" (x): node1, ... node7,\n
 528  *  "prefix"    node8, ... node15,\n
 529  *  "prefix"    node16, node17\n
 530  */
 531 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
 532                            int (*get_n_types)(const ir_type *tp),
 533                            ir_type *(*get_type)(const ir_type *tp, int pos),
 534                            const char *name) {
 535         int i, n_nodes = get_n_types(tp);
 536         char *comma = "";
 537
 538         fprintf(F, "%s  %s (%d):", prefix, name, n_nodes);
 539         for (i = 0; i < n_nodes; ++i) {
 540                 if (i > 7 && !(i & 7)) { /* line break every eight node. */
 541                         fprintf(F, ",\n%s   ", prefix);
 542                         comma = "";
 543                 }
 544                 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
 545                 comma = ",";
 546         }
 547         fprintf(F, "\n");
 548 }
 549
 550 static int need_nl = 1;
 551
 552 /**
 553  * Dump initializers.
 554  */
 555 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
 556                                                                                  const ir_initializer_t *initializer, ir_type *type) {
 557         tarval  *tv;
 558         ir_node *value;
 559
 560         if (need_nl) {
 561                 fprintf(F, "\n%s    ", prefix);
 562                 need_nl = 0;
 563         }
 564         switch (get_initializer_kind(initializer)) {
 565         case IR_INITIALIZER_NULL:
 566                 fprintf(F, "\t = <NOT_SET>");
 567                 break;
 568         case IR_INITIALIZER_TARVAL:
 569                 tv = get_initializer_tarval_value(initializer);
 570                 ir_fprintf(F, "\t = <TV>%F", tv);
 571                 break;
 572         case IR_INITIALIZER_CONST:
 573                 value = get_initializer_const_value(initializer);
 574                 fprintf(F, "\t = <CONST>");
 575                 dump_node_opcode(F, value);
 576                 break;
 577         case IR_INITIALIZER_COMPOUND:
 578                 if (is_Array_type(type)) {
 579                         size_t i, n = get_initializer_compound_n_entries(initializer);
 580                         ir_type *element_type = get_array_element_type(type);
 581                         for (i = 0; i < n; ++i) {
 582                                 ir_initializer_t *sub_initializer
 583                                         = get_initializer_compound_value(initializer, i);
 584
 585                                 if (need_nl) {
 586                                         fprintf(F, "\n%s    ", prefix);
 587                                         need_nl = 0;
 588                                 }
 589                                 fprintf(F, "[%d]", (int) i);
 590                                 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
 591                         }
 592                 } else {
 593                         size_t i, n;
 594                         assert(is_compound_type(type));
 595                         n = get_compound_n_members(type);
 596                         for (i = 0; i < n; ++i) {
 597                                 ir_entity        *member    = get_compound_member(type, i);
 598                                 ir_type          *subtype   = get_entity_type(member);
 599                                 ir_initializer_t *sub_initializer;
 600
 601                                 assert(i < get_initializer_compound_n_entries(initializer));
 602                                 sub_initializer
 603                                         = get_initializer_compound_value(initializer, i);
 604
 605                                 if (need_nl) {
 606                                         fprintf(F, "\n%s    ", prefix);
 607                                         need_nl = 0;
 608                                 }
 609                                 ir_fprintf(F, ".%F", member);
 610                                 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
 611                         }
 612                 }
 613                 break;
 614         default:
 615                 panic("invalid ir_initializer kind found");
 616         }
 617         need_nl = 1;
 618 }
 619
 620 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
 621 {
 622         ir_linkage linkage = get_entity_linkage(entity);
 623
 624         if (linkage & IR_LINKAGE_CONSTANT)
 625                 fprintf(F, " constant");
 626         if (linkage & IR_LINKAGE_WEAK)
 627                 fprintf(F, " weak");
 628         if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
 629                 fprintf(F, " garbage_collect");
 630         if (linkage & IR_LINKAGE_MERGE)
 631                 fprintf(F, " merge");
 632         if (linkage & IR_LINKAGE_HIDDEN_USER)
 633                 fprintf(F, " hidden_user");
 634 }
 635
 636 void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix, unsigned verbosity) {
 637         int i, j;
 638         ir_type *owner, *type;
 639
 640         assert(is_entity(ent));
 641         owner = get_entity_owner(ent);
 642         type  = get_entity_type(ent);
 643         if (verbosity & dump_verbosity_onlynames) {
 644                 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
 645                         get_entity_name(ent), get_entity_nr(ent));
 646                 return;
 647         }
 648
 649         if (verbosity & dump_verbosity_entattrs) {
 650                 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
 651                 ir_fprintf(F, "%s  type:  %+F\n", prefix, type);
 652                 ir_fprintf(F, "%s  owner: %+F\n", prefix, owner);
 653
 654                 if (is_Class_type(get_entity_owner(ent))) {
 655                         if (get_entity_n_overwrites(ent) > 0) {
 656                                 fprintf(F, "%s  overwrites:\n", prefix);
 657                                 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
 658                                         ir_entity *ov = get_entity_overwrites(ent, i);
 659                                         ir_fprintf(F, "%s    %d: %s of class %+F\n", prefix, i,
 660                                                 get_entity_name(ov), get_entity_owner(ov));
 661                                 }
 662                         } else {
 663                                 fprintf(F, "%s  Does not overwrite other entities.\n", prefix);
 664                         }
 665                         if (get_entity_n_overwrittenby(ent) > 0) {
 666                                 fprintf(F, "%s  overwritten by:\n", prefix);
 667                                 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
 668                                         ir_entity *ov = get_entity_overwrittenby(ent, i);
 669                                         ir_fprintf(F, "%s    %d: %s of class %+F\n", prefix, i,
 670                                                    get_entity_name(ov), get_entity_owner(ov));
 671                                 }
 672                         } else {
 673                                 fprintf(F, "%s  Is not overwritten by other entities.\n",
 674                                         prefix);
 675                         }
 676
 677                         if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
 678                                 ir_entity *ov;
 679                                 fprintf(F, "%s  transitive overwrites:\n", prefix);
 680                                 for (ov = get_entity_trans_overwrites_first(ent);
 681                                 ov;
 682                                 ov = get_entity_trans_overwrites_next(ent)) {
 683                                         ir_fprintf(F, "%s    : %s of class %+F\n", prefix,
 684                                                    get_entity_name(ov), get_entity_owner(ov));
 685                                 }
 686                                 fprintf(F, "%s  transitive overwritten by:\n", prefix);
 687                                 for (ov = get_entity_trans_overwrittenby_first(ent);
 688                                 ov;
 689                                 ov = get_entity_trans_overwrittenby_next(ent)) {
 690                                         ir_fprintf(F, "%s    : %s of class %+F\n", prefix,
 691                                                    get_entity_name(ov), get_entity_owner(ov));
 692                                 }
 693                         }
 694                 }
 695
 696                 fprintf(F, "%s  linkage:", prefix);
 697                 dump_entity_linkage(F, ent);
 698
 699                 if (is_Method_type(get_entity_type(ent))) {
 700                         unsigned mask = get_entity_additional_properties(ent);
 701                         unsigned cc   = get_method_calling_convention(get_entity_type(ent));
 702                         ir_graph *irg = get_entity_irg(ent);
 703
 704                         if (irg) {
 705                                 fprintf(F, "\n%s  estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
 706                                 fprintf(F, "\n%s  maximum node index:   %u", prefix, get_irg_last_idx(irg));
 707                         }
 708
 709                         if (mask) {
 710                                 fprintf(F, "\n%s  additional prop: ", prefix);
 711
 712                                 if (mask & mtp_property_const)         fputs("const_function, ", F);
 713                                 if (mask & mtp_property_pure)          fputs("pure_function, ", F);
 714                                 if (mask & mtp_property_noreturn)      fputs("noreturn_function, ", F);
 715                                 if (mask & mtp_property_nothrow)       fputs("nothrow_function, ", F);
 716                                 if (mask & mtp_property_naked)         fputs("naked_function, ", F);
 717                                 if (mask & mtp_property_malloc)        fputs("malloc_function, ", F);
 718                                 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
 719                                 if (mask & mtp_property_intrinsic)     fputs("intrinsic_function, ", F);
 720                                 if (mask & mtp_property_runtime)       fputs("runtime_function, ", F);
 721                                 if (mask & mtp_property_private)       fputs("private_function, ", F);
 722                                 if (mask & mtp_property_has_loop)      fputs("has_loop_function, ", F);
 723                         }
 724                         fprintf(F, "\n%s  calling convention: ", prefix);
 725                         if (cc & cc_reg_param)           fputs("regparam, ", F);
 726                         if (cc & cc_this_call)           fputs("thiscall, ", F);
 727                         if (cc & cc_compound_ret)        fputs("compound_ret, ", F);
 728                         if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
 729                         cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
 730                         if (IS_CDECL(cc))
 731                                 fputs("cdecl", F);
 732                         else if (IS_STDCALL(cc))
 733                                 fputs("stdcall", F);
 734                         else {
 735                                 fputs(cc & cc_last_on_top      ? "last param on top, " : "first param on top, ", F);
 736                                 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
 737                         }
 738                         fprintf(F, "\n%s  vtable number:        %u", prefix, get_entity_vtable_number(ent));
 739                 }
 740
 741                 fputc('\n', F);
 742         } else {  /* no entattrs */
 743                 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
 744                         get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
 745                         get_entity_type(ent), get_entity_name(ent));
 746                 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
 747
 748                 if (verbosity & dump_verbosity_accessStats) {
 749                         dump_entity_linkage(F, ent);
 750                 }
 751                 fputc('\n', F);
 752         }
 753
 754         if (verbosity & dump_verbosity_entconsts) {
 755                 if (ent->initializer != NULL) {
 756                         const ir_initializer_t *initializer = get_entity_initializer(ent);
 757                         fprintf(F, "\n%s  Initializers:", prefix);
 758                         need_nl = 1;
 759                         dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
 760                 } else if (entity_has_compound_ent_values(ent)) {
 761                         fprintf(F, "%s  compound values:", prefix);
 762                         for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
 763                                 compound_graph_path *path = get_compound_ent_value_path(ent, i);
 764                                 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
 765                                 fprintf(F, "\n%s    %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
 766                                 if (get_type_state(type) == layout_fixed)
 767                                         fprintf(F, "(%3u:%u) ",   get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
 768                                 fprintf(F, "%s", get_entity_name(ent));
 769                                 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
 770                                         ir_entity *node = get_compound_graph_path_node(path, j);
 771                                         fprintf(F, ".%s", get_entity_name(node));
 772                                         if (is_Array_type(get_entity_owner(node)))
 773                                                 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
 774                                 }
 775                                 fprintf(F, "\t = ");
 776                                 dump_node_opcode(F, get_compound_ent_value(ent, i));
 777                         }
 778                         fputc('\n', F);
 779                 }
 780         }
 781
 782         if (verbosity & dump_verbosity_entattrs) {
 783                 fprintf(F, "%s  linkage:", prefix);
 784                 dump_entity_linkage(F, ent);
 785                 fprintf(F, "%s  volatility:  %s", prefix, get_volatility_name(get_entity_volatility(ent)));
 786                 fprintf(F, "\n%s  aligned:  %s", prefix, get_align_name(get_entity_aligned(ent)));
 787                 fprintf(F, "\n%s  alignment:  %u", prefix, get_entity_alignment(ent));
 788                 fprintf(F, "\n%s  ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
 789                 fprintf(F, "\n%s  offset:  %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
 790                 if (is_Method_type(get_entity_type(ent))) {
 791                         if (get_entity_irg(ent))   /* can be null */ {
 792                                 fprintf(F, "\n%s  irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
 793 #ifdef INTERPROCEDURAL_VIEW
 794                                 if (get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent) {
 795                                         fprintf(F, "\n%s    recursion depth %d", prefix, get_irg_recursion_depth(get_entity_irg(ent)));
 796                                         fprintf(F, "\n%s    loop depth      %d", prefix, get_irg_loop_depth(get_entity_irg(ent)));
 797                                 }
 798 #endif
 799                         } else {
 800                                 fprintf(F, "\n%s  irg = NULL", prefix);
 801                         }
 802                 }
 803                 fputc('\n', F);
 804         }
 805
 806         if (get_trouts_state()) {
 807                 fprintf(F, "%s  Entity outs:\n", prefix);
 808                 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
 809                         (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
 810                 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
 811                         (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
 812         }
 813
 814         if (verbosity & dump_verbosity_accessStats) {
 815 #ifdef EXTENDED_ACCESS_STATS
 816                 int n_acc = get_entity_n_accesses(ent);
 817                 int max_depth = 0;
 818                 int max_L_freq = -1;
 819                 int max_S_freq = -1;
 820                 int max_LA_freq = -1;
 821                 int max_SA_freq = -1;
 822                 int *L_freq;
 823                 int *S_freq;
 824                 int *LA_freq;
 825                 int *SA_freq;
 826
 827                 /* Find maximal depth */
 828                 for (i = 0; i < n_acc; ++i) {
 829                         ir_node *acc = get_entity_access(ent, i);
 830                         int depth = get_weighted_loop_depth(acc);
 831                         max_depth = (depth > max_depth) ? depth : max_depth ;
 832                 }
 833
 834                 L_freq = XMALLOCNZ(int, 4 * max_depth);
 835
 836                 S_freq  = L_freq + 1*max_depth;
 837                 LA_freq = L_freq + 2*max_depth;
 838                 SA_freq = L_freq + 3*max_depth;
 839
 840                 for (i = 0; i < n_acc; ++i) {
 841                         ir_node *acc = get_entity_access(ent, i);
 842                         int depth = get_weighted_loop_depth(acc);
 843                         assert(depth < max_depth);
 844                         if (is_Load(acc) || is_Call(acc)) {
 845                                 L_freq[depth]++;
 846                                 max_L_freq = (depth > max_L_freq) ? depth : max_L_freq;
 847                                 if (addr_is_alloc(acc)) {
 848                                         LA_freq[depth]++;
 849                                         max_LA_freq = (depth > max_LA_freq) ? depth : max_LA_freq;
 850                                 }
 851                         } else if (is_Store(acc)) {
 852                                 S_freq[depth]++;
 853                                 max_S_freq = (depth > max_S_freq) ? depth : max_S_freq;
 854                                 if (addr_is_alloc(acc)) {
 855                                         SA_freq[depth]++;
 856                                         max_SA_freq = (depth > max_SA_freq) ? depth : max_SA_freq;
 857                                 }
 858                         } else {
 859                                 assert(0);
 860                         }
 861                 }
 862
 863                 if (max_L_freq >= 0) {
 864                         char comma = ':';
 865
 866                         fprintf(F, "%s  Load  Stats", prefix);
 867                         for (i = 0; i <= max_L_freq; ++i) {
 868                                 if (L_freq[i])
 869                                         fprintf(F, "%c %d x  L%d", comma, L_freq[i], i);
 870                                 else
 871                                         fprintf(F, "         ");
 872                                 comma = ',';
 873                         }
 874                         fprintf(F, "\n");
 875                 }
 876                 if (max_LA_freq >= 0) {
 877                         //fprintf(F, "%s  LoadA Stats", prefix);
 878                         char comma = ':';
 879                         for (i = 0; i <= max_LA_freq; ++i) {
 880                                 //if (LA_freq[i])
 881                                 //fprintf(F, "%c %d x LA%d", comma, LA_freq[i], i);
 882                                 //else
 883                                 //fprintf(F, "         ");
 884                                 comma = ',';
 885                         }
 886                         fprintf(F, "\n");
 887                 }
 888                 if (max_S_freq >= 0) {
 889                         char comma = ':';
 890
 891                         fprintf(F, "%s  Store Stats", prefix);
 892                         for (i = 0; i <= max_S_freq; ++i) {
 893                                 if (S_freq[i])
 894                                         fprintf(F, "%c %d x  S%d", comma, S_freq[i], i);
 895                                 else
 896                                         fprintf(F, "         ");
 897                                 comma = ',';
 898                         }
 899                         fprintf(F, "\n");
 900                 }
 901                 if (max_SA_freq >= 0) {
 902                         //fprintf(F, "%s  StoreAStats", prefix);
 903                         char comma = ':';
 904                         for (i = 0; i <= max_SA_freq; ++i) {
 905                                 //if (SA_freq[i])
 906                                 //fprintf(F, "%c %d x SA%d", comma, SA_freq[i], i);
 907                                 //else
 908                                 //fprintf(F, "         ");
 909                                 comma = ',';
 910                         }
 911                         fprintf(F, "\n");
 912                 }
 913
 914                 /* free allocated space */
 915                 free(L_freq);
 916 #endif
 917                 if (get_trouts_state() != outs_none) {
 918 #ifdef INTERPROCEDURAL_VIEW
 919                         if (is_Method_type(get_entity_type(ent))) {
 920                                 fprintf(F, "%s  Estimated #Calls:    %lf\n", prefix, get_entity_estimated_n_calls(ent));
 921                                 fprintf(F, "%s  Estimated #dynCalls: %lf\n", prefix, get_entity_estimated_n_calls(ent));
 922                         } else {
 923                                 fprintf(F, "%s  Estimated #Loads:  %lf\n", prefix, get_entity_estimated_n_loads(ent));
 924                                 fprintf(F, "%s  Estimated #Stores: %lf\n", prefix, get_entity_estimated_n_stores(ent));
 925                         }
 926 #endif
 927                 }
 928         }
 929 }
 930
 931 void    dump_entity_to_file (FILE *F, ir_entity *ent, unsigned verbosity) {
 932         dump_entity_to_file_prefix (F, ent, "", verbosity);
 933         fprintf(F, "\n");
 934 }
 935
 936 void dump_entity(ir_entity *ent) {
 937   dump_entity_to_file(stdout, ent, dump_verbosity_max);
 938 }
 939
 940 void dump_type_to_file(FILE *F, ir_type *tp, dump_verbosity verbosity) {
 941         int i;
 942
 943         if ((is_Class_type(tp))       && (verbosity & dump_verbosity_noClassTypes)) return;
 944         if ((is_Struct_type(tp))      && (verbosity & dump_verbosity_noStructTypes)) return;
 945         if ((is_Union_type(tp))       && (verbosity & dump_verbosity_noUnionTypes)) return;
 946         if ((is_Array_type(tp))       && (verbosity & dump_verbosity_noArrayTypes)) return;
 947         if ((is_Pointer_type(tp))     && (verbosity & dump_verbosity_noPointerTypes)) return;
 948         if ((is_Method_type(tp))      && (verbosity & dump_verbosity_noMethodTypes)) return;
 949         if ((is_Primitive_type(tp))   && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
 950         if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
 951
 952         ir_fprintf(F, "%+F", tp);
 953         if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
 954
 955         switch (get_type_tpop_code(tp)) {
 956
 957         case tpo_class:
 958                 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
 959                         fprintf(F, "\n  members:\n");
 960                 }
 961                 for (i = 0; i < get_class_n_members(tp); ++i) {
 962                         ir_entity *mem = get_class_member(tp, i);
 963                         if (((verbosity & dump_verbosity_methods) &&  is_Method_type(get_entity_type(mem))) ||
 964                                 ((verbosity & dump_verbosity_fields)  && !is_Method_type(get_entity_type(mem)))   ) {
 965                                 if (!(verbosity & dump_verbosity_nostatic)) {
 966                                         dump_entity_to_file_prefix(F, mem, "    ", verbosity);
 967                                 }
 968                         }
 969                 }
 970                 if (verbosity & dump_verbosity_typeattrs) {
 971                         fprintf(F, "  supertypes: ");
 972                         for (i = 0; i < get_class_n_supertypes(tp); ++i) {
 973                                 ir_type *stp = get_class_supertype(tp, i);
 974                                 ir_fprintf(F, "\n    %d %+F", i, stp);
 975                         }
 976                         fprintf(F, "\n  subtypes: ");
 977                         for (i = 0; i < get_class_n_subtypes(tp); ++i) {
 978                                 ir_type *stp = get_class_subtype(tp, i);
 979                                 ir_fprintf(F, "\n    %d %+F", i, stp);
 980                         }
 981
 982                         if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
 983                                 ir_type *stp;
 984                                 fprintf(F, "\n  transitive supertypes: ");
 985                                 for (stp = get_class_trans_supertype_first(tp);
 986                                 stp;
 987                                 stp = get_class_trans_supertype_next(tp)) {
 988                                         ir_fprintf(F, "\n    %+F", stp);
 989                                 }
 990                                 fprintf(F, "\n  transitive subtypes: ");
 991                                 for (stp = get_class_trans_subtype_first(tp);
 992                                 stp;
 993                                 stp = get_class_trans_subtype_next(tp)) {
 994                                         ir_fprintf(F, "\n    %+F", stp);
 995                                 }
 996                         }
 997
 998                         fprintf(F, "\n  flags:       ");
 999                         if (is_class_final(tp))
1000                                 fprintf(F, "final, ");
1001                         if (is_class_interface(tp))
1002                                 fprintf(F, "interface, ");
1003                         if (is_class_abstract(tp))
1004                                 fprintf(F, "abstract, ");
1005                         fprintf(F, "\n");
1006                 }
1007                 break;
1008
1009         case tpo_union:
1010         case tpo_struct:
1011                 if (verbosity & dump_verbosity_fields) fprintf(F, "\n  members: ");
1012                 for (i = 0; i < get_compound_n_members(tp); ++i) {
1013                         ir_entity *mem = get_compound_member(tp, i);
1014                         if (verbosity & dump_verbosity_fields) {
1015                                 dump_entity_to_file_prefix(F, mem, "    ", verbosity);
1016                         }
1017                 }
1018                 break;
1019
1020         case tpo_array:
1021                 if (verbosity & dump_verbosity_typeattrs) {
1022                         int i, n_dim;
1023                         ir_type *elem_tp = get_array_element_type(tp);
1024
1025                         fprintf(F, "\n  array ");
1026
1027                         n_dim = get_array_n_dimensions(tp);
1028                         for (i = 0; i < n_dim; ++i) {
1029                                 ir_node *lower, *upper;
1030
1031                                 lower = get_array_lower_bound(tp, i);
1032                                 upper = get_array_upper_bound(tp, i);
1033
1034                                 fprintf(F, "[");
1035
1036                                 if (is_Const(lower)) {
1037                                         fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
1038                                 } else {
1039                                         dump_node_opcode(F, lower);
1040                                         fprintf(F, " %ld .. ", get_irn_node_nr(lower));
1041                                 }
1042
1043                                 if (is_Const(upper)) {
1044                                         fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
1045                                 } else {
1046                                         dump_node_opcode(F, upper);
1047                                         fprintf(F, " %ld]", get_irn_node_nr(upper));
1048                                 }
1049                         }
1050                         ir_fprintf(F, " of <%+F>", elem_tp);
1051
1052                         fprintf(F, "\n  order: ");
1053                         for (i = 0; i < n_dim; ++i)
1054                                 fprintf(F, "<%d>", get_array_order(tp, i));
1055
1056                         fprintf(F, "\n");
1057
1058                         if (verbosity & dump_verbosity_fields) {
1059                                 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
1060                                         "    ", verbosity);
1061                         }
1062                 }
1063                 break;
1064
1065         case tpo_pointer:
1066                 if (verbosity & dump_verbosity_typeattrs) {
1067                         ir_type *tt = get_pointer_points_to_type(tp);
1068                         ir_fprintf(F, "\n  points to %+F\n", tt);
1069                 }
1070                 break;
1071
1072         case tpo_method:
1073                 if (verbosity & dump_verbosity_typeattrs) {
1074                         fprintf(F, "\n  variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
1075                         fprintf(F, "\n  return types: %d", get_method_n_ress(tp));
1076                         for (i = 0; i < get_method_n_ress(tp); ++i) {
1077                                 ir_type *rtp = get_method_res_type(tp, i);
1078                                 ir_fprintf(F, "\n    %+F", rtp);
1079                         }
1080
1081                         fprintf(F, "\n  parameter types: %d", get_method_n_params(tp));
1082                         for (i = 0; i < get_method_n_params(tp); ++i) {
1083                                 ir_type *ptp = get_method_param_type(tp, i);
1084                                 ir_fprintf(F, "\n    %+F", ptp);
1085                         }
1086                         if (get_method_variadicity(tp)) {
1087                                 fprintf(F, "\n    ...");
1088                         }
1089                         fprintf(F, "\n");
1090                 }
1091                 break;
1092
1093         case tpo_primitive:
1094                 if (verbosity & dump_verbosity_typeattrs) {
1095                         ir_type *base_tp = get_primitive_base_type(tp);
1096                         if (base_tp != NULL)
1097                                 ir_fprintf(F, "\n  base type: %+F", tp);
1098                         fprintf(F, "\n");
1099                 }
1100                 break;
1101
1102         case tpo_none:
1103         case tpo_unknown:
1104                 fprintf(F, "\n");
1105                 break;
1106
1107         default:
1108                 if (verbosity & dump_verbosity_typeattrs) {
1109                         fprintf(F, ": details not implemented\n");
1110                 }
1111         }
1112
1113         fprintf(F, "  state:      %s,\n", get_type_state_name(get_type_state(tp)));
1114         fprintf(F, "  size:       %2u Bytes,\n", get_type_size_bytes(tp));
1115         fprintf(F, "  alignment:  %2u Bytes,\n", get_type_alignment_bytes(tp));
1116         if (is_atomic_type(tp) || is_Method_type(tp))
1117                 fprintf(F, "  mode:       %s,\n",  get_mode_name(get_type_mode(tp)));
1118
1119         if (get_trouts_state()) {
1120                 fprintf(F, "\n  Type outs:\n");
1121                 dump_node_list(F, (firm_kind *)tp, "  ", (int(*)(firm_kind *))get_type_n_allocs,
1122                         (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
1123                 dump_node_list(F, (firm_kind *)tp, "  ", (int(*)(firm_kind *))get_type_n_casts,
1124                         (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
1125                 dump_type_list(F, tp, "  ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
1126         }
1127
1128
1129         if (verbosity & dump_verbosity_accessStats) {
1130 #if 0
1131                 int n_all = get_type_n_allocs(tp);
1132                 int max_depth = 0;
1133                 int max_freq = -1;
1134                 int *freq;
1135
1136                 /* Find maximal depth */
1137                 for (i = 0; i < n_all; ++i) {
1138                         ir_node *all = get_type_alloc(tp, i);
1139                         int depth = get_weighted_loop_depth(all);
1140                         max_depth = (depth > max_depth) ? depth : max_depth ;
1141                 }
1142
1143                 freq = XMALLOCNZ(int, max_depth + 1);
1144
1145                 for (i = 0; i < n_all; ++i) {
1146                         ir_node *all = get_type_alloc(tp, i);
1147                         int depth = get_weighted_loop_depth(all);
1148                         assert(depth <= max_depth);
1149                         freq[depth]++;
1150                         max_freq = (depth > max_freq) ? depth : max_freq;
1151                         assert(is_Alloc(all));
1152                 }
1153
1154                 if (max_freq >= 0) {
1155                         char comma = ':';
1156
1157                         fprintf(F, "  Alloc Stats");
1158                         for (i = 0; i <= max_freq; ++i) {
1159                                 fprintf(F, "%c %d x A%d", comma, freq[i], i);
1160                                 comma = ',';
1161                         }
1162                         fprintf(F, "\n");
1163                 }
1164
1165                 free(freq);
1166 #endif
1167 #ifdef INTERPROCEDURAL_VIEW
1168                 if (get_trouts_state() != outs_none) {
1169                         fprintf(F, "  Estimated #Instances: %lf\n", get_type_estimated_n_instances(tp));
1170                         if (is_Class_type(tp) && (get_irp_typeinfo_state() != ir_typeinfo_none)) {
1171                                 fprintf(F, "  Estimated #dyn Calls: %lf\n", get_class_estimated_n_dyncalls(tp));
1172                                 fprintf(F, "  Estimated #Upcasts:   %lf (#CastOps: %d)\n", get_class_estimated_n_upcasts(tp), get_class_n_upcasts(tp));
1173                                 fprintf(F, "  Estimated #Downcasts: %lf (#CastOps: %d)\n", get_class_estimated_n_downcasts(tp), get_class_n_downcasts(tp));
1174                                 assert(get_class_n_upcasts(tp) + get_class_n_downcasts(tp) == get_type_n_casts(tp));
1175                         }
1176                 }
1177 #endif
1178
1179         }
1180
1181         fprintf(F, "\n\n");
1182 }
1183
1184 void dump_type(ir_type *tp) {
1185         dump_type_to_file (stdout, tp, dump_verbosity_max);
1186 }
1187
1188 void dump_types_as_text(unsigned verbosity, const char *suffix) {
1189         const char *basename;
1190         FILE *F;
1191         int i, n_types = get_irp_n_types();
1192
1193         basename = irp_prog_name_is_set() ? get_irp_name() : "TextTypes";
1194         F = text_open(basename, suffix, "-types", ".txt");
1195
1196         for (i = 0; i < n_types; ++i) {
1197                 ir_type *t = get_irp_type(i);
1198
1199                 //if (is_jack_rts_class(t)) continue;
1200
1201                 dump_type_to_file(F, t, verbosity);
1202         }
1203
1204         fclose(F);
1205 }
1206
1207 void dump_globals_as_text(unsigned verbosity, const char *suffix) {
1208         const char *basename;
1209         FILE *F;
1210         ir_type *g = get_glob_type();
1211         int i, n_mems = get_class_n_members(g);
1212
1213         basename = irp_prog_name_is_set() ? get_irp_name() : "TextGlobals";
1214         F = text_open (basename, suffix, "-globals", ".txt");
1215
1216         for (i = 0; i < n_mems; ++i) {
1217                 ir_entity *e = get_class_member(g, i);
1218
1219                 dump_entity_to_file(F, e, verbosity);
1220         }
1221
1222         fclose (F);
1223 }