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