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

   1 /*
   2  * Copyright (C) 1995-2011 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  *          Matthias Braun
  25  */
  26 #include "config.h"
  27
  28 #include <string.h>
  29 #include <stdlib.h>
  30 #include <stdarg.h>
  31 #include <stdbool.h>
  32 #include <errno.h>
  33
  34 #include "list.h"
  35
  36 #include "irnode_t.h"
  37 #include "irgraph_t.h"
  38 #include "irprog_t.h"
  39 #include "entity_t.h"
  40 #include "irop.h"
  41
  42 #include "irdump_t.h"
  43 #include "irpass_t.h"
  44
  45 #include "irgwalk.h"
  46 #include "tv_t.h"
  47 #include "irouts.h"
  48 #include "iredges.h"
  49 #include "irdom.h"
  50 #include "irloop_t.h"
  51 #include "callgraph.h"
  52 #include "irextbb_t.h"
  53 #include "irhooks.h"
  54 #include "dbginfo_t.h"
  55 #include "irtools.h"
  56 #include "irprintf.h"
  57
  58 #include "irverify.h"
  59
  60 #include "error.h"
  61 #include "array.h"
  62 #include "pmap.h"
  63 #include "obst.h"
  64 #include "eset.h"
  65 #include "pset.h"
  66 #include "util.h"
  67
  68 typedef struct pns_lookup {
  69         long       nr;      /**< the proj number */
  70         const char *name;   /**< the name of the Proj */
  71 } pns_lookup_t;
  72
  73 typedef struct proj_lookup {
  74         unsigned           code;      /**< the opcode of the Proj predecessor */
  75         unsigned           num_data;  /**< number of data entries */
  76         const pns_lookup_t *data;     /**< the data */
  77 } proj_lookup_t;
  78
  79 #include "gen_irdump.c.inl"
  80
  81 /** Dump only irgs with names that start with this prefix. */
  82 static ident *dump_file_filter_id = NULL;
  83
  84 static ir_dump_flags_t flags =
  85         ir_dump_flag_blocks_as_subgraphs |
  86         ir_dump_flag_keepalive_edges |
  87         ir_dump_flag_ld_names |
  88         ir_dump_flag_back_edges |
  89         ir_dump_flag_consts_local |
  90         ir_dump_flag_analysed_types |
  91         ir_dump_flag_entities_in_hierarchy |
  92         ir_dump_flag_number_label;
  93
  94 static ird_color_t overrule_nodecolor = ird_color_default_node;
  95
  96 /** The vcg node attribute hook. */
  97 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
  98 /** The vcg edge attribute hook. */
  99 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
 100 /** The vcg dump block edge hook */
 101 static dump_node_edge_func dump_block_edge_hook = NULL;
 102 /** The vcg dump node edge hook. */
 103 static dump_node_edge_func dump_node_edge_hook = NULL;
 104
 105 void set_dump_node_edge_hook(dump_node_edge_func func)
 106 {
 107         dump_node_edge_hook = func;
 108 }
 109
 110 dump_node_edge_func get_dump_node_edge_hook(void)
 111 {
 112         return dump_node_edge_hook;
 113 }
 114
 115 void set_dump_block_edge_hook(dump_node_edge_func func)
 116 {
 117         dump_block_edge_hook = func;
 118 }
 119
 120 dump_node_edge_func get_dump_block_edge_hook(void)
 121 {
 122         return dump_node_edge_hook;
 123 }
 124
 125 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
 126 {
 127         dump_node_vcgattr_hook = hook;
 128 }
 129
 130 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
 131 {
 132         dump_edge_vcgattr_hook = hook;
 133 }
 134
 135 void ir_set_dump_flags(ir_dump_flags_t new_flags)
 136 {
 137         flags = new_flags;
 138 }
 139
 140 void ir_add_dump_flags(ir_dump_flags_t new_flags)
 141 {
 142         flags |= new_flags;
 143 }
 144
 145 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
 146 {
 147         flags &= ~to_remove;
 148 }
 149
 150 ir_dump_flags_t ir_get_dump_flags(void)
 151 {
 152         return flags;
 153 }
 154
 155 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
 156  * are set, else returns dump_const_local_flag.
 157  */
 158 static bool get_opt_dump_const_local(void)
 159 {
 160         return (flags & ir_dump_flag_out_edges)
 161                 || (flags & ir_dump_flag_loops)
 162                 || (flags & ir_dump_flag_consts_local)
 163                 || (flags & ir_dump_flag_iredges);
 164 }
 165
 166 static char *dump_filter;
 167
 168 void ir_set_dump_filter(const char *new_filter)
 169 {
 170         xfree(dump_filter);
 171         dump_filter = xstrdup(new_filter);
 172 }
 173
 174 const char *ir_get_dump_filter(void)
 175 {
 176         return dump_filter;
 177 }
 178
 179 int ir_should_dump(const char *name)
 180 {
 181         const char *f, *n;
 182
 183         if (dump_filter == NULL || dump_filter[0] == '\0')
 184                 return 1;
 185
 186         for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
 187                         ++n, ++f) {
 188                 if (*n != *f)
 189                         return 0;
 190         }
 191         return 1;
 192 }
 193
 194 /* -------------- some extended helper functions ----------------- */
 195
 196 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
 197 {
 198         if (is_mode(mode))
 199                 return get_mode_name(mode);
 200         if (bad != NULL)
 201                 *bad |= 1;
 202         return "<ERROR>";
 203 }
 204
 205 #define CUSTOM_COLOR_BASE    100
 206 static const char *color_names[ird_color_count];
 207 static const char *color_rgb[ird_color_count];
 208 static struct obstack color_obst;
 209
 210 /** define a custom color. */
 211 static void custom_color(int num, const char *rgb_def)
 212 {
 213         assert(num < ird_color_count);
 214         obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
 215         obstack_1grow(&color_obst, '\0');
 216
 217         color_rgb[num]   = rgb_def;
 218         color_names[num] = (const char*)obstack_finish(&color_obst);
 219 }
 220
 221 /** Define a named color. */
 222 static void named_color(int num, const char *name)
 223 {
 224         assert(num < ird_color_count);
 225         color_rgb[num]   = NULL;
 226         color_names[num] = name;
 227 }
 228
 229 /** Initializes the used colors. */
 230 static void init_colors(void)
 231 {
 232         static bool initialized = 0;
 233         if (initialized)
 234                 return;
 235
 236         obstack_init(&color_obst);
 237
 238         custom_color(ird_color_prog_background,       "204 204 204");
 239         custom_color(ird_color_block_background,      "255 255 0");
 240         custom_color(ird_color_dead_block_background, "190 150 150");
 241         named_color(ird_color_block_inout,            "lightblue");
 242         named_color(ird_color_default_node,           "white");
 243         custom_color(ird_color_memory,                "153 153 255");
 244         custom_color(ird_color_controlflow,           "255 153 153");
 245         custom_color(ird_color_const,                 "204 255 255");
 246         custom_color(ird_color_proj,                  "255 255 153");
 247         custom_color(ird_color_uses_memory,           "153 153 255");
 248         custom_color(ird_color_phi,                   "105 255 105");
 249         custom_color(ird_color_anchor,                "100 100 255");
 250         named_color(ird_color_error,                  "red");
 251         custom_color(ird_color_entity,                "204 204 255");
 252
 253         initialized = 1;
 254 }
 255
 256 /**
 257  * Prints the VCG color to a file.
 258  */
 259 static void print_vcg_color(FILE *out, ird_color_t color)
 260 {
 261         assert(color < ird_color_count);
 262         fprintf(out, "color:%s", color_names[color]);
 263 }
 264
 265 /**
 266  * Prints the edge kind of a given IR node.
 267  *
 268  * Projs should be dumped near their predecessor, so they get "nearedge".
 269  */
 270 static void print_node_edge_kind(FILE *out, const ir_node *node)
 271 {
 272         if (is_Proj(node)) {
 273                 fprintf(out, "nearedge: ");
 274         } else {
 275                 fprintf(out, "edge: ");
 276         }
 277 }
 278
 279 /**
 280  * Prints the edge from a type S to a type T with additional info fmt, ...
 281  * to the file F.
 282  */
 283 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
 284 {
 285         va_list ap;
 286
 287         va_start(ap, fmt);
 288         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
 289         fprintf(F, " targetname: "); PRINT_TYPEID(T);
 290         ir_vfprintf(F, fmt, ap);
 291         fprintf(F,"}\n");
 292         va_end(ap);
 293 }
 294
 295 /**
 296  * Prints the edge from a type tp to an entity ent with additional info fmt, ...
 297  * to the file F.
 298  */
 299 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
 300 {
 301         va_list ap;
 302
 303         va_start(ap, fmt);
 304         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
 305         fprintf(F, " targetname: \""); PRINT_ENTID(ent); fprintf(F, "\"");
 306         ir_vfprintf(F, fmt, ap);
 307         fprintf(F, "}\n");
 308         va_end(ap);
 309 }
 310
 311 /**
 312  * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
 313  * to the file F.
 314  */
 315 static void print_ent_ent_edge(FILE *F, const ir_entity *ent1, const ir_entity *ent2, int backedge, ird_color_t color, const char *fmt, ...)
 316 {
 317         va_list ap;
 318
 319         va_start(ap, fmt);
 320         if (backedge)
 321                 fprintf(F, "backedge: { sourcename: \"");
 322         else
 323                 fprintf(F, "edge: { sourcename: \"");
 324         PRINT_ENTID(ent1);
 325         fprintf(F, "\" targetname: \""); PRINT_ENTID(ent2);  fprintf(F, "\"");
 326         ir_vfprintf(F, fmt, ap);
 327         fprintf(F, " ");
 328         if (color != ird_color_none)
 329                 print_vcg_color(F, color);
 330         fprintf(F, "}\n");
 331         va_end(ap);
 332 }
 333
 334 /**
 335  * Prints the edge from an entity ent to a type tp with additional info fmt, ...
 336  * to the file F.
 337  */
 338 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
 339 {
 340         va_list ap;
 341
 342         va_start(ap, fmt);
 343         fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
 344         fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
 345         ir_vfprintf(F, fmt, ap);
 346         fprintf(F,"}\n");
 347         va_end(ap);
 348 }
 349
 350 /**
 351  * Prints the edge from a node irn to a type tp with additional info fmt, ...
 352  * to the file F.
 353  */
 354 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
 355 {
 356         va_list ap;
 357
 358         va_start(ap, fmt);
 359         fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
 360         fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
 361         ir_vfprintf(F, fmt, ap);
 362         fprintf(F,"}\n");
 363         va_end(ap);
 364 }
 365
 366 /**
 367  * Prints the edge from a node irn to an entity ent with additional info fmt, ...
 368  * to the file F.
 369  */
 370 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
 371 {
 372         va_list ap;
 373
 374         va_start(ap, fmt);
 375         fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
 376         fprintf(F, "\" targetname: \""); PRINT_ENTID(ent);
 377         fprintf(F, "\"");
 378         ir_vfprintf(F, fmt, ap);
 379         fprintf(F,"}\n");
 380         va_end(ap);
 381 }
 382
 383 /**
 384  * Prints the edge from an entity ent to a node irn with additional info fmt, ...
 385  * to the file F.
 386  */
 387 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
 388 {
 389         va_list ap;
 390
 391         va_start(ap, fmt);
 392         fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
 393         fprintf(F, "\" targetname: \""); PRINT_NODEID(irn); fprintf(F, "\"");
 394         ir_vfprintf(F, fmt, ap);
 395         fprintf(F,"}\n");
 396         va_end(ap);
 397 }
 398
 399 /**
 400  * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
 401  * to the file F.
 402  */
 403 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
 404 {
 405         va_list ap;
 406
 407         va_start(ap, fmt);
 408         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
 409         fprintf(F, " targetname: \""); PRINT_ITEMID(tp, item); fprintf(F, "\" ");
 410         ir_vfprintf(F, fmt, ap);
 411         fprintf(F,"}\n");
 412         va_end(ap);
 413 }
 414
 415 /*-----------------------------------------------------------------*/
 416 /* global and ahead declarations                                   */
 417 /*-----------------------------------------------------------------*/
 418
 419 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
 420
 421 /*-----------------------------------------------------------------*/
 422 /* Helper functions.                                                */
 423 /*-----------------------------------------------------------------*/
 424
 425 /**
 426  * This map is used as a private link attr to be able to call dumper
 427  * anywhere without destroying link fields.
 428  */
 429 static pmap *irdump_link_map = NULL;
 430
 431 /** NOT A STANDARD LIBFIRM INIT METHOD
 432  *
 433  * We do not want to integrate dumping into libfirm, i.e., if the dumpers
 434  * are off, we want to have as few interferences as possible.  Therefore the
 435  * initialization is performed lazily and not called from within init_firm.
 436  *
 437  * Creates the link attribute map. */
 438 static void init_irdump(void)
 439 {
 440         /* We need a new, empty map. */
 441         if (irdump_link_map) pmap_destroy(irdump_link_map);
 442         irdump_link_map = pmap_create();
 443         if (!dump_file_filter_id)
 444                 dump_file_filter_id = new_id_from_str("");
 445 }
 446
 447 /**
 448  * Returns the private link field.
 449  */
 450 static void *ird_get_irn_link(const ir_node *n)
 451 {
 452         void *res = NULL;
 453         if (irdump_link_map == NULL)
 454                 return NULL;
 455
 456         if (pmap_contains(irdump_link_map, n))
 457                 res = pmap_get(irdump_link_map, n);
 458         return res;
 459 }
 460
 461 /**
 462  * Sets the private link field.
 463  */
 464 static void ird_set_irn_link(const ir_node *n, void *x)
 465 {
 466         if (irdump_link_map == NULL)
 467                 init_irdump();
 468         pmap_insert(irdump_link_map, n, x);
 469 }
 470
 471 /**
 472  * Gets the private link field of an irg.
 473  */
 474 static void *ird_get_irg_link(const ir_graph *irg)
 475 {
 476         void *res = NULL;
 477         if (irdump_link_map == NULL)
 478                 return NULL;
 479
 480         if (pmap_contains(irdump_link_map, irg))
 481                 res = pmap_get(irdump_link_map, irg);
 482         return res;
 483 }
 484
 485 /**
 486  * Sets the private link field of an irg.
 487  */
 488 static void ird_set_irg_link(const ir_graph *irg, void *x)
 489 {
 490         if (irdump_link_map == NULL)
 491                 init_irdump();
 492         pmap_insert(irdump_link_map, irg, x);
 493 }
 494
 495 /**
 496  * Walker, clears the private link field.
 497  */
 498 static void clear_link(ir_node *node, void *env)
 499 {
 500         (void) env;
 501         ird_set_irn_link(node, NULL);
 502 }
 503
 504 /**
 505  * If the entity has a ld_name, returns it if the dump_ld_name is set,
 506  * else returns the name of the entity.
 507  */
 508 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
 509 {
 510         if (ent == NULL)
 511                 return "<NULL entity>";
 512         if (dump_ld_name) {
 513                 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
 514                 if (ent->ld_name != NULL)
 515                         return get_id_str(ent->ld_name);
 516         }
 517         return get_id_str(ent->name);
 518 }
 519
 520 const char *get_ent_dump_name(const ir_entity *ent)
 521 {
 522         return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
 523 }
 524
 525 const char *get_irg_dump_name(const ir_graph *irg)
 526 {
 527         /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
 528         return _get_ent_dump_name(get_irg_entity(irg), true);
 529 }
 530
 531 /**
 532  * Returns non-zero if a node is in floating state.
 533  */
 534 static int node_floats(const ir_node *n)
 535 {
 536         return ((get_irn_pinned(n) == op_pin_state_floats) &&
 537                 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
 538 }
 539
 540 /**
 541  *  Walker that visits the anchors
 542  */
 543 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
 544 {
 545         if ((flags & ir_dump_flag_all_anchors)
 546                         || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
 547                 irg_walk_anchors(irg, pre, post, env);
 548         } else {
 549                 irg_walk_graph(irg, pre, post, env);
 550         }
 551 }
 552
 553 /**
 554  * Walker, allocates an array for all blocks and puts their non-floating
 555  * nodes into this array.
 556  */
 557 static void collect_node(ir_node *node, void *env)
 558 {
 559         (void) env;
 560         if (is_Block(node)
 561             || node_floats(node)
 562             || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
 563                 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
 564                 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
 565                 ARR_APP1(ir_node *, arr, node);
 566                 ird_set_irg_link(get_irn_irg(node), arr);    /* arr is an l-value, APP_ARR might change it! */
 567         } else {
 568                 ir_node * block = get_nodes_block(node);
 569
 570                 if (is_Bad(block)) {
 571                         /* this node is in a Bad block, so we must place it into the graph's list */
 572                         ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
 573                         if (!arr) arr = NEW_ARR_F(ir_node *, 0);
 574                         ARR_APP1(ir_node *, arr, node);
 575                         ird_set_irg_link(get_irn_irg(node), arr);    /* arr is an l-value, APP_ARR might change it! */
 576                 } else {
 577                         ird_set_irn_link(node, ird_get_irn_link(block));
 578                         ird_set_irn_link(block, node);
 579                 }
 580         }
 581 }
 582
 583 /** Construct lists to walk ir block-wise.
 584  *
 585  * Collects all blocks, nodes not op_pin_state_pinned,
 586  * Bad, NoMem and Unknown into a flexible array in link field of
 587  * irg they belong to.  Sets the irg link field to NULL in all
 588  * graphs not visited.
 589  * Free the list with DEL_ARR_F().
 590  */
 591 static ir_node **construct_block_lists(ir_graph *irg)
 592 {
 593         size_t   i;
 594         int      walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
 595         ir_graph *rem      = current_ir_graph;
 596
 597         current_ir_graph = irg;
 598
 599         if (walk_flag) {
 600                 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
 601         }
 602
 603         for (i = get_irp_n_irgs(); i > 0;)
 604                 ird_set_irg_link(get_irp_irg(--i), NULL);
 605
 606         ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
 607
 608         if (walk_flag) {
 609                 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
 610         }
 611
 612         current_ir_graph = rem;
 613         return (ir_node**)ird_get_irg_link(irg);
 614 }
 615
 616 typedef struct list_tuple {
 617         ir_node **blk_list;
 618         ir_extblk **extbb_list;
 619 } list_tuple;
 620
 621 /** Construct lists to walk IR extended block-wise.
 622  * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
 623  * NULL in all graphs not visited.
 624  */
 625 static list_tuple *construct_extblock_lists(ir_graph *irg)
 626 {
 627         ir_node **blk_list = construct_block_lists(irg);
 628         size_t i, n;
 629         ir_graph *rem = current_ir_graph;
 630         list_tuple *lists = XMALLOC(list_tuple);
 631
 632         current_ir_graph = irg;
 633
 634         lists->blk_list   = NEW_ARR_F(ir_node *, 0);
 635         lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
 636
 637         inc_irg_block_visited(irg);
 638         for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
 639                 ir_extblk *ext;
 640
 641                 if (is_Block(blk_list[i])) {
 642                         ext = get_Block_extbb(blk_list[i]);
 643
 644                         if (extbb_not_visited(ext)) {
 645                                 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
 646                                 mark_extbb_visited(ext);
 647                         }
 648                 } else
 649                         ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
 650         }
 651         DEL_ARR_F(blk_list);
 652
 653         current_ir_graph = rem;
 654         ird_set_irg_link(irg, lists);
 655         return lists;
 656 }
 657
 658 void dump_node_opcode(FILE *F, const ir_node *n)
 659 {
 660         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 661
 662         /* call the dump_node operation if available */
 663         if (ops->dump_node) {
 664                 ops->dump_node(F, n, dump_node_opcode_txt);
 665                 return;
 666         }
 667
 668         /* implementation for default nodes */
 669         switch (get_irn_opcode(n)) {
 670         case iro_SymConst:
 671                 switch (get_SymConst_kind(n)) {
 672                 case symconst_addr_ent:
 673                         fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
 674                         break;
 675                 case symconst_ofs_ent:
 676                         fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
 677                         break;
 678                 case symconst_type_size:
 679                         ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
 680                         break;
 681                 case symconst_type_align:
 682                         ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
 683                         break;
 684                 case symconst_enum_const:
 685                         fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
 686                         break;
 687                 }
 688                 break;
 689
 690         case iro_Load:
 691                 if (get_Load_unaligned(n) == align_non_aligned)
 692                         fprintf(F, "ua");
 693                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
 694                 break;
 695         case iro_Store:
 696                 if (get_Store_unaligned(n) == align_non_aligned)
 697                         fprintf(F, "ua");
 698                 fprintf(F, "%s", get_irn_opname(n));
 699                 break;
 700         case iro_Block:
 701                 if (n == get_irg_start_block(get_irn_irg(n)))
 702                         fputs("Start ", F);
 703                 if (n == get_irg_end_block(get_irn_irg(n)))
 704                         fputs("End ", F);
 705                 fprintf(F, "%s%s", get_irn_opname(n),
 706                         (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
 707                 break;
 708         case iro_Conv:
 709                 if (get_Conv_strict(n))
 710                         fprintf(F, "strict");
 711                 fprintf(F, "%s", get_irn_opname(n));
 712                 break;
 713         case iro_Div:
 714                 fprintf(F, "%s", get_irn_opname(n));
 715                 if (get_Div_no_remainder(n))
 716                         fprintf(F, "RL");
 717                 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
 718                 break;
 719         case iro_Mod:
 720                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
 721                 break;
 722         case iro_Builtin:
 723                 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
 724                 break;
 725
 726         default:
 727                 fprintf(F, "%s", get_irn_opname(n));
 728         }
 729 }
 730
 731 /**
 732  * Dump the mode of a node n to a file F.
 733  * Ignore modes that are "always known".
 734  */
 735 static void dump_node_mode(FILE *F, const ir_node *n)
 736 {
 737         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 738         unsigned         iro;
 739         ir_mode         *mode;
 740
 741         /* call the dump_node operation if available */
 742         if (ops->dump_node) {
 743                 ops->dump_node(F, n, dump_node_mode_txt);
 744                 return;
 745         }
 746
 747         /* default implementation */
 748         iro = get_irn_opcode(n);
 749         switch (iro) {
 750         case iro_SymConst:
 751         case iro_Sel:
 752         case iro_End:
 753         case iro_Return:
 754         case iro_Free:
 755         case iro_Sync:
 756         case iro_Jmp:
 757         case iro_NoMem:
 758                 break;
 759         default:
 760                 mode = get_irn_mode(n);
 761
 762                 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
 763                         (mode != mode_T || iro == iro_Proj))
 764                         fprintf(F, "%s", get_mode_name_ex(mode, NULL));
 765         }
 766 }
 767
 768 /**
 769  * Dump the type of a node n to a file F if it's known.
 770  */
 771 static int dump_node_typeinfo(FILE *F, const ir_node *n)
 772 {
 773         int bad = 0;
 774
 775         if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
 776                 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent  ||
 777                         get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
 778                         ir_type *tp = get_irn_typeinfo_type(n);
 779                         if (tp != firm_none_type) {
 780                                 ir_fprintf(F, "[%+F]", tp);
 781                         } else {
 782                                 fprintf(F, "[] ");
 783                         }
 784                 }
 785         }
 786         return bad;
 787 }
 788
 789 /**
 790  * Dump additional node attributes of some nodes to a file F.
 791  */
 792 static void dump_node_nodeattr(FILE *F, const ir_node *n)
 793 {
 794         ir_node *pred;
 795         unsigned code;
 796         long proj_nr;
 797         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 798
 799         /* call the dump_node operation if available */
 800         if (ops->dump_node) {
 801                 ops->dump_node(F, n, dump_node_nodeattr_txt);
 802                 return;
 803         }
 804
 805         switch (get_irn_opcode(n)) {
 806         case iro_Const:
 807                 ir_fprintf(F, "%T ", get_Const_tarval(n));
 808                 break;
 809
 810         case iro_Proj:
 811                 pred    = get_Proj_pred(n);
 812                 proj_nr = get_Proj_proj(n);
 813                 code    = get_irn_opcode(pred);
 814
 815                 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
 816                         fprintf(F, "Arg %ld ", proj_nr);
 817                 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
 818                         fprintf(F, "%ld ", proj_nr);
 819                 else {
 820                         unsigned i, j, f = 0;
 821
 822                         for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
 823                                 if (code == proj_lut[i].code) {
 824                                         for (j = 0; j < proj_lut[i].num_data; ++j) {
 825                                                 if (proj_nr == proj_lut[i].data[j].nr) {
 826                                                         fprintf(F, "%s ", proj_lut[i].data[j].name);
 827                                                         f = 1;
 828                                                         break;
 829                                                 }
 830                                         }
 831                                         break;
 832                                 }
 833                         }
 834                         if (! f)
 835                                 fprintf(F, "%ld ", proj_nr);
 836                         if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
 837                                 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
 838                                         fprintf(F, "PRED ");
 839                                 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
 840                                         fprintf(F, "PRED ");
 841                         }
 842                 }
 843                 break;
 844         case iro_Sel:
 845                 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
 846                 break;
 847         case iro_Cast:
 848                 ir_fprintf(F, "(%+F)", get_Cast_type(n));
 849                 break;
 850         case iro_Cmp:
 851                 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
 852                 break;
 853         case iro_Confirm:
 854                 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
 855                 break;
 856         case iro_CopyB:
 857                 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
 858                 break;
 859
 860         default:
 861                 break;
 862         }
 863 }
 864
 865 void dump_node_label(FILE *F, const ir_node *n)
 866 {
 867         dump_node_opcode(F, n);
 868         fputs(" ", F);
 869         dump_node_mode(F, n);
 870         fprintf(F, " ");
 871         dump_node_typeinfo(F, n);
 872         dump_node_nodeattr(F, n);
 873         if (flags & ir_dump_flag_number_label) {
 874                 fprintf(F, "%ld", get_irn_node_nr(n));
 875         }
 876         if (flags & ir_dump_flag_idx_label) {
 877                 fprintf(F, ":%u", get_irn_idx(n));
 878         }
 879 }
 880
 881 /**
 882  * Dumps the attributes of a node n into the file F.
 883  * Currently this is only the color of a node.
 884  */
 885 static void dump_node_vcgattr(FILE *F, const ir_node *node, const ir_node *local, bool bad)
 886 {
 887         ir_mode *mode;
 888         const ir_node *n;
 889
 890         if (bad) {
 891                 print_vcg_color(F, ird_color_error);
 892                 return;
 893         }
 894
 895         if (dump_node_vcgattr_hook != NULL) {
 896                 dump_node_vcgattr_hook(F, node, local);
 897                 return;
 898         }
 899
 900         n = local ? local : node;
 901
 902         if (overrule_nodecolor != ird_color_default_node) {
 903                 print_vcg_color(F, overrule_nodecolor);
 904                 return;
 905         }
 906
 907         mode = get_irn_mode(n);
 908         if (mode == mode_M) {
 909                 print_vcg_color(F, ird_color_memory);
 910                 return;
 911         }
 912         if (mode == mode_X) {
 913                 print_vcg_color(F, ird_color_controlflow);
 914                 return;
 915         }
 916
 917         switch (get_irn_opcode(n)) {
 918         case iro_Start:
 919         case iro_End:
 920                 print_vcg_color(F, ird_color_anchor);
 921                 break;
 922         case iro_Bad:
 923                 print_vcg_color(F, ird_color_error);
 924                 break;
 925         case iro_Block:
 926                 print_vcg_color(F, ird_color_block_background);
 927                 break;
 928         case iro_Phi:
 929                 print_vcg_color(F, ird_color_phi);
 930                 break;
 931         case iro_Pin:
 932                 print_vcg_color(F, ird_color_memory);
 933                 break;
 934         case iro_SymConst:
 935         case iro_Const:
 936                 print_vcg_color(F, ird_color_const);
 937                 break;
 938         case iro_Proj:
 939                 print_vcg_color(F, ird_color_proj);
 940                 break;
 941         default: {
 942                 ir_op *op = get_irn_op(node);
 943
 944                 if (is_op_constlike(op)) {
 945                         print_vcg_color(F, ird_color_const);
 946                 } else if (is_op_uses_memory(op)) {
 947                         print_vcg_color(F, ird_color_uses_memory);
 948                 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
 949                         print_vcg_color(F, ird_color_controlflow);
 950                 }
 951         }
 952         }
 953 }
 954
 955 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
 956 {
 957         hook_entry_t *info = XMALLOCZ(hook_entry_t);
 958
 959         info->hook._hook_node_info = cb;
 960         info->context              = data;
 961         register_hook(hook_node_info, info);
 962
 963         return info;
 964 }
 965
 966 void dump_remove_node_info_callback(void *handle)
 967 {
 968         hook_entry_t *info = (hook_entry_t*)handle;
 969         unregister_hook(hook_node_info, info);
 970         xfree(info);
 971 }
 972
 973 /**
 974  * Dump the node information of a node n to a file F.
 975  */
 976 static void dump_node_info(FILE *F, const ir_node *n)
 977 {
 978         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 979
 980         fprintf(F, " info1: \"");
 981         dump_irnode_to_file(F, n);
 982         /* call the dump_node operation if available */
 983         if (ops->dump_node)
 984                 ops->dump_node(F, n, dump_node_info_txt);
 985
 986         /* allow additional info to be added */
 987         hook_node_info(F, n);
 988         fprintf(F, "\"\n");
 989 }
 990
 991 static int is_constlike_node(const ir_node *node)
 992 {
 993         const ir_op *op = get_irn_op(node);
 994         return is_op_constlike(op);
 995 }
 996
 997
 998 /** outputs the predecessors of n, that are constants, local.  I.e.,
 999    generates a copy of the constant predecessors for each node called with. */
1000 static void dump_const_node_local(FILE *F, const ir_node *n)
1001 {
1002         int i;
1003         if (!get_opt_dump_const_local()) return;
1004
1005         /* Use visited flag to avoid outputting nodes twice.
1006         initialize it first. */
1007         for (i = 0; i < get_irn_arity(n); i++) {
1008                 ir_node *con = get_irn_n(n, i);
1009                 if (is_constlike_node(con)) {
1010                         set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1011                 }
1012         }
1013
1014         for (i = 0; i < get_irn_arity(n); i++) {
1015                 ir_node *con = get_irn_n(n, i);
1016                 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1017                         /* Generate a new name for the node by appending the names of
1018                         n and const. */
1019                         fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1020                         fprintf(F, " label: \"");
1021                         dump_node_label(F, con);
1022                         fprintf(F, "\" ");
1023                         dump_node_info(F, con);
1024                         dump_node_vcgattr(F, n, con, 0);
1025                         fprintf(F, "}\n");
1026                 }
1027         }
1028 }
1029
1030 /** If the block of an edge is a const_like node, dump it local with an edge */
1031 static void dump_const_block_local(FILE *F, const ir_node *n)
1032 {
1033         ir_node *blk;
1034
1035         if (!get_opt_dump_const_local()) return;
1036
1037         blk = get_nodes_block(n);
1038         if (is_constlike_node(blk)) {
1039                 /* Generate a new name for the node by appending the names of
1040                 n and blk. */
1041                 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1042                 fprintf(F, "\" label: \"");
1043                 dump_node_label(F, blk);
1044                 fprintf(F, "\" ");
1045                 dump_node_info(F, blk);
1046                 dump_node_vcgattr(F, n, blk, 0);
1047                 fprintf(F, "}\n");
1048
1049                 fprintf(F, "edge: { sourcename: \"");
1050                 PRINT_NODEID(n);
1051                 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1052
1053                 if (dump_edge_vcgattr_hook) {
1054                         fprintf(F, "\" ");
1055                         if (dump_edge_vcgattr_hook(F, n, -1)) {
1056                                 fprintf(F, "}\n");
1057                                 return;
1058                         } else {
1059                                 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1060                                 return;
1061                         }
1062                 }
1063
1064                 fprintf(F, "\" "   BLOCK_EDGE_ATTR "}\n");
1065         }
1066 }
1067
1068 /**
1069  * prints the error message of a node to a file F as info2.
1070  */
1071 static void print_node_error(FILE *F, const char *err_msg)
1072 {
1073         if (! err_msg)
1074                 return;
1075
1076         fprintf(F, " info2: \"%s\"", err_msg);
1077 }
1078
1079 /**
1080  * prints debug messages of a node to file F as info3.
1081  */
1082 static void print_dbg_info(FILE *F, dbg_info *dbg)
1083 {
1084         char buf[1024];
1085
1086         ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1087         if (buf[0] != 0) {
1088                 fprintf(F, " info3: \"%s\"\n", buf);
1089         }
1090 }
1091
1092 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1093 {
1094         (void) F;
1095         (void) dbg;
1096         /* TODO */
1097 }
1098
1099 /**
1100  * Dump a node
1101  */
1102 void dump_node(FILE *F, const ir_node *n)
1103 {
1104         int bad = 0;
1105         const char *p;
1106
1107         if (get_opt_dump_const_local() && is_constlike_node(n))
1108                 return;
1109
1110         /* dump this node */
1111         fputs("node: {title: \"", F);
1112         PRINT_NODEID(n);
1113         fputs("\"", F);
1114
1115         fputs(" label: \"", F);
1116         bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1117         dump_node_label(F, n);
1118         fputs("\" ", F);
1119
1120         dump_node_info(F, n);
1121         print_node_error(F, p);
1122         print_dbg_info(F, get_irn_dbg_info(n));
1123         dump_node_vcgattr(F, n, NULL, bad);
1124         fputs("}\n", F);
1125         dump_const_node_local(F, n);
1126
1127 }
1128
1129 /** dump the edge to the block this node belongs to */
1130 static void dump_ir_block_edge(FILE *F, const ir_node *n)
1131 {
1132         if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1133         if (!is_Block(n)) {
1134                 ir_node *block = get_nodes_block(n);
1135
1136                 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1137                         dump_const_block_local(F, n);
1138                 } else {
1139                         fprintf(F, "edge: { sourcename: \"");
1140                         PRINT_NODEID(n);
1141                         fprintf(F, "\" targetname: ");
1142                         fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1143
1144                         if (dump_edge_vcgattr_hook) {
1145                                 fprintf(F, " ");
1146                                 if (dump_edge_vcgattr_hook(F, n, -1)) {
1147                                         fprintf(F, "}\n");
1148                                         return;
1149                                 } else {
1150                                         fprintf(F, " "  BLOCK_EDGE_ATTR "}\n");
1151                                         return;
1152                                 }
1153                         }
1154
1155                         fprintf(F, " "   BLOCK_EDGE_ATTR "}\n");
1156                 }
1157         }
1158 }
1159
1160 static void print_data_edge_vcgattr(FILE *F, const ir_node *from, int to)
1161 {
1162         /*
1163          * do not use get_nodes_block() here, will fail
1164          * if the irg is not pinned.
1165          */
1166         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1167                 fprintf(F, INTRA_DATA_EDGE_ATTR);
1168         else
1169                 fprintf(F, INTER_DATA_EDGE_ATTR);
1170 }
1171
1172 static void print_mem_edge_vcgattr(FILE *F, const ir_node *from, int to)
1173 {
1174         /*
1175          * do not use get_nodes_block() here, will fail
1176          * if the irg is not pinned.
1177          */
1178         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1179                 fprintf(F, INTRA_MEM_EDGE_ATTR);
1180         else
1181                 fprintf(F, INTER_MEM_EDGE_ATTR);
1182 }
1183
1184 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1185 static void print_edge_vcgattr(FILE *F, const ir_node *from, int to)
1186 {
1187         assert(from);
1188
1189         if (dump_edge_vcgattr_hook)
1190                 if (dump_edge_vcgattr_hook(F, from, to))
1191                         return;
1192
1193         if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1194                 fprintf(F, BACK_EDGE_ATTR);
1195
1196         switch (get_irn_opcode(from)) {
1197         case iro_Block:
1198                 fprintf(F, CF_EDGE_ATTR);
1199                 break;
1200         case iro_Start:  break;
1201         case iro_End:
1202                 if (to >= 0) {
1203                         if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1204                                 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1205                         else
1206                                 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1207                 }
1208                 break;
1209         default:
1210                 if (is_Proj(from)) {
1211                         if (get_irn_mode(from) == mode_M)
1212                                 print_mem_edge_vcgattr(F, from, to);
1213                         else if (get_irn_mode(from) == mode_X)
1214                                 fprintf(F, CF_EDGE_ATTR);
1215                         else
1216                                 print_data_edge_vcgattr(F, from, to);
1217                 }
1218                 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1219                         print_mem_edge_vcgattr(F, from, to);
1220                 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1221                         fprintf(F, CF_EDGE_ATTR);
1222                 else
1223                         print_data_edge_vcgattr(F, from, to);
1224         }
1225 }
1226
1227 /** dump edges to our inputs */
1228 static void dump_ir_data_edges(FILE *F, const ir_node *n)
1229 {
1230         int i, num;
1231
1232         if (dump_node_edge_hook)
1233                 dump_node_edge_hook(F, n);
1234
1235         if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1236                 /* the End node has only keep-alive edges */
1237                 return;
1238         }
1239
1240         /* dump the dependency edges. */
1241         num = get_irn_deps(n);
1242         for (i = 0; i < num; ++i) {
1243                 ir_node *dep = get_irn_dep(n, i);
1244
1245                 if (dep) {
1246                         print_node_edge_kind(F, n);
1247                         fprintf(F, "{sourcename: \"");
1248                         PRINT_NODEID(n);
1249                         fprintf(F, "\" targetname: ");
1250                         if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1251                                 PRINT_CONSTID(n, dep);
1252                         } else {
1253                                 fprintf(F, "\"");
1254                                 PRINT_NODEID(dep);
1255                                 fprintf(F, "\"");
1256                         }
1257                         fprintf(F, " label: \"%d\" ", i);
1258                         fprintf(F, " color: darkgreen}\n");
1259                 }
1260         }
1261
1262         num = get_irn_arity(n);
1263         for (i = 0; i < num; i++) {
1264                 ir_node *pred = get_irn_n(n, i);
1265                 assert(pred);
1266
1267                 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1268                         fprintf(F, "backedge: {sourcename: \"");
1269                 } else {
1270                         print_node_edge_kind(F, n);
1271                         fprintf(F, "{sourcename: \"");
1272                 }
1273                 PRINT_NODEID(n);
1274                 fprintf(F, "\" targetname: ");
1275                 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1276                         PRINT_CONSTID(n, pred);
1277                 } else {
1278                         fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1279                 }
1280                 fprintf(F, " label: \"%d\" ", i);
1281                 print_edge_vcgattr(F, n, i);
1282                 fprintf(F, "}\n");
1283         }
1284 }
1285
1286 /**
1287  * Dump the ir_edges
1288  */
1289 static void dump_ir_edges(ir_node *node, void *env)
1290 {
1291         int              i = 0;
1292         FILE            *F = (FILE*)env;
1293         const ir_edge_t *edge;
1294
1295         foreach_out_edge(node, edge) {
1296                 ir_node *succ = get_edge_src_irn(edge);
1297
1298                 print_node_edge_kind(F, succ);
1299                 fprintf(F, "{sourcename: \"");
1300                 PRINT_NODEID(node);
1301                 fprintf(F, "\" targetname: \"");
1302                 PRINT_NODEID(succ);
1303                 fprintf(F, "\"");
1304
1305                 fprintf(F, " label: \"%d\" ", i);
1306                 fprintf(F, OUT_EDGE_ATTR);
1307                 fprintf(F, "}\n");
1308                 ++i;
1309         }
1310 }
1311
1312
1313 /** Dumps a node and its edges but not the block edge  */
1314 static void dump_node_wo_blockedge(FILE *F, const ir_node *n)
1315 {
1316         dump_node(F, n);
1317         dump_ir_data_edges(F, n);
1318 }
1319
1320 /** Dumps a node and its edges. */
1321 static void dump_node_with_edges(ir_node *n, void *env)
1322 {
1323         FILE *F = (FILE*)env;
1324         dump_node_wo_blockedge(F, n);
1325         if (!node_floats(n))
1326                 dump_ir_block_edge(F, n);
1327 }
1328
1329 /** Dumps a const-like node. */
1330 static void dump_const_node(ir_node *n, void *env)
1331 {
1332         FILE *F = (FILE*)env;
1333         if (is_Block(n)) return;
1334         dump_node_wo_blockedge(F, n);
1335 }
1336
1337 /***********************************************************************/
1338 /* the following routines dump the nodes/irgs bracketed to graphs.     */
1339 /***********************************************************************/
1340
1341 /** Dumps a constant expression as entity initializer, array bound ... */
1342 static void dump_const_expression(FILE *F, ir_node *value)
1343 {
1344         ir_graph *rem = current_ir_graph;
1345         ir_dump_flags_t old_flags = ir_get_dump_flags();
1346         ir_remove_dump_flags(ir_dump_flag_consts_local);
1347
1348         current_ir_graph = get_const_code_irg();
1349         irg_walk(value, dump_const_node, NULL, F);
1350         /* Decrease visited flag so that we walk with the same flag for the next
1351            expression.  This guarantees that we don't dump the same node twice,
1352            as for const expressions cse is performed to save memory. */
1353         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1354
1355         ir_set_dump_flags(old_flags);
1356         current_ir_graph = rem;
1357 }
1358
1359 /** Dump a block as graph containing its nodes.
1360  *
1361  *  Expects to find nodes belonging to the block as list in its
1362  *  link field.
1363  *  Dumps the edges of all nodes including itself. */
1364 static void dump_whole_block(FILE *F, const ir_node *block)
1365 {
1366         ir_node *node;
1367         ird_color_t color = ird_color_block_background;
1368
1369         assert(is_Block(block));
1370
1371         fprintf(F, "graph: { title: \"");
1372         PRINT_NODEID(block);
1373         fprintf(F, "\"  label: \"");
1374         dump_node_label(F, block);
1375
1376         /* colorize blocks */
1377         if (! get_Block_matured(block))
1378                 color = ird_color_block_background;
1379
1380         fprintf(F, "\" status:clustered ");
1381         print_vcg_color(F, color);
1382         fprintf(F, "\n");
1383
1384         /* yComp can show attributes for blocks, XVCG parses but ignores them */
1385         dump_node_info(F, block);
1386         print_dbg_info(F, get_irn_dbg_info(block));
1387
1388         /* dump the blocks edges */
1389         dump_ir_data_edges(F, block);
1390
1391         if (dump_block_edge_hook)
1392                 dump_block_edge_hook(F, block);
1393
1394         /* dump the nodes that go into the block */
1395         for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1396                 dump_node(F, node);
1397                 dump_ir_data_edges(F, node);
1398         }
1399
1400         /* Close the vcg information for the block */
1401         fprintf(F, "}\n");
1402         dump_const_node_local(F, block);
1403         fprintf(F, "\n");
1404 }
1405
1406 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1407  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1408 static void dump_block_graph(FILE *F, ir_graph *irg)
1409 {
1410         size_t i, n;
1411         ir_graph *rem = current_ir_graph;
1412         ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1413         current_ir_graph = irg;
1414
1415         for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1416                 ir_node *node = arr[i];
1417                 if (is_Block(node)) {
1418                 /* Dumps the block and all the nodes in the block, which are to
1419                         be found in Block->link. */
1420                         dump_whole_block(F, node);
1421                 } else {
1422                         /* Nodes that are not in a Block. */
1423                         dump_node(F, node);
1424                         if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1425                                 dump_const_block_local(F, node);
1426                         }
1427                         dump_ir_data_edges(F, node);
1428                 }
1429                 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1430                         dump_ir_edges(node, F);
1431         }
1432
1433         if ((flags & ir_dump_flag_loops)
1434              && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1435                 dump_loop_nodes_into_graph(F, irg);
1436
1437         current_ir_graph = rem;
1438 }
1439
1440 /**
1441  * Dump the info for an irg.
1442  * Parsed by XVCG but not shown. use yComp.
1443  */
1444 static void dump_graph_info(FILE *F, ir_graph *irg)
1445 {
1446         fprintf(F, "info1: \"");
1447         dump_entity_to_file(F, get_irg_entity(irg));
1448         fprintf(F, "\n");
1449
1450         /* dump graph state */
1451         fprintf(F, "state:");
1452         if (is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP))
1453                 fprintf(F, " arch_dep");
1454         if (is_irg_state(irg, IR_GRAPH_STATE_MODEB_LOWERED))
1455                 fprintf(F, " modeb_lowered");
1456         if (is_irg_state(irg, IR_GRAPH_STATE_NORMALISATION2))
1457                 fprintf(F, " normalisation2");
1458         if (is_irg_state(irg, IR_GRAPH_STATE_IMPLICIT_BITFIELD_MASKING))
1459                 fprintf(F, " implicit_bitfield_masking");
1460         if (is_irg_state(irg, IR_GRAPH_STATE_OPTIMIZE_UNREACHABLE_CODE))
1461                 fprintf(F, " optimize_unreachable_code");
1462         if (is_irg_state(irg, IR_GRAPH_STATE_NO_CRITICAL_EDGES))
1463                 fprintf(F, " no_critical_edges");
1464         if (is_irg_state(irg, IR_GRAPH_STATE_NO_BADS))
1465                 fprintf(F, " no_bads");
1466         if (is_irg_state(irg, IR_GRAPH_STATE_NO_UNREACHABLE_CODE))
1467                 fprintf(F, " no_unreachable_code");
1468         if (is_irg_state(irg, IR_GRAPH_STATE_ONE_RETURN))
1469                 fprintf(F, " one_return");
1470         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE))
1471                 fprintf(F, " consistent_dominance");
1472         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE))
1473                 fprintf(F, " consistent_postdominance");
1474         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUT_EDGES))
1475                 fprintf(F, " consistent_out_edges");
1476         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))
1477                 fprintf(F, " consistent_outs");
1478         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1479                 fprintf(F, " consistent_loopinfo");
1480         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
1481                 fprintf(F, " consistent_entity_usage");
1482         if (is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
1483                 fprintf(F, " valid_exended_blocks");
1484         fprintf(F, "\"\n");
1485 }
1486
1487 /** Dumps an irg as a graph clustered by block nodes.
1488  *  If interprocedural view edges can point to nodes out of this graph.
1489  */
1490 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1491 {
1492         ir_entity *ent = get_irg_entity(irg);
1493
1494         fprintf(F, "graph: { title: \"");
1495         PRINT_IRGID(irg);
1496         fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1497           get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1498
1499         dump_graph_info(F, irg);
1500         print_dbg_info(F, get_entity_dbg_info(ent));
1501
1502         dump_block_graph(F, irg);
1503
1504         /* Close the vcg information for the irg */
1505         fprintf(F, "}\n\n");
1506 }
1507
1508 /*******************************************************************/
1509 /* Basic type and entity nodes and edges.                          */
1510 /*******************************************************************/
1511
1512 /** dumps the edges between nodes and their type or entity attributes. */
1513 static void dump_node2type_edges(ir_node *n, void *env)
1514 {
1515         FILE *F = (FILE*)env;
1516         assert(n);
1517
1518         switch (get_irn_opcode(n)) {
1519         case iro_Const :
1520                 /* @@@ some consts have an entity */
1521                 break;
1522         case iro_SymConst:
1523                 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1524                         print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1525                 break;
1526         case iro_Sel:
1527                 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1528                 break;
1529         case iro_Call:
1530                 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1531                 break;
1532         case iro_Alloc:
1533                 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1534                 break;
1535         case iro_Free:
1536                 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1537                 break;
1538         case iro_Cast:
1539                 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1540                 break;
1541         default:
1542                 break;
1543         }
1544 }
1545
1546 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1547 {
1548         switch (get_type_tpop_code(tp)) {
1549         case tpo_class:
1550                 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1551                 break;
1552         case tpo_struct:
1553                 fprintf(F, " " TYPE_METH_NODE_ATTR);
1554                 break;
1555         case tpo_method:
1556                 break;
1557         case tpo_union:
1558                 break;
1559         case tpo_array:
1560                 break;
1561         case tpo_enumeration:
1562                 break;
1563         case tpo_pointer:
1564                 break;
1565         case tpo_primitive:
1566                 break;
1567         default:
1568                 break;
1569         }
1570 }
1571
1572 void dump_type_node(FILE *F, ir_type *tp)
1573 {
1574         fprintf(F, "node: {title: ");
1575         PRINT_TYPEID(tp);
1576         fprintf(F, " label: \"");
1577         if (tp->dbi != NULL) {
1578                 char buf[1024];
1579                 ir_print_type(buf, sizeof(buf), tp);
1580                 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1581         } else {
1582                 ir_fprintf(F, "%+F", tp);
1583         }
1584         fputs("\" info1: \"", F);
1585         dump_type_to_file(F, tp);
1586         fprintf(F, "\"\n");
1587         print_type_dbg_info(F, get_type_dbg_info(tp));
1588         print_typespecific_vcgattr(F, tp);
1589         fprintf(F, "}\n");
1590 }
1591
1592 static void dump_entity_node(FILE *F, ir_entity *ent)
1593 {
1594         fprintf(F, "node: {title: \"");
1595         PRINT_ENTID(ent); fprintf(F, "\"");
1596         fprintf(F, " label: ");
1597         fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1598
1599         print_vcg_color(F, ird_color_entity);
1600         fprintf(F, "\n info1: \"");
1601
1602         dump_entity_to_file(F, ent);
1603
1604         fprintf(F, "\"\n");
1605         print_dbg_info(F, get_entity_dbg_info(ent));
1606         fprintf(F, "}\n");
1607 }
1608
1609 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1610 {
1611         char buf[1024];
1612         ir_enum_const *ec = get_enumeration_const(tp, pos);
1613         ident         *id = get_enumeration_const_nameid(ec);
1614         ir_tarval     *tv = get_enumeration_value(ec);
1615
1616         if (tv)
1617                 tarval_snprintf(buf, sizeof(buf), tv);
1618         else
1619                 strncpy(buf, "<not set>", sizeof(buf));
1620         fprintf(F, "node: {title: \"");
1621         PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1622         fprintf(F, " label: ");
1623         fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1624         fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1625 }
1626
1627 /**
1628  * Dumps a new style initializer.
1629  */
1630 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1631 {
1632         /* TODO */
1633         (void) F;
1634         (void) ent;
1635 }
1636
1637 /**
1638  * type-walker: Dumps a type or entity and its edges.
1639  */
1640 static void dump_type_info(type_or_ent tore, void *env)
1641 {
1642         FILE *F = (FILE*)env;
1643         size_t i = 0;  /* to shutup gcc */
1644
1645         /* dump this type or entity */
1646
1647         switch (get_kind(tore.ent)) {
1648         case k_entity: {
1649                 ir_entity *ent = tore.ent;
1650                 ir_node *value;
1651                 /* The node */
1652                 dump_entity_node(F, ent);
1653                 /* The Edges */
1654                 /* skip this to reduce graph.  Member edge of type is parallel to this edge. *
1655                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1656                 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1657                 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1658                 if (is_Class_type(get_entity_owner(ent))) {
1659                         for (i = get_entity_n_overwrites(ent); i > 0;)
1660                                 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1661                 }
1662                 /* attached subgraphs */
1663                 if (! (flags & ir_dump_flag_no_entity_values)) {
1664                         if (ent->initializer != NULL) {
1665                                 /* new style initializers */
1666                                 dump_entity_initializer(F, ent);
1667                         } else if (entity_has_compound_ent_values(ent)) {
1668                                 /* old style compound entity values */
1669                                 for (i = get_compound_ent_n_values(ent); i > 0;) {
1670                                         value = get_compound_ent_value(ent, --i);
1671                                         if (value) {
1672                                                 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1673                                                 dump_const_expression(F, value);
1674                                                 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1675                                                 /*
1676                                                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1677                                                 ENT_CORR_EDGE_ATTR  "}\n", GET_ENTID(ent),
1678                                                 get_compound_ent_value_member(ent, i), i);
1679                                                 */
1680                                         }
1681                                 }
1682                         }
1683                 }
1684                 break;
1685         }
1686         case k_type: {
1687                 ir_type *tp = tore.typ;
1688                 dump_type_node(F, tp);
1689                 /* and now the edges */
1690                 switch (get_type_tpop_code(tp)) {
1691                 case tpo_class:
1692                         for (i = get_class_n_supertypes(tp); i > 0;) {
1693                                 --i;
1694                                 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1695                         }
1696                         for (i = get_class_n_members(tp); i > 0;) {
1697                                 --i;
1698                                 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1699                         }
1700                         break;
1701                 case tpo_struct:
1702                         for (i = get_struct_n_members(tp); i > 0;) {
1703                                 --i;
1704                                 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1705                         }
1706                         break;
1707                 case tpo_method:
1708                         for (i = get_method_n_params(tp); i > 0;) {
1709                                 --i;
1710                                 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1711                         }
1712                         for (i = get_method_n_ress(tp); i > 0;) {
1713                                  --i;
1714                                 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1715                         }
1716                         break;
1717                 case tpo_union:
1718                         for (i = get_union_n_members(tp); i > 0;) {
1719                                  --i;
1720                                 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1721                         }
1722                         break;
1723                 case tpo_array:
1724                         print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1725                         print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1726                         for (i = get_array_n_dimensions(tp); i > 0;) {
1727                                 ir_node *upper, *lower;
1728
1729                                  --i;
1730                                 upper = get_array_upper_bound(tp, i);
1731                                 lower = get_array_lower_bound(tp, i);
1732                                 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1733                                 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1734                                 dump_const_expression(F, upper);
1735                                 dump_const_expression(F, lower);
1736                         }
1737                         break;
1738                 case tpo_enumeration:
1739                         for (i = get_enumeration_n_enums(tp); i > 0;) {
1740                                  --i;
1741                                 dump_enum_item(F, tp, i);
1742                                 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1743                         }
1744                         break;
1745                 case tpo_pointer:
1746                         print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1747                         break;
1748                 case tpo_primitive:
1749                         break;
1750                 default:
1751                         break;
1752                 }
1753                 break; /* case k_type */
1754         }
1755         default:
1756                 printf(" *** irdump,  dump_type_info(l.%i), faulty type.\n", __LINE__);
1757         }
1758 }
1759
1760 /** For dumping class hierarchies.
1761  * Dumps a class type node and a superclass edge.
1762  */
1763 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1764 {
1765         FILE *F = (FILE*)ctx;
1766         size_t i = 0;  /* to shutup gcc */
1767
1768         /* dump this type or entity */
1769         switch (get_kind(tore.ent)) {
1770         case k_entity: {
1771                 ir_entity *ent = tore.ent;
1772                 if (get_entity_owner(ent) == get_glob_type()) break;
1773                 if (!is_Method_type(get_entity_type(ent)))
1774                         break;  /* GL */
1775                 if (flags & ir_dump_flag_entities_in_hierarchy
1776                                 && is_Class_type(get_entity_owner(ent))) {
1777                         /* The node */
1778                         dump_entity_node(F, ent);
1779                         /* The edges */
1780                         print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1781                         for (i = get_entity_n_overwrites(ent); i > 0;) {
1782                                  --i;
1783                                 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1784                         }
1785                 }
1786                 break;
1787         }
1788         case k_type: {
1789                 ir_type *tp = tore.typ;
1790                 if (tp == get_glob_type())
1791                         break;
1792                 switch (get_type_tpop_code(tp)) {
1793                 case tpo_class:
1794                         dump_type_node(F, tp);
1795                         /* and now the edges */
1796                         for (i = get_class_n_supertypes(tp); i > 0;) {
1797                                  --i;
1798                                 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1799                         }
1800                         break;
1801                 default: break;
1802                 }
1803                 break; /* case k_type */
1804         }
1805         default:
1806                 printf(" *** irdump,  dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1807         }
1808 }
1809
1810 /*******************************************************************/
1811 /* dump analysis information that is expressed in graph terms.     */
1812 /*******************************************************************/
1813
1814 /* dump out edges */
1815 static void dump_out_edge(ir_node *n, void *env)
1816 {
1817         FILE *F = (FILE*)env;
1818         int i;
1819         for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
1820                 ir_node *succ = get_irn_out(n, i);
1821                 assert(succ);
1822                 print_node_edge_kind(F, succ);
1823                 fprintf(F, "{sourcename: \"");
1824                 PRINT_NODEID(n);
1825                 fprintf(F, "\" targetname: \"");
1826                 PRINT_NODEID(succ);
1827                 fprintf(F, "\" color: red linestyle: dashed");
1828                 fprintf(F, "}\n");
1829         }
1830 }
1831
1832 static void dump_loop_label(FILE *F, const ir_loop *loop)
1833 {
1834         fprintf(F, "loop %u", get_loop_depth(loop));
1835 }
1836
1837 static void dump_loop_info(FILE *F, const ir_loop *loop)
1838 {
1839         fprintf(F, " info1: \"");
1840         fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
1841 #ifdef DEBUG_libfirm
1842         fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
1843 #endif
1844         fprintf(F, "\"");
1845 }
1846
1847 static void dump_loop_node(FILE *F, const ir_loop *loop)
1848 {
1849         fprintf(F, "node: {title: \"");
1850         PRINT_LOOPID(loop);
1851         fprintf(F, "\" label: \"");
1852         dump_loop_label(F, loop);
1853         fprintf(F, "\" ");
1854         dump_loop_info(F, loop);
1855         fprintf(F, "}\n");
1856 }
1857
1858 static void dump_loop_node_edge(FILE *F, const ir_loop *loop, size_t i)
1859 {
1860         assert(loop);
1861         fprintf(F, "edge: {sourcename: \"");
1862         PRINT_LOOPID(loop);
1863         fprintf(F, "\" targetname: \"");
1864         PRINT_NODEID(get_loop_element(loop, i).node);
1865         fprintf(F, "\" color: green");
1866         fprintf(F, "}\n");
1867 }
1868
1869 static void dump_loop_son_edge(FILE *F, const ir_loop *loop, size_t i)
1870 {
1871         assert(loop);
1872         fprintf(F, "edge: {sourcename: \"");
1873         PRINT_LOOPID(loop);
1874         fprintf(F, "\" targetname: \"");
1875         PRINT_LOOPID(get_loop_element(loop, i).son);
1876         ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n", i);
1877 }
1878
1879 static void dump_loops(FILE *F, const ir_loop *loop)
1880 {
1881         size_t i;
1882         size_t n_elements = get_loop_n_elements(loop);
1883         /* dump this loop node */
1884         dump_loop_node(F, loop);
1885
1886         /* dump edges to nodes in loop -- only if it is a real loop */
1887         if (get_loop_depth(loop) != 0) {
1888                 for (i = n_elements; i > 0;) {
1889                         loop_element element;
1890                         --i;
1891                         element = get_loop_element(loop, i);
1892                         if (*element.kind != k_ir_node)
1893                                 continue;
1894                         dump_loop_node_edge(F, loop, i);
1895                 }
1896         }
1897         for (i = n_elements; i > 0;) {
1898                 loop_element element;
1899                 --i;
1900                 element = get_loop_element(loop, i);
1901                 if (*element.kind != k_ir_loop)
1902                         continue;
1903                 dump_loops(F, element.son);
1904                 dump_loop_son_edge(F, loop, i);
1905         }
1906 }
1907
1908 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
1909 {
1910         ir_loop *loop = get_irg_loop(irg);
1911
1912         if (loop != NULL) {
1913                 ir_graph *rem = current_ir_graph;
1914                 current_ir_graph = irg;
1915
1916                 dump_loops(F, loop);
1917
1918                 current_ir_graph = rem;
1919         }
1920 }
1921
1922 void dump_vcg_header_colors(FILE *F)
1923 {
1924         int i;
1925         init_colors();
1926         for (i = 0; i < ird_color_count; ++i) {
1927                 if (color_rgb[i] != NULL) {
1928                         fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
1929                 }
1930         }
1931 }
1932
1933 void dump_vcg_infonames(FILE *F)
1934 {
1935         fputs(
1936                 "infoname 1: \"Attribute\"\n"
1937                 "infoname 2: \"Verification errors\"\n"
1938                 "infoname 3: \"Debug info\"\n", F);
1939 }
1940
1941 /**
1942  * dumps the VCG header
1943  */
1944 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
1945 {
1946         const char *label
1947                 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
1948
1949         if (! layout)     layout = "Compilergraph";
1950         if (!orientation) orientation = "bottom_to_top";
1951
1952         /* print header */
1953         fprintf(F,
1954                 "graph: { title: \"ir graph of %s\"\n"
1955                 "display_edge_labels: %s\n"
1956                 "layoutalgorithm: mindepth //$ \"%s\"\n"
1957                 "manhattan_edges: yes\n"
1958                 "port_sharing: no\n"
1959                 "orientation: %s\n"
1960                 "classname 1:  \"intrablock Data\"\n"
1961                 "classname 2:  \"Block\"\n"
1962                 "classname 3:  \"Entity type\"\n"
1963                 "classname 4:  \"Entity owner\"\n"
1964                 "classname 5:  \"Method Param\"\n"
1965                 "classname 6:  \"Method Res\"\n"
1966                 "classname 7:  \"Super\"\n"
1967                 "classname 8:  \"Union\"\n"
1968                 "classname 9:  \"Points-to\"\n"
1969                 "classname 10: \"Array Element Type\"\n"
1970                 "classname 11: \"Overwrites\"\n"
1971                 "classname 12: \"Member\"\n"
1972                 "classname 13: \"Control Flow\"\n"
1973                 "classname 14: \"intrablock Memory\"\n"
1974                 "classname 15: \"Dominators\"\n"
1975                 "classname 16: \"interblock Data\"\n"
1976                 "classname 17: \"interblock Memory\"\n"
1977                 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
1978                 "classname 19: \"Postdominators\"\n"
1979                 "classname 20: \"Keep Alive\"\n"
1980                 "classname 21: \"Out Edges\"\n"
1981                 "classname 22: \"Macro Block Edges\"\n",
1982                 name, label, layout, orientation);
1983         dump_vcg_infonames(F);
1984         dump_vcg_header_colors(F);
1985         fprintf(F, "\n");
1986 }
1987
1988 /**
1989  * Dumps the vcg file footer
1990  */
1991 void dump_vcg_footer(FILE *F)
1992 {
1993         fprintf(F, "}\n");
1994 }
1995
1996
1997
1998 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
1999 {
2000         size_t i;
2001
2002         construct_block_lists(irg);
2003
2004         /*
2005          * If we are in the interprocedural view, we dump not
2006          * only the requested irg but also all irgs that can be reached
2007          * from irg.
2008          */
2009         for (i = get_irp_n_irgs(); i > 0;) {
2010                 ir_graph *other_irg = get_irp_irg(--i);
2011                 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2012                 if (arr == NULL)
2013                         continue;
2014
2015                 dump_graph_from_list(out, other_irg);
2016                 DEL_ARR_F(arr);
2017         }
2018 }
2019
2020 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2021  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2022 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2023 {
2024         size_t i, arr_len;
2025         ir_graph *rem = current_ir_graph;
2026         ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2027         current_ir_graph = irg;
2028
2029         for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2030                 ir_extblk *extbb = arr[i];
2031                 ir_node *leader = get_extbb_leader(extbb);
2032                 size_t j, n_blks;
2033
2034                 fprintf(F, "graph: { title: \"");
2035                 PRINT_EXTBBID(leader);
2036                 fprintf(F, "\"  label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2037                         get_irn_node_nr(leader));
2038
2039                 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2040                         ir_node *node = extbb->blks[j];
2041                         if (is_Block(node)) {
2042                         /* Dumps the block and all the nodes in the block, which are to
2043                                 be found in Block->link. */
2044                                 dump_whole_block(F, node);
2045                         } else {
2046                                 /* Nodes that are not in a Block. */
2047                                 dump_node(F, node);
2048                                 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2049                                         dump_const_block_local(F, node);
2050                                 }
2051                                 dump_ir_data_edges(F, node);
2052                         }
2053                 }
2054                 fprintf(F, "}\n");
2055         }
2056
2057         if ((flags & ir_dump_flag_loops)
2058                         && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2059                 dump_loop_nodes_into_graph(F, irg);
2060
2061         current_ir_graph = rem;
2062         free_extbb(irg);
2063 }
2064
2065 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2066 {
2067         size_t    i;
2068         ir_entity *ent = get_irg_entity(irg);
2069
2070         if (!is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
2071                 compute_extbb(irg);
2072
2073         construct_extblock_lists(irg);
2074
2075         fprintf(F, "graph: { title: \"");
2076         PRINT_IRGID(irg);
2077         fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2078                 get_ent_dump_name(ent));
2079
2080         dump_graph_info(F, irg);
2081         print_dbg_info(F, get_entity_dbg_info(ent));
2082
2083         for (i = get_irp_n_irgs(); i > 0;) {
2084                 ir_graph   *other_irg = get_irp_irg(--i);
2085                 list_tuple *lists     = (list_tuple*)ird_get_irg_link(other_irg);
2086
2087                 if (lists) {
2088                         /* dump the extended blocks first */
2089                         if (ARR_LEN(lists->extbb_list)) {
2090                                 ird_set_irg_link(other_irg, lists->extbb_list);
2091                                 dump_extblock_graph(F, other_irg);
2092                         }
2093
2094                         /* we may have blocks without extended blocks, bad for instance */
2095                         if (ARR_LEN(lists->blk_list)) {
2096                                 ird_set_irg_link(other_irg, lists->blk_list);
2097                                 dump_block_graph(F, other_irg);
2098                         }
2099
2100                         DEL_ARR_F(lists->extbb_list);
2101                         DEL_ARR_F(lists->blk_list);
2102                         xfree(lists);
2103                 }
2104         }
2105
2106         /* Close the vcg information for the irg */
2107         fprintf(F, "}\n\n");
2108
2109         free_extbb(irg);
2110 }
2111
2112 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2113 {
2114         dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2115
2116         /* dump nodes */
2117         if (flags & ir_dump_flag_blocks_as_subgraphs) {
2118                 if (flags & ir_dump_flag_group_extbb) {
2119                         dump_blocks_extbb_grouped(out, irg);
2120                 } else {
2121                         dump_blocks_as_subgraphs(out, irg);
2122                 }
2123         } else {
2124                 /* dump_node_with_edges must be called in post visiting predecessors */
2125                 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2126         }
2127
2128         /* dump type info */
2129         if (flags & ir_dump_flag_with_typegraph) {
2130                 ir_graph *rem = current_ir_graph;
2131                 current_ir_graph = irg;
2132
2133                 type_walk_irg(irg, dump_type_info, NULL, out);
2134                 inc_irg_visited(get_const_code_irg());
2135                 /* dump edges from graph to type info */
2136                 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2137
2138                 current_ir_graph = rem;
2139         }
2140
2141         /* dump iredges out edges */
2142         if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2143                 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2144         }
2145
2146         /* dump the out edges in a separate walk */
2147         if ((flags & ir_dump_flag_out_edges)
2148                         && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2149                 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2150         }
2151
2152         dump_vcg_footer(out);
2153 }
2154
2155 static void dump_block_to_cfg(ir_node *block, void *env)
2156 {
2157         FILE *F = (FILE*)env;
2158         int i;
2159
2160         if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2161                 dump_node(F, block);
2162         }
2163
2164         if (is_Block(block)) {
2165                 /* This is a block. Dump a node for the block. */
2166                 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2167                 fprintf(F, "\" label: \"");
2168                 if (block == get_irg_start_block(get_irn_irg(block)))
2169                         fprintf(F, "Start ");
2170                 if (block == get_irg_end_block(get_irn_irg(block)))
2171                         fprintf(F, "End ");
2172
2173                 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2174                 PRINT_NODEID(block);
2175                 fprintf(F, "\" ");
2176                 fprintf(F, "info1:\"");
2177
2178                 /* the generic version. */
2179                 dump_irnode_to_file(F, block);
2180
2181                 fprintf(F, "\"");  /* closing quote of info */
2182
2183                 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2184                         (block == get_irg_end_block(get_irn_irg(block)))     )
2185                         fprintf(F, " color:blue ");
2186
2187                 fprintf(F, "}\n");
2188
2189                 /* Dump the edges */
2190                 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2191                         ir_node *pred = get_Block_cfgpred(block, i);
2192                         if (!is_Bad(pred))
2193                                 pred = get_nodes_block(pred);
2194                         fprintf(F, "edge: { sourcename: \"");
2195                         PRINT_NODEID(block);
2196                         fprintf(F, "\" targetname: \"");
2197                         PRINT_NODEID(pred);
2198                         fprintf(F, "\"}\n");
2199                 }
2200
2201                 /* Dump dominator/postdominator edge */
2202                 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2203                         if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2204                                 ir_node *pred = get_Block_idom(block);
2205                                 fprintf(F, "edge: { sourcename: \"");
2206                                 PRINT_NODEID(block);
2207                                 fprintf(F, "\" targetname: \"");
2208                                 PRINT_NODEID(pred);
2209                                 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2210                         }
2211                         if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2212                                 ir_node *pred = get_Block_ipostdom(block);
2213                                 fprintf(F, "edge: { sourcename: \"");
2214                                 PRINT_NODEID(block);
2215                                 fprintf(F, "\" targetname: \"");
2216                                 PRINT_NODEID(pred);
2217                                 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2218                         }
2219                 }
2220         }
2221 }
2222
2223 void dump_cfg(FILE *F, ir_graph *irg)
2224 {
2225         dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2226
2227         /* walk over the blocks in the graph */
2228         irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2229
2230         dump_vcg_footer(F);
2231 }
2232
2233 void dump_callgraph(FILE *F)
2234 {
2235         size_t          i;
2236         ir_dump_flags_t old_flags = ir_get_dump_flags();
2237
2238         ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2239         dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2240
2241         for (i = get_irp_n_irgs(); i > 0;) {
2242                 ir_graph *irg = get_irp_irg(--i);
2243                 ir_entity *ent = get_irg_entity(irg);
2244                 size_t j, n_callees = get_irg_n_callees(irg);
2245
2246                 dump_entity_node(F, ent);
2247                 for (j = 0; j < n_callees; ++j) {
2248                         ir_entity  *c    = get_irg_entity(get_irg_callee(irg, j));
2249                         int         be   = is_irg_callee_backedge(irg, j);
2250                         const char *attr = be
2251                                 ? "label:\"recursion %zu\""
2252                                 : "label:\"calls %zu\"";
2253                         print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2254                                            get_irg_callee_loop_depth(irg, j));
2255                 }
2256         }
2257
2258         ir_set_dump_flags(old_flags);
2259         dump_vcg_footer(F);
2260 }
2261
2262 void dump_typegraph(FILE *out)
2263 {
2264         dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2265         type_walk(dump_type_info, NULL, out);
2266         dump_vcg_footer(out);
2267 }
2268
2269 void dump_class_hierarchy(FILE *out)
2270 {
2271         dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2272         type_walk(dump_class_hierarchy_node, NULL, out);
2273         dump_vcg_footer(out);
2274 }
2275
2276 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2277 {
2278         size_t i;
2279         bool   loop_node_started = false;
2280         size_t first      = 0;
2281         size_t son_number = 0;
2282         loop_element le;
2283         ir_loop *son = NULL;
2284
2285         /* Dump a new loop node. */
2286         dump_loop_node(F, loop);
2287
2288         /* Dump the loop elements. */
2289         for (i = 0; i < get_loop_n_elements(loop); i++) {
2290                 le = get_loop_element(loop, i);
2291                 son = le.son;
2292                 if (get_kind(son) == k_ir_loop) {
2293
2294                         /* We are a loop son -> Recurse */
2295
2296                         if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2297                                 fprintf(F, "\" }\n");
2298                                 fprintf(F, "edge: {sourcename: \"");
2299                                 PRINT_LOOPID(loop);
2300                                 fprintf(F, "\" targetname: \"");
2301                                 PRINT_LOOPID(loop);
2302                                 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2303                                                 (unsigned long) first,
2304                                                 (unsigned long) first,
2305                                         (unsigned long) i-1);
2306                                 loop_node_started = false;
2307                         }
2308                         dump_loop_son_edge(F, loop, son_number++);
2309                         dump_loops_standalone(F, son);
2310                 } else if (get_kind(son) == k_ir_node) {
2311                         /* We are a loop node -> Collect firm nodes */
2312
2313                         ir_node *n = le.node;
2314                         if (!loop_node_started) {
2315                                 /* Start a new node which contains all firm nodes of the current loop */
2316                                 fprintf(F, "node: { title: \"");
2317                                 PRINT_LOOPID(loop);
2318                                 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2319                                         (unsigned long)i);
2320                                 loop_node_started = true;
2321                                 first = i;
2322                         } else
2323                                 fprintf(F, "\n");
2324
2325                         dump_node_label(F, n);
2326                         /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2327                         if (has_backedges(n)) fprintf(F, "\t loop head!");
2328                 } else { /* for callgraph loop tree */
2329                         ir_graph *n;
2330                         assert(get_kind(son) == k_ir_graph);
2331
2332                         /* We are a loop node -> Collect firm graphs */
2333                         n = le.irg;
2334                         if (!loop_node_started) {
2335                                 /* Start a new node which contains all firm nodes of the current loop */
2336                                 fprintf(F, "node: { title: \"");
2337                                 PRINT_LOOPID(loop);
2338                                 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2339                                         (unsigned long)i);
2340                                 loop_node_started = true;
2341                                 first = i;
2342                         } else
2343                                 fprintf(F, "\n");
2344                         fprintf(F, " %s", get_irg_dump_name(n));
2345                         /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2346                 }
2347         }
2348
2349         if (loop_node_started) {
2350                 fprintf(F, "\" }\n");
2351                 fprintf(F, "edge: {sourcename: \"");
2352                 PRINT_LOOPID(loop);
2353                 fprintf(F, "\" targetname: \"");
2354                 PRINT_LOOPID(loop);
2355                 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2356                         (unsigned long) first,
2357                         (unsigned long) first,
2358                         (unsigned long) i-1);
2359                 loop_node_started = false;
2360         }
2361 }
2362
2363 void dump_loop_tree(FILE *out, ir_graph *irg)
2364 {
2365         ir_graph       *rem       = current_ir_graph;
2366         ir_dump_flags_t old_flags = ir_get_dump_flags();
2367
2368         current_ir_graph = irg;
2369         ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2370
2371         dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2372
2373         if (get_irg_loop(irg))
2374                 dump_loops_standalone(out, get_irg_loop(irg));
2375
2376         dump_vcg_footer(out);
2377
2378         ir_set_dump_flags(old_flags);
2379         current_ir_graph = rem;
2380 }
2381
2382 void dump_callgraph_loop_tree(FILE *out)
2383 {
2384         dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2385         dump_loops_standalone(out, irp->outermost_cg_loop);
2386         dump_vcg_footer(out);
2387 }
2388
2389 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2390 {
2391         size_t i;
2392         int    son_number = 0;
2393         int    node_number = 0;
2394
2395         if (flags & ir_dump_flag_loops)
2396                 dump_loop_node(F, loop);
2397
2398         for (i = 0; i < get_loop_n_elements(loop); i++) {
2399                 loop_element le = get_loop_element(loop, i);
2400                 if (*(le.kind) == k_ir_loop) {
2401                         if (flags & ir_dump_flag_loops)
2402                                 dump_loop_son_edge(F, loop, son_number++);
2403                         /* Recur */
2404                         collect_nodeloop(F, le.son, loopnodes);
2405                 } else {
2406                         if (flags & ir_dump_flag_loops)
2407                                 dump_loop_node_edge(F, loop, node_number++);
2408                         eset_insert(loopnodes, le.node);
2409                 }
2410         }
2411 }
2412
2413 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2414                                             eset *extnodes)
2415 {
2416         size_t i;
2417         int j, start;
2418
2419         for (i = 0; i < get_loop_n_elements(loop); i++) {
2420                 loop_element le = get_loop_element(loop, i);
2421                 if (*(le.kind) == k_ir_loop) {
2422                         /* Recur */
2423                         collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2424                 } else {
2425                         if (is_Block(le.node)) start = 0; else start = -1;
2426                         for (j = start; j < get_irn_arity(le.node); j++) {
2427                                 ir_node *pred = get_irn_n(le.node, j);
2428                                 if (!eset_contains(loopnodes, pred)) {
2429                                         eset_insert(extnodes, pred);
2430                                         if (!is_Block(pred)) {
2431                                                 pred = get_nodes_block(pred);
2432                                                 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2433                                         }
2434                                 }
2435                         }
2436                 }
2437         }
2438 }
2439
2440 void dump_loop(FILE *F, ir_loop *l)
2441 {
2442         eset *loopnodes = eset_create();
2443         eset *extnodes = eset_create();
2444         ir_node *n, *b;
2445         char name[50];
2446
2447         snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2448         dump_vcg_header(F, name, NULL, NULL);
2449
2450         /* collect all nodes to dump */
2451         collect_nodeloop(F, l, loopnodes);
2452         collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2453
2454         /* build block lists */
2455         eset_foreach(loopnodes, ir_node*, n) {
2456                 set_irn_link(n, NULL);
2457         }
2458         eset_foreach(extnodes, ir_node*, n) {
2459                 set_irn_link(n, NULL);
2460         }
2461         eset_foreach(loopnodes, ir_node*, n) {
2462                 if (!is_Block(n)) {
2463                         b = get_nodes_block(n);
2464                         set_irn_link(n, get_irn_link(b));
2465                         set_irn_link(b, n);
2466                 }
2467         }
2468         eset_foreach(extnodes, ir_node*, n) {
2469                 if (!is_Block(n)) {
2470                         b = get_nodes_block(n);
2471                         set_irn_link(n, get_irn_link(b));
2472                         set_irn_link(b, n);
2473                 }
2474         }
2475
2476         eset_foreach(loopnodes, ir_node*, b) {
2477                 if (is_Block(b)) {
2478                         fprintf(F, "graph: { title: \"");
2479                         PRINT_NODEID(b);
2480                         fprintf(F, "\"  label: \"");
2481                         dump_node_opcode(F, b);
2482                         fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2483                         fprintf(F, "\" status:clustered color:yellow\n");
2484
2485                         /* dump the blocks edges */
2486                         dump_ir_data_edges(F, b);
2487
2488                         /* dump the nodes that go into the block */
2489                         for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2490                                 if (eset_contains(extnodes, n))
2491                                         overrule_nodecolor = ird_color_block_inout;
2492                                 dump_node(F, n);
2493                                 overrule_nodecolor = ird_color_default_node;
2494                                 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2495                         }
2496
2497                         /* Close the vcg information for the block */
2498                         fprintf(F, "}\n");
2499                         dump_const_node_local(F, b);
2500                         fprintf(F, "\n");
2501                 }
2502         }
2503         eset_foreach(extnodes, ir_node*, b) {
2504                 if (is_Block(b)) {
2505                         fprintf(F, "graph: { title: \"");
2506                         PRINT_NODEID(b);
2507                         fprintf(F, "\"  label: \"");
2508                         dump_node_opcode(F, b);
2509                         fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2510                         fprintf(F, "\" status:clustered color:lightblue\n");
2511
2512                         /* dump the nodes that go into the block */
2513                         for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2514                                 if (!eset_contains(loopnodes, n))
2515                                         overrule_nodecolor = ird_color_block_inout;
2516                                 dump_node(F, n);
2517                                 overrule_nodecolor = ird_color_default_node;
2518                                 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2519                         }
2520
2521                         /* Close the vcg information for the block */
2522                         fprintf(F, "}\n");
2523                         dump_const_node_local(F, b);
2524                         fprintf(F, "\n");
2525                 }
2526         }
2527         eset_destroy(loopnodes);
2528         eset_destroy(extnodes);
2529
2530         dump_vcg_footer(F);
2531 }
2532
2533 static bool   obstack_init;
2534 static struct obstack obst;
2535 static char  *dump_path;
2536
2537 void ir_set_dump_path(const char *path)
2538 {
2539         xfree(dump_path);
2540         dump_path = xstrdup(path);
2541 }
2542
2543 static void add_string_escaped(const char *string)
2544 {
2545         const char *p;
2546         for (p = string; *p != '\0'; ++p) {
2547                 char c = *p;
2548                 if (c == '/') {
2549                         obstack_1grow(&obst, '@');
2550                         obstack_1grow(&obst, '1');
2551                 } else if (c == '@') {
2552                         obstack_1grow(&obst, '@');
2553                         obstack_1grow(&obst, '2');
2554                 } else {
2555                         obstack_1grow(&obst, c);
2556                 }
2557         }
2558 }
2559
2560 static void add_dump_path(void)
2561 {
2562         if (!obstack_init) {
2563                 obstack_init(&obst);
2564                 obstack_init = true;
2565         }
2566
2567         if (dump_path != NULL) {
2568                 size_t len = strlen(dump_path);
2569                 obstack_grow(&obst, dump_path, len);
2570                 if (len > 0 && dump_path[len-1] != '/')
2571                         obstack_1grow(&obst, '/');
2572         }
2573 }
2574
2575 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2576                        const char *suffix)
2577 {
2578         const char *dump_name = get_irg_dump_name(graph);
2579         char       *file_name;
2580         FILE       *out;
2581
2582         if (!ir_should_dump(dump_name))
2583                 return;
2584
2585         add_dump_path();
2586
2587         add_string_escaped(dump_name);
2588         obstack_printf(&obst, "-%02u", graph->dump_nr++);
2589
2590         if (suffix != NULL) {
2591                 if (suffix[0] != '.')
2592                         obstack_1grow(&obst, '-');
2593                 add_string_escaped(suffix);
2594         }
2595         obstack_1grow(&obst, '\0');
2596
2597         file_name = (char*)obstack_finish(&obst);
2598         /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2599         out       = fopen(file_name, "wb");
2600         obstack_free(&obst, file_name);
2601
2602         if (out == NULL) {
2603                 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2604                 return;
2605         }
2606
2607         func(out, graph);
2608         fclose(out);
2609 }
2610
2611 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2612 {
2613         char *file_name;
2614         FILE *out;
2615
2616         add_dump_path();
2617
2618         obstack_printf(&obst, "%02u", irp->dump_nr++);
2619         if (suffix != NULL) {
2620                 if (suffix[0] != '.')
2621                         obstack_1grow(&obst, '-');
2622                 add_string_escaped(suffix);
2623         }
2624         obstack_1grow(&obst, '\0');
2625
2626         file_name = (char*)obstack_finish(&obst);
2627         out       = fopen(file_name, "wb");
2628         obstack_free(&obst, file_name);
2629
2630         if (out == NULL) {
2631                 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2632                 return;
2633         }
2634         func(out);
2635         fclose(out);
2636 }
2637
2638 void dump_ir_graph(ir_graph *graph, const char *suffix)
2639 {
2640         char buf[256];
2641
2642         snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2643         dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2644 }
2645
2646 void dump_all_ir_graphs(const char *suffix)
2647 {
2648         size_t i, n_irgs = get_irp_n_irgs();
2649
2650         for (i = 0; i < n_irgs; ++i) {
2651                 ir_graph *irg = get_irp_irg(i);
2652                 dump_ir_graph(irg, suffix);
2653         }
2654 }
2655
2656 typedef struct pass_t {
2657         ir_prog_pass_t pass;
2658         char           suffix[1];
2659 } pass_t;
2660
2661 /**
2662  * Wrapper around dump_all_ir_graphs().
2663  */
2664 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2665 {
2666         pass_t *pass = (pass_t*)context;
2667
2668         (void)irp;
2669         dump_all_ir_graphs(pass->suffix);
2670         return 0;
2671 }
2672
2673 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2674 {
2675         size_t  len  = strlen(suffix) + 1;
2676         pass_t *pass = XMALLOCF(pass_t, suffix, len);
2677         ir_prog_pass_t *res  = def_prog_pass_constructor(
2678                 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2679
2680         /* this pass does not change anything, so neither dump nor verify is needed. */
2681         res->dump_irprog   = ir_prog_no_dump;
2682         res->verify_irprog = ir_prog_no_verify;
2683
2684         memcpy(pass->suffix, suffix, len);
2685
2686         return res;
2687 }