2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write vcg representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt,
38 #include "irgraph_t.h"
52 #include "callgraph.h"
53 #include "irextbb_t.h"
55 #include "dbginfo_t.h"
69 /** Dump only irgs with names that start with this prefix. */
70 static ident *dump_file_filter_id = NULL;
72 static ir_dump_flags_t flags =
73 ir_dump_flag_blocks_as_subgraphs |
74 ir_dump_flag_keepalive_edges |
75 ir_dump_flag_ld_names |
76 ir_dump_flag_back_edges |
77 ir_dump_flag_consts_local |
78 ir_dump_flag_analysed_types |
79 ir_dump_flag_entities_in_hierarchy |
80 ir_dump_flag_number_label;
82 static ird_color_t overrule_nodecolor = ird_color_default_node;
84 /** The vcg node attribute hook. */
85 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
86 /** The vcg edge attribute hook. */
87 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
88 /** The vcg dump block edge hook */
89 static dump_node_edge_func dump_block_edge_hook = NULL;
90 /** The vcg dump node edge hook. */
91 static dump_node_edge_func dump_node_edge_hook = NULL;
93 void set_dump_node_edge_hook(dump_node_edge_func func)
95 dump_node_edge_hook = func;
98 dump_node_edge_func get_dump_node_edge_hook(void)
100 return dump_node_edge_hook;
103 void set_dump_block_edge_hook(dump_node_edge_func func)
105 dump_block_edge_hook = func;
108 dump_node_edge_func get_dump_block_edge_hook(void)
110 return dump_node_edge_hook;
113 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
115 dump_node_vcgattr_hook = hook;
118 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
120 dump_edge_vcgattr_hook = hook;
123 void ir_set_dump_flags(ir_dump_flags_t new_flags)
128 void ir_add_dump_flags(ir_dump_flags_t new_flags)
133 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
138 ir_dump_flags_t ir_get_dump_flags(void)
143 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
144 * are set, else returns dump_const_local_flag.
146 static bool get_opt_dump_const_local(void)
148 return (flags & ir_dump_flag_out_edges)
149 || (flags & ir_dump_flag_loops)
150 || (flags & ir_dump_flag_consts_local)
151 || (flags & ir_dump_flag_iredges);
154 static char *dump_filter;
156 void ir_set_dump_filter(const char *new_filter)
159 dump_filter = xstrdup(new_filter);
162 const char *ir_get_dump_filter(void)
167 int ir_should_dump(const char *name)
171 if (dump_filter == NULL || dump_filter[0] == '\0')
174 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
182 /* -------------- some extended helper functions ----------------- */
184 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
187 return get_mode_name(mode);
193 #define CUSTOM_COLOR_BASE 100
194 static const char *color_names[ird_color_count];
195 static const char *color_rgb[ird_color_count];
196 static struct obstack color_obst;
198 /** define a custom color. */
199 static void custom_color(int num, const char *rgb_def)
201 assert(num < ird_color_count);
202 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
203 obstack_1grow(&color_obst, '\0');
205 color_rgb[num] = rgb_def;
206 color_names[num] = (const char*)obstack_finish(&color_obst);
209 /** Define a named color. */
210 static void named_color(int num, const char *name)
212 assert(num < ird_color_count);
213 color_rgb[num] = NULL;
214 color_names[num] = name;
217 /** Initializes the used colors. */
218 static void init_colors(void)
220 static int initialized = 0;
224 obstack_init(&color_obst);
226 custom_color(ird_color_prog_background, "204 204 204");
227 custom_color(ird_color_block_background, "255 255 0");
228 custom_color(ird_color_dead_block_background, "190 150 150");
229 named_color(ird_color_block_inout, "lightblue");
230 named_color(ird_color_default_node, "white");
231 custom_color(ird_color_memory, "153 153 255");
232 custom_color(ird_color_controlflow, "255 153 153");
233 custom_color(ird_color_const, "204 255 255");
234 custom_color(ird_color_proj, "255 255 153");
235 custom_color(ird_color_uses_memory, "153 153 255");
236 custom_color(ird_color_phi, "105 255 105");
237 custom_color(ird_color_anchor, "100 100 255");
238 named_color(ird_color_error, "red");
239 custom_color(ird_color_entity, "204 204 255");
245 * Prints the VCG color to a file.
247 static void print_vcg_color(FILE *out, ird_color_t color)
249 assert(color < ird_color_count);
250 fprintf(out, "color:%s", color_names[color]);
254 * Prints the edge kind of a given IR node.
256 * Projs should be dumped near their predecessor, so they get "nearedge".
258 static void print_node_edge_kind(FILE *out, ir_node *node)
261 fprintf(out, "nearedge: ");
263 fprintf(out, "edge: ");
268 * Prints the edge from a type S to a type T with additional info fmt, ...
271 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
276 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
277 fprintf(F, " targetname: "); PRINT_TYPEID(T);
278 ir_vfprintf(F, fmt, ap);
284 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
287 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
292 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
293 fprintf(F, " targetname: \""); PRINT_ENTID(ent); fprintf(F, "\"");
294 ir_vfprintf(F, fmt, ap);
300 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
303 static void print_ent_ent_edge(FILE *F, const ir_entity *ent1, const ir_entity *ent2, int backedge, ird_color_t color, const char *fmt, ...)
309 fprintf(F, "backedge: { sourcename: \"");
311 fprintf(F, "edge: { sourcename: \"");
313 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent2); fprintf(F, "\"");
314 ir_vfprintf(F, fmt, ap);
316 if (color != ird_color_none)
317 print_vcg_color(F, color);
323 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
326 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
331 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
332 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
333 ir_vfprintf(F, fmt, ap);
339 * Prints the edge from a node irn to a type tp with additional info fmt, ...
342 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
347 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
348 fprintf(F, "\" targetname: "); PRINT_TYPEID(tp);
349 ir_vfprintf(F, fmt, ap);
355 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
358 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
363 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(irn);
364 fprintf(F, "\" targetname: \""); PRINT_ENTID(ent);
366 ir_vfprintf(F, fmt, ap);
372 * Prints the edge from an entity ent to a node irn with additional info fmt, ...
375 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
380 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(ent);
381 fprintf(F, "\" targetname: \""); PRINT_NODEID(irn); fprintf(F, "\"");
382 ir_vfprintf(F, fmt, ap);
388 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
391 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
396 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(tp);
397 fprintf(F, " targetname: \""); PRINT_ITEMID(tp, item); fprintf(F, "\" ");
398 ir_vfprintf(F, fmt, ap);
403 /*-----------------------------------------------------------------*/
404 /* global and ahead declarations */
405 /*-----------------------------------------------------------------*/
407 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
409 /*-----------------------------------------------------------------*/
410 /* Helper functions. */
411 /*-----------------------------------------------------------------*/
414 * This map is used as a private link attr to be able to call dumper
415 * anywhere without destroying link fields.
417 static pmap *irdump_link_map = NULL;
419 /** NOT A STANDARD LIBFIRM INIT METHOD
421 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
422 * are off, we want to have as few interferences as possible. Therefore the
423 * initialization is performed lazily and not called from within init_firm.
425 * Creates the link attribute map. */
426 static void init_irdump(void)
428 /* We need a new, empty map. */
429 if (irdump_link_map) pmap_destroy(irdump_link_map);
430 irdump_link_map = pmap_create();
431 if (!dump_file_filter_id)
432 dump_file_filter_id = new_id_from_str("");
436 * Returns the private link field.
438 static void *ird_get_irn_link(const ir_node *n)
441 if (irdump_link_map == NULL)
444 if (pmap_contains(irdump_link_map, n))
445 res = pmap_get(irdump_link_map, n);
450 * Sets the private link field.
452 static void ird_set_irn_link(const ir_node *n, void *x)
454 if (irdump_link_map == NULL)
456 pmap_insert(irdump_link_map, n, x);
460 * Gets the private link field of an irg.
462 static void *ird_get_irg_link(const ir_graph *irg)
465 if (irdump_link_map == NULL)
468 if (pmap_contains(irdump_link_map, irg))
469 res = pmap_get(irdump_link_map, irg);
474 * Sets the private link field of an irg.
476 static void ird_set_irg_link(const ir_graph *irg, void *x)
478 if (irdump_link_map == NULL)
480 pmap_insert(irdump_link_map, irg, x);
484 * Walker, clears the private link field.
486 static void clear_link(ir_node *node, void *env)
489 ird_set_irn_link(node, NULL);
493 * If the entity has a ld_name, returns it if the dump_ld_name is set,
494 * else returns the name of the entity.
496 static const char *_get_ent_dump_name(const ir_entity *ent, bool dump_ld_name)
499 return "<NULL entity>";
501 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
502 if (ent->ld_name != NULL)
503 return get_id_str(ent->ld_name);
505 return get_id_str(ent->name);
508 const char *get_ent_dump_name(const ir_entity *ent)
510 return _get_ent_dump_name(ent, flags & ir_dump_flag_ld_names);
513 const char *get_irg_dump_name(const ir_graph *irg)
515 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
516 return _get_ent_dump_name(get_irg_entity(irg), true);
520 * Returns non-zero if a node is in floating state.
522 static int node_floats(const ir_node *n)
524 return ((get_irn_pinned(n) == op_pin_state_floats) &&
525 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
529 * Walker that visits the anchors
531 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
533 if ((flags & ir_dump_flag_all_anchors)
534 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
535 irg_walk_anchors(irg, pre, post, env);
537 irg_walk_graph(irg, pre, post, env);
542 * Walker, allocates an array for all blocks and puts their non-floating
543 * nodes into this array.
545 static void collect_node(ir_node *node, void *env)
550 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
551 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
552 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
553 ARR_APP1(ir_node *, arr, node);
554 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
556 ir_node * block = get_nodes_block(node);
559 /* this node is in a Bad block, so we must place it into the graph's list */
560 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
561 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
562 ARR_APP1(ir_node *, arr, node);
563 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
565 ird_set_irn_link(node, ird_get_irn_link(block));
566 ird_set_irn_link(block, node);
571 /** Construct lists to walk ir block-wise.
573 * Collects all blocks, nodes not op_pin_state_pinned,
574 * Bad, NoMem and Unknown into a flexible array in link field of
575 * irg they belong to. Sets the irg link field to NULL in all
576 * graphs not visited.
577 * Free the list with DEL_ARR_F().
579 static ir_node **construct_block_lists(ir_graph *irg)
582 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
583 ir_graph *rem = current_ir_graph;
585 current_ir_graph = irg;
588 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
591 for (i = get_irp_n_irgs(); i > 0;)
592 ird_set_irg_link(get_irp_irg(--i), NULL);
594 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
597 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
600 current_ir_graph = rem;
601 return (ir_node**)ird_get_irg_link(irg);
604 typedef struct list_tuple {
606 ir_extblk **extbb_list;
609 /** Construct lists to walk IR extended block-wise.
610 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
611 * NULL in all graphs not visited.
613 static list_tuple *construct_extblock_lists(ir_graph *irg)
615 ir_node **blk_list = construct_block_lists(irg);
617 ir_graph *rem = current_ir_graph;
618 list_tuple *lists = XMALLOC(list_tuple);
620 current_ir_graph = irg;
622 lists->blk_list = NEW_ARR_F(ir_node *, 0);
623 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
625 inc_irg_block_visited(irg);
626 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
629 if (is_Block(blk_list[i])) {
630 ext = get_Block_extbb(blk_list[i]);
632 if (extbb_not_visited(ext)) {
633 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
634 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 void dump_node_opcode(FILE *F, ir_node *n)
648 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
650 /* call the dump_node operation if available */
651 if (ops->dump_node) {
652 ops->dump_node(F, n, dump_node_opcode_txt);
656 /* implementation for default nodes */
657 switch (get_irn_opcode(n)) {
659 switch (get_SymConst_kind(n)) {
660 case symconst_addr_ent:
661 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
663 case symconst_ofs_ent:
664 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
666 case symconst_type_tag:
667 ir_fprintf(F, "SymC %+F tag", get_SymConst_type(n));
669 case symconst_type_size:
670 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
672 case symconst_type_align:
673 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
675 case symconst_enum_const:
676 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
682 ir_node *pred = get_Proj_pred(n);
684 if (get_irn_opcode(pred) == iro_Cond
685 && get_Proj_proj(n) == get_Cond_default_proj(pred)
686 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
687 fprintf(F, "defProj");
693 if (get_Load_unaligned(n) == align_non_aligned)
695 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
698 if (get_Store_unaligned(n) == align_non_aligned)
700 fprintf(F, "%s", get_irn_opname(n));
703 if (n == get_irg_start_block(get_irn_irg(n)))
705 if (n == get_irg_end_block(get_irn_irg(n)))
707 fprintf(F, "%s%s", get_irn_opname(n),
708 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
711 if (get_Conv_strict(n))
712 fprintf(F, "strict");
713 fprintf(F, "%s", get_irn_opname(n));
716 fprintf(F, "%s", get_irn_opname(n));
717 if (get_Div_no_remainder(n))
719 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
722 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
725 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
730 fprintf(F, "%s", get_irn_opname(n));
735 * Dump the mode of a node n to a file F.
736 * Ignore modes that are "always known".
738 static void dump_node_mode(FILE *F, ir_node *n)
740 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
744 /* call the dump_node operation if available */
745 if (ops->dump_node) {
746 ops->dump_node(F, n, dump_node_mode_txt);
750 /* default implementation */
751 iro = get_irn_opcode(n);
763 mode = get_irn_mode(n);
765 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
766 (mode != mode_T || iro == iro_Proj))
767 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
772 * Dump the type of a node n to a file F if it's known.
774 static int dump_node_typeinfo(FILE *F, ir_node *n)
778 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
779 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
780 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
781 ir_type *tp = get_irn_typeinfo_type(n);
782 if (tp != firm_none_type) {
783 ir_fprintf(F, "[%+F]", tp);
792 typedef struct pns_lookup {
793 long nr; /**< the proj number */
794 const char *name; /**< the name of the Proj */
797 typedef struct proj_lookup {
798 unsigned code; /**< the opcode of the Proj predecessor */
799 unsigned num_data; /**< number of data entries */
800 const pns_lookup_t *data; /**< the data */
803 /** the lookup table for Proj(Start) names */
804 static const pns_lookup_t start_lut[] = {
805 #define X(a) { pn_Start_##a, #a }
813 /** the lookup table for Proj(Cond) names */
814 static const pns_lookup_t cond_lut[] = {
815 #define X(a) { pn_Cond_##a, #a }
821 /** the lookup table for Proj(Call) names */
822 static const pns_lookup_t call_lut[] = {
823 #define X(a) { pn_Call_##a, #a }
831 /** the lookup table for Proj(Div) names */
832 static const pns_lookup_t div_lut[] = {
833 #define X(a) { pn_Div_##a, #a }
841 /** the lookup table for Proj(Mod) names */
842 static const pns_lookup_t mod_lut[] = {
843 #define X(a) { pn_Mod_##a, #a }
851 /** the lookup table for Proj(Load) names */
852 static const pns_lookup_t load_lut[] = {
853 #define X(a) { pn_Load_##a, #a }
861 /** the lookup table for Proj(Store) names */
862 static const pns_lookup_t store_lut[] = {
863 #define X(a) { pn_Store_##a, #a }
870 /** the lookup table for Proj(Alloc) names */
871 static const pns_lookup_t alloc_lut[] = {
872 #define X(a) { pn_Alloc_##a, #a }
880 /** the lookup table for Proj(CopyB) names */
881 static const pns_lookup_t copyb_lut[] = {
882 #define X(a) { pn_CopyB_##a, #a }
889 /** the lookup table for Proj(InstOf) names */
890 static const pns_lookup_t instof_lut[] = {
891 #define X(a) { pn_InstOf_##a, #a }
899 /** the lookup table for Proj(Raise) names */
900 static const pns_lookup_t raise_lut[] = {
901 #define X(a) { pn_Raise_##a, #a }
907 /** the lookup table for Proj(Bound) names */
908 static const pns_lookup_t bound_lut[] = {
909 #define X(a) { pn_Bound_##a, #a }
917 /** the Proj lookup table */
918 static const proj_lookup_t proj_lut[] = {
919 #define E(a) ARRAY_SIZE(a), a
920 { iro_Start, E(start_lut) },
921 { iro_Cond, E(cond_lut) },
922 { iro_Call, E(call_lut) },
923 { iro_Div, E(div_lut) },
924 { iro_Mod, E(mod_lut) },
925 { iro_Load, E(load_lut) },
926 { iro_Store, E(store_lut) },
927 { iro_Alloc, E(alloc_lut) },
928 { iro_CopyB, E(copyb_lut) },
929 { iro_InstOf, E(instof_lut) },
930 { iro_Raise, E(raise_lut) },
931 { iro_Bound, E(bound_lut) }
936 * Dump additional node attributes of some nodes to a file F.
938 static void dump_node_nodeattr(FILE *F, ir_node *n)
943 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
945 /* call the dump_node operation if available */
946 if (ops->dump_node) {
947 ops->dump_node(F, n, dump_node_nodeattr_txt);
951 switch (get_irn_opcode(n)) {
953 ir_fprintf(F, "%T ", get_Const_tarval(n));
957 pred = get_Proj_pred(n);
958 proj_nr = get_Proj_proj(n);
959 code = get_irn_opcode(pred);
961 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
962 fprintf(F, "Arg %ld ", proj_nr);
963 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
964 fprintf(F, "%ld ", proj_nr);
966 unsigned i, j, f = 0;
968 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
969 if (code == proj_lut[i].code) {
970 for (j = 0; j < proj_lut[i].num_data; ++j) {
971 if (proj_nr == proj_lut[i].data[j].nr) {
972 fprintf(F, "%s ", proj_lut[i].data[j].name);
981 fprintf(F, "%ld ", proj_nr);
982 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
983 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
985 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
991 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
994 ir_fprintf(F, "(%+F)", get_Cast_type(n));
997 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
1000 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
1003 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
1012 #include "execution_frequency.h"
1014 static void dump_node_ana_vals(FILE *F, ir_node *n)
1021 void dump_node_label(FILE *F, ir_node *n)
1023 dump_node_opcode(F, n);
1025 dump_node_mode(F, n);
1027 dump_node_typeinfo(F, n);
1028 dump_node_nodeattr(F, n);
1029 if (flags & ir_dump_flag_number_label) {
1030 fprintf(F, "%ld", get_irn_node_nr(n));
1032 if (flags & ir_dump_flag_idx_label) {
1033 fprintf(F, ":%u", get_irn_idx(n));
1037 void dump_vrp_info(FILE *F, ir_node *n)
1039 vrp_attr *vrp = vrp_get_info(n);
1044 fprintf(F, "range_type: %d\n", (int) vrp->range_type);
1045 if (vrp->range_type == VRP_RANGE || vrp->range_type ==
1047 ir_fprintf(F, "range_bottom: %F\n",vrp->range_bottom);
1048 ir_fprintf(F, "range_top: %F\n", vrp->range_top);
1050 ir_fprintf(F, "bits_set: %T\n", vrp->bits_set);
1051 ir_fprintf(F, "bits_not_set: %T\n", vrp->bits_not_set);
1055 * Dumps the attributes of a node n into the file F.
1056 * Currently this is only the color of a node.
1058 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1064 print_vcg_color(F, ird_color_error);
1068 if (dump_node_vcgattr_hook != NULL) {
1069 dump_node_vcgattr_hook(F, node, local);
1073 n = local ? local : node;
1075 if (overrule_nodecolor != ird_color_default_node) {
1076 print_vcg_color(F, overrule_nodecolor);
1080 mode = get_irn_mode(n);
1081 if (mode == mode_M) {
1082 print_vcg_color(F, ird_color_memory);
1085 if (mode == mode_X) {
1086 print_vcg_color(F, ird_color_controlflow);
1090 switch (get_irn_opcode(n)) {
1093 print_vcg_color(F, ird_color_anchor);
1096 print_vcg_color(F, ird_color_error);
1099 print_vcg_color(F, ird_color_block_background);
1102 print_vcg_color(F, ird_color_phi);
1105 print_vcg_color(F, ird_color_memory);
1109 print_vcg_color(F, ird_color_const);
1112 print_vcg_color(F, ird_color_proj);
1115 ir_op *op = get_irn_op(node);
1117 if (is_op_constlike(op)) {
1118 print_vcg_color(F, ird_color_const);
1119 } else if (is_op_uses_memory(op)) {
1120 print_vcg_color(F, ird_color_uses_memory);
1121 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1122 print_vcg_color(F, ird_color_controlflow);
1128 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1130 hook_entry_t *info = XMALLOC(hook_entry_t);
1132 info->hook._hook_node_info = cb;
1133 info->context = data;
1134 register_hook(hook_node_info, info);
1139 void dump_remove_node_info_callback(void *handle)
1141 hook_entry_t *info = (hook_entry_t*)handle;
1142 unregister_hook(hook_node_info, info);
1147 * Dump the node information of a node n to a file F.
1149 static void dump_node_info(FILE *F, ir_node *n)
1151 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1153 fprintf(F, " info1: \"");
1154 dump_irnode_to_file(F, n);
1155 /* call the dump_node operation if available */
1157 ops->dump_node(F, n, dump_node_info_txt);
1159 /* allow additional info to be added */
1160 hook_node_info(F, n);
1164 static int is_constlike_node(const ir_node *node)
1166 const ir_op *op = get_irn_op(node);
1167 return is_op_constlike(op);
1171 /** outputs the predecessors of n, that are constants, local. I.e.,
1172 generates a copy of the constant predecessors for each node called with. */
1173 static void dump_const_node_local(FILE *F, ir_node *n)
1176 if (!get_opt_dump_const_local()) return;
1178 /* Use visited flag to avoid outputting nodes twice.
1179 initialize it first. */
1180 for (i = 0; i < get_irn_arity(n); i++) {
1181 ir_node *con = get_irn_n(n, i);
1182 if (is_constlike_node(con)) {
1183 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1187 for (i = 0; i < get_irn_arity(n); i++) {
1188 ir_node *con = get_irn_n(n, i);
1189 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1190 /* Generate a new name for the node by appending the names of
1192 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1193 fprintf(F, " label: \"");
1194 dump_node_label(F, con);
1196 dump_node_info(F, con);
1197 dump_node_vcgattr(F, n, con, 0);
1203 /** If the block of an edge is a const_like node, dump it local with an edge */
1204 static void dump_const_block_local(FILE *F, ir_node *n)
1208 if (!get_opt_dump_const_local()) return;
1210 blk = get_nodes_block(n);
1211 if (is_constlike_node(blk)) {
1212 /* Generate a new name for the node by appending the names of
1214 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1215 fprintf(F, "\" label: \"");
1216 dump_node_label(F, blk);
1218 dump_node_info(F, blk);
1219 dump_node_vcgattr(F, n, blk, 0);
1222 fprintf(F, "edge: { sourcename: \"");
1224 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1226 if (dump_edge_vcgattr_hook) {
1228 if (dump_edge_vcgattr_hook(F, n, -1)) {
1232 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1237 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1242 * prints the error message of a node to a file F as info2.
1244 static void print_node_error(FILE *F, const char *err_msg)
1249 fprintf(F, " info2: \"%s\"", err_msg);
1253 * prints debug messages of a node to file F as info3.
1255 static void print_dbg_info(FILE *F, dbg_info *dbg)
1259 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1261 fprintf(F, " info3: \"%s\"\n", buf);
1265 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1275 static void dump_node(FILE *F, ir_node *n)
1280 if (get_opt_dump_const_local() && is_constlike_node(n))
1283 /* dump this node */
1284 fputs("node: {title: \"", F);
1288 fputs(" label: \"", F);
1289 bad = ! irn_verify_irg_dump(n, current_ir_graph, &p);
1290 dump_node_label(F, n);
1291 dump_node_ana_vals(F, n);
1292 //dump_node_ana_info(F, n);
1295 if (get_op_flags(get_irn_op(n)) & irop_flag_dump_noinput) {
1296 //fputs(" node_class:23", F);
1299 dump_node_info(F, n);
1300 print_node_error(F, p);
1301 print_dbg_info(F, get_irn_dbg_info(n));
1302 dump_node_vcgattr(F, n, NULL, bad);
1304 dump_const_node_local(F, n);
1306 if (dump_node_edge_hook)
1307 dump_node_edge_hook(F, n);
1310 /** dump the edge to the block this node belongs to */
1311 static void dump_ir_block_edge(FILE *F, ir_node *n)
1313 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1315 ir_node *block = get_nodes_block(n);
1317 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1318 dump_const_block_local(F, n);
1320 fprintf(F, "edge: { sourcename: \"");
1322 fprintf(F, "\" targetname: ");
1323 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1325 if (dump_edge_vcgattr_hook) {
1327 if (dump_edge_vcgattr_hook(F, n, -1)) {
1331 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1336 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1341 static void print_data_edge_vcgattr(FILE *F, ir_node *from, int to)
1344 * do not use get_nodes_block() here, will fail
1345 * if the irg is not pinned.
1347 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1348 fprintf(F, INTRA_DATA_EDGE_ATTR);
1350 fprintf(F, INTER_DATA_EDGE_ATTR);
1353 static void print_mem_edge_vcgattr(FILE *F, ir_node *from, int to)
1356 * do not use get_nodes_block() here, will fail
1357 * if the irg is not pinned.
1359 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1360 fprintf(F, INTRA_MEM_EDGE_ATTR);
1362 fprintf(F, INTER_MEM_EDGE_ATTR);
1365 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1366 static void print_edge_vcgattr(FILE *F, ir_node *from, int to)
1370 if (dump_edge_vcgattr_hook)
1371 if (dump_edge_vcgattr_hook(F, from, to))
1374 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1375 fprintf(F, BACK_EDGE_ATTR);
1377 switch (get_irn_opcode(from)) {
1379 fprintf(F, CF_EDGE_ATTR);
1381 case iro_Start: break;
1384 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1385 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1387 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1391 if (is_Proj(from)) {
1392 if (get_irn_mode(from) == mode_M)
1393 print_mem_edge_vcgattr(F, from, to);
1394 else if (get_irn_mode(from) == mode_X)
1395 fprintf(F, CF_EDGE_ATTR);
1397 print_data_edge_vcgattr(F, from, to);
1399 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1400 print_mem_edge_vcgattr(F, from, to);
1401 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1402 fprintf(F, CF_EDGE_ATTR);
1404 print_data_edge_vcgattr(F, from, to);
1408 /** dump edges to our inputs */
1409 static void dump_ir_data_edges(FILE *F, ir_node *n)
1413 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1414 /* the End node has only keep-alive edges */
1418 /* dump the dependency edges. */
1419 num = get_irn_deps(n);
1420 for (i = 0; i < num; ++i) {
1421 ir_node *dep = get_irn_dep(n, i);
1424 print_node_edge_kind(F, n);
1425 fprintf(F, "{sourcename: \"");
1427 fprintf(F, "\" targetname: ");
1428 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1429 PRINT_CONSTID(n, dep);
1435 fprintf(F, " label: \"%d\" ", i);
1436 fprintf(F, " color: darkgreen}\n");
1440 num = get_irn_arity(n);
1441 for (i = 0; i < num; i++) {
1442 ir_node *pred = get_irn_n(n, i);
1445 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1446 fprintf(F, "backedge: {sourcename: \"");
1448 print_node_edge_kind(F, n);
1449 fprintf(F, "{sourcename: \"");
1452 fprintf(F, "\" targetname: ");
1453 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1454 PRINT_CONSTID(n, pred);
1456 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1458 fprintf(F, " label: \"%d\" ", i);
1459 print_edge_vcgattr(F, n, i);
1467 static void dump_ir_edges(ir_node *node, void *env)
1470 FILE *F = (FILE*)env;
1471 const ir_edge_t *edge;
1473 foreach_out_edge(node, edge) {
1474 ir_node *succ = get_edge_src_irn(edge);
1476 print_node_edge_kind(F, succ);
1477 fprintf(F, "{sourcename: \"");
1479 fprintf(F, "\" targetname: \"");
1483 fprintf(F, " label: \"%d\" ", i);
1484 fprintf(F, OUT_EDGE_ATTR);
1491 /** Dumps a node and its edges but not the block edge */
1492 static void dump_node_wo_blockedge(ir_node *n, void *env)
1494 FILE *F = (FILE*)env;
1496 dump_ir_data_edges(F, n);
1499 /** Dumps a node and its edges. */
1500 static void dump_node_with_edges(ir_node *n, void *env)
1502 FILE *F = (FILE*)env;
1503 dump_node_wo_blockedge(n, env);
1504 if (!node_floats(n))
1505 dump_ir_block_edge(F, n);
1508 /** Dumps a const-like node. */
1509 static void dump_const_node(ir_node *n, void *env)
1511 if (is_Block(n)) return;
1512 dump_node_wo_blockedge(n, env);
1515 /***********************************************************************/
1516 /* the following routines dump the nodes/irgs bracketed to graphs. */
1517 /***********************************************************************/
1519 /** Dumps a constant expression as entity initializer, array bound ... */
1520 static void dump_const_expression(FILE *F, ir_node *value)
1522 ir_graph *rem = current_ir_graph;
1523 ir_dump_flags_t old_flags = ir_get_dump_flags();
1524 ir_remove_dump_flags(ir_dump_flag_consts_local);
1526 current_ir_graph = get_const_code_irg();
1527 irg_walk(value, dump_const_node, NULL, F);
1528 /* Decrease visited flag so that we walk with the same flag for the next
1529 expression. This guarantees that we don't dump the same node twice,
1530 as for const expressions cse is performed to save memory. */
1531 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1533 ir_set_dump_flags(old_flags);
1534 current_ir_graph = rem;
1537 /** Dump a block as graph containing its nodes.
1539 * Expects to find nodes belonging to the block as list in its
1541 * Dumps the edges of all nodes including itself. */
1542 static void dump_whole_block(FILE *F, ir_node *block)
1545 ird_color_t color = ird_color_block_background;
1547 assert(is_Block(block));
1549 fprintf(F, "graph: { title: \"");
1550 PRINT_NODEID(block);
1551 fprintf(F, "\" label: \"");
1552 dump_node_label(F, block);
1554 /* colorize blocks */
1555 if (! get_Block_matured(block))
1556 color = ird_color_block_background;
1558 fprintf(F, "\" status:clustered ");
1559 print_vcg_color(F, color);
1562 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1563 dump_node_info(F, block);
1564 print_dbg_info(F, get_irn_dbg_info(block));
1566 /* dump the blocks edges */
1567 dump_ir_data_edges(F, block);
1569 if (dump_block_edge_hook)
1570 dump_block_edge_hook(F, block);
1572 /* dump the nodes that go into the block */
1573 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1575 dump_ir_data_edges(F, node);
1578 /* Close the vcg information for the block */
1580 dump_const_node_local(F, block);
1584 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1585 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1586 static void dump_block_graph(FILE *F, ir_graph *irg)
1589 ir_graph *rem = current_ir_graph;
1590 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1591 current_ir_graph = irg;
1593 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1594 ir_node *node = arr[i];
1595 if (is_Block(node)) {
1596 /* Dumps the block and all the nodes in the block, which are to
1597 be found in Block->link. */
1598 dump_whole_block(F, node);
1600 /* Nodes that are not in a Block. */
1602 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1603 dump_const_block_local(F, node);
1605 dump_ir_data_edges(F, node);
1607 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1608 dump_ir_edges(node, F);
1611 if ((flags & ir_dump_flag_loops)
1612 && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1613 dump_loop_nodes_into_graph(F, irg);
1615 current_ir_graph = rem;
1619 * Dump the info for an irg.
1620 * Parsed by XVCG but not shown. use yComp.
1622 static void dump_graph_info(FILE *F, ir_graph *irg)
1624 fprintf(F, "info1: \"");
1625 dump_entity_to_file(F, get_irg_entity(irg));
1628 /* dump graph state */
1629 fprintf(F, "state:");
1630 if (is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP))
1631 fprintf(F, " arch_dep");
1632 if (is_irg_state(irg, IR_GRAPH_STATE_MODEB_LOWERED))
1633 fprintf(F, " modeb_lowered");
1634 if (is_irg_state(irg, IR_GRAPH_STATE_NORMALISATION2))
1635 fprintf(F, " normalisation2");
1636 if (is_irg_state(irg, IR_GRAPH_STATE_IMPLICIT_BITFIELD_MASKING))
1637 fprintf(F, " implicit_bitfield_masking");
1638 if (is_irg_state(irg, IR_GRAPH_STATE_OPTIMIZE_UNREACHABLE_CODE))
1639 fprintf(F, " optimize_unreachable_code");
1640 if (is_irg_state(irg, IR_GRAPH_STATE_NO_CRITICAL_EDGES))
1641 fprintf(F, " no_critical_edges");
1642 if (is_irg_state(irg, IR_GRAPH_STATE_NO_BADS))
1643 fprintf(F, " no_bads");
1644 if (is_irg_state(irg, IR_GRAPH_STATE_NO_UNREACHABLE_CODE))
1645 fprintf(F, " no_unreachable_code");
1646 if (is_irg_state(irg, IR_GRAPH_STATE_ONE_RETURN))
1647 fprintf(F, " one_return");
1648 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE))
1649 fprintf(F, " consistent_dominance");
1650 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE))
1651 fprintf(F, " consistent_postdominance");
1652 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUT_EDGES))
1653 fprintf(F, " consistent_out_edges");
1654 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))
1655 fprintf(F, " consistent_outs");
1656 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1657 fprintf(F, " consistent_loopinfo");
1658 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
1659 fprintf(F, " consistent_entity_usage");
1660 if (is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
1661 fprintf(F, " valid_exended_blocks");
1665 /** Dumps an irg as a graph clustered by block nodes.
1666 * If interprocedural view edges can point to nodes out of this graph.
1668 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1670 ir_entity *ent = get_irg_entity(irg);
1672 fprintf(F, "graph: { title: \"");
1674 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1675 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1677 dump_graph_info(F, irg);
1678 print_dbg_info(F, get_entity_dbg_info(ent));
1680 dump_block_graph(F, irg);
1682 /* Close the vcg information for the irg */
1683 fprintf(F, "}\n\n");
1686 /*******************************************************************/
1687 /* Basic type and entity nodes and edges. */
1688 /*******************************************************************/
1690 /** dumps the edges between nodes and their type or entity attributes. */
1691 static void dump_node2type_edges(ir_node *n, void *env)
1693 FILE *F = (FILE*)env;
1696 switch (get_irn_opcode(n)) {
1698 /* @@@ some consts have an entity */
1701 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1702 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1705 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1708 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1711 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1714 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1717 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1725 static int print_type_info(FILE *F, ir_type *tp)
1729 if (get_type_state(tp) == layout_undefined) {
1730 fprintf(F, "state: layout_undefined\n");
1732 fprintf(F, "state: layout_fixed,\n");
1734 if (get_type_mode(tp))
1735 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1736 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1741 static void print_typespecific_info(FILE *F, ir_type *tp)
1743 switch (get_type_tpop_code(tp)) {
1745 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1750 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1751 fprintf(F, "params: %d\n", get_method_n_params(tp));
1752 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1758 case tpo_enumeration:
1770 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1772 switch (get_type_tpop_code(tp)) {
1774 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1777 fprintf(F, " " TYPE_METH_NODE_ATTR);
1785 case tpo_enumeration:
1796 void dump_type_node(FILE *F, ir_type *tp)
1798 fprintf(F, "node: {title: ");
1800 fprintf(F, " label: \"");
1801 if (tp->dbi != NULL) {
1803 ir_print_type(buf, sizeof(buf), tp);
1804 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1806 ir_fprintf(F, "%+F", tp);
1808 fputs("\" info1: \"", F);
1809 dump_type_to_file(F, tp);
1811 print_type_dbg_info(F, get_type_dbg_info(tp));
1812 print_typespecific_vcgattr(F, tp);
1816 static void dump_entity_node(FILE *F, ir_entity *ent)
1818 fprintf(F, "node: {title: \"");
1819 PRINT_ENTID(ent); fprintf(F, "\"");
1820 fprintf(F, " label: ");
1821 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1823 print_vcg_color(F, ird_color_entity);
1824 fprintf(F, "\n info1: \"");
1826 dump_entity_to_file(F, ent);
1829 print_dbg_info(F, get_entity_dbg_info(ent));
1833 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1836 ir_enum_const *ec = get_enumeration_const(tp, pos);
1837 ident *id = get_enumeration_const_nameid(ec);
1838 ir_tarval *tv = get_enumeration_value(ec);
1841 tarval_snprintf(buf, sizeof(buf), tv);
1843 strncpy(buf, "<not set>", sizeof(buf));
1844 fprintf(F, "node: {title: \"");
1845 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1846 fprintf(F, " label: ");
1847 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1848 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1852 * Dumps a new style initializer.
1854 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1862 * type-walker: Dumps a type or entity and its edges.
1864 static void dump_type_info(type_or_ent tore, void *env)
1866 FILE *F = (FILE*)env;
1867 size_t i = 0; /* to shutup gcc */
1869 /* dump this type or entity */
1871 switch (get_kind(tore.ent)) {
1873 ir_entity *ent = tore.ent;
1876 dump_entity_node(F, ent);
1878 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1879 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1880 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1881 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1882 if (is_Class_type(get_entity_owner(ent))) {
1883 for (i = get_entity_n_overwrites(ent); i > 0;)
1884 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1886 /* attached subgraphs */
1887 if (! (flags & ir_dump_flag_no_entity_values)) {
1888 if (ent->initializer != NULL) {
1889 /* new style initializers */
1890 dump_entity_initializer(F, ent);
1891 } else if (entity_has_compound_ent_values(ent)) {
1892 /* old style compound entity values */
1893 for (i = get_compound_ent_n_values(ent); i > 0;) {
1894 value = get_compound_ent_value(ent, --i);
1896 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1897 dump_const_expression(F, value);
1898 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1900 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1901 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1902 get_compound_ent_value_member(ent, i), i);
1911 ir_type *tp = tore.typ;
1912 dump_type_node(F, tp);
1913 /* and now the edges */
1914 switch (get_type_tpop_code(tp)) {
1916 for (i = get_class_n_supertypes(tp); i > 0;) {
1918 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1920 for (i = get_class_n_members(tp); i > 0;) {
1922 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1926 for (i = get_struct_n_members(tp); i > 0;) {
1928 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1932 for (i = get_method_n_params(tp); i > 0;) {
1934 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1936 for (i = get_method_n_ress(tp); i > 0;) {
1938 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1942 for (i = get_union_n_members(tp); i > 0;) {
1944 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1948 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1949 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1950 for (i = get_array_n_dimensions(tp); i > 0;) {
1951 ir_node *upper, *lower;
1954 upper = get_array_upper_bound(tp, i);
1955 lower = get_array_lower_bound(tp, i);
1956 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1957 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1958 dump_const_expression(F, upper);
1959 dump_const_expression(F, lower);
1962 case tpo_enumeration:
1963 for (i = get_enumeration_n_enums(tp); i > 0;) {
1965 dump_enum_item(F, tp, i);
1966 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1970 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1977 break; /* case k_type */
1980 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1981 } /* switch kind_or_entity */
1984 /** For dumping class hierarchies.
1985 * Dumps a class type node and a superclass edge.
1987 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1989 FILE *F = (FILE*)ctx;
1990 size_t i = 0; /* to shutup gcc */
1992 /* dump this type or entity */
1993 switch (get_kind(tore.ent)) {
1995 ir_entity *ent = tore.ent;
1996 if (get_entity_owner(ent) == get_glob_type()) break;
1997 if (!is_Method_type(get_entity_type(ent)))
1999 if (flags & ir_dump_flag_entities_in_hierarchy
2000 && is_Class_type(get_entity_owner(ent))) {
2002 dump_entity_node(F, ent);
2004 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
2005 for (i = get_entity_n_overwrites(ent); i > 0;) {
2007 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
2013 ir_type *tp = tore.typ;
2014 if (tp == get_glob_type())
2016 switch (get_type_tpop_code(tp)) {
2018 dump_type_node(F, tp);
2019 /* and now the edges */
2020 for (i = get_class_n_supertypes(tp); i > 0;) {
2022 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2027 break; /* case k_type */
2030 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2031 } /* switch kind_or_entity */
2034 /*******************************************************************/
2035 /* dump analysis information that is expressed in graph terms. */
2036 /*******************************************************************/
2038 /* dump out edges */
2039 static void dump_out_edge(ir_node *n, void *env)
2041 FILE *F = (FILE*)env;
2043 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
2044 ir_node *succ = get_irn_out(n, i);
2046 print_node_edge_kind(F, succ);
2047 fprintf(F, "{sourcename: \"");
2049 fprintf(F, "\" targetname: \"");
2051 fprintf(F, "\" color: red linestyle: dashed");
2056 static void dump_loop_label(FILE *F, ir_loop *loop)
2058 fprintf(F, "loop %u, %lu sons, %lu nodes",
2059 get_loop_depth(loop), (unsigned long) get_loop_n_sons(loop),
2060 (unsigned long) get_loop_n_nodes(loop));
2063 static void dump_loop_info(FILE *F, ir_loop *loop)
2065 fprintf(F, " info1: \"");
2066 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
2067 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2068 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
2073 static void dump_loop_node(FILE *F, ir_loop *loop)
2075 fprintf(F, "node: {title: \"");
2077 fprintf(F, "\" label: \"");
2078 dump_loop_label(F, loop);
2080 dump_loop_info(F, loop);
2084 static void dump_loop_node_edge(FILE *F, ir_loop *loop, size_t i)
2087 fprintf(F, "edge: {sourcename: \"");
2089 fprintf(F, "\" targetname: \"");
2090 PRINT_NODEID(get_loop_node(loop, i));
2091 fprintf(F, "\" color: green");
2095 static void dump_loop_son_edge(FILE *F, ir_loop *loop, size_t i)
2098 fprintf(F, "edge: {sourcename: \"");
2100 fprintf(F, "\" targetname: \"");
2101 PRINT_LOOPID(get_loop_son(loop, i));
2102 ir_fprintf(F, "\" color: darkgreen label: \"%zu\"}\n",
2103 get_loop_element_pos(loop, get_loop_son(loop, i)));
2106 static void dump_loops(FILE *F, ir_loop *loop)
2109 /* dump this loop node */
2110 dump_loop_node(F, loop);
2112 /* dump edges to nodes in loop -- only if it is a real loop */
2113 if (get_loop_depth(loop) != 0) {
2114 for (i = get_loop_n_nodes(loop); i > 0;) {
2116 dump_loop_node_edge(F, loop, i);
2119 for (i = get_loop_n_sons(loop); i > 0;) {
2121 dump_loops(F, get_loop_son(loop, i));
2122 dump_loop_son_edge(F, loop, i);
2126 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
2128 ir_loop *loop = get_irg_loop(irg);
2131 ir_graph *rem = current_ir_graph;
2132 current_ir_graph = irg;
2134 dump_loops(F, loop);
2136 current_ir_graph = rem;
2142 * dumps the VCG header
2144 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
2148 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
2152 if (! layout) layout = "Compilergraph";
2153 if (!orientation) orientation = "bottom_to_top";
2157 "graph: { title: \"ir graph of %s\"\n"
2158 "display_edge_labels: %s\n"
2159 "layoutalgorithm: mindepth //$ \"%s\"\n"
2160 "manhattan_edges: yes\n"
2161 "port_sharing: no\n"
2163 "classname 1: \"intrablock Data\"\n"
2164 "classname 2: \"Block\"\n"
2165 "classname 3: \"Entity type\"\n"
2166 "classname 4: \"Entity owner\"\n"
2167 "classname 5: \"Method Param\"\n"
2168 "classname 6: \"Method Res\"\n"
2169 "classname 7: \"Super\"\n"
2170 "classname 8: \"Union\"\n"
2171 "classname 9: \"Points-to\"\n"
2172 "classname 10: \"Array Element Type\"\n"
2173 "classname 11: \"Overwrites\"\n"
2174 "classname 12: \"Member\"\n"
2175 "classname 13: \"Control Flow\"\n"
2176 "classname 14: \"intrablock Memory\"\n"
2177 "classname 15: \"Dominators\"\n"
2178 "classname 16: \"interblock Data\"\n"
2179 "classname 17: \"interblock Memory\"\n"
2180 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2181 "classname 19: \"Postdominators\"\n"
2182 "classname 20: \"Keep Alive\"\n"
2183 "classname 21: \"Out Edges\"\n"
2184 "classname 22: \"Macro Block Edges\"\n"
2185 //"classname 23: \"NoInput Nodes\"\n"
2186 "infoname 1: \"Attribute\"\n"
2187 "infoname 2: \"Verification errors\"\n"
2188 "infoname 3: \"Debug info\"\n",
2189 name, label, layout, orientation);
2191 for (i = 0; i < ird_color_count; ++i) {
2192 if (color_rgb[i] != NULL) {
2193 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2200 * Dumps the vcg file footer
2202 void dump_vcg_footer(FILE *F)
2209 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2213 construct_block_lists(irg);
2216 * If we are in the interprocedural view, we dump not
2217 * only the requested irg but also all irgs that can be reached
2220 for (i = get_irp_n_irgs(); i > 0;) {
2221 ir_graph *other_irg = get_irp_irg(--i);
2222 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2226 dump_graph_from_list(out, other_irg);
2231 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2232 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2233 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2236 ir_graph *rem = current_ir_graph;
2237 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2238 current_ir_graph = irg;
2240 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2241 ir_extblk *extbb = arr[i];
2242 ir_node *leader = get_extbb_leader(extbb);
2245 fprintf(F, "graph: { title: \"");
2246 PRINT_EXTBBID(leader);
2247 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2248 get_irn_node_nr(leader));
2250 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2251 ir_node *node = extbb->blks[j];
2252 if (is_Block(node)) {
2253 /* Dumps the block and all the nodes in the block, which are to
2254 be found in Block->link. */
2255 dump_whole_block(F, node);
2257 /* Nodes that are not in a Block. */
2259 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2260 dump_const_block_local(F, node);
2262 dump_ir_data_edges(F, node);
2268 if ((flags & ir_dump_flag_loops)
2269 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2270 dump_loop_nodes_into_graph(F, irg);
2272 current_ir_graph = rem;
2276 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2279 ir_entity *ent = get_irg_entity(irg);
2281 if (!is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
2284 construct_extblock_lists(irg);
2286 fprintf(F, "graph: { title: \"");
2288 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2289 get_ent_dump_name(ent));
2291 dump_graph_info(F, irg);
2292 print_dbg_info(F, get_entity_dbg_info(ent));
2294 for (i = get_irp_n_irgs(); i > 0;) {
2295 ir_graph *other_irg = get_irp_irg(--i);
2296 list_tuple *lists = (list_tuple*)ird_get_irg_link(other_irg);
2299 /* dump the extended blocks first */
2300 if (ARR_LEN(lists->extbb_list)) {
2301 ird_set_irg_link(other_irg, lists->extbb_list);
2302 dump_extblock_graph(F, other_irg);
2305 /* we may have blocks without extended blocks, bad for instance */
2306 if (ARR_LEN(lists->blk_list)) {
2307 ird_set_irg_link(other_irg, lists->blk_list);
2308 dump_block_graph(F, other_irg);
2311 DEL_ARR_F(lists->extbb_list);
2312 DEL_ARR_F(lists->blk_list);
2317 /* Close the vcg information for the irg */
2318 fprintf(F, "}\n\n");
2323 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2325 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2328 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2329 if (flags & ir_dump_flag_group_extbb) {
2330 dump_blocks_extbb_grouped(out, irg);
2332 dump_blocks_as_subgraphs(out, irg);
2335 /* dump_node_with_edges must be called in post visiting predecessors */
2336 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2339 /* dump type info */
2340 if (flags & ir_dump_flag_with_typegraph) {
2341 ir_graph *rem = current_ir_graph;
2342 current_ir_graph = irg;
2344 type_walk_irg(irg, dump_type_info, NULL, out);
2345 inc_irg_visited(get_const_code_irg());
2346 /* dump edges from graph to type info */
2347 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2349 current_ir_graph = rem;
2352 /* dump iredges out edges */
2353 if ((flags & ir_dump_flag_iredges) && edges_activated(current_ir_graph)) {
2354 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2357 /* dump the out edges in a separate walk */
2358 if ((flags & ir_dump_flag_out_edges)
2359 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2360 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2363 dump_vcg_footer(out);
2366 static void dump_block_to_cfg(ir_node *block, void *env)
2368 FILE *F = (FILE*)env;
2371 if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2372 dump_node(F, block);
2375 if (is_Block(block)) {
2376 /* This is a block. Dump a node for the block. */
2377 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2378 fprintf(F, "\" label: \"");
2379 if (block == get_irg_start_block(get_irn_irg(block)))
2380 fprintf(F, "Start ");
2381 if (block == get_irg_end_block(get_irn_irg(block)))
2384 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2385 PRINT_NODEID(block);
2387 fprintf(F, "info1:\"");
2389 /* the generic version. */
2390 dump_irnode_to_file(F, block);
2392 fprintf(F, "\""); /* closing quote of info */
2394 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2395 (block == get_irg_end_block(get_irn_irg(block))) )
2396 fprintf(F, " color:blue ");
2400 /* Dump the edges */
2401 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2402 ir_node *pred = get_Block_cfgpred(block, i);
2404 pred = get_nodes_block(pred);
2405 fprintf(F, "edge: { sourcename: \"");
2406 PRINT_NODEID(block);
2407 fprintf(F, "\" targetname: \"");
2409 fprintf(F, "\"}\n");
2412 /* Dump dominator/postdominator edge */
2413 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2414 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2415 ir_node *pred = get_Block_idom(block);
2416 fprintf(F, "edge: { sourcename: \"");
2417 PRINT_NODEID(block);
2418 fprintf(F, "\" targetname: \"");
2420 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2422 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2423 ir_node *pred = get_Block_ipostdom(block);
2424 fprintf(F, "edge: { sourcename: \"");
2425 PRINT_NODEID(block);
2426 fprintf(F, "\" targetname: \"");
2428 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2434 void dump_cfg(FILE *F, ir_graph *irg)
2436 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2438 /* walk over the blocks in the graph */
2439 irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2444 void dump_callgraph(FILE *F)
2447 ir_dump_flags_t old_flags = ir_get_dump_flags();
2449 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2450 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2452 for (i = get_irp_n_irgs(); i > 0;) {
2453 ir_graph *irg = get_irp_irg(--i);
2454 ir_entity *ent = get_irg_entity(irg);
2455 size_t j, n_callees = get_irg_n_callees(irg);
2457 dump_entity_node(F, ent);
2458 for (j = 0; j < n_callees; ++j) {
2459 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2460 int be = is_irg_callee_backedge(irg, j);
2461 const char *attr = be
2462 ? "label:\"recursion %zu\""
2463 : "label:\"calls %zu\"";
2464 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2465 get_irg_callee_loop_depth(irg, j));
2469 ir_set_dump_flags(old_flags);
2473 void dump_typegraph(FILE *out)
2475 dump_vcg_header(out, "All_types", "Hierarchic", NULL);
2476 type_walk(dump_type_info, NULL, out);
2477 dump_vcg_footer(out);
2480 void dump_class_hierarchy(FILE *out)
2482 dump_vcg_header(out, "class_hierarchy", "Hierarchic", NULL);
2483 type_walk(dump_class_hierarchy_node, NULL, out);
2484 dump_vcg_footer(out);
2487 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2490 bool loop_node_started = false;
2492 size_t son_number = 0;
2494 ir_loop *son = NULL;
2496 /* Dump a new loop node. */
2497 dump_loop_node(F, loop);
2499 /* Dump the loop elements. */
2500 for (i = 0; i < get_loop_n_elements(loop); i++) {
2501 le = get_loop_element(loop, i);
2503 if (get_kind(son) == k_ir_loop) {
2505 /* We are a loop son -> Recurse */
2507 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2508 fprintf(F, "\" }\n");
2509 fprintf(F, "edge: {sourcename: \"");
2511 fprintf(F, "\" targetname: \"");
2513 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2514 (unsigned long) first,
2515 (unsigned long) first,
2516 (unsigned long) i-1);
2517 loop_node_started = false;
2519 dump_loop_son_edge(F, loop, son_number++);
2520 dump_loops_standalone(F, son);
2521 } else if (get_kind(son) == k_ir_node) {
2522 /* We are a loop node -> Collect firm nodes */
2524 ir_node *n = le.node;
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;
2536 dump_node_label(F, n);
2537 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2538 if (has_backedges(n)) fprintf(F, "\t loop head!");
2539 } else { /* for callgraph loop tree */
2541 assert(get_kind(son) == k_ir_graph);
2543 /* We are a loop node -> Collect firm graphs */
2545 if (!loop_node_started) {
2546 /* Start a new node which contains all firm nodes of the current loop */
2547 fprintf(F, "node: { title: \"");
2549 fprintf(F, "-%lu-nodes\" color: lightyellow label: \"",
2551 loop_node_started = true;
2555 fprintf(F, " %s", get_irg_dump_name(n));
2556 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2560 if (loop_node_started) {
2561 fprintf(F, "\" }\n");
2562 fprintf(F, "edge: {sourcename: \"");
2564 fprintf(F, "\" targetname: \"");
2566 fprintf(F, "-%lu-nodes\" label:\"%lu...%lu\"}\n",
2567 (unsigned long) first,
2568 (unsigned long) first,
2569 (unsigned long) i-1);
2570 loop_node_started = false;
2574 void dump_loop_tree(FILE *out, ir_graph *irg)
2576 ir_graph *rem = current_ir_graph;
2577 ir_dump_flags_t old_flags = ir_get_dump_flags();
2579 current_ir_graph = irg;
2580 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2582 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2584 if (get_irg_loop(irg))
2585 dump_loops_standalone(out, get_irg_loop(irg));
2587 dump_vcg_footer(out);
2589 ir_set_dump_flags(old_flags);
2590 current_ir_graph = rem;
2593 void dump_callgraph_loop_tree(FILE *out)
2595 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2596 dump_loops_standalone(out, irp->outermost_cg_loop);
2597 dump_vcg_footer(out);
2600 static void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes)
2604 int node_number = 0;
2606 if (flags & ir_dump_flag_loops)
2607 dump_loop_node(F, loop);
2609 for (i = 0; i < get_loop_n_elements(loop); i++) {
2610 loop_element le = get_loop_element(loop, i);
2611 if (*(le.kind) == k_ir_loop) {
2612 if (flags & ir_dump_flag_loops)
2613 dump_loop_son_edge(F, loop, son_number++);
2615 collect_nodeloop(F, le.son, loopnodes);
2617 if (flags & ir_dump_flag_loops)
2618 dump_loop_node_edge(F, loop, node_number++);
2619 eset_insert(loopnodes, le.node);
2624 static void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes,
2630 for (i = 0; i < get_loop_n_elements(loop); i++) {
2631 loop_element le = get_loop_element(loop, i);
2632 if (*(le.kind) == k_ir_loop) {
2634 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2636 if (is_Block(le.node)) start = 0; else start = -1;
2637 for (j = start; j < get_irn_arity(le.node); j++) {
2638 ir_node *pred = get_irn_n(le.node, j);
2639 if (!eset_contains(loopnodes, pred)) {
2640 eset_insert(extnodes, pred);
2641 if (!is_Block(pred)) {
2642 pred = get_nodes_block(pred);
2643 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2651 void dump_loop(FILE *F, ir_loop *l)
2653 eset *loopnodes = eset_create();
2654 eset *extnodes = eset_create();
2658 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2659 dump_vcg_header(F, name, NULL, NULL);
2661 /* collect all nodes to dump */
2662 collect_nodeloop(F, l, loopnodes);
2663 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2665 /* build block lists */
2666 eset_foreach(loopnodes, ir_node*, n) {
2667 set_irn_link(n, NULL);
2669 eset_foreach(extnodes, ir_node*, n) {
2670 set_irn_link(n, NULL);
2672 eset_foreach(loopnodes, ir_node*, n) {
2674 b = get_nodes_block(n);
2675 set_irn_link(n, get_irn_link(b));
2679 eset_foreach(extnodes, ir_node*, n) {
2681 b = get_nodes_block(n);
2682 set_irn_link(n, get_irn_link(b));
2687 eset_foreach(loopnodes, ir_node*, b) {
2689 fprintf(F, "graph: { title: \"");
2691 fprintf(F, "\" label: \"");
2692 dump_node_opcode(F, b);
2693 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2694 fprintf(F, "\" status:clustered color:yellow\n");
2696 /* dump the blocks edges */
2697 dump_ir_data_edges(F, b);
2699 /* dump the nodes that go into the block */
2700 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2701 if (eset_contains(extnodes, n))
2702 overrule_nodecolor = ird_color_block_inout;
2704 overrule_nodecolor = ird_color_default_node;
2705 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2708 /* Close the vcg information for the block */
2710 dump_const_node_local(F, b);
2714 eset_foreach(extnodes, ir_node*, b) {
2716 fprintf(F, "graph: { title: \"");
2718 fprintf(F, "\" label: \"");
2719 dump_node_opcode(F, b);
2720 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2721 fprintf(F, "\" status:clustered color:lightblue\n");
2723 /* dump the nodes that go into the block */
2724 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2725 if (!eset_contains(loopnodes, n))
2726 overrule_nodecolor = ird_color_block_inout;
2728 overrule_nodecolor = ird_color_default_node;
2729 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
2732 /* Close the vcg information for the block */
2734 dump_const_node_local(F, b);
2738 eset_destroy(loopnodes);
2739 eset_destroy(extnodes);
2744 static bool obstack_init;
2745 static struct obstack obst;
2746 static char *dump_path;
2748 void ir_set_dump_path(const char *path)
2751 dump_path = xstrdup(path);
2754 static void add_string_escaped(const char *string)
2757 for (p = string; *p != '\0'; ++p) {
2760 obstack_1grow(&obst, '@');
2761 obstack_1grow(&obst, '1');
2762 } else if (c == '@') {
2763 obstack_1grow(&obst, '@');
2764 obstack_1grow(&obst, '2');
2766 obstack_1grow(&obst, c);
2771 static void add_dump_path(void)
2773 if (!obstack_init) {
2774 obstack_init(&obst);
2775 obstack_init = true;
2778 if (dump_path != NULL) {
2779 size_t len = strlen(dump_path);
2780 obstack_grow(&obst, dump_path, len);
2781 if (len > 0 && dump_path[len-1] != '/')
2782 obstack_1grow(&obst, '/');
2786 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2789 const char *dump_name = get_irg_dump_name(graph);
2793 if (!ir_should_dump(dump_name))
2798 add_string_escaped(dump_name);
2799 obstack_printf(&obst, "-%02u", graph->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 /* xvcg expects only <CR> so we need "b"inary mode (for win32) */
2810 out = fopen(file_name, "wb");
2811 obstack_free(&obst, file_name);
2814 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2822 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2829 obstack_printf(&obst, "%02u", irp->dump_nr++);
2830 if (suffix != NULL) {
2831 if (suffix[0] != '.')
2832 obstack_1grow(&obst, '-');
2833 add_string_escaped(suffix);
2835 obstack_1grow(&obst, '\0');
2837 file_name = (char*)obstack_finish(&obst);
2838 out = fopen(file_name, "wb");
2839 obstack_free(&obst, file_name);
2842 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2849 void dump_ir_graph(ir_graph *graph, const char *suffix)
2853 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2854 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2857 void dump_all_ir_graphs(const char *suffix)
2859 size_t i, n_irgs = get_irp_n_irgs();
2861 for (i = 0; i < n_irgs; ++i) {
2862 ir_graph *irg = get_irp_irg(i);
2863 dump_ir_graph(irg, suffix);
2867 typedef struct pass_t {
2868 ir_prog_pass_t pass;
2873 * Wrapper around dump_all_ir_graphs().
2875 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2877 pass_t *pass = (pass_t*)context;
2880 dump_all_ir_graphs(pass->suffix);
2884 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2886 size_t len = strlen(suffix) + 1;
2887 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2888 ir_prog_pass_t *res = def_prog_pass_constructor(
2889 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2891 /* this pass does not change anything, so neither dump nor verify is needed. */
2892 res->dump_irprog = ir_prog_no_dump;
2893 res->verify_irprog = ir_prog_no_verify;
2895 memcpy(pass->suffix, suffix, len);