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

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