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