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 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(InstOf) names */
871 static const pns_lookup_t instof_lut[] = {
872 #define X(a) { pn_InstOf_##a, #a }
880 /** the lookup table for Proj(Raise) names */
881 static const pns_lookup_t raise_lut[] = {
882 #define X(a) { pn_Raise_##a, #a }
888 /** the lookup table for Proj(Bound) names */
889 static const pns_lookup_t bound_lut[] = {
890 #define X(a) { pn_Bound_##a, #a }
898 /** the Proj lookup table */
899 static const proj_lookup_t proj_lut[] = {
900 #define E(a) ARR_SIZE(a), a
901 { iro_Start, E(start_lut) },
902 { iro_Cond, E(cond_lut) },
903 { iro_Call, E(call_lut) },
904 { iro_Quot, E(quot_lut) },
905 { iro_DivMod, E(divmod_lut) },
906 { iro_Div, E(div_lut) },
907 { iro_Mod, E(mod_lut) },
908 { iro_Load, E(load_lut) },
909 { iro_Store, E(store_lut) },
910 { iro_Alloc, E(alloc_lut) },
911 { iro_CopyB, E(copyb_lut) },
912 { iro_InstOf, E(instof_lut) },
913 { iro_Raise, E(raise_lut) },
914 { iro_Bound, E(bound_lut) }
919 * Dump additional node attributes of some nodes to a file F.
922 dump_node_nodeattr(FILE *F, ir_node *n)
928 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
930 /* call the dump_node operation if available */
932 return ops->dump_node(n, F, dump_node_nodeattr_txt);
934 switch (get_irn_opcode(n)) {
936 if (0 && get_interprocedural_view()) {
937 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
942 pred = get_Proj_pred(n);
943 proj_nr = get_Proj_proj(n);
945 code = get_irn_opcode(pred);
948 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
949 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
950 fprintf (F, "Arg %ld ", proj_nr);
951 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
952 fprintf (F, "%ld ", proj_nr);
954 unsigned i, j, f = 0;
956 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
957 if (code == proj_lut[i].code) {
958 for (j = 0; j < proj_lut[i].num_data; ++j) {
959 if (proj_nr == proj_lut[i].data[j].nr) {
960 fprintf (F, "%s ", proj_lut[i].data[j].name);
969 fprintf (F, "%ld ", proj_nr);
970 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
971 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
973 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
979 proj_nr = get_Filter_proj(n);
980 if (! get_interprocedural_view()) {
982 pred = get_Filter_pred(n);
986 fprintf (F, "%ld ", proj_nr);
989 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
992 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
995 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
998 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1009 #include "execution_frequency.h"
1010 #include "callgraph.h"
1012 void dump_node_ana_vals(FILE *F, ir_node *n) {
1014 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1015 get_irn_exec_freq(n),
1016 get_irg_method_execution_frequency(get_irn_irg(n)),
1017 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1018 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1023 /* Dumps a node label without the enclosing ". */
1024 int dump_node_label(FILE *F, ir_node *n) {
1027 bad |= dump_node_opcode(F, n);
1028 bad |= dump_node_mode(F, n);
1030 bad |= dump_node_typeinfo(F, n);
1031 bad |= dump_node_nodeattr(F, n);
1032 fprintf(F, "%ld", get_irn_node_nr(n));
1039 * Dumps the attributes of a node n into the file F.
1040 * Currently this is only the color of a node.
1042 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1047 print_vcg_color(F, ird_color_red);
1051 if (dump_node_vcgattr_hook)
1052 if (dump_node_vcgattr_hook(F, node, local))
1055 n = local ? local : node;
1057 if (overrule_nodecolor != ird_color_default) {
1058 print_vcg_color(F, overrule_nodecolor);
1062 switch (get_irn_opcode(n)) {
1069 print_vcg_color(F, ird_color_blue);
1072 if (is_Block_dead(n))
1073 print_vcg_color(F, ird_color_lightred);
1075 print_vcg_color(F, ird_color_lightyellow);
1078 print_vcg_color(F, ird_color_green);
1084 print_vcg_color(F, ird_color_yellow);
1087 PRINT_DEFAULT_NODE_ATTR;
1093 * Dump the node information of a node n to a file F.
1095 static INLINE int dump_node_info(FILE *F, ir_node *n)
1098 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1100 fprintf (F, " info1: \"");
1101 bad = dump_irnode_to_file(F, n);
1102 /* call the dump_node operation if available */
1104 bad = ops->dump_node(n, F, dump_node_info_txt);
1111 * checks whether a node is "constant-like" ie can be treated "block-less"
1114 int is_constlike_node(ir_node *n) {
1115 ir_op *op = get_irn_op(n);
1116 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1120 /** outputs the predecessors of n, that are constants, local. I.e.,
1121 generates a copy of the constant predecessors for each node called with. */
1122 static void dump_const_node_local(FILE *F, ir_node *n) {
1124 if (!get_opt_dump_const_local()) return;
1126 /* Use visited flag to avoid outputting nodes twice.
1127 initialize it first. */
1128 for (i = 0; i < get_irn_arity(n); i++) {
1129 ir_node *con = get_irn_n(n, i);
1130 if (is_constlike_node(con)) {
1131 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1135 for (i = 0; i < get_irn_arity(n); i++) {
1136 ir_node *con = get_irn_n(n, i);
1137 if (is_constlike_node(con) && irn_not_visited(con)) {
1140 mark_irn_visited(con);
1141 /* Generate a new name for the node by appending the names of
1143 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1144 fprintf(F, " label: \"");
1145 bad |= dump_node_label(F, con);
1147 bad |= dump_node_info(F, con);
1148 dump_node_vcgattr(F, n, con, bad);
1154 /** If the block of an edge is a const_like node, dump it local with an edge */
1155 static void dump_const_block_local(FILE *F, ir_node *n) {
1158 if (!get_opt_dump_const_local()) return;
1160 blk = get_nodes_block(n);
1161 if (is_constlike_node(blk)) {
1164 /* Generate a new name for the node by appending the names of
1166 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1167 fprintf(F, "\" label: \"");
1168 bad |= dump_node_label(F, blk);
1170 bad |= dump_node_info(F, blk);
1171 dump_node_vcgattr(F, n, blk, bad);
1174 fprintf (F, "edge: { sourcename: \"");
1176 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1178 if (dump_edge_vcgattr_hook) {
1180 if (dump_edge_vcgattr_hook(F, n, -1)) {
1185 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1190 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1195 * prints the error message of a node to a file F as info2.
1197 static void INLINE print_node_error(FILE *F, const char *err_msg)
1202 fprintf (F, " info2: \"%s\"", err_msg);
1206 * prints debug messages of a node to file F as info3.
1208 static void print_dbg_info(FILE *F, dbg_info *dbg)
1212 if (__dbg_info_snprint) {
1214 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1215 fprintf (F, " info3: \"%s\"\n", buf);
1222 static void dump_node(FILE *F, ir_node *n)
1227 if (get_opt_dump_const_local() && is_constlike_node(n))
1230 /* dump this node */
1231 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1233 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1234 bad |= dump_node_label(F, n);
1235 dump_node_ana_vals(F, n);
1236 //dump_node_ana_info(F, n);
1238 bad |= dump_node_info(F, n);
1239 print_node_error(F, p);
1240 print_dbg_info(F, get_irn_dbg_info(n));
1241 dump_node_vcgattr(F, n, NULL, bad);
1243 dump_const_node_local(F, n);
1245 if(dump_node_edge_hook)
1246 dump_node_edge_hook(F, n);
1248 dump_irn_chi_term(F, n);
1249 dump_irn_state(F, n);
1253 /** dump the edge to the block this node belongs to */
1255 dump_ir_block_edge(FILE *F, ir_node *n) {
1256 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1257 if (is_no_Block(n)) {
1258 ir_node *block = get_nodes_block(n);
1260 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1261 dump_const_block_local(F, n);
1264 fprintf (F, "edge: { sourcename: \"");
1266 fprintf (F, "\" targetname: ");
1267 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1269 if (dump_edge_vcgattr_hook) {
1271 if (dump_edge_vcgattr_hook(F, n, -1)) {
1276 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1281 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1287 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1289 * do not use get_nodes_block() here, will fail
1290 * if the irg is not pinned.
1292 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1293 fprintf (F, INTRA_DATA_EDGE_ATTR);
1295 fprintf (F, INTER_DATA_EDGE_ATTR);
1299 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1301 * do not use get_nodes_block() here, will fail
1302 * if the irg is not pinned.
1304 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1305 fprintf (F, INTRA_MEM_EDGE_ATTR);
1307 fprintf (F, INTER_MEM_EDGE_ATTR);
1311 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1314 if (dump_edge_vcgattr_hook)
1315 if (dump_edge_vcgattr_hook(F, from, to))
1318 if (dump_backedge_information_flag && is_backedge(from, to))
1319 fprintf (F, BACK_EDGE_ATTR);
1321 switch (get_irn_opcode(from)) {
1323 fprintf (F, CF_EDGE_ATTR);
1325 case iro_Start: break;
1328 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1329 fprintf (F, CF_EDGE_ATTR);
1330 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1331 fprintf (F, INTER_MEM_EDGE_ATTR);
1339 print_data_edge_vcgattr(F, from, to);
1344 print_mem_edge_vcgattr(F, from, to);
1346 print_data_edge_vcgattr(F, from, to);
1350 print_data_edge_vcgattr(F, from, to);
1355 print_mem_edge_vcgattr(F, from, to);
1357 print_data_edge_vcgattr(F, from, to);
1364 print_data_edge_vcgattr(F, from, to);
1371 print_mem_edge_vcgattr(F, from, to);
1373 print_data_edge_vcgattr(F, from, to);
1385 print_data_edge_vcgattr(F, from, to);
1388 if (get_irn_modecode(from) == irm_M)
1389 fprintf (F, INTER_MEM_EDGE_ATTR);
1391 print_data_edge_vcgattr(F, from, to);
1398 print_mem_edge_vcgattr(F, from, to);
1400 print_data_edge_vcgattr(F, from, to);
1403 print_mem_edge_vcgattr(F, from, to);
1405 case iro_Tuple: break;
1408 switch (get_irn_modecode(from)) {
1410 fprintf (F, CF_EDGE_ATTR);
1413 fprintf (F, INTER_MEM_EDGE_ATTR);
1416 print_data_edge_vcgattr(F, from, to);
1420 case iro_Bad: break;
1421 case iro_Unknown: break;
1423 switch (get_irn_modecode(from)) {
1425 fprintf (F, INTRA_MEM_EDGE_ATTR);
1428 fprintf (F, CF_EDGE_ATTR);
1431 print_data_edge_vcgattr(F, from, to);
1439 /* dump edges to our inputs */
1441 dump_ir_data_edges(FILE *F, ir_node *n) {
1443 unsigned long visited = get_irn_visited(n);
1445 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1448 for (i = 0; i < get_irn_arity(n); i++) {
1449 ir_node * pred = get_irn_n(n, i);
1452 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1453 continue; /* pred not dumped */
1455 if (dump_backedge_information_flag && is_backedge(n, i))
1456 fprintf (F, "backedge: {sourcename: \"");
1458 fprintf (F, "edge: {sourcename: \"");
1460 fprintf (F, "\" targetname: ");
1461 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1462 PRINT_CONSTID(n, pred);
1464 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1466 fprintf (F, " label: \"%d\" ", i);
1467 print_edge_vcgattr(F, n, i);
1472 /** Dumps a node and its edges but not the block edge
1475 dump_node_wo_blockedge (ir_node *n, void *env) {
1478 dump_ir_data_edges(F, n);
1481 /** Dumps a node and its edges.
1484 dump_whole_node (ir_node *n, void *env) {
1486 dump_node_wo_blockedge(n, env);
1487 if (!node_floats(n)) dump_ir_block_edge(F, n);
1491 dump_const_node(ir_node *n, void *env) {
1492 if (is_Block(n)) return;
1493 dump_node_wo_blockedge(n, env);
1496 /***********************************************************************/
1497 /* the following routines dump the nodes/irgs bracketed to graphs. */
1498 /***********************************************************************/
1500 /** Dumps a constant expression as entity initializer, array bound ...
1502 static void dump_const_expression(FILE *F, ir_node *value) {
1503 ir_graph *rem = current_ir_graph;
1504 int rem_dump_const_local = dump_const_local;
1505 dump_const_local = 0;
1506 current_ir_graph = get_const_code_irg();
1507 irg_walk(value, dump_const_node, NULL, F);
1508 /* Decrease visited flag so that we walk with the same flag for the next
1509 expression. This guarantees that we don't dump the same node twice,
1510 as for const expressions cse is performed to save memory. */
1511 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1512 current_ir_graph = rem;
1513 dump_const_local = rem_dump_const_local;
1516 /** Dump a block as graph containing its nodes.
1518 * Expects to find nodes belonging to the block as list in its
1520 * Dumps the edges of all nodes including itself. */
1522 dump_whole_block(FILE *F, ir_node *block) {
1524 dumper_colors color = ird_color_yellow;
1526 assert(is_Block(block));
1528 fprintf(F, "graph: { title: \"");
1529 PRINT_NODEID(block);
1530 fprintf(F, "\" label: \"");
1531 dump_node_label(F, block);
1533 if (get_opt_dump_abstvals())
1534 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1537 /* colorize blocks */
1538 if (! get_Block_matured(block))
1539 color = ird_color_red;
1540 if (is_Block_dead(block))
1541 color = ird_color_orange;
1543 fprintf(F, "\" status:clustered ");
1544 print_vcg_color(F, color);
1547 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1548 dump_node_info(F, block);
1549 print_dbg_info(F, get_irn_dbg_info(block));
1551 /* dump the blocks edges */
1552 dump_ir_data_edges(F, block);
1554 /* dump the nodes that go into the block */
1555 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1557 dump_ir_data_edges(F, node);
1560 /* Close the vcg information for the block */
1562 dump_const_node_local(F, block);
1564 dump_irn_chi_term(F, block);
1569 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1570 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1572 dump_block_graph(FILE *F, ir_graph *irg) {
1574 ir_graph *rem = current_ir_graph;
1575 ir_node **arr = ird_get_irg_link(irg);
1576 current_ir_graph = irg;
1578 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1579 ir_node * node = arr[i];
1580 if (is_Block(node)) {
1581 /* Dumps the block and all the nodes in the block, which are to
1582 be found in Block->link. */
1583 dump_whole_block(F, node);
1585 /* Nodes that are not in a Block. */
1587 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1588 dump_const_block_local(F, node);
1590 dump_ir_data_edges(F, node);
1594 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1595 dump_loop_nodes_into_graph(F, irg);
1597 current_ir_graph = rem;
1601 * Dump the info for an irg.
1602 * Parsed by XVCG but not shown. use yComp.
1604 static void dump_graph_info(FILE *F, ir_graph *irg) {
1605 fprintf(F, "info1: \"");
1606 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1610 /** Dumps an irg as a graph clustered by block nodes.
1611 * If interprocedural view edges can point to nodes out of this graph.
1613 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1614 entity *ent = get_irg_entity(irg);
1616 fprintf(F, "graph: { title: \"");
1618 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1619 get_ent_dump_name(ent));
1621 dump_graph_info(F, irg);
1622 print_dbg_info(F, get_entity_dbg_info(ent));
1624 dump_block_graph(F, irg);
1626 /* Close the vcg information for the irg */
1627 fprintf(F, "}\n\n");
1630 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1631 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1633 dump_extblock_graph(FILE *F, ir_graph *irg) {
1635 ir_graph *rem = current_ir_graph;
1636 ir_extblk **arr = ird_get_irg_link(irg);
1637 current_ir_graph = irg;
1640 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1641 ir_extblk *extbb = arr[i];
1642 ir_node *leader = get_extbb_leader(extbb);
1645 fprintf(F, "graph: { title: \"");
1646 PRINT_EXTBBID(leader);
1647 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1648 get_irn_node_nr(leader));
1650 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1651 ir_node * node = extbb->blks[j];
1652 if (is_Block(node)) {
1653 /* Dumps the block and all the nodes in the block, which are to
1654 be found in Block->link. */
1655 dump_whole_block(F, node);
1657 /* Nodes that are not in a Block. */
1659 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1660 dump_const_block_local(F, node);
1662 dump_ir_data_edges(F, node);
1668 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1669 dump_loop_nodes_into_graph(F, irg);
1671 current_ir_graph = rem;
1676 /*******************************************************************/
1677 /* Basic type and entity nodes and edges. */
1678 /*******************************************************************/
1680 /** dumps the edges between nodes and their type or entity attributes. */
1681 static void dump_node2type_edges(ir_node *n, void *env)
1686 switch (get_irn_opcode(n)) {
1688 /* @@@ some consts have an entity */
1691 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1692 || (get_SymConst_kind(n) ==symconst_size))
1694 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1698 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1701 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1704 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1707 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1710 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1718 static int print_type_info(FILE *F, ir_type *tp) {
1721 if (get_type_state(tp) == layout_undefined) {
1722 fprintf(F, "state: layout_undefined\n");
1724 fprintf(F, "state: layout_fixed,\n");
1726 if (get_type_mode(tp))
1727 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1728 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1733 static void print_typespecific_info(FILE *F, ir_type *tp) {
1734 switch (get_type_tpop_code(tp)) {
1737 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1744 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1745 fprintf(F, "params: %d\n", get_method_n_params(tp));
1746 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1754 case tpo_enumeration:
1768 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1769 switch (get_type_tpop_code(tp)) {
1772 if (peculiarity_existent == get_class_peculiarity(tp))
1773 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1775 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1779 fprintf (F, " " TYPE_METH_NODE_ATTR);
1790 case tpo_enumeration:
1804 int dump_type_node(FILE *F, ir_type *tp)
1808 fprintf (F, "node: {title: ");
1810 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1811 fprintf (F, " info1: \"");
1813 bad |= print_type_info(F, tp);
1814 print_typespecific_info(F, tp);
1816 dump_type_to_file(F, tp, dump_verbosity_max);
1818 fprintf (F, "\"\n");
1819 print_dbg_info(F, get_type_dbg_info(tp));
1820 print_typespecific_vcgattr(F, tp);
1827 #define X(a) case a: fprintf(F, #a); break
1828 void dump_entity_node(FILE *F, entity *ent, int color)
1830 fprintf (F, "node: {title: \"");
1831 PRINT_ENTID(ent); fprintf(F, "\"");
1832 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1833 fprintf (F, "label: ");
1834 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1836 fprintf(F, "color:%d", color);
1838 fprintf (F, ENTITY_NODE_ATTR);
1839 fprintf (F, "\n info1: \"");
1841 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1844 print_dbg_info(F, get_entity_dbg_info(ent));
1849 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1852 ident *id = get_enumeration_nameid(tp, pos);
1853 tarval *tv = get_enumeration_enum(tp, pos);
1855 tarval_snprintf(buf, sizeof(buf), tv);
1856 fprintf (F, "node: {title: \"");
1857 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1858 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1859 fprintf (F, "label: ");
1860 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1861 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1864 /* dumps a type or entity and it's edges. */
1866 dump_type_info(type_or_ent *tore, void *env) {
1868 int i = 0; /* to shutup gcc */
1870 /* dump this type or entity */
1872 switch (get_kind(tore)) {
1875 entity *ent = (entity *)tore;
1878 dump_entity_node(F, ent, 0);
1880 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1881 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1882 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1883 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1884 if (is_Class_type(get_entity_owner(ent))) {
1885 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1886 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1888 /* attached subgraphs */
1889 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1890 if (is_atomic_entity(ent)) {
1891 value = get_atomic_ent_value(ent);
1893 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1894 /* DDMN(value); $$$ */
1895 dump_const_expression(F, value);
1898 if (is_compound_entity(ent)) {
1899 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1900 value = get_compound_ent_value(ent, i);
1902 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1903 dump_const_expression(F, value);
1904 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1906 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1907 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1908 get_compound_ent_value_member(ent, i), i);
1917 ir_type *tp = (ir_type *)tore;
1918 dump_type_node(F, tp);
1919 /* and now the edges */
1920 switch (get_type_tpop_code(tp)) {
1923 for (i=0; i < get_class_n_supertypes(tp); i++)
1924 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1925 for (i=0; i < get_class_n_members(tp); i++)
1926 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1930 for (i=0; i < get_struct_n_members(tp); i++)
1931 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1935 for (i = 0; i < get_method_n_params(tp); i++)
1936 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1937 for (i = 0; i < get_method_n_ress(tp); i++)
1938 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1942 for (i = 0; i < get_union_n_members(tp); i++)
1943 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1947 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1948 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1949 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1950 ir_node *upper = get_array_upper_bound(tp, i);
1951 ir_node *lower = get_array_lower_bound(tp, i);
1952 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1953 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1954 dump_const_expression(F, upper);
1955 dump_const_expression(F, lower);
1959 case tpo_enumeration:
1961 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1962 dump_enum_item(F, tp, i);
1963 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1968 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1976 break; /* case k_type */
1979 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1981 } /* switch kind_or_entity */
1984 typedef struct _h_env {
1989 /** For dumping class hierarchies.
1990 * Dumps a class type node and a superclass edge.
1991 * If env->dump_ent dumps entities of classes and overwrites edges.
1994 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1997 int i = 0; /* to shutup gcc */
1999 /* dump this type or entity */
2000 switch (get_kind(tore)) {
2002 entity *ent = (entity *)tore;
2003 if (get_entity_owner(ent) == get_glob_type()) break;
2004 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
2005 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
2007 dump_entity_node(F, ent, 0);
2009 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2010 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2011 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2013 } break; /* case k_entity */
2016 ir_type *tp = (ir_type *)tore;
2017 if (tp == get_glob_type()) break;
2018 switch (get_type_tpop_code(tp)) {
2020 dump_type_node(F, tp);
2021 /* and now the edges */
2022 for (i=0; i < get_class_n_supertypes(tp); i++)
2024 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2030 break; /* case k_type */
2033 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2035 } /* switch kind_or_entity */
2038 /*******************************************************************/
2039 /* dump analysis information that is expressed in graph terms. */
2040 /*******************************************************************/
2042 /* dump out edges */
2044 dump_out_edge(ir_node *n, void *env) {
2047 for (i = 0; i < get_irn_n_outs(n); i++) {
2048 assert(get_irn_out(n, i));
2049 fprintf (F, "edge: {sourcename: \"");
2051 fprintf (F, "\" targetname: \"");
2052 PRINT_NODEID(get_irn_out(n, i));
2053 fprintf (F, "\" color: red linestyle: dashed");
2059 dump_loop_label(FILE *F, ir_loop *loop) {
2060 fprintf (F, "loop %d, %d sons, %d nodes",
2061 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2064 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2065 fprintf (F, " info1: \"");
2066 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2067 #if DEBUG_libfirm /* GL @@@ debug analyses */
2068 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2074 dump_loop_node(FILE *F, ir_loop *loop) {
2075 fprintf (F, "node: {title: \"");
2077 fprintf (F, "\" label: \"");
2078 dump_loop_label(F, loop);
2080 dump_loop_info(F, loop);
2086 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2088 fprintf (F, "edge: {sourcename: \"");
2090 fprintf (F, "\" targetname: \"");
2091 PRINT_NODEID(get_loop_node(loop, i));
2092 fprintf (F, "\" color: green");
2097 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2099 fprintf (F, "edge: {sourcename: \"");
2101 fprintf (F, "\" targetname: \"");
2102 PRINT_LOOPID(get_loop_son(loop, i));
2103 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2104 get_loop_element_pos(loop, get_loop_son(loop, i)));
2108 void dump_loops(FILE *F, ir_loop *loop) {
2110 /* dump this loop node */
2111 dump_loop_node(F, loop);
2113 /* dump edges to nodes in loop -- only if it is a real loop */
2114 if (get_loop_depth(loop) != 0) {
2115 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2116 dump_loop_node_edge(F, loop, i);
2119 for (i = 0; i < get_loop_n_sons(loop); i++) {
2120 dump_loops(F, get_loop_son(loop, i));
2121 dump_loop_son_edge(F, loop, i);
2126 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2127 ir_graph *rem = current_ir_graph;
2128 current_ir_graph = irg;
2130 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2132 current_ir_graph = rem;
2137 * dumps the VCG header
2139 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2148 if (!orientation) orientation = "bottom_to_top";
2152 "graph: { title: \"ir graph of %s\"\n"
2153 "display_edge_labels: %s\n"
2154 "layoutalgorithm: mindepth\n"
2155 "manhattan_edges: yes\n"
2156 "port_sharing: no\n"
2158 "classname 1: \"intrablock Data\"\n"
2159 "classname 2: \"Block\"\n"
2160 "classname 3: \"Entity type\"\n"
2161 "classname 4: \"Entity owner\"\n"
2162 "classname 5: \"Method Param\"\n"
2163 "classname 6: \"Method Res\"\n"
2164 "classname 7: \"Super\"\n"
2165 "classname 8: \"Union\"\n"
2166 "classname 9: \"Points-to\"\n"
2167 "classname 10: \"Array Element Type\"\n"
2168 "classname 11: \"Overwrites\"\n"
2169 "classname 12: \"Member\"\n"
2170 "classname 13: \"Control Flow\"\n"
2171 "classname 14: \"intrablock Memory\"\n"
2172 "classname 15: \"Dominators\"\n"
2173 "classname 16: \"interblock Data\"\n"
2174 "classname 17: \"interblock Memory\"\n"
2175 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2176 "classname 19: \"Postdominators\"\n"
2177 "infoname 1: \"Attribute\"\n"
2178 "infoname 2: \"Verification errors\"\n"
2179 "infoname 3: \"Debug info\"\n",
2180 name, label, orientation);
2182 /* don't use all, the range is too whith/black. */
2186 "colorentry 100: 0 0 0\n"
2187 "colorentry 101: 20 0 0\n"
2188 "colorentry 102: 40 0 0\n"
2189 "colorentry 103: 60 0 0\n"
2190 "colorentry 104: 80 0 0\n"
2191 "colorentry 105: 100 0 0\n"
2192 "colorentry 106: 120 0 0\n"
2193 "colorentry 107: 140 0 0\n"
2194 "colorentry 108: 150 0 0\n"
2195 "colorentry 109: 180 0 0\n"
2196 "colorentry 110: 200 0 0\n"
2197 "colorentry 111: 220 0 0\n"
2198 "colorentry 112: 240 0 0\n"
2199 "colorentry 113: 255 0 0\n"
2200 "colorentry 113: 255 20 20\n"
2201 "colorentry 114: 255 40 40\n"
2202 "colorentry 115: 255 60 60\n"
2203 "colorentry 116: 255 80 80\n"
2204 "colorentry 117: 255 100 100\n"
2205 "colorentry 118: 255 120 120\n"
2206 "colorentry 119: 255 140 140\n"
2207 "colorentry 120: 255 150 150\n"
2208 "colorentry 121: 255 180 180\n"
2209 "colorentry 122: 255 200 200\n"
2210 "colorentry 123: 255 220 220\n"
2211 "colorentry 124: 255 240 240\n"
2212 "colorentry 125: 255 250 250\n"
2215 fprintf (F, "\n"); /* a separator */
2221 * @param irg The graph to be dumped
2222 * @param suffix1 first filename suffix
2223 * @param suffix2 second filename suffix
2225 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2227 const char *nm = get_irg_dump_name(irg);
2228 int len = strlen(nm), i, j;
2229 char *fname; /* filename to put the vcg information in */
2231 if (!suffix1) suffix1 = "";
2232 if (!suffix2) suffix2 = "";
2234 /* open file for vcg graph */
2235 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2237 /* strncpy (fname, nm, len); */ /* copy the filename */
2239 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2241 fname[j] = '@'; j++; fname[j] = '1'; j++;
2242 } else if (nm[i] == '@') {
2243 fname[j] = '@'; j++; fname[j] = '2'; j++;
2245 fname[j] = nm[i]; j++;
2249 strcat (fname, suffix1); /* append file suffix */
2250 strcat (fname, suffix2); /* append file suffix */
2251 strcat (fname, ".vcg"); /* append the .vcg suffix */
2253 /* vcg really expect only a <CR> at end of line, so
2254 * the "b"inary mode is what you mean (and even needed for Win32)
2256 F = fopen (fname, "wb"); /* open file for writing */
2258 panic("cannot open %s for writing (%m)", fname); /* not reached */
2268 * @param name prefix file name
2269 * @param suffix filename suffix
2271 FILE *vcg_open_name (const char *name, const char *suffix) {
2273 char *fname; /* filename to put the vcg information in */
2274 int i, j, len = strlen(name);
2276 if (!suffix) suffix = "";
2278 /** open file for vcg graph */
2279 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2280 /* strcpy (fname, name);*/ /* copy the filename */
2282 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2283 if (name[i] == '/') {
2284 fname[j] = '@'; j++; fname[j] = '1'; j++;
2285 } else if (name[i] == '@') {
2286 fname[j] = '@'; j++; fname[j] = '2'; j++;
2288 fname[j] = name[i]; j++;
2292 strcat (fname, suffix);
2293 strcat (fname, ".vcg"); /* append the .vcg suffix */
2295 /* vcg really expect only a <CR> at end of line, so
2296 * the "b"inary mode is what you mean (and even needed for Win32)
2298 F = fopen (fname, "wb"); /* open file for writing */
2300 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2308 * Dumps the vcg file footer
2310 static INLINE void dump_vcg_footer (FILE *F) {
2315 * close the vcg file
2317 void vcg_close (FILE *F) {
2318 dump_vcg_footer(F); /* print footer */
2319 fclose (F); /* close vcg file */
2322 /************************************************************************/
2323 /************************************************************************/
2324 /* Routines that dump all or parts of the firm representation to a file */
2325 /************************************************************************/
2326 /************************************************************************/
2328 /************************************************************************/
2329 /* Dump ir graphs, different formats and additional information. */
2330 /************************************************************************/
2332 /** Routine to dump a graph, blocks as conventional nodes. */
2334 dump_ir_graph (ir_graph *irg, const char *suffix )
2339 rem = current_ir_graph;
2341 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2343 current_ir_graph = irg;
2344 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2345 else suffix1 = "-pure";
2346 f = vcg_open(irg, suffix, suffix1);
2347 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2349 /* call the dump graph hook */
2350 if (dump_ir_graph_hook)
2351 if (dump_ir_graph_hook(f, irg))
2354 /* walk over the graph */
2355 /* dump_whole_node must be called in post visiting predecessors */
2356 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2358 /* dump the out edges in a separate walk */
2359 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2360 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2365 current_ir_graph = rem;
2368 /* Dump a firm graph without explicit block nodes. */
2369 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2375 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2378 if (get_interprocedural_view()) suffix1 = "-ip";
2380 f = vcg_open(irg, suffix, suffix1);
2381 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2383 construct_block_lists(irg);
2386 * If we are in the interprocedural view, we dump not
2387 * only the requested irg but also all irgs that can be reached
2390 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2391 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2393 dump_graph_from_list(f, get_irp_irg(i));
2401 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2402 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2409 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2414 if (get_interprocedural_view()) suffix1 = "-ip";
2417 ent = get_irg_entity(irg);
2419 F = vcg_open(irg, suffix, suffix1);
2420 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2422 construct_extblock_lists(irg);
2424 fprintf(F, "graph: { title: \"");
2426 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2427 get_ent_dump_name(ent));
2429 dump_graph_info(F, irg);
2430 print_dbg_info(F, get_entity_dbg_info(ent));
2432 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2433 ir_graph *irg = get_irp_irg(i);
2434 list_tuple *lists = ird_get_irg_link(irg);
2437 /* dump the extended blocks first */
2438 if (ARR_LEN(lists->extbb_list)) {
2439 ird_set_irg_link(irg, lists->extbb_list);
2440 dump_extblock_graph(F, irg);
2443 /* we may have blocks without extended blocks, bad for instance */
2444 if (ARR_LEN(lists->blk_list)) {
2445 ird_set_irg_link(irg, lists->blk_list);
2446 dump_block_graph(F, irg);
2449 DEL_ARR_F(lists->extbb_list);
2450 DEL_ARR_F(lists->blk_list);
2455 /* Close the vcg information for the irg */
2456 fprintf(F, "}\n\n");
2462 /* dumps a graph with type information */
2464 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2467 ir_graph *rem = current_ir_graph;
2469 int rem_dump_const_local;
2471 /* if a filter is set, dump only the irg's that match the filter */
2472 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2475 current_ir_graph = irg;
2476 rem_dump_const_local = dump_const_local;
2477 /* dumping types does not work with local nodes */
2478 dump_const_local = 0;
2480 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2481 else suffix1 = "-pure-wtypes";
2482 f = vcg_open(irg,suffix, suffix1);
2483 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2485 /* dump common ir graph */
2486 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2487 /* dump type info */
2488 type_walk_irg(irg, dump_type_info, NULL, f);
2489 inc_irg_visited(get_const_code_irg());
2490 /* dump edges from graph to type info */
2491 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2494 dump_const_local = rem_dump_const_local;
2495 current_ir_graph = rem;
2499 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2504 ir_graph *rem = current_ir_graph;
2505 int rem_dump_const_local;
2507 /* if a filter is set, dump only the irg's that match the filter */
2508 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2511 rem_dump_const_local = dump_const_local;
2512 /* dumping types does not work with local nodes */
2513 dump_const_local = 0;
2515 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2516 else suffix1 = "-wtypes";
2517 f = vcg_open(irg, suffix, suffix1);
2518 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2520 /* dump common blocked ir graph */
2521 construct_block_lists(irg);
2523 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2524 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2526 dump_graph_from_list(f, get_irp_irg(i));
2531 /* dump type info */
2532 current_ir_graph = irg;
2533 type_walk_irg(irg, dump_type_info, NULL, f);
2534 inc_irg_visited(get_const_code_irg());
2536 /* dump edges from graph to type info */
2537 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2540 dump_const_local = rem_dump_const_local;
2541 current_ir_graph = rem;
2544 /*---------------------------------------------------------------------*/
2545 /* The following routines dump a control flow graph. */
2546 /*---------------------------------------------------------------------*/
2549 dump_block_to_cfg(ir_node *block, void *env) {
2554 if (is_Block(block)) {
2555 /* This is a block. Dump a node for the block. */
2556 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2557 fprintf (F, "\" label: \"");
2558 if (block == get_irg_start_block(get_irn_irg(block)))
2559 fprintf(F, "Start ");
2560 if (block == get_irg_end_block(get_irn_irg(block)))
2563 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2564 PRINT_NODEID(block);
2566 fprintf(F, "info1:\"");
2568 /* the generic version. */
2569 dump_irnode_to_file(F, block);
2571 /* Check whether we have bad predecessors to color the block. */
2572 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2573 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2576 fprintf (F, "\""); /* closing quote of info */
2578 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2579 (block == get_irg_end_block(get_irn_irg(block))) )
2580 fprintf(F, " color:blue ");
2582 fprintf(F, " color:yellow ");
2585 /* Dump the edges */
2586 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2587 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2588 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2589 fprintf (F, "edge: { sourcename: \"");
2590 PRINT_NODEID(block);
2591 fprintf (F, "\" targetname: \"");
2593 fprintf (F, "\"}\n");
2596 /* Dump dominator/postdominator edge */
2597 if (dump_dominator_information_flag) {
2598 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2599 pred = get_Block_idom(block);
2600 fprintf (F, "edge: { sourcename: \"");
2601 PRINT_NODEID(block);
2602 fprintf (F, "\" targetname: \"");
2604 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2606 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2607 pred = get_Block_ipostdom(block);
2608 fprintf (F, "edge: { sourcename: \"");
2609 PRINT_NODEID(block);
2610 fprintf (F, "\" targetname: \"");
2612 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2619 dump_cfg (ir_graph *irg, const char *suffix)
2622 ir_graph *rem = current_ir_graph;
2623 int ipv = get_interprocedural_view();
2625 /* if a filter is set, dump only the irg's that match the filter */
2626 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2629 current_ir_graph = irg;
2631 f = vcg_open(irg, suffix, "-cfg");
2632 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2635 printf("Warning: dumping cfg not in interprocedural view!\n");
2636 set_interprocedural_view(0);
2639 /* walk over the blocks in the graph */
2640 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2641 dump_node(f, get_irg_bad(irg));
2643 set_interprocedural_view(ipv);
2645 current_ir_graph = rem;
2649 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2650 if (pset_find_ptr(mark_set, n)) return;
2652 pset_insert_ptr(mark_set, n);
2655 int i, start = is_Block(n) ? 0 : -1;
2656 dump_whole_node(n, F);
2657 for (i = start; i < get_irn_arity(n); ++i)
2658 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2661 /* Don't dump edges to nodes further out. These might be edges to
2662 nodes we already dumped, if there is a shorter path to these. */
2666 static int subgraph_counter = 0;
2667 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2670 pset *mark_set = pset_new_ptr(1);
2671 sprintf(buf, "-subg_%03d", subgraph_counter++);
2672 F = vcg_open(get_irn_irg(root), suffix, buf);
2673 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2674 descend_and_dump(F, root, depth, mark_set);
2680 static int weight_overall(int rec, int loop) {
2681 return 2*rec + loop;
2684 static int compute_color (int my, int max) {
2691 /* if small, scale to the full color range. */
2693 my = my * (n_colors/max);
2695 step = 1 + (max / n_colors);
2699 return base_color + n_colors - color;
2702 static int get_entity_color(entity *ent) {
2703 ir_graph *irg = get_entity_irg(ent);
2707 int rec_depth = get_irg_recursion_depth(irg);
2708 int loop_depth = get_irg_loop_depth(irg);
2709 int overall_depth = weight_overall(rec_depth, loop_depth);
2711 int max_rec_depth = irp->max_callgraph_recursion_depth;
2712 int max_loop_depth = irp->max_callgraph_loop_depth;
2713 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2715 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2716 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2717 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2719 return my_overall_color;
2723 void dump_callgraph(const char *suffix) {
2726 int rem = edge_label;
2728 //ident *prefix = new_id_from_str("java/");
2730 F = vcg_open_name("Callgraph", suffix);
2731 dump_vcg_header(F, "Callgraph", NULL);
2733 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2734 ir_graph *irg = get_irp_irg(i);
2735 entity *ent = get_irg_entity(irg);
2736 int j, n_callees = get_irg_n_callees(irg);
2738 /* Do not dump runtime system. */
2739 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2741 dump_entity_node(F, ent, get_entity_color(ent));
2742 for (j = 0; j < n_callees; ++j) {
2743 entity *c = get_irg_entity(get_irg_callee(irg, j));
2744 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2745 int be = is_irg_callee_backedge(irg, j);
2748 "label:\"recursion %d\" color:%d" :
2749 "label:\"calls %d\" color:%d";
2750 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2758 /* Dump all irgs in interprocedural view to a single file. */
2759 void dump_all_cg_block_graph(const char *suffix) {
2762 int rem_view = get_interprocedural_view();
2763 set_interprocedural_view(1);
2765 f = vcg_open_name("All_graphs", suffix);
2766 dump_vcg_header(f, "All_graphs", NULL);
2768 /* collect nodes in all irgs reachable in call graph*/
2769 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2770 ird_set_irg_link(get_irp_irg(i), NULL);
2772 cg_walk(clear_link, collect_node, NULL);
2774 /* dump all graphs */
2775 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2776 current_ir_graph = get_irp_irg(i);
2777 assert(ird_get_irg_link(current_ir_graph));
2778 dump_graph_from_list(f, current_ir_graph);
2779 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2783 set_interprocedural_view(rem_view);
2786 /*---------------------------------------------------------------------*/
2787 /* the following routines dumps type information without any ir nodes. */
2788 /*---------------------------------------------------------------------*/
2791 dump_type_graph (ir_graph *irg, const char *suffix)
2795 rem = current_ir_graph;
2797 /* if a filter is set, dump only the irg's that match the filter */
2798 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2800 current_ir_graph = irg;
2802 f = vcg_open(irg, suffix, "-type");
2803 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2805 /* walk over the blocks in the graph */
2806 type_walk_irg(irg, dump_type_info, NULL, f);
2807 /* The walker for the const code can be called several times for the
2808 same (sub) expression. So that no nodes are dumped several times
2809 we decrease the visited flag of the corresponding graph after each
2810 walk. So now increase it finally. */
2811 inc_irg_visited(get_const_code_irg());
2814 current_ir_graph = rem;
2818 dump_all_types (const char *suffix)
2820 FILE *f = vcg_open_name("All_types", suffix);
2821 dump_vcg_header(f, "All_types", NULL);
2822 type_walk(dump_type_info, NULL, f);
2823 inc_irg_visited(get_const_code_irg());
2828 dump_class_hierarchy (int entities, const char *suffix)
2830 FILE *f = vcg_open_name("class_hierarchy", suffix);
2834 env.dump_ent = entities;
2835 dump_vcg_header(f, "class_hierarchy", NULL);
2836 type_walk(dump_class_hierarchy_node, NULL, &env);
2840 /*---------------------------------------------------------------------*/
2841 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2843 /* dump_ir_block_graph */
2845 /* dump_type_graph */
2846 /* dump_ir_graph_w_types */
2847 /*---------------------------------------------------------------------*/
2849 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2851 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2852 dmp_grph(get_irp_irg(i), suffix);
2856 /*--------------------------------------------------------------------------------*
2857 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2858 * packed together in one subgraph/box *
2859 *--------------------------------------------------------------------------------*/
2861 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2862 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2864 ir_loop *son = NULL;
2866 /* Dump a new loop node. */
2867 dump_loop_node(F, loop);
2869 /* Dump the loop elements. */
2871 for(i = 0; i < get_loop_n_elements(loop); i++) {
2872 le = get_loop_element(loop, i);
2874 if (get_kind(son) == k_ir_loop) {
2876 /* We are a loop son -> Recurse */
2878 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2879 fprintf(F, "\" }\n");
2880 fprintf (F, "edge: {sourcename: \"");
2882 fprintf (F, "\" targetname: \"");
2884 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2885 loop_node_started = 0;
2887 dump_loop_son_edge(F, loop, son_number++);
2888 dump_loops_standalone(F, son);
2889 } else if (get_kind(son) == k_ir_node) {
2890 /* We are a loop node -> Collect firm nodes */
2892 ir_node *n = le.node;
2895 if (!loop_node_started) {
2896 /* Start a new node which contains all firm nodes of the current loop */
2897 fprintf (F, "node: { title: \"");
2899 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2900 loop_node_started = 1;
2906 bad |= dump_node_label(F, n);
2907 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2908 if (has_backedges(n)) fprintf(F, "\t loop head!");
2909 } else { /* for callgraph loop tree */
2911 assert(get_kind(son) == k_ir_graph);
2913 /* We are a loop node -> Collect firm graphs */
2914 n = (ir_graph *)le.node;
2915 if (!loop_node_started) {
2916 /* Start a new node which contains all firm nodes of the current loop */
2917 fprintf (F, "node: { title: \"");
2919 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2920 loop_node_started = 1;
2925 fprintf (F, " %s", get_irg_dump_name(n));
2926 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2930 if (loop_node_started) {
2931 fprintf(F, "\" }\n");
2932 fprintf (F, "edge: {sourcename: \"");
2934 fprintf (F, "\" targetname: \"");
2936 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2937 loop_node_started = 0;
2941 void dump_loop_tree(ir_graph *irg, const char *suffix)
2944 ir_graph *rem = current_ir_graph;
2945 int el_rem = edge_label;
2948 /* if a filter is set, dump only the irg's that match the filter */
2949 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2951 current_ir_graph = irg;
2953 f = vcg_open(irg, suffix, "-looptree");
2954 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2956 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2960 edge_label = el_rem;
2961 current_ir_graph = rem;
2964 void dump_callgraph_loop_tree(const char *suffix) {
2966 F = vcg_open_name("Callgraph_looptree", suffix);
2967 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2968 dump_loops_standalone(F, irp->outermost_cg_loop);
2973 /*-----------------------------------------------------------------------------*/
2974 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2975 /*-----------------------------------------------------------------------------*/
2977 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2978 int i, son_number = 0, node_number = 0;
2980 if (dump_loop_information_flag) dump_loop_node(F, loop);
2982 for (i = 0; i < get_loop_n_elements(loop); i++) {
2983 loop_element le = get_loop_element(loop, i);
2984 if (*(le.kind) == k_ir_loop) {
2985 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2987 collect_nodeloop(F, le.son, loopnodes);
2989 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2990 eset_insert(loopnodes, le.node);
2995 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2998 for(i = 0; i < get_loop_n_elements(loop); i++) {
2999 loop_element le = get_loop_element(loop, i);
3000 if (*(le.kind) == k_ir_loop) {
3002 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
3004 if (is_Block(le.node)) start = 0; else start = -1;
3005 for (j = start; j < get_irn_arity(le.node); j++) {
3006 ir_node *pred = get_irn_n(le.node, j);
3007 if (!eset_contains(loopnodes, pred)) {
3008 eset_insert(extnodes, pred);
3009 if (!is_Block(pred)) {
3010 pred = get_nodes_block(pred);
3011 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3019 void dump_loop(ir_loop *l, const char *suffix) {
3022 eset *loopnodes = eset_create();
3023 eset *extnodes = eset_create();
3026 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3027 F = vcg_open_name (name, suffix);
3028 dump_vcg_header(F, name, NULL);
3030 /* collect all nodes to dump */
3031 collect_nodeloop(F, l, loopnodes);
3032 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3034 /* build block lists */
3035 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3036 set_irn_link(n, NULL);
3037 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3038 set_irn_link(n, NULL);
3039 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3041 b = get_nodes_block(n);
3042 set_irn_link(n, get_irn_link(b));
3045 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3047 b = get_nodes_block(n);
3048 set_irn_link(n, get_irn_link(b));
3052 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3054 fprintf(F, "graph: { title: \"");
3056 fprintf(F, "\" label: \"");
3057 dump_node_opcode(F, b);
3058 fprintf (F, " %ld", get_irn_node_nr(b));
3059 fprintf(F, "\" status:clustered color:yellow\n");
3061 /* dump the blocks edges */
3062 dump_ir_data_edges(F, b);
3064 /* dump the nodes that go into the block */
3065 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3066 if (eset_contains(extnodes, n))
3067 overrule_nodecolor = ird_color_lightblue;
3069 overrule_nodecolor = ird_color_default;
3070 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3073 /* Close the vcg information for the block */
3075 dump_const_node_local(F, b);
3078 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3080 fprintf(F, "graph: { title: \"");
3082 fprintf(F, "\" label: \"");
3083 dump_node_opcode(F, b);
3084 fprintf (F, " %ld", get_irn_node_nr(b));
3085 fprintf(F, "\" status:clustered color:lightblue\n");
3087 /* dump the nodes that go into the block */
3088 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3089 if (!eset_contains(loopnodes, n))
3090 overrule_nodecolor = ird_color_lightblue;
3092 overrule_nodecolor = ird_color_default;
3093 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3096 /* Close the vcg information for the block */
3098 dump_const_node_local(F, b);
3102 eset_destroy(loopnodes);
3103 eset_destroy(extnodes);