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