2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
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.
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.
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
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt,
38 #include "irgraph_t.h"
52 #include "callgraph.h"
53 #include "irextbb_t.h"
55 #include "dbginfo_t.h"
69 /** Dump only irgs with names that start with this prefix. */
70 static ident *dump_file_filter_id = NULL;
72 static ir_dump_flags_t flags =
73 ir_dump_flag_blocks_as_subgraphs |
74 ir_dump_flag_keepalive_edges |
75 ir_dump_flag_ld_names |
76 ir_dump_flag_back_edges |
77 ir_dump_flag_consts_local |
78 ir_dump_flag_analysed_types |
79 ir_dump_flag_entities_in_hierarchy |
80 ir_dump_flag_number_label;
82 static ird_color_t overrule_nodecolor = ird_color_default_node;
84 /** The vcg node attribute hook. */
85 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
86 /** The vcg edge attribute hook. */
87 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
88 /** The vcg dump block edge hook */
89 static dump_node_edge_func dump_block_edge_hook = NULL;
90 /** The vcg dump node edge hook. */
91 static dump_node_edge_func dump_node_edge_hook = NULL;
93 void set_dump_node_edge_hook(dump_node_edge_func func)
95 dump_node_edge_hook = func;
98 dump_node_edge_func get_dump_node_edge_hook(void)
100 return dump_node_edge_hook;
103 void set_dump_block_edge_hook(dump_node_edge_func func)
105 dump_block_edge_hook = func;
108 dump_node_edge_func get_dump_block_edge_hook(void)
110 return dump_node_edge_hook;
113 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
115 dump_node_vcgattr_hook = hook;
118 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
120 dump_edge_vcgattr_hook = hook;
123 void ir_set_dump_flags(ir_dump_flags_t new_flags)
128 void ir_add_dump_flags(ir_dump_flags_t new_flags)
133 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
138 ir_dump_flags_t ir_get_dump_flags(void)
143 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
144 * are set, else returns dump_const_local_flag.
146 static bool get_opt_dump_const_local(void)
148 return (flags & ir_dump_flag_out_edges)
149 || (flags & ir_dump_flag_loops)
150 || (flags & ir_dump_flag_consts_local)
151 || (flags & ir_dump_flag_iredges);
154 static char *dump_filter;
156 void ir_set_dump_filter(const char *new_filter)
159 dump_filter = xstrdup(new_filter);
162 const char *ir_get_dump_filter(void)
167 int ir_should_dump(const char *name)
171 if (dump_filter == NULL || dump_filter[0] == '\0')
174 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
182 /* -------------- some extended helper functions ----------------- */
184 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
187 return get_mode_name(mode);
193 #define CUSTOM_COLOR_BASE 100
194 static const char *color_names[ird_color_count];
195 static const char *color_rgb[ird_color_count];
196 static struct obstack color_obst;
198 /** define a custom color. */
199 static void custom_color(int num, const char *rgb_def)
201 assert(num < ird_color_count);
202 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
203 obstack_1grow(&color_obst, '\0');
205 color_rgb[num] = rgb_def;
206 color_names[num] = (const char*)obstack_finish(&color_obst);
209 /** Define a named color. */
210 static void named_color(int num, const char *name)
212 assert(num < ird_color_count);
213 color_rgb[num] = NULL;
214 color_names[num] = name;
217 /** Initializes the used colors. */
218 static void init_colors(void)
220 static int initialized = 0;
224 obstack_init(&color_obst);
226 custom_color(ird_color_prog_background, "204 204 204");
227 custom_color(ird_color_block_background, "255 255 0");
228 custom_color(ird_color_dead_block_background, "190 150 150");
229 named_color(ird_color_block_inout, "lightblue");
230 named_color(ird_color_default_node, "white");
231 custom_color(ird_color_memory, "153 153 255");
232 custom_color(ird_color_controlflow, "255 153 153");
233 custom_color(ird_color_const, "204 255 255");
234 custom_color(ird_color_proj, "255 255 153");
235 custom_color(ird_color_uses_memory, "153 153 255");
236 custom_color(ird_color_phi, "105 255 105");
237 custom_color(ird_color_anchor, "100 100 255");
238 named_color(ird_color_error, "red");
239 custom_color(ird_color_entity, "204 204 255");
245 * Prints the VCG color to a file.
247 static void print_vcg_color(FILE *out, ird_color_t color)
249 assert(color < ird_color_count);
250 fprintf(out, "color:%s", color_names[color]);
254 * Prints the edge kind of a given IR node.
256 * Projs should be dumped near their predecessor, so they get "nearedge".
258 static void print_node_edge_kind(FILE *out, ir_node *node)
261 fprintf(out, "nearedge: ");
263 fprintf(out, "edge: ");
268 * Prints the edge from a type S to a type T with additional info fmt, ...
271 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
276 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
277 fprintf(F, " targetname: "); PRINT_TYPEID(T);
278 ir_vfprintf(F, fmt, ap);
284 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
287 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
292 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
293 fprintf(F, " targetname: \""); PRINT_ENTID(ent); fprintf(F, "\"");
294 ir_vfprintf(F, fmt, ap);
300 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
303 static void print_ent_ent_edge(FILE *F, const ir_entity *ent1, const ir_entity *ent2, int backedge, ird_color_t color, const char *fmt, ...)
309 fprintf(F, "backedge: { sourcename: \"");
311 fprintf(F, "edge: { sourcename: \"");
313 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent2); fprintf(F, "\"");
314 ir_vfprintf(F, fmt, ap);
316 if (color != ird_color_none)
317 print_vcg_color(F, color);
323 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
326 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
331 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
332 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
333 ir_vfprintf(F, fmt, ap);
339 * Prints the edge from a node irn to a type tp with additional info fmt, ...
342 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
347 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
348 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
349 ir_vfprintf(F, fmt, ap);
355 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
358 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
363 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
364 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent);
366 ir_vfprintf(F, fmt, ap);
372 * Prints the edge from an entity ent to a node irn with additional info fmt, ...
375 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
380 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
381 fprintf(F, "\" targetname: \""); PRINT_NODEID(irn); fprintf(F, "\"");
382 ir_vfprintf(F, fmt, ap);
388 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
391 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
396 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
397 fprintf(F, " targetname: \""); PRINT_ITEMID(tp, item); fprintf(F, "\" ");
398 ir_vfprintf(F, fmt, ap);
403 /*-----------------------------------------------------------------*/
404 /* global and ahead declarations */
405 /*-----------------------------------------------------------------*/
407 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
409 /*-----------------------------------------------------------------*/
410 /* Helper functions. */
411 /*-----------------------------------------------------------------*/
414 * This map is used as a private link attr to be able to call dumper
415 * anywhere without destroying link fields.
417 static pmap *irdump_link_map = NULL;
419 /** NOT A STANDARD LIBFIRM INIT METHOD
421 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
422 * are off, we want to have as few interferences as possible. Therefore the
423 * initialization is performed lazily and not called from within init_firm.
425 * Creates the link attribute map. */
426 static void init_irdump(void)
428 /* We need a new, empty map. */
429 if (irdump_link_map) pmap_destroy(irdump_link_map);
430 irdump_link_map = pmap_create();
431 if (!dump_file_filter_id)
432 dump_file_filter_id = new_id_from_str("");
436 * Returns the private link field.
438 static void *ird_get_irn_link(const ir_node *n)
441 if (irdump_link_map == NULL)
444 if (pmap_contains(irdump_link_map, n))
445 res = pmap_get(irdump_link_map, n);
450 * Sets the private link field.
452 static void ird_set_irn_link(const ir_node *n, void *x)
454 if (irdump_link_map == NULL)
456 pmap_insert(irdump_link_map, n, x);
460 * Gets the private link field of an irg.
462 static void *ird_get_irg_link(const ir_graph *irg)
465 if (irdump_link_map == NULL)
468 if (pmap_contains(irdump_link_map, irg))
469 res = pmap_get(irdump_link_map, irg);
474 * Sets the private link field of an irg.
476 static void ird_set_irg_link(const ir_graph *irg, void *x)
478 if (irdump_link_map == NULL)
480 pmap_insert(irdump_link_map, irg, x);
484 * Walker, clears the private link field.
486 static void clear_link(ir_node *node, void *env)
489 ird_set_irn_link(node, NULL);
493 * If the entity has a ld_name, returns it if the dump_ld_name is set,
494 * else returns the name of the entity.
496 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
499 return "<NULL entity>";
501 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
502 if (ent->ld_name != NULL)
503 return get_id_str(ent->ld_name);
505 return get_id_str(ent->name);
508 const char *get_ent_dump_name(const ir_entity *ent)
510 return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
513 const char *get_irg_dump_name(const ir_graph *irg)
515 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
516 return _get_ent_dump_name(get_irg_entity(irg), true);
520 * Returns non-zero if a node is in floating state.
522 static int node_floats(const ir_node *n)
524 return ((get_irn_pinned(n) == op_pin_state_floats) &&
525 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
529 * Walker that visits the anchors
531 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
533 if ((flags & ir_dump_flag_all_anchors)
534 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
535 irg_walk_anchors(irg, pre, post, env);
537 irg_walk_graph(irg, pre, post, env);
542 * Walker, allocates an array for all blocks and puts their non-floating
543 * nodes into this array.
545 static void collect_node(ir_node *node, void *env)
550 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
551 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
552 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
553 ARR_APP1(ir_node *, arr, node);
554 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
556 ir_node * block = get_nodes_block(node);
559 /* this node is in a Bad block, so we must place it into the graph's list */
560 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
561 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
562 ARR_APP1(ir_node *, arr, node);
563 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
565 ird_set_irn_link(node, ird_get_irn_link(block));
566 ird_set_irn_link(block, node);
571 /** Construct lists to walk ir block-wise.
573 * Collects all blocks, nodes not op_pin_state_pinned,
574 * Bad, NoMem and Unknown into a flexible array in link field of
575 * irg they belong to. Sets the irg link field to NULL in all
576 * graphs not visited.
577 * Free the list with DEL_ARR_F().
579 static ir_node **construct_block_lists(ir_graph *irg)
582 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
583 ir_graph *rem = current_ir_graph;
585 current_ir_graph = irg;
588 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
591 for (i = get_irp_n_irgs(); i > 0;)
592 ird_set_irg_link(get_irp_irg(--i), NULL);
594 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
597 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
600 current_ir_graph = rem;
601 return (ir_node**)ird_get_irg_link(irg);
604 typedef struct list_tuple {
606 ir_extblk **extbb_list;
609 /** Construct lists to walk IR extended block-wise.
610 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
611 * NULL in all graphs not visited.
613 static list_tuple *construct_extblock_lists(ir_graph *irg)
615 ir_node **blk_list = construct_block_lists(irg);
617 ir_graph *rem = current_ir_graph;
618 list_tuple *lists = XMALLOC(list_tuple);
620 current_ir_graph = irg;
622 lists->blk_list = NEW_ARR_F(ir_node *, 0);
623 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
625 inc_irg_block_visited(irg);
626 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
629 if (is_Block(blk_list[i])) {
630 ext = get_Block_extbb(blk_list[i]);
632 if (extbb_not_visited(ext)) {
633 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
634 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 void dump_node_opcode(FILE *F, ir_node *n)
648 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
650 /* call the dump_node operation if available */
651 if (ops->dump_node) {
652 ops->dump_node(F, n, dump_node_opcode_txt);
656 /* implementation for default nodes */
657 switch (get_irn_opcode(n)) {
659 switch (get_SymConst_kind(n)) {
660 case symconst_addr_ent:
661 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
663 case symconst_ofs_ent:
664 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
666 case symconst_type_tag:
667 ir_fprintf(F, "SymC %+F tag", get_SymConst_type(n));
669 case symconst_type_size:
670 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
672 case symconst_type_align:
673 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
675 case symconst_enum_const:
676 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
682 ir_node *pred = get_Proj_pred(n);
684 if (get_irn_opcode(pred) == iro_Cond
685 && get_Proj_proj(n) == get_Cond_default_proj(pred)
686 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
687 fprintf(F, "defProj");
693 if (get_Load_unaligned(n) == align_non_aligned)
695 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
698 if (get_Store_unaligned(n) == align_non_aligned)
700 fprintf(F, "%s", get_irn_opname(n));
703 if (n == get_irg_start_block(get_irn_irg(n)))
705 if (n == get_irg_end_block(get_irn_irg(n)))
707 fprintf(F, "%s%s", get_irn_opname(n),
708 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
711 if (get_Conv_strict(n))
712 fprintf(F, "strict");
713 fprintf(F, "%s", get_irn_opname(n));
716 fprintf(F, "%s", get_irn_opname(n));
717 if (get_Div_no_remainder(n))
719 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
722 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
725 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
730 fprintf(F, "%s", get_irn_opname(n));
735 * Dump the mode of a node n to a file F.
736 * Ignore modes that are "always known".
738 static void dump_node_mode(FILE *F, ir_node *n)
740 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
744 /* call the dump_node operation if available */
745 if (ops->dump_node) {
746 ops->dump_node(F, n, dump_node_mode_txt);
750 /* default implementation */
751 iro = get_irn_opcode(n);
763 mode = get_irn_mode(n);
765 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
766 (mode != mode_T || iro == iro_Proj))
767 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
772 * Dump the type of a node n to a file F if it's known.
774 static int dump_node_typeinfo(FILE *F, ir_node *n)
778 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
779 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
780 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
781 ir_type *tp = get_irn_typeinfo_type(n);
782 if (tp != firm_none_type) {
783 ir_fprintf(F, "[%+F]", tp);
792 typedef struct pns_lookup {
793 long nr; /**< the proj number */
794 const char *name; /**< the name of the Proj */
797 typedef struct proj_lookup {
798 unsigned code; /**< the opcode of the Proj predecessor */
799 unsigned num_data; /**< number of data entries */
800 const pns_lookup_t *data; /**< the data */
803 /** the lookup table for Proj(Start) names */
804 static const pns_lookup_t start_lut[] = {
805 #define X(a) { pn_Start_##a, #a }
813 /** the lookup table for Proj(Cond) names */
814 static const pns_lookup_t cond_lut[] = {
815 #define X(a) { pn_Cond_##a, #a }
821 /** the lookup table for Proj(Call) names */
822 static const pns_lookup_t call_lut[] = {
823 #define X(a) { pn_Call_##a, #a }
831 /** the lookup table for Proj(Div) names */
832 static const pns_lookup_t div_lut[] = {
833 #define X(a) { pn_Div_##a, #a }
841 /** the lookup table for Proj(Mod) names */
842 static const pns_lookup_t mod_lut[] = {
843 #define X(a) { pn_Mod_##a, #a }
851 /** the lookup table for Proj(Load) names */
852 static const pns_lookup_t load_lut[] = {
853 #define X(a) { pn_Load_##a, #a }
861 /** the lookup table for Proj(Store) names */
862 static const pns_lookup_t store_lut[] = {
863 #define X(a) { pn_Store_##a, #a }
870 /** the lookup table for Proj(Alloc) names */
871 static const pns_lookup_t alloc_lut[] = {
872 #define X(a) { pn_Alloc_##a, #a }
880 /** the lookup table for Proj(CopyB) names */
881 static const pns_lookup_t copyb_lut[] = {
882 #define X(a) { pn_CopyB_##a, #a }
889 /** the lookup table for Proj(InstOf) names */
890 static const pns_lookup_t instof_lut[] = {
891 #define X(a) { pn_InstOf_##a, #a }
899 /** the lookup table for Proj(Raise) names */
900 static const pns_lookup_t raise_lut[] = {
901 #define X(a) { pn_Raise_##a, #a }
907 /** the lookup table for Proj(Bound) names */
908 static const pns_lookup_t bound_lut[] = {
909 #define X(a) { pn_Bound_##a, #a }
917 /** the Proj lookup table */
918 static const proj_lookup_t proj_lut[] = {
919 #define E(a) ARRAY_SIZE(a), a
920 { iro_Start, E(start_lut) },
921 { iro_Cond, E(cond_lut) },
922 { iro_Call, E(call_lut) },
923 { iro_Div, E(div_lut) },
924 { iro_Mod, E(mod_lut) },
925 { iro_Load, E(load_lut) },
926 { iro_Store, E(store_lut) },
927 { iro_Alloc, E(alloc_lut) },
928 { iro_CopyB, E(copyb_lut) },
929 { iro_InstOf, E(instof_lut) },
930 { iro_Raise, E(raise_lut) },
931 { iro_Bound, E(bound_lut) }
936 * Dump additional node attributes of some nodes to a file F.
938 static void dump_node_nodeattr(FILE *F, ir_node *n)
943 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
945 /* call the dump_node operation if available */
946 if (ops->dump_node) {
947 ops->dump_node(F, n, dump_node_nodeattr_txt);
951 switch (get_irn_opcode(n)) {
953 ir_fprintf(F, "%T ", get_Const_tarval(n));
957 pred = get_Proj_pred(n);
958 proj_nr = get_Proj_proj(n);
959 code = get_irn_opcode(pred);
961 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
962 fprintf(F, "Arg %ld ", proj_nr);
963 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
964 fprintf(F, "%ld ", proj_nr);
966 unsigned i, j, f = 0;
968 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
969 if (code == proj_lut[i].code) {
970 for (j = 0; j < proj_lut[i].num_data; ++j) {
971 if (proj_nr == proj_lut[i].data[j].nr) {
972 fprintf(F, "%s ", proj_lut[i].data[j].name);
981 fprintf(F, "%ld ", proj_nr);
982 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
983 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
985 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
991 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
994 ir_fprintf(F, "(%+F)", get_Cast_type(n));
997 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
1000 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
1003 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
1012 #include "execution_frequency.h"
1014 static void dump_node_ana_vals(FILE *F, ir_node *n)
1021 void dump_node_label(FILE *F, ir_node *n)
1023 dump_node_opcode(F, n);
1025 dump_node_mode(F, n);
1027 dump_node_typeinfo(F, n);
1028 dump_node_nodeattr(F, n);
1029 if (flags & ir_dump_flag_number_label) {
1030 fprintf(F, "%ld", get_irn_node_nr(n));
1032 if (flags & ir_dump_flag_idx_label) {
1033 fprintf(F, ":%u", get_irn_idx(n));
1037 void dump_vrp_info(FILE *F, ir_node *n)
1039 vrp_attr *vrp = vrp_get_info(n);
1044 fprintf(F, "range_type: %d\n", (int) vrp->range_type);
1045 if (vrp->range_type == VRP_RANGE || vrp->range_type ==
1047 ir_fprintf(F, "range_bottom: %F\n",vrp->range_bottom);
1048 ir_fprintf(F, "range_top: %F\n", vrp->range_top);
1050 ir_fprintf(F, "bits_set: %T\n", vrp->bits_set);
1051 ir_fprintf(F, "bits_not_set: %T\n", vrp->bits_not_set);
1055 * Dumps the attributes of a node n into the file F.
1056 * Currently this is only the color of a node.
1058 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1064 print_vcg_color(F, ird_color_error);
1068 if (dump_node_vcgattr_hook != NULL) {
1069 dump_node_vcgattr_hook(F, node, local);
1073 n = local ? local : node;
1075 if (overrule_nodecolor != ird_color_default_node) {
1076 print_vcg_color(F, overrule_nodecolor);
1080 mode = get_irn_mode(n);
1081 if (mode == mode_M) {
1082 print_vcg_color(F, ird_color_memory);
1085 if (mode == mode_X) {
1086 print_vcg_color(F, ird_color_controlflow);
1090 switch (get_irn_opcode(n)) {
1093 print_vcg_color(F, ird_color_anchor);
1096 print_vcg_color(F, ird_color_error);
1099 print_vcg_color(F, ird_color_block_background);
1102 print_vcg_color(F, ird_color_phi);
1105 print_vcg_color(F, ird_color_memory);
1109 print_vcg_color(F, ird_color_const);
1112 print_vcg_color(F, ird_color_proj);
1115 ir_op *op = get_irn_op(node);
1117 if (is_op_constlike(op)) {
1118 print_vcg_color(F, ird_color_const);
1119 } else if (is_op_uses_memory(op)) {
1120 print_vcg_color(F, ird_color_uses_memory);
1121 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1122 print_vcg_color(F, ird_color_controlflow);
1128 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1130 hook_entry_t *info = XMALLOC(hook_entry_t);
1132 info->hook._hook_node_info = cb;
1133 info->context = data;
1134 register_hook(hook_node_info, info);
1139 void dump_remove_node_info_callback(void *handle)
1141 hook_entry_t *info = (hook_entry_t*)handle;
1142 unregister_hook(hook_node_info, info);
1147 * Dump the node information of a node n to a file F.
1149 static void dump_node_info(FILE *F, ir_node *n)
1151 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1153 fprintf(F, " info1: \"");
1154 dump_irnode_to_file(F, n);
1155 /* call the dump_node operation if available */
1157 ops->dump_node(F, n, dump_node_info_txt);
1159 /* allow additional info to be added */
1160 hook_node_info(F, n);
1164 static int is_constlike_node(const ir_node *node)
1166 const ir_op *op = get_irn_op(node);
1167 return is_op_constlike(op);
1171 /** outputs the predecessors of n, that are constants, local. I.e.,
1172 generates a copy of the constant predecessors for each node called with. */
1173 static void dump_const_node_local(FILE *F, ir_node *n)
1176 if (!get_opt_dump_const_local()) return;
1178 /* Use visited flag to avoid outputting nodes twice.
1179 initialize it first. */
1180 for (i = 0; i < get_irn_arity(n); i++) {
1181 ir_node *con = get_irn_n(n, i);
1182 if (is_constlike_node(con)) {
1183 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1187 for (i = 0; i < get_irn_arity(n); i++) {
1188 ir_node *con = get_irn_n(n, i);
1189 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1190 /* Generate a new name for the node by appending the names of
1192 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1193 fprintf(F, " label: \"");
1194 dump_node_label(F, con);
1196 dump_node_info(F, con);
1197 dump_node_vcgattr(F, n, con, 0);
1203 /** If the block of an edge is a const_like node, dump it local with an edge */
1204 static void dump_const_block_local(FILE *F, ir_node *n)
1208 if (!get_opt_dump_const_local()) return;
1210 blk = get_nodes_block(n);
1211 if (is_constlike_node(blk)) {
1212 /* Generate a new name for the node by appending the names of
1214 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1215 fprintf(F, "\" label: \"");
1216 dump_node_label(F, blk);
1218 dump_node_info(F, blk);
1219 dump_node_vcgattr(F, n, blk, 0);
1222 fprintf(F, "edge: { sourcename: \"");
1224 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1226 if (dump_edge_vcgattr_hook) {
1228 if (dump_edge_vcgattr_hook(F, n, -1)) {
1232 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1237 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1242 * prints the error message of a node to a file F as info2.
1244 static void print_node_error(FILE *F, const char *err_msg)
1249 fprintf(F, " info2: \"%s\"", err_msg);
1253 * prints debug messages of a node to file F as info3.
1255 static void print_dbg_info(FILE *F, dbg_info *dbg)
1259 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1261 fprintf(F, " info3: \"%s\"\n", buf);
1265 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1275 static void dump_node(FILE *F, ir_node *n)
1280 if (get_opt_dump_const_local() && is_constlike_node(n))
1283 /* dump this node */
1284 fputs("node: {title: \"", F);
1288 fputs(" label: \"", F);
1289 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1290 dump_node_label(F, n);
1291 dump_node_ana_vals(F, n);
1292 //dump_node_ana_info(F, n);
1295 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1296 //fputs(" node_class:23", F);
1299 dump_node_info(F, n);
1300 print_node_error(F, p);
1301 print_dbg_info(F, get_irn_dbg_info(n));
1302 dump_node_vcgattr(F, n, NULL, bad);
1304 dump_const_node_local(F, n);
1306 if (dump_node_edge_hook)
1307 dump_node_edge_hook(F, n);
1310 /** dump the edge to the block this node belongs to */
1311 static void dump_ir_block_edge(FILE *F, ir_node *n)
1313 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1315 ir_node *block = get_nodes_block(n);
1317 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1318 dump_const_block_local(F, n);
1320 fprintf(F, "edge: { sourcename: \"");
1322 fprintf(F, "\" targetname: ");
1323 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1325 if (dump_edge_vcgattr_hook) {
1327 if (dump_edge_vcgattr_hook(F, n, -1)) {
1331 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1336 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1341 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1344 * do not use get_nodes_block() here, will fail
1345 * if the irg is not pinned.
1347 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1348 fprintf(F, INTRA_DATA_EDGE_ATTR);
1350 fprintf(F, INTER_DATA_EDGE_ATTR);
1353 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1356 * do not use get_nodes_block() here, will fail
1357 * if the irg is not pinned.
1359 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1360 fprintf(F, INTRA_MEM_EDGE_ATTR);
1362 fprintf(F, INTER_MEM_EDGE_ATTR);
1365 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1366 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1370 if (dump_edge_vcgattr_hook)
1371 if (dump_edge_vcgattr_hook(F, from, to))
1374 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1375 fprintf(F, BACK_EDGE_ATTR);
1377 switch (get_irn_opcode(from)) {
1379 fprintf(F, CF_EDGE_ATTR);
1381 case iro_Start: break;
1384 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1385 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1387 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1391 if (is_Proj(from)) {
1392 if (get_irn_mode(from) == mode_M)
1393 print_mem_edge_vcgattr(F, from, to);
1394 else if (get_irn_mode(from) == mode_X)
1395 fprintf(F, CF_EDGE_ATTR);
1397 print_data_edge_vcgattr(F, from, to);
1399 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1400 print_mem_edge_vcgattr(F, from, to);
1401 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1402 fprintf(F, CF_EDGE_ATTR);
1404 print_data_edge_vcgattr(F, from, to);
1408 /** dump edges to our inputs */
1409 static void dump_ir_data_edges(FILE *F, ir_node *n)
1413 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1414 /* the End node has only keep-alive edges */
1418 /* dump the dependency edges. */
1419 num = get_irn_deps(n);
1420 for (i = 0; i < num; ++i) {
1421 ir_node *dep = get_irn_dep(n, i);
1424 print_node_edge_kind(F, n);
1425 fprintf(F, "{sourcename: \"");
1427 fprintf(F, "\" targetname: ");
1428 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1429 PRINT_CONSTID(n, dep);
1435 fprintf(F, " label: \"%d\" ", i);
1436 fprintf(F, " color: darkgreen}\n");
1440 num = get_irn_arity(n);
1441 for (i = 0; i < num; i++) {
1442 ir_node *pred = get_irn_n(n, i);
1445 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1446 fprintf(F, "backedge: {sourcename: \"");
1448 print_node_edge_kind(F, n);
1449 fprintf(F, "{sourcename: \"");
1452 fprintf(F, "\" targetname: ");
1453 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1454 PRINT_CONSTID(n, pred);
1456 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1458 fprintf(F, " label: \"%d\" ", i);
1459 print_edge_vcgattr(F, n, i);
1467 static void dump_ir_edges(ir_node *node, void *env)
1470 FILE *F = (FILE*)env;
1471 const ir_edge_t *edge;
1473 foreach_out_edge(node, edge) {
1474 ir_node *succ = get_edge_src_irn(edge);
1476 print_node_edge_kind(F, succ);
1477 fprintf(F, "{sourcename: \"");
1479 fprintf(F, "\" targetname: \"");
1483 fprintf(F, " label: \"%d\" ", i);
1484 fprintf(F, OUT_EDGE_ATTR);
1491 /** Dumps a node and its edges but not the block edge */
1492 static void dump_node_wo_blockedge(ir_node *n, void *env)
1494 FILE *F = (FILE*)env;
1496 dump_ir_data_edges(F, n);
1499 /** Dumps a node and its edges. */
1500 static void dump_node_with_edges(ir_node *n, void *env)
1502 FILE *F = (FILE*)env;
1503 dump_node_wo_blockedge(n, env);
1504 if (!node_floats(n))
1505 dump_ir_block_edge(F, n);
1508 /** Dumps a const-like node. */
1509 static void dump_const_node(ir_node *n, void *env)
1511 if (is_Block(n)) return;
1512 dump_node_wo_blockedge(n, env);
1515 /***********************************************************************/
1516 /* the following routines dump the nodes/irgs bracketed to graphs. */
1517 /***********************************************************************/
1519 /** Dumps a constant expression as entity initializer, array bound ... */
1520 static void dump_const_expression(FILE *F, ir_node *value)
1522 ir_graph *rem = current_ir_graph;
1523 ir_dump_flags_t old_flags = ir_get_dump_flags();
1524 ir_remove_dump_flags(ir_dump_flag_consts_local);
1526 current_ir_graph = get_const_code_irg();
1527 irg_walk(value, dump_const_node, NULL, F);
1528 /* Decrease visited flag so that we walk with the same flag for the next
1529 expression. This guarantees that we don't dump the same node twice,
1530 as for const expressions cse is performed to save memory. */
1531 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1533 ir_set_dump_flags(old_flags);
1534 current_ir_graph = rem;
1537 /** Dump a block as graph containing its nodes.
1539 * Expects to find nodes belonging to the block as list in its
1541 * Dumps the edges of all nodes including itself. */
1542 static void dump_whole_block(FILE *F, ir_node *block)
1545 ird_color_t color = ird_color_block_background;
1547 assert(is_Block(block));
1549 fprintf(F, "graph: { title: \"");
1550 PRINT_NODEID(block);
1551 fprintf(F, "\" label: \"");
1552 dump_node_label(F, block);
1554 /* colorize blocks */
1555 if (! get_Block_matured(block))
1556 color = ird_color_block_background;
1558 fprintf(F, "\" status:clustered ");
1559 print_vcg_color(F, color);
1562 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1563 dump_node_info(F, block);
1564 print_dbg_info(F, get_irn_dbg_info(block));
1566 /* dump the blocks edges */
1567 dump_ir_data_edges(F, block);
1569 if (dump_block_edge_hook)
1570 dump_block_edge_hook(F, block);
1572 /* dump the nodes that go into the block */
1573 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1575 dump_ir_data_edges(F, node);
1578 /* Close the vcg information for the block */
1580 dump_const_node_local(F, block);
1584 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1585 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1586 static void dump_block_graph(FILE *F, ir_graph *irg)
1589 ir_graph *rem = current_ir_graph;
1590 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1591 current_ir_graph = irg;
1593 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1594 ir_node *node = arr[i];
1595 if (is_Block(node)) {
1596 /* Dumps the block and all the nodes in the block, which are to
1597 be found in Block->link. */
1598 dump_whole_block(F, node);
1600 /* Nodes that are not in a Block. */
1602 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1603 dump_const_block_local(F, node);
1605 dump_ir_data_edges(F, node);
1607 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1608 dump_ir_edges(node, F);
1611 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1612 dump_loop_nodes_into_graph(F, irg);
1614 current_ir_graph = rem;
1618 * Dump the info for an irg.
1619 * Parsed by XVCG but not shown. use yComp.
1621 static void dump_graph_info(FILE *F, ir_graph *irg)
1623 fprintf(F, "info1: \"");
1624 dump_entity_to_file(F, get_irg_entity(irg));
1628 /** Dumps an irg as a graph clustered by block nodes.
1629 * If interprocedural view edges can point to nodes out of this graph.
1631 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1633 ir_entity *ent = get_irg_entity(irg);
1635 fprintf(F, "graph: { title: \"");
1637 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1638 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1640 dump_graph_info(F, irg);
1641 print_dbg_info(F, get_entity_dbg_info(ent));
1643 dump_block_graph(F, irg);
1645 /* Close the vcg information for the irg */
1646 fprintf(F, "}\n\n");
1649 /*******************************************************************/
1650 /* Basic type and entity nodes and edges. */
1651 /*******************************************************************/
1653 /** dumps the edges between nodes and their type or entity attributes. */
1654 static void dump_node2type_edges(ir_node *n, void *env)
1656 FILE *F = (FILE*)env;
1659 switch (get_irn_opcode(n)) {
1661 /* @@@ some consts have an entity */
1664 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1665 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1668 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1671 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1674 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1677 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1680 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1688 static int print_type_info(FILE *F, ir_type *tp)
1692 if (get_type_state(tp) == layout_undefined) {
1693 fprintf(F, "state: layout_undefined\n");
1695 fprintf(F, "state: layout_fixed,\n");
1697 if (get_type_mode(tp))
1698 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1699 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1704 static void print_typespecific_info(FILE *F, ir_type *tp)
1706 switch (get_type_tpop_code(tp)) {
1708 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1713 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1714 fprintf(F, "params: %d\n", get_method_n_params(tp));
1715 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1721 case tpo_enumeration:
1733 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1735 switch (get_type_tpop_code(tp)) {
1737 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1740 fprintf(F, " " TYPE_METH_NODE_ATTR);
1748 case tpo_enumeration:
1759 void dump_type_node(FILE *F, ir_type *tp)
1761 fprintf(F, "node: {title: ");
1763 fprintf(F, " label: \"");
1764 if (tp->dbi != NULL) {
1766 ir_print_type(buf, sizeof(buf), tp);
1767 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1769 ir_fprintf(F, "%+F", tp);
1771 fputs("\" info1: \"", F);
1772 dump_type_to_file(F, tp);
1774 print_type_dbg_info(F, get_type_dbg_info(tp));
1775 print_typespecific_vcgattr(F, tp);
1779 static void dump_entity_node(FILE *F, ir_entity *ent)
1781 fprintf(F, "node: {title: \"");
1782 PRINT_ENTID(ent); fprintf(F, "\"");
1783 fprintf(F, " label: ");
1784 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1786 print_vcg_color(F, ird_color_entity);
1787 fprintf(F, "\n info1: \"");
1789 dump_entity_to_file(F, ent);
1792 print_dbg_info(F, get_entity_dbg_info(ent));
1796 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1799 ir_enum_const *ec = get_enumeration_const(tp, pos);
1800 ident *id = get_enumeration_const_nameid(ec);
1801 ir_tarval *tv = get_enumeration_value(ec);
1804 tarval_snprintf(buf, sizeof(buf), tv);
1806 strncpy(buf, "<not set>", sizeof(buf));
1807 fprintf(F, "node: {title: \"");
1808 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1809 fprintf(F, " label: ");
1810 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1811 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1815 * Dumps a new style initializer.
1817 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1825 * type-walker: Dumps a type or entity and its edges.
1827 static void dump_type_info(type_or_ent tore, void *env)
1829 FILE *F = (FILE*)env;
1830 size_t i = 0; /* to shutup gcc */
1832 /* dump this type or entity */
1834 switch (get_kind(tore.ent)) {
1836 ir_entity *ent = tore.ent;
1839 dump_entity_node(F, ent);
1841 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1842 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1843 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1844 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1845 if (is_Class_type(get_entity_owner(ent))) {
1846 for (i = get_entity_n_overwrites(ent); i > 0;)
1847 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1849 /* attached subgraphs */
1850 if (! (flags & ir_dump_flag_no_entity_values)) {
1851 if (ent->initializer != NULL) {
1852 /* new style initializers */
1853 dump_entity_initializer(F, ent);
1854 } else if (entity_has_compound_ent_values(ent)) {
1855 /* old style compound entity values */
1856 for (i = get_compound_ent_n_values(ent); i > 0;) {
1857 value = get_compound_ent_value(ent, --i);
1859 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1860 dump_const_expression(F, value);
1861 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1863 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1864 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1865 get_compound_ent_value_member(ent, i), i);
1874 ir_type *tp = tore.typ;
1875 dump_type_node(F, tp);
1876 /* and now the edges */
1877 switch (get_type_tpop_code(tp)) {
1879 for (i = get_class_n_supertypes(tp); i > 0;) {
1881 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1883 for (i = get_class_n_members(tp); i > 0;) {
1885 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1889 for (i = get_struct_n_members(tp); i > 0;) {
1891 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1895 for (i = get_method_n_params(tp); i > 0;) {
1897 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1899 for (i = get_method_n_ress(tp); i > 0;) {
1901 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1905 for (i = get_union_n_members(tp); i > 0;) {
1907 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1911 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1912 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1913 for (i = get_array_n_dimensions(tp); i > 0;) {
1914 ir_node *upper, *lower;
1917 upper = get_array_upper_bound(tp, i);
1918 lower = get_array_lower_bound(tp, i);
1919 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1920 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1921 dump_const_expression(F, upper);
1922 dump_const_expression(F, lower);
1925 case tpo_enumeration:
1926 for (i = get_enumeration_n_enums(tp); i > 0;) {
1928 dump_enum_item(F, tp, i);
1929 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1933 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1940 break; /* case k_type */
1943 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1944 } /* switch kind_or_entity */
1947 /** For dumping class hierarchies.
1948 * Dumps a class type node and a superclass edge.
1950 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1952 FILE *F = (FILE*)ctx;
1953 size_t i = 0; /* to shutup gcc */
1955 /* dump this type or entity */
1956 switch (get_kind(tore.ent)) {
1958 ir_entity *ent = tore.ent;
1959 if (get_entity_owner(ent) == get_glob_type()) break;
1960 if (!is_Method_type(get_entity_type(ent)))
1962 if (flags & ir_dump_flag_entities_in_hierarchy
1963 && is_Class_type(get_entity_owner(ent))) {
1965 dump_entity_node(F, ent);
1967 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1968 for (i = get_entity_n_overwrites(ent); i > 0;) {
1970 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1976 ir_type *tp = tore.typ;
1977 if (tp == get_glob_type())
1979 switch (get_type_tpop_code(tp)) {
1981 dump_type_node(F, tp);
1982 /* and now the edges */
1983 for (i = get_class_n_supertypes(tp); i > 0;) {
1985 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1990 break; /* case k_type */
1993 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1994 } /* switch kind_or_entity */
1997 /*******************************************************************/
1998 /* dump analysis information that is expressed in graph terms. */
1999 /*******************************************************************/
2001 /* dump out edges */
2002 static void dump_out_edge(ir_node *n, void *env)
2004 FILE *F = (FILE*)env;
2006 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2007 ir_node *succ = get_irn_out(n, i);
2009 print_node_edge_kind(F, succ);
2010 fprintf(F, "{sourcename: \"");
2012 fprintf(F, "\" targetname: \"");
2014 fprintf(F, "\" color: red linestyle: dashed");
2019 static void dump_loop_label(FILE *F, ir_loop *loop)
2021 fprintf(F, "loop %u, %lu sons, %lu nodes",
2022 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2023 (unsigned long) get_loop_n_nodes(loop));
2026 static void dump_loop_info(FILE *F, ir_loop *loop)
2028 fprintf(F, " info1: \"");
2029 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2030 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2031 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2036 static void dump_loop_node(FILE *F, ir_loop *loop)
2038 fprintf(F, "node: {title: \"");
2040 fprintf(F, "\" label: \"");
2041 dump_loop_label(F, loop);
2043 dump_loop_info(F, loop);
2047 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2050 fprintf(F, "edge: {sourcename: \"");
2052 fprintf(F, "\" targetname: \"");
2053 PRINT_NODEID(get_loop_node(loop, i));
2054 fprintf(F, "\" color: green");
2058 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2061 fprintf(F, "edge: {sourcename: \"");
2063 fprintf(F, "\" targetname: \"");
2064 PRINT_LOOPID(get_loop_son(loop, i));
2065 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2066 get_loop_element_pos(loop, get_loop_son(loop, i)));
2069 static void dump_loops(FILE *F, ir_loop *loop)
2072 /* dump this loop node */
2073 dump_loop_node(F, loop);
2075 /* dump edges to nodes in loop -- only if it is a real loop */
2076 if (get_loop_depth(loop) != 0) {
2077 for (i = get_loop_n_nodes(loop); i > 0;) {
2079 dump_loop_node_edge(F, loop, i);
2082 for (i = get_loop_n_sons(loop); i > 0;) {
2084 dump_loops(F, get_loop_son(loop, i));
2085 dump_loop_son_edge(F, loop, i);
2089 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2091 ir_loop *loop = get_irg_loop(irg);
2094 ir_graph *rem = current_ir_graph;
2095 current_ir_graph = irg;
2097 dump_loops(F, loop);
2099 current_ir_graph = rem;
2105 * dumps the VCG header
2107 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2111 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2115 if (! layout) layout = "Compilergraph";
2116 if (!orientation) orientation = "bottom_to_top";
2120 "graph: { title: \"ir graph of %s\"\n"
2121 "display_edge_labels: %s\n"
2122 "layoutalgorithm: mindepth //$ \"%s\"\n"
2123 "manhattan_edges: yes\n"
2124 "port_sharing: no\n"
2126 "classname 1: \"intrablock Data\"\n"
2127 "classname 2: \"Block\"\n"
2128 "classname 3: \"Entity type\"\n"
2129 "classname 4: \"Entity owner\"\n"
2130 "classname 5: \"Method Param\"\n"
2131 "classname 6: \"Method Res\"\n"
2132 "classname 7: \"Super\"\n"
2133 "classname 8: \"Union\"\n"
2134 "classname 9: \"Points-to\"\n"
2135 "classname 10: \"Array Element Type\"\n"
2136 "classname 11: \"Overwrites\"\n"
2137 "classname 12: \"Member\"\n"
2138 "classname 13: \"Control Flow\"\n"
2139 "classname 14: \"intrablock Memory\"\n"
2140 "classname 15: \"Dominators\"\n"
2141 "classname 16: \"interblock Data\"\n"
2142 "classname 17: \"interblock Memory\"\n"
2143 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2144 "classname 19: \"Postdominators\"\n"
2145 "classname 20: \"Keep Alive\"\n"
2146 "classname 21: \"Out Edges\"\n"
2147 "classname 22: \"Macro Block Edges\"\n"
2148 //"classname 23: \"NoInput Nodes\"\n"
2149 "infoname 1: \"Attribute\"\n"
2150 "infoname 2: \"Verification errors\"\n"
2151 "infoname 3: \"Debug info\"\n",
2152 name, label, layout, orientation);
2154 for (i = 0; i < ird_color_count; ++i) {
2155 if (color_rgb[i] != NULL) {
2156 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2163 * Dumps the vcg file footer
2165 void dump_vcg_footer(FILE *F)
2172 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2176 construct_block_lists(irg);
2179 * If we are in the interprocedural view, we dump not
2180 * only the requested irg but also all irgs that can be reached
2183 for (i = get_irp_n_irgs(); i > 0;) {
2184 ir_graph *other_irg = get_irp_irg(--i);
2185 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2189 dump_graph_from_list(out, other_irg);
2194 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2195 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2196 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2199 ir_graph *rem = current_ir_graph;
2200 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2201 current_ir_graph = irg;
2203 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2204 ir_extblk *extbb = arr[i];
2205 ir_node *leader = get_extbb_leader(extbb);
2208 fprintf(F, "graph: { title: \"");
2209 PRINT_EXTBBID(leader);
2210 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2211 get_irn_node_nr(leader));
2213 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2214 ir_node *node = extbb->blks[j];
2215 if (is_Block(node)) {
2216 /* Dumps the block and all the nodes in the block, which are to
2217 be found in Block->link. */
2218 dump_whole_block(F, node);
2220 /* Nodes that are not in a Block. */
2222 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2223 dump_const_block_local(F, node);
2225 dump_ir_data_edges(F, node);
2231 if ((flags & ir_dump_flag_loops)
2232 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2233 dump_loop_nodes_into_graph(F, irg);
2235 current_ir_graph = rem;
2239 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2242 ir_entity *ent = get_irg_entity(irg);
2244 if (get_irg_extblk_state(irg) != ir_extblk_info_valid)
2247 construct_extblock_lists(irg);
2249 fprintf(F, "graph: { title: \"");
2251 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2252 get_ent_dump_name(ent));
2254 dump_graph_info(F, irg);
2255 print_dbg_info(F, get_entity_dbg_info(ent));
2257 for (i = get_irp_n_irgs(); i > 0;) {
2258 ir_graph *other_irg = get_irp_irg(--i);
2259 list_tuple *lists = (list_tuple*)ird_get_irg_link(other_irg);
2262 /* dump the extended blocks first */
2263 if (ARR_LEN(lists->extbb_list)) {
2264 ird_set_irg_link(other_irg, lists->extbb_list);
2265 dump_extblock_graph(F, other_irg);
2268 /* we may have blocks without extended blocks, bad for instance */
2269 if (ARR_LEN(lists->blk_list)) {
2270 ird_set_irg_link(other_irg, lists->blk_list);
2271 dump_block_graph(F, other_irg);
2274 DEL_ARR_F(lists->extbb_list);
2275 DEL_ARR_F(lists->blk_list);
2280 /* Close the vcg information for the irg */
2281 fprintf(F, "}\n\n");
2286 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2288 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2291 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2292 if (flags & ir_dump_flag_group_extbb) {
2293 dump_blocks_extbb_grouped(out, irg);
2295 dump_blocks_as_subgraphs(out, irg);
2298 /* dump_node_with_edges must be called in post visiting predecessors */
2299 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2302 /* dump type info */
2303 if (flags & ir_dump_flag_with_typegraph) {
2304 ir_graph *rem = current_ir_graph;
2305 current_ir_graph = irg;
2307 type_walk_irg(irg, dump_type_info, NULL, out);
2308 inc_irg_visited(get_const_code_irg());
2309 /* dump edges from graph to type info */
2310 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2312 current_ir_graph = rem;
2315 /* dump iredges out edges */
2316 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2317 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2320 /* dump the out edges in a separate walk */
2321 if ((flags & ir_dump_flag_out_edges)
2322 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2323 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2326 dump_vcg_footer(out);
2329 static void dump_block_to_cfg(ir_node *block, void *env)
2331 FILE *F = (FILE*)env;
2334 if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2335 dump_node(F, block);
2338 if (is_Block(block)) {
2339 /* This is a block. Dump a node for the block. */
2340 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2341 fprintf(F, "\" label: \"");
2342 if (block == get_irg_start_block(get_irn_irg(block)))
2343 fprintf(F, "Start ");
2344 if (block == get_irg_end_block(get_irn_irg(block)))
2347 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2348 PRINT_NODEID(block);
2350 fprintf(F, "info1:\"");
2352 /* the generic version. */
2353 dump_irnode_to_file(F, block);
2355 fprintf(F, "\""); /* closing quote of info */
2357 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2358 (block == get_irg_end_block(get_irn_irg(block))) )
2359 fprintf(F, " color:blue ");
2363 /* Dump the edges */
2364 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2365 ir_node *pred = get_Block_cfgpred(block, i);
2367 pred = get_nodes_block(pred);
2368 fprintf(F, "edge: { sourcename: \"");
2369 PRINT_NODEID(block);
2370 fprintf(F, "\" targetname: \"");
2372 fprintf(F, "\"}\n");
2375 /* Dump dominator/postdominator edge */
2376 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2377 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2378 ir_node *pred = get_Block_idom(block);
2379 fprintf(F, "edge: { sourcename: \"");
2380 PRINT_NODEID(block);
2381 fprintf(F, "\" targetname: \"");
2383 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2385 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2386 ir_node *pred = get_Block_ipostdom(block);
2387 fprintf(F, "edge: { sourcename: \"");
2388 PRINT_NODEID(block);
2389 fprintf(F, "\" targetname: \"");
2391 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2397 void dump_cfg(FILE *F, ir_graph *irg)
2399 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2401 /* walk over the blocks in the graph */
2402 irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2407 void dump_callgraph(FILE *F)
2410 ir_dump_flags_t old_flags = ir_get_dump_flags();
2412 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2413 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2415 for (i = get_irp_n_irgs(); i > 0;) {
2416 ir_graph *irg = get_irp_irg(--i);
2417 ir_entity *ent = get_irg_entity(irg);
2418 size_t j, n_callees = get_irg_n_callees(irg);
2420 dump_entity_node(F, ent);
2421 for (j = 0; j < n_callees; ++j) {
2422 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2423 int be = is_irg_callee_backedge(irg, j);
2424 const char *attr = be
2425 ? "label:\"recursion %zu\""
2426 : "label:\"calls %zu\"";
2427 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2428 get_irg_callee_loop_depth(irg, j));
2432 ir_set_dump_flags(old_flags);
2436 void dump_typegraph(FILE *out)
2438 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2439 type_walk(dump_type_info, NULL, out);
2440 dump_vcg_footer(out);
2443 void dump_class_hierarchy(FILE *out)
2445 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2446 type_walk(dump_class_hierarchy_node, NULL, out);
2447 dump_vcg_footer(out);
2450 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2453 bool loop_node_started = false;
2455 size_t son_number = 0;
2457 ir_loop *son = NULL;
2459 /* Dump a new loop node. */
2460 dump_loop_node(F, loop);
2462 /* Dump the loop elements. */
2463 for (i = 0; i < get_loop_n_elements(loop); i++) {
2464 le = get_loop_element(loop, i);
2466 if (get_kind(son) == k_ir_loop) {
2468 /* We are a loop son -> Recurse */
2470 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2471 fprintf(F, "\" }\n");
2472 fprintf(F, "edge: {sourcename: \"");
2474 fprintf(F, "\" targetname: \"");
2476 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2477 (unsigned long) first,
2478 (unsigned long) first,
2479 (unsigned long) i-1);
2480 loop_node_started = false;
2482 dump_loop_son_edge(F, loop, son_number++);
2483 dump_loops_standalone(F, son);
2484 } else if (get_kind(son) == k_ir_node) {
2485 /* We are a loop node -> Collect firm nodes */
2487 ir_node *n = le.node;
2488 if (!loop_node_started) {
2489 /* Start a new node which contains all firm nodes of the current loop */
2490 fprintf(F, "node: { title: \"");
2492 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2494 loop_node_started = true;
2499 dump_node_label(F, n);
2500 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2501 if (has_backedges(n)) fprintf(F, "\t loop head!");
2502 } else { /* for callgraph loop tree */
2504 assert(get_kind(son) == k_ir_graph);
2506 /* We are a loop node -> Collect firm graphs */
2508 if (!loop_node_started) {
2509 /* Start a new node which contains all firm nodes of the current loop */
2510 fprintf(F, "node: { title: \"");
2512 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2514 loop_node_started = true;
2518 fprintf(F, " %s", get_irg_dump_name(n));
2519 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2523 if (loop_node_started) {
2524 fprintf(F, "\" }\n");
2525 fprintf(F, "edge: {sourcename: \"");
2527 fprintf(F, "\" targetname: \"");
2529 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2530 (unsigned long) first,
2531 (unsigned long) first,
2532 (unsigned long) i-1);
2533 loop_node_started = false;
2537 void dump_loop_tree(FILE *out, ir_graph *irg)
2539 ir_graph *rem = current_ir_graph;
2540 ir_dump_flags_t old_flags = ir_get_dump_flags();
2542 current_ir_graph = irg;
2543 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2545 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2547 if (get_irg_loop(irg))
2548 dump_loops_standalone(out, get_irg_loop(irg));
2550 dump_vcg_footer(out);
2552 ir_set_dump_flags(old_flags);
2553 current_ir_graph = rem;
2556 void dump_callgraph_loop_tree(FILE *out)
2558 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2559 dump_loops_standalone(out, irp->outermost_cg_loop);
2560 dump_vcg_footer(out);
2563 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2567 int node_number = 0;
2569 if (flags & ir_dump_flag_loops)
2570 dump_loop_node(F, loop);
2572 for (i = 0; i < get_loop_n_elements(loop); i++) {
2573 loop_element le = get_loop_element(loop, i);
2574 if (*(le.kind) == k_ir_loop) {
2575 if (flags & ir_dump_flag_loops)
2576 dump_loop_son_edge(F, loop, son_number++);
2578 collect_nodeloop(F, le.son, loopnodes);
2580 if (flags & ir_dump_flag_loops)
2581 dump_loop_node_edge(F, loop, node_number++);
2582 eset_insert(loopnodes, le.node);
2587 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2593 for (i = 0; i < get_loop_n_elements(loop); i++) {
2594 loop_element le = get_loop_element(loop, i);
2595 if (*(le.kind) == k_ir_loop) {
2597 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2599 if (is_Block(le.node)) start = 0; else start = -1;
2600 for (j = start; j < get_irn_arity(le.node); j++) {
2601 ir_node *pred = get_irn_n(le.node, j);
2602 if (!eset_contains(loopnodes, pred)) {
2603 eset_insert(extnodes, pred);
2604 if (!is_Block(pred)) {
2605 pred = get_nodes_block(pred);
2606 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2614 void dump_loop(FILE *F, ir_loop *l)
2616 eset *loopnodes = eset_create();
2617 eset *extnodes = eset_create();
2621 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2622 dump_vcg_header(F, name, NULL, NULL);
2624 /* collect all nodes to dump */
2625 collect_nodeloop(F, l, loopnodes);
2626 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2628 /* build block lists */
2629 eset_foreach(loopnodes, ir_node*, n) {
2630 set_irn_link(n, NULL);
2632 eset_foreach(extnodes, ir_node*, n) {
2633 set_irn_link(n, NULL);
2635 eset_foreach(loopnodes, ir_node*, n) {
2637 b = get_nodes_block(n);
2638 set_irn_link(n, get_irn_link(b));
2642 eset_foreach(extnodes, ir_node*, n) {
2644 b = get_nodes_block(n);
2645 set_irn_link(n, get_irn_link(b));
2650 eset_foreach(loopnodes, ir_node*, b) {
2652 fprintf(F, "graph: { title: \"");
2654 fprintf(F, "\" label: \"");
2655 dump_node_opcode(F, b);
2656 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2657 fprintf(F, "\" status:clustered color:yellow\n");
2659 /* dump the blocks edges */
2660 dump_ir_data_edges(F, b);
2662 /* dump the nodes that go into the block */
2663 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2664 if (eset_contains(extnodes, n))
2665 overrule_nodecolor = ird_color_block_inout;
2667 overrule_nodecolor = ird_color_default_node;
2668 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2671 /* Close the vcg information for the block */
2673 dump_const_node_local(F, b);
2677 eset_foreach(extnodes, ir_node*, b) {
2679 fprintf(F, "graph: { title: \"");
2681 fprintf(F, "\" label: \"");
2682 dump_node_opcode(F, b);
2683 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2684 fprintf(F, "\" status:clustered color:lightblue\n");
2686 /* dump the nodes that go into the block */
2687 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2688 if (!eset_contains(loopnodes, n))
2689 overrule_nodecolor = ird_color_block_inout;
2691 overrule_nodecolor = ird_color_default_node;
2692 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2695 /* Close the vcg information for the block */
2697 dump_const_node_local(F, b);
2701 eset_destroy(loopnodes);
2702 eset_destroy(extnodes);
2707 static bool obstack_init;
2708 static struct obstack obst;
2709 static char *dump_path;
2711 void ir_set_dump_path(const char *path)
2714 dump_path = xstrdup(path);
2717 static void add_string_escaped(const char *string)
2720 for (p = string; *p != '\0'; ++p) {
2723 obstack_1grow(&obst, '@');
2724 obstack_1grow(&obst, '1');
2725 } else if (c == '@') {
2726 obstack_1grow(&obst, '@');
2727 obstack_1grow(&obst, '2');
2729 obstack_1grow(&obst, c);
2734 static void add_dump_path(void)
2736 if (!obstack_init) {
2737 obstack_init(&obst);
2738 obstack_init = true;
2741 if (dump_path != NULL) {
2742 size_t len = strlen(dump_path);
2743 obstack_grow(&obst, dump_path, len);
2744 if (len > 0 && dump_path[len-1] != '/')
2745 obstack_1grow(&obst, '/');
2749 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2752 const char *dump_name = get_irg_dump_name(graph);
2756 if (!ir_should_dump(dump_name))
2761 add_string_escaped(dump_name);
2762 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2764 if (suffix != NULL) {
2765 if (suffix[0] != '.')
2766 obstack_1grow(&obst, '-');
2767 add_string_escaped(suffix);
2769 obstack_1grow(&obst, '\0');
2771 file_name = (char*)obstack_finish(&obst);
2772 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2773 out = fopen(file_name, "wb");
2774 obstack_free(&obst, file_name);
2777 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2785 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2792 obstack_printf(&obst, "%02u", irp->dump_nr++);
2793 if (suffix != NULL) {
2794 if (suffix[0] != '.')
2795 obstack_1grow(&obst, '-');
2796 add_string_escaped(suffix);
2798 obstack_1grow(&obst, '\0');
2800 file_name = (char*)obstack_finish(&obst);
2801 out = fopen(file_name, "wb");
2802 obstack_free(&obst, file_name);
2805 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2812 void dump_ir_graph(ir_graph *graph, const char *suffix)
2816 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2817 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2820 void dump_all_ir_graphs(const char *suffix)
2822 size_t i, n_irgs = get_irp_n_irgs();
2824 for (i = 0; i < n_irgs; ++i) {
2825 ir_graph *irg = get_irp_irg(i);
2826 dump_ir_graph(irg, suffix);
2830 typedef struct pass_t {
2831 ir_prog_pass_t pass;
2836 * Wrapper around dump_all_ir_graphs().
2838 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2840 pass_t *pass = (pass_t*)context;
2843 dump_all_ir_graphs(pass->suffix);
2847 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2849 size_t len = strlen(suffix) + 1;
2850 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2851 ir_prog_pass_t *res = def_prog_pass_constructor(
2852 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2854 /* this pass does not change anything, so neither dump nor verify is needed. */
2855 res->dump_irprog = ir_prog_no_dump;
2856 res->verify_irprog = ir_prog_no_verify;
2858 memcpy(pass->suffix, suffix, len);