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"
68 typedef struct pns_lookup {
69 long nr; /**< the proj number */
70 const char *name; /**< the name of the Proj */
73 typedef struct proj_lookup {
74 unsigned code; /**< the opcode of the Proj predecessor */
75 unsigned num_data; /**< number of data entries */
76 const pns_lookup_t *data; /**< the data */
79 #include "gen_irdump.c.inl"
81 /** Dump only irgs with names that start with this prefix. */
82 static ident *dump_file_filter_id = NULL;
84 static ir_dump_flags_t flags =
85 ir_dump_flag_blocks_as_subgraphs |
86 ir_dump_flag_keepalive_edges |
87 ir_dump_flag_ld_names |
88 ir_dump_flag_back_edges |
89 ir_dump_flag_consts_local |
90 ir_dump_flag_analysed_types |
91 ir_dump_flag_entities_in_hierarchy |
92 ir_dump_flag_number_label;
94 static ird_color_t overrule_nodecolor = ird_color_default_node;
96 /** The vcg node attribute hook. */
97 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
98 /** The vcg edge attribute hook. */
99 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
100 /** The vcg dump block edge hook */
101 static dump_node_edge_func dump_block_edge_hook = NULL;
102 /** The vcg dump node edge hook. */
103 static dump_node_edge_func dump_node_edge_hook = NULL;
105 void set_dump_node_edge_hook(dump_node_edge_func func)
107 dump_node_edge_hook = func;
110 dump_node_edge_func get_dump_node_edge_hook(void)
112 return dump_node_edge_hook;
115 void set_dump_block_edge_hook(dump_node_edge_func func)
117 dump_block_edge_hook = func;
120 dump_node_edge_func get_dump_block_edge_hook(void)
122 return dump_node_edge_hook;
125 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
127 dump_node_vcgattr_hook = hook;
130 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
132 dump_edge_vcgattr_hook = hook;
135 void ir_set_dump_flags(ir_dump_flags_t new_flags)
140 void ir_add_dump_flags(ir_dump_flags_t new_flags)
145 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
150 ir_dump_flags_t ir_get_dump_flags(void)
155 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
156 * are set, else returns dump_const_local_flag.
158 static bool get_opt_dump_const_local(void)
160 return (flags & ir_dump_flag_out_edges)
161 || (flags & ir_dump_flag_loops)
162 || (flags & ir_dump_flag_consts_local)
163 || (flags & ir_dump_flag_iredges);
166 static char *dump_filter;
168 void ir_set_dump_filter(const char *new_filter)
171 dump_filter = xstrdup(new_filter);
174 const char *ir_get_dump_filter(void)
179 int ir_should_dump(const char *name)
183 if (dump_filter == NULL || dump_filter[0] == '\0')
186 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
194 /* -------------- some extended helper functions ----------------- */
196 const char *get_mode_name_ex(const ir_mode *mode, int *bad)
199 return get_mode_name(mode);
205 #define CUSTOM_COLOR_BASE 100
206 static const char *color_names[ird_color_count];
207 static const char *color_rgb[ird_color_count];
208 static struct obstack color_obst;
210 /** define a custom color. */
211 static void custom_color(int num, const char *rgb_def)
213 assert(num < ird_color_count);
214 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
215 obstack_1grow(&color_obst, '\0');
217 color_rgb[num] = rgb_def;
218 color_names[num] = (const char*)obstack_finish(&color_obst);
221 /** Define a named color. */
222 static void named_color(int num, const char *name)
224 assert(num < ird_color_count);
225 color_rgb[num] = NULL;
226 color_names[num] = name;
229 /** Initializes the used colors. */
230 static void init_colors(void)
232 static bool initialized = 0;
236 obstack_init(&color_obst);
238 custom_color(ird_color_prog_background, "204 204 204");
239 custom_color(ird_color_block_background, "255 255 0");
240 custom_color(ird_color_dead_block_background, "190 150 150");
241 named_color(ird_color_block_inout, "lightblue");
242 named_color(ird_color_default_node, "white");
243 custom_color(ird_color_memory, "153 153 255");
244 custom_color(ird_color_controlflow, "255 153 153");
245 custom_color(ird_color_const, "204 255 255");
246 custom_color(ird_color_proj, "255 255 153");
247 custom_color(ird_color_uses_memory, "153 153 255");
248 custom_color(ird_color_phi, "105 255 105");
249 custom_color(ird_color_anchor, "100 100 255");
250 named_color(ird_color_error, "red");
251 custom_color(ird_color_entity, "204 204 255");
257 * Prints the VCG color to a file.
259 static void print_vcg_color(FILE *out, ird_color_t color)
261 assert(color < ird_color_count);
262 fprintf(out, "color:%s", color_names[color]);
265 void print_nodeid(FILE *F, const ir_node *node)
267 fprintf(F, "\"n%ld\"", get_irn_node_nr(node));
270 void print_irgid(FILE *F, const ir_graph *irg)
272 fprintf(F, "\"g%ld\"", get_irg_graph_nr(irg));
275 void print_typeid(FILE *F, const ir_type *type)
277 fprintf(F, "\"t%ld\"", get_type_nr(type));
280 void print_entityid(FILE *F, const ir_entity *entity)
282 fprintf(F, "\"e%ld\"", get_entity_nr(entity));
285 static void print_itemid(FILE *F, const ir_type *tp, size_t itemnr)
287 fprintf(F, "\"i%ldT%zu\"", get_type_nr(tp), itemnr);
291 * Prints the edge kind of a given IR node.
293 * Projs should be dumped near their predecessor, so they get "nearedge".
295 static void print_node_edge_kind(FILE *out, const ir_node *node)
298 fprintf(out, "nearedge: ");
300 fprintf(out, "edge: ");
305 * Prints the edge from a type S to a type T with additional info fmt, ...
308 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
313 fprintf(F, "edge: { sourcename: ");
315 fprintf(F, " targetname: ");
317 ir_vfprintf(F, fmt, ap);
323 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
326 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
331 fprintf(F, "edge: { sourcename: ");
333 fprintf(F, " targetname: ");
334 print_entityid(F, ent);
335 ir_vfprintf(F, fmt, ap);
341 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
344 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, ...)
350 fprintf(F, "backedge: { sourcename: ");
352 fprintf(F, "edge: { sourcename: ");
353 print_entityid(F, ent1);
354 fprintf(F, " targetname: ");
355 print_entityid(F, ent2);
356 ir_vfprintf(F, fmt, ap);
358 if (color != ird_color_none)
359 print_vcg_color(F, color);
365 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
368 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
373 fprintf(F, "edge: { sourcename: ");
374 print_entityid(F, ent);
375 fprintf(F, " targetname: ");
377 ir_vfprintf(F, fmt, ap);
383 * Prints the edge from a node irn to a type tp with additional info fmt, ...
386 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
391 fprintf(F, "edge: { sourcename: ");
392 print_nodeid(F, irn);
393 fprintf(F, " targetname: ");
395 ir_vfprintf(F, fmt, ap);
401 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
404 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
409 fprintf(F, "edge: { sourcename: ");
410 print_nodeid(F, irn);
411 fprintf(F, " targetname: ");
412 print_entityid(F, ent);
413 ir_vfprintf(F, fmt, ap);
419 * Prints the edge from an entity ent to a node irn with additional info fmt, ...
422 static void print_ent_node_edge(FILE *F, const ir_entity *ent, const ir_node *irn, const char *fmt, ...)
427 fprintf(F, "edge: { sourcename: ");
428 print_entityid(F, ent);
429 fprintf(F, "\" targetname: ");
430 print_nodeid(F, irn);
431 ir_vfprintf(F, fmt, ap);
437 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
440 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
445 fprintf(F, "edge: { sourcename: ");
447 fprintf(F, " targetname: ");
448 print_itemid(F, tp, item);
449 ir_vfprintf(F, fmt, ap);
454 /*-----------------------------------------------------------------*/
455 /* global and ahead declarations */
456 /*-----------------------------------------------------------------*/
458 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
460 /*-----------------------------------------------------------------*/
461 /* Helper functions. */
462 /*-----------------------------------------------------------------*/
465 * This map is used as a private link attr to be able to call dumper
466 * anywhere without destroying link fields.
468 static pmap *irdump_link_map = NULL;
470 /** NOT A STANDARD LIBFIRM INIT METHOD
472 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
473 * are off, we want to have as few interferences as possible. Therefore the
474 * initialization is performed lazily and not called from within init_firm.
476 * Creates the link attribute map. */
477 static void init_irdump(void)
479 /* We need a new, empty map. */
480 if (irdump_link_map) pmap_destroy(irdump_link_map);
481 irdump_link_map = pmap_create();
482 if (!dump_file_filter_id)
483 dump_file_filter_id = new_id_from_str("");
487 * Returns the private link field.
489 static void *ird_get_irn_link(const ir_node *n)
492 if (irdump_link_map == NULL)
495 if (pmap_contains(irdump_link_map, n))
496 res = pmap_get(irdump_link_map, n);
501 * Sets the private link field.
503 static void ird_set_irn_link(const ir_node *n, void *x)
505 if (irdump_link_map == NULL)
507 pmap_insert(irdump_link_map, n, x);
511 * Gets the private link field of an irg.
513 static void *ird_get_irg_link(const ir_graph *irg)
516 if (irdump_link_map == NULL)
519 if (pmap_contains(irdump_link_map, irg))
520 res = pmap_get(irdump_link_map, irg);
525 * Sets the private link field of an irg.
527 static void ird_set_irg_link(const ir_graph *irg, void *x)
529 if (irdump_link_map == NULL)
531 pmap_insert(irdump_link_map, irg, x);
535 * Walker, clears the private link field.
537 static void clear_link(ir_node *node, void *env)
540 ird_set_irn_link(node, NULL);
544 * If the entity has a ld_name, returns it if the dump_ld_name is set,
545 * else returns the name of the entity.
547 static const char *get_ent_dump_name_(const ir_entity *ent, bool dump_ld_name)
550 return "<NULL entity>";
552 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
553 if (ent->ld_name != NULL)
554 return get_id_str(ent->ld_name);
556 return get_id_str(ent->name);
559 const char *get_ent_dump_name(const ir_entity *ent)
561 return get_ent_dump_name_(ent, flags & ir_dump_flag_ld_names);
564 const char *get_irg_dump_name(const ir_graph *irg)
566 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
567 return get_ent_dump_name_(get_irg_entity(irg), true);
571 * Returns non-zero if a node is in floating state.
573 static int node_floats(const ir_node *n)
575 ir_graph *irg = get_irn_irg(n);
576 return ((get_irn_pinned(n) == op_pin_state_floats) &&
577 (get_irg_pinned(irg) == op_pin_state_floats));
581 * Walker that visits the anchors
583 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
585 if ((flags & ir_dump_flag_all_anchors)
586 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
587 irg_walk_anchors(irg, pre, post, env);
589 irg_walk_graph(irg, pre, post, env);
594 * Walker, allocates an array for all blocks and puts their non-floating
595 * nodes into this array.
597 static void collect_node(ir_node *node, void *env)
602 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
603 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
604 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
605 ARR_APP1(ir_node *, arr, node);
606 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
608 ir_node * block = get_nodes_block(node);
611 /* this node is in a Bad block, so we must place it into the graph's list */
612 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
613 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
614 ARR_APP1(ir_node *, arr, node);
615 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
617 ird_set_irn_link(node, ird_get_irn_link(block));
618 ird_set_irn_link(block, node);
623 /** Construct lists to walk ir block-wise.
625 * Collects all blocks, nodes not op_pin_state_pinned,
626 * Bad, NoMem and Unknown into a flexible array in link field of
627 * irg they belong to. Sets the irg link field to NULL in all
628 * graphs not visited.
629 * Free the list with DEL_ARR_F().
631 static ir_node **construct_block_lists(ir_graph *irg)
634 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
637 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
640 for (i = get_irp_n_irgs(); i > 0;)
641 ird_set_irg_link(get_irp_irg(--i), NULL);
643 ird_walk_graph(irg, clear_link, collect_node, irg);
646 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
649 return (ir_node**)ird_get_irg_link(irg);
652 typedef struct list_tuple {
654 ir_extblk **extbb_list;
657 /** Construct lists to walk IR extended block-wise.
658 * Free the lists in the tuple with DEL_ARR_F(). Sets the irg link field to
659 * NULL in all graphs not visited.
661 static list_tuple *construct_extblock_lists(ir_graph *irg)
663 ir_node **blk_list = construct_block_lists(irg);
665 list_tuple *lists = XMALLOC(list_tuple);
667 lists->blk_list = NEW_ARR_F(ir_node *, 0);
668 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
670 inc_irg_block_visited(irg);
671 for (i = 0, n = ARR_LEN(blk_list); i < n; ++i) {
674 if (is_Block(blk_list[i])) {
675 ext = get_Block_extbb(blk_list[i]);
677 if (extbb_not_visited(ext)) {
678 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
679 mark_extbb_visited(ext);
682 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
686 ird_set_irg_link(irg, lists);
690 void dump_node_opcode(FILE *F, const ir_node *n)
692 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
694 /* call the dump_node operation if available */
695 if (ops->dump_node) {
696 ops->dump_node(F, n, dump_node_opcode_txt);
700 /* implementation for default nodes */
701 switch (get_irn_opcode(n)) {
703 switch (get_SymConst_kind(n)) {
704 case symconst_addr_ent:
705 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
707 case symconst_ofs_ent:
708 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
710 case symconst_type_size:
711 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
713 case symconst_type_align:
714 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
716 case symconst_enum_const:
717 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
723 if (get_Load_unaligned(n) == align_non_aligned)
725 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), NULL));
728 if (get_Store_unaligned(n) == align_non_aligned)
730 fprintf(F, "%s", get_irn_opname(n));
733 if (n == get_irg_start_block(get_irn_irg(n)))
735 if (n == get_irg_end_block(get_irn_irg(n)))
737 fprintf(F, "%s%s", get_irn_opname(n),
738 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
741 if (get_Conv_strict(n))
742 fprintf(F, "strict");
743 fprintf(F, "%s", get_irn_opname(n));
746 fprintf(F, "%s", get_irn_opname(n));
747 if (get_Div_no_remainder(n))
749 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n), NULL));
752 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), NULL));
755 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
759 fprintf(F, "%s", get_irn_opname(n));
764 * Dump the mode of a node n to a file F.
765 * Ignore modes that are "always known".
767 static void dump_node_mode(FILE *F, const ir_node *n)
769 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
773 /* call the dump_node operation if available */
774 if (ops->dump_node) {
775 ops->dump_node(F, n, dump_node_mode_txt);
779 /* default implementation */
780 iro = get_irn_opcode(n);
792 mode = get_irn_mode(n);
794 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
795 (mode != mode_T || iro == iro_Proj))
796 fprintf(F, "%s", get_mode_name_ex(mode, NULL));
801 * Dump the type of a node n to a file F if it's known.
803 static int dump_node_typeinfo(FILE *F, const ir_node *n)
805 ir_graph *irg = get_irn_irg(n);
808 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
809 if (get_irg_typeinfo_state(irg) == ir_typeinfo_consistent ||
810 get_irg_typeinfo_state(irg) == ir_typeinfo_inconsistent) {
811 ir_type *tp = get_irn_typeinfo_type(n);
812 if (tp != get_none_type()) {
813 ir_fprintf(F, "[%+F]", tp);
823 * Dump additional node attributes of some nodes to a file F.
825 static void dump_node_nodeattr(FILE *F, const ir_node *n)
830 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
832 /* call the dump_node operation if available */
833 if (ops->dump_node) {
834 ops->dump_node(F, n, dump_node_nodeattr_txt);
838 switch (get_irn_opcode(n)) {
840 ir_fprintf(F, "%T ", get_Const_tarval(n));
844 pred = get_Proj_pred(n);
845 proj_nr = get_Proj_proj(n);
846 code = get_irn_opcode(pred);
848 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
849 fprintf(F, "Arg %ld ", proj_nr);
850 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
851 fprintf(F, "%ld ", proj_nr);
853 unsigned i, j, f = 0;
855 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
856 if (code == proj_lut[i].code) {
857 for (j = 0; j < proj_lut[i].num_data; ++j) {
858 if (proj_nr == proj_lut[i].data[j].nr) {
859 fprintf(F, "%s ", proj_lut[i].data[j].name);
868 fprintf(F, "%ld ", proj_nr);
869 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
870 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
872 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
878 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
881 ir_fprintf(F, "(%+F)", get_Cast_type(n));
884 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
887 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
890 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
898 void dump_node_label(FILE *F, const ir_node *n)
900 dump_node_opcode(F, n);
902 dump_node_mode(F, n);
904 dump_node_typeinfo(F, n);
905 dump_node_nodeattr(F, n);
906 if (flags & ir_dump_flag_number_label) {
907 fprintf(F, "%ld", get_irn_node_nr(n));
909 if (flags & ir_dump_flag_idx_label) {
910 fprintf(F, ":%u", get_irn_idx(n));
915 * Dumps the attributes of a node n into the file F.
916 * Currently this is only the color of a node.
918 static void dump_node_vcgattr(FILE *F, const ir_node *node, const ir_node *local, bool bad)
924 print_vcg_color(F, ird_color_error);
928 if (dump_node_vcgattr_hook != NULL) {
929 dump_node_vcgattr_hook(F, node, local);
933 n = local ? local : node;
935 if (overrule_nodecolor != ird_color_default_node) {
936 print_vcg_color(F, overrule_nodecolor);
940 mode = get_irn_mode(n);
941 if (mode == mode_M) {
942 print_vcg_color(F, ird_color_memory);
945 if (mode == mode_X) {
946 print_vcg_color(F, ird_color_controlflow);
950 switch (get_irn_opcode(n)) {
953 print_vcg_color(F, ird_color_anchor);
956 print_vcg_color(F, ird_color_error);
959 print_vcg_color(F, ird_color_block_background);
962 print_vcg_color(F, ird_color_phi);
965 print_vcg_color(F, ird_color_memory);
969 print_vcg_color(F, ird_color_const);
972 print_vcg_color(F, ird_color_proj);
975 ir_op *op = get_irn_op(node);
977 if (is_op_constlike(op)) {
978 print_vcg_color(F, ird_color_const);
979 } else if (is_op_uses_memory(op)) {
980 print_vcg_color(F, ird_color_uses_memory);
981 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
982 print_vcg_color(F, ird_color_controlflow);
988 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
990 hook_entry_t *info = XMALLOCZ(hook_entry_t);
992 info->hook._hook_node_info = cb;
993 info->context = data;
994 register_hook(hook_node_info, info);
999 void dump_remove_node_info_callback(void *handle)
1001 hook_entry_t *info = (hook_entry_t*)handle;
1002 unregister_hook(hook_node_info, info);
1007 * Dump the node information of a node n to a file F.
1009 static void dump_node_info(FILE *F, const ir_node *n)
1011 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1013 fprintf(F, " info1: \"");
1014 dump_irnode_to_file(F, n);
1015 /* call the dump_node operation if available */
1017 ops->dump_node(F, n, dump_node_info_txt);
1019 /* allow additional info to be added */
1020 hook_node_info(F, n);
1024 static int is_constlike_node(const ir_node *node)
1026 const ir_op *op = get_irn_op(node);
1027 return is_op_constlike(op);
1030 static void print_constid(FILE *F, const ir_node *user, const ir_node *node)
1032 fprintf(F, "\"n%ldb%ld\"", get_irn_node_nr(user), get_irn_node_nr(node));
1035 static void print_constblkid(FILE *F, const ir_node *node, const ir_node *block)
1037 fprintf(F, "\"n%ldb%ld\"", get_irn_node_nr(node), get_irn_node_nr(block));
1041 /** outputs the predecessors of n, that are constants, local. I.e.,
1042 generates a copy of the constant predecessors for each node called with. */
1043 static void dump_const_node_local(FILE *F, const ir_node *n)
1045 ir_graph *irg = get_irn_irg(n);
1047 if (!get_opt_dump_const_local()) return;
1049 /* Use visited flag to avoid outputting nodes twice.
1050 initialize it first. */
1051 for (i = 0; i < get_irn_arity(n); i++) {
1052 ir_node *con = get_irn_n(n, i);
1053 if (is_constlike_node(con)) {
1054 set_irn_visited(con, get_irg_visited(irg) - 1);
1058 for (i = 0; i < get_irn_arity(n); i++) {
1059 ir_node *con = get_irn_n(n, i);
1060 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1061 /* Generate a new name for the node by appending the names of
1063 fprintf(F, "node: {title: ");
1064 print_constid(F, n, con);
1065 fprintf(F, " label: \"");
1066 dump_node_label(F, con);
1068 dump_node_info(F, con);
1069 dump_node_vcgattr(F, n, con, 0);
1075 /** If the block of an edge is a const_like node, dump it local with an edge */
1076 static void dump_const_block_local(FILE *F, const ir_node *n)
1080 if (!get_opt_dump_const_local()) return;
1082 blk = get_nodes_block(n);
1083 if (is_constlike_node(blk)) {
1084 /* Generate a new name for the node by appending the names of
1086 fprintf(F, "node: {title: ");
1087 print_constblkid(F, n, blk);
1088 fprintf(F, " label: \"");
1089 dump_node_label(F, blk);
1091 dump_node_info(F, blk);
1092 dump_node_vcgattr(F, n, blk, 0);
1095 fprintf(F, "edge: { sourcename: ");
1097 fprintf(F, " targetname: ");
1098 print_constblkid(F, n, blk);
1101 if (dump_edge_vcgattr_hook != NULL
1102 && dump_edge_vcgattr_hook(F, n, -1)) {
1107 fprintf(F, BLOCK_EDGE_ATTR "}\n");
1112 * prints the error message of a node to a file F as info2.
1114 static void print_node_error(FILE *F, const char *err_msg)
1119 fprintf(F, " info2: \"%s\"", err_msg);
1123 * prints debug messages of a node to file F as info3.
1125 static void print_dbg_info(FILE *F, dbg_info *dbg)
1129 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1131 fprintf(F, " info3: \"%s\"\n", buf);
1135 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1145 void dump_node(FILE *F, const ir_node *n)
1151 if (get_opt_dump_const_local() && is_constlike_node(n))
1154 /* dump this node */
1155 fputs("node: {title: ", F);
1158 fputs(" label: \"", F);
1159 irg = get_irn_irg(n);
1160 bad = ! irn_verify_irg_dump(n, irg, &p);
1161 dump_node_label(F, n);
1164 dump_node_info(F, n);
1165 print_node_error(F, p);
1166 print_dbg_info(F, get_irn_dbg_info(n));
1167 dump_node_vcgattr(F, n, NULL, bad);
1169 dump_const_node_local(F, n);
1173 /** dump the edge to the block this node belongs to */
1174 static void dump_ir_block_edge(FILE *F, const ir_node *n)
1176 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1178 ir_node *block = get_nodes_block(n);
1180 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1181 dump_const_block_local(F, n);
1183 fprintf(F, "edge: { sourcename: ");
1185 fprintf(F, " targetname: ");
1186 print_nodeid(F, block);
1189 if (dump_edge_vcgattr_hook && dump_edge_vcgattr_hook(F, n, -1)) {
1194 fprintf(F, BLOCK_EDGE_ATTR "}\n");
1199 static void print_data_edge_vcgattr(FILE *F, const ir_node *from, int to)
1202 * do not use get_nodes_block() here, will fail
1203 * if the irg is not pinned.
1205 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1206 fprintf(F, INTRA_DATA_EDGE_ATTR);
1208 fprintf(F, INTER_DATA_EDGE_ATTR);
1211 static void print_mem_edge_vcgattr(FILE *F, const ir_node *from, int to)
1214 * do not use get_nodes_block() here, will fail
1215 * if the irg is not pinned.
1217 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1218 fprintf(F, INTRA_MEM_EDGE_ATTR);
1220 fprintf(F, INTER_MEM_EDGE_ATTR);
1223 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1224 static void print_edge_vcgattr(FILE *F, const ir_node *from, int to)
1228 if (dump_edge_vcgattr_hook)
1229 if (dump_edge_vcgattr_hook(F, from, to))
1232 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1233 fprintf(F, BACK_EDGE_ATTR);
1235 switch (get_irn_opcode(from)) {
1237 fprintf(F, CF_EDGE_ATTR);
1239 case iro_Start: break;
1242 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1243 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1245 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1249 if (is_Proj(from)) {
1250 if (get_irn_mode(from) == mode_M)
1251 print_mem_edge_vcgattr(F, from, to);
1252 else if (get_irn_mode(from) == mode_X)
1253 fprintf(F, CF_EDGE_ATTR);
1255 print_data_edge_vcgattr(F, from, to);
1257 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1258 print_mem_edge_vcgattr(F, from, to);
1259 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1260 fprintf(F, CF_EDGE_ATTR);
1262 print_data_edge_vcgattr(F, from, to);
1266 /** dump edges to our inputs */
1267 static void dump_ir_data_edges(FILE *F, const ir_node *n)
1271 if (dump_node_edge_hook)
1272 dump_node_edge_hook(F, n);
1274 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1275 /* the End node has only keep-alive edges */
1279 /* dump the dependency edges. */
1280 num = get_irn_deps(n);
1281 for (i = 0; i < num; ++i) {
1282 ir_node *dep = get_irn_dep(n, i);
1285 print_node_edge_kind(F, n);
1286 fprintf(F, "{sourcename: ");
1288 fprintf(F, " targetname: ");
1289 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1290 print_constid(F, n, dep);
1292 print_nodeid(F, dep);
1294 fprintf(F, " label: \"%d\" ", i);
1295 fprintf(F, " color: darkgreen}\n");
1299 num = get_irn_arity(n);
1300 for (i = 0; i < num; i++) {
1301 ir_node *pred = get_irn_n(n, i);
1304 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1305 fprintf(F, "backedge: {sourcename: ");
1307 print_node_edge_kind(F, n);
1308 fprintf(F, "{sourcename: ");
1311 fprintf(F, " targetname: ");
1312 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1313 print_constid(F, n, pred);
1315 print_nodeid(F, pred);
1317 fprintf(F, " label: \"%d\" ", i);
1318 print_edge_vcgattr(F, n, i);
1326 static void dump_ir_edges(ir_node *node, void *env)
1329 FILE *F = (FILE*)env;
1330 const ir_edge_t *edge;
1332 foreach_out_edge(node, edge) {
1333 ir_node *succ = get_edge_src_irn(edge);
1335 print_node_edge_kind(F, succ);
1336 fprintf(F, "{sourcename: ");
1337 print_nodeid(F, node);
1338 fprintf(F, " targetname: ");
1339 print_nodeid(F, succ);
1341 fprintf(F, " label: \"%d\" ", i);
1342 fprintf(F, OUT_EDGE_ATTR);
1349 /** Dumps a node and its edges but not the block edge */
1350 static void dump_node_wo_blockedge(FILE *F, const ir_node *n)
1353 dump_ir_data_edges(F, n);
1356 /** Dumps a node and its edges. */
1357 static void dump_node_with_edges(ir_node *n, void *env)
1359 FILE *F = (FILE*)env;
1360 dump_node_wo_blockedge(F, n);
1361 if (!node_floats(n))
1362 dump_ir_block_edge(F, n);
1365 /** Dumps a const-like node. */
1366 static void dump_const_node(ir_node *n, void *env)
1368 FILE *F = (FILE*)env;
1369 if (is_Block(n)) return;
1370 dump_node_wo_blockedge(F, n);
1373 /***********************************************************************/
1374 /* the following routines dump the nodes/irgs bracketed to graphs. */
1375 /***********************************************************************/
1377 /** Dumps a constant expression as entity initializer, array bound ... */
1378 static void dump_const_expression(FILE *F, ir_node *value)
1380 ir_graph *irg = get_const_code_irg();
1381 ir_dump_flags_t old_flags = ir_get_dump_flags();
1382 ir_remove_dump_flags(ir_dump_flag_consts_local);
1384 irg_walk(value, dump_const_node, NULL, F);
1385 /* Decrease visited flag so that we walk with the same flag for the next
1386 expression. This guarantees that we don't dump the same node twice,
1387 as for const expressions cse is performed to save memory. */
1388 set_irg_visited(irg, get_irg_visited(irg) -1);
1390 ir_set_dump_flags(old_flags);
1393 /** Dump a block as graph containing its nodes.
1395 * Expects to find nodes belonging to the block as list in its
1397 * Dumps the edges of all nodes including itself. */
1398 static void dump_whole_block(FILE *F, const ir_node *block)
1401 ird_color_t color = ird_color_block_background;
1403 assert(is_Block(block));
1405 fprintf(F, "graph: { title: ");
1406 print_nodeid(F, block);
1407 fprintf(F, " label: \"");
1408 dump_node_label(F, block);
1410 /* colorize blocks */
1411 if (! get_Block_matured(block))
1412 color = ird_color_block_background;
1414 fprintf(F, "\" status:clustered ");
1415 print_vcg_color(F, color);
1418 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1419 dump_node_info(F, block);
1420 print_dbg_info(F, get_irn_dbg_info(block));
1422 /* dump the blocks edges */
1423 dump_ir_data_edges(F, block);
1425 if (dump_block_edge_hook)
1426 dump_block_edge_hook(F, block);
1428 /* dump the nodes that go into the block */
1429 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1431 dump_ir_data_edges(F, node);
1434 /* Close the vcg information for the block */
1436 dump_const_node_local(F, block);
1440 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1441 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1442 static void dump_block_graph(FILE *F, ir_graph *irg)
1445 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1447 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1448 ir_node *node = arr[i];
1449 if (is_Block(node)) {
1450 /* Dumps the block and all the nodes in the block, which are to
1451 be found in Block->link. */
1452 dump_whole_block(F, node);
1454 /* Nodes that are not in a Block. */
1456 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1457 dump_const_block_local(F, node);
1459 dump_ir_data_edges(F, node);
1461 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1462 dump_ir_edges(node, F);
1465 if ((flags & ir_dump_flag_loops)
1466 && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1467 dump_loop_nodes_into_graph(F, irg);
1471 * Dump the info for an irg.
1472 * Parsed by XVCG but not shown. use yComp.
1474 static void dump_graph_info(FILE *F, ir_graph *irg)
1476 fprintf(F, "info1: \"");
1477 dump_entity_to_file(F, get_irg_entity(irg));
1480 /* dump graph state */
1481 fprintf(F, "state:");
1482 if (is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP))
1483 fprintf(F, " arch_dep");
1484 if (is_irg_state(irg, IR_GRAPH_STATE_MODEB_LOWERED))
1485 fprintf(F, " modeb_lowered");
1486 if (is_irg_state(irg, IR_GRAPH_STATE_NORMALISATION2))
1487 fprintf(F, " normalisation2");
1488 if (is_irg_state(irg, IR_GRAPH_STATE_IMPLICIT_BITFIELD_MASKING))
1489 fprintf(F, " implicit_bitfield_masking");
1490 if (is_irg_state(irg, IR_GRAPH_STATE_OPTIMIZE_UNREACHABLE_CODE))
1491 fprintf(F, " optimize_unreachable_code");
1492 if (is_irg_state(irg, IR_GRAPH_STATE_NO_CRITICAL_EDGES))
1493 fprintf(F, " no_critical_edges");
1494 if (is_irg_state(irg, IR_GRAPH_STATE_NO_BADS))
1495 fprintf(F, " no_bads");
1496 if (is_irg_state(irg, IR_GRAPH_STATE_NO_UNREACHABLE_CODE))
1497 fprintf(F, " no_unreachable_code");
1498 if (is_irg_state(irg, IR_GRAPH_STATE_ONE_RETURN))
1499 fprintf(F, " one_return");
1500 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE))
1501 fprintf(F, " consistent_dominance");
1502 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE))
1503 fprintf(F, " consistent_postdominance");
1504 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUT_EDGES))
1505 fprintf(F, " consistent_out_edges");
1506 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))
1507 fprintf(F, " consistent_outs");
1508 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO))
1509 fprintf(F, " consistent_loopinfo");
1510 if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
1511 fprintf(F, " consistent_entity_usage");
1512 if (is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
1513 fprintf(F, " valid_exended_blocks");
1517 /** Dumps an irg as a graph clustered by block nodes.
1518 * If interprocedural view edges can point to nodes out of this graph.
1520 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1522 ir_entity *ent = get_irg_entity(irg);
1524 fprintf(F, "graph: { title: ");
1525 print_irgid(F, irg);
1526 fprintf(F, " label: \"%s\" status:clustered color:%s\n",
1527 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1529 dump_graph_info(F, irg);
1530 print_dbg_info(F, get_entity_dbg_info(ent));
1532 dump_block_graph(F, irg);
1534 /* Close the vcg information for the irg */
1535 fprintf(F, "}\n\n");
1538 /*******************************************************************/
1539 /* Basic type and entity nodes and edges. */
1540 /*******************************************************************/
1542 /** dumps the edges between nodes and their type or entity attributes. */
1543 static void dump_node2type_edges(ir_node *n, void *env)
1545 FILE *F = (FILE*)env;
1548 switch (get_irn_opcode(n)) {
1550 /* @@@ some consts have an entity */
1553 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1554 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1557 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1560 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1563 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1566 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1569 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1576 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1578 switch (get_type_tpop_code(tp)) {
1580 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1583 fprintf(F, " " TYPE_METH_NODE_ATTR);
1591 case tpo_enumeration:
1602 void dump_type_node(FILE *F, ir_type *tp)
1604 fprintf(F, "node: {title: ");
1605 print_typeid(F, tp);
1606 fprintf(F, " label: \"");
1607 if (tp->dbi != NULL) {
1609 ir_print_type(buf, sizeof(buf), tp);
1610 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1612 ir_fprintf(F, "%+F", tp);
1614 fputs("\" info1: \"", F);
1615 dump_type_to_file(F, tp);
1617 print_type_dbg_info(F, get_type_dbg_info(tp));
1618 print_typespecific_vcgattr(F, tp);
1622 static void dump_entity_node(FILE *F, ir_entity *ent)
1624 fprintf(F, "node: {title: ");
1625 print_entityid(F, ent);
1626 fprintf(F, " label: ");
1627 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1629 print_vcg_color(F, ird_color_entity);
1630 fprintf(F, "\n info1: \"");
1632 dump_entity_to_file(F, ent);
1635 print_dbg_info(F, get_entity_dbg_info(ent));
1639 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1642 ir_enum_const *ec = get_enumeration_const(tp, pos);
1643 ident *id = get_enumeration_const_nameid(ec);
1644 ir_tarval *tv = get_enumeration_value(ec);
1647 tarval_snprintf(buf, sizeof(buf), tv);
1649 strncpy(buf, "<not set>", sizeof(buf));
1650 fprintf(F, "node: {title: ");
1651 print_itemid(F, tp, pos);
1652 fprintf(F, " label: ");
1653 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1654 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1658 * Dumps a new style initializer.
1660 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1668 * type-walker: Dumps a type or entity and its edges.
1670 static void dump_type_info(type_or_ent tore, void *env)
1672 FILE *F = (FILE*)env;
1673 size_t i = 0; /* to shutup gcc */
1675 /* dump this type or entity */
1677 switch (get_kind(tore.ent)) {
1679 ir_entity *ent = tore.ent;
1682 dump_entity_node(F, ent);
1684 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1685 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1686 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1687 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1688 if (is_Class_type(get_entity_owner(ent))) {
1689 for (i = get_entity_n_overwrites(ent); i > 0;)
1690 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1692 /* attached subgraphs */
1693 if (! (flags & ir_dump_flag_no_entity_values)) {
1694 if (ent->initializer != NULL) {
1695 /* new style initializers */
1696 dump_entity_initializer(F, ent);
1697 } else if (entity_has_compound_ent_values(ent)) {
1698 /* old style compound entity values */
1699 for (i = get_compound_ent_n_values(ent); i > 0;) {
1700 value = get_compound_ent_value(ent, --i);
1702 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1703 dump_const_expression(F, value);
1704 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ird_color_none, ENT_CORR_EDGE_ATTR, i);
1706 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1707 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1708 get_compound_ent_value_member(ent, i), i);
1717 ir_type *tp = tore.typ;
1718 dump_type_node(F, tp);
1719 /* and now the edges */
1720 switch (get_type_tpop_code(tp)) {
1722 for (i = get_class_n_supertypes(tp); i > 0;) {
1724 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1726 for (i = get_class_n_members(tp); i > 0;) {
1728 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1732 for (i = get_struct_n_members(tp); i > 0;) {
1734 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1738 for (i = get_method_n_params(tp); i > 0;) {
1740 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1742 for (i = get_method_n_ress(tp); i > 0;) {
1744 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1748 for (i = get_union_n_members(tp); i > 0;) {
1750 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1754 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1755 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1756 for (i = get_array_n_dimensions(tp); i > 0;) {
1757 ir_node *upper, *lower;
1760 upper = get_array_upper_bound(tp, i);
1761 lower = get_array_lower_bound(tp, i);
1762 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1763 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1764 dump_const_expression(F, upper);
1765 dump_const_expression(F, lower);
1768 case tpo_enumeration:
1769 for (i = get_enumeration_n_enums(tp); i > 0;) {
1771 dump_enum_item(F, tp, i);
1772 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1776 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1780 case tpo_uninitialized:
1785 break; /* case k_type */
1788 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1792 /** For dumping class hierarchies.
1793 * Dumps a class type node and a superclass edge.
1795 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1797 FILE *F = (FILE*)ctx;
1798 size_t i = 0; /* to shutup gcc */
1800 /* dump this type or entity */
1801 switch (get_kind(tore.ent)) {
1803 ir_entity *ent = tore.ent;
1804 if (get_entity_owner(ent) == get_glob_type()) break;
1805 if (!is_Method_type(get_entity_type(ent)))
1807 if (flags & ir_dump_flag_entities_in_hierarchy
1808 && is_Class_type(get_entity_owner(ent))) {
1810 dump_entity_node(F, ent);
1812 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1813 for (i = get_entity_n_overwrites(ent); i > 0;) {
1815 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1821 ir_type *tp = tore.typ;
1822 if (tp == get_glob_type())
1824 switch (get_type_tpop_code(tp)) {
1826 dump_type_node(F, tp);
1827 /* and now the edges */
1828 for (i = get_class_n_supertypes(tp); i > 0;) {
1830 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1835 break; /* case k_type */
1838 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1842 /*******************************************************************/
1843 /* dump analysis information that is expressed in graph terms. */
1844 /*******************************************************************/
1846 /* dump out edges */
1847 static void dump_out_edge(ir_node *n, void *env)
1849 FILE *F = (FILE*)env;
1851 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
1852 ir_node *succ = get_irn_out(n, i);
1854 print_node_edge_kind(F, succ);
1855 fprintf(F, "{sourcename: ");
1857 fprintf(F, " targetname: ");
1858 print_nodeid(F, succ);
1859 fprintf(F, " color: red linestyle: dashed");
1864 static void dump_loop_label(FILE *F, const ir_loop *loop)
1866 fprintf(F, "loop %u", get_loop_depth(loop));
1869 static void dump_loop_info(FILE *F, const ir_loop *loop)
1871 fprintf(F, " info1: \"");
1872 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
1873 #ifdef DEBUG_libfirm
1874 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
1879 void print_loopid(FILE *F, const ir_loop *loop)
1881 fprintf(F, "\"l%ld\"", get_loop_loop_nr(loop));
1884 static void dump_loop_node(FILE *F, const ir_loop *loop)
1886 fprintf(F, "node: {title: ");
1887 print_loopid(F, loop);
1888 fprintf(F, " label: \"");
1889 dump_loop_label(F, loop);
1891 dump_loop_info(F, loop);
1895 static void dump_loop_node_edge(FILE *F, const ir_loop *loop, size_t i)
1898 fprintf(F, "edge: {sourcename: ");
1899 print_loopid(F, loop);
1900 fprintf(F, " targetname: ");
1901 print_nodeid(F, get_loop_element(loop, i).node);
1902 fprintf(F, " color: green");
1906 static void dump_loop_son_edge(FILE *F, const ir_loop *loop, size_t i)
1909 fprintf(F, "edge: {sourcename: ");
1910 print_loopid(F, loop);
1911 fprintf(F, " targetname: ");
1912 print_loopid(F, get_loop_element(loop, i).son);
1913 ir_fprintf(F, " color: darkgreen label: \"%zu\"}\n", i);
1916 static void dump_loops(FILE *F, const ir_loop *loop)
1919 size_t n_elements = get_loop_n_elements(loop);
1920 /* dump this loop node */
1921 dump_loop_node(F, loop);
1923 /* dump edges to nodes in loop -- only if it is a real loop */
1924 if (get_loop_depth(loop) != 0) {
1925 for (i = n_elements; i > 0;) {
1926 loop_element element;
1928 element = get_loop_element(loop, i);
1929 if (*element.kind != k_ir_node)
1931 dump_loop_node_edge(F, loop, i);
1934 for (i = n_elements; i > 0;) {
1935 loop_element element;
1937 element = get_loop_element(loop, i);
1938 if (*element.kind != k_ir_loop)
1940 dump_loops(F, element.son);
1941 dump_loop_son_edge(F, loop, i);
1945 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
1947 ir_loop *loop = get_irg_loop(irg);
1949 dump_loops(F, loop);
1953 void dump_vcg_header_colors(FILE *F)
1957 for (i = 0; i < ird_color_count; ++i) {
1958 if (color_rgb[i] != NULL) {
1959 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
1964 void dump_vcg_infonames(FILE *F)
1967 "infoname 1: \"Attribute\"\n"
1968 "infoname 2: \"Verification errors\"\n"
1969 "infoname 3: \"Debug info\"\n", F);
1973 * dumps the VCG header
1975 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
1978 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
1980 if (! layout) layout = "Compilergraph";
1981 if (!orientation) orientation = "bottom_to_top";
1985 "graph: { title: \"ir graph of %s\"\n"
1986 "display_edge_labels: %s\n"
1987 "layoutalgorithm: mindepth //$ \"%s\"\n"
1988 "manhattan_edges: yes\n"
1989 "port_sharing: no\n"
1991 "classname 1: \"intrablock Data\"\n"
1992 "classname 2: \"Block\"\n"
1993 "classname 3: \"Entity type\"\n"
1994 "classname 4: \"Entity owner\"\n"
1995 "classname 5: \"Method Param\"\n"
1996 "classname 6: \"Method Res\"\n"
1997 "classname 7: \"Super\"\n"
1998 "classname 8: \"Union\"\n"
1999 "classname 9: \"Points-to\"\n"
2000 "classname 10: \"Array Element Type\"\n"
2001 "classname 11: \"Overwrites\"\n"
2002 "classname 12: \"Member\"\n"
2003 "classname 13: \"Control Flow\"\n"
2004 "classname 14: \"intrablock Memory\"\n"
2005 "classname 15: \"Dominators\"\n"
2006 "classname 16: \"interblock Data\"\n"
2007 "classname 17: \"interblock Memory\"\n"
2008 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2009 "classname 19: \"Postdominators\"\n"
2010 "classname 20: \"Keep Alive\"\n"
2011 "classname 21: \"Out Edges\"\n"
2012 "classname 22: \"Macro Block Edges\"\n",
2013 name, label, layout, orientation);
2014 dump_vcg_infonames(F);
2015 dump_vcg_header_colors(F);
2020 * Dumps the vcg file footer
2022 void dump_vcg_footer(FILE *F)
2029 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2033 construct_block_lists(irg);
2036 * If we are in the interprocedural view, we dump not
2037 * only the requested irg but also all irgs that can be reached
2040 for (i = get_irp_n_irgs(); i > 0;) {
2041 ir_graph *other_irg = get_irp_irg(--i);
2042 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2046 dump_graph_from_list(out, other_irg);
2051 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
2052 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
2053 static void dump_extblock_graph(FILE *F, ir_graph *irg)
2056 ir_extblk **arr = (ir_extblk**)ird_get_irg_link(irg);
2058 for (i = 0, arr_len = ARR_LEN(arr); i < arr_len; ++i) {
2059 ir_extblk *extbb = arr[i];
2060 ir_node *leader = get_extbb_leader(extbb);
2063 fprintf(F, "graph: { title: \"");
2064 fprintf(F, "x%ld", get_irn_node_nr(leader));
2065 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
2066 get_irn_node_nr(leader));
2068 for (j = 0, n_blks = ARR_LEN(extbb->blks); j < n_blks; ++j) {
2069 ir_node *node = extbb->blks[j];
2070 if (is_Block(node)) {
2071 /* Dumps the block and all the nodes in the block, which are to
2072 be found in Block->link. */
2073 dump_whole_block(F, node);
2075 /* Nodes that are not in a Block. */
2077 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
2078 dump_const_block_local(F, node);
2080 dump_ir_data_edges(F, node);
2086 if ((flags & ir_dump_flag_loops)
2087 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO)))
2088 dump_loop_nodes_into_graph(F, irg);
2093 static void dump_blocks_extbb_grouped(FILE *F, ir_graph *irg)
2096 ir_entity *ent = get_irg_entity(irg);
2098 if (!is_irg_state(irg, IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS))
2101 construct_extblock_lists(irg);
2103 fprintf(F, "graph: { title: ");
2104 print_irgid(F, irg);
2105 fprintf(F, " label: \"%s\" status:clustered color: white\n",
2106 get_ent_dump_name(ent));
2108 dump_graph_info(F, irg);
2109 print_dbg_info(F, get_entity_dbg_info(ent));
2111 for (i = get_irp_n_irgs(); i > 0;) {
2112 ir_graph *other_irg = get_irp_irg(--i);
2113 list_tuple *lists = (list_tuple*)ird_get_irg_link(other_irg);
2116 /* dump the extended blocks first */
2117 if (ARR_LEN(lists->extbb_list)) {
2118 ird_set_irg_link(other_irg, lists->extbb_list);
2119 dump_extblock_graph(F, other_irg);
2122 /* we may have blocks without extended blocks, bad for instance */
2123 if (ARR_LEN(lists->blk_list)) {
2124 ird_set_irg_link(other_irg, lists->blk_list);
2125 dump_block_graph(F, other_irg);
2128 DEL_ARR_F(lists->extbb_list);
2129 DEL_ARR_F(lists->blk_list);
2134 /* Close the vcg information for the irg */
2135 fprintf(F, "}\n\n");
2140 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2142 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2145 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2146 if (flags & ir_dump_flag_group_extbb) {
2147 dump_blocks_extbb_grouped(out, irg);
2149 dump_blocks_as_subgraphs(out, irg);
2152 /* dump_node_with_edges must be called in post visiting predecessors */
2153 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2156 /* dump type info */
2157 if (flags & ir_dump_flag_with_typegraph) {
2158 type_walk_irg(irg, dump_type_info, NULL, out);
2159 inc_irg_visited(get_const_code_irg());
2160 /* dump edges from graph to type info */
2161 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2164 /* dump iredges out edges */
2165 if ((flags & ir_dump_flag_iredges) && edges_activated(irg)) {
2166 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2169 /* dump the out edges in a separate walk */
2170 if ((flags & ir_dump_flag_out_edges)
2171 && (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS))) {
2172 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2175 dump_vcg_footer(out);
2178 static void dump_block_to_cfg(ir_node *block, void *env)
2180 FILE *F = (FILE*)env;
2183 if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2184 dump_node(F, block);
2187 if (is_Block(block)) {
2188 /* This is a block. Dump a node for the block. */
2189 fprintf(F, "node: {title: ");
2190 print_nodeid(F, block);
2191 fprintf(F, " label: \"");
2192 if (block == get_irg_start_block(get_irn_irg(block)))
2193 fprintf(F, "Start ");
2194 if (block == get_irg_end_block(get_irn_irg(block)))
2197 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2198 print_nodeid(F, block);
2200 fprintf(F, "info1:\"");
2202 /* the generic version. */
2203 dump_irnode_to_file(F, block);
2205 fprintf(F, "\""); /* closing quote of info */
2207 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2208 (block == get_irg_end_block(get_irn_irg(block))) )
2209 fprintf(F, " color:blue ");
2213 /* Dump the edges */
2214 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2215 ir_node *pred = get_Block_cfgpred(block, i);
2217 pred = get_nodes_block(pred);
2218 fprintf(F, "edge: { sourcename: ");
2219 print_nodeid(F, block);
2220 fprintf(F, " targetname: ");
2221 print_nodeid(F, pred);
2222 fprintf(F, "\"}\n");
2225 /* Dump dominator/postdominator edge */
2226 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2227 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2228 ir_node *pred = get_Block_idom(block);
2229 fprintf(F, "edge: { sourcename: ");
2230 print_nodeid(F, block);
2231 fprintf(F, " targetname: ");
2232 print_nodeid(F, pred);
2233 fprintf(F, " " DOMINATOR_EDGE_ATTR "}\n");
2235 if (is_irg_state(get_irn_irg(block), IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2236 ir_node *pred = get_Block_ipostdom(block);
2237 fprintf(F, "edge: { sourcename: ");
2238 print_nodeid(F, block);
2239 fprintf(F, " targetname: ");
2240 print_nodeid(F, pred);
2241 fprintf(F, " " POSTDOMINATOR_EDGE_ATTR "}\n");
2247 void dump_cfg(FILE *F, ir_graph *irg)
2249 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2251 /* walk over the blocks in the graph */
2252 irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2257 void dump_callgraph(FILE *F)
2260 ir_dump_flags_t old_flags = ir_get_dump_flags();
2262 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2263 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2265 for (i = get_irp_n_irgs(); i > 0;) {
2266 ir_graph *irg = get_irp_irg(--i);
2267 ir_entity *ent = get_irg_entity(irg);
2268 size_t j, n_callees = get_irg_n_callees(irg);
2270 dump_entity_node(F, ent);
2271 for (j = 0; j < n_callees; ++j) {
2272 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2273 int be = is_irg_callee_backedge(irg, j);
2274 const char *attr = be
2275 ? "label:\"recursion %zu\""
2276 : "label:\"calls %zu\"";
2277 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2278 get_irg_callee_loop_depth(irg, j));
2282 ir_set_dump_flags(old_flags);
2286 void dump_typegraph(FILE *out)
2288 dump_vcg_header(out, "All_types", NULL, NULL);
2289 type_walk(dump_type_info, NULL, out);
2290 dump_vcg_footer(out);
2293 void dump_class_hierarchy(FILE *out)
2295 dump_vcg_header(out, "class_hierarchy", NULL, NULL);
2296 type_walk(dump_class_hierarchy_node, NULL, out);
2297 dump_vcg_footer(out);
2300 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2303 bool loop_node_started = false;
2305 size_t son_number = 0;
2307 ir_loop *son = NULL;
2309 /* Dump a new loop node. */
2310 dump_loop_node(F, loop);
2312 /* Dump the loop elements. */
2313 for (i = 0; i < get_loop_n_elements(loop); i++) {
2314 le = get_loop_element(loop, i);
2316 if (get_kind(son) == k_ir_loop) {
2318 /* We are a loop son -> Recurse */
2320 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2321 fprintf(F, "\" }\n");
2322 fprintf(F, "edge: {sourcename: ");
2323 print_loopid(F, loop);
2324 fprintf(F, " targetname: \"l%ld-%lu-nodes\" label:\"%lu...%lu\"}\n",
2325 get_loop_loop_nr(loop),
2326 (unsigned long) first,
2327 (unsigned long) first,
2328 (unsigned long) i-1);
2329 loop_node_started = false;
2331 dump_loop_son_edge(F, loop, son_number++);
2332 dump_loops_standalone(F, son);
2333 } else if (get_kind(son) == k_ir_node) {
2334 /* We are a loop node -> Collect firm nodes */
2336 ir_node *n = le.node;
2337 if (!loop_node_started) {
2338 /* Start a new node which contains all firm nodes of the current loop */
2339 fprintf(F, "node: { title: \"l%ld-%lu-nodes\" color: lightyellow label: \"",
2340 get_loop_loop_nr(loop),
2342 loop_node_started = true;
2347 dump_node_label(F, n);
2348 if (has_backedges(n)) fprintf(F, "\t loop head!");
2349 } else { /* for callgraph loop tree */
2351 assert(get_kind(son) == k_ir_graph);
2353 /* We are a loop node -> Collect firm graphs */
2355 if (!loop_node_started) {
2356 /* Start a new node which contains all firm nodes of the current loop */
2357 fprintf(F, "node: { title: \"l%ld-%lu-nodes\" color: lightyellow label: \"",
2358 get_loop_loop_nr(loop),
2360 loop_node_started = true;
2364 fprintf(F, " %s", get_irg_dump_name(n));
2365 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2369 if (loop_node_started) {
2370 fprintf(F, "\" }\n");
2371 fprintf(F, "edge: {sourcename: \"");
2372 print_loopid(F, loop);
2373 fprintf(F, "\" targetname: \"l%ld-%lu-nodes\" label:\"%lu...%lu\"}\n",
2374 get_loop_loop_nr(loop),
2375 (unsigned long) first,
2376 (unsigned long) first,
2377 (unsigned long) i-1);
2378 loop_node_started = false;
2382 void dump_loop_tree(FILE *out, ir_graph *irg)
2384 ir_dump_flags_t old_flags = ir_get_dump_flags();
2386 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2388 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2390 if (get_irg_loop(irg))
2391 dump_loops_standalone(out, get_irg_loop(irg));
2393 dump_vcg_footer(out);
2395 ir_set_dump_flags(old_flags);
2398 void dump_callgraph_loop_tree(FILE *out)
2400 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2401 dump_loops_standalone(out, irp->outermost_cg_loop);
2402 dump_vcg_footer(out);
2405 static void collect_nodeloop(FILE *F, ir_loop *loop, pset *loopnodes)
2409 int node_number = 0;
2411 if (flags & ir_dump_flag_loops)
2412 dump_loop_node(F, loop);
2414 for (i = 0; i < get_loop_n_elements(loop); i++) {
2415 loop_element le = get_loop_element(loop, i);
2416 if (*(le.kind) == k_ir_loop) {
2417 if (flags & ir_dump_flag_loops)
2418 dump_loop_son_edge(F, loop, son_number++);
2420 collect_nodeloop(F, le.son, loopnodes);
2422 if (flags & ir_dump_flag_loops)
2423 dump_loop_node_edge(F, loop, node_number++);
2424 pset_insert_ptr(loopnodes, le.node);
2429 static void collect_nodeloop_external_nodes(ir_loop *loop, pset *loopnodes,
2435 for (i = 0; i < get_loop_n_elements(loop); i++) {
2436 loop_element le = get_loop_element(loop, i);
2437 if (*(le.kind) == k_ir_loop) {
2439 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2441 if (is_Block(le.node)) start = 0; else start = -1;
2442 for (j = start; j < get_irn_arity(le.node); j++) {
2443 ir_node *pred = get_irn_n(le.node, j);
2444 if (!pset_find_ptr(loopnodes, pred)) {
2445 pset_insert_ptr(extnodes, pred);
2446 if (!is_Block(pred)) {
2447 pred = get_nodes_block(pred);
2448 if (!pset_find_ptr(loopnodes, pred))
2449 pset_insert_ptr(extnodes, pred);
2457 void dump_loop(FILE *F, ir_loop *l)
2459 pset *loopnodes = pset_new_ptr_default();
2460 pset *extnodes = pset_new_ptr_default();
2464 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2465 dump_vcg_header(F, name, NULL, NULL);
2467 /* collect all nodes to dump */
2468 collect_nodeloop(F, l, loopnodes);
2469 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2471 /* build block lists */
2472 foreach_pset(loopnodes, ir_node*, n) {
2473 set_irn_link(n, NULL);
2475 foreach_pset(extnodes, ir_node*, n) {
2476 set_irn_link(n, NULL);
2478 foreach_pset(loopnodes, ir_node*, n) {
2480 b = get_nodes_block(n);
2481 set_irn_link(n, get_irn_link(b));
2485 foreach_pset(extnodes, ir_node*, n) {
2487 b = get_nodes_block(n);
2488 set_irn_link(n, get_irn_link(b));
2493 foreach_pset(loopnodes, ir_node*, b) {
2495 fprintf(F, "graph: { title: ");
2497 fprintf(F, " label: \"");
2498 dump_node_opcode(F, b);
2499 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2500 fprintf(F, "\" status:clustered color:yellow\n");
2502 /* dump the blocks edges */
2503 dump_ir_data_edges(F, b);
2505 /* dump the nodes that go into the block */
2506 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2507 if (pset_find_ptr(extnodes, n))
2508 overrule_nodecolor = ird_color_block_inout;
2510 overrule_nodecolor = ird_color_default_node;
2511 if (!pset_find_ptr(extnodes, n)) dump_ir_data_edges(F, n);
2514 /* Close the vcg information for the block */
2516 dump_const_node_local(F, b);
2520 foreach_pset(extnodes, ir_node*, b) {
2522 fprintf(F, "graph: { title: ");
2524 fprintf(F, " label: \"");
2525 dump_node_opcode(F, b);
2526 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2527 fprintf(F, "\" status:clustered color:lightblue\n");
2529 /* dump the nodes that go into the block */
2530 for (n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2531 if (!pset_find_ptr(loopnodes, n))
2532 overrule_nodecolor = ird_color_block_inout;
2534 overrule_nodecolor = ird_color_default_node;
2535 if (pset_find_ptr(loopnodes, n)) dump_ir_data_edges(F, n);
2538 /* Close the vcg information for the block */
2540 dump_const_node_local(F, b);
2544 del_pset(loopnodes);
2550 static bool obstack_init;
2551 static struct obstack obst;
2552 static char *dump_path;
2554 void ir_set_dump_path(const char *path)
2557 dump_path = xstrdup(path);
2560 static void add_string_escaped(const char *string)
2563 for (p = string; *p != '\0'; ++p) {
2566 obstack_1grow(&obst, '@');
2567 obstack_1grow(&obst, '1');
2568 } else if (c == '@') {
2569 obstack_1grow(&obst, '@');
2570 obstack_1grow(&obst, '2');
2572 obstack_1grow(&obst, c);
2577 static void add_dump_path(void)
2579 if (!obstack_init) {
2580 obstack_init(&obst);
2581 obstack_init = true;
2584 if (dump_path != NULL) {
2585 size_t len = strlen(dump_path);
2586 obstack_grow(&obst, dump_path, len);
2587 if (len > 0 && dump_path[len-1] != '/')
2588 obstack_1grow(&obst, '/');
2592 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2595 const char *dump_name = get_irg_dump_name(graph);
2599 if (!ir_should_dump(dump_name))
2604 add_string_escaped(dump_name);
2605 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2607 if (suffix != NULL) {
2608 if (suffix[0] != '.')
2609 obstack_1grow(&obst, '-');
2610 add_string_escaped(suffix);
2612 obstack_1grow(&obst, '\0');
2614 file_name = (char*)obstack_finish(&obst);
2615 /* xvcg expects only <LF> so we need "b"inary mode (for win32) */
2616 out = fopen(file_name, "wb");
2617 obstack_free(&obst, file_name);
2620 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2628 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2635 obstack_printf(&obst, "%02u", irp->dump_nr++);
2636 if (suffix != NULL) {
2637 if (suffix[0] != '.')
2638 obstack_1grow(&obst, '-');
2639 add_string_escaped(suffix);
2641 obstack_1grow(&obst, '\0');
2643 file_name = (char*)obstack_finish(&obst);
2644 out = fopen(file_name, "wb");
2645 obstack_free(&obst, file_name);
2648 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2655 void dump_ir_graph(ir_graph *graph, const char *suffix)
2659 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2660 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2663 void dump_all_ir_graphs(const char *suffix)
2665 size_t i, n_irgs = get_irp_n_irgs();
2667 for (i = 0; i < n_irgs; ++i) {
2668 ir_graph *irg = get_irp_irg(i);
2669 dump_ir_graph(irg, suffix);
2673 typedef struct pass_t {
2674 ir_prog_pass_t pass;
2679 * Wrapper around dump_all_ir_graphs().
2681 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2683 pass_t *pass = (pass_t*)context;
2686 dump_all_ir_graphs(pass->suffix);
2690 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2692 size_t len = strlen(suffix) + 1;
2693 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2694 ir_prog_pass_t *res = def_prog_pass_constructor(
2695 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2697 /* this pass does not change anything, so neither dump nor verify is needed. */
2698 res->dump_irprog = ir_prog_no_dump;
2699 res->verify_irprog = ir_prog_no_verify;
2701 memcpy(pass->suffix, suffix, len);