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 = get_irp_n_irgs() - 1; i >= 0; --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 inc_irg_block_visited(irg);
579 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
582 if (is_Block(blk_list[i])) {
583 ext = get_Block_extbb(blk_list[i]);
585 if (extbb_not_visited(ext)) {
586 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
587 mark_extbb_visited(ext);
591 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
595 current_ir_graph = rem;
596 ird_set_irg_link(irg, lists);
600 /*-----------------------------------------------------------------*/
601 /* Routines to dump information about a single ir node. */
602 /*-----------------------------------------------------------------*/
605 * dump the name of a node n to the File F.
607 int dump_node_opcode(FILE *F, ir_node *n)
610 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
612 /* call the dump_node operation if available */
614 return ops->dump_node(n, F, dump_node_opcode_txt);
616 /* implementation for default nodes */
617 switch (get_irn_opcode(n)) {
622 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
623 assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
628 if (get_SymConst_kind(n) == symconst_addr_name) {
629 /* don't use get_SymConst_ptr_info as it mangles the name. */
630 fprintf (F, "SymC %s", get_id_str(get_SymConst_name(n)));
631 } else if (get_SymConst_kind(n) == symconst_addr_ent) {
632 assert(get_SymConst_entity(n));
633 assert(is_entity(get_SymConst_entity(n)));
634 fprintf (F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
636 assert(get_kind(get_SymConst_type(n)) == k_type);
637 assert(get_type_ident(get_SymConst_type(n)));
638 fprintf (F, "SymC %s ", get_type_name_ex(get_SymConst_type(n), &bad));
639 if (get_SymConst_kind(n) == symconst_type_tag)
647 if (!get_interprocedural_view())
654 ir_node *pred = get_Proj_pred(n);
656 if (get_irn_opcode(pred) == iro_Cond
657 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
658 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
659 fprintf (F, "defProj");
667 if (get_interprocedural_view()) {
668 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
673 case iro_CallBegin: {
674 ir_node *addr = get_CallBegin_ptr(n);
676 if (get_irn_op(addr) == op_Sel)
677 ent = get_Sel_entity(addr);
678 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
679 ent = get_SymConst_entity(addr);
680 fprintf (F, "%s", get_irn_opname(n));
681 if (ent) fprintf (F, " %s", get_entity_name(ent));
685 fprintf (F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
688 fprintf (F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
693 fprintf (F, "%s", get_irn_opname(n));
700 * Dump the mode of a node n to a file F.
701 * Ignore modes that are "always known".
703 static int dump_node_mode(FILE *F, ir_node *n)
706 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
709 /* call the dump_node operation if available */
711 return ops->dump_node(n, F, dump_node_mode_txt);
713 /* default implementation */
714 iro = get_irn_opcode(n);
726 ir_mode *mode = get_irn_mode(n);
728 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
729 (mode != mode_T || iro == iro_Proj))
730 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
738 * Dump the type of a node n to a file F if it's known.
740 static int dump_node_typeinfo(FILE *F, ir_node *n) {
743 if (opt_dump_analysed_type_info) {
744 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
745 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
746 ir_type *tp = get_irn_typeinfo_type(n);
747 if (tp != firm_none_type)
748 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
756 typedef struct _pns_lookup {
757 long nr; /**< the proj number */
758 const char *name; /**< the name of the Proj */
761 typedef struct _proj_lookup {
762 opcode code; /**< the opcode of the Proj predecessor */
763 unsigned num_data; /**< number of data entries */
764 const pns_lookup_t *data; /**< the data */
767 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
769 /** the lookup table for Proj(Start) names */
770 static const pns_lookup_t start_lut[] = {
771 #define X(a) { pn_Start_##a, #a }
780 /** the lookup table for Proj(Cond) names */
781 static const pns_lookup_t cond_lut[] = {
782 #define X(a) { pn_Cond_##a, #a }
788 /** the lookup table for Proj(Call) names */
789 static const pns_lookup_t call_lut[] = {
790 #define X(a) { pn_Call_##a, #a }
799 /** the lookup table for Proj(Quot) names */
800 static const pns_lookup_t quot_lut[] = {
801 #define X(a) { pn_Quot_##a, #a }
808 /** the lookup table for Proj(DivMod) names */
809 static const pns_lookup_t divmod_lut[] = {
810 #define X(a) { pn_DivMod_##a, #a }
818 /** the lookup table for Proj(Div) names */
819 static const pns_lookup_t div_lut[] = {
820 #define X(a) { pn_Div_##a, #a }
827 /** the lookup table for Proj(Mod) names */
828 static const pns_lookup_t mod_lut[] = {
829 #define X(a) { pn_Mod_##a, #a }
836 /** the lookup table for Proj(Load) names */
837 static const pns_lookup_t load_lut[] = {
838 #define X(a) { pn_Load_##a, #a }
845 /** the lookup table for Proj(Store) names */
846 static const pns_lookup_t store_lut[] = {
847 #define X(a) { pn_Store_##a, #a }
853 /** the lookup table for Proj(Alloc) names */
854 static const pns_lookup_t alloc_lut[] = {
855 #define X(a) { pn_Alloc_##a, #a }
862 /** the lookup table for Proj(CopyB) names */
863 static const pns_lookup_t copyb_lut[] = {
864 #define X(a) { pn_CopyB_##a, #a }
871 /** the lookup table for Proj(InstOf) names */
872 static const pns_lookup_t instof_lut[] = {
873 #define X(a) { pn_InstOf_##a, #a }
881 /** the lookup table for Proj(Raise) names */
882 static const pns_lookup_t raise_lut[] = {
883 #define X(a) { pn_Raise_##a, #a }
889 /** the lookup table for Proj(Bound) names */
890 static const pns_lookup_t bound_lut[] = {
891 #define X(a) { pn_Bound_##a, #a }
899 /** the Proj lookup table */
900 static const proj_lookup_t proj_lut[] = {
901 #define E(a) ARR_SIZE(a), a
902 { iro_Start, E(start_lut) },
903 { iro_Cond, E(cond_lut) },
904 { iro_Call, E(call_lut) },
905 { iro_Quot, E(quot_lut) },
906 { iro_DivMod, E(divmod_lut) },
907 { iro_Div, E(div_lut) },
908 { iro_Mod, E(mod_lut) },
909 { iro_Load, E(load_lut) },
910 { iro_Store, E(store_lut) },
911 { iro_Alloc, E(alloc_lut) },
912 { iro_CopyB, E(copyb_lut) },
913 { iro_InstOf, E(instof_lut) },
914 { iro_Raise, E(raise_lut) },
915 { iro_Bound, E(bound_lut) }
920 * Dump additional node attributes of some nodes to a file F.
923 dump_node_nodeattr(FILE *F, ir_node *n)
929 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
931 /* call the dump_node operation if available */
933 return ops->dump_node(n, F, dump_node_nodeattr_txt);
935 switch (get_irn_opcode(n)) {
937 if (0 && get_interprocedural_view()) {
938 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
943 pred = get_Proj_pred(n);
944 proj_nr = get_Proj_proj(n);
946 code = get_irn_opcode(pred);
949 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
950 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
951 fprintf (F, "Arg %ld ", proj_nr);
952 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
953 fprintf (F, "%ld ", proj_nr);
955 unsigned i, j, f = 0;
957 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
958 if (code == proj_lut[i].code) {
959 for (j = 0; j < proj_lut[i].num_data; ++j) {
960 if (proj_nr == proj_lut[i].data[j].nr) {
961 fprintf (F, "%s ", proj_lut[i].data[j].name);
970 fprintf (F, "%ld ", proj_nr);
971 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
972 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
974 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
980 proj_nr = get_Filter_proj(n);
981 if (! get_interprocedural_view()) {
983 pred = get_Filter_pred(n);
987 fprintf (F, "%ld ", proj_nr);
990 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
993 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
996 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
999 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1010 #include "execution_frequency.h"
1011 #include "callgraph.h"
1013 void dump_node_ana_vals(FILE *F, ir_node *n) {
1015 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1016 get_irn_exec_freq(n),
1017 get_irg_method_execution_frequency(get_irn_irg(n)),
1018 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1019 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1024 /* Dumps a node label without the enclosing ". */
1025 int dump_node_label(FILE *F, ir_node *n) {
1028 bad |= dump_node_opcode(F, n);
1029 bad |= dump_node_mode(F, n);
1031 bad |= dump_node_typeinfo(F, n);
1032 bad |= dump_node_nodeattr(F, n);
1033 fprintf(F, "%ld", get_irn_node_nr(n));
1040 * Dumps the attributes of a node n into the file F.
1041 * Currently this is only the color of a node.
1043 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1048 print_vcg_color(F, ird_color_red);
1052 if (dump_node_vcgattr_hook)
1053 if (dump_node_vcgattr_hook(F, node, local))
1056 n = local ? local : node;
1058 if (overrule_nodecolor != ird_color_default) {
1059 print_vcg_color(F, overrule_nodecolor);
1063 switch (get_irn_opcode(n)) {
1070 print_vcg_color(F, ird_color_blue);
1073 if (is_Block_dead(n))
1074 print_vcg_color(F, ird_color_lightred);
1076 print_vcg_color(F, ird_color_lightyellow);
1079 print_vcg_color(F, ird_color_green);
1085 print_vcg_color(F, ird_color_yellow);
1088 PRINT_DEFAULT_NODE_ATTR;
1094 * Dump the node information of a node n to a file F.
1096 static INLINE int dump_node_info(FILE *F, ir_node *n)
1099 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1101 fprintf (F, " info1: \"");
1102 bad = dump_irnode_to_file(F, n);
1103 /* call the dump_node operation if available */
1105 bad = ops->dump_node(n, F, dump_node_info_txt);
1112 * checks whether a node is "constant-like" ie can be treated "block-less"
1115 int is_constlike_node(ir_node *n) {
1116 ir_op *op = get_irn_op(n);
1117 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1121 /** outputs the predecessors of n, that are constants, local. I.e.,
1122 generates a copy of the constant predecessors for each node called with. */
1123 static void dump_const_node_local(FILE *F, ir_node *n) {
1125 if (!get_opt_dump_const_local()) return;
1127 /* Use visited flag to avoid outputting nodes twice.
1128 initialize it first. */
1129 for (i = 0; i < get_irn_arity(n); i++) {
1130 ir_node *con = get_irn_n(n, i);
1131 if (is_constlike_node(con)) {
1132 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1136 for (i = 0; i < get_irn_arity(n); i++) {
1137 ir_node *con = get_irn_n(n, i);
1138 if (is_constlike_node(con) && irn_not_visited(con)) {
1141 mark_irn_visited(con);
1142 /* Generate a new name for the node by appending the names of
1144 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1145 fprintf(F, " label: \"");
1146 bad |= dump_node_label(F, con);
1148 bad |= dump_node_info(F, con);
1149 dump_node_vcgattr(F, n, con, bad);
1155 /** If the block of an edge is a const_like node, dump it local with an edge */
1156 static void dump_const_block_local(FILE *F, ir_node *n) {
1159 if (!get_opt_dump_const_local()) return;
1161 blk = get_nodes_block(n);
1162 if (is_constlike_node(blk)) {
1165 /* Generate a new name for the node by appending the names of
1167 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1168 fprintf(F, "\" label: \"");
1169 bad |= dump_node_label(F, blk);
1171 bad |= dump_node_info(F, blk);
1172 dump_node_vcgattr(F, n, blk, bad);
1175 fprintf (F, "edge: { sourcename: \"");
1177 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1179 if (dump_edge_vcgattr_hook) {
1181 if (dump_edge_vcgattr_hook(F, n, -1)) {
1186 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1191 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1196 * prints the error message of a node to a file F as info2.
1198 static void INLINE print_node_error(FILE *F, const char *err_msg)
1203 fprintf (F, " info2: \"%s\"", err_msg);
1207 * prints debug messages of a node to file F as info3.
1209 static void print_dbg_info(FILE *F, dbg_info *dbg)
1213 if (__dbg_info_snprint) {
1215 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1216 fprintf (F, " info3: \"%s\"\n", buf);
1223 static void dump_node(FILE *F, ir_node *n)
1228 if (get_opt_dump_const_local() && is_constlike_node(n))
1231 /* dump this node */
1232 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1234 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1235 bad |= dump_node_label(F, n);
1236 dump_node_ana_vals(F, n);
1237 //dump_node_ana_info(F, n);
1239 bad |= dump_node_info(F, n);
1240 print_node_error(F, p);
1241 print_dbg_info(F, get_irn_dbg_info(n));
1242 dump_node_vcgattr(F, n, NULL, bad);
1244 dump_const_node_local(F, n);
1246 if(dump_node_edge_hook)
1247 dump_node_edge_hook(F, n);
1249 dump_irn_chi_term(F, n);
1250 dump_irn_state(F, n);
1254 /** dump the edge to the block this node belongs to */
1256 dump_ir_block_edge(FILE *F, ir_node *n) {
1257 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1258 if (is_no_Block(n)) {
1259 ir_node *block = get_nodes_block(n);
1261 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1262 dump_const_block_local(F, n);
1265 fprintf (F, "edge: { sourcename: \"");
1267 fprintf (F, "\" targetname: ");
1268 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1270 if (dump_edge_vcgattr_hook) {
1272 if (dump_edge_vcgattr_hook(F, n, -1)) {
1277 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1282 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1288 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1290 * do not use get_nodes_block() here, will fail
1291 * if the irg is not pinned.
1293 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1294 fprintf (F, INTRA_DATA_EDGE_ATTR);
1296 fprintf (F, INTER_DATA_EDGE_ATTR);
1300 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1302 * do not use get_nodes_block() here, will fail
1303 * if the irg is not pinned.
1305 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1306 fprintf (F, INTRA_MEM_EDGE_ATTR);
1308 fprintf (F, INTER_MEM_EDGE_ATTR);
1312 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1315 if (dump_edge_vcgattr_hook)
1316 if (dump_edge_vcgattr_hook(F, from, to))
1319 if (dump_backedge_information_flag && is_backedge(from, to))
1320 fprintf (F, BACK_EDGE_ATTR);
1322 switch (get_irn_opcode(from)) {
1324 fprintf (F, CF_EDGE_ATTR);
1326 case iro_Start: break;
1329 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1330 fprintf (F, CF_EDGE_ATTR);
1331 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1332 fprintf (F, INTER_MEM_EDGE_ATTR);
1336 if (is_Proj(from)) {
1337 if (get_irn_mode(from) == mode_M)
1338 print_mem_edge_vcgattr(F, from, to);
1339 else if (get_irn_mode(from) == mode_X)
1340 fprintf(F, CF_EDGE_ATTR);
1342 print_data_edge_vcgattr(F, from, to);
1344 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1345 print_mem_edge_vcgattr(F, from, to);
1346 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1347 fprintf (F, CF_EDGE_ATTR);
1349 print_data_edge_vcgattr(F, from, to);
1353 /* dump edges to our inputs */
1355 dump_ir_data_edges(FILE *F, ir_node *n) {
1357 unsigned long visited = get_irn_visited(n);
1359 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1362 for (i = 0; i < get_irn_arity(n); i++) {
1363 ir_node * pred = get_irn_n(n, i);
1366 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1367 continue; /* pred not dumped */
1369 if (dump_backedge_information_flag && is_backedge(n, i))
1370 fprintf (F, "backedge: {sourcename: \"");
1372 fprintf (F, "edge: {sourcename: \"");
1374 fprintf (F, "\" targetname: ");
1375 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1376 PRINT_CONSTID(n, pred);
1378 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1380 fprintf (F, " label: \"%d\" ", i);
1381 print_edge_vcgattr(F, n, i);
1386 /** Dumps a node and its edges but not the block edge
1389 dump_node_wo_blockedge (ir_node *n, void *env) {
1392 dump_ir_data_edges(F, n);
1395 /** Dumps a node and its edges.
1398 dump_whole_node (ir_node *n, void *env) {
1400 dump_node_wo_blockedge(n, env);
1401 if (!node_floats(n)) dump_ir_block_edge(F, n);
1405 dump_const_node(ir_node *n, void *env) {
1406 if (is_Block(n)) return;
1407 dump_node_wo_blockedge(n, env);
1410 /***********************************************************************/
1411 /* the following routines dump the nodes/irgs bracketed to graphs. */
1412 /***********************************************************************/
1414 /** Dumps a constant expression as entity initializer, array bound ...
1416 static void dump_const_expression(FILE *F, ir_node *value) {
1417 ir_graph *rem = current_ir_graph;
1418 int rem_dump_const_local = dump_const_local;
1419 dump_const_local = 0;
1420 current_ir_graph = get_const_code_irg();
1421 irg_walk(value, dump_const_node, NULL, F);
1422 /* Decrease visited flag so that we walk with the same flag for the next
1423 expression. This guarantees that we don't dump the same node twice,
1424 as for const expressions cse is performed to save memory. */
1425 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1426 current_ir_graph = rem;
1427 dump_const_local = rem_dump_const_local;
1430 /** Dump a block as graph containing its nodes.
1432 * Expects to find nodes belonging to the block as list in its
1434 * Dumps the edges of all nodes including itself. */
1436 dump_whole_block(FILE *F, ir_node *block) {
1438 dumper_colors color = ird_color_yellow;
1440 assert(is_Block(block));
1442 fprintf(F, "graph: { title: \"");
1443 PRINT_NODEID(block);
1444 fprintf(F, "\" label: \"");
1445 dump_node_label(F, block);
1447 if (get_opt_dump_abstvals())
1448 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1451 /* colorize blocks */
1452 if (! get_Block_matured(block))
1453 color = ird_color_red;
1454 if (is_Block_dead(block))
1455 color = ird_color_orange;
1457 fprintf(F, "\" status:clustered ");
1458 print_vcg_color(F, color);
1461 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1462 dump_node_info(F, block);
1463 print_dbg_info(F, get_irn_dbg_info(block));
1465 /* dump the blocks edges */
1466 dump_ir_data_edges(F, block);
1468 /* dump the nodes that go into the block */
1469 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1471 dump_ir_data_edges(F, node);
1474 /* Close the vcg information for the block */
1476 dump_const_node_local(F, block);
1478 dump_irn_chi_term(F, block);
1483 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1484 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1486 dump_block_graph(FILE *F, ir_graph *irg) {
1488 ir_graph *rem = current_ir_graph;
1489 ir_node **arr = ird_get_irg_link(irg);
1490 current_ir_graph = irg;
1492 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1493 ir_node * node = arr[i];
1494 if (is_Block(node)) {
1495 /* Dumps the block and all the nodes in the block, which are to
1496 be found in Block->link. */
1497 dump_whole_block(F, node);
1499 /* Nodes that are not in a Block. */
1501 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1502 dump_const_block_local(F, node);
1504 dump_ir_data_edges(F, node);
1508 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1509 dump_loop_nodes_into_graph(F, irg);
1511 current_ir_graph = rem;
1515 * Dump the info for an irg.
1516 * Parsed by XVCG but not shown. use yComp.
1518 static void dump_graph_info(FILE *F, ir_graph *irg) {
1519 fprintf(F, "info1: \"");
1520 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1524 /** Dumps an irg as a graph clustered by block nodes.
1525 * If interprocedural view edges can point to nodes out of this graph.
1527 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1528 entity *ent = get_irg_entity(irg);
1530 fprintf(F, "graph: { title: \"");
1532 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1533 get_ent_dump_name(ent));
1535 dump_graph_info(F, irg);
1536 print_dbg_info(F, get_entity_dbg_info(ent));
1538 dump_block_graph(F, irg);
1540 /* Close the vcg information for the irg */
1541 fprintf(F, "}\n\n");
1544 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1545 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1547 dump_extblock_graph(FILE *F, ir_graph *irg) {
1549 ir_graph *rem = current_ir_graph;
1550 ir_extblk **arr = ird_get_irg_link(irg);
1551 current_ir_graph = irg;
1554 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1555 ir_extblk *extbb = arr[i];
1556 ir_node *leader = get_extbb_leader(extbb);
1559 fprintf(F, "graph: { title: \"");
1560 PRINT_EXTBBID(leader);
1561 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1562 get_irn_node_nr(leader));
1564 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1565 ir_node * node = extbb->blks[j];
1566 if (is_Block(node)) {
1567 /* Dumps the block and all the nodes in the block, which are to
1568 be found in Block->link. */
1569 dump_whole_block(F, node);
1571 /* Nodes that are not in a Block. */
1573 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1574 dump_const_block_local(F, node);
1576 dump_ir_data_edges(F, node);
1582 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1583 dump_loop_nodes_into_graph(F, irg);
1585 current_ir_graph = rem;
1590 /*******************************************************************/
1591 /* Basic type and entity nodes and edges. */
1592 /*******************************************************************/
1594 /** dumps the edges between nodes and their type or entity attributes. */
1595 static void dump_node2type_edges(ir_node *n, void *env)
1600 switch (get_irn_opcode(n)) {
1602 /* @@@ some consts have an entity */
1605 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1606 || (get_SymConst_kind(n) ==symconst_size))
1608 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1612 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1615 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1618 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1621 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1624 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1632 static int print_type_info(FILE *F, ir_type *tp) {
1635 if (get_type_state(tp) == layout_undefined) {
1636 fprintf(F, "state: layout_undefined\n");
1638 fprintf(F, "state: layout_fixed,\n");
1640 if (get_type_mode(tp))
1641 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1642 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1647 static void print_typespecific_info(FILE *F, ir_type *tp) {
1648 switch (get_type_tpop_code(tp)) {
1651 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1658 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1659 fprintf(F, "params: %d\n", get_method_n_params(tp));
1660 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1668 case tpo_enumeration:
1682 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1683 switch (get_type_tpop_code(tp)) {
1686 if (peculiarity_existent == get_class_peculiarity(tp))
1687 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1689 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1693 fprintf (F, " " TYPE_METH_NODE_ATTR);
1704 case tpo_enumeration:
1718 int dump_type_node(FILE *F, ir_type *tp)
1722 fprintf (F, "node: {title: ");
1724 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1725 fprintf (F, " info1: \"");
1727 bad |= print_type_info(F, tp);
1728 print_typespecific_info(F, tp);
1730 dump_type_to_file(F, tp, dump_verbosity_max);
1732 fprintf (F, "\"\n");
1733 print_dbg_info(F, get_type_dbg_info(tp));
1734 print_typespecific_vcgattr(F, tp);
1741 #define X(a) case a: fprintf(F, #a); break
1742 void dump_entity_node(FILE *F, entity *ent, int color)
1744 fprintf (F, "node: {title: \"");
1745 PRINT_ENTID(ent); fprintf(F, "\"");
1746 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1747 fprintf (F, "label: ");
1748 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1750 fprintf(F, "color:%d", color);
1752 fprintf (F, ENTITY_NODE_ATTR);
1753 fprintf (F, "\n info1: \"");
1755 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1758 print_dbg_info(F, get_entity_dbg_info(ent));
1763 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1766 ident *id = get_enumeration_nameid(tp, pos);
1767 tarval *tv = get_enumeration_enum(tp, pos);
1769 tarval_snprintf(buf, sizeof(buf), tv);
1770 fprintf (F, "node: {title: \"");
1771 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1772 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1773 fprintf (F, "label: ");
1774 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1775 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1778 /* dumps a type or entity and it's edges. */
1780 dump_type_info(type_or_ent *tore, void *env) {
1782 int i = 0; /* to shutup gcc */
1784 /* dump this type or entity */
1786 switch (get_kind(tore)) {
1789 entity *ent = (entity *)tore;
1792 dump_entity_node(F, ent, 0);
1794 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1795 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1796 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1797 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1798 if (is_Class_type(get_entity_owner(ent))) {
1799 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1800 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1802 /* attached subgraphs */
1803 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1804 if (is_atomic_entity(ent)) {
1805 value = get_atomic_ent_value(ent);
1807 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1808 /* DDMN(value); $$$ */
1809 dump_const_expression(F, value);
1812 if (is_compound_entity(ent)) {
1813 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1814 value = get_compound_ent_value(ent, i);
1816 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1817 dump_const_expression(F, value);
1818 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1820 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1821 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1822 get_compound_ent_value_member(ent, i), i);
1831 ir_type *tp = (ir_type *)tore;
1832 dump_type_node(F, tp);
1833 /* and now the edges */
1834 switch (get_type_tpop_code(tp)) {
1837 for (i=0; i < get_class_n_supertypes(tp); i++)
1838 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1839 for (i=0; i < get_class_n_members(tp); i++)
1840 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1844 for (i=0; i < get_struct_n_members(tp); i++)
1845 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1849 for (i = 0; i < get_method_n_params(tp); i++)
1850 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1851 for (i = 0; i < get_method_n_ress(tp); i++)
1852 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1856 for (i = 0; i < get_union_n_members(tp); i++)
1857 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1861 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1862 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1863 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1864 ir_node *upper = get_array_upper_bound(tp, i);
1865 ir_node *lower = get_array_lower_bound(tp, i);
1866 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1867 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1868 dump_const_expression(F, upper);
1869 dump_const_expression(F, lower);
1873 case tpo_enumeration:
1875 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1876 dump_enum_item(F, tp, i);
1877 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1882 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1890 break; /* case k_type */
1893 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1895 } /* switch kind_or_entity */
1898 typedef struct _h_env {
1903 /** For dumping class hierarchies.
1904 * Dumps a class type node and a superclass edge.
1905 * If env->dump_ent dumps entities of classes and overwrites edges.
1908 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1911 int i = 0; /* to shutup gcc */
1913 /* dump this type or entity */
1914 switch (get_kind(tore)) {
1916 entity *ent = (entity *)tore;
1917 if (get_entity_owner(ent) == get_glob_type()) break;
1918 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1919 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1921 dump_entity_node(F, ent, 0);
1923 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1924 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1925 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
1927 } break; /* case k_entity */
1930 ir_type *tp = (ir_type *)tore;
1931 if (tp == get_glob_type()) break;
1932 switch (get_type_tpop_code(tp)) {
1934 dump_type_node(F, tp);
1935 /* and now the edges */
1936 for (i=0; i < get_class_n_supertypes(tp); i++)
1938 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1944 break; /* case k_type */
1947 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1949 } /* switch kind_or_entity */
1952 /*******************************************************************/
1953 /* dump analysis information that is expressed in graph terms. */
1954 /*******************************************************************/
1956 /* dump out edges */
1958 dump_out_edge(ir_node *n, void *env) {
1961 for (i = 0; i < get_irn_n_outs(n); i++) {
1962 assert(get_irn_out(n, i));
1963 fprintf (F, "edge: {sourcename: \"");
1965 fprintf (F, "\" targetname: \"");
1966 PRINT_NODEID(get_irn_out(n, i));
1967 fprintf (F, "\" color: red linestyle: dashed");
1973 dump_loop_label(FILE *F, ir_loop *loop) {
1974 fprintf (F, "loop %d, %d sons, %d nodes",
1975 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
1978 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
1979 fprintf (F, " info1: \"");
1980 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
1981 #if DEBUG_libfirm /* GL @@@ debug analyses */
1982 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
1988 dump_loop_node(FILE *F, ir_loop *loop) {
1989 fprintf (F, "node: {title: \"");
1991 fprintf (F, "\" label: \"");
1992 dump_loop_label(F, loop);
1994 dump_loop_info(F, loop);
2000 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2002 fprintf (F, "edge: {sourcename: \"");
2004 fprintf (F, "\" targetname: \"");
2005 PRINT_NODEID(get_loop_node(loop, i));
2006 fprintf (F, "\" color: green");
2011 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2013 fprintf (F, "edge: {sourcename: \"");
2015 fprintf (F, "\" targetname: \"");
2016 PRINT_LOOPID(get_loop_son(loop, i));
2017 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2018 get_loop_element_pos(loop, get_loop_son(loop, i)));
2022 void dump_loops(FILE *F, ir_loop *loop) {
2024 /* dump this loop node */
2025 dump_loop_node(F, loop);
2027 /* dump edges to nodes in loop -- only if it is a real loop */
2028 if (get_loop_depth(loop) != 0) {
2029 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2030 dump_loop_node_edge(F, loop, i);
2033 for (i = 0; i < get_loop_n_sons(loop); i++) {
2034 dump_loops(F, get_loop_son(loop, i));
2035 dump_loop_son_edge(F, loop, i);
2040 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2041 ir_graph *rem = current_ir_graph;
2042 current_ir_graph = irg;
2044 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2046 current_ir_graph = rem;
2051 * dumps the VCG header
2053 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2062 if (!orientation) orientation = "bottom_to_top";
2066 "graph: { title: \"ir graph of %s\"\n"
2067 "display_edge_labels: %s\n"
2068 "layoutalgorithm: mindepth\n"
2069 "manhattan_edges: yes\n"
2070 "port_sharing: no\n"
2072 "classname 1: \"intrablock Data\"\n"
2073 "classname 2: \"Block\"\n"
2074 "classname 3: \"Entity type\"\n"
2075 "classname 4: \"Entity owner\"\n"
2076 "classname 5: \"Method Param\"\n"
2077 "classname 6: \"Method Res\"\n"
2078 "classname 7: \"Super\"\n"
2079 "classname 8: \"Union\"\n"
2080 "classname 9: \"Points-to\"\n"
2081 "classname 10: \"Array Element Type\"\n"
2082 "classname 11: \"Overwrites\"\n"
2083 "classname 12: \"Member\"\n"
2084 "classname 13: \"Control Flow\"\n"
2085 "classname 14: \"intrablock Memory\"\n"
2086 "classname 15: \"Dominators\"\n"
2087 "classname 16: \"interblock Data\"\n"
2088 "classname 17: \"interblock Memory\"\n"
2089 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2090 "classname 19: \"Postdominators\"\n"
2091 "infoname 1: \"Attribute\"\n"
2092 "infoname 2: \"Verification errors\"\n"
2093 "infoname 3: \"Debug info\"\n",
2094 name, label, orientation);
2096 /* don't use all, the range is too whith/black. */
2100 "colorentry 100: 0 0 0\n"
2101 "colorentry 101: 20 0 0\n"
2102 "colorentry 102: 40 0 0\n"
2103 "colorentry 103: 60 0 0\n"
2104 "colorentry 104: 80 0 0\n"
2105 "colorentry 105: 100 0 0\n"
2106 "colorentry 106: 120 0 0\n"
2107 "colorentry 107: 140 0 0\n"
2108 "colorentry 108: 150 0 0\n"
2109 "colorentry 109: 180 0 0\n"
2110 "colorentry 110: 200 0 0\n"
2111 "colorentry 111: 220 0 0\n"
2112 "colorentry 112: 240 0 0\n"
2113 "colorentry 113: 255 0 0\n"
2114 "colorentry 113: 255 20 20\n"
2115 "colorentry 114: 255 40 40\n"
2116 "colorentry 115: 255 60 60\n"
2117 "colorentry 116: 255 80 80\n"
2118 "colorentry 117: 255 100 100\n"
2119 "colorentry 118: 255 120 120\n"
2120 "colorentry 119: 255 140 140\n"
2121 "colorentry 120: 255 150 150\n"
2122 "colorentry 121: 255 180 180\n"
2123 "colorentry 122: 255 200 200\n"
2124 "colorentry 123: 255 220 220\n"
2125 "colorentry 124: 255 240 240\n"
2126 "colorentry 125: 255 250 250\n"
2129 fprintf (F, "\n"); /* a separator */
2135 * @param irg The graph to be dumped
2136 * @param suffix1 first filename suffix
2137 * @param suffix2 second filename suffix
2139 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2141 const char *nm = get_irg_dump_name(irg);
2142 int len = strlen(nm), i, j;
2143 char *fname; /* filename to put the vcg information in */
2145 if (!suffix1) suffix1 = "";
2146 if (!suffix2) suffix2 = "";
2148 /* open file for vcg graph */
2149 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2151 /* strncpy (fname, nm, len); */ /* copy the filename */
2153 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2155 fname[j] = '@'; j++; fname[j] = '1'; j++;
2156 } else if (nm[i] == '@') {
2157 fname[j] = '@'; j++; fname[j] = '2'; j++;
2159 fname[j] = nm[i]; j++;
2163 strcat (fname, suffix1); /* append file suffix */
2164 strcat (fname, suffix2); /* append file suffix */
2165 strcat (fname, ".vcg"); /* append the .vcg suffix */
2167 /* vcg really expect only a <CR> at end of line, so
2168 * the "b"inary mode is what you mean (and even needed for Win32)
2170 F = fopen (fname, "wb"); /* open file for writing */
2172 panic("cannot open %s for writing (%m)", fname); /* not reached */
2182 * @param name prefix file name
2183 * @param suffix filename suffix
2185 FILE *vcg_open_name (const char *name, const char *suffix) {
2187 char *fname; /* filename to put the vcg information in */
2188 int i, j, len = strlen(name);
2190 if (!suffix) suffix = "";
2192 /** open file for vcg graph */
2193 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2194 /* strcpy (fname, name);*/ /* copy the filename */
2196 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2197 if (name[i] == '/') {
2198 fname[j] = '@'; j++; fname[j] = '1'; j++;
2199 } else if (name[i] == '@') {
2200 fname[j] = '@'; j++; fname[j] = '2'; j++;
2202 fname[j] = name[i]; j++;
2206 strcat (fname, suffix);
2207 strcat (fname, ".vcg"); /* append the .vcg suffix */
2209 /* vcg really expect only a <CR> at end of line, so
2210 * the "b"inary mode is what you mean (and even needed for Win32)
2212 F = fopen (fname, "wb"); /* open file for writing */
2214 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2222 * Dumps the vcg file footer
2224 static INLINE void dump_vcg_footer (FILE *F) {
2229 * close the vcg file
2231 void vcg_close (FILE *F) {
2232 dump_vcg_footer(F); /* print footer */
2233 fclose (F); /* close vcg file */
2236 /************************************************************************/
2237 /************************************************************************/
2238 /* Routines that dump all or parts of the firm representation to a file */
2239 /************************************************************************/
2240 /************************************************************************/
2242 /************************************************************************/
2243 /* Dump ir graphs, different formats and additional information. */
2244 /************************************************************************/
2246 /** Routine to dump a graph, blocks as conventional nodes. */
2248 dump_ir_graph (ir_graph *irg, const char *suffix )
2253 rem = current_ir_graph;
2255 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2257 current_ir_graph = irg;
2258 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2259 else suffix1 = "-pure";
2260 f = vcg_open(irg, suffix, suffix1);
2261 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2263 /* call the dump graph hook */
2264 if (dump_ir_graph_hook)
2265 if (dump_ir_graph_hook(f, irg))
2268 /* walk over the graph */
2269 /* dump_whole_node must be called in post visiting predecessors */
2270 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2272 /* dump the out edges in a separate walk */
2273 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2274 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2279 current_ir_graph = rem;
2282 /* Dump a firm graph without explicit block nodes. */
2283 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2289 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2292 if (get_interprocedural_view()) suffix1 = "-ip";
2294 f = vcg_open(irg, suffix, suffix1);
2295 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2297 construct_block_lists(irg);
2300 * If we are in the interprocedural view, we dump not
2301 * only the requested irg but also all irgs that can be reached
2304 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2305 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2307 dump_graph_from_list(f, get_irp_irg(i));
2315 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2316 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2323 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2328 if (get_interprocedural_view()) suffix1 = "-ip";
2331 ent = get_irg_entity(irg);
2333 F = vcg_open(irg, suffix, suffix1);
2334 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2336 construct_extblock_lists(irg);
2338 fprintf(F, "graph: { title: \"");
2340 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2341 get_ent_dump_name(ent));
2343 dump_graph_info(F, irg);
2344 print_dbg_info(F, get_entity_dbg_info(ent));
2346 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2347 ir_graph *irg = get_irp_irg(i);
2348 list_tuple *lists = ird_get_irg_link(irg);
2351 /* dump the extended blocks first */
2352 if (ARR_LEN(lists->extbb_list)) {
2353 ird_set_irg_link(irg, lists->extbb_list);
2354 dump_extblock_graph(F, irg);
2357 /* we may have blocks without extended blocks, bad for instance */
2358 if (ARR_LEN(lists->blk_list)) {
2359 ird_set_irg_link(irg, lists->blk_list);
2360 dump_block_graph(F, irg);
2363 DEL_ARR_F(lists->extbb_list);
2364 DEL_ARR_F(lists->blk_list);
2369 /* Close the vcg information for the irg */
2370 fprintf(F, "}\n\n");
2376 /* dumps a graph with type information */
2378 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2381 ir_graph *rem = current_ir_graph;
2383 int rem_dump_const_local;
2385 /* if a filter is set, dump only the irg's that match the filter */
2386 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2389 current_ir_graph = irg;
2390 rem_dump_const_local = dump_const_local;
2391 /* dumping types does not work with local nodes */
2392 dump_const_local = 0;
2394 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2395 else suffix1 = "-pure-wtypes";
2396 f = vcg_open(irg,suffix, suffix1);
2397 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2399 /* dump common ir graph */
2400 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2401 /* dump type info */
2402 type_walk_irg(irg, dump_type_info, NULL, f);
2403 inc_irg_visited(get_const_code_irg());
2404 /* dump edges from graph to type info */
2405 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2408 dump_const_local = rem_dump_const_local;
2409 current_ir_graph = rem;
2413 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2418 ir_graph *rem = current_ir_graph;
2419 int rem_dump_const_local;
2421 /* if a filter is set, dump only the irg's that match the filter */
2422 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2425 rem_dump_const_local = dump_const_local;
2426 /* dumping types does not work with local nodes */
2427 dump_const_local = 0;
2429 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2430 else suffix1 = "-wtypes";
2431 f = vcg_open(irg, suffix, suffix1);
2432 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2434 /* dump common blocked ir graph */
2435 construct_block_lists(irg);
2437 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2438 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2440 dump_graph_from_list(f, get_irp_irg(i));
2445 /* dump type info */
2446 current_ir_graph = irg;
2447 type_walk_irg(irg, dump_type_info, NULL, f);
2448 inc_irg_visited(get_const_code_irg());
2450 /* dump edges from graph to type info */
2451 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2454 dump_const_local = rem_dump_const_local;
2455 current_ir_graph = rem;
2458 /*---------------------------------------------------------------------*/
2459 /* The following routines dump a control flow graph. */
2460 /*---------------------------------------------------------------------*/
2463 dump_block_to_cfg(ir_node *block, void *env) {
2468 if (is_Block(block)) {
2469 /* This is a block. Dump a node for the block. */
2470 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2471 fprintf (F, "\" label: \"");
2472 if (block == get_irg_start_block(get_irn_irg(block)))
2473 fprintf(F, "Start ");
2474 if (block == get_irg_end_block(get_irn_irg(block)))
2477 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2478 PRINT_NODEID(block);
2480 fprintf(F, "info1:\"");
2482 /* the generic version. */
2483 dump_irnode_to_file(F, block);
2485 /* Check whether we have bad predecessors to color the block. */
2486 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2487 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2490 fprintf (F, "\""); /* closing quote of info */
2492 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2493 (block == get_irg_end_block(get_irn_irg(block))) )
2494 fprintf(F, " color:blue ");
2496 fprintf(F, " color:yellow ");
2499 /* Dump the edges */
2500 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2501 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2502 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2503 fprintf (F, "edge: { sourcename: \"");
2504 PRINT_NODEID(block);
2505 fprintf (F, "\" targetname: \"");
2507 fprintf (F, "\"}\n");
2510 /* Dump dominator/postdominator edge */
2511 if (dump_dominator_information_flag) {
2512 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2513 pred = get_Block_idom(block);
2514 fprintf (F, "edge: { sourcename: \"");
2515 PRINT_NODEID(block);
2516 fprintf (F, "\" targetname: \"");
2518 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2520 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2521 pred = get_Block_ipostdom(block);
2522 fprintf (F, "edge: { sourcename: \"");
2523 PRINT_NODEID(block);
2524 fprintf (F, "\" targetname: \"");
2526 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2533 dump_cfg (ir_graph *irg, const char *suffix)
2536 ir_graph *rem = current_ir_graph;
2537 int ipv = get_interprocedural_view();
2539 /* if a filter is set, dump only the irg's that match the filter */
2540 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2543 current_ir_graph = irg;
2545 f = vcg_open(irg, suffix, "-cfg");
2546 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2549 printf("Warning: dumping cfg not in interprocedural view!\n");
2550 set_interprocedural_view(0);
2553 /* walk over the blocks in the graph */
2554 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2555 dump_node(f, get_irg_bad(irg));
2557 set_interprocedural_view(ipv);
2559 current_ir_graph = rem;
2563 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2564 if (pset_find_ptr(mark_set, n)) return;
2566 pset_insert_ptr(mark_set, n);
2569 int i, start = is_Block(n) ? 0 : -1;
2570 dump_whole_node(n, F);
2571 for (i = start; i < get_irn_arity(n); ++i)
2572 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2575 /* Don't dump edges to nodes further out. These might be edges to
2576 nodes we already dumped, if there is a shorter path to these. */
2580 static int subgraph_counter = 0;
2581 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2584 pset *mark_set = pset_new_ptr(1);
2585 sprintf(buf, "-subg_%03d", subgraph_counter++);
2586 F = vcg_open(get_irn_irg(root), suffix, buf);
2587 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2588 descend_and_dump(F, root, depth, mark_set);
2594 static int weight_overall(int rec, int loop) {
2595 return 2*rec + loop;
2598 static int compute_color (int my, int max) {
2605 /* if small, scale to the full color range. */
2607 my = my * (n_colors/max);
2609 step = 1 + (max / n_colors);
2613 return base_color + n_colors - color;
2616 static int get_entity_color(entity *ent) {
2617 ir_graph *irg = get_entity_irg(ent);
2621 int rec_depth = get_irg_recursion_depth(irg);
2622 int loop_depth = get_irg_loop_depth(irg);
2623 int overall_depth = weight_overall(rec_depth, loop_depth);
2625 int max_rec_depth = irp->max_callgraph_recursion_depth;
2626 int max_loop_depth = irp->max_callgraph_loop_depth;
2627 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2629 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2630 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2631 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2633 return my_overall_color;
2637 void dump_callgraph(const char *suffix) {
2640 int rem = edge_label;
2642 //ident *prefix = new_id_from_str("java/");
2644 F = vcg_open_name("Callgraph", suffix);
2645 dump_vcg_header(F, "Callgraph", NULL);
2647 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2648 ir_graph *irg = get_irp_irg(i);
2649 entity *ent = get_irg_entity(irg);
2650 int j, n_callees = get_irg_n_callees(irg);
2652 /* Do not dump runtime system. */
2653 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2655 dump_entity_node(F, ent, get_entity_color(ent));
2656 for (j = 0; j < n_callees; ++j) {
2657 entity *c = get_irg_entity(get_irg_callee(irg, j));
2658 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2659 int be = is_irg_callee_backedge(irg, j);
2662 "label:\"recursion %d\" color:%d" :
2663 "label:\"calls %d\" color:%d";
2664 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2672 /* Dump all irgs in interprocedural view to a single file. */
2673 void dump_all_cg_block_graph(const char *suffix) {
2676 int rem_view = get_interprocedural_view();
2677 set_interprocedural_view(1);
2679 f = vcg_open_name("All_graphs", suffix);
2680 dump_vcg_header(f, "All_graphs", NULL);
2682 /* collect nodes in all irgs reachable in call graph*/
2683 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2684 ird_set_irg_link(get_irp_irg(i), NULL);
2686 cg_walk(clear_link, collect_node, NULL);
2688 /* dump all graphs */
2689 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2690 current_ir_graph = get_irp_irg(i);
2691 assert(ird_get_irg_link(current_ir_graph));
2692 dump_graph_from_list(f, current_ir_graph);
2693 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2697 set_interprocedural_view(rem_view);
2700 /*---------------------------------------------------------------------*/
2701 /* the following routines dumps type information without any ir nodes. */
2702 /*---------------------------------------------------------------------*/
2705 dump_type_graph (ir_graph *irg, const char *suffix)
2709 rem = current_ir_graph;
2711 /* if a filter is set, dump only the irg's that match the filter */
2712 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2714 current_ir_graph = irg;
2716 f = vcg_open(irg, suffix, "-type");
2717 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2719 /* walk over the blocks in the graph */
2720 type_walk_irg(irg, dump_type_info, NULL, f);
2721 /* The walker for the const code can be called several times for the
2722 same (sub) expression. So that no nodes are dumped several times
2723 we decrease the visited flag of the corresponding graph after each
2724 walk. So now increase it finally. */
2725 inc_irg_visited(get_const_code_irg());
2728 current_ir_graph = rem;
2732 dump_all_types (const char *suffix)
2734 FILE *f = vcg_open_name("All_types", suffix);
2735 dump_vcg_header(f, "All_types", NULL);
2736 type_walk(dump_type_info, NULL, f);
2737 inc_irg_visited(get_const_code_irg());
2742 dump_class_hierarchy (int entities, const char *suffix)
2744 FILE *f = vcg_open_name("class_hierarchy", suffix);
2748 env.dump_ent = entities;
2749 dump_vcg_header(f, "class_hierarchy", NULL);
2750 type_walk(dump_class_hierarchy_node, NULL, &env);
2754 /*---------------------------------------------------------------------*/
2755 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2757 /* dump_ir_block_graph */
2759 /* dump_type_graph */
2760 /* dump_ir_graph_w_types */
2761 /*---------------------------------------------------------------------*/
2763 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2765 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2766 dmp_grph(get_irp_irg(i), suffix);
2770 /*--------------------------------------------------------------------------------*
2771 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2772 * packed together in one subgraph/box *
2773 *--------------------------------------------------------------------------------*/
2775 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2776 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2778 ir_loop *son = NULL;
2780 /* Dump a new loop node. */
2781 dump_loop_node(F, loop);
2783 /* Dump the loop elements. */
2785 for(i = 0; i < get_loop_n_elements(loop); i++) {
2786 le = get_loop_element(loop, i);
2788 if (get_kind(son) == k_ir_loop) {
2790 /* We are a loop son -> Recurse */
2792 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2793 fprintf(F, "\" }\n");
2794 fprintf (F, "edge: {sourcename: \"");
2796 fprintf (F, "\" targetname: \"");
2798 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2799 loop_node_started = 0;
2801 dump_loop_son_edge(F, loop, son_number++);
2802 dump_loops_standalone(F, son);
2803 } else if (get_kind(son) == k_ir_node) {
2804 /* We are a loop node -> Collect firm nodes */
2806 ir_node *n = le.node;
2809 if (!loop_node_started) {
2810 /* Start a new node which contains all firm nodes of the current loop */
2811 fprintf (F, "node: { title: \"");
2813 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2814 loop_node_started = 1;
2820 bad |= dump_node_label(F, n);
2821 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2822 if (has_backedges(n)) fprintf(F, "\t loop head!");
2823 } else { /* for callgraph loop tree */
2825 assert(get_kind(son) == k_ir_graph);
2827 /* We are a loop node -> Collect firm graphs */
2828 n = (ir_graph *)le.node;
2829 if (!loop_node_started) {
2830 /* Start a new node which contains all firm nodes of the current loop */
2831 fprintf (F, "node: { title: \"");
2833 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2834 loop_node_started = 1;
2839 fprintf (F, " %s", get_irg_dump_name(n));
2840 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2844 if (loop_node_started) {
2845 fprintf(F, "\" }\n");
2846 fprintf (F, "edge: {sourcename: \"");
2848 fprintf (F, "\" targetname: \"");
2850 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2851 loop_node_started = 0;
2855 void dump_loop_tree(ir_graph *irg, const char *suffix)
2858 ir_graph *rem = current_ir_graph;
2859 int el_rem = edge_label;
2862 /* if a filter is set, dump only the irg's that match the filter */
2863 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2865 current_ir_graph = irg;
2867 f = vcg_open(irg, suffix, "-looptree");
2868 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2870 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2874 edge_label = el_rem;
2875 current_ir_graph = rem;
2878 void dump_callgraph_loop_tree(const char *suffix) {
2880 F = vcg_open_name("Callgraph_looptree", suffix);
2881 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2882 dump_loops_standalone(F, irp->outermost_cg_loop);
2887 /*-----------------------------------------------------------------------------*/
2888 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2889 /*-----------------------------------------------------------------------------*/
2891 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2892 int i, son_number = 0, node_number = 0;
2894 if (dump_loop_information_flag) dump_loop_node(F, loop);
2896 for (i = 0; i < get_loop_n_elements(loop); i++) {
2897 loop_element le = get_loop_element(loop, i);
2898 if (*(le.kind) == k_ir_loop) {
2899 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2901 collect_nodeloop(F, le.son, loopnodes);
2903 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2904 eset_insert(loopnodes, le.node);
2909 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2912 for(i = 0; i < get_loop_n_elements(loop); i++) {
2913 loop_element le = get_loop_element(loop, i);
2914 if (*(le.kind) == k_ir_loop) {
2916 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2918 if (is_Block(le.node)) start = 0; else start = -1;
2919 for (j = start; j < get_irn_arity(le.node); j++) {
2920 ir_node *pred = get_irn_n(le.node, j);
2921 if (!eset_contains(loopnodes, pred)) {
2922 eset_insert(extnodes, pred);
2923 if (!is_Block(pred)) {
2924 pred = get_nodes_block(pred);
2925 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2933 void dump_loop(ir_loop *l, const char *suffix) {
2936 eset *loopnodes = eset_create();
2937 eset *extnodes = eset_create();
2940 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
2941 F = vcg_open_name (name, suffix);
2942 dump_vcg_header(F, name, NULL);
2944 /* collect all nodes to dump */
2945 collect_nodeloop(F, l, loopnodes);
2946 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
2948 /* build block lists */
2949 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
2950 set_irn_link(n, NULL);
2951 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
2952 set_irn_link(n, NULL);
2953 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
2955 b = get_nodes_block(n);
2956 set_irn_link(n, get_irn_link(b));
2959 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
2961 b = get_nodes_block(n);
2962 set_irn_link(n, get_irn_link(b));
2966 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
2968 fprintf(F, "graph: { title: \"");
2970 fprintf(F, "\" label: \"");
2971 dump_node_opcode(F, b);
2972 fprintf (F, " %ld", get_irn_node_nr(b));
2973 fprintf(F, "\" status:clustered color:yellow\n");
2975 /* dump the blocks edges */
2976 dump_ir_data_edges(F, b);
2978 /* dump the nodes that go into the block */
2979 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
2980 if (eset_contains(extnodes, n))
2981 overrule_nodecolor = ird_color_lightblue;
2983 overrule_nodecolor = ird_color_default;
2984 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
2987 /* Close the vcg information for the block */
2989 dump_const_node_local(F, b);
2992 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
2994 fprintf(F, "graph: { title: \"");
2996 fprintf(F, "\" label: \"");
2997 dump_node_opcode(F, b);
2998 fprintf (F, " %ld", get_irn_node_nr(b));
2999 fprintf(F, "\" status:clustered color:lightblue\n");
3001 /* dump the nodes that go into the block */
3002 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3003 if (!eset_contains(loopnodes, n))
3004 overrule_nodecolor = ird_color_lightblue;
3006 overrule_nodecolor = ird_color_default;
3007 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3010 /* Close the vcg information for the block */
3012 dump_const_node_local(F, b);
3016 eset_destroy(loopnodes);
3017 eset_destroy(extnodes);