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"
54 #include "dbginfo_t.h"
68 * Symbolic names for the different dumping colors.
70 typedef enum ird_color_t {
72 ird_color_prog_background,
73 ird_color_block_background,
74 ird_color_dead_block_background,
75 ird_color_block_inout,
76 ird_color_default_node,
79 ird_color_controlflow,
83 ird_color_uses_memory,
93 data_edge = 0x01, /**< A data edge between two basic blocks. */
94 block_edge = 0x02, /**< An edge from a node to its basic block. */
95 cf_edge = 0x03, /**< A regularly control flow edge. */
96 exc_cf_edge = 0x04, /**< An exceptional control flow edge. */
97 mem_edge = 0x05, /**< A memory edge. */
98 dominator_edge = 0x06, /**< A dominator edge from a block to its immediate dominator. */
99 node2type_edge = 0x07, /**< An edge from an IR node to a type. */
101 ent_type_edge = 0x11, /**< An edge from an entity to its type. */
102 ent_own_edge = 0x12, /**< An edge from an entity to its owner type. */
103 ent_overwrites_edge = 0x13, /**< An edge from an entity to the entity it overwrites. */
104 ent_value_edge = 0x14, /**< An edge from an entity to its value entity. */
105 ent_corr_edge = 0x15, /**< An edge from an entity to the member entity its initializes. */
107 meth_par_edge = 0x21, /**< An edge from a method type to one of its parameter types. */
108 meth_res_edge = 0x22, /**< An edge from a method type to one of its result types. */
109 type_super_edge = 0x23, /**< An edge from a class type to its super/basis type. */
110 union_edge = 0x24, /**< An edge from a union type to its member types. */
111 ptr_pts_to_edge = 0x25, /**< An edge from a pointer type to its points-to type. */
112 arr_elt_type_edge = 0x26, /**< An edge from an array type to its element type. */
113 arr_ent_edge = 0x27, /**< An edge from a array type to its element entity. */
114 type_member_edge = 0x28, /**< An edge from a compound type to its member entities. */
116 /* additional flags */
117 intra_edge = 0, /**< Intra edge flag: edge do not cross basic block boundaries */
118 inter_edge = 0x40, /**< Inter edge flag: edge cross basic block boundaries */
119 back_edge = 0x80 /**< Backwards edge flag. */
122 /* Attributes of nodes */
123 #define PRINT_DEFAULT_NODE_ATTR
124 #define DEFAULT_NODE_ATTR " "
125 #define DEFAULT_TYPE_ATTRIBUTE " "
126 #define DEFAULT_ENUM_ITEM_ATTRIBUTE " "
128 /* Attributes of edges between Firm nodes */
129 #define INTRA_DATA_EDGE_ATTR "class:1 priority:50"
130 #define INTER_DATA_EDGE_ATTR "class:16 priority:10"
131 #define BLOCK_EDGE_ATTR "class:2 priority:50 linestyle:dotted"
132 #define CF_EDGE_ATTR "class:13 priority:60 color:red"
133 #define EXC_CF_EDGE_ATTR "class:18 priority:60 color:blue"
134 #define INTRA_MEM_EDGE_ATTR "class:14 priority:50 color:blue"
135 #define INTER_MEM_EDGE_ATTR "class:17 priority:10 color:blue"
136 #define DOMINATOR_EDGE_ATTR "class:15 color:red"
137 #define POSTDOMINATOR_EDGE_ATTR "class:19 color:red linestyle:dotted"
138 #define KEEP_ALIVE_EDGE_ATTR "class:20 priority:10 color:purple"
139 #define KEEP_ALIVE_CF_EDGE_ATTR "class:20 priority:60 color:purple"
140 #define KEEP_ALIVE_DF_EDGE_ATTR "class:20 priority:10 color:purple"
141 #define ANCHOR_EDGE_ATTR "class:20 priority:60 color:purple linestyle:dotted"
142 #define OUT_EDGE_ATTR "class:21 priority:10 color:gold linestyle:dashed"
144 #define BACK_EDGE_ATTR "linestyle:dashed "
146 /* Attributes of edges between Firm nodes and type/entity nodes */
147 #define NODE2TYPE_EDGE_ATTR "class:2 priority:2 linestyle:dotted"
149 /* Attributes of edges in type/entity graphs. */
150 #define TYPE_METH_NODE_ATTR "color: lightyellow"
151 #define TYPE_CLASS_NODE_ATTR "color: green"
152 #define TYPE_DESCRIPTION_NODE_ATTR "color: lightgreen"
153 #define ENTITY_NODE_ATTR "color: yellow"
154 #define ENUM_ITEM_NODE_ATTR "color: green"
155 #define ENT_TYPE_EDGE_ATTR "class: 3 label: \"type\" color: red"
156 #define ENT_OWN_EDGE_ATTR "class: 4 label: \"owner\" color: black"
157 #define METH_PAR_EDGE_ATTR "class: 5 label: \"param %zu\" color: green"
158 #define METH_RES_EDGE_ATTR "class: 6 label: \"res %zu\" color: green"
159 #define TYPE_SUPER_EDGE_ATTR "class: 7 label: \"supertype\" color: red"
160 #define UNION_EDGE_ATTR "class: 8 label: \"component\" color: blue"
161 #define PTR_PTS_TO_EDGE_ATTR "class: 9 label: \"points to\" color:green"
162 #define ARR_ELT_TYPE_EDGE_ATTR "class: 10 label: \"arr elt tp\" color:green"
163 #define ARR_ENT_EDGE_ATTR "class: 10 label: \"arr ent\" color: green"
164 #define ENT_OVERWRITES_EDGE_ATTR "class: 11 label: \"overwrites\" color:red"
165 #define ENT_VALUE_EDGE_ATTR "label: \"value %d\""
166 #define ENT_CORR_EDGE_ATTR "label: \"value %zu corresponds to \" "
167 #define TYPE_MEMBER_EDGE_ATTR "class: 12 label: \"member\" color:blue"
168 /* #define CALLGRAPH_EDGE_ATTR "calls" */
170 typedef struct pns_lookup {
171 long nr; /**< the proj number */
172 const char *name; /**< the name of the Proj */
175 typedef struct proj_lookup {
176 unsigned code; /**< the opcode of the Proj predecessor */
177 unsigned num_data; /**< number of data entries */
178 const pns_lookup_t *data; /**< the data */
181 #include "gen_irdump.c.inl"
183 /** Dump only irgs with names that start with this prefix. */
184 static ident *dump_file_filter_id = NULL;
186 static ir_dump_flags_t flags =
187 ir_dump_flag_blocks_as_subgraphs |
188 ir_dump_flag_keepalive_edges |
189 ir_dump_flag_ld_names |
190 ir_dump_flag_back_edges |
191 ir_dump_flag_consts_local |
192 ir_dump_flag_analysed_types |
193 ir_dump_flag_entities_in_hierarchy |
194 ir_dump_flag_number_label;
196 static ird_color_t overrule_nodecolor = ird_color_default_node;
198 /** The vcg node attribute hook. */
199 static dump_node_vcgattr_func dump_node_vcgattr_hook = NULL;
200 /** The vcg edge attribute hook. */
201 static dump_edge_vcgattr_func dump_edge_vcgattr_hook = NULL;
202 /** The vcg dump block edge hook */
203 static dump_node_edge_func dump_block_edge_hook = NULL;
204 /** The vcg dump node edge hook. */
205 static dump_node_edge_func dump_node_edge_hook = NULL;
207 void set_dump_node_edge_hook(dump_node_edge_func func)
209 dump_node_edge_hook = func;
212 dump_node_edge_func get_dump_node_edge_hook(void)
214 return dump_node_edge_hook;
217 void set_dump_block_edge_hook(dump_node_edge_func func)
219 dump_block_edge_hook = func;
222 dump_node_edge_func get_dump_block_edge_hook(void)
224 return dump_node_edge_hook;
227 void set_dump_node_vcgattr_hook(dump_node_vcgattr_func hook)
229 dump_node_vcgattr_hook = hook;
232 void set_dump_edge_vcgattr_hook(dump_edge_vcgattr_func hook)
234 dump_edge_vcgattr_hook = hook;
237 void ir_set_dump_flags(ir_dump_flags_t new_flags)
242 void ir_add_dump_flags(ir_dump_flags_t new_flags)
247 void ir_remove_dump_flags(ir_dump_flags_t to_remove)
252 ir_dump_flags_t ir_get_dump_flags(void)
257 /** Returns 0 if dump_out_edge_flag or dump_loop_information_flag
258 * are set, else returns dump_const_local_flag.
260 static bool get_opt_dump_const_local(void)
262 return (flags & ir_dump_flag_out_edges)
263 || (flags & ir_dump_flag_loops)
264 || (flags & ir_dump_flag_consts_local)
265 || (flags & ir_dump_flag_iredges);
268 static char *dump_filter;
270 void ir_set_dump_filter(const char *new_filter)
273 dump_filter = xstrdup(new_filter);
276 const char *ir_get_dump_filter(void)
281 int ir_should_dump(const char *name)
285 if (dump_filter == NULL || dump_filter[0] == '\0')
288 for (n = name, f = dump_filter; *f != '\0' && *n != '\0';
296 /* -------------- some extended helper functions ----------------- */
298 char const *get_mode_name_ex(ir_mode const *const mode)
301 return get_mode_name(mode);
305 #define CUSTOM_COLOR_BASE 100
306 static const char *color_names[ird_color_count];
307 static const char *color_rgb[ird_color_count];
308 static struct obstack color_obst;
310 /** define a custom color. */
311 static void custom_color(int num, const char *rgb_def)
313 assert(num < ird_color_count);
314 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
315 obstack_1grow(&color_obst, '\0');
317 color_rgb[num] = rgb_def;
318 color_names[num] = (const char*)obstack_finish(&color_obst);
321 /** Define a named color. */
322 static void named_color(int num, const char *name)
324 assert(num < ird_color_count);
325 color_rgb[num] = NULL;
326 color_names[num] = name;
329 /** Initializes the used colors. */
330 static void init_colors(void)
332 static bool initialized = 0;
336 obstack_init(&color_obst);
338 custom_color(ird_color_prog_background, "204 204 204");
339 custom_color(ird_color_block_background, "255 255 0");
340 custom_color(ird_color_dead_block_background, "190 150 150");
341 named_color(ird_color_block_inout, "lightblue");
342 named_color(ird_color_default_node, "white");
343 custom_color(ird_color_memory, "153 153 255");
344 custom_color(ird_color_controlflow, "255 153 153");
345 custom_color(ird_color_const, "204 255 255");
346 custom_color(ird_color_proj, "255 255 153");
347 custom_color(ird_color_uses_memory, "153 153 255");
348 custom_color(ird_color_phi, "105 255 105");
349 custom_color(ird_color_anchor, "100 100 255");
350 named_color(ird_color_error, "red");
351 custom_color(ird_color_entity, "204 204 255");
357 * Prints the VCG color to a file.
359 static void print_vcg_color(FILE *out, ird_color_t color)
361 assert(color < ird_color_count);
362 fprintf(out, "color:%s", color_names[color]);
365 void print_nodeid(FILE *F, const ir_node *node)
367 fprintf(F, "\"n%ld\"", get_irn_node_nr(node));
370 void print_irgid(FILE *F, const ir_graph *irg)
372 fprintf(F, "\"g%ld\"", get_irg_graph_nr(irg));
375 void print_typeid(FILE *F, const ir_type *type)
377 fprintf(F, "\"t%ld\"", get_type_nr(type));
380 void print_entityid(FILE *F, const ir_entity *entity)
382 fprintf(F, "\"e%ld\"", get_entity_nr(entity));
385 static void print_itemid(FILE *F, const ir_type *tp, size_t itemnr)
387 fprintf(F, "\"i%ldT%zu\"", get_type_nr(tp), itemnr);
391 * Prints the edge kind of a given IR node.
393 * Projs should be dumped near their predecessor, so they get "nearedge".
395 static void print_node_edge_kind(FILE *out, const ir_node *node)
398 fprintf(out, "nearedge: ");
400 fprintf(out, "edge: ");
405 * Prints the edge from a type S to a type T with additional info fmt, ...
408 static void print_type_type_edge(FILE *F, const ir_type *S, const ir_type *T, const char *fmt, ...)
413 fprintf(F, "edge: { sourcename: ");
415 fprintf(F, " targetname: ");
417 ir_vfprintf(F, fmt, ap);
423 * Prints the edge from a type tp to an entity ent with additional info fmt, ...
426 static void print_type_ent_edge(FILE *F, const ir_type *tp, const ir_entity *ent, const char *fmt, ...)
431 fprintf(F, "edge: { sourcename: ");
433 fprintf(F, " targetname: ");
434 print_entityid(F, ent);
435 ir_vfprintf(F, fmt, ap);
441 * Prints the edge from an entity ent1 to an entity ent2 with additional info fmt, ...
444 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, ...)
450 fprintf(F, "backedge: { sourcename: ");
452 fprintf(F, "edge: { sourcename: ");
453 print_entityid(F, ent1);
454 fprintf(F, " targetname: ");
455 print_entityid(F, ent2);
456 ir_vfprintf(F, fmt, ap);
458 if (color != ird_color_none)
459 print_vcg_color(F, color);
465 * Prints the edge from an entity ent to a type tp with additional info fmt, ...
468 static void print_ent_type_edge(FILE *F, const ir_entity *ent, const ir_type *tp, const char *fmt, ...)
473 fprintf(F, "edge: { sourcename: ");
474 print_entityid(F, ent);
475 fprintf(F, " targetname: ");
477 ir_vfprintf(F, fmt, ap);
483 * Prints the edge from a node irn to a type tp with additional info fmt, ...
486 static void print_node_type_edge(FILE *F, const ir_node *irn, ir_type *tp, const char *fmt, ...)
491 fprintf(F, "edge: { sourcename: ");
492 print_nodeid(F, irn);
493 fprintf(F, " targetname: ");
495 ir_vfprintf(F, fmt, ap);
501 * Prints the edge from a node irn to an entity ent with additional info fmt, ...
504 static void print_node_ent_edge(FILE *F, const ir_node *irn, const ir_entity *ent, const char *fmt, ...)
509 fprintf(F, "edge: { sourcename: ");
510 print_nodeid(F, irn);
511 fprintf(F, " targetname: ");
512 print_entityid(F, ent);
513 ir_vfprintf(F, fmt, ap);
519 * Prints the edge from a type tp to an enumeration item item with additional info fmt, ...
522 static void print_enum_item_edge(FILE *F, const ir_type *tp, size_t item, const char *fmt, ...)
527 fprintf(F, "edge: { sourcename: ");
529 fprintf(F, " targetname: ");
530 print_itemid(F, tp, item);
531 ir_vfprintf(F, fmt, ap);
536 /*-----------------------------------------------------------------*/
537 /* global and ahead declarations */
538 /*-----------------------------------------------------------------*/
540 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
542 /*-----------------------------------------------------------------*/
543 /* Helper functions. */
544 /*-----------------------------------------------------------------*/
547 * This map is used as a private link attr to be able to call dumper
548 * anywhere without destroying link fields.
550 static pmap *irdump_link_map = NULL;
552 /** NOT A STANDARD LIBFIRM INIT METHOD
554 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
555 * are off, we want to have as few interferences as possible. Therefore the
556 * initialization is performed lazily and not called from within init_firm.
558 * Creates the link attribute map. */
559 static void init_irdump(void)
561 /* We need a new, empty map. */
562 if (irdump_link_map) pmap_destroy(irdump_link_map);
563 irdump_link_map = pmap_create();
564 if (!dump_file_filter_id)
565 dump_file_filter_id = new_id_from_str("");
569 * Returns the private link field.
571 static void *ird_get_irn_link(const ir_node *n)
573 if (irdump_link_map == NULL)
576 return pmap_get(void, irdump_link_map, n);
580 * Sets the private link field.
582 static void ird_set_irn_link(const ir_node *n, void *x)
584 if (irdump_link_map == NULL)
586 pmap_insert(irdump_link_map, n, x);
590 * Gets the private link field of an irg.
592 static void *ird_get_irg_link(const ir_graph *irg)
594 if (irdump_link_map == NULL)
597 return pmap_get(void, irdump_link_map, irg);
601 * Sets the private link field of an irg.
603 static void ird_set_irg_link(const ir_graph *irg, void *x)
605 if (irdump_link_map == NULL)
607 pmap_insert(irdump_link_map, irg, x);
611 * Walker, clears the private link field.
613 static void clear_link(ir_node *node, void *env)
616 ird_set_irn_link(node, NULL);
620 * If the entity has a ld_name, returns it if the dump_ld_name is set,
621 * else returns the name of the entity.
623 static const char *get_ent_dump_name_(const ir_entity *ent, bool dump_ld_name)
626 return "<NULL entity>";
628 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
629 if (ent->ld_name != NULL)
630 return get_id_str(ent->ld_name);
632 return get_id_str(ent->name);
635 const char *get_ent_dump_name(const ir_entity *ent)
637 return get_ent_dump_name_(ent, flags & ir_dump_flag_ld_names);
640 const char *get_irg_dump_name(const ir_graph *irg)
642 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
643 return get_ent_dump_name_(get_irg_entity(irg), true);
647 * Returns non-zero if a node is in floating state.
649 static int node_floats(const ir_node *n)
651 ir_graph *irg = get_irn_irg(n);
652 return ((get_irn_pinned(n) == op_pin_state_floats) &&
653 (get_irg_pinned(irg) == op_pin_state_floats));
657 * Walker that visits the anchors
659 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
661 if ((flags & ir_dump_flag_all_anchors)
662 || ((flags & ir_dump_flag_iredges) && edges_activated(irg))) {
663 irg_walk_anchors(irg, pre, post, env);
665 irg_walk_graph(irg, pre, post, env);
670 * Walker, allocates an array for all blocks and puts their non-floating
671 * nodes into this array.
673 static void collect_node(ir_node *node, void *env)
678 || (get_op_flags(get_irn_op(node)) & irop_flag_dump_noblock)) {
679 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
680 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
681 ARR_APP1(ir_node *, arr, node);
682 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
684 ir_node * block = get_nodes_block(node);
687 /* this node is in a Bad block, so we must place it into the graph's list */
688 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
689 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
690 ARR_APP1(ir_node *, arr, node);
691 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
693 ird_set_irn_link(node, ird_get_irn_link(block));
694 ird_set_irn_link(block, node);
699 /** Construct lists to walk ir block-wise.
701 * Collects all blocks, nodes not op_pin_state_pinned,
702 * Bad, NoMem and Unknown into a flexible array in link field of
703 * irg they belong to. Sets the irg link field to NULL in all
704 * graphs not visited.
705 * Free the list with DEL_ARR_F().
707 static ir_node **construct_block_lists(ir_graph *irg)
710 int walk_flag = ir_resources_reserved(irg) & IR_RESOURCE_IRN_VISITED;
713 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
716 for (i = get_irp_n_irgs(); i > 0;)
717 ird_set_irg_link(get_irp_irg(--i), NULL);
719 ird_walk_graph(irg, clear_link, collect_node, irg);
722 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
725 return (ir_node**)ird_get_irg_link(irg);
728 void dump_node_opcode(FILE *F, const ir_node *n)
730 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
732 /* call the dump_node operation if available */
733 if (ops->dump_node) {
734 ops->dump_node(F, n, dump_node_opcode_txt);
738 /* implementation for default nodes */
739 switch (get_irn_opcode(n)) {
741 switch (get_SymConst_kind(n)) {
742 case symconst_addr_ent:
743 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
745 case symconst_ofs_ent:
746 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
748 case symconst_type_size:
749 ir_fprintf(F, "SymC %+F size", get_SymConst_type(n));
751 case symconst_type_align:
752 ir_fprintf(F, "SymC %+F align", get_SymConst_type(n));
754 case symconst_enum_const:
755 fprintf(F, "SymC %s enum", get_enumeration_const_name(get_SymConst_enum(n)));
761 if (get_Load_unaligned(n) == align_non_aligned)
763 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n)));
766 if (get_Store_unaligned(n) == align_non_aligned)
768 fprintf(F, "%s", get_irn_opname(n));
771 if (n == get_irg_start_block(get_irn_irg(n)))
773 if (n == get_irg_end_block(get_irn_irg(n)))
775 fprintf(F, "%s%s", get_irn_opname(n),
776 (flags & ir_dump_flag_show_marks) ? (get_Block_mark(n) ? "*" : "") : "");
779 fprintf(F, "%s", get_irn_opname(n));
780 if (get_Div_no_remainder(n))
782 fprintf(F, "[%s]", get_mode_name_ex(get_Div_resmode(n)));
785 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n)));
788 fprintf(F, "%s[%s]", get_irn_opname(n), get_builtin_kind_name(get_Builtin_kind(n)));
792 fprintf(F, "%s", get_irn_opname(n));
797 * Dump the mode of a node n to a file F.
798 * Ignore modes that are "always known".
800 static void dump_node_mode(FILE *F, const ir_node *n)
802 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
806 /* call the dump_node operation if available */
807 if (ops->dump_node) {
808 ops->dump_node(F, n, dump_node_mode_txt);
812 /* default implementation */
813 iro = get_irn_opcode(n);
825 mode = get_irn_mode(n);
827 if (mode != NULL && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
828 (mode != mode_T || iro == iro_Proj))
829 fprintf(F, "%s", get_mode_name_ex(mode));
834 * Dump the type of a node n to a file F if it's known.
836 static int dump_node_typeinfo(FILE *F, const ir_node *n)
838 ir_graph *irg = get_irn_irg(n);
841 if (ir_get_dump_flags() & ir_dump_flag_analysed_types) {
842 if (get_irg_typeinfo_state(irg) == ir_typeinfo_consistent ||
843 get_irg_typeinfo_state(irg) == ir_typeinfo_inconsistent) {
844 ir_type *tp = get_irn_typeinfo_type(n);
845 if (tp != get_none_type()) {
846 ir_fprintf(F, "[%+F]", tp);
856 * Dump additional node attributes of some nodes to a file F.
858 static void dump_node_nodeattr(FILE *F, const ir_node *n)
863 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
865 /* call the dump_node operation if available */
866 if (ops->dump_node) {
867 ops->dump_node(F, n, dump_node_nodeattr_txt);
871 switch (get_irn_opcode(n)) {
873 ir_fprintf(F, "%T ", get_Const_tarval(n));
877 pred = get_Proj_pred(n);
878 proj_nr = get_Proj_proj(n);
879 code = get_irn_opcode(pred);
881 if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start) {
882 fprintf(F, "Arg %ld ", proj_nr);
884 unsigned i, j, f = 0;
886 for (i = 0; i < ARRAY_SIZE(proj_lut); ++i) {
887 if (code == proj_lut[i].code) {
888 for (j = 0; j < proj_lut[i].num_data; ++j) {
889 if (proj_nr == proj_lut[i].data[j].nr) {
890 fprintf(F, "%s ", proj_lut[i].data[j].name);
899 fprintf(F, "%ld ", proj_nr);
900 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
901 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
903 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
909 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
912 ir_fprintf(F, "(%+F)", get_Cast_type(n));
915 fprintf(F, "%s ", get_relation_string(get_Cmp_relation(n)));
918 fprintf(F, "%s ", get_relation_string(get_Confirm_relation(n)));
921 ir_fprintf(F, "(%+F)", get_CopyB_type(n));
929 void dump_node_label(FILE *F, const ir_node *n)
931 dump_node_opcode(F, n);
933 dump_node_mode(F, n);
935 dump_node_typeinfo(F, n);
936 dump_node_nodeattr(F, n);
937 if (flags & ir_dump_flag_number_label) {
938 fprintf(F, "%ld", get_irn_node_nr(n));
940 if (flags & ir_dump_flag_idx_label) {
941 fprintf(F, ":%u", get_irn_idx(n));
946 * Dumps the attributes of a node n into the file F.
947 * Currently this is only the color of a node.
949 static void dump_node_vcgattr(FILE *F, const ir_node *node, const ir_node *local, bool bad)
955 print_vcg_color(F, ird_color_error);
959 if (dump_node_vcgattr_hook != NULL) {
960 dump_node_vcgattr_hook(F, node, local);
964 n = local ? local : node;
966 if (overrule_nodecolor != ird_color_default_node) {
967 print_vcg_color(F, overrule_nodecolor);
971 mode = get_irn_mode(n);
972 if (mode == mode_M) {
973 print_vcg_color(F, ird_color_memory);
976 if (mode == mode_X) {
977 print_vcg_color(F, ird_color_controlflow);
981 switch (get_irn_opcode(n)) {
984 print_vcg_color(F, ird_color_anchor);
987 print_vcg_color(F, ird_color_error);
990 print_vcg_color(F, ird_color_block_background);
993 print_vcg_color(F, ird_color_phi);
996 print_vcg_color(F, ird_color_memory);
1000 print_vcg_color(F, ird_color_const);
1003 print_vcg_color(F, ird_color_proj);
1006 ir_op *op = get_irn_op(node);
1008 if (is_op_constlike(op)) {
1009 print_vcg_color(F, ird_color_const);
1010 } else if (is_op_uses_memory(op)) {
1011 print_vcg_color(F, ird_color_uses_memory);
1012 } else if (is_op_cfopcode(op) || is_op_forking(op)) {
1013 print_vcg_color(F, ird_color_controlflow);
1019 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1021 hook_entry_t *info = XMALLOCZ(hook_entry_t);
1023 info->hook._hook_node_info = cb;
1024 info->context = data;
1025 register_hook(hook_node_info, info);
1030 void dump_remove_node_info_callback(void *handle)
1032 hook_entry_t *info = (hook_entry_t*)handle;
1033 unregister_hook(hook_node_info, info);
1038 * Dump the node information of a node n to a file F.
1040 static void dump_node_info(FILE *F, const ir_node *n)
1042 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1044 fprintf(F, " info1: \"");
1045 dump_irnode_to_file(F, n);
1046 /* call the dump_node operation if available */
1048 ops->dump_node(F, n, dump_node_info_txt);
1050 /* allow additional info to be added */
1051 hook_node_info(F, n);
1055 static int is_constlike_node(const ir_node *node)
1057 const ir_op *op = get_irn_op(node);
1058 return is_op_constlike(op);
1061 static void print_constid(FILE *F, const ir_node *user, const ir_node *node)
1063 fprintf(F, "\"n%ldb%ld\"", get_irn_node_nr(user), get_irn_node_nr(node));
1066 static void print_constblkid(FILE *F, const ir_node *node, const ir_node *block)
1068 fprintf(F, "\"n%ldb%ld\"", get_irn_node_nr(node), get_irn_node_nr(block));
1072 /** outputs the predecessors of n, that are constants, local. I.e.,
1073 generates a copy of the constant predecessors for each node called with. */
1074 static void dump_const_node_local(FILE *F, const ir_node *n)
1076 ir_graph *irg = get_irn_irg(n);
1078 if (!get_opt_dump_const_local()) return;
1080 /* Use visited flag to avoid outputting nodes twice.
1081 initialize it first. */
1082 for (i = 0; i < get_irn_arity(n); i++) {
1083 ir_node *con = get_irn_n(n, i);
1084 if (is_constlike_node(con)) {
1085 set_irn_visited(con, get_irg_visited(irg) - 1);
1089 for (i = 0; i < get_irn_arity(n); i++) {
1090 ir_node *con = get_irn_n(n, i);
1091 if (is_constlike_node(con) && !irn_visited_else_mark(con)) {
1092 /* Generate a new name for the node by appending the names of
1094 fprintf(F, "node: {title: ");
1095 print_constid(F, n, con);
1096 fprintf(F, " label: \"");
1097 dump_node_label(F, con);
1099 dump_node_info(F, con);
1100 dump_node_vcgattr(F, n, con, 0);
1106 /** If the block of an edge is a const_like node, dump it local with an edge */
1107 static void dump_const_block_local(FILE *F, const ir_node *n)
1111 if (!get_opt_dump_const_local()) return;
1113 blk = get_nodes_block(n);
1114 if (is_constlike_node(blk)) {
1115 /* Generate a new name for the node by appending the names of
1117 fprintf(F, "node: {title: ");
1118 print_constblkid(F, n, blk);
1119 fprintf(F, " label: \"");
1120 dump_node_label(F, blk);
1122 dump_node_info(F, blk);
1123 dump_node_vcgattr(F, n, blk, 0);
1126 fprintf(F, "edge: { sourcename: ");
1128 fprintf(F, " targetname: ");
1129 print_constblkid(F, n, blk);
1132 if (dump_edge_vcgattr_hook != NULL
1133 && dump_edge_vcgattr_hook(F, n, -1)) {
1138 fprintf(F, BLOCK_EDGE_ATTR "}\n");
1143 * prints the error message of a node to a file F as info2.
1145 static void print_node_error(FILE *F, const char *err_msg)
1150 fprintf(F, " info2: \"%s\"", err_msg);
1154 * prints debug messages of a node to file F as info3.
1156 static void print_dbg_info(FILE *F, dbg_info *dbg)
1160 ir_dbg_info_snprint(buf, sizeof(buf), dbg);
1162 fprintf(F, " info3: \"%s\"\n", buf);
1166 static void print_type_dbg_info(FILE *F, type_dbg_info *dbg)
1176 void dump_node(FILE *F, const ir_node *n)
1182 if (get_opt_dump_const_local() && is_constlike_node(n))
1185 /* dump this node */
1186 fputs("node: {title: ", F);
1189 fputs(" label: \"", F);
1190 irg = get_irn_irg(n);
1191 bad = ! irn_verify_irg_dump(n, irg, &p);
1192 dump_node_label(F, n);
1195 dump_node_info(F, n);
1196 print_node_error(F, p);
1197 print_dbg_info(F, get_irn_dbg_info(n));
1198 dump_node_vcgattr(F, n, NULL, bad);
1200 dump_const_node_local(F, n);
1204 /** dump the edge to the block this node belongs to */
1205 static void dump_ir_block_edge(FILE *F, const ir_node *n)
1207 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1209 ir_node *block = get_nodes_block(n);
1211 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1212 dump_const_block_local(F, n);
1214 fprintf(F, "edge: { sourcename: ");
1216 fprintf(F, " targetname: ");
1217 print_nodeid(F, block);
1220 if (dump_edge_vcgattr_hook && dump_edge_vcgattr_hook(F, n, -1)) {
1225 fprintf(F, BLOCK_EDGE_ATTR "}\n");
1230 static void print_data_edge_vcgattr(FILE *F, const ir_node *from, int to)
1233 * do not use get_nodes_block() here, will fail
1234 * if the irg is not pinned.
1236 if (get_nodes_block(from) == get_nodes_block(get_irn_n(from, to)))
1237 fprintf(F, INTRA_DATA_EDGE_ATTR);
1239 fprintf(F, INTER_DATA_EDGE_ATTR);
1242 static void print_mem_edge_vcgattr(FILE *F, const ir_node *from, int to)
1245 * do not use get_nodes_block() here, will fail
1246 * if the irg is not pinned.
1248 if (get_nodes_block(from) == get_nodes_block(get_irn_n(from, to)))
1249 fprintf(F, INTRA_MEM_EDGE_ATTR);
1251 fprintf(F, INTER_MEM_EDGE_ATTR);
1254 /** Print the vcg attributes for the edge from node "from" to its "to"th input */
1255 static void print_edge_vcgattr(FILE *F, const ir_node *from, int to)
1259 if (dump_edge_vcgattr_hook)
1260 if (dump_edge_vcgattr_hook(F, from, to))
1263 if ((flags & ir_dump_flag_back_edges) && is_backedge(from, to))
1264 fprintf(F, BACK_EDGE_ATTR);
1266 switch (get_irn_opcode(from)) {
1268 fprintf(F, CF_EDGE_ATTR);
1270 case iro_Start: break;
1273 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1274 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1276 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1280 if (is_Proj(from)) {
1281 if (get_irn_mode(from) == mode_M)
1282 print_mem_edge_vcgattr(F, from, to);
1283 else if (get_irn_mode(from) == mode_X)
1284 fprintf(F, CF_EDGE_ATTR);
1286 print_data_edge_vcgattr(F, from, to);
1288 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1289 print_mem_edge_vcgattr(F, from, to);
1290 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1291 fprintf(F, CF_EDGE_ATTR);
1293 print_data_edge_vcgattr(F, from, to);
1297 /** dump edges to our inputs */
1298 static void dump_ir_data_edges(FILE *F, const ir_node *n)
1302 if (dump_node_edge_hook)
1303 dump_node_edge_hook(F, n);
1305 if (!(flags & ir_dump_flag_keepalive_edges) && is_End(n)) {
1306 /* the End node has only keep-alive edges */
1310 /* dump the dependency edges. */
1311 num = get_irn_deps(n);
1312 for (i = 0; i < num; ++i) {
1313 ir_node *dep = get_irn_dep(n, i);
1316 print_node_edge_kind(F, n);
1317 fprintf(F, "{sourcename: ");
1319 fprintf(F, " targetname: ");
1320 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1321 print_constid(F, n, dep);
1323 print_nodeid(F, dep);
1325 fprintf(F, " label: \"%d\" ", i);
1326 fprintf(F, " color: darkgreen}\n");
1330 num = get_irn_arity(n);
1331 for (i = 0; i < num; i++) {
1332 ir_node *pred = get_irn_n(n, i);
1335 if ((flags & ir_dump_flag_back_edges) && is_backedge(n, i)) {
1336 fprintf(F, "backedge: {sourcename: ");
1338 print_node_edge_kind(F, n);
1339 fprintf(F, "{sourcename: ");
1342 fprintf(F, " targetname: ");
1343 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1344 print_constid(F, n, pred);
1346 print_nodeid(F, pred);
1348 fprintf(F, " label: \"%d\" ", i);
1349 print_edge_vcgattr(F, n, i);
1357 static void dump_ir_edges(ir_node *node, void *env)
1360 FILE *F = (FILE*)env;
1362 foreach_out_edge(node, edge) {
1363 ir_node *succ = get_edge_src_irn(edge);
1365 print_node_edge_kind(F, succ);
1366 fprintf(F, "{sourcename: ");
1367 print_nodeid(F, node);
1368 fprintf(F, " targetname: ");
1369 print_nodeid(F, succ);
1371 fprintf(F, " label: \"%d\" ", i);
1372 fprintf(F, OUT_EDGE_ATTR);
1379 /** Dumps a node and its edges but not the block edge */
1380 static void dump_node_wo_blockedge(FILE *F, const ir_node *n)
1383 dump_ir_data_edges(F, n);
1386 /** Dumps a node and its edges. */
1387 static void dump_node_with_edges(ir_node *n, void *env)
1389 FILE *F = (FILE*)env;
1390 dump_node_wo_blockedge(F, n);
1391 if (!node_floats(n))
1392 dump_ir_block_edge(F, n);
1395 /** Dumps a const-like node. */
1396 static void dump_const_node(ir_node *n, void *env)
1398 FILE *F = (FILE*)env;
1399 if (is_Block(n)) return;
1400 dump_node_wo_blockedge(F, n);
1403 /***********************************************************************/
1404 /* the following routines dump the nodes/irgs bracketed to graphs. */
1405 /***********************************************************************/
1407 /** Dumps a constant expression as entity initializer, array bound ... */
1408 static void dump_const_expression(FILE *F, ir_node *value)
1410 ir_graph *irg = get_const_code_irg();
1411 ir_dump_flags_t old_flags = ir_get_dump_flags();
1412 ir_remove_dump_flags(ir_dump_flag_consts_local);
1414 irg_walk(value, dump_const_node, NULL, F);
1415 /* Decrease visited flag so that we walk with the same flag for the next
1416 expression. This guarantees that we don't dump the same node twice,
1417 as for const expressions cse is performed to save memory. */
1418 set_irg_visited(irg, get_irg_visited(irg) -1);
1420 ir_set_dump_flags(old_flags);
1423 /** Dump a block as graph containing its nodes.
1425 * Expects to find nodes belonging to the block as list in its
1427 * Dumps the edges of all nodes including itself. */
1428 static void dump_whole_block(FILE *F, const ir_node *block)
1432 assert(is_Block(block));
1434 fprintf(F, "graph: { title: ");
1435 print_nodeid(F, block);
1436 fprintf(F, " label: \"");
1437 dump_node_label(F, block);
1439 fprintf(F, "\" status:clustered ");
1440 /* colorize blocks */
1441 ird_color_t const color =
1442 !get_Block_matured(block) ? ird_color_error :
1443 ird_color_block_background;
1444 print_vcg_color(F, color);
1447 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1448 dump_node_info(F, block);
1449 print_dbg_info(F, get_irn_dbg_info(block));
1451 /* dump the blocks edges */
1452 dump_ir_data_edges(F, block);
1454 if (dump_block_edge_hook)
1455 dump_block_edge_hook(F, block);
1457 /* dump the nodes that go into the block */
1458 for (node = (ir_node*)ird_get_irn_link(block); node; node = (ir_node*)ird_get_irn_link(node)) {
1460 dump_ir_data_edges(F, node);
1463 /* Close the vcg information for the block */
1465 dump_const_node_local(F, block);
1469 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1470 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1471 static void dump_block_graph(FILE *F, ir_graph *irg)
1474 ir_node **arr = (ir_node**)ird_get_irg_link(irg);
1476 for (i = 0, n = ARR_LEN(arr); i < n; ++i) {
1477 ir_node *node = arr[i];
1478 if (is_Block(node)) {
1479 /* Dumps the block and all the nodes in the block, which are to
1480 be found in Block->link. */
1481 dump_whole_block(F, node);
1483 /* Nodes that are not in a Block. */
1485 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1486 dump_const_block_local(F, node);
1488 dump_ir_data_edges(F, node);
1490 if ((flags & ir_dump_flag_iredges) && edges_activated(irg))
1491 dump_ir_edges(node, F);
1494 if ((flags & ir_dump_flag_loops)
1495 && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO))
1496 dump_loop_nodes_into_graph(F, irg);
1500 * Dump the info for an irg.
1501 * Parsed by XVCG but not shown. use yComp.
1503 static void dump_graph_info(FILE *F, ir_graph *irg)
1505 fprintf(F, "info1: \"");
1506 dump_entity_to_file(F, get_irg_entity(irg));
1509 /* dump graph state */
1510 fprintf(F, "constraints:");
1511 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_ARCH_DEP))
1512 fprintf(F, " arch_dep");
1513 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED))
1514 fprintf(F, " modeb_lowered");
1515 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_NORMALISATION2))
1516 fprintf(F, " normalisation2");
1517 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE))
1518 fprintf(F, " optimize_unreachable_code");
1521 fprintf(F, "properties:");
1522 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_CRITICAL_EDGES))
1523 fprintf(F, " no_critical_edges");
1524 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS))
1525 fprintf(F, " no_bads");
1526 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE))
1527 fprintf(F, " no_unreachable_code");
1528 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_ONE_RETURN))
1529 fprintf(F, " one_return");
1530 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE))
1531 fprintf(F, " consistent_dominance");
1532 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_POSTDOMINANCE))
1533 fprintf(F, " consistent_postdominance");
1534 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES))
1535 fprintf(F, " consistent_out_edges");
1536 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS))
1537 fprintf(F, " consistent_outs");
1538 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO))
1539 fprintf(F, " consistent_loopinfo");
1540 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_ENTITY_USAGE))
1541 fprintf(F, " consistent_entity_usage");
1545 /** Dumps an irg as a graph clustered by block nodes.
1546 * If interprocedural view edges can point to nodes out of this graph.
1548 static void dump_graph_from_list(FILE *F, ir_graph *irg)
1550 ir_entity *ent = get_irg_entity(irg);
1552 fprintf(F, "graph: { title: ");
1553 print_irgid(F, irg);
1554 fprintf(F, " label: \"%s\" status:clustered color:%s\n",
1555 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1557 dump_graph_info(F, irg);
1558 print_dbg_info(F, get_entity_dbg_info(ent));
1560 dump_block_graph(F, irg);
1562 /* Close the vcg information for the irg */
1563 fprintf(F, "}\n\n");
1566 /*******************************************************************/
1567 /* Basic type and entity nodes and edges. */
1568 /*******************************************************************/
1570 /** dumps the edges between nodes and their type or entity attributes. */
1571 static void dump_node2type_edges(ir_node *n, void *env)
1573 FILE *F = (FILE*)env;
1576 switch (get_irn_opcode(n)) {
1578 /* @@@ some consts have an entity */
1581 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1582 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1585 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1588 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1591 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1594 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1597 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1604 static void print_typespecific_vcgattr(FILE *F, ir_type *tp)
1606 switch (get_type_tpop_code(tp)) {
1608 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1611 fprintf(F, " " TYPE_METH_NODE_ATTR);
1619 case tpo_enumeration:
1630 void dump_type_node(FILE *F, ir_type *tp)
1632 fprintf(F, "node: {title: ");
1633 print_typeid(F, tp);
1634 fprintf(F, " label: \"");
1635 if (tp->dbi != NULL) {
1637 ir_print_type(buf, sizeof(buf), tp);
1638 fprintf(F, "%s '%s'", get_type_tpop_name(tp), buf);
1640 ir_fprintf(F, "%+F", tp);
1642 fputs("\" info1: \"", F);
1643 dump_type_to_file(F, tp);
1645 print_type_dbg_info(F, get_type_dbg_info(tp));
1646 print_typespecific_vcgattr(F, tp);
1650 static void dump_entity_node(FILE *F, ir_entity *ent)
1652 fprintf(F, "node: {title: ");
1653 print_entityid(F, ent);
1654 fprintf(F, " label: ");
1655 fprintf(F, "\"%s\" ", get_ent_dump_name(ent));
1657 print_vcg_color(F, ird_color_entity);
1658 fprintf(F, "\n info1: \"");
1660 dump_entity_to_file(F, ent);
1663 print_dbg_info(F, get_entity_dbg_info(ent));
1667 static void dump_enum_item(FILE *F, ir_type *tp, size_t pos)
1670 ir_enum_const *ec = get_enumeration_const(tp, pos);
1671 ident *id = get_enumeration_const_nameid(ec);
1672 ir_tarval *tv = get_enumeration_value(ec);
1675 tarval_snprintf(buf, sizeof(buf), tv);
1677 strncpy(buf, "<not set>", sizeof(buf));
1678 fprintf(F, "node: {title: ");
1679 print_itemid(F, tp, pos);
1680 fprintf(F, " label: ");
1681 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1682 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1686 * Dumps a new style initializer.
1688 static void dump_entity_initializer(FILE *F, const ir_entity *ent)
1696 * type-walker: Dumps a type or entity and its edges.
1698 static void dump_type_info(type_or_ent tore, void *env)
1700 FILE *F = (FILE*)env;
1701 size_t i = 0; /* to shutup gcc */
1703 /* dump this type or entity */
1705 switch (get_kind(tore.ent)) {
1707 ir_entity *ent = tore.ent;
1709 dump_entity_node(F, ent);
1711 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1712 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1713 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1714 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1715 if (is_Class_type(get_entity_owner(ent))) {
1716 for (i = get_entity_n_overwrites(ent); i > 0;)
1717 print_ent_ent_edge(F, ent, get_entity_overwrites(ent, --i), 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1719 /* attached subgraphs */
1720 if (! (flags & ir_dump_flag_no_entity_values)) {
1721 if (ent->initializer != NULL) {
1722 /* new style initializers */
1723 dump_entity_initializer(F, ent);
1729 ir_type *tp = tore.typ;
1730 dump_type_node(F, tp);
1731 /* and now the edges */
1732 switch (get_type_tpop_code(tp)) {
1734 for (i = get_class_n_supertypes(tp); i > 0;) {
1736 print_type_type_edge(F, tp, get_class_supertype(tp, i), TYPE_SUPER_EDGE_ATTR);
1738 for (i = get_class_n_members(tp); i > 0;) {
1740 print_type_ent_edge(F, tp, get_class_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1744 for (i = get_struct_n_members(tp); i > 0;) {
1746 print_type_ent_edge(F, tp, get_struct_member(tp, i), TYPE_MEMBER_EDGE_ATTR);
1750 for (i = get_method_n_params(tp); i > 0;) {
1752 print_type_type_edge(F, tp, get_method_param_type(tp, i), METH_PAR_EDGE_ATTR,i);
1754 for (i = get_method_n_ress(tp); i > 0;) {
1756 print_type_type_edge(F, tp, get_method_res_type(tp, i), METH_RES_EDGE_ATTR,i);
1760 for (i = get_union_n_members(tp); i > 0;) {
1762 print_type_ent_edge(F, tp, get_union_member(tp, i), UNION_EDGE_ATTR);
1766 print_type_type_edge(F, tp, get_array_element_type(tp), ARR_ELT_TYPE_EDGE_ATTR);
1767 print_type_ent_edge(F, tp, get_array_element_entity(tp), ARR_ENT_EDGE_ATTR);
1768 for (i = get_array_n_dimensions(tp); i > 0;) {
1769 ir_node *upper, *lower;
1772 upper = get_array_upper_bound(tp, i);
1773 lower = get_array_lower_bound(tp, i);
1774 print_node_type_edge(F, upper, tp, "label: \"upper %zu\"", get_array_order(tp, i));
1775 print_node_type_edge(F, lower, tp, "label: \"lower %zu\"", get_array_order(tp, i));
1776 dump_const_expression(F, upper);
1777 dump_const_expression(F, lower);
1780 case tpo_enumeration:
1781 for (i = get_enumeration_n_enums(tp); i > 0;) {
1783 dump_enum_item(F, tp, i);
1784 print_enum_item_edge(F, tp, i, "label: \"item %zu\"", i);
1788 print_type_type_edge(F, tp, get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1792 case tpo_uninitialized:
1797 break; /* case k_type */
1800 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1804 /** For dumping class hierarchies.
1805 * Dumps a class type node and a superclass edge.
1807 static void dump_class_hierarchy_node(type_or_ent tore, void *ctx)
1809 FILE *F = (FILE*)ctx;
1810 size_t i = 0; /* to shutup gcc */
1812 /* dump this type or entity */
1813 switch (get_kind(tore.ent)) {
1815 ir_entity *ent = tore.ent;
1816 if (get_entity_owner(ent) == get_glob_type()) break;
1817 if (!is_Method_type(get_entity_type(ent)))
1819 if (flags & ir_dump_flag_entities_in_hierarchy
1820 && is_Class_type(get_entity_owner(ent))) {
1822 dump_entity_node(F, ent);
1824 print_type_ent_edge(F, get_entity_owner(ent), ent, TYPE_MEMBER_EDGE_ATTR);
1825 for (i = get_entity_n_overwrites(ent); i > 0;) {
1827 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ird_color_none, ENT_OVERWRITES_EDGE_ATTR);
1833 ir_type *tp = tore.typ;
1834 if (tp == get_glob_type())
1836 switch (get_type_tpop_code(tp)) {
1838 dump_type_node(F, tp);
1839 /* and now the edges */
1840 for (i = get_class_n_supertypes(tp); i > 0;) {
1842 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1847 break; /* case k_type */
1850 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1854 /*******************************************************************/
1855 /* dump analysis information that is expressed in graph terms. */
1856 /*******************************************************************/
1858 /* dump out edges */
1859 static void dump_out_edge(ir_node *n, void *env)
1861 FILE *F = (FILE*)env;
1863 for (i = get_irn_n_outs(n) - 1; i >= 0; --i) {
1864 ir_node *succ = get_irn_out(n, i);
1866 print_node_edge_kind(F, succ);
1867 fprintf(F, "{sourcename: ");
1869 fprintf(F, " targetname: ");
1870 print_nodeid(F, succ);
1871 fprintf(F, " color: red linestyle: dashed");
1876 static void dump_loop_label(FILE *F, const ir_loop *loop)
1878 fprintf(F, "loop %u", get_loop_depth(loop));
1881 static void dump_loop_info(FILE *F, const ir_loop *loop)
1883 fprintf(F, " info1: \"");
1884 fprintf(F, " loop nr: %ld", get_loop_loop_nr(loop));
1885 #ifdef DEBUG_libfirm
1886 fprintf(F, "\n The loop was analyzed %ld times.", (long int) PTR_TO_INT(get_loop_link(loop)));
1891 void print_loopid(FILE *F, const ir_loop *loop)
1893 fprintf(F, "\"l%ld\"", get_loop_loop_nr(loop));
1896 static void dump_loop_node(FILE *F, const ir_loop *loop)
1898 fprintf(F, "node: {title: ");
1899 print_loopid(F, loop);
1900 fprintf(F, " label: \"");
1901 dump_loop_label(F, loop);
1903 dump_loop_info(F, loop);
1907 static void dump_loop_node_edge(FILE *F, const ir_loop *loop, size_t i)
1910 fprintf(F, "edge: {sourcename: ");
1911 print_loopid(F, loop);
1912 fprintf(F, " targetname: ");
1913 print_nodeid(F, get_loop_element(loop, i).node);
1914 fprintf(F, " color: green");
1918 static void dump_loop_son_edge(FILE *F, const ir_loop *loop, size_t i)
1921 fprintf(F, "edge: {sourcename: ");
1922 print_loopid(F, loop);
1923 fprintf(F, " targetname: ");
1924 print_loopid(F, get_loop_element(loop, i).son);
1925 ir_fprintf(F, " color: darkgreen label: \"%zu\"}\n", i);
1928 static void dump_loops(FILE *F, const ir_loop *loop)
1931 size_t n_elements = get_loop_n_elements(loop);
1932 /* dump this loop node */
1933 dump_loop_node(F, loop);
1935 /* dump edges to nodes in loop -- only if it is a real loop */
1936 if (get_loop_depth(loop) != 0) {
1937 for (i = n_elements; i > 0;) {
1938 loop_element element;
1940 element = get_loop_element(loop, i);
1941 if (*element.kind != k_ir_node)
1943 dump_loop_node_edge(F, loop, i);
1946 for (i = n_elements; i > 0;) {
1947 loop_element element;
1949 element = get_loop_element(loop, i);
1950 if (*element.kind != k_ir_loop)
1952 dump_loops(F, element.son);
1953 dump_loop_son_edge(F, loop, i);
1957 static void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg)
1959 ir_loop *loop = get_irg_loop(irg);
1961 dump_loops(F, loop);
1965 void dump_vcg_header_colors(FILE *F)
1969 for (i = 0; i < ird_color_count; ++i) {
1970 if (color_rgb[i] != NULL) {
1971 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
1976 void dump_vcg_infonames(FILE *F)
1979 "infoname 1: \"Attribute\"\n"
1980 "infoname 2: \"Verification errors\"\n"
1981 "infoname 3: \"Debug info\"\n", F);
1985 * dumps the VCG header
1987 void dump_vcg_header(FILE *F, const char *name, const char *layout, const char *orientation)
1990 = (flags & ir_dump_flag_disable_edge_labels) ? "no" : "yes";
1992 if (! layout) layout = "Compilergraph";
1993 if (!orientation) orientation = "bottom_to_top";
1997 "graph: { title: \"ir graph of %s\"\n"
1998 "display_edge_labels: %s\n"
1999 "layoutalgorithm: mindepth //$ \"%s\"\n"
2000 "manhattan_edges: yes\n"
2001 "port_sharing: no\n"
2003 "classname 1: \"intrablock Data\"\n"
2004 "classname 2: \"Block\"\n"
2005 "classname 3: \"Entity type\"\n"
2006 "classname 4: \"Entity owner\"\n"
2007 "classname 5: \"Method Param\"\n"
2008 "classname 6: \"Method Res\"\n"
2009 "classname 7: \"Super\"\n"
2010 "classname 8: \"Union\"\n"
2011 "classname 9: \"Points-to\"\n"
2012 "classname 10: \"Array Element Type\"\n"
2013 "classname 11: \"Overwrites\"\n"
2014 "classname 12: \"Member\"\n"
2015 "classname 13: \"Control Flow\"\n"
2016 "classname 14: \"intrablock Memory\"\n"
2017 "classname 15: \"Dominators\"\n"
2018 "classname 16: \"interblock Data\"\n"
2019 "classname 17: \"interblock Memory\"\n"
2020 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2021 "classname 19: \"Postdominators\"\n"
2022 "classname 20: \"Keep Alive\"\n"
2023 "classname 21: \"Out Edges\"\n"
2024 "classname 22: \"Macro Block Edges\"\n",
2025 name, label, layout, orientation);
2026 dump_vcg_infonames(F);
2027 dump_vcg_header_colors(F);
2032 * Dumps the vcg file footer
2034 void dump_vcg_footer(FILE *F)
2041 static void dump_blocks_as_subgraphs(FILE *out, ir_graph *irg)
2045 construct_block_lists(irg);
2048 * If we are in the interprocedural view, we dump not
2049 * only the requested irg but also all irgs that can be reached
2052 for (i = get_irp_n_irgs(); i > 0;) {
2053 ir_graph *other_irg = get_irp_irg(--i);
2054 ir_node **arr = (ir_node**)ird_get_irg_link(other_irg);
2058 dump_graph_from_list(out, other_irg);
2063 void dump_ir_graph_file(FILE *out, ir_graph *irg)
2065 dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL);
2068 if (flags & ir_dump_flag_blocks_as_subgraphs) {
2069 dump_blocks_as_subgraphs(out, irg);
2071 /* dump_node_with_edges must be called in post visiting predecessors */
2072 ird_walk_graph(irg, NULL, dump_node_with_edges, out);
2075 /* dump type info */
2076 if (flags & ir_dump_flag_with_typegraph) {
2077 type_walk_irg(irg, dump_type_info, NULL, out);
2078 inc_irg_visited(get_const_code_irg());
2079 /* dump edges from graph to type info */
2080 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2083 /* dump iredges out edges */
2084 if ((flags & ir_dump_flag_iredges) && edges_activated(irg)) {
2085 irg_walk_edges(get_irg_start_block(irg), dump_ir_edges, NULL, out);
2088 /* dump the out edges in a separate walk */
2089 if ((flags & ir_dump_flag_out_edges)
2090 && (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS))) {
2091 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2094 dump_vcg_footer(out);
2097 static void dump_block_to_cfg(ir_node *block, void *env)
2099 FILE *F = (FILE*)env;
2102 if (is_Bad(block) && get_irn_mode(block) == mode_X) {
2103 dump_node(F, block);
2106 if (is_Block(block)) {
2107 /* This is a block. Dump a node for the block. */
2108 fprintf(F, "node: {title: ");
2109 print_nodeid(F, block);
2110 fprintf(F, " label: \"");
2111 if (block == get_irg_start_block(get_irn_irg(block)))
2112 fprintf(F, "Start ");
2113 if (block == get_irg_end_block(get_irn_irg(block)))
2116 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2117 print_nodeid(F, block);
2119 fprintf(F, "info1:\"");
2121 /* the generic version. */
2122 dump_irnode_to_file(F, block);
2124 fprintf(F, "\""); /* closing quote of info */
2126 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2127 (block == get_irg_end_block(get_irn_irg(block))) )
2128 fprintf(F, " color:blue ");
2132 /* Dump the edges */
2133 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
2134 ir_node *pred = get_Block_cfgpred(block, i);
2136 pred = get_nodes_block(pred);
2137 fprintf(F, "edge: { sourcename: ");
2138 print_nodeid(F, block);
2139 fprintf(F, " targetname: ");
2140 print_nodeid(F, pred);
2141 fprintf(F, "\"}\n");
2144 /* Dump dominator/postdominator edge */
2145 if (ir_get_dump_flags() & ir_dump_flag_dominance) {
2146 if (irg_has_properties(get_irn_irg(block), IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) && get_Block_idom(block)) {
2147 ir_node *pred = get_Block_idom(block);
2148 fprintf(F, "edge: { sourcename: ");
2149 print_nodeid(F, block);
2150 fprintf(F, " targetname: ");
2151 print_nodeid(F, pred);
2152 fprintf(F, " " DOMINATOR_EDGE_ATTR "}\n");
2154 if (irg_has_properties(get_irn_irg(block), IR_GRAPH_PROPERTY_CONSISTENT_POSTDOMINANCE) && get_Block_ipostdom(block)) {
2155 ir_node *pred = get_Block_ipostdom(block);
2156 fprintf(F, "edge: { sourcename: ");
2157 print_nodeid(F, block);
2158 fprintf(F, " targetname: ");
2159 print_nodeid(F, pred);
2160 fprintf(F, " " POSTDOMINATOR_EDGE_ATTR "}\n");
2166 void dump_cfg(FILE *F, ir_graph *irg)
2168 dump_vcg_header(F, get_irg_dump_name(irg), NULL, NULL);
2170 /* walk over the blocks in the graph */
2171 irg_walk_graph(irg, dump_block_to_cfg, NULL, F);
2176 void dump_callgraph(FILE *F)
2179 ir_dump_flags_t old_flags = ir_get_dump_flags();
2181 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2182 dump_vcg_header(F, "Callgraph", "Hierarchic", NULL);
2184 for (i = get_irp_n_irgs(); i > 0;) {
2185 ir_graph *irg = get_irp_irg(--i);
2186 ir_entity *ent = get_irg_entity(irg);
2187 size_t j, n_callees = get_irg_n_callees(irg);
2189 dump_entity_node(F, ent);
2190 for (j = 0; j < n_callees; ++j) {
2191 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2192 int be = is_irg_callee_backedge(irg, j);
2193 const char *attr = be
2194 ? "label:\"recursion %zu\""
2195 : "label:\"calls %zu\"";
2196 print_ent_ent_edge(F, ent, c, be, ird_color_entity, attr,
2197 get_irg_callee_loop_depth(irg, j));
2201 ir_set_dump_flags(old_flags);
2205 void dump_typegraph(FILE *out)
2207 dump_vcg_header(out, "All_types", NULL, NULL);
2208 type_walk(dump_type_info, NULL, out);
2209 dump_vcg_footer(out);
2212 void dump_class_hierarchy(FILE *out)
2214 dump_vcg_header(out, "class_hierarchy", NULL, NULL);
2215 type_walk(dump_class_hierarchy_node, NULL, out);
2216 dump_vcg_footer(out);
2219 static void dump_loops_standalone(FILE *F, ir_loop *loop)
2222 bool loop_node_started = false;
2224 size_t son_number = 0;
2226 ir_loop *son = NULL;
2228 /* Dump a new loop node. */
2229 dump_loop_node(F, loop);
2231 /* Dump the loop elements. */
2232 for (i = 0; i < get_loop_n_elements(loop); i++) {
2233 le = get_loop_element(loop, i);
2235 if (get_kind(son) == k_ir_loop) {
2237 /* We are a loop son -> Recurse */
2239 if (loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2240 fprintf(F, "\" }\n");
2241 fprintf(F, "edge: {sourcename: ");
2242 print_loopid(F, loop);
2243 fprintf(F, " targetname: \"l%ld-%lu-nodes\" label:\"%lu...%lu\"}\n",
2244 get_loop_loop_nr(loop),
2245 (unsigned long) first,
2246 (unsigned long) first,
2247 (unsigned long) i-1);
2248 loop_node_started = false;
2250 dump_loop_son_edge(F, loop, son_number++);
2251 dump_loops_standalone(F, son);
2252 } else if (get_kind(son) == k_ir_node) {
2253 /* We are a loop node -> Collect firm nodes */
2255 ir_node *n = le.node;
2256 if (!loop_node_started) {
2257 /* Start a new node which contains all firm nodes of the current loop */
2258 fprintf(F, "node: { title: \"l%ld-%lu-nodes\" color: lightyellow label: \"",
2259 get_loop_loop_nr(loop),
2261 loop_node_started = true;
2266 dump_node_label(F, n);
2267 if (has_backedges(n)) fprintf(F, "\t loop head!");
2268 } else { /* for callgraph loop tree */
2270 assert(get_kind(son) == k_ir_graph);
2272 /* We are a loop node -> Collect firm graphs */
2274 if (!loop_node_started) {
2275 /* Start a new node which contains all firm nodes of the current loop */
2276 fprintf(F, "node: { title: \"l%ld-%lu-nodes\" color: lightyellow label: \"",
2277 get_loop_loop_nr(loop),
2279 loop_node_started = true;
2283 fprintf(F, " %s", get_irg_dump_name(n));
2284 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2288 if (loop_node_started) {
2289 fprintf(F, "\" }\n");
2290 fprintf(F, "edge: {sourcename: \"");
2291 print_loopid(F, loop);
2292 fprintf(F, "\" targetname: \"l%ld-%lu-nodes\" label:\"%lu...%lu\"}\n",
2293 get_loop_loop_nr(loop),
2294 (unsigned long) first,
2295 (unsigned long) first,
2296 (unsigned long) i-1);
2300 void dump_loop_tree(FILE *out, ir_graph *irg)
2302 ir_dump_flags_t old_flags = ir_get_dump_flags();
2304 ir_remove_dump_flags(ir_dump_flag_disable_edge_labels);
2306 dump_vcg_header(out, get_irg_dump_name(irg), "Tree", "top_to_bottom");
2308 if (get_irg_loop(irg))
2309 dump_loops_standalone(out, get_irg_loop(irg));
2311 dump_vcg_footer(out);
2313 ir_set_dump_flags(old_flags);
2316 void dump_callgraph_loop_tree(FILE *out)
2318 dump_vcg_header(out, "callgraph looptree", "Tree", "top_to_bottom");
2319 dump_loops_standalone(out, irp->outermost_cg_loop);
2320 dump_vcg_footer(out);
2323 static void collect_nodeloop(FILE *F, ir_loop *loop, pset *loopnodes)
2327 int node_number = 0;
2329 if (flags & ir_dump_flag_loops)
2330 dump_loop_node(F, loop);
2332 for (i = 0; i < get_loop_n_elements(loop); i++) {
2333 loop_element le = get_loop_element(loop, i);
2334 if (*(le.kind) == k_ir_loop) {
2335 if (flags & ir_dump_flag_loops)
2336 dump_loop_son_edge(F, loop, son_number++);
2338 collect_nodeloop(F, le.son, loopnodes);
2340 if (flags & ir_dump_flag_loops)
2341 dump_loop_node_edge(F, loop, node_number++);
2342 pset_insert_ptr(loopnodes, le.node);
2347 static void collect_nodeloop_external_nodes(ir_loop *loop, pset *loopnodes,
2353 for (i = 0; i < get_loop_n_elements(loop); i++) {
2354 loop_element le = get_loop_element(loop, i);
2355 if (*(le.kind) == k_ir_loop) {
2357 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2359 if (is_Block(le.node)) start = 0; else start = -1;
2360 for (j = start; j < get_irn_arity(le.node); j++) {
2361 ir_node *pred = get_irn_n(le.node, j);
2362 if (!pset_find_ptr(loopnodes, pred)) {
2363 pset_insert_ptr(extnodes, pred);
2364 if (!is_Block(pred)) {
2365 pred = get_nodes_block(pred);
2366 if (!pset_find_ptr(loopnodes, pred))
2367 pset_insert_ptr(extnodes, pred);
2375 void dump_loop(FILE *F, ir_loop *l)
2377 pset *loopnodes = pset_new_ptr_default();
2378 pset *extnodes = pset_new_ptr_default();
2381 snprintf(name, sizeof(name), "loop_%ld", get_loop_loop_nr(l));
2382 dump_vcg_header(F, name, NULL, NULL);
2384 /* collect all nodes to dump */
2385 collect_nodeloop(F, l, loopnodes);
2386 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2388 /* build block lists */
2389 foreach_pset(loopnodes, ir_node, n) {
2390 set_irn_link(n, NULL);
2392 foreach_pset(extnodes, ir_node, n) {
2393 set_irn_link(n, NULL);
2395 foreach_pset(loopnodes, ir_node, n) {
2397 ir_node *const b = get_nodes_block(n);
2398 set_irn_link(n, get_irn_link(b));
2402 foreach_pset(extnodes, ir_node, n) {
2404 ir_node *const b = get_nodes_block(n);
2405 set_irn_link(n, get_irn_link(b));
2410 foreach_pset(loopnodes, ir_node, b) {
2412 fprintf(F, "graph: { title: ");
2414 fprintf(F, " label: \"");
2415 dump_node_opcode(F, b);
2416 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2417 fprintf(F, "\" status:clustered color:yellow\n");
2419 /* dump the blocks edges */
2420 dump_ir_data_edges(F, b);
2422 /* dump the nodes that go into the block */
2423 for (ir_node *n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2424 if (pset_find_ptr(extnodes, n))
2425 overrule_nodecolor = ird_color_block_inout;
2427 overrule_nodecolor = ird_color_default_node;
2428 if (!pset_find_ptr(extnodes, n)) dump_ir_data_edges(F, n);
2431 /* Close the vcg information for the block */
2433 dump_const_node_local(F, b);
2437 foreach_pset(extnodes, ir_node, b) {
2439 fprintf(F, "graph: { title: ");
2441 fprintf(F, " label: \"");
2442 dump_node_opcode(F, b);
2443 fprintf(F, " %ld:%u", get_irn_node_nr(b), get_irn_idx(b));
2444 fprintf(F, "\" status:clustered color:lightblue\n");
2446 /* dump the nodes that go into the block */
2447 for (ir_node *n = (ir_node*)get_irn_link(b); n; n = (ir_node*)get_irn_link(n)) {
2448 if (!pset_find_ptr(loopnodes, n))
2449 overrule_nodecolor = ird_color_block_inout;
2451 overrule_nodecolor = ird_color_default_node;
2452 if (pset_find_ptr(loopnodes, n)) dump_ir_data_edges(F, n);
2455 /* Close the vcg information for the block */
2457 dump_const_node_local(F, b);
2461 del_pset(loopnodes);
2467 static bool obstack_init;
2468 static struct obstack obst;
2469 static char *dump_path;
2471 void ir_set_dump_path(const char *path)
2474 dump_path = xstrdup(path);
2477 static void add_string_escaped(const char *string)
2480 for (p = string; *p != '\0'; ++p) {
2483 obstack_1grow(&obst, '@');
2484 obstack_1grow(&obst, '1');
2485 } else if (c == '@') {
2486 obstack_1grow(&obst, '@');
2487 obstack_1grow(&obst, '2');
2489 obstack_1grow(&obst, c);
2494 static void add_dump_path(void)
2496 if (!obstack_init) {
2497 obstack_init(&obst);
2498 obstack_init = true;
2501 if (dump_path != NULL) {
2502 size_t len = strlen(dump_path);
2503 obstack_grow(&obst, dump_path, len);
2504 if (len > 0 && dump_path[len-1] != '/')
2505 obstack_1grow(&obst, '/');
2509 void dump_ir_graph_ext(ir_graph_dump_func func, ir_graph *graph,
2512 const char *dump_name = get_irg_dump_name(graph);
2516 if (!ir_should_dump(dump_name))
2521 add_string_escaped(dump_name);
2522 obstack_printf(&obst, "-%02u", graph->dump_nr++);
2524 if (suffix != NULL) {
2525 if (suffix[0] != '.')
2526 obstack_1grow(&obst, '-');
2527 add_string_escaped(suffix);
2529 obstack_1grow(&obst, '\0');
2531 file_name = (char*)obstack_finish(&obst);
2532 /* xvcg expects only <LF> so we need "b"inary mode (for win32) */
2533 out = fopen(file_name, "wb");
2534 obstack_free(&obst, file_name);
2537 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2545 void dump_ir_prog_ext(ir_prog_dump_func func, const char *suffix)
2552 obstack_printf(&obst, "%02u", irp->dump_nr++);
2553 if (suffix != NULL) {
2554 if (suffix[0] != '.')
2555 obstack_1grow(&obst, '-');
2556 add_string_escaped(suffix);
2558 obstack_1grow(&obst, '\0');
2560 file_name = (char*)obstack_finish(&obst);
2561 out = fopen(file_name, "wb");
2562 obstack_free(&obst, file_name);
2565 fprintf(stderr, "Couldn't open '%s': %s\n", file_name, strerror(errno));
2572 void dump_ir_graph(ir_graph *graph, const char *suffix)
2576 snprintf(buf, sizeof(buf), "%s.vcg", suffix);
2577 dump_ir_graph_ext(dump_ir_graph_file, graph, buf);
2580 void dump_all_ir_graphs(const char *suffix)
2582 size_t i, n_irgs = get_irp_n_irgs();
2584 for (i = 0; i < n_irgs; ++i) {
2585 ir_graph *irg = get_irp_irg(i);
2586 dump_ir_graph(irg, suffix);
2590 typedef struct pass_t {
2591 ir_prog_pass_t pass;
2596 * Wrapper around dump_all_ir_graphs().
2598 static int dump_all_ir_graphs_wrapper(ir_prog *irp, void *context)
2600 pass_t *pass = (pass_t*)context;
2603 dump_all_ir_graphs(pass->suffix);
2607 ir_prog_pass_t *dump_all_ir_graph_pass(const char *name, const char *suffix)
2609 size_t len = strlen(suffix) + 1;
2610 pass_t *pass = XMALLOCF(pass_t, suffix, len);
2611 ir_prog_pass_t *res = def_prog_pass_constructor(
2612 &pass->pass, name ? name : "dump_all_graphs", dump_all_ir_graphs_wrapper);
2614 /* this pass does not change anything, so neither dump nor verify is needed. */
2615 res->dump_irprog = ir_prog_no_dump;
2616 res->verify_irprog = ir_prog_no_verify;
2618 memcpy(pass->suffix, suffix, len);