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