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

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