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

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