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