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"
55 #include "callgraph.h"
56 #include "irextbb_t.h"
58 #include "dbginfo_t.h"
70 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
71 extern void dump_irn_state(FILE *FL, ir_node *n);
72 extern int get_opt_dump_abstvals(void);
73 typedef unsigned long SeqNo;
74 extern SeqNo get_Block_seqno(ir_node *n);
77 /* basis for a color range for vcg */
78 static int n_colors = 0;
79 static int base_color = 0;
81 /** Dump only irgs with names that start with this string */
82 static ident *dump_file_filter_id = NULL;
84 #define ERROR_TXT "<ERROR>"
86 /*******************************************************************/
87 /* flags to steer output */
88 /*******************************************************************/
90 /** An option to turn off edge labels */
91 static int edge_label = 1;
92 /** An option to turn off dumping values of constant entities */
93 static int const_entities = 1;
94 /** An option to dump the keep alive edges */
95 static int dump_keepalive = 0;
96 /** An option to dump ld_names instead of names. */
97 static int dump_ld_name = 1;
98 /** Compiler options to dump analysis information in dump_ir_graph */
99 static int dump_out_edge_flag = 0;
100 static int dump_loop_information_flag = 0;
101 static int dump_backedge_information_flag = 1;
102 static int dump_const_local = 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 dumper_colors overrule_nodecolor = ird_color_default;
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)
163 return dump_const_local;
168 /* Set a prefix filter for output functions. */
169 void only_dump_method_with_name(ident *name) {
170 dump_file_filter_id = name;
173 /* Returns the prefix filter set with only_dump_method_with_name(). */
174 ident *get_dump_file_filter_ident(void) {
175 return dump_file_filter_id;
178 /* Returns non-zero if dump file filter is not set, or if it is a prefix of name. */
179 int is_filtered_dump_name(ident *name) {
180 if (!dump_file_filter_id) return 1;
181 return id_is_prefix(dump_file_filter_id, name);
184 /* To turn off display of edge labels. Edge labels often cause xvcg to
185 abort with a segmentation fault. */
186 void turn_off_edge_labels(void) {
190 void dump_consts_local(int flag) {
191 dump_const_local = flag;
194 void dump_constant_entity_values(int flag) {
195 const_entities = flag;
198 void dump_keepalive_edges(int flag) {
199 dump_keepalive = flag;
202 int get_opt_dump_keepalive_edges(void) {
203 return dump_keepalive;
206 void dump_out_edges(int flag) {
207 dump_out_edge_flag = flag;
210 void dump_dominator_information(int flag) {
211 dump_dominator_information_flag = flag;
214 void dump_loop_information(int flag) {
215 dump_loop_information_flag = flag;
218 void dump_backedge_information(int flag) {
219 dump_backedge_information_flag = flag;
222 /* Dump the information of type field specified in ana/irtypeinfo.h.
223 * If the flag is set, the type name is output in [] in the node label,
224 * else it is output as info.
226 void set_opt_dump_analysed_type_info(int flag) {
227 opt_dump_analysed_type_info = flag;
230 void dump_pointer_values_to_info(int flag) {
231 opt_dump_pointer_values_to_info = flag;
234 void dump_ld_names(int flag) {
238 void dump_all_anchors(int flag) {
242 /* -------------- some extended helper functions ----------------- */
245 * returns the name of a mode or <ERROR> if mode is NOT a mode object.
246 * in the later case, sets bad
248 const char *get_mode_name_ex(ir_mode *mode, int *bad) {
250 return get_mode_name(mode);
256 * returns the name of a type or <ERROR> if mode is NOT a mode object.
257 * in the later case, sets bad
259 const char *get_type_name_ex(ir_type *tp, int *bad) {
261 return get_type_name(tp);
267 * printf the VCG color to a file
269 static void print_vcg_color(FILE *F, dumper_colors color) {
270 static const char *color_names[32] = {
271 "white", "blue", "red", "green",
272 "yellow", "magenta", "cyan", "darkgray",
273 "darkblue", "darkred", "darkgreen", "darkyellow",
274 "darkmagenta", "darkcyan", "gold", "lightgray",
275 "lightblue", "lightred", "lightgreen", "lightyellow",
276 "lightmagenta", "lightcyan", "lilac", "turquoise",
277 "aquamarine", "khaki", "purple", "yellowgreen",
278 "pink", "orange", "orchid", "black"
281 if (color != ird_color_default)
282 fprintf(F, "color:%s", color_names[color]);
286 * prints the edge from a type S to a type T with additional info fmt, ...
289 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
294 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
295 fprintf(F, " targetname: "); PRINT_TYPEID(T);
296 vfprintf(F, fmt, ap);
302 * prints the edge from a type T to an entity E with additional info fmt, ...
305 static void print_type_ent_edge(FILE *F, ir_type *T, ir_entity *E, const char *fmt, ...)
310 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
311 fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
312 vfprintf(F, fmt, ap);
318 * prints the edge from an entity E to an entity T with additional info fmt, ...
321 static void print_ent_ent_edge(FILE *F, ir_entity *E, ir_entity *T, int backedge, const char *fmt, ...)
327 fprintf(F, "backedge: { sourcename: \"");
329 fprintf(F, "edge: { sourcename: \"");
331 fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\"");
332 vfprintf(F, fmt, ap);
338 * prints the edge from an entity E to a type T with additional info fmt, ...
341 static void print_ent_type_edge(FILE *F, ir_entity *E, ir_type *T, const char *fmt, ...)
346 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
347 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
348 vfprintf(F, fmt, ap);
354 * prints the edge from a node N to a type T with additional info fmt, ...
357 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
362 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
363 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
364 vfprintf(F, fmt, ap);
370 * prints the edge from a node N to an entity E with additional info fmt, ...
373 static void print_node_ent_edge(FILE *F, const ir_node *N, ir_entity *E, const char *fmt, ...)
378 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
379 fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
381 vfprintf(F, fmt, ap);
387 * prints the edge from an entity E to a node N with additional info fmt, ...
390 static void print_ent_node_edge(FILE *F, ir_entity *E, const ir_node *N, const char *fmt, ...)
395 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
396 fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
397 vfprintf(F, fmt, ap);
403 * prints the edge from a type E to an enumeration item item with additional info fmt, ...
406 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
411 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
412 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
413 vfprintf(F, fmt, ap);
418 /*-----------------------------------------------------------------*/
419 /* global and ahead declarations */
420 /*-----------------------------------------------------------------*/
422 static void dump_whole_node(ir_node *n, void *env);
423 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
425 /*-----------------------------------------------------------------*/
426 /* Helper functions. */
427 /*-----------------------------------------------------------------*/
430 * This map is used as a private link attr to be able to call dumper
431 * anywhere without destroying link fields.
433 static pmap *irdump_link_map = NULL;
435 /** NOT A STANDARD LIBFIRM INIT METHOD
437 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
438 * are off, we want to have as few interferences as possible. Therefore the
439 * initialization is performed lazily and not called from within init_firm.
441 * Creates the link attribute map. */
442 static void init_irdump(void) {
443 /* We need a new, empty map. */
444 if (irdump_link_map) pmap_destroy(irdump_link_map);
445 irdump_link_map = pmap_create();
446 if (!dump_file_filter_id)
447 dump_file_filter_id = new_id_from_str("");
451 * Returns the private link field.
453 static void *ird_get_irn_link(ir_node *n) {
455 if (!irdump_link_map) return NULL;
457 if (pmap_contains(irdump_link_map, (void *)n))
458 res = pmap_get(irdump_link_map, (void *)n);
463 * Sets the private link field.
465 static void ird_set_irn_link(ir_node *n, void *x) {
466 if (!irdump_link_map)
468 pmap_insert(irdump_link_map, (void *)n, x);
472 * Gets the private link field of an irg.
474 static void *ird_get_irg_link(ir_graph *irg) {
476 if (!irdump_link_map) return NULL;
478 if (pmap_contains(irdump_link_map, (void *)irg))
479 res = pmap_get(irdump_link_map, (void *)irg);
484 * Sets the private link field of an irg.
486 static void ird_set_irg_link(ir_graph *irg, void *x) {
487 if (!irdump_link_map) init_irdump();
488 pmap_insert(irdump_link_map, (void *)irg, x);
492 * Walker, clears the private link field.
494 static void clear_link(ir_node * node, void * env) {
496 ird_set_irn_link(node, NULL);
500 * If the entity has a ld_name, returns it if the dump_ld_name is set,
501 * else returns the name of the entity.
503 static const char *_get_ent_dump_name(ir_entity *ent, int dump_ld_name) {
505 return "<NULL entity>";
507 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
508 if (ent->ld_name) return get_id_str(ent->ld_name);
510 return get_id_str(ent->name);
514 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
515 * else returns the name of the entity.
517 const char *get_ent_dump_name(ir_entity *ent) {
518 return _get_ent_dump_name(ent, dump_ld_name);
521 /* Returns the name of an IRG. */
522 const char *get_irg_dump_name(ir_graph *irg) {
523 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
524 return _get_ent_dump_name(get_irg_entity(irg), 1);
528 * Returns non-zero if a node is in floating state.
530 static int node_floats(ir_node *n) {
531 return ((get_irn_pinned(n) == op_pin_state_floats) &&
532 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
536 * Walker that visits the anchors
538 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
540 irg_walk_anchors(irg, pre, post, env);
542 irg_walk_graph(irg, pre, post, env);
547 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
549 static void collect_node(ir_node * node, void *env) {
553 || get_irn_op(node) == op_Bad
554 || get_irn_op(node) == op_Unknown
555 || get_irn_op(node) == op_NoMem) {
556 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
557 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
558 ARR_APP1(ir_node *, arr, node);
559 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
561 ir_node * block = get_nodes_block(node);
564 /* this node is in a Bad block, so we must place it into the graph's list */
565 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
566 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
567 ARR_APP1(ir_node *, arr, node);
568 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
570 ird_set_irn_link(node, ird_get_irn_link(block));
571 ird_set_irn_link(block, node);
576 /** Construct lists to walk ir block-wise.
578 * Collects all blocks, nodes not op_pin_state_pinned,
579 * Bad, NoMem and Unknown into a flexible array in link field of
580 * irg they belong to. Sets the irg link field to NULL in all
581 * graphs not visited.
582 * Free the list with DEL_ARR_F().
584 static ir_node **construct_block_lists(ir_graph *irg) {
586 int rem_view = get_interprocedural_view();
587 int walk_flag = using_visited(irg);
588 ir_graph *rem = current_ir_graph;
590 current_ir_graph = irg;
593 clear_using_visited(current_ir_graph);
595 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
596 ird_set_irg_link(get_irp_irg(i), NULL);
598 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
600 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
601 set_interprocedural_view(0);
603 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
604 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
605 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
606 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
608 set_interprocedural_view(rem_view);
611 set_using_visited(current_ir_graph);
613 current_ir_graph = rem;
614 return ird_get_irg_link(irg);
617 typedef struct _list_tuple {
619 ir_extblk **extbb_list;
622 /** Construct lists to walk IR extended block-wise.
623 * Free the lists in the tuple with DEL_ARR_F().
624 * Sets the irg link field to NULL in all
625 * graphs not visited.
627 static list_tuple *construct_extblock_lists(ir_graph *irg) {
628 ir_node **blk_list = construct_block_lists(irg);
630 ir_graph *rem = current_ir_graph;
631 list_tuple *lists = xmalloc(sizeof(*lists));
633 current_ir_graph = irg;
635 lists->blk_list = NEW_ARR_F(ir_node *, 0);
636 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
638 inc_irg_block_visited(irg);
639 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
642 if (is_Block(blk_list[i])) {
643 ext = get_Block_extbb(blk_list[i]);
645 if (extbb_not_visited(ext)) {
646 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
647 mark_extbb_visited(ext);
650 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
654 current_ir_graph = rem;
655 ird_set_irg_link(irg, lists);
659 /*-----------------------------------------------------------------*/
660 /* Routines to dump information about a single ir node. */
661 /*-----------------------------------------------------------------*/
664 * dump the name of a node n to the File F.
666 int dump_node_opcode(FILE *F, ir_node *n)
669 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
671 /* call the dump_node operation if available */
673 return ops->dump_node(n, F, dump_node_opcode_txt);
675 /* implementation for default nodes */
676 switch (get_irn_opcode(n)) {
681 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
682 assert(res < (int) sizeof(buf) && "buffer to small for tarval_snprintf");
687 switch (get_SymConst_kind(n)) {
688 case symconst_addr_name:
689 /* don't use get_SymConst_ptr_info as it mangles the name. */
690 fprintf(F, "SymC %s", get_id_str(get_SymConst_name(n)));
692 case symconst_addr_ent:
693 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
695 case symconst_ofs_ent:
696 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
698 case symconst_type_tag:
699 fprintf(F, "SymC %s tag", get_type_name_ex(get_SymConst_type(n), &bad));
701 case symconst_type_size:
702 fprintf(F, "SymC %s size", get_type_name_ex(get_SymConst_type(n), &bad));
704 case symconst_type_align:
705 fprintf(F, "SymC %s align", get_type_name_ex(get_SymConst_type(n), &bad));
707 case symconst_enum_const:
708 fprintf(F, "SymC %s enum", get_enumeration_name(get_SymConst_enum(n)));
711 fprintf(F, "SymC %lu label", get_SymConst_label(n));
717 if (!get_interprocedural_view())
724 ir_node *pred = get_Proj_pred(n);
726 if (get_irn_opcode(pred) == iro_Cond
727 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
728 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
729 fprintf(F, "defProj");
737 if (get_interprocedural_view()) {
738 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
743 case iro_CallBegin: {
744 ir_node *addr = get_CallBegin_ptr(n);
745 ir_entity *ent = NULL;
746 if (get_irn_op(addr) == op_Sel)
747 ent = get_Sel_entity(addr);
748 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
749 ent = get_SymConst_entity(addr);
750 fprintf(F, "%s", get_irn_opname(n));
751 if (ent) fprintf(F, " %s", get_entity_name(ent));
755 if (get_Load_align(n) == align_non_aligned)
757 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
760 if (get_Store_align(n) == align_non_aligned)
762 fprintf(F, "%s", get_irn_opname(n));
765 fprintf(F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
768 if (get_Conv_strict(n))
769 fprintf(F, "strict");
770 fprintf(F, "%s", get_irn_opname(n));
773 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Div_resmode(n), &bad));
776 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Mod_resmode(n), &bad));
779 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_DivMod_resmode(n), &bad));
784 fprintf(F, "%s", get_irn_opname(n));
791 * Dump the mode of a node n to a file F.
792 * Ignore modes that are "always known".
794 static int dump_node_mode(FILE *F, ir_node *n)
797 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
800 /* call the dump_node operation if available */
802 return ops->dump_node(n, F, dump_node_mode_txt);
804 /* default implementation */
805 iro = get_irn_opcode(n);
817 ir_mode *mode = get_irn_mode(n);
819 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
820 (mode != mode_T || iro == iro_Proj))
821 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
829 * Dump the type of a node n to a file F if it's known.
831 static int dump_node_typeinfo(FILE *F, ir_node *n) {
834 if (opt_dump_analysed_type_info) {
835 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
836 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
837 ir_type *tp = get_irn_typeinfo_type(n);
838 if (tp != firm_none_type)
839 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
847 typedef struct _pns_lookup {
848 long nr; /**< the proj number */
849 const char *name; /**< the name of the Proj */
852 typedef struct _proj_lookup {
853 ir_opcode code; /**< the opcode of the Proj predecessor */
854 unsigned num_data; /**< number of data entries */
855 const pns_lookup_t *data; /**< the data */
858 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
860 /** the lookup table for Proj(Start) names */
861 static const pns_lookup_t start_lut[] = {
862 #define X(a) { pn_Start_##a, #a }
872 /** the lookup table for Proj(Cond) names */
873 static const pns_lookup_t cond_lut[] = {
874 #define X(a) { pn_Cond_##a, #a }
880 /** the lookup table for Proj(Call) names */
881 static const pns_lookup_t call_lut[] = {
882 #define X(a) { pn_Call_##a, #a }
892 /** the lookup table for Proj(Quot) names */
893 static const pns_lookup_t quot_lut[] = {
894 #define X(a) { pn_Quot_##a, #a }
902 /** the lookup table for Proj(DivMod) names */
903 static const pns_lookup_t divmod_lut[] = {
904 #define X(a) { pn_DivMod_##a, #a }
913 /** the lookup table for Proj(Div) names */
914 static const pns_lookup_t div_lut[] = {
915 #define X(a) { pn_Div_##a, #a }
923 /** the lookup table for Proj(Mod) names */
924 static const pns_lookup_t mod_lut[] = {
925 #define X(a) { pn_Mod_##a, #a }
933 /** the lookup table for Proj(Load) names */
934 static const pns_lookup_t load_lut[] = {
935 #define X(a) { pn_Load_##a, #a }
943 /** the lookup table for Proj(Store) names */
944 static const pns_lookup_t store_lut[] = {
945 #define X(a) { pn_Store_##a, #a }
952 /** the lookup table for Proj(Alloc) names */
953 static const pns_lookup_t alloc_lut[] = {
954 #define X(a) { pn_Alloc_##a, #a }
962 /** the lookup table for Proj(CopyB) names */
963 static const pns_lookup_t copyb_lut[] = {
964 #define X(a) { pn_CopyB_##a, #a }
972 /** the lookup table for Proj(InstOf) names */
973 static const pns_lookup_t instof_lut[] = {
974 #define X(a) { pn_InstOf_##a, #a }
983 /** the lookup table for Proj(Raise) names */
984 static const pns_lookup_t raise_lut[] = {
985 #define X(a) { pn_Raise_##a, #a }
991 /** the lookup table for Proj(Bound) names */
992 static const pns_lookup_t bound_lut[] = {
993 #define X(a) { pn_Bound_##a, #a }
1001 /** the Proj lookup table */
1002 static const proj_lookup_t proj_lut[] = {
1003 #define E(a) ARR_SIZE(a), a
1004 { iro_Start, E(start_lut) },
1005 { iro_Cond, E(cond_lut) },
1006 { iro_Call, E(call_lut) },
1007 { iro_Quot, E(quot_lut) },
1008 { iro_DivMod, E(divmod_lut) },
1009 { iro_Div, E(div_lut) },
1010 { iro_Mod, E(mod_lut) },
1011 { iro_Load, E(load_lut) },
1012 { iro_Store, E(store_lut) },
1013 { iro_Alloc, E(alloc_lut) },
1014 { iro_CopyB, E(copyb_lut) },
1015 { iro_InstOf, E(instof_lut) },
1016 { iro_Raise, E(raise_lut) },
1017 { iro_Bound, E(bound_lut) }
1022 * Dump additional node attributes of some nodes to a file F.
1025 dump_node_nodeattr(FILE *F, ir_node *n)
1031 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1033 /* call the dump_node operation if available */
1035 return ops->dump_node(n, F, dump_node_nodeattr_txt);
1037 switch (get_irn_opcode(n)) {
1039 if (0 && get_interprocedural_view()) {
1040 fprintf(F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
1045 pred = get_Proj_pred(n);
1046 proj_nr = get_Proj_proj(n);
1048 code = get_irn_opcode(pred);
1050 if (code == iro_Cmp)
1051 fprintf(F, "%s ", get_pnc_string(get_Proj_proj(n)));
1052 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1053 fprintf(F, "Arg %ld ", proj_nr);
1054 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1055 fprintf(F, "%ld ", proj_nr);
1057 unsigned i, j, f = 0;
1059 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1060 if (code == proj_lut[i].code) {
1061 for (j = 0; j < proj_lut[i].num_data; ++j) {
1062 if (proj_nr == proj_lut[i].data[j].nr) {
1063 fprintf(F, "%s ", proj_lut[i].data[j].name);
1072 fprintf(F, "%ld ", proj_nr);
1073 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1074 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1075 fprintf(F, "PRED ");
1076 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1077 fprintf(F, "PRED ");
1082 proj_nr = get_Filter_proj(n);
1083 if (! get_interprocedural_view()) {
1085 pred = get_Filter_pred(n);
1088 fprintf(F, "%ld ", proj_nr);
1091 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1094 fprintf(F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1097 fprintf(F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1100 fprintf(F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1111 #include "execution_frequency.h"
1113 static void dump_node_ana_vals(FILE *F, ir_node *n) {
1115 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1116 get_irn_exec_freq(n),
1117 get_irg_method_execution_frequency(get_irn_irg(n)),
1118 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1119 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1124 /* Dumps a node label without the enclosing ". */
1125 int dump_node_label(FILE *F, ir_node *n) {
1128 bad |= dump_node_opcode(F, n);
1129 bad |= dump_node_mode(F, n);
1131 bad |= dump_node_typeinfo(F, n);
1132 bad |= dump_node_nodeattr(F, n);
1133 fprintf(F, "%ld:%d", get_irn_node_nr(n), get_irn_idx(n));
1140 * Dumps the attributes of a node n into the file F.
1141 * Currently this is only the color of a node.
1143 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1148 print_vcg_color(F, ird_color_red);
1152 if (dump_node_vcgattr_hook)
1153 if (dump_node_vcgattr_hook(F, node, local))
1156 n = local ? local : node;
1158 if (overrule_nodecolor != ird_color_default) {
1159 print_vcg_color(F, overrule_nodecolor);
1163 switch (get_irn_opcode(n)) {
1170 print_vcg_color(F, ird_color_blue);
1173 if (is_Block_dead(n))
1174 print_vcg_color(F, ird_color_lightred);
1176 print_vcg_color(F, ird_color_lightyellow);
1179 print_vcg_color(F, ird_color_green);
1183 print_vcg_color(F, ird_color_gold);
1186 print_vcg_color(F, ird_color_orchid);
1192 print_vcg_color(F, ird_color_yellow);
1195 print_vcg_color(F, ird_color_darkyellow);
1198 PRINT_DEFAULT_NODE_ATTR;
1202 /* Adds a new node info dumper callback. */
1203 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1205 hook_entry_t *info = xmalloc(sizeof(*info));
1207 info->hook._hook_node_info = cb;
1208 info->context = data;
1209 register_hook(hook_node_info, info);
1214 /* Remove a previously added info dumper callback. */
1215 void dump_remv_node_info_callback(void *handle)
1217 hook_entry_t *info = handle;
1218 unregister_hook(hook_node_info, info);
1223 * Dump the node information of a node n to a file F.
1225 static INLINE int dump_node_info(FILE *F, ir_node *n)
1228 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1230 fprintf(F, " info1: \"");
1231 bad = dump_irnode_to_file(F, n);
1232 /* call the dump_node operation if available */
1234 bad = ops->dump_node(n, F, dump_node_info_txt);
1236 /* allow additional info to be added */
1237 hook_node_info(F, n);
1244 * checks whether a node is "constant-like" ie can be treated "block-less"
1247 int is_constlike_node(ir_node *n) {
1248 ir_opcode code = get_irn_opcode(n);
1249 return (code == iro_Const || code == iro_Bad || code == iro_NoMem || code == iro_SymConst || code == iro_Unknown);
1253 /** outputs the predecessors of n, that are constants, local. I.e.,
1254 generates a copy of the constant predecessors for each node called with. */
1255 static void dump_const_node_local(FILE *F, ir_node *n) {
1257 if (!get_opt_dump_const_local()) return;
1259 /* Use visited flag to avoid outputting nodes twice.
1260 initialize it first. */
1261 for (i = 0; i < get_irn_arity(n); i++) {
1262 ir_node *con = get_irn_n(n, i);
1263 if (is_constlike_node(con)) {
1264 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1268 for (i = 0; i < get_irn_arity(n); i++) {
1269 ir_node *con = get_irn_n(n, i);
1270 if (is_constlike_node(con) && irn_not_visited(con)) {
1273 mark_irn_visited(con);
1274 /* Generate a new name for the node by appending the names of
1276 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1277 fprintf(F, " label: \"");
1278 bad |= dump_node_label(F, con);
1280 bad |= dump_node_info(F, con);
1281 dump_node_vcgattr(F, n, con, bad);
1287 /** If the block of an edge is a const_like node, dump it local with an edge */
1288 static void dump_const_block_local(FILE *F, ir_node *n) {
1291 if (!get_opt_dump_const_local()) return;
1293 blk = get_nodes_block(n);
1294 if (is_constlike_node(blk)) {
1297 /* Generate a new name for the node by appending the names of
1299 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1300 fprintf(F, "\" label: \"");
1301 bad |= dump_node_label(F, blk);
1303 bad |= dump_node_info(F, blk);
1304 dump_node_vcgattr(F, n, blk, bad);
1307 fprintf(F, "edge: { sourcename: \"");
1309 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1311 if (dump_edge_vcgattr_hook) {
1313 if (dump_edge_vcgattr_hook(F, n, -1)) {
1317 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1322 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1327 * prints the error message of a node to a file F as info2.
1329 static void print_node_error(FILE *F, const char *err_msg)
1334 fprintf(F, " info2: \"%s\"", err_msg);
1338 * prints debug messages of a node to file F as info3.
1340 static void print_dbg_info(FILE *F, dbg_info *dbg)
1344 if (__dbg_info_snprint) {
1346 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1347 fprintf(F, " info3: \"%s\"\n", buf);
1354 static void dump_node(FILE *F, ir_node *n)
1359 if (get_opt_dump_const_local() && is_constlike_node(n))
1362 /* dump this node */
1363 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1365 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1366 bad |= dump_node_label(F, n);
1367 dump_node_ana_vals(F, n);
1368 //dump_node_ana_info(F, n);
1370 bad |= dump_node_info(F, n);
1371 print_node_error(F, p);
1372 print_dbg_info(F, get_irn_dbg_info(n));
1373 dump_node_vcgattr(F, n, NULL, bad);
1375 dump_const_node_local(F, n);
1377 if(dump_node_edge_hook)
1378 dump_node_edge_hook(F, n);
1380 dump_irn_chi_term(F, n);
1381 dump_irn_state(F, n);
1385 /** dump the edge to the block this node belongs to */
1387 dump_ir_block_edge(FILE *F, ir_node *n) {
1388 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1389 if (is_no_Block(n)) {
1390 ir_node *block = get_nodes_block(n);
1392 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1393 dump_const_block_local(F, n);
1395 fprintf(F, "edge: { sourcename: \"");
1397 fprintf(F, "\" targetname: ");
1398 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1400 if (dump_edge_vcgattr_hook) {
1402 if (dump_edge_vcgattr_hook(F, n, -1)) {
1406 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1411 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1417 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1419 * do not use get_nodes_block() here, will fail
1420 * if the irg is not pinned.
1422 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1423 fprintf(F, INTRA_DATA_EDGE_ATTR);
1425 fprintf(F, INTER_DATA_EDGE_ATTR);
1429 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1431 * do not use get_nodes_block() here, will fail
1432 * if the irg is not pinned.
1434 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1435 fprintf(F, INTRA_MEM_EDGE_ATTR);
1437 fprintf(F, INTER_MEM_EDGE_ATTR);
1440 /** Print the vcg attributes for the edge from node from to it's to's input */
1441 static void print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1444 if (dump_edge_vcgattr_hook)
1445 if (dump_edge_vcgattr_hook(F, from, to))
1448 if (dump_backedge_information_flag && is_backedge(from, to))
1449 fprintf(F, BACK_EDGE_ATTR);
1451 switch (get_irn_opcode(from)) {
1453 fprintf(F, CF_EDGE_ATTR);
1455 case iro_Start: break;
1458 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1459 fprintf(F, KEEP_ALIVE_CF_EDGE_ATTR);
1461 fprintf(F, KEEP_ALIVE_DF_EDGE_ATTR);
1465 if (is_Proj(from)) {
1466 if (get_irn_mode(from) == mode_M)
1467 print_mem_edge_vcgattr(F, from, to);
1468 else if (get_irn_mode(from) == mode_X)
1469 fprintf(F, CF_EDGE_ATTR);
1471 print_data_edge_vcgattr(F, from, to);
1473 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1474 print_mem_edge_vcgattr(F, from, to);
1475 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1476 fprintf(F, CF_EDGE_ATTR);
1478 print_data_edge_vcgattr(F, from, to);
1482 /** dump edges to our inputs */
1483 static void dump_ir_data_edges(FILE *F, ir_node *n) {
1485 unsigned long visited = get_irn_visited(n);
1487 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1490 /* dump the dependency edges. */
1491 for (i = 0; i < get_irn_deps(n); ++i) {
1492 ir_node *dep = get_irn_dep(n, i);
1495 fprintf(F, "edge: {sourcename: \"");
1497 fprintf(F, "\" targetname: ");
1498 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1499 PRINT_CONSTID(n, dep);
1505 fprintf(F, " label: \"%d\" ", i);
1506 fprintf(F, " color: darkgreen}\n");
1510 for (i = 0; i < get_irn_arity(n); i++) {
1511 ir_node * pred = get_irn_n(n, i);
1514 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1515 continue; /* pred not dumped */
1517 if (dump_backedge_information_flag && is_backedge(n, i))
1518 fprintf(F, "backedge: {sourcename: \"");
1520 fprintf(F, "edge: {sourcename: \"");
1522 fprintf(F, "\" targetname: ");
1523 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1524 PRINT_CONSTID(n, pred);
1526 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1528 fprintf(F, " label: \"%d\" ", i);
1529 print_edge_vcgattr(F, n, i);
1534 /** Dumps a node and its edges but not the block edge
1537 dump_node_wo_blockedge(ir_node *n, void *env) {
1540 dump_ir_data_edges(F, n);
1543 /** Dumps a node and its edges.
1546 dump_whole_node(ir_node *n, void *env) {
1548 dump_node_wo_blockedge(n, env);
1549 if (!node_floats(n)) dump_ir_block_edge(F, n);
1553 dump_const_node(ir_node *n, void *env) {
1554 if (is_Block(n)) return;
1555 dump_node_wo_blockedge(n, env);
1558 /***********************************************************************/
1559 /* the following routines dump the nodes/irgs bracketed to graphs. */
1560 /***********************************************************************/
1562 /** Dumps a constant expression as entity initializer, array bound ...
1564 static void dump_const_expression(FILE *F, ir_node *value) {
1565 ir_graph *rem = current_ir_graph;
1566 int rem_dump_const_local = dump_const_local;
1567 dump_const_local = 0;
1568 current_ir_graph = get_const_code_irg();
1569 irg_walk(value, dump_const_node, NULL, F);
1570 /* Decrease visited flag so that we walk with the same flag for the next
1571 expression. This guarantees that we don't dump the same node twice,
1572 as for const expressions cse is performed to save memory. */
1573 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1574 current_ir_graph = rem;
1575 dump_const_local = rem_dump_const_local;
1578 /** Dump a block as graph containing its nodes.
1580 * Expects to find nodes belonging to the block as list in its
1582 * Dumps the edges of all nodes including itself. */
1584 dump_whole_block(FILE *F, ir_node *block) {
1586 dumper_colors color = ird_color_yellow;
1588 assert(is_Block(block));
1590 fprintf(F, "graph: { title: \"");
1591 PRINT_NODEID(block);
1592 fprintf(F, "\" label: \"");
1593 dump_node_label(F, block);
1595 if (get_opt_dump_abstvals())
1596 fprintf(F, " seqno: %d", (int)get_Block_seqno(block));
1599 /* colorize blocks */
1600 if (! get_Block_matured(block))
1601 color = ird_color_red;
1602 if (is_Block_dead(block))
1603 color = ird_color_orange;
1605 fprintf(F, "\" status:clustered ");
1606 print_vcg_color(F, color);
1609 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1610 dump_node_info(F, block);
1611 print_dbg_info(F, get_irn_dbg_info(block));
1613 /* dump the blocks edges */
1614 dump_ir_data_edges(F, block);
1616 if (dump_block_edge_hook)
1617 dump_block_edge_hook(F, block);
1619 /* dump the nodes that go into the block */
1620 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1622 dump_ir_data_edges(F, node);
1625 /* Close the vcg information for the block */
1627 dump_const_node_local(F, block);
1629 dump_irn_chi_term(F, block);
1634 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1635 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1637 dump_block_graph(FILE *F, ir_graph *irg) {
1639 ir_graph *rem = current_ir_graph;
1640 ir_node **arr = ird_get_irg_link(irg);
1641 current_ir_graph = irg;
1643 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1644 ir_node * node = arr[i];
1645 if (is_Block(node)) {
1646 /* Dumps the block and all the nodes in the block, which are to
1647 be found in Block->link. */
1648 dump_whole_block(F, node);
1650 /* Nodes that are not in a Block. */
1652 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1653 dump_const_block_local(F, node);
1655 dump_ir_data_edges(F, node);
1659 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1660 dump_loop_nodes_into_graph(F, irg);
1662 current_ir_graph = rem;
1666 * Dump the info for an irg.
1667 * Parsed by XVCG but not shown. use yComp.
1669 static void dump_graph_info(FILE *F, ir_graph *irg) {
1670 fprintf(F, "info1: \"");
1671 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1675 /** Dumps an irg as a graph clustered by block nodes.
1676 * If interprocedural view edges can point to nodes out of this graph.
1678 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1679 ir_entity *ent = get_irg_entity(irg);
1681 fprintf(F, "graph: { title: \"");
1683 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1684 get_ent_dump_name(ent));
1686 dump_graph_info(F, irg);
1687 print_dbg_info(F, get_entity_dbg_info(ent));
1689 dump_block_graph(F, irg);
1691 /* Close the vcg information for the irg */
1692 fprintf(F, "}\n\n");
1695 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1696 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1698 dump_extblock_graph(FILE *F, ir_graph *irg) {
1700 ir_graph *rem = current_ir_graph;
1701 ir_extblk **arr = ird_get_irg_link(irg);
1702 current_ir_graph = irg;
1704 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1705 ir_extblk *extbb = arr[i];
1706 ir_node *leader = get_extbb_leader(extbb);
1709 fprintf(F, "graph: { title: \"");
1710 PRINT_EXTBBID(leader);
1711 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1712 get_irn_node_nr(leader));
1714 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1715 ir_node * node = extbb->blks[j];
1716 if (is_Block(node)) {
1717 /* Dumps the block and all the nodes in the block, which are to
1718 be found in Block->link. */
1719 dump_whole_block(F, node);
1721 /* Nodes that are not in a Block. */
1723 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1724 dump_const_block_local(F, node);
1726 dump_ir_data_edges(F, node);
1732 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1733 dump_loop_nodes_into_graph(F, irg);
1735 current_ir_graph = rem;
1740 /*******************************************************************/
1741 /* Basic type and entity nodes and edges. */
1742 /*******************************************************************/
1744 /** dumps the edges between nodes and their type or entity attributes. */
1745 static void dump_node2type_edges(ir_node *n, void *env)
1750 switch (get_irn_opcode(n)) {
1752 /* @@@ some consts have an entity */
1755 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1756 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1759 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1762 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1765 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1768 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1771 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1779 static int print_type_info(FILE *F, ir_type *tp) {
1782 if (get_type_state(tp) == layout_undefined) {
1783 fprintf(F, "state: layout_undefined\n");
1785 fprintf(F, "state: layout_fixed,\n");
1787 if (get_type_mode(tp))
1788 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1789 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1794 static void print_typespecific_info(FILE *F, ir_type *tp) {
1795 switch (get_type_tpop_code(tp)) {
1797 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1802 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1803 fprintf(F, "params: %d\n", get_method_n_params(tp));
1804 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1810 case tpo_enumeration:
1822 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1823 switch (get_type_tpop_code(tp)) {
1825 if (peculiarity_existent == get_class_peculiarity(tp))
1826 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1828 fprintf(F, " " TYPE_DESCRIPTION_NODE_ATTR);
1831 fprintf(F, " " TYPE_METH_NODE_ATTR);
1839 case tpo_enumeration:
1851 int dump_type_node(FILE *F, ir_type *tp)
1855 fprintf(F, "node: {title: ");
1857 fprintf(F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1858 fprintf(F, " info1: \"");
1860 bad |= print_type_info(F, tp);
1861 print_typespecific_info(F, tp);
1863 dump_type_to_file(F, tp, dump_verbosity_max);
1866 print_dbg_info(F, get_type_dbg_info(tp));
1867 print_typespecific_vcgattr(F, tp);
1874 void dump_entity_node(FILE *F, ir_entity *ent, int color)
1876 fprintf(F, "node: {title: \"");
1877 PRINT_ENTID(ent); fprintf(F, "\"");
1878 fprintf(F, DEFAULT_TYPE_ATTRIBUTE);
1879 fprintf(F, "label: ");
1880 fprintf(F, "\"ent %s\" ", get_ent_dump_name(ent));
1882 fprintf(F, "color:%d", color);
1884 fprintf(F, ENTITY_NODE_ATTR);
1885 fprintf(F, "\n info1: \"");
1887 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1890 print_dbg_info(F, get_entity_dbg_info(ent));
1894 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1897 ir_enum_const *ec = get_enumeration_const(tp, pos);
1898 ident *id = get_enumeration_nameid(ec);
1899 tarval *tv = get_enumeration_value(ec);
1902 tarval_snprintf(buf, sizeof(buf), tv);
1904 strncpy(buf, "<not set>", sizeof(buf));
1905 fprintf(F, "node: {title: \"");
1906 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1907 fprintf(F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1908 fprintf(F, "label: ");
1909 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1910 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1913 /* dumps a type or entity and it's edges. */
1915 dump_type_info(type_or_ent *tore, void *env) {
1917 int i = 0; /* to shutup gcc */
1919 /* dump this type or entity */
1921 switch (get_kind(tore)) {
1923 ir_entity *ent = (ir_entity *)tore;
1926 dump_entity_node(F, ent, 0);
1928 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1929 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1930 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1931 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1932 if (is_Class_type(get_entity_owner(ent))) {
1933 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1934 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1936 /* attached subgraphs */
1937 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1938 if (is_atomic_entity(ent)) {
1939 value = get_atomic_ent_value(ent);
1941 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1942 /* DDMN(value); $$$ */
1943 dump_const_expression(F, value);
1946 if (is_compound_entity(ent)) {
1947 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1948 value = get_compound_ent_value(ent, i);
1950 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1951 dump_const_expression(F, value);
1952 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1954 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1955 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1956 get_compound_ent_value_member(ent, i), i);
1965 ir_type *tp = (ir_type *)tore;
1966 dump_type_node(F, tp);
1967 /* and now the edges */
1968 switch (get_type_tpop_code(tp)) {
1970 for (i=0; i < get_class_n_supertypes(tp); i++)
1971 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1972 for (i=0; i < get_class_n_members(tp); i++)
1973 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1976 for (i=0; i < get_struct_n_members(tp); i++)
1977 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1980 for (i = 0; i < get_method_n_params(tp); i++)
1981 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1982 for (i = 0; i < get_method_n_ress(tp); i++)
1983 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1986 for (i = 0; i < get_union_n_members(tp); i++)
1987 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1990 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1991 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1992 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1993 ir_node *upper = get_array_upper_bound(tp, i);
1994 ir_node *lower = get_array_lower_bound(tp, i);
1995 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1996 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1997 dump_const_expression(F, upper);
1998 dump_const_expression(F, lower);
2001 case tpo_enumeration:
2002 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
2003 dump_enum_item(F, tp, i);
2004 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
2008 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
2015 break; /* case k_type */
2018 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
2019 } /* switch kind_or_entity */
2022 typedef struct _h_env {
2027 /** For dumping class hierarchies.
2028 * Dumps a class type node and a superclass edge.
2029 * If env->dump_ent dumps entities of classes and overwrites edges.
2032 dump_class_hierarchy_node(type_or_ent *tore, void *ctx) {
2035 int i = 0; /* to shutup gcc */
2037 /* dump this type or entity */
2038 switch (get_kind(tore)) {
2040 ir_entity *ent = (ir_entity *)tore;
2041 if (get_entity_owner(ent) == get_glob_type()) break;
2042 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
2043 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2045 dump_entity_node(F, ent, 0);
2047 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2048 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2049 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2054 ir_type *tp = (ir_type *)tore;
2055 if (tp == get_glob_type()) break;
2056 switch (get_type_tpop_code(tp)) {
2058 dump_type_node(F, tp);
2059 /* and now the edges */
2060 for (i=0; i < get_class_n_supertypes(tp); i++) {
2061 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2066 break; /* case k_type */
2069 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2070 } /* switch kind_or_entity */
2073 /*******************************************************************/
2074 /* dump analysis information that is expressed in graph terms. */
2075 /*******************************************************************/
2077 /* dump out edges */
2079 dump_out_edge(ir_node *n, void *env) {
2082 for (i = 0; i < get_irn_n_outs(n); i++) {
2083 assert(get_irn_out(n, i));
2084 fprintf(F, "edge: {sourcename: \"");
2086 fprintf(F, "\" targetname: \"");
2087 PRINT_NODEID(get_irn_out(n, i));
2088 fprintf(F, "\" color: red linestyle: dashed");
2094 dump_loop_label(FILE *F, ir_loop *loop) {
2095 fprintf(F, "loop %d, %d sons, %d nodes",
2096 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2099 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2100 fprintf(F, " info1: \"");
2101 fprintf(F, " loop nr: %d", get_loop_loop_nr(loop));
2102 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2103 fprintf(F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2109 dump_loop_node(FILE *F, ir_loop *loop) {
2110 fprintf(F, "node: {title: \"");
2112 fprintf(F, "\" label: \"");
2113 dump_loop_label(F, loop);
2115 dump_loop_info(F, loop);
2120 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2122 fprintf(F, "edge: {sourcename: \"");
2124 fprintf(F, "\" targetname: \"");
2125 PRINT_NODEID(get_loop_node(loop, i));
2126 fprintf(F, "\" color: green");
2131 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2133 fprintf(F, "edge: {sourcename: \"");
2135 fprintf(F, "\" targetname: \"");
2136 PRINT_LOOPID(get_loop_son(loop, i));
2137 fprintf(F, "\" color: darkgreen label: \"%d\"}\n",
2138 get_loop_element_pos(loop, get_loop_son(loop, i)));
2142 void dump_loops(FILE *F, ir_loop *loop) {
2144 /* dump this loop node */
2145 dump_loop_node(F, loop);
2147 /* dump edges to nodes in loop -- only if it is a real loop */
2148 if (get_loop_depth(loop) != 0) {
2149 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2150 dump_loop_node_edge(F, loop, i);
2153 for (i = 0; i < get_loop_n_sons(loop); i++) {
2154 dump_loops(F, get_loop_son(loop, i));
2155 dump_loop_son_edge(F, loop, i);
2160 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2161 ir_graph *rem = current_ir_graph;
2162 current_ir_graph = irg;
2164 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2166 current_ir_graph = rem;
2171 * dumps the VCG header
2173 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2182 if (!orientation) orientation = "bottom_to_top";
2186 "graph: { title: \"ir graph of %s\"\n"
2187 "display_edge_labels: %s\n"
2188 "layoutalgorithm: mindepth\n"
2189 "manhattan_edges: yes\n"
2190 "port_sharing: no\n"
2192 "classname 1: \"intrablock Data\"\n"
2193 "classname 2: \"Block\"\n"
2194 "classname 3: \"Entity type\"\n"
2195 "classname 4: \"Entity owner\"\n"
2196 "classname 5: \"Method Param\"\n"
2197 "classname 6: \"Method Res\"\n"
2198 "classname 7: \"Super\"\n"
2199 "classname 8: \"Union\"\n"
2200 "classname 9: \"Points-to\"\n"
2201 "classname 10: \"Array Element Type\"\n"
2202 "classname 11: \"Overwrites\"\n"
2203 "classname 12: \"Member\"\n"
2204 "classname 13: \"Control Flow\"\n"
2205 "classname 14: \"intrablock Memory\"\n"
2206 "classname 15: \"Dominators\"\n"
2207 "classname 16: \"interblock Data\"\n"
2208 "classname 17: \"interblock Memory\"\n"
2209 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2210 "classname 19: \"Postdominators\"\n"
2211 "classname 20: \"Keep Alive\"\n"
2212 "infoname 1: \"Attribute\"\n"
2213 "infoname 2: \"Verification errors\"\n"
2214 "infoname 3: \"Debug info\"\n",
2215 name, label, orientation);
2217 /* don't use all, the range is too whith/black. */
2221 "colorentry 100: 0 0 0\n"
2222 "colorentry 101: 20 0 0\n"
2223 "colorentry 102: 40 0 0\n"
2224 "colorentry 103: 60 0 0\n"
2225 "colorentry 104: 80 0 0\n"
2226 "colorentry 105: 100 0 0\n"
2227 "colorentry 106: 120 0 0\n"
2228 "colorentry 107: 140 0 0\n"
2229 "colorentry 108: 150 0 0\n"
2230 "colorentry 109: 180 0 0\n"
2231 "colorentry 110: 200 0 0\n"
2232 "colorentry 111: 220 0 0\n"
2233 "colorentry 112: 240 0 0\n"
2234 "colorentry 113: 255 0 0\n"
2235 "colorentry 113: 255 20 20\n"
2236 "colorentry 114: 255 40 40\n"
2237 "colorentry 115: 255 60 60\n"
2238 "colorentry 116: 255 80 80\n"
2239 "colorentry 117: 255 100 100\n"
2240 "colorentry 118: 255 120 120\n"
2241 "colorentry 119: 255 140 140\n"
2242 "colorentry 120: 255 150 150\n"
2243 "colorentry 121: 255 180 180\n"
2244 "colorentry 122: 255 200 200\n"
2245 "colorentry 123: 255 220 220\n"
2246 "colorentry 124: 255 240 240\n"
2247 "colorentry 125: 255 250 250\n"
2250 fprintf(F, "\n"); /* a separator */
2256 * @param irg The graph to be dumped
2257 * @param suffix1 first filename suffix
2258 * @param suffix2 second filename suffix
2260 FILE *vcg_open(ir_graph *irg, const char * suffix1, const char *suffix2) {
2262 const char *nm = get_irg_dump_name(irg);
2263 int len = strlen(nm), i, j;
2264 char *fname; /* filename to put the vcg information in */
2266 if (!suffix1) suffix1 = "";
2267 if (!suffix2) suffix2 = "";
2269 /* open file for vcg graph */
2270 fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2272 /* strncpy (fname, nm, len); */ /* copy the filename */
2274 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2276 fname[j] = '@'; j++; fname[j] = '1'; j++;
2277 } else if (nm[i] == '@') {
2278 fname[j] = '@'; j++; fname[j] = '2'; j++;
2280 fname[j] = nm[i]; j++;
2284 strcat(fname, suffix1); /* append file suffix */
2285 strcat(fname, suffix2); /* append file suffix */
2286 strcat(fname, ".vcg"); /* append the .vcg suffix */
2288 /* vcg really expect only a <CR> at end of line, so
2289 * the "b"inary mode is what you mean (and even needed for Win32)
2291 F = fopen(fname, "wb"); /* open file for writing */
2303 * @param name prefix file name
2304 * @param suffix filename suffix
2306 FILE *vcg_open_name(const char *name, const char *suffix) {
2308 char *fname; /* filename to put the vcg information in */
2309 int i, j, len = strlen(name);
2311 if (!suffix) suffix = "";
2313 /** open file for vcg graph */
2314 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2315 /* strcpy (fname, name);*/ /* copy the filename */
2317 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2318 if (name[i] == '/') {
2319 fname[j] = '@'; j++; fname[j] = '1'; j++;
2320 } else if (name[i] == '@') {
2321 fname[j] = '@'; j++; fname[j] = '2'; j++;
2323 fname[j] = name[i]; j++;
2327 strcat(fname, suffix);
2328 strcat(fname, ".vcg"); /* append the .vcg suffix */
2330 /* vcg really expect only a <CR> at end of line, so
2331 * the "b"inary mode is what you mean (and even needed for Win32)
2333 F = fopen(fname, "wb"); /* open file for writing */
2343 * Dumps the vcg file footer
2345 static void dump_vcg_footer(FILE *F) {
2350 * close the vcg file
2352 void vcg_close(FILE *F) {
2353 dump_vcg_footer(F); /* print footer */
2354 fclose (F); /* close vcg file */
2357 /************************************************************************/
2358 /************************************************************************/
2359 /* Routines that dump all or parts of the firm representation to a file */
2360 /************************************************************************/
2361 /************************************************************************/
2363 /************************************************************************/
2364 /* Dump ir graphs, different formats and additional information. */
2365 /************************************************************************/
2367 /** Routine to dump a graph, blocks as conventional nodes. */
2369 dump_ir_graph(ir_graph *irg, const char *suffix )
2375 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2378 if (dump_backedge_information_flag && get_irg_loopinfo_state(irg) != loopinfo_consistent) {
2379 construct_backedges(irg);
2382 rem = current_ir_graph;
2383 current_ir_graph = irg;
2384 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2385 else suffix1 = "-pure";
2386 f = vcg_open(irg, suffix, suffix1);
2388 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2390 /* call the dump graph hook */
2391 if (dump_ir_graph_hook)
2392 if (dump_ir_graph_hook(f, irg)) {
2393 current_ir_graph = rem;
2397 /* walk over the graph */
2398 /* dump_whole_node must be called in post visiting predecessors */
2399 ird_walk_graph(irg, NULL, dump_whole_node, f);
2401 /* dump the out edges in a separate walk */
2402 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2403 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2408 current_ir_graph = rem;
2411 /* Dump a firm graph without explicit block nodes. */
2412 void dump_ir_block_graph(ir_graph *irg, const char *suffix)
2418 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2421 if (get_interprocedural_view()) suffix1 = "-ip";
2423 f = vcg_open(irg, suffix, suffix1);
2426 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2428 construct_block_lists(irg);
2431 * If we are in the interprocedural view, we dump not
2432 * only the requested irg but also all irgs that can be reached
2435 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2436 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2438 dump_graph_from_list(f, get_irp_irg(i));
2447 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2448 void dump_ir_extblock_graph(ir_graph *irg, const char *suffix)
2455 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2458 if (get_irg_extblk_state(irg) != extblk_valid)
2461 if (get_interprocedural_view()) suffix1 = "-ip";
2464 ent = get_irg_entity(irg);
2466 F = vcg_open(irg, suffix, suffix1);
2468 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2470 construct_extblock_lists(irg);
2472 fprintf(F, "graph: { title: \"");
2474 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2475 get_ent_dump_name(ent));
2477 dump_graph_info(F, irg);
2478 print_dbg_info(F, get_entity_dbg_info(ent));
2480 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2481 ir_graph *irg = get_irp_irg(i);
2482 list_tuple *lists = ird_get_irg_link(irg);
2485 /* dump the extended blocks first */
2486 if (ARR_LEN(lists->extbb_list)) {
2487 ird_set_irg_link(irg, lists->extbb_list);
2488 dump_extblock_graph(F, irg);
2491 /* we may have blocks without extended blocks, bad for instance */
2492 if (ARR_LEN(lists->blk_list)) {
2493 ird_set_irg_link(irg, lists->blk_list);
2494 dump_block_graph(F, irg);
2497 DEL_ARR_F(lists->extbb_list);
2498 DEL_ARR_F(lists->blk_list);
2503 /* Close the vcg information for the irg */
2504 fprintf(F, "}\n\n");
2511 /* dumps a graph with type information */
2513 dump_ir_graph_w_types(ir_graph *irg, const char *suffix)
2518 /* if a filter is set, dump only the irg's that match the filter */
2519 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2522 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2523 else suffix1 = "-pure-wtypes";
2524 f = vcg_open(irg,suffix, suffix1);
2526 ir_graph *rem = current_ir_graph;
2527 int rem_dump_const_local;
2529 current_ir_graph = irg;
2530 rem_dump_const_local = dump_const_local;
2531 /* dumping types does not work with local nodes */
2532 dump_const_local = 0;
2534 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2536 /* dump common ir graph */
2537 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2538 /* dump type info */
2539 type_walk_irg(irg, dump_type_info, NULL, f);
2540 inc_irg_visited(get_const_code_irg());
2541 /* dump edges from graph to type info */
2542 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2545 dump_const_local = rem_dump_const_local;
2546 current_ir_graph = rem;
2551 dump_ir_block_graph_w_types(ir_graph *irg, const char *suffix)
2557 /* if a filter is set, dump only the irg's that match the filter */
2558 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2561 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2562 else suffix1 = "-wtypes";
2563 f = vcg_open(irg, suffix, suffix1);
2565 ir_graph *rem = current_ir_graph;
2566 int rem_dump_const_local;
2568 rem_dump_const_local = dump_const_local;
2569 /* dumping types does not work with local nodes */
2570 dump_const_local = 0;
2572 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2574 /* dump common blocked ir graph */
2575 construct_block_lists(irg);
2577 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2578 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2580 dump_graph_from_list(f, get_irp_irg(i));
2585 /* dump type info */
2586 current_ir_graph = irg;
2587 type_walk_irg(irg, dump_type_info, NULL, f);
2588 inc_irg_visited(get_const_code_irg());
2590 /* dump edges from graph to type info */
2591 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2594 dump_const_local = rem_dump_const_local;
2595 current_ir_graph = rem;
2599 /*---------------------------------------------------------------------*/
2600 /* The following routines dump a control flow graph. */
2601 /*---------------------------------------------------------------------*/
2604 dump_block_to_cfg(ir_node *block, void *env) {
2609 if (is_Block(block)) {
2610 /* This is a block. Dump a node for the block. */
2611 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2612 fprintf(F, "\" label: \"");
2613 if (block == get_irg_start_block(get_irn_irg(block)))
2614 fprintf(F, "Start ");
2615 if (block == get_irg_end_block(get_irn_irg(block)))
2618 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2619 PRINT_NODEID(block);
2621 fprintf(F, "info1:\"");
2623 /* the generic version. */
2624 dump_irnode_to_file(F, block);
2626 /* Check whether we have bad predecessors to color the block. */
2627 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2628 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2631 fprintf(F, "\""); /* closing quote of info */
2633 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2634 (block == get_irg_end_block(get_irn_irg(block))) )
2635 fprintf(F, " color:blue ");
2637 fprintf(F, " color:yellow ");
2640 /* Dump the edges */
2641 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2642 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2643 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2644 fprintf(F, "edge: { sourcename: \"");
2645 PRINT_NODEID(block);
2646 fprintf(F, "\" targetname: \"");
2648 fprintf(F, "\"}\n");
2651 /* Dump dominator/postdominator edge */
2652 if (dump_dominator_information_flag) {
2653 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2654 pred = get_Block_idom(block);
2655 fprintf(F, "edge: { sourcename: \"");
2656 PRINT_NODEID(block);
2657 fprintf(F, "\" targetname: \"");
2659 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2661 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2662 pred = get_Block_ipostdom(block);
2663 fprintf(F, "edge: { sourcename: \"");
2664 PRINT_NODEID(block);
2665 fprintf(F, "\" targetname: \"");
2667 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2674 dump_cfg(ir_graph *irg, const char *suffix)
2677 /* if a filter is set, dump only the irg's that match the filter */
2678 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2681 f = vcg_open(irg, suffix, "-cfg");
2683 ir_graph *rem = current_ir_graph;
2684 int ipv = get_interprocedural_view();
2686 current_ir_graph = irg;
2687 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2690 printf("Warning: dumping cfg not in interprocedural view!\n");
2691 set_interprocedural_view(0);
2694 /* walk over the blocks in the graph */
2695 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2696 dump_node(f, get_irg_bad(irg));
2698 set_interprocedural_view(ipv);
2700 current_ir_graph = rem;
2705 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2706 if (pset_find_ptr(mark_set, n)) return;
2708 pset_insert_ptr(mark_set, n);
2711 int i, start = is_Block(n) ? 0 : -1;
2712 dump_whole_node(n, F);
2713 for (i = start; i < get_irn_arity(n); ++i)
2714 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2717 /* Don't dump edges to nodes further out. These might be edges to
2718 nodes we already dumped, if there is a shorter path to these. */
2722 static int subgraph_counter = 0;
2723 void dump_subgraph(ir_node *root, int depth, const char *suffix) {
2727 sprintf(buf, "-subg_%03d", subgraph_counter++);
2728 F = vcg_open(get_irn_irg(root), suffix, buf);
2730 pset *mark_set = pset_new_ptr(1);
2731 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2732 descend_and_dump(F, root, depth, mark_set);
2739 static int weight_overall(int rec, int loop) {
2740 return 2*rec + loop;
2743 static int compute_color(int my, int max) {
2750 /* if small, scale to the full color range. */
2752 my = my * (n_colors/max);
2754 step = 1 + (max / n_colors);
2758 return base_color + n_colors - color;
2762 * Calculate a entity color depending on it's execution propability.
2764 static int get_entity_color(ir_entity *ent) {
2765 ir_graph *irg = get_entity_irg(ent);
2769 int rec_depth = get_irg_recursion_depth(irg);
2770 int loop_depth = get_irg_loop_depth(irg);
2771 int overall_depth = weight_overall(rec_depth, loop_depth);
2773 int max_rec_depth = irp->max_callgraph_recursion_depth;
2774 int max_loop_depth = irp->max_callgraph_loop_depth;
2775 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2777 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2778 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2779 int my_overall_color = compute_color(overall_depth, max_overall_depth);
2781 return my_overall_color;
2785 void dump_callgraph(const char *suffix) {
2786 FILE *F = vcg_open_name("Callgraph", suffix);
2789 int i, rem = edge_label, colorize;
2791 dump_vcg_header(F, "Callgraph", NULL);
2793 colorize = get_irp_callgraph_state() == irp_callgraph_and_calltree_consistent;
2795 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2796 ir_graph *irg = get_irp_irg(i);
2797 ir_entity *ent = get_irg_entity(irg);
2798 int j, n_callees = get_irg_n_callees(irg);
2801 color = colorize ? get_entity_color(ent) : ird_color_green;
2802 dump_entity_node(F, ent, color);
2803 for (j = 0; j < n_callees; ++j) {
2804 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2805 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2806 int be = is_irg_callee_backedge(irg, j);
2809 "label:\"recursion %d\" color:%d" :
2810 "label:\"calls %d\" color:%d";
2811 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), color);
2820 /* Dump all irgs in interprocedural view to a single file. */
2821 void dump_all_cg_block_graph(const char *suffix) {
2822 FILE *f = vcg_open_name("All_graphs", suffix);
2826 int rem_view = get_interprocedural_view();
2828 set_interprocedural_view(1);
2829 dump_vcg_header(f, "All_graphs", NULL);
2831 /* collect nodes in all irgs reachable in call graph*/
2832 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2833 ird_set_irg_link(get_irp_irg(i), NULL);
2835 cg_walk(clear_link, collect_node, NULL);
2837 /* dump all graphs */
2838 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2839 current_ir_graph = get_irp_irg(i);
2840 assert(ird_get_irg_link(current_ir_graph));
2841 dump_graph_from_list(f, current_ir_graph);
2842 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2846 set_interprocedural_view(rem_view);
2850 /*---------------------------------------------------------------------*/
2851 /* the following routines dumps type information without any ir nodes. */
2852 /*---------------------------------------------------------------------*/
2855 dump_type_graph(ir_graph *irg, const char *suffix)
2859 /* if a filter is set, dump only the irg's that match the filter */
2860 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2862 f = vcg_open(irg, suffix, "-type");
2864 ir_graph *rem = current_ir_graph;
2865 current_ir_graph = irg;
2867 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2869 /* walk over the blocks in the graph */
2870 type_walk_irg(irg, dump_type_info, NULL, f);
2871 /* The walker for the const code can be called several times for the
2872 same (sub) expression. So that no nodes are dumped several times
2873 we decrease the visited flag of the corresponding graph after each
2874 walk. So now increase it finally. */
2875 inc_irg_visited(get_const_code_irg());
2878 current_ir_graph = rem;
2883 dump_all_types(const char *suffix)
2885 FILE *f = vcg_open_name("All_types", suffix);
2887 dump_vcg_header(f, "All_types", NULL);
2888 type_walk(dump_type_info, NULL, f);
2889 inc_irg_visited(get_const_code_irg());
2895 dump_class_hierarchy(int entities, const char *suffix)
2897 FILE *f = vcg_open_name("class_hierarchy", suffix);
2902 env.dump_ent = entities;
2903 dump_vcg_header(f, "class_hierarchy", NULL);
2904 type_walk(dump_class_hierarchy_node, NULL, &env);
2909 /*---------------------------------------------------------------------*/
2910 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2912 /* dump_ir_block_graph */
2914 /* dump_type_graph */
2915 /* dump_ir_graph_w_types */
2916 /*---------------------------------------------------------------------*/
2918 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2920 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2921 dmp_grph(get_irp_irg(i), suffix);
2925 /*--------------------------------------------------------------------------------*
2926 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2927 * packed together in one subgraph/box *
2928 *--------------------------------------------------------------------------------*/
2930 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2931 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2933 ir_loop *son = NULL;
2935 /* Dump a new loop node. */
2936 dump_loop_node(F, loop);
2938 /* Dump the loop elements. */
2940 for(i = 0; i < get_loop_n_elements(loop); i++) {
2941 le = get_loop_element(loop, i);
2943 if (get_kind(son) == k_ir_loop) {
2945 /* We are a loop son -> Recurse */
2947 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2948 fprintf(F, "\" }\n");
2949 fprintf(F, "edge: {sourcename: \"");
2951 fprintf(F, "\" targetname: \"");
2953 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2954 loop_node_started = 0;
2956 dump_loop_son_edge(F, loop, son_number++);
2957 dump_loops_standalone(F, son);
2958 } else if (get_kind(son) == k_ir_node) {
2959 /* We are a loop node -> Collect firm nodes */
2961 ir_node *n = le.node;
2964 if (!loop_node_started) {
2965 /* Start a new node which contains all firm nodes of the current loop */
2966 fprintf(F, "node: { title: \"");
2968 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
2969 loop_node_started = 1;
2974 bad |= dump_node_label(F, n);
2975 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2976 if (has_backedges(n)) fprintf(F, "\t loop head!");
2977 } else { /* for callgraph loop tree */
2979 assert(get_kind(son) == k_ir_graph);
2981 /* We are a loop node -> Collect firm graphs */
2982 n = (ir_graph *)le.node;
2983 if (!loop_node_started) {
2984 /* Start a new node which contains all firm nodes of the current loop */
2985 fprintf(F, "node: { title: \"");
2987 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
2988 loop_node_started = 1;
2992 fprintf(F, " %s", get_irg_dump_name(n));
2993 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2997 if (loop_node_started) {
2998 fprintf(F, "\" }\n");
2999 fprintf(F, "edge: {sourcename: \"");
3001 fprintf(F, "\" targetname: \"");
3003 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
3004 loop_node_started = 0;
3008 void dump_loop_tree(ir_graph *irg, const char *suffix)
3012 /* if a filter is set, dump only the irg's that match the filter */
3013 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
3015 f = vcg_open(irg, suffix, "-looptree");
3017 ir_graph *rem = current_ir_graph;
3018 int el_rem = edge_label;
3020 current_ir_graph = irg;
3023 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
3025 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
3029 edge_label = el_rem;
3030 current_ir_graph = rem;
3034 void dump_callgraph_loop_tree(const char *suffix) {
3036 F = vcg_open_name("Callgraph_looptree", suffix);
3037 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
3038 dump_loops_standalone(F, irp->outermost_cg_loop);
3043 /*----------------------------------------------------------------------------*/
3044 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes.*/
3045 /*----------------------------------------------------------------------------*/
3047 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
3048 int i, son_number = 0, node_number = 0;
3050 if (dump_loop_information_flag) dump_loop_node(F, loop);
3052 for (i = 0; i < get_loop_n_elements(loop); i++) {
3053 loop_element le = get_loop_element(loop, i);
3054 if (*(le.kind) == k_ir_loop) {
3055 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
3057 collect_nodeloop(F, le.son, loopnodes);
3059 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
3060 eset_insert(loopnodes, le.node);
3065 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
3068 for(i = 0; i < get_loop_n_elements(loop); i++) {
3069 loop_element le = get_loop_element(loop, i);
3070 if (*(le.kind) == k_ir_loop) {
3072 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3074 if (is_Block(le.node)) start = 0; else start = -1;
3075 for (j = start; j < get_irn_arity(le.node); j++) {
3076 ir_node *pred = get_irn_n(le.node, j);
3077 if (!eset_contains(loopnodes, pred)) {
3078 eset_insert(extnodes, pred);
3079 if (!is_Block(pred)) {
3080 pred = get_nodes_block(pred);
3081 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3089 void dump_loop(ir_loop *l, const char *suffix) {
3093 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3094 F = vcg_open_name(name, suffix);
3096 eset *loopnodes = eset_create();
3097 eset *extnodes = eset_create();
3100 dump_vcg_header(F, name, NULL);
3102 /* collect all nodes to dump */
3103 collect_nodeloop(F, l, loopnodes);
3104 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3106 /* build block lists */
3107 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3108 set_irn_link(n, NULL);
3109 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3110 set_irn_link(n, NULL);
3111 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) {
3113 b = get_nodes_block(n);
3114 set_irn_link(n, get_irn_link(b));
3118 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) {
3120 b = get_nodes_block(n);
3121 set_irn_link(n, get_irn_link(b));
3126 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) {
3128 fprintf(F, "graph: { title: \"");
3130 fprintf(F, "\" label: \"");
3131 dump_node_opcode(F, b);
3132 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3133 fprintf(F, "\" status:clustered color:yellow\n");
3135 /* dump the blocks edges */
3136 dump_ir_data_edges(F, b);
3138 /* dump the nodes that go into the block */
3139 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3140 if (eset_contains(extnodes, n))
3141 overrule_nodecolor = ird_color_lightblue;
3143 overrule_nodecolor = ird_color_default;
3144 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3147 /* Close the vcg information for the block */
3149 dump_const_node_local(F, b);
3153 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) {
3155 fprintf(F, "graph: { title: \"");
3157 fprintf(F, "\" label: \"");
3158 dump_node_opcode(F, b);
3159 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3160 fprintf(F, "\" status:clustered color:lightblue\n");
3162 /* dump the nodes that go into the block */
3163 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3164 if (!eset_contains(loopnodes, n))
3165 overrule_nodecolor = ird_color_lightblue;
3167 overrule_nodecolor = ird_color_default;
3168 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3171 /* Close the vcg information for the block */
3173 dump_const_node_local(F, b);
3177 eset_destroy(loopnodes);
3178 eset_destroy(extnodes);