3 * File name: ir/ir/irdump.c
4 * Purpose: Write vcg representation of firm to file.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier, Hubert Schmidt
9 * Copyright: (c) 1998-2006 Universit�t Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
24 #include "firm_common_t.h"
39 #include "type_or_entity.h"
43 #include "callgraph.h"
44 #include "irextbb_t.h"
46 #include "dbginfo_t.h"
58 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
59 extern void dump_irn_state(FILE *FL, ir_node *n);
60 extern int get_opt_dump_abstvals(void);
61 typedef unsigned long SeqNo;
62 extern SeqNo get_Block_seqno(ir_node *n);
65 /* basis for a color range for vcg */
66 static int n_colors = 0;
67 static int base_color = 0;
69 /** Dump only irgs with names that start with this string */
70 static ident *dump_file_filter_id = NULL;
72 #define ERROR_TXT "<ERROR>"
74 /*******************************************************************/
75 /* flags to steer output */
76 /*******************************************************************/
78 /** An option to turn off edge labels */
79 static int edge_label = 1;
80 /** An option to turn off dumping values of constant entities */
81 static int const_entities = 1;
82 /** An option to dump the keep alive edges */
83 static int dump_keepalive = 0;
84 /** An option to dump ld_names instead of names. */
85 static int dump_ld_name = 1;
86 /** Compiler options to dump analysis information in dump_ir_graph */
87 static int dump_out_edge_flag = 0;
88 static int dump_loop_information_flag = 0;
89 static int dump_backedge_information_flag = 1;
90 static int dump_const_local = 0;
91 /** An option to dump all graph anchors */
92 static int dump_anchors = 0;
94 int dump_dominator_information_flag = 0;
95 int opt_dump_analysed_type_info = 1;
96 int opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */
98 static dumper_colors overrule_nodecolor = ird_color_default;
100 /** The vcg node attribute hook. */
101 static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
102 /** The vcg node attribute hook. */
103 static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
104 /** The vcg edge attribute hook. */
105 static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
106 /** The vcg dump block edge hook */
107 static DUMP_NODE_EDGE_FUNC dump_block_edge_hook = NULL;
108 /** The vcg dump node edge hook. */
109 static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
111 /* Set the hook to be called to dump additional edges to a node. */
112 void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func) {
113 dump_node_edge_hook = func;
116 /* Get the additional edge dump hook. */
117 DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void) {
118 return dump_node_edge_hook;
121 /* Set the hook to be called to dump additional edges to a block. */
122 void set_dump_block_edge_hook(DUMP_NODE_EDGE_FUNC func) {
123 dump_block_edge_hook = func;
126 /* Get the additional block edge dump hook. */
127 DUMP_NODE_EDGE_FUNC get_dump_block_edge_hook(void) {
128 return dump_node_edge_hook;
131 /* set the ir graph hook */
132 void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
133 dump_ir_graph_hook = hook;
136 /* set the node attribute hook */
137 void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
138 dump_node_vcgattr_hook = hook;
141 /* set the edge attribute hook */
142 void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
143 dump_edge_vcgattr_hook = hook;
146 /* Returns 0 if dump_out_edge_flag or dump_loop_information_flag
147 * are set, else returns dump_const_local_flag.
149 int get_opt_dump_const_local(void) {
150 if (!dump_out_edge_flag && !dump_loop_information_flag)
151 return dump_const_local;
156 /* Set a prefix filter for output functions. */
157 void only_dump_method_with_name(ident *name) {
158 dump_file_filter_id = name;
161 /* Returns the prefix filter set with only_dump_method_with_name(). */
162 ident *get_dump_file_filter_ident(void) {
163 return dump_file_filter_id;
166 /* Returns non-zero if dump file filter is not set, or if it is a prefix of name. */
167 int is_filtered_dump_name(ident *name) {
168 if (!dump_file_filter_id) return 1;
169 return id_is_prefix(dump_file_filter_id, name);
172 /* To turn off display of edge labels. Edge labels often cause xvcg to
173 abort with a segmentation fault. */
174 void turn_off_edge_labels(void) {
178 void dump_consts_local(int flag) {
179 dump_const_local = flag;
182 void dump_constant_entity_values(int flag) {
183 const_entities = flag;
186 void dump_keepalive_edges(int flag) {
187 dump_keepalive = flag;
190 int get_opt_dump_keepalive_edges(void) {
191 return dump_keepalive;
194 void dump_out_edges(int flag) {
195 dump_out_edge_flag = flag;
198 void dump_dominator_information(int flag) {
199 dump_dominator_information_flag = flag;
202 void dump_loop_information(int flag) {
203 dump_loop_information_flag = flag;
206 void dump_backedge_information(int flag) {
207 dump_backedge_information_flag = flag;
210 /* Dump the information of type field specified in ana/irtypeinfo.h.
211 * If the flag is set, the type name is output in [] in the node label,
212 * else it is output as info.
214 void set_opt_dump_analysed_type_info(int flag) {
215 opt_dump_analysed_type_info = flag;
218 void dump_pointer_values_to_info(int flag) {
219 opt_dump_pointer_values_to_info = flag;
222 void dump_ld_names(int flag) {
226 void dump_all_anchors(int flag) {
230 /* -------------- some extended helper functions ----------------- */
233 * returns the name of a mode or <ERROR> if mode is NOT a mode object.
234 * in the later case, sets bad
236 const char *get_mode_name_ex(ir_mode *mode, int *bad) {
238 return get_mode_name(mode);
244 * returns the name of a type or <ERROR> if mode is NOT a mode object.
245 * in the later case, sets bad
247 const char *get_type_name_ex(ir_type *tp, int *bad) {
249 return get_type_name(tp);
255 * printf the VCG color to a file
257 static void print_vcg_color(FILE *F, dumper_colors color) {
258 static const char *color_names[32] = {
259 "white", "blue", "red", "green",
260 "yellow", "magenta", "cyan", "darkgray",
261 "darkblue", "darkred", "darkgreen", "darkyellow",
262 "darkmagenta", "darkcyan", "gold", "lightgray",
263 "lightblue", "lightred", "lightgreen", "lightyellow",
264 "lightmagenta", "lightcyan", "lilac", "turquoise",
265 "aquamarine", "khaki", "purple", "yellowgreen",
266 "pink", "orange", "orchid", "black"
269 if (color != ird_color_default)
270 fprintf(F, "color:%s", color_names[color]);
274 * prints the edge from a type S to a type T with additional info fmt, ...
277 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
282 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
283 fprintf(F, " targetname: "); PRINT_TYPEID(T);
284 vfprintf(F, fmt, ap);
290 * prints the edge from a type T to an entity E with additional info fmt, ...
293 static void print_type_ent_edge(FILE *F, ir_type *T, ir_entity *E, const char *fmt, ...)
298 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
299 fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
300 vfprintf(F, fmt, ap);
306 * prints the edge from an entity E to an entity T with additional info fmt, ...
309 static void print_ent_ent_edge(FILE *F, ir_entity *E, ir_entity *T, int backedge, const char *fmt, ...)
315 fprintf(F, "backedge: { sourcename: \"");
317 fprintf(F, "edge: { sourcename: \"");
319 fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\"");
320 vfprintf(F, fmt, ap);
326 * prints the edge from an entity E to a type T with additional info fmt, ...
329 static void print_ent_type_edge(FILE *F, ir_entity *E, ir_type *T, const char *fmt, ...)
334 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
335 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
336 vfprintf(F, fmt, ap);
342 * prints the edge from a node N to a type T with additional info fmt, ...
345 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
350 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
351 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
352 vfprintf(F, fmt, ap);
358 * prints the edge from a node N to an entity E with additional info fmt, ...
361 static void print_node_ent_edge(FILE *F, const ir_node *N, ir_entity *E, const char *fmt, ...)
366 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
367 fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
369 vfprintf(F, fmt, ap);
375 * prints the edge from an entity E to a node N with additional info fmt, ...
378 static void print_ent_node_edge(FILE *F, ir_entity *E, const ir_node *N, const char *fmt, ...)
383 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
384 fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
385 vfprintf(F, fmt, ap);
391 * prints the edge from a type E to an enumeration item item with additional info fmt, ...
394 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
399 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
400 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
401 vfprintf(F, fmt, ap);
406 /*-----------------------------------------------------------------*/
407 /* global and ahead declarations */
408 /*-----------------------------------------------------------------*/
410 static void dump_whole_node(ir_node *n, void *env);
411 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
413 /*-----------------------------------------------------------------*/
414 /* Helper functions. */
415 /*-----------------------------------------------------------------*/
418 * This map is used as a private link attr to be able to call dumper
419 * anywhere without destroying link fields.
421 static pmap *irdump_link_map = NULL;
423 /** NOT A STANDARD LIBFIRM INIT METHOD
425 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
426 * are off, we want to have as few interferences as possible. Therefore the
427 * initialization is performed lazily and not called from within init_firm.
429 * Creates the link attribute map. */
430 static void init_irdump(void) {
431 /* We need a new, empty map. */
432 if (irdump_link_map) pmap_destroy(irdump_link_map);
433 irdump_link_map = pmap_create();
434 if (!dump_file_filter_id)
435 dump_file_filter_id = new_id_from_str("");
439 * Returns the private link field.
441 static void *ird_get_irn_link(ir_node *n) {
443 if (!irdump_link_map) return NULL;
445 if (pmap_contains(irdump_link_map, (void *)n))
446 res = pmap_get(irdump_link_map, (void *)n);
451 * Sets the private link field.
453 static void ird_set_irn_link(ir_node *n, void *x) {
454 if (!irdump_link_map)
456 pmap_insert(irdump_link_map, (void *)n, x);
460 * Gets the private link field of an irg.
462 static void *ird_get_irg_link(ir_graph *irg) {
464 if (!irdump_link_map) return NULL;
466 if (pmap_contains(irdump_link_map, (void *)irg))
467 res = pmap_get(irdump_link_map, (void *)irg);
472 * Sets the private link field of an irg.
474 static void ird_set_irg_link(ir_graph *irg, void *x) {
475 if (!irdump_link_map) init_irdump();
476 pmap_insert(irdump_link_map, (void *)irg, x);
480 * Walker, clears the private link field.
482 static void clear_link(ir_node * node, void * env) {
483 ird_set_irn_link(node, NULL);
487 * If the entity has a ld_name, returns it if the dump_ld_name is set,
488 * else returns the name of the entity.
490 static const char *_get_ent_dump_name(ir_entity *ent, int dump_ld_name) {
492 return "<NULL entity>";
494 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
495 if (ent->ld_name) return get_id_str(ent->ld_name);
497 return get_id_str(ent->name);
501 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
502 * else returns the name of the entity.
504 const char *get_ent_dump_name(ir_entity *ent) {
505 return _get_ent_dump_name(ent, dump_ld_name);
508 /* Returns the name of an IRG. */
509 const char *get_irg_dump_name(ir_graph *irg) {
510 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
511 return _get_ent_dump_name(get_irg_entity(irg), 1);
515 * Returns non-zero if a node is in floating state.
517 static int node_floats(ir_node *n) {
518 return ((get_irn_pinned(n) == op_pin_state_floats) &&
519 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
523 * Walker that visits the anchors
525 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
526 irg_walk_graph(irg, pre, post, env);
531 for (i = anchor_max - 1; i >= 0; --i) {
532 ir_node *n = irg->anchors[i];
535 /* reset the visit flag: will be increase in the walker */
536 set_irg_visited(irg, get_irg_visited(irg) - 1);
537 irg_walk(n, pre, post, env);
544 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
546 static void collect_node(ir_node * node, void *env) {
549 || get_irn_op(node) == op_Bad
550 || get_irn_op(node) == op_Unknown
551 || get_irn_op(node) == op_NoMem) {
552 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
553 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
554 ARR_APP1(ir_node *, arr, node);
555 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
557 ir_node * block = get_nodes_block(node);
560 /* this node is in a Bad block, so we must place it into the graph's list */
561 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
562 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
563 ARR_APP1(ir_node *, arr, node);
564 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
566 ird_set_irn_link(node, ird_get_irn_link(block));
567 ird_set_irn_link(block, node);
572 /** Construct lists to walk ir block-wise.
574 * Collects all blocks, nodes not op_pin_state_pinned,
575 * Bad, NoMem and Unknown into a flexible array in link field of
576 * irg they belong to. Sets the irg link field to NULL in all
577 * graphs not visited.
578 * Free the list with DEL_ARR_F().
580 static ir_node **construct_block_lists(ir_graph *irg) {
581 int i, rem_view = get_interprocedural_view();
582 ir_graph *rem = current_ir_graph;
583 current_ir_graph = irg;
585 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
586 ird_set_irg_link(get_irp_irg(i), NULL);
588 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
590 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
591 set_interprocedural_view(0);
593 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
594 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
595 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
596 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
598 set_interprocedural_view(rem_view);
600 current_ir_graph = rem;
601 return ird_get_irg_link(irg);
604 typedef struct _list_tuple {
606 ir_extblk **extbb_list;
609 /** Construct lists to walk IR extended block-wise.
610 * Free the lists in the tuple with DEL_ARR_F().
611 * Sets the irg link field to NULL in all
612 * graphs not visited.
614 static list_tuple *construct_extblock_lists(ir_graph *irg) {
615 ir_node **blk_list = construct_block_lists(irg);
617 ir_graph *rem = current_ir_graph;
618 list_tuple *lists = xmalloc(sizeof(*lists));
620 current_ir_graph = irg;
622 lists->blk_list = NEW_ARR_F(ir_node *, 0);
623 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
625 inc_irg_block_visited(irg);
626 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
629 if (is_Block(blk_list[i])) {
630 ext = get_Block_extbb(blk_list[i]);
632 if (extbb_not_visited(ext)) {
633 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
634 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 /*-----------------------------------------------------------------*/
647 /* Routines to dump information about a single ir node. */
648 /*-----------------------------------------------------------------*/
651 * dump the name of a node n to the File F.
653 int dump_node_opcode(FILE *F, ir_node *n)
656 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
658 /* call the dump_node operation if available */
660 return ops->dump_node(n, F, dump_node_opcode_txt);
662 /* implementation for default nodes */
663 switch (get_irn_opcode(n)) {
668 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
669 assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
674 switch (get_SymConst_kind(n)) {
675 case symconst_addr_name:
676 /* don't use get_SymConst_ptr_info as it mangles the name. */
677 fprintf(F, "SymC %s", get_id_str(get_SymConst_name(n)));
679 case symconst_addr_ent:
680 fprintf(F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
682 case symconst_ofs_ent:
683 fprintf(F, "SymC %s offset", get_entity_name(get_SymConst_entity(n)));
685 case symconst_type_tag:
686 fprintf(F, "SymC %s tag", get_type_name_ex(get_SymConst_type(n), &bad));
688 case symconst_type_size:
689 fprintf(F, "SymC %s size", get_type_name_ex(get_SymConst_type(n), &bad));
691 case symconst_type_align:
692 fprintf(F, "SymC %s align", get_type_name_ex(get_SymConst_type(n), &bad));
694 case symconst_enum_const:
695 fprintf(F, "SymC %s enum", get_enumeration_name(get_SymConst_enum(n)));
701 if (!get_interprocedural_view())
708 ir_node *pred = get_Proj_pred(n);
710 if (get_irn_opcode(pred) == iro_Cond
711 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
712 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
713 fprintf(F, "defProj");
721 if (get_interprocedural_view()) {
722 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
727 case iro_CallBegin: {
728 ir_node *addr = get_CallBegin_ptr(n);
729 ir_entity *ent = NULL;
730 if (get_irn_op(addr) == op_Sel)
731 ent = get_Sel_entity(addr);
732 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
733 ent = get_SymConst_entity(addr);
734 fprintf(F, "%s", get_irn_opname(n));
735 if (ent) fprintf(F, " %s", get_entity_name(ent));
739 fprintf(F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
742 fprintf(F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
745 if (get_Conv_strict(n))
746 fprintf(F, "strict");
747 fprintf(F, "%s", get_irn_opname(n));
752 fprintf(F, "%s", get_irn_opname(n));
759 * Dump the mode of a node n to a file F.
760 * Ignore modes that are "always known".
762 static int dump_node_mode(FILE *F, ir_node *n)
765 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
768 /* call the dump_node operation if available */
770 return ops->dump_node(n, F, dump_node_mode_txt);
772 /* default implementation */
773 iro = get_irn_opcode(n);
785 ir_mode *mode = get_irn_mode(n);
787 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
788 (mode != mode_T || iro == iro_Proj))
789 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
797 * Dump the type of a node n to a file F if it's known.
799 static int dump_node_typeinfo(FILE *F, ir_node *n) {
802 if (opt_dump_analysed_type_info) {
803 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
804 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
805 ir_type *tp = get_irn_typeinfo_type(n);
806 if (tp != firm_none_type)
807 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
815 typedef struct _pns_lookup {
816 long nr; /**< the proj number */
817 const char *name; /**< the name of the Proj */
820 typedef struct _proj_lookup {
821 ir_opcode code; /**< the opcode of the Proj predecessor */
822 unsigned num_data; /**< number of data entries */
823 const pns_lookup_t *data; /**< the data */
826 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
828 /** the lookup table for Proj(Start) names */
829 static const pns_lookup_t start_lut[] = {
830 #define X(a) { pn_Start_##a, #a }
840 /** the lookup table for Proj(Cond) names */
841 static const pns_lookup_t cond_lut[] = {
842 #define X(a) { pn_Cond_##a, #a }
848 /** the lookup table for Proj(Call) names */
849 static const pns_lookup_t call_lut[] = {
850 #define X(a) { pn_Call_##a, #a }
859 /** the lookup table for Proj(Quot) names */
860 static const pns_lookup_t quot_lut[] = {
861 #define X(a) { pn_Quot_##a, #a }
868 /** the lookup table for Proj(DivMod) names */
869 static const pns_lookup_t divmod_lut[] = {
870 #define X(a) { pn_DivMod_##a, #a }
878 /** the lookup table for Proj(Div) names */
879 static const pns_lookup_t div_lut[] = {
880 #define X(a) { pn_Div_##a, #a }
887 /** the lookup table for Proj(Mod) names */
888 static const pns_lookup_t mod_lut[] = {
889 #define X(a) { pn_Mod_##a, #a }
896 /** the lookup table for Proj(Load) names */
897 static const pns_lookup_t load_lut[] = {
898 #define X(a) { pn_Load_##a, #a }
905 /** the lookup table for Proj(Store) names */
906 static const pns_lookup_t store_lut[] = {
907 #define X(a) { pn_Store_##a, #a }
913 /** the lookup table for Proj(Alloc) names */
914 static const pns_lookup_t alloc_lut[] = {
915 #define X(a) { pn_Alloc_##a, #a }
922 /** the lookup table for Proj(CopyB) names */
923 static const pns_lookup_t copyb_lut[] = {
924 #define X(a) { pn_CopyB_##a, #a }
931 /** the lookup table for Proj(InstOf) names */
932 static const pns_lookup_t instof_lut[] = {
933 #define X(a) { pn_InstOf_##a, #a }
941 /** the lookup table for Proj(Raise) names */
942 static const pns_lookup_t raise_lut[] = {
943 #define X(a) { pn_Raise_##a, #a }
949 /** the lookup table for Proj(Bound) names */
950 static const pns_lookup_t bound_lut[] = {
951 #define X(a) { pn_Bound_##a, #a }
958 /** the Proj lookup table */
959 static const proj_lookup_t proj_lut[] = {
960 #define E(a) ARR_SIZE(a), a
961 { iro_Start, E(start_lut) },
962 { iro_Cond, E(cond_lut) },
963 { iro_Call, E(call_lut) },
964 { iro_Quot, E(quot_lut) },
965 { iro_DivMod, E(divmod_lut) },
966 { iro_Div, E(div_lut) },
967 { iro_Mod, E(mod_lut) },
968 { iro_Load, E(load_lut) },
969 { iro_Store, E(store_lut) },
970 { iro_Alloc, E(alloc_lut) },
971 { iro_CopyB, E(copyb_lut) },
972 { iro_InstOf, E(instof_lut) },
973 { iro_Raise, E(raise_lut) },
974 { iro_Bound, E(bound_lut) }
979 * Dump additional node attributes of some nodes to a file F.
982 dump_node_nodeattr(FILE *F, ir_node *n)
988 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
990 /* call the dump_node operation if available */
992 return ops->dump_node(n, F, dump_node_nodeattr_txt);
994 switch (get_irn_opcode(n)) {
996 if (0 && get_interprocedural_view()) {
997 fprintf(F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
1002 pred = get_Proj_pred(n);
1003 proj_nr = get_Proj_proj(n);
1005 code = get_irn_opcode(pred);
1007 if (code == iro_Cmp)
1008 fprintf(F, "%s ", get_pnc_string(get_Proj_proj(n)));
1009 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1010 fprintf(F, "Arg %ld ", proj_nr);
1011 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1012 fprintf(F, "%ld ", proj_nr);
1014 unsigned i, j, f = 0;
1016 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1017 if (code == proj_lut[i].code) {
1018 for (j = 0; j < proj_lut[i].num_data; ++j) {
1019 if (proj_nr == proj_lut[i].data[j].nr) {
1020 fprintf(F, "%s ", proj_lut[i].data[j].name);
1029 fprintf(F, "%ld ", proj_nr);
1030 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1031 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1032 fprintf(F, "PRED ");
1033 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1034 fprintf(F, "PRED ");
1039 proj_nr = get_Filter_proj(n);
1040 if (! get_interprocedural_view()) {
1042 pred = get_Filter_pred(n);
1045 fprintf(F, "%ld ", proj_nr);
1048 fprintf(F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1051 fprintf(F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1054 fprintf(F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1057 fprintf(F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1068 #include "execution_frequency.h"
1069 #include "callgraph.h"
1071 static void dump_node_ana_vals(FILE *F, ir_node *n) {
1073 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1074 get_irn_exec_freq(n),
1075 get_irg_method_execution_frequency(get_irn_irg(n)),
1076 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1077 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1082 /* Dumps a node label without the enclosing ". */
1083 int dump_node_label(FILE *F, ir_node *n) {
1086 bad |= dump_node_opcode(F, n);
1087 bad |= dump_node_mode(F, n);
1089 bad |= dump_node_typeinfo(F, n);
1090 bad |= dump_node_nodeattr(F, n);
1091 fprintf(F, "%ld:%d", get_irn_node_nr(n), get_irn_idx(n));
1098 * Dumps the attributes of a node n into the file F.
1099 * Currently this is only the color of a node.
1101 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1106 print_vcg_color(F, ird_color_red);
1110 if (dump_node_vcgattr_hook)
1111 if (dump_node_vcgattr_hook(F, node, local))
1114 n = local ? local : node;
1116 if (overrule_nodecolor != ird_color_default) {
1117 print_vcg_color(F, overrule_nodecolor);
1121 switch (get_irn_opcode(n)) {
1128 print_vcg_color(F, ird_color_blue);
1131 if (is_Block_dead(n))
1132 print_vcg_color(F, ird_color_lightred);
1134 print_vcg_color(F, ird_color_lightyellow);
1137 print_vcg_color(F, ird_color_green);
1141 print_vcg_color(F, ird_color_gold);
1144 print_vcg_color(F, ird_color_orchid);
1150 print_vcg_color(F, ird_color_yellow);
1153 PRINT_DEFAULT_NODE_ATTR;
1157 /* Adds a new node info dumper callback. */
1158 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1160 hook_entry_t *info = xmalloc(sizeof(*info));
1162 info->hook._hook_node_info = cb;
1163 info->context = data;
1164 register_hook(hook_node_info, info);
1169 /* Remove a previously added info dumper callback. */
1170 void dump_remv_node_info_callback(void *handle)
1172 hook_entry_t *info = handle;
1173 unregister_hook(hook_node_info, info);
1178 * Dump the node information of a node n to a file F.
1180 static INLINE int dump_node_info(FILE *F, ir_node *n)
1183 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1185 fprintf(F, " info1: \"");
1186 bad = dump_irnode_to_file(F, n);
1187 /* call the dump_node operation if available */
1189 bad = ops->dump_node(n, F, dump_node_info_txt);
1191 /* allow additional info to be added */
1192 hook_node_info(F, n);
1199 * checks whether a node is "constant-like" ie can be treated "block-less"
1202 int is_constlike_node(ir_node *n) {
1203 ir_opcode code = get_irn_opcode(n);
1204 return (code == iro_Const || code == iro_Bad || code == iro_NoMem || code == iro_SymConst || code == iro_Unknown);
1208 /** outputs the predecessors of n, that are constants, local. I.e.,
1209 generates a copy of the constant predecessors for each node called with. */
1210 static void dump_const_node_local(FILE *F, ir_node *n) {
1212 if (!get_opt_dump_const_local()) return;
1214 /* Use visited flag to avoid outputting nodes twice.
1215 initialize it first. */
1216 for (i = 0; i < get_irn_arity(n); i++) {
1217 ir_node *con = get_irn_n(n, i);
1218 if (is_constlike_node(con)) {
1219 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1223 for (i = 0; i < get_irn_arity(n); i++) {
1224 ir_node *con = get_irn_n(n, i);
1225 if (is_constlike_node(con) && irn_not_visited(con)) {
1228 mark_irn_visited(con);
1229 /* Generate a new name for the node by appending the names of
1231 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1232 fprintf(F, " label: \"");
1233 bad |= dump_node_label(F, con);
1235 bad |= dump_node_info(F, con);
1236 dump_node_vcgattr(F, n, con, bad);
1242 /** If the block of an edge is a const_like node, dump it local with an edge */
1243 static void dump_const_block_local(FILE *F, ir_node *n) {
1246 if (!get_opt_dump_const_local()) return;
1248 blk = get_nodes_block(n);
1249 if (is_constlike_node(blk)) {
1252 /* Generate a new name for the node by appending the names of
1254 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1255 fprintf(F, "\" label: \"");
1256 bad |= dump_node_label(F, blk);
1258 bad |= dump_node_info(F, blk);
1259 dump_node_vcgattr(F, n, blk, bad);
1262 fprintf(F, "edge: { sourcename: \"");
1264 fprintf(F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1266 if (dump_edge_vcgattr_hook) {
1268 if (dump_edge_vcgattr_hook(F, n, -1)) {
1272 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1277 fprintf(F, "\" " BLOCK_EDGE_ATTR "}\n");
1282 * prints the error message of a node to a file F as info2.
1284 static void print_node_error(FILE *F, const char *err_msg)
1289 fprintf(F, " info2: \"%s\"", err_msg);
1293 * prints debug messages of a node to file F as info3.
1295 static void print_dbg_info(FILE *F, dbg_info *dbg)
1299 if (__dbg_info_snprint) {
1301 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1302 fprintf(F, " info3: \"%s\"\n", buf);
1309 static void dump_node(FILE *F, ir_node *n)
1314 if (get_opt_dump_const_local() && is_constlike_node(n))
1317 /* dump this node */
1318 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1320 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1321 bad |= dump_node_label(F, n);
1322 dump_node_ana_vals(F, n);
1323 //dump_node_ana_info(F, n);
1325 bad |= dump_node_info(F, n);
1326 print_node_error(F, p);
1327 print_dbg_info(F, get_irn_dbg_info(n));
1328 dump_node_vcgattr(F, n, NULL, bad);
1330 dump_const_node_local(F, n);
1332 if(dump_node_edge_hook)
1333 dump_node_edge_hook(F, n);
1335 dump_irn_chi_term(F, n);
1336 dump_irn_state(F, n);
1340 /** dump the edge to the block this node belongs to */
1342 dump_ir_block_edge(FILE *F, ir_node *n) {
1343 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1344 if (is_no_Block(n)) {
1345 ir_node *block = get_nodes_block(n);
1347 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1348 dump_const_block_local(F, n);
1350 fprintf(F, "edge: { sourcename: \"");
1352 fprintf(F, "\" targetname: ");
1353 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1355 if (dump_edge_vcgattr_hook) {
1357 if (dump_edge_vcgattr_hook(F, n, -1)) {
1361 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1366 fprintf(F, " " BLOCK_EDGE_ATTR "}\n");
1372 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1374 * do not use get_nodes_block() here, will fail
1375 * if the irg is not pinned.
1377 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1378 fprintf(F, INTRA_DATA_EDGE_ATTR);
1380 fprintf(F, INTER_DATA_EDGE_ATTR);
1384 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1386 * do not use get_nodes_block() here, will fail
1387 * if the irg is not pinned.
1389 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1390 fprintf(F, INTRA_MEM_EDGE_ATTR);
1392 fprintf(F, INTER_MEM_EDGE_ATTR);
1396 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1399 if (dump_edge_vcgattr_hook)
1400 if (dump_edge_vcgattr_hook(F, from, to))
1403 if (dump_backedge_information_flag && is_backedge(from, to))
1404 fprintf(F, BACK_EDGE_ATTR);
1406 switch (get_irn_opcode(from)) {
1408 fprintf(F, CF_EDGE_ATTR);
1410 case iro_Start: break;
1413 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1414 fprintf(F, CF_EDGE_ATTR);
1415 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1416 fprintf(F, INTER_MEM_EDGE_ATTR);
1420 if (is_Proj(from)) {
1421 if (get_irn_mode(from) == mode_M)
1422 print_mem_edge_vcgattr(F, from, to);
1423 else if (get_irn_mode(from) == mode_X)
1424 fprintf(F, CF_EDGE_ATTR);
1426 print_data_edge_vcgattr(F, from, to);
1428 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1429 print_mem_edge_vcgattr(F, from, to);
1430 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1431 fprintf(F, CF_EDGE_ATTR);
1433 print_data_edge_vcgattr(F, from, to);
1437 /* dump edges to our inputs */
1439 dump_ir_data_edges(FILE *F, ir_node *n) {
1441 unsigned long visited = get_irn_visited(n);
1443 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1446 /* dump the dependency edges. */
1447 for (i = 0; i < get_irn_deps(n); ++i) {
1448 ir_node *dep = get_irn_dep(n, i);
1451 fprintf(F, "edge: {sourcename: \"");
1453 fprintf(F, "\" targetname: ");
1454 if ((get_opt_dump_const_local()) && is_constlike_node(dep)) {
1455 PRINT_CONSTID(n, dep);
1461 fprintf(F, " label: \"%d\" ", i);
1462 fprintf(F, " color: darkgreen}\n");
1466 for (i = 0; i < get_irn_arity(n); i++) {
1467 ir_node * pred = get_irn_n(n, i);
1470 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1471 continue; /* pred not dumped */
1473 if (dump_backedge_information_flag && is_backedge(n, i))
1474 fprintf(F, "backedge: {sourcename: \"");
1476 fprintf(F, "edge: {sourcename: \"");
1478 fprintf(F, "\" targetname: ");
1479 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1480 PRINT_CONSTID(n, pred);
1482 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1484 fprintf(F, " label: \"%d\" ", i);
1485 print_edge_vcgattr(F, n, i);
1490 /** Dumps a node and its edges but not the block edge
1493 dump_node_wo_blockedge(ir_node *n, void *env) {
1496 dump_ir_data_edges(F, n);
1499 /** Dumps a node and its edges.
1502 dump_whole_node(ir_node *n, void *env) {
1504 dump_node_wo_blockedge(n, env);
1505 if (!node_floats(n)) dump_ir_block_edge(F, n);
1509 dump_const_node(ir_node *n, void *env) {
1510 if (is_Block(n)) return;
1511 dump_node_wo_blockedge(n, env);
1514 /***********************************************************************/
1515 /* the following routines dump the nodes/irgs bracketed to graphs. */
1516 /***********************************************************************/
1518 /** Dumps a constant expression as entity initializer, array bound ...
1520 static void dump_const_expression(FILE *F, ir_node *value) {
1521 ir_graph *rem = current_ir_graph;
1522 int rem_dump_const_local = dump_const_local;
1523 dump_const_local = 0;
1524 current_ir_graph = get_const_code_irg();
1525 irg_walk(value, dump_const_node, NULL, F);
1526 /* Decrease visited flag so that we walk with the same flag for the next
1527 expression. This guarantees that we don't dump the same node twice,
1528 as for const expressions cse is performed to save memory. */
1529 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1530 current_ir_graph = rem;
1531 dump_const_local = rem_dump_const_local;
1534 /** Dump a block as graph containing its nodes.
1536 * Expects to find nodes belonging to the block as list in its
1538 * Dumps the edges of all nodes including itself. */
1540 dump_whole_block(FILE *F, ir_node *block) {
1542 dumper_colors color = ird_color_yellow;
1544 assert(is_Block(block));
1546 fprintf(F, "graph: { title: \"");
1547 PRINT_NODEID(block);
1548 fprintf(F, "\" label: \"");
1549 dump_node_label(F, block);
1551 if (get_opt_dump_abstvals())
1552 fprintf(F, " seqno: %d", (int)get_Block_seqno(block));
1555 /* colorize blocks */
1556 if (! get_Block_matured(block))
1557 color = ird_color_red;
1558 if (is_Block_dead(block))
1559 color = ird_color_orange;
1561 fprintf(F, "\" status:clustered ");
1562 print_vcg_color(F, color);
1565 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1566 dump_node_info(F, block);
1567 print_dbg_info(F, get_irn_dbg_info(block));
1569 /* dump the blocks edges */
1570 dump_ir_data_edges(F, block);
1572 if (dump_block_edge_hook)
1573 dump_block_edge_hook(F, block);
1575 /* dump the nodes that go into the block */
1576 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1578 dump_ir_data_edges(F, node);
1581 /* Close the vcg information for the block */
1583 dump_const_node_local(F, block);
1585 dump_irn_chi_term(F, block);
1590 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1591 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1593 dump_block_graph(FILE *F, ir_graph *irg) {
1595 ir_graph *rem = current_ir_graph;
1596 ir_node **arr = ird_get_irg_link(irg);
1597 current_ir_graph = irg;
1599 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1600 ir_node * node = arr[i];
1601 if (is_Block(node)) {
1602 /* Dumps the block and all the nodes in the block, which are to
1603 be found in Block->link. */
1604 dump_whole_block(F, node);
1606 /* Nodes that are not in a Block. */
1608 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1609 dump_const_block_local(F, node);
1611 dump_ir_data_edges(F, node);
1615 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1616 dump_loop_nodes_into_graph(F, irg);
1618 current_ir_graph = rem;
1622 * Dump the info for an irg.
1623 * Parsed by XVCG but not shown. use yComp.
1625 static void dump_graph_info(FILE *F, ir_graph *irg) {
1626 fprintf(F, "info1: \"");
1627 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1631 /** Dumps an irg as a graph clustered by block nodes.
1632 * If interprocedural view edges can point to nodes out of this graph.
1634 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1635 ir_entity *ent = get_irg_entity(irg);
1637 fprintf(F, "graph: { title: \"");
1639 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1640 get_ent_dump_name(ent));
1642 dump_graph_info(F, irg);
1643 print_dbg_info(F, get_entity_dbg_info(ent));
1645 dump_block_graph(F, irg);
1647 /* Close the vcg information for the irg */
1648 fprintf(F, "}\n\n");
1651 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1652 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1654 dump_extblock_graph(FILE *F, ir_graph *irg) {
1656 ir_graph *rem = current_ir_graph;
1657 ir_extblk **arr = ird_get_irg_link(irg);
1658 current_ir_graph = irg;
1660 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1661 ir_extblk *extbb = arr[i];
1662 ir_node *leader = get_extbb_leader(extbb);
1665 fprintf(F, "graph: { title: \"");
1666 PRINT_EXTBBID(leader);
1667 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1668 get_irn_node_nr(leader));
1670 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1671 ir_node * node = extbb->blks[j];
1672 if (is_Block(node)) {
1673 /* Dumps the block and all the nodes in the block, which are to
1674 be found in Block->link. */
1675 dump_whole_block(F, node);
1677 /* Nodes that are not in a Block. */
1679 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1680 dump_const_block_local(F, node);
1682 dump_ir_data_edges(F, node);
1688 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1689 dump_loop_nodes_into_graph(F, irg);
1691 current_ir_graph = rem;
1696 /*******************************************************************/
1697 /* Basic type and entity nodes and edges. */
1698 /*******************************************************************/
1700 /** dumps the edges between nodes and their type or entity attributes. */
1701 static void dump_node2type_edges(ir_node *n, void *env)
1706 switch (get_irn_opcode(n)) {
1708 /* @@@ some consts have an entity */
1711 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1712 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1715 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1718 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1721 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1724 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1727 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1735 static int print_type_info(FILE *F, ir_type *tp) {
1738 if (get_type_state(tp) == layout_undefined) {
1739 fprintf(F, "state: layout_undefined\n");
1741 fprintf(F, "state: layout_fixed,\n");
1743 if (get_type_mode(tp))
1744 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1745 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1750 static void print_typespecific_info(FILE *F, ir_type *tp) {
1751 switch (get_type_tpop_code(tp)) {
1753 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1758 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1759 fprintf(F, "params: %d\n", get_method_n_params(tp));
1760 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1766 case tpo_enumeration:
1778 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1779 switch (get_type_tpop_code(tp)) {
1781 if (peculiarity_existent == get_class_peculiarity(tp))
1782 fprintf(F, " " TYPE_CLASS_NODE_ATTR);
1784 fprintf(F, " " TYPE_DESCRIPTION_NODE_ATTR);
1787 fprintf(F, " " TYPE_METH_NODE_ATTR);
1795 case tpo_enumeration:
1807 int dump_type_node(FILE *F, ir_type *tp)
1811 fprintf(F, "node: {title: ");
1813 fprintf(F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1814 fprintf(F, " info1: \"");
1816 bad |= print_type_info(F, tp);
1817 print_typespecific_info(F, tp);
1819 dump_type_to_file(F, tp, dump_verbosity_max);
1822 print_dbg_info(F, get_type_dbg_info(tp));
1823 print_typespecific_vcgattr(F, tp);
1830 void dump_entity_node(FILE *F, ir_entity *ent, int color)
1832 fprintf(F, "node: {title: \"");
1833 PRINT_ENTID(ent); fprintf(F, "\"");
1834 fprintf(F, DEFAULT_TYPE_ATTRIBUTE);
1835 fprintf(F, "label: ");
1836 fprintf(F, "\"ent %s\" ", get_ent_dump_name(ent));
1838 fprintf(F, "color:%d", color);
1840 fprintf(F, ENTITY_NODE_ATTR);
1841 fprintf(F, "\n info1: \"");
1843 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1846 print_dbg_info(F, get_entity_dbg_info(ent));
1850 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1853 ir_enum_const *ec = get_enumeration_const(tp, pos);
1854 ident *id = get_enumeration_nameid(ec);
1855 tarval *tv = get_enumeration_value(ec);
1858 tarval_snprintf(buf, sizeof(buf), tv);
1860 strncpy(buf, "<not set>", sizeof(buf));
1861 fprintf(F, "node: {title: \"");
1862 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1863 fprintf(F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1864 fprintf(F, "label: ");
1865 fprintf(F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1866 fprintf(F, "\n info1: \"value: %s\"}\n", buf);
1869 /* dumps a type or entity and it's edges. */
1871 dump_type_info(type_or_ent *tore, void *env) {
1873 int i = 0; /* to shutup gcc */
1875 /* dump this type or entity */
1877 switch (get_kind(tore)) {
1879 ir_entity *ent = (ir_entity *)tore;
1882 dump_entity_node(F, ent, 0);
1884 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1885 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1886 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1887 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1888 if (is_Class_type(get_entity_owner(ent))) {
1889 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1890 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1892 /* attached subgraphs */
1893 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1894 if (is_atomic_entity(ent)) {
1895 value = get_atomic_ent_value(ent);
1897 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1898 /* DDMN(value); $$$ */
1899 dump_const_expression(F, value);
1902 if (is_compound_entity(ent)) {
1903 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1904 value = get_compound_ent_value(ent, i);
1906 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1907 dump_const_expression(F, value);
1908 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1910 fprintf(F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1911 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1912 get_compound_ent_value_member(ent, i), i);
1921 ir_type *tp = (ir_type *)tore;
1922 dump_type_node(F, tp);
1923 /* and now the edges */
1924 switch (get_type_tpop_code(tp)) {
1926 for (i=0; i < get_class_n_supertypes(tp); i++)
1927 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1928 for (i=0; i < get_class_n_members(tp); i++)
1929 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1932 for (i=0; i < get_struct_n_members(tp); i++)
1933 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1936 for (i = 0; i < get_method_n_params(tp); i++)
1937 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1938 for (i = 0; i < get_method_n_ress(tp); i++)
1939 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1942 for (i = 0; i < get_union_n_members(tp); i++)
1943 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1946 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1947 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1948 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1949 ir_node *upper = get_array_upper_bound(tp, i);
1950 ir_node *lower = get_array_lower_bound(tp, i);
1951 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1952 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1953 dump_const_expression(F, upper);
1954 dump_const_expression(F, lower);
1957 case tpo_enumeration:
1958 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1959 dump_enum_item(F, tp, i);
1960 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1964 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1971 break; /* case k_type */
1974 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1975 } /* switch kind_or_entity */
1978 typedef struct _h_env {
1983 /** For dumping class hierarchies.
1984 * Dumps a class type node and a superclass edge.
1985 * If env->dump_ent dumps entities of classes and overwrites edges.
1988 dump_class_hierarchy_node(type_or_ent *tore, void *ctx) {
1991 int i = 0; /* to shutup gcc */
1993 /* dump this type or entity */
1994 switch (get_kind(tore)) {
1996 ir_entity *ent = (ir_entity *)tore;
1997 if (get_entity_owner(ent) == get_glob_type()) break;
1998 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1999 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2001 dump_entity_node(F, ent, 0);
2003 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2004 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2005 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2010 ir_type *tp = (ir_type *)tore;
2011 if (tp == get_glob_type()) break;
2012 switch (get_type_tpop_code(tp)) {
2014 dump_type_node(F, tp);
2015 /* and now the edges */
2016 for (i=0; i < get_class_n_supertypes(tp); i++) {
2017 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2022 break; /* case k_type */
2025 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2026 } /* switch kind_or_entity */
2029 /*******************************************************************/
2030 /* dump analysis information that is expressed in graph terms. */
2031 /*******************************************************************/
2033 /* dump out edges */
2035 dump_out_edge(ir_node *n, void *env) {
2038 for (i = 0; i < get_irn_n_outs(n); i++) {
2039 assert(get_irn_out(n, i));
2040 fprintf(F, "edge: {sourcename: \"");
2042 fprintf(F, "\" targetname: \"");
2043 PRINT_NODEID(get_irn_out(n, i));
2044 fprintf(F, "\" color: red linestyle: dashed");
2050 dump_loop_label(FILE *F, ir_loop *loop) {
2051 fprintf(F, "loop %d, %d sons, %d nodes",
2052 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2055 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2056 fprintf(F, " info1: \"");
2057 fprintf(F, " loop nr: %d", get_loop_loop_nr(loop));
2058 #ifdef DEBUG_libfirm /* GL @@@ debug analyses */
2059 fprintf(F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2065 dump_loop_node(FILE *F, ir_loop *loop) {
2066 fprintf(F, "node: {title: \"");
2068 fprintf(F, "\" label: \"");
2069 dump_loop_label(F, loop);
2071 dump_loop_info(F, loop);
2076 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2078 fprintf(F, "edge: {sourcename: \"");
2080 fprintf(F, "\" targetname: \"");
2081 PRINT_NODEID(get_loop_node(loop, i));
2082 fprintf(F, "\" color: green");
2087 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2089 fprintf(F, "edge: {sourcename: \"");
2091 fprintf(F, "\" targetname: \"");
2092 PRINT_LOOPID(get_loop_son(loop, i));
2093 fprintf(F, "\" color: darkgreen label: \"%d\"}\n",
2094 get_loop_element_pos(loop, get_loop_son(loop, i)));
2098 void dump_loops(FILE *F, ir_loop *loop) {
2100 /* dump this loop node */
2101 dump_loop_node(F, loop);
2103 /* dump edges to nodes in loop -- only if it is a real loop */
2104 if (get_loop_depth(loop) != 0) {
2105 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2106 dump_loop_node_edge(F, loop, i);
2109 for (i = 0; i < get_loop_n_sons(loop); i++) {
2110 dump_loops(F, get_loop_son(loop, i));
2111 dump_loop_son_edge(F, loop, i);
2116 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2117 ir_graph *rem = current_ir_graph;
2118 current_ir_graph = irg;
2120 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2122 current_ir_graph = rem;
2127 * dumps the VCG header
2129 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2138 if (!orientation) orientation = "bottom_to_top";
2142 "graph: { title: \"ir graph of %s\"\n"
2143 "display_edge_labels: %s\n"
2144 "layoutalgorithm: mindepth\n"
2145 "manhattan_edges: yes\n"
2146 "port_sharing: no\n"
2148 "classname 1: \"intrablock Data\"\n"
2149 "classname 2: \"Block\"\n"
2150 "classname 3: \"Entity type\"\n"
2151 "classname 4: \"Entity owner\"\n"
2152 "classname 5: \"Method Param\"\n"
2153 "classname 6: \"Method Res\"\n"
2154 "classname 7: \"Super\"\n"
2155 "classname 8: \"Union\"\n"
2156 "classname 9: \"Points-to\"\n"
2157 "classname 10: \"Array Element Type\"\n"
2158 "classname 11: \"Overwrites\"\n"
2159 "classname 12: \"Member\"\n"
2160 "classname 13: \"Control Flow\"\n"
2161 "classname 14: \"intrablock Memory\"\n"
2162 "classname 15: \"Dominators\"\n"
2163 "classname 16: \"interblock Data\"\n"
2164 "classname 17: \"interblock Memory\"\n"
2165 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2166 "classname 19: \"Postdominators\"\n"
2167 "infoname 1: \"Attribute\"\n"
2168 "infoname 2: \"Verification errors\"\n"
2169 "infoname 3: \"Debug info\"\n",
2170 name, label, orientation);
2172 /* don't use all, the range is too whith/black. */
2176 "colorentry 100: 0 0 0\n"
2177 "colorentry 101: 20 0 0\n"
2178 "colorentry 102: 40 0 0\n"
2179 "colorentry 103: 60 0 0\n"
2180 "colorentry 104: 80 0 0\n"
2181 "colorentry 105: 100 0 0\n"
2182 "colorentry 106: 120 0 0\n"
2183 "colorentry 107: 140 0 0\n"
2184 "colorentry 108: 150 0 0\n"
2185 "colorentry 109: 180 0 0\n"
2186 "colorentry 110: 200 0 0\n"
2187 "colorentry 111: 220 0 0\n"
2188 "colorentry 112: 240 0 0\n"
2189 "colorentry 113: 255 0 0\n"
2190 "colorentry 113: 255 20 20\n"
2191 "colorentry 114: 255 40 40\n"
2192 "colorentry 115: 255 60 60\n"
2193 "colorentry 116: 255 80 80\n"
2194 "colorentry 117: 255 100 100\n"
2195 "colorentry 118: 255 120 120\n"
2196 "colorentry 119: 255 140 140\n"
2197 "colorentry 120: 255 150 150\n"
2198 "colorentry 121: 255 180 180\n"
2199 "colorentry 122: 255 200 200\n"
2200 "colorentry 123: 255 220 220\n"
2201 "colorentry 124: 255 240 240\n"
2202 "colorentry 125: 255 250 250\n"
2205 fprintf(F, "\n"); /* a separator */
2211 * @param irg The graph to be dumped
2212 * @param suffix1 first filename suffix
2213 * @param suffix2 second filename suffix
2215 FILE *vcg_open(ir_graph *irg, const char * suffix1, const char *suffix2) {
2217 const char *nm = get_irg_dump_name(irg);
2218 int len = strlen(nm), i, j;
2219 char *fname; /* filename to put the vcg information in */
2221 if (!suffix1) suffix1 = "";
2222 if (!suffix2) suffix2 = "";
2224 /* open file for vcg graph */
2225 fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2227 /* strncpy (fname, nm, len); */ /* copy the filename */
2229 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2231 fname[j] = '@'; j++; fname[j] = '1'; j++;
2232 } else if (nm[i] == '@') {
2233 fname[j] = '@'; j++; fname[j] = '2'; j++;
2235 fname[j] = nm[i]; j++;
2239 strcat(fname, suffix1); /* append file suffix */
2240 strcat(fname, suffix2); /* append file suffix */
2241 strcat(fname, ".vcg"); /* append the .vcg suffix */
2243 /* vcg really expect only a <CR> at end of line, so
2244 * the "b"inary mode is what you mean (and even needed for Win32)
2246 F = fopen(fname, "wb"); /* open file for writing */
2258 * @param name prefix file name
2259 * @param suffix filename suffix
2261 FILE *vcg_open_name(const char *name, const char *suffix) {
2263 char *fname; /* filename to put the vcg information in */
2264 int i, j, len = strlen(name);
2266 if (!suffix) suffix = "";
2268 /** open file for vcg graph */
2269 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2270 /* strcpy (fname, name);*/ /* copy the filename */
2272 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2273 if (name[i] == '/') {
2274 fname[j] = '@'; j++; fname[j] = '1'; j++;
2275 } else if (name[i] == '@') {
2276 fname[j] = '@'; j++; fname[j] = '2'; j++;
2278 fname[j] = name[i]; j++;
2282 strcat(fname, suffix);
2283 strcat(fname, ".vcg"); /* append the .vcg suffix */
2285 /* vcg really expect only a <CR> at end of line, so
2286 * the "b"inary mode is what you mean (and even needed for Win32)
2288 F = fopen(fname, "wb"); /* open file for writing */
2298 * Dumps the vcg file footer
2300 static void dump_vcg_footer(FILE *F) {
2305 * close the vcg file
2307 void vcg_close(FILE *F) {
2308 dump_vcg_footer(F); /* print footer */
2309 fclose (F); /* close vcg file */
2312 /************************************************************************/
2313 /************************************************************************/
2314 /* Routines that dump all or parts of the firm representation to a file */
2315 /************************************************************************/
2316 /************************************************************************/
2318 /************************************************************************/
2319 /* Dump ir graphs, different formats and additional information. */
2320 /************************************************************************/
2322 /** Routine to dump a graph, blocks as conventional nodes. */
2324 dump_ir_graph(ir_graph *irg, const char *suffix )
2330 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2333 if (dump_backedge_information_flag && get_irg_loopinfo_state(irg) != loopinfo_consistent) {
2334 construct_backedges(irg);
2337 rem = current_ir_graph;
2338 current_ir_graph = irg;
2339 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2340 else suffix1 = "-pure";
2341 f = vcg_open(irg, suffix, suffix1);
2343 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2345 /* call the dump graph hook */
2346 if (dump_ir_graph_hook)
2347 if (dump_ir_graph_hook(f, irg)) {
2348 current_ir_graph = rem;
2352 /* walk over the graph */
2353 /* dump_whole_node must be called in post visiting predecessors */
2354 ird_walk_graph(irg, NULL, dump_whole_node, f);
2356 /* dump the out edges in a separate walk */
2357 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2358 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2363 current_ir_graph = rem;
2366 /* Dump a firm graph without explicit block nodes. */
2367 void dump_ir_block_graph(ir_graph *irg, const char *suffix)
2373 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2376 if (get_interprocedural_view()) suffix1 = "-ip";
2378 f = vcg_open(irg, suffix, suffix1);
2381 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2383 construct_block_lists(irg);
2386 * If we are in the interprocedural view, we dump not
2387 * only the requested irg but also all irgs that can be reached
2390 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2391 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2393 dump_graph_from_list(f, get_irp_irg(i));
2402 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2403 void dump_ir_extblock_graph(ir_graph *irg, const char *suffix)
2410 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2413 if (get_irg_extblk_state(irg) != extblk_valid)
2416 if (get_interprocedural_view()) suffix1 = "-ip";
2419 ent = get_irg_entity(irg);
2421 F = vcg_open(irg, suffix, suffix1);
2423 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2425 construct_extblock_lists(irg);
2427 fprintf(F, "graph: { title: \"");
2429 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2430 get_ent_dump_name(ent));
2432 dump_graph_info(F, irg);
2433 print_dbg_info(F, get_entity_dbg_info(ent));
2435 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2436 ir_graph *irg = get_irp_irg(i);
2437 list_tuple *lists = ird_get_irg_link(irg);
2440 /* dump the extended blocks first */
2441 if (ARR_LEN(lists->extbb_list)) {
2442 ird_set_irg_link(irg, lists->extbb_list);
2443 dump_extblock_graph(F, irg);
2446 /* we may have blocks without extended blocks, bad for instance */
2447 if (ARR_LEN(lists->blk_list)) {
2448 ird_set_irg_link(irg, lists->blk_list);
2449 dump_block_graph(F, irg);
2452 DEL_ARR_F(lists->extbb_list);
2453 DEL_ARR_F(lists->blk_list);
2458 /* Close the vcg information for the irg */
2459 fprintf(F, "}\n\n");
2466 /* dumps a graph with type information */
2468 dump_ir_graph_w_types(ir_graph *irg, const char *suffix)
2473 /* if a filter is set, dump only the irg's that match the filter */
2474 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2477 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2478 else suffix1 = "-pure-wtypes";
2479 f = vcg_open(irg,suffix, suffix1);
2481 ir_graph *rem = current_ir_graph;
2482 int rem_dump_const_local;
2484 current_ir_graph = irg;
2485 rem_dump_const_local = dump_const_local;
2486 /* dumping types does not work with local nodes */
2487 dump_const_local = 0;
2489 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2491 /* dump common ir graph */
2492 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2493 /* dump type info */
2494 type_walk_irg(irg, dump_type_info, NULL, f);
2495 inc_irg_visited(get_const_code_irg());
2496 /* dump edges from graph to type info */
2497 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2500 dump_const_local = rem_dump_const_local;
2501 current_ir_graph = rem;
2506 dump_ir_block_graph_w_types(ir_graph *irg, const char *suffix)
2512 /* if a filter is set, dump only the irg's that match the filter */
2513 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2516 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2517 else suffix1 = "-wtypes";
2518 f = vcg_open(irg, suffix, suffix1);
2520 ir_graph *rem = current_ir_graph;
2521 int rem_dump_const_local;
2523 rem_dump_const_local = dump_const_local;
2524 /* dumping types does not work with local nodes */
2525 dump_const_local = 0;
2527 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2529 /* dump common blocked ir graph */
2530 construct_block_lists(irg);
2532 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2533 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2535 dump_graph_from_list(f, get_irp_irg(i));
2540 /* dump type info */
2541 current_ir_graph = irg;
2542 type_walk_irg(irg, dump_type_info, NULL, f);
2543 inc_irg_visited(get_const_code_irg());
2545 /* dump edges from graph to type info */
2546 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2549 dump_const_local = rem_dump_const_local;
2550 current_ir_graph = rem;
2554 /*---------------------------------------------------------------------*/
2555 /* The following routines dump a control flow graph. */
2556 /*---------------------------------------------------------------------*/
2559 dump_block_to_cfg(ir_node *block, void *env) {
2564 if (is_Block(block)) {
2565 /* This is a block. Dump a node for the block. */
2566 fprintf(F, "node: {title: \""); PRINT_NODEID(block);
2567 fprintf(F, "\" label: \"");
2568 if (block == get_irg_start_block(get_irn_irg(block)))
2569 fprintf(F, "Start ");
2570 if (block == get_irg_end_block(get_irn_irg(block)))
2573 fprintf(F, "%s ", get_op_name(get_irn_op(block)));
2574 PRINT_NODEID(block);
2576 fprintf(F, "info1:\"");
2578 /* the generic version. */
2579 dump_irnode_to_file(F, block);
2581 /* Check whether we have bad predecessors to color the block. */
2582 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2583 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2586 fprintf(F, "\""); /* closing quote of info */
2588 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2589 (block == get_irg_end_block(get_irn_irg(block))) )
2590 fprintf(F, " color:blue ");
2592 fprintf(F, " color:yellow ");
2595 /* Dump the edges */
2596 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2597 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2598 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2599 fprintf(F, "edge: { sourcename: \"");
2600 PRINT_NODEID(block);
2601 fprintf(F, "\" targetname: \"");
2603 fprintf(F, "\"}\n");
2606 /* Dump dominator/postdominator edge */
2607 if (dump_dominator_information_flag) {
2608 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2609 pred = get_Block_idom(block);
2610 fprintf(F, "edge: { sourcename: \"");
2611 PRINT_NODEID(block);
2612 fprintf(F, "\" targetname: \"");
2614 fprintf(F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2616 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2617 pred = get_Block_ipostdom(block);
2618 fprintf(F, "edge: { sourcename: \"");
2619 PRINT_NODEID(block);
2620 fprintf(F, "\" targetname: \"");
2622 fprintf(F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2629 dump_cfg(ir_graph *irg, const char *suffix)
2632 /* if a filter is set, dump only the irg's that match the filter */
2633 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2636 f = vcg_open(irg, suffix, "-cfg");
2638 ir_graph *rem = current_ir_graph;
2639 int ipv = get_interprocedural_view();
2641 current_ir_graph = irg;
2642 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2645 printf("Warning: dumping cfg not in interprocedural view!\n");
2646 set_interprocedural_view(0);
2649 /* walk over the blocks in the graph */
2650 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2651 dump_node(f, get_irg_bad(irg));
2653 set_interprocedural_view(ipv);
2655 current_ir_graph = rem;
2660 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2661 if (pset_find_ptr(mark_set, n)) return;
2663 pset_insert_ptr(mark_set, n);
2666 int i, start = is_Block(n) ? 0 : -1;
2667 dump_whole_node(n, F);
2668 for (i = start; i < get_irn_arity(n); ++i)
2669 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2672 /* Don't dump edges to nodes further out. These might be edges to
2673 nodes we already dumped, if there is a shorter path to these. */
2677 static int subgraph_counter = 0;
2678 void dump_subgraph(ir_node *root, int depth, const char *suffix) {
2682 sprintf(buf, "-subg_%03d", subgraph_counter++);
2683 F = vcg_open(get_irn_irg(root), suffix, buf);
2685 pset *mark_set = pset_new_ptr(1);
2686 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2687 descend_and_dump(F, root, depth, mark_set);
2694 static int weight_overall(int rec, int loop) {
2695 return 2*rec + loop;
2698 static int compute_color(int my, int max) {
2705 /* if small, scale to the full color range. */
2707 my = my * (n_colors/max);
2709 step = 1 + (max / n_colors);
2713 return base_color + n_colors - color;
2716 static int get_entity_color(ir_entity *ent) {
2717 ir_graph *irg = get_entity_irg(ent);
2721 int rec_depth = get_irg_recursion_depth(irg);
2722 int loop_depth = get_irg_loop_depth(irg);
2723 int overall_depth = weight_overall(rec_depth, loop_depth);
2725 int max_rec_depth = irp->max_callgraph_recursion_depth;
2726 int max_loop_depth = irp->max_callgraph_loop_depth;
2727 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2729 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2730 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2731 int my_overall_color = compute_color(overall_depth, max_overall_depth);
2733 return my_overall_color;
2737 void dump_callgraph(const char *suffix) {
2738 FILE *F = vcg_open_name("Callgraph", suffix);
2741 int i, rem = edge_label;
2743 dump_vcg_header(F, "Callgraph", NULL);
2745 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2746 ir_graph *irg = get_irp_irg(i);
2747 ir_entity *ent = get_irg_entity(irg);
2748 int j, n_callees = get_irg_n_callees(irg);
2750 /* Do not dump runtime system. */
2751 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2753 dump_entity_node(F, ent, get_entity_color(ent));
2754 for (j = 0; j < n_callees; ++j) {
2755 ir_entity *c = get_irg_entity(get_irg_callee(irg, j));
2756 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2757 int be = is_irg_callee_backedge(irg, j);
2760 "label:\"recursion %d\" color:%d" :
2761 "label:\"calls %d\" color:%d";
2762 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2771 /* Dump all irgs in interprocedural view to a single file. */
2772 void dump_all_cg_block_graph(const char *suffix) {
2773 FILE *f = vcg_open_name("All_graphs", suffix);
2777 int rem_view = get_interprocedural_view();
2779 set_interprocedural_view(1);
2780 dump_vcg_header(f, "All_graphs", NULL);
2782 /* collect nodes in all irgs reachable in call graph*/
2783 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2784 ird_set_irg_link(get_irp_irg(i), NULL);
2786 cg_walk(clear_link, collect_node, NULL);
2788 /* dump all graphs */
2789 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2790 current_ir_graph = get_irp_irg(i);
2791 assert(ird_get_irg_link(current_ir_graph));
2792 dump_graph_from_list(f, current_ir_graph);
2793 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2797 set_interprocedural_view(rem_view);
2801 /*---------------------------------------------------------------------*/
2802 /* the following routines dumps type information without any ir nodes. */
2803 /*---------------------------------------------------------------------*/
2806 dump_type_graph(ir_graph *irg, const char *suffix)
2810 /* if a filter is set, dump only the irg's that match the filter */
2811 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2813 f = vcg_open(irg, suffix, "-type");
2815 ir_graph *rem = current_ir_graph;
2816 current_ir_graph = irg;
2818 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2820 /* walk over the blocks in the graph */
2821 type_walk_irg(irg, dump_type_info, NULL, f);
2822 /* The walker for the const code can be called several times for the
2823 same (sub) expression. So that no nodes are dumped several times
2824 we decrease the visited flag of the corresponding graph after each
2825 walk. So now increase it finally. */
2826 inc_irg_visited(get_const_code_irg());
2829 current_ir_graph = rem;
2834 dump_all_types(const char *suffix)
2836 FILE *f = vcg_open_name("All_types", suffix);
2838 dump_vcg_header(f, "All_types", NULL);
2839 type_walk(dump_type_info, NULL, f);
2840 inc_irg_visited(get_const_code_irg());
2846 dump_class_hierarchy(int entities, const char *suffix)
2848 FILE *f = vcg_open_name("class_hierarchy", suffix);
2853 env.dump_ent = entities;
2854 dump_vcg_header(f, "class_hierarchy", NULL);
2855 type_walk(dump_class_hierarchy_node, NULL, &env);
2860 /*---------------------------------------------------------------------*/
2861 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2863 /* dump_ir_block_graph */
2865 /* dump_type_graph */
2866 /* dump_ir_graph_w_types */
2867 /*---------------------------------------------------------------------*/
2869 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2871 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2872 dmp_grph(get_irp_irg(i), suffix);
2876 /*--------------------------------------------------------------------------------*
2877 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2878 * packed together in one subgraph/box *
2879 *--------------------------------------------------------------------------------*/
2881 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2882 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2884 ir_loop *son = NULL;
2886 /* Dump a new loop node. */
2887 dump_loop_node(F, loop);
2889 /* Dump the loop elements. */
2891 for(i = 0; i < get_loop_n_elements(loop); i++) {
2892 le = get_loop_element(loop, i);
2894 if (get_kind(son) == k_ir_loop) {
2896 /* We are a loop son -> Recurse */
2898 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2899 fprintf(F, "\" }\n");
2900 fprintf(F, "edge: {sourcename: \"");
2902 fprintf(F, "\" targetname: \"");
2904 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2905 loop_node_started = 0;
2907 dump_loop_son_edge(F, loop, son_number++);
2908 dump_loops_standalone(F, son);
2909 } else if (get_kind(son) == k_ir_node) {
2910 /* We are a loop node -> Collect firm nodes */
2912 ir_node *n = le.node;
2915 if (!loop_node_started) {
2916 /* Start a new node which contains all firm nodes of the current loop */
2917 fprintf(F, "node: { title: \"");
2919 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
2920 loop_node_started = 1;
2925 bad |= dump_node_label(F, n);
2926 /* Causes indeterministic output: if (is_Block(n)) fprintf(F, "\t ->%d", (int)get_irn_link(n)); */
2927 if (has_backedges(n)) fprintf(F, "\t loop head!");
2928 } else { /* for callgraph loop tree */
2930 assert(get_kind(son) == k_ir_graph);
2932 /* We are a loop node -> Collect firm graphs */
2933 n = (ir_graph *)le.node;
2934 if (!loop_node_started) {
2935 /* Start a new node which contains all firm nodes of the current loop */
2936 fprintf(F, "node: { title: \"");
2938 fprintf(F, "-%d-nodes\" color: lightyellow label: \"", i);
2939 loop_node_started = 1;
2943 fprintf(F, " %s", get_irg_dump_name(n));
2944 /* fprintf(F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2948 if (loop_node_started) {
2949 fprintf(F, "\" }\n");
2950 fprintf(F, "edge: {sourcename: \"");
2952 fprintf(F, "\" targetname: \"");
2954 fprintf(F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2955 loop_node_started = 0;
2959 void dump_loop_tree(ir_graph *irg, const char *suffix)
2963 /* if a filter is set, dump only the irg's that match the filter */
2964 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2966 f = vcg_open(irg, suffix, "-looptree");
2968 ir_graph *rem = current_ir_graph;
2969 int el_rem = edge_label;
2971 current_ir_graph = irg;
2974 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2976 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2980 edge_label = el_rem;
2981 current_ir_graph = rem;
2985 void dump_callgraph_loop_tree(const char *suffix) {
2987 F = vcg_open_name("Callgraph_looptree", suffix);
2988 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2989 dump_loops_standalone(F, irp->outermost_cg_loop);
2994 /*-----------------------------------------------------------------------------*/
2995 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2996 /*-----------------------------------------------------------------------------*/
2998 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2999 int i, son_number = 0, node_number = 0;
3001 if (dump_loop_information_flag) dump_loop_node(F, loop);
3003 for (i = 0; i < get_loop_n_elements(loop); i++) {
3004 loop_element le = get_loop_element(loop, i);
3005 if (*(le.kind) == k_ir_loop) {
3006 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
3008 collect_nodeloop(F, le.son, loopnodes);
3010 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
3011 eset_insert(loopnodes, le.node);
3016 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
3019 for(i = 0; i < get_loop_n_elements(loop); i++) {
3020 loop_element le = get_loop_element(loop, i);
3021 if (*(le.kind) == k_ir_loop) {
3023 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3025 if (is_Block(le.node)) start = 0; else start = -1;
3026 for (j = start; j < get_irn_arity(le.node); j++) {
3027 ir_node *pred = get_irn_n(le.node, j);
3028 if (!eset_contains(loopnodes, pred)) {
3029 eset_insert(extnodes, pred);
3030 if (!is_Block(pred)) {
3031 pred = get_nodes_block(pred);
3032 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3040 void dump_loop(ir_loop *l, const char *suffix) {
3044 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3045 F = vcg_open_name(name, suffix);
3047 eset *loopnodes = eset_create();
3048 eset *extnodes = eset_create();
3051 dump_vcg_header(F, name, NULL);
3053 /* collect all nodes to dump */
3054 collect_nodeloop(F, l, loopnodes);
3055 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3057 /* build block lists */
3058 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3059 set_irn_link(n, NULL);
3060 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3061 set_irn_link(n, NULL);
3062 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes)) {
3064 b = get_nodes_block(n);
3065 set_irn_link(n, get_irn_link(b));
3069 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes)) {
3071 b = get_nodes_block(n);
3072 set_irn_link(n, get_irn_link(b));
3077 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes)) {
3079 fprintf(F, "graph: { title: \"");
3081 fprintf(F, "\" label: \"");
3082 dump_node_opcode(F, b);
3083 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3084 fprintf(F, "\" status:clustered color:yellow\n");
3086 /* dump the blocks edges */
3087 dump_ir_data_edges(F, b);
3089 /* dump the nodes that go into the block */
3090 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3091 if (eset_contains(extnodes, n))
3092 overrule_nodecolor = ird_color_lightblue;
3094 overrule_nodecolor = ird_color_default;
3095 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3098 /* Close the vcg information for the block */
3100 dump_const_node_local(F, b);
3104 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes)) {
3106 fprintf(F, "graph: { title: \"");
3108 fprintf(F, "\" label: \"");
3109 dump_node_opcode(F, b);
3110 fprintf(F, " %ld:%d", get_irn_node_nr(b), get_irn_idx(b));
3111 fprintf(F, "\" status:clustered color:lightblue\n");
3113 /* dump the nodes that go into the block */
3114 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3115 if (!eset_contains(loopnodes, n))
3116 overrule_nodecolor = ird_color_lightblue;
3118 overrule_nodecolor = ird_color_default;
3119 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3122 /* Close the vcg information for the block */
3124 dump_const_node_local(F, b);
3128 eset_destroy(loopnodes);
3129 eset_destroy(extnodes);