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