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-2003 Universit�t Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
24 #include "firm_common_t.h"
37 #include "type_or_entity.h"
41 #include "callgraph.h"
42 #include "irextbb_t.h"
43 #include "dbginfo_t.h"
55 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
56 extern void dump_irn_state(FILE *FL, ir_node *n);
57 extern int get_opt_dump_abstvals(void);
58 typedef unsigned long SeqNo;
59 extern SeqNo get_Block_seqno(ir_node *n);
62 /* basis for a color range for vcg */
63 static int n_colors = 0;
64 static int base_color = 0;
66 /** Dump only irgs with names that start with this string */
67 static ident *dump_file_filter_id = NULL;
69 #define ERROR_TXT "<ERROR>"
71 /*******************************************************************/
72 /* flags to steer output */
73 /*******************************************************************/
75 /** An option to turn off edge labels */
76 static int edge_label = 1;
77 /** An option to turn off dumping values of constant entities */
78 static int const_entities = 1;
79 /** An option to dump the keep alive edges */
80 static int dump_keepalive = 0;
81 /** An option to dump ld_names instead of names. */
82 static int dump_ld_name = 1;
83 /** Compiler options to dump analysis information in dump_ir_graph */
84 int dump_out_edge_flag = 0;
85 int dump_dominator_information_flag = 0;
86 int dump_loop_information_flag = 0;
87 int dump_backedge_information_flag = 1;
88 int dump_const_local = 0;
89 int opt_dump_analysed_type_info = 1;
90 int opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */
92 static dumper_colors overrule_nodecolor = ird_color_default;
94 /** An additional edge hook. */
95 static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
97 void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func)
99 dump_node_edge_hook = func;
102 DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void)
104 return dump_node_edge_hook;
108 /** The vcg node attribute hook. */
109 static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
110 /** The vcg node attribute hook. */
111 static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
112 /** The vcg edge attribute hook. */
113 static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
115 /* set the ir graph hook */
116 void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
117 dump_ir_graph_hook = hook;
119 /* set the node attribute hook */
120 void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
121 dump_node_vcgattr_hook = hook;
123 /* set the edge attribute hook */
124 void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
125 dump_edge_vcgattr_hook = hook;
128 INLINE int get_opt_dump_const_local(void) {
129 if (!dump_out_edge_flag && !dump_loop_information_flag)
130 return dump_const_local;
135 void only_dump_method_with_name(ident *name) {
136 dump_file_filter_id = name;
139 ident *get_dump_file_filter_ident(void) {
140 return dump_file_filter_id;
143 /** Returns non-zero if dump file filter is not set, or if it is a
145 int is_filtered_dump_name(ident *name) {
146 if (!dump_file_filter_id) return 1;
147 return id_is_prefix(dump_file_filter_id, name);
150 /* To turn off display of edge labels. Edge labels often cause xvcg to
151 abort with a segmentation fault. */
152 void turn_off_edge_labels(void) {
156 void dump_consts_local(int flag) {
157 dump_const_local = flag;
160 void dump_constant_entity_values(int flag) {
161 const_entities = flag;
164 void dump_keepalive_edges(int flag) {
165 dump_keepalive = flag;
168 int get_opt_dump_keepalive_edges(void) {
169 return dump_keepalive;
172 void dump_out_edges(int flag) {
173 dump_out_edge_flag = flag;
176 void dump_dominator_information(int flag) {
177 dump_dominator_information_flag = flag;
180 void dump_loop_information(int flag) {
181 dump_loop_information_flag = flag;
184 void dump_backedge_information(int flag) {
185 dump_backedge_information_flag = flag;
188 /* Dump the information of type field specified in ana/irtypeinfo.h.
189 * If the flag is set, the type name is output in [] in the node label,
190 * else it is output as info.
192 void set_opt_dump_analysed_type_info(int flag) {
193 opt_dump_analysed_type_info = flag;
196 void dump_pointer_values_to_info(int flag) {
197 opt_dump_pointer_values_to_info = flag;
200 void dump_ld_names(int flag) {
204 /* -------------- some extended helper functions ----------------- */
207 * returns the name of a mode or <ERROR> if mode is NOT a mode object.
208 * in the later case, sets bad
210 const char *get_mode_name_ex(ir_mode *mode, int *bad)
213 return get_mode_name(mode);
219 * returns the name of a type or <ERROR> if mode is NOT a mode object.
220 * in the later case, sets bad
222 const char *get_type_name_ex(ir_type *tp, int *bad)
225 return get_type_name(tp);
231 * printf the VCG color
233 static void print_vcg_color(FILE *F, dumper_colors color) {
234 static const char *color_names[32] = {
235 "white", "blue", "red", "green",
236 "yellow", "magenta", "cyan", "darkgray",
237 "darkblue", "darkred", "darkgreen", "darkyellow",
238 "darkmagenta", "darkcyan", "gold", "lightgray",
239 "lightblue", "lightred", "lightgreen", "lightyellow",
240 "lightmagenta", "lightcyan", "lilac", "turquoise",
241 "aquamarine", "khaki", "purple", "yellowgreen",
242 "pink", "orange", "orchid", "black"
245 if (color != ird_color_default)
246 fprintf(F, "color:%s", color_names[color]);
250 * prints the edge from a type S to a type T with additional info fmt, ...
253 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
258 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
259 fprintf(F, " targetname: "); PRINT_TYPEID(T);
260 vfprintf(F, fmt, ap);
266 * prints the edge from a type T to an entity E with additional info fmt, ...
269 static void print_type_ent_edge(FILE *F, ir_type *T, entity *E, const char *fmt, ...)
274 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
275 fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
276 vfprintf(F, fmt, ap);
282 * prints the edge from an entity E to an entity T with additional info fmt, ...
285 static void print_ent_ent_edge(FILE *F, entity *E, entity *T, int backedge, const char *fmt, ...)
291 fprintf(F, "backedge: { sourcename: \"");
293 fprintf(F, "edge: { sourcename: \"");
295 fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\"");
296 vfprintf(F, fmt, ap);
302 * prints the edge from an entity E to a type T with additional info fmt, ...
305 static void print_ent_type_edge(FILE *F, entity *E, ir_type *T, const char *fmt, ...)
310 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
311 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
312 vfprintf(F, fmt, ap);
318 * prints the edge from a node N to a type T with additional info fmt, ...
321 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
326 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
327 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
328 vfprintf(F, fmt, ap);
334 * prints the edge from a node N to an entity E with additional info fmt, ...
337 static void print_node_ent_edge(FILE *F, const ir_node *N, entity *E, const char *fmt, ...)
342 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
343 fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
345 vfprintf(F, fmt, ap);
351 * prints the edge from an entity E to a node N with additional info fmt, ...
354 static void print_ent_node_edge(FILE *F, entity *E, const ir_node *N, const char *fmt, ...)
359 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
360 fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
361 vfprintf(F, fmt, ap);
367 * prints the edge from a type E to an enumeration item item with additional info fmt, ...
370 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
375 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
376 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
377 vfprintf(F, fmt, ap);
382 /*-----------------------------------------------------------------*/
383 /* global and ahead declarations */
384 /*-----------------------------------------------------------------*/
386 static void dump_whole_node(ir_node *n, void *env);
387 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
389 /*-----------------------------------------------------------------*/
390 /* Helper functions. */
391 /*-----------------------------------------------------------------*/
394 * This map is used as a private link attr to be able to call dumper
395 * anywhere without destroying link fields.
397 static pmap *irdump_link_map = NULL;
399 /** NOT A STANDARD LIBFIRM INIT METHOD
401 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
402 * are off, we want to have as few interferences as possible. Therefore the
403 * initialization is performed lazily and not called from within init_firm.
405 * Creates the link attribute map. */
406 static void init_irdump(void) {
407 /* We need a new, empty map. */
408 if (irdump_link_map) pmap_destroy(irdump_link_map);
409 irdump_link_map = pmap_create();
410 if (!dump_file_filter_id)
411 dump_file_filter_id = new_id_from_str("");
414 * Returns the private link field.
416 static void *ird_get_irn_link(ir_node *n) {
418 if (!irdump_link_map) return NULL;
420 if (pmap_contains(irdump_link_map, (void *)n))
421 res = pmap_get(irdump_link_map, (void *)n);
426 * Sets the private link field.
428 static void ird_set_irn_link(ir_node *n, void *x) {
429 if (!irdump_link_map)
431 pmap_insert(irdump_link_map, (void *)n, x);
435 * Gets the private link field of an irg.
437 static void *ird_get_irg_link(ir_graph *irg) {
439 if (!irdump_link_map) return NULL;
441 if (pmap_contains(irdump_link_map, (void *)irg))
442 res = pmap_get(irdump_link_map, (void *)irg);
447 * Sets the private link field of an irg.
449 static void ird_set_irg_link(ir_graph *irg, void *x) {
450 if (!irdump_link_map) init_irdump();
451 pmap_insert(irdump_link_map, (void *)irg, x);
455 * Walker, clears the private link field.
457 static void clear_link(ir_node * node, void * env) {
458 ird_set_irn_link(node, NULL);
462 * If the entity has a ld_name, returns it if the dump_ld_name is set,
463 * else returns the name of the entity.
465 static const char *_get_ent_dump_name(entity *ent, int dump_ld_name) {
467 return "<NULL entity>";
469 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
470 if (ent->ld_name) return get_id_str(ent->ld_name);
472 return get_id_str(ent->name);
476 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
477 * else returns the name of the entity.
479 const char *get_ent_dump_name(entity *ent) {
480 return _get_ent_dump_name(ent, dump_ld_name);
483 /* Returns the name of an IRG. */
484 const char *get_irg_dump_name(ir_graph *irg) {
485 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
486 return _get_ent_dump_name(get_irg_entity(irg), 1);
490 * Returns non-zero if a node is in floating state.
492 static int node_floats(ir_node *n) {
493 return ((get_irn_pinned(n) == op_pin_state_floats) &&
494 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
498 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
500 static void collect_node(ir_node * node, void *env) {
503 || get_irn_op(node) == op_Bad
504 || get_irn_op(node) == op_Unknown
505 || get_irn_op(node) == op_NoMem) {
506 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
507 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
508 ARR_APP1(ir_node *, arr, node);
509 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
511 ir_node * block = get_nodes_block(node);
514 /* this node is in a Bad block, so we must place it into the graph's list */
515 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
516 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
517 ARR_APP1(ir_node *, arr, node);
518 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
521 ird_set_irn_link(node, ird_get_irn_link(block));
522 ird_set_irn_link(block, node);
527 /** Construct lists to walk ir block-wise.
529 * Collects all blocks, nodes not op_pin_state_pinned,
530 * Bad, NoMem and Unknown into a flexible array in link field of
531 * irg they belong to. Sets the irg link field to NULL in all
532 * graphs not visited.
533 * Free the list with DEL_ARR_F().
535 static ir_node **construct_block_lists(ir_graph *irg) {
536 int i, rem_view = get_interprocedural_view();
537 ir_graph *rem = current_ir_graph;
538 current_ir_graph = irg;
540 for (i = 0; i < get_irp_n_irgs(); i++)
541 ird_set_irg_link(get_irp_irg(i), NULL);
543 irg_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
545 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
546 set_interprocedural_view(0);
548 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
549 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
550 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
551 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
553 set_interprocedural_view(rem_view);
555 current_ir_graph = rem;
556 return ird_get_irg_link(irg);
559 typedef struct _list_tuple {
561 ir_extblk **extbb_list;
564 /** Construct lists to walk ir extended block-wise.
565 * Free the lists in the tuple with DEL_ARR_F().
567 static list_tuple *construct_extblock_lists(ir_graph *irg) {
568 ir_node **blk_list = construct_block_lists(irg);
570 ir_graph *rem = current_ir_graph;
571 list_tuple *lists = xmalloc(sizeof(*lists));
573 current_ir_graph = irg;
575 lists->blk_list = NEW_ARR_F(ir_node *, 0);
576 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
578 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
581 if (is_Block(blk_list[i])) {
582 ext = get_Block_extbb(blk_list[i]);
584 if (extbb_not_visited(ext)) {
585 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
586 mark_extbb_visited(ext);
590 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
593 current_ir_graph = rem;
595 ird_set_irg_link(irg, lists);
599 /*-----------------------------------------------------------------*/
600 /* Routines to dump information about a single ir node. */
601 /*-----------------------------------------------------------------*/
604 * dump the name of a node n to the File F.
606 int dump_node_opcode(FILE *F, ir_node *n)
609 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
611 /* call the dump_node operation if available */
613 return ops->dump_node(n, F, dump_node_opcode_txt);
615 /* implementation for default nodes */
616 switch (get_irn_opcode(n)) {
621 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
622 assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
627 if (get_SymConst_kind(n) == symconst_addr_name) {
628 /* don't use get_SymConst_ptr_info as it mangles the name. */
629 fprintf (F, "SymC %s", get_id_str(get_SymConst_name(n)));
630 } else if (get_SymConst_kind(n) == symconst_addr_ent) {
631 assert(get_SymConst_entity(n));
632 assert(is_entity(get_SymConst_entity(n)));
633 fprintf (F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
635 assert(get_kind(get_SymConst_type(n)) == k_type);
636 assert(get_type_ident(get_SymConst_type(n)));
637 fprintf (F, "SymC %s ", get_type_name_ex(get_SymConst_type(n), &bad));
638 if (get_SymConst_kind(n) == symconst_type_tag)
646 if (!get_interprocedural_view())
653 ir_node *pred = get_Proj_pred(n);
655 if (get_irn_opcode(pred) == iro_Cond
656 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
657 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
658 fprintf (F, "defProj");
666 if (get_interprocedural_view()) {
667 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
672 case iro_CallBegin: {
673 ir_node *addr = get_CallBegin_ptr(n);
675 if (get_irn_op(addr) == op_Sel)
676 ent = get_Sel_entity(addr);
677 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
678 ent = get_SymConst_entity(addr);
679 fprintf (F, "%s", get_irn_opname(n));
680 if (ent) fprintf (F, " %s", get_entity_name(ent));
684 fprintf (F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
687 fprintf (F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
692 fprintf (F, "%s", get_irn_opname(n));
699 * Dump the mode of a node n to a file F.
700 * Ignore modes that are "always known".
702 static int dump_node_mode(FILE *F, ir_node *n)
705 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
708 /* call the dump_node operation if available */
710 return ops->dump_node(n, F, dump_node_mode_txt);
712 /* default implementation */
713 iro = get_irn_opcode(n);
725 ir_mode *mode = get_irn_mode(n);
727 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
728 (mode != mode_T || iro == iro_Proj))
729 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
737 * Dump the type of a node n to a file F if it's known.
739 static int dump_node_typeinfo(FILE *F, ir_node *n) {
742 if (opt_dump_analysed_type_info) {
743 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
744 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
745 ir_type *tp = get_irn_typeinfo_type(n);
746 if (tp != firm_none_type)
747 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
755 typedef struct _pns_lookup {
756 long nr; /**< the proj number */
757 const char *name; /**< the name of the Proj */
760 typedef struct _proj_lookup {
761 opcode code; /**< the opcode of the Proj predecessor */
762 unsigned num_data; /**< number of data entries */
763 const pns_lookup_t *data; /**< the data */
766 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
768 /** the lookup table for Proj(Start) names */
769 static const pns_lookup_t start_lut[] = {
770 #define X(a) { pn_Start_##a, #a }
779 /** the lookup table for Proj(Cond) names */
780 static const pns_lookup_t cond_lut[] = {
781 #define X(a) { pn_Cond_##a, #a }
787 /** the lookup table for Proj(Call) names */
788 static const pns_lookup_t call_lut[] = {
789 #define X(a) { pn_Call_##a, #a }
798 /** the lookup table for Proj(Quot) names */
799 static const pns_lookup_t quot_lut[] = {
800 #define X(a) { pn_Quot_##a, #a }
807 /** the lookup table for Proj(DivMod) names */
808 static const pns_lookup_t divmod_lut[] = {
809 #define X(a) { pn_DivMod_##a, #a }
817 /** the lookup table for Proj(Div) names */
818 static const pns_lookup_t div_lut[] = {
819 #define X(a) { pn_Div_##a, #a }
826 /** the lookup table for Proj(Mod) names */
827 static const pns_lookup_t mod_lut[] = {
828 #define X(a) { pn_Mod_##a, #a }
835 /** the lookup table for Proj(Load) names */
836 static const pns_lookup_t load_lut[] = {
837 #define X(a) { pn_Load_##a, #a }
844 /** the lookup table for Proj(Store) names */
845 static const pns_lookup_t store_lut[] = {
846 #define X(a) { pn_Store_##a, #a }
852 /** the lookup table for Proj(Alloc) names */
853 static const pns_lookup_t alloc_lut[] = {
854 #define X(a) { pn_Alloc_##a, #a }
861 /** the lookup table for Proj(CopyB) names */
862 static const pns_lookup_t copyb_lut[] = {
863 #define X(a) { pn_CopyB_##a, #a }
870 /** the lookup table for Proj(Bound) names */
871 static const pns_lookup_t bound_lut[] = {
872 #define X(a) { pn_Bound_##a, #a }
880 /** the Proj lookup table */
881 static const proj_lookup_t proj_lut[] = {
882 #define E(a) ARR_SIZE(a), a
883 { iro_Start, E(start_lut) },
884 { iro_Cond, E(cond_lut) },
885 { iro_Call, E(call_lut) },
886 { iro_Quot, E(quot_lut) },
887 { iro_DivMod, E(divmod_lut) },
888 { iro_Div, E(div_lut) },
889 { iro_Mod, E(mod_lut) },
890 { iro_Load, E(load_lut) },
891 { iro_Store, E(store_lut) },
892 { iro_Alloc, E(alloc_lut) },
893 { iro_CopyB, E(copyb_lut) },
894 { iro_Bound, E(bound_lut) }
899 * Dump additional node attributes of some nodes to a file F.
902 dump_node_nodeattr(FILE *F, ir_node *n)
908 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
910 /* call the dump_node operation if available */
912 return ops->dump_node(n, F, dump_node_nodeattr_txt);
914 switch (get_irn_opcode(n)) {
916 if (0 && get_interprocedural_view()) {
917 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
922 pred = get_Proj_pred(n);
923 proj_nr = get_Proj_proj(n);
925 code = get_irn_opcode(pred);
928 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
929 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
930 fprintf (F, "Arg %ld ", proj_nr);
932 unsigned i, j, f = 0;
934 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
935 if (code == proj_lut[i].code) {
936 for (j = 0; j < proj_lut[i].num_data; ++j) {
937 if (proj_nr == proj_lut[i].data[j].nr) {
938 fprintf (F, "%s ", proj_lut[i].data[j].name);
947 fprintf (F, "%ld ", proj_nr);
948 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
949 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
951 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
957 proj_nr = get_Filter_proj(n);
958 if (! get_interprocedural_view()) {
960 pred = get_Filter_pred(n);
964 fprintf (F, "%ld ", proj_nr);
967 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
970 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
973 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
976 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
987 #include "execution_frequency.h"
988 #include "callgraph.h"
990 void dump_node_ana_vals(FILE *F, ir_node *n) {
992 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
993 get_irn_exec_freq(n),
994 get_irg_method_execution_frequency(get_irn_irg(n)),
995 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
996 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1001 /* Dumps a node label without the enclosing ". */
1002 int dump_node_label(FILE *F, ir_node *n) {
1005 bad |= dump_node_opcode(F, n);
1006 bad |= dump_node_mode(F, n);
1008 bad |= dump_node_typeinfo(F, n);
1009 bad |= dump_node_nodeattr(F, n);
1010 fprintf(F, "%ld", get_irn_node_nr(n));
1017 * Dumps the attributes of a node n into the file F.
1018 * Currently this is only the color of a node.
1020 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1025 print_vcg_color(F, ird_color_red);
1029 if (dump_node_vcgattr_hook)
1030 if (dump_node_vcgattr_hook(F, node, local))
1033 n = local ? local : node;
1035 if (overrule_nodecolor != ird_color_default) {
1036 print_vcg_color(F, overrule_nodecolor);
1040 switch (get_irn_opcode(n)) {
1047 print_vcg_color(F, ird_color_blue);
1050 if (is_Block_dead(n))
1051 print_vcg_color(F, ird_color_lightred);
1053 print_vcg_color(F, ird_color_lightyellow);
1056 print_vcg_color(F, ird_color_green);
1062 print_vcg_color(F, ird_color_yellow);
1065 PRINT_DEFAULT_NODE_ATTR;
1071 * Dump the node information of a node n to a file F.
1073 static INLINE int dump_node_info(FILE *F, ir_node *n)
1076 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1078 fprintf (F, " info1: \"");
1079 bad = dump_irnode_to_file(F, n);
1080 /* call the dump_node operation if available */
1082 bad = ops->dump_node(n, F, dump_node_info_txt);
1089 * checks whether a node is "constant-like" ie can be treated "block-less"
1092 int is_constlike_node(ir_node *n) {
1093 ir_op *op = get_irn_op(n);
1094 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1098 /** outputs the predecessors of n, that are constants, local. I.e.,
1099 generates a copy of the constant predecessors for each node called with. */
1100 static void dump_const_node_local(FILE *F, ir_node *n) {
1102 if (!get_opt_dump_const_local()) return;
1104 /* Use visited flag to avoid outputting nodes twice.
1105 initialize it first. */
1106 for (i = 0; i < get_irn_arity(n); i++) {
1107 ir_node *con = get_irn_n(n, i);
1108 if (is_constlike_node(con)) {
1109 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1113 for (i = 0; i < get_irn_arity(n); i++) {
1114 ir_node *con = get_irn_n(n, i);
1115 if (is_constlike_node(con) && irn_not_visited(con)) {
1118 mark_irn_visited(con);
1119 /* Generate a new name for the node by appending the names of
1121 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1122 fprintf(F, " label: \"");
1123 bad |= dump_node_label(F, con);
1125 bad |= dump_node_info(F, con);
1126 dump_node_vcgattr(F, n, con, bad);
1132 /** If the block of an edge is a const_like node, dump it local with an edge */
1133 static void dump_const_block_local(FILE *F, ir_node *n) {
1136 if (!get_opt_dump_const_local()) return;
1138 blk = get_nodes_block(n);
1139 if (is_constlike_node(blk)) {
1142 /* Generate a new name for the node by appending the names of
1144 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1145 fprintf(F, "\" label: \"");
1146 bad |= dump_node_label(F, blk);
1148 bad |= dump_node_info(F, blk);
1149 dump_node_vcgattr(F, n, blk, bad);
1152 fprintf (F, "edge: { sourcename: \"");
1154 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1156 if (dump_edge_vcgattr_hook) {
1158 if (dump_edge_vcgattr_hook(F, n, -1)) {
1163 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1168 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1173 * prints the error message of a node to a file F as info2.
1175 static void INLINE print_node_error(FILE *F, const char *err_msg)
1180 fprintf (F, " info2: \"%s\"", err_msg);
1184 * prints debug messages of a node to file F as info3.
1186 static void print_dbg_info(FILE *F, dbg_info *dbg)
1190 if (__dbg_info_snprint) {
1192 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1193 fprintf (F, " info3: \"%s\"\n", buf);
1200 static void dump_node(FILE *F, ir_node *n)
1205 if (get_opt_dump_const_local() && is_constlike_node(n))
1208 /* dump this node */
1209 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1211 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1212 bad |= dump_node_label(F, n);
1213 dump_node_ana_vals(F, n);
1214 //dump_node_ana_info(F, n);
1216 bad |= dump_node_info(F, n);
1217 print_node_error(F, p);
1218 print_dbg_info(F, get_irn_dbg_info(n));
1219 dump_node_vcgattr(F, n, NULL, bad);
1221 dump_const_node_local(F, n);
1223 if(dump_node_edge_hook)
1224 dump_node_edge_hook(F, n);
1226 dump_irn_chi_term(F, n);
1227 dump_irn_state(F, n);
1231 /** dump the edge to the block this node belongs to */
1233 dump_ir_block_edge(FILE *F, ir_node *n) {
1234 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1235 if (is_no_Block(n)) {
1236 ir_node *block = get_nodes_block(n);
1238 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1239 dump_const_block_local(F, n);
1242 fprintf (F, "edge: { sourcename: \"");
1244 fprintf (F, "\" targetname: ");
1245 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1247 if (dump_edge_vcgattr_hook) {
1249 if (dump_edge_vcgattr_hook(F, n, -1)) {
1254 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1259 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1265 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1267 * do not use get_nodes_block() here, will fail
1268 * if the irg is not pinned.
1270 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1271 fprintf (F, INTRA_DATA_EDGE_ATTR);
1273 fprintf (F, INTER_DATA_EDGE_ATTR);
1277 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1279 * do not use get_nodes_block() here, will fail
1280 * if the irg is not pinned.
1282 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1283 fprintf (F, INTRA_MEM_EDGE_ATTR);
1285 fprintf (F, INTER_MEM_EDGE_ATTR);
1289 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1292 if (dump_edge_vcgattr_hook)
1293 if (dump_edge_vcgattr_hook(F, from, to))
1296 if (dump_backedge_information_flag && is_backedge(from, to))
1297 fprintf (F, BACK_EDGE_ATTR);
1299 switch (get_irn_opcode(from)) {
1301 fprintf (F, CF_EDGE_ATTR);
1303 case iro_Start: break;
1306 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1307 fprintf (F, CF_EDGE_ATTR);
1308 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1309 fprintf (F, INTER_MEM_EDGE_ATTR);
1317 print_data_edge_vcgattr(F, from, to);
1322 print_mem_edge_vcgattr(F, from, to);
1324 print_data_edge_vcgattr(F, from, to);
1328 print_data_edge_vcgattr(F, from, to);
1333 print_mem_edge_vcgattr(F, from, to);
1335 print_data_edge_vcgattr(F, from, to);
1342 print_data_edge_vcgattr(F, from, to);
1349 print_mem_edge_vcgattr(F, from, to);
1351 print_data_edge_vcgattr(F, from, to);
1363 print_data_edge_vcgattr(F, from, to);
1366 if (get_irn_modecode(from) == irm_M)
1367 fprintf (F, INTER_MEM_EDGE_ATTR);
1369 print_data_edge_vcgattr(F, from, to);
1376 print_mem_edge_vcgattr(F, from, to);
1378 print_data_edge_vcgattr(F, from, to);
1381 print_mem_edge_vcgattr(F, from, to);
1383 case iro_Tuple: break;
1386 switch (get_irn_modecode(from)) {
1388 fprintf (F, CF_EDGE_ATTR);
1391 fprintf (F, INTER_MEM_EDGE_ATTR);
1394 print_data_edge_vcgattr(F, from, to);
1398 case iro_Bad: break;
1399 case iro_Unknown: break;
1401 switch (get_irn_modecode(from)) {
1403 fprintf (F, INTRA_MEM_EDGE_ATTR);
1406 fprintf (F, CF_EDGE_ATTR);
1409 print_data_edge_vcgattr(F, from, to);
1417 /* dump edges to our inputs */
1419 dump_ir_data_edges(FILE *F, ir_node *n) {
1421 unsigned long visited = get_irn_visited(n);
1423 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1426 for (i = 0; i < get_irn_arity(n); i++) {
1427 ir_node * pred = get_irn_n(n, i);
1430 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1431 continue; /* pred not dumped */
1433 if (dump_backedge_information_flag && is_backedge(n, i))
1434 fprintf (F, "backedge: {sourcename: \"");
1436 fprintf (F, "edge: {sourcename: \"");
1438 fprintf (F, "\" targetname: ");
1439 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1440 PRINT_CONSTID(n, pred);
1442 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1444 fprintf (F, " label: \"%d\" ", i);
1445 print_edge_vcgattr(F, n, i);
1450 /** Dumps a node and its edges but not the block edge
1453 dump_node_wo_blockedge (ir_node *n, void *env) {
1456 dump_ir_data_edges(F, n);
1459 /** Dumps a node and its edges.
1462 dump_whole_node (ir_node *n, void *env) {
1464 dump_node_wo_blockedge(n, env);
1465 if (!node_floats(n)) dump_ir_block_edge(F, n);
1469 dump_const_node(ir_node *n, void *env) {
1470 if (is_Block(n)) return;
1471 dump_node_wo_blockedge(n, env);
1474 /***********************************************************************/
1475 /* the following routines dump the nodes/irgs bracketed to graphs. */
1476 /***********************************************************************/
1478 /** Dumps a constant expression as entity initializer, array bound ...
1480 static void dump_const_expression(FILE *F, ir_node *value) {
1481 ir_graph *rem = current_ir_graph;
1482 int rem_dump_const_local = dump_const_local;
1483 dump_const_local = 0;
1484 current_ir_graph = get_const_code_irg();
1485 irg_walk(value, dump_const_node, NULL, F);
1486 /* Decrease visited flag so that we walk with the same flag for the next
1487 expression. This guarantees that we don't dump the same node twice,
1488 as for const expressions cse is performed to save memory. */
1489 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1490 current_ir_graph = rem;
1491 dump_const_local = rem_dump_const_local;
1494 /** Dump a block as graph containing its nodes.
1496 * Expects to find nodes belonging to the block as list in its
1498 * Dumps the edges of all nodes including itself. */
1500 dump_whole_block(FILE *F, ir_node *block) {
1502 dumper_colors color = ird_color_yellow;
1504 assert(is_Block(block));
1506 fprintf(F, "graph: { title: \"");
1507 PRINT_NODEID(block);
1508 fprintf(F, "\" label: \"");
1509 dump_node_label(F, block);
1511 if (get_opt_dump_abstvals())
1512 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1515 /* colorize blocks */
1516 if (! get_Block_matured(block))
1517 color = ird_color_red;
1518 if (is_Block_dead(block))
1519 color = ird_color_orange;
1521 fprintf(F, "\" status:clustered ");
1522 print_vcg_color(F, color);
1525 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1526 dump_node_info(F, block);
1527 print_dbg_info(F, get_irn_dbg_info(block));
1529 /* dump the blocks edges */
1530 dump_ir_data_edges(F, block);
1532 /* dump the nodes that go into the block */
1533 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1535 dump_ir_data_edges(F, node);
1538 /* Close the vcg information for the block */
1540 dump_const_node_local(F, block);
1542 dump_irn_chi_term(F, block);
1547 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1548 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1550 dump_block_graph(FILE *F, ir_graph *irg) {
1552 ir_graph *rem = current_ir_graph;
1553 ir_node **arr = ird_get_irg_link(irg);
1554 current_ir_graph = irg;
1556 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1557 ir_node * node = arr[i];
1558 if (is_Block(node)) {
1559 /* Dumps the block and all the nodes in the block, which are to
1560 be found in Block->link. */
1561 dump_whole_block(F, node);
1563 /* Nodes that are not in a Block. */
1565 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1566 dump_const_block_local(F, node);
1568 dump_ir_data_edges(F, node);
1572 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1573 dump_loop_nodes_into_graph(F, irg);
1575 current_ir_graph = rem;
1579 * Dump the info for an irg.
1580 * Parsed by XVCG but not shown. use yComp.
1582 static void dump_graph_info(FILE *F, ir_graph *irg) {
1583 fprintf(F, "info1: \"");
1584 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1588 /** Dumps an irg as a graph clustered by block nodes.
1589 * If interprocedural view edges can point to nodes out of this graph.
1591 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1592 entity *ent = get_irg_entity(irg);
1594 fprintf(F, "graph: { title: \"");
1596 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1597 get_ent_dump_name(ent));
1599 dump_graph_info(F, irg);
1600 print_dbg_info(F, get_entity_dbg_info(ent));
1602 dump_block_graph(F, irg);
1604 /* Close the vcg information for the irg */
1605 fprintf(F, "}\n\n");
1608 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1609 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1611 dump_extblock_graph(FILE *F, ir_graph *irg) {
1613 ir_graph *rem = current_ir_graph;
1614 ir_extblk **arr = ird_get_irg_link(irg);
1615 current_ir_graph = irg;
1618 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1619 ir_extblk *extbb = arr[i];
1620 ir_node *leader = get_extbb_leader(extbb);
1623 fprintf(F, "graph: { title: \"");
1624 PRINT_EXTBBID(leader);
1625 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1626 get_irn_node_nr(leader));
1628 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1629 ir_node * node = extbb->blks[j];
1630 if (is_Block(node)) {
1631 /* Dumps the block and all the nodes in the block, which are to
1632 be found in Block->link. */
1633 dump_whole_block(F, node);
1635 /* Nodes that are not in a Block. */
1637 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1638 dump_const_block_local(F, node);
1640 dump_ir_data_edges(F, node);
1646 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1647 dump_loop_nodes_into_graph(F, irg);
1649 current_ir_graph = rem;
1654 /*******************************************************************/
1655 /* Basic type and entity nodes and edges. */
1656 /*******************************************************************/
1658 /** dumps the edges between nodes and their type or entity attributes. */
1659 static void dump_node2type_edges(ir_node *n, void *env)
1664 switch (get_irn_opcode(n)) {
1666 /* @@@ some consts have an entity */
1669 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1670 || (get_SymConst_kind(n) ==symconst_size))
1672 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1676 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1679 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1682 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1685 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1688 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1696 static int print_type_info(FILE *F, ir_type *tp) {
1699 if (get_type_state(tp) == layout_undefined) {
1700 fprintf(F, "state: layout_undefined\n");
1702 fprintf(F, "state: layout_fixed,\n");
1704 if (get_type_mode(tp))
1705 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1706 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1711 static void print_typespecific_info(FILE *F, ir_type *tp) {
1712 switch (get_type_tpop_code(tp)) {
1715 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1722 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1723 fprintf(F, "params: %d\n", get_method_n_params(tp));
1724 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1732 case tpo_enumeration:
1746 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1747 switch (get_type_tpop_code(tp)) {
1750 if (peculiarity_existent == get_class_peculiarity(tp))
1751 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1753 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1757 fprintf (F, " " TYPE_METH_NODE_ATTR);
1768 case tpo_enumeration:
1782 int dump_type_node(FILE *F, ir_type *tp)
1786 fprintf (F, "node: {title: ");
1788 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1789 fprintf (F, " info1: \"");
1791 bad |= print_type_info(F, tp);
1792 print_typespecific_info(F, tp);
1794 dump_type_to_file(F, tp, dump_verbosity_max);
1796 fprintf (F, "\"\n");
1797 print_dbg_info(F, get_type_dbg_info(tp));
1798 print_typespecific_vcgattr(F, tp);
1805 #define X(a) case a: fprintf(F, #a); break
1806 void dump_entity_node(FILE *F, entity *ent, int color)
1808 fprintf (F, "node: {title: \"");
1809 PRINT_ENTID(ent); fprintf(F, "\"");
1810 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1811 fprintf (F, "label: ");
1812 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1814 fprintf(F, "color:%d", color);
1816 fprintf (F, ENTITY_NODE_ATTR);
1817 fprintf (F, "\n info1: \"");
1819 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1822 print_dbg_info(F, get_entity_dbg_info(ent));
1827 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1830 ident *id = get_enumeration_nameid(tp, pos);
1831 tarval *tv = get_enumeration_enum(tp, pos);
1833 tarval_snprintf(buf, sizeof(buf), tv);
1834 fprintf (F, "node: {title: \"");
1835 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1836 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1837 fprintf (F, "label: ");
1838 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1839 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1842 /* dumps a type or entity and it's edges. */
1844 dump_type_info(type_or_ent *tore, void *env) {
1846 int i = 0; /* to shutup gcc */
1848 /* dump this type or entity */
1850 switch (get_kind(tore)) {
1853 entity *ent = (entity *)tore;
1856 dump_entity_node(F, ent, 0);
1858 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1859 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1860 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1861 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1862 if (is_Class_type(get_entity_owner(ent))) {
1863 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1864 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1866 /* attached subgraphs */
1867 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1868 if (is_atomic_entity(ent)) {
1869 value = get_atomic_ent_value(ent);
1871 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1872 /* DDMN(value); $$$ */
1873 dump_const_expression(F, value);
1876 if (is_compound_entity(ent)) {
1877 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1878 value = get_compound_ent_value(ent, i);
1880 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1881 dump_const_expression(F, value);
1882 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1884 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1885 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1886 get_compound_ent_value_member(ent, i), i);
1895 ir_type *tp = (ir_type *)tore;
1896 dump_type_node(F, tp);
1897 /* and now the edges */
1898 switch (get_type_tpop_code(tp)) {
1901 for (i=0; i < get_class_n_supertypes(tp); i++)
1902 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1903 for (i=0; i < get_class_n_members(tp); i++)
1904 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1908 for (i=0; i < get_struct_n_members(tp); i++)
1909 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1913 for (i = 0; i < get_method_n_params(tp); i++)
1914 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1915 for (i = 0; i < get_method_n_ress(tp); i++)
1916 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1920 for (i = 0; i < get_union_n_members(tp); i++)
1921 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1925 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1926 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1927 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1928 ir_node *upper = get_array_upper_bound(tp, i);
1929 ir_node *lower = get_array_lower_bound(tp, i);
1930 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1931 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1932 dump_const_expression(F, upper);
1933 dump_const_expression(F, lower);
1937 case tpo_enumeration:
1939 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1940 dump_enum_item(F, tp, i);
1941 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1946 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1954 break; /* case k_type */
1957 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1959 } /* switch kind_or_entity */
1962 typedef struct _h_env {
1967 /** For dumping class hierarchies.
1968 * Dumps a class type node and a superclass edge.
1969 * If env->dump_ent dumps entities of classes and overwrites edges.
1972 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1975 int i = 0; /* to shutup gcc */
1977 /* dump this type or entity */
1978 switch (get_kind(tore)) {
1980 entity *ent = (entity *)tore;
1981 if (get_entity_owner(ent) == get_glob_type()) break;
1982 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1983 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1985 dump_entity_node(F, ent, 0);
1987 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1988 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1989 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
1991 } break; /* case k_entity */
1994 ir_type *tp = (ir_type *)tore;
1995 if (tp == get_glob_type()) break;
1996 switch (get_type_tpop_code(tp)) {
1998 dump_type_node(F, tp);
1999 /* and now the edges */
2000 for (i=0; i < get_class_n_supertypes(tp); i++)
2002 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2008 break; /* case k_type */
2011 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2013 } /* switch kind_or_entity */
2016 /*******************************************************************/
2017 /* dump analysis information that is expressed in graph terms. */
2018 /*******************************************************************/
2020 /* dump out edges */
2022 dump_out_edge(ir_node *n, void *env) {
2025 for (i = 0; i < get_irn_n_outs(n); i++) {
2026 assert(get_irn_out(n, i));
2027 fprintf (F, "edge: {sourcename: \"");
2029 fprintf (F, "\" targetname: \"");
2030 PRINT_NODEID(get_irn_out(n, i));
2031 fprintf (F, "\" color: red linestyle: dashed");
2037 dump_loop_label(FILE *F, ir_loop *loop) {
2038 fprintf (F, "loop %d, %d sons, %d nodes",
2039 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2042 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2043 fprintf (F, " info1: \"");
2044 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2045 #if DEBUG_libfirm /* GL @@@ debug analyses */
2046 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2052 dump_loop_node(FILE *F, ir_loop *loop) {
2053 fprintf (F, "node: {title: \"");
2055 fprintf (F, "\" label: \"");
2056 dump_loop_label(F, loop);
2058 dump_loop_info(F, loop);
2064 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2066 fprintf (F, "edge: {sourcename: \"");
2068 fprintf (F, "\" targetname: \"");
2069 PRINT_NODEID(get_loop_node(loop, i));
2070 fprintf (F, "\" color: green");
2075 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2077 fprintf (F, "edge: {sourcename: \"");
2079 fprintf (F, "\" targetname: \"");
2080 PRINT_LOOPID(get_loop_son(loop, i));
2081 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2082 get_loop_element_pos(loop, get_loop_son(loop, i)));
2086 void dump_loops(FILE *F, ir_loop *loop) {
2088 /* dump this loop node */
2089 dump_loop_node(F, loop);
2091 /* dump edges to nodes in loop -- only if it is a real loop */
2092 if (get_loop_depth(loop) != 0) {
2093 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2094 dump_loop_node_edge(F, loop, i);
2097 for (i = 0; i < get_loop_n_sons(loop); i++) {
2098 dump_loops(F, get_loop_son(loop, i));
2099 dump_loop_son_edge(F, loop, i);
2104 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2105 ir_graph *rem = current_ir_graph;
2106 current_ir_graph = irg;
2108 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2110 current_ir_graph = rem;
2115 * dumps the VCG header
2117 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2126 if (!orientation) orientation = "bottom_to_top";
2130 "graph: { title: \"ir graph of %s\"\n"
2131 "display_edge_labels: %s\n"
2132 "layoutalgorithm: mindepth\n"
2133 "manhattan_edges: yes\n"
2134 "port_sharing: no\n"
2136 "classname 1: \"intrablock Data\"\n"
2137 "classname 2: \"Block\"\n"
2138 "classname 3: \"Entity type\"\n"
2139 "classname 4: \"Entity owner\"\n"
2140 "classname 5: \"Method Param\"\n"
2141 "classname 6: \"Method Res\"\n"
2142 "classname 7: \"Super\"\n"
2143 "classname 8: \"Union\"\n"
2144 "classname 9: \"Points-to\"\n"
2145 "classname 10: \"Array Element Type\"\n"
2146 "classname 11: \"Overwrites\"\n"
2147 "classname 12: \"Member\"\n"
2148 "classname 13: \"Control Flow\"\n"
2149 "classname 14: \"intrablock Memory\"\n"
2150 "classname 15: \"Dominators\"\n"
2151 "classname 16: \"interblock Data\"\n"
2152 "classname 17: \"interblock Memory\"\n"
2153 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2154 "classname 19: \"Postdominators\"\n"
2155 "infoname 1: \"Attribute\"\n"
2156 "infoname 2: \"Verification errors\"\n"
2157 "infoname 3: \"Debug info\"\n",
2158 name, label, orientation);
2160 /* don't use all, the range is too whith/black. */
2164 "colorentry 100: 0 0 0\n"
2165 "colorentry 101: 20 0 0\n"
2166 "colorentry 102: 40 0 0\n"
2167 "colorentry 103: 60 0 0\n"
2168 "colorentry 104: 80 0 0\n"
2169 "colorentry 105: 100 0 0\n"
2170 "colorentry 106: 120 0 0\n"
2171 "colorentry 107: 140 0 0\n"
2172 "colorentry 108: 150 0 0\n"
2173 "colorentry 109: 180 0 0\n"
2174 "colorentry 110: 200 0 0\n"
2175 "colorentry 111: 220 0 0\n"
2176 "colorentry 112: 240 0 0\n"
2177 "colorentry 113: 255 0 0\n"
2178 "colorentry 113: 255 20 20\n"
2179 "colorentry 114: 255 40 40\n"
2180 "colorentry 115: 255 60 60\n"
2181 "colorentry 116: 255 80 80\n"
2182 "colorentry 117: 255 100 100\n"
2183 "colorentry 118: 255 120 120\n"
2184 "colorentry 119: 255 140 140\n"
2185 "colorentry 120: 255 150 150\n"
2186 "colorentry 121: 255 180 180\n"
2187 "colorentry 122: 255 200 200\n"
2188 "colorentry 123: 255 220 220\n"
2189 "colorentry 124: 255 240 240\n"
2190 "colorentry 125: 255 250 250\n"
2193 fprintf (F, "\n"); /* a separator */
2199 * @param irg The graph to be dumped
2200 * @param suffix1 first filename suffix
2201 * @param suffix2 second filename suffix
2203 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2205 const char *nm = get_irg_dump_name(irg);
2206 int len = strlen(nm), i, j;
2207 char *fname; /* filename to put the vcg information in */
2209 if (!suffix1) suffix1 = "";
2210 if (!suffix2) suffix2 = "";
2212 /* open file for vcg graph */
2213 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2215 /* strncpy (fname, nm, len); */ /* copy the filename */
2217 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2219 fname[j] = '@'; j++; fname[j] = '1'; j++;
2220 } else if (nm[i] == '@') {
2221 fname[j] = '@'; j++; fname[j] = '2'; j++;
2223 fname[j] = nm[i]; j++;
2227 strcat (fname, suffix1); /* append file suffix */
2228 strcat (fname, suffix2); /* append file suffix */
2229 strcat (fname, ".vcg"); /* append the .vcg suffix */
2231 /* vcg really expect only a <CR> at end of line, so
2232 * the "b"inary mode is what you mean (and even needed for Win32)
2234 F = fopen (fname, "wb"); /* open file for writing */
2236 panic("cannot open %s for writing (%m)", fname); /* not reached */
2246 * @param name prefix file name
2247 * @param suffix filename suffix
2249 FILE *vcg_open_name (const char *name, const char *suffix) {
2251 char *fname; /* filename to put the vcg information in */
2252 int i, j, len = strlen(name);
2254 if (!suffix) suffix = "";
2256 /** open file for vcg graph */
2257 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2258 /* strcpy (fname, name);*/ /* copy the filename */
2260 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2261 if (name[i] == '/') {
2262 fname[j] = '@'; j++; fname[j] = '1'; j++;
2263 } else if (name[i] == '@') {
2264 fname[j] = '@'; j++; fname[j] = '2'; j++;
2266 fname[j] = name[i]; j++;
2270 strcat (fname, suffix);
2271 strcat (fname, ".vcg"); /* append the .vcg suffix */
2273 /* vcg really expect only a <CR> at end of line, so
2274 * the "b"inary mode is what you mean (and even needed for Win32)
2276 F = fopen (fname, "wb"); /* open file for writing */
2278 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2286 * Dumps the vcg file footer
2288 static INLINE void dump_vcg_footer (FILE *F) {
2293 * close the vcg file
2295 void vcg_close (FILE *F) {
2296 dump_vcg_footer(F); /* print footer */
2297 fclose (F); /* close vcg file */
2300 /************************************************************************/
2301 /************************************************************************/
2302 /* Routines that dump all or parts of the firm representation to a file */
2303 /************************************************************************/
2304 /************************************************************************/
2306 /************************************************************************/
2307 /* Dump ir graphs, different formats and additional information. */
2308 /************************************************************************/
2310 /** Routine to dump a graph, blocks as conventional nodes. */
2312 dump_ir_graph (ir_graph *irg, const char *suffix )
2317 rem = current_ir_graph;
2319 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2321 current_ir_graph = irg;
2322 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2323 else suffix1 = "-pure";
2324 f = vcg_open(irg, suffix, suffix1);
2325 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2327 /* call the dump graph hook */
2328 if (dump_ir_graph_hook)
2329 if (dump_ir_graph_hook(f, irg))
2332 /* walk over the graph */
2333 /* dump_whole_node must be called in post visiting predecessors */
2334 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2336 /* dump the out edges in a separate walk */
2337 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2338 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2343 current_ir_graph = rem;
2346 /* Dump a firm graph without explicit block nodes. */
2347 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2353 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2356 if (get_interprocedural_view()) suffix1 = "-ip";
2358 f = vcg_open(irg, suffix, suffix1);
2359 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2361 construct_block_lists(irg);
2364 * If we are in the interprocedural view, we dump not
2365 * only the requested irg but also all irgs that can be reached
2368 for (i = 0; i < get_irp_n_irgs(); i++) {
2369 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2371 dump_graph_from_list(f, get_irp_irg(i));
2379 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2380 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2387 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2392 if (get_interprocedural_view()) suffix1 = "-ip";
2395 ent = get_irg_entity(irg);
2397 F = vcg_open(irg, suffix, suffix1);
2398 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2400 construct_extblock_lists(irg);
2402 fprintf(F, "graph: { title: \"");
2404 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2405 get_ent_dump_name(ent));
2407 dump_graph_info(F, irg);
2408 print_dbg_info(F, get_entity_dbg_info(ent));
2410 for (i = 0; i < get_irp_n_irgs(); i++) {
2411 ir_graph *irg = get_irp_irg(i);
2412 list_tuple *lists = ird_get_irg_link(irg);
2415 /* dump the extended blocks first */
2416 if (ARR_LEN(lists->extbb_list)) {
2417 ird_set_irg_link(irg, lists->extbb_list);
2418 dump_extblock_graph(F, irg);
2421 /* we may have blocks without extended blocks, bad for instance */
2422 if (ARR_LEN(lists->blk_list)) {
2423 ird_set_irg_link(irg, lists->blk_list);
2424 dump_block_graph(F, irg);
2427 DEL_ARR_F(lists->extbb_list);
2428 DEL_ARR_F(lists->blk_list);
2433 /* Close the vcg information for the irg */
2434 fprintf(F, "}\n\n");
2440 /* dumps a graph with type information */
2442 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2445 ir_graph *rem = current_ir_graph;
2447 int rem_dump_const_local;
2449 /* if a filter is set, dump only the irg's that match the filter */
2450 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2453 current_ir_graph = irg;
2454 rem_dump_const_local = dump_const_local;
2455 /* dumping types does not work with local nodes */
2456 dump_const_local = 0;
2458 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2459 else suffix1 = "-pure-wtypes";
2460 f = vcg_open(irg,suffix, suffix1);
2461 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2463 /* dump common ir graph */
2464 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2465 /* dump type info */
2466 type_walk_irg(irg, dump_type_info, NULL, f);
2467 inc_irg_visited(get_const_code_irg());
2468 /* dump edges from graph to type info */
2469 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2472 dump_const_local = rem_dump_const_local;
2473 current_ir_graph = rem;
2477 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2482 ir_graph *rem = current_ir_graph;
2483 int rem_dump_const_local;
2485 /* if a filter is set, dump only the irg's that match the filter */
2486 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2489 rem_dump_const_local = dump_const_local;
2490 /* dumping types does not work with local nodes */
2491 dump_const_local = 0;
2493 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2494 else suffix1 = "-wtypes";
2495 f = vcg_open(irg, suffix, suffix1);
2496 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2498 /* dump common blocked ir graph */
2499 construct_block_lists(irg);
2501 for (i = 0; i < get_irp_n_irgs(); i++) {
2502 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2504 dump_graph_from_list(f, get_irp_irg(i));
2509 /* dump type info */
2510 current_ir_graph = irg;
2511 type_walk_irg(irg, dump_type_info, NULL, f);
2512 inc_irg_visited(get_const_code_irg());
2514 /* dump edges from graph to type info */
2515 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2518 dump_const_local = rem_dump_const_local;
2519 current_ir_graph = rem;
2522 /*---------------------------------------------------------------------*/
2523 /* The following routines dump a control flow graph. */
2524 /*---------------------------------------------------------------------*/
2527 dump_block_to_cfg(ir_node *block, void *env) {
2532 if (is_Block(block)) {
2533 /* This is a block. Dump a node for the block. */
2534 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2535 fprintf (F, "\" label: \"");
2536 if (block == get_irg_start_block(get_irn_irg(block)))
2537 fprintf(F, "Start ");
2538 if (block == get_irg_end_block(get_irn_irg(block)))
2541 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2542 PRINT_NODEID(block);
2544 fprintf(F, "info1:\"");
2546 /* the generic version. */
2547 dump_irnode_to_file(F, block);
2549 /* Check whether we have bad predecessors to color the block. */
2550 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2551 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2554 fprintf (F, "\""); /* closing quote of info */
2556 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2557 (block == get_irg_end_block(get_irn_irg(block))) )
2558 fprintf(F, " color:blue ");
2560 fprintf(F, " color:yellow ");
2563 /* Dump the edges */
2564 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2565 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2566 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2567 fprintf (F, "edge: { sourcename: \"");
2568 PRINT_NODEID(block);
2569 fprintf (F, "\" targetname: \"");
2571 fprintf (F, "\"}\n");
2574 /* Dump dominator/postdominator edge */
2575 if (dump_dominator_information_flag) {
2576 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2577 pred = get_Block_idom(block);
2578 fprintf (F, "edge: { sourcename: \"");
2579 PRINT_NODEID(block);
2580 fprintf (F, "\" targetname: \"");
2582 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2584 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2585 pred = get_Block_ipostdom(block);
2586 fprintf (F, "edge: { sourcename: \"");
2587 PRINT_NODEID(block);
2588 fprintf (F, "\" targetname: \"");
2590 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2597 dump_cfg (ir_graph *irg, const char *suffix)
2600 ir_graph *rem = current_ir_graph;
2601 int ipv = get_interprocedural_view();
2603 /* if a filter is set, dump only the irg's that match the filter */
2604 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2607 current_ir_graph = irg;
2609 f = vcg_open(irg, suffix, "-cfg");
2610 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2613 printf("Warning: dumping cfg not in interprocedural view!\n");
2614 set_interprocedural_view(0);
2617 /* walk over the blocks in the graph */
2618 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2619 dump_node(f, get_irg_bad(irg));
2621 set_interprocedural_view(ipv);
2623 current_ir_graph = rem;
2627 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2628 if (pset_find_ptr(mark_set, n)) return;
2630 pset_insert_ptr(mark_set, n);
2633 int i, start = is_Block(n) ? 0 : -1;
2634 dump_whole_node(n, F);
2635 for (i = start; i < get_irn_arity(n); ++i)
2636 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2639 /* Don't dump edges to nodes further out. These might be edges to
2640 nodes we already dumped, if there is a shorter path to these. */
2644 static int subgraph_counter = 0;
2645 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2648 pset *mark_set = pset_new_ptr(1);
2649 sprintf(buf, "-subg_%03d", subgraph_counter++);
2650 F = vcg_open(get_irn_irg(root), suffix, buf);
2651 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2652 descend_and_dump(F, root, depth, mark_set);
2658 static int weight_overall(int rec, int loop) {
2659 return 2*rec + loop;
2662 static int compute_color (int my, int max) {
2669 /* if small, scale to the full color range. */
2671 my = my * (n_colors/max);
2673 step = 1 + (max / n_colors);
2677 return base_color + n_colors - color;
2680 static int get_entity_color(entity *ent) {
2681 ir_graph *irg = get_entity_irg(ent);
2685 int rec_depth = get_irg_recursion_depth(irg);
2686 int loop_depth = get_irg_loop_depth(irg);
2687 int overall_depth = weight_overall(rec_depth, loop_depth);
2689 int max_rec_depth = irp->max_callgraph_recursion_depth;
2690 int max_loop_depth = irp->max_callgraph_loop_depth;
2691 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2693 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2694 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2695 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2697 return my_overall_color;
2701 void dump_callgraph(const char *suffix) {
2703 int i, n_irgs = get_irp_n_irgs();
2704 int rem = edge_label;
2706 //ident *prefix = new_id_from_str("java/");
2708 F = vcg_open_name("Callgraph", suffix);
2709 dump_vcg_header(F, "Callgraph", NULL);
2711 for (i = 0; i < n_irgs; ++i) {
2712 ir_graph *irg = get_irp_irg(i);
2713 entity *ent = get_irg_entity(irg);
2714 int j, n_callees = get_irg_n_callees(irg);
2716 /* Do not dump runtime system. */
2717 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2719 dump_entity_node(F, ent, get_entity_color(ent));
2720 for (j = 0; j < n_callees; ++j) {
2721 entity *c = get_irg_entity(get_irg_callee(irg, j));
2722 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2723 int be = is_irg_callee_backedge(irg, j);
2726 "label:\"recursion %d\" color:%d" :
2727 "label:\"calls %d\" color:%d";
2728 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2736 /* Dump all irgs in interprocedural view to a single file. */
2737 void dump_all_cg_block_graph(const char *suffix) {
2740 int rem_view = get_interprocedural_view();
2741 set_interprocedural_view(1);
2743 f = vcg_open_name("All_graphs", suffix);
2744 dump_vcg_header(f, "All_graphs", NULL);
2746 /* collect nodes in all irgs reachable in call graph*/
2747 for (i = 0; i < get_irp_n_irgs(); i++)
2748 ird_set_irg_link(get_irp_irg(i), NULL);
2750 cg_walk(clear_link, collect_node, NULL);
2752 /* dump all graphs */
2753 for (i = 0; i < get_irp_n_irgs(); i++) {
2754 current_ir_graph = get_irp_irg(i);
2755 assert(ird_get_irg_link(current_ir_graph));
2756 dump_graph_from_list(f, current_ir_graph);
2757 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2761 set_interprocedural_view(rem_view);
2764 /*---------------------------------------------------------------------*/
2765 /* the following routines dumps type information without any ir nodes. */
2766 /*---------------------------------------------------------------------*/
2769 dump_type_graph (ir_graph *irg, const char *suffix)
2773 rem = current_ir_graph;
2775 /* if a filter is set, dump only the irg's that match the filter */
2776 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2778 current_ir_graph = irg;
2780 f = vcg_open(irg, suffix, "-type");
2781 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2783 /* walk over the blocks in the graph */
2784 type_walk_irg(irg, dump_type_info, NULL, f);
2785 /* The walker for the const code can be called several times for the
2786 same (sub) expression. So that no nodes are dumped several times
2787 we decrease the visited flag of the corresponding graph after each
2788 walk. So now increase it finally. */
2789 inc_irg_visited(get_const_code_irg());
2792 current_ir_graph = rem;
2796 dump_all_types (const char *suffix)
2798 FILE *f = vcg_open_name("All_types", suffix);
2799 dump_vcg_header(f, "All_types", NULL);
2800 type_walk(dump_type_info, NULL, f);
2801 inc_irg_visited(get_const_code_irg());
2806 dump_class_hierarchy (int entities, const char *suffix)
2808 FILE *f = vcg_open_name("class_hierarchy", suffix);
2812 env.dump_ent = entities;
2813 dump_vcg_header(f, "class_hierarchy", NULL);
2814 type_walk(dump_class_hierarchy_node, NULL, &env);
2818 /*---------------------------------------------------------------------*/
2819 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2821 /* dump_ir_block_graph */
2823 /* dump_type_graph */
2824 /* dump_ir_graph_w_types */
2825 /*---------------------------------------------------------------------*/
2827 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2829 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2830 dmp_grph(get_irp_irg(i), suffix);
2835 /*--------------------------------------------------------------------------------*
2836 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2837 * packed together in one subgraph/box *
2838 *--------------------------------------------------------------------------------*/
2840 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2841 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2843 ir_loop *son = NULL;
2845 /* Dump a new loop node. */
2846 dump_loop_node(F, loop);
2848 /* Dump the loop elements. */
2850 for(i = 0; i < get_loop_n_elements(loop); i++) {
2851 le = get_loop_element(loop, i);
2853 if (get_kind(son) == k_ir_loop) {
2855 /* We are a loop son -> Recurse */
2857 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2858 fprintf(F, "\" }\n");
2859 fprintf (F, "edge: {sourcename: \"");
2861 fprintf (F, "\" targetname: \"");
2863 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2864 loop_node_started = 0;
2866 dump_loop_son_edge(F, loop, son_number++);
2867 dump_loops_standalone(F, son);
2868 } else if (get_kind(son) == k_ir_node) {
2869 /* We are a loop node -> Collect firm nodes */
2871 ir_node *n = le.node;
2874 if (!loop_node_started) {
2875 /* Start a new node which contains all firm nodes of the current loop */
2876 fprintf (F, "node: { title: \"");
2878 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2879 loop_node_started = 1;
2885 bad |= dump_node_label(F, n);
2886 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2887 if (has_backedges(n)) fprintf(F, "\t loop head!");
2888 } else { /* for callgraph loop tree */
2890 assert(get_kind(son) == k_ir_graph);
2892 /* We are a loop node -> Collect firm graphs */
2893 n = (ir_graph *)le.node;
2894 if (!loop_node_started) {
2895 /* Start a new node which contains all firm nodes of the current loop */
2896 fprintf (F, "node: { title: \"");
2898 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2899 loop_node_started = 1;
2904 fprintf (F, " %s", get_irg_dump_name(n));
2905 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2909 if (loop_node_started) {
2910 fprintf(F, "\" }\n");
2911 fprintf (F, "edge: {sourcename: \"");
2913 fprintf (F, "\" targetname: \"");
2915 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2916 loop_node_started = 0;
2920 void dump_loop_tree(ir_graph *irg, const char *suffix)
2923 ir_graph *rem = current_ir_graph;
2924 int el_rem = edge_label;
2927 /* if a filter is set, dump only the irg's that match the filter */
2928 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2930 current_ir_graph = irg;
2932 f = vcg_open(irg, suffix, "-looptree");
2933 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2935 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2939 edge_label = el_rem;
2940 current_ir_graph = rem;
2943 void dump_callgraph_loop_tree(const char *suffix) {
2945 F = vcg_open_name("Callgraph_looptree", suffix);
2946 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2947 dump_loops_standalone(F, irp->outermost_cg_loop);
2952 /*-----------------------------------------------------------------------------*/
2953 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2954 /*-----------------------------------------------------------------------------*/
2956 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2957 int i, son_number = 0, node_number = 0;
2959 if (dump_loop_information_flag) dump_loop_node(F, loop);
2961 for (i = 0; i < get_loop_n_elements(loop); i++) {
2962 loop_element le = get_loop_element(loop, i);
2963 if (*(le.kind) == k_ir_loop) {
2964 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2966 collect_nodeloop(F, le.son, loopnodes);
2968 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2969 eset_insert(loopnodes, le.node);
2974 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2977 for(i = 0; i < get_loop_n_elements(loop); i++) {
2978 loop_element le = get_loop_element(loop, i);
2979 if (*(le.kind) == k_ir_loop) {
2981 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2983 if (is_Block(le.node)) start = 0; else start = -1;
2984 for (j = start; j < get_irn_arity(le.node); j++) {
2985 ir_node *pred = get_irn_n(le.node, j);
2986 if (!eset_contains(loopnodes, pred)) {
2987 eset_insert(extnodes, pred);
2988 if (!is_Block(pred)) {
2989 pred = get_nodes_block(pred);
2990 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2998 void dump_loop(ir_loop *l, const char *suffix) {
3001 eset *loopnodes = eset_create();
3002 eset *extnodes = eset_create();
3005 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3006 F = vcg_open_name (name, suffix);
3007 dump_vcg_header(F, name, NULL);
3009 /* collect all nodes to dump */
3010 collect_nodeloop(F, l, loopnodes);
3011 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3013 /* build block lists */
3014 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3015 set_irn_link(n, NULL);
3016 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3017 set_irn_link(n, NULL);
3018 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3020 b = get_nodes_block(n);
3021 set_irn_link(n, get_irn_link(b));
3024 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3026 b = get_nodes_block(n);
3027 set_irn_link(n, get_irn_link(b));
3031 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3033 fprintf(F, "graph: { title: \"");
3035 fprintf(F, "\" label: \"");
3036 dump_node_opcode(F, b);
3037 fprintf (F, " %ld", get_irn_node_nr(b));
3038 fprintf(F, "\" status:clustered color:yellow\n");
3040 /* dump the blocks edges */
3041 dump_ir_data_edges(F, b);
3043 /* dump the nodes that go into the block */
3044 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3045 if (eset_contains(extnodes, n))
3046 overrule_nodecolor = ird_color_lightblue;
3048 overrule_nodecolor = ird_color_default;
3049 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3052 /* Close the vcg information for the block */
3054 dump_const_node_local(F, b);
3057 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3059 fprintf(F, "graph: { title: \"");
3061 fprintf(F, "\" label: \"");
3062 dump_node_opcode(F, b);
3063 fprintf (F, " %ld", get_irn_node_nr(b));
3064 fprintf(F, "\" status:clustered color:lightblue\n");
3066 /* dump the nodes that go into the block */
3067 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3068 if (!eset_contains(loopnodes, n))
3069 overrule_nodecolor = ird_color_lightblue;
3071 overrule_nodecolor = ird_color_default;
3072 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3075 /* Close the vcg information for the block */
3077 dump_const_node_local(F, b);
3081 eset_destroy(loopnodes);
3082 eset_destroy(extnodes);