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_SymConst_addr_ent(addr))
 806                         ent = get_SymConst_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[%s]", get_irn_opname(n), get_mode_name_ex(get_Div_resmode(n), &bad));
 831                 break;
 832         case iro_Mod:
 833                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), &bad));
 834                 break;
 835         case iro_DivMod:
 836                 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_DivMod_resmode(n), &bad));
 837                 break;
 838
 839         default:
 840 default_case:
 841                 fprintf(F, "%s", get_irn_opname(n));
 842
 843         }  /* end switch */
 844         return bad;
 845 }
 846
 847 /**
 848  * Dump the mode of a node n to a file F.
 849  * Ignore modes that are "always known".
 850  */
 851 static int dump_node_mode(FILE *F, ir_node *n)
 852 {
 853         int bad = 0;
 854         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
 855         ir_opcode iro;
 856
 857         /* call the dump_node operation if available */
 858         if (ops->dump_node)
 859                 return ops->dump_node(n, F, dump_node_mode_txt);
 860
 861         /* default implementation */
 862         iro = get_irn_opcode(n);
 863         switch (iro) {
 864         case iro_SymConst:
 865         case iro_Sel:
 866         case iro_End:
 867         case iro_Return:
 868         case iro_Free:
 869         case iro_Sync:
 870         case iro_Jmp:
 871         case iro_NoMem:
 872                 break;
 873         default: {
 874                 ir_mode *mode = get_irn_mode(n);
 875
 876                 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
 877                         (mode != mode_T || iro == iro_Proj))
 878                         fprintf(F, "%s", get_mode_name_ex(mode, &bad));
 879         }
 880         }
 881
 882         return bad;
 883 }
 884
 885 /**
 886  * Dump the type of a node n to a file F if it's known.
 887  */
 888 static int dump_node_typeinfo(FILE *F, ir_node *n) {
 889         int bad = 0;
 890
 891         if (opt_dump_analysed_type_info) {
 892                 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent  ||
 893                         get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
 894                         ir_type *tp = get_irn_typeinfo_type(n);
 895                         if (tp != firm_none_type)
 896                                 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
 897                         else
 898                                 fprintf(F, "[] ");
 899                 }
 900         }
 901         return bad;
 902 }
 903
 904 typedef struct _pns_lookup {
 905         long       nr;      /**< the proj number */
 906         const char *name;   /**< the name of the Proj */
 907 } pns_lookup_t;
 908
 909 typedef struct _proj_lookup {
 910         ir_opcode          code;      /**< the opcode of the Proj predecessor */
 911         unsigned           num_data;  /**< number of data entries */
 912         const pns_lookup_t *data;     /**< the data */
 913 } proj_lookup_t;
 914
 915 #define ARR_SIZE(a)       (sizeof(a)/sizeof(a[0]))
 916
 917 /** the lookup table for Proj(Start) names */
 918 static const pns_lookup_t start_lut[] = {
 919 #define X(a)    { pn_Start_##a, #a }
 920         X(X_initial_exec),
 921         X(P_frame_base),
 922         X(P_globals),
 923         X(P_tls),
 924         X(T_args),
 925         X(P_value_arg_base)
 926 #undef X
 927 };
 928
 929 /** the lookup table for Proj(Cond) names */
 930 static const pns_lookup_t cond_lut[] = {
 931 #define X(a)    { pn_Cond_##a, #a }
 932         X(false),
 933         X(true)
 934 #undef X
 935 };
 936
 937 /** the lookup table for Proj(Call) names */
 938 static const pns_lookup_t call_lut[] = {
 939 #define X(a)    { pn_Call_##a, #a }
 940         X(M_regular),
 941         X(X_regular),
 942         X(X_except),
 943         X(T_result),
 944         X(M_except),
 945         X(P_value_res_base)
 946 #undef X
 947 };
 948
 949 /** the lookup table for Proj(Quot) names */
 950 static const pns_lookup_t quot_lut[] = {
 951 #define X(a)    { pn_Quot_##a, #a }
 952         X(M),
 953         X(X_regular),
 954         X(X_except),
 955         X(res)
 956 #undef X
 957 };
 958
 959 /** the lookup table for Proj(DivMod) names */
 960 static const pns_lookup_t divmod_lut[] = {
 961 #define X(a)    { pn_DivMod_##a, #a }
 962         X(M),
 963         X(X_regular),
 964         X(X_except),
 965         X(res_div),
 966         X(res_mod)
 967 #undef X
 968 };
 969
 970 /** the lookup table for Proj(Div) names */
 971 static const pns_lookup_t div_lut[] = {
 972 #define X(a)    { pn_Div_##a, #a }
 973         X(M),
 974         X(X_regular),
 975         X(X_except),
 976         X(res)
 977 #undef X
 978 };
 979
 980 /** the lookup table for Proj(Mod) names */
 981 static const pns_lookup_t mod_lut[] = {
 982 #define X(a)    { pn_Mod_##a, #a }
 983         X(M),
 984         X(X_regular),
 985         X(X_except),
 986         X(res)
 987 #undef X
 988 };
 989
 990 /** the lookup table for Proj(Load) names */
 991 static const pns_lookup_t load_lut[] = {
 992 #define X(a)    { pn_Load_##a, #a }
 993         X(M),
 994         X(X_regular),
 995         X(X_except),
 996         X(res)
 997 #undef X
 998 };
 999
1000 /** the lookup table for Proj(Store) names */
1001 static const pns_lookup_t store_lut[] = {
1002 #define X(a)    { pn_Store_##a, #a }
1003         X(M),
1004         X(X_regular),
1005         X(X_except)
1006 #undef X
1007 };
1008
1009 /** the lookup table for Proj(Alloc) names */
1010 static const pns_lookup_t alloc_lut[] = {
1011 #define X(a)    { pn_Alloc_##a, #a }
1012         X(M),
1013         X(X_regular),
1014         X(X_except),
1015         X(res)
1016 #undef X
1017 };
1018
1019 /** the lookup table for Proj(CopyB) names */
1020 static const pns_lookup_t copyb_lut[] = {
1021 #define X(a)    { pn_CopyB_##a, #a }
1022         X(M),
1023         X(X_regular),
1024         X(X_except),
1025         X(M_except)
1026 #undef X
1027 };
1028
1029 /** the lookup table for Proj(InstOf) names */
1030 static const pns_lookup_t instof_lut[] = {
1031 #define X(a)    { pn_InstOf_##a, #a }
1032         X(M),
1033         X(X_regular),
1034         X(X_except),
1035         X(res),
1036         X(M_except),
1037 #undef X
1038 };
1039
1040 /** the lookup table for Proj(Raise) names */
1041 static const pns_lookup_t raise_lut[] = {
1042 #define X(a)    { pn_Raise_##a, #a }
1043         X(M),
1044         X(X),
1045 #undef X
1046 };
1047
1048 /** the lookup table for Proj(Bound) names */
1049 static const pns_lookup_t bound_lut[] = {
1050 #define X(a)    { pn_Bound_##a, #a }
1051         X(M),
1052         X(X_regular),
1053         X(X_except),
1054         X(res),
1055 #undef X
1056 };
1057
1058 /** the Proj lookup table */
1059 static const proj_lookup_t proj_lut[] = {
1060 #define E(a)  ARR_SIZE(a), a
1061         { iro_Start,   E(start_lut) },
1062         { iro_Cond,    E(cond_lut) },
1063         { iro_Call,    E(call_lut) },
1064         { iro_Quot,    E(quot_lut) },
1065         { iro_DivMod,  E(divmod_lut) },
1066         { iro_Div,     E(div_lut) },
1067         { iro_Mod,     E(mod_lut) },
1068         { iro_Load,    E(load_lut) },
1069         { iro_Store,   E(store_lut) },
1070         { iro_Alloc,   E(alloc_lut) },
1071         { iro_CopyB,   E(copyb_lut) },
1072         { iro_InstOf,  E(instof_lut) },
1073         { iro_Raise,   E(raise_lut) },
1074         { iro_Bound,   E(bound_lut) }
1075 #undef E
1076 };
1077
1078 /**
1079  * Dump additional node attributes of some nodes to a file F.
1080  */
1081 static int
1082 dump_node_nodeattr(FILE *F, ir_node *n)
1083 {
1084         int bad = 0;
1085         ir_node *pred;
1086         ir_opcode code;
1087         long proj_nr;
1088         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1089
1090         /* call the dump_node operation if available */
1091         if (ops->dump_node)
1092                 return ops->dump_node(n, F, dump_node_nodeattr_txt);
1093
1094         switch (get_irn_opcode(n)) {
1095         case iro_Start:
1096                 if (0 && get_interprocedural_view()) {
1097                         fprintf(F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
1098                 }
1099                 break;
1100
1101         case iro_Proj:
1102                 pred    = get_Proj_pred(n);
1103                 proj_nr = get_Proj_proj(n);
1104 handle_lut:
1105                 code    = get_irn_opcode(pred);
1106
1107                 if (code == iro_Cmp)
1108                         fprintf(F, "%s ", get_pnc_string(get_Proj_proj(n)));
1109                 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1110                         fprintf(F, "Arg %ld ", proj_nr);
1111                 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1112                         fprintf(F, "%ld ", proj_nr);
1113                 else {
1114                         unsigned i, j, f = 0;
1115
1116                         for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1117                                 if (code == proj_lut[i].code) {
1118                                         for (j = 0; j < proj_lut[i].num_data; ++j) {
1119                                                 if (proj_nr == proj_lut[i].data[j].nr) {
1120                                                         fprintf(F, "%s ", proj_lut[i].data[j].name);
1121                                                         f = 1;
1122                                                         break;
1123                                                 }
1124                                         }
1125                                         break;
1126                                 }
1127                         }
1128                         if (! f)
1129                                 fprintf(F, "%ld ", proj_nr);
1130                         if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1131                                 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1132                                         fprintf(F, "PRED ");
1133                                 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1134                                         fprintf(F, "PRED ");
1135                         }
1136                 }
1137                 break;
1138         case iro_Filter:
1139                 proj_nr = get_Filter_proj(n);
1140                 if (! get_interprocedural_view()) {
1141                         /* it's a Proj' */
1142                         pred    = get_Filter_pred(n);
1143                         goto handle_lut;
1144                 } else
1145                         fprintf(F, "%ld ", proj_nr);
1146                 break;
1147         case iro_Sel:
1148                 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1149                 break;
1150         case iro_Cast:
1151                 fprintf(F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1152                 break;
1153         case iro_Confirm:
1154                 fprintf(F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1155                 break;
1156         case iro_CopyB:
1157                 fprintf(F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1158                 break;
1159
1160         default:
1161                 ;
1162         } /* end switch */
1163
1164         return bad;
1165 }
1166
1167 #include <math.h>
1168 #include "execution_frequency.h"
1169
1170 static void dump_node_ana_vals(FILE *F, ir_node *n) {
1171         (void) F;
1172         (void) n;
1173         return;
1174 #ifdef INTERPROCEDURAL_VIEW
1175         fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1176                 get_irn_exec_freq(n),
1177                 get_irg_method_execution_frequency(get_irn_irg(n)),
1178                 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1179                 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1180         );
1181 #endif
1182 }
1183
1184
1185 /* Dumps a node label without the enclosing ". */
1186 int dump_node_label(FILE *F, ir_node *n) {
1187         int bad = 0;
1188
1189         bad |= dump_node_opcode(F, n);
1190         bad |= dump_node_mode(F, n);
1191         fprintf(F, " ");
1192         bad |= dump_node_typeinfo(F, n);
1193         bad |= dump_node_nodeattr(F, n);
1194         if(dump_node_idx_labels) {
1195                 fprintf(F, "%ld:%d", get_irn_node_nr(n), get_irn_idx(n));
1196         } else {
1197                 fprintf(F, "%ld", get_irn_node_nr(n));
1198         }
1199
1200         return bad;
1201 }
1202
1203 /**
1204  * Dumps the attributes of a node n into the file F.
1205  * Currently this is only the color of a node.
1206  */
1207 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1208 {
1209         ir_mode *mode;
1210         ir_node *n;
1211
1212         if (bad) {
1213                 print_vcg_color(F, ird_color_error);
1214                 return;
1215         }
1216
1217         if (dump_node_vcgattr_hook)
1218                 if (dump_node_vcgattr_hook(F, node, local))
1219                         return;
1220
1221         n = local ? local : node;
1222
1223         if (overrule_nodecolor != ird_color_default_node) {
1224                 print_vcg_color(F, overrule_nodecolor);
1225                 return;
1226         }
1227
1228         mode = get_irn_mode(node);
1229         if(mode == mode_M) {
1230                 print_vcg_color(F, ird_color_memory);
1231                 return;
1232         }
1233         if(mode == mode_X) {
1234                 print_vcg_color(F, ird_color_controlflow);
1235                 return;
1236         }
1237
1238         switch (get_irn_opcode(n)) {
1239         case iro_Start:
1240         case iro_EndReg:
1241         case iro_EndExcept:
1242         case iro_End:
1243                 print_vcg_color(F, ird_color_anchor);
1244                 break;
1245         case iro_Bad:
1246                 print_vcg_color(F, ird_color_error);
1247                 break;
1248         case iro_Block:
1249                 if (is_Block_dead(n))
1250                         print_vcg_color(F, ird_color_dead_block_background);
1251                 else
1252                         print_vcg_color(F, ird_color_block_background);
1253                 break;
1254         case iro_Phi:
1255                 print_vcg_color(F, ird_color_phi);
1256                 break;
1257         case iro_Pin:
1258                 print_vcg_color(F, ird_color_memory);
1259                 break;
1260         case iro_SymConst:
1261         case iro_Const:
1262                 print_vcg_color(F, ird_color_const);
1263                 break;
1264         case iro_Proj:
1265                 print_vcg_color(F, ird_color_proj);
1266                 break;
1267         default: {
1268                 ir_op *op = get_irn_op(node);
1269
1270                 if(is_op_constlike(op)) {
1271                         print_vcg_color(F, ird_color_const);
1272                 } else if(is_op_uses_memory(op)) {
1273                         print_vcg_color(F, ird_color_uses_memory);
1274                 } else if(is_op_cfopcode(op) || is_op_forking(op)) {
1275                         print_vcg_color(F, ird_color_controlflow);
1276                 } else {
1277                         PRINT_DEFAULT_NODE_ATTR;
1278                 }
1279         }
1280         }
1281 }
1282
1283 /* Adds a new node info dumper callback. */
1284 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1285 {
1286         hook_entry_t *info = xmalloc(sizeof(*info));
1287
1288         info->hook._hook_node_info = cb;
1289         info->context              = data;
1290         register_hook(hook_node_info, info);
1291
1292         return info;
1293 }
1294
1295 /* Remove a previously added info dumper callback. */
1296 void dump_remv_node_info_callback(void *handle)
1297 {
1298         hook_entry_t *info = handle;
1299         unregister_hook(hook_node_info, info);
1300         xfree(info);
1301 }
1302
1303 /**
1304  * Dump the node information of a node n to a file F.
1305  */
1306 static INLINE int dump_node_info(FILE *F, ir_node *n)
1307 {
1308         int bad = 0;
1309         const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1310
1311         fprintf(F, " info1: \"");
1312         bad = dump_irnode_to_file(F, n);
1313         /* call the dump_node operation if available */
1314         if (ops->dump_node)
1315                 bad = ops->dump_node(n, F, dump_node_info_txt);
1316
1317         /* allow additional info to be added */
1318         hook_node_info(F, n);
1319         fprintf(F, "\"\n");
1320
1321         return bad;
1322 }
1323
1324 static INLINE int is_constlike_node(const ir_node *node)
1325 {
1326         const ir_op *op = get_irn_op(node);
1327         return is_op_constlike(op);
1328 }
1329
1330
1331 /** outputs the predecessors of n, that are constants, local.  I.e.,
1332    generates a copy of the constant predecessors for each node called with. */
1333 static void dump_const_node_local(FILE *F, ir_node *n) {
1334         int i;
1335         if (!get_opt_dump_const_local()) return;
1336
1337         /* Use visited flag to avoid outputting nodes twice.
1338         initialize it first. */
1339         for (i = 0; i < get_irn_arity(n); i++) {
1340                 ir_node *con = get_irn_n(n, i);
1341                 if (is_constlike_node(con)) {
1342                         set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1343                 }
1344         }
1345
1346         for (i = 0; i < get_irn_arity(n); i++) {
1347                 ir_node *con = get_irn_n(n, i);
1348                 if (is_constlike_node(con) && irn_not_visited(con)) {
1349                         int bad = 0;
1350
1351                         mark_irn_visited(con);
1352                         /* Generate a new name for the node by appending the names of
1353                         n and const. */
1354                         fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1355                         fprintf(F, " label: \"");
1356                         bad |= dump_node_label(F, con);
1357                         fprintf(F, "\" ");
1358                         bad |= dump_node_info(F, con);
1359                         dump_node_vcgattr(F, n, con, bad);
1360                         fprintf(F, "}\n");
1361                 }
1362         }
1363 }
1364
1365 /** If the block of an edge is a const_like node, dump it local with an edge */
1366 static void dump_const_block_local(FILE *F, ir_node *n) {
1367         ir_node *blk;
1368
1369         if (!get_opt_dump_const_local()) return;
1370
1371         blk = get_nodes_block(n);
1372         if (is_constlike_node(blk)) {
1373                 int bad = 0;
1374
1375                 /* Generate a new name for the node by appending the names of
1376                 n and blk. */
1377                 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1378                 fprintf(F, "\" label: \"");
1379                 bad |= dump_node_label(F, blk);
1380                 fprintf(F, "\" ");
1381                 bad |= dump_node_info(F, blk);
1382                 dump_node_vcgattr(F, n, blk, bad);
1383                 fprintf(F, "}\n");
1384
1385                 fprintf(F, "edge: { sourcename: \"");
1386                 PRINT_NODEID(n);
1387                 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1388
1389                 if (dump_edge_vcgattr_hook) {
1390                         fprintf(F, "\" ");
1391                         if (dump_edge_vcgattr_hook(F, n, -1)) {
1392                                 fprintf(F, "}\n");
1393                                 return;
1394                         } else {
1395                                 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1396                                 return;
1397                         }
1398                 }
1399
1400                 fprintf(F, "\" "   BLOCK_EDGE_ATTR "}\n");
1401         }
1402 }
1403
1404 /**
1405  * prints the error message of a node to a file F as info2.
1406  */
1407 static void print_node_error(FILE *F, const char *err_msg)
1408 {
1409         if (! err_msg)
1410                 return;
1411
1412         fprintf(F, " info2: \"%s\"", err_msg);
1413 }
1414
1415 /**
1416  * prints debug messages of a node to file F as info3.
1417  */
1418 static void print_dbg_info(FILE *F, dbg_info *dbg)
1419 {
1420         char buf[1024];
1421
1422         if (__dbg_info_snprint) {
1423                 buf[0] = '\0';
1424                 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1425                         fprintf(F, " info3: \"%s\"\n", buf);
1426         }
1427 }
1428
1429 /**
1430  * Dump a node
1431  */
1432 static void dump_node(FILE *F, ir_node *n)
1433 {
1434         int bad = 0;
1435         const char *p;
1436
1437         if (get_opt_dump_const_local() && is_constlike_node(n))
1438                 return;
1439
1440         /* dump this node */
1441         fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1442
1443         bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1444         bad |= dump_node_label(F, n);
1445         dump_node_ana_vals(F, n);
1446         //dump_node_ana_info(F, n);
1447         fprintf(F, "\" ");
1448         bad |= dump_node_info(F, n);
1449         print_node_error(F, p);
1450         print_dbg_info(F, get_irn_dbg_info(n));
1451         dump_node_vcgattr(F, n, NULL, bad);
1452         fprintf(F, "}\n");
1453         dump_const_node_local(F, n);
1454
1455         if(dump_node_edge_hook)
1456                 dump_node_edge_hook(F, n);
1457 #if DO_HEAPANALYSIS
1458         dump_irn_chi_term(F, n);
1459         dump_irn_state(F, n);
1460 #endif
1461 }
1462
1463 /** dump the edge to the block this node belongs to */
1464 static void
1465 dump_ir_block_edge(FILE *F, ir_node *n)  {
1466         if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1467         if (is_no_Block(n)) {
1468                 ir_node *block = get_nodes_block(n);
1469
1470                 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1471                         dump_const_block_local(F, n);
1472                 } else {
1473                         fprintf(F, "edge: { sourcename: \"");
1474                         PRINT_NODEID(n);
1475                         fprintf(F, "\" targetname: ");
1476                         fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1477
1478                         if (dump_edge_vcgattr_hook) {
1479                                 fprintf(F, " ");
1480                                 if (dump_edge_vcgattr_hook(F, n, -1)) {
1481                                         fprintf(F, "}\n");
1482                                         return;
1483                                 } else {
1484                                         fprintf(F, " "  BLOCK_EDGE_ATTR "}\n");
1485                                         return;
1486                                 }
1487                         }
1488
1489                         fprintf(F, " "   BLOCK_EDGE_ATTR "}\n");
1490                 }
1491         }
1492 }
1493
1494 static void
1495 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1496         /*
1497          * do not use get_nodes_block() here, will fail
1498          * if the irg is not pinned.
1499          */
1500         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1501                 fprintf(F, INTRA_DATA_EDGE_ATTR);
1502         else
1503                 fprintf(F, INTER_DATA_EDGE_ATTR);
1504 }
1505
1506 static void
1507 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1508         /*
1509          * do not use get_nodes_block() here, will fail
1510          * if the irg is not pinned.
1511          */
1512         if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1513                 fprintf(F, INTRA_MEM_EDGE_ATTR);
1514         else
1515                 fprintf(F, INTER_MEM_EDGE_ATTR);
1516 }
1517
1518 /** Print the vcg attributes for the edge from node from to it's to's input */
1519 static void print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1520         assert(from);
1521
1522         if (dump_edge_vcgattr_hook)
1523                 if (dump_edge_vcgattr_hook(F, from, to))
1524                         return;
1525
1526         if (dump_backedge_information_flag && is_backedge(from, to))
1527                 fprintf(F, BACK_EDGE_ATTR);
1528
1529         switch (get_irn_opcode(from)) {
1530         case iro_Block:
1531                 fprintf(F, CF_EDGE_ATTR);
1532                 break;
1533         case iro_Start:  break;
1534         case iro_End:
1535                 if (to >= 0) {
1536                         if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1537                                 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1538                         else
1539                                 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1540                 }
1541                 break;
1542         default:
1543                 if (is_Proj(from)) {
1544                         if (get_irn_mode(from) == mode_M)
1545                                 print_mem_edge_vcgattr(F, from, to);
1546                         else if (get_irn_mode(from) == mode_X)
1547                                 fprintf(F, CF_EDGE_ATTR);
1548                         else
1549                                 print_data_edge_vcgattr(F, from, to);
1550                 }
1551                 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1552                         print_mem_edge_vcgattr(F, from, to);
1553                 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1554                         fprintf(F, CF_EDGE_ATTR);
1555                 else
1556                         print_data_edge_vcgattr(F, from, to);
1557         }
1558 }
1559
1560 /** dump edges to our inputs */
1561 static void dump_ir_data_edges(FILE *F, ir_node *n)  {
1562         int i, num;
1563         unsigned long visited = get_irn_visited(n);
1564
1565         if (!dump_keepalive && is_End(n)) {
1566                 /* the End node has only keep-alive edges */
1567                 return;
1568         }
1569
1570         /* dump the dependency edges. */
1571         num = get_irn_deps(n);
1572         for (i = 0; i < num; ++i) {
1573                 ir_node *dep = get_irn_dep(n, i);
1574
1575                 if (dep) {
1576                         fprintf(F, "edge: {sourcename: \"");
1577                         PRINT_NODEID(n);
1578                         fprintf(F, "\" targetname: ");
1579                         if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1580                                 PRINT_CONSTID(n, dep);
1581                         } else {
1582                                 fprintf(F, "\"");
1583                                 PRINT_NODEID(dep);
1584                                 fprintf(F, "\"");
1585                         }
1586                         fprintf(F, " label: \"%d\" ", i);
1587                         fprintf(F, " color: darkgreen}\n");
1588                 }
1589         }
1590
1591         num = get_irn_arity(n);
1592         for (i = 0; i < num; i++) {
1593                 ir_node *pred = get_irn_n(n, i);
1594                 assert(pred);
1595
1596                 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1597                         continue; /* pred not dumped */
1598
1599                 if (dump_backedge_information_flag && is_backedge(n, i))
1600                         fprintf(F, "backedge: {sourcename: \"");
1601                 else
1602                         fprintf(F, "edge: {sourcename: \"");
1603                 PRINT_NODEID(n);
1604                 fprintf(F, "\" targetname: ");
1605                 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1606                         PRINT_CONSTID(n, pred);
1607                 } else {
1608                         fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1609                 }
1610                 fprintf(F, " label: \"%d\" ", i);
1611                 print_edge_vcgattr(F, n, i);
1612                 fprintf(F, "}\n");
1613         }
1614
1615         if (dump_macro_block_edges && is_Block(n)) {
1616                 ir_node *mb = get_Block_MacroBlock(n);
1617                 fprintf(F, "edge: {sourcename: \"");
1618                 PRINT_NODEID(n);
1619                 fprintf(F, "\" targetname: \"");
1620                 PRINT_NODEID(mb);
1621                 fprintf(F, "\" label: \"mb\" " MACROBLOCK_EDGE_ATTR);
1622                 fprintf(F, "}\n");
1623         }
1624 }
1625
1626 /**
1627  * Dump the ir_edges
1628  */
1629 static void
1630 dump_ir_edges(FILE *F, ir_node *n) {
1631         const ir_edge_t *edge;
1632         int i = 0;
1633
1634         foreach_out_edge(n, edge) {
1635                 ir_node *succ = get_edge_src_irn(edge);
1636
1637                 fprintf(F, "edge: {sourcename: \"");
1638                 PRINT_NODEID(n);
1639                 fprintf(F, "\" targetname: \"");
1640                 PRINT_NODEID(succ);
1641                 fprintf(F, "\"");
1642
1643                 fprintf(F, " label: \"%d\" ", i);
1644                 fprintf(F, OUT_EDGE_ATTR);
1645                 fprintf(F, "}\n");
1646                 ++i;
1647         }
1648 }
1649
1650
1651 /** Dumps a node and its edges but not the block edge  */
1652 static void dump_node_wo_blockedge(ir_node *n, void *env) {
1653         FILE *F = env;
1654         dump_node(F, n);
1655         dump_ir_data_edges(F, n);
1656 }
1657
1658 /** Dumps a node and its edges. */
1659 static void dump_whole_node(ir_node *n, void *env) {
1660         FILE *F = env;
1661         dump_node_wo_blockedge(n, env);
1662         if (!node_floats(n))
1663                 dump_ir_block_edge(F, n);
1664         if (dump_new_edges_flag && edges_activated(current_ir_graph))
1665                 dump_ir_edges(F, n);
1666 }
1667
1668 /** Dumps a const-like node. */
1669 static void dump_const_node(ir_node *n, void *env) {
1670         if (is_Block(n)) return;
1671         dump_node_wo_blockedge(n, env);
1672 }
1673
1674 /***********************************************************************/
1675 /* the following routines dump the nodes/irgs bracketed to graphs.     */
1676 /***********************************************************************/
1677
1678 /** Dumps a constant expression as entity initializer, array bound ...
1679  */
1680 static void dump_const_expression(FILE *F, ir_node *value) {
1681         ir_graph *rem = current_ir_graph;
1682         int rem_dump_const_local = dump_const_local;
1683         dump_const_local = 0;
1684         current_ir_graph = get_const_code_irg();
1685         irg_walk(value, dump_const_node, NULL, F);
1686         /* Decrease visited flag so that we walk with the same flag for the next
1687            expression.  This guarantees that we don't dump the same node twice,
1688            as for const expressions cse is performed to save memory. */
1689         set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1690         current_ir_graph = rem;
1691         dump_const_local = rem_dump_const_local;
1692 }
1693
1694 /** Dump a block as graph containing its nodes.
1695  *
1696  *  Expects to find nodes belonging to the block as list in its
1697  *  link field.
1698  *  Dumps the edges of all nodes including itself. */
1699 static void dump_whole_block(FILE *F, ir_node *block) {
1700         ir_node *node;
1701         ird_color_t color = ird_color_block_background;
1702
1703         assert(is_Block(block));
1704
1705         fprintf(F, "graph: { title: \"");
1706         PRINT_NODEID(block);
1707         fprintf(F, "\"  label: \"");
1708         dump_node_label(F, block);
1709 #if DO_HEAPANALYSIS
1710         if (get_opt_dump_abstvals())
1711                 fprintf(F, " seqno: %d", (int)get_Block_seqno(block));
1712 #endif
1713
1714         /* colorize blocks */
1715         if (! get_Block_matured(block))
1716                 color = ird_color_block_background;
1717         if (is_Block_dead(block))
1718                 color = ird_color_dead_block_background;
1719
1720         fprintf(F, "\" status:clustered ");
1721         print_vcg_color(F, color);
1722         fprintf(F, "\n");
1723
1724         /* yComp can show attributes for blocks, XVCG parses but ignores them */
1725         dump_node_info(F, block);
1726         print_dbg_info(F, get_irn_dbg_info(block));
1727
1728         /* dump the blocks edges */
1729         dump_ir_data_edges(F, block);
1730
1731         if (dump_block_edge_hook)
1732                 dump_block_edge_hook(F, block);
1733
1734         /* dump the nodes that go into the block */
1735         for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1736                 dump_node(F, node);
1737                 dump_ir_data_edges(F, node);
1738         }
1739
1740         /* Close the vcg information for the block */
1741         fprintf(F, "}\n");
1742         dump_const_node_local(F, block);
1743 #if DO_HEAPANALYSIS
1744         dump_irn_chi_term(F, block);
1745 #endif
1746         fprintf(F, "\n");
1747 }
1748
1749 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1750  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1751 static void
1752 dump_block_graph(FILE *F, ir_graph *irg) {
1753         int i;
1754         ir_graph *rem = current_ir_graph;
1755         ir_node **arr = ird_get_irg_link(irg);
1756         current_ir_graph = irg;
1757
1758         for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1759                 ir_node * node = arr[i];
1760                 if (is_Block(node)) {
1761                 /* Dumps the block and all the nodes in the block, which are to
1762                         be found in Block->link. */
1763                         dump_whole_block(F, node);
1764                 } else {
1765                         /* Nodes that are not in a Block. */
1766                         dump_node(F, node);
1767                         if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1768                                 dump_const_block_local(F, node);
1769                         }
1770                         dump_ir_data_edges(F, node);
1771                 }
1772                 if (dump_new_edges_flag && edges_activated(irg))
1773                         dump_ir_edges(F, node);
1774         }
1775
1776         if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1777                 dump_loop_nodes_into_graph(F, irg);
1778
1779         current_ir_graph = rem;
1780 }
1781
1782 /**
1783  * Dump the info for an irg.
1784  * Parsed by XVCG but not shown. use yComp.
1785  */
1786 static void dump_graph_info(FILE *F, ir_graph *irg) {
1787         fprintf(F, "info1: \"");
1788         dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1789         fprintf(F, "\"\n");
1790 }
1791
1792 /** Dumps an irg as a graph clustered by block nodes.
1793  *  If interprocedural view edges can point to nodes out of this graph.
1794  */
1795 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1796         ir_entity *ent = get_irg_entity(irg);
1797
1798         fprintf(F, "graph: { title: \"");
1799         PRINT_IRGID(irg);
1800         fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1801           get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1802
1803         dump_graph_info(F, irg);
1804         print_dbg_info(F, get_entity_dbg_info(ent));
1805
1806         dump_block_graph(F, irg);
1807
1808         /* Close the vcg information for the irg */
1809         fprintf(F, "}\n\n");
1810 }
1811
1812 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1813  *  The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1814 static void
1815 dump_extblock_graph(FILE *F, ir_graph *irg) {
1816         int i;
1817         ir_graph *rem = current_ir_graph;
1818         ir_extblk **arr = ird_get_irg_link(irg);
1819         current_ir_graph = irg;
1820
1821         for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1822                 ir_extblk *extbb = arr[i];
1823                 ir_node *leader = get_extbb_leader(extbb);
1824                 int j;
1825
1826                 fprintf(F, "graph: { title: \"");
1827                 PRINT_EXTBBID(leader);
1828                 fprintf(F, "\"  label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1829                         get_irn_node_nr(leader));
1830
1831                 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1832                         ir_node * node = extbb->blks[j];
1833                         if (is_Block(node)) {
1834                         /* Dumps the block and all the nodes in the block, which are to
1835                                 be found in Block->link. */
1836                                 dump_whole_block(F, node);
1837                         } else {
1838                                 /* Nodes that are not in a Block. */
1839                                 dump_node(F, node);
1840                                 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1841                                         dump_const_block_local(F, node);
1842                                 }
1843                                 dump_ir_data_edges(F, node);
1844                         }
1845                 }
1846                 fprintf(F, "}\n");
1847         }
1848
1849         if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1850                 dump_loop_nodes_into_graph(F, irg);
1851
1852         current_ir_graph = rem;
1853         free_extbb(irg);
1854 }
1855
1856
1857 /*******************************************************************/
1858 /* Basic type and entity nodes and edges.                          */
1859 /*******************************************************************/
1860
1861 /** dumps the edges between nodes and their type or entity attributes. */
1862 static void dump_node2type_edges(ir_node *n, void *env)
1863 {
1864         FILE *F = env;
1865         assert(n);
1866
1867         switch (get_irn_opcode(n)) {
1868         case iro_Const :
1869                 /* @@@ some consts have an entity */
1870                 break;
1871         case iro_SymConst:
1872                 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1873                         print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1874                 break;
1875         case iro_Sel:
1876                 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1877                 break;
1878         case iro_Call:
1879                 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1880                 break;
1881         case iro_Alloc:
1882                 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1883                 break;
1884         case iro_Free:
1885                 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1886                 break;
1887         case iro_Cast:
1888                 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1889                 break;
1890         default:
1891                 break;
1892         }
1893 }
1894
1895 #if 0
1896 static int print_type_info(FILE *F, ir_type *tp) {
1897         int bad = 0;
1898
1899         if (get_type_state(tp) == layout_undefined) {
1900                 fprintf(F, "state: layout_undefined\n");
1901         } else {
1902                 fprintf(F, "state: layout_fixed,\n");
1903         }
1904         if (get_type_mode(tp))
1905                 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1906         fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1907
1908         return bad;
1909 }
1910
1911 static void print_typespecific_info(FILE *F, ir_type *tp) {
1912         switch (get_type_tpop_code(tp)) {
1913         case tpo_class:
1914                 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1915                 break;
1916         case tpo_struct:
1917                 break;
1918         case tpo_method:
1919                 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1920                 fprintf(F, "params: %d\n", get_method_n_params(tp));
1921                 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1922                 break;
1923         case tpo_union:
1924                 break;
1925         case tpo_array:
1926                 break;
1927         case tpo_enumeration:
1928                 break;
1929         case tpo_pointer:
1930                 break;
1931         case tpo_primitive:
1932                 break;
1933         default:
1934                 break;
1935         } /* switch type */
1936 }
1937 #endif
1938
1939 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1940         switch (get_type_tpop_code(tp)) {
1941         case tpo_class:
1942                 if (peculiarity_existent == get_class_peculiarity(tp))
1943                         fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1944                 else
1945                         fprintf(F, " " TYPE_DESCRIPTION_NODE_ATTR);
1946                 break;
1947         case tpo_struct:
1948                 fprintf(F, " " TYPE_METH_NODE_ATTR);
1949                 break;
1950         case tpo_method:
1951                 break;
1952         case tpo_union:
1953                 break;
1954         case tpo_array:
1955                 break;
1956         case tpo_enumeration:
1957                 break;
1958         case tpo_pointer:
1959                 break;
1960         case tpo_primitive:
1961                 break;
1962         default:
1963                 break;
1964         } /* switch type */
1965 }
1966
1967
1968 int dump_type_node(FILE *F, ir_type *tp)
1969 {
1970         int bad = 0;
1971
1972         fprintf(F, "node: {title: ");
1973         PRINT_TYPEID(tp);
1974         fprintf(F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1975         fprintf(F, " info1: \"");
1976 #if 0
1977         bad |= print_type_info(F, tp);
1978         print_typespecific_info(F, tp);
1979 #else
1980         dump_type_to_file(F, tp, dump_verbosity_max);
1981 #endif
1982         fprintf(F, "\"\n");
1983         print_dbg_info(F, get_type_dbg_info(tp));
1984         print_typespecific_vcgattr(F, tp);
1985         fprintf(F, "}\n");
1986
1987         return bad;
1988 }
1989
1990
1991 void dump_entity_node(FILE *F, ir_entity *ent, int color)
1992 {
1993         fprintf(F, "node: {title: \"");
1994         PRINT_ENTID(ent); fprintf(F, "\"");
1995         fprintf(F, DEFAULT_TYPE_ATTRIBUTE);
1996         fprintf(F, "label: ");
1997         fprintf(F, "\"ent %s\" ", get_ent_dump_name(ent));
1998         if (color)
1999                 fprintf(F, "color:%d", color);
2000         else
2001                 fprintf(F, ENTITY_NODE_ATTR);
2002         fprintf(F, "\n info1: \"");
2003
2004         dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
2005
2006         fprintf(F, "\"\n");
2007         print_dbg_info(F, get_entity_dbg_info(ent));
2008         fprintf(F, "}\n");
2009 }
2010
2011 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
2012 {
2013         char buf[1024];
2014         ir_enum_const *ec = get_enumeration_const(tp, pos);
2015         ident         *id = get_enumeration_nameid(ec);
2016         tarval        *tv = get_enumeration_value(ec);
2017
2018         if (tv)
2019                 tarval_snprintf(buf, sizeof(buf), tv);
2020         else
2021                 strncpy(buf, "<not set>", sizeof(buf));
2022         fprintf(F, "node: {title: \"");
2023         PRINT_ITEMID(tp, pos); fprintf(F, "\"");
2024         fprintf(F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
2025         fprintf(F, "label: ");
2026         fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
2027         fprintf(F, "\n info1: \"value: %s\"}\n", buf);
2028 }
2029
2030 /* dumps a type or entity and it's edges. */
2031 static void
2032 dump_type_info(type_or_ent *tore, void *env) {
2033         FILE *F = env;
2034         int i = 0;  /* to shutup gcc */
2035
2036         /* dump this type or entity */
2037
2038         switch (get_kind(tore)) {
2039         case k_entity: {
2040                 ir_entity *ent = (ir_entity *)tore;
2041                 ir_node *value;
2042                 /* The node */
2043                 dump_entity_node(F, ent, 0);
2044                 /* The Edges */
2045                 /* skip this to reduce graph.  Member edge of type is parallel to this edge. *
2046                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2047                 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
2048                 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
2049                 if (is_Class_type(get_entity_owner(ent))) {
2050                         for(i = 0; i < get_entity_n_overwrites(ent); i++)
2051                                 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
2052                 }
2053                 /* attached subgraphs */
2054                 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
2055                         if (is_atomic_entity(ent)) {
2056                                 value = get_atomic_ent_value(ent);
2057                                 if (value) {
2058                                         print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2059                                         /* DDMN(value);  $$$ */
2060                                         dump_const_expression(F, value);
2061                                 }
2062                         }
2063                         if (is_compound_entity(ent)) {
2064                                 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
2065                                         value = get_compound_ent_value(ent, i);
2066                                         if (value) {
2067                                                 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2068                                                 dump_const_expression(F, value);
2069                                                 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
2070                                                 /*
2071                                                 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2072                                                 ENT_CORR_EDGE_ATTR  "}\n", GET_ENTID(ent),
2073                                                 get_compound_ent_value_member(ent, i), i);
2074                                                 */
2075                                         }
2076                                 }
2077                         }
2078                 }
2079                 break;
2080         }
2081         case k_type: {
2082                 ir_type *tp = (ir_type *)tore;
2083                 dump_type_node(F, tp);
2084                 /* and now the edges */
2085                 switch (get_type_tpop_code(tp)) {
2086                 case tpo_class:
2087                         for (i=0; i < get_class_n_supertypes(tp); i++)
2088                                 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2089                         for (i=0; i < get_class_n_members(tp); i++)
2090                                 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2091                         break;
2092                 case tpo_struct:
2093                         for (i=0; i < get_struct_n_members(tp); i++)
2094                                 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2095                         break;
2096                 case tpo_method:
2097                         for (i = 0; i < get_method_n_params(tp); i++)
2098                                 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
2099                         for (i = 0; i < get_method_n_ress(tp); i++)
2100                                 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
2101                         break;
2102                 case tpo_union:
2103                         for (i = 0; i < get_union_n_members(tp); i++)
2104                                 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
2105                         break;
2106                 case tpo_array:
2107                         print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
2108                         print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
2109                         for (i = 0; i < get_array_n_dimensions(tp); i++) {
2110                                 ir_node *upper = get_array_upper_bound(tp, i);
2111                                 ir_node *lower = get_array_lower_bound(tp, i);
2112                                 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
2113                                 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
2114                                 dump_const_expression(F, upper);
2115                                 dump_const_expression(F, lower);
2116                         }
2117                         break;
2118                 case tpo_enumeration:
2119                         for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
2120                                 dump_enum_item(F, tp, i);
2121                                 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
2122                         }
2123                         break;
2124                 case tpo_pointer:
2125                         print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
2126                         break;
2127                 case tpo_primitive:
2128                         break;
2129                 default:
2130                         break;
2131                 } /* switch type */
2132                 break; /* case k_type */
2133         }
2134         default:
2135                 printf(" *** irdump,  dump_type_info(l.%i), faulty type.\n", __LINE__);
2136         } /* switch kind_or_entity */
2137 }
2138
2139 typedef struct _h_env {
2140         int dump_ent;
2141         FILE *f;
2142 } h_env_t;
2143
2144 /** For dumping class hierarchies.
2145  * Dumps a class type node and a superclass edge.
2146  * If env->dump_ent dumps entities of classes and overwrites edges.
2147  */
2148 static void
2149 dump_class_hierarchy_node(type_or_ent *tore, void *ctx) {
2150         h_env_t *env = ctx;
2151         FILE *F = env->f;
2152         int i = 0;  /* to shutup gcc */
2153
2154         /* dump this type or entity */
2155         switch (get_kind(tore)) {
2156         case k_entity: {
2157                 ir_entity *ent = (ir_entity *)tore;
2158                 if (get_entity_owner(ent) == get_glob_type()) break;
2159                 if (!is_Method_type(get_entity_type(ent))) break;  /* GL */
2160                 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2161                         /* The node */
2162                         dump_entity_node(F, ent, 0);
2163                         /* The edges */
2164                         print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2165                         for(i = 0; i < get_entity_n_overwrites(ent); i++)
2166                                 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2167                 }
2168                 break;
2169         }
2170         case k_type: {
2171                 ir_type *tp = (ir_type *)tore;
2172                 if (tp == get_glob_type()) break;
2173                 switch (get_type_tpop_code(tp)) {
2174                 case tpo_class:
2175                         dump_type_node(F, tp);
2176                         /* and now the edges */
2177                         for (i=0; i < get_class_n_supertypes(tp); i++) {
2178                                 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2179                         }
2180                         break;
2181                 default: break;
2182                 } /* switch type */
2183                 break; /* case k_type */
2184         }
2185         default:
2186                 printf(" *** irdump,  dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2187         } /* switch kind_or_entity */
2188 }
2189
2190 /*******************************************************************/
2191 /* dump analysis information that is expressed in graph terms.     */
2192 /*******************************************************************/
2193
2194 /* dump out edges */
2195 static void
2196 dump_out_edge(ir_node *n, void *env) {
2197         FILE *F = env;
2198         int i;
2199         for (i = 0; i < get_irn_n_outs(n); i++) {
2200                 assert(get_irn_out(n, i));
2201                 fprintf(F, "edge: {sourcename: \"");
2202                 PRINT_NODEID(n);
2203                 fprintf(F, "\" targetname: \"");
2204                 PRINT_NODEID(get_irn_out(n, i));
2205                 fprintf(F, "\" color: red linestyle: dashed");
2206                 fprintf(F, "}\n");
2207         }
2208 }
2209
2210 static INLINE void
2211 dump_loop_label(FILE *F, ir_loop *loop) {
2212         fprintf(F, "loop %d, %d sons, %d nodes",
2213                 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2214 }
2215
2216 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2217         fprintf(F, " info1: \"");
2218         fprintf(F, " loop nr: %d", get_loop_loop_nr(loop));
2219 #ifdef DEBUG_libfirm   /* GL @@@ debug analyses */
2220         fprintf(F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2221 #endif
2222         fprintf(F, "\"");
2223 }
2224
2225 static INLINE void
2226 dump_loop_node(FILE *F, ir_loop *loop) {
2227         fprintf(F, "node: {title: \"");
2228         PRINT_LOOPID(loop);
2229         fprintf(F, "\" label: \"");
2230         dump_loop_label(F, loop);
2231         fprintf(F, "\" ");
2232         dump_loop_info(F, loop);
2233         fprintf(F, "}\n");
2234 }
2235
2236 static INLINE void
2237 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2238         assert(loop);
2239         fprintf(F, "edge: {sourcename: \"");
2240         PRINT_LOOPID(loop);
2241         fprintf(F, "\" targetname: \"");
2242         PRINT_NODEID(get_loop_node(loop, i));
2243         fprintf(F, "\" color: green");
2244         fprintf(F, "}\n");
2245 }
2246
2247 static INLINE void
2248 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2249         assert(loop);
2250         fprintf(F, "edge: {sourcename: \"");
2251         PRINT_LOOPID(loop);
2252         fprintf(F, "\" targetname: \"");
2253         PRINT_LOOPID(get_loop_son(loop, i));
2254         fprintf(F, "\" color: darkgreen label: \"%d\"}\n",
2255                 get_loop_element_pos(loop, get_loop_son(loop, i)));
2256 }
2257
2258 static
2259 void dump_loops(FILE *F, ir_loop *loop) {
2260         int i;
2261         /* dump this loop node */
2262         dump_loop_node(F, loop);
2263
2264         /* dump edges to nodes in loop -- only if it is a real loop */
2265         if (get_loop_depth(loop) != 0) {
2266                 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2267                         dump_loop_node_edge(F, loop, i);
2268                 }
2269         }
2270         for (i = 0; i < get_loop_n_sons(loop); i++) {
2271                 dump_loops(F, get_loop_son(loop, i));
2272                 dump_loop_son_edge(F, loop, i);
2273         }
2274 }
2275
2276 static INLINE
2277 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2278         ir_graph *rem = current_ir_graph;
2279         current_ir_graph = irg;
2280
2281         if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2282
2283         current_ir_graph = rem;
2284 }
2285
2286
2287 /**
2288  * dumps the VCG header
2289  */
2290 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2291         int   i;
2292         char *label;
2293
2294         init_colors();
2295
2296         if (edge_label) {
2297                 label = "yes";
2298         } else {
2299                 label = "no";
2300         }
2301
2302         if (!orientation) orientation = "bottom_to_top";
2303
2304         /* print header */
2305         fprintf(F,
2306                 "graph: { title: \"ir graph of %s\"\n"
2307                 "display_edge_labels: %s\n"
2308                 "layoutalgorithm: mindepth\n"
2309                 "manhattan_edges: yes\n"
2310                 "port_sharing: no\n"
2311                 "orientation: %s\n"
2312                 "classname 1:  \"intrablock Data\"\n"
2313                 "classname 2:  \"Block\"\n"
2314                 "classname 3:  \"Entity type\"\n"
2315                 "classname 4:  \"Entity owner\"\n"
2316                 "classname 5:  \"Method Param\"\n"
2317                 "classname 6:  \"Method Res\"\n"
2318                 "classname 7:  \"Super\"\n"
2319                 "classname 8:  \"Union\"\n"
2320                 "classname 9:  \"Points-to\"\n"
2321                 "classname 10: \"Array Element Type\"\n"
2322                 "classname 11: \"Overwrites\"\n"
2323                 "classname 12: \"Member\"\n"
2324                 "classname 13: \"Control Flow\"\n"
2325                 "classname 14: \"intrablock Memory\"\n"
2326                 "classname 15: \"Dominators\"\n"
2327                 "classname 16: \"interblock Data\"\n"
2328                 "classname 17: \"interblock Memory\"\n"
2329                 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2330                 "classname 19: \"Postdominators\"\n"
2331                 "classname 20: \"Keep Alive\"\n"
2332                 "classname 21: \"Out Edges\"\n"
2333                 "classname 22: \"Macro Block Edges\"\n"
2334                 "infoname 1: \"Attribute\"\n"
2335                 "infoname 2: \"Verification errors\"\n"
2336                 "infoname 3: \"Debug info\"\n",
2337                 name, label, orientation);
2338
2339         for (i = 0; i < ird_color_count; ++i) {
2340                 if(color_rgb[i] != NULL) {
2341                         fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2342                 }
2343         }
2344         fprintf(F, "\n");        /* a separator */
2345 }
2346
2347 /**
2348  * open a vcg file
2349  *
2350  * @param irg     The graph to be dumped
2351  * @param suffix1 first filename suffix
2352  * @param suffix2 second filename suffix
2353  */
2354 FILE *vcg_open(ir_graph *irg, const char * suffix1, const char *suffix2) {
2355         FILE *F;
2356         const char *nm = get_irg_dump_name(irg);
2357         int len = strlen(nm), i, j;
2358         char *fname;  /* filename to put the vcg information in */
2359
2360         if (!suffix1) suffix1 = "";
2361         if (!suffix2) suffix2 = "";
2362
2363         /* open file for vcg graph */
2364         fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2365
2366         /* strncpy (fname, nm, len); */     /* copy the filename */
2367         j = 0;
2368         for (i = 0; i < len; ++i) {  /* replace '/' in the name: escape by @. */
2369                 if (nm[i] == '/') {
2370                         fname[j] = '@'; j++; fname[j] = '1'; j++;
2371                 } else if (nm[i] == '@') {
2372                         fname[j] = '@'; j++; fname[j] = '2'; j++;
2373                 } else {
2374                         fname[j] = nm[i]; j++;
2375                 }
2376         }
2377         fname[j] = '\0';
2378         strcat(fname, suffix1);  /* append file suffix */
2379         strcat(fname, suffix2);  /* append file suffix */
2380         strcat(fname, ".vcg");   /* append the .vcg suffix */
2381
2382         /* vcg really expect only a <CR> at end of line, so
2383          * the "b"inary mode is what you mean (and even needed for Win32)
2384          */
2385         F = fopen(fname, "wb");  /* open file for writing */
2386         if (!F) {
2387                 perror(fname);
2388         }
2389         free(fname);
2390
2391         return F;
2392 }
2393
2394 /**
2395  * open a vcg file
2396  *
2397  * @param name    prefix file name
2398  * @param suffix  filename suffix
2399  */
2400 FILE *vcg_open_name(const char *name, const char *suffix) {
2401         FILE *F;
2402         char *fname;  /* filename to put the vcg information in */
2403         int i, j, len = strlen(name);
2404
2405         if (!suffix) suffix = "";
2406
2407         /** open file for vcg graph */
2408         fname = xmalloc(len * 2 + 5 + strlen(suffix));
2409         /* strcpy (fname, name);*/    /* copy the filename */
2410         j = 0;
2411         for (i = 0; i < len; ++i) {  /* replace '/' in the name: escape by @. */
2412                 if (name[i] == '/') {
2413                         fname[j] = '@'; j++; fname[j] = '1'; j++;
2414                 } else if (name[i] == '@') {
2415                         fname[j] = '@'; j++; fname[j] = '2'; j++;
2416                 } else {
2417                         fname[j] = name[i]; j++;
2418                 }
2419         }
2420         fname[j] = '\0';
2421         strcat(fname, suffix);
2422         strcat(fname, ".vcg");  /* append the .vcg suffix */
2423
2424         /* vcg really expect only a <CR> at end of line, so
2425          * the "b"inary mode is what you mean (and even needed for Win32)
2426          */
2427         F = fopen(fname, "wb");  /* open file for writing */
2428         if (!F) {
2429                 perror(fname);
2430         }
2431         free(fname);
2432
2433         return F;
2434 }
2435
2436 /**
2437  * Dumps the vcg file footer
2438  */
2439 void dump_vcg_footer(FILE *F) {
2440         fprintf(F, "}\n");
2441 }
2442
2443 /************************************************************************/
2444 /************************************************************************/
2445 /* Routines that dump all or parts of the firm representation to a file */
2446 /************************************************************************/
2447 /************************************************************************/
2448
2449 /************************************************************************/
2450 /* Dump ir graphs, different formats and additional information.        */
2451 /************************************************************************/
2452
2453 typedef void (*do_dump_graph_func) (ir_graph *irg, FILE *out);
2454
2455 static void do_dump(ir_graph *irg, const char *suffix, const char *suffix_ip,
2456                     const char *suffix_nonip, do_dump_graph_func dump_func)
2457 {
2458         FILE       *out;
2459         ir_graph   *rem;
2460         const char *suffix1;
2461
2462         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2463                 return;
2464
2465         rem = current_ir_graph;
2466         current_ir_graph = irg;
2467         if (get_interprocedural_view())
2468                 suffix1 = suffix_ip;
2469         else
2470                 suffix1 = suffix_nonip;
2471         current_ir_graph = rem;
2472
2473         out = vcg_open(irg, suffix, suffix1);
2474         if (out != NULL) {
2475                 dump_func(irg, out);
2476                 fclose(out);
2477         }
2478 }
2479
2480 void dump_ir_graph_file(ir_graph *irg, FILE *out)
2481 {
2482         if (dump_backedge_information_flag
2483                         && get_irg_loopinfo_state(irg) != loopinfo_consistent) {
2484                 construct_backedges(irg);
2485         }
2486
2487         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2488
2489         /* call the dump graph hook */
2490         if (dump_ir_graph_hook) {
2491                 if (dump_ir_graph_hook(out, irg)) {
2492                         return;
2493                 }
2494         }
2495
2496         /* walk over the graph */
2497         /* dump_whole_node must be called in post visiting predecessors */
2498         ird_walk_graph(irg, NULL, dump_whole_node, out);
2499
2500         /* dump the out edges in a separate walk */
2501         if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2502                 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2503         }
2504
2505         dump_vcg_footer(out);
2506 }
2507
2508 /** Routine to dump a graph, blocks as conventional nodes.  */
2509 void dump_ir_graph(ir_graph *irg, const char *suffix )
2510 {
2511         do_dump(irg, suffix, "-pure-ip", "-pure", dump_ir_graph_file);
2512 }
2513
2514 void dump_ir_block_graph_file(ir_graph *irg, FILE *out)
2515 {
2516         int i;
2517
2518         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2519
2520         construct_block_lists(irg);
2521
2522         /*
2523          * If we are in the interprocedural view, we dump not
2524          * only the requested irg but also all irgs that can be reached
2525          * from irg.
2526          */
2527         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2528                 ir_graph *g = get_irp_irg(i);
2529                 ir_node **arr = ird_get_irg_link(g);
2530                 if (arr) {
2531                         dump_graph_from_list(out, g);
2532                         DEL_ARR_F(arr);
2533                 }
2534         }
2535
2536         dump_vcg_footer(out);
2537 }
2538
2539 /* Dump a firm graph without explicit block nodes. */
2540 void dump_ir_block_graph(ir_graph *irg, const char *suffix)
2541 {
2542         do_dump(irg, suffix, "-ip", "", dump_ir_block_graph_file);
2543 }
2544
2545 void dump_ir_extblock_graph_file(ir_graph *irg, FILE *F)
2546 {
2547         int        i;
2548         ir_entity *ent = get_irg_entity(irg);
2549
2550         if (get_irg_extblk_state(irg) != extblk_valid)
2551                 compute_extbb(irg);
2552
2553         dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2554
2555         construct_extblock_lists(irg);
2556
2557         fprintf(F, "graph: { title: \"");
2558         PRINT_IRGID(irg);
2559         fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2560                 get_ent_dump_name(ent));
2561
2562         dump_graph_info(F, irg);
2563         print_dbg_info(F, get_entity_dbg_info(ent));
2564
2565         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2566                 ir_graph *irg     = get_irp_irg(i);
2567                 list_tuple *lists = ird_get_irg_link(irg);
2568
2569                 if (lists) {
2570                         /* dump the extended blocks first */
2571                         if (ARR_LEN(lists->extbb_list)) {
2572                                 ird_set_irg_link(irg, lists->extbb_list);
2573                                 dump_extblock_graph(F, irg);
2574                         }
2575
2576                         /* we may have blocks without extended blocks, bad for instance */
2577                         if (ARR_LEN(lists->blk_list)) {
2578                                 ird_set_irg_link(irg, lists->blk_list);
2579                                 dump_block_graph(F, irg);
2580                         }
2581
2582                         DEL_ARR_F(lists->extbb_list);
2583                         DEL_ARR_F(lists->blk_list);
2584                         xfree(lists);
2585                 }
2586         }
2587
2588         /* Close the vcg information for the irg */
2589         fprintf(F, "}\n\n");
2590
2591         dump_vcg_footer(F);
2592         free_extbb(irg);
2593 }
2594
2595 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2596 void dump_ir_extblock_graph(ir_graph *irg, const char *suffix)
2597 {
2598         do_dump(irg, suffix, "-ip", "", dump_ir_extblock_graph_file);
2599 }
2600
2601 void dump_ir_graph_w_types_file(ir_graph *irg, FILE *out)
2602 {
2603         ir_graph *rem = current_ir_graph;
2604         int       rem_dump_const_local;
2605
2606         rem                  = current_ir_graph;
2607         current_ir_graph     = irg;
2608         rem_dump_const_local = dump_const_local;
2609         /* dumping types does not work with local nodes */
2610         dump_const_local = 0;
2611
2612         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2613
2614         /* dump common ir graph */
2615         irg_walk(get_irg_end(irg), NULL, dump_whole_node, out);
2616         /* dump type info */
2617         type_walk_irg(irg, dump_type_info, NULL, out);
2618         inc_irg_visited(get_const_code_irg());
2619         /* dump edges from graph to type info */
2620         irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2621
2622         dump_vcg_footer(out);
2623         dump_const_local = rem_dump_const_local;
2624         current_ir_graph = rem;
2625 }
2626
2627 /* dumps a graph with type information */
2628 void dump_ir_graph_w_types(ir_graph *irg, const char *suffix)
2629 {
2630         do_dump(irg, suffix, "-pure-wtypes-ip", "-pure-wtypes",
2631                 dump_ir_graph_w_types_file);
2632 }
2633
2634 void dump_ir_block_graph_w_types_file(ir_graph *irg, FILE *out)
2635 {
2636         int       i;
2637         int       rem_dump_const_local;
2638         ir_graph *rem = current_ir_graph;
2639
2640         rem_dump_const_local = dump_const_local;
2641         /* dumping types does not work with local nodes */
2642         dump_const_local = 0;
2643
2644         dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2645
2646         /* dump common blocked ir graph */
2647         construct_block_lists(irg);
2648
2649         for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2650                 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2651                 if (arr) {
2652                         dump_graph_from_list(out, get_irp_irg(i));
2653                         DEL_ARR_F(arr);
2654                 }
2655         }
2656
2657         /* dump type info */
2658         current_ir_graph = irg;
2659         type_walk_irg(irg, dump_type_info, NULL, out);
2660         inc_irg_visited(get_const_code_irg());
2661
2662         /* dump edges from graph to type info */
2663         irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2664
2665         dump_vcg_footer(out);
2666         dump_const_local = rem_dump_const_local;
2667         current_ir_graph = rem;
2668 }
2669
2670 void dump_ir_block_graph_w_types(ir_graph *irg, const char *suffix)
2671 {
2672         do_dump(irg, suffix, "-wtypes-ip", "-wtypes",
2673                 dump_ir_block_graph_w_types_file);
2674 }
2675
2676 /*---------------------------------------------------------------------*/
2677 /* The following routines dump a control flow graph.                   */
2678 /*---------------------------------------------------------------------*/
2679
2680 static void
2681 dump_block_to_cfg(ir_node *block, void *env) {
2682         FILE *F = env;
2683         int i, fl = 0;
2684         ir_node *pred;
2685
2686         if (is_Block(block)) {
2687                 /* This is a block. Dump a node for the block. */
2688                 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2689                 fprintf(F, "\" label: \"");
2690                 if (block == get_irg_start_block(get_irn_irg(block)))
2691                         fprintf(F, "Start ");
2692                 if (block == get_irg_end_block(get_irn_irg(block)))
2693                         fprintf(F, "End ");
2694
2695                 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2696                 PRINT_NODEID(block);
2697                 fprintf(F, "\" ");
2698                 fprintf(F, "info1:\"");
2699
2700                 /* the generic version. */
2701                 dump_irnode_to_file(F, block);
2702
2703                 /* Check whether we have bad predecessors to color the block. */
2704                 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2705                         if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2706                                 break;
2707
2708                 fprintf(F, "\"");  /* closing quote of info */
2709
2710                 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2711                         (block == get_irg_end_block(get_irn_irg(block)))     )
2712                         fprintf(F, " color:blue ");
2713                 else if (fl)
2714                         fprintf(F, " color:yellow ");
2715
2716                 fprintf(F, "}\n");
2717                 /* Dump the edges */
2718                 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2719                         if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2720                                 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2721                                 fprintf(F, "edge: { sourcename: \"");
2722                                 PRINT_NODEID(block);
2723                                 fprintf(F, "\" targetname: \"");
2724                                 PRINT_NODEID(pred);
2725                                 fprintf(F, "\"}\n");
2726                         }
2727
2728                 /* Dump dominator/postdominator edge */
2729                 if (dump_dominator_information_flag) {
2730                         if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2731                                 pred = get_Block_idom(block);
2732                                 fprintf(F, "edge: { sourcename: \"");
2733                                 PRINT_NODEID(block);
2734                                 fprintf(F, "\" targetname: \"");
2735                                 PRINT_NODEID(pred);
2736                                 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2737                         }
2738                         if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2739                                 pred = get_Block_ipostdom(block);
2740                                 fprintf(F, "edge: { sourcename: \"");
2741                                 PRINT_NODEID(block);
2742                                 fprintf(F, "\" targetname: \"");
2743                                 PRINT_NODEID(pred);
2744                                 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2745                         }
2746                 }
2747         }
2748 }
2749
2750 void dump_cfg(ir_graph *irg, const char *suffix)
2751 {
2752         FILE *f;
2753         /* if a filter is set, dump only the irg's that match the filter */
2754         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2755                 return;
2756
2757         f = vcg_open(irg, suffix, "-cfg");
2758         if (f != NULL) {
2759                 ir_graph *rem = current_ir_graph;
2760 #ifdef INTERPROCEDURAL_VIEW
2761                 int ipv = get_interprocedural_view();
2762 #endif
2763
2764                 current_ir_graph = irg;
2765                 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2766
2767 #ifdef INTERPROCEDURAL_VIEW
2768                 if (ipv) {
2769                         printf("Warning: dumping cfg not in interprocedural view!\n");
2770                         set_interprocedural_view(0);
2771                 }
2772 #endif
2773
2774                 /* walk over the blocks in the graph */
2775                 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2776                 dump_node(f, get_irg_bad(irg));
2777
2778 #ifdef INTERPROCEDURAL_VIEW
2779                 set_interprocedural_view(ipv);
2780 #endif
2781                 dump_vcg_footer(f);
2782                 fclose(f);
2783                 current_ir_graph = rem;
2784         }
2785 }
2786
2787
2788 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2789         if (pset_find_ptr(mark_set, n)) return;
2790
2791         pset_insert_ptr(mark_set, n);
2792
2793         if (depth > 0) {
2794                 int i, start = is_Block(n) ? 0 : -1;
2795                 dump_whole_node(n, F);
2796                 for (i = start; i < get_irn_arity(n); ++i)
2797                         descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2798         } else {
2799                 dump_node(F, n);
2800                 /* Don't dump edges to nodes further out.  These might be edges to
2801                    nodes we already dumped, if there is a shorter path to these. */
2802         }
2803 }
2804
2805 static int subgraph_counter = 0;
2806 void dump_subgraph(ir_node *root, int depth, const char *suffix) {
2807         FILE *F;
2808         char buf[32];
2809
2810         sprintf(buf, "-subg_%03d", subgraph_counter++);
2811         F = vcg_open(get_irn_irg(root), suffix, buf);
2812         if (F != NULL) {
2813                 pset *mark_set = pset_new_ptr(1);
2814                 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2815                 descend_and_dump(F, root, depth, mark_set);
2816                 dump_vcg_footer(F);
2817                 fclose(F);
2818                 del_pset(mark_set);
2819         }
2820 }
2821
2822 #ifdef INTERPROCEDURAL_VIEW
2823 void dump_callgraph(const char *suffix) {
2824         FILE *F = vcg_open_name("Callgraph", suffix);
2825
2826         if (F != NULL) {
2827                 int i, rem = edge_label;
2828                 //int colorize;
2829                 edge_label = 1;
2830                 dump_vcg_header(F, "Callgraph", NULL);
2831
2832                 //colorize = get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent;
2833
2834                 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2835                         ir_graph *irg = get_irp_irg(i);
2836                         ir_entity *ent = get_irg_entity(irg);
2837                         int j;
2838                         //int n_callees = get_irg_n_callees(irg);
2839                         int color;
2840
2841                         //color = colorize ? get_entity_color(ent) : ird_color_green;
2842                         color = ird_color_green;
2843                         dump_entity_node(F, ent, color);
2844                         for (j = 0; j < n_callees; ++j) {
2845                                 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2846                                 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2847                                 int be = is_irg_callee_backedge(irg, j);
2848                                 char *attr;
2849                                 attr = (be) ?
2850                                         "label:\"recursion %d\" color:%d" :
2851                                 "label:\"calls %d\" color:%d";
2852                                 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), color);
2853                         }
2854                 }
2855
2856                 edge_label = rem;
2857                 dump_vcg_footer(F);
2858                 fclose(F);
2859         }
2860 }
2861
2862 /* Dump all irgs in interprocedural view to a single file. */
2863 void dump_all_cg_block_graph(const char *suffix) {
2864         FILE *f = vcg_open_name("All_graphs", suffix);
2865
2866         if (f != NULL) {
2867                 int i;
2868                 int rem_view = get_interprocedural_view();
2869
2870                 set_interprocedural_view(1);
2871                 dump_vcg_header(f, "All_graphs", NULL);
2872
2873                 /* collect nodes in all irgs reachable in call graph*/
2874                 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2875                         ird_set_irg_link(get_irp_irg(i), NULL);
2876
2877                 cg_walk(clear_link, collect_node, NULL);
2878
2879                 /* dump all graphs */
2880                 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2881                         current_ir_graph = get_irp_irg(i);
2882                         assert(ird_get_irg_link(current_ir_graph));
2883                         dump_graph_from_list(f, current_ir_graph);
2884                         DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2885                 }
2886
2887                 dump_vcg_footer(f);
2888                 fclose(f);
2889                 set_interprocedural_view(rem_view);
2890         }
2891 }
2892 #endif
2893
2894 /*---------------------------------------------------------------------*/
2895 /* the following routines dumps type information without any ir nodes. */
2896 /*---------------------------------------------------------------------*/
2897
2898 void
2899 dump_type_graph(ir_graph *irg, const char *suffix)
2900 {
2901         FILE *f;
2902
2903         /* if a filter is set, dump only the irg's that match the filter */
2904         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2905
2906         f = vcg_open(irg, suffix, "-type");
2907         if (f != NULL) {
2908                 ir_graph *rem = current_ir_graph;
2909                 current_ir_graph = irg;
2910
2911                 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2912
2913                 /* walk over the blocks in the graph */
2914                 type_walk_irg(irg, dump_type_info, NULL, f);
2915                 /* The walker for the const code can be called several times for the
2916                    same (sub) expression.  So that no nodes are dumped several times
2917                    we decrease the visited flag of the corresponding graph after each
2918                    walk.  So now increase it finally. */
2919                 inc_irg_visited(get_const_code_irg());
2920
2921                 dump_vcg_footer(f);
2922                 fclose(f);
2923                 current_ir_graph = rem;
2924         }
2925 }
2926
2927 void
2928 dump_all_types(const char *suffix)
2929 {
2930         FILE *f = vcg_open_name("All_types", suffix);
2931         if (f) {
2932                 dump_vcg_header(f, "All_types", NULL);
2933                 type_walk(dump_type_info, NULL, f);
2934                 inc_irg_visited(get_const_code_irg());
2935
2936                 dump_vcg_footer(f);
2937                 fclose(f);
2938         }
2939 }
2940
2941 void
2942 dump_class_hierarchy(int entities, const char *suffix)
2943 {
2944         FILE *f = vcg_open_name("class_hierarchy", suffix);
2945
2946         if (f != NULL) {
2947                 h_env_t env;
2948                 env.f        = f;
2949                 env.dump_ent = entities;
2950                 dump_vcg_header(f, "class_hierarchy", NULL);
2951                 type_walk(dump_class_hierarchy_node, NULL, &env);
2952
2953                 dump_vcg_footer(f);
2954                 fclose(f);
2955         }
2956 }
2957
2958 /*---------------------------------------------------------------------*/
2959 /* dumps all graphs with the graph-dumper passed. Possible dumpers:    */
2960 /*  dump_ir_graph                                                      */
2961 /*  dump_ir_block_graph                                                */
2962 /*  dump_cfg                                                           */
2963 /*  dump_type_graph                                                    */
2964 /*  dump_ir_graph_w_types                                              */
2965 /*---------------------------------------------------------------------*/
2966
2967 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2968         int i;
2969         for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2970                 dmp_grph(get_irp_irg(i), suffix);
2971 }
2972
2973
2974 /*--------------------------------------------------------------------------------*
2975  * Dumps a stand alone loop graph with firm nodes which belong to one loop node   *
2976  * packed together in one subgraph/box                                            *
2977  *--------------------------------------------------------------------------------*/
2978
2979 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2980         int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2981         loop_element le;
2982         ir_loop *son = NULL;
2983
2984         /* Dump a new loop node. */
2985         dump_loop_node(F, loop);
2986
2987         /* Dump the loop elements. */
2988
2989         for(i = 0; i < get_loop_n_elements(loop); i++) {
2990                 le = get_loop_element(loop, i);
2991                 son = le.son;
2992                 if (get_kind(son) == k_ir_loop) {
2993
2994                         /* We are a loop son -> Recurse */
2995
2996                         if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2997                                 fprintf(F, "\" }\n");
2998                                 fprintf(F, "edge: {sourcename: \"");
2999                                 PRINT_LOOPID(loop);
3000                                 fprintf(F, "\" targetname: \"");
3001                                 PRINT_LOOPID(loop);
3002                                 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3003                                 loop_node_started = 0;
3004                         }
3005                         dump_loop_son_edge(F, loop, son_number++);
3006                         dump_loops_standalone(F, son);
3007                 } else if (get_kind(son) == k_ir_node) {
3008                         /* We are a loop node -> Collect firm nodes */
3009
3010                         ir_node *n = le.node;
3011                         int bad = 0;
3012
3013                         if (!loop_node_started) {
3014                                 /* Start a new node which contains all firm nodes of the current loop */
3015                                 fprintf(F, "node: { title: \"");
3016                                 PRINT_LOOPID(loop);
3017                                 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
3018                                 loop_node_started = 1;
3019                                 first = i;
3020                         } else
3021                                 fprintf(F, "\n");
3022
3023                         bad |= dump_node_label(F, n);
3024                         /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
3025                         if (has_backedges(n)) fprintf(F, "\t loop head!");
3026                 } else { /* for callgraph loop tree */
3027                         ir_graph *n;
3028                         assert(get_kind(son) == k_ir_graph);
3029
3030                         /* We are a loop node -> Collect firm graphs */
3031                         n = (ir_graph *)le.node;
3032                         if (!loop_node_started) {
3033                                 /* Start a new node which contains all firm nodes of the current loop */
3034                                 fprintf(F, "node: { title: \"");
3035                                 PRINT_LOOPID(loop);
3036                                 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
3037                                 loop_node_started = 1;
3038                                 first = i;
3039                         } else
3040                                 fprintf(F, "\n");
3041                         fprintf(F, " %s", get_irg_dump_name(n));
3042                         /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
3043                 }
3044         }
3045
3046         if (loop_node_started) {
3047                 fprintf(F, "\" }\n");
3048                 fprintf(F, "edge: {sourcename: \"");
3049                 PRINT_LOOPID(loop);
3050                 fprintf(F, "\" targetname: \"");
3051                 PRINT_LOOPID(loop);
3052                 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3053                 loop_node_started = 0;
3054         }
3055 }
3056
3057 void dump_loop_tree(ir_graph *irg, const char *suffix)
3058 {
3059         FILE *f;
3060
3061         /* if a filter is set, dump only the irg's that match the filter */
3062         if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
3063
3064         f = vcg_open(irg, suffix, "-looptree");
3065         if (f != NULL) {
3066                 ir_graph *rem = current_ir_graph;
3067                 int el_rem = edge_label;
3068
3069                 current_ir_graph = irg;
3070                 edge_label = 1;
3071
3072                 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
3073
3074                 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
3075
3076                 dump_vcg_footer(f);
3077                 fclose(f);
3078
3079                 edge_label = el_rem;
3080                 current_ir_graph = rem;
3081         }
3082 }
3083
3084 void dump_callgraph_loop_tree(const char *suffix) {
3085         FILE *F;
3086         F = vcg_open_name("Callgraph_looptree", suffix);
3087         dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
3088         dump_loops_standalone(F, irp->outermost_cg_loop);
3089         dump_vcg_footer(F);
3090         fclose(F);
3091 }
3092
3093
3094 /*----------------------------------------------------------------------------*/
3095 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes.*/
3096 /*----------------------------------------------------------------------------*/
3097
3098 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
3099         int i, son_number = 0, node_number = 0;
3100
3101         if (dump_loop_information_flag) dump_loop_node(F, loop);
3102
3103         for (i = 0; i < get_loop_n_elements(loop); i++) {
3104                 loop_element le = get_loop_element(loop, i);
3105                 if (*(le.kind) == k_ir_loop) {
3106                         if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
3107                         /* Recur */
3108                         collect_nodeloop(F, le.son, loopnodes);
3109                 } else {
3110                         if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
3111                         eset_insert(loopnodes, le.node);
3112                 }
3113         }
3114 }
3115
3116 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
3117         int i, j, start;
3118
3119         for(i = 0; i < get_loop_n_elements(loop); i++) {
3120                 loop_element le = get_loop_element(loop, i);
3121                 if (*(le.kind) == k_ir_loop) {
3122                         /* Recur */
3123                         collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3124                 } else {
3125                         if (is_Block(le.node)) start = 0; else start = -1;
3126                         for (j = start; j < get_irn_arity(le.node); j++) {
3127                                 ir_node *pred = get_irn_n(le.node, j);
3128                                 if (!eset_contains(loopnodes, pred)) {
3129                                         eset_insert(extnodes, pred);
3130                                         if (!is_Block(pred)) {
3131                                                 pred = get_nodes_block(pred);
3132                                                 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3133                                         }
3134                                 }
3135                         }
3136                 }
3137         }
3138 }
3139
3140 void dump_loop(ir_loop *l, const char *suffix) {
3141         FILE *F;
3142         char name[50];
3143
3144         snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3145         F = vcg_open_name(name, suffix);
3146         if (F != NULL) {
3147                 eset *loopnodes = eset_create();
3148                 eset *extnodes = eset_create();
3149                 ir_node *n, *b;
3150
3151                 dump_vcg_header(F, name, NULL);
3152
3153                 /* collect all nodes to dump */
3154                 collect_nodeloop(F, l, loopnodes);
3155                 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3156
3157                 /* build block lists */
3158                 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3159                         set_irn_link(n, NULL);
3160                 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3161                         set_irn_link(n, NULL);
3162                 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) {
3163                         if (!is_Block(n)) {
3164                                 b = get_nodes_block(n);
3165                                 set_irn_link(n, get_irn_link(b));
3166                                 set_irn_link(b, n);
3167                         }
3168                 }
3169                 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) {
3170                         if (!is_Block(n)) {
3171                                 b = get_nodes_block(n);
3172                                 set_irn_link(n, get_irn_link(b));
3173                                 set_irn_link(b, n);
3174                         }
3175                 }
3176
3177                 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) {
3178                         if (is_Block(b)) {
3179                                 fprintf(F, "graph: { title: \"");
3180                                 PRINT_NODEID(b);
3181                                 fprintf(F, "\"  label: \"");
3182                                 dump_node_opcode(F, b);
3183                                 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3184                                 fprintf(F, "\" status:clustered color:yellow\n");
3185
3186                                 /* dump the blocks edges */
3187                                 dump_ir_data_edges(F, b);
3188
3189                                 /* dump the nodes that go into the block */
3190                                 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3191                                         if (eset_contains(extnodes, n))
3192                                                 overrule_nodecolor = ird_color_block_inout;
3193                                         dump_node(F, n);
3194                                         overrule_nodecolor = ird_color_default_node;
3195                                         if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3196                                 }
3197
3198                                 /* Close the vcg information for the block */
3199                                 fprintf(F, "}\n");
3200                                 dump_const_node_local(F, b);
3201                                 fprintf(F, "\n");
3202                         }
3203                 }
3204                 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) {
3205                         if (is_Block(b)) {
3206                                 fprintf(F, "graph: { title: \"");
3207                                 PRINT_NODEID(b);
3208                                 fprintf(F, "\"  label: \"");
3209                                 dump_node_opcode(F, b);
3210                                 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3211                                 fprintf(F, "\" status:clustered color:lightblue\n");
3212
3213                                 /* dump the nodes that go into the block */
3214                                 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3215                                         if (!eset_contains(loopnodes, n))
3216                                                 overrule_nodecolor = ird_color_block_inout;
3217                                         dump_node(F, n);
3218                                         overrule_nodecolor = ird_color_default_node;
3219                                         if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3220                                 }
3221
3222                                 /* Close the vcg information for the block */
3223                                 fprintf(F, "}\n");
3224                                 dump_const_node_local(F, b);
3225                                 fprintf(F, "\n");
3226                         }
3227                 }
3228                 eset_destroy(loopnodes);
3229                 eset_destroy(extnodes);
3230
3231                 dump_vcg_footer(F);
3232                 fclose(F);
3233         }
3234 }