2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt,
38 #include "irgraph_t.h"
52 #include "callgraph.h"
53 #include "irextbb_t.h"
55 #include "dbginfo_t.h"
69 /** Dump only irgs with names that start with this prefix. */
70 static ident *dump_file_filter_id = NULL;
72 static ir_dump_flags_t flags =
73 ir_dump_flag_blocks_as_subgraphs |
74 ir_dump_flag_keepalive_edges |
75 ir_dump_flag_ld_names |
76 ir_dump_flag_back_edges |
77 ir_dump_flag_consts_local |
78 ir_dump_flag_analysed_types |
79 ir_dump_flag_entities_in_hierarchy |
80 ir_dump_flag_number_label;
82 static ird_color_t overrule_nodecolor = ird_color_default_node;
84 /** The vcg node attribute hook. */
85 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
86 /** The vcg edge attribute hook. */
87 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
88 /** The vcg dump block edge hook */
89 static dump_node_edge_func dump_block_edge_hook = NULL;
90 /** The vcg dump node edge hook. */
91 static dump_node_edge_func dump_node_edge_hook = NULL;
93 void set_dump_node_edge_hook(dump_node_edge_func func)
95 dump_node_edge_hook = func;
98 dump_node_edge_func get_dump_node_edge_hook(void)
100 return dump_node_edge_hook;
103 void set_dump_block_edge_hook(dump_node_edge_func func)
105 dump_block_edge_hook = func;
108 dump_node_edge_func get_dump_block_edge_hook(void)
110 return dump_node_edge_hook;
113 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
115 dump_node_vcgattr_hook = hook;
118 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
120 dump_edge_vcgattr_hook = hook;
123 void ir_set_dump_flags(ir_dump_flags_t new_flags)
128 void ir_add_dump_flags(ir_dump_flags_t new_flags)
133 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
138 ir_dump_flags_t ir_get_dump_flags(void)
143 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
144 * are set, else returns dump_const_local_flag.
146 static bool get_opt_dump_const_local(void)
148 return (flags & ir_dump_flag_out_edges)
149 || (flags & ir_dump_flag_loops)
150 || (flags & ir_dump_flag_consts_local)
151 || (flags & ir_dump_flag_iredges);
154 static char *dump_filter;
156 void ir_set_dump_filter(const char *new_filter)
159 dump_filter = xstrdup(new_filter);
162 const char *ir_get_dump_filter(void)
167 int ir_should_dump(const char *name)
171 if (dump_filter == NULL || dump_filter[0] == '\0')
174 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
182 /* -------------- some extended helper functions ----------------- */
184 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
187 return get_mode_name(mode);
193 #define CUSTOM_COLOR_BASE 100
194 static const char *color_names[ird_color_count];
195 static const char *color_rgb[ird_color_count];
196 static struct obstack color_obst;
198 /** define a custom color. */
199 static void custom_color(int num, const char *rgb_def)
201 assert(num < ird_color_count);
202 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
203 obstack_1grow(&color_obst, '\0');
205 color_rgb[num] = rgb_def;
206 color_names[num] = (const char*)obstack_finish(&color_obst);
209 /** Define a named color. */
210 static void named_color(int num, const char *name)
212 assert(num < ird_color_count);
213 color_rgb[num] = NULL;
214 color_names[num] = name;
217 /** Initializes the used colors. */
218 static void init_colors(void)
220 static int initialized = 0;
224 obstack_init(&color_obst);
226 custom_color(ird_color_prog_background, "204 204 204");
227 custom_color(ird_color_block_background, "255 255 0");
228 custom_color(ird_color_dead_block_background, "190 150 150");
229 named_color(ird_color_block_inout, "lightblue");
230 named_color(ird_color_default_node, "white");
231 custom_color(ird_color_memory, "153 153 255");
232 custom_color(ird_color_controlflow, "255 153 153");
233 custom_color(ird_color_const, "204 255 255");
234 custom_color(ird_color_proj, "255 255 153");
235 custom_color(ird_color_uses_memory, "153 153 255");
236 custom_color(ird_color_phi, "105 255 105");
237 custom_color(ird_color_anchor, "100 100 255");
238 named_color(ird_color_error, "red");
239 custom_color(ird_color_entity, "204 204 255");
245 * Prints the VCG color to a file.
247 static void print_vcg_color(FILE *out, ird_color_t color)
249 assert(color < ird_color_count);
250 fprintf(out, "color:%s", color_names[color]);
254 * Prints the edge kind of a given IR node.
256 * Projs should be dumped near their predecessor, so they get "nearedge".
258 static void print_node_edge_kind(FILE *out, ir_node *node)
261 fprintf(out, "nearedge: ");
263 fprintf(out, "edge: ");
268 * Prints the edge from a type S to a type T with additional info fmt, ...
271 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
276 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
277 fprintf(F, " targetname: "); PRINT_TYPEID(T);
278 ir_vfprintf(F, fmt, ap);
284 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
287 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
292 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
293 fprintf(F, " targetname: \""); PRINT_ENTID(ent); fprintf(F, "\"");
294 ir_vfprintf(F, fmt, ap);
300 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
303 static void print_ent_ent_edge(FILE *F, const ir_entity *ent1, const ir_entity *ent2, int backedge, ird_color_t color, const char *fmt, ...)
309 fprintf(F, "backedge: { sourcename: \"");
311 fprintf(F, "edge: { sourcename: \"");
313 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent2); fprintf(F, "\"");
314 ir_vfprintf(F, fmt, ap);
316 if (color != ird_color_none)
317 print_vcg_color(F, color);
323 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
326 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
331 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
332 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
333 ir_vfprintf(F, fmt, ap);
339 * Prints the edge from a node irn to a type tp with additional info fmt, ...
342 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
347 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
348 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
349 ir_vfprintf(F, fmt, ap);
355 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
358 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
363 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
364 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent);
366 ir_vfprintf(F, fmt, ap);
372 * Prints the edge from an entity ent to a node irn with additional info fmt, ...
375 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
380 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
381 fprintf(F, "\" targetname: \""); PRINT_NODEID(irn); fprintf(F, "\"");
382 ir_vfprintf(F, fmt, ap);
388 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
391 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
396 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
397 fprintf(F, " targetname: \""); PRINT_ITEMID(tp, item); fprintf(F, "\" ");
398 ir_vfprintf(F, fmt, ap);
403 /*-----------------------------------------------------------------*/
404 /* global and ahead declarations */
405 /*-----------------------------------------------------------------*/
407 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
409 /*-----------------------------------------------------------------*/
410 /* Helper functions. */
411 /*-----------------------------------------------------------------*/
414 * This map is used as a private link attr to be able to call dumper
415 * anywhere without destroying link fields.
417 static pmap *irdump_link_map = NULL;
419 /** NOT A STANDARD LIBFIRM INIT METHOD
421 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
422 * are off, we want to have as few interferences as possible. Therefore the
423 * initialization is performed lazily and not called from within init_firm.
425 * Creates the link attribute map. */
426 static void init_irdump(void)
428 /* We need a new, empty map. */
429 if (irdump_link_map) pmap_destroy(irdump_link_map);
430 irdump_link_map = pmap_create();
431 if (!dump_file_filter_id)
432 dump_file_filter_id = new_id_from_str("");
436 * Returns the private link field.
438 static void *ird_get_irn_link(const ir_node *n)
441 if (irdump_link_map == NULL)
444 if (pmap_contains(irdump_link_map, n))
445 res = pmap_get(irdump_link_map, n);
450 * Sets the private link field.
452 static void ird_set_irn_link(const ir_node *n, void *x)
454 if (irdump_link_map == NULL)
456 pmap_insert(irdump_link_map, n, x);
460 * Gets the private link field of an irg.
462 static void *ird_get_irg_link(const ir_graph *irg)
465 if (irdump_link_map == NULL)
468 if (pmap_contains(irdump_link_map, irg))
469 res = pmap_get(irdump_link_map, irg);
474 * Sets the private link field of an irg.
476 static void ird_set_irg_link(const ir_graph *irg, void *x)
478 if (irdump_link_map == NULL)
480 pmap_insert(irdump_link_map, irg, x);
484 * Walker, clears the private link field.
486 static void clear_link(ir_node *node, void *env)
489 ird_set_irn_link(node, NULL);
493 * If the entity has a ld_name, returns it if the dump_ld_name is set,
494 * else returns the name of the entity.
496 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
499 return "<NULL entity>";
501 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
502 if (ent->ld_name != NULL)
503 return get_id_str(ent->ld_name);
505 return get_id_str(ent->name);
508 const char *get_ent_dump_name(const ir_entity *ent)
510 return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
513 const char *get_irg_dump_name(const ir_graph *irg)
515 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
516 return _get_ent_dump_name(get_irg_entity(irg), true);
520 * Returns non-zero if a node is in floating state.
522 static int node_floats(const ir_node *n)
524 return ((get_irn_pinned(n) == op_pin_state_floats) &&
525 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
529 * Walker that visits the anchors
531 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
533 if ((flags & ir_dump_flag_all_anchors)
534 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
535 irg_walk_anchors(irg, pre, post, env);
537 irg_walk_graph(irg, pre, post, env);
542 * Walker, allocates an array for all blocks and puts their non-floating
543 * nodes into this array.
545 static void collect_node(ir_node *node, void *env)
550 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
551 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
552 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
553 ARR_APP1(ir_node *, arr, node);
554 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
556 ir_node * block = get_nodes_block(node);
559 /* this node is in a Bad block, so we must place it into the graph's list */
560 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
561 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
562 ARR_APP1(ir_node *, arr, node);
563 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
565 ird_set_irn_link(node, ird_get_irn_link(block));
566 ird_set_irn_link(block, node);
571 /** Construct lists to walk ir block-wise.
573 * Collects all blocks, nodes not op_pin_state_pinned,
574 * Bad, NoMem and Unknown into a flexible array in link field of
575 * irg they belong to. Sets the irg link field to NULL in all
576 * graphs not visited.
577 * Free the list with DEL_ARR_F().
579 static ir_node **construct_block_lists(ir_graph *irg)
582 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
583 ir_graph *rem = current_ir_graph;
585 current_ir_graph = irg;
588 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
591 for (i = get_irp_n_irgs(); i > 0;)
592 ird_set_irg_link(get_irp_irg(--i), NULL);
594 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
597 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
600 current_ir_graph = rem;
601 return (ir_node**)ird_get_irg_link(irg);
604 typedef struct list_tuple {
606 ir_extblk **extbb_list;
609 /** Construct lists to walk IR extended block-wise.
610 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
611 * NULL in all graphs not visited.
613 static list_tuple *construct_extblock_lists(ir_graph *irg)
615 ir_node **blk_list = construct_block_lists(irg);
617 ir_graph *rem = current_ir_graph;
618 list_tuple *lists = XMALLOC(list_tuple);
620 current_ir_graph = irg;
622 lists->blk_list = NEW_ARR_F(ir_node *, 0);
623 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
625 inc_irg_block_visited(irg);
626 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
629 if (is_Block(blk_list[i])) {
630 ext = get_Block_extbb(blk_list[i]);
632 if (extbb_not_visited(ext)) {
633 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
634 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 void dump_node_opcode(FILE *F, ir_node *n)
648 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
650 /* call the dump_node operation if available */
651 if (ops->dump_node) {
652 ops->dump_node(F, n, dump_node_opcode_txt);
656 /* implementation for default nodes */
657 switch (get_irn_opcode(n)) {
659 switch (get_SymConst_kind(n)) {
660 case symconst_addr_ent:
661 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
663 case symconst_ofs_ent:
664 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
666 case symconst_type_tag:
667 ir_fprintf(F, "SymC %+F tag", get_SymConst_type(n));
669 case symconst_type_size:
670 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
672 case symconst_type_align:
673 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
675 case symconst_enum_const:
676 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
682 ir_node *pred = get_Proj_pred(n);
684 if (get_irn_opcode(pred) == iro_Cond
685 && get_Proj_proj(n) == get_Cond_default_proj(pred)
686 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
687 fprintf(F, "defProj");
693 if (get_Load_unaligned(n) == align_non_aligned)
695 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
698 if (get_Store_unaligned(n) == align_non_aligned)
700 fprintf(F, "%s", get_irn_opname(n));
703 if (is_Block_dead(n))
705 if (n == get_irg_start_block(get_irn_irg(n)))
707 if (n == get_irg_end_block(get_irn_irg(n)))
709 fprintf(F, "%s%s", get_irn_opname(n),
710 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
713 if (get_Conv_strict(n))
714 fprintf(F, "strict");
715 fprintf(F, "%s", get_irn_opname(n));
718 fprintf(F, "%s", get_irn_opname(n));
719 if (get_Div_no_remainder(n))
721 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
724 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
727 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
732 fprintf(F, "%s", get_irn_opname(n));
737 * Dump the mode of a node n to a file F.
738 * Ignore modes that are "always known".
740 static void dump_node_mode(FILE *F, ir_node *n)
742 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
746 /* call the dump_node operation if available */
747 if (ops->dump_node) {
748 ops->dump_node(F, n, dump_node_mode_txt);
752 /* default implementation */
753 iro = get_irn_opcode(n);
765 mode = get_irn_mode(n);
767 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
768 (mode != mode_T || iro == iro_Proj))
769 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
774 * Dump the type of a node n to a file F if it's known.
776 static int dump_node_typeinfo(FILE *F, ir_node *n)
780 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
781 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
782 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
783 ir_type *tp = get_irn_typeinfo_type(n);
784 if (tp != firm_none_type) {
785 ir_fprintf(F, "[%+F]", tp);
794 typedef struct pns_lookup {
795 long nr; /**< the proj number */
796 const char *name; /**< the name of the Proj */
799 typedef struct proj_lookup {
800 unsigned code; /**< the opcode of the Proj predecessor */
801 unsigned num_data; /**< number of data entries */
802 const pns_lookup_t *data; /**< the data */
805 /** the lookup table for Proj(Start) names */
806 static const pns_lookup_t start_lut[] = {
807 #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_else_mark(con)) {
1195 /* Generate a new name for the node by appending the names of
1197 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1198 fprintf(F, " label: \"");
1199 dump_node_label(F, con);
1201 dump_node_info(F, con);
1202 dump_node_vcgattr(F, n, con, 0);
1208 /** If the block of an edge is a const_like node, dump it local with an edge */
1209 static void dump_const_block_local(FILE *F, ir_node *n)
1213 if (!get_opt_dump_const_local()) return;
1215 blk = get_nodes_block(n);
1216 if (is_constlike_node(blk)) {
1217 /* Generate a new name for the node by appending the names of
1219 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1220 fprintf(F, "\" label: \"");
1221 dump_node_label(F, blk);
1223 dump_node_info(F, blk);
1224 dump_node_vcgattr(F, n, blk, 0);
1227 fprintf(F, "edge: { sourcename: \"");
1229 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1231 if (dump_edge_vcgattr_hook) {
1233 if (dump_edge_vcgattr_hook(F, n, -1)) {
1237 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1242 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1247 * prints the error message of a node to a file F as info2.
1249 static void print_node_error(FILE *F, const char *err_msg)
1254 fprintf(F, " info2: \"%s\"", err_msg);
1258 * prints debug messages of a node to file F as info3.
1260 static void print_dbg_info(FILE *F, dbg_info *dbg)
1264 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1266 fprintf(F, " info3: \"%s\"\n", buf);
1270 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1280 static void dump_node(FILE *F, ir_node *n)
1285 if (get_opt_dump_const_local() && is_constlike_node(n))
1288 /* dump this node */
1289 fputs("node: {title: \"", F);
1293 fputs(" label: \"", F);
1294 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1295 dump_node_label(F, n);
1296 dump_node_ana_vals(F, n);
1297 //dump_node_ana_info(F, n);
1300 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1301 //fputs(" node_class:23", F);
1304 dump_node_info(F, n);
1305 print_node_error(F, p);
1306 print_dbg_info(F, get_irn_dbg_info(n));
1307 dump_node_vcgattr(F, n, NULL, bad);
1309 dump_const_node_local(F, n);
1311 if (dump_node_edge_hook)
1312 dump_node_edge_hook(F, n);
1315 /** dump the edge to the block this node belongs to */
1316 static void dump_ir_block_edge(FILE *F, ir_node *n)
1318 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1320 ir_node *block = get_nodes_block(n);
1322 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1323 dump_const_block_local(F, n);
1325 fprintf(F, "edge: { sourcename: \"");
1327 fprintf(F, "\" targetname: ");
1328 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1330 if (dump_edge_vcgattr_hook) {
1332 if (dump_edge_vcgattr_hook(F, n, -1)) {
1336 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1341 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1346 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1349 * do not use get_nodes_block() here, will fail
1350 * if the irg is not pinned.
1352 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1353 fprintf(F, INTRA_DATA_EDGE_ATTR);
1355 fprintf(F, INTER_DATA_EDGE_ATTR);
1358 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1361 * do not use get_nodes_block() here, will fail
1362 * if the irg is not pinned.
1364 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1365 fprintf(F, INTRA_MEM_EDGE_ATTR);
1367 fprintf(F, INTER_MEM_EDGE_ATTR);
1370 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1371 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1375 if (dump_edge_vcgattr_hook)
1376 if (dump_edge_vcgattr_hook(F, from, to))
1379 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1380 fprintf(F, BACK_EDGE_ATTR);
1382 switch (get_irn_opcode(from)) {
1384 fprintf(F, CF_EDGE_ATTR);
1386 case iro_Start: break;
1389 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1390 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1392 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1396 if (is_Proj(from)) {
1397 if (get_irn_mode(from) == mode_M)
1398 print_mem_edge_vcgattr(F, from, to);
1399 else if (get_irn_mode(from) == mode_X)
1400 fprintf(F, CF_EDGE_ATTR);
1402 print_data_edge_vcgattr(F, from, to);
1404 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1405 print_mem_edge_vcgattr(F, from, to);
1406 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1407 fprintf(F, CF_EDGE_ATTR);
1409 print_data_edge_vcgattr(F, from, to);
1413 /** dump edges to our inputs */
1414 static void dump_ir_data_edges(FILE *F, ir_node *n)
1418 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1419 /* the End node has only keep-alive edges */
1423 /* dump the dependency edges. */
1424 num = get_irn_deps(n);
1425 for (i = 0; i < num; ++i) {
1426 ir_node *dep = get_irn_dep(n, i);
1429 print_node_edge_kind(F, n);
1430 fprintf(F, "{sourcename: \"");
1432 fprintf(F, "\" targetname: ");
1433 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1434 PRINT_CONSTID(n, dep);
1440 fprintf(F, " label: \"%d\" ", i);
1441 fprintf(F, " color: darkgreen}\n");
1445 num = get_irn_arity(n);
1446 for (i = 0; i < num; i++) {
1447 ir_node *pred = get_irn_n(n, i);
1450 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1451 fprintf(F, "backedge: {sourcename: \"");
1453 print_node_edge_kind(F, n);
1454 fprintf(F, "{sourcename: \"");
1457 fprintf(F, "\" targetname: ");
1458 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1459 PRINT_CONSTID(n, pred);
1461 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1463 fprintf(F, " label: \"%d\" ", i);
1464 print_edge_vcgattr(F, n, i);
1472 static void dump_ir_edges(ir_node *node, void *env)
1475 FILE *F = (FILE*)env;
1476 const ir_edge_t *edge;
1478 foreach_out_edge(node, edge) {
1479 ir_node *succ = get_edge_src_irn(edge);
1481 print_node_edge_kind(F, succ);
1482 fprintf(F, "{sourcename: \"");
1484 fprintf(F, "\" targetname: \"");
1488 fprintf(F, " label: \"%d\" ", i);
1489 fprintf(F, OUT_EDGE_ATTR);
1496 /** Dumps a node and its edges but not the block edge */
1497 static void dump_node_wo_blockedge(ir_node *n, void *env)
1499 FILE *F = (FILE*)env;
1501 dump_ir_data_edges(F, n);
1504 /** Dumps a node and its edges. */
1505 static void dump_node_with_edges(ir_node *n, void *env)
1507 FILE *F = (FILE*)env;
1508 dump_node_wo_blockedge(n, env);
1509 if (!node_floats(n))
1510 dump_ir_block_edge(F, n);
1513 /** Dumps a const-like node. */
1514 static void dump_const_node(ir_node *n, void *env)
1516 if (is_Block(n)) return;
1517 dump_node_wo_blockedge(n, env);
1520 /***********************************************************************/
1521 /* the following routines dump the nodes/irgs bracketed to graphs. */
1522 /***********************************************************************/
1524 /** Dumps a constant expression as entity initializer, array bound ... */
1525 static void dump_const_expression(FILE *F, ir_node *value)
1527 ir_graph *rem = current_ir_graph;
1528 ir_dump_flags_t old_flags = ir_get_dump_flags();
1529 ir_remove_dump_flags(ir_dump_flag_consts_local);
1531 current_ir_graph = get_const_code_irg();
1532 irg_walk(value, dump_const_node, NULL, F);
1533 /* Decrease visited flag so that we walk with the same flag for the next
1534 expression. This guarantees that we don't dump the same node twice,
1535 as for const expressions cse is performed to save memory. */
1536 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1538 ir_set_dump_flags(old_flags);
1539 current_ir_graph = rem;
1542 /** Dump a block as graph containing its nodes.
1544 * Expects to find nodes belonging to the block as list in its
1546 * Dumps the edges of all nodes including itself. */
1547 static void dump_whole_block(FILE *F, ir_node *block)
1550 ird_color_t color = ird_color_block_background;
1552 assert(is_Block(block));
1554 fprintf(F, "graph: { title: \"");
1555 PRINT_NODEID(block);
1556 fprintf(F, "\" label: \"");
1557 dump_node_label(F, block);
1559 /* colorize blocks */
1560 if (! get_Block_matured(block))
1561 color = ird_color_block_background;
1562 if (is_Block_dead(block))
1563 color = ird_color_dead_block_background;
1565 fprintf(F, "\" status:clustered ");
1566 print_vcg_color(F, color);
1569 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1570 dump_node_info(F, block);
1571 print_dbg_info(F, get_irn_dbg_info(block));
1573 /* dump the blocks edges */
1574 dump_ir_data_edges(F, block);
1576 if (dump_block_edge_hook)
1577 dump_block_edge_hook(F, block);
1579 /* dump the nodes that go into the block */
1580 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1582 dump_ir_data_edges(F, node);
1585 /* Close the vcg information for the block */
1587 dump_const_node_local(F, block);
1591 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1592 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1593 static void dump_block_graph(FILE *F, ir_graph *irg)
1596 ir_graph *rem = current_ir_graph;
1597 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1598 current_ir_graph = irg;
1600 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1601 ir_node *node = arr[i];
1602 if (is_Block(node)) {
1603 /* Dumps the block and all the nodes in the block, which are to
1604 be found in Block->link. */
1605 dump_whole_block(F, node);
1607 /* Nodes that are not in a Block. */
1609 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1610 dump_const_block_local(F, node);
1612 dump_ir_data_edges(F, node);
1614 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1615 dump_ir_edges(node, F);
1618 if ((flags & ir_dump_flag_loops) && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1619 dump_loop_nodes_into_graph(F, irg);
1621 current_ir_graph = rem;
1625 * Dump the info for an irg.
1626 * Parsed by XVCG but not shown. use yComp.
1628 static void dump_graph_info(FILE *F, ir_graph *irg)
1630 fprintf(F, "info1: \"");
1631 dump_entity_to_file(F, get_irg_entity(irg));
1635 /** Dumps an irg as a graph clustered by block nodes.
1636 * If interprocedural view edges can point to nodes out of this graph.
1638 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1640 ir_entity *ent = get_irg_entity(irg);
1642 fprintf(F, "graph: { title: \"");
1644 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1645 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1647 dump_graph_info(F, irg);
1648 print_dbg_info(F, get_entity_dbg_info(ent));
1650 dump_block_graph(F, irg);
1652 /* Close the vcg information for the irg */
1653 fprintf(F, "}\n\n");
1656 /*******************************************************************/
1657 /* Basic type and entity nodes and edges. */
1658 /*******************************************************************/
1660 /** dumps the edges between nodes and their type or entity attributes. */
1661 static void dump_node2type_edges(ir_node *n, void *env)
1663 FILE *F = (FILE*)env;
1666 switch (get_irn_opcode(n)) {
1668 /* @@@ some consts have an entity */
1671 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1672 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1675 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1678 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1681 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1684 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1687 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1695 static int print_type_info(FILE *F, ir_type *tp)
1699 if (get_type_state(tp) == layout_undefined) {
1700 fprintf(F, "state: layout_undefined\n");
1702 fprintf(F, "state: layout_fixed,\n");
1704 if (get_type_mode(tp))
1705 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1706 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1711 static void print_typespecific_info(FILE *F, ir_type *tp)
1713 switch (get_type_tpop_code(tp)) {
1715 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1720 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1721 fprintf(F, "params: %d\n", get_method_n_params(tp));
1722 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1728 case tpo_enumeration:
1740 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1742 switch (get_type_tpop_code(tp)) {
1744 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1747 fprintf(F, " " TYPE_METH_NODE_ATTR);
1755 case tpo_enumeration:
1766 void dump_type_node(FILE *F, ir_type *tp)
1768 fprintf(F, "node: {title: ");
1770 fprintf(F, " label: \"%s ", get_type_tpop_name(tp));
1771 if (tp->dbi != NULL) {
1773 ir_print_type(buf, sizeof(buf), tp);
1774 fprintf(F, "'%s'", buf);
1776 ir_fprintf(F, "%+F", tp);
1778 fputs("\" info1: \"", F);
1779 dump_type_to_file(F, tp);
1781 print_type_dbg_info(F, get_type_dbg_info(tp));
1782 print_typespecific_vcgattr(F, tp);
1786 static void dump_entity_node(FILE *F, ir_entity *ent)
1788 fprintf(F, "node: {title: \"");
1789 PRINT_ENTID(ent); fprintf(F, "\"");
1790 fprintf(F, " label: ");
1791 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1793 print_vcg_color(F, ird_color_entity);
1794 fprintf(F, "\n info1: \"");
1796 dump_entity_to_file(F, ent);
1799 print_dbg_info(F, get_entity_dbg_info(ent));
1803 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1806 ir_enum_const *ec = get_enumeration_const(tp, pos);
1807 ident *id = get_enumeration_const_nameid(ec);
1808 ir_tarval *tv = get_enumeration_value(ec);
1811 tarval_snprintf(buf, sizeof(buf), tv);
1813 strncpy(buf, "<not set>", sizeof(buf));
1814 fprintf(F, "node: {title: \"");
1815 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1816 fprintf(F, " label: ");
1817 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1818 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1822 * Dumps a new style initializer.
1824 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1831 /** Dumps a type or entity and its edges. */
1832 static void dump_type_info(type_or_ent tore, void *env)
1834 FILE *F = (FILE*)env;
1835 size_t i = 0; /* to shutup gcc */
1837 /* dump this type or entity */
1839 switch (get_kind(tore.ent)) {
1841 ir_entity *ent = tore.ent;
1844 dump_entity_node(F, ent);
1846 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1847 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1848 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1849 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1850 if (is_Class_type(get_entity_owner(ent))) {
1851 for (i = get_entity_n_overwrites(ent); i > 0;)
1852 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1854 /* attached subgraphs */
1855 if (! (flags & ir_dump_flag_no_entity_values)) {
1856 if (ent->initializer != NULL) {
1857 /* new style initializers */
1858 dump_entity_initializer(F, ent);
1859 } else if (entity_has_compound_ent_values(ent)) {
1860 /* old style compound entity values */
1861 for (i = get_compound_ent_n_values(ent); i > 0;) {
1862 value = get_compound_ent_value(ent, --i);
1864 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1865 dump_const_expression(F, value);
1866 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1868 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1869 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1870 get_compound_ent_value_member(ent, i), i);
1879 ir_type *tp = tore.typ;
1880 dump_type_node(F, tp);
1881 /* and now the edges */
1882 switch (get_type_tpop_code(tp)) {
1884 for (i = get_class_n_supertypes(tp); i > 0;) {
1886 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1888 for (i = get_class_n_members(tp); i > 0;) {
1890 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1894 for (i = get_struct_n_members(tp); i > 0;) {
1896 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1900 for (i = get_method_n_params(tp); i > 0;) {
1902 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1904 for (i = get_method_n_ress(tp); i > 0;) {
1906 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1910 for (i = get_union_n_members(tp); i > 0;) {
1912 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1916 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1917 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1918 for (i = get_array_n_dimensions(tp); i > 0;) {
1919 ir_node *upper, *lower;
1922 upper = get_array_upper_bound(tp, i);
1923 lower = get_array_lower_bound(tp, i);
1924 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1925 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1926 dump_const_expression(F, upper);
1927 dump_const_expression(F, lower);
1930 case tpo_enumeration:
1931 for (i = get_enumeration_n_enums(tp); i > 0;) {
1933 dump_enum_item(F, tp, i);
1934 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1938 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1945 break; /* case k_type */
1948 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1949 } /* switch kind_or_entity */
1952 /** For dumping class hierarchies.
1953 * Dumps a class type node and a superclass edge.
1955 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1957 FILE *F = (FILE*)ctx;
1958 size_t i = 0; /* to shutup gcc */
1960 /* dump this type or entity */
1961 switch (get_kind(tore.ent)) {
1963 ir_entity *ent = tore.ent;
1964 if (get_entity_owner(ent) == get_glob_type()) break;
1965 if (!is_Method_type(get_entity_type(ent)))
1967 if (flags & ir_dump_flag_entities_in_hierarchy
1968 && is_Class_type(get_entity_owner(ent))) {
1970 dump_entity_node(F, ent);
1972 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1973 for (i = get_entity_n_overwrites(ent); i > 0;) {
1975 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1981 ir_type *tp = tore.typ;
1982 if (tp == get_glob_type())
1984 switch (get_type_tpop_code(tp)) {
1986 dump_type_node(F, tp);
1987 /* and now the edges */
1988 for (i = get_class_n_supertypes(tp); i > 0;) {
1990 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1995 break; /* case k_type */
1998 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1999 } /* switch kind_or_entity */
2002 /*******************************************************************/
2003 /* dump analysis information that is expressed in graph terms. */
2004 /*******************************************************************/
2006 /* dump out edges */
2007 static void dump_out_edge(ir_node *n, void *env)
2009 FILE *F = (FILE*)env;
2011 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2012 ir_node *succ = get_irn_out(n, i);
2014 print_node_edge_kind(F, succ);
2015 fprintf(F, "{sourcename: \"");
2017 fprintf(F, "\" targetname: \"");
2019 fprintf(F, "\" color: red linestyle: dashed");
2024 static void dump_loop_label(FILE *F, ir_loop *loop)
2026 fprintf(F, "loop %u, %lu sons, %lu nodes",
2027 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2028 (unsigned long) get_loop_n_nodes(loop));
2031 static void dump_loop_info(FILE *F, ir_loop *loop)
2033 fprintf(F, " info1: \"");
2034 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2035 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2036 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2041 static void dump_loop_node(FILE *F, ir_loop *loop)
2043 fprintf(F, "node: {title: \"");
2045 fprintf(F, "\" label: \"");
2046 dump_loop_label(F, loop);
2048 dump_loop_info(F, loop);
2052 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2055 fprintf(F, "edge: {sourcename: \"");
2057 fprintf(F, "\" targetname: \"");
2058 PRINT_NODEID(get_loop_node(loop, i));
2059 fprintf(F, "\" color: green");
2063 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2066 fprintf(F, "edge: {sourcename: \"");
2068 fprintf(F, "\" targetname: \"");
2069 PRINT_LOOPID(get_loop_son(loop, i));
2070 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2071 get_loop_element_pos(loop, get_loop_son(loop, i)));
2074 static void dump_loops(FILE *F, ir_loop *loop)
2077 /* dump this loop node */
2078 dump_loop_node(F, loop);
2080 /* dump edges to nodes in loop -- only if it is a real loop */
2081 if (get_loop_depth(loop) != 0) {
2082 for (i = get_loop_n_nodes(loop); i > 0;) {
2084 dump_loop_node_edge(F, loop, i);
2087 for (i = get_loop_n_sons(loop); i > 0;) {
2089 dump_loops(F, get_loop_son(loop, i));
2090 dump_loop_son_edge(F, loop, i);
2094 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2096 ir_loop *loop = get_irg_loop(irg);
2099 ir_graph *rem = current_ir_graph;
2100 current_ir_graph = irg;
2102 dump_loops(F, loop);
2104 current_ir_graph = rem;
2110 * dumps the VCG header
2112 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2116 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2120 if (! layout) layout = "Compilergraph";
2121 if (!orientation) orientation = "bottom_to_top";
2125 "graph: { title: \"ir graph of %s\"\n"
2126 "display_edge_labels: %s\n"
2127 "layoutalgorithm: mindepth //$ \"%s\"\n"
2128 "manhattan_edges: yes\n"
2129 "port_sharing: no\n"
2131 "classname 1: \"intrablock Data\"\n"
2132 "classname 2: \"Block\"\n"
2133 "classname 3: \"Entity type\"\n"
2134 "classname 4: \"Entity owner\"\n"
2135 "classname 5: \"Method Param\"\n"
2136 "classname 6: \"Method Res\"\n"
2137 "classname 7: \"Super\"\n"
2138 "classname 8: \"Union\"\n"
2139 "classname 9: \"Points-to\"\n"
2140 "classname 10: \"Array Element Type\"\n"
2141 "classname 11: \"Overwrites\"\n"
2142 "classname 12: \"Member\"\n"
2143 "classname 13: \"Control Flow\"\n"
2144 "classname 14: \"intrablock Memory\"\n"
2145 "classname 15: \"Dominators\"\n"
2146 "classname 16: \"interblock Data\"\n"
2147 "classname 17: \"interblock Memory\"\n"
2148 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2149 "classname 19: \"Postdominators\"\n"
2150 "classname 20: \"Keep Alive\"\n"
2151 "classname 21: \"Out Edges\"\n"
2152 "classname 22: \"Macro Block Edges\"\n"
2153 //"classname 23: \"NoInput Nodes\"\n"
2154 "infoname 1: \"Attribute\"\n"
2155 "infoname 2: \"Verification errors\"\n"
2156 "infoname 3: \"Debug info\"\n",
2157 name, label, layout, orientation);
2159 for (i = 0; i < ird_color_count; ++i) {
2160 if (color_rgb[i] != NULL) {
2161 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2168 * Dumps the vcg file footer
2170 void dump_vcg_footer(FILE *F)
2177 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2181 construct_block_lists(irg);
2184 * If we are in the interprocedural view, we dump not
2185 * only the requested irg but also all irgs that can be reached
2188 for (i = get_irp_n_irgs(); i > 0;) {
2189 ir_graph *irg = get_irp_irg(--i);
2190 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
2194 dump_graph_from_list(out, irg);
2199 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2200 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2201 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2204 ir_graph *rem = current_ir_graph;
2205 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2206 current_ir_graph = irg;
2208 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2209 ir_extblk *extbb = arr[i];
2210 ir_node *leader = get_extbb_leader(extbb);
2213 fprintf(F, "graph: { title: \"");
2214 PRINT_EXTBBID(leader);
2215 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2216 get_irn_node_nr(leader));
2218 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2219 ir_node *node = extbb->blks[j];
2220 if (is_Block(node)) {
2221 /* Dumps the block and all the nodes in the block, which are to
2222 be found in Block->link. */
2223 dump_whole_block(F, node);
2225 /* Nodes that are not in a Block. */
2227 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2228 dump_const_block_local(F, node);
2230 dump_ir_data_edges(F, node);
2236 if ((flags & ir_dump_flag_loops)
2237 && (get_irg_loopinfo_state(irg) & loopinfo_valid))
2238 dump_loop_nodes_into_graph(F, irg);
2240 current_ir_graph = rem;
2244 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2247 ir_entity *ent = get_irg_entity(irg);
2249 if (get_irg_extblk_state(irg) != ir_extblk_info_valid)
2252 construct_extblock_lists(irg);
2254 fprintf(F, "graph: { title: \"");
2256 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2257 get_ent_dump_name(ent));
2259 dump_graph_info(F, irg);
2260 print_dbg_info(F, get_entity_dbg_info(ent));
2262 for (i = get_irp_n_irgs(); i > 0;) {
2263 ir_graph *irg = get_irp_irg(--i);
2264 list_tuple *lists = (list_tuple*)ird_get_irg_link(irg);
2267 /* dump the extended blocks first */
2268 if (ARR_LEN(lists->extbb_list)) {
2269 ird_set_irg_link(irg, lists->extbb_list);
2270 dump_extblock_graph(F, irg);
2273 /* we may have blocks without extended blocks, bad for instance */
2274 if (ARR_LEN(lists->blk_list)) {
2275 ird_set_irg_link(irg, lists->blk_list);
2276 dump_block_graph(F, irg);
2279 DEL_ARR_F(lists->extbb_list);
2280 DEL_ARR_F(lists->blk_list);
2285 /* Close the vcg information for the irg */
2286 fprintf(F, "}\n\n");
2291 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2293 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2296 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2297 if (flags & ir_dump_flag_group_extbb) {
2298 dump_blocks_extbb_grouped(out, irg);
2300 dump_blocks_as_subgraphs(out, irg);
2303 /* dump_node_with_edges must be called in post visiting predecessors */
2304 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2307 /* dump type info */
2308 if (flags & ir_dump_flag_with_typegraph) {
2309 ir_graph *rem = current_ir_graph;
2310 current_ir_graph = irg;
2312 type_walk_irg(irg, dump_type_info, NULL, out);
2313 inc_irg_visited(get_const_code_irg());
2314 /* dump edges from graph to type info */
2315 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2317 current_ir_graph = rem;
2320 /* dump iredges out edges */
2321 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2322 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2325 /* dump the out edges in a separate walk */
2326 if ((flags & ir_dump_flag_out_edges)
2327 && (get_irg_outs_state(irg) != outs_none)) {
2328 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2331 dump_vcg_footer(out);
2334 static void dump_block_to_cfg(ir_node *block, void *env)
2336 FILE *F = (FILE*)env;
2340 if (is_Block(block)) {
2341 /* This is a block. Dump a node for the block. */
2342 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2343 fprintf(F, "\" label: \"");
2344 if (block == get_irg_start_block(get_irn_irg(block)))
2345 fprintf(F, "Start ");
2346 if (block == get_irg_end_block(get_irn_irg(block)))
2349 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2350 PRINT_NODEID(block);
2352 fprintf(F, "info1:\"");
2354 /* the generic version. */
2355 dump_irnode_to_file(F, block);
2357 /* Check whether we have bad predecessors to color the block. */
2358 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2359 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2362 fprintf(F, "\""); /* closing quote of info */
2364 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2365 (block == get_irg_end_block(get_irn_irg(block))) )
2366 fprintf(F, " color:blue ");
2368 fprintf(F, " color:yellow ");
2371 /* Dump the edges */
2372 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i)
2373 if (!is_Bad(skip_Proj(get_Block_cfgpred(block, i)))) {
2374 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2375 fprintf(F, "edge: { sourcename: \"");
2376 PRINT_NODEID(block);
2377 fprintf(F, "\" targetname: \"");
2379 fprintf(F, "\"}\n");
2382 /* Dump dominator/postdominator edge */
2383 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2384 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2385 pred = get_Block_idom(block);
2386 fprintf(F, "edge: { sourcename: \"");
2387 PRINT_NODEID(block);
2388 fprintf(F, "\" targetname: \"");
2390 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2392 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2393 pred = get_Block_ipostdom(block);
2394 fprintf(F, "edge: { sourcename: \"");
2395 PRINT_NODEID(block);
2396 fprintf(F, "\" targetname: \"");
2398 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2404 void dump_cfg(FILE *F, ir_graph *irg)
2406 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2408 /* walk over the blocks in the graph */
2409 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, F);
2410 dump_node(F, get_irg_bad(irg));
2415 void dump_callgraph(FILE *F)
2418 ir_dump_flags_t old_flags = ir_get_dump_flags();
2420 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2421 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2423 for (i = get_irp_n_irgs(); i > 0;) {
2424 ir_graph *irg = get_irp_irg(--i);
2425 ir_entity *ent = get_irg_entity(irg);
2426 size_t j, n_callees = get_irg_n_callees(irg);
2428 dump_entity_node(F, ent);
2429 for (j = 0; j < n_callees; ++j) {
2430 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2431 int be = is_irg_callee_backedge(irg, j);
2432 const char *attr = be
2433 ? "label:\"recursion %zu\""
2434 : "label:\"calls %zu\"";
2435 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2436 get_irg_callee_loop_depth(irg, j));
2440 ir_set_dump_flags(old_flags);
2444 void dump_typegraph(FILE *out)
2446 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2447 type_walk(dump_type_info, NULL, out);
2448 dump_vcg_footer(out);
2451 void dump_class_hierarchy(FILE *out)
2453 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2454 type_walk(dump_class_hierarchy_node, NULL, out);
2455 dump_vcg_footer(out);
2458 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2461 bool loop_node_started = false;
2463 size_t son_number = 0;
2465 ir_loop *son = NULL;
2467 /* Dump a new loop node. */
2468 dump_loop_node(F, loop);
2470 /* Dump the loop elements. */
2471 for (i = 0; i < get_loop_n_elements(loop); i++) {
2472 le = get_loop_element(loop, i);
2474 if (get_kind(son) == k_ir_loop) {
2476 /* We are a loop son -> Recurse */
2478 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2479 fprintf(F, "\" }\n");
2480 fprintf(F, "edge: {sourcename: \"");
2482 fprintf(F, "\" targetname: \"");
2484 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2485 (unsigned long) first,
2486 (unsigned long) first,
2487 (unsigned long) i-1);
2488 loop_node_started = false;
2490 dump_loop_son_edge(F, loop, son_number++);
2491 dump_loops_standalone(F, son);
2492 } else if (get_kind(son) == k_ir_node) {
2493 /* We are a loop node -> Collect firm nodes */
2495 ir_node *n = le.node;
2496 if (!loop_node_started) {
2497 /* Start a new node which contains all firm nodes of the current loop */
2498 fprintf(F, "node: { title: \"");
2500 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2502 loop_node_started = true;
2507 dump_node_label(F, n);
2508 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2509 if (has_backedges(n)) fprintf(F, "\t loop head!");
2510 } else { /* for callgraph loop tree */
2512 assert(get_kind(son) == k_ir_graph);
2514 /* We are a loop node -> Collect firm graphs */
2516 if (!loop_node_started) {
2517 /* Start a new node which contains all firm nodes of the current loop */
2518 fprintf(F, "node: { title: \"");
2520 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2522 loop_node_started = true;
2526 fprintf(F, " %s", get_irg_dump_name(n));
2527 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2531 if (loop_node_started) {
2532 fprintf(F, "\" }\n");
2533 fprintf(F, "edge: {sourcename: \"");
2535 fprintf(F, "\" targetname: \"");
2537 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2538 (unsigned long) first,
2539 (unsigned long) first,
2540 (unsigned long) i-1);
2541 loop_node_started = false;
2545 void dump_loop_tree(FILE *out, ir_graph *irg)
2547 ir_graph *rem = current_ir_graph;
2548 ir_dump_flags_t old_flags = ir_get_dump_flags();
2550 current_ir_graph = irg;
2551 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2553 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2555 if (get_irg_loop(irg))
2556 dump_loops_standalone(out, get_irg_loop(irg));
2558 dump_vcg_footer(out);
2560 ir_set_dump_flags(old_flags);
2561 current_ir_graph = rem;
2564 void dump_callgraph_loop_tree(FILE *out)
2566 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2567 dump_loops_standalone(out, irp->outermost_cg_loop);
2568 dump_vcg_footer(out);
2571 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2575 int node_number = 0;
2577 if (flags & ir_dump_flag_loops)
2578 dump_loop_node(F, loop);
2580 for (i = 0; i < get_loop_n_elements(loop); i++) {
2581 loop_element le = get_loop_element(loop, i);
2582 if (*(le.kind) == k_ir_loop) {
2583 if (flags & ir_dump_flag_loops)
2584 dump_loop_son_edge(F, loop, son_number++);
2586 collect_nodeloop(F, le.son, loopnodes);
2588 if (flags & ir_dump_flag_loops)
2589 dump_loop_node_edge(F, loop, node_number++);
2590 eset_insert(loopnodes, le.node);
2595 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2601 for (i = 0; i < get_loop_n_elements(loop); i++) {
2602 loop_element le = get_loop_element(loop, i);
2603 if (*(le.kind) == k_ir_loop) {
2605 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2607 if (is_Block(le.node)) start = 0; else start = -1;
2608 for (j = start; j < get_irn_arity(le.node); j++) {
2609 ir_node *pred = get_irn_n(le.node, j);
2610 if (!eset_contains(loopnodes, pred)) {
2611 eset_insert(extnodes, pred);
2612 if (!is_Block(pred)) {
2613 pred = get_nodes_block(pred);
2614 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2622 void dump_loop(FILE *F, ir_loop *l)
2624 eset *loopnodes = eset_create();
2625 eset *extnodes = eset_create();
2629 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2630 dump_vcg_header(F, name, NULL, NULL);
2632 /* collect all nodes to dump */
2633 collect_nodeloop(F, l, loopnodes);
2634 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2636 /* build block lists */
2637 eset_foreach(loopnodes, ir_node*, n) {
2638 set_irn_link(n, NULL);
2640 eset_foreach(extnodes, ir_node*, n) {
2641 set_irn_link(n, NULL);
2643 eset_foreach(loopnodes, ir_node*, n) {
2645 b = get_nodes_block(n);
2646 set_irn_link(n, get_irn_link(b));
2650 eset_foreach(extnodes, ir_node*, n) {
2652 b = get_nodes_block(n);
2653 set_irn_link(n, get_irn_link(b));
2658 eset_foreach(loopnodes, ir_node*, b) {
2660 fprintf(F, "graph: { title: \"");
2662 fprintf(F, "\" label: \"");
2663 dump_node_opcode(F, b);
2664 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2665 fprintf(F, "\" status:clustered color:yellow\n");
2667 /* dump the blocks edges */
2668 dump_ir_data_edges(F, b);
2670 /* dump the nodes that go into the block */
2671 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2672 if (eset_contains(extnodes, n))
2673 overrule_nodecolor = ird_color_block_inout;
2675 overrule_nodecolor = ird_color_default_node;
2676 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2679 /* Close the vcg information for the block */
2681 dump_const_node_local(F, b);
2685 eset_foreach(extnodes, ir_node*, b) {
2687 fprintf(F, "graph: { title: \"");
2689 fprintf(F, "\" label: \"");
2690 dump_node_opcode(F, b);
2691 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2692 fprintf(F, "\" status:clustered color:lightblue\n");
2694 /* dump the nodes that go into the block */
2695 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2696 if (!eset_contains(loopnodes, n))
2697 overrule_nodecolor = ird_color_block_inout;
2699 overrule_nodecolor = ird_color_default_node;
2700 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2703 /* Close the vcg information for the block */
2705 dump_const_node_local(F, b);
2709 eset_destroy(loopnodes);
2710 eset_destroy(extnodes);
2715 static bool obstack_init;
2716 static struct obstack obst;
2717 static char *dump_path;
2719 void ir_set_dump_path(const char *path)
2722 dump_path = xstrdup(path);
2725 static void add_string_escaped(const char *string)
2728 for (p = string; *p != '\0'; ++p) {
2731 obstack_1grow(&obst, '@');
2732 obstack_1grow(&obst, '1');
2733 } else if (c == '@') {
2734 obstack_1grow(&obst, '@');
2735 obstack_1grow(&obst, '2');
2737 obstack_1grow(&obst, c);
2742 static void add_dump_path(void)
2744 if (!obstack_init) {
2745 obstack_init(&obst);
2746 obstack_init = true;
2749 if (dump_path != NULL) {
2750 size_t len = strlen(dump_path);
2751 obstack_grow(&obst, dump_path, len);
2752 if (len > 0 && dump_path[len-1] != '/')
2753 obstack_1grow(&obst, '/');
2757 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2760 const char *dump_name = get_irg_dump_name(graph);
2764 if (!ir_should_dump(dump_name))
2769 add_string_escaped(dump_name);
2770 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2772 if (suffix != NULL) {
2773 if (suffix[0] != '.')
2774 obstack_1grow(&obst, '-');
2775 add_string_escaped(suffix);
2777 obstack_1grow(&obst, '\0');
2779 file_name = (char*)obstack_finish(&obst);
2780 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2781 out = fopen(file_name, "wb");
2782 obstack_free(&obst, file_name);
2785 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2793 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2800 obstack_printf(&obst, "%02u", irp->dump_nr++);
2801 if (suffix != NULL) {
2802 if (suffix[0] != '.')
2803 obstack_1grow(&obst, '-');
2804 add_string_escaped(suffix);
2806 obstack_1grow(&obst, '\0');
2808 file_name = (char*)obstack_finish(&obst);
2809 out = fopen(file_name, "wb");
2810 obstack_free(&obst, file_name);
2813 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2820 void dump_ir_graph(ir_graph *graph, const char *suffix)
2824 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2825 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2828 void dump_all_ir_graphs(const char *suffix)
2830 size_t i, n_irgs = get_irp_n_irgs();
2832 for (i = 0; i < n_irgs; ++i) {
2833 ir_graph *irg = get_irp_irg(i);
2834 dump_ir_graph(irg, suffix);
2838 typedef struct pass_t {
2839 ir_prog_pass_t pass;
2844 * Wrapper around dump_all_ir_graphs().
2846 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2848 pass_t *pass = (pass_t*)context;
2851 dump_all_ir_graphs(pass->suffix);
2855 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2857 size_t len = strlen(suffix) + 1;
2858 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2859 ir_prog_pass_t *res = def_prog_pass_constructor(
2860 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2862 /* this pass does not change anything, so neither dump nor verify is needed. */
2863 res->dump_irprog = ir_prog_no_dump;
2864 res->verify_irprog = ir_prog_no_verify;
2866 memcpy(pass->suffix, suffix, len);