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(Bound) names */
871 static const pns_lookup_t bound_lut[] = {
872 #define X(a) { pn_Bound_##a, #a }
880 /** the Proj lookup table */
881 static const proj_lookup_t proj_lut[] = {
882 #define E(a) ARR_SIZE(a), a
883 { iro_Start, E(start_lut) },
884 { iro_Cond, E(cond_lut) },
885 { iro_Call, E(call_lut) },
886 { iro_Quot, E(quot_lut) },
887 { iro_DivMod, E(divmod_lut) },
888 { iro_Div, E(div_lut) },
889 { iro_Mod, E(mod_lut) },
890 { iro_Load, E(load_lut) },
891 { iro_Store, E(store_lut) },
892 { iro_Alloc, E(alloc_lut) },
893 { iro_CopyB, E(copyb_lut) },
894 { iro_Bound, E(bound_lut) }
899 * Dump additional node attributes of some nodes to a file F.
902 dump_node_nodeattr(FILE *F, ir_node *n)
908 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
910 /* call the dump_node operation if available */
912 return ops->dump_node(n, F, dump_node_nodeattr_txt);
914 switch (get_irn_opcode(n)) {
916 if (0 && get_interprocedural_view()) {
917 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
922 pred = get_Proj_pred(n);
923 proj_nr = get_Proj_proj(n);
925 code = get_irn_opcode(pred);
928 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
929 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
930 fprintf (F, "Arg %ld ", proj_nr);
931 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
932 fprintf (F, "%ld ", proj_nr);
934 unsigned i, j, f = 0;
936 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
937 if (code == proj_lut[i].code) {
938 for (j = 0; j < proj_lut[i].num_data; ++j) {
939 if (proj_nr == proj_lut[i].data[j].nr) {
940 fprintf (F, "%s ", proj_lut[i].data[j].name);
949 fprintf (F, "%ld ", proj_nr);
950 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
951 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
953 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
959 proj_nr = get_Filter_proj(n);
960 if (! get_interprocedural_view()) {
962 pred = get_Filter_pred(n);
966 fprintf (F, "%ld ", proj_nr);
969 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
972 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
975 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
978 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
989 #include "execution_frequency.h"
990 #include "callgraph.h"
992 void dump_node_ana_vals(FILE *F, ir_node *n) {
994 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
995 get_irn_exec_freq(n),
996 get_irg_method_execution_frequency(get_irn_irg(n)),
997 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
998 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1003 /* Dumps a node label without the enclosing ". */
1004 int dump_node_label(FILE *F, ir_node *n) {
1007 bad |= dump_node_opcode(F, n);
1008 bad |= dump_node_mode(F, n);
1010 bad |= dump_node_typeinfo(F, n);
1011 bad |= dump_node_nodeattr(F, n);
1012 fprintf(F, "%ld", get_irn_node_nr(n));
1019 * Dumps the attributes of a node n into the file F.
1020 * Currently this is only the color of a node.
1022 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1027 print_vcg_color(F, ird_color_red);
1031 if (dump_node_vcgattr_hook)
1032 if (dump_node_vcgattr_hook(F, node, local))
1035 n = local ? local : node;
1037 if (overrule_nodecolor != ird_color_default) {
1038 print_vcg_color(F, overrule_nodecolor);
1042 switch (get_irn_opcode(n)) {
1049 print_vcg_color(F, ird_color_blue);
1052 if (is_Block_dead(n))
1053 print_vcg_color(F, ird_color_lightred);
1055 print_vcg_color(F, ird_color_lightyellow);
1058 print_vcg_color(F, ird_color_green);
1064 print_vcg_color(F, ird_color_yellow);
1067 PRINT_DEFAULT_NODE_ATTR;
1073 * Dump the node information of a node n to a file F.
1075 static INLINE int dump_node_info(FILE *F, ir_node *n)
1078 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1080 fprintf (F, " info1: \"");
1081 bad = dump_irnode_to_file(F, n);
1082 /* call the dump_node operation if available */
1084 bad = ops->dump_node(n, F, dump_node_info_txt);
1091 * checks whether a node is "constant-like" ie can be treated "block-less"
1094 int is_constlike_node(ir_node *n) {
1095 ir_op *op = get_irn_op(n);
1096 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1100 /** outputs the predecessors of n, that are constants, local. I.e.,
1101 generates a copy of the constant predecessors for each node called with. */
1102 static void dump_const_node_local(FILE *F, ir_node *n) {
1104 if (!get_opt_dump_const_local()) return;
1106 /* Use visited flag to avoid outputting nodes twice.
1107 initialize it first. */
1108 for (i = 0; i < get_irn_arity(n); i++) {
1109 ir_node *con = get_irn_n(n, i);
1110 if (is_constlike_node(con)) {
1111 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1115 for (i = 0; i < get_irn_arity(n); i++) {
1116 ir_node *con = get_irn_n(n, i);
1117 if (is_constlike_node(con) && irn_not_visited(con)) {
1120 mark_irn_visited(con);
1121 /* Generate a new name for the node by appending the names of
1123 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1124 fprintf(F, " label: \"");
1125 bad |= dump_node_label(F, con);
1127 bad |= dump_node_info(F, con);
1128 dump_node_vcgattr(F, n, con, bad);
1134 /** If the block of an edge is a const_like node, dump it local with an edge */
1135 static void dump_const_block_local(FILE *F, ir_node *n) {
1138 if (!get_opt_dump_const_local()) return;
1140 blk = get_nodes_block(n);
1141 if (is_constlike_node(blk)) {
1144 /* Generate a new name for the node by appending the names of
1146 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1147 fprintf(F, "\" label: \"");
1148 bad |= dump_node_label(F, blk);
1150 bad |= dump_node_info(F, blk);
1151 dump_node_vcgattr(F, n, blk, bad);
1154 fprintf (F, "edge: { sourcename: \"");
1156 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1158 if (dump_edge_vcgattr_hook) {
1160 if (dump_edge_vcgattr_hook(F, n, -1)) {
1165 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1170 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1175 * prints the error message of a node to a file F as info2.
1177 static void INLINE print_node_error(FILE *F, const char *err_msg)
1182 fprintf (F, " info2: \"%s\"", err_msg);
1186 * prints debug messages of a node to file F as info3.
1188 static void print_dbg_info(FILE *F, dbg_info *dbg)
1192 if (__dbg_info_snprint) {
1194 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1195 fprintf (F, " info3: \"%s\"\n", buf);
1202 static void dump_node(FILE *F, ir_node *n)
1207 if (get_opt_dump_const_local() && is_constlike_node(n))
1210 /* dump this node */
1211 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1213 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1214 bad |= dump_node_label(F, n);
1215 dump_node_ana_vals(F, n);
1216 //dump_node_ana_info(F, n);
1218 bad |= dump_node_info(F, n);
1219 print_node_error(F, p);
1220 print_dbg_info(F, get_irn_dbg_info(n));
1221 dump_node_vcgattr(F, n, NULL, bad);
1223 dump_const_node_local(F, n);
1225 if(dump_node_edge_hook)
1226 dump_node_edge_hook(F, n);
1228 dump_irn_chi_term(F, n);
1229 dump_irn_state(F, n);
1233 /** dump the edge to the block this node belongs to */
1235 dump_ir_block_edge(FILE *F, ir_node *n) {
1236 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1237 if (is_no_Block(n)) {
1238 ir_node *block = get_nodes_block(n);
1240 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1241 dump_const_block_local(F, n);
1244 fprintf (F, "edge: { sourcename: \"");
1246 fprintf (F, "\" targetname: ");
1247 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1249 if (dump_edge_vcgattr_hook) {
1251 if (dump_edge_vcgattr_hook(F, n, -1)) {
1256 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1261 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1267 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1269 * do not use get_nodes_block() here, will fail
1270 * if the irg is not pinned.
1272 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1273 fprintf (F, INTRA_DATA_EDGE_ATTR);
1275 fprintf (F, INTER_DATA_EDGE_ATTR);
1279 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1281 * do not use get_nodes_block() here, will fail
1282 * if the irg is not pinned.
1284 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1285 fprintf (F, INTRA_MEM_EDGE_ATTR);
1287 fprintf (F, INTER_MEM_EDGE_ATTR);
1291 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1294 if (dump_edge_vcgattr_hook)
1295 if (dump_edge_vcgattr_hook(F, from, to))
1298 if (dump_backedge_information_flag && is_backedge(from, to))
1299 fprintf (F, BACK_EDGE_ATTR);
1301 switch (get_irn_opcode(from)) {
1303 fprintf (F, CF_EDGE_ATTR);
1305 case iro_Start: break;
1308 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1309 fprintf (F, CF_EDGE_ATTR);
1310 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1311 fprintf (F, INTER_MEM_EDGE_ATTR);
1319 print_data_edge_vcgattr(F, from, to);
1324 print_mem_edge_vcgattr(F, from, to);
1326 print_data_edge_vcgattr(F, from, to);
1330 print_data_edge_vcgattr(F, from, to);
1335 print_mem_edge_vcgattr(F, from, to);
1337 print_data_edge_vcgattr(F, from, to);
1344 print_data_edge_vcgattr(F, from, to);
1351 print_mem_edge_vcgattr(F, from, to);
1353 print_data_edge_vcgattr(F, from, to);
1365 print_data_edge_vcgattr(F, from, to);
1368 if (get_irn_modecode(from) == irm_M)
1369 fprintf (F, INTER_MEM_EDGE_ATTR);
1371 print_data_edge_vcgattr(F, from, to);
1378 print_mem_edge_vcgattr(F, from, to);
1380 print_data_edge_vcgattr(F, from, to);
1383 print_mem_edge_vcgattr(F, from, to);
1385 case iro_Tuple: break;
1388 switch (get_irn_modecode(from)) {
1390 fprintf (F, CF_EDGE_ATTR);
1393 fprintf (F, INTER_MEM_EDGE_ATTR);
1396 print_data_edge_vcgattr(F, from, to);
1400 case iro_Bad: break;
1401 case iro_Unknown: break;
1403 switch (get_irn_modecode(from)) {
1405 fprintf (F, INTRA_MEM_EDGE_ATTR);
1408 fprintf (F, CF_EDGE_ATTR);
1411 print_data_edge_vcgattr(F, from, to);
1419 /* dump edges to our inputs */
1421 dump_ir_data_edges(FILE *F, ir_node *n) {
1423 unsigned long visited = get_irn_visited(n);
1425 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1428 for (i = 0; i < get_irn_arity(n); i++) {
1429 ir_node * pred = get_irn_n(n, i);
1432 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1433 continue; /* pred not dumped */
1435 if (dump_backedge_information_flag && is_backedge(n, i))
1436 fprintf (F, "backedge: {sourcename: \"");
1438 fprintf (F, "edge: {sourcename: \"");
1440 fprintf (F, "\" targetname: ");
1441 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1442 PRINT_CONSTID(n, pred);
1444 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1446 fprintf (F, " label: \"%d\" ", i);
1447 print_edge_vcgattr(F, n, i);
1452 /** Dumps a node and its edges but not the block edge
1455 dump_node_wo_blockedge (ir_node *n, void *env) {
1458 dump_ir_data_edges(F, n);
1461 /** Dumps a node and its edges.
1464 dump_whole_node (ir_node *n, void *env) {
1466 dump_node_wo_blockedge(n, env);
1467 if (!node_floats(n)) dump_ir_block_edge(F, n);
1471 dump_const_node(ir_node *n, void *env) {
1472 if (is_Block(n)) return;
1473 dump_node_wo_blockedge(n, env);
1476 /***********************************************************************/
1477 /* the following routines dump the nodes/irgs bracketed to graphs. */
1478 /***********************************************************************/
1480 /** Dumps a constant expression as entity initializer, array bound ...
1482 static void dump_const_expression(FILE *F, ir_node *value) {
1483 ir_graph *rem = current_ir_graph;
1484 int rem_dump_const_local = dump_const_local;
1485 dump_const_local = 0;
1486 current_ir_graph = get_const_code_irg();
1487 irg_walk(value, dump_const_node, NULL, F);
1488 /* Decrease visited flag so that we walk with the same flag for the next
1489 expression. This guarantees that we don't dump the same node twice,
1490 as for const expressions cse is performed to save memory. */
1491 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1492 current_ir_graph = rem;
1493 dump_const_local = rem_dump_const_local;
1496 /** Dump a block as graph containing its nodes.
1498 * Expects to find nodes belonging to the block as list in its
1500 * Dumps the edges of all nodes including itself. */
1502 dump_whole_block(FILE *F, ir_node *block) {
1504 dumper_colors color = ird_color_yellow;
1506 assert(is_Block(block));
1508 fprintf(F, "graph: { title: \"");
1509 PRINT_NODEID(block);
1510 fprintf(F, "\" label: \"");
1511 dump_node_label(F, block);
1513 if (get_opt_dump_abstvals())
1514 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1517 /* colorize blocks */
1518 if (! get_Block_matured(block))
1519 color = ird_color_red;
1520 if (is_Block_dead(block))
1521 color = ird_color_orange;
1523 fprintf(F, "\" status:clustered ");
1524 print_vcg_color(F, color);
1527 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1528 dump_node_info(F, block);
1529 print_dbg_info(F, get_irn_dbg_info(block));
1531 /* dump the blocks edges */
1532 dump_ir_data_edges(F, block);
1534 /* dump the nodes that go into the block */
1535 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1537 dump_ir_data_edges(F, node);
1540 /* Close the vcg information for the block */
1542 dump_const_node_local(F, block);
1544 dump_irn_chi_term(F, block);
1549 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1550 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1552 dump_block_graph(FILE *F, ir_graph *irg) {
1554 ir_graph *rem = current_ir_graph;
1555 ir_node **arr = ird_get_irg_link(irg);
1556 current_ir_graph = irg;
1558 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1559 ir_node * node = arr[i];
1560 if (is_Block(node)) {
1561 /* Dumps the block and all the nodes in the block, which are to
1562 be found in Block->link. */
1563 dump_whole_block(F, node);
1565 /* Nodes that are not in a Block. */
1567 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1568 dump_const_block_local(F, node);
1570 dump_ir_data_edges(F, node);
1574 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1575 dump_loop_nodes_into_graph(F, irg);
1577 current_ir_graph = rem;
1581 * Dump the info for an irg.
1582 * Parsed by XVCG but not shown. use yComp.
1584 static void dump_graph_info(FILE *F, ir_graph *irg) {
1585 fprintf(F, "info1: \"");
1586 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1590 /** Dumps an irg as a graph clustered by block nodes.
1591 * If interprocedural view edges can point to nodes out of this graph.
1593 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1594 entity *ent = get_irg_entity(irg);
1596 fprintf(F, "graph: { title: \"");
1598 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1599 get_ent_dump_name(ent));
1601 dump_graph_info(F, irg);
1602 print_dbg_info(F, get_entity_dbg_info(ent));
1604 dump_block_graph(F, irg);
1606 /* Close the vcg information for the irg */
1607 fprintf(F, "}\n\n");
1610 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1611 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1613 dump_extblock_graph(FILE *F, ir_graph *irg) {
1615 ir_graph *rem = current_ir_graph;
1616 ir_extblk **arr = ird_get_irg_link(irg);
1617 current_ir_graph = irg;
1620 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1621 ir_extblk *extbb = arr[i];
1622 ir_node *leader = get_extbb_leader(extbb);
1625 fprintf(F, "graph: { title: \"");
1626 PRINT_EXTBBID(leader);
1627 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1628 get_irn_node_nr(leader));
1630 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1631 ir_node * node = extbb->blks[j];
1632 if (is_Block(node)) {
1633 /* Dumps the block and all the nodes in the block, which are to
1634 be found in Block->link. */
1635 dump_whole_block(F, node);
1637 /* Nodes that are not in a Block. */
1639 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1640 dump_const_block_local(F, node);
1642 dump_ir_data_edges(F, node);
1648 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1649 dump_loop_nodes_into_graph(F, irg);
1651 current_ir_graph = rem;
1656 /*******************************************************************/
1657 /* Basic type and entity nodes and edges. */
1658 /*******************************************************************/
1660 /** dumps the edges between nodes and their type or entity attributes. */
1661 static void dump_node2type_edges(ir_node *n, void *env)
1666 switch (get_irn_opcode(n)) {
1668 /* @@@ some consts have an entity */
1671 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1672 || (get_SymConst_kind(n) ==symconst_size))
1674 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1678 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1681 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1684 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1687 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1690 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1698 static int print_type_info(FILE *F, ir_type *tp) {
1701 if (get_type_state(tp) == layout_undefined) {
1702 fprintf(F, "state: layout_undefined\n");
1704 fprintf(F, "state: layout_fixed,\n");
1706 if (get_type_mode(tp))
1707 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1708 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1713 static void print_typespecific_info(FILE *F, ir_type *tp) {
1714 switch (get_type_tpop_code(tp)) {
1717 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1724 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1725 fprintf(F, "params: %d\n", get_method_n_params(tp));
1726 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1734 case tpo_enumeration:
1748 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1749 switch (get_type_tpop_code(tp)) {
1752 if (peculiarity_existent == get_class_peculiarity(tp))
1753 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1755 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1759 fprintf (F, " " TYPE_METH_NODE_ATTR);
1770 case tpo_enumeration:
1784 int dump_type_node(FILE *F, ir_type *tp)
1788 fprintf (F, "node: {title: ");
1790 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1791 fprintf (F, " info1: \"");
1793 bad |= print_type_info(F, tp);
1794 print_typespecific_info(F, tp);
1796 dump_type_to_file(F, tp, dump_verbosity_max);
1798 fprintf (F, "\"\n");
1799 print_dbg_info(F, get_type_dbg_info(tp));
1800 print_typespecific_vcgattr(F, tp);
1807 #define X(a) case a: fprintf(F, #a); break
1808 void dump_entity_node(FILE *F, entity *ent, int color)
1810 fprintf (F, "node: {title: \"");
1811 PRINT_ENTID(ent); fprintf(F, "\"");
1812 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1813 fprintf (F, "label: ");
1814 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1816 fprintf(F, "color:%d", color);
1818 fprintf (F, ENTITY_NODE_ATTR);
1819 fprintf (F, "\n info1: \"");
1821 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1824 print_dbg_info(F, get_entity_dbg_info(ent));
1829 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1832 ident *id = get_enumeration_nameid(tp, pos);
1833 tarval *tv = get_enumeration_enum(tp, pos);
1835 tarval_snprintf(buf, sizeof(buf), tv);
1836 fprintf (F, "node: {title: \"");
1837 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1838 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1839 fprintf (F, "label: ");
1840 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1841 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1844 /* dumps a type or entity and it's edges. */
1846 dump_type_info(type_or_ent *tore, void *env) {
1848 int i = 0; /* to shutup gcc */
1850 /* dump this type or entity */
1852 switch (get_kind(tore)) {
1855 entity *ent = (entity *)tore;
1858 dump_entity_node(F, ent, 0);
1860 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1861 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1862 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1863 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1864 if (is_Class_type(get_entity_owner(ent))) {
1865 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1866 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1868 /* attached subgraphs */
1869 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1870 if (is_atomic_entity(ent)) {
1871 value = get_atomic_ent_value(ent);
1873 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1874 /* DDMN(value); $$$ */
1875 dump_const_expression(F, value);
1878 if (is_compound_entity(ent)) {
1879 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1880 value = get_compound_ent_value(ent, i);
1882 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1883 dump_const_expression(F, value);
1884 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1886 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1887 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1888 get_compound_ent_value_member(ent, i), i);
1897 ir_type *tp = (ir_type *)tore;
1898 dump_type_node(F, tp);
1899 /* and now the edges */
1900 switch (get_type_tpop_code(tp)) {
1903 for (i=0; i < get_class_n_supertypes(tp); i++)
1904 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1905 for (i=0; i < get_class_n_members(tp); i++)
1906 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1910 for (i=0; i < get_struct_n_members(tp); i++)
1911 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1915 for (i = 0; i < get_method_n_params(tp); i++)
1916 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1917 for (i = 0; i < get_method_n_ress(tp); i++)
1918 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1922 for (i = 0; i < get_union_n_members(tp); i++)
1923 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1927 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1928 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1929 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1930 ir_node *upper = get_array_upper_bound(tp, i);
1931 ir_node *lower = get_array_lower_bound(tp, i);
1932 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1933 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1934 dump_const_expression(F, upper);
1935 dump_const_expression(F, lower);
1939 case tpo_enumeration:
1941 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1942 dump_enum_item(F, tp, i);
1943 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1948 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1956 break; /* case k_type */
1959 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1961 } /* switch kind_or_entity */
1964 typedef struct _h_env {
1969 /** For dumping class hierarchies.
1970 * Dumps a class type node and a superclass edge.
1971 * If env->dump_ent dumps entities of classes and overwrites edges.
1974 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1977 int i = 0; /* to shutup gcc */
1979 /* dump this type or entity */
1980 switch (get_kind(tore)) {
1982 entity *ent = (entity *)tore;
1983 if (get_entity_owner(ent) == get_glob_type()) break;
1984 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1985 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1987 dump_entity_node(F, ent, 0);
1989 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1990 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1991 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
1993 } break; /* case k_entity */
1996 ir_type *tp = (ir_type *)tore;
1997 if (tp == get_glob_type()) break;
1998 switch (get_type_tpop_code(tp)) {
2000 dump_type_node(F, tp);
2001 /* and now the edges */
2002 for (i=0; i < get_class_n_supertypes(tp); i++)
2004 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2010 break; /* case k_type */
2013 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2015 } /* switch kind_or_entity */
2018 /*******************************************************************/
2019 /* dump analysis information that is expressed in graph terms. */
2020 /*******************************************************************/
2022 /* dump out edges */
2024 dump_out_edge(ir_node *n, void *env) {
2027 for (i = 0; i < get_irn_n_outs(n); i++) {
2028 assert(get_irn_out(n, i));
2029 fprintf (F, "edge: {sourcename: \"");
2031 fprintf (F, "\" targetname: \"");
2032 PRINT_NODEID(get_irn_out(n, i));
2033 fprintf (F, "\" color: red linestyle: dashed");
2039 dump_loop_label(FILE *F, ir_loop *loop) {
2040 fprintf (F, "loop %d, %d sons, %d nodes",
2041 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2044 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2045 fprintf (F, " info1: \"");
2046 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2047 #if DEBUG_libfirm /* GL @@@ debug analyses */
2048 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2054 dump_loop_node(FILE *F, ir_loop *loop) {
2055 fprintf (F, "node: {title: \"");
2057 fprintf (F, "\" label: \"");
2058 dump_loop_label(F, loop);
2060 dump_loop_info(F, loop);
2066 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2068 fprintf (F, "edge: {sourcename: \"");
2070 fprintf (F, "\" targetname: \"");
2071 PRINT_NODEID(get_loop_node(loop, i));
2072 fprintf (F, "\" color: green");
2077 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2079 fprintf (F, "edge: {sourcename: \"");
2081 fprintf (F, "\" targetname: \"");
2082 PRINT_LOOPID(get_loop_son(loop, i));
2083 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2084 get_loop_element_pos(loop, get_loop_son(loop, i)));
2088 void dump_loops(FILE *F, ir_loop *loop) {
2090 /* dump this loop node */
2091 dump_loop_node(F, loop);
2093 /* dump edges to nodes in loop -- only if it is a real loop */
2094 if (get_loop_depth(loop) != 0) {
2095 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2096 dump_loop_node_edge(F, loop, i);
2099 for (i = 0; i < get_loop_n_sons(loop); i++) {
2100 dump_loops(F, get_loop_son(loop, i));
2101 dump_loop_son_edge(F, loop, i);
2106 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2107 ir_graph *rem = current_ir_graph;
2108 current_ir_graph = irg;
2110 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2112 current_ir_graph = rem;
2117 * dumps the VCG header
2119 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2128 if (!orientation) orientation = "bottom_to_top";
2132 "graph: { title: \"ir graph of %s\"\n"
2133 "display_edge_labels: %s\n"
2134 "layoutalgorithm: mindepth\n"
2135 "manhattan_edges: yes\n"
2136 "port_sharing: no\n"
2138 "classname 1: \"intrablock Data\"\n"
2139 "classname 2: \"Block\"\n"
2140 "classname 3: \"Entity type\"\n"
2141 "classname 4: \"Entity owner\"\n"
2142 "classname 5: \"Method Param\"\n"
2143 "classname 6: \"Method Res\"\n"
2144 "classname 7: \"Super\"\n"
2145 "classname 8: \"Union\"\n"
2146 "classname 9: \"Points-to\"\n"
2147 "classname 10: \"Array Element Type\"\n"
2148 "classname 11: \"Overwrites\"\n"
2149 "classname 12: \"Member\"\n"
2150 "classname 13: \"Control Flow\"\n"
2151 "classname 14: \"intrablock Memory\"\n"
2152 "classname 15: \"Dominators\"\n"
2153 "classname 16: \"interblock Data\"\n"
2154 "classname 17: \"interblock Memory\"\n"
2155 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2156 "classname 19: \"Postdominators\"\n"
2157 "infoname 1: \"Attribute\"\n"
2158 "infoname 2: \"Verification errors\"\n"
2159 "infoname 3: \"Debug info\"\n",
2160 name, label, orientation);
2162 /* don't use all, the range is too whith/black. */
2166 "colorentry 100: 0 0 0\n"
2167 "colorentry 101: 20 0 0\n"
2168 "colorentry 102: 40 0 0\n"
2169 "colorentry 103: 60 0 0\n"
2170 "colorentry 104: 80 0 0\n"
2171 "colorentry 105: 100 0 0\n"
2172 "colorentry 106: 120 0 0\n"
2173 "colorentry 107: 140 0 0\n"
2174 "colorentry 108: 150 0 0\n"
2175 "colorentry 109: 180 0 0\n"
2176 "colorentry 110: 200 0 0\n"
2177 "colorentry 111: 220 0 0\n"
2178 "colorentry 112: 240 0 0\n"
2179 "colorentry 113: 255 0 0\n"
2180 "colorentry 113: 255 20 20\n"
2181 "colorentry 114: 255 40 40\n"
2182 "colorentry 115: 255 60 60\n"
2183 "colorentry 116: 255 80 80\n"
2184 "colorentry 117: 255 100 100\n"
2185 "colorentry 118: 255 120 120\n"
2186 "colorentry 119: 255 140 140\n"
2187 "colorentry 120: 255 150 150\n"
2188 "colorentry 121: 255 180 180\n"
2189 "colorentry 122: 255 200 200\n"
2190 "colorentry 123: 255 220 220\n"
2191 "colorentry 124: 255 240 240\n"
2192 "colorentry 125: 255 250 250\n"
2195 fprintf (F, "\n"); /* a separator */
2201 * @param irg The graph to be dumped
2202 * @param suffix1 first filename suffix
2203 * @param suffix2 second filename suffix
2205 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2207 const char *nm = get_irg_dump_name(irg);
2208 int len = strlen(nm), i, j;
2209 char *fname; /* filename to put the vcg information in */
2211 if (!suffix1) suffix1 = "";
2212 if (!suffix2) suffix2 = "";
2214 /* open file for vcg graph */
2215 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2217 /* strncpy (fname, nm, len); */ /* copy the filename */
2219 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2221 fname[j] = '@'; j++; fname[j] = '1'; j++;
2222 } else if (nm[i] == '@') {
2223 fname[j] = '@'; j++; fname[j] = '2'; j++;
2225 fname[j] = nm[i]; j++;
2229 strcat (fname, suffix1); /* append file suffix */
2230 strcat (fname, suffix2); /* append file suffix */
2231 strcat (fname, ".vcg"); /* append the .vcg suffix */
2233 /* vcg really expect only a <CR> at end of line, so
2234 * the "b"inary mode is what you mean (and even needed for Win32)
2236 F = fopen (fname, "wb"); /* open file for writing */
2238 panic("cannot open %s for writing (%m)", fname); /* not reached */
2248 * @param name prefix file name
2249 * @param suffix filename suffix
2251 FILE *vcg_open_name (const char *name, const char *suffix) {
2253 char *fname; /* filename to put the vcg information in */
2254 int i, j, len = strlen(name);
2256 if (!suffix) suffix = "";
2258 /** open file for vcg graph */
2259 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2260 /* strcpy (fname, name);*/ /* copy the filename */
2262 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2263 if (name[i] == '/') {
2264 fname[j] = '@'; j++; fname[j] = '1'; j++;
2265 } else if (name[i] == '@') {
2266 fname[j] = '@'; j++; fname[j] = '2'; j++;
2268 fname[j] = name[i]; j++;
2272 strcat (fname, suffix);
2273 strcat (fname, ".vcg"); /* append the .vcg suffix */
2275 /* vcg really expect only a <CR> at end of line, so
2276 * the "b"inary mode is what you mean (and even needed for Win32)
2278 F = fopen (fname, "wb"); /* open file for writing */
2280 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2288 * Dumps the vcg file footer
2290 static INLINE void dump_vcg_footer (FILE *F) {
2295 * close the vcg file
2297 void vcg_close (FILE *F) {
2298 dump_vcg_footer(F); /* print footer */
2299 fclose (F); /* close vcg file */
2302 /************************************************************************/
2303 /************************************************************************/
2304 /* Routines that dump all or parts of the firm representation to a file */
2305 /************************************************************************/
2306 /************************************************************************/
2308 /************************************************************************/
2309 /* Dump ir graphs, different formats and additional information. */
2310 /************************************************************************/
2312 /** Routine to dump a graph, blocks as conventional nodes. */
2314 dump_ir_graph (ir_graph *irg, const char *suffix )
2319 rem = current_ir_graph;
2321 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2323 current_ir_graph = irg;
2324 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2325 else suffix1 = "-pure";
2326 f = vcg_open(irg, suffix, suffix1);
2327 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2329 /* call the dump graph hook */
2330 if (dump_ir_graph_hook)
2331 if (dump_ir_graph_hook(f, irg))
2334 /* walk over the graph */
2335 /* dump_whole_node must be called in post visiting predecessors */
2336 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2338 /* dump the out edges in a separate walk */
2339 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2340 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2345 current_ir_graph = rem;
2348 /* Dump a firm graph without explicit block nodes. */
2349 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2355 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2358 if (get_interprocedural_view()) suffix1 = "-ip";
2360 f = vcg_open(irg, suffix, suffix1);
2361 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2363 construct_block_lists(irg);
2366 * If we are in the interprocedural view, we dump not
2367 * only the requested irg but also all irgs that can be reached
2370 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2371 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2373 dump_graph_from_list(f, get_irp_irg(i));
2381 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2382 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2389 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2394 if (get_interprocedural_view()) suffix1 = "-ip";
2397 ent = get_irg_entity(irg);
2399 F = vcg_open(irg, suffix, suffix1);
2400 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2402 construct_extblock_lists(irg);
2404 fprintf(F, "graph: { title: \"");
2406 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2407 get_ent_dump_name(ent));
2409 dump_graph_info(F, irg);
2410 print_dbg_info(F, get_entity_dbg_info(ent));
2412 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2413 ir_graph *irg = get_irp_irg(i);
2414 list_tuple *lists = ird_get_irg_link(irg);
2417 /* dump the extended blocks first */
2418 if (ARR_LEN(lists->extbb_list)) {
2419 ird_set_irg_link(irg, lists->extbb_list);
2420 dump_extblock_graph(F, irg);
2423 /* we may have blocks without extended blocks, bad for instance */
2424 if (ARR_LEN(lists->blk_list)) {
2425 ird_set_irg_link(irg, lists->blk_list);
2426 dump_block_graph(F, irg);
2429 DEL_ARR_F(lists->extbb_list);
2430 DEL_ARR_F(lists->blk_list);
2435 /* Close the vcg information for the irg */
2436 fprintf(F, "}\n\n");
2442 /* dumps a graph with type information */
2444 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2447 ir_graph *rem = current_ir_graph;
2449 int rem_dump_const_local;
2451 /* if a filter is set, dump only the irg's that match the filter */
2452 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2455 current_ir_graph = irg;
2456 rem_dump_const_local = dump_const_local;
2457 /* dumping types does not work with local nodes */
2458 dump_const_local = 0;
2460 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2461 else suffix1 = "-pure-wtypes";
2462 f = vcg_open(irg,suffix, suffix1);
2463 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2465 /* dump common ir graph */
2466 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2467 /* dump type info */
2468 type_walk_irg(irg, dump_type_info, NULL, f);
2469 inc_irg_visited(get_const_code_irg());
2470 /* dump edges from graph to type info */
2471 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2474 dump_const_local = rem_dump_const_local;
2475 current_ir_graph = rem;
2479 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2484 ir_graph *rem = current_ir_graph;
2485 int rem_dump_const_local;
2487 /* if a filter is set, dump only the irg's that match the filter */
2488 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2491 rem_dump_const_local = dump_const_local;
2492 /* dumping types does not work with local nodes */
2493 dump_const_local = 0;
2495 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2496 else suffix1 = "-wtypes";
2497 f = vcg_open(irg, suffix, suffix1);
2498 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2500 /* dump common blocked ir graph */
2501 construct_block_lists(irg);
2503 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2504 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2506 dump_graph_from_list(f, get_irp_irg(i));
2511 /* dump type info */
2512 current_ir_graph = irg;
2513 type_walk_irg(irg, dump_type_info, NULL, f);
2514 inc_irg_visited(get_const_code_irg());
2516 /* dump edges from graph to type info */
2517 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2520 dump_const_local = rem_dump_const_local;
2521 current_ir_graph = rem;
2524 /*---------------------------------------------------------------------*/
2525 /* The following routines dump a control flow graph. */
2526 /*---------------------------------------------------------------------*/
2529 dump_block_to_cfg(ir_node *block, void *env) {
2534 if (is_Block(block)) {
2535 /* This is a block. Dump a node for the block. */
2536 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2537 fprintf (F, "\" label: \"");
2538 if (block == get_irg_start_block(get_irn_irg(block)))
2539 fprintf(F, "Start ");
2540 if (block == get_irg_end_block(get_irn_irg(block)))
2543 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2544 PRINT_NODEID(block);
2546 fprintf(F, "info1:\"");
2548 /* the generic version. */
2549 dump_irnode_to_file(F, block);
2551 /* Check whether we have bad predecessors to color the block. */
2552 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2553 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2556 fprintf (F, "\""); /* closing quote of info */
2558 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2559 (block == get_irg_end_block(get_irn_irg(block))) )
2560 fprintf(F, " color:blue ");
2562 fprintf(F, " color:yellow ");
2565 /* Dump the edges */
2566 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2567 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2568 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2569 fprintf (F, "edge: { sourcename: \"");
2570 PRINT_NODEID(block);
2571 fprintf (F, "\" targetname: \"");
2573 fprintf (F, "\"}\n");
2576 /* Dump dominator/postdominator edge */
2577 if (dump_dominator_information_flag) {
2578 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2579 pred = get_Block_idom(block);
2580 fprintf (F, "edge: { sourcename: \"");
2581 PRINT_NODEID(block);
2582 fprintf (F, "\" targetname: \"");
2584 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2586 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2587 pred = get_Block_ipostdom(block);
2588 fprintf (F, "edge: { sourcename: \"");
2589 PRINT_NODEID(block);
2590 fprintf (F, "\" targetname: \"");
2592 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2599 dump_cfg (ir_graph *irg, const char *suffix)
2602 ir_graph *rem = current_ir_graph;
2603 int ipv = get_interprocedural_view();
2605 /* if a filter is set, dump only the irg's that match the filter */
2606 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2609 current_ir_graph = irg;
2611 f = vcg_open(irg, suffix, "-cfg");
2612 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2615 printf("Warning: dumping cfg not in interprocedural view!\n");
2616 set_interprocedural_view(0);
2619 /* walk over the blocks in the graph */
2620 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2621 dump_node(f, get_irg_bad(irg));
2623 set_interprocedural_view(ipv);
2625 current_ir_graph = rem;
2629 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2630 if (pset_find_ptr(mark_set, n)) return;
2632 pset_insert_ptr(mark_set, n);
2635 int i, start = is_Block(n) ? 0 : -1;
2636 dump_whole_node(n, F);
2637 for (i = start; i < get_irn_arity(n); ++i)
2638 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2641 /* Don't dump edges to nodes further out. These might be edges to
2642 nodes we already dumped, if there is a shorter path to these. */
2646 static int subgraph_counter = 0;
2647 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2650 pset *mark_set = pset_new_ptr(1);
2651 sprintf(buf, "-subg_%03d", subgraph_counter++);
2652 F = vcg_open(get_irn_irg(root), suffix, buf);
2653 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2654 descend_and_dump(F, root, depth, mark_set);
2660 static int weight_overall(int rec, int loop) {
2661 return 2*rec + loop;
2664 static int compute_color (int my, int max) {
2671 /* if small, scale to the full color range. */
2673 my = my * (n_colors/max);
2675 step = 1 + (max / n_colors);
2679 return base_color + n_colors - color;
2682 static int get_entity_color(entity *ent) {
2683 ir_graph *irg = get_entity_irg(ent);
2687 int rec_depth = get_irg_recursion_depth(irg);
2688 int loop_depth = get_irg_loop_depth(irg);
2689 int overall_depth = weight_overall(rec_depth, loop_depth);
2691 int max_rec_depth = irp->max_callgraph_recursion_depth;
2692 int max_loop_depth = irp->max_callgraph_loop_depth;
2693 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2695 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2696 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2697 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2699 return my_overall_color;
2703 void dump_callgraph(const char *suffix) {
2706 int rem = edge_label;
2708 //ident *prefix = new_id_from_str("java/");
2710 F = vcg_open_name("Callgraph", suffix);
2711 dump_vcg_header(F, "Callgraph", NULL);
2713 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2714 ir_graph *irg = get_irp_irg(i);
2715 entity *ent = get_irg_entity(irg);
2716 int j, n_callees = get_irg_n_callees(irg);
2718 /* Do not dump runtime system. */
2719 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2721 dump_entity_node(F, ent, get_entity_color(ent));
2722 for (j = 0; j < n_callees; ++j) {
2723 entity *c = get_irg_entity(get_irg_callee(irg, j));
2724 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2725 int be = is_irg_callee_backedge(irg, j);
2728 "label:\"recursion %d\" color:%d" :
2729 "label:\"calls %d\" color:%d";
2730 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2738 /* Dump all irgs in interprocedural view to a single file. */
2739 void dump_all_cg_block_graph(const char *suffix) {
2742 int rem_view = get_interprocedural_view();
2743 set_interprocedural_view(1);
2745 f = vcg_open_name("All_graphs", suffix);
2746 dump_vcg_header(f, "All_graphs", NULL);
2748 /* collect nodes in all irgs reachable in call graph*/
2749 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2750 ird_set_irg_link(get_irp_irg(i), NULL);
2752 cg_walk(clear_link, collect_node, NULL);
2754 /* dump all graphs */
2755 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2756 current_ir_graph = get_irp_irg(i);
2757 assert(ird_get_irg_link(current_ir_graph));
2758 dump_graph_from_list(f, current_ir_graph);
2759 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2763 set_interprocedural_view(rem_view);
2766 /*---------------------------------------------------------------------*/
2767 /* the following routines dumps type information without any ir nodes. */
2768 /*---------------------------------------------------------------------*/
2771 dump_type_graph (ir_graph *irg, const char *suffix)
2775 rem = current_ir_graph;
2777 /* if a filter is set, dump only the irg's that match the filter */
2778 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2780 current_ir_graph = irg;
2782 f = vcg_open(irg, suffix, "-type");
2783 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2785 /* walk over the blocks in the graph */
2786 type_walk_irg(irg, dump_type_info, NULL, f);
2787 /* The walker for the const code can be called several times for the
2788 same (sub) expression. So that no nodes are dumped several times
2789 we decrease the visited flag of the corresponding graph after each
2790 walk. So now increase it finally. */
2791 inc_irg_visited(get_const_code_irg());
2794 current_ir_graph = rem;
2798 dump_all_types (const char *suffix)
2800 FILE *f = vcg_open_name("All_types", suffix);
2801 dump_vcg_header(f, "All_types", NULL);
2802 type_walk(dump_type_info, NULL, f);
2803 inc_irg_visited(get_const_code_irg());
2808 dump_class_hierarchy (int entities, const char *suffix)
2810 FILE *f = vcg_open_name("class_hierarchy", suffix);
2814 env.dump_ent = entities;
2815 dump_vcg_header(f, "class_hierarchy", NULL);
2816 type_walk(dump_class_hierarchy_node, NULL, &env);
2820 /*---------------------------------------------------------------------*/
2821 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2823 /* dump_ir_block_graph */
2825 /* dump_type_graph */
2826 /* dump_ir_graph_w_types */
2827 /*---------------------------------------------------------------------*/
2829 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2831 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2832 dmp_grph(get_irp_irg(i), suffix);
2836 /*--------------------------------------------------------------------------------*
2837 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2838 * packed together in one subgraph/box *
2839 *--------------------------------------------------------------------------------*/
2841 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2842 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2844 ir_loop *son = NULL;
2846 /* Dump a new loop node. */
2847 dump_loop_node(F, loop);
2849 /* Dump the loop elements. */
2851 for(i = 0; i < get_loop_n_elements(loop); i++) {
2852 le = get_loop_element(loop, i);
2854 if (get_kind(son) == k_ir_loop) {
2856 /* We are a loop son -> Recurse */
2858 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2859 fprintf(F, "\" }\n");
2860 fprintf (F, "edge: {sourcename: \"");
2862 fprintf (F, "\" targetname: \"");
2864 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2865 loop_node_started = 0;
2867 dump_loop_son_edge(F, loop, son_number++);
2868 dump_loops_standalone(F, son);
2869 } else if (get_kind(son) == k_ir_node) {
2870 /* We are a loop node -> Collect firm nodes */
2872 ir_node *n = le.node;
2875 if (!loop_node_started) {
2876 /* Start a new node which contains all firm nodes of the current loop */
2877 fprintf (F, "node: { title: \"");
2879 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2880 loop_node_started = 1;
2886 bad |= dump_node_label(F, n);
2887 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2888 if (has_backedges(n)) fprintf(F, "\t loop head!");
2889 } else { /* for callgraph loop tree */
2891 assert(get_kind(son) == k_ir_graph);
2893 /* We are a loop node -> Collect firm graphs */
2894 n = (ir_graph *)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;
2905 fprintf (F, " %s", get_irg_dump_name(n));
2906 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2910 if (loop_node_started) {
2911 fprintf(F, "\" }\n");
2912 fprintf (F, "edge: {sourcename: \"");
2914 fprintf (F, "\" targetname: \"");
2916 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2917 loop_node_started = 0;
2921 void dump_loop_tree(ir_graph *irg, const char *suffix)
2924 ir_graph *rem = current_ir_graph;
2925 int el_rem = edge_label;
2928 /* if a filter is set, dump only the irg's that match the filter */
2929 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2931 current_ir_graph = irg;
2933 f = vcg_open(irg, suffix, "-looptree");
2934 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2936 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2940 edge_label = el_rem;
2941 current_ir_graph = rem;
2944 void dump_callgraph_loop_tree(const char *suffix) {
2946 F = vcg_open_name("Callgraph_looptree", suffix);
2947 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2948 dump_loops_standalone(F, irp->outermost_cg_loop);
2953 /*-----------------------------------------------------------------------------*/
2954 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2955 /*-----------------------------------------------------------------------------*/
2957 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2958 int i, son_number = 0, node_number = 0;
2960 if (dump_loop_information_flag) dump_loop_node(F, loop);
2962 for (i = 0; i < get_loop_n_elements(loop); i++) {
2963 loop_element le = get_loop_element(loop, i);
2964 if (*(le.kind) == k_ir_loop) {
2965 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2967 collect_nodeloop(F, le.son, loopnodes);
2969 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2970 eset_insert(loopnodes, le.node);
2975 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2978 for(i = 0; i < get_loop_n_elements(loop); i++) {
2979 loop_element le = get_loop_element(loop, i);
2980 if (*(le.kind) == k_ir_loop) {
2982 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2984 if (is_Block(le.node)) start = 0; else start = -1;
2985 for (j = start; j < get_irn_arity(le.node); j++) {
2986 ir_node *pred = get_irn_n(le.node, j);
2987 if (!eset_contains(loopnodes, pred)) {
2988 eset_insert(extnodes, pred);
2989 if (!is_Block(pred)) {
2990 pred = get_nodes_block(pred);
2991 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2999 void dump_loop(ir_loop *l, const char *suffix) {
3002 eset *loopnodes = eset_create();
3003 eset *extnodes = eset_create();
3006 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3007 F = vcg_open_name (name, suffix);
3008 dump_vcg_header(F, name, NULL);
3010 /* collect all nodes to dump */
3011 collect_nodeloop(F, l, loopnodes);
3012 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3014 /* build block lists */
3015 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3016 set_irn_link(n, NULL);
3017 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3018 set_irn_link(n, NULL);
3019 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3021 b = get_nodes_block(n);
3022 set_irn_link(n, get_irn_link(b));
3025 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3027 b = get_nodes_block(n);
3028 set_irn_link(n, get_irn_link(b));
3032 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3034 fprintf(F, "graph: { title: \"");
3036 fprintf(F, "\" label: \"");
3037 dump_node_opcode(F, b);
3038 fprintf (F, " %ld", get_irn_node_nr(b));
3039 fprintf(F, "\" status:clustered color:yellow\n");
3041 /* dump the blocks edges */
3042 dump_ir_data_edges(F, b);
3044 /* dump the nodes that go into the block */
3045 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3046 if (eset_contains(extnodes, n))
3047 overrule_nodecolor = ird_color_lightblue;
3049 overrule_nodecolor = ird_color_default;
3050 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3053 /* Close the vcg information for the block */
3055 dump_const_node_local(F, b);
3058 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3060 fprintf(F, "graph: { title: \"");
3062 fprintf(F, "\" label: \"");
3063 dump_node_opcode(F, b);
3064 fprintf (F, " %ld", get_irn_node_nr(b));
3065 fprintf(F, "\" status:clustered color:lightblue\n");
3067 /* dump the nodes that go into the block */
3068 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3069 if (!eset_contains(loopnodes, n))
3070 overrule_nodecolor = ird_color_lightblue;
3072 overrule_nodecolor = ird_color_default;
3073 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3076 /* Close the vcg information for the block */
3078 dump_const_node_local(F, b);
3082 eset_destroy(loopnodes);
3083 eset_destroy(extnodes);