2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt,
38 #include "irgraph_t.h"
52 #include "callgraph.h"
53 #include "irextbb_t.h"
55 #include "dbginfo_t.h"
69 /** Dump only irgs with names that start with this prefix. */
70 static ident *dump_file_filter_id = NULL;
72 static ir_dump_flags_t flags =
73 ir_dump_flag_blocks_as_subgraphs |
74 ir_dump_flag_keepalive_edges |
75 ir_dump_flag_ld_names |
76 ir_dump_flag_back_edges |
77 ir_dump_flag_consts_local |
78 ir_dump_flag_analysed_types |
79 ir_dump_flag_entities_in_hierarchy |
80 ir_dump_flag_number_label;
82 static ird_color_t overrule_nodecolor = ird_color_default_node;
84 /** The vcg node attribute hook. */
85 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
86 /** The vcg edge attribute hook. */
87 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
88 /** The vcg dump block edge hook */
89 static dump_node_edge_func dump_block_edge_hook = NULL;
90 /** The vcg dump node edge hook. */
91 static dump_node_edge_func dump_node_edge_hook = NULL;
93 void set_dump_node_edge_hook(dump_node_edge_func func)
95 dump_node_edge_hook = func;
98 dump_node_edge_func get_dump_node_edge_hook(void)
100 return dump_node_edge_hook;
103 void set_dump_block_edge_hook(dump_node_edge_func func)
105 dump_block_edge_hook = func;
108 dump_node_edge_func get_dump_block_edge_hook(void)
110 return dump_node_edge_hook;
113 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
115 dump_node_vcgattr_hook = hook;
118 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
120 dump_edge_vcgattr_hook = hook;
123 void ir_set_dump_flags(ir_dump_flags_t new_flags)
128 void ir_add_dump_flags(ir_dump_flags_t new_flags)
133 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
138 ir_dump_flags_t ir_get_dump_flags(void)
143 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
144 * are set, else returns dump_const_local_flag.
146 static bool get_opt_dump_const_local(void)
148 return (flags & ir_dump_flag_out_edges)
149 || (flags & ir_dump_flag_loops)
150 || (flags & ir_dump_flag_consts_local)
151 || (flags & ir_dump_flag_iredges);
154 static char *dump_filter;
156 void ir_set_dump_filter(const char *new_filter)
159 dump_filter = xstrdup(new_filter);
162 const char *ir_get_dump_filter(void)
167 int ir_should_dump(const char *name)
171 if (dump_filter == NULL || dump_filter[0] == '\0')
174 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
182 /* -------------- some extended helper functions ----------------- */
184 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
187 return get_mode_name(mode);
193 #define CUSTOM_COLOR_BASE 100
194 static const char *color_names[ird_color_count];
195 static const char *color_rgb[ird_color_count];
196 static struct obstack color_obst;
198 /** define a custom color. */
199 static void custom_color(int num, const char *rgb_def)
201 assert(num < ird_color_count);
202 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
203 obstack_1grow(&color_obst, '\0');
205 color_rgb[num] = rgb_def;
206 color_names[num] = (const char*)obstack_finish(&color_obst);
209 /** Define a named color. */
210 static void named_color(int num, const char *name)
212 assert(num < ird_color_count);
213 color_rgb[num] = NULL;
214 color_names[num] = name;
217 /** Initializes the used colors. */
218 static void init_colors(void)
220 static int initialized = 0;
224 obstack_init(&color_obst);
226 custom_color(ird_color_prog_background, "204 204 204");
227 custom_color(ird_color_block_background, "255 255 0");
228 custom_color(ird_color_dead_block_background, "190 150 150");
229 named_color(ird_color_block_inout, "lightblue");
230 named_color(ird_color_default_node, "white");
231 custom_color(ird_color_memory, "153 153 255");
232 custom_color(ird_color_controlflow, "255 153 153");
233 custom_color(ird_color_const, "204 255 255");
234 custom_color(ird_color_proj, "255 255 153");
235 custom_color(ird_color_uses_memory, "153 153 255");
236 custom_color(ird_color_phi, "105 255 105");
237 custom_color(ird_color_anchor, "100 100 255");
238 named_color(ird_color_error, "red");
239 custom_color(ird_color_entity, "204 204 255");
245 * Prints the VCG color to a file.
247 static void print_vcg_color(FILE *out, ird_color_t color)
249 assert(color < ird_color_count);
250 fprintf(out, "color:%s", color_names[color]);
254 * Prints the edge kind of a given IR node.
256 * Projs should be dumped near their predecessor, so they get "nearedge".
258 static void print_node_edge_kind(FILE *out, ir_node *node)
261 fprintf(out, "nearedge: ");
263 fprintf(out, "edge: ");
268 * Prints the edge from a type S to a type T with additional info fmt, ...
271 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
276 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
277 fprintf(F, " targetname: "); PRINT_TYPEID(T);
278 ir_vfprintf(F, fmt, ap);
284 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
287 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
292 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
293 fprintf(F, " targetname: \""); PRINT_ENTID(ent); fprintf(F, "\"");
294 ir_vfprintf(F, fmt, ap);
300 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
303 static void print_ent_ent_edge(FILE *F, const ir_entity *ent1, const ir_entity *ent2, int backedge, ird_color_t color, const char *fmt, ...)
309 fprintf(F, "backedge: { sourcename: \"");
311 fprintf(F, "edge: { sourcename: \"");
313 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent2); fprintf(F, "\"");
314 ir_vfprintf(F, fmt, ap);
316 if (color != ird_color_none)
317 print_vcg_color(F, color);
323 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
326 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
331 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
332 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
333 ir_vfprintf(F, fmt, ap);
339 * Prints the edge from a node irn to a type tp with additional info fmt, ...
342 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
347 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
348 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
349 ir_vfprintf(F, fmt, ap);
355 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
358 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
363 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
364 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent);
366 ir_vfprintf(F, fmt, ap);
372 * Prints the edge from an entity ent to a node irn with additional info fmt, ...
375 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
380 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
381 fprintf(F, "\" targetname: \""); PRINT_NODEID(irn); fprintf(F, "\"");
382 ir_vfprintf(F, fmt, ap);
388 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
391 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
396 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
397 fprintf(F, " targetname: \""); PRINT_ITEMID(tp, item); fprintf(F, "\" ");
398 ir_vfprintf(F, fmt, ap);
403 /*-----------------------------------------------------------------*/
404 /* global and ahead declarations */
405 /*-----------------------------------------------------------------*/
407 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
409 /*-----------------------------------------------------------------*/
410 /* Helper functions. */
411 /*-----------------------------------------------------------------*/
414 * This map is used as a private link attr to be able to call dumper
415 * anywhere without destroying link fields.
417 static pmap *irdump_link_map = NULL;
419 /** NOT A STANDARD LIBFIRM INIT METHOD
421 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
422 * are off, we want to have as few interferences as possible. Therefore the
423 * initialization is performed lazily and not called from within init_firm.
425 * Creates the link attribute map. */
426 static void init_irdump(void)
428 /* We need a new, empty map. */
429 if (irdump_link_map) pmap_destroy(irdump_link_map);
430 irdump_link_map = pmap_create();
431 if (!dump_file_filter_id)
432 dump_file_filter_id = new_id_from_str("");
436 * Returns the private link field.
438 static void *ird_get_irn_link(const ir_node *n)
441 if (irdump_link_map == NULL)
444 if (pmap_contains(irdump_link_map, n))
445 res = pmap_get(irdump_link_map, n);
450 * Sets the private link field.
452 static void ird_set_irn_link(const ir_node *n, void *x)
454 if (irdump_link_map == NULL)
456 pmap_insert(irdump_link_map, n, x);
460 * Gets the private link field of an irg.
462 static void *ird_get_irg_link(const ir_graph *irg)
465 if (irdump_link_map == NULL)
468 if (pmap_contains(irdump_link_map, irg))
469 res = pmap_get(irdump_link_map, irg);
474 * Sets the private link field of an irg.
476 static void ird_set_irg_link(const ir_graph *irg, void *x)
478 if (irdump_link_map == NULL)
480 pmap_insert(irdump_link_map, irg, x);
484 * Walker, clears the private link field.
486 static void clear_link(ir_node *node, void *env)
489 ird_set_irn_link(node, NULL);
493 * If the entity has a ld_name, returns it if the dump_ld_name is set,
494 * else returns the name of the entity.
496 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
499 return "<NULL entity>";
501 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
502 if (ent->ld_name != NULL)
503 return get_id_str(ent->ld_name);
505 return get_id_str(ent->name);
508 const char *get_ent_dump_name(const ir_entity *ent)
510 return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
513 const char *get_irg_dump_name(const ir_graph *irg)
515 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
516 return _get_ent_dump_name(get_irg_entity(irg), true);
520 * Returns non-zero if a node is in floating state.
522 static int node_floats(const ir_node *n)
524 return ((get_irn_pinned(n) == op_pin_state_floats) &&
525 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
529 * Walker that visits the anchors
531 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
533 if ((flags & ir_dump_flag_all_anchors)
534 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
535 irg_walk_anchors(irg, pre, post, env);
537 irg_walk_graph(irg, pre, post, env);
542 * Walker, allocates an array for all blocks and puts their non-floating
543 * nodes into this array.
545 static void collect_node(ir_node *node, void *env)
550 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
551 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
552 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
553 ARR_APP1(ir_node *, arr, node);
554 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
556 ir_node * block = get_nodes_block(node);
559 /* this node is in a Bad block, so we must place it into the graph's list */
560 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
561 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
562 ARR_APP1(ir_node *, arr, node);
563 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
565 ird_set_irn_link(node, ird_get_irn_link(block));
566 ird_set_irn_link(block, node);
571 /** Construct lists to walk ir block-wise.
573 * Collects all blocks, nodes not op_pin_state_pinned,
574 * Bad, NoMem and Unknown into a flexible array in link field of
575 * irg they belong to. Sets the irg link field to NULL in all
576 * graphs not visited.
577 * Free the list with DEL_ARR_F().
579 static ir_node **construct_block_lists(ir_graph *irg)
582 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
583 ir_graph *rem = current_ir_graph;
585 current_ir_graph = irg;
588 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
591 for (i = get_irp_n_irgs(); i > 0;)
592 ird_set_irg_link(get_irp_irg(--i), NULL);
594 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
597 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
600 current_ir_graph = rem;
601 return (ir_node**)ird_get_irg_link(irg);
604 typedef struct list_tuple {
606 ir_extblk **extbb_list;
609 /** Construct lists to walk IR extended block-wise.
610 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
611 * NULL in all graphs not visited.
613 static list_tuple *construct_extblock_lists(ir_graph *irg)
615 ir_node **blk_list = construct_block_lists(irg);
617 ir_graph *rem = current_ir_graph;
618 list_tuple *lists = XMALLOC(list_tuple);
620 current_ir_graph = irg;
622 lists->blk_list = NEW_ARR_F(ir_node *, 0);
623 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
625 inc_irg_block_visited(irg);
626 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
629 if (is_Block(blk_list[i])) {
630 ext = get_Block_extbb(blk_list[i]);
632 if (extbb_not_visited(ext)) {
633 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
634 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 void dump_node_opcode(FILE *F, ir_node *n)
648 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
650 /* call the dump_node operation if available */
651 if (ops->dump_node) {
652 ops->dump_node(F, n, dump_node_opcode_txt);
656 /* implementation for default nodes */
657 switch (get_irn_opcode(n)) {
659 switch (get_SymConst_kind(n)) {
660 case symconst_addr_ent:
661 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
663 case symconst_ofs_ent:
664 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
666 case symconst_type_tag:
667 ir_fprintf(F, "SymC %+F tag", get_SymConst_type(n));
669 case symconst_type_size:
670 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
672 case symconst_type_align:
673 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
675 case symconst_enum_const:
676 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
682 ir_node *pred = get_Proj_pred(n);
684 if (get_irn_opcode(pred) == iro_Cond
685 && get_Proj_proj(n) == get_Cond_default_proj(pred)
686 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
687 fprintf(F, "defProj");
693 if (get_Load_unaligned(n) == align_non_aligned)
695 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
698 if (get_Store_unaligned(n) == align_non_aligned)
700 fprintf(F, "%s", get_irn_opname(n));
703 if (n == get_irg_start_block(get_irn_irg(n)))
705 if (n == get_irg_end_block(get_irn_irg(n)))
707 fprintf(F, "%s%s", get_irn_opname(n),
708 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
711 if (get_Conv_strict(n))
712 fprintf(F, "strict");
713 fprintf(F, "%s", get_irn_opname(n));
716 fprintf(F, "%s", get_irn_opname(n));
717 if (get_Div_no_remainder(n))
719 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
722 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
725 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
730 fprintf(F, "%s", get_irn_opname(n));
735 * Dump the mode of a node n to a file F.
736 * Ignore modes that are "always known".
738 static void dump_node_mode(FILE *F, ir_node *n)
740 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
744 /* call the dump_node operation if available */
745 if (ops->dump_node) {
746 ops->dump_node(F, n, dump_node_mode_txt);
750 /* default implementation */
751 iro = get_irn_opcode(n);
763 mode = get_irn_mode(n);
765 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
766 (mode != mode_T || iro == iro_Proj))
767 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
772 * Dump the type of a node n to a file F if it's known.
774 static int dump_node_typeinfo(FILE *F, ir_node *n)
778 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
779 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
780 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
781 ir_type *tp = get_irn_typeinfo_type(n);
782 if (tp != firm_none_type) {
783 ir_fprintf(F, "[%+F]", tp);
792 typedef struct pns_lookup {
793 long nr; /**< the proj number */
794 const char *name; /**< the name of the Proj */
797 typedef struct proj_lookup {
798 unsigned code; /**< the opcode of the Proj predecessor */
799 unsigned num_data; /**< number of data entries */
800 const pns_lookup_t *data; /**< the data */
803 /** the lookup table for Proj(Start) names */
804 static const pns_lookup_t start_lut[] = {
805 #define X(a) { pn_Start_##a, #a }
813 /** the lookup table for Proj(Cond) names */
814 static const pns_lookup_t cond_lut[] = {
815 #define X(a) { pn_Cond_##a, #a }
821 /** the lookup table for Proj(Call) names */
822 static const pns_lookup_t call_lut[] = {
823 #define X(a) { pn_Call_##a, #a }
831 /** the lookup table for Proj(Div) names */
832 static const pns_lookup_t div_lut[] = {
833 #define X(a) { pn_Div_##a, #a }
841 /** the lookup table for Proj(Mod) names */
842 static const pns_lookup_t mod_lut[] = {
843 #define X(a) { pn_Mod_##a, #a }
851 /** the lookup table for Proj(Load) names */
852 static const pns_lookup_t load_lut[] = {
853 #define X(a) { pn_Load_##a, #a }
861 /** the lookup table for Proj(Store) names */
862 static const pns_lookup_t store_lut[] = {
863 #define X(a) { pn_Store_##a, #a }
870 /** the lookup table for Proj(Alloc) names */
871 static const pns_lookup_t alloc_lut[] = {
872 #define X(a) { pn_Alloc_##a, #a }
880 /** the lookup table for Proj(CopyB) names */
881 static const pns_lookup_t copyb_lut[] = {
882 #define X(a) { pn_CopyB_##a, #a }
889 /** the lookup table for Proj(InstOf) names */
890 static const pns_lookup_t instof_lut[] = {
891 #define X(a) { pn_InstOf_##a, #a }
899 /** the lookup table for Proj(Raise) names */
900 static const pns_lookup_t raise_lut[] = {
901 #define X(a) { pn_Raise_##a, #a }
907 /** the lookup table for Proj(Bound) names */
908 static const pns_lookup_t bound_lut[] = {
909 #define X(a) { pn_Bound_##a, #a }
917 /** the Proj lookup table */
918 static const proj_lookup_t proj_lut[] = {
919 #define E(a) ARRAY_SIZE(a), a
920 { iro_Start, E(start_lut) },
921 { iro_Cond, E(cond_lut) },
922 { iro_Call, E(call_lut) },
923 { iro_Div, E(div_lut) },
924 { iro_Mod, E(mod_lut) },
925 { iro_Load, E(load_lut) },
926 { iro_Store, E(store_lut) },
927 { iro_Alloc, E(alloc_lut) },
928 { iro_CopyB, E(copyb_lut) },
929 { iro_InstOf, E(instof_lut) },
930 { iro_Raise, E(raise_lut) },
931 { iro_Bound, E(bound_lut) }
936 * Dump additional node attributes of some nodes to a file F.
938 static void dump_node_nodeattr(FILE *F, ir_node *n)
943 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
945 /* call the dump_node operation if available */
946 if (ops->dump_node) {
947 ops->dump_node(F, n, dump_node_nodeattr_txt);
951 switch (get_irn_opcode(n)) {
953 ir_fprintf(F, "%T ", get_Const_tarval(n));
957 pred = get_Proj_pred(n);
958 proj_nr = get_Proj_proj(n);
959 code = get_irn_opcode(pred);
961 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
962 fprintf(F, "Arg %ld ", proj_nr);
963 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
964 fprintf(F, "%ld ", proj_nr);
966 unsigned i, j, f = 0;
968 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
969 if (code == proj_lut[i].code) {
970 for (j = 0; j < proj_lut[i].num_data; ++j) {
971 if (proj_nr == proj_lut[i].data[j].nr) {
972 fprintf(F, "%s ", proj_lut[i].data[j].name);
981 fprintf(F, "%ld ", proj_nr);
982 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
983 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
985 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
991 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
994 ir_fprintf(F, "(%+F)", get_Cast_type(n));
997 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
1000 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
1003 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
1011 static void dump_node_ana_vals(FILE *F, ir_node *n)
1018 void dump_node_label(FILE *F, ir_node *n)
1020 dump_node_opcode(F, n);
1022 dump_node_mode(F, n);
1024 dump_node_typeinfo(F, n);
1025 dump_node_nodeattr(F, n);
1026 if (flags & ir_dump_flag_number_label) {
1027 fprintf(F, "%ld", get_irn_node_nr(n));
1029 if (flags & ir_dump_flag_idx_label) {
1030 fprintf(F, ":%u", get_irn_idx(n));
1035 * Dumps the attributes of a node n into the file F.
1036 * Currently this is only the color of a node.
1038 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1044 print_vcg_color(F, ird_color_error);
1048 if (dump_node_vcgattr_hook != NULL) {
1049 dump_node_vcgattr_hook(F, node, local);
1053 n = local ? local : node;
1055 if (overrule_nodecolor != ird_color_default_node) {
1056 print_vcg_color(F, overrule_nodecolor);
1060 mode = get_irn_mode(n);
1061 if (mode == mode_M) {
1062 print_vcg_color(F, ird_color_memory);
1065 if (mode == mode_X) {
1066 print_vcg_color(F, ird_color_controlflow);
1070 switch (get_irn_opcode(n)) {
1073 print_vcg_color(F, ird_color_anchor);
1076 print_vcg_color(F, ird_color_error);
1079 print_vcg_color(F, ird_color_block_background);
1082 print_vcg_color(F, ird_color_phi);
1085 print_vcg_color(F, ird_color_memory);
1089 print_vcg_color(F, ird_color_const);
1092 print_vcg_color(F, ird_color_proj);
1095 ir_op *op = get_irn_op(node);
1097 if (is_op_constlike(op)) {
1098 print_vcg_color(F, ird_color_const);
1099 } else if (is_op_uses_memory(op)) {
1100 print_vcg_color(F, ird_color_uses_memory);
1101 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1102 print_vcg_color(F, ird_color_controlflow);
1108 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1110 hook_entry_t *info = XMALLOCZ(hook_entry_t);
1112 info->hook._hook_node_info = cb;
1113 info->context = data;
1114 register_hook(hook_node_info, info);
1119 void dump_remove_node_info_callback(void *handle)
1121 hook_entry_t *info = (hook_entry_t*)handle;
1122 unregister_hook(hook_node_info, info);
1127 * Dump the node information of a node n to a file F.
1129 static void dump_node_info(FILE *F, ir_node *n)
1131 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1133 fprintf(F, " info1: \"");
1134 dump_irnode_to_file(F, n);
1135 /* call the dump_node operation if available */
1137 ops->dump_node(F, n, dump_node_info_txt);
1139 /* allow additional info to be added */
1140 hook_node_info(F, n);
1144 static int is_constlike_node(const ir_node *node)
1146 const ir_op *op = get_irn_op(node);
1147 return is_op_constlike(op);
1151 /** outputs the predecessors of n, that are constants, local. I.e.,
1152 generates a copy of the constant predecessors for each node called with. */
1153 static void dump_const_node_local(FILE *F, ir_node *n)
1156 if (!get_opt_dump_const_local()) return;
1158 /* Use visited flag to avoid outputting nodes twice.
1159 initialize it first. */
1160 for (i = 0; i < get_irn_arity(n); i++) {
1161 ir_node *con = get_irn_n(n, i);
1162 if (is_constlike_node(con)) {
1163 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1167 for (i = 0; i < get_irn_arity(n); i++) {
1168 ir_node *con = get_irn_n(n, i);
1169 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1170 /* Generate a new name for the node by appending the names of
1172 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1173 fprintf(F, " label: \"");
1174 dump_node_label(F, con);
1176 dump_node_info(F, con);
1177 dump_node_vcgattr(F, n, con, 0);
1183 /** If the block of an edge is a const_like node, dump it local with an edge */
1184 static void dump_const_block_local(FILE *F, ir_node *n)
1188 if (!get_opt_dump_const_local()) return;
1190 blk = get_nodes_block(n);
1191 if (is_constlike_node(blk)) {
1192 /* Generate a new name for the node by appending the names of
1194 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1195 fprintf(F, "\" label: \"");
1196 dump_node_label(F, blk);
1198 dump_node_info(F, blk);
1199 dump_node_vcgattr(F, n, blk, 0);
1202 fprintf(F, "edge: { sourcename: \"");
1204 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1206 if (dump_edge_vcgattr_hook) {
1208 if (dump_edge_vcgattr_hook(F, n, -1)) {
1212 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1217 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1222 * prints the error message of a node to a file F as info2.
1224 static void print_node_error(FILE *F, const char *err_msg)
1229 fprintf(F, " info2: \"%s\"", err_msg);
1233 * prints debug messages of a node to file F as info3.
1235 static void print_dbg_info(FILE *F, dbg_info *dbg)
1239 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1241 fprintf(F, " info3: \"%s\"\n", buf);
1245 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1255 static void dump_node(FILE *F, ir_node *n)
1260 if (get_opt_dump_const_local() && is_constlike_node(n))
1263 /* dump this node */
1264 fputs("node: {title: \"", F);
1268 fputs(" label: \"", F);
1269 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1270 dump_node_label(F, n);
1271 dump_node_ana_vals(F, n);
1272 //dump_node_ana_info(F, n);
1275 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1276 //fputs(" node_class:23", F);
1279 dump_node_info(F, n);
1280 print_node_error(F, p);
1281 print_dbg_info(F, get_irn_dbg_info(n));
1282 dump_node_vcgattr(F, n, NULL, bad);
1284 dump_const_node_local(F, n);
1286 if (dump_node_edge_hook)
1287 dump_node_edge_hook(F, n);
1290 /** dump the edge to the block this node belongs to */
1291 static void dump_ir_block_edge(FILE *F, ir_node *n)
1293 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1295 ir_node *block = get_nodes_block(n);
1297 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1298 dump_const_block_local(F, n);
1300 fprintf(F, "edge: { sourcename: \"");
1302 fprintf(F, "\" targetname: ");
1303 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1305 if (dump_edge_vcgattr_hook) {
1307 if (dump_edge_vcgattr_hook(F, n, -1)) {
1311 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1316 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1321 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1324 * do not use get_nodes_block() here, will fail
1325 * if the irg is not pinned.
1327 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1328 fprintf(F, INTRA_DATA_EDGE_ATTR);
1330 fprintf(F, INTER_DATA_EDGE_ATTR);
1333 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1336 * do not use get_nodes_block() here, will fail
1337 * if the irg is not pinned.
1339 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1340 fprintf(F, INTRA_MEM_EDGE_ATTR);
1342 fprintf(F, INTER_MEM_EDGE_ATTR);
1345 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1346 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1350 if (dump_edge_vcgattr_hook)
1351 if (dump_edge_vcgattr_hook(F, from, to))
1354 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1355 fprintf(F, BACK_EDGE_ATTR);
1357 switch (get_irn_opcode(from)) {
1359 fprintf(F, CF_EDGE_ATTR);
1361 case iro_Start: break;
1364 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1365 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1367 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1371 if (is_Proj(from)) {
1372 if (get_irn_mode(from) == mode_M)
1373 print_mem_edge_vcgattr(F, from, to);
1374 else if (get_irn_mode(from) == mode_X)
1375 fprintf(F, CF_EDGE_ATTR);
1377 print_data_edge_vcgattr(F, from, to);
1379 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1380 print_mem_edge_vcgattr(F, from, to);
1381 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1382 fprintf(F, CF_EDGE_ATTR);
1384 print_data_edge_vcgattr(F, from, to);
1388 /** dump edges to our inputs */
1389 static void dump_ir_data_edges(FILE *F, ir_node *n)
1393 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1394 /* the End node has only keep-alive edges */
1398 /* dump the dependency edges. */
1399 num = get_irn_deps(n);
1400 for (i = 0; i < num; ++i) {
1401 ir_node *dep = get_irn_dep(n, i);
1404 print_node_edge_kind(F, n);
1405 fprintf(F, "{sourcename: \"");
1407 fprintf(F, "\" targetname: ");
1408 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1409 PRINT_CONSTID(n, dep);
1415 fprintf(F, " label: \"%d\" ", i);
1416 fprintf(F, " color: darkgreen}\n");
1420 num = get_irn_arity(n);
1421 for (i = 0; i < num; i++) {
1422 ir_node *pred = get_irn_n(n, i);
1425 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1426 fprintf(F, "backedge: {sourcename: \"");
1428 print_node_edge_kind(F, n);
1429 fprintf(F, "{sourcename: \"");
1432 fprintf(F, "\" targetname: ");
1433 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1434 PRINT_CONSTID(n, pred);
1436 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1438 fprintf(F, " label: \"%d\" ", i);
1439 print_edge_vcgattr(F, n, i);
1447 static void dump_ir_edges(ir_node *node, void *env)
1450 FILE *F = (FILE*)env;
1451 const ir_edge_t *edge;
1453 foreach_out_edge(node, edge) {
1454 ir_node *succ = get_edge_src_irn(edge);
1456 print_node_edge_kind(F, succ);
1457 fprintf(F, "{sourcename: \"");
1459 fprintf(F, "\" targetname: \"");
1463 fprintf(F, " label: \"%d\" ", i);
1464 fprintf(F, OUT_EDGE_ATTR);
1471 /** Dumps a node and its edges but not the block edge */
1472 static void dump_node_wo_blockedge(ir_node *n, void *env)
1474 FILE *F = (FILE*)env;
1476 dump_ir_data_edges(F, n);
1479 /** Dumps a node and its edges. */
1480 static void dump_node_with_edges(ir_node *n, void *env)
1482 FILE *F = (FILE*)env;
1483 dump_node_wo_blockedge(n, env);
1484 if (!node_floats(n))
1485 dump_ir_block_edge(F, n);
1488 /** Dumps a const-like node. */
1489 static void dump_const_node(ir_node *n, void *env)
1491 if (is_Block(n)) return;
1492 dump_node_wo_blockedge(n, env);
1495 /***********************************************************************/
1496 /* the following routines dump the nodes/irgs bracketed to graphs. */
1497 /***********************************************************************/
1499 /** Dumps a constant expression as entity initializer, array bound ... */
1500 static void dump_const_expression(FILE *F, ir_node *value)
1502 ir_graph *rem = current_ir_graph;
1503 ir_dump_flags_t old_flags = ir_get_dump_flags();
1504 ir_remove_dump_flags(ir_dump_flag_consts_local);
1506 current_ir_graph = get_const_code_irg();
1507 irg_walk(value, dump_const_node, NULL, F);
1508 /* Decrease visited flag so that we walk with the same flag for the next
1509 expression. This guarantees that we don't dump the same node twice,
1510 as for const expressions cse is performed to save memory. */
1511 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1513 ir_set_dump_flags(old_flags);
1514 current_ir_graph = rem;
1517 /** Dump a block as graph containing its nodes.
1519 * Expects to find nodes belonging to the block as list in its
1521 * Dumps the edges of all nodes including itself. */
1522 static void dump_whole_block(FILE *F, ir_node *block)
1525 ird_color_t color = ird_color_block_background;
1527 assert(is_Block(block));
1529 fprintf(F, "graph: { title: \"");
1530 PRINT_NODEID(block);
1531 fprintf(F, "\" label: \"");
1532 dump_node_label(F, block);
1534 /* colorize blocks */
1535 if (! get_Block_matured(block))
1536 color = ird_color_block_background;
1538 fprintf(F, "\" status:clustered ");
1539 print_vcg_color(F, color);
1542 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1543 dump_node_info(F, block);
1544 print_dbg_info(F, get_irn_dbg_info(block));
1546 /* dump the blocks edges */
1547 dump_ir_data_edges(F, block);
1549 if (dump_block_edge_hook)
1550 dump_block_edge_hook(F, block);
1552 /* dump the nodes that go into the block */
1553 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1555 dump_ir_data_edges(F, node);
1558 /* Close the vcg information for the block */
1560 dump_const_node_local(F, block);
1564 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1565 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1566 static void dump_block_graph(FILE *F, ir_graph *irg)
1569 ir_graph *rem = current_ir_graph;
1570 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1571 current_ir_graph = irg;
1573 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1574 ir_node *node = arr[i];
1575 if (is_Block(node)) {
1576 /* Dumps the block and all the nodes in the block, which are to
1577 be found in Block->link. */
1578 dump_whole_block(F, node);
1580 /* Nodes that are not in a Block. */
1582 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1583 dump_const_block_local(F, node);
1585 dump_ir_data_edges(F, node);
1587 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1588 dump_ir_edges(node, F);
1591 if ((flags & ir_dump_flag_loops)
1592 && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1593 dump_loop_nodes_into_graph(F, irg);
1595 current_ir_graph = rem;
1599 * Dump the info for an irg.
1600 * Parsed by XVCG but not shown. use yComp.
1602 static void dump_graph_info(FILE *F, ir_graph *irg)
1604 fprintf(F, "info1: \"");
1605 dump_entity_to_file(F, get_irg_entity(irg));
1608 /* dump graph state */
1609 fprintf(F, "state:");
1610 if (is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP))
1611 fprintf(F, " arch_dep");
1612 if (is_irg_state(irg, IR_GRAPH_STATE_MODEB_LOWERED))
1613 fprintf(F, " modeb_lowered");
1614 if (is_irg_state(irg, IR_GRAPH_STATE_NORMALISATION2))
1615 fprintf(F, " normalisation2");
1616 if (is_irg_state(irg, IR_GRAPH_STATE_IMPLICIT_BITFIELD_MASKING))
1617 fprintf(F, " implicit_bitfield_masking");
1618 if (is_irg_state(irg, IR_GRAPH_STATE_OPTIMIZE_UNREACHABLE_CODE))
1619 fprintf(F, " optimize_unreachable_code");
1620 if (is_irg_state(irg, IR_GRAPH_STATE_NO_CRITICAL_EDGES))
1621 fprintf(F, " no_critical_edges");
1622 if (is_irg_state(irg, IR_GRAPH_STATE_NO_BADS))
1623 fprintf(F, " no_bads");
1624 if (is_irg_state(irg, IR_GRAPH_STATE_NO_UNREACHABLE_CODE))
1625 fprintf(F, " no_unreachable_code");
1626 if (is_irg_state(irg, IR_GRAPH_STATE_ONE_RETURN))
1627 fprintf(F, " one_return");
1628 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE))
1629 fprintf(F, " consistent_dominance");
1630 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE))
1631 fprintf(F, " consistent_postdominance");
1632 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUT_EDGES))
1633 fprintf(F, " consistent_out_edges");
1634 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))
1635 fprintf(F, " consistent_outs");
1636 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1637 fprintf(F, " consistent_loopinfo");
1638 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
1639 fprintf(F, " consistent_entity_usage");
1640 if (is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
1641 fprintf(F, " valid_exended_blocks");
1645 /** Dumps an irg as a graph clustered by block nodes.
1646 * If interprocedural view edges can point to nodes out of this graph.
1648 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1650 ir_entity *ent = get_irg_entity(irg);
1652 fprintf(F, "graph: { title: \"");
1654 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1655 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1657 dump_graph_info(F, irg);
1658 print_dbg_info(F, get_entity_dbg_info(ent));
1660 dump_block_graph(F, irg);
1662 /* Close the vcg information for the irg */
1663 fprintf(F, "}\n\n");
1666 /*******************************************************************/
1667 /* Basic type and entity nodes and edges. */
1668 /*******************************************************************/
1670 /** dumps the edges between nodes and their type or entity attributes. */
1671 static void dump_node2type_edges(ir_node *n, void *env)
1673 FILE *F = (FILE*)env;
1676 switch (get_irn_opcode(n)) {
1678 /* @@@ some consts have an entity */
1681 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1682 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1685 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1688 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1691 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1694 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1697 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1705 static int print_type_info(FILE *F, ir_type *tp)
1709 if (get_type_state(tp) == layout_undefined) {
1710 fprintf(F, "state: layout_undefined\n");
1712 fprintf(F, "state: layout_fixed,\n");
1714 if (get_type_mode(tp))
1715 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1716 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1721 static void print_typespecific_info(FILE *F, ir_type *tp)
1723 switch (get_type_tpop_code(tp)) {
1725 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1730 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1731 fprintf(F, "params: %d\n", get_method_n_params(tp));
1732 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1738 case tpo_enumeration:
1750 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1752 switch (get_type_tpop_code(tp)) {
1754 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1757 fprintf(F, " " TYPE_METH_NODE_ATTR);
1765 case tpo_enumeration:
1776 void dump_type_node(FILE *F, ir_type *tp)
1778 fprintf(F, "node: {title: ");
1780 fprintf(F, " label: \"");
1781 if (tp->dbi != NULL) {
1783 ir_print_type(buf, sizeof(buf), tp);
1784 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1786 ir_fprintf(F, "%+F", tp);
1788 fputs("\" info1: \"", F);
1789 dump_type_to_file(F, tp);
1791 print_type_dbg_info(F, get_type_dbg_info(tp));
1792 print_typespecific_vcgattr(F, tp);
1796 static void dump_entity_node(FILE *F, ir_entity *ent)
1798 fprintf(F, "node: {title: \"");
1799 PRINT_ENTID(ent); fprintf(F, "\"");
1800 fprintf(F, " label: ");
1801 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1803 print_vcg_color(F, ird_color_entity);
1804 fprintf(F, "\n info1: \"");
1806 dump_entity_to_file(F, ent);
1809 print_dbg_info(F, get_entity_dbg_info(ent));
1813 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1816 ir_enum_const *ec = get_enumeration_const(tp, pos);
1817 ident *id = get_enumeration_const_nameid(ec);
1818 ir_tarval *tv = get_enumeration_value(ec);
1821 tarval_snprintf(buf, sizeof(buf), tv);
1823 strncpy(buf, "<not set>", sizeof(buf));
1824 fprintf(F, "node: {title: \"");
1825 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1826 fprintf(F, " label: ");
1827 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1828 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1832 * Dumps a new style initializer.
1834 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1842 * type-walker: Dumps a type or entity and its edges.
1844 static void dump_type_info(type_or_ent tore, void *env)
1846 FILE *F = (FILE*)env;
1847 size_t i = 0; /* to shutup gcc */
1849 /* dump this type or entity */
1851 switch (get_kind(tore.ent)) {
1853 ir_entity *ent = tore.ent;
1856 dump_entity_node(F, ent);
1858 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1859 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1860 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1861 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1862 if (is_Class_type(get_entity_owner(ent))) {
1863 for (i = get_entity_n_overwrites(ent); i > 0;)
1864 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1866 /* attached subgraphs */
1867 if (! (flags & ir_dump_flag_no_entity_values)) {
1868 if (ent->initializer != NULL) {
1869 /* new style initializers */
1870 dump_entity_initializer(F, ent);
1871 } else if (entity_has_compound_ent_values(ent)) {
1872 /* old style compound entity values */
1873 for (i = get_compound_ent_n_values(ent); i > 0;) {
1874 value = get_compound_ent_value(ent, --i);
1876 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1877 dump_const_expression(F, value);
1878 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1880 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1881 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1882 get_compound_ent_value_member(ent, i), i);
1891 ir_type *tp = tore.typ;
1892 dump_type_node(F, tp);
1893 /* and now the edges */
1894 switch (get_type_tpop_code(tp)) {
1896 for (i = get_class_n_supertypes(tp); i > 0;) {
1898 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1900 for (i = get_class_n_members(tp); i > 0;) {
1902 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1906 for (i = get_struct_n_members(tp); i > 0;) {
1908 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1912 for (i = get_method_n_params(tp); i > 0;) {
1914 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1916 for (i = get_method_n_ress(tp); i > 0;) {
1918 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1922 for (i = get_union_n_members(tp); i > 0;) {
1924 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1928 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1929 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1930 for (i = get_array_n_dimensions(tp); i > 0;) {
1931 ir_node *upper, *lower;
1934 upper = get_array_upper_bound(tp, i);
1935 lower = get_array_lower_bound(tp, i);
1936 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1937 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1938 dump_const_expression(F, upper);
1939 dump_const_expression(F, lower);
1942 case tpo_enumeration:
1943 for (i = get_enumeration_n_enums(tp); i > 0;) {
1945 dump_enum_item(F, tp, i);
1946 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1950 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1957 break; /* case k_type */
1960 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1961 } /* switch kind_or_entity */
1964 /** For dumping class hierarchies.
1965 * Dumps a class type node and a superclass edge.
1967 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1969 FILE *F = (FILE*)ctx;
1970 size_t i = 0; /* to shutup gcc */
1972 /* dump this type or entity */
1973 switch (get_kind(tore.ent)) {
1975 ir_entity *ent = tore.ent;
1976 if (get_entity_owner(ent) == get_glob_type()) break;
1977 if (!is_Method_type(get_entity_type(ent)))
1979 if (flags & ir_dump_flag_entities_in_hierarchy
1980 && is_Class_type(get_entity_owner(ent))) {
1982 dump_entity_node(F, ent);
1984 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1985 for (i = get_entity_n_overwrites(ent); i > 0;) {
1987 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1993 ir_type *tp = tore.typ;
1994 if (tp == get_glob_type())
1996 switch (get_type_tpop_code(tp)) {
1998 dump_type_node(F, tp);
1999 /* and now the edges */
2000 for (i = get_class_n_supertypes(tp); i > 0;) {
2002 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2007 break; /* case k_type */
2010 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2011 } /* switch kind_or_entity */
2014 /*******************************************************************/
2015 /* dump analysis information that is expressed in graph terms. */
2016 /*******************************************************************/
2018 /* dump out edges */
2019 static void dump_out_edge(ir_node *n, void *env)
2021 FILE *F = (FILE*)env;
2023 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2024 ir_node *succ = get_irn_out(n, i);
2026 print_node_edge_kind(F, succ);
2027 fprintf(F, "{sourcename: \"");
2029 fprintf(F, "\" targetname: \"");
2031 fprintf(F, "\" color: red linestyle: dashed");
2036 static void dump_loop_label(FILE *F, ir_loop *loop)
2038 fprintf(F, "loop %u, %lu sons, %lu nodes",
2039 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2040 (unsigned long) get_loop_n_nodes(loop));
2043 static void dump_loop_info(FILE *F, ir_loop *loop)
2045 fprintf(F, " info1: \"");
2046 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2047 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2048 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2053 static void dump_loop_node(FILE *F, ir_loop *loop)
2055 fprintf(F, "node: {title: \"");
2057 fprintf(F, "\" label: \"");
2058 dump_loop_label(F, loop);
2060 dump_loop_info(F, loop);
2064 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2067 fprintf(F, "edge: {sourcename: \"");
2069 fprintf(F, "\" targetname: \"");
2070 PRINT_NODEID(get_loop_node(loop, i));
2071 fprintf(F, "\" color: green");
2075 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2078 fprintf(F, "edge: {sourcename: \"");
2080 fprintf(F, "\" targetname: \"");
2081 PRINT_LOOPID(get_loop_son(loop, i));
2082 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2083 get_loop_element_pos(loop, get_loop_son(loop, i)));
2086 static void dump_loops(FILE *F, ir_loop *loop)
2089 /* dump this loop node */
2090 dump_loop_node(F, loop);
2092 /* dump edges to nodes in loop -- only if it is a real loop */
2093 if (get_loop_depth(loop) != 0) {
2094 for (i = get_loop_n_nodes(loop); i > 0;) {
2096 dump_loop_node_edge(F, loop, i);
2099 for (i = get_loop_n_sons(loop); i > 0;) {
2101 dump_loops(F, get_loop_son(loop, i));
2102 dump_loop_son_edge(F, loop, i);
2106 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2108 ir_loop *loop = get_irg_loop(irg);
2111 ir_graph *rem = current_ir_graph;
2112 current_ir_graph = irg;
2114 dump_loops(F, loop);
2116 current_ir_graph = rem;
2122 * dumps the VCG header
2124 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2128 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2132 if (! layout) layout = "Compilergraph";
2133 if (!orientation) orientation = "bottom_to_top";
2137 "graph: { title: \"ir graph of %s\"\n"
2138 "display_edge_labels: %s\n"
2139 "layoutalgorithm: mindepth //$ \"%s\"\n"
2140 "manhattan_edges: yes\n"
2141 "port_sharing: no\n"
2143 "classname 1: \"intrablock Data\"\n"
2144 "classname 2: \"Block\"\n"
2145 "classname 3: \"Entity type\"\n"
2146 "classname 4: \"Entity owner\"\n"
2147 "classname 5: \"Method Param\"\n"
2148 "classname 6: \"Method Res\"\n"
2149 "classname 7: \"Super\"\n"
2150 "classname 8: \"Union\"\n"
2151 "classname 9: \"Points-to\"\n"
2152 "classname 10: \"Array Element Type\"\n"
2153 "classname 11: \"Overwrites\"\n"
2154 "classname 12: \"Member\"\n"
2155 "classname 13: \"Control Flow\"\n"
2156 "classname 14: \"intrablock Memory\"\n"
2157 "classname 15: \"Dominators\"\n"
2158 "classname 16: \"interblock Data\"\n"
2159 "classname 17: \"interblock Memory\"\n"
2160 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2161 "classname 19: \"Postdominators\"\n"
2162 "classname 20: \"Keep Alive\"\n"
2163 "classname 21: \"Out Edges\"\n"
2164 "classname 22: \"Macro Block Edges\"\n"
2165 //"classname 23: \"NoInput Nodes\"\n"
2166 "infoname 1: \"Attribute\"\n"
2167 "infoname 2: \"Verification errors\"\n"
2168 "infoname 3: \"Debug info\"\n",
2169 name, label, layout, orientation);
2171 for (i = 0; i < ird_color_count; ++i) {
2172 if (color_rgb[i] != NULL) {
2173 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2180 * Dumps the vcg file footer
2182 void dump_vcg_footer(FILE *F)
2189 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2193 construct_block_lists(irg);
2196 * If we are in the interprocedural view, we dump not
2197 * only the requested irg but also all irgs that can be reached
2200 for (i = get_irp_n_irgs(); i > 0;) {
2201 ir_graph *other_irg = get_irp_irg(--i);
2202 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2206 dump_graph_from_list(out, other_irg);
2211 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2212 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2213 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2216 ir_graph *rem = current_ir_graph;
2217 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2218 current_ir_graph = irg;
2220 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2221 ir_extblk *extbb = arr[i];
2222 ir_node *leader = get_extbb_leader(extbb);
2225 fprintf(F, "graph: { title: \"");
2226 PRINT_EXTBBID(leader);
2227 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2228 get_irn_node_nr(leader));
2230 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2231 ir_node *node = extbb->blks[j];
2232 if (is_Block(node)) {
2233 /* Dumps the block and all the nodes in the block, which are to
2234 be found in Block->link. */
2235 dump_whole_block(F, node);
2237 /* Nodes that are not in a Block. */
2239 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2240 dump_const_block_local(F, node);
2242 dump_ir_data_edges(F, node);
2248 if ((flags & ir_dump_flag_loops)
2249 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2250 dump_loop_nodes_into_graph(F, irg);
2252 current_ir_graph = rem;
2256 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2259 ir_entity *ent = get_irg_entity(irg);
2261 if (!is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
2264 construct_extblock_lists(irg);
2266 fprintf(F, "graph: { title: \"");
2268 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2269 get_ent_dump_name(ent));
2271 dump_graph_info(F, irg);
2272 print_dbg_info(F, get_entity_dbg_info(ent));
2274 for (i = get_irp_n_irgs(); i > 0;) {
2275 ir_graph *other_irg = get_irp_irg(--i);
2276 list_tuple *lists = (list_tuple*)ird_get_irg_link(other_irg);
2279 /* dump the extended blocks first */
2280 if (ARR_LEN(lists->extbb_list)) {
2281 ird_set_irg_link(other_irg, lists->extbb_list);
2282 dump_extblock_graph(F, other_irg);
2285 /* we may have blocks without extended blocks, bad for instance */
2286 if (ARR_LEN(lists->blk_list)) {
2287 ird_set_irg_link(other_irg, lists->blk_list);
2288 dump_block_graph(F, other_irg);
2291 DEL_ARR_F(lists->extbb_list);
2292 DEL_ARR_F(lists->blk_list);
2297 /* Close the vcg information for the irg */
2298 fprintf(F, "}\n\n");
2303 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2305 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2308 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2309 if (flags & ir_dump_flag_group_extbb) {
2310 dump_blocks_extbb_grouped(out, irg);
2312 dump_blocks_as_subgraphs(out, irg);
2315 /* dump_node_with_edges must be called in post visiting predecessors */
2316 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2319 /* dump type info */
2320 if (flags & ir_dump_flag_with_typegraph) {
2321 ir_graph *rem = current_ir_graph;
2322 current_ir_graph = irg;
2324 type_walk_irg(irg, dump_type_info, NULL, out);
2325 inc_irg_visited(get_const_code_irg());
2326 /* dump edges from graph to type info */
2327 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2329 current_ir_graph = rem;
2332 /* dump iredges out edges */
2333 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2334 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2337 /* dump the out edges in a separate walk */
2338 if ((flags & ir_dump_flag_out_edges)
2339 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2340 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2343 dump_vcg_footer(out);
2346 static void dump_block_to_cfg(ir_node *block, void *env)
2348 FILE *F = (FILE*)env;
2351 if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2352 dump_node(F, block);
2355 if (is_Block(block)) {
2356 /* This is a block. Dump a node for the block. */
2357 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2358 fprintf(F, "\" label: \"");
2359 if (block == get_irg_start_block(get_irn_irg(block)))
2360 fprintf(F, "Start ");
2361 if (block == get_irg_end_block(get_irn_irg(block)))
2364 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2365 PRINT_NODEID(block);
2367 fprintf(F, "info1:\"");
2369 /* the generic version. */
2370 dump_irnode_to_file(F, block);
2372 fprintf(F, "\""); /* closing quote of info */
2374 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2375 (block == get_irg_end_block(get_irn_irg(block))) )
2376 fprintf(F, " color:blue ");
2380 /* Dump the edges */
2381 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2382 ir_node *pred = get_Block_cfgpred(block, i);
2384 pred = get_nodes_block(pred);
2385 fprintf(F, "edge: { sourcename: \"");
2386 PRINT_NODEID(block);
2387 fprintf(F, "\" targetname: \"");
2389 fprintf(F, "\"}\n");
2392 /* Dump dominator/postdominator edge */
2393 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2394 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2395 ir_node *pred = get_Block_idom(block);
2396 fprintf(F, "edge: { sourcename: \"");
2397 PRINT_NODEID(block);
2398 fprintf(F, "\" targetname: \"");
2400 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2402 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2403 ir_node *pred = get_Block_ipostdom(block);
2404 fprintf(F, "edge: { sourcename: \"");
2405 PRINT_NODEID(block);
2406 fprintf(F, "\" targetname: \"");
2408 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2414 void dump_cfg(FILE *F, ir_graph *irg)
2416 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2418 /* walk over the blocks in the graph */
2419 irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2424 void dump_callgraph(FILE *F)
2427 ir_dump_flags_t old_flags = ir_get_dump_flags();
2429 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2430 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2432 for (i = get_irp_n_irgs(); i > 0;) {
2433 ir_graph *irg = get_irp_irg(--i);
2434 ir_entity *ent = get_irg_entity(irg);
2435 size_t j, n_callees = get_irg_n_callees(irg);
2437 dump_entity_node(F, ent);
2438 for (j = 0; j < n_callees; ++j) {
2439 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2440 int be = is_irg_callee_backedge(irg, j);
2441 const char *attr = be
2442 ? "label:\"recursion %zu\""
2443 : "label:\"calls %zu\"";
2444 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2445 get_irg_callee_loop_depth(irg, j));
2449 ir_set_dump_flags(old_flags);
2453 void dump_typegraph(FILE *out)
2455 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2456 type_walk(dump_type_info, NULL, out);
2457 dump_vcg_footer(out);
2460 void dump_class_hierarchy(FILE *out)
2462 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2463 type_walk(dump_class_hierarchy_node, NULL, out);
2464 dump_vcg_footer(out);
2467 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2470 bool loop_node_started = false;
2472 size_t son_number = 0;
2474 ir_loop *son = NULL;
2476 /* Dump a new loop node. */
2477 dump_loop_node(F, loop);
2479 /* Dump the loop elements. */
2480 for (i = 0; i < get_loop_n_elements(loop); i++) {
2481 le = get_loop_element(loop, i);
2483 if (get_kind(son) == k_ir_loop) {
2485 /* We are a loop son -> Recurse */
2487 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2488 fprintf(F, "\" }\n");
2489 fprintf(F, "edge: {sourcename: \"");
2491 fprintf(F, "\" targetname: \"");
2493 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2494 (unsigned long) first,
2495 (unsigned long) first,
2496 (unsigned long) i-1);
2497 loop_node_started = false;
2499 dump_loop_son_edge(F, loop, son_number++);
2500 dump_loops_standalone(F, son);
2501 } else if (get_kind(son) == k_ir_node) {
2502 /* We are a loop node -> Collect firm nodes */
2504 ir_node *n = le.node;
2505 if (!loop_node_started) {
2506 /* Start a new node which contains all firm nodes of the current loop */
2507 fprintf(F, "node: { title: \"");
2509 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2511 loop_node_started = true;
2516 dump_node_label(F, n);
2517 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2518 if (has_backedges(n)) fprintf(F, "\t loop head!");
2519 } else { /* for callgraph loop tree */
2521 assert(get_kind(son) == k_ir_graph);
2523 /* We are a loop node -> Collect firm graphs */
2525 if (!loop_node_started) {
2526 /* Start a new node which contains all firm nodes of the current loop */
2527 fprintf(F, "node: { title: \"");
2529 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2531 loop_node_started = true;
2535 fprintf(F, " %s", get_irg_dump_name(n));
2536 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2540 if (loop_node_started) {
2541 fprintf(F, "\" }\n");
2542 fprintf(F, "edge: {sourcename: \"");
2544 fprintf(F, "\" targetname: \"");
2546 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2547 (unsigned long) first,
2548 (unsigned long) first,
2549 (unsigned long) i-1);
2550 loop_node_started = false;
2554 void dump_loop_tree(FILE *out, ir_graph *irg)
2556 ir_graph *rem = current_ir_graph;
2557 ir_dump_flags_t old_flags = ir_get_dump_flags();
2559 current_ir_graph = irg;
2560 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2562 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2564 if (get_irg_loop(irg))
2565 dump_loops_standalone(out, get_irg_loop(irg));
2567 dump_vcg_footer(out);
2569 ir_set_dump_flags(old_flags);
2570 current_ir_graph = rem;
2573 void dump_callgraph_loop_tree(FILE *out)
2575 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2576 dump_loops_standalone(out, irp->outermost_cg_loop);
2577 dump_vcg_footer(out);
2580 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2584 int node_number = 0;
2586 if (flags & ir_dump_flag_loops)
2587 dump_loop_node(F, loop);
2589 for (i = 0; i < get_loop_n_elements(loop); i++) {
2590 loop_element le = get_loop_element(loop, i);
2591 if (*(le.kind) == k_ir_loop) {
2592 if (flags & ir_dump_flag_loops)
2593 dump_loop_son_edge(F, loop, son_number++);
2595 collect_nodeloop(F, le.son, loopnodes);
2597 if (flags & ir_dump_flag_loops)
2598 dump_loop_node_edge(F, loop, node_number++);
2599 eset_insert(loopnodes, le.node);
2604 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2610 for (i = 0; i < get_loop_n_elements(loop); i++) {
2611 loop_element le = get_loop_element(loop, i);
2612 if (*(le.kind) == k_ir_loop) {
2614 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2616 if (is_Block(le.node)) start = 0; else start = -1;
2617 for (j = start; j < get_irn_arity(le.node); j++) {
2618 ir_node *pred = get_irn_n(le.node, j);
2619 if (!eset_contains(loopnodes, pred)) {
2620 eset_insert(extnodes, pred);
2621 if (!is_Block(pred)) {
2622 pred = get_nodes_block(pred);
2623 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2631 void dump_loop(FILE *F, ir_loop *l)
2633 eset *loopnodes = eset_create();
2634 eset *extnodes = eset_create();
2638 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2639 dump_vcg_header(F, name, NULL, NULL);
2641 /* collect all nodes to dump */
2642 collect_nodeloop(F, l, loopnodes);
2643 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2645 /* build block lists */
2646 eset_foreach(loopnodes, ir_node*, n) {
2647 set_irn_link(n, NULL);
2649 eset_foreach(extnodes, ir_node*, n) {
2650 set_irn_link(n, NULL);
2652 eset_foreach(loopnodes, ir_node*, n) {
2654 b = get_nodes_block(n);
2655 set_irn_link(n, get_irn_link(b));
2659 eset_foreach(extnodes, ir_node*, n) {
2661 b = get_nodes_block(n);
2662 set_irn_link(n, get_irn_link(b));
2667 eset_foreach(loopnodes, ir_node*, b) {
2669 fprintf(F, "graph: { title: \"");
2671 fprintf(F, "\" label: \"");
2672 dump_node_opcode(F, b);
2673 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2674 fprintf(F, "\" status:clustered color:yellow\n");
2676 /* dump the blocks edges */
2677 dump_ir_data_edges(F, b);
2679 /* dump the nodes that go into the block */
2680 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2681 if (eset_contains(extnodes, n))
2682 overrule_nodecolor = ird_color_block_inout;
2684 overrule_nodecolor = ird_color_default_node;
2685 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2688 /* Close the vcg information for the block */
2690 dump_const_node_local(F, b);
2694 eset_foreach(extnodes, ir_node*, b) {
2696 fprintf(F, "graph: { title: \"");
2698 fprintf(F, "\" label: \"");
2699 dump_node_opcode(F, b);
2700 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2701 fprintf(F, "\" status:clustered color:lightblue\n");
2703 /* dump the nodes that go into the block */
2704 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2705 if (!eset_contains(loopnodes, n))
2706 overrule_nodecolor = ird_color_block_inout;
2708 overrule_nodecolor = ird_color_default_node;
2709 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2712 /* Close the vcg information for the block */
2714 dump_const_node_local(F, b);
2718 eset_destroy(loopnodes);
2719 eset_destroy(extnodes);
2724 static bool obstack_init;
2725 static struct obstack obst;
2726 static char *dump_path;
2728 void ir_set_dump_path(const char *path)
2731 dump_path = xstrdup(path);
2734 static void add_string_escaped(const char *string)
2737 for (p = string; *p != '\0'; ++p) {
2740 obstack_1grow(&obst, '@');
2741 obstack_1grow(&obst, '1');
2742 } else if (c == '@') {
2743 obstack_1grow(&obst, '@');
2744 obstack_1grow(&obst, '2');
2746 obstack_1grow(&obst, c);
2751 static void add_dump_path(void)
2753 if (!obstack_init) {
2754 obstack_init(&obst);
2755 obstack_init = true;
2758 if (dump_path != NULL) {
2759 size_t len = strlen(dump_path);
2760 obstack_grow(&obst, dump_path, len);
2761 if (len > 0 && dump_path[len-1] != '/')
2762 obstack_1grow(&obst, '/');
2766 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2769 const char *dump_name = get_irg_dump_name(graph);
2773 if (!ir_should_dump(dump_name))
2778 add_string_escaped(dump_name);
2779 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2781 if (suffix != NULL) {
2782 if (suffix[0] != '.')
2783 obstack_1grow(&obst, '-');
2784 add_string_escaped(suffix);
2786 obstack_1grow(&obst, '\0');
2788 file_name = (char*)obstack_finish(&obst);
2789 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2790 out = fopen(file_name, "wb");
2791 obstack_free(&obst, file_name);
2794 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2802 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2809 obstack_printf(&obst, "%02u", irp->dump_nr++);
2810 if (suffix != NULL) {
2811 if (suffix[0] != '.')
2812 obstack_1grow(&obst, '-');
2813 add_string_escaped(suffix);
2815 obstack_1grow(&obst, '\0');
2817 file_name = (char*)obstack_finish(&obst);
2818 out = fopen(file_name, "wb");
2819 obstack_free(&obst, file_name);
2822 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2829 void dump_ir_graph(ir_graph *graph, const char *suffix)
2833 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2834 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2837 void dump_all_ir_graphs(const char *suffix)
2839 size_t i, n_irgs = get_irp_n_irgs();
2841 for (i = 0; i < n_irgs; ++i) {
2842 ir_graph *irg = get_irp_irg(i);
2843 dump_ir_graph(irg, suffix);
2847 typedef struct pass_t {
2848 ir_prog_pass_t pass;
2853 * Wrapper around dump_all_ir_graphs().
2855 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2857 pass_t *pass = (pass_t*)context;
2860 dump_all_ir_graphs(pass->suffix);
2864 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2866 size_t len = strlen(suffix) + 1;
2867 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2868 ir_prog_pass_t *res = def_prog_pass_constructor(
2869 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2871 /* this pass does not change anything, so neither dump nor verify is needed. */
2872 res->dump_irprog = ir_prog_no_dump;
2873 res->verify_irprog = ir_prog_no_verify;
2875 memcpy(pass->suffix, suffix, len);