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_node_with_edges(ir_node *n, void *env);
408 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
410 /*-----------------------------------------------------------------*/
411 /* Helper functions. */
412 /*-----------------------------------------------------------------*/
415 * This map is used as a private link attr to be able to call dumper
416 * anywhere without destroying link fields.
418 static pmap *irdump_link_map = NULL;
420 /** NOT A STANDARD LIBFIRM INIT METHOD
422 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
423 * are off, we want to have as few interferences as possible. Therefore the
424 * initialization is performed lazily and not called from within init_firm.
426 * Creates the link attribute map. */
427 static void init_irdump(void)
429 /* We need a new, empty map. */
430 if (irdump_link_map) pmap_destroy(irdump_link_map);
431 irdump_link_map = pmap_create();
432 if (!dump_file_filter_id)
433 dump_file_filter_id = new_id_from_str("");
437 * Returns the private link field.
439 static void *ird_get_irn_link(const ir_node *n)
442 if (irdump_link_map == NULL)
445 if (pmap_contains(irdump_link_map, n))
446 res = pmap_get(irdump_link_map, n);
451 * Sets the private link field.
453 static void ird_set_irn_link(const ir_node *n, void *x)
455 if (irdump_link_map == NULL)
457 pmap_insert(irdump_link_map, n, x);
461 * Gets the private link field of an irg.
463 static void *ird_get_irg_link(const ir_graph *irg)
466 if (irdump_link_map == NULL)
469 if (pmap_contains(irdump_link_map, irg))
470 res = pmap_get(irdump_link_map, irg);
475 * Sets the private link field of an irg.
477 static void ird_set_irg_link(const ir_graph *irg, void *x)
479 if (irdump_link_map == NULL)
481 pmap_insert(irdump_link_map, irg, x);
485 * Walker, clears the private link field.
487 static void clear_link(ir_node *node, void *env)
490 ird_set_irn_link(node, NULL);
494 * If the entity has a ld_name, returns it if the dump_ld_name is set,
495 * else returns the name of the entity.
497 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
500 return "<NULL entity>";
502 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
503 if (ent->ld_name != NULL)
504 return get_id_str(ent->ld_name);
506 return get_id_str(ent->name);
509 const char *get_ent_dump_name(const ir_entity *ent)
511 return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
514 const char *get_irg_dump_name(const ir_graph *irg)
516 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
517 return _get_ent_dump_name(get_irg_entity(irg), true);
521 * Returns non-zero if a node is in floating state.
523 static int node_floats(const ir_node *n)
525 return ((get_irn_pinned(n) == op_pin_state_floats) &&
526 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
530 * Walker that visits the anchors
532 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
534 if ((flags & ir_dump_flag_all_anchors)
535 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
536 irg_walk_anchors(irg, pre, post, env);
538 irg_walk_graph(irg, pre, post, env);
543 * Walker, allocates an array for all blocks and puts their non-floating
544 * nodes into this array.
546 static void collect_node(ir_node *node, void *env)
551 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
552 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
553 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
554 ARR_APP1(ir_node *, arr, node);
555 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
557 ir_node * block = get_nodes_block(node);
560 /* this node is in a Bad block, so we must place it into the graph's list */
561 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
562 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
563 ARR_APP1(ir_node *, arr, node);
564 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
566 ird_set_irn_link(node, ird_get_irn_link(block));
567 ird_set_irn_link(block, node);
572 /** Construct lists to walk ir block-wise.
574 * Collects all blocks, nodes not op_pin_state_pinned,
575 * Bad, NoMem and Unknown into a flexible array in link field of
576 * irg they belong to. Sets the irg link field to NULL in all
577 * graphs not visited.
578 * Free the list with DEL_ARR_F().
580 static ir_node **construct_block_lists(ir_graph *irg)
583 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
584 ir_graph *rem = current_ir_graph;
586 current_ir_graph = irg;
589 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
592 for (i = get_irp_n_irgs(); i > 0;)
593 ird_set_irg_link(get_irp_irg(--i), NULL);
595 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
598 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
601 current_ir_graph = rem;
602 return (ir_node**)ird_get_irg_link(irg);
605 typedef struct list_tuple {
607 ir_extblk **extbb_list;
610 /** Construct lists to walk IR extended block-wise.
611 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
612 * NULL in all graphs not visited.
614 static list_tuple *construct_extblock_lists(ir_graph *irg)
616 ir_node **blk_list = construct_block_lists(irg);
618 ir_graph *rem = current_ir_graph;
619 list_tuple *lists = XMALLOC(list_tuple);
621 current_ir_graph = irg;
623 lists->blk_list = NEW_ARR_F(ir_node *, 0);
624 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
626 inc_irg_block_visited(irg);
627 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
630 if (is_Block(blk_list[i])) {
631 ext = get_Block_extbb(blk_list[i]);
633 if (extbb_not_visited(ext)) {
634 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
635 mark_extbb_visited(ext);
638 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
642 current_ir_graph = rem;
643 ird_set_irg_link(irg, lists);
647 void dump_node_opcode(FILE *F, ir_node *n)
649 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
651 /* call the dump_node operation if available */
652 if (ops->dump_node) {
653 ops->dump_node(F, n, dump_node_opcode_txt);
657 /* implementation for default nodes */
658 switch (get_irn_opcode(n)) {
660 switch (get_SymConst_kind(n)) {
661 case symconst_addr_ent:
662 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
664 case symconst_ofs_ent:
665 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
667 case symconst_type_tag:
668 ir_fprintf(F, "SymC %+F tag", get_SymConst_type(n));
670 case symconst_type_size:
671 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
673 case symconst_type_align:
674 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
676 case symconst_enum_const:
677 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
683 ir_node *pred = get_Proj_pred(n);
685 if (get_irn_opcode(pred) == iro_Cond
686 && get_Proj_proj(n) == get_Cond_default_proj(pred)
687 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
688 fprintf(F, "defProj");
694 if (get_Load_unaligned(n) == align_non_aligned)
696 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
699 if (get_Store_unaligned(n) == align_non_aligned)
701 fprintf(F, "%s", get_irn_opname(n));
704 if (is_Block_dead(n))
706 if (n == get_irg_start_block(get_irn_irg(n)))
708 if (n == get_irg_end_block(get_irn_irg(n)))
710 fprintf(F, "%s%s", get_irn_opname(n),
711 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
714 if (get_Conv_strict(n))
715 fprintf(F, "strict");
716 fprintf(F, "%s", get_irn_opname(n));
719 fprintf(F, "%s", get_irn_opname(n));
720 if (get_Div_no_remainder(n))
722 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
725 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
728 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
733 fprintf(F, "%s", get_irn_opname(n));
738 * Dump the mode of a node n to a file F.
739 * Ignore modes that are "always known".
741 static void dump_node_mode(FILE *F, ir_node *n)
743 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
747 /* call the dump_node operation if available */
748 if (ops->dump_node) {
749 ops->dump_node(F, n, dump_node_mode_txt);
753 /* default implementation */
754 iro = get_irn_opcode(n);
766 mode = get_irn_mode(n);
768 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
769 (mode != mode_T || iro == iro_Proj))
770 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
775 * Dump the type of a node n to a file F if it's known.
777 static int dump_node_typeinfo(FILE *F, ir_node *n)
781 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
782 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
783 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
784 ir_type *tp = get_irn_typeinfo_type(n);
785 if (tp != firm_none_type) {
786 ir_fprintf(F, "[%+F]", tp);
795 typedef struct pns_lookup {
796 long nr; /**< the proj number */
797 const char *name; /**< the name of the Proj */
800 typedef struct proj_lookup {
801 unsigned code; /**< the opcode of the Proj predecessor */
802 unsigned num_data; /**< number of data entries */
803 const pns_lookup_t *data; /**< the data */
806 /** the lookup table for Proj(Start) names */
807 static const pns_lookup_t start_lut[] = {
808 #define X(a) { pn_Start_##a, #a }
815 /** the lookup table for Proj(Cond) names */
816 static const pns_lookup_t cond_lut[] = {
817 #define X(a) { pn_Cond_##a, #a }
823 /** the lookup table for Proj(Call) names */
824 static const pns_lookup_t call_lut[] = {
825 #define X(a) { pn_Call_##a, #a }
833 /** the lookup table for Proj(Div) names */
834 static const pns_lookup_t div_lut[] = {
835 #define X(a) { pn_Div_##a, #a }
843 /** the lookup table for Proj(Mod) names */
844 static const pns_lookup_t mod_lut[] = {
845 #define X(a) { pn_Mod_##a, #a }
853 /** the lookup table for Proj(Load) names */
854 static const pns_lookup_t load_lut[] = {
855 #define X(a) { pn_Load_##a, #a }
863 /** the lookup table for Proj(Store) names */
864 static const pns_lookup_t store_lut[] = {
865 #define X(a) { pn_Store_##a, #a }
872 /** the lookup table for Proj(Alloc) names */
873 static const pns_lookup_t alloc_lut[] = {
874 #define X(a) { pn_Alloc_##a, #a }
882 /** the lookup table for Proj(CopyB) names */
883 static const pns_lookup_t copyb_lut[] = {
884 #define X(a) { pn_CopyB_##a, #a }
891 /** the lookup table for Proj(InstOf) names */
892 static const pns_lookup_t instof_lut[] = {
893 #define X(a) { pn_InstOf_##a, #a }
901 /** the lookup table for Proj(Raise) names */
902 static const pns_lookup_t raise_lut[] = {
903 #define X(a) { pn_Raise_##a, #a }
909 /** the lookup table for Proj(Bound) names */
910 static const pns_lookup_t bound_lut[] = {
911 #define X(a) { pn_Bound_##a, #a }
919 /** the Proj lookup table */
920 static const proj_lookup_t proj_lut[] = {
921 #define E(a) ARRAY_SIZE(a), a
922 { iro_Start, E(start_lut) },
923 { iro_Cond, E(cond_lut) },
924 { iro_Call, E(call_lut) },
925 { iro_Div, E(div_lut) },
926 { iro_Mod, E(mod_lut) },
927 { iro_Load, E(load_lut) },
928 { iro_Store, E(store_lut) },
929 { iro_Alloc, E(alloc_lut) },
930 { iro_CopyB, E(copyb_lut) },
931 { iro_InstOf, E(instof_lut) },
932 { iro_Raise, E(raise_lut) },
933 { iro_Bound, E(bound_lut) }
938 * Dump additional node attributes of some nodes to a file F.
940 static void dump_node_nodeattr(FILE *F, ir_node *n)
945 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
947 /* call the dump_node operation if available */
948 if (ops->dump_node) {
949 ops->dump_node(F, n, dump_node_nodeattr_txt);
953 switch (get_irn_opcode(n)) {
955 ir_fprintf(F, "%T ", get_Const_tarval(n));
959 pred = get_Proj_pred(n);
960 proj_nr = get_Proj_proj(n);
961 code = get_irn_opcode(pred);
963 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
964 fprintf(F, "Arg %ld ", proj_nr);
965 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
966 fprintf(F, "%ld ", proj_nr);
968 unsigned i, j, f = 0;
970 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
971 if (code == proj_lut[i].code) {
972 for (j = 0; j < proj_lut[i].num_data; ++j) {
973 if (proj_nr == proj_lut[i].data[j].nr) {
974 fprintf(F, "%s ", proj_lut[i].data[j].name);
983 fprintf(F, "%ld ", proj_nr);
984 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
985 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
987 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
993 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
996 ir_fprintf(F, "(%+F)", get_Cast_type(n));
999 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
1002 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
1005 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
1014 #include "execution_frequency.h"
1016 static void dump_node_ana_vals(FILE *F, ir_node *n)
1023 void dump_node_label(FILE *F, ir_node *n)
1025 dump_node_opcode(F, n);
1027 dump_node_mode(F, n);
1029 dump_node_typeinfo(F, n);
1030 dump_node_nodeattr(F, n);
1031 if (flags & ir_dump_flag_number_label) {
1032 fprintf(F, "%ld", get_irn_node_nr(n));
1034 if (flags & ir_dump_flag_idx_label) {
1035 fprintf(F, ":%u", get_irn_idx(n));
1039 void dump_vrp_info(FILE *F, ir_node *n)
1041 vrp_attr *vrp = vrp_get_info(n);
1046 fprintf(F, "range_type: %d\n", (int) vrp->range_type);
1047 if (vrp->range_type == VRP_RANGE || vrp->range_type ==
1049 ir_fprintf(F, "range_bottom: %F\n",vrp->range_bottom);
1050 ir_fprintf(F, "range_top: %F\n", vrp->range_top);
1052 ir_fprintf(F, "bits_set: %T\n", vrp->bits_set);
1053 ir_fprintf(F, "bits_not_set: %T\n", vrp->bits_not_set);
1057 * Dumps the attributes of a node n into the file F.
1058 * Currently this is only the color of a node.
1060 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1066 print_vcg_color(F, ird_color_error);
1070 if (dump_node_vcgattr_hook != NULL) {
1071 dump_node_vcgattr_hook(F, node, local);
1075 n = local ? local : node;
1077 if (overrule_nodecolor != ird_color_default_node) {
1078 print_vcg_color(F, overrule_nodecolor);
1082 mode = get_irn_mode(n);
1083 if (mode == mode_M) {
1084 print_vcg_color(F, ird_color_memory);
1087 if (mode == mode_X) {
1088 print_vcg_color(F, ird_color_controlflow);
1092 switch (get_irn_opcode(n)) {
1095 print_vcg_color(F, ird_color_anchor);
1098 print_vcg_color(F, ird_color_error);
1101 if (is_Block_dead(n))
1102 print_vcg_color(F, ird_color_dead_block_background);
1104 print_vcg_color(F, ird_color_block_background);
1107 print_vcg_color(F, ird_color_phi);
1110 print_vcg_color(F, ird_color_memory);
1114 print_vcg_color(F, ird_color_const);
1117 print_vcg_color(F, ird_color_proj);
1120 ir_op *op = get_irn_op(node);
1122 if (is_op_constlike(op)) {
1123 print_vcg_color(F, ird_color_const);
1124 } else if (is_op_uses_memory(op)) {
1125 print_vcg_color(F, ird_color_uses_memory);
1126 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1127 print_vcg_color(F, ird_color_controlflow);
1133 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1135 hook_entry_t *info = XMALLOC(hook_entry_t);
1137 info->hook._hook_node_info = cb;
1138 info->context = data;
1139 register_hook(hook_node_info, info);
1144 void dump_remove_node_info_callback(void *handle)
1146 hook_entry_t *info = (hook_entry_t*)handle;
1147 unregister_hook(hook_node_info, info);
1152 * Dump the node information of a node n to a file F.
1154 static void dump_node_info(FILE *F, ir_node *n)
1156 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1158 fprintf(F, " info1: \"");
1159 dump_irnode_to_file(F, n);
1160 /* call the dump_node operation if available */
1162 ops->dump_node(F, n, dump_node_info_txt);
1164 /* allow additional info to be added */
1165 hook_node_info(F, n);
1169 static int is_constlike_node(const ir_node *node)
1171 const ir_op *op = get_irn_op(node);
1172 return is_op_constlike(op);
1176 /** outputs the predecessors of n, that are constants, local. I.e.,
1177 generates a copy of the constant predecessors for each node called with. */
1178 static void dump_const_node_local(FILE *F, ir_node *n)
1181 if (!get_opt_dump_const_local()) return;
1183 /* Use visited flag to avoid outputting nodes twice.
1184 initialize it first. */
1185 for (i = 0; i < get_irn_arity(n); i++) {
1186 ir_node *con = get_irn_n(n, i);
1187 if (is_constlike_node(con)) {
1188 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1192 for (i = 0; i < get_irn_arity(n); i++) {
1193 ir_node *con = get_irn_n(n, i);
1194 if (is_constlike_node(con) && !irn_visited(con)) {
1195 mark_irn_visited(con);
1196 /* Generate a new name for the node by appending the names of
1198 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1199 fprintf(F, " label: \"");
1200 dump_node_label(F, con);
1202 dump_node_info(F, con);
1203 dump_node_vcgattr(F, n, con, 0);
1209 /** If the block of an edge is a const_like node, dump it local with an edge */
1210 static void dump_const_block_local(FILE *F, ir_node *n)
1214 if (!get_opt_dump_const_local()) return;
1216 blk = get_nodes_block(n);
1217 if (is_constlike_node(blk)) {
1218 /* Generate a new name for the node by appending the names of
1220 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1221 fprintf(F, "\" label: \"");
1222 dump_node_label(F, blk);
1224 dump_node_info(F, blk);
1225 dump_node_vcgattr(F, n, blk, 0);
1228 fprintf(F, "edge: { sourcename: \"");
1230 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1232 if (dump_edge_vcgattr_hook) {
1234 if (dump_edge_vcgattr_hook(F, n, -1)) {
1238 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1243 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1248 * prints the error message of a node to a file F as info2.
1250 static void print_node_error(FILE *F, const char *err_msg)
1255 fprintf(F, " info2: \"%s\"", err_msg);
1259 * prints debug messages of a node to file F as info3.
1261 static void print_dbg_info(FILE *F, dbg_info *dbg)
1265 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1267 fprintf(F, " info3: \"%s\"\n", buf);
1271 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1281 static void dump_node(FILE *F, ir_node *n)
1286 if (get_opt_dump_const_local() && is_constlike_node(n))
1289 /* dump this node */
1290 fputs("node: {title: \"", F);
1294 fputs(" label: \"", F);
1295 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1296 dump_node_label(F, n);
1297 dump_node_ana_vals(F, n);
1298 //dump_node_ana_info(F, n);
1301 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1302 //fputs(" node_class:23", F);
1305 dump_node_info(F, n);
1306 print_node_error(F, p);
1307 print_dbg_info(F, get_irn_dbg_info(n));
1308 dump_node_vcgattr(F, n, NULL, bad);
1310 dump_const_node_local(F, n);
1312 if (dump_node_edge_hook)
1313 dump_node_edge_hook(F, n);
1316 /** dump the edge to the block this node belongs to */
1317 static void dump_ir_block_edge(FILE *F, ir_node *n)
1319 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1321 ir_node *block = get_nodes_block(n);
1323 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1324 dump_const_block_local(F, n);
1326 fprintf(F, "edge: { sourcename: \"");
1328 fprintf(F, "\" targetname: ");
1329 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1331 if (dump_edge_vcgattr_hook) {
1333 if (dump_edge_vcgattr_hook(F, n, -1)) {
1337 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1342 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1347 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1350 * do not use get_nodes_block() here, will fail
1351 * if the irg is not pinned.
1353 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1354 fprintf(F, INTRA_DATA_EDGE_ATTR);
1356 fprintf(F, INTER_DATA_EDGE_ATTR);
1359 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1362 * do not use get_nodes_block() here, will fail
1363 * if the irg is not pinned.
1365 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1366 fprintf(F, INTRA_MEM_EDGE_ATTR);
1368 fprintf(F, INTER_MEM_EDGE_ATTR);
1371 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1372 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1376 if (dump_edge_vcgattr_hook)
1377 if (dump_edge_vcgattr_hook(F, from, to))
1380 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1381 fprintf(F, BACK_EDGE_ATTR);
1383 switch (get_irn_opcode(from)) {
1385 fprintf(F, CF_EDGE_ATTR);
1387 case iro_Start: break;
1390 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1391 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1393 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1397 if (is_Proj(from)) {
1398 if (get_irn_mode(from) == mode_M)
1399 print_mem_edge_vcgattr(F, from, to);
1400 else if (get_irn_mode(from) == mode_X)
1401 fprintf(F, CF_EDGE_ATTR);
1403 print_data_edge_vcgattr(F, from, to);
1405 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1406 print_mem_edge_vcgattr(F, from, to);
1407 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1408 fprintf(F, CF_EDGE_ATTR);
1410 print_data_edge_vcgattr(F, from, to);
1414 /** dump edges to our inputs */
1415 static void dump_ir_data_edges(FILE *F, ir_node *n)
1419 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1420 /* the End node has only keep-alive edges */
1424 /* dump the dependency edges. */
1425 num = get_irn_deps(n);
1426 for (i = 0; i < num; ++i) {
1427 ir_node *dep = get_irn_dep(n, i);
1430 print_node_edge_kind(F, n);
1431 fprintf(F, "{sourcename: \"");
1433 fprintf(F, "\" targetname: ");
1434 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1435 PRINT_CONSTID(n, dep);
1441 fprintf(F, " label: \"%d\" ", i);
1442 fprintf(F, " color: darkgreen}\n");
1446 num = get_irn_arity(n);
1447 for (i = 0; i < num; i++) {
1448 ir_node *pred = get_irn_n(n, i);
1451 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1452 fprintf(F, "backedge: {sourcename: \"");
1454 print_node_edge_kind(F, n);
1455 fprintf(F, "{sourcename: \"");
1458 fprintf(F, "\" targetname: ");
1459 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1460 PRINT_CONSTID(n, pred);
1462 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1464 fprintf(F, " label: \"%d\" ", i);
1465 print_edge_vcgattr(F, n, i);
1473 static void dump_ir_edges(ir_node *node, void *env)
1476 FILE *F = (FILE*)env;
1477 const ir_edge_t *edge;
1479 foreach_out_edge(node, edge) {
1480 ir_node *succ = get_edge_src_irn(edge);
1482 print_node_edge_kind(F, succ);
1483 fprintf(F, "{sourcename: \"");
1485 fprintf(F, "\" targetname: \"");
1489 fprintf(F, " label: \"%d\" ", i);
1490 fprintf(F, OUT_EDGE_ATTR);
1497 /** Dumps a node and its edges but not the block edge */
1498 static void dump_node_wo_blockedge(ir_node *n, void *env)
1500 FILE *F = (FILE*)env;
1502 dump_ir_data_edges(F, n);
1505 /** Dumps a node and its edges. */
1506 static void dump_node_with_edges(ir_node *n, void *env)
1508 FILE *F = (FILE*)env;
1509 dump_node_wo_blockedge(n, env);
1510 if (!node_floats(n))
1511 dump_ir_block_edge(F, n);
1514 /** Dumps a const-like node. */
1515 static void dump_const_node(ir_node *n, void *env)
1517 if (is_Block(n)) return;
1518 dump_node_wo_blockedge(n, env);
1521 /***********************************************************************/
1522 /* the following routines dump the nodes/irgs bracketed to graphs. */
1523 /***********************************************************************/
1525 /** Dumps a constant expression as entity initializer, array bound ... */
1526 static void dump_const_expression(FILE *F, ir_node *value)
1528 ir_graph *rem = current_ir_graph;
1529 ir_dump_flags_t old_flags = ir_get_dump_flags();
1530 ir_remove_dump_flags(ir_dump_flag_consts_local);
1532 current_ir_graph = get_const_code_irg();
1533 irg_walk(value, dump_const_node, NULL, F);
1534 /* Decrease visited flag so that we walk with the same flag for the next
1535 expression. This guarantees that we don't dump the same node twice,
1536 as for const expressions cse is performed to save memory. */
1537 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1539 ir_set_dump_flags(old_flags);
1540 current_ir_graph = rem;
1543 /** Dump a block as graph containing its nodes.
1545 * Expects to find nodes belonging to the block as list in its
1547 * Dumps the edges of all nodes including itself. */
1548 static void dump_whole_block(FILE *F, ir_node *block)
1551 ird_color_t color = ird_color_block_background;
1553 assert(is_Block(block));
1555 fprintf(F, "graph: { title: \"");
1556 PRINT_NODEID(block);
1557 fprintf(F, "\" label: \"");
1558 dump_node_label(F, block);
1560 /* colorize blocks */
1561 if (! get_Block_matured(block))
1562 color = ird_color_block_background;
1563 if (is_Block_dead(block))
1564 color = ird_color_dead_block_background;
1566 fprintf(F, "\" status:clustered ");
1567 print_vcg_color(F, color);
1570 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1571 dump_node_info(F, block);
1572 print_dbg_info(F, get_irn_dbg_info(block));
1574 /* dump the blocks edges */
1575 dump_ir_data_edges(F, block);
1577 if (dump_block_edge_hook)
1578 dump_block_edge_hook(F, block);
1580 /* dump the nodes that go into the block */
1581 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1583 dump_ir_data_edges(F, node);
1586 /* Close the vcg information for the block */
1588 dump_const_node_local(F, block);
1592 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1593 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1594 static void dump_block_graph(FILE *F, ir_graph *irg)
1597 ir_graph *rem = current_ir_graph;
1598 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1599 current_ir_graph = irg;
1601 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1602 ir_node *node = arr[i];
1603 if (is_Block(node)) {
1604 /* Dumps the block and all the nodes in the block, which are to
1605 be found in Block->link. */
1606 dump_whole_block(F, node);
1608 /* Nodes that are not in a Block. */
1610 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1611 dump_const_block_local(F, node);
1613 dump_ir_data_edges(F, node);
1615 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1616 dump_ir_edges(node, F);
1619 if ((flags & ir_dump_flag_loops) && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1620 dump_loop_nodes_into_graph(F, irg);
1622 current_ir_graph = rem;
1626 * Dump the info for an irg.
1627 * Parsed by XVCG but not shown. use yComp.
1629 static void dump_graph_info(FILE *F, ir_graph *irg)
1631 fprintf(F, "info1: \"");
1632 dump_entity_to_file(F, get_irg_entity(irg));
1636 /** Dumps an irg as a graph clustered by block nodes.
1637 * If interprocedural view edges can point to nodes out of this graph.
1639 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1641 ir_entity *ent = get_irg_entity(irg);
1643 fprintf(F, "graph: { title: \"");
1645 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1646 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1648 dump_graph_info(F, irg);
1649 print_dbg_info(F, get_entity_dbg_info(ent));
1651 dump_block_graph(F, irg);
1653 /* Close the vcg information for the irg */
1654 fprintf(F, "}\n\n");
1657 /*******************************************************************/
1658 /* Basic type and entity nodes and edges. */
1659 /*******************************************************************/
1661 /** dumps the edges between nodes and their type or entity attributes. */
1662 static void dump_node2type_edges(ir_node *n, void *env)
1664 FILE *F = (FILE*)env;
1667 switch (get_irn_opcode(n)) {
1669 /* @@@ some consts have an entity */
1672 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1673 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1676 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1679 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1682 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1685 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1688 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1696 static int print_type_info(FILE *F, ir_type *tp)
1700 if (get_type_state(tp) == layout_undefined) {
1701 fprintf(F, "state: layout_undefined\n");
1703 fprintf(F, "state: layout_fixed,\n");
1705 if (get_type_mode(tp))
1706 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1707 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1712 static void print_typespecific_info(FILE *F, ir_type *tp)
1714 switch (get_type_tpop_code(tp)) {
1716 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1721 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1722 fprintf(F, "params: %d\n", get_method_n_params(tp));
1723 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1729 case tpo_enumeration:
1741 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1743 switch (get_type_tpop_code(tp)) {
1745 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1748 fprintf(F, " " TYPE_METH_NODE_ATTR);
1756 case tpo_enumeration:
1767 void dump_type_node(FILE *F, ir_type *tp)
1769 fprintf(F, "node: {title: ");
1771 fprintf(F, " label: \"%s ", get_type_tpop_name(tp));
1772 if (tp->dbi != NULL) {
1774 ir_print_type(buf, sizeof(buf), tp);
1775 fprintf(F, "'%s'", buf);
1777 ir_fprintf(F, "%+F", tp);
1779 fputs("\" info1: \"", F);
1780 dump_type_to_file(F, tp);
1782 print_type_dbg_info(F, get_type_dbg_info(tp));
1783 print_typespecific_vcgattr(F, tp);
1787 static void dump_entity_node(FILE *F, ir_entity *ent)
1789 fprintf(F, "node: {title: \"");
1790 PRINT_ENTID(ent); fprintf(F, "\"");
1791 fprintf(F, " label: ");
1792 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1794 print_vcg_color(F, ird_color_entity);
1795 fprintf(F, "\n info1: \"");
1797 dump_entity_to_file(F, ent);
1800 print_dbg_info(F, get_entity_dbg_info(ent));
1804 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1807 ir_enum_const *ec = get_enumeration_const(tp, pos);
1808 ident *id = get_enumeration_const_nameid(ec);
1809 ir_tarval *tv = get_enumeration_value(ec);
1812 tarval_snprintf(buf, sizeof(buf), tv);
1814 strncpy(buf, "<not set>", sizeof(buf));
1815 fprintf(F, "node: {title: \"");
1816 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1817 fprintf(F, " label: ");
1818 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1819 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1823 * Dumps a new style initializer.
1825 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1832 /** Dumps a type or entity and its edges. */
1833 static void dump_type_info(type_or_ent tore, void *env)
1835 FILE *F = (FILE*)env;
1836 size_t i = 0; /* to shutup gcc */
1838 /* dump this type or entity */
1840 switch (get_kind(tore.ent)) {
1842 ir_entity *ent = tore.ent;
1845 dump_entity_node(F, ent);
1847 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1848 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1849 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1850 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1851 if (is_Class_type(get_entity_owner(ent))) {
1852 for (i = get_entity_n_overwrites(ent); i > 0;)
1853 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1855 /* attached subgraphs */
1856 if (! (flags & ir_dump_flag_no_entity_values)) {
1857 if (ent->initializer != NULL) {
1858 /* new style initializers */
1859 dump_entity_initializer(F, ent);
1860 } else if (entity_has_compound_ent_values(ent)) {
1861 /* old style compound entity values */
1862 for (i = get_compound_ent_n_values(ent); i > 0;) {
1863 value = get_compound_ent_value(ent, --i);
1865 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1866 dump_const_expression(F, value);
1867 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1869 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1870 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1871 get_compound_ent_value_member(ent, i), i);
1880 ir_type *tp = tore.typ;
1881 dump_type_node(F, tp);
1882 /* and now the edges */
1883 switch (get_type_tpop_code(tp)) {
1885 for (i = get_class_n_supertypes(tp); i > 0;) {
1887 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1889 for (i = get_class_n_members(tp); i > 0;) {
1891 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1895 for (i = get_struct_n_members(tp); i > 0;) {
1897 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1901 for (i = get_method_n_params(tp); i > 0;) {
1903 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1905 for (i = get_method_n_ress(tp); i > 0;) {
1907 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1911 for (i = get_union_n_members(tp); i > 0;) {
1913 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1917 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1918 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1919 for (i = get_array_n_dimensions(tp); i > 0;) {
1920 ir_node *upper, *lower;
1923 upper = get_array_upper_bound(tp, i);
1924 lower = get_array_lower_bound(tp, i);
1925 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1926 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1927 dump_const_expression(F, upper);
1928 dump_const_expression(F, lower);
1931 case tpo_enumeration:
1932 for (i = get_enumeration_n_enums(tp); i > 0;) {
1934 dump_enum_item(F, tp, i);
1935 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1939 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1946 break; /* case k_type */
1949 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1950 } /* switch kind_or_entity */
1953 /** For dumping class hierarchies.
1954 * Dumps a class type node and a superclass edge.
1956 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1958 FILE *F = (FILE*)ctx;
1959 size_t i = 0; /* to shutup gcc */
1961 /* dump this type or entity */
1962 switch (get_kind(tore.ent)) {
1964 ir_entity *ent = tore.ent;
1965 if (get_entity_owner(ent) == get_glob_type()) break;
1966 if (!is_Method_type(get_entity_type(ent)))
1968 if (flags & ir_dump_flag_entities_in_hierarchy
1969 && is_Class_type(get_entity_owner(ent))) {
1971 dump_entity_node(F, ent);
1973 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1974 for (i = get_entity_n_overwrites(ent); i > 0;) {
1976 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1982 ir_type *tp = tore.typ;
1983 if (tp == get_glob_type())
1985 switch (get_type_tpop_code(tp)) {
1987 dump_type_node(F, tp);
1988 /* and now the edges */
1989 for (i = get_class_n_supertypes(tp); i > 0;) {
1991 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1996 break; /* case k_type */
1999 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2000 } /* switch kind_or_entity */
2003 /*******************************************************************/
2004 /* dump analysis information that is expressed in graph terms. */
2005 /*******************************************************************/
2007 /* dump out edges */
2008 static void dump_out_edge(ir_node *n, void *env)
2010 FILE *F = (FILE*)env;
2012 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2013 ir_node *succ = get_irn_out(n, i);
2015 print_node_edge_kind(F, succ);
2016 fprintf(F, "{sourcename: \"");
2018 fprintf(F, "\" targetname: \"");
2020 fprintf(F, "\" color: red linestyle: dashed");
2025 static void dump_loop_label(FILE *F, ir_loop *loop)
2027 fprintf(F, "loop %u, %lu sons, %lu nodes",
2028 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2029 (unsigned long) get_loop_n_nodes(loop));
2032 static void dump_loop_info(FILE *F, ir_loop *loop)
2034 fprintf(F, " info1: \"");
2035 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2036 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2037 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2042 static void dump_loop_node(FILE *F, ir_loop *loop)
2044 fprintf(F, "node: {title: \"");
2046 fprintf(F, "\" label: \"");
2047 dump_loop_label(F, loop);
2049 dump_loop_info(F, loop);
2053 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2056 fprintf(F, "edge: {sourcename: \"");
2058 fprintf(F, "\" targetname: \"");
2059 PRINT_NODEID(get_loop_node(loop, i));
2060 fprintf(F, "\" color: green");
2064 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2067 fprintf(F, "edge: {sourcename: \"");
2069 fprintf(F, "\" targetname: \"");
2070 PRINT_LOOPID(get_loop_son(loop, i));
2071 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2072 get_loop_element_pos(loop, get_loop_son(loop, i)));
2075 static void dump_loops(FILE *F, ir_loop *loop)
2078 /* dump this loop node */
2079 dump_loop_node(F, loop);
2081 /* dump edges to nodes in loop -- only if it is a real loop */
2082 if (get_loop_depth(loop) != 0) {
2083 for (i = get_loop_n_nodes(loop); i > 0;) {
2085 dump_loop_node_edge(F, loop, i);
2088 for (i = get_loop_n_sons(loop); i > 0;) {
2090 dump_loops(F, get_loop_son(loop, i));
2091 dump_loop_son_edge(F, loop, i);
2095 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2097 ir_loop *loop = get_irg_loop(irg);
2100 ir_graph *rem = current_ir_graph;
2101 current_ir_graph = irg;
2103 dump_loops(F, loop);
2105 current_ir_graph = rem;
2111 * dumps the VCG header
2113 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2117 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2121 if (! layout) layout = "Compilergraph";
2122 if (!orientation) orientation = "bottom_to_top";
2126 "graph: { title: \"ir graph of %s\"\n"
2127 "display_edge_labels: %s\n"
2128 "layoutalgorithm: mindepth //$ \"%s\"\n"
2129 "manhattan_edges: yes\n"
2130 "port_sharing: no\n"
2132 "classname 1: \"intrablock Data\"\n"
2133 "classname 2: \"Block\"\n"
2134 "classname 3: \"Entity type\"\n"
2135 "classname 4: \"Entity owner\"\n"
2136 "classname 5: \"Method Param\"\n"
2137 "classname 6: \"Method Res\"\n"
2138 "classname 7: \"Super\"\n"
2139 "classname 8: \"Union\"\n"
2140 "classname 9: \"Points-to\"\n"
2141 "classname 10: \"Array Element Type\"\n"
2142 "classname 11: \"Overwrites\"\n"
2143 "classname 12: \"Member\"\n"
2144 "classname 13: \"Control Flow\"\n"
2145 "classname 14: \"intrablock Memory\"\n"
2146 "classname 15: \"Dominators\"\n"
2147 "classname 16: \"interblock Data\"\n"
2148 "classname 17: \"interblock Memory\"\n"
2149 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2150 "classname 19: \"Postdominators\"\n"
2151 "classname 20: \"Keep Alive\"\n"
2152 "classname 21: \"Out Edges\"\n"
2153 "classname 22: \"Macro Block Edges\"\n"
2154 //"classname 23: \"NoInput Nodes\"\n"
2155 "infoname 1: \"Attribute\"\n"
2156 "infoname 2: \"Verification errors\"\n"
2157 "infoname 3: \"Debug info\"\n",
2158 name, label, layout, orientation);
2160 for (i = 0; i < ird_color_count; ++i) {
2161 if (color_rgb[i] != NULL) {
2162 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2169 * Dumps the vcg file footer
2171 void dump_vcg_footer(FILE *F)
2178 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2182 construct_block_lists(irg);
2185 * If we are in the interprocedural view, we dump not
2186 * only the requested irg but also all irgs that can be reached
2189 for (i = get_irp_n_irgs(); i > 0;) {
2190 ir_graph *irg = get_irp_irg(--i);
2191 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
2195 dump_graph_from_list(out, irg);
2200 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2201 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2202 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2205 ir_graph *rem = current_ir_graph;
2206 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2207 current_ir_graph = irg;
2209 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2210 ir_extblk *extbb = arr[i];
2211 ir_node *leader = get_extbb_leader(extbb);
2214 fprintf(F, "graph: { title: \"");
2215 PRINT_EXTBBID(leader);
2216 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2217 get_irn_node_nr(leader));
2219 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2220 ir_node *node = extbb->blks[j];
2221 if (is_Block(node)) {
2222 /* Dumps the block and all the nodes in the block, which are to
2223 be found in Block->link. */
2224 dump_whole_block(F, node);
2226 /* Nodes that are not in a Block. */
2228 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2229 dump_const_block_local(F, node);
2231 dump_ir_data_edges(F, node);
2237 if ((flags & ir_dump_flag_loops)
2238 && (get_irg_loopinfo_state(irg) & loopinfo_valid))
2239 dump_loop_nodes_into_graph(F, irg);
2241 current_ir_graph = rem;
2245 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2248 ir_entity *ent = get_irg_entity(irg);
2250 if (get_irg_extblk_state(irg) != ir_extblk_info_valid)
2253 construct_extblock_lists(irg);
2255 fprintf(F, "graph: { title: \"");
2257 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2258 get_ent_dump_name(ent));
2260 dump_graph_info(F, irg);
2261 print_dbg_info(F, get_entity_dbg_info(ent));
2263 for (i = get_irp_n_irgs(); i > 0;) {
2264 ir_graph *irg = get_irp_irg(--i);
2265 list_tuple *lists = (list_tuple*)ird_get_irg_link(irg);
2268 /* dump the extended blocks first */
2269 if (ARR_LEN(lists->extbb_list)) {
2270 ird_set_irg_link(irg, lists->extbb_list);
2271 dump_extblock_graph(F, irg);
2274 /* we may have blocks without extended blocks, bad for instance */
2275 if (ARR_LEN(lists->blk_list)) {
2276 ird_set_irg_link(irg, lists->blk_list);
2277 dump_block_graph(F, irg);
2280 DEL_ARR_F(lists->extbb_list);
2281 DEL_ARR_F(lists->blk_list);
2286 /* Close the vcg information for the irg */
2287 fprintf(F, "}\n\n");
2292 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2294 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2297 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2298 if (flags & ir_dump_flag_group_extbb) {
2299 dump_blocks_extbb_grouped(out, irg);
2301 dump_blocks_as_subgraphs(out, irg);
2304 /* dump_node_with_edges must be called in post visiting predecessors */
2305 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2308 /* dump type info */
2309 if (flags & ir_dump_flag_with_typegraph) {
2310 ir_graph *rem = current_ir_graph;
2311 current_ir_graph = irg;
2313 type_walk_irg(irg, dump_type_info, NULL, out);
2314 inc_irg_visited(get_const_code_irg());
2315 /* dump edges from graph to type info */
2316 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2318 current_ir_graph = rem;
2321 /* dump iredges out edges */
2322 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2323 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2326 /* dump the out edges in a separate walk */
2327 if ((flags & ir_dump_flag_out_edges)
2328 && (get_irg_outs_state(irg) != outs_none)) {
2329 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2332 dump_vcg_footer(out);
2335 static void dump_block_to_cfg(ir_node *block, void *env)
2337 FILE *F = (FILE*)env;
2341 if (is_Block(block)) {
2342 /* This is a block. Dump a node for the block. */
2343 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2344 fprintf(F, "\" label: \"");
2345 if (block == get_irg_start_block(get_irn_irg(block)))
2346 fprintf(F, "Start ");
2347 if (block == get_irg_end_block(get_irn_irg(block)))
2350 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2351 PRINT_NODEID(block);
2353 fprintf(F, "info1:\"");
2355 /* the generic version. */
2356 dump_irnode_to_file(F, block);
2358 /* Check whether we have bad predecessors to color the block. */
2359 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2360 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2363 fprintf(F, "\""); /* closing quote of info */
2365 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2366 (block == get_irg_end_block(get_irn_irg(block))) )
2367 fprintf(F, " color:blue ");
2369 fprintf(F, " color:yellow ");
2372 /* Dump the edges */
2373 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2374 if (!is_Bad(skip_Proj(get_Block_cfgpred(block, i)))) {
2375 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2376 fprintf(F, "edge: { sourcename: \"");
2377 PRINT_NODEID(block);
2378 fprintf(F, "\" targetname: \"");
2380 fprintf(F, "\"}\n");
2383 /* Dump dominator/postdominator edge */
2384 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2385 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2386 pred = get_Block_idom(block);
2387 fprintf(F, "edge: { sourcename: \"");
2388 PRINT_NODEID(block);
2389 fprintf(F, "\" targetname: \"");
2391 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2393 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2394 pred = get_Block_ipostdom(block);
2395 fprintf(F, "edge: { sourcename: \"");
2396 PRINT_NODEID(block);
2397 fprintf(F, "\" targetname: \"");
2399 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2405 void dump_cfg(FILE *F, ir_graph *irg)
2407 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2409 /* walk over the blocks in the graph */
2410 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, F);
2411 dump_node(F, get_irg_bad(irg));
2416 void dump_callgraph(FILE *F)
2419 ir_dump_flags_t old_flags = ir_get_dump_flags();
2421 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2422 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2424 for (i = get_irp_n_irgs(); i > 0;) {
2425 ir_graph *irg = get_irp_irg(--i);
2426 ir_entity *ent = get_irg_entity(irg);
2427 size_t j, n_callees = get_irg_n_callees(irg);
2429 dump_entity_node(F, ent);
2430 for (j = 0; j < n_callees; ++j) {
2431 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2432 int be = is_irg_callee_backedge(irg, j);
2433 const char *attr = be
2434 ? "label:\"recursion %zu\""
2435 : "label:\"calls %zu\"";
2436 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2437 get_irg_callee_loop_depth(irg, j));
2441 ir_set_dump_flags(old_flags);
2445 void dump_typegraph(FILE *out)
2447 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2448 type_walk(dump_type_info, NULL, out);
2449 dump_vcg_footer(out);
2452 void dump_class_hierarchy(FILE *out)
2454 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2455 type_walk(dump_class_hierarchy_node, NULL, out);
2456 dump_vcg_footer(out);
2459 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2462 bool loop_node_started = false;
2464 size_t son_number = 0;
2466 ir_loop *son = NULL;
2468 /* Dump a new loop node. */
2469 dump_loop_node(F, loop);
2471 /* Dump the loop elements. */
2472 for (i = 0; i < get_loop_n_elements(loop); i++) {
2473 le = get_loop_element(loop, i);
2475 if (get_kind(son) == k_ir_loop) {
2477 /* We are a loop son -> Recurse */
2479 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2480 fprintf(F, "\" }\n");
2481 fprintf(F, "edge: {sourcename: \"");
2483 fprintf(F, "\" targetname: \"");
2485 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2486 (unsigned long) first,
2487 (unsigned long) first,
2488 (unsigned long) i-1);
2489 loop_node_started = false;
2491 dump_loop_son_edge(F, loop, son_number++);
2492 dump_loops_standalone(F, son);
2493 } else if (get_kind(son) == k_ir_node) {
2494 /* We are a loop node -> Collect firm nodes */
2496 ir_node *n = le.node;
2497 if (!loop_node_started) {
2498 /* Start a new node which contains all firm nodes of the current loop */
2499 fprintf(F, "node: { title: \"");
2501 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2503 loop_node_started = true;
2508 dump_node_label(F, n);
2509 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2510 if (has_backedges(n)) fprintf(F, "\t loop head!");
2511 } else { /* for callgraph loop tree */
2513 assert(get_kind(son) == k_ir_graph);
2515 /* We are a loop node -> Collect firm graphs */
2517 if (!loop_node_started) {
2518 /* Start a new node which contains all firm nodes of the current loop */
2519 fprintf(F, "node: { title: \"");
2521 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2523 loop_node_started = true;
2527 fprintf(F, " %s", get_irg_dump_name(n));
2528 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2532 if (loop_node_started) {
2533 fprintf(F, "\" }\n");
2534 fprintf(F, "edge: {sourcename: \"");
2536 fprintf(F, "\" targetname: \"");
2538 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2539 (unsigned long) first,
2540 (unsigned long) first,
2541 (unsigned long) i-1);
2542 loop_node_started = false;
2546 void dump_loop_tree(FILE *out, ir_graph *irg)
2548 ir_graph *rem = current_ir_graph;
2549 ir_dump_flags_t old_flags = ir_get_dump_flags();
2551 current_ir_graph = irg;
2552 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2554 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2556 if (get_irg_loop(irg))
2557 dump_loops_standalone(out, get_irg_loop(irg));
2559 dump_vcg_footer(out);
2561 ir_set_dump_flags(old_flags);
2562 current_ir_graph = rem;
2565 void dump_callgraph_loop_tree(FILE *out)
2567 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2568 dump_loops_standalone(out, irp->outermost_cg_loop);
2569 dump_vcg_footer(out);
2572 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2576 int node_number = 0;
2578 if (flags & ir_dump_flag_loops)
2579 dump_loop_node(F, loop);
2581 for (i = 0; i < get_loop_n_elements(loop); i++) {
2582 loop_element le = get_loop_element(loop, i);
2583 if (*(le.kind) == k_ir_loop) {
2584 if (flags & ir_dump_flag_loops)
2585 dump_loop_son_edge(F, loop, son_number++);
2587 collect_nodeloop(F, le.son, loopnodes);
2589 if (flags & ir_dump_flag_loops)
2590 dump_loop_node_edge(F, loop, node_number++);
2591 eset_insert(loopnodes, le.node);
2596 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2602 for (i = 0; i < get_loop_n_elements(loop); i++) {
2603 loop_element le = get_loop_element(loop, i);
2604 if (*(le.kind) == k_ir_loop) {
2606 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2608 if (is_Block(le.node)) start = 0; else start = -1;
2609 for (j = start; j < get_irn_arity(le.node); j++) {
2610 ir_node *pred = get_irn_n(le.node, j);
2611 if (!eset_contains(loopnodes, pred)) {
2612 eset_insert(extnodes, pred);
2613 if (!is_Block(pred)) {
2614 pred = get_nodes_block(pred);
2615 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2623 void dump_loop(FILE *F, ir_loop *l)
2625 eset *loopnodes = eset_create();
2626 eset *extnodes = eset_create();
2630 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2631 dump_vcg_header(F, name, NULL, NULL);
2633 /* collect all nodes to dump */
2634 collect_nodeloop(F, l, loopnodes);
2635 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2637 /* build block lists */
2638 eset_foreach(loopnodes, ir_node*, n) {
2639 set_irn_link(n, NULL);
2641 eset_foreach(extnodes, ir_node*, n) {
2642 set_irn_link(n, NULL);
2644 eset_foreach(loopnodes, ir_node*, n) {
2646 b = get_nodes_block(n);
2647 set_irn_link(n, get_irn_link(b));
2651 eset_foreach(extnodes, ir_node*, n) {
2653 b = get_nodes_block(n);
2654 set_irn_link(n, get_irn_link(b));
2659 eset_foreach(loopnodes, ir_node*, b) {
2661 fprintf(F, "graph: { title: \"");
2663 fprintf(F, "\" label: \"");
2664 dump_node_opcode(F, b);
2665 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
2666 fprintf(F, "\" status:clustered color:yellow\n");
2668 /* dump the blocks edges */
2669 dump_ir_data_edges(F, b);
2671 /* dump the nodes that go into the block */
2672 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2673 if (eset_contains(extnodes, n))
2674 overrule_nodecolor = ird_color_block_inout;
2676 overrule_nodecolor = ird_color_default_node;
2677 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2680 /* Close the vcg information for the block */
2682 dump_const_node_local(F, b);
2686 eset_foreach(extnodes, ir_node*, b) {
2688 fprintf(F, "graph: { title: \"");
2690 fprintf(F, "\" label: \"");
2691 dump_node_opcode(F, b);
2692 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
2693 fprintf(F, "\" status:clustered color:lightblue\n");
2695 /* dump the nodes that go into the block */
2696 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2697 if (!eset_contains(loopnodes, n))
2698 overrule_nodecolor = ird_color_block_inout;
2700 overrule_nodecolor = ird_color_default_node;
2701 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2704 /* Close the vcg information for the block */
2706 dump_const_node_local(F, b);
2710 eset_destroy(loopnodes);
2711 eset_destroy(extnodes);
2716 static bool obstack_init;
2717 static struct obstack obst;
2718 static char *dump_path;
2720 void ir_set_dump_path(const char *path)
2723 dump_path = xstrdup(path);
2726 static void add_string_escaped(const char *string)
2729 for (p = string; *p != '\0'; ++p) {
2732 obstack_1grow(&obst, '@');
2733 obstack_1grow(&obst, '1');
2734 } else if (c == '@') {
2735 obstack_1grow(&obst, '@');
2736 obstack_1grow(&obst, '2');
2738 obstack_1grow(&obst, c);
2743 static void add_dump_path(void)
2745 if (!obstack_init) {
2746 obstack_init(&obst);
2747 obstack_init = true;
2750 if (dump_path != NULL) {
2751 size_t len = strlen(dump_path);
2752 obstack_grow(&obst, dump_path, len);
2753 if (len > 0 && dump_path[len-1] != '/')
2754 obstack_1grow(&obst, '/');
2758 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2761 const char *dump_name = get_irg_dump_name(graph);
2765 if (!ir_should_dump(dump_name))
2770 add_string_escaped(dump_name);
2771 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2773 if (suffix != NULL) {
2774 if (suffix[0] != '.')
2775 obstack_1grow(&obst, '-');
2776 add_string_escaped(suffix);
2778 obstack_1grow(&obst, '\0');
2780 file_name = (char*)obstack_finish(&obst);
2781 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2782 out = fopen(file_name, "wb");
2783 obstack_free(&obst, file_name);
2786 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2794 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2801 obstack_printf(&obst, "%02u", irp->dump_nr++);
2802 if (suffix != NULL) {
2803 if (suffix[0] != '.')
2804 obstack_1grow(&obst, '-');
2805 add_string_escaped(suffix);
2807 obstack_1grow(&obst, '\0');
2809 file_name = (char*)obstack_finish(&obst);
2810 out = fopen(file_name, "wb");
2811 obstack_free(&obst, file_name);
2814 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2821 void dump_ir_graph(ir_graph *graph, const char *suffix)
2825 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2826 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2829 void dump_all_ir_graphs(const char *suffix)
2831 size_t i, n_irgs = get_irp_n_irgs();
2833 for (i = 0; i < n_irgs; ++i) {
2834 ir_graph *irg = get_irp_irg(i);
2835 dump_ir_graph(irg, suffix);
2839 typedef struct pass_t {
2840 ir_prog_pass_t pass;
2845 * Wrapper around dump_all_ir_graphs().
2847 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2849 pass_t *pass = (pass_t*)context;
2852 dump_all_ir_graphs(pass->suffix);
2856 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2858 size_t len = strlen(suffix) + 1;
2859 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2860 ir_prog_pass_t *res = def_prog_pass_constructor(
2861 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2863 /* this pass does not change anything, so neither dump nor verify is needed. */
2864 res->dump_irprog = ir_prog_no_dump;
2865 res->verify_irprog = ir_prog_no_verify;
2867 memcpy(pass->suffix, suffix, len);