2 * Copyright (C) 1995-2007 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 "firm_common_t.h"
56 #include "callgraph.h"
57 #include "irextbb_t.h"
59 #include "dbginfo_t.h"
71 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
72 extern void dump_irn_state(FILE *FL, ir_node *n);
73 extern int get_opt_dump_abstvals(void);
74 typedef unsigned long SeqNo;
75 extern SeqNo get_Block_seqno(ir_node *n);
78 /** Dump only irgs with names that start with this string */
79 static ident *dump_file_filter_id = NULL;
81 #define ERROR_TXT "<ERROR>"
83 /*******************************************************************/
84 /* flags to steer output */
85 /*******************************************************************/
87 /** An option to turn off edge labels */
88 static int edge_label = 1;
89 /** An option to turn off dumping values of constant entities */
90 static int const_entities = 1;
91 /** An option to dump the keep alive edges */
92 static int dump_keepalive = 1;
93 /** An option to dump the new out edges */
94 static int dump_new_edges_flag = 0;
95 /** An option to dump ld_names instead of names. */
96 static int dump_ld_name = 1;
97 /** Compiler options to dump analysis information in dump_ir_graph */
98 static int dump_out_edge_flag = 0;
99 static int dump_loop_information_flag = 0;
100 static int dump_backedge_information_flag = 1;
101 static int dump_const_local = 1;
102 static int dump_node_idx_labels = 0;
103 /** An option to dump all graph anchors */
104 static int dump_anchors = 0;
106 int dump_dominator_information_flag = 0;
107 int opt_dump_analysed_type_info = 1;
108 int opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */
110 static ird_color_t overrule_nodecolor = ird_color_default_node;
112 /** The vcg node attribute hook. */
113 static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
114 /** The vcg node attribute hook. */
115 static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
116 /** The vcg edge attribute hook. */
117 static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
118 /** The vcg dump block edge hook */
119 static DUMP_NODE_EDGE_FUNC dump_block_edge_hook = NULL;
120 /** The vcg dump node edge hook. */
121 static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
123 /* Set the hook to be called to dump additional edges to a node. */
124 void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func) {
125 dump_node_edge_hook = func;
128 /* Get the additional edge dump hook. */
129 DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void) {
130 return dump_node_edge_hook;
133 /* Set the hook to be called to dump additional edges to a block. */
134 void set_dump_block_edge_hook(DUMP_NODE_EDGE_FUNC func) {
135 dump_block_edge_hook = func;
138 /* Get the additional block edge dump hook. */
139 DUMP_NODE_EDGE_FUNC get_dump_block_edge_hook(void) {
140 return dump_node_edge_hook;
143 /* set the ir graph hook */
144 void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
145 dump_ir_graph_hook = hook;
148 /* set the node attribute hook */
149 void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
150 dump_node_vcgattr_hook = hook;
153 /* set the edge attribute hook */
154 void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
155 dump_edge_vcgattr_hook = hook;
158 /* Returns 0 if dump_out_edge_flag or dump_loop_information_flag
159 * are set, else returns dump_const_local_flag.
161 int get_opt_dump_const_local(void) {
162 if (dump_out_edge_flag || dump_loop_information_flag || (dump_new_edges_flag && edges_activated(current_ir_graph)))
164 return dump_const_local;
167 /* Set a prefix filter for output functions. */
168 void only_dump_method_with_name(ident *name) {
169 dump_file_filter_id = name;
172 /* Returns the prefix filter set with only_dump_method_with_name(). */
173 ident *get_dump_file_filter_ident(void) {
174 return dump_file_filter_id;
177 /* Returns non-zero if dump file filter is not set, or if it is a prefix of name. */
178 int is_filtered_dump_name(ident *name) {
179 if (!dump_file_filter_id) return 1;
180 return id_is_prefix(dump_file_filter_id, name);
183 /* To turn off display of edge labels. Edge labels often cause xvcg to
184 abort with a segmentation fault. */
185 void turn_off_edge_labels(void) {
189 void dump_consts_local(int flag) {
190 dump_const_local = flag;
193 void dump_node_idx_label(int flag) {
194 dump_node_idx_labels = flag;
197 void dump_constant_entity_values(int flag) {
198 const_entities = flag;
201 void dump_keepalive_edges(int flag) {
202 dump_keepalive = flag;
205 void dump_new_edges(int flag) {
206 dump_new_edges_flag = flag;
209 int get_opt_dump_keepalive_edges(void) {
210 return dump_keepalive;
213 void dump_out_edges(int flag) {
214 dump_out_edge_flag = flag;
217 void dump_dominator_information(int flag) {
218 dump_dominator_information_flag = flag;
221 void dump_loop_information(int flag) {
222 dump_loop_information_flag = flag;
225 void dump_backedge_information(int flag) {
226 dump_backedge_information_flag = flag;
229 /* Dump the information of type field specified in ana/irtypeinfo.h.
230 * If the flag is set, the type name is output in [] in the node label,
231 * else it is output as info.
233 void set_opt_dump_analysed_type_info(int flag) {
234 opt_dump_analysed_type_info = flag;
237 void dump_pointer_values_to_info(int flag) {
238 opt_dump_pointer_values_to_info = flag;
241 void dump_ld_names(int flag) {
245 void dump_all_anchors(int flag) {
249 /* -------------- some extended helper functions ----------------- */
252 * returns the name of a mode or <ERROR> if mode is NOT a mode object.
253 * in the later case, sets bad
255 const char *get_mode_name_ex(ir_mode *mode, int *bad) {
257 return get_mode_name(mode);
263 * returns the name of a type or <ERROR> if mode is NOT a mode object.
264 * in the later case, sets bad
266 const char *get_type_name_ex(ir_type *tp, int *bad) {
268 return get_type_name(tp);
273 #define CUSTOM_COLOR_BASE 100
274 static const char *color_names[ird_color_count];
275 static const char *color_rgb[ird_color_count];
276 static struct obstack color_obst;
278 static void custom_color(int num, const char *rgb_def)
280 assert(num < ird_color_count);
281 obstack_printf(&color_obst, "%d", CUSTOM_COLOR_BASE + num);
282 obstack_1grow(&color_obst, '\0');
284 color_rgb[num] = rgb_def;
285 color_names[num] = obstack_finish(&color_obst);
288 static void named_color(int num, const char *name)
290 assert(num < ird_color_count);
291 color_rgb[num] = NULL;
292 color_names[num] = name;
295 static void init_colors(void)
297 static int initialized = 0;
301 obstack_init(&color_obst);
303 custom_color(ird_color_prog_background, "204 204 204");
304 custom_color(ird_color_block_background, "255 255 0");
305 custom_color(ird_color_dead_block_background, "190 150 150");
306 named_color(ird_color_block_inout, "lightblue");
307 named_color(ird_color_default_node, "white");
308 custom_color(ird_color_memory, "153 153 255");
309 custom_color(ird_color_controlflow, "255 153 153");
310 custom_color(ird_color_const, "204 255 255");
311 custom_color(ird_color_proj, "255 255 153");
312 custom_color(ird_color_uses_memory, "153 153 255");
313 custom_color(ird_color_phi, "105 255 105");
314 custom_color(ird_color_anchor, "100 100 255");
315 named_color(ird_color_error, "red");
321 * Prints the VCG color to a file.
323 static void print_vcg_color(FILE *F, ird_color_t color) {
324 assert(color < ird_color_count);
325 fprintf(F, "color:%s", color_names[color]);
329 * Prints the edge from a type S to a type T with additional info fmt, ...
332 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
337 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
338 fprintf(F, " targetname: "); PRINT_TYPEID(T);
339 vfprintf(F, fmt, ap);
345 * Prints the edge from a type T to an entity E with additional info fmt, ...
348 static void print_type_ent_edge(FILE *F, ir_type *T, ir_entity *E, const char *fmt, ...)
353 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
354 fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
355 vfprintf(F, fmt, ap);
361 * Prints the edge from an entity E to an entity T with additional info fmt, ...
364 static void print_ent_ent_edge(FILE *F, ir_entity *E, ir_entity *T, int backedge, const char *fmt, ...)
370 fprintf(F, "backedge: { sourcename: \"");
372 fprintf(F, "edge: { sourcename: \"");
374 fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\"");
375 vfprintf(F, fmt, ap);
381 * Prints the edge from an entity E to a type T with additional info fmt, ...
384 static void print_ent_type_edge(FILE *F, ir_entity *E, ir_type *T, const char *fmt, ...)
389 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
390 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
391 vfprintf(F, fmt, ap);
397 * Prints the edge from a node N to a type T with additional info fmt, ...
400 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
405 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
406 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
407 vfprintf(F, fmt, ap);
413 * Prints the edge from a node N to an entity E with additional info fmt, ...
416 static void print_node_ent_edge(FILE *F, const ir_node *N, ir_entity *E, const char *fmt, ...)
421 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
422 fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
424 vfprintf(F, fmt, ap);
430 * Prints the edge from an entity E to a node N with additional info fmt, ...
433 static void print_ent_node_edge(FILE *F, ir_entity *E, const ir_node *N, const char *fmt, ...)
438 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
439 fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
440 vfprintf(F, fmt, ap);
446 * Prints the edge from a type E to an enumeration item item with additional info fmt, ...
449 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
454 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
455 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
456 vfprintf(F, fmt, ap);
461 /*-----------------------------------------------------------------*/
462 /* global and ahead declarations */
463 /*-----------------------------------------------------------------*/
465 static void dump_whole_node(ir_node *n, void *env);
466 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
468 /*-----------------------------------------------------------------*/
469 /* Helper functions. */
470 /*-----------------------------------------------------------------*/
473 * This map is used as a private link attr to be able to call dumper
474 * anywhere without destroying link fields.
476 static pmap *irdump_link_map = NULL;
478 /** NOT A STANDARD LIBFIRM INIT METHOD
480 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
481 * are off, we want to have as few interferences as possible. Therefore the
482 * initialization is performed lazily and not called from within init_firm.
484 * Creates the link attribute map. */
485 static void init_irdump(void) {
486 /* We need a new, empty map. */
487 if (irdump_link_map) pmap_destroy(irdump_link_map);
488 irdump_link_map = pmap_create();
489 if (!dump_file_filter_id)
490 dump_file_filter_id = new_id_from_str("");
494 * Returns the private link field.
496 static void *ird_get_irn_link(ir_node *n) {
498 if (!irdump_link_map) return NULL;
500 if (pmap_contains(irdump_link_map, (void *)n))
501 res = pmap_get(irdump_link_map, (void *)n);
506 * Sets the private link field.
508 static void ird_set_irn_link(ir_node *n, void *x) {
509 if (!irdump_link_map)
511 pmap_insert(irdump_link_map, (void *)n, x);
515 * Gets the private link field of an irg.
517 static void *ird_get_irg_link(ir_graph *irg) {
519 if (!irdump_link_map) return NULL;
521 if (pmap_contains(irdump_link_map, (void *)irg))
522 res = pmap_get(irdump_link_map, (void *)irg);
527 * Sets the private link field of an irg.
529 static void ird_set_irg_link(ir_graph *irg, void *x) {
530 if (!irdump_link_map) init_irdump();
531 pmap_insert(irdump_link_map, (void *)irg, x);
535 * Walker, clears the private link field.
537 static void clear_link(ir_node * node, void * env) {
539 ird_set_irn_link(node, NULL);
543 * If the entity has a ld_name, returns it if the dump_ld_name is set,
544 * else returns the name of the entity.
546 static const char *_get_ent_dump_name(ir_entity *ent, int dump_ld_name) {
548 return "<NULL entity>";
550 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
551 if (ent->ld_name) return get_id_str(ent->ld_name);
553 return get_id_str(ent->name);
557 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
558 * else returns the name of the entity.
560 const char *get_ent_dump_name(ir_entity *ent) {
561 return _get_ent_dump_name(ent, dump_ld_name);
564 /* Returns the name of an IRG. */
565 const char *get_irg_dump_name(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), 1);
571 * Returns non-zero if a node is in floating state.
573 static int node_floats(ir_node *n) {
574 return ((get_irn_pinned(n) == op_pin_state_floats) &&
575 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
579 * Walker that visits the anchors
581 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
582 if (dump_anchors || (dump_new_edges_flag && edges_activated(irg))) {
583 irg_walk_anchors(irg, pre, post, env);
585 irg_walk_graph(irg, pre, post, env);
590 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
592 static void collect_node(ir_node * node, void *env) {
596 || get_irn_op(node) == op_Bad
597 || get_irn_op(node) == op_Unknown
598 || get_irn_op(node) == op_NoMem) {
599 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
600 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
601 ARR_APP1(ir_node *, arr, node);
602 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
604 ir_node * block = get_nodes_block(node);
607 /* this node is in a Bad block, so we must place it into the graph's list */
608 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
609 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
610 ARR_APP1(ir_node *, arr, node);
611 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
613 ird_set_irn_link(node, ird_get_irn_link(block));
614 ird_set_irn_link(block, node);
619 /** Construct lists to walk ir block-wise.
621 * Collects all blocks, nodes not op_pin_state_pinned,
622 * Bad, NoMem and Unknown into a flexible array in link field of
623 * irg they belong to. Sets the irg link field to NULL in all
624 * graphs not visited.
625 * Free the list with DEL_ARR_F().
627 static ir_node **construct_block_lists(ir_graph *irg) {
629 #ifdef INTERPROCEDURAL_VIEW
630 int rem_view = get_interprocedural_view();
632 int walk_flag = using_visited(irg);
633 ir_graph *rem = current_ir_graph;
635 current_ir_graph = irg;
638 clear_using_visited(current_ir_graph);
640 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
641 ird_set_irg_link(get_irp_irg(i), NULL);
643 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
645 #ifdef INTERPROCEDURAL_VIEW
646 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
647 set_interprocedural_view(0);
650 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
651 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
652 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
653 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
655 #ifdef INTERPROCEDURAL_VIEW
656 set_interprocedural_view(rem_view);
660 set_using_visited(current_ir_graph);
662 current_ir_graph = rem;
663 return ird_get_irg_link(irg);
666 typedef struct _list_tuple {
668 ir_extblk **extbb_list;
671 /** Construct lists to walk IR extended block-wise.
672 * Free the lists in the tuple with DEL_ARR_F().
673 * Sets the irg link field to NULL in all
674 * graphs not visited.
676 static list_tuple *construct_extblock_lists(ir_graph *irg) {
677 ir_node **blk_list = construct_block_lists(irg);
679 ir_graph *rem = current_ir_graph;
680 list_tuple *lists = xmalloc(sizeof(*lists));
682 current_ir_graph = irg;
684 lists->blk_list = NEW_ARR_F(ir_node *, 0);
685 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
687 inc_irg_block_visited(irg);
688 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
691 if (is_Block(blk_list[i])) {
692 ext = get_Block_extbb(blk_list[i]);
694 if (extbb_not_visited(ext)) {
695 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
696 mark_extbb_visited(ext);
699 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
703 current_ir_graph = rem;
704 ird_set_irg_link(irg, lists);
708 /*-----------------------------------------------------------------*/
709 /* Routines to dump information about a single ir node. */
710 /*-----------------------------------------------------------------*/
713 * dump the name of a node n to the File F.
715 int dump_node_opcode(FILE *F, ir_node *n)
718 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
720 /* call the dump_node operation if available */
722 return ops->dump_node(n, F, dump_node_opcode_txt);
724 /* implementation for default nodes */
725 switch (get_irn_opcode(n)) {
730 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
731 assert(res < (int) sizeof(buf) && "buffer to small for tarval_snprintf");
736 switch (get_SymConst_kind(n)) {
737 case symconst_addr_name:
738 /* don't use get_SymConst_ptr_info as it mangles the name. */
739 fprintf(F, "SymC %s", get_id_str(get_SymConst_name(n)));
741 case symconst_addr_ent:
742 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
744 case symconst_ofs_ent:
745 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
747 case symconst_type_tag:
748 fprintf(F, "SymC %s tag", get_type_name_ex(get_SymConst_type(n), &bad));
750 case symconst_type_size:
751 fprintf(F, "SymC %s size", get_type_name_ex(get_SymConst_type(n), &bad));
753 case symconst_type_align:
754 fprintf(F, "SymC %s align", get_type_name_ex(get_SymConst_type(n), &bad));
756 case symconst_enum_const:
757 fprintf(F, "SymC %s enum", get_enumeration_name(get_SymConst_enum(n)));
760 fprintf(F, "SymC %lu label", get_SymConst_label(n));
766 if (!get_interprocedural_view())
773 ir_node *pred = get_Proj_pred(n);
775 if (get_irn_opcode(pred) == iro_Cond
776 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
777 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
778 fprintf(F, "defProj");
786 if (get_interprocedural_view()) {
787 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
792 case iro_CallBegin: {
793 ir_node *addr = get_CallBegin_ptr(n);
794 ir_entity *ent = NULL;
795 if (get_irn_op(addr) == op_Sel)
796 ent = get_Sel_entity(addr);
797 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
798 ent = get_SymConst_entity(addr);
799 fprintf(F, "%s", get_irn_opname(n));
800 if (ent) fprintf(F, " %s", get_entity_name(ent));
804 if (get_Load_align(n) == align_non_aligned)
806 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
809 if (get_Store_align(n) == align_non_aligned)
811 fprintf(F, "%s", get_irn_opname(n));
814 fprintf(F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
817 if (get_Conv_strict(n))
818 fprintf(F, "strict");
819 fprintf(F, "%s", get_irn_opname(n));
822 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Div_resmode(n), &bad));
825 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), &bad));
828 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_DivMod_resmode(n), &bad));
833 fprintf(F, "%s", get_irn_opname(n));
840 * Dump the mode of a node n to a file F.
841 * Ignore modes that are "always known".
843 static int dump_node_mode(FILE *F, ir_node *n)
846 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
849 /* call the dump_node operation if available */
851 return ops->dump_node(n, F, dump_node_mode_txt);
853 /* default implementation */
854 iro = get_irn_opcode(n);
866 ir_mode *mode = get_irn_mode(n);
868 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
869 (mode != mode_T || iro == iro_Proj))
870 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
878 * Dump the type of a node n to a file F if it's known.
880 static int dump_node_typeinfo(FILE *F, ir_node *n) {
883 if (opt_dump_analysed_type_info) {
884 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
885 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
886 ir_type *tp = get_irn_typeinfo_type(n);
887 if (tp != firm_none_type)
888 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
896 typedef struct _pns_lookup {
897 long nr; /**< the proj number */
898 const char *name; /**< the name of the Proj */
901 typedef struct _proj_lookup {
902 ir_opcode code; /**< the opcode of the Proj predecessor */
903 unsigned num_data; /**< number of data entries */
904 const pns_lookup_t *data; /**< the data */
907 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
909 /** the lookup table for Proj(Start) names */
910 static const pns_lookup_t start_lut[] = {
911 #define X(a) { pn_Start_##a, #a }
921 /** the lookup table for Proj(Cond) names */
922 static const pns_lookup_t cond_lut[] = {
923 #define X(a) { pn_Cond_##a, #a }
929 /** the lookup table for Proj(Call) names */
930 static const pns_lookup_t call_lut[] = {
931 #define X(a) { pn_Call_##a, #a }
941 /** the lookup table for Proj(Quot) names */
942 static const pns_lookup_t quot_lut[] = {
943 #define X(a) { pn_Quot_##a, #a }
951 /** the lookup table for Proj(DivMod) names */
952 static const pns_lookup_t divmod_lut[] = {
953 #define X(a) { pn_DivMod_##a, #a }
962 /** the lookup table for Proj(Div) names */
963 static const pns_lookup_t div_lut[] = {
964 #define X(a) { pn_Div_##a, #a }
972 /** the lookup table for Proj(Mod) names */
973 static const pns_lookup_t mod_lut[] = {
974 #define X(a) { pn_Mod_##a, #a }
982 /** the lookup table for Proj(Load) names */
983 static const pns_lookup_t load_lut[] = {
984 #define X(a) { pn_Load_##a, #a }
992 /** the lookup table for Proj(Store) names */
993 static const pns_lookup_t store_lut[] = {
994 #define X(a) { pn_Store_##a, #a }
1001 /** the lookup table for Proj(Alloc) names */
1002 static const pns_lookup_t alloc_lut[] = {
1003 #define X(a) { pn_Alloc_##a, #a }
1011 /** the lookup table for Proj(CopyB) names */
1012 static const pns_lookup_t copyb_lut[] = {
1013 #define X(a) { pn_CopyB_##a, #a }
1021 /** the lookup table for Proj(InstOf) names */
1022 static const pns_lookup_t instof_lut[] = {
1023 #define X(a) { pn_InstOf_##a, #a }
1032 /** the lookup table for Proj(Raise) names */
1033 static const pns_lookup_t raise_lut[] = {
1034 #define X(a) { pn_Raise_##a, #a }
1040 /** the lookup table for Proj(Bound) names */
1041 static const pns_lookup_t bound_lut[] = {
1042 #define X(a) { pn_Bound_##a, #a }
1050 /** the Proj lookup table */
1051 static const proj_lookup_t proj_lut[] = {
1052 #define E(a) ARR_SIZE(a), a
1053 { iro_Start, E(start_lut) },
1054 { iro_Cond, E(cond_lut) },
1055 { iro_Call, E(call_lut) },
1056 { iro_Quot, E(quot_lut) },
1057 { iro_DivMod, E(divmod_lut) },
1058 { iro_Div, E(div_lut) },
1059 { iro_Mod, E(mod_lut) },
1060 { iro_Load, E(load_lut) },
1061 { iro_Store, E(store_lut) },
1062 { iro_Alloc, E(alloc_lut) },
1063 { iro_CopyB, E(copyb_lut) },
1064 { iro_InstOf, E(instof_lut) },
1065 { iro_Raise, E(raise_lut) },
1066 { iro_Bound, E(bound_lut) }
1071 * Dump additional node attributes of some nodes to a file F.
1074 dump_node_nodeattr(FILE *F, ir_node *n)
1080 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1082 /* call the dump_node operation if available */
1084 return ops->dump_node(n, F, dump_node_nodeattr_txt);
1086 switch (get_irn_opcode(n)) {
1088 if (0 && get_interprocedural_view()) {
1089 fprintf(F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
1094 pred = get_Proj_pred(n);
1095 proj_nr = get_Proj_proj(n);
1097 code = get_irn_opcode(pred);
1099 if (code == iro_Cmp)
1100 fprintf(F, "%s ", get_pnc_string(get_Proj_proj(n)));
1101 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1102 fprintf(F, "Arg %ld ", proj_nr);
1103 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1104 fprintf(F, "%ld ", proj_nr);
1106 unsigned i, j, f = 0;
1108 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1109 if (code == proj_lut[i].code) {
1110 for (j = 0; j < proj_lut[i].num_data; ++j) {
1111 if (proj_nr == proj_lut[i].data[j].nr) {
1112 fprintf(F, "%s ", proj_lut[i].data[j].name);
1121 fprintf(F, "%ld ", proj_nr);
1122 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1123 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1124 fprintf(F, "PRED ");
1125 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1126 fprintf(F, "PRED ");
1131 proj_nr = get_Filter_proj(n);
1132 if (! get_interprocedural_view()) {
1134 pred = get_Filter_pred(n);
1137 fprintf(F, "%ld ", proj_nr);
1140 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1143 fprintf(F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1146 fprintf(F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1149 fprintf(F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1160 #include "execution_frequency.h"
1162 static void dump_node_ana_vals(FILE *F, ir_node *n) {
1166 #ifdef INTERPROCEDURAL_VIEW
1167 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1168 get_irn_exec_freq(n),
1169 get_irg_method_execution_frequency(get_irn_irg(n)),
1170 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1171 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1177 /* Dumps a node label without the enclosing ". */
1178 int dump_node_label(FILE *F, ir_node *n) {
1181 bad |= dump_node_opcode(F, n);
1182 bad |= dump_node_mode(F, n);
1184 bad |= dump_node_typeinfo(F, n);
1185 bad |= dump_node_nodeattr(F, n);
1186 if(dump_node_idx_labels) {
1187 fprintf(F, "%ld:%d", get_irn_node_nr(n), get_irn_idx(n));
1189 fprintf(F, "%ld", get_irn_node_nr(n));
1196 * Dumps the attributes of a node n into the file F.
1197 * Currently this is only the color of a node.
1199 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1205 print_vcg_color(F, ird_color_error);
1209 if (dump_node_vcgattr_hook)
1210 if (dump_node_vcgattr_hook(F, node, local))
1213 n = local ? local : node;
1215 if (overrule_nodecolor != ird_color_default_node) {
1216 print_vcg_color(F, overrule_nodecolor);
1220 mode = get_irn_mode(node);
1221 if(mode == mode_M) {
1222 print_vcg_color(F, ird_color_memory);
1225 if(mode == mode_X) {
1226 print_vcg_color(F, ird_color_controlflow);
1230 switch (get_irn_opcode(n)) {
1235 print_vcg_color(F, ird_color_anchor);
1238 print_vcg_color(F, ird_color_error);
1241 if (is_Block_dead(n))
1242 print_vcg_color(F, ird_color_dead_block_background);
1244 print_vcg_color(F, ird_color_block_background);
1247 print_vcg_color(F, ird_color_phi);
1250 print_vcg_color(F, ird_color_memory);
1254 print_vcg_color(F, ird_color_const);
1257 print_vcg_color(F, ird_color_proj);
1260 ir_op *op = get_irn_op(node);
1262 if(is_op_constlike(op)) {
1263 print_vcg_color(F, ird_color_const);
1264 } else if(is_op_uses_memory(op)) {
1265 print_vcg_color(F, ird_color_uses_memory);
1266 } else if(is_op_cfopcode(op) || is_op_forking(op)) {
1267 print_vcg_color(F, ird_color_controlflow);
1269 PRINT_DEFAULT_NODE_ATTR;
1275 /* Adds a new node info dumper callback. */
1276 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1278 hook_entry_t *info = xmalloc(sizeof(*info));
1280 info->hook._hook_node_info = cb;
1281 info->context = data;
1282 register_hook(hook_node_info, info);
1287 /* Remove a previously added info dumper callback. */
1288 void dump_remv_node_info_callback(void *handle)
1290 hook_entry_t *info = handle;
1291 unregister_hook(hook_node_info, info);
1296 * Dump the node information of a node n to a file F.
1298 static INLINE int dump_node_info(FILE *F, ir_node *n)
1301 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1303 fprintf(F, " info1: \"");
1304 bad = dump_irnode_to_file(F, n);
1305 /* call the dump_node operation if available */
1307 bad = ops->dump_node(n, F, dump_node_info_txt);
1309 /* allow additional info to be added */
1310 hook_node_info(F, n);
1316 static INLINE int is_constlike_node(const ir_node *node)
1318 const ir_op *op = get_irn_op(node);
1319 return is_op_constlike(op);
1323 /** outputs the predecessors of n, that are constants, local. I.e.,
1324 generates a copy of the constant predecessors for each node called with. */
1325 static void dump_const_node_local(FILE *F, ir_node *n) {
1327 if (!get_opt_dump_const_local()) return;
1329 /* Use visited flag to avoid outputting nodes twice.
1330 initialize it first. */
1331 for (i = 0; i < get_irn_arity(n); i++) {
1332 ir_node *con = get_irn_n(n, i);
1333 if (is_constlike_node(con)) {
1334 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1338 for (i = 0; i < get_irn_arity(n); i++) {
1339 ir_node *con = get_irn_n(n, i);
1340 if (is_constlike_node(con) && irn_not_visited(con)) {
1343 mark_irn_visited(con);
1344 /* Generate a new name for the node by appending the names of
1346 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1347 fprintf(F, " label: \"");
1348 bad |= dump_node_label(F, con);
1350 bad |= dump_node_info(F, con);
1351 dump_node_vcgattr(F, n, con, bad);
1357 /** If the block of an edge is a const_like node, dump it local with an edge */
1358 static void dump_const_block_local(FILE *F, ir_node *n) {
1361 if (!get_opt_dump_const_local()) return;
1363 blk = get_nodes_block(n);
1364 if (is_constlike_node(blk)) {
1367 /* Generate a new name for the node by appending the names of
1369 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1370 fprintf(F, "\" label: \"");
1371 bad |= dump_node_label(F, blk);
1373 bad |= dump_node_info(F, blk);
1374 dump_node_vcgattr(F, n, blk, bad);
1377 fprintf(F, "edge: { sourcename: \"");
1379 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1381 if (dump_edge_vcgattr_hook) {
1383 if (dump_edge_vcgattr_hook(F, n, -1)) {
1387 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1392 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1397 * prints the error message of a node to a file F as info2.
1399 static void print_node_error(FILE *F, const char *err_msg)
1404 fprintf(F, " info2: \"%s\"", err_msg);
1408 * prints debug messages of a node to file F as info3.
1410 static void print_dbg_info(FILE *F, dbg_info *dbg)
1414 if (__dbg_info_snprint) {
1416 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1417 fprintf(F, " info3: \"%s\"\n", buf);
1424 static void dump_node(FILE *F, ir_node *n)
1429 if (get_opt_dump_const_local() && is_constlike_node(n))
1432 /* dump this node */
1433 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1435 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1436 bad |= dump_node_label(F, n);
1437 dump_node_ana_vals(F, n);
1438 //dump_node_ana_info(F, n);
1440 bad |= dump_node_info(F, n);
1441 print_node_error(F, p);
1442 print_dbg_info(F, get_irn_dbg_info(n));
1443 dump_node_vcgattr(F, n, NULL, bad);
1445 dump_const_node_local(F, n);
1447 if(dump_node_edge_hook)
1448 dump_node_edge_hook(F, n);
1450 dump_irn_chi_term(F, n);
1451 dump_irn_state(F, n);
1455 /** dump the edge to the block this node belongs to */
1457 dump_ir_block_edge(FILE *F, ir_node *n) {
1458 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1459 if (is_no_Block(n)) {
1460 ir_node *block = get_nodes_block(n);
1462 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1463 dump_const_block_local(F, n);
1465 fprintf(F, "edge: { sourcename: \"");
1467 fprintf(F, "\" targetname: ");
1468 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1470 if (dump_edge_vcgattr_hook) {
1472 if (dump_edge_vcgattr_hook(F, n, -1)) {
1476 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1481 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1487 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1489 * do not use get_nodes_block() here, will fail
1490 * if the irg is not pinned.
1492 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1493 fprintf(F, INTRA_DATA_EDGE_ATTR);
1495 fprintf(F, INTER_DATA_EDGE_ATTR);
1499 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1501 * do not use get_nodes_block() here, will fail
1502 * if the irg is not pinned.
1504 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1505 fprintf(F, INTRA_MEM_EDGE_ATTR);
1507 fprintf(F, INTER_MEM_EDGE_ATTR);
1510 /** Print the vcg attributes for the edge from node from to it's to's input */
1511 static void print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1514 if (dump_edge_vcgattr_hook)
1515 if (dump_edge_vcgattr_hook(F, from, to))
1518 if (dump_backedge_information_flag && is_backedge(from, to))
1519 fprintf(F, BACK_EDGE_ATTR);
1521 switch (get_irn_opcode(from)) {
1523 fprintf(F, CF_EDGE_ATTR);
1525 case iro_Start: break;
1528 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1529 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1531 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1535 if (is_Proj(from)) {
1536 if (get_irn_mode(from) == mode_M)
1537 print_mem_edge_vcgattr(F, from, to);
1538 else if (get_irn_mode(from) == mode_X)
1539 fprintf(F, CF_EDGE_ATTR);
1541 print_data_edge_vcgattr(F, from, to);
1543 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1544 print_mem_edge_vcgattr(F, from, to);
1545 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1546 fprintf(F, CF_EDGE_ATTR);
1548 print_data_edge_vcgattr(F, from, to);
1552 /** dump edges to our inputs */
1553 static void dump_ir_data_edges(FILE *F, ir_node *n) {
1555 unsigned long visited = get_irn_visited(n);
1557 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1560 /* dump the dependency edges. */
1561 for (i = 0; i < get_irn_deps(n); ++i) {
1562 ir_node *dep = get_irn_dep(n, i);
1565 fprintf(F, "edge: {sourcename: \"");
1567 fprintf(F, "\" targetname: ");
1568 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1569 PRINT_CONSTID(n, dep);
1575 fprintf(F, " label: \"%d\" ", i);
1576 fprintf(F, " color: darkgreen}\n");
1580 for (i = 0; i < get_irn_arity(n); i++) {
1581 ir_node * pred = get_irn_n(n, i);
1584 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1585 continue; /* pred not dumped */
1587 if (dump_backedge_information_flag && is_backedge(n, i))
1588 fprintf(F, "backedge: {sourcename: \"");
1590 fprintf(F, "edge: {sourcename: \"");
1592 fprintf(F, "\" targetname: ");
1593 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1594 PRINT_CONSTID(n, pred);
1596 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1598 fprintf(F, " label: \"%d\" ", i);
1599 print_edge_vcgattr(F, n, i);
1608 dump_ir_edges(FILE *F, ir_node *n) {
1609 const ir_edge_t *edge;
1612 foreach_out_edge(n, edge) {
1613 ir_node *succ = get_edge_src_irn(edge);
1615 fprintf(F, "edge: {sourcename: \"");
1617 fprintf(F, "\" targetname: \"");
1621 fprintf(F, " label: \"%d\" ", i);
1622 fprintf(F, OUT_EDGE_ATTR);
1629 /** Dumps a node and its edges but not the block edge
1632 dump_node_wo_blockedge(ir_node *n, void *env) {
1635 dump_ir_data_edges(F, n);
1638 /** Dumps a node and its edges.
1641 dump_whole_node(ir_node *n, void *env) {
1643 dump_node_wo_blockedge(n, env);
1644 if (!node_floats(n))
1645 dump_ir_block_edge(F, n);
1646 if (dump_new_edges_flag && edges_activated(current_ir_graph))
1647 dump_ir_edges(F, n);
1651 dump_const_node(ir_node *n, void *env) {
1652 if (is_Block(n)) return;
1653 dump_node_wo_blockedge(n, env);
1656 /***********************************************************************/
1657 /* the following routines dump the nodes/irgs bracketed to graphs. */
1658 /***********************************************************************/
1660 /** Dumps a constant expression as entity initializer, array bound ...
1662 static void dump_const_expression(FILE *F, ir_node *value) {
1663 ir_graph *rem = current_ir_graph;
1664 int rem_dump_const_local = dump_const_local;
1665 dump_const_local = 0;
1666 current_ir_graph = get_const_code_irg();
1667 irg_walk(value, dump_const_node, NULL, F);
1668 /* Decrease visited flag so that we walk with the same flag for the next
1669 expression. This guarantees that we don't dump the same node twice,
1670 as for const expressions cse is performed to save memory. */
1671 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1672 current_ir_graph = rem;
1673 dump_const_local = rem_dump_const_local;
1676 /** Dump a block as graph containing its nodes.
1678 * Expects to find nodes belonging to the block as list in its
1680 * Dumps the edges of all nodes including itself. */
1681 static void dump_whole_block(FILE *F, ir_node *block) {
1683 ird_color_t color = ird_color_block_background;
1685 assert(is_Block(block));
1687 fprintf(F, "graph: { title: \"");
1688 PRINT_NODEID(block);
1689 fprintf(F, "\" label: \"");
1690 dump_node_label(F, block);
1692 if (get_opt_dump_abstvals())
1693 fprintf(F, " seqno: %d", (int)get_Block_seqno(block));
1696 /* colorize blocks */
1697 if (! get_Block_matured(block))
1698 color = ird_color_block_background;
1699 if (is_Block_dead(block))
1700 color = ird_color_dead_block_background;
1702 fprintf(F, "\" status:clustered ");
1703 print_vcg_color(F, color);
1706 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1707 dump_node_info(F, block);
1708 print_dbg_info(F, get_irn_dbg_info(block));
1710 /* dump the blocks edges */
1711 dump_ir_data_edges(F, block);
1713 if (dump_block_edge_hook)
1714 dump_block_edge_hook(F, block);
1716 /* dump the nodes that go into the block */
1717 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1719 dump_ir_data_edges(F, node);
1722 /* Close the vcg information for the block */
1724 dump_const_node_local(F, block);
1726 dump_irn_chi_term(F, block);
1731 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1732 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1734 dump_block_graph(FILE *F, ir_graph *irg) {
1736 ir_graph *rem = current_ir_graph;
1737 ir_node **arr = ird_get_irg_link(irg);
1738 current_ir_graph = irg;
1740 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1741 ir_node * node = arr[i];
1742 if (is_Block(node)) {
1743 /* Dumps the block and all the nodes in the block, which are to
1744 be found in Block->link. */
1745 dump_whole_block(F, node);
1747 /* Nodes that are not in a Block. */
1749 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1750 dump_const_block_local(F, node);
1752 dump_ir_data_edges(F, node);
1754 if (dump_new_edges_flag && edges_activated(irg))
1755 dump_ir_edges(F, node);
1758 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1759 dump_loop_nodes_into_graph(F, irg);
1761 current_ir_graph = rem;
1765 * Dump the info for an irg.
1766 * Parsed by XVCG but not shown. use yComp.
1768 static void dump_graph_info(FILE *F, ir_graph *irg) {
1769 fprintf(F, "info1: \"");
1770 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1774 /** Dumps an irg as a graph clustered by block nodes.
1775 * If interprocedural view edges can point to nodes out of this graph.
1777 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1778 ir_entity *ent = get_irg_entity(irg);
1780 fprintf(F, "graph: { title: \"");
1782 fprintf(F, "\" label: \"%s\" status:clustered color:%s \n",
1783 get_ent_dump_name(ent), color_names[ird_color_prog_background]);
1785 dump_graph_info(F, irg);
1786 print_dbg_info(F, get_entity_dbg_info(ent));
1788 dump_block_graph(F, irg);
1790 /* Close the vcg information for the irg */
1791 fprintf(F, "}\n\n");
1794 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1795 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1797 dump_extblock_graph(FILE *F, ir_graph *irg) {
1799 ir_graph *rem = current_ir_graph;
1800 ir_extblk **arr = ird_get_irg_link(irg);
1801 current_ir_graph = irg;
1803 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1804 ir_extblk *extbb = arr[i];
1805 ir_node *leader = get_extbb_leader(extbb);
1808 fprintf(F, "graph: { title: \"");
1809 PRINT_EXTBBID(leader);
1810 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1811 get_irn_node_nr(leader));
1813 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1814 ir_node * node = extbb->blks[j];
1815 if (is_Block(node)) {
1816 /* Dumps the block and all the nodes in the block, which are to
1817 be found in Block->link. */
1818 dump_whole_block(F, node);
1820 /* Nodes that are not in a Block. */
1822 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1823 dump_const_block_local(F, node);
1825 dump_ir_data_edges(F, node);
1831 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1832 dump_loop_nodes_into_graph(F, irg);
1834 current_ir_graph = rem;
1839 /*******************************************************************/
1840 /* Basic type and entity nodes and edges. */
1841 /*******************************************************************/
1843 /** dumps the edges between nodes and their type or entity attributes. */
1844 static void dump_node2type_edges(ir_node *n, void *env)
1849 switch (get_irn_opcode(n)) {
1851 /* @@@ some consts have an entity */
1854 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1855 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1858 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1861 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1864 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1867 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1870 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1878 static int print_type_info(FILE *F, ir_type *tp) {
1881 if (get_type_state(tp) == layout_undefined) {
1882 fprintf(F, "state: layout_undefined\n");
1884 fprintf(F, "state: layout_fixed,\n");
1886 if (get_type_mode(tp))
1887 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1888 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1893 static void print_typespecific_info(FILE *F, ir_type *tp) {
1894 switch (get_type_tpop_code(tp)) {
1896 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1901 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1902 fprintf(F, "params: %d\n", get_method_n_params(tp));
1903 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1909 case tpo_enumeration:
1921 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1922 switch (get_type_tpop_code(tp)) {
1924 if (peculiarity_existent == get_class_peculiarity(tp))
1925 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1927 fprintf(F, " " TYPE_DESCRIPTION_NODE_ATTR);
1930 fprintf(F, " " TYPE_METH_NODE_ATTR);
1938 case tpo_enumeration:
1950 int dump_type_node(FILE *F, ir_type *tp)
1954 fprintf(F, "node: {title: ");
1956 fprintf(F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1957 fprintf(F, " info1: \"");
1959 bad |= print_type_info(F, tp);
1960 print_typespecific_info(F, tp);
1962 dump_type_to_file(F, tp, dump_verbosity_max);
1965 print_dbg_info(F, get_type_dbg_info(tp));
1966 print_typespecific_vcgattr(F, tp);
1973 void dump_entity_node(FILE *F, ir_entity *ent, int color)
1975 fprintf(F, "node: {title: \"");
1976 PRINT_ENTID(ent); fprintf(F, "\"");
1977 fprintf(F, DEFAULT_TYPE_ATTRIBUTE);
1978 fprintf(F, "label: ");
1979 fprintf(F, "\"ent %s\" ", get_ent_dump_name(ent));
1981 fprintf(F, "color:%d", color);
1983 fprintf(F, ENTITY_NODE_ATTR);
1984 fprintf(F, "\n info1: \"");
1986 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1989 print_dbg_info(F, get_entity_dbg_info(ent));
1993 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1996 ir_enum_const *ec = get_enumeration_const(tp, pos);
1997 ident *id = get_enumeration_nameid(ec);
1998 tarval *tv = get_enumeration_value(ec);
2001 tarval_snprintf(buf, sizeof(buf), tv);
2003 strncpy(buf, "<not set>", sizeof(buf));
2004 fprintf(F, "node: {title: \"");
2005 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
2006 fprintf(F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
2007 fprintf(F, "label: ");
2008 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
2009 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
2012 /* dumps a type or entity and it's edges. */
2014 dump_type_info(type_or_ent *tore, void *env) {
2016 int i = 0; /* to shutup gcc */
2018 /* dump this type or entity */
2020 switch (get_kind(tore)) {
2022 ir_entity *ent = (ir_entity *)tore;
2025 dump_entity_node(F, ent, 0);
2027 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
2028 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2029 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
2030 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
2031 if (is_Class_type(get_entity_owner(ent))) {
2032 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2033 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
2035 /* attached subgraphs */
2036 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
2037 if (is_atomic_entity(ent)) {
2038 value = get_atomic_ent_value(ent);
2040 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2041 /* DDMN(value); $$$ */
2042 dump_const_expression(F, value);
2045 if (is_compound_entity(ent)) {
2046 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
2047 value = get_compound_ent_value(ent, i);
2049 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
2050 dump_const_expression(F, value);
2051 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
2053 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
2054 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
2055 get_compound_ent_value_member(ent, i), i);
2064 ir_type *tp = (ir_type *)tore;
2065 dump_type_node(F, tp);
2066 /* and now the edges */
2067 switch (get_type_tpop_code(tp)) {
2069 for (i=0; i < get_class_n_supertypes(tp); i++)
2070 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2071 for (i=0; i < get_class_n_members(tp); i++)
2072 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2075 for (i=0; i < get_struct_n_members(tp); i++)
2076 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
2079 for (i = 0; i < get_method_n_params(tp); i++)
2080 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
2081 for (i = 0; i < get_method_n_ress(tp); i++)
2082 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
2085 for (i = 0; i < get_union_n_members(tp); i++)
2086 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
2089 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
2090 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
2091 for (i = 0; i < get_array_n_dimensions(tp); i++) {
2092 ir_node *upper = get_array_upper_bound(tp, i);
2093 ir_node *lower = get_array_lower_bound(tp, i);
2094 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
2095 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
2096 dump_const_expression(F, upper);
2097 dump_const_expression(F, lower);
2100 case tpo_enumeration:
2101 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
2102 dump_enum_item(F, tp, i);
2103 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
2107 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
2114 break; /* case k_type */
2117 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
2118 } /* switch kind_or_entity */
2121 typedef struct _h_env {
2126 /** For dumping class hierarchies.
2127 * Dumps a class type node and a superclass edge.
2128 * If env->dump_ent dumps entities of classes and overwrites edges.
2131 dump_class_hierarchy_node(type_or_ent *tore, void *ctx) {
2134 int i = 0; /* to shutup gcc */
2136 /* dump this type or entity */
2137 switch (get_kind(tore)) {
2139 ir_entity *ent = (ir_entity *)tore;
2140 if (get_entity_owner(ent) == get_glob_type()) break;
2141 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
2142 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2144 dump_entity_node(F, ent, 0);
2146 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2147 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2148 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2153 ir_type *tp = (ir_type *)tore;
2154 if (tp == get_glob_type()) break;
2155 switch (get_type_tpop_code(tp)) {
2157 dump_type_node(F, tp);
2158 /* and now the edges */
2159 for (i=0; i < get_class_n_supertypes(tp); i++) {
2160 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2165 break; /* case k_type */
2168 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2169 } /* switch kind_or_entity */
2172 /*******************************************************************/
2173 /* dump analysis information that is expressed in graph terms. */
2174 /*******************************************************************/
2176 /* dump out edges */
2178 dump_out_edge(ir_node *n, void *env) {
2181 for (i = 0; i < get_irn_n_outs(n); i++) {
2182 assert(get_irn_out(n, i));
2183 fprintf(F, "edge: {sourcename: \"");
2185 fprintf(F, "\" targetname: \"");
2186 PRINT_NODEID(get_irn_out(n, i));
2187 fprintf(F, "\" color: red linestyle: dashed");
2193 dump_loop_label(FILE *F, ir_loop *loop) {
2194 fprintf(F, "loop %d, %d sons, %d nodes",
2195 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2198 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2199 fprintf(F, " info1: \"");
2200 fprintf(F, " loop nr: %d", get_loop_loop_nr(loop));
2201 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2202 fprintf(F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2208 dump_loop_node(FILE *F, ir_loop *loop) {
2209 fprintf(F, "node: {title: \"");
2211 fprintf(F, "\" label: \"");
2212 dump_loop_label(F, loop);
2214 dump_loop_info(F, loop);
2219 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2221 fprintf(F, "edge: {sourcename: \"");
2223 fprintf(F, "\" targetname: \"");
2224 PRINT_NODEID(get_loop_node(loop, i));
2225 fprintf(F, "\" color: green");
2230 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2232 fprintf(F, "edge: {sourcename: \"");
2234 fprintf(F, "\" targetname: \"");
2235 PRINT_LOOPID(get_loop_son(loop, i));
2236 fprintf(F, "\" color: darkgreen label: \"%d\"}\n",
2237 get_loop_element_pos(loop, get_loop_son(loop, i)));
2241 void dump_loops(FILE *F, ir_loop *loop) {
2243 /* dump this loop node */
2244 dump_loop_node(F, loop);
2246 /* dump edges to nodes in loop -- only if it is a real loop */
2247 if (get_loop_depth(loop) != 0) {
2248 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2249 dump_loop_node_edge(F, loop, i);
2252 for (i = 0; i < get_loop_n_sons(loop); i++) {
2253 dump_loops(F, get_loop_son(loop, i));
2254 dump_loop_son_edge(F, loop, i);
2259 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2260 ir_graph *rem = current_ir_graph;
2261 current_ir_graph = irg;
2263 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2265 current_ir_graph = rem;
2270 * dumps the VCG header
2272 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2284 if (!orientation) orientation = "bottom_to_top";
2288 "graph: { title: \"ir graph of %s\"\n"
2289 "display_edge_labels: %s\n"
2290 "layoutalgorithm: mindepth\n"
2291 "manhattan_edges: yes\n"
2292 "port_sharing: no\n"
2294 "classname 1: \"intrablock Data\"\n"
2295 "classname 2: \"Block\"\n"
2296 "classname 3: \"Entity type\"\n"
2297 "classname 4: \"Entity owner\"\n"
2298 "classname 5: \"Method Param\"\n"
2299 "classname 6: \"Method Res\"\n"
2300 "classname 7: \"Super\"\n"
2301 "classname 8: \"Union\"\n"
2302 "classname 9: \"Points-to\"\n"
2303 "classname 10: \"Array Element Type\"\n"
2304 "classname 11: \"Overwrites\"\n"
2305 "classname 12: \"Member\"\n"
2306 "classname 13: \"Control Flow\"\n"
2307 "classname 14: \"intrablock Memory\"\n"
2308 "classname 15: \"Dominators\"\n"
2309 "classname 16: \"interblock Data\"\n"
2310 "classname 17: \"interblock Memory\"\n"
2311 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2312 "classname 19: \"Postdominators\"\n"
2313 "classname 20: \"Keep Alive\"\n"
2314 "classname 21: \"Out Edges\"\n"
2315 "infoname 1: \"Attribute\"\n"
2316 "infoname 2: \"Verification errors\"\n"
2317 "infoname 3: \"Debug info\"\n",
2318 name, label, orientation);
2320 for (i = 0; i < ird_color_count; ++i) {
2321 if(color_rgb[i] != NULL) {
2322 fprintf(F, "colorentry %s: %s\n", color_names[i], color_rgb[i]);
2325 fprintf(F, "\n"); /* a separator */
2331 * @param irg The graph to be dumped
2332 * @param suffix1 first filename suffix
2333 * @param suffix2 second filename suffix
2335 FILE *vcg_open(ir_graph *irg, const char * suffix1, const char *suffix2) {
2337 const char *nm = get_irg_dump_name(irg);
2338 int len = strlen(nm), i, j;
2339 char *fname; /* filename to put the vcg information in */
2341 if (!suffix1) suffix1 = "";
2342 if (!suffix2) suffix2 = "";
2344 /* open file for vcg graph */
2345 fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2347 /* strncpy (fname, nm, len); */ /* copy the filename */
2349 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2351 fname[j] = '@'; j++; fname[j] = '1'; j++;
2352 } else if (nm[i] == '@') {
2353 fname[j] = '@'; j++; fname[j] = '2'; j++;
2355 fname[j] = nm[i]; j++;
2359 strcat(fname, suffix1); /* append file suffix */
2360 strcat(fname, suffix2); /* append file suffix */
2361 strcat(fname, ".vcg"); /* append the .vcg suffix */
2363 /* vcg really expect only a <CR> at end of line, so
2364 * the "b"inary mode is what you mean (and even needed for Win32)
2366 F = fopen(fname, "wb"); /* open file for writing */
2378 * @param name prefix file name
2379 * @param suffix filename suffix
2381 FILE *vcg_open_name(const char *name, const char *suffix) {
2383 char *fname; /* filename to put the vcg information in */
2384 int i, j, len = strlen(name);
2386 if (!suffix) suffix = "";
2388 /** open file for vcg graph */
2389 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2390 /* strcpy (fname, name);*/ /* copy the filename */
2392 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2393 if (name[i] == '/') {
2394 fname[j] = '@'; j++; fname[j] = '1'; j++;
2395 } else if (name[i] == '@') {
2396 fname[j] = '@'; j++; fname[j] = '2'; j++;
2398 fname[j] = name[i]; j++;
2402 strcat(fname, suffix);
2403 strcat(fname, ".vcg"); /* append the .vcg suffix */
2405 /* vcg really expect only a <CR> at end of line, so
2406 * the "b"inary mode is what you mean (and even needed for Win32)
2408 F = fopen(fname, "wb"); /* open file for writing */
2418 * Dumps the vcg file footer
2420 void dump_vcg_footer(FILE *F) {
2424 /************************************************************************/
2425 /************************************************************************/
2426 /* Routines that dump all or parts of the firm representation to a file */
2427 /************************************************************************/
2428 /************************************************************************/
2430 /************************************************************************/
2431 /* Dump ir graphs, different formats and additional information. */
2432 /************************************************************************/
2434 typedef void (*do_dump_graph_func) (ir_graph *irg, FILE *out);
2436 static void do_dump(ir_graph *irg, const char *suffix, const char *suffix_ip,
2437 const char *suffix_nonip, do_dump_graph_func dump_func)
2441 const char *suffix1;
2443 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2446 rem = current_ir_graph;
2447 current_ir_graph = irg;
2448 if (get_interprocedural_view())
2449 suffix1 = suffix_ip;
2451 suffix1 = suffix_nonip;
2452 current_ir_graph = rem;
2454 out = vcg_open(irg, suffix, suffix1);
2456 dump_func(irg, out);
2461 void dump_ir_graph_file(ir_graph *irg, FILE *out)
2463 if (dump_backedge_information_flag
2464 && get_irg_loopinfo_state(irg) != loopinfo_consistent) {
2465 construct_backedges(irg);
2468 dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2470 /* call the dump graph hook */
2471 if (dump_ir_graph_hook) {
2472 if (dump_ir_graph_hook(out, irg)) {
2477 /* walk over the graph */
2478 /* dump_whole_node must be called in post visiting predecessors */
2479 ird_walk_graph(irg, NULL, dump_whole_node, out);
2481 /* dump the out edges in a separate walk */
2482 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2483 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, out);
2486 dump_vcg_footer(out);
2489 /** Routine to dump a graph, blocks as conventional nodes. */
2490 void dump_ir_graph(ir_graph *irg, const char *suffix )
2492 do_dump(irg, suffix, "-pure-ip", "-pure", dump_ir_graph_file);
2495 void dump_ir_block_graph_file(ir_graph *irg, FILE *out)
2499 dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2501 construct_block_lists(irg);
2504 * If we are in the interprocedural view, we dump not
2505 * only the requested irg but also all irgs that can be reached
2508 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2509 ir_graph *g = get_irp_irg(i);
2510 ir_node **arr = ird_get_irg_link(g);
2512 dump_graph_from_list(out, g);
2517 dump_vcg_footer(out);
2520 /* Dump a firm graph without explicit block nodes. */
2521 void dump_ir_block_graph(ir_graph *irg, const char *suffix)
2523 do_dump(irg, suffix, "-ip", "", dump_ir_block_graph_file);
2526 void dump_ir_extblock_graph_file(ir_graph *irg, FILE *F)
2529 ir_entity *ent = get_irg_entity(irg);
2531 if (get_irg_extblk_state(irg) != extblk_valid)
2534 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2536 construct_extblock_lists(irg);
2538 fprintf(F, "graph: { title: \"");
2540 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2541 get_ent_dump_name(ent));
2543 dump_graph_info(F, irg);
2544 print_dbg_info(F, get_entity_dbg_info(ent));
2546 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2547 ir_graph *irg = get_irp_irg(i);
2548 list_tuple *lists = ird_get_irg_link(irg);
2551 /* dump the extended blocks first */
2552 if (ARR_LEN(lists->extbb_list)) {
2553 ird_set_irg_link(irg, lists->extbb_list);
2554 dump_extblock_graph(F, irg);
2557 /* we may have blocks without extended blocks, bad for instance */
2558 if (ARR_LEN(lists->blk_list)) {
2559 ird_set_irg_link(irg, lists->blk_list);
2560 dump_block_graph(F, irg);
2563 DEL_ARR_F(lists->extbb_list);
2564 DEL_ARR_F(lists->blk_list);
2569 /* Close the vcg information for the irg */
2570 fprintf(F, "}\n\n");
2576 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2577 void dump_ir_extblock_graph(ir_graph *irg, const char *suffix)
2579 do_dump(irg, suffix, "-ip", "", dump_ir_extblock_graph_file);
2582 void dump_ir_graph_w_types_file(ir_graph *irg, FILE *out)
2584 ir_graph *rem = current_ir_graph;
2585 int rem_dump_const_local;
2587 rem = current_ir_graph;
2588 current_ir_graph = irg;
2589 rem_dump_const_local = dump_const_local;
2590 /* dumping types does not work with local nodes */
2591 dump_const_local = 0;
2593 dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2595 /* dump common ir graph */
2596 irg_walk(get_irg_end(irg), NULL, dump_whole_node, out);
2597 /* dump type info */
2598 type_walk_irg(irg, dump_type_info, NULL, out);
2599 inc_irg_visited(get_const_code_irg());
2600 /* dump edges from graph to type info */
2601 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2603 dump_vcg_footer(out);
2604 dump_const_local = rem_dump_const_local;
2605 current_ir_graph = rem;
2608 /* dumps a graph with type information */
2609 void dump_ir_graph_w_types(ir_graph *irg, const char *suffix)
2611 do_dump(irg, suffix, "-pure-wtypes-ip", "-pure-wtypes",
2612 dump_ir_graph_w_types_file);
2615 void dump_ir_block_graph_w_types_file(ir_graph *irg, FILE *out)
2618 int rem_dump_const_local;
2619 ir_graph *rem = current_ir_graph;
2621 rem_dump_const_local = dump_const_local;
2622 /* dumping types does not work with local nodes */
2623 dump_const_local = 0;
2625 dump_vcg_header(out, get_irg_dump_name(irg), NULL);
2627 /* dump common blocked ir graph */
2628 construct_block_lists(irg);
2630 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2631 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2633 dump_graph_from_list(out, get_irp_irg(i));
2638 /* dump type info */
2639 current_ir_graph = irg;
2640 type_walk_irg(irg, dump_type_info, NULL, out);
2641 inc_irg_visited(get_const_code_irg());
2643 /* dump edges from graph to type info */
2644 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, out);
2646 dump_vcg_footer(out);
2647 dump_const_local = rem_dump_const_local;
2648 current_ir_graph = rem;
2651 void dump_ir_block_graph_w_types(ir_graph *irg, const char *suffix)
2653 do_dump(irg, suffix, "-wtypes-ip", "-wtypes",
2654 dump_ir_block_graph_w_types_file);
2657 /*---------------------------------------------------------------------*/
2658 /* The following routines dump a control flow graph. */
2659 /*---------------------------------------------------------------------*/
2662 dump_block_to_cfg(ir_node *block, void *env) {
2667 if (is_Block(block)) {
2668 /* This is a block. Dump a node for the block. */
2669 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2670 fprintf(F, "\" label: \"");
2671 if (block == get_irg_start_block(get_irn_irg(block)))
2672 fprintf(F, "Start ");
2673 if (block == get_irg_end_block(get_irn_irg(block)))
2676 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2677 PRINT_NODEID(block);
2679 fprintf(F, "info1:\"");
2681 /* the generic version. */
2682 dump_irnode_to_file(F, block);
2684 /* Check whether we have bad predecessors to color the block. */
2685 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2686 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2689 fprintf(F, "\""); /* closing quote of info */
2691 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2692 (block == get_irg_end_block(get_irn_irg(block))) )
2693 fprintf(F, " color:blue ");
2695 fprintf(F, " color:yellow ");
2698 /* Dump the edges */
2699 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2700 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2701 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2702 fprintf(F, "edge: { sourcename: \"");
2703 PRINT_NODEID(block);
2704 fprintf(F, "\" targetname: \"");
2706 fprintf(F, "\"}\n");
2709 /* Dump dominator/postdominator edge */
2710 if (dump_dominator_information_flag) {
2711 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2712 pred = get_Block_idom(block);
2713 fprintf(F, "edge: { sourcename: \"");
2714 PRINT_NODEID(block);
2715 fprintf(F, "\" targetname: \"");
2717 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2719 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2720 pred = get_Block_ipostdom(block);
2721 fprintf(F, "edge: { sourcename: \"");
2722 PRINT_NODEID(block);
2723 fprintf(F, "\" targetname: \"");
2725 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2731 void dump_cfg(ir_graph *irg, const char *suffix)
2734 /* if a filter is set, dump only the irg's that match the filter */
2735 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2738 f = vcg_open(irg, suffix, "-cfg");
2740 ir_graph *rem = current_ir_graph;
2741 #ifdef INTERPROCEDURAL_VIEW
2742 int ipv = get_interprocedural_view();
2745 current_ir_graph = irg;
2746 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2748 #ifdef INTERPROCEDURAL_VIEW
2750 printf("Warning: dumping cfg not in interprocedural view!\n");
2751 set_interprocedural_view(0);
2755 /* walk over the blocks in the graph */
2756 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2757 dump_node(f, get_irg_bad(irg));
2759 #ifdef INTERPROCEDURAL_VIEW
2760 set_interprocedural_view(ipv);
2764 current_ir_graph = rem;
2769 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2770 if (pset_find_ptr(mark_set, n)) return;
2772 pset_insert_ptr(mark_set, n);
2775 int i, start = is_Block(n) ? 0 : -1;
2776 dump_whole_node(n, F);
2777 for (i = start; i < get_irn_arity(n); ++i)
2778 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2781 /* Don't dump edges to nodes further out. These might be edges to
2782 nodes we already dumped, if there is a shorter path to these. */
2786 static int subgraph_counter = 0;
2787 void dump_subgraph(ir_node *root, int depth, const char *suffix) {
2791 sprintf(buf, "-subg_%03d", subgraph_counter++);
2792 F = vcg_open(get_irn_irg(root), suffix, buf);
2794 pset *mark_set = pset_new_ptr(1);
2795 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2796 descend_and_dump(F, root, depth, mark_set);
2803 #ifdef INTERPROCEDURAL_VIEW
2804 void dump_callgraph(const char *suffix) {
2805 FILE *F = vcg_open_name("Callgraph", suffix);
2808 int i, rem = edge_label;
2811 dump_vcg_header(F, "Callgraph", NULL);
2813 //colorize = get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent;
2815 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2816 ir_graph *irg = get_irp_irg(i);
2817 ir_entity *ent = get_irg_entity(irg);
2819 //int n_callees = get_irg_n_callees(irg);
2822 //color = colorize ? get_entity_color(ent) : ird_color_green;
2823 color = ird_color_green;
2824 dump_entity_node(F, ent, color);
2825 for (j = 0; j < n_callees; ++j) {
2826 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2827 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2828 int be = is_irg_callee_backedge(irg, j);
2831 "label:\"recursion %d\" color:%d" :
2832 "label:\"calls %d\" color:%d";
2833 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), color);
2843 /* Dump all irgs in interprocedural view to a single file. */
2844 void dump_all_cg_block_graph(const char *suffix) {
2845 FILE *f = vcg_open_name("All_graphs", suffix);
2849 int rem_view = get_interprocedural_view();
2851 set_interprocedural_view(1);
2852 dump_vcg_header(f, "All_graphs", NULL);
2854 /* collect nodes in all irgs reachable in call graph*/
2855 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2856 ird_set_irg_link(get_irp_irg(i), NULL);
2858 cg_walk(clear_link, collect_node, NULL);
2860 /* dump all graphs */
2861 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2862 current_ir_graph = get_irp_irg(i);
2863 assert(ird_get_irg_link(current_ir_graph));
2864 dump_graph_from_list(f, current_ir_graph);
2865 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2870 set_interprocedural_view(rem_view);
2875 /*---------------------------------------------------------------------*/
2876 /* the following routines dumps type information without any ir nodes. */
2877 /*---------------------------------------------------------------------*/
2880 dump_type_graph(ir_graph *irg, const char *suffix)
2884 /* if a filter is set, dump only the irg's that match the filter */
2885 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2887 f = vcg_open(irg, suffix, "-type");
2889 ir_graph *rem = current_ir_graph;
2890 current_ir_graph = irg;
2892 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2894 /* walk over the blocks in the graph */
2895 type_walk_irg(irg, dump_type_info, NULL, f);
2896 /* The walker for the const code can be called several times for the
2897 same (sub) expression. So that no nodes are dumped several times
2898 we decrease the visited flag of the corresponding graph after each
2899 walk. So now increase it finally. */
2900 inc_irg_visited(get_const_code_irg());
2904 current_ir_graph = rem;
2909 dump_all_types(const char *suffix)
2911 FILE *f = vcg_open_name("All_types", suffix);
2913 dump_vcg_header(f, "All_types", NULL);
2914 type_walk(dump_type_info, NULL, f);
2915 inc_irg_visited(get_const_code_irg());
2923 dump_class_hierarchy(int entities, const char *suffix)
2925 FILE *f = vcg_open_name("class_hierarchy", suffix);
2930 env.dump_ent = entities;
2931 dump_vcg_header(f, "class_hierarchy", NULL);
2932 type_walk(dump_class_hierarchy_node, NULL, &env);
2939 /*---------------------------------------------------------------------*/
2940 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2942 /* dump_ir_block_graph */
2944 /* dump_type_graph */
2945 /* dump_ir_graph_w_types */
2946 /*---------------------------------------------------------------------*/
2948 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2950 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2951 dmp_grph(get_irp_irg(i), suffix);
2955 /*--------------------------------------------------------------------------------*
2956 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2957 * packed together in one subgraph/box *
2958 *--------------------------------------------------------------------------------*/
2960 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2961 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2963 ir_loop *son = NULL;
2965 /* Dump a new loop node. */
2966 dump_loop_node(F, loop);
2968 /* Dump the loop elements. */
2970 for(i = 0; i < get_loop_n_elements(loop); i++) {
2971 le = get_loop_element(loop, i);
2973 if (get_kind(son) == k_ir_loop) {
2975 /* We are a loop son -> Recurse */
2977 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2978 fprintf(F, "\" }\n");
2979 fprintf(F, "edge: {sourcename: \"");
2981 fprintf(F, "\" targetname: \"");
2983 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2984 loop_node_started = 0;
2986 dump_loop_son_edge(F, loop, son_number++);
2987 dump_loops_standalone(F, son);
2988 } else if (get_kind(son) == k_ir_node) {
2989 /* We are a loop node -> Collect firm nodes */
2991 ir_node *n = le.node;
2994 if (!loop_node_started) {
2995 /* Start a new node which contains all firm nodes of the current loop */
2996 fprintf(F, "node: { title: \"");
2998 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
2999 loop_node_started = 1;
3004 bad |= dump_node_label(F, n);
3005 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
3006 if (has_backedges(n)) fprintf(F, "\t loop head!");
3007 } else { /* for callgraph loop tree */
3009 assert(get_kind(son) == k_ir_graph);
3011 /* We are a loop node -> Collect firm graphs */
3012 n = (ir_graph *)le.node;
3013 if (!loop_node_started) {
3014 /* Start a new node which contains all firm nodes of the current loop */
3015 fprintf(F, "node: { title: \"");
3017 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
3018 loop_node_started = 1;
3022 fprintf(F, " %s", get_irg_dump_name(n));
3023 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
3027 if (loop_node_started) {
3028 fprintf(F, "\" }\n");
3029 fprintf(F, "edge: {sourcename: \"");
3031 fprintf(F, "\" targetname: \"");
3033 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3034 loop_node_started = 0;
3038 void dump_loop_tree(ir_graph *irg, const char *suffix)
3042 /* if a filter is set, dump only the irg's that match the filter */
3043 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
3045 f = vcg_open(irg, suffix, "-looptree");
3047 ir_graph *rem = current_ir_graph;
3048 int el_rem = edge_label;
3050 current_ir_graph = irg;
3053 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
3055 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
3060 edge_label = el_rem;
3061 current_ir_graph = rem;
3065 void dump_callgraph_loop_tree(const char *suffix) {
3067 F = vcg_open_name("Callgraph_looptree", suffix);
3068 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
3069 dump_loops_standalone(F, irp->outermost_cg_loop);
3075 /*----------------------------------------------------------------------------*/
3076 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes.*/
3077 /*----------------------------------------------------------------------------*/
3079 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
3080 int i, son_number = 0, node_number = 0;
3082 if (dump_loop_information_flag) dump_loop_node(F, loop);
3084 for (i = 0; i < get_loop_n_elements(loop); i++) {
3085 loop_element le = get_loop_element(loop, i);
3086 if (*(le.kind) == k_ir_loop) {
3087 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
3089 collect_nodeloop(F, le.son, loopnodes);
3091 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
3092 eset_insert(loopnodes, le.node);
3097 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
3100 for(i = 0; i < get_loop_n_elements(loop); i++) {
3101 loop_element le = get_loop_element(loop, i);
3102 if (*(le.kind) == k_ir_loop) {
3104 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3106 if (is_Block(le.node)) start = 0; else start = -1;
3107 for (j = start; j < get_irn_arity(le.node); j++) {
3108 ir_node *pred = get_irn_n(le.node, j);
3109 if (!eset_contains(loopnodes, pred)) {
3110 eset_insert(extnodes, pred);
3111 if (!is_Block(pred)) {
3112 pred = get_nodes_block(pred);
3113 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3121 void dump_loop(ir_loop *l, const char *suffix) {
3125 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3126 F = vcg_open_name(name, suffix);
3128 eset *loopnodes = eset_create();
3129 eset *extnodes = eset_create();
3132 dump_vcg_header(F, name, NULL);
3134 /* collect all nodes to dump */
3135 collect_nodeloop(F, l, loopnodes);
3136 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3138 /* build block lists */
3139 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3140 set_irn_link(n, NULL);
3141 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3142 set_irn_link(n, NULL);
3143 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) {
3145 b = get_nodes_block(n);
3146 set_irn_link(n, get_irn_link(b));
3150 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) {
3152 b = get_nodes_block(n);
3153 set_irn_link(n, get_irn_link(b));
3158 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) {
3160 fprintf(F, "graph: { title: \"");
3162 fprintf(F, "\" label: \"");
3163 dump_node_opcode(F, b);
3164 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3165 fprintf(F, "\" status:clustered color:yellow\n");
3167 /* dump the blocks edges */
3168 dump_ir_data_edges(F, b);
3170 /* dump the nodes that go into the block */
3171 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3172 if (eset_contains(extnodes, n))
3173 overrule_nodecolor = ird_color_block_inout;
3175 overrule_nodecolor = ird_color_default_node;
3176 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3179 /* Close the vcg information for the block */
3181 dump_const_node_local(F, b);
3185 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) {
3187 fprintf(F, "graph: { title: \"");
3189 fprintf(F, "\" label: \"");
3190 dump_node_opcode(F, b);
3191 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3192 fprintf(F, "\" status:clustered color:lightblue\n");
3194 /* dump the nodes that go into the block */
3195 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3196 if (!eset_contains(loopnodes, n))
3197 overrule_nodecolor = ird_color_block_inout;
3199 overrule_nodecolor = ird_color_default_node;
3200 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3203 /* Close the vcg information for the block */
3205 dump_const_node_local(F, b);
3209 eset_destroy(loopnodes);
3210 eset_destroy(extnodes);