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 int 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, 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, 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, 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, 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, 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 static void dump_node_ana_vals(FILE *F, ir_node *n)
 866 {
 867         (void) F;
 868         (void) n;
 869         return;
 870 }
 871
 872 void dump_node_label(FILE *F, ir_node *n)
 873 {
 874         dump_node_opcode(F, n);
 875         fputs(" ", F);
 876         dump_node_mode(F, n);
 877         fprintf(F, " ");
 878         dump_node_typeinfo(F, n);
 879         dump_node_nodeattr(F, n);
 880         if (flags & ir_dump_flag_number_label) {
 881                 fprintf(F, "%ld", get_irn_node_nr(n));
 882         }
 883         if (flags & ir_dump_flag_idx_label) {
 884                 fprintf(F, ":%u", get_irn_idx(n));
 885         }
 886 }
 887
 888 /**
 889  * Dumps the attributes of a node n into the file F.
 890  * Currently this is only the color of a node.
 891  */
 892 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
 893 {
 894         ir_mode *mode;
 895         ir_node *n;
 896
 897         if (bad) {
 898                 print_vcg_color(F, ird_color_error);
 899                 return;
 900         }
 901
 902         if (dump_node_vcgattr_hook != NULL) {
 903                 dump_node_vcgattr_hook(F, node, local);
 904                 return;
 905         }
 906
 907         n = local ? local : node;
 908
 909         if (overrule_nodecolor != ird_color_default_node) {
 910                 print_vcg_color(F, overrule_nodecolor);
 911                 return;
 912         }
 913
 914         mode = get_irn_mode(n);
 915         if (mode == mode_M) {
 916                 print_vcg_color(F, ird_color_memory);
 917                 return;
 918         }
 919         if (mode == mode_X) {
 920                 print_vcg_color(F, ird_color_controlflow);
 921                 return;
 922         }
 923
 924         switch (get_irn_opcode(n)) {
 925         case iro_Start:
 926         case iro_End:
 927                 print_vcg_color(F, ird_color_anchor);
 928                 break;
 929         case iro_Bad:
 930                 print_vcg_color(F, ird_color_error);
 931                 break;
 932         case iro_Block:
 933                 print_vcg_color(F, ird_color_block_background);
 934                 break;
 935         case iro_Phi:
 936                 print_vcg_color(F, ird_color_phi);
 937                 break;
 938         case iro_Pin:
 939                 print_vcg_color(F, ird_color_memory);
 940                 break;
 941         case iro_SymConst:
 942         case iro_Const:
 943                 print_vcg_color(F, ird_color_const);
 944                 break;
 945         case iro_Proj:
 946                 print_vcg_color(F, ird_color_proj);
 947                 break;
 948         default: {
 949                 ir_op *op = get_irn_op(node);
 950
 951                 if (is_op_constlike(op)) {
 952                         print_vcg_color(F, ird_color_const);
 953                 } else if (is_op_uses_memory(op)) {
 954                         print_vcg_color(F, ird_color_uses_memory);
 955                 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
 956                         print_vcg_color(F, ird_color_controlflow);
 957                 }
 958         }
 959         }
 960 }
 961
 962 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
 963 {
 964         hook_entry_t *info = XMALLOCZ(hook_entry_t);
 965
 966         info->hook._hook_node_info = cb;
 967         info->context              = data;
 968         register_hook(hook_node_info, info);
 969
 970         return info;
 971 }
 972
 973 void dump_remove_node_info_callback(void *handle)
 974 {
 975         hook_entry_t *info = (hook_entry_t*)handle;
 976         unregister_hook(hook_node_info, info);
 977         xfree(info);
 978 }
 979
 980 /**
 981  * Dump the node information of a node n to a file F.
 982  */
 983 static void dump_node_info(FILE *F, ir_node *n)
 984 {
 985         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 986
 987         fprintf(F, " info1: \"");
 988         dump_irnode_to_file(F, n);
 989         /* call the dump_node operation if available */
 990         if (ops->dump_node)
 991                 ops->dump_node(F, n, dump_node_info_txt);
 992
 993         /* allow additional info to be added */
 994         hook_node_info(F, n);
 995         fprintf(F, "\"\n");
 996 }
 997
 998 static int is_constlike_node(const ir_node *node)
 999 {
1000         const ir_op *op = get_irn_op(node);
1001         return is_op_constlike(op);
1002 }
1003
1004
1005 /** outputs the predecessors of n, that are constants, local.  I.e.,
1006    generates a copy of the constant predecessors for each node called with. */
1007 static void dump_const_node_local(FILE *F, ir_node *n)
1008 {
1009         int i;
1010         if (!get_opt_dump_const_local()) return;
1011
1012         /* Use visited flag to avoid outputting nodes twice.
1013         initialize it first. */
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)) {
1017                         set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1018                 }
1019         }
1020
1021         for (i = 0; i < get_irn_arity(n); i++) {
1022                 ir_node *con = get_irn_n(n, i);
1023                 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1024                         /* Generate a new name for the node by appending the names of
1025                         n and const. */
1026                         fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1027                         fprintf(F, " label: \"");
1028                         dump_node_label(F, con);
1029                         fprintf(F, "\" ");
1030                         dump_node_info(F, con);
1031                         dump_node_vcgattr(F, n, con, 0);
1032                         fprintf(F, "}\n");
1033                 }
1034         }
1035 }
1036
1037 /** If the block of an edge is a const_like node, dump it local with an edge */
1038 static void dump_const_block_local(FILE *F, ir_node *n)
1039 {
1040         ir_node *blk;
1041
1042         if (!get_opt_dump_const_local()) return;
1043
1044         blk = get_nodes_block(n);
1045         if (is_constlike_node(blk)) {
1046                 /* Generate a new name for the node by appending the names of
1047                 n and blk. */
1048                 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1049                 fprintf(F, "\" label: \"");
1050                 dump_node_label(F, blk);
1051                 fprintf(F, "\" ");
1052                 dump_node_info(F, blk);
1053                 dump_node_vcgattr(F, n, blk, 0);
1054                 fprintf(F, "}\n");
1055
1056                 fprintf(F, "edge: { sourcename: \"");
1057                 PRINT_NODEID(n);
1058                 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1059
1060                 if (dump_edge_vcgattr_hook) {
1061                         fprintf(F, "\" ");
1062                         if (dump_edge_vcgattr_hook(F, n, -1)) {
1063                                 fprintf(F, "}\n");
1064                                 return;
1065                         } else {
1066                                 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1067                                 return;
1068                         }
1069                 }
1070
1071                 fprintf(F, "\" "   BLOCK_EDGE_ATTR "}\n");
1072         }
1073 }
1074
1075 /**
1076  * prints the error message of a node to a file F as info2.
1077  */
1078 static void print_node_error(FILE *F, const char *err_msg)
1079 {
1080         if (! err_msg)
1081                 return;
1082
1083         fprintf(F, " info2: \"%s\"", err_msg);
1084 }
1085
1086 /**
1087  * prints debug messages of a node to file F as info3.
1088  */
1089 static void print_dbg_info(FILE *F, dbg_info *dbg)
1090 {
1091         char buf[1024];
1092
1093         ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1094         if (buf[0] != 0) {
1095                 fprintf(F, " info3: \"%s\"\n", buf);
1096         }
1097 }
1098
1099 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1100 {
1101         (void) F;
1102         (void) dbg;
1103         /* TODO */
1104 }
1105
1106 /**
1107  * Dump a node
1108  */
1109 static void dump_node(FILE *F, ir_node *n)
1110 {
1111         int bad = 0;
1112         const char *p;
1113
1114         if (get_opt_dump_const_local() && is_constlike_node(n))
1115                 return;
1116
1117         /* dump this node */
1118         fputs("node: {title: \"", F);
1119         PRINT_NODEID(n);
1120         fputs("\"", F);
1121
1122         fputs(" label: \"", F);
1123         bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1124         dump_node_label(F, n);
1125         dump_node_ana_vals(F, n);
1126         //dump_node_ana_info(F, n);
1127         fputs("\" ", F);
1128
1129         if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1130                 //fputs(" node_class:23", F);
1131         }
1132
1133         dump_node_info(F, n);
1134         print_node_error(F, p);
1135         print_dbg_info(F, get_irn_dbg_info(n));
1136         dump_node_vcgattr(F, n, NULL, bad);
1137         fputs("}\n", F);
1138         dump_const_node_local(F, n);
1139
1140         if (dump_node_edge_hook)
1141                 dump_node_edge_hook(F, n);
1142 }
1143
1144 /** dump the edge to the block this node belongs to */
1145 static void dump_ir_block_edge(FILE *F, ir_node *n)
1146 {
1147         if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1148         if (!is_Block(n)) {
1149                 ir_node *block = get_nodes_block(n);
1150
1151                 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1152                         dump_const_block_local(F, n);
1153                 } else {
1154                         fprintf(F, "edge: { sourcename: \"");
1155                         PRINT_NODEID(n);
1156                         fprintf(F, "\" targetname: ");
1157                         fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1158
1159                         if (dump_edge_vcgattr_hook) {
1160                                 fprintf(F, " ");
1161                                 if (dump_edge_vcgattr_hook(F, n, -1)) {
1162                                         fprintf(F, "}\n");
1163                                         return;
1164                                 } else {
1165                                         fprintf(F, " "  BLOCK_EDGE_ATTR "}\n");
1166                                         return;
1167                                 }
1168                         }
1169
1170                         fprintf(F, " "   BLOCK_EDGE_ATTR "}\n");
1171                 }
1172         }
1173 }
1174
1175 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1176 {
1177         /*
1178          * do not use get_nodes_block() here, will fail
1179          * if the irg is not pinned.
1180          */
1181         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1182                 fprintf(F, INTRA_DATA_EDGE_ATTR);
1183         else
1184                 fprintf(F, INTER_DATA_EDGE_ATTR);
1185 }
1186
1187 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1188 {
1189         /*
1190          * do not use get_nodes_block() here, will fail
1191          * if the irg is not pinned.
1192          */
1193         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1194                 fprintf(F, INTRA_MEM_EDGE_ATTR);
1195         else
1196                 fprintf(F, INTER_MEM_EDGE_ATTR);
1197 }
1198
1199 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1200 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1201 {
1202         assert(from);
1203
1204         if (dump_edge_vcgattr_hook)
1205                 if (dump_edge_vcgattr_hook(F, from, to))
1206                         return;
1207
1208         if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1209                 fprintf(F, BACK_EDGE_ATTR);
1210
1211         switch (get_irn_opcode(from)) {
1212         case iro_Block:
1213                 fprintf(F, CF_EDGE_ATTR);
1214                 break;
1215         case iro_Start:  break;
1216         case iro_End:
1217                 if (to >= 0) {
1218                         if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1219                                 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1220                         else
1221                                 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1222                 }
1223                 break;
1224         default:
1225                 if (is_Proj(from)) {
1226                         if (get_irn_mode(from) == mode_M)
1227                                 print_mem_edge_vcgattr(F, from, to);
1228                         else if (get_irn_mode(from) == mode_X)
1229                                 fprintf(F, CF_EDGE_ATTR);
1230                         else
1231                                 print_data_edge_vcgattr(F, from, to);
1232                 }
1233                 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1234                         print_mem_edge_vcgattr(F, from, to);
1235                 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1236                         fprintf(F, CF_EDGE_ATTR);
1237                 else
1238                         print_data_edge_vcgattr(F, from, to);
1239         }
1240 }
1241
1242 /** dump edges to our inputs */
1243 static void dump_ir_data_edges(FILE *F, ir_node *n)
1244 {
1245         int i, num;
1246
1247         if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1248                 /* the End node has only keep-alive edges */
1249                 return;
1250         }
1251
1252         /* dump the dependency edges. */
1253         num = get_irn_deps(n);
1254         for (i = 0; i < num; ++i) {
1255                 ir_node *dep = get_irn_dep(n, i);
1256
1257                 if (dep) {
1258                         print_node_edge_kind(F, n);
1259                         fprintf(F, "{sourcename: \"");
1260                         PRINT_NODEID(n);
1261                         fprintf(F, "\" targetname: ");
1262                         if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1263                                 PRINT_CONSTID(n, dep);
1264                         } else {
1265                                 fprintf(F, "\"");
1266                                 PRINT_NODEID(dep);
1267                                 fprintf(F, "\"");
1268                         }
1269                         fprintf(F, " label: \"%d\" ", i);
1270                         fprintf(F, " color: darkgreen}\n");
1271                 }
1272         }
1273
1274         num = get_irn_arity(n);
1275         for (i = 0; i < num; i++) {
1276                 ir_node *pred = get_irn_n(n, i);
1277                 assert(pred);
1278
1279                 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1280                         fprintf(F, "backedge: {sourcename: \"");
1281                 } else {
1282                         print_node_edge_kind(F, n);
1283                         fprintf(F, "{sourcename: \"");
1284                 }
1285                 PRINT_NODEID(n);
1286                 fprintf(F, "\" targetname: ");
1287                 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1288                         PRINT_CONSTID(n, pred);
1289                 } else {
1290                         fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1291                 }
1292                 fprintf(F, " label: \"%d\" ", i);
1293                 print_edge_vcgattr(F, n, i);
1294                 fprintf(F, "}\n");
1295         }
1296 }
1297
1298 /**
1299  * Dump the ir_edges
1300  */
1301 static void dump_ir_edges(ir_node *node, void *env)
1302 {
1303         int              i = 0;
1304         FILE            *F = (FILE*)env;
1305         const ir_edge_t *edge;
1306
1307         foreach_out_edge(node, edge) {
1308                 ir_node *succ = get_edge_src_irn(edge);
1309
1310                 print_node_edge_kind(F, succ);
1311                 fprintf(F, "{sourcename: \"");
1312                 PRINT_NODEID(node);
1313                 fprintf(F, "\" targetname: \"");
1314                 PRINT_NODEID(succ);
1315                 fprintf(F, "\"");
1316
1317                 fprintf(F, " label: \"%d\" ", i);
1318                 fprintf(F, OUT_EDGE_ATTR);
1319                 fprintf(F, "}\n");
1320                 ++i;
1321         }
1322 }
1323
1324
1325 /** Dumps a node and its edges but not the block edge  */
1326 static void dump_node_wo_blockedge(ir_node *n, void *env)
1327 {
1328         FILE *F = (FILE*)env;
1329         dump_node(F, n);
1330         dump_ir_data_edges(F, n);
1331 }
1332
1333 /** Dumps a node and its edges. */
1334 static void dump_node_with_edges(ir_node *n, void *env)
1335 {
1336         FILE *F = (FILE*)env;
1337         dump_node_wo_blockedge(n, env);
1338         if (!node_floats(n))
1339                 dump_ir_block_edge(F, n);
1340 }
1341
1342 /** Dumps a const-like node. */
1343 static void dump_const_node(ir_node *n, void *env)
1344 {
1345         if (is_Block(n)) return;
1346         dump_node_wo_blockedge(n, env);
1347 }
1348
1349 /***********************************************************************/
1350 /* the following routines dump the nodes/irgs bracketed to graphs.     */
1351 /***********************************************************************/
1352
1353 /** Dumps a constant expression as entity initializer, array bound ... */
1354 static void dump_const_expression(FILE *F, ir_node *value)
1355 {
1356         ir_graph *rem = current_ir_graph;
1357         ir_dump_flags_t old_flags = ir_get_dump_flags();
1358         ir_remove_dump_flags(ir_dump_flag_consts_local);
1359
1360         current_ir_graph = get_const_code_irg();
1361         irg_walk(value, dump_const_node, NULL, F);
1362         /* Decrease visited flag so that we walk with the same flag for the next
1363            expression.  This guarantees that we don't dump the same node twice,
1364            as for const expressions cse is performed to save memory. */
1365         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1366
1367         ir_set_dump_flags(old_flags);
1368         current_ir_graph = rem;
1369 }
1370
1371 /** Dump a block as graph containing its nodes.
1372  *
1373  *  Expects to find nodes belonging to the block as list in its
1374  *  link field.
1375  *  Dumps the edges of all nodes including itself. */
1376 static void dump_whole_block(FILE *F, ir_node *block)
1377 {
1378         ir_node *node;
1379         ird_color_t color = ird_color_block_background;
1380
1381         assert(is_Block(block));
1382
1383         fprintf(F, "graph: { title: \"");
1384         PRINT_NODEID(block);
1385         fprintf(F, "\"  label: \"");
1386         dump_node_label(F, block);
1387
1388         /* colorize blocks */
1389         if (! get_Block_matured(block))
1390                 color = ird_color_block_background;
1391
1392         fprintf(F, "\" status:clustered ");
1393         print_vcg_color(F, color);
1394         fprintf(F, "\n");
1395
1396         /* yComp can show attributes for blocks, XVCG parses but ignores them */
1397         dump_node_info(F, block);
1398         print_dbg_info(F, get_irn_dbg_info(block));
1399
1400         /* dump the blocks edges */
1401         dump_ir_data_edges(F, block);
1402
1403         if (dump_block_edge_hook)
1404                 dump_block_edge_hook(F, block);
1405
1406         /* dump the nodes that go into the block */
1407         for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1408                 dump_node(F, node);
1409                 dump_ir_data_edges(F, node);
1410         }
1411
1412         /* Close the vcg information for the block */
1413         fprintf(F, "}\n");
1414         dump_const_node_local(F, block);
1415         fprintf(F, "\n");
1416 }
1417
1418 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1419  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1420 static void dump_block_graph(FILE *F, ir_graph *irg)
1421 {
1422         size_t i, n;
1423         ir_graph *rem = current_ir_graph;
1424         ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1425         current_ir_graph = irg;
1426
1427         for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1428                 ir_node *node = arr[i];
1429                 if (is_Block(node)) {
1430                 /* Dumps the block and all the nodes in the block, which are to
1431                         be found in Block->link. */
1432                         dump_whole_block(F, node);
1433                 } else {
1434                         /* Nodes that are not in a Block. */
1435                         dump_node(F, node);
1436                         if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1437                                 dump_const_block_local(F, node);
1438                         }
1439                         dump_ir_data_edges(F, node);
1440                 }
1441                 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1442                         dump_ir_edges(node, F);
1443         }
1444
1445         if ((flags & ir_dump_flag_loops)
1446              && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1447                 dump_loop_nodes_into_graph(F, irg);
1448
1449         current_ir_graph = rem;
1450 }
1451
1452 /**
1453  * Dump the info for an irg.
1454  * Parsed by XVCG but not shown. use yComp.
1455  */
1456 static void dump_graph_info(FILE *F, ir_graph *irg)
1457 {
1458         fprintf(F, "info1: \"");
1459         dump_entity_to_file(F, get_irg_entity(irg));
1460         fprintf(F, "\n");
1461
1462         /* dump graph state */
1463         fprintf(F, "state:");
1464         if (is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP))
1465                 fprintf(F, " arch_dep");
1466         if (is_irg_state(irg, IR_GRAPH_STATE_MODEB_LOWERED))
1467                 fprintf(F, " modeb_lowered");
1468         if (is_irg_state(irg, IR_GRAPH_STATE_NORMALISATION2))
1469                 fprintf(F, " normalisation2");
1470         if (is_irg_state(irg, IR_GRAPH_STATE_IMPLICIT_BITFIELD_MASKING))
1471                 fprintf(F, " implicit_bitfield_masking");
1472         if (is_irg_state(irg, IR_GRAPH_STATE_OPTIMIZE_UNREACHABLE_CODE))
1473                 fprintf(F, " optimize_unreachable_code");
1474         if (is_irg_state(irg, IR_GRAPH_STATE_NO_CRITICAL_EDGES))
1475                 fprintf(F, " no_critical_edges");
1476         if (is_irg_state(irg, IR_GRAPH_STATE_NO_BADS))
1477                 fprintf(F, " no_bads");
1478         if (is_irg_state(irg, IR_GRAPH_STATE_NO_UNREACHABLE_CODE))
1479                 fprintf(F, " no_unreachable_code");
1480         if (is_irg_state(irg, IR_GRAPH_STATE_ONE_RETURN))
1481                 fprintf(F, " one_return");
1482         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE))
1483                 fprintf(F, " consistent_dominance");
1484         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE))
1485                 fprintf(F, " consistent_postdominance");
1486         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUT_EDGES))
1487                 fprintf(F, " consistent_out_edges");
1488         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))
1489                 fprintf(F, " consistent_outs");
1490         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1491                 fprintf(F, " consistent_loopinfo");
1492         if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
1493                 fprintf(F, " consistent_entity_usage");
1494         if (is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
1495                 fprintf(F, " valid_exended_blocks");
1496         fprintf(F, "\"\n");
1497 }
1498
1499 /** Dumps an irg as a graph clustered by block nodes.
1500  *  If interprocedural view edges can point to nodes out of this graph.
1501  */
1502 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1503 {
1504         ir_entity *ent = get_irg_entity(irg);
1505
1506         fprintf(F, "graph: { title: \"");
1507         PRINT_IRGID(irg);
1508         fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1509           get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1510
1511         dump_graph_info(F, irg);
1512         print_dbg_info(F, get_entity_dbg_info(ent));
1513
1514         dump_block_graph(F, irg);
1515
1516         /* Close the vcg information for the irg */
1517         fprintf(F, "}\n\n");
1518 }
1519
1520 /*******************************************************************/
1521 /* Basic type and entity nodes and edges.                          */
1522 /*******************************************************************/
1523
1524 /** dumps the edges between nodes and their type or entity attributes. */
1525 static void dump_node2type_edges(ir_node *n, void *env)
1526 {
1527         FILE *F = (FILE*)env;
1528         assert(n);
1529
1530         switch (get_irn_opcode(n)) {
1531         case iro_Const :
1532                 /* @@@ some consts have an entity */
1533                 break;
1534         case iro_SymConst:
1535                 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1536                         print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1537                 break;
1538         case iro_Sel:
1539                 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1540                 break;
1541         case iro_Call:
1542                 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1543                 break;
1544         case iro_Alloc:
1545                 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1546                 break;
1547         case iro_Free:
1548                 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1549                 break;
1550         case iro_Cast:
1551                 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1552                 break;
1553         default:
1554                 break;
1555         }
1556 }
1557
1558 #if 0
1559 static int print_type_info(FILE *F, ir_type *tp)
1560 {
1561         int bad = 0;
1562
1563         if (get_type_state(tp) == layout_undefined) {
1564                 fprintf(F, "state: layout_undefined\n");
1565         } else {
1566                 fprintf(F, "state: layout_fixed,\n");
1567         }
1568         if (get_type_mode(tp))
1569                 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1570         fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1571
1572         return bad;
1573 }
1574
1575 static void print_typespecific_info(FILE *F, ir_type *tp)
1576 {
1577         switch (get_type_tpop_code(tp)) {
1578         case tpo_class:
1579                 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1580                 break;
1581         case tpo_struct:
1582                 break;
1583         case tpo_method:
1584                 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1585                 fprintf(F, "params: %d\n", get_method_n_params(tp));
1586                 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1587                 break;
1588         case tpo_union:
1589                 break;
1590         case tpo_array:
1591                 break;
1592         case tpo_enumeration:
1593                 break;
1594         case tpo_pointer:
1595                 break;
1596         case tpo_primitive:
1597                 break;
1598         default:
1599                 break;
1600         }
1601 }
1602 #endif
1603
1604 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1605 {
1606         switch (get_type_tpop_code(tp)) {
1607         case tpo_class:
1608                 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1609                 break;
1610         case tpo_struct:
1611                 fprintf(F, " " TYPE_METH_NODE_ATTR);
1612                 break;
1613         case tpo_method:
1614                 break;
1615         case tpo_union:
1616                 break;
1617         case tpo_array:
1618                 break;
1619         case tpo_enumeration:
1620                 break;
1621         case tpo_pointer:
1622                 break;
1623         case tpo_primitive:
1624                 break;
1625         default:
1626                 break;
1627         }
1628 }
1629
1630 void dump_type_node(FILE *F, ir_type *tp)
1631 {
1632         fprintf(F, "node: {title: ");
1633         PRINT_TYPEID(tp);
1634         fprintf(F, " label: \"");
1635         if (tp->dbi != NULL) {
1636                 char buf[1024];
1637                 ir_print_type(buf, sizeof(buf), tp);
1638                 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1639         } else {
1640                 ir_fprintf(F, "%+F", tp);
1641         }
1642         fputs("\" info1: \"", F);
1643         dump_type_to_file(F, tp);
1644         fprintf(F, "\"\n");
1645         print_type_dbg_info(F, get_type_dbg_info(tp));
1646         print_typespecific_vcgattr(F, tp);
1647         fprintf(F, "}\n");
1648 }
1649
1650 static void dump_entity_node(FILE *F, ir_entity *ent)
1651 {
1652         fprintf(F, "node: {title: \"");
1653         PRINT_ENTID(ent); fprintf(F, "\"");
1654         fprintf(F, " label: ");
1655         fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1656
1657         print_vcg_color(F, ird_color_entity);
1658         fprintf(F, "\n info1: \"");
1659
1660         dump_entity_to_file(F, ent);
1661
1662         fprintf(F, "\"\n");
1663         print_dbg_info(F, get_entity_dbg_info(ent));
1664         fprintf(F, "}\n");
1665 }
1666
1667 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1668 {
1669         char buf[1024];
1670         ir_enum_const *ec = get_enumeration_const(tp, pos);
1671         ident         *id = get_enumeration_const_nameid(ec);
1672         ir_tarval     *tv = get_enumeration_value(ec);
1673
1674         if (tv)
1675                 tarval_snprintf(buf, sizeof(buf), tv);
1676         else
1677                 strncpy(buf, "<not set>", sizeof(buf));
1678         fprintf(F, "node: {title: \"");
1679         PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1680         fprintf(F, " label: ");
1681         fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1682         fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1683 }
1684
1685 /**
1686  * Dumps a new style initializer.
1687  */
1688 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1689 {
1690         /* TODO */
1691         (void) F;
1692         (void) ent;
1693 }
1694
1695 /**
1696  * type-walker: Dumps a type or entity and its edges.
1697  */
1698 static void dump_type_info(type_or_ent tore, void *env)
1699 {
1700         FILE *F = (FILE*)env;
1701         size_t i = 0;  /* to shutup gcc */
1702
1703         /* dump this type or entity */
1704
1705         switch (get_kind(tore.ent)) {
1706         case k_entity: {
1707                 ir_entity *ent = tore.ent;
1708                 ir_node *value;
1709                 /* The node */
1710                 dump_entity_node(F, ent);
1711                 /* The Edges */
1712                 /* skip this to reduce graph.  Member edge of type is parallel to this edge. *
1713                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1714                 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1715                 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1716                 if (is_Class_type(get_entity_owner(ent))) {
1717                         for (i = get_entity_n_overwrites(ent); i > 0;)
1718                                 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1719                 }
1720                 /* attached subgraphs */
1721                 if (! (flags & ir_dump_flag_no_entity_values)) {
1722                         if (ent->initializer != NULL) {
1723                                 /* new style initializers */
1724                                 dump_entity_initializer(F, ent);
1725                         } else if (entity_has_compound_ent_values(ent)) {
1726                                 /* old style compound entity values */
1727                                 for (i = get_compound_ent_n_values(ent); i > 0;) {
1728                                         value = get_compound_ent_value(ent, --i);
1729                                         if (value) {
1730                                                 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1731                                                 dump_const_expression(F, value);
1732                                                 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1733                                                 /*
1734                                                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1735                                                 ENT_CORR_EDGE_ATTR  "}\n", GET_ENTID(ent),
1736                                                 get_compound_ent_value_member(ent, i), i);
1737                                                 */
1738                                         }
1739                                 }
1740                         }
1741                 }
1742                 break;
1743         }
1744         case k_type: {
1745                 ir_type *tp = tore.typ;
1746                 dump_type_node(F, tp);
1747                 /* and now the edges */
1748                 switch (get_type_tpop_code(tp)) {
1749                 case tpo_class:
1750                         for (i = get_class_n_supertypes(tp); i > 0;) {
1751                                 --i;
1752                                 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1753                         }
1754                         for (i = get_class_n_members(tp); i > 0;) {
1755                                 --i;
1756                                 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1757                         }
1758                         break;
1759                 case tpo_struct:
1760                         for (i = get_struct_n_members(tp); i > 0;) {
1761                                 --i;
1762                                 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1763                         }
1764                         break;
1765                 case tpo_method:
1766                         for (i = get_method_n_params(tp); i > 0;) {
1767                                 --i;
1768                                 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1769                         }
1770                         for (i = get_method_n_ress(tp); i > 0;) {
1771                                  --i;
1772                                 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1773                         }
1774                         break;
1775                 case tpo_union:
1776                         for (i = get_union_n_members(tp); i > 0;) {
1777                                  --i;
1778                                 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1779                         }
1780                         break;
1781                 case tpo_array:
1782                         print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1783                         print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1784                         for (i = get_array_n_dimensions(tp); i > 0;) {
1785                                 ir_node *upper, *lower;
1786
1787                                  --i;
1788                                 upper = get_array_upper_bound(tp, i);
1789                                 lower = get_array_lower_bound(tp, i);
1790                                 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1791                                 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1792                                 dump_const_expression(F, upper);
1793                                 dump_const_expression(F, lower);
1794                         }
1795                         break;
1796                 case tpo_enumeration:
1797                         for (i = get_enumeration_n_enums(tp); i > 0;) {
1798                                  --i;
1799                                 dump_enum_item(F, tp, i);
1800                                 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1801                         }
1802                         break;
1803                 case tpo_pointer:
1804                         print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1805                         break;
1806                 case tpo_primitive:
1807                         break;
1808                 default:
1809                         break;
1810                 }
1811                 break; /* case k_type */
1812         }
1813         default:
1814                 printf(" *** irdump,  dump_type_info(l.%i), faulty type.\n", __LINE__);
1815         }
1816 }
1817
1818 /** For dumping class hierarchies.
1819  * Dumps a class type node and a superclass edge.
1820  */
1821 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1822 {
1823         FILE *F = (FILE*)ctx;
1824         size_t i = 0;  /* to shutup gcc */
1825
1826         /* dump this type or entity */
1827         switch (get_kind(tore.ent)) {
1828         case k_entity: {
1829                 ir_entity *ent = tore.ent;
1830                 if (get_entity_owner(ent) == get_glob_type()) break;
1831                 if (!is_Method_type(get_entity_type(ent)))
1832                         break;  /* GL */
1833                 if (flags & ir_dump_flag_entities_in_hierarchy
1834                                 && is_Class_type(get_entity_owner(ent))) {
1835                         /* The node */
1836                         dump_entity_node(F, ent);
1837                         /* The edges */
1838                         print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1839                         for (i = get_entity_n_overwrites(ent); i > 0;) {
1840                                  --i;
1841                                 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1842                         }
1843                 }
1844                 break;
1845         }
1846         case k_type: {
1847                 ir_type *tp = tore.typ;
1848                 if (tp == get_glob_type())
1849                         break;
1850                 switch (get_type_tpop_code(tp)) {
1851                 case tpo_class:
1852                         dump_type_node(F, tp);
1853                         /* and now the edges */
1854                         for (i = get_class_n_supertypes(tp); i > 0;) {
1855                                  --i;
1856                                 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1857                         }
1858                         break;
1859                 default: break;
1860                 }
1861                 break; /* case k_type */
1862         }
1863         default:
1864                 printf(" *** irdump,  dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1865         }
1866 }
1867
1868 /*******************************************************************/
1869 /* dump analysis information that is expressed in graph terms.     */
1870 /*******************************************************************/
1871
1872 /* dump out edges */
1873 static void dump_out_edge(ir_node *n, void *env)
1874 {
1875         FILE *F = (FILE*)env;
1876         int i;
1877         for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
1878                 ir_node *succ = get_irn_out(n, i);
1879                 assert(succ);
1880                 print_node_edge_kind(F, succ);
1881                 fprintf(F, "{sourcename: \"");
1882                 PRINT_NODEID(n);
1883                 fprintf(F, "\" targetname: \"");
1884                 PRINT_NODEID(succ);
1885                 fprintf(F, "\" color: red linestyle: dashed");
1886                 fprintf(F, "}\n");
1887         }
1888 }
1889
1890 static void dump_loop_label(FILE *F, const ir_loop *loop)
1891 {
1892         fprintf(F, "loop %u", get_loop_depth(loop));
1893 }
1894
1895 static void dump_loop_info(FILE *F, const ir_loop *loop)
1896 {
1897         fprintf(F, " info1: \"");
1898         fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
1899 #ifdef DEBUG_libfirm   /* GL @@@ debug analyses */
1900         fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
1901 #endif
1902         fprintf(F, "\"");
1903 }
1904
1905 static void dump_loop_node(FILE *F, const ir_loop *loop)
1906 {
1907         fprintf(F, "node: {title: \"");
1908         PRINT_LOOPID(loop);
1909         fprintf(F, "\" label: \"");
1910         dump_loop_label(F, loop);
1911         fprintf(F, "\" ");
1912         dump_loop_info(F, loop);
1913         fprintf(F, "}\n");
1914 }
1915
1916 static void dump_loop_node_edge(FILE *F, const ir_loop *loop, size_t i)
1917 {
1918         assert(loop);
1919         fprintf(F, "edge: {sourcename: \"");
1920         PRINT_LOOPID(loop);
1921         fprintf(F, "\" targetname: \"");
1922         PRINT_NODEID(get_loop_element(loop, i).node);
1923         fprintf(F, "\" color: green");
1924         fprintf(F, "}\n");
1925 }
1926
1927 static void dump_loop_son_edge(FILE *F, const ir_loop *loop, size_t i)
1928 {
1929         assert(loop);
1930         fprintf(F, "edge: {sourcename: \"");
1931         PRINT_LOOPID(loop);
1932         fprintf(F, "\" targetname: \"");
1933         PRINT_LOOPID(get_loop_element(loop, i).son);
1934         ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n", i);
1935 }
1936
1937 static void dump_loops(FILE *F, const ir_loop *loop)
1938 {
1939         size_t i;
1940         size_t n_elements = get_loop_n_elements(loop);
1941         /* dump this loop node */
1942         dump_loop_node(F, loop);
1943
1944         /* dump edges to nodes in loop -- only if it is a real loop */
1945         if (get_loop_depth(loop) != 0) {
1946                 for (i = n_elements; i > 0;) {
1947                         loop_element element;
1948                         --i;
1949                         element = get_loop_element(loop, i);
1950                         if (*element.kind != k_ir_node)
1951                                 continue;
1952                         dump_loop_node_edge(F, loop, i);
1953                 }
1954         }
1955         for (i = n_elements; i > 0;) {
1956                 loop_element element;
1957                 --i;
1958                 element = get_loop_element(loop, i);
1959                 if (*element.kind != k_ir_loop)
1960                         continue;
1961                 dump_loops(F, element.son);
1962                 dump_loop_son_edge(F, loop, i);
1963         }
1964 }
1965
1966 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
1967 {
1968         ir_loop *loop = get_irg_loop(irg);
1969
1970         if (loop != NULL) {
1971                 ir_graph *rem = current_ir_graph;
1972                 current_ir_graph = irg;
1973
1974                 dump_loops(F, loop);
1975
1976                 current_ir_graph = rem;
1977         }
1978 }
1979
1980
1981 /**
1982  * dumps the VCG header
1983  */
1984 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
1985 {
1986         int   i;
1987         const char *label
1988                 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
1989
1990         init_colors();
1991
1992         if (! layout)     layout = "Compilergraph";
1993         if (!orientation) orientation = "bottom_to_top";
1994
1995         /* print header */
1996         fprintf(F,
1997                 "graph: { title: \"ir graph of %s\"\n"
1998                 "display_edge_labels: %s\n"
1999                 "layoutalgorithm: mindepth //$ \"%s\"\n"
2000                 "manhattan_edges: yes\n"
2001                 "port_sharing: no\n"
2002                 "orientation: %s\n"
2003                 "classname 1:  \"intrablock Data\"\n"
2004                 "classname 2:  \"Block\"\n"
2005                 "classname 3:  \"Entity type\"\n"
2006                 "classname 4:  \"Entity owner\"\n"
2007                 "classname 5:  \"Method Param\"\n"
2008                 "classname 6:  \"Method Res\"\n"
2009                 "classname 7:  \"Super\"\n"
2010                 "classname 8:  \"Union\"\n"
2011                 "classname 9:  \"Points-to\"\n"
2012                 "classname 10: \"Array Element Type\"\n"
2013                 "classname 11: \"Overwrites\"\n"
2014                 "classname 12: \"Member\"\n"
2015                 "classname 13: \"Control Flow\"\n"
2016                 "classname 14: \"intrablock Memory\"\n"
2017                 "classname 15: \"Dominators\"\n"
2018                 "classname 16: \"interblock Data\"\n"
2019                 "classname 17: \"interblock Memory\"\n"
2020                 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2021                 "classname 19: \"Postdominators\"\n"
2022                 "classname 20: \"Keep Alive\"\n"
2023                 "classname 21: \"Out Edges\"\n"
2024                 "classname 22: \"Macro Block Edges\"\n"
2025                 //"classname 23: \"NoInput Nodes\"\n"
2026                 "infoname 1: \"Attribute\"\n"
2027                 "infoname 2: \"Verification errors\"\n"
2028                 "infoname 3: \"Debug info\"\n",
2029                 name, label, layout, orientation);
2030
2031         for (i = 0; i < ird_color_count; ++i) {
2032                 if (color_rgb[i] != NULL) {
2033                         fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2034                 }
2035         }
2036         fprintf(F, "\n");
2037 }
2038
2039 /**
2040  * Dumps the vcg file footer
2041  */
2042 void dump_vcg_footer(FILE *F)
2043 {
2044         fprintf(F, "}\n");
2045 }
2046
2047
2048
2049 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2050 {
2051         size_t i;
2052
2053         construct_block_lists(irg);
2054
2055         /*
2056          * If we are in the interprocedural view, we dump not
2057          * only the requested irg but also all irgs that can be reached
2058          * from irg.
2059          */
2060         for (i = get_irp_n_irgs(); i > 0;) {
2061                 ir_graph *other_irg = get_irp_irg(--i);
2062                 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2063                 if (arr == NULL)
2064                         continue;
2065
2066                 dump_graph_from_list(out, other_irg);
2067                 DEL_ARR_F(arr);
2068         }
2069 }
2070
2071 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2072  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2073 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2074 {
2075         size_t i, arr_len;
2076         ir_graph *rem = current_ir_graph;
2077         ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2078         current_ir_graph = irg;
2079
2080         for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2081                 ir_extblk *extbb = arr[i];
2082                 ir_node *leader = get_extbb_leader(extbb);
2083                 size_t j, n_blks;
2084
2085                 fprintf(F, "graph: { title: \"");
2086                 PRINT_EXTBBID(leader);
2087                 fprintf(F, "\"  label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2088                         get_irn_node_nr(leader));
2089
2090                 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2091                         ir_node *node = extbb->blks[j];
2092                         if (is_Block(node)) {
2093                         /* Dumps the block and all the nodes in the block, which are to
2094                                 be found in Block->link. */
2095                                 dump_whole_block(F, node);
2096                         } else {
2097                                 /* Nodes that are not in a Block. */
2098                                 dump_node(F, node);
2099                                 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2100                                         dump_const_block_local(F, node);
2101                                 }
2102                                 dump_ir_data_edges(F, node);
2103                         }
2104                 }
2105                 fprintf(F, "}\n");
2106         }
2107
2108         if ((flags & ir_dump_flag_loops)
2109                         && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2110                 dump_loop_nodes_into_graph(F, irg);
2111
2112         current_ir_graph = rem;
2113         free_extbb(irg);
2114 }
2115
2116 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2117 {
2118         size_t    i;
2119         ir_entity *ent = get_irg_entity(irg);
2120
2121         if (!is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
2122                 compute_extbb(irg);
2123
2124         construct_extblock_lists(irg);
2125
2126         fprintf(F, "graph: { title: \"");
2127         PRINT_IRGID(irg);
2128         fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2129                 get_ent_dump_name(ent));
2130
2131         dump_graph_info(F, irg);
2132         print_dbg_info(F, get_entity_dbg_info(ent));
2133
2134         for (i = get_irp_n_irgs(); i > 0;) {
2135                 ir_graph   *other_irg = get_irp_irg(--i);
2136                 list_tuple *lists     = (list_tuple*)ird_get_irg_link(other_irg);
2137
2138                 if (lists) {
2139                         /* dump the extended blocks first */
2140                         if (ARR_LEN(lists->extbb_list)) {
2141                                 ird_set_irg_link(other_irg, lists->extbb_list);
2142                                 dump_extblock_graph(F, other_irg);
2143                         }
2144
2145                         /* we may have blocks without extended blocks, bad for instance */
2146                         if (ARR_LEN(lists->blk_list)) {
2147                                 ird_set_irg_link(other_irg, lists->blk_list);
2148                                 dump_block_graph(F, other_irg);
2149                         }
2150
2151                         DEL_ARR_F(lists->extbb_list);
2152                         DEL_ARR_F(lists->blk_list);
2153                         xfree(lists);
2154                 }
2155         }
2156
2157         /* Close the vcg information for the irg */
2158         fprintf(F, "}\n\n");
2159
2160         free_extbb(irg);
2161 }
2162
2163 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2164 {
2165         dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2166
2167         /* dump nodes */
2168         if (flags & ir_dump_flag_blocks_as_subgraphs) {
2169                 if (flags & ir_dump_flag_group_extbb) {
2170                         dump_blocks_extbb_grouped(out, irg);
2171                 } else {
2172                         dump_blocks_as_subgraphs(out, irg);
2173                 }
2174         } else {
2175                 /* dump_node_with_edges must be called in post visiting predecessors */
2176                 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2177         }
2178
2179         /* dump type info */
2180         if (flags & ir_dump_flag_with_typegraph) {
2181                 ir_graph *rem = current_ir_graph;
2182                 current_ir_graph = irg;
2183
2184                 type_walk_irg(irg, dump_type_info, NULL, out);
2185                 inc_irg_visited(get_const_code_irg());
2186                 /* dump edges from graph to type info */
2187                 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2188
2189                 current_ir_graph = rem;
2190         }
2191
2192         /* dump iredges out edges */
2193         if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2194                 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2195         }
2196
2197         /* dump the out edges in a separate walk */
2198         if ((flags & ir_dump_flag_out_edges)
2199                         && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2200                 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2201         }
2202
2203         dump_vcg_footer(out);
2204 }
2205
2206 static void dump_block_to_cfg(ir_node *block, void *env)
2207 {
2208         FILE *F = (FILE*)env;
2209         int i;
2210
2211         if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2212                 dump_node(F, block);
2213         }
2214
2215         if (is_Block(block)) {
2216                 /* This is a block. Dump a node for the block. */
2217                 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2218                 fprintf(F, "\" label: \"");
2219                 if (block == get_irg_start_block(get_irn_irg(block)))
2220                         fprintf(F, "Start ");
2221                 if (block == get_irg_end_block(get_irn_irg(block)))
2222                         fprintf(F, "End ");
2223
2224                 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2225                 PRINT_NODEID(block);
2226                 fprintf(F, "\" ");
2227                 fprintf(F, "info1:\"");
2228
2229                 /* the generic version. */
2230                 dump_irnode_to_file(F, block);
2231
2232                 fprintf(F, "\"");  /* closing quote of info */
2233
2234                 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2235                         (block == get_irg_end_block(get_irn_irg(block)))     )
2236                         fprintf(F, " color:blue ");
2237
2238                 fprintf(F, "}\n");
2239
2240                 /* Dump the edges */
2241                 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2242                         ir_node *pred = get_Block_cfgpred(block, i);
2243                         if (!is_Bad(pred))
2244                                 pred = get_nodes_block(pred);
2245                         fprintf(F, "edge: { sourcename: \"");
2246                         PRINT_NODEID(block);
2247                         fprintf(F, "\" targetname: \"");
2248                         PRINT_NODEID(pred);
2249                         fprintf(F, "\"}\n");
2250                 }
2251
2252                 /* Dump dominator/postdominator edge */
2253                 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2254                         if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2255                                 ir_node *pred = get_Block_idom(block);
2256                                 fprintf(F, "edge: { sourcename: \"");
2257                                 PRINT_NODEID(block);
2258                                 fprintf(F, "\" targetname: \"");
2259                                 PRINT_NODEID(pred);
2260                                 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2261                         }
2262                         if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2263                                 ir_node *pred = get_Block_ipostdom(block);
2264                                 fprintf(F, "edge: { sourcename: \"");
2265                                 PRINT_NODEID(block);
2266                                 fprintf(F, "\" targetname: \"");
2267                                 PRINT_NODEID(pred);
2268                                 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2269                         }
2270                 }
2271         }
2272 }
2273
2274 void dump_cfg(FILE *F, ir_graph *irg)
2275 {
2276         dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2277
2278         /* walk over the blocks in the graph */
2279         irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2280
2281         dump_vcg_footer(F);
2282 }
2283
2284 void dump_callgraph(FILE *F)
2285 {
2286         size_t          i;
2287         ir_dump_flags_t old_flags = ir_get_dump_flags();
2288
2289         ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2290         dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2291
2292         for (i = get_irp_n_irgs(); i > 0;) {
2293                 ir_graph *irg = get_irp_irg(--i);
2294                 ir_entity *ent = get_irg_entity(irg);
2295                 size_t j, n_callees = get_irg_n_callees(irg);
2296
2297                 dump_entity_node(F, ent);
2298                 for (j = 0; j < n_callees; ++j) {
2299                         ir_entity  *c    = get_irg_entity(get_irg_callee(irg, j));
2300                         int         be   = is_irg_callee_backedge(irg, j);
2301                         const char *attr = be
2302                                 ? "label:\"recursion %zu\""
2303                                 : "label:\"calls %zu\"";
2304                         print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2305                                            get_irg_callee_loop_depth(irg, j));
2306                 }
2307         }
2308
2309         ir_set_dump_flags(old_flags);
2310         dump_vcg_footer(F);
2311 }
2312
2313 void dump_typegraph(FILE *out)
2314 {
2315         dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2316         type_walk(dump_type_info, NULL, out);
2317         dump_vcg_footer(out);
2318 }
2319
2320 void dump_class_hierarchy(FILE *out)
2321 {
2322         dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2323         type_walk(dump_class_hierarchy_node, NULL, out);
2324         dump_vcg_footer(out);
2325 }
2326
2327 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2328 {
2329         size_t i;
2330         bool   loop_node_started = false;
2331         size_t first      = 0;
2332         size_t son_number = 0;
2333         loop_element le;
2334         ir_loop *son = NULL;
2335
2336         /* Dump a new loop node. */
2337         dump_loop_node(F, loop);
2338
2339         /* Dump the loop elements. */
2340         for (i = 0; i < get_loop_n_elements(loop); i++) {
2341                 le = get_loop_element(loop, i);
2342                 son = le.son;
2343                 if (get_kind(son) == k_ir_loop) {
2344
2345                         /* We are a loop son -> Recurse */
2346
2347                         if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2348                                 fprintf(F, "\" }\n");
2349                                 fprintf(F, "edge: {sourcename: \"");
2350                                 PRINT_LOOPID(loop);
2351                                 fprintf(F, "\" targetname: \"");
2352                                 PRINT_LOOPID(loop);
2353                                 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2354                                                 (unsigned long) first,
2355                                                 (unsigned long) first,
2356                                         (unsigned long) i-1);
2357                                 loop_node_started = false;
2358                         }
2359                         dump_loop_son_edge(F, loop, son_number++);
2360                         dump_loops_standalone(F, son);
2361                 } else if (get_kind(son) == k_ir_node) {
2362                         /* We are a loop node -> Collect firm nodes */
2363
2364                         ir_node *n = le.node;
2365                         if (!loop_node_started) {
2366                                 /* Start a new node which contains all firm nodes of the current loop */
2367                                 fprintf(F, "node: { title: \"");
2368                                 PRINT_LOOPID(loop);
2369                                 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2370                                         (unsigned long)i);
2371                                 loop_node_started = true;
2372                                 first = i;
2373                         } else
2374                                 fprintf(F, "\n");
2375
2376                         dump_node_label(F, n);
2377                         /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2378                         if (has_backedges(n)) fprintf(F, "\t loop head!");
2379                 } else { /* for callgraph loop tree */
2380                         ir_graph *n;
2381                         assert(get_kind(son) == k_ir_graph);
2382
2383                         /* We are a loop node -> Collect firm graphs */
2384                         n = le.irg;
2385                         if (!loop_node_started) {
2386                                 /* Start a new node which contains all firm nodes of the current loop */
2387                                 fprintf(F, "node: { title: \"");
2388                                 PRINT_LOOPID(loop);
2389                                 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2390                                         (unsigned long)i);
2391                                 loop_node_started = true;
2392                                 first = i;
2393                         } else
2394                                 fprintf(F, "\n");
2395                         fprintf(F, " %s", get_irg_dump_name(n));
2396                         /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2397                 }
2398         }
2399
2400         if (loop_node_started) {
2401                 fprintf(F, "\" }\n");
2402                 fprintf(F, "edge: {sourcename: \"");
2403                 PRINT_LOOPID(loop);
2404                 fprintf(F, "\" targetname: \"");
2405                 PRINT_LOOPID(loop);
2406                 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2407                         (unsigned long) first,
2408                         (unsigned long) first,
2409                         (unsigned long) i-1);
2410                 loop_node_started = false;
2411         }
2412 }
2413
2414 void dump_loop_tree(FILE *out, ir_graph *irg)
2415 {
2416         ir_graph       *rem       = current_ir_graph;
2417         ir_dump_flags_t old_flags = ir_get_dump_flags();
2418
2419         current_ir_graph = irg;
2420         ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2421
2422         dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2423
2424         if (get_irg_loop(irg))
2425                 dump_loops_standalone(out, get_irg_loop(irg));
2426
2427         dump_vcg_footer(out);
2428
2429         ir_set_dump_flags(old_flags);
2430         current_ir_graph = rem;
2431 }
2432
2433 void dump_callgraph_loop_tree(FILE *out)
2434 {
2435         dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2436         dump_loops_standalone(out, irp->outermost_cg_loop);
2437         dump_vcg_footer(out);
2438 }
2439
2440 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2441 {
2442         size_t i;
2443         int    son_number = 0;
2444         int    node_number = 0;
2445
2446         if (flags & ir_dump_flag_loops)
2447                 dump_loop_node(F, loop);
2448
2449         for (i = 0; i < get_loop_n_elements(loop); i++) {
2450                 loop_element le = get_loop_element(loop, i);
2451                 if (*(le.kind) == k_ir_loop) {
2452                         if (flags & ir_dump_flag_loops)
2453                                 dump_loop_son_edge(F, loop, son_number++);
2454                         /* Recur */
2455                         collect_nodeloop(F, le.son, loopnodes);
2456                 } else {
2457                         if (flags & ir_dump_flag_loops)
2458                                 dump_loop_node_edge(F, loop, node_number++);
2459                         eset_insert(loopnodes, le.node);
2460                 }
2461         }
2462 }
2463
2464 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2465                                             eset *extnodes)
2466 {
2467         size_t i;
2468         int j, start;
2469
2470         for (i = 0; i < get_loop_n_elements(loop); i++) {
2471                 loop_element le = get_loop_element(loop, i);
2472                 if (*(le.kind) == k_ir_loop) {
2473                         /* Recur */
2474                         collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2475                 } else {
2476                         if (is_Block(le.node)) start = 0; else start = -1;
2477                         for (j = start; j < get_irn_arity(le.node); j++) {
2478                                 ir_node *pred = get_irn_n(le.node, j);
2479                                 if (!eset_contains(loopnodes, pred)) {
2480                                         eset_insert(extnodes, pred);
2481                                         if (!is_Block(pred)) {
2482                                                 pred = get_nodes_block(pred);
2483                                                 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2484                                         }
2485                                 }
2486                         }
2487                 }
2488         }
2489 }
2490
2491 void dump_loop(FILE *F, ir_loop *l)
2492 {
2493         eset *loopnodes = eset_create();
2494         eset *extnodes = eset_create();
2495         ir_node *n, *b;
2496         char name[50];
2497
2498         snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2499         dump_vcg_header(F, name, NULL, NULL);
2500
2501         /* collect all nodes to dump */
2502         collect_nodeloop(F, l, loopnodes);
2503         collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2504
2505         /* build block lists */
2506         eset_foreach(loopnodes, ir_node*, n) {
2507                 set_irn_link(n, NULL);
2508         }
2509         eset_foreach(extnodes, ir_node*, n) {
2510                 set_irn_link(n, NULL);
2511         }
2512         eset_foreach(loopnodes, ir_node*, n) {
2513                 if (!is_Block(n)) {
2514                         b = get_nodes_block(n);
2515                         set_irn_link(n, get_irn_link(b));
2516                         set_irn_link(b, n);
2517                 }
2518         }
2519         eset_foreach(extnodes, ir_node*, n) {
2520                 if (!is_Block(n)) {
2521                         b = get_nodes_block(n);
2522                         set_irn_link(n, get_irn_link(b));
2523                         set_irn_link(b, n);
2524                 }
2525         }
2526
2527         eset_foreach(loopnodes, ir_node*, b) {
2528                 if (is_Block(b)) {
2529                         fprintf(F, "graph: { title: \"");
2530                         PRINT_NODEID(b);
2531                         fprintf(F, "\"  label: \"");
2532                         dump_node_opcode(F, b);
2533                         fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2534                         fprintf(F, "\" status:clustered color:yellow\n");
2535
2536                         /* dump the blocks edges */
2537                         dump_ir_data_edges(F, b);
2538
2539                         /* dump the nodes that go into the block */
2540                         for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2541                                 if (eset_contains(extnodes, n))
2542                                         overrule_nodecolor = ird_color_block_inout;
2543                                 dump_node(F, n);
2544                                 overrule_nodecolor = ird_color_default_node;
2545                                 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2546                         }
2547
2548                         /* Close the vcg information for the block */
2549                         fprintf(F, "}\n");
2550                         dump_const_node_local(F, b);
2551                         fprintf(F, "\n");
2552                 }
2553         }
2554         eset_foreach(extnodes, ir_node*, b) {
2555                 if (is_Block(b)) {
2556                         fprintf(F, "graph: { title: \"");
2557                         PRINT_NODEID(b);
2558                         fprintf(F, "\"  label: \"");
2559                         dump_node_opcode(F, b);
2560                         fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2561                         fprintf(F, "\" status:clustered color:lightblue\n");
2562
2563                         /* dump the nodes that go into the block */
2564                         for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2565                                 if (!eset_contains(loopnodes, n))
2566                                         overrule_nodecolor = ird_color_block_inout;
2567                                 dump_node(F, n);
2568                                 overrule_nodecolor = ird_color_default_node;
2569                                 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2570                         }
2571
2572                         /* Close the vcg information for the block */
2573                         fprintf(F, "}\n");
2574                         dump_const_node_local(F, b);
2575                         fprintf(F, "\n");
2576                 }
2577         }
2578         eset_destroy(loopnodes);
2579         eset_destroy(extnodes);
2580
2581         dump_vcg_footer(F);
2582 }
2583
2584 static bool   obstack_init;
2585 static struct obstack obst;
2586 static char  *dump_path;
2587
2588 void ir_set_dump_path(const char *path)
2589 {
2590         xfree(dump_path);
2591         dump_path = xstrdup(path);
2592 }
2593
2594 static void add_string_escaped(const char *string)
2595 {
2596         const char *p;
2597         for (p = string; *p != '\0'; ++p) {
2598                 char c = *p;
2599                 if (c == '/') {
2600                         obstack_1grow(&obst, '@');
2601                         obstack_1grow(&obst, '1');
2602                 } else if (c == '@') {
2603                         obstack_1grow(&obst, '@');
2604                         obstack_1grow(&obst, '2');
2605                 } else {
2606                         obstack_1grow(&obst, c);
2607                 }
2608         }
2609 }
2610
2611 static void add_dump_path(void)
2612 {
2613         if (!obstack_init) {
2614                 obstack_init(&obst);
2615                 obstack_init = true;
2616         }
2617
2618         if (dump_path != NULL) {
2619                 size_t len = strlen(dump_path);
2620                 obstack_grow(&obst, dump_path, len);
2621                 if (len > 0 && dump_path[len-1] != '/')
2622                         obstack_1grow(&obst, '/');
2623         }
2624 }
2625
2626 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2627                        const char *suffix)
2628 {
2629         const char *dump_name = get_irg_dump_name(graph);
2630         char       *file_name;
2631         FILE       *out;
2632
2633         if (!ir_should_dump(dump_name))
2634                 return;
2635
2636         add_dump_path();
2637
2638         add_string_escaped(dump_name);
2639         obstack_printf(&obst, "-%02u", graph->dump_nr++);
2640
2641         if (suffix != NULL) {
2642                 if (suffix[0] != '.')
2643                         obstack_1grow(&obst, '-');
2644                 add_string_escaped(suffix);
2645         }
2646         obstack_1grow(&obst, '\0');
2647
2648         file_name = (char*)obstack_finish(&obst);
2649         /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2650         out       = fopen(file_name, "wb");
2651         obstack_free(&obst, file_name);
2652
2653         if (out == NULL) {
2654                 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2655                 return;
2656         }
2657
2658         func(out, graph);
2659         fclose(out);
2660 }
2661
2662 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2663 {
2664         char *file_name;
2665         FILE *out;
2666
2667         add_dump_path();
2668
2669         obstack_printf(&obst, "%02u", irp->dump_nr++);
2670         if (suffix != NULL) {
2671                 if (suffix[0] != '.')
2672                         obstack_1grow(&obst, '-');
2673                 add_string_escaped(suffix);
2674         }
2675         obstack_1grow(&obst, '\0');
2676
2677         file_name = (char*)obstack_finish(&obst);
2678         out       = fopen(file_name, "wb");
2679         obstack_free(&obst, file_name);
2680
2681         if (out == NULL) {
2682                 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2683                 return;
2684         }
2685         func(out);
2686         fclose(out);
2687 }
2688
2689 void dump_ir_graph(ir_graph *graph, const char *suffix)
2690 {
2691         char buf[256];
2692
2693         snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2694         dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2695 }
2696
2697 void dump_all_ir_graphs(const char *suffix)
2698 {
2699         size_t i, n_irgs = get_irp_n_irgs();
2700
2701         for (i = 0; i < n_irgs; ++i) {
2702                 ir_graph *irg = get_irp_irg(i);
2703                 dump_ir_graph(irg, suffix);
2704         }
2705 }
2706
2707 typedef struct pass_t {
2708         ir_prog_pass_t pass;
2709         char           suffix[1];
2710 } pass_t;
2711
2712 /**
2713  * Wrapper around dump_all_ir_graphs().
2714  */
2715 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2716 {
2717         pass_t *pass = (pass_t*)context;
2718
2719         (void)irp;
2720         dump_all_ir_graphs(pass->suffix);
2721         return 0;
2722 }
2723
2724 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2725 {
2726         size_t  len  = strlen(suffix) + 1;
2727         pass_t *pass = XMALLOCF(pass_t, suffix, len);
2728         ir_prog_pass_t *res  = def_prog_pass_constructor(
2729                 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2730
2731         /* this pass does not change anything, so neither dump nor verify is needed. */
2732         res->dump_irprog   = ir_prog_no_dump;
2733         res->verify_irprog = ir_prog_no_verify;
2734
2735         memcpy(pass->suffix, suffix, len);
2736
2737         return res;
2738 }