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

   1 /*
   2  * Copyright (C) 1995-2008 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  * @version $Id$
  25  */
  26 #ifdef HAVE_CONFIG_H
  27 #include "config.h"
  28 #endif
  29
  30 #ifdef HAVE_STRING_H
  31 #include <string.h>
  32 #endif
  33 #ifdef HAVE_STDLIB_H
  34 #include <stdlib.h>
  35 #endif
  36 #include <stdarg.h>
  37
  38 #include "firm_common_t.h"
  39
  40 #include "list.h"
  41
  42 #include "irnode_t.h"
  43 #include "irgraph_t.h"
  44 #include "irprog_t.h"
  45 #include "entity_t.h"
  46 #include "irop.h"
  47
  48 #include "irdump_t.h"
  49
  50 #include "irgwalk.h"
  51 #include "tv_t.h"
  52 #include "irouts.h"
  53 #include "iredges.h"
  54 #include "irdom.h"
  55 #include "irloop_t.h"
  56 #include "callgraph.h"
  57 #include "irextbb_t.h"
  58 #include "irhooks.h"
  59 #include "dbginfo_t.h"
  60 #include "irtools.h"
  61
  62 #include "irvrfy.h"
  63
  64 #include "error.h"
  65 #include "array.h"
  66 #include "pmap.h"
  67 #include "eset.h"
  68 #include "pset.h"
  69
  70 #if DO_HEAPANALYSIS
  71 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
  72 extern void dump_irn_state(FILE *FL, ir_node *n);
  73 extern int  get_opt_dump_abstvals(void);
  74 typedef unsigned long SeqNo;
  75 extern SeqNo get_Block_seqno(ir_node *n);
  76 #endif
  77
  78 /** Dump only irgs with names that start with this prefix. */
  79 static ident *dump_file_filter_id = NULL;
  80
  81 #define ERROR_TXT       "<ERROR>"
  82
  83 /*******************************************************************/
  84 /* flags to steer output                                           */
  85 /*******************************************************************/
  86
  87 /** An option to turn off edge labels */
  88 static int edge_label = 1;
  89 /** An option to turn off dumping values of constant entities */
  90 static int const_entities = 1;
  91 /** An option to dump the keep alive edges */
  92 static int dump_keepalive = 1;
  93 /** An option to dump the new out edges */
  94 static int dump_new_edges_flag = 0;
  95 /** An option to dump ld_names instead of names. */
  96 static int dump_ld_name = 1;
  97 /** Compiler options to dump analysis information in dump_ir_graph */
  98 static int dump_out_edge_flag = 0;
  99 static int dump_loop_information_flag = 0;
 100 static int dump_backedge_information_flag = 1;
 101 /** An option to dump const-like nodes locally. */
 102 static int dump_const_local = 1;
 103 /** An option to dump the node index number. */
 104 static int dump_node_idx_labels = 0;
 105 /** An option to dump all graph anchors */
 106 static int dump_anchors = 0;
 107 /** An option to dump the macro block edges. */
 108 static int dump_macro_block_edges = 0;
 109
 110 int dump_dominator_information_flag = 0;
 111 int opt_dump_analysed_type_info = 1;
 112 int opt_dump_pointer_values_to_info = 0;  /* default off: for test compares!! */
 113
 114 static ird_color_t overrule_nodecolor = ird_color_default_node;
 115
 116 /** The vcg node attribute hook. */
 117 static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
 118 /** The vcg node attribute hook. */
 119 static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
 120 /** The vcg edge attribute hook. */
 121 static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
 122 /** The vcg dump block edge hook */
 123 static DUMP_NODE_EDGE_FUNC dump_block_edge_hook = NULL;
 124 /** The vcg dump node edge hook. */
 125 static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
 126
 127 /* Set the hook to be called to dump additional edges to a node. */
 128 void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func) {
 129         dump_node_edge_hook = func;
 130 }
 131
 132 /* Get the additional edge dump hook. */
 133 DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void) {
 134         return dump_node_edge_hook;
 135 }
 136
 137 /* Set the hook to be called to dump additional edges to a block. */
 138 void set_dump_block_edge_hook(DUMP_NODE_EDGE_FUNC func) {
 139         dump_block_edge_hook = func;
 140 }
 141
 142 /* Get the additional block edge dump hook. */
 143 DUMP_NODE_EDGE_FUNC get_dump_block_edge_hook(void) {
 144         return dump_node_edge_hook;
 145 }
 146
 147 /* set the ir graph hook */
 148 void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
 149         dump_ir_graph_hook = hook;
 150 }
 151
 152 /* set the node attribute hook */
 153 void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
 154         dump_node_vcgattr_hook = hook;
 155 }
 156
 157 /* set the edge attribute hook */
 158 void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
 159         dump_edge_vcgattr_hook = hook;
 160 }
 161
 162 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
 163  * are set, else returns dump_const_local_flag.
 164  */
 165 static int get_opt_dump_const_local(void) {
 166         if (dump_out_edge_flag || dump_loop_information_flag || (dump_new_edges_flag && edges_activated(current_ir_graph)))
 167                 return 0;
 168         return dump_const_local;
 169 }
 170
 171 /* Set a prefix filter for output functions. */
 172 void only_dump_method_with_name(ident *name) {
 173         dump_file_filter_id = name;
 174 }
 175
 176 /* Returns the prefix filter set with only_dump_method_with_name(). */
 177 ident *get_dump_file_filter_ident(void) {
 178         return dump_file_filter_id;
 179 }
 180
 181 /* Returns non-zero if dump file filter is not set, or if it is a prefix of name. */
 182 int is_filtered_dump_name(ident *name) {
 183         if (!dump_file_filter_id) return 1;
 184         return id_is_prefix(dump_file_filter_id, name);
 185 }
 186
 187 /* To turn off display of edge labels.  Edge labels often cause xvcg to
 188    abort with a segmentation fault. */
 189 void turn_off_edge_labels(void) {
 190         edge_label = 0;
 191 }
 192
 193 void dump_consts_local(int flag) {
 194         dump_const_local = flag;
 195 }
 196
 197 void dump_node_idx_label(int flag) {
 198         dump_node_idx_labels = flag;
 199 }
 200
 201 void dump_constant_entity_values(int flag) {
 202         const_entities = flag;
 203 }
 204
 205 void dump_keepalive_edges(int flag) {
 206         dump_keepalive = flag;
 207 }
 208
 209 void dump_new_edges(int flag) {
 210         dump_new_edges_flag = flag;
 211 }
 212
 213 int get_opt_dump_keepalive_edges(void) {
 214         return dump_keepalive;
 215 }
 216
 217 void dump_out_edges(int flag) {
 218         dump_out_edge_flag = flag;
 219 }
 220
 221 void dump_dominator_information(int flag) {
 222         dump_dominator_information_flag = flag;
 223 }
 224
 225 void dump_loop_information(int flag) {
 226         dump_loop_information_flag = flag;
 227 }
 228
 229 void dump_backedge_information(int flag) {
 230         dump_backedge_information_flag = flag;
 231 }
 232
 233 /* Dump the information of type field specified in ana/irtypeinfo.h.
 234  * If the flag is set, the type name is output in [] in the node label,
 235  * else it is output as info.
 236  */
 237 void set_opt_dump_analysed_type_info(int flag) {
 238         opt_dump_analysed_type_info = flag;
 239 }
 240
 241 void dump_pointer_values_to_info(int flag) {
 242         opt_dump_pointer_values_to_info = flag;
 243 }
 244
 245 void dump_ld_names(int flag) {
 246         dump_ld_name = flag;
 247 }
 248
 249 void dump_all_anchors(int flag) {
 250         dump_anchors = flag;
 251 }
 252
 253 void dump_macroblock_edges(int flag) {
 254         dump_macro_block_edges = flag;
 255 }
 256
 257 /* -------------- some extended helper functions ----------------- */
 258
 259 /**
 260  * returns the name of a mode or ERROR_TXT if mode is NOT a mode object.
 261  * in the later case, sets bad.
 262  */
 263 const char *get_mode_name_ex(ir_mode *mode, int *bad) {
 264         if (is_mode(mode))
 265                 return get_mode_name(mode);
 266         *bad |= 1;
 267         return ERROR_TXT;
 268 }
 269
 270 /**
 271  * returns the name of a type or <ERROR> if mode is NOT a mode object.
 272  * in the later case, sets bad
 273  */
 274 const char *get_type_name_ex(ir_type *tp, int *bad) {
 275         if (is_type(tp))
 276                 return get_type_name(tp);
 277         *bad |= 1;
 278         return ERROR_TXT;
 279 }
 280
 281 #define CUSTOM_COLOR_BASE    100
 282 static const char *color_names[ird_color_count];
 283 static const char *color_rgb[ird_color_count];
 284 static struct obstack color_obst;
 285
 286 static void custom_color(int num, const char *rgb_def)
 287 {
 288         assert(num < ird_color_count);
 289         obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
 290         obstack_1grow(&color_obst, '\0');
 291
 292         color_rgb[num]   = rgb_def;
 293         color_names[num] = obstack_finish(&color_obst);
 294 }
 295
 296 static void named_color(int num, const char *name)
 297 {
 298         assert(num < ird_color_count);
 299         color_rgb[num]   = NULL;
 300         color_names[num] = name;
 301 }
 302
 303 static void init_colors(void)
 304 {
 305         static int initialized = 0;
 306         if(initialized)
 307                 return;
 308
 309         obstack_init(&color_obst);
 310
 311         custom_color(ird_color_prog_background,       "204 204 204");
 312         custom_color(ird_color_block_background,      "255 255 0");
 313         custom_color(ird_color_dead_block_background, "190 150 150");
 314         named_color(ird_color_block_inout,            "lightblue");
 315         named_color(ird_color_default_node,           "white");
 316         custom_color(ird_color_memory,                "153 153 255");
 317         custom_color(ird_color_controlflow,           "255 153 153");
 318         custom_color(ird_color_const,                 "204 255 255");
 319         custom_color(ird_color_proj,                  "255 255 153");
 320         custom_color(ird_color_uses_memory,           "153 153 255");
 321         custom_color(ird_color_phi,                   "105 255 105");
 322         custom_color(ird_color_anchor,                "100 100 255");
 323         named_color(ird_color_error,                  "red");
 324
 325         initialized = 1;
 326 }
 327
 328 /**
 329  * Prints the VCG color to a file.
 330  */
 331 static void print_vcg_color(FILE *F, ird_color_t color) {
 332         assert(color < ird_color_count);
 333         fprintf(F, "color:%s", color_names[color]);
 334 }
 335
 336 /**
 337  * Prints the edge from a type S to a type T with additional info fmt, ...
 338  * to the file F.
 339  */
 340 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
 341 {
 342         va_list ap;
 343
 344         va_start(ap, fmt);
 345         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
 346         fprintf(F, " targetname: "); PRINT_TYPEID(T);
 347         vfprintf(F, fmt, ap);
 348         fprintf(F,"}\n");
 349         va_end(ap);
 350 }
 351
 352 /**
 353  * Prints the edge from a type T to an entity E with additional info fmt, ...
 354  * to the file F.
 355  */
 356 static void print_type_ent_edge(FILE *F, ir_type *T, ir_entity *E, const char *fmt, ...)
 357 {
 358         va_list ap;
 359
 360         va_start(ap, fmt);
 361         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
 362         fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
 363         vfprintf(F, fmt, ap);
 364         fprintf(F, "}\n");
 365         va_end(ap);
 366 }
 367
 368 /**
 369  * Prints the edge from an entity E to an entity T with additional info fmt, ...
 370  * to the file F.
 371  */
 372 static void print_ent_ent_edge(FILE *F, ir_entity *E, ir_entity *T, int backedge, const char *fmt, ...)
 373 {
 374         va_list ap;
 375
 376         va_start(ap, fmt);
 377         if (backedge)
 378                 fprintf(F, "backedge: { sourcename: \"");
 379         else
 380                 fprintf(F, "edge: { sourcename: \"");
 381         PRINT_ENTID(E);
 382         fprintf(F, "\" targetname: \""); PRINT_ENTID(T);  fprintf(F, "\"");
 383         vfprintf(F, fmt, ap);
 384         fprintf(F, "}\n");
 385         va_end(ap);
 386 }
 387
 388 /**
 389  * Prints the edge from an entity E to a type T with additional info fmt, ...
 390  * to the file F.
 391  */
 392 static void print_ent_type_edge(FILE *F, ir_entity *E, ir_type *T, const char *fmt, ...)
 393 {
 394         va_list ap;
 395
 396         va_start(ap, fmt);
 397         fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
 398         fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
 399         vfprintf(F, fmt, ap);
 400         fprintf(F,"}\n");
 401         va_end(ap);
 402 }
 403
 404 /**
 405  * Prints the edge from a node N to a type T with additional info fmt, ...
 406  * to the file F.
 407  */
 408 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
 409 {
 410         va_list ap;
 411
 412         va_start(ap, fmt);
 413         fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
 414         fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
 415         vfprintf(F, fmt, ap);
 416         fprintf(F,"}\n");
 417         va_end(ap);
 418 }
 419
 420 /**
 421  * Prints the edge from a node N to an entity E with additional info fmt, ...
 422  * to the file F.
 423  */
 424 static void print_node_ent_edge(FILE *F, const ir_node *N, ir_entity *E, const char *fmt, ...)
 425 {
 426         va_list ap;
 427
 428         va_start(ap, fmt);
 429         fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
 430         fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
 431         fprintf(F, "\"");
 432         vfprintf(F, fmt, ap);
 433         fprintf(F,"}\n");
 434         va_end(ap);
 435 }
 436
 437 /**
 438  * Prints the edge from an entity E to a node N with additional info fmt, ...
 439  * to the file F.
 440  */
 441 static void print_ent_node_edge(FILE *F, ir_entity *E, const ir_node *N, const char *fmt, ...)
 442 {
 443         va_list ap;
 444
 445         va_start(ap, fmt);
 446         fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
 447         fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
 448         vfprintf(F, fmt, ap);
 449         fprintf(F,"}\n");
 450         va_end(ap);
 451 }
 452
 453 /**
 454  * Prints the edge from a type E to an enumeration item item with additional info fmt, ...
 455  * to the file F.
 456  */
 457 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
 458 {
 459         va_list ap;
 460
 461         va_start(ap, fmt);
 462         fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
 463         fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
 464         vfprintf(F, fmt, ap);
 465         fprintf(F,"}\n");
 466         va_end(ap);
 467 }
 468
 469 /*-----------------------------------------------------------------*/
 470 /* global and ahead declarations                                   */
 471 /*-----------------------------------------------------------------*/
 472
 473 static void dump_whole_node(ir_node *n, void *env);
 474 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
 475
 476 /*-----------------------------------------------------------------*/
 477 /* Helper functions.                                                */
 478 /*-----------------------------------------------------------------*/
 479
 480 /**
 481  * This map is used as a private link attr to be able to call dumper
 482  * anywhere without destroying link fields.
 483  */
 484 static pmap *irdump_link_map = NULL;
 485
 486 /** NOT A STANDARD LIBFIRM INIT METHOD
 487  *
 488  * We do not want to integrate dumping into libfirm, i.e., if the dumpers
 489  * are off, we want to have as few interferences as possible.  Therefore the
 490  * initialization is performed lazily and not called from within init_firm.
 491  *
 492  * Creates the link attribute map. */
 493 static void init_irdump(void) {
 494         /* We need a new, empty map. */
 495         if (irdump_link_map) pmap_destroy(irdump_link_map);
 496         irdump_link_map = pmap_create();
 497         if (!dump_file_filter_id)
 498                 dump_file_filter_id = new_id_from_str("");
 499 }
 500
 501 /**
 502  * Returns the private link field.
 503  */
 504 static void *ird_get_irn_link(ir_node *n) {
 505         void *res = NULL;
 506         if (!irdump_link_map) return NULL;
 507
 508         if (pmap_contains(irdump_link_map, (void *)n))
 509                 res = pmap_get(irdump_link_map, (void *)n);
 510         return res;
 511 }
 512
 513 /**
 514  * Sets the private link field.
 515  */
 516 static void ird_set_irn_link(ir_node *n, void *x) {
 517         if (!irdump_link_map)
 518                 init_irdump();
 519         pmap_insert(irdump_link_map, (void *)n, x);
 520 }
 521
 522 /**
 523  * Gets the private link field of an irg.
 524  */
 525 static void *ird_get_irg_link(ir_graph *irg) {
 526         void *res = NULL;
 527         if (!irdump_link_map) return NULL;
 528
 529         if (pmap_contains(irdump_link_map, (void *)irg))
 530                 res = pmap_get(irdump_link_map, (void *)irg);
 531         return res;
 532 }
 533
 534 /**
 535  * Sets the private link field of an irg.
 536  */
 537 static void ird_set_irg_link(ir_graph *irg, void *x) {
 538         if (!irdump_link_map) init_irdump();
 539         pmap_insert(irdump_link_map, (void *)irg, x);
 540 }
 541
 542 /**
 543  * Walker, clears the private link field.
 544  */
 545 static void clear_link(ir_node * node, void * env) {
 546         (void) env;
 547         ird_set_irn_link(node, NULL);
 548 }
 549
 550 /**
 551  * If the entity has a ld_name, returns it if the dump_ld_name is set,
 552  * else returns the name of the entity.
 553  */
 554 static const char *_get_ent_dump_name(ir_entity *ent, int dump_ld_name) {
 555         if (!ent)
 556                 return "<NULL entity>";
 557         if (dump_ld_name) {
 558                 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
 559                 if (ent->ld_name) return get_id_str(ent->ld_name);
 560         }
 561         return get_id_str(ent->name);
 562 }
 563
 564 /**
 565  * If the entity has a ld_name, returns it if the option dump_ld_name is set,
 566  * else returns the name of the entity.
 567  */
 568 const char *get_ent_dump_name(ir_entity *ent) {
 569         return _get_ent_dump_name(ent, dump_ld_name);
 570 }
 571
 572 /* Returns the name of an IRG. */
 573 const char *get_irg_dump_name(ir_graph *irg) {
 574         /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
 575         return _get_ent_dump_name(get_irg_entity(irg), 1);
 576 }
 577
 578 /**
 579  * Returns non-zero if a node is in floating state.
 580  */
 581 static int node_floats(ir_node *n) {
 582         return ((get_irn_pinned(n) == op_pin_state_floats) &&
 583                 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
 584 }
 585
 586 /**
 587  *  Walker that visits the anchors
 588  */
 589 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
 590         if (dump_anchors || (dump_new_edges_flag && edges_activated(irg))) {
 591                 irg_walk_anchors(irg, pre, post, env);
 592         } else {
 593                 irg_walk_graph(irg, pre, post, env);
 594         }
 595 }
 596
 597 /**
 598  * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
 599  */
 600 static void collect_node(ir_node * node, void *env) {
 601         (void) env;
 602         if (is_Block(node)
 603             || node_floats(node)
 604             || get_irn_op(node) == op_Bad
 605             || get_irn_op(node) == op_Unknown
 606             || get_irn_op(node) == op_NoMem) {
 607                 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
 608                 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
 609                 ARR_APP1(ir_node *, arr, node);
 610                 ird_set_irg_link(get_irn_irg(node), arr);    /* arr is an l-value, APP_ARR might change it! */
 611         } else {
 612                 ir_node * block = get_nodes_block(node);
 613
 614                 if (is_Bad(block)) {
 615                         /* this node is in a Bad block, so we must place it into the graph's list */
 616                         ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
 617                         if (!arr) arr = NEW_ARR_F(ir_node *, 0);
 618                         ARR_APP1(ir_node *, arr, node);
 619                         ird_set_irg_link(get_irn_irg(node), arr);    /* arr is an l-value, APP_ARR might change it! */
 620                 } else {
 621                         ird_set_irn_link(node, ird_get_irn_link(block));
 622                         ird_set_irn_link(block, node);
 623                 }
 624         }
 625 }
 626
 627 /** Construct lists to walk ir block-wise.
 628  *
 629  * Collects all blocks, nodes not op_pin_state_pinned,
 630  * Bad, NoMem and Unknown into a flexible array in link field of
 631  * irg they belong to.  Sets the irg link field to NULL in all
 632  * graphs not visited.
 633  * Free the list with DEL_ARR_F().
 634  */
 635 static ir_node **construct_block_lists(ir_graph *irg) {
 636         int      i;
 637 #ifdef INTERPROCEDURAL_VIEW
 638         int      rem_view  = get_interprocedural_view();
 639 #endif
 640         int      walk_flag = using_irn_visited(irg);
 641         ir_graph *rem      = current_ir_graph;
 642
 643         current_ir_graph = irg;
 644
 645         if(walk_flag)
 646                 clear_using_irn_visited(current_ir_graph);
 647
 648         for (i = get_irp_n_irgs() - 1; i >= 0; --i)
 649                 ird_set_irg_link(get_irp_irg(i), NULL);
 650
 651         ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
 652
 653 #ifdef INTERPROCEDURAL_VIEW
 654         /* Collect also EndReg and EndExcept. We do not want to change the walker. */
 655         set_interprocedural_view(0);
 656 #endif
 657
 658         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
 659         irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
 660         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
 661         irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
 662
 663 #ifdef INTERPROCEDURAL_VIEW
 664         set_interprocedural_view(rem_view);
 665 #endif
 666
 667         if(walk_flag)
 668                 set_using_irn_visited(current_ir_graph);
 669
 670         current_ir_graph = rem;
 671         return ird_get_irg_link(irg);
 672 }
 673
 674 typedef struct _list_tuple {
 675         ir_node **blk_list;
 676         ir_extblk **extbb_list;
 677 } list_tuple;
 678
 679 /** Construct lists to walk IR extended block-wise.
 680  * Free the lists in the tuple with DEL_ARR_F().
 681  * Sets the irg link field to NULL in all
 682  * graphs not visited.
 683  */
 684 static list_tuple *construct_extblock_lists(ir_graph *irg) {
 685         ir_node **blk_list = construct_block_lists(irg);
 686         int i;
 687         ir_graph *rem = current_ir_graph;
 688         list_tuple *lists = xmalloc(sizeof(*lists));
 689
 690         current_ir_graph = irg;
 691
 692         lists->blk_list   = NEW_ARR_F(ir_node *, 0);
 693         lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
 694
 695         inc_irg_block_visited(irg);
 696         for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
 697                 ir_extblk *ext;
 698
 699                 if (is_Block(blk_list[i])) {
 700                         ext = get_Block_extbb(blk_list[i]);
 701
 702                         if (extbb_not_visited(ext)) {
 703                                 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
 704                                 mark_extbb_visited(ext);
 705                         }
 706                 } else
 707                         ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
 708         }
 709         DEL_ARR_F(blk_list);
 710
 711         current_ir_graph = rem;
 712         ird_set_irg_link(irg, lists);
 713         return lists;
 714 }
 715
 716 /*-----------------------------------------------------------------*/
 717 /* Routines to dump information about a single ir node.            */
 718 /*-----------------------------------------------------------------*/
 719
 720 /*
 721  * dump the name of a node n to the File F.
 722  */
 723 int dump_node_opcode(FILE *F, ir_node *n)
 724 {
 725         int bad = 0;
 726         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 727
 728         /* call the dump_node operation if available */
 729         if (ops->dump_node)
 730                 return ops->dump_node(n, F, dump_node_opcode_txt);
 731
 732         /* implementation for default nodes */
 733         switch (get_irn_opcode(n)) {
 734
 735         case iro_Const: {
 736                 int res;
 737                 char buf[1024];
 738                 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
 739                 assert(res < (int) sizeof(buf) && "buffer to small for tarval_snprintf");
 740                 fprintf(F, buf);
 741         } break;
 742
 743         case iro_SymConst: {
 744                 switch (get_SymConst_kind(n)) {
 745                 case symconst_addr_name:
 746                         /* don't use get_SymConst_ptr_info as it mangles the name. */
 747                         fprintf(F, "SymC %s", get_id_str(get_SymConst_name(n)));
 748                         break;
 749                 case symconst_addr_ent:
 750                         fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
 751                         break;
 752                 case symconst_ofs_ent:
 753                         fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
 754                         break;
 755                 case symconst_type_tag:
 756                         fprintf(F, "SymC %s tag", get_type_name_ex(get_SymConst_type(n), &bad));
 757                         break;
 758                 case symconst_type_size:
 759                         fprintf(F, "SymC %s size", get_type_name_ex(get_SymConst_type(n), &bad));
 760                         break;
 761                 case symconst_type_align:
 762                         fprintf(F, "SymC %s align", get_type_name_ex(get_SymConst_type(n), &bad));
 763                         break;
 764                 case symconst_enum_const:
 765                         fprintf(F, "SymC %s enum", get_enumeration_name(get_SymConst_enum(n)));
 766                         break;
 767                 case symconst_label:
 768                         fprintf(F, "SymC %lu label", get_SymConst_label(n));
 769                         break;
 770                 }
 771         } break;
 772
 773         case iro_Filter: {
 774                 if (!get_interprocedural_view())
 775                         fprintf(F, "Proj'");
 776                 else
 777                         goto default_case;
 778         } break;
 779
 780         case iro_Proj: {
 781                 ir_node *pred = get_Proj_pred(n);
 782
 783                 if (get_irn_opcode(pred) == iro_Cond
 784                         && get_Proj_proj(n) == get_Cond_defaultProj(pred)
 785                         && get_irn_mode(get_Cond_selector(pred)) != mode_b)
 786                         fprintf(F, "defProj");
 787                 else
 788                         goto default_case;
 789         } break;
 790         case iro_Start:
 791         case iro_End:
 792         case iro_EndExcept:
 793         case iro_EndReg: {
 794                 if (get_interprocedural_view()) {
 795                         fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
 796                         break;
 797                 } else
 798                         goto default_case;
 799         }
 800         case iro_CallBegin: {
 801                 ir_node *addr = get_CallBegin_ptr(n);
 802                 ir_entity *ent = NULL;
 803                 if (get_irn_op(addr) == op_Sel)
 804                         ent = get_Sel_entity(addr);
 805                 else if (is_Global(addr))
 806                         ent = get_Global_entity(addr);
 807                 fprintf(F, "%s", get_irn_opname(n));
 808                 if (ent) fprintf(F, " %s", get_entity_name(ent));
 809                 break;
 810         }
 811         case iro_Load:
 812                 if (get_Load_align(n) == align_non_aligned)
 813                         fprintf(F, "ua");
 814                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
 815                 break;
 816         case iro_Store:
 817                 if (get_Store_align(n) == align_non_aligned)
 818                         fprintf(F, "ua");
 819                 fprintf(F, "%s", get_irn_opname(n));
 820                 break;
 821         case iro_Block:
 822                 fprintf(F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
 823                 break;
 824         case iro_Conv:
 825                 if (get_Conv_strict(n))
 826                         fprintf(F, "strict");
 827                 fprintf(F, "%s", get_irn_opname(n));
 828                 break;
 829         case iro_Div:
 830                 fprintf(F, "%s", get_irn_opname(n));
 831                 if (is_Div_remainderless(n))
 832                         fprintf(F, "RL");
 833                 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), &bad));
 834                 break;
 835         case iro_Mod:
 836                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), &bad));
 837                 break;
 838         case iro_DivMod:
 839                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_DivMod_resmode(n), &bad));
 840                 break;
 841
 842         default:
 843 default_case:
 844                 fprintf(F, "%s", get_irn_opname(n));
 845
 846         }  /* end switch */
 847         return bad;
 848 }
 849
 850 /**
 851  * Dump the mode of a node n to a file F.
 852  * Ignore modes that are "always known".
 853  */
 854 static int dump_node_mode(FILE *F, ir_node *n)
 855 {
 856         int bad = 0;
 857         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 858         ir_opcode iro;
 859
 860         /* call the dump_node operation if available */
 861         if (ops->dump_node)
 862                 return ops->dump_node(n, F, dump_node_mode_txt);
 863
 864         /* default implementation */
 865         iro = get_irn_opcode(n);
 866         switch (iro) {
 867         case iro_SymConst:
 868         case iro_Sel:
 869         case iro_End:
 870         case iro_Return:
 871         case iro_Free:
 872         case iro_Sync:
 873         case iro_Jmp:
 874         case iro_NoMem:
 875                 break;
 876         default: {
 877                 ir_mode *mode = get_irn_mode(n);
 878
 879                 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
 880                         (mode != mode_T || iro == iro_Proj))
 881                         fprintf(F, "%s", get_mode_name_ex(mode, &bad));
 882         }
 883         }
 884
 885         return bad;
 886 }
 887
 888 /**
 889  * Dump the type of a node n to a file F if it's known.
 890  */
 891 static int dump_node_typeinfo(FILE *F, ir_node *n) {
 892         int bad = 0;
 893
 894         if (opt_dump_analysed_type_info) {
 895                 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent  ||
 896                         get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
 897                         ir_type *tp = get_irn_typeinfo_type(n);
 898                         if (tp != firm_none_type)
 899                                 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
 900                         else
 901                                 fprintf(F, "[] ");
 902                 }
 903         }
 904         return bad;
 905 }
 906
 907 typedef struct _pns_lookup {
 908         long       nr;      /**< the proj number */
 909         const char *name;   /**< the name of the Proj */
 910 } pns_lookup_t;
 911
 912 typedef struct _proj_lookup {
 913         ir_opcode          code;      /**< the opcode of the Proj predecessor */
 914         unsigned           num_data;  /**< number of data entries */
 915         const pns_lookup_t *data;     /**< the data */
 916 } proj_lookup_t;
 917
 918 #define ARR_SIZE(a)       (sizeof(a)/sizeof(a[0]))
 919
 920 /** the lookup table for Proj(Start) names */
 921 static const pns_lookup_t start_lut[] = {
 922 #define X(a)    { pn_Start_##a, #a }
 923         X(X_initial_exec),
 924         X(P_frame_base),
 925         X(P_tls),
 926         X(T_args),
 927         X(P_value_arg_base)
 928 #undef X
 929 };
 930
 931 /** the lookup table for Proj(Cond) names */
 932 static const pns_lookup_t cond_lut[] = {
 933 #define X(a)    { pn_Cond_##a, #a }
 934         X(false),
 935         X(true)
 936 #undef X
 937 };
 938
 939 /** the lookup table for Proj(Call) names */
 940 static const pns_lookup_t call_lut[] = {
 941 #define X(a)    { pn_Call_##a, #a }
 942         X(M_regular),
 943         X(X_regular),
 944         X(X_except),
 945         X(T_result),
 946         X(M_except),
 947         X(P_value_res_base)
 948 #undef X
 949 };
 950
 951 /** the lookup table for Proj(Quot) names */
 952 static const pns_lookup_t quot_lut[] = {
 953 #define X(a)    { pn_Quot_##a, #a }
 954         X(M),
 955         X(X_regular),
 956         X(X_except),
 957         X(res)
 958 #undef X
 959 };
 960
 961 /** the lookup table for Proj(DivMod) names */
 962 static const pns_lookup_t divmod_lut[] = {
 963 #define X(a)    { pn_DivMod_##a, #a }
 964         X(M),
 965         X(X_regular),
 966         X(X_except),
 967         X(res_div),
 968         X(res_mod)
 969 #undef X
 970 };
 971
 972 /** the lookup table for Proj(Div) names */
 973 static const pns_lookup_t div_lut[] = {
 974 #define X(a)    { pn_Div_##a, #a }
 975         X(M),
 976         X(X_regular),
 977         X(X_except),
 978         X(res)
 979 #undef X
 980 };
 981
 982 /** the lookup table for Proj(Mod) names */
 983 static const pns_lookup_t mod_lut[] = {
 984 #define X(a)    { pn_Mod_##a, #a }
 985         X(M),
 986         X(X_regular),
 987         X(X_except),
 988         X(res)
 989 #undef X
 990 };
 991
 992 /** the lookup table for Proj(Load) names */
 993 static const pns_lookup_t load_lut[] = {
 994 #define X(a)    { pn_Load_##a, #a }
 995         X(M),
 996         X(X_regular),
 997         X(X_except),
 998         X(res)
 999 #undef X
1000 };
1001
1002 /** the lookup table for Proj(Store) names */
1003 static const pns_lookup_t store_lut[] = {
1004 #define X(a)    { pn_Store_##a, #a }
1005         X(M),
1006         X(X_regular),
1007         X(X_except)
1008 #undef X
1009 };
1010
1011 /** the lookup table for Proj(Alloc) names */
1012 static const pns_lookup_t alloc_lut[] = {
1013 #define X(a)    { pn_Alloc_##a, #a }
1014         X(M),
1015         X(X_regular),
1016         X(X_except),
1017         X(res)
1018 #undef X
1019 };
1020
1021 /** the lookup table for Proj(CopyB) names */
1022 static const pns_lookup_t copyb_lut[] = {
1023 #define X(a)    { pn_CopyB_##a, #a }
1024         X(M),
1025         X(X_regular),
1026         X(X_except),
1027         X(M_except)
1028 #undef X
1029 };
1030
1031 /** the lookup table for Proj(InstOf) names */
1032 static const pns_lookup_t instof_lut[] = {
1033 #define X(a)    { pn_InstOf_##a, #a }
1034         X(M),
1035         X(X_regular),
1036         X(X_except),
1037         X(res),
1038         X(M_except),
1039 #undef X
1040 };
1041
1042 /** the lookup table for Proj(Raise) names */
1043 static const pns_lookup_t raise_lut[] = {
1044 #define X(a)    { pn_Raise_##a, #a }
1045         X(M),
1046         X(X),
1047 #undef X
1048 };
1049
1050 /** the lookup table for Proj(Bound) names */
1051 static const pns_lookup_t bound_lut[] = {
1052 #define X(a)    { pn_Bound_##a, #a }
1053         X(M),
1054         X(X_regular),
1055         X(X_except),
1056         X(res),
1057 #undef X
1058 };
1059
1060 /** the Proj lookup table */
1061 static const proj_lookup_t proj_lut[] = {
1062 #define E(a)  ARR_SIZE(a), a
1063         { iro_Start,   E(start_lut) },
1064         { iro_Cond,    E(cond_lut) },
1065         { iro_Call,    E(call_lut) },
1066         { iro_Quot,    E(quot_lut) },
1067         { iro_DivMod,  E(divmod_lut) },
1068         { iro_Div,     E(div_lut) },
1069         { iro_Mod,     E(mod_lut) },
1070         { iro_Load,    E(load_lut) },
1071         { iro_Store,   E(store_lut) },
1072         { iro_Alloc,   E(alloc_lut) },
1073         { iro_CopyB,   E(copyb_lut) },
1074         { iro_InstOf,  E(instof_lut) },
1075         { iro_Raise,   E(raise_lut) },
1076         { iro_Bound,   E(bound_lut) }
1077 #undef E
1078 };
1079
1080 /**
1081  * Dump additional node attributes of some nodes to a file F.
1082  */
1083 static int
1084 dump_node_nodeattr(FILE *F, ir_node *n)
1085 {
1086         int bad = 0;
1087         ir_node *pred;
1088         ir_opcode code;
1089         long proj_nr;
1090         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1091
1092         /* call the dump_node operation if available */
1093         if (ops->dump_node)
1094                 return ops->dump_node(n, F, dump_node_nodeattr_txt);
1095
1096         switch (get_irn_opcode(n)) {
1097         case iro_Start:
1098                 if (0 && get_interprocedural_view()) {
1099                         fprintf(F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
1100                 }
1101                 break;
1102
1103         case iro_Proj:
1104                 pred    = get_Proj_pred(n);
1105                 proj_nr = get_Proj_proj(n);
1106 handle_lut:
1107                 code    = get_irn_opcode(pred);
1108
1109                 if (code == iro_Cmp)
1110                         fprintf(F, "%s ", get_pnc_string(get_Proj_proj(n)));
1111                 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1112                         fprintf(F, "Arg %ld ", proj_nr);
1113                 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1114                         fprintf(F, "%ld ", proj_nr);
1115                 else {
1116                         unsigned i, j, f = 0;
1117
1118                         for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1119                                 if (code == proj_lut[i].code) {
1120                                         for (j = 0; j < proj_lut[i].num_data; ++j) {
1121                                                 if (proj_nr == proj_lut[i].data[j].nr) {
1122                                                         fprintf(F, "%s ", proj_lut[i].data[j].name);
1123                                                         f = 1;
1124                                                         break;
1125                                                 }
1126                                         }
1127                                         break;
1128                                 }
1129                         }
1130                         if (! f)
1131                                 fprintf(F, "%ld ", proj_nr);
1132                         if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1133                                 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1134                                         fprintf(F, "PRED ");
1135                                 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1136                                         fprintf(F, "PRED ");
1137                         }
1138                 }
1139                 break;
1140         case iro_Filter:
1141                 proj_nr = get_Filter_proj(n);
1142                 if (! get_interprocedural_view()) {
1143                         /* it's a Proj' */
1144                         pred    = get_Filter_pred(n);
1145                         goto handle_lut;
1146                 } else
1147                         fprintf(F, "%ld ", proj_nr);
1148                 break;
1149         case iro_Sel:
1150                 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1151                 break;
1152         case iro_Cast:
1153                 fprintf(F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1154                 break;
1155         case iro_Confirm:
1156                 fprintf(F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1157                 break;
1158         case iro_CopyB:
1159                 fprintf(F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1160                 break;
1161
1162         default:
1163                 ;
1164         } /* end switch */
1165
1166         return bad;
1167 }
1168
1169 #include <math.h>
1170 #include "execution_frequency.h"
1171
1172 static void dump_node_ana_vals(FILE *F, ir_node *n) {
1173         (void) F;
1174         (void) n;
1175         return;
1176 #ifdef INTERPROCEDURAL_VIEW
1177         fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1178                 get_irn_exec_freq(n),
1179                 get_irg_method_execution_frequency(get_irn_irg(n)),
1180                 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1181                 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1182         );
1183 #endif
1184 }
1185
1186
1187 /* Dumps a node label without the enclosing ". */
1188 int dump_node_label(FILE *F, ir_node *n) {
1189         int bad = 0;
1190
1191         bad |= dump_node_opcode(F, n);
1192         bad |= dump_node_mode(F, n);
1193         fprintf(F, " ");
1194         bad |= dump_node_typeinfo(F, n);
1195         bad |= dump_node_nodeattr(F, n);
1196         if(dump_node_idx_labels) {
1197                 fprintf(F, "%ld:%d", get_irn_node_nr(n), get_irn_idx(n));
1198         } else {
1199                 fprintf(F, "%ld", get_irn_node_nr(n));
1200         }
1201
1202         return bad;
1203 }
1204
1205 /**
1206  * Dumps the attributes of a node n into the file F.
1207  * Currently this is only the color of a node.
1208  */
1209 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1210 {
1211         ir_mode *mode;
1212         ir_node *n;
1213
1214         if (bad) {
1215                 print_vcg_color(F, ird_color_error);
1216                 return;
1217         }
1218
1219         if (dump_node_vcgattr_hook)
1220                 if (dump_node_vcgattr_hook(F, node, local))
1221                         return;
1222
1223         n = local ? local : node;
1224
1225         if (overrule_nodecolor != ird_color_default_node) {
1226                 print_vcg_color(F, overrule_nodecolor);
1227                 return;
1228         }
1229
1230         mode = get_irn_mode(node);
1231         if(mode == mode_M) {
1232                 print_vcg_color(F, ird_color_memory);
1233                 return;
1234         }
1235         if(mode == mode_X) {
1236                 print_vcg_color(F, ird_color_controlflow);
1237                 return;
1238         }
1239
1240         switch (get_irn_opcode(n)) {
1241         case iro_Start:
1242         case iro_EndReg:
1243         case iro_EndExcept:
1244         case iro_End:
1245                 print_vcg_color(F, ird_color_anchor);
1246                 break;
1247         case iro_Bad:
1248                 print_vcg_color(F, ird_color_error);
1249                 break;
1250         case iro_Block:
1251                 if (is_Block_dead(n))
1252                         print_vcg_color(F, ird_color_dead_block_background);
1253                 else
1254                         print_vcg_color(F, ird_color_block_background);
1255                 break;
1256         case iro_Phi:
1257                 print_vcg_color(F, ird_color_phi);
1258                 break;
1259         case iro_Pin:
1260                 print_vcg_color(F, ird_color_memory);
1261                 break;
1262         case iro_SymConst:
1263         case iro_Const:
1264                 print_vcg_color(F, ird_color_const);
1265                 break;
1266         case iro_Proj:
1267                 print_vcg_color(F, ird_color_proj);
1268                 break;
1269         default: {
1270                 ir_op *op = get_irn_op(node);
1271
1272                 if(is_op_constlike(op)) {
1273                         print_vcg_color(F, ird_color_const);
1274                 } else if(is_op_uses_memory(op)) {
1275                         print_vcg_color(F, ird_color_uses_memory);
1276                 } else if(is_op_cfopcode(op) || is_op_forking(op)) {
1277                         print_vcg_color(F, ird_color_controlflow);
1278                 } else {
1279                         PRINT_DEFAULT_NODE_ATTR;
1280                 }
1281         }
1282         }
1283 }
1284
1285 /* Adds a new node info dumper callback. */
1286 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1287 {
1288         hook_entry_t *info = xmalloc(sizeof(*info));
1289
1290         info->hook._hook_node_info = cb;
1291         info->context              = data;
1292         register_hook(hook_node_info, info);
1293
1294         return info;
1295 }
1296
1297 /* Remove a previously added info dumper callback. */
1298 void dump_remv_node_info_callback(void *handle)
1299 {
1300         hook_entry_t *info = handle;
1301         unregister_hook(hook_node_info, info);
1302         xfree(info);
1303 }
1304
1305 /**
1306  * Dump the node information of a node n to a file F.
1307  */
1308 static INLINE int dump_node_info(FILE *F, ir_node *n)
1309 {
1310         int bad = 0;
1311         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1312
1313         fprintf(F, " info1: \"");
1314         bad = dump_irnode_to_file(F, n);
1315         /* call the dump_node operation if available */
1316         if (ops->dump_node)
1317                 bad = ops->dump_node(n, F, dump_node_info_txt);
1318
1319         /* allow additional info to be added */
1320         hook_node_info(F, n);
1321         fprintf(F, "\"\n");
1322
1323         return bad;
1324 }
1325
1326 static INLINE int is_constlike_node(const ir_node *node)
1327 {
1328         const ir_op *op = get_irn_op(node);
1329         return is_op_constlike(op);
1330 }
1331
1332
1333 /** outputs the predecessors of n, that are constants, local.  I.e.,
1334    generates a copy of the constant predecessors for each node called with. */
1335 static void dump_const_node_local(FILE *F, ir_node *n) {
1336         int i;
1337         if (!get_opt_dump_const_local()) return;
1338
1339         /* Use visited flag to avoid outputting nodes twice.
1340         initialize it first. */
1341         for (i = 0; i < get_irn_arity(n); i++) {
1342                 ir_node *con = get_irn_n(n, i);
1343                 if (is_constlike_node(con)) {
1344                         set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1345                 }
1346         }
1347
1348         for (i = 0; i < get_irn_arity(n); i++) {
1349                 ir_node *con = get_irn_n(n, i);
1350                 if (is_constlike_node(con) && irn_not_visited(con)) {
1351                         int bad = 0;
1352
1353                         mark_irn_visited(con);
1354                         /* Generate a new name for the node by appending the names of
1355                         n and const. */
1356                         fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1357                         fprintf(F, " label: \"");
1358                         bad |= dump_node_label(F, con);
1359                         fprintf(F, "\" ");
1360                         bad |= dump_node_info(F, con);
1361                         dump_node_vcgattr(F, n, con, bad);
1362                         fprintf(F, "}\n");
1363                 }
1364         }
1365 }
1366
1367 /** If the block of an edge is a const_like node, dump it local with an edge */
1368 static void dump_const_block_local(FILE *F, ir_node *n) {
1369         ir_node *blk;
1370
1371         if (!get_opt_dump_const_local()) return;
1372
1373         blk = get_nodes_block(n);
1374         if (is_constlike_node(blk)) {
1375                 int bad = 0;
1376
1377                 /* Generate a new name for the node by appending the names of
1378                 n and blk. */
1379                 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1380                 fprintf(F, "\" label: \"");
1381                 bad |= dump_node_label(F, blk);
1382                 fprintf(F, "\" ");
1383                 bad |= dump_node_info(F, blk);
1384                 dump_node_vcgattr(F, n, blk, bad);
1385                 fprintf(F, "}\n");
1386
1387                 fprintf(F, "edge: { sourcename: \"");
1388                 PRINT_NODEID(n);
1389                 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1390
1391                 if (dump_edge_vcgattr_hook) {
1392                         fprintf(F, "\" ");
1393                         if (dump_edge_vcgattr_hook(F, n, -1)) {
1394                                 fprintf(F, "}\n");
1395                                 return;
1396                         } else {
1397                                 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1398                                 return;
1399                         }
1400                 }
1401
1402                 fprintf(F, "\" "   BLOCK_EDGE_ATTR "}\n");
1403         }
1404 }
1405
1406 /**
1407  * prints the error message of a node to a file F as info2.
1408  */
1409 static void print_node_error(FILE *F, const char *err_msg)
1410 {
1411         if (! err_msg)
1412                 return;
1413
1414         fprintf(F, " info2: \"%s\"", err_msg);
1415 }
1416
1417 /**
1418  * prints debug messages of a node to file F as info3.
1419  */
1420 static void print_dbg_info(FILE *F, dbg_info *dbg)
1421 {
1422         char buf[1024];
1423
1424         if (__dbg_info_snprint) {
1425                 buf[0] = '\0';
1426                 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1427                         fprintf(F, " info3: \"%s\"\n", buf);
1428         }
1429 }
1430
1431 /**
1432  * Dump a node
1433  */
1434 static void dump_node(FILE *F, ir_node *n)
1435 {
1436         int bad = 0;
1437         const char *p;
1438
1439         if (get_opt_dump_const_local() && is_constlike_node(n))
1440                 return;
1441
1442         /* dump this node */
1443         fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1444
1445         bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1446         bad |= dump_node_label(F, n);
1447         dump_node_ana_vals(F, n);
1448         //dump_node_ana_info(F, n);
1449         fprintf(F, "\" ");
1450         bad |= dump_node_info(F, n);
1451         print_node_error(F, p);
1452         print_dbg_info(F, get_irn_dbg_info(n));
1453         dump_node_vcgattr(F, n, NULL, bad);
1454         fprintf(F, "}\n");
1455         dump_const_node_local(F, n);
1456
1457         if(dump_node_edge_hook)
1458                 dump_node_edge_hook(F, n);
1459 #if DO_HEAPANALYSIS
1460         dump_irn_chi_term(F, n);
1461         dump_irn_state(F, n);
1462 #endif
1463 }
1464
1465 /** dump the edge to the block this node belongs to */
1466 static void
1467 dump_ir_block_edge(FILE *F, ir_node *n)  {
1468         if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1469         if (is_no_Block(n)) {
1470                 ir_node *block = get_nodes_block(n);
1471
1472                 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1473                         dump_const_block_local(F, n);
1474                 } else {
1475                         fprintf(F, "edge: { sourcename: \"");
1476                         PRINT_NODEID(n);
1477                         fprintf(F, "\" targetname: ");
1478                         fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1479
1480                         if (dump_edge_vcgattr_hook) {
1481                                 fprintf(F, " ");
1482                                 if (dump_edge_vcgattr_hook(F, n, -1)) {
1483                                         fprintf(F, "}\n");
1484                                         return;
1485                                 } else {
1486                                         fprintf(F, " "  BLOCK_EDGE_ATTR "}\n");
1487                                         return;
1488                                 }
1489                         }
1490
1491                         fprintf(F, " "   BLOCK_EDGE_ATTR "}\n");
1492                 }
1493         }
1494 }
1495
1496 static void
1497 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1498         /*
1499          * do not use get_nodes_block() here, will fail
1500          * if the irg is not pinned.
1501          */
1502         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1503                 fprintf(F, INTRA_DATA_EDGE_ATTR);
1504         else
1505                 fprintf(F, INTER_DATA_EDGE_ATTR);
1506 }
1507
1508 static void
1509 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1510         /*
1511          * do not use get_nodes_block() here, will fail
1512          * if the irg is not pinned.
1513          */
1514         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1515                 fprintf(F, INTRA_MEM_EDGE_ATTR);
1516         else
1517                 fprintf(F, INTER_MEM_EDGE_ATTR);
1518 }
1519
1520 /** Print the vcg attributes for the edge from node from to it's to's input */
1521 static void print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1522         assert(from);
1523
1524         if (dump_edge_vcgattr_hook)
1525                 if (dump_edge_vcgattr_hook(F, from, to))
1526                         return;
1527
1528         if (dump_backedge_information_flag && is_backedge(from, to))
1529                 fprintf(F, BACK_EDGE_ATTR);
1530
1531         switch (get_irn_opcode(from)) {
1532         case iro_Block:
1533                 fprintf(F, CF_EDGE_ATTR);
1534                 break;
1535         case iro_Start:  break;
1536         case iro_End:
1537                 if (to >= 0) {
1538                         if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1539                                 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1540                         else
1541                                 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1542                 }
1543                 break;
1544         default:
1545                 if (is_Proj(from)) {
1546                         if (get_irn_mode(from) == mode_M)
1547                                 print_mem_edge_vcgattr(F, from, to);
1548                         else if (get_irn_mode(from) == mode_X)
1549                                 fprintf(F, CF_EDGE_ATTR);
1550                         else
1551                                 print_data_edge_vcgattr(F, from, to);
1552                 }
1553                 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1554                         print_mem_edge_vcgattr(F, from, to);
1555                 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1556                         fprintf(F, CF_EDGE_ATTR);
1557                 else
1558                         print_data_edge_vcgattr(F, from, to);
1559         }
1560 }
1561
1562 /** dump edges to our inputs */
1563 static void dump_ir_data_edges(FILE *F, ir_node *n)  {
1564         int i, num;
1565         unsigned long visited = get_irn_visited(n);
1566
1567         if (!dump_keepalive && is_End(n)) {
1568                 /* the End node has only keep-alive edges */
1569                 return;
1570         }
1571
1572         /* dump the dependency edges. */
1573         num = get_irn_deps(n);
1574         for (i = 0; i < num; ++i) {
1575                 ir_node *dep = get_irn_dep(n, i);
1576
1577                 if (dep) {
1578                         fprintf(F, "edge: {sourcename: \"");
1579                         PRINT_NODEID(n);
1580                         fprintf(F, "\" targetname: ");
1581                         if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1582                                 PRINT_CONSTID(n, dep);
1583                         } else {
1584                                 fprintf(F, "\"");
1585                                 PRINT_NODEID(dep);
1586                                 fprintf(F, "\"");
1587                         }
1588                         fprintf(F, " label: \"%d\" ", i);
1589                         fprintf(F, " color: darkgreen}\n");
1590                 }
1591         }
1592
1593         num = get_irn_arity(n);
1594         for (i = 0; i < num; i++) {
1595                 ir_node *pred = get_irn_n(n, i);
1596                 assert(pred);
1597
1598                 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1599                         continue; /* pred not dumped */
1600
1601                 if (dump_backedge_information_flag && is_backedge(n, i))
1602                         fprintf(F, "backedge: {sourcename: \"");
1603                 else
1604                         fprintf(F, "edge: {sourcename: \"");
1605                 PRINT_NODEID(n);
1606                 fprintf(F, "\" targetname: ");
1607                 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1608                         PRINT_CONSTID(n, pred);
1609                 } else {
1610                         fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1611                 }
1612                 fprintf(F, " label: \"%d\" ", i);
1613                 print_edge_vcgattr(F, n, i);
1614                 fprintf(F, "}\n");
1615         }
1616
1617         if (dump_macro_block_edges && is_Block(n)) {
1618                 ir_node *mb = get_Block_MacroBlock(n);
1619                 fprintf(F, "edge: {sourcename: \"");
1620                 PRINT_NODEID(n);
1621                 fprintf(F, "\" targetname: \"");
1622                 PRINT_NODEID(mb);
1623                 fprintf(F, "\" label: \"mb\" " MACROBLOCK_EDGE_ATTR);
1624                 fprintf(F, "}\n");
1625         }
1626 }
1627
1628 /**
1629  * Dump the ir_edges
1630  */
1631 static void
1632 dump_ir_edges(FILE *F, ir_node *n) {
1633         const ir_edge_t *edge;
1634         int i = 0;
1635
1636         foreach_out_edge(n, edge) {
1637                 ir_node *succ = get_edge_src_irn(edge);
1638
1639                 fprintf(F, "edge: {sourcename: \"");
1640                 PRINT_NODEID(n);
1641                 fprintf(F, "\" targetname: \"");
1642                 PRINT_NODEID(succ);
1643                 fprintf(F, "\"");
1644
1645                 fprintf(F, " label: \"%d\" ", i);
1646                 fprintf(F, OUT_EDGE_ATTR);
1647                 fprintf(F, "}\n");
1648                 ++i;
1649         }
1650 }
1651
1652
1653 /** Dumps a node and its edges but not the block edge  */
1654 static void dump_node_wo_blockedge(ir_node *n, void *env) {
1655         FILE *F = env;
1656         dump_node(F, n);
1657         dump_ir_data_edges(F, n);
1658 }
1659
1660 /** Dumps a node and its edges. */
1661 static void dump_whole_node(ir_node *n, void *env) {
1662         FILE *F = env;
1663         dump_node_wo_blockedge(n, env);
1664         if (!node_floats(n))
1665                 dump_ir_block_edge(F, n);
1666         if (dump_new_edges_flag && edges_activated(current_ir_graph))
1667                 dump_ir_edges(F, n);
1668 }
1669
1670 /** Dumps a const-like node. */
1671 static void dump_const_node(ir_node *n, void *env) {
1672         if (is_Block(n)) return;
1673         dump_node_wo_blockedge(n, env);
1674 }
1675
1676 /***********************************************************************/
1677 /* the following routines dump the nodes/irgs bracketed to graphs.     */
1678 /***********************************************************************/
1679
1680 /** Dumps a constant expression as entity initializer, array bound ...
1681  */
1682 static void dump_const_expression(FILE *F, ir_node *value) {
1683         ir_graph *rem = current_ir_graph;
1684         int rem_dump_const_local = dump_const_local;
1685         dump_const_local = 0;
1686         current_ir_graph = get_const_code_irg();
1687         irg_walk(value, dump_const_node, NULL, F);
1688         /* Decrease visited flag so that we walk with the same flag for the next
1689            expression.  This guarantees that we don't dump the same node twice,
1690            as for const expressions cse is performed to save memory. */
1691         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1692         current_ir_graph = rem;
1693         dump_const_local = rem_dump_const_local;
1694 }
1695
1696 /** Dump a block as graph containing its nodes.
1697  *
1698  *  Expects to find nodes belonging to the block as list in its
1699  *  link field.
1700  *  Dumps the edges of all nodes including itself. */
1701 static void dump_whole_block(FILE *F, ir_node *block) {
1702         ir_node *node;
1703         ird_color_t color = ird_color_block_background;
1704
1705         assert(is_Block(block));
1706
1707         fprintf(F, "graph: { title: \"");
1708         PRINT_NODEID(block);
1709         fprintf(F, "\"  label: \"");
1710         dump_node_label(F, block);
1711 #if DO_HEAPANALYSIS
1712         if (get_opt_dump_abstvals())
1713                 fprintf(F, " seqno: %d", (int)get_Block_seqno(block));
1714 #endif
1715
1716         /* colorize blocks */
1717         if (! get_Block_matured(block))
1718                 color = ird_color_block_background;
1719         if (is_Block_dead(block))
1720                 color = ird_color_dead_block_background;
1721
1722         fprintf(F, "\" status:clustered ");
1723         print_vcg_color(F, color);
1724         fprintf(F, "\n");
1725
1726         /* yComp can show attributes for blocks, XVCG parses but ignores them */
1727         dump_node_info(F, block);
1728         print_dbg_info(F, get_irn_dbg_info(block));
1729
1730         /* dump the blocks edges */
1731         dump_ir_data_edges(F, block);
1732
1733         if (dump_block_edge_hook)
1734                 dump_block_edge_hook(F, block);
1735
1736         /* dump the nodes that go into the block */
1737         for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1738                 dump_node(F, node);
1739                 dump_ir_data_edges(F, node);
1740         }
1741
1742         /* Close the vcg information for the block */
1743         fprintf(F, "}\n");
1744         dump_const_node_local(F, block);
1745 #if DO_HEAPANALYSIS
1746         dump_irn_chi_term(F, block);
1747 #endif
1748         fprintf(F, "\n");
1749 }
1750
1751 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1752  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1753 static void
1754 dump_block_graph(FILE *F, ir_graph *irg) {
1755         int i;
1756         ir_graph *rem = current_ir_graph;
1757         ir_node **arr = ird_get_irg_link(irg);
1758         current_ir_graph = irg;
1759
1760         for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1761                 ir_node * node = arr[i];
1762                 if (is_Block(node)) {
1763                 /* Dumps the block and all the nodes in the block, which are to
1764                         be found in Block->link. */
1765                         dump_whole_block(F, node);
1766                 } else {
1767                         /* Nodes that are not in a Block. */
1768                         dump_node(F, node);
1769                         if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1770                                 dump_const_block_local(F, node);
1771                         }
1772                         dump_ir_data_edges(F, node);
1773                 }
1774                 if (dump_new_edges_flag && edges_activated(irg))
1775                         dump_ir_edges(F, node);
1776         }
1777
1778         if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1779                 dump_loop_nodes_into_graph(F, irg);
1780
1781         current_ir_graph = rem;
1782 }
1783
1784 /**
1785  * Dump the info for an irg.
1786  * Parsed by XVCG but not shown. use yComp.
1787  */
1788 static void dump_graph_info(FILE *F, ir_graph *irg) {
1789         fprintf(F, "info1: \"");
1790         dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1791         fprintf(F, "\"\n");
1792 }
1793
1794 /** Dumps an irg as a graph clustered by block nodes.
1795  *  If interprocedural view edges can point to nodes out of this graph.
1796  */
1797 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1798         ir_entity *ent = get_irg_entity(irg);
1799
1800         fprintf(F, "graph: { title: \"");
1801         PRINT_IRGID(irg);
1802         fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1803           get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1804
1805         dump_graph_info(F, irg);
1806         print_dbg_info(F, get_entity_dbg_info(ent));
1807
1808         dump_block_graph(F, irg);
1809
1810         /* Close the vcg information for the irg */
1811         fprintf(F, "}\n\n");
1812 }
1813
1814 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1815  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1816 static void
1817 dump_extblock_graph(FILE *F, ir_graph *irg) {
1818         int i;
1819         ir_graph *rem = current_ir_graph;
1820         ir_extblk **arr = ird_get_irg_link(irg);
1821         current_ir_graph = irg;
1822
1823         for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1824                 ir_extblk *extbb = arr[i];
1825                 ir_node *leader = get_extbb_leader(extbb);
1826                 int j;
1827
1828                 fprintf(F, "graph: { title: \"");
1829                 PRINT_EXTBBID(leader);
1830                 fprintf(F, "\"  label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1831                         get_irn_node_nr(leader));
1832
1833                 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1834                         ir_node * node = extbb->blks[j];
1835                         if (is_Block(node)) {
1836                         /* Dumps the block and all the nodes in the block, which are to
1837                                 be found in Block->link. */
1838                                 dump_whole_block(F, node);
1839                         } else {
1840                                 /* Nodes that are not in a Block. */
1841                                 dump_node(F, node);
1842                                 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1843                                         dump_const_block_local(F, node);
1844                                 }
1845                                 dump_ir_data_edges(F, node);
1846                         }
1847                 }
1848                 fprintf(F, "}\n");
1849         }
1850
1851         if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1852                 dump_loop_nodes_into_graph(F, irg);
1853
1854         current_ir_graph = rem;
1855         free_extbb(irg);
1856 }
1857
1858
1859 /*******************************************************************/
1860 /* Basic type and entity nodes and edges.                          */
1861 /*******************************************************************/
1862
1863 /** dumps the edges between nodes and their type or entity attributes. */
1864 static void dump_node2type_edges(ir_node *n, void *env)
1865 {
1866         FILE *F = env;
1867         assert(n);
1868
1869         switch (get_irn_opcode(n)) {
1870         case iro_Const :
1871                 /* @@@ some consts have an entity */
1872                 break;
1873         case iro_SymConst:
1874                 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1875                         print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1876                 break;
1877         case iro_Sel:
1878                 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1879                 break;
1880         case iro_Call:
1881                 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1882                 break;
1883         case iro_Alloc:
1884                 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1885                 break;
1886         case iro_Free:
1887                 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1888                 break;
1889         case iro_Cast:
1890                 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1891                 break;
1892         default:
1893                 break;
1894         }
1895 }
1896
1897 #if 0
1898 static int print_type_info(FILE *F, ir_type *tp) {
1899         int bad = 0;
1900
1901         if (get_type_state(tp) == layout_undefined) {
1902                 fprintf(F, "state: layout_undefined\n");
1903         } else {
1904                 fprintf(F, "state: layout_fixed,\n");
1905         }
1906         if (get_type_mode(tp))
1907                 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1908         fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1909
1910         return bad;
1911 }
1912
1913 static void print_typespecific_info(FILE *F, ir_type *tp) {
1914         switch (get_type_tpop_code(tp)) {
1915         case tpo_class:
1916                 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1917                 break;
1918         case tpo_struct:
1919                 break;
1920         case tpo_method:
1921                 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1922                 fprintf(F, "params: %d\n", get_method_n_params(tp));
1923                 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1924                 break;
1925         case tpo_union:
1926                 break;
1927         case tpo_array:
1928                 break;
1929         case tpo_enumeration:
1930                 break;
1931         case tpo_pointer:
1932                 break;
1933         case tpo_primitive:
1934                 break;
1935         default:
1936                 break;
1937         } /* switch type */
1938 }
1939 #endif
1940
1941 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1942         switch (get_type_tpop_code(tp)) {
1943         case tpo_class:
1944                 if (peculiarity_existent == get_class_peculiarity(tp))
1945                         fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1946                 else
1947                         fprintf(F, " " TYPE_DESCRIPTION_NODE_ATTR);
1948                 break;
1949         case tpo_struct:
1950                 fprintf(F, " " TYPE_METH_NODE_ATTR);
1951                 break;
1952         case tpo_method:
1953                 break;
1954         case tpo_union:
1955                 break;
1956         case tpo_array:
1957                 break;
1958         case tpo_enumeration:
1959                 break;
1960         case tpo_pointer:
1961                 break;
1962         case tpo_primitive:
1963                 break;
1964         default:
1965                 break;
1966         } /* switch type */
1967 }
1968
1969
1970 int dump_type_node(FILE *F, ir_type *tp)
1971 {
1972         int bad = 0;
1973
1974         fprintf(F, "node: {title: ");
1975         PRINT_TYPEID(tp);
1976         fprintf(F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1977         fprintf(F, " info1: \"");
1978 #if 0
1979         bad |= print_type_info(F, tp);
1980         print_typespecific_info(F, tp);
1981 #else
1982         dump_type_to_file(F, tp, dump_verbosity_max);
1983 #endif
1984         fprintf(F, "\"\n");
1985         print_dbg_info(F, get_type_dbg_info(tp));
1986         print_typespecific_vcgattr(F, tp);
1987         fprintf(F, "}\n");
1988
1989         return bad;
1990 }
1991
1992
1993 void dump_entity_node(FILE *F, ir_entity *ent, int color)
1994 {
1995         fprintf(F, "node: {title: \"");
1996         PRINT_ENTID(ent); fprintf(F, "\"");
1997         fprintf(F, DEFAULT_TYPE_ATTRIBUTE);
1998         fprintf(F, "label: ");
1999         fprintf(F, "\"ent %s\" ", get_ent_dump_name(ent));
2000         if (color)
2001                 fprintf(F, "color:%d", color);
2002         else
2003                 fprintf(F, ENTITY_NODE_ATTR);
2004         fprintf(F, "\n info1: \"");
2005
2006         dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
2007
2008         fprintf(F, "\"\n");
2009         print_dbg_info(F, get_entity_dbg_info(ent));
2010         fprintf(F, "}\n");
2011 }
2012
2013 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
2014 {
2015         char buf[1024];
2016         ir_enum_const *ec = get_enumeration_const(tp, pos);
2017         ident         *id = get_enumeration_nameid(ec);
2018         tarval        *tv = get_enumeration_value(ec);
2019
2020         if (tv)
2021                 tarval_snprintf(buf, sizeof(buf), tv);
2022         else
2023                 strncpy(buf, "<not set>", sizeof(buf));
2024         fprintf(F, "node: {title: \"");
2025         PRINT_ITEMID(tp, pos); fprintf(F, "\"");
2026         fprintf(F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
2027         fprintf(F, "label: ");
2028         fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
2029         fprintf(F, "\n info1: \"value: %s\"}\n", buf);
2030 }
2031
2032 /* dumps a type or entity and it's edges. */
2033 static void
2034 dump_type_info(type_or_ent *tore, void *env) {
2035         FILE *F = env;
2036         int i = 0;  /* to shutup gcc */
2037
2038         /* dump this type or entity */
2039
2040         switch (get_kind(tore)) {
2041         case k_entity: {
2042                 ir_entity *ent = (ir_entity *)tore;
2043                 ir_node *value;
2044                 /* The node */
2045                 dump_entity_node(F, ent, 0);
2046                 /* The Edges */
2047                 /* skip this to reduce graph.  Member edge of type is parallel to this edge. *
2048                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2049                 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
2050                 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
2051                 if (is_Class_type(get_entity_owner(ent))) {
2052                         for(i = 0; i < get_entity_n_overwrites(ent); i++)
2053                                 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
2054                 }
2055                 /* attached subgraphs */
2056                 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
2057                         if (is_atomic_entity(ent)) {
2058                                 value = get_atomic_ent_value(ent);
2059                                 if (value) {
2060                                         print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2061                                         /* DDMN(value);  $$$ */
2062                                         dump_const_expression(F, value);
2063                                 }
2064                         }
2065                         if (is_compound_entity(ent)) {
2066                                 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
2067                                         value = get_compound_ent_value(ent, i);
2068                                         if (value) {
2069                                                 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2070                                                 dump_const_expression(F, value);
2071                                                 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
2072                                                 /*
2073                                                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2074                                                 ENT_CORR_EDGE_ATTR  "}\n", GET_ENTID(ent),
2075                                                 get_compound_ent_value_member(ent, i), i);
2076                                                 */
2077                                         }
2078                                 }
2079                         }
2080                 }
2081                 break;
2082         }
2083         case k_type: {
2084                 ir_type *tp = (ir_type *)tore;
2085                 dump_type_node(F, tp);
2086                 /* and now the edges */
2087                 switch (get_type_tpop_code(tp)) {
2088                 case tpo_class:
2089                         for (i=0; i < get_class_n_supertypes(tp); i++)
2090                                 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2091                         for (i=0; i < get_class_n_members(tp); i++)
2092                                 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2093                         break;
2094                 case tpo_struct:
2095                         for (i=0; i < get_struct_n_members(tp); i++)
2096                                 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2097                         break;
2098                 case tpo_method:
2099                         for (i = 0; i < get_method_n_params(tp); i++)
2100                                 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
2101                         for (i = 0; i < get_method_n_ress(tp); i++)
2102                                 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
2103                         break;
2104                 case tpo_union:
2105                         for (i = 0; i < get_union_n_members(tp); i++)
2106                                 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
2107                         break;
2108                 case tpo_array:
2109                         print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
2110                         print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
2111                         for (i = 0; i < get_array_n_dimensions(tp); i++) {
2112                                 ir_node *upper = get_array_upper_bound(tp, i);
2113                                 ir_node *lower = get_array_lower_bound(tp, i);
2114                                 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
2115                                 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
2116                                 dump_const_expression(F, upper);
2117                                 dump_const_expression(F, lower);
2118                         }
2119                         break;
2120                 case tpo_enumeration:
2121                         for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
2122                                 dump_enum_item(F, tp, i);
2123                                 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
2124                         }
2125                         break;
2126                 case tpo_pointer:
2127                         print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
2128                         break;
2129                 case tpo_primitive:
2130                         break;
2131                 default:
2132                         break;
2133                 } /* switch type */
2134                 break; /* case k_type */
2135         }
2136         default:
2137                 printf(" *** irdump,  dump_type_info(l.%i), faulty type.\n", __LINE__);
2138         } /* switch kind_or_entity */
2139 }
2140
2141 typedef struct _h_env {
2142         int dump_ent;
2143         FILE *f;
2144 } h_env_t;
2145
2146 /** For dumping class hierarchies.
2147  * Dumps a class type node and a superclass edge.
2148  * If env->dump_ent dumps entities of classes and overwrites edges.
2149  */
2150 static void
2151 dump_class_hierarchy_node(type_or_ent *tore, void *ctx) {
2152         h_env_t *env = ctx;
2153         FILE *F = env->f;
2154         int i = 0;  /* to shutup gcc */
2155
2156         /* dump this type or entity */
2157         switch (get_kind(tore)) {
2158         case k_entity: {
2159                 ir_entity *ent = (ir_entity *)tore;
2160                 if (get_entity_owner(ent) == get_glob_type()) break;
2161                 if (!is_Method_type(get_entity_type(ent))) break;  /* GL */
2162                 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2163                         /* The node */
2164                         dump_entity_node(F, ent, 0);
2165                         /* The edges */
2166                         print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2167                         for(i = 0; i < get_entity_n_overwrites(ent); i++)
2168                                 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2169                 }
2170                 break;
2171         }
2172         case k_type: {
2173                 ir_type *tp = (ir_type *)tore;
2174                 if (tp == get_glob_type()) break;
2175                 switch (get_type_tpop_code(tp)) {
2176                 case tpo_class:
2177                         dump_type_node(F, tp);
2178                         /* and now the edges */
2179                         for (i=0; i < get_class_n_supertypes(tp); i++) {
2180                                 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2181                         }
2182                         break;
2183                 default: break;
2184                 } /* switch type */
2185                 break; /* case k_type */
2186         }
2187         default:
2188                 printf(" *** irdump,  dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2189         } /* switch kind_or_entity */
2190 }
2191
2192 /*******************************************************************/
2193 /* dump analysis information that is expressed in graph terms.     */
2194 /*******************************************************************/
2195
2196 /* dump out edges */
2197 static void
2198 dump_out_edge(ir_node *n, void *env) {
2199         FILE *F = env;
2200         int i;
2201         for (i = 0; i < get_irn_n_outs(n); i++) {
2202                 assert(get_irn_out(n, i));
2203                 fprintf(F, "edge: {sourcename: \"");
2204                 PRINT_NODEID(n);
2205                 fprintf(F, "\" targetname: \"");
2206                 PRINT_NODEID(get_irn_out(n, i));
2207                 fprintf(F, "\" color: red linestyle: dashed");
2208                 fprintf(F, "}\n");
2209         }
2210 }
2211
2212 static INLINE void
2213 dump_loop_label(FILE *F, ir_loop *loop) {
2214         fprintf(F, "loop %d, %d sons, %d nodes",
2215                 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2216 }
2217
2218 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2219         fprintf(F, " info1: \"");
2220         fprintf(F, " loop nr: %d", get_loop_loop_nr(loop));
2221 #ifdef DEBUG_libfirm   /* GL @@@ debug analyses */
2222         fprintf(F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2223 #endif
2224         fprintf(F, "\"");
2225 }
2226
2227 static INLINE void
2228 dump_loop_node(FILE *F, ir_loop *loop) {
2229         fprintf(F, "node: {title: \"");
2230         PRINT_LOOPID(loop);
2231         fprintf(F, "\" label: \"");
2232         dump_loop_label(F, loop);
2233         fprintf(F, "\" ");
2234         dump_loop_info(F, loop);
2235         fprintf(F, "}\n");
2236 }
2237
2238 static INLINE void
2239 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2240         assert(loop);
2241         fprintf(F, "edge: {sourcename: \"");
2242         PRINT_LOOPID(loop);
2243         fprintf(F, "\" targetname: \"");
2244         PRINT_NODEID(get_loop_node(loop, i));
2245         fprintf(F, "\" color: green");
2246         fprintf(F, "}\n");
2247 }
2248
2249 static INLINE void
2250 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2251         assert(loop);
2252         fprintf(F, "edge: {sourcename: \"");
2253         PRINT_LOOPID(loop);
2254         fprintf(F, "\" targetname: \"");
2255         PRINT_LOOPID(get_loop_son(loop, i));
2256         fprintf(F, "\" color: darkgreen label: \"%d\"}\n",
2257                 get_loop_element_pos(loop, get_loop_son(loop, i)));
2258 }
2259
2260 static
2261 void dump_loops(FILE *F, ir_loop *loop) {
2262         int i;
2263         /* dump this loop node */
2264         dump_loop_node(F, loop);
2265
2266         /* dump edges to nodes in loop -- only if it is a real loop */
2267         if (get_loop_depth(loop) != 0) {
2268                 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2269                         dump_loop_node_edge(F, loop, i);
2270                 }
2271         }
2272         for (i = 0; i < get_loop_n_sons(loop); i++) {
2273                 dump_loops(F, get_loop_son(loop, i));
2274                 dump_loop_son_edge(F, loop, i);
2275         }
2276 }
2277
2278 static INLINE
2279 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2280         ir_graph *rem = current_ir_graph;
2281         current_ir_graph = irg;
2282
2283         if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2284
2285         current_ir_graph = rem;
2286 }
2287
2288
2289 /**
2290  * dumps the VCG header
2291  */
2292 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2293         int   i;
2294         char *label;
2295
2296         init_colors();
2297
2298         if (edge_label) {
2299                 label = "yes";
2300         } else {
2301                 label = "no";
2302         }
2303
2304         if (!orientation) orientation = "bottom_to_top";
2305
2306         /* print header */
2307         fprintf(F,
2308                 "graph: { title: \"ir graph of %s\"\n"
2309                 "display_edge_labels: %s\n"
2310                 "layoutalgorithm: mindepth\n"
2311                 "manhattan_edges: yes\n"
2312                 "port_sharing: no\n"
2313                 "orientation: %s\n"
2314                 "classname 1:  \"intrablock Data\"\n"
2315                 "classname 2:  \"Block\"\n"
2316                 "classname 3:  \"Entity type\"\n"
2317                 "classname 4:  \"Entity owner\"\n"
2318                 "classname 5:  \"Method Param\"\n"
2319                 "classname 6:  \"Method Res\"\n"
2320                 "classname 7:  \"Super\"\n"
2321                 "classname 8:  \"Union\"\n"
2322                 "classname 9:  \"Points-to\"\n"
2323                 "classname 10: \"Array Element Type\"\n"
2324                 "classname 11: \"Overwrites\"\n"
2325                 "classname 12: \"Member\"\n"
2326                 "classname 13: \"Control Flow\"\n"
2327                 "classname 14: \"intrablock Memory\"\n"
2328                 "classname 15: \"Dominators\"\n"
2329                 "classname 16: \"interblock Data\"\n"
2330                 "classname 17: \"interblock Memory\"\n"
2331                 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2332                 "classname 19: \"Postdominators\"\n"
2333                 "classname 20: \"Keep Alive\"\n"
2334                 "classname 21: \"Out Edges\"\n"
2335                 "classname 22: \"Macro Block Edges\"\n"
2336                 "infoname 1: \"Attribute\"\n"
2337                 "infoname 2: \"Verification errors\"\n"
2338                 "infoname 3: \"Debug info\"\n",
2339                 name, label, orientation);
2340
2341         for (i = 0; i < ird_color_count; ++i) {
2342                 if(color_rgb[i] != NULL) {
2343                         fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2344                 }
2345         }
2346         fprintf(F, "\n");        /* a separator */
2347 }
2348
2349 /**
2350  * open a vcg file
2351  *
2352  * @param irg     The graph to be dumped
2353  * @param suffix1 first filename suffix
2354  * @param suffix2 second filename suffix
2355  */
2356 FILE *vcg_open(ir_graph *irg, const char * suffix1, const char *suffix2) {
2357         FILE *F;
2358         const char *nm = get_irg_dump_name(irg);
2359         int len = strlen(nm), i, j;
2360         char *fname;  /* filename to put the vcg information in */
2361
2362         if (!suffix1) suffix1 = "";
2363         if (!suffix2) suffix2 = "";
2364
2365         /* open file for vcg graph */
2366         fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2367
2368         /* strncpy (fname, nm, len); */     /* copy the filename */
2369         j = 0;
2370         for (i = 0; i < len; ++i) {  /* replace '/' in the name: escape by @. */
2371                 if (nm[i] == '/') {
2372                         fname[j] = '@'; j++; fname[j] = '1'; j++;
2373                 } else if (nm[i] == '@') {
2374                         fname[j] = '@'; j++; fname[j] = '2'; j++;
2375                 } else {
2376                         fname[j] = nm[i]; j++;
2377                 }
2378         }
2379         fname[j] = '\0';
2380         strcat(fname, suffix1);  /* append file suffix */
2381         strcat(fname, suffix2);  /* append file suffix */
2382         strcat(fname, ".vcg");   /* append the .vcg suffix */
2383
2384         /* vcg really expect only a <CR> at end of line, so
2385          * the "b"inary mode is what you mean (and even needed for Win32)
2386          */
2387         F = fopen(fname, "wb");  /* open file for writing */
2388         if (!F) {
2389                 perror(fname);
2390         }
2391         free(fname);
2392
2393         return F;
2394 }
2395
2396 /**
2397  * open a vcg file
2398  *
2399  * @param name    prefix file name
2400  * @param suffix  filename suffix
2401  */
2402 FILE *vcg_open_name(const char *name, const char *suffix) {
2403         FILE *F;
2404         char *fname;  /* filename to put the vcg information in */
2405         int i, j, len = strlen(name);
2406
2407         if (!suffix) suffix = "";
2408
2409         /** open file for vcg graph */
2410         fname = xmalloc(len * 2 + 5 + strlen(suffix));
2411         /* strcpy (fname, name);*/    /* copy the filename */
2412         j = 0;
2413         for (i = 0; i < len; ++i) {  /* replace '/' in the name: escape by @. */
2414                 if (name[i] == '/') {
2415                         fname[j] = '@'; j++; fname[j] = '1'; j++;
2416                 } else if (name[i] == '@') {
2417                         fname[j] = '@'; j++; fname[j] = '2'; j++;
2418                 } else {
2419                         fname[j] = name[i]; j++;
2420                 }
2421         }
2422         fname[j] = '\0';
2423         strcat(fname, suffix);
2424         strcat(fname, ".vcg");  /* append the .vcg suffix */
2425
2426         /* vcg really expect only a <CR> at end of line, so
2427          * the "b"inary mode is what you mean (and even needed for Win32)
2428          */
2429         F = fopen(fname, "wb");  /* open file for writing */
2430         if (!F) {
2431                 perror(fname);
2432         }
2433         free(fname);
2434
2435         return F;
2436 }
2437
2438 /**
2439  * Dumps the vcg file footer
2440  */
2441 void dump_vcg_footer(FILE *F) {
2442         fprintf(F, "}\n");
2443 }
2444
2445 /************************************************************************/
2446 /************************************************************************/
2447 /* Routines that dump all or parts of the firm representation to a file */
2448 /************************************************************************/
2449 /************************************************************************/
2450
2451 /************************************************************************/
2452 /* Dump ir graphs, different formats and additional information.        */
2453 /************************************************************************/
2454
2455 typedef void (*do_dump_graph_func) (ir_graph *irg, FILE *out);
2456
2457 static void do_dump(ir_graph *irg, const char *suffix, const char *suffix_ip,
2458                     const char *suffix_nonip, do_dump_graph_func dump_func)
2459 {
2460         FILE       *out;
2461         ir_graph   *rem;
2462         const char *suffix1;
2463
2464         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2465                 return;
2466
2467         rem = current_ir_graph;
2468         current_ir_graph = irg;
2469         if (get_interprocedural_view())
2470                 suffix1 = suffix_ip;
2471         else
2472                 suffix1 = suffix_nonip;
2473         current_ir_graph = rem;
2474
2475         out = vcg_open(irg, suffix, suffix1);
2476         if (out != NULL) {
2477                 dump_func(irg, out);
2478                 fclose(out);
2479         }
2480 }
2481
2482 void dump_ir_graph_file(ir_graph *irg, FILE *out)
2483 {
2484         if (dump_backedge_information_flag
2485                         && get_irg_loopinfo_state(irg) != loopinfo_consistent) {
2486                 construct_backedges(irg);
2487         }
2488
2489         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2490
2491         /* call the dump graph hook */
2492         if (dump_ir_graph_hook) {
2493                 if (dump_ir_graph_hook(out, irg)) {
2494                         return;
2495                 }
2496         }
2497
2498         /* walk over the graph */
2499         /* dump_whole_node must be called in post visiting predecessors */
2500         ird_walk_graph(irg, NULL, dump_whole_node, out);
2501
2502         /* dump the out edges in a separate walk */
2503         if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2504                 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2505         }
2506
2507         dump_vcg_footer(out);
2508 }
2509
2510 /** Routine to dump a graph, blocks as conventional nodes.  */
2511 void dump_ir_graph(ir_graph *irg, const char *suffix )
2512 {
2513         do_dump(irg, suffix, "-pure-ip", "-pure", dump_ir_graph_file);
2514 }
2515
2516 void dump_ir_block_graph_file(ir_graph *irg, FILE *out)
2517 {
2518         int i;
2519
2520         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2521
2522         construct_block_lists(irg);
2523
2524         /*
2525          * If we are in the interprocedural view, we dump not
2526          * only the requested irg but also all irgs that can be reached
2527          * from irg.
2528          */
2529         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2530                 ir_graph *g = get_irp_irg(i);
2531                 ir_node **arr = ird_get_irg_link(g);
2532                 if (arr) {
2533                         dump_graph_from_list(out, g);
2534                         DEL_ARR_F(arr);
2535                 }
2536         }
2537
2538         dump_vcg_footer(out);
2539 }
2540
2541 /* Dump a firm graph without explicit block nodes. */
2542 void dump_ir_block_graph(ir_graph *irg, const char *suffix)
2543 {
2544         do_dump(irg, suffix, "-ip", "", dump_ir_block_graph_file);
2545 }
2546
2547 void dump_ir_extblock_graph_file(ir_graph *irg, FILE *F)
2548 {
2549         int        i;
2550         ir_entity *ent = get_irg_entity(irg);
2551
2552         if (get_irg_extblk_state(irg) != extblk_valid)
2553                 compute_extbb(irg);
2554
2555         dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2556
2557         construct_extblock_lists(irg);
2558
2559         fprintf(F, "graph: { title: \"");
2560         PRINT_IRGID(irg);
2561         fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2562                 get_ent_dump_name(ent));
2563
2564         dump_graph_info(F, irg);
2565         print_dbg_info(F, get_entity_dbg_info(ent));
2566
2567         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2568                 ir_graph *irg     = get_irp_irg(i);
2569                 list_tuple *lists = ird_get_irg_link(irg);
2570
2571                 if (lists) {
2572                         /* dump the extended blocks first */
2573                         if (ARR_LEN(lists->extbb_list)) {
2574                                 ird_set_irg_link(irg, lists->extbb_list);
2575                                 dump_extblock_graph(F, irg);
2576                         }
2577
2578                         /* we may have blocks without extended blocks, bad for instance */
2579                         if (ARR_LEN(lists->blk_list)) {
2580                                 ird_set_irg_link(irg, lists->blk_list);
2581                                 dump_block_graph(F, irg);
2582                         }
2583
2584                         DEL_ARR_F(lists->extbb_list);
2585                         DEL_ARR_F(lists->blk_list);
2586                         xfree(lists);
2587                 }
2588         }
2589
2590         /* Close the vcg information for the irg */
2591         fprintf(F, "}\n\n");
2592
2593         dump_vcg_footer(F);
2594         free_extbb(irg);
2595 }
2596
2597 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2598 void dump_ir_extblock_graph(ir_graph *irg, const char *suffix)
2599 {
2600         do_dump(irg, suffix, "-ip", "", dump_ir_extblock_graph_file);
2601 }
2602
2603 void dump_ir_graph_w_types_file(ir_graph *irg, FILE *out)
2604 {
2605         ir_graph *rem = current_ir_graph;
2606         int       rem_dump_const_local;
2607
2608         rem                  = current_ir_graph;
2609         current_ir_graph     = irg;
2610         rem_dump_const_local = dump_const_local;
2611         /* dumping types does not work with local nodes */
2612         dump_const_local = 0;
2613
2614         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2615
2616         /* dump common ir graph */
2617         irg_walk(get_irg_end(irg), NULL, dump_whole_node, out);
2618         /* dump type info */
2619         type_walk_irg(irg, dump_type_info, NULL, out);
2620         inc_irg_visited(get_const_code_irg());
2621         /* dump edges from graph to type info */
2622         irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2623
2624         dump_vcg_footer(out);
2625         dump_const_local = rem_dump_const_local;
2626         current_ir_graph = rem;
2627 }
2628
2629 /* dumps a graph with type information */
2630 void dump_ir_graph_w_types(ir_graph *irg, const char *suffix)
2631 {
2632         do_dump(irg, suffix, "-pure-wtypes-ip", "-pure-wtypes",
2633                 dump_ir_graph_w_types_file);
2634 }
2635
2636 void dump_ir_block_graph_w_types_file(ir_graph *irg, FILE *out)
2637 {
2638         int       i;
2639         int       rem_dump_const_local;
2640         ir_graph *rem = current_ir_graph;
2641
2642         rem_dump_const_local = dump_const_local;
2643         /* dumping types does not work with local nodes */
2644         dump_const_local = 0;
2645
2646         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2647
2648         /* dump common blocked ir graph */
2649         construct_block_lists(irg);
2650
2651         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2652                 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2653                 if (arr) {
2654                         dump_graph_from_list(out, get_irp_irg(i));
2655                         DEL_ARR_F(arr);
2656                 }
2657         }
2658
2659         /* dump type info */
2660         current_ir_graph = irg;
2661         type_walk_irg(irg, dump_type_info, NULL, out);
2662         inc_irg_visited(get_const_code_irg());
2663
2664         /* dump edges from graph to type info */
2665         irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2666
2667         dump_vcg_footer(out);
2668         dump_const_local = rem_dump_const_local;
2669         current_ir_graph = rem;
2670 }
2671
2672 void dump_ir_block_graph_w_types(ir_graph *irg, const char *suffix)
2673 {
2674         do_dump(irg, suffix, "-wtypes-ip", "-wtypes",
2675                 dump_ir_block_graph_w_types_file);
2676 }
2677
2678 /*---------------------------------------------------------------------*/
2679 /* The following routines dump a control flow graph.                   */
2680 /*---------------------------------------------------------------------*/
2681
2682 static void
2683 dump_block_to_cfg(ir_node *block, void *env) {
2684         FILE *F = env;
2685         int i, fl = 0;
2686         ir_node *pred;
2687
2688         if (is_Block(block)) {
2689                 /* This is a block. Dump a node for the block. */
2690                 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2691                 fprintf(F, "\" label: \"");
2692                 if (block == get_irg_start_block(get_irn_irg(block)))
2693                         fprintf(F, "Start ");
2694                 if (block == get_irg_end_block(get_irn_irg(block)))
2695                         fprintf(F, "End ");
2696
2697                 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2698                 PRINT_NODEID(block);
2699                 fprintf(F, "\" ");
2700                 fprintf(F, "info1:\"");
2701
2702                 /* the generic version. */
2703                 dump_irnode_to_file(F, block);
2704
2705                 /* Check whether we have bad predecessors to color the block. */
2706                 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2707                         if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2708                                 break;
2709
2710                 fprintf(F, "\"");  /* closing quote of info */
2711
2712                 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2713                         (block == get_irg_end_block(get_irn_irg(block)))     )
2714                         fprintf(F, " color:blue ");
2715                 else if (fl)
2716                         fprintf(F, " color:yellow ");
2717
2718                 fprintf(F, "}\n");
2719                 /* Dump the edges */
2720                 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2721                         if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2722                                 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2723                                 fprintf(F, "edge: { sourcename: \"");
2724                                 PRINT_NODEID(block);
2725                                 fprintf(F, "\" targetname: \"");
2726                                 PRINT_NODEID(pred);
2727                                 fprintf(F, "\"}\n");
2728                         }
2729
2730                 /* Dump dominator/postdominator edge */
2731                 if (dump_dominator_information_flag) {
2732                         if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2733                                 pred = get_Block_idom(block);
2734                                 fprintf(F, "edge: { sourcename: \"");
2735                                 PRINT_NODEID(block);
2736                                 fprintf(F, "\" targetname: \"");
2737                                 PRINT_NODEID(pred);
2738                                 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2739                         }
2740                         if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2741                                 pred = get_Block_ipostdom(block);
2742                                 fprintf(F, "edge: { sourcename: \"");
2743                                 PRINT_NODEID(block);
2744                                 fprintf(F, "\" targetname: \"");
2745                                 PRINT_NODEID(pred);
2746                                 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2747                         }
2748                 }
2749         }
2750 }
2751
2752 void dump_cfg(ir_graph *irg, const char *suffix)
2753 {
2754         FILE *f;
2755         /* if a filter is set, dump only the irg's that match the filter */
2756         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2757                 return;
2758
2759         f = vcg_open(irg, suffix, "-cfg");
2760         if (f != NULL) {
2761                 ir_graph *rem = current_ir_graph;
2762 #ifdef INTERPROCEDURAL_VIEW
2763                 int ipv = get_interprocedural_view();
2764 #endif
2765
2766                 current_ir_graph = irg;
2767                 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2768
2769 #ifdef INTERPROCEDURAL_VIEW
2770                 if (ipv) {
2771                         printf("Warning: dumping cfg not in interprocedural view!\n");
2772                         set_interprocedural_view(0);
2773                 }
2774 #endif
2775
2776                 /* walk over the blocks in the graph */
2777                 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2778                 dump_node(f, get_irg_bad(irg));
2779
2780 #ifdef INTERPROCEDURAL_VIEW
2781                 set_interprocedural_view(ipv);
2782 #endif
2783                 dump_vcg_footer(f);
2784                 fclose(f);
2785                 current_ir_graph = rem;
2786         }
2787 }
2788
2789
2790 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2791         if (pset_find_ptr(mark_set, n)) return;
2792
2793         pset_insert_ptr(mark_set, n);
2794
2795         if (depth > 0) {
2796                 int i, start = is_Block(n) ? 0 : -1;
2797                 dump_whole_node(n, F);
2798                 for (i = start; i < get_irn_arity(n); ++i)
2799                         descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2800         } else {
2801                 dump_node(F, n);
2802                 /* Don't dump edges to nodes further out.  These might be edges to
2803                    nodes we already dumped, if there is a shorter path to these. */
2804         }
2805 }
2806
2807 static int subgraph_counter = 0;
2808 void dump_subgraph(ir_node *root, int depth, const char *suffix) {
2809         FILE *F;
2810         char buf[32];
2811
2812         sprintf(buf, "-subg_%03d", subgraph_counter++);
2813         F = vcg_open(get_irn_irg(root), suffix, buf);
2814         if (F != NULL) {
2815                 pset *mark_set = pset_new_ptr(1);
2816                 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2817                 descend_and_dump(F, root, depth, mark_set);
2818                 dump_vcg_footer(F);
2819                 fclose(F);
2820                 del_pset(mark_set);
2821         }
2822 }
2823
2824 #ifdef INTERPROCEDURAL_VIEW
2825 void dump_callgraph(const char *suffix) {
2826         FILE *F = vcg_open_name("Callgraph", suffix);
2827
2828         if (F != NULL) {
2829                 int i, rem = edge_label;
2830                 //int colorize;
2831                 edge_label = 1;
2832                 dump_vcg_header(F, "Callgraph", NULL);
2833
2834                 //colorize = get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent;
2835
2836                 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2837                         ir_graph *irg = get_irp_irg(i);
2838                         ir_entity *ent = get_irg_entity(irg);
2839                         int j;
2840                         //int n_callees = get_irg_n_callees(irg);
2841                         int color;
2842
2843                         //color = colorize ? get_entity_color(ent) : ird_color_green;
2844                         color = ird_color_green;
2845                         dump_entity_node(F, ent, color);
2846                         for (j = 0; j < n_callees; ++j) {
2847                                 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2848                                 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2849                                 int be = is_irg_callee_backedge(irg, j);
2850                                 char *attr;
2851                                 attr = (be) ?
2852                                         "label:\"recursion %d\" color:%d" :
2853                                 "label:\"calls %d\" color:%d";
2854                                 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), color);
2855                         }
2856                 }
2857
2858                 edge_label = rem;
2859                 dump_vcg_footer(F);
2860                 fclose(F);
2861         }
2862 }
2863
2864 /* Dump all irgs in interprocedural view to a single file. */
2865 void dump_all_cg_block_graph(const char *suffix) {
2866         FILE *f = vcg_open_name("All_graphs", suffix);
2867
2868         if (f != NULL) {
2869                 int i;
2870                 int rem_view = get_interprocedural_view();
2871
2872                 set_interprocedural_view(1);
2873                 dump_vcg_header(f, "All_graphs", NULL);
2874
2875                 /* collect nodes in all irgs reachable in call graph*/
2876                 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2877                         ird_set_irg_link(get_irp_irg(i), NULL);
2878
2879                 cg_walk(clear_link, collect_node, NULL);
2880
2881                 /* dump all graphs */
2882                 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2883                         current_ir_graph = get_irp_irg(i);
2884                         assert(ird_get_irg_link(current_ir_graph));
2885                         dump_graph_from_list(f, current_ir_graph);
2886                         DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2887                 }
2888
2889                 dump_vcg_footer(f);
2890                 fclose(f);
2891                 set_interprocedural_view(rem_view);
2892         }
2893 }
2894 #endif
2895
2896 /*---------------------------------------------------------------------*/
2897 /* the following routines dumps type information without any ir nodes. */
2898 /*---------------------------------------------------------------------*/
2899
2900 void
2901 dump_type_graph(ir_graph *irg, const char *suffix)
2902 {
2903         FILE *f;
2904
2905         /* if a filter is set, dump only the irg's that match the filter */
2906         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2907
2908         f = vcg_open(irg, suffix, "-type");
2909         if (f != NULL) {
2910                 ir_graph *rem = current_ir_graph;
2911                 current_ir_graph = irg;
2912
2913                 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2914
2915                 /* walk over the blocks in the graph */
2916                 type_walk_irg(irg, dump_type_info, NULL, f);
2917                 /* The walker for the const code can be called several times for the
2918                    same (sub) expression.  So that no nodes are dumped several times
2919                    we decrease the visited flag of the corresponding graph after each
2920                    walk.  So now increase it finally. */
2921                 inc_irg_visited(get_const_code_irg());
2922
2923                 dump_vcg_footer(f);
2924                 fclose(f);
2925                 current_ir_graph = rem;
2926         }
2927 }
2928
2929 void
2930 dump_all_types(const char *suffix)
2931 {
2932         FILE *f = vcg_open_name("All_types", suffix);
2933         if (f) {
2934                 dump_vcg_header(f, "All_types", NULL);
2935                 type_walk(dump_type_info, NULL, f);
2936                 inc_irg_visited(get_const_code_irg());
2937
2938                 dump_vcg_footer(f);
2939                 fclose(f);
2940         }
2941 }
2942
2943 void
2944 dump_class_hierarchy(int entities, const char *suffix)
2945 {
2946         FILE *f = vcg_open_name("class_hierarchy", suffix);
2947
2948         if (f != NULL) {
2949                 h_env_t env;
2950                 env.f        = f;
2951                 env.dump_ent = entities;
2952                 dump_vcg_header(f, "class_hierarchy", NULL);
2953                 type_walk(dump_class_hierarchy_node, NULL, &env);
2954
2955                 dump_vcg_footer(f);
2956                 fclose(f);
2957         }
2958 }
2959
2960 /*---------------------------------------------------------------------*/
2961 /* dumps all graphs with the graph-dumper passed. Possible dumpers:    */
2962 /*  dump_ir_graph                                                      */
2963 /*  dump_ir_block_graph                                                */
2964 /*  dump_cfg                                                           */
2965 /*  dump_type_graph                                                    */
2966 /*  dump_ir_graph_w_types                                              */
2967 /*---------------------------------------------------------------------*/
2968
2969 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2970         int i;
2971         for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2972                 dmp_grph(get_irp_irg(i), suffix);
2973 }
2974
2975
2976 /*--------------------------------------------------------------------------------*
2977  * Dumps a stand alone loop graph with firm nodes which belong to one loop node   *
2978  * packed together in one subgraph/box                                            *
2979  *--------------------------------------------------------------------------------*/
2980
2981 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2982         int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2983         loop_element le;
2984         ir_loop *son = NULL;
2985
2986         /* Dump a new loop node. */
2987         dump_loop_node(F, loop);
2988
2989         /* Dump the loop elements. */
2990
2991         for(i = 0; i < get_loop_n_elements(loop); i++) {
2992                 le = get_loop_element(loop, i);
2993                 son = le.son;
2994                 if (get_kind(son) == k_ir_loop) {
2995
2996                         /* We are a loop son -> Recurse */
2997
2998                         if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2999                                 fprintf(F, "\" }\n");
3000                                 fprintf(F, "edge: {sourcename: \"");
3001                                 PRINT_LOOPID(loop);
3002                                 fprintf(F, "\" targetname: \"");
3003                                 PRINT_LOOPID(loop);
3004                                 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3005                                 loop_node_started = 0;
3006                         }
3007                         dump_loop_son_edge(F, loop, son_number++);
3008                         dump_loops_standalone(F, son);
3009                 } else if (get_kind(son) == k_ir_node) {
3010                         /* We are a loop node -> Collect firm nodes */
3011
3012                         ir_node *n = le.node;
3013                         int bad = 0;
3014
3015                         if (!loop_node_started) {
3016                                 /* Start a new node which contains all firm nodes of the current loop */
3017                                 fprintf(F, "node: { title: \"");
3018                                 PRINT_LOOPID(loop);
3019                                 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
3020                                 loop_node_started = 1;
3021                                 first = i;
3022                         } else
3023                                 fprintf(F, "\n");
3024
3025                         bad |= dump_node_label(F, n);
3026                         /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
3027                         if (has_backedges(n)) fprintf(F, "\t loop head!");
3028                 } else { /* for callgraph loop tree */
3029                         ir_graph *n;
3030                         assert(get_kind(son) == k_ir_graph);
3031
3032                         /* We are a loop node -> Collect firm graphs */
3033                         n = (ir_graph *)le.node;
3034                         if (!loop_node_started) {
3035                                 /* Start a new node which contains all firm nodes of the current loop */
3036                                 fprintf(F, "node: { title: \"");
3037                                 PRINT_LOOPID(loop);
3038                                 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
3039                                 loop_node_started = 1;
3040                                 first = i;
3041                         } else
3042                                 fprintf(F, "\n");
3043                         fprintf(F, " %s", get_irg_dump_name(n));
3044                         /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
3045                 }
3046         }
3047
3048         if (loop_node_started) {
3049                 fprintf(F, "\" }\n");
3050                 fprintf(F, "edge: {sourcename: \"");
3051                 PRINT_LOOPID(loop);
3052                 fprintf(F, "\" targetname: \"");
3053                 PRINT_LOOPID(loop);
3054                 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3055                 loop_node_started = 0;
3056         }
3057 }
3058
3059 void dump_loop_tree(ir_graph *irg, const char *suffix)
3060 {
3061         FILE *f;
3062
3063         /* if a filter is set, dump only the irg's that match the filter */
3064         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
3065
3066         f = vcg_open(irg, suffix, "-looptree");
3067         if (f != NULL) {
3068                 ir_graph *rem = current_ir_graph;
3069                 int el_rem = edge_label;
3070
3071                 current_ir_graph = irg;
3072                 edge_label = 1;
3073
3074                 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
3075
3076                 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
3077
3078                 dump_vcg_footer(f);
3079                 fclose(f);
3080
3081                 edge_label = el_rem;
3082                 current_ir_graph = rem;
3083         }
3084 }
3085
3086 void dump_callgraph_loop_tree(const char *suffix) {
3087         FILE *F;
3088         F = vcg_open_name("Callgraph_looptree", suffix);
3089         dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
3090         dump_loops_standalone(F, irp->outermost_cg_loop);
3091         dump_vcg_footer(F);
3092         fclose(F);
3093 }
3094
3095
3096 /*----------------------------------------------------------------------------*/
3097 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes.*/
3098 /*----------------------------------------------------------------------------*/
3099
3100 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
3101         int i, son_number = 0, node_number = 0;
3102
3103         if (dump_loop_information_flag) dump_loop_node(F, loop);
3104
3105         for (i = 0; i < get_loop_n_elements(loop); i++) {
3106                 loop_element le = get_loop_element(loop, i);
3107                 if (*(le.kind) == k_ir_loop) {
3108                         if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
3109                         /* Recur */
3110                         collect_nodeloop(F, le.son, loopnodes);
3111                 } else {
3112                         if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
3113                         eset_insert(loopnodes, le.node);
3114                 }
3115         }
3116 }
3117
3118 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
3119         int i, j, start;
3120
3121         for(i = 0; i < get_loop_n_elements(loop); i++) {
3122                 loop_element le = get_loop_element(loop, i);
3123                 if (*(le.kind) == k_ir_loop) {
3124                         /* Recur */
3125                         collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3126                 } else {
3127                         if (is_Block(le.node)) start = 0; else start = -1;
3128                         for (j = start; j < get_irn_arity(le.node); j++) {
3129                                 ir_node *pred = get_irn_n(le.node, j);
3130                                 if (!eset_contains(loopnodes, pred)) {
3131                                         eset_insert(extnodes, pred);
3132                                         if (!is_Block(pred)) {
3133                                                 pred = get_nodes_block(pred);
3134                                                 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3135                                         }
3136                                 }
3137                         }
3138                 }
3139         }
3140 }
3141
3142 void dump_loop(ir_loop *l, const char *suffix) {
3143         FILE *F;
3144         char name[50];
3145
3146         snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3147         F = vcg_open_name(name, suffix);
3148         if (F != NULL) {
3149                 eset *loopnodes = eset_create();
3150                 eset *extnodes = eset_create();
3151                 ir_node *n, *b;
3152
3153                 dump_vcg_header(F, name, NULL);
3154
3155                 /* collect all nodes to dump */
3156                 collect_nodeloop(F, l, loopnodes);
3157                 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3158
3159                 /* build block lists */
3160                 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3161                         set_irn_link(n, NULL);
3162                 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3163                         set_irn_link(n, NULL);
3164                 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) {
3165                         if (!is_Block(n)) {
3166                                 b = get_nodes_block(n);
3167                                 set_irn_link(n, get_irn_link(b));
3168                                 set_irn_link(b, n);
3169                         }
3170                 }
3171                 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) {
3172                         if (!is_Block(n)) {
3173                                 b = get_nodes_block(n);
3174                                 set_irn_link(n, get_irn_link(b));
3175                                 set_irn_link(b, n);
3176                         }
3177                 }
3178
3179                 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) {
3180                         if (is_Block(b)) {
3181                                 fprintf(F, "graph: { title: \"");
3182                                 PRINT_NODEID(b);
3183                                 fprintf(F, "\"  label: \"");
3184                                 dump_node_opcode(F, b);
3185                                 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3186                                 fprintf(F, "\" status:clustered color:yellow\n");
3187
3188                                 /* dump the blocks edges */
3189                                 dump_ir_data_edges(F, b);
3190
3191                                 /* dump the nodes that go into the block */
3192                                 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3193                                         if (eset_contains(extnodes, n))
3194                                                 overrule_nodecolor = ird_color_block_inout;
3195                                         dump_node(F, n);
3196                                         overrule_nodecolor = ird_color_default_node;
3197                                         if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3198                                 }
3199
3200                                 /* Close the vcg information for the block */
3201                                 fprintf(F, "}\n");
3202                                 dump_const_node_local(F, b);
3203                                 fprintf(F, "\n");
3204                         }
3205                 }
3206                 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) {
3207                         if (is_Block(b)) {
3208                                 fprintf(F, "graph: { title: \"");
3209                                 PRINT_NODEID(b);
3210                                 fprintf(F, "\"  label: \"");
3211                                 dump_node_opcode(F, b);
3212                                 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3213                                 fprintf(F, "\" status:clustered color:lightblue\n");
3214
3215                                 /* dump the nodes that go into the block */
3216                                 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3217                                         if (!eset_contains(loopnodes, n))
3218                                                 overrule_nodecolor = ird_color_block_inout;
3219                                         dump_node(F, n);
3220                                         overrule_nodecolor = ird_color_default_node;
3221                                         if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3222                                 }
3223
3224                                 /* Close the vcg information for the block */
3225                                 fprintf(F, "}\n");
3226                                 dump_const_node_local(F, b);
3227                                 fprintf(F, "\n");
3228                         }
3229                 }
3230                 eset_destroy(loopnodes);
3231                 eset_destroy(extnodes);
3232
3233                 dump_vcg_footer(F);
3234                 fclose(F);
3235         }
3236 }