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