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_align(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_align(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 }
816 /** the lookup table for Proj(Cond) names */
817 static const pns_lookup_t cond_lut[] = {
818 #define X(a) { pn_Cond_##a, #a }
824 /** the lookup table for Proj(Call) names */
825 static const pns_lookup_t call_lut[] = {
826 #define X(a) { pn_Call_##a, #a }
835 /** the lookup table for Proj(Div) names */
836 static const pns_lookup_t div_lut[] = {
837 #define X(a) { pn_Div_##a, #a }
845 /** the lookup table for Proj(Mod) names */
846 static const pns_lookup_t mod_lut[] = {
847 #define X(a) { pn_Mod_##a, #a }
855 /** the lookup table for Proj(Load) names */
856 static const pns_lookup_t load_lut[] = {
857 #define X(a) { pn_Load_##a, #a }
865 /** the lookup table for Proj(Store) names */
866 static const pns_lookup_t store_lut[] = {
867 #define X(a) { pn_Store_##a, #a }
874 /** the lookup table for Proj(Alloc) names */
875 static const pns_lookup_t alloc_lut[] = {
876 #define X(a) { pn_Alloc_##a, #a }
884 /** the lookup table for Proj(CopyB) names */
885 static const pns_lookup_t copyb_lut[] = {
886 #define X(a) { pn_CopyB_##a, #a }
893 /** the lookup table for Proj(InstOf) names */
894 static const pns_lookup_t instof_lut[] = {
895 #define X(a) { pn_InstOf_##a, #a }
903 /** the lookup table for Proj(Raise) names */
904 static const pns_lookup_t raise_lut[] = {
905 #define X(a) { pn_Raise_##a, #a }
911 /** the lookup table for Proj(Bound) names */
912 static const pns_lookup_t bound_lut[] = {
913 #define X(a) { pn_Bound_##a, #a }
921 /** the Proj lookup table */
922 static const proj_lookup_t proj_lut[] = {
923 #define E(a) ARRAY_SIZE(a), a
924 { iro_Start, E(start_lut) },
925 { iro_Cond, E(cond_lut) },
926 { iro_Call, E(call_lut) },
927 { iro_Div, E(div_lut) },
928 { iro_Mod, E(mod_lut) },
929 { iro_Load, E(load_lut) },
930 { iro_Store, E(store_lut) },
931 { iro_Alloc, E(alloc_lut) },
932 { iro_CopyB, E(copyb_lut) },
933 { iro_InstOf, E(instof_lut) },
934 { iro_Raise, E(raise_lut) },
935 { iro_Bound, E(bound_lut) }
940 * Dump additional node attributes of some nodes to a file F.
942 static void dump_node_nodeattr(FILE *F, ir_node *n)
947 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
949 /* call the dump_node operation if available */
950 if (ops->dump_node) {
951 ops->dump_node(F, n, dump_node_nodeattr_txt);
955 switch (get_irn_opcode(n)) {
957 ir_fprintf(F, "%T ", get_Const_tarval(n));
961 pred = get_Proj_pred(n);
962 proj_nr = get_Proj_proj(n);
963 code = get_irn_opcode(pred);
965 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
966 fprintf(F, "Arg %ld ", proj_nr);
967 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
968 fprintf(F, "%ld ", proj_nr);
970 unsigned i, j, f = 0;
972 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
973 if (code == proj_lut[i].code) {
974 for (j = 0; j < proj_lut[i].num_data; ++j) {
975 if (proj_nr == proj_lut[i].data[j].nr) {
976 fprintf(F, "%s ", proj_lut[i].data[j].name);
985 fprintf(F, "%ld ", proj_nr);
986 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
987 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
989 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
995 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
998 ir_fprintf(F, "(%+F)", get_Cast_type(n));
1001 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
1004 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
1007 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
1016 #include "execution_frequency.h"
1018 static void dump_node_ana_vals(FILE *F, ir_node *n)
1025 void dump_node_label(FILE *F, ir_node *n)
1027 dump_node_opcode(F, n);
1029 dump_node_mode(F, n);
1031 dump_node_typeinfo(F, n);
1032 dump_node_nodeattr(F, n);
1033 if (flags & ir_dump_flag_number_label) {
1034 fprintf(F, "%ld", get_irn_node_nr(n));
1036 if (flags & ir_dump_flag_idx_label) {
1037 fprintf(F, ":%u", get_irn_idx(n));
1041 void dump_vrp_info(FILE *F, ir_node *n)
1043 vrp_attr *vrp = vrp_get_info(n);
1048 fprintf(F, "range_type: %d\n", (int) vrp->range_type);
1049 if (vrp->range_type == VRP_RANGE || vrp->range_type ==
1051 ir_fprintf(F, "range_bottom: %F\n",vrp->range_bottom);
1052 ir_fprintf(F, "range_top: %F\n", vrp->range_top);
1054 ir_fprintf(F, "bits_set: %T\n", vrp->bits_set);
1055 ir_fprintf(F, "bits_not_set: %T\n", vrp->bits_not_set);
1059 * Dumps the attributes of a node n into the file F.
1060 * Currently this is only the color of a node.
1062 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1068 print_vcg_color(F, ird_color_error);
1072 if (dump_node_vcgattr_hook != NULL) {
1073 dump_node_vcgattr_hook(F, node, local);
1077 n = local ? local : node;
1079 if (overrule_nodecolor != ird_color_default_node) {
1080 print_vcg_color(F, overrule_nodecolor);
1084 mode = get_irn_mode(n);
1085 if (mode == mode_M) {
1086 print_vcg_color(F, ird_color_memory);
1089 if (mode == mode_X) {
1090 print_vcg_color(F, ird_color_controlflow);
1094 switch (get_irn_opcode(n)) {
1097 print_vcg_color(F, ird_color_anchor);
1100 print_vcg_color(F, ird_color_error);
1103 if (is_Block_dead(n))
1104 print_vcg_color(F, ird_color_dead_block_background);
1106 print_vcg_color(F, ird_color_block_background);
1109 print_vcg_color(F, ird_color_phi);
1112 print_vcg_color(F, ird_color_memory);
1116 print_vcg_color(F, ird_color_const);
1119 print_vcg_color(F, ird_color_proj);
1122 ir_op *op = get_irn_op(node);
1124 if (is_op_constlike(op)) {
1125 print_vcg_color(F, ird_color_const);
1126 } else if (is_op_uses_memory(op)) {
1127 print_vcg_color(F, ird_color_uses_memory);
1128 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1129 print_vcg_color(F, ird_color_controlflow);
1135 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1137 hook_entry_t *info = XMALLOC(hook_entry_t);
1139 info->hook._hook_node_info = cb;
1140 info->context = data;
1141 register_hook(hook_node_info, info);
1146 void dump_remove_node_info_callback(void *handle)
1148 hook_entry_t *info = (hook_entry_t*)handle;
1149 unregister_hook(hook_node_info, info);
1154 * Dump the node information of a node n to a file F.
1156 static void dump_node_info(FILE *F, ir_node *n)
1158 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1160 fprintf(F, " info1: \"");
1161 dump_irnode_to_file(F, n);
1162 /* call the dump_node operation if available */
1164 ops->dump_node(F, n, dump_node_info_txt);
1166 /* allow additional info to be added */
1167 hook_node_info(F, n);
1171 static int is_constlike_node(const ir_node *node)
1173 const ir_op *op = get_irn_op(node);
1174 return is_op_constlike(op);
1178 /** outputs the predecessors of n, that are constants, local. I.e.,
1179 generates a copy of the constant predecessors for each node called with. */
1180 static void dump_const_node_local(FILE *F, ir_node *n)
1183 if (!get_opt_dump_const_local()) return;
1185 /* Use visited flag to avoid outputting nodes twice.
1186 initialize it first. */
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)) {
1190 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1194 for (i = 0; i < get_irn_arity(n); i++) {
1195 ir_node *con = get_irn_n(n, i);
1196 if (is_constlike_node(con) && !irn_visited(con)) {
1197 mark_irn_visited(con);
1198 /* Generate a new name for the node by appending the names of
1200 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1201 fprintf(F, " label: \"");
1202 dump_node_label(F, con);
1204 dump_node_info(F, con);
1205 dump_node_vcgattr(F, n, con, 0);
1211 /** If the block of an edge is a const_like node, dump it local with an edge */
1212 static void dump_const_block_local(FILE *F, ir_node *n)
1216 if (!get_opt_dump_const_local()) return;
1218 blk = get_nodes_block(n);
1219 if (is_constlike_node(blk)) {
1220 /* Generate a new name for the node by appending the names of
1222 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1223 fprintf(F, "\" label: \"");
1224 dump_node_label(F, blk);
1226 dump_node_info(F, blk);
1227 dump_node_vcgattr(F, n, blk, 0);
1230 fprintf(F, "edge: { sourcename: \"");
1232 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1234 if (dump_edge_vcgattr_hook) {
1236 if (dump_edge_vcgattr_hook(F, n, -1)) {
1240 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1245 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1250 * prints the error message of a node to a file F as info2.
1252 static void print_node_error(FILE *F, const char *err_msg)
1257 fprintf(F, " info2: \"%s\"", err_msg);
1261 * prints debug messages of a node to file F as info3.
1263 static void print_dbg_info(FILE *F, dbg_info *dbg)
1267 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1269 fprintf(F, " info3: \"%s\"\n", buf);
1273 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1283 static void dump_node(FILE *F, ir_node *n)
1288 if (get_opt_dump_const_local() && is_constlike_node(n))
1291 /* dump this node */
1292 fputs("node: {title: \"", F);
1296 fputs(" label: \"", F);
1297 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1298 dump_node_label(F, n);
1299 dump_node_ana_vals(F, n);
1300 //dump_node_ana_info(F, n);
1303 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1304 //fputs(" node_class:23", F);
1307 dump_node_info(F, n);
1308 print_node_error(F, p);
1309 print_dbg_info(F, get_irn_dbg_info(n));
1310 dump_node_vcgattr(F, n, NULL, bad);
1312 dump_const_node_local(F, n);
1314 if (dump_node_edge_hook)
1315 dump_node_edge_hook(F, n);
1318 /** dump the edge to the block this node belongs to */
1319 static void dump_ir_block_edge(FILE *F, ir_node *n)
1321 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1323 ir_node *block = get_nodes_block(n);
1325 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1326 dump_const_block_local(F, n);
1328 fprintf(F, "edge: { sourcename: \"");
1330 fprintf(F, "\" targetname: ");
1331 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1333 if (dump_edge_vcgattr_hook) {
1335 if (dump_edge_vcgattr_hook(F, n, -1)) {
1339 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1344 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1349 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1352 * do not use get_nodes_block() here, will fail
1353 * if the irg is not pinned.
1355 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1356 fprintf(F, INTRA_DATA_EDGE_ATTR);
1358 fprintf(F, INTER_DATA_EDGE_ATTR);
1361 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1364 * do not use get_nodes_block() here, will fail
1365 * if the irg is not pinned.
1367 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1368 fprintf(F, INTRA_MEM_EDGE_ATTR);
1370 fprintf(F, INTER_MEM_EDGE_ATTR);
1373 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1374 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1378 if (dump_edge_vcgattr_hook)
1379 if (dump_edge_vcgattr_hook(F, from, to))
1382 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1383 fprintf(F, BACK_EDGE_ATTR);
1385 switch (get_irn_opcode(from)) {
1387 fprintf(F, CF_EDGE_ATTR);
1389 case iro_Start: break;
1392 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1393 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1395 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1399 if (is_Proj(from)) {
1400 if (get_irn_mode(from) == mode_M)
1401 print_mem_edge_vcgattr(F, from, to);
1402 else if (get_irn_mode(from) == mode_X)
1403 fprintf(F, CF_EDGE_ATTR);
1405 print_data_edge_vcgattr(F, from, to);
1407 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1408 print_mem_edge_vcgattr(F, from, to);
1409 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1410 fprintf(F, CF_EDGE_ATTR);
1412 print_data_edge_vcgattr(F, from, to);
1416 /** dump edges to our inputs */
1417 static void dump_ir_data_edges(FILE *F, ir_node *n)
1421 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1422 /* the End node has only keep-alive edges */
1426 /* dump the dependency edges. */
1427 num = get_irn_deps(n);
1428 for (i = 0; i < num; ++i) {
1429 ir_node *dep = get_irn_dep(n, i);
1432 print_node_edge_kind(F, n);
1433 fprintf(F, "{sourcename: \"");
1435 fprintf(F, "\" targetname: ");
1436 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1437 PRINT_CONSTID(n, dep);
1443 fprintf(F, " label: \"%d\" ", i);
1444 fprintf(F, " color: darkgreen}\n");
1448 num = get_irn_arity(n);
1449 for (i = 0; i < num; i++) {
1450 ir_node *pred = get_irn_n(n, i);
1453 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1454 fprintf(F, "backedge: {sourcename: \"");
1456 print_node_edge_kind(F, n);
1457 fprintf(F, "{sourcename: \"");
1460 fprintf(F, "\" targetname: ");
1461 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1462 PRINT_CONSTID(n, pred);
1464 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1466 fprintf(F, " label: \"%d\" ", i);
1467 print_edge_vcgattr(F, n, i);
1475 static void dump_ir_edges(ir_node *node, void *env)
1478 FILE *F = (FILE*)env;
1479 const ir_edge_t *edge;
1481 foreach_out_edge(node, edge) {
1482 ir_node *succ = get_edge_src_irn(edge);
1484 print_node_edge_kind(F, succ);
1485 fprintf(F, "{sourcename: \"");
1487 fprintf(F, "\" targetname: \"");
1491 fprintf(F, " label: \"%d\" ", i);
1492 fprintf(F, OUT_EDGE_ATTR);
1499 /** Dumps a node and its edges but not the block edge */
1500 static void dump_node_wo_blockedge(ir_node *n, void *env)
1502 FILE *F = (FILE*)env;
1504 dump_ir_data_edges(F, n);
1507 /** Dumps a node and its edges. */
1508 static void dump_node_with_edges(ir_node *n, void *env)
1510 FILE *F = (FILE*)env;
1511 dump_node_wo_blockedge(n, env);
1512 if (!node_floats(n))
1513 dump_ir_block_edge(F, n);
1516 /** Dumps a const-like node. */
1517 static void dump_const_node(ir_node *n, void *env)
1519 if (is_Block(n)) return;
1520 dump_node_wo_blockedge(n, env);
1523 /***********************************************************************/
1524 /* the following routines dump the nodes/irgs bracketed to graphs. */
1525 /***********************************************************************/
1527 /** Dumps a constant expression as entity initializer, array bound ... */
1528 static void dump_const_expression(FILE *F, ir_node *value)
1530 ir_graph *rem = current_ir_graph;
1531 ir_dump_flags_t old_flags = ir_get_dump_flags();
1532 ir_remove_dump_flags(ir_dump_flag_consts_local);
1534 current_ir_graph = get_const_code_irg();
1535 irg_walk(value, dump_const_node, NULL, F);
1536 /* Decrease visited flag so that we walk with the same flag for the next
1537 expression. This guarantees that we don't dump the same node twice,
1538 as for const expressions cse is performed to save memory. */
1539 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1541 ir_set_dump_flags(old_flags);
1542 current_ir_graph = rem;
1545 /** Dump a block as graph containing its nodes.
1547 * Expects to find nodes belonging to the block as list in its
1549 * Dumps the edges of all nodes including itself. */
1550 static void dump_whole_block(FILE *F, ir_node *block)
1553 ird_color_t color = ird_color_block_background;
1555 assert(is_Block(block));
1557 fprintf(F, "graph: { title: \"");
1558 PRINT_NODEID(block);
1559 fprintf(F, "\" label: \"");
1560 dump_node_label(F, block);
1562 /* colorize blocks */
1563 if (! get_Block_matured(block))
1564 color = ird_color_block_background;
1565 if (is_Block_dead(block))
1566 color = ird_color_dead_block_background;
1568 fprintf(F, "\" status:clustered ");
1569 print_vcg_color(F, color);
1572 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1573 dump_node_info(F, block);
1574 print_dbg_info(F, get_irn_dbg_info(block));
1576 /* dump the blocks edges */
1577 dump_ir_data_edges(F, block);
1579 if (dump_block_edge_hook)
1580 dump_block_edge_hook(F, block);
1582 /* dump the nodes that go into the block */
1583 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1585 dump_ir_data_edges(F, node);
1588 /* Close the vcg information for the block */
1590 dump_const_node_local(F, block);
1594 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1595 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1596 static void dump_block_graph(FILE *F, ir_graph *irg)
1599 ir_graph *rem = current_ir_graph;
1600 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1601 current_ir_graph = irg;
1603 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1604 ir_node *node = arr[i];
1605 if (is_Block(node)) {
1606 /* Dumps the block and all the nodes in the block, which are to
1607 be found in Block->link. */
1608 dump_whole_block(F, node);
1610 /* Nodes that are not in a Block. */
1612 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1613 dump_const_block_local(F, node);
1615 dump_ir_data_edges(F, node);
1617 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1618 dump_ir_edges(node, F);
1621 if ((flags & ir_dump_flag_loops) && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1622 dump_loop_nodes_into_graph(F, irg);
1624 current_ir_graph = rem;
1628 * Dump the info for an irg.
1629 * Parsed by XVCG but not shown. use yComp.
1631 static void dump_graph_info(FILE *F, ir_graph *irg)
1633 fprintf(F, "info1: \"");
1634 dump_entity_to_file(F, get_irg_entity(irg));
1638 /** Dumps an irg as a graph clustered by block nodes.
1639 * If interprocedural view edges can point to nodes out of this graph.
1641 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1643 ir_entity *ent = get_irg_entity(irg);
1645 fprintf(F, "graph: { title: \"");
1647 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1648 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1650 dump_graph_info(F, irg);
1651 print_dbg_info(F, get_entity_dbg_info(ent));
1653 dump_block_graph(F, irg);
1655 /* Close the vcg information for the irg */
1656 fprintf(F, "}\n\n");
1659 /*******************************************************************/
1660 /* Basic type and entity nodes and edges. */
1661 /*******************************************************************/
1663 /** dumps the edges between nodes and their type or entity attributes. */
1664 static void dump_node2type_edges(ir_node *n, void *env)
1666 FILE *F = (FILE*)env;
1669 switch (get_irn_opcode(n)) {
1671 /* @@@ some consts have an entity */
1674 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1675 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1678 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1681 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1684 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1687 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1690 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1698 static int print_type_info(FILE *F, ir_type *tp)
1702 if (get_type_state(tp) == layout_undefined) {
1703 fprintf(F, "state: layout_undefined\n");
1705 fprintf(F, "state: layout_fixed,\n");
1707 if (get_type_mode(tp))
1708 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1709 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1714 static void print_typespecific_info(FILE *F, ir_type *tp)
1716 switch (get_type_tpop_code(tp)) {
1718 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1723 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1724 fprintf(F, "params: %d\n", get_method_n_params(tp));
1725 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1731 case tpo_enumeration:
1743 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1745 switch (get_type_tpop_code(tp)) {
1747 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1750 fprintf(F, " " TYPE_METH_NODE_ATTR);
1758 case tpo_enumeration:
1769 void dump_type_node(FILE *F, ir_type *tp)
1771 fprintf(F, "node: {title: ");
1773 fprintf(F, " label: \"%s ", get_type_tpop_name(tp));
1774 if (tp->dbi != NULL) {
1776 ir_print_type(buf, sizeof(buf), tp);
1777 fprintf(F, "'%s'", buf);
1779 ir_fprintf(F, "%+F", tp);
1781 fputs("\" info1: \"", F);
1782 dump_type_to_file(F, tp);
1784 print_type_dbg_info(F, get_type_dbg_info(tp));
1785 print_typespecific_vcgattr(F, tp);
1789 static void dump_entity_node(FILE *F, ir_entity *ent)
1791 fprintf(F, "node: {title: \"");
1792 PRINT_ENTID(ent); fprintf(F, "\"");
1793 fprintf(F, " label: ");
1794 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1796 print_vcg_color(F, ird_color_entity);
1797 fprintf(F, "\n info1: \"");
1799 dump_entity_to_file(F, ent);
1802 print_dbg_info(F, get_entity_dbg_info(ent));
1806 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1809 ir_enum_const *ec = get_enumeration_const(tp, pos);
1810 ident *id = get_enumeration_const_nameid(ec);
1811 ir_tarval *tv = get_enumeration_value(ec);
1814 tarval_snprintf(buf, sizeof(buf), tv);
1816 strncpy(buf, "<not set>", sizeof(buf));
1817 fprintf(F, "node: {title: \"");
1818 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1819 fprintf(F, " label: ");
1820 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1821 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1825 * Dumps a new style initializer.
1827 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1834 /** Dumps a type or entity and its edges. */
1835 static void dump_type_info(type_or_ent tore, void *env)
1837 FILE *F = (FILE*)env;
1838 size_t i = 0; /* to shutup gcc */
1840 /* dump this type or entity */
1842 switch (get_kind(tore.ent)) {
1844 ir_entity *ent = tore.ent;
1847 dump_entity_node(F, ent);
1849 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1850 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1851 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1852 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1853 if (is_Class_type(get_entity_owner(ent))) {
1854 for (i = get_entity_n_overwrites(ent); i > 0;)
1855 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1857 /* attached subgraphs */
1858 if (! (flags & ir_dump_flag_no_entity_values)) {
1859 if (ent->initializer != NULL) {
1860 /* new style initializers */
1861 dump_entity_initializer(F, ent);
1862 } else if (entity_has_compound_ent_values(ent)) {
1863 /* old style compound entity values */
1864 for (i = get_compound_ent_n_values(ent); i > 0;) {
1865 value = get_compound_ent_value(ent, --i);
1867 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1868 dump_const_expression(F, value);
1869 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1871 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1872 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1873 get_compound_ent_value_member(ent, i), i);
1882 ir_type *tp = tore.typ;
1883 dump_type_node(F, tp);
1884 /* and now the edges */
1885 switch (get_type_tpop_code(tp)) {
1887 for (i = get_class_n_supertypes(tp); i > 0;) {
1889 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1891 for (i = get_class_n_members(tp); i > 0;) {
1893 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1897 for (i = get_struct_n_members(tp); i > 0;) {
1899 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1903 for (i = get_method_n_params(tp); i > 0;) {
1905 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1907 for (i = get_method_n_ress(tp); i > 0;) {
1909 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1913 for (i = get_union_n_members(tp); i > 0;) {
1915 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1919 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1920 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1921 for (i = get_array_n_dimensions(tp); i > 0;) {
1922 ir_node *upper, *lower;
1925 upper = get_array_upper_bound(tp, i);
1926 lower = get_array_lower_bound(tp, i);
1927 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1928 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1929 dump_const_expression(F, upper);
1930 dump_const_expression(F, lower);
1933 case tpo_enumeration:
1934 for (i = get_enumeration_n_enums(tp); i > 0;) {
1936 dump_enum_item(F, tp, i);
1937 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1941 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1948 break; /* case k_type */
1951 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1952 } /* switch kind_or_entity */
1955 /** For dumping class hierarchies.
1956 * Dumps a class type node and a superclass edge.
1958 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1960 FILE *F = (FILE*)ctx;
1961 size_t i = 0; /* to shutup gcc */
1963 /* dump this type or entity */
1964 switch (get_kind(tore.ent)) {
1966 ir_entity *ent = tore.ent;
1967 if (get_entity_owner(ent) == get_glob_type()) break;
1968 if (!is_Method_type(get_entity_type(ent)))
1970 if (flags & ir_dump_flag_entities_in_hierarchy
1971 && is_Class_type(get_entity_owner(ent))) {
1973 dump_entity_node(F, ent);
1975 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1976 for (i = get_entity_n_overwrites(ent); i > 0;) {
1978 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1984 ir_type *tp = tore.typ;
1985 if (tp == get_glob_type())
1987 switch (get_type_tpop_code(tp)) {
1989 dump_type_node(F, tp);
1990 /* and now the edges */
1991 for (i = get_class_n_supertypes(tp); i > 0;) {
1993 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1998 break; /* case k_type */
2001 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2002 } /* switch kind_or_entity */
2005 /*******************************************************************/
2006 /* dump analysis information that is expressed in graph terms. */
2007 /*******************************************************************/
2009 /* dump out edges */
2010 static void dump_out_edge(ir_node *n, void *env)
2012 FILE *F = (FILE*)env;
2014 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2015 ir_node *succ = get_irn_out(n, i);
2017 print_node_edge_kind(F, succ);
2018 fprintf(F, "{sourcename: \"");
2020 fprintf(F, "\" targetname: \"");
2022 fprintf(F, "\" color: red linestyle: dashed");
2027 static void dump_loop_label(FILE *F, ir_loop *loop)
2029 fprintf(F, "loop %u, %lu sons, %lu nodes",
2030 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2031 (unsigned long) get_loop_n_nodes(loop));
2034 static void dump_loop_info(FILE *F, ir_loop *loop)
2036 fprintf(F, " info1: \"");
2037 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2038 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2039 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2044 static void dump_loop_node(FILE *F, ir_loop *loop)
2046 fprintf(F, "node: {title: \"");
2048 fprintf(F, "\" label: \"");
2049 dump_loop_label(F, loop);
2051 dump_loop_info(F, loop);
2055 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2058 fprintf(F, "edge: {sourcename: \"");
2060 fprintf(F, "\" targetname: \"");
2061 PRINT_NODEID(get_loop_node(loop, i));
2062 fprintf(F, "\" color: green");
2066 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2069 fprintf(F, "edge: {sourcename: \"");
2071 fprintf(F, "\" targetname: \"");
2072 PRINT_LOOPID(get_loop_son(loop, i));
2073 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2074 get_loop_element_pos(loop, get_loop_son(loop, i)));
2077 static void dump_loops(FILE *F, ir_loop *loop)
2080 /* dump this loop node */
2081 dump_loop_node(F, loop);
2083 /* dump edges to nodes in loop -- only if it is a real loop */
2084 if (get_loop_depth(loop) != 0) {
2085 for (i = get_loop_n_nodes(loop); i > 0;) {
2087 dump_loop_node_edge(F, loop, i);
2090 for (i = get_loop_n_sons(loop); i > 0;) {
2092 dump_loops(F, get_loop_son(loop, i));
2093 dump_loop_son_edge(F, loop, i);
2097 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2099 ir_loop *loop = get_irg_loop(irg);
2102 ir_graph *rem = current_ir_graph;
2103 current_ir_graph = irg;
2105 dump_loops(F, loop);
2107 current_ir_graph = rem;
2113 * dumps the VCG header
2115 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2119 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2123 if (! layout) layout = "Compilergraph";
2124 if (!orientation) orientation = "bottom_to_top";
2128 "graph: { title: \"ir graph of %s\"\n"
2129 "display_edge_labels: %s\n"
2130 "layoutalgorithm: mindepth //$ \"%s\"\n"
2131 "manhattan_edges: yes\n"
2132 "port_sharing: no\n"
2134 "classname 1: \"intrablock Data\"\n"
2135 "classname 2: \"Block\"\n"
2136 "classname 3: \"Entity type\"\n"
2137 "classname 4: \"Entity owner\"\n"
2138 "classname 5: \"Method Param\"\n"
2139 "classname 6: \"Method Res\"\n"
2140 "classname 7: \"Super\"\n"
2141 "classname 8: \"Union\"\n"
2142 "classname 9: \"Points-to\"\n"
2143 "classname 10: \"Array Element Type\"\n"
2144 "classname 11: \"Overwrites\"\n"
2145 "classname 12: \"Member\"\n"
2146 "classname 13: \"Control Flow\"\n"
2147 "classname 14: \"intrablock Memory\"\n"
2148 "classname 15: \"Dominators\"\n"
2149 "classname 16: \"interblock Data\"\n"
2150 "classname 17: \"interblock Memory\"\n"
2151 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2152 "classname 19: \"Postdominators\"\n"
2153 "classname 20: \"Keep Alive\"\n"
2154 "classname 21: \"Out Edges\"\n"
2155 "classname 22: \"Macro Block Edges\"\n"
2156 //"classname 23: \"NoInput Nodes\"\n"
2157 "infoname 1: \"Attribute\"\n"
2158 "infoname 2: \"Verification errors\"\n"
2159 "infoname 3: \"Debug info\"\n",
2160 name, label, layout, orientation);
2162 for (i = 0; i < ird_color_count; ++i) {
2163 if (color_rgb[i] != NULL) {
2164 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2171 * Dumps the vcg file footer
2173 void dump_vcg_footer(FILE *F)
2180 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2184 construct_block_lists(irg);
2187 * If we are in the interprocedural view, we dump not
2188 * only the requested irg but also all irgs that can be reached
2191 for (i = get_irp_n_irgs(); i > 0;) {
2192 ir_graph *irg = get_irp_irg(--i);
2193 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
2197 dump_graph_from_list(out, irg);
2202 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2203 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2204 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2207 ir_graph *rem = current_ir_graph;
2208 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2209 current_ir_graph = irg;
2211 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2212 ir_extblk *extbb = arr[i];
2213 ir_node *leader = get_extbb_leader(extbb);
2216 fprintf(F, "graph: { title: \"");
2217 PRINT_EXTBBID(leader);
2218 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2219 get_irn_node_nr(leader));
2221 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2222 ir_node *node = extbb->blks[j];
2223 if (is_Block(node)) {
2224 /* Dumps the block and all the nodes in the block, which are to
2225 be found in Block->link. */
2226 dump_whole_block(F, node);
2228 /* Nodes that are not in a Block. */
2230 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2231 dump_const_block_local(F, node);
2233 dump_ir_data_edges(F, node);
2239 if ((flags & ir_dump_flag_loops)
2240 && (get_irg_loopinfo_state(irg) & loopinfo_valid))
2241 dump_loop_nodes_into_graph(F, irg);
2243 current_ir_graph = rem;
2247 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2250 ir_entity *ent = get_irg_entity(irg);
2252 if (get_irg_extblk_state(irg) != ir_extblk_info_valid)
2255 construct_extblock_lists(irg);
2257 fprintf(F, "graph: { title: \"");
2259 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2260 get_ent_dump_name(ent));
2262 dump_graph_info(F, irg);
2263 print_dbg_info(F, get_entity_dbg_info(ent));
2265 for (i = get_irp_n_irgs(); i > 0;) {
2266 ir_graph *irg = get_irp_irg(--i);
2267 list_tuple *lists = (list_tuple*)ird_get_irg_link(irg);
2270 /* dump the extended blocks first */
2271 if (ARR_LEN(lists->extbb_list)) {
2272 ird_set_irg_link(irg, lists->extbb_list);
2273 dump_extblock_graph(F, irg);
2276 /* we may have blocks without extended blocks, bad for instance */
2277 if (ARR_LEN(lists->blk_list)) {
2278 ird_set_irg_link(irg, lists->blk_list);
2279 dump_block_graph(F, irg);
2282 DEL_ARR_F(lists->extbb_list);
2283 DEL_ARR_F(lists->blk_list);
2288 /* Close the vcg information for the irg */
2289 fprintf(F, "}\n\n");
2294 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2296 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2299 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2300 if (flags & ir_dump_flag_group_extbb) {
2301 dump_blocks_extbb_grouped(out, irg);
2303 dump_blocks_as_subgraphs(out, irg);
2306 /* dump_node_with_edges must be called in post visiting predecessors */
2307 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2310 /* dump type info */
2311 if (flags & ir_dump_flag_with_typegraph) {
2312 ir_graph *rem = current_ir_graph;
2313 current_ir_graph = irg;
2315 type_walk_irg(irg, dump_type_info, NULL, out);
2316 inc_irg_visited(get_const_code_irg());
2317 /* dump edges from graph to type info */
2318 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2320 current_ir_graph = rem;
2323 /* dump iredges out edges */
2324 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2325 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2328 /* dump the out edges in a separate walk */
2329 if ((flags & ir_dump_flag_out_edges)
2330 && (get_irg_outs_state(irg) != outs_none)) {
2331 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2334 dump_vcg_footer(out);
2337 static void dump_block_to_cfg(ir_node *block, void *env)
2339 FILE *F = (FILE*)env;
2343 if (is_Block(block)) {
2344 /* This is a block. Dump a node for the block. */
2345 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2346 fprintf(F, "\" label: \"");
2347 if (block == get_irg_start_block(get_irn_irg(block)))
2348 fprintf(F, "Start ");
2349 if (block == get_irg_end_block(get_irn_irg(block)))
2352 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2353 PRINT_NODEID(block);
2355 fprintf(F, "info1:\"");
2357 /* the generic version. */
2358 dump_irnode_to_file(F, block);
2360 /* Check whether we have bad predecessors to color the block. */
2361 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2362 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2365 fprintf(F, "\""); /* closing quote of info */
2367 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2368 (block == get_irg_end_block(get_irn_irg(block))) )
2369 fprintf(F, " color:blue ");
2371 fprintf(F, " color:yellow ");
2374 /* Dump the edges */
2375 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2376 if (!is_Bad(skip_Proj(get_Block_cfgpred(block, i)))) {
2377 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2378 fprintf(F, "edge: { sourcename: \"");
2379 PRINT_NODEID(block);
2380 fprintf(F, "\" targetname: \"");
2382 fprintf(F, "\"}\n");
2385 /* Dump dominator/postdominator edge */
2386 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2387 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2388 pred = get_Block_idom(block);
2389 fprintf(F, "edge: { sourcename: \"");
2390 PRINT_NODEID(block);
2391 fprintf(F, "\" targetname: \"");
2393 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2395 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2396 pred = get_Block_ipostdom(block);
2397 fprintf(F, "edge: { sourcename: \"");
2398 PRINT_NODEID(block);
2399 fprintf(F, "\" targetname: \"");
2401 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2407 void dump_cfg(FILE *F, ir_graph *irg)
2409 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2411 /* walk over the blocks in the graph */
2412 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, F);
2413 dump_node(F, get_irg_bad(irg));
2418 void dump_callgraph(FILE *F)
2421 ir_dump_flags_t old_flags = ir_get_dump_flags();
2423 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2424 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2426 for (i = get_irp_n_irgs(); i > 0;) {
2427 ir_graph *irg = get_irp_irg(--i);
2428 ir_entity *ent = get_irg_entity(irg);
2429 size_t j, n_callees = get_irg_n_callees(irg);
2431 dump_entity_node(F, ent);
2432 for (j = 0; j < n_callees; ++j) {
2433 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2434 int be = is_irg_callee_backedge(irg, j);
2435 const char *attr = be
2436 ? "label:\"recursion %zu\""
2437 : "label:\"calls %zu\"";
2438 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2439 get_irg_callee_loop_depth(irg, j));
2443 ir_set_dump_flags(old_flags);
2447 void dump_typegraph(FILE *out)
2449 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2450 type_walk(dump_type_info, NULL, out);
2451 dump_vcg_footer(out);
2454 void dump_class_hierarchy(FILE *out)
2456 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2457 type_walk(dump_class_hierarchy_node, NULL, out);
2458 dump_vcg_footer(out);
2461 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2464 bool loop_node_started = false;
2466 size_t son_number = 0;
2468 ir_loop *son = NULL;
2470 /* Dump a new loop node. */
2471 dump_loop_node(F, loop);
2473 /* Dump the loop elements. */
2474 for (i = 0; i < get_loop_n_elements(loop); i++) {
2475 le = get_loop_element(loop, i);
2477 if (get_kind(son) == k_ir_loop) {
2479 /* We are a loop son -> Recurse */
2481 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2482 fprintf(F, "\" }\n");
2483 fprintf(F, "edge: {sourcename: \"");
2485 fprintf(F, "\" targetname: \"");
2487 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2488 (unsigned long) first,
2489 (unsigned long) first,
2490 (unsigned long) i-1);
2491 loop_node_started = false;
2493 dump_loop_son_edge(F, loop, son_number++);
2494 dump_loops_standalone(F, son);
2495 } else if (get_kind(son) == k_ir_node) {
2496 /* We are a loop node -> Collect firm nodes */
2498 ir_node *n = le.node;
2499 if (!loop_node_started) {
2500 /* Start a new node which contains all firm nodes of the current loop */
2501 fprintf(F, "node: { title: \"");
2503 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2505 loop_node_started = true;
2510 dump_node_label(F, n);
2511 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2512 if (has_backedges(n)) fprintf(F, "\t loop head!");
2513 } else { /* for callgraph loop tree */
2515 assert(get_kind(son) == k_ir_graph);
2517 /* We are a loop node -> Collect firm graphs */
2519 if (!loop_node_started) {
2520 /* Start a new node which contains all firm nodes of the current loop */
2521 fprintf(F, "node: { title: \"");
2523 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2525 loop_node_started = true;
2529 fprintf(F, " %s", get_irg_dump_name(n));
2530 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2534 if (loop_node_started) {
2535 fprintf(F, "\" }\n");
2536 fprintf(F, "edge: {sourcename: \"");
2538 fprintf(F, "\" targetname: \"");
2540 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2541 (unsigned long) first,
2542 (unsigned long) first,
2543 (unsigned long) i-1);
2544 loop_node_started = false;
2548 void dump_loop_tree(FILE *out, ir_graph *irg)
2550 ir_graph *rem = current_ir_graph;
2551 ir_dump_flags_t old_flags = ir_get_dump_flags();
2553 current_ir_graph = irg;
2554 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2556 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2558 if (get_irg_loop(irg))
2559 dump_loops_standalone(out, get_irg_loop(irg));
2561 dump_vcg_footer(out);
2563 ir_set_dump_flags(old_flags);
2564 current_ir_graph = rem;
2567 void dump_callgraph_loop_tree(FILE *out)
2569 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2570 dump_loops_standalone(out, irp->outermost_cg_loop);
2571 dump_vcg_footer(out);
2574 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2578 int node_number = 0;
2580 if (flags & ir_dump_flag_loops)
2581 dump_loop_node(F, loop);
2583 for (i = 0; i < get_loop_n_elements(loop); i++) {
2584 loop_element le = get_loop_element(loop, i);
2585 if (*(le.kind) == k_ir_loop) {
2586 if (flags & ir_dump_flag_loops)
2587 dump_loop_son_edge(F, loop, son_number++);
2589 collect_nodeloop(F, le.son, loopnodes);
2591 if (flags & ir_dump_flag_loops)
2592 dump_loop_node_edge(F, loop, node_number++);
2593 eset_insert(loopnodes, le.node);
2598 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2604 for (i = 0; i < get_loop_n_elements(loop); i++) {
2605 loop_element le = get_loop_element(loop, i);
2606 if (*(le.kind) == k_ir_loop) {
2608 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2610 if (is_Block(le.node)) start = 0; else start = -1;
2611 for (j = start; j < get_irn_arity(le.node); j++) {
2612 ir_node *pred = get_irn_n(le.node, j);
2613 if (!eset_contains(loopnodes, pred)) {
2614 eset_insert(extnodes, pred);
2615 if (!is_Block(pred)) {
2616 pred = get_nodes_block(pred);
2617 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2625 void dump_loop(FILE *F, ir_loop *l)
2627 eset *loopnodes = eset_create();
2628 eset *extnodes = eset_create();
2632 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2633 dump_vcg_header(F, name, NULL, NULL);
2635 /* collect all nodes to dump */
2636 collect_nodeloop(F, l, loopnodes);
2637 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2639 /* build block lists */
2640 eset_foreach(loopnodes, ir_node*, n) {
2641 set_irn_link(n, NULL);
2643 eset_foreach(extnodes, ir_node*, n) {
2644 set_irn_link(n, NULL);
2646 eset_foreach(loopnodes, ir_node*, n) {
2648 b = get_nodes_block(n);
2649 set_irn_link(n, get_irn_link(b));
2653 eset_foreach(extnodes, ir_node*, n) {
2655 b = get_nodes_block(n);
2656 set_irn_link(n, get_irn_link(b));
2661 eset_foreach(loopnodes, ir_node*, b) {
2663 fprintf(F, "graph: { title: \"");
2665 fprintf(F, "\" label: \"");
2666 dump_node_opcode(F, b);
2667 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
2668 fprintf(F, "\" status:clustered color:yellow\n");
2670 /* dump the blocks edges */
2671 dump_ir_data_edges(F, b);
2673 /* dump the nodes that go into the block */
2674 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2675 if (eset_contains(extnodes, n))
2676 overrule_nodecolor = ird_color_block_inout;
2678 overrule_nodecolor = ird_color_default_node;
2679 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2682 /* Close the vcg information for the block */
2684 dump_const_node_local(F, b);
2688 eset_foreach(extnodes, ir_node*, b) {
2690 fprintf(F, "graph: { title: \"");
2692 fprintf(F, "\" label: \"");
2693 dump_node_opcode(F, b);
2694 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
2695 fprintf(F, "\" status:clustered color:lightblue\n");
2697 /* dump the nodes that go into the block */
2698 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2699 if (!eset_contains(loopnodes, n))
2700 overrule_nodecolor = ird_color_block_inout;
2702 overrule_nodecolor = ird_color_default_node;
2703 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2706 /* Close the vcg information for the block */
2708 dump_const_node_local(F, b);
2712 eset_destroy(loopnodes);
2713 eset_destroy(extnodes);
2718 static bool obstack_init;
2719 static struct obstack obst;
2720 static char *dump_path;
2722 void ir_set_dump_path(const char *path)
2725 dump_path = xstrdup(path);
2728 static void add_string_escaped(const char *string)
2731 for (p = string; *p != '\0'; ++p) {
2734 obstack_1grow(&obst, '@');
2735 obstack_1grow(&obst, '1');
2736 } else if (c == '@') {
2737 obstack_1grow(&obst, '@');
2738 obstack_1grow(&obst, '2');
2740 obstack_1grow(&obst, c);
2745 static void add_dump_path(void)
2747 if (!obstack_init) {
2748 obstack_init(&obst);
2749 obstack_init = true;
2752 if (dump_path != NULL) {
2753 size_t len = strlen(dump_path);
2754 obstack_grow(&obst, dump_path, len);
2755 if (len > 0 && dump_path[len-1] != '/')
2756 obstack_1grow(&obst, '/');
2760 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2763 const char *dump_name = get_irg_dump_name(graph);
2767 if (!ir_should_dump(dump_name))
2772 add_string_escaped(dump_name);
2773 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2775 if (suffix != NULL) {
2776 if (suffix[0] != '.')
2777 obstack_1grow(&obst, '-');
2778 add_string_escaped(suffix);
2780 obstack_1grow(&obst, '\0');
2782 file_name = (char*)obstack_finish(&obst);
2783 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2784 out = fopen(file_name, "wb");
2785 obstack_free(&obst, file_name);
2788 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2796 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2803 obstack_printf(&obst, "%02u", irp->dump_nr++);
2804 if (suffix != NULL) {
2805 if (suffix[0] != '.')
2806 obstack_1grow(&obst, '-');
2807 add_string_escaped(suffix);
2809 obstack_1grow(&obst, '\0');
2811 file_name = (char*)obstack_finish(&obst);
2812 out = fopen(file_name, "wb");
2813 obstack_free(&obst, file_name);
2816 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2823 void dump_ir_graph(ir_graph *graph, const char *suffix)
2827 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2828 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2831 void dump_all_ir_graphs(const char *suffix)
2833 size_t i, n_irgs = get_irp_n_irgs();
2835 for (i = 0; i < n_irgs; ++i) {
2836 ir_graph *irg = get_irp_irg(i);
2837 dump_ir_graph(irg, suffix);
2841 typedef struct pass_t {
2842 ir_prog_pass_t pass;
2847 * Wrapper around dump_all_ir_graphs().
2849 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2851 pass_t *pass = (pass_t*)context;
2854 dump_all_ir_graphs(pass->suffix);
2858 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2860 size_t len = strlen(suffix) + 1;
2861 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2862 ir_prog_pass_t *res = def_prog_pass_constructor(
2863 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2865 /* this pass does not change anything, so neither dump nor verify is needed. */
2866 res->dump_irprog = ir_prog_no_dump;
2867 res->verify_irprog = ir_prog_no_verify;
2869 memcpy(pass->suffix, suffix, len);