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(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, type *S, 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, 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, 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, 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, type *E, int item, const char *fmt, ...)
375 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
376 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
377 vfprintf(F, fmt, ap);
382 /*-----------------------------------------------------------------*/
383 /* global and ahead declarations */
384 /*-----------------------------------------------------------------*/
386 static void dump_whole_node(ir_node *n, void *env);
387 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
389 /*-----------------------------------------------------------------*/
390 /* Helper functions. */
391 /*-----------------------------------------------------------------*/
394 * This map is used as a private link attr to be able to call dumper
395 * anywhere without destroying link fields.
397 static pmap *irdump_link_map = NULL;
399 /** NOT A STANDARD LIBFIRM INIT METHOD
401 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
402 * are off, we want to have as few interferences as possible. Therefore the
403 * initialization is performed lazily and not called from within init_firm.
405 * Creates the link attribute map. */
406 static void init_irdump(void) {
407 /* We need a new, empty map. */
408 if (irdump_link_map) pmap_destroy(irdump_link_map);
409 irdump_link_map = pmap_create();
410 if (!dump_file_filter_id)
411 dump_file_filter_id = new_id_from_str("");
414 * Returns the private link field.
416 static void *ird_get_irn_link(ir_node *n) {
418 if (!irdump_link_map) return NULL;
420 if (pmap_contains(irdump_link_map, (void *)n))
421 res = pmap_get(irdump_link_map, (void *)n);
426 * Sets the private link field.
428 static void ird_set_irn_link(ir_node *n, void *x) {
429 if (!irdump_link_map)
431 pmap_insert(irdump_link_map, (void *)n, x);
435 * Gets the private link field of an irg.
437 static void *ird_get_irg_link(ir_graph *irg) {
439 if (!irdump_link_map) return NULL;
441 if (pmap_contains(irdump_link_map, (void *)irg))
442 res = pmap_get(irdump_link_map, (void *)irg);
447 * Sets the private link field of an irg.
449 static void ird_set_irg_link(ir_graph *irg, void *x) {
450 if (!irdump_link_map) init_irdump();
451 pmap_insert(irdump_link_map, (void *)irg, x);
455 * Walker, clears the private link field.
457 static void clear_link(ir_node * node, void * env) {
458 ird_set_irn_link(node, NULL);
462 * If the entity has a ld_name, returns it if the dump_ld_name is set,
463 * else returns the name of the entity.
465 static const char *_get_ent_dump_name(entity *ent, int dump_ld_name) {
467 return "<NULL entity>";
469 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
470 if (ent->ld_name) return get_id_str(ent->ld_name);
472 return get_id_str(ent->name);
476 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
477 * else returns the name of the entity.
479 const char *get_ent_dump_name(entity *ent) {
480 return _get_ent_dump_name(ent, dump_ld_name);
483 /* Returns the name of an IRG. */
484 const char *get_irg_dump_name(ir_graph *irg) {
485 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
486 return _get_ent_dump_name(get_irg_entity(irg), 1);
490 * Returns non-zero if a node is in floating state.
492 static int node_floats(ir_node *n) {
493 return ((get_irn_pinned(n) == op_pin_state_floats) &&
494 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
498 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
500 static void collect_node(ir_node * node, void *env) {
503 || get_irn_op(node) == op_Bad
504 || get_irn_op(node) == op_Unknown
505 || get_irn_op(node) == op_NoMem) {
506 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
507 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
508 ARR_APP1(ir_node *, arr, node);
509 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
511 ir_node * block = get_nodes_block(node);
514 /* this node is in a Bad block, so we must place it into the graph's list */
515 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
516 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
517 ARR_APP1(ir_node *, arr, node);
518 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
521 ird_set_irn_link(node, ird_get_irn_link(block));
522 ird_set_irn_link(block, node);
527 /** Construct lists to walk ir block-wise.
529 * Collects all blocks, nodes not op_pin_state_pinned,
530 * Bad, NoMem and Unknown into a flexible array in link field of
531 * irg they belong to. Sets the irg link field to NULL in all
532 * graphs not visited.
533 * Free the list with DEL_ARR_F().
535 static ir_node **construct_block_lists(ir_graph *irg) {
536 int i, rem_view = get_interprocedural_view();
537 ir_graph *rem = current_ir_graph;
538 current_ir_graph = irg;
540 for (i = 0; i < get_irp_n_irgs(); i++)
541 ird_set_irg_link(get_irp_irg(i), NULL);
543 irg_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
545 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
546 set_interprocedural_view(0);
548 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
549 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
550 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
551 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
553 set_interprocedural_view(rem_view);
555 current_ir_graph = rem;
556 return ird_get_irg_link(irg);
559 typedef struct _list_tuple {
561 ir_extblk **extbb_list;
564 /** Construct lists to walk ir extended block-wise.
565 * Free the lists in the tuple with DEL_ARR_F().
567 static list_tuple *construct_extblock_lists(ir_graph *irg) {
568 ir_node **blk_list = construct_block_lists(irg);
570 ir_graph *rem = current_ir_graph;
571 list_tuple *lists = xmalloc(sizeof(*lists));
573 current_ir_graph = irg;
575 lists->blk_list = NEW_ARR_F(ir_node *, 0);
576 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
578 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
581 if (is_Block(blk_list[i])) {
582 ext = get_Block_extbb(blk_list[i]);
584 if (extbb_not_visited(ext)) {
585 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
586 mark_extbb_visited(ext);
590 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
593 current_ir_graph = rem;
595 ird_set_irg_link(irg, lists);
599 /*-----------------------------------------------------------------*/
600 /* Routines to dump information about a single ir node. */
601 /*-----------------------------------------------------------------*/
604 * dump the name of a node n to the File F.
606 int dump_node_opcode(FILE *F, ir_node *n)
609 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
611 /* call the dump_node operation if available */
613 return ops->dump_node(n, F, dump_node_opcode_txt);
615 /* implementation for default nodes */
616 switch (get_irn_opcode(n)) {
621 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
622 assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
627 if (get_SymConst_kind(n) == symconst_addr_name) {
628 /* don't use get_SymConst_ptr_info as it mangles the name. */
629 fprintf (F, "SymC %s", get_id_str(get_SymConst_name(n)));
630 } else if (get_SymConst_kind(n) == symconst_addr_ent) {
631 assert(get_SymConst_entity(n));
632 assert(is_entity(get_SymConst_entity(n)));
633 fprintf (F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
635 assert(get_kind(get_SymConst_type(n)) == k_type);
636 assert(get_type_ident(get_SymConst_type(n)));
637 fprintf (F, "SymC %s ", get_type_name_ex(get_SymConst_type(n), &bad));
638 if (get_SymConst_kind(n) == symconst_type_tag)
646 if (!get_interprocedural_view())
653 ir_node *pred = get_Proj_pred(n);
655 if (get_irn_opcode(pred) == iro_Cond
656 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
657 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
658 fprintf (F, "defProj");
666 if (get_interprocedural_view()) {
667 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
672 case iro_CallBegin: {
673 ir_node *addr = get_CallBegin_ptr(n);
675 if (get_irn_op(addr) == op_Sel)
676 ent = get_Sel_entity(addr);
677 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
678 ent = get_SymConst_entity(addr);
679 fprintf (F, "%s", get_irn_opname(n));
680 if (ent) fprintf (F, " %s", get_entity_name(ent));
684 fprintf (F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
687 fprintf (F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
692 fprintf (F, "%s", get_irn_opname(n));
699 * Dump the mode of a node n to a file F.
700 * Ignore modes that are "always known".
702 static int dump_node_mode(FILE *F, ir_node *n)
705 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
708 /* call the dump_node operation if available */
710 return ops->dump_node(n, F, dump_node_mode_txt);
712 /* default implementation */
713 iro = get_irn_opcode(n);
725 ir_mode *mode = get_irn_mode(n);
727 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
728 (mode != mode_T || iro == iro_Proj))
729 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
737 * Dump the type of a node n to a file F if it's known.
739 static int dump_node_typeinfo(FILE *F, ir_node *n) {
742 if (opt_dump_analysed_type_info) {
743 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
744 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
745 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 }
862 /** the Proj lookup table */
863 static const proj_lookup_t proj_lut[] = {
864 #define E(a) ARR_SIZE(a), a
865 { iro_Start, E(start_lut) },
866 { iro_Cond, E(cond_lut) },
867 { iro_Call, E(call_lut) },
868 { iro_Quot, E(quot_lut) },
869 { iro_DivMod, E(divmod_lut) },
870 { iro_Div, E(div_lut) },
871 { iro_Mod, E(mod_lut) },
872 { iro_Load, E(load_lut) },
873 { iro_Store, E(store_lut) },
874 { iro_Alloc, E(alloc_lut) }
879 * Dump additional node attributes of some nodes to a file F.
882 dump_node_nodeattr(FILE *F, ir_node *n)
888 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
890 /* call the dump_node operation if available */
892 return ops->dump_node(n, F, dump_node_nodeattr_txt);
894 switch (get_irn_opcode(n)) {
896 if (0 && get_interprocedural_view()) {
897 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
902 pred = get_Proj_pred(n);
903 proj_nr = get_Proj_proj(n);
905 code = get_irn_opcode(pred);
908 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
909 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
910 fprintf (F, "Arg %ld ", proj_nr);
912 unsigned i, j, f = 0;
914 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
915 if (code == proj_lut[i].code) {
916 for (j = 0; j < proj_lut[i].num_data; ++j) {
917 if (proj_nr == proj_lut[i].data[j].nr) {
918 fprintf (F, "%s ", proj_lut[i].data[j].name);
927 fprintf (F, "%ld ", proj_nr);
928 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
929 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
931 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
937 proj_nr = get_Filter_proj(n);
938 if (! get_interprocedural_view()) {
940 pred = get_Filter_pred(n);
944 fprintf (F, "%ld ", proj_nr);
947 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
950 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
953 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
956 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
967 #include "execution_frequency.h"
968 #include "callgraph.h"
970 void dump_node_ana_vals(FILE *F, ir_node *n) {
972 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
973 get_irn_exec_freq(n),
974 get_irg_method_execution_frequency(get_irn_irg(n)),
975 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
976 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
981 /* Dumps a node label without the enclosing ". */
982 int dump_node_label(FILE *F, ir_node *n) {
985 bad |= dump_node_opcode(F, n);
986 bad |= dump_node_mode(F, n);
988 bad |= dump_node_typeinfo(F, n);
989 bad |= dump_node_nodeattr(F, n);
990 fprintf(F, "%ld", get_irn_node_nr(n));
997 * Dumps the attributes of a node n into the file F.
998 * Currently this is only the color of a node.
1000 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1005 print_vcg_color(F, ird_color_red);
1009 if (dump_node_vcgattr_hook)
1010 if (dump_node_vcgattr_hook(F, node, local))
1013 n = local ? local : node;
1015 if (overrule_nodecolor != ird_color_default) {
1016 print_vcg_color(F, overrule_nodecolor);
1020 switch (get_irn_opcode(n)) {
1027 print_vcg_color(F, ird_color_blue);
1030 if (is_Block_dead(n))
1031 print_vcg_color(F, ird_color_lightred);
1033 print_vcg_color(F, ird_color_lightyellow);
1036 print_vcg_color(F, ird_color_green);
1042 print_vcg_color(F, ird_color_yellow);
1045 PRINT_DEFAULT_NODE_ATTR;
1051 * Dump the node information of a node n to a file F.
1053 static INLINE int dump_node_info(FILE *F, ir_node *n)
1056 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1058 fprintf (F, " info1: \"");
1059 bad = dump_irnode_to_file(F, n);
1060 /* call the dump_node operation if available */
1062 bad = ops->dump_node(n, F, dump_node_info_txt);
1069 * checks whether a node is "constant-like" ie can be treated "block-less"
1072 int is_constlike_node(ir_node *n) {
1073 ir_op *op = get_irn_op(n);
1074 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1078 /** outputs the predecessors of n, that are constants, local. I.e.,
1079 generates a copy of the constant predecessors for each node called with. */
1080 static void dump_const_node_local(FILE *F, ir_node *n) {
1082 if (!get_opt_dump_const_local()) return;
1084 /* Use visited flag to avoid outputting nodes twice.
1085 initialize it first. */
1086 for (i = 0; i < get_irn_arity(n); i++) {
1087 ir_node *con = get_irn_n(n, i);
1088 if (is_constlike_node(con)) {
1089 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1093 for (i = 0; i < get_irn_arity(n); i++) {
1094 ir_node *con = get_irn_n(n, i);
1095 if (is_constlike_node(con) && irn_not_visited(con)) {
1098 mark_irn_visited(con);
1099 /* Generate a new name for the node by appending the names of
1101 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1102 fprintf(F, " label: \"");
1103 bad |= dump_node_label(F, con);
1105 bad |= dump_node_info(F, con);
1106 dump_node_vcgattr(F, n, con, bad);
1112 /** If the block of an edge is a const_like node, dump it local with an edge */
1113 static void dump_const_block_local(FILE *F, ir_node *n) {
1116 if (!get_opt_dump_const_local()) return;
1118 blk = get_nodes_block(n);
1119 if (is_constlike_node(blk)) {
1122 /* Generate a new name for the node by appending the names of
1124 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1125 fprintf(F, "\" label: \"");
1126 bad |= dump_node_label(F, blk);
1128 bad |= dump_node_info(F, blk);
1129 dump_node_vcgattr(F, n, blk, bad);
1132 fprintf (F, "edge: { sourcename: \"");
1134 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1136 if (dump_edge_vcgattr_hook) {
1138 if (dump_edge_vcgattr_hook(F, n, -1)) {
1143 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1148 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1153 * prints the error message of a node to a file F as info2.
1155 static void INLINE print_node_error(FILE *F, const char *err_msg)
1160 fprintf (F, " info2: \"%s\"", err_msg);
1164 * prints debug messages of a node to file F as info3.
1166 static void print_dbg_info(FILE *F, dbg_info *dbg)
1170 if (__dbg_info_snprint) {
1172 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1173 fprintf (F, " info3: \"%s\"\n", buf);
1180 static void dump_node(FILE *F, ir_node *n)
1185 if (get_opt_dump_const_local() && is_constlike_node(n))
1188 /* dump this node */
1189 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1191 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1192 bad |= dump_node_label(F, n);
1193 dump_node_ana_vals(F, n);
1194 //dump_node_ana_info(F, n);
1196 bad |= dump_node_info(F, n);
1197 print_node_error(F, p);
1198 print_dbg_info(F, get_irn_dbg_info(n));
1199 dump_node_vcgattr(F, n, NULL, bad);
1201 dump_const_node_local(F, n);
1203 if(dump_node_edge_hook)
1204 dump_node_edge_hook(F, n);
1206 dump_irn_chi_term(F, n);
1207 dump_irn_state(F, n);
1211 /** dump the edge to the block this node belongs to */
1213 dump_ir_block_edge(FILE *F, ir_node *n) {
1214 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1215 if (is_no_Block(n)) {
1216 ir_node *block = get_nodes_block(n);
1218 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1219 dump_const_block_local(F, n);
1222 fprintf (F, "edge: { sourcename: \"");
1224 fprintf (F, "\" targetname: ");
1225 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1227 if (dump_edge_vcgattr_hook) {
1229 if (dump_edge_vcgattr_hook(F, n, -1)) {
1234 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1239 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1245 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1247 * do not use get_nodes_block() here, will fail
1248 * if the irg is not pinned.
1250 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1251 fprintf (F, INTRA_DATA_EDGE_ATTR);
1253 fprintf (F, INTER_DATA_EDGE_ATTR);
1257 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1259 * do not use get_nodes_block() here, will fail
1260 * if the irg is not pinned.
1262 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1263 fprintf (F, INTRA_MEM_EDGE_ATTR);
1265 fprintf (F, INTER_MEM_EDGE_ATTR);
1269 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1272 if (dump_edge_vcgattr_hook)
1273 if (dump_edge_vcgattr_hook(F, from, to))
1276 if (dump_backedge_information_flag && is_backedge(from, to))
1277 fprintf (F, BACK_EDGE_ATTR);
1279 switch (get_irn_opcode(from)) {
1281 fprintf (F, CF_EDGE_ATTR);
1283 case iro_Start: break;
1286 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1287 fprintf (F, CF_EDGE_ATTR);
1288 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1289 fprintf (F, INTER_MEM_EDGE_ATTR);
1297 print_data_edge_vcgattr(F, from, to);
1302 print_mem_edge_vcgattr(F, from, to);
1304 print_data_edge_vcgattr(F, from, to);
1308 print_data_edge_vcgattr(F, from, to);
1313 print_mem_edge_vcgattr(F, from, to);
1315 print_data_edge_vcgattr(F, from, to);
1322 print_data_edge_vcgattr(F, from, to);
1329 print_mem_edge_vcgattr(F, from, to);
1331 print_data_edge_vcgattr(F, from, to);
1343 print_data_edge_vcgattr(F, from, to);
1346 if (get_irn_modecode(from) == irm_M)
1347 fprintf (F, INTER_MEM_EDGE_ATTR);
1349 print_data_edge_vcgattr(F, from, to);
1356 print_mem_edge_vcgattr(F, from, to);
1358 print_data_edge_vcgattr(F, from, to);
1361 print_mem_edge_vcgattr(F, from, to);
1363 case iro_Tuple: break;
1366 switch (get_irn_modecode(from)) {
1368 fprintf (F, CF_EDGE_ATTR);
1371 fprintf (F, INTER_MEM_EDGE_ATTR);
1374 print_data_edge_vcgattr(F, from, to);
1378 case iro_Bad: break;
1379 case iro_Unknown: break;
1381 switch (get_irn_modecode(from)) {
1383 fprintf (F, INTRA_MEM_EDGE_ATTR);
1386 fprintf (F, CF_EDGE_ATTR);
1389 print_data_edge_vcgattr(F, from, to);
1397 /* dump edges to our inputs */
1399 dump_ir_data_edges(FILE *F, ir_node *n) {
1401 unsigned long visited = get_irn_visited(n);
1403 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1406 for (i = 0; i < get_irn_arity(n); i++) {
1407 ir_node * pred = get_irn_n(n, i);
1410 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1411 continue; /* pred not dumped */
1413 if (dump_backedge_information_flag && is_backedge(n, i))
1414 fprintf (F, "backedge: {sourcename: \"");
1416 fprintf (F, "edge: {sourcename: \"");
1418 fprintf (F, "\" targetname: ");
1419 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1420 PRINT_CONSTID(n, pred);
1422 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1424 fprintf (F, " label: \"%d\" ", i);
1425 print_edge_vcgattr(F, n, i);
1430 /** Dumps a node and its edges but not the block edge
1433 dump_node_wo_blockedge (ir_node *n, void *env) {
1436 dump_ir_data_edges(F, n);
1439 /** Dumps a node and its edges.
1442 dump_whole_node (ir_node *n, void *env) {
1444 dump_node_wo_blockedge(n, env);
1445 if (!node_floats(n)) dump_ir_block_edge(F, n);
1449 dump_const_node(ir_node *n, void *env) {
1450 if (is_Block(n)) return;
1451 dump_node_wo_blockedge(n, env);
1454 /***********************************************************************/
1455 /* the following routines dump the nodes/irgs bracketed to graphs. */
1456 /***********************************************************************/
1458 /** Dumps a constant expression as entity initializer, array bound ...
1460 static void dump_const_expression(FILE *F, ir_node *value) {
1461 ir_graph *rem = current_ir_graph;
1462 int rem_dump_const_local = dump_const_local;
1463 dump_const_local = 0;
1464 current_ir_graph = get_const_code_irg();
1465 irg_walk(value, dump_const_node, NULL, F);
1466 /* Decrease visited flag so that we walk with the same flag for the next
1467 expression. This guarantees that we don't dump the same node twice,
1468 as for const expressions cse is performed to save memory. */
1469 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1470 current_ir_graph = rem;
1471 dump_const_local = rem_dump_const_local;
1474 /** Dump a block as graph containing its nodes.
1476 * Expects to find nodes belonging to the block as list in its
1478 * Dumps the edges of all nodes including itself. */
1480 dump_whole_block(FILE *F, ir_node *block) {
1482 dumper_colors color = ird_color_yellow;
1484 assert(is_Block(block));
1486 fprintf(F, "graph: { title: \"");
1487 PRINT_NODEID(block);
1488 fprintf(F, "\" label: \"");
1489 dump_node_label(F, block);
1491 if (get_opt_dump_abstvals())
1492 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1495 /* colorize blocks */
1496 if (! get_Block_matured(block))
1497 color = ird_color_red;
1498 if (is_Block_dead(block))
1499 color = ird_color_orange;
1501 fprintf(F, "\" status:clustered ");
1502 print_vcg_color(F, color);
1505 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1506 dump_node_info(F, block);
1507 print_dbg_info(F, get_irn_dbg_info(block));
1509 /* dump the blocks edges */
1510 dump_ir_data_edges(F, block);
1512 /* dump the nodes that go into the block */
1513 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1515 dump_ir_data_edges(F, node);
1518 /* Close the vcg information for the block */
1520 dump_const_node_local(F, block);
1522 dump_irn_chi_term(F, block);
1527 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1528 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1530 dump_block_graph(FILE *F, ir_graph *irg) {
1532 ir_graph *rem = current_ir_graph;
1533 ir_node **arr = ird_get_irg_link(irg);
1534 current_ir_graph = irg;
1536 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1537 ir_node * node = arr[i];
1538 if (is_Block(node)) {
1539 /* Dumps the block and all the nodes in the block, which are to
1540 be found in Block->link. */
1541 dump_whole_block(F, node);
1543 /* Nodes that are not in a Block. */
1545 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1546 dump_const_block_local(F, node);
1548 dump_ir_data_edges(F, node);
1552 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1553 dump_loop_nodes_into_graph(F, irg);
1555 current_ir_graph = rem;
1559 * Dump the info for an irg.
1560 * Parsed by XVCG but not shown. use yComp.
1562 static void dump_graph_info(FILE *F, ir_graph *irg) {
1563 fprintf(F, "info1: \"");
1564 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1568 /** Dumps an irg as a graph clustered by block nodes.
1569 * If interprocedural view edges can point to nodes out of this graph.
1571 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1572 entity *ent = get_irg_entity(irg);
1574 fprintf(F, "graph: { title: \"");
1576 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1577 get_ent_dump_name(ent));
1579 dump_graph_info(F, irg);
1580 print_dbg_info(F, get_entity_dbg_info(ent));
1582 dump_block_graph(F, irg);
1584 /* Close the vcg information for the irg */
1585 fprintf(F, "}\n\n");
1588 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1589 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1591 dump_extblock_graph(FILE *F, ir_graph *irg) {
1593 ir_graph *rem = current_ir_graph;
1594 ir_extblk **arr = ird_get_irg_link(irg);
1595 current_ir_graph = irg;
1598 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1599 ir_extblk *extbb = arr[i];
1600 ir_node *leader = get_extbb_leader(extbb);
1603 fprintf(F, "graph: { title: \"");
1604 PRINT_EXTBBID(leader);
1605 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1606 get_irn_node_nr(leader));
1608 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1609 ir_node * node = extbb->blks[j];
1610 if (is_Block(node)) {
1611 /* Dumps the block and all the nodes in the block, which are to
1612 be found in Block->link. */
1613 dump_whole_block(F, node);
1615 /* Nodes that are not in a Block. */
1617 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1618 dump_const_block_local(F, node);
1620 dump_ir_data_edges(F, node);
1626 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1627 dump_loop_nodes_into_graph(F, irg);
1629 current_ir_graph = rem;
1634 /*******************************************************************/
1635 /* Basic type and entity nodes and edges. */
1636 /*******************************************************************/
1638 /** dumps the edges between nodes and their type or entity attributes. */
1639 static void dump_node2type_edges(ir_node *n, void *env)
1644 switch (get_irn_opcode(n)) {
1646 /* @@@ some consts have an entity */
1649 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1650 || (get_SymConst_kind(n) ==symconst_size))
1652 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1656 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1659 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1662 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1665 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1668 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1676 static int print_type_info(FILE *F, type *tp) {
1679 if (get_type_state(tp) == layout_undefined) {
1680 fprintf(F, "state: layout_undefined\n");
1682 fprintf(F, "state: layout_fixed,\n");
1684 if (get_type_mode(tp))
1685 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1686 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1691 static void print_typespecific_info(FILE *F, type *tp) {
1692 switch (get_type_tpop_code(tp)) {
1695 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1702 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1703 fprintf(F, "params: %d\n", get_method_n_params(tp));
1704 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1712 case tpo_enumeration:
1726 static void print_typespecific_vcgattr(FILE *F, type *tp) {
1727 switch (get_type_tpop_code(tp)) {
1730 if (peculiarity_existent == get_class_peculiarity(tp))
1731 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1733 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1737 fprintf (F, " " TYPE_METH_NODE_ATTR);
1748 case tpo_enumeration:
1762 int dump_type_node(FILE *F, type *tp)
1766 fprintf (F, "node: {title: ");
1768 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1769 fprintf (F, " info1: \"");
1771 bad |= print_type_info(F, tp);
1772 print_typespecific_info(F, tp);
1774 dump_type_to_file(F, tp, dump_verbosity_max);
1776 fprintf (F, "\"\n");
1777 print_dbg_info(F, get_type_dbg_info(tp));
1778 print_typespecific_vcgattr(F, tp);
1785 #define X(a) case a: fprintf(F, #a); break
1786 void dump_entity_node(FILE *F, entity *ent, int color)
1788 fprintf (F, "node: {title: \"");
1789 PRINT_ENTID(ent); fprintf(F, "\"");
1790 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1791 fprintf (F, "label: ");
1792 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1794 fprintf(F, "color:%d", color);
1796 fprintf (F, ENTITY_NODE_ATTR);
1797 fprintf (F, "\n info1: \"");
1799 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1802 print_dbg_info(F, get_entity_dbg_info(ent));
1807 static void dump_enum_item(FILE *F, type *tp, int pos)
1810 ident *id = get_enumeration_nameid(tp, pos);
1811 tarval *tv = get_enumeration_enum(tp, pos);
1813 tarval_snprintf(buf, sizeof(buf), tv);
1814 fprintf (F, "node: {title: \"");
1815 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1816 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1817 fprintf (F, "label: ");
1818 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1819 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1822 /* dumps a type or entity and it's edges. */
1824 dump_type_info(type_or_ent *tore, void *env) {
1826 int i = 0; /* to shutup gcc */
1828 /* dump this type or entity */
1830 switch (get_kind(tore)) {
1833 entity *ent = (entity *)tore;
1836 dump_entity_node(F, ent, 0);
1838 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1839 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1840 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1841 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1842 if (is_Class_type(get_entity_owner(ent))) {
1843 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1844 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1846 /* attached subgraphs */
1847 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1848 if (is_atomic_entity(ent)) {
1849 value = get_atomic_ent_value(ent);
1851 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1852 /* DDMN(value); $$$ */
1853 dump_const_expression(F, value);
1856 if (is_compound_entity(ent)) {
1857 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1858 value = get_compound_ent_value(ent, i);
1860 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1861 dump_const_expression(F, value);
1862 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1864 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1865 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1866 get_compound_ent_value_member(ent, i), i);
1875 type *tp = (type *)tore;
1876 dump_type_node(F, tp);
1877 /* and now the edges */
1878 switch (get_type_tpop_code(tp)) {
1881 for (i=0; i < get_class_n_supertypes(tp); i++)
1882 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1883 for (i=0; i < get_class_n_members(tp); i++)
1884 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1888 for (i=0; i < get_struct_n_members(tp); i++)
1889 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1893 for (i = 0; i < get_method_n_params(tp); i++)
1894 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1895 for (i = 0; i < get_method_n_ress(tp); i++)
1896 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1900 for (i = 0; i < get_union_n_members(tp); i++)
1901 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1905 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1906 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1907 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1908 ir_node *upper = get_array_upper_bound(tp, i);
1909 ir_node *lower = get_array_lower_bound(tp, i);
1910 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1911 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1912 dump_const_expression(F, upper);
1913 dump_const_expression(F, lower);
1917 case tpo_enumeration:
1919 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1920 dump_enum_item(F, tp, i);
1921 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1926 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1934 break; /* case k_type */
1937 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1939 } /* switch kind_or_entity */
1942 typedef struct _h_env {
1947 /** For dumping class hierarchies.
1948 * Dumps a class type node and a superclass edge.
1949 * If env->dump_ent dumps entities of classes and overwrites edges.
1952 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1955 int i = 0; /* to shutup gcc */
1957 /* dump this type or entity */
1958 switch (get_kind(tore)) {
1960 entity *ent = (entity *)tore;
1961 if (get_entity_owner(ent) == get_glob_type()) break;
1962 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1963 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1965 dump_entity_node(F, ent, 0);
1967 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1968 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1969 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
1971 } break; /* case k_entity */
1974 type *tp = (type *)tore;
1975 if (tp == get_glob_type()) break;
1976 switch (get_type_tpop_code(tp)) {
1978 dump_type_node(F, tp);
1979 /* and now the edges */
1980 for (i=0; i < get_class_n_supertypes(tp); i++)
1982 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1988 break; /* case k_type */
1991 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
1993 } /* switch kind_or_entity */
1996 /*******************************************************************/
1997 /* dump analysis information that is expressed in graph terms. */
1998 /*******************************************************************/
2000 /* dump out edges */
2002 dump_out_edge(ir_node *n, void *env) {
2005 for (i = 0; i < get_irn_n_outs(n); i++) {
2006 assert(get_irn_out(n, i));
2007 fprintf (F, "edge: {sourcename: \"");
2009 fprintf (F, "\" targetname: \"");
2010 PRINT_NODEID(get_irn_out(n, i));
2011 fprintf (F, "\" color: red linestyle: dashed");
2017 dump_loop_label(FILE *F, ir_loop *loop) {
2018 fprintf (F, "loop %d, %d sons, %d nodes",
2019 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2022 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2023 fprintf (F, " info1: \"");
2024 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2025 #if DEBUG_libfirm /* GL @@@ debug analyses */
2026 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2032 dump_loop_node(FILE *F, ir_loop *loop) {
2033 fprintf (F, "node: {title: \"");
2035 fprintf (F, "\" label: \"");
2036 dump_loop_label(F, loop);
2038 dump_loop_info(F, loop);
2044 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2046 fprintf (F, "edge: {sourcename: \"");
2048 fprintf (F, "\" targetname: \"");
2049 PRINT_NODEID(get_loop_node(loop, i));
2050 fprintf (F, "\" color: green");
2055 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2057 fprintf (F, "edge: {sourcename: \"");
2059 fprintf (F, "\" targetname: \"");
2060 PRINT_LOOPID(get_loop_son(loop, i));
2061 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2062 get_loop_element_pos(loop, get_loop_son(loop, i)));
2066 void dump_loops(FILE *F, ir_loop *loop) {
2068 /* dump this loop node */
2069 dump_loop_node(F, loop);
2071 /* dump edges to nodes in loop -- only if it is a real loop */
2072 if (get_loop_depth(loop) != 0) {
2073 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2074 dump_loop_node_edge(F, loop, i);
2077 for (i = 0; i < get_loop_n_sons(loop); i++) {
2078 dump_loops(F, get_loop_son(loop, i));
2079 dump_loop_son_edge(F, loop, i);
2084 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2085 ir_graph *rem = current_ir_graph;
2086 current_ir_graph = irg;
2088 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2090 current_ir_graph = rem;
2095 * dumps the VCG header
2097 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2106 if (!orientation) orientation = "bottom_to_top";
2110 "graph: { title: \"ir graph of %s\"\n"
2111 "display_edge_labels: %s\n"
2112 "layoutalgorithm: mindepth\n"
2113 "manhattan_edges: yes\n"
2114 "port_sharing: no\n"
2116 "classname 1: \"intrablock Data\"\n"
2117 "classname 16: \"interblock Data\"\n"
2118 "classname 2: \"Block\"\n"
2119 "classname 13: \"Control Flow\"\n"
2120 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2121 "classname 14: \"intrablock Memory\"\n"
2122 "classname 17: \"interblock Memory\"\n"
2123 "classname 15: \"Dominators\"\n"
2124 "classname 3: \"Entity type\"\n"
2125 "classname 4: \"Entity owner\"\n"
2126 "classname 5: \"Method Param\"\n"
2127 "classname 6: \"Method Res\"\n"
2128 "classname 7: \"Super\"\n"
2129 "classname 8: \"Union\"\n"
2130 "classname 9: \"Points-to\"\n"
2131 "classname 10: \"Array Element Type\"\n"
2132 "classname 11: \"Overwrites\"\n"
2133 "classname 12: \"Member\"\n"
2134 "infoname 1: \"Attribute\"\n"
2135 "infoname 2: \"Verification errors\"\n"
2136 "infoname 3: \"Debug info\"\n",
2137 name, label, orientation);
2139 /* don't use all, the range is too whith/black. */
2143 "colorentry 100: 0 0 0\n"
2144 "colorentry 101: 20 0 0\n"
2145 "colorentry 102: 40 0 0\n"
2146 "colorentry 103: 60 0 0\n"
2147 "colorentry 104: 80 0 0\n"
2148 "colorentry 105: 100 0 0\n"
2149 "colorentry 106: 120 0 0\n"
2150 "colorentry 107: 140 0 0\n"
2151 "colorentry 108: 150 0 0\n"
2152 "colorentry 109: 180 0 0\n"
2153 "colorentry 110: 200 0 0\n"
2154 "colorentry 111: 220 0 0\n"
2155 "colorentry 112: 240 0 0\n"
2156 "colorentry 113: 255 0 0\n"
2157 "colorentry 113: 255 20 20\n"
2158 "colorentry 114: 255 40 40\n"
2159 "colorentry 115: 255 60 60\n"
2160 "colorentry 116: 255 80 80\n"
2161 "colorentry 117: 255 100 100\n"
2162 "colorentry 118: 255 120 120\n"
2163 "colorentry 119: 255 140 140\n"
2164 "colorentry 120: 255 150 150\n"
2165 "colorentry 121: 255 180 180\n"
2166 "colorentry 122: 255 200 200\n"
2167 "colorentry 123: 255 220 220\n"
2168 "colorentry 124: 255 240 240\n"
2169 "colorentry 125: 255 250 250\n"
2172 fprintf (F, "\n"); /* a separator */
2178 * @param irg The graph to be dumped
2179 * @param suffix1 first filename suffix
2180 * @param suffix2 second filename suffix
2182 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2184 const char *nm = get_irg_dump_name(irg);
2185 int len = strlen(nm), i, j;
2186 char *fname; /* filename to put the vcg information in */
2188 if (!suffix1) suffix1 = "";
2189 if (!suffix2) suffix2 = "";
2191 /* open file for vcg graph */
2192 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2194 /* strncpy (fname, nm, len); */ /* copy the filename */
2196 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2198 fname[j] = '@'; j++; fname[j] = '1'; j++;
2199 } else if (nm[i] == '@') {
2200 fname[j] = '@'; j++; fname[j] = '2'; j++;
2202 fname[j] = nm[i]; j++;
2206 strcat (fname, suffix1); /* append file suffix */
2207 strcat (fname, suffix2); /* append file suffix */
2208 strcat (fname, ".vcg"); /* append the .vcg suffix */
2210 /* vcg really expect only a <CR> at end of line, so
2211 * the "b"inary mode is what you mean (and even needed for Win32)
2213 F = fopen (fname, "wb"); /* open file for writing */
2215 panic("cannot open %s for writing (%m)", fname); /* not reached */
2225 * @param name prefix file name
2226 * @param suffix filename suffix
2228 FILE *vcg_open_name (const char *name, const char *suffix) {
2230 char *fname; /* filename to put the vcg information in */
2231 int i, j, len = strlen(name);
2233 if (!suffix) suffix = "";
2235 /** open file for vcg graph */
2236 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2237 /* strcpy (fname, name);*/ /* copy the filename */
2239 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2240 if (name[i] == '/') {
2241 fname[j] = '@'; j++; fname[j] = '1'; j++;
2242 } else if (name[i] == '@') {
2243 fname[j] = '@'; j++; fname[j] = '2'; j++;
2245 fname[j] = name[i]; j++;
2249 strcat (fname, suffix);
2250 strcat (fname, ".vcg"); /* append the .vcg suffix */
2252 /* vcg really expect only a <CR> at end of line, so
2253 * the "b"inary mode is what you mean (and even needed for Win32)
2255 F = fopen (fname, "wb"); /* open file for writing */
2257 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2265 * Dumps the vcg file footer
2267 static INLINE void dump_vcg_footer (FILE *F) {
2272 * close the vcg file
2274 void vcg_close (FILE *F) {
2275 dump_vcg_footer(F); /* print footer */
2276 fclose (F); /* close vcg file */
2279 /************************************************************************/
2280 /************************************************************************/
2281 /* Routines that dump all or parts of the firm representation to a file */
2282 /************************************************************************/
2283 /************************************************************************/
2285 /************************************************************************/
2286 /* Dump ir graphs, different formats and additional information. */
2287 /************************************************************************/
2289 /** Routine to dump a graph, blocks as conventional nodes. */
2291 dump_ir_graph (ir_graph *irg, const char *suffix )
2296 rem = current_ir_graph;
2298 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2300 current_ir_graph = irg;
2301 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2302 else suffix1 = "-pure";
2303 f = vcg_open(irg, suffix, suffix1);
2304 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2306 /* call the dump graph hook */
2307 if (dump_ir_graph_hook)
2308 if (dump_ir_graph_hook(f, irg))
2311 /* walk over the graph */
2312 /* dump_whole_node must be called in post visiting predecessors */
2313 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2315 /* dump the out edges in a separate walk */
2316 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2317 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2322 current_ir_graph = rem;
2325 /* Dump a firm graph without explicit block nodes. */
2326 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2332 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2335 if (get_interprocedural_view()) suffix1 = "-ip";
2337 f = vcg_open(irg, suffix, suffix1);
2338 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2340 construct_block_lists(irg);
2343 * If we are in the interprocedural view, we dump not
2344 * only the requested irg but also all irgs that can be reached
2347 for (i = 0; i < get_irp_n_irgs(); i++) {
2348 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2350 dump_graph_from_list(f, get_irp_irg(i));
2358 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2359 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2366 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2371 if (get_interprocedural_view()) suffix1 = "-ip";
2374 ent = get_irg_entity(irg);
2376 F = vcg_open(irg, suffix, suffix1);
2377 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2379 construct_extblock_lists(irg);
2381 fprintf(F, "graph: { title: \"");
2383 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2384 get_ent_dump_name(ent));
2386 dump_graph_info(F, irg);
2387 print_dbg_info(F, get_entity_dbg_info(ent));
2389 for (i = 0; i < get_irp_n_irgs(); i++) {
2390 ir_graph *irg = get_irp_irg(i);
2391 list_tuple *lists = ird_get_irg_link(irg);
2394 /* dump the extended blocks first */
2395 if (ARR_LEN(lists->extbb_list)) {
2396 ird_set_irg_link(irg, lists->extbb_list);
2397 dump_extblock_graph(F, irg);
2400 /* we may have blocks without extended blocks, bad for instance */
2401 if (ARR_LEN(lists->blk_list)) {
2402 ird_set_irg_link(irg, lists->blk_list);
2403 dump_block_graph(F, irg);
2406 DEL_ARR_F(lists->extbb_list);
2407 DEL_ARR_F(lists->blk_list);
2412 /* Close the vcg information for the irg */
2413 fprintf(F, "}\n\n");
2419 /* dumps a graph with type information */
2421 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2424 ir_graph *rem = current_ir_graph;
2426 int rem_dump_const_local;
2428 /* if a filter is set, dump only the irg's that match the filter */
2429 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2432 current_ir_graph = irg;
2433 rem_dump_const_local = dump_const_local;
2434 /* dumping types does not work with local nodes */
2435 dump_const_local = 0;
2437 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2438 else suffix1 = "-pure-wtypes";
2439 f = vcg_open(irg,suffix, suffix1);
2440 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2442 /* dump common ir graph */
2443 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2444 /* dump type info */
2445 type_walk_irg(irg, dump_type_info, NULL, f);
2446 inc_irg_visited(get_const_code_irg());
2447 /* dump edges from graph to type info */
2448 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2451 dump_const_local = rem_dump_const_local;
2452 current_ir_graph = rem;
2456 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2461 ir_graph *rem = current_ir_graph;
2462 int rem_dump_const_local;
2464 /* if a filter is set, dump only the irg's that match the filter */
2465 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2468 rem_dump_const_local = dump_const_local;
2469 /* dumping types does not work with local nodes */
2470 dump_const_local = 0;
2472 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2473 else suffix1 = "-wtypes";
2474 f = vcg_open(irg, suffix, suffix1);
2475 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2477 /* dump common blocked ir graph */
2478 construct_block_lists(irg);
2480 for (i = 0; i < get_irp_n_irgs(); i++) {
2481 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2483 dump_graph_from_list(f, get_irp_irg(i));
2488 /* dump type info */
2489 current_ir_graph = irg;
2490 type_walk_irg(irg, dump_type_info, NULL, f);
2491 inc_irg_visited(get_const_code_irg());
2493 /* dump edges from graph to type info */
2494 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2497 dump_const_local = rem_dump_const_local;
2498 current_ir_graph = rem;
2501 /*---------------------------------------------------------------------*/
2502 /* The following routines dump a control flow graph. */
2503 /*---------------------------------------------------------------------*/
2506 dump_block_to_cfg(ir_node *block, void *env) {
2511 if (is_Block(block)) {
2512 /* This is a block. Dump a node for the block. */
2513 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2514 fprintf (F, "\" label: \"");
2515 if (block == get_irg_start_block(get_irn_irg(block)))
2516 fprintf(F, "Start ");
2517 if (block == get_irg_end_block(get_irn_irg(block)))
2520 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2521 PRINT_NODEID(block);
2523 fprintf(F, "info1:\"");
2526 if (dump_dominator_information_flag) {
2527 fprintf(F, "dom depth %d\n", get_Block_dom_depth(block));
2528 fprintf(F, "tree pre num %d\n", get_Block_dom_tree_pre_num(block));
2529 fprintf(F, "max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(block));
2532 /* show arity and possible Bad predecessors of the block */
2533 fprintf(F, "arity: %d\n", get_Block_n_cfgpreds(block));
2534 for (fl = i = 0; i < get_Block_n_cfgpreds(block); ++i) {
2535 ir_node *pred = get_Block_cfgpred(block, i);
2538 fprintf(F, "Bad pred at pos: ");
2539 fprintf(F, "%d ", i);
2546 /* the generic version. */
2547 dump_irnode_to_file(F, block);
2549 /* Check whether we have bad predecessors to color the block. */
2550 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2551 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2555 fprintf (F, "\""); /* closing quote of info */
2557 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2558 (block == get_irg_end_block(get_irn_irg(block))) )
2559 fprintf(F, " color:blue ");
2561 fprintf(F, " color:yellow ");
2564 /* Dump the edges */
2565 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2566 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2567 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2568 fprintf (F, "edge: { sourcename: \"");
2569 PRINT_NODEID(block);
2570 fprintf (F, "\" targetname: \"");
2572 fprintf (F, "\"}\n");
2575 /* Dump dominator edge */
2576 if (dump_dominator_information_flag && get_Block_idom(block)) {
2577 pred = get_Block_idom(block);
2578 fprintf (F, "edge: { sourcename: \"");
2579 PRINT_NODEID(block);
2580 fprintf (F, "\" targetname: \"");
2582 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2588 dump_cfg (ir_graph *irg, const char *suffix)
2591 ir_graph *rem = current_ir_graph;
2592 int ddif = dump_dominator_information_flag;
2593 int ipv = get_interprocedural_view();
2595 /* if a filter is set, dump only the irg's that match the filter */
2596 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2599 current_ir_graph = irg;
2601 f = vcg_open(irg, suffix, "-cfg");
2602 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2605 printf("Warning: dumping cfg not in interprocedural view!\n");
2606 set_interprocedural_view(0);
2609 if (get_irg_dom_state(irg) != dom_consistent)
2610 dump_dominator_information_flag = 0;
2612 /* walk over the blocks in the graph */
2613 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2614 dump_node(f, get_irg_bad(irg));
2616 dump_dominator_information_flag = ddif;
2617 set_interprocedural_view(ipv);
2619 current_ir_graph = rem;
2623 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2624 if (pset_find_ptr(mark_set, n)) return;
2626 pset_insert_ptr(mark_set, n);
2629 int i, start = is_Block(n) ? 0 : -1;
2630 dump_whole_node(n, F);
2631 for (i = start; i < get_irn_arity(n); ++i)
2632 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2635 /* Don't dump edges to nodes further out. These might be edges to
2636 nodes we already dumped, if there is a shorter path to these. */
2640 static int subgraph_counter = 0;
2641 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2644 pset *mark_set = pset_new_ptr(1);
2645 sprintf(buf, "-subg_%03d", subgraph_counter++);
2646 F = vcg_open(get_irn_irg(root), suffix, buf);
2647 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2648 descend_and_dump(F, root, depth, mark_set);
2654 static int weight_overall(int rec, int loop) {
2655 return 2*rec + loop;
2658 static int compute_color (int my, int max) {
2665 /* if small, scale to the full color range. */
2667 my = my * (n_colors/max);
2669 step = 1 + (max / n_colors);
2673 return base_color + n_colors - color;
2676 static int get_entity_color(entity *ent) {
2677 ir_graph *irg = get_entity_irg(ent);
2681 int rec_depth = get_irg_recursion_depth(irg);
2682 int loop_depth = get_irg_loop_depth(irg);
2683 int overall_depth = weight_overall(rec_depth, loop_depth);
2685 int max_rec_depth = irp->max_callgraph_recursion_depth;
2686 int max_loop_depth = irp->max_callgraph_loop_depth;
2687 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2689 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2690 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2691 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2693 return my_overall_color;
2697 void dump_callgraph(const char *suffix) {
2699 int i, n_irgs = get_irp_n_irgs();
2700 int rem = edge_label;
2702 //ident *prefix = new_id_from_str("java/");
2704 F = vcg_open_name("Callgraph", suffix);
2705 dump_vcg_header(F, "Callgraph", NULL);
2707 for (i = 0; i < n_irgs; ++i) {
2708 ir_graph *irg = get_irp_irg(i);
2709 entity *ent = get_irg_entity(irg);
2710 int j, n_callees = get_irg_n_callees(irg);
2712 /* Do not dump runtime system. */
2713 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2715 dump_entity_node(F, ent, get_entity_color(ent));
2716 for (j = 0; j < n_callees; ++j) {
2717 entity *c = get_irg_entity(get_irg_callee(irg, j));
2718 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2719 int be = is_irg_callee_backedge(irg, j);
2722 "label:\"recursion %d\" color:%d" :
2723 "label:\"calls %d\" color:%d";
2724 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2732 /* Dump all irgs in interprocedural view to a single file. */
2733 void dump_all_cg_block_graph(const char *suffix) {
2736 int rem_view = get_interprocedural_view();
2737 set_interprocedural_view(1);
2739 f = vcg_open_name("All_graphs", suffix);
2740 dump_vcg_header(f, "All_graphs", NULL);
2742 /* collect nodes in all irgs reachable in call graph*/
2743 for (i = 0; i < get_irp_n_irgs(); i++)
2744 ird_set_irg_link(get_irp_irg(i), NULL);
2746 cg_walk(clear_link, collect_node, NULL);
2748 /* dump all graphs */
2749 for (i = 0; i < get_irp_n_irgs(); i++) {
2750 current_ir_graph = get_irp_irg(i);
2751 assert(ird_get_irg_link(current_ir_graph));
2752 dump_graph_from_list(f, current_ir_graph);
2753 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2757 set_interprocedural_view(rem_view);
2760 /*---------------------------------------------------------------------*/
2761 /* the following routines dumps type information without any ir nodes. */
2762 /*---------------------------------------------------------------------*/
2765 dump_type_graph (ir_graph *irg, const char *suffix)
2769 rem = current_ir_graph;
2771 /* if a filter is set, dump only the irg's that match the filter */
2772 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2774 current_ir_graph = irg;
2776 f = vcg_open(irg, suffix, "-type");
2777 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2779 /* walk over the blocks in the graph */
2780 type_walk_irg(irg, dump_type_info, NULL, f);
2781 /* The walker for the const code can be called several times for the
2782 same (sub) expression. So that no nodes are dumped several times
2783 we decrease the visited flag of the corresponding graph after each
2784 walk. So now increase it finally. */
2785 inc_irg_visited(get_const_code_irg());
2788 current_ir_graph = rem;
2792 dump_all_types (const char *suffix)
2794 FILE *f = vcg_open_name("All_types", suffix);
2795 dump_vcg_header(f, "All_types", NULL);
2796 type_walk(dump_type_info, NULL, f);
2797 inc_irg_visited(get_const_code_irg());
2802 dump_class_hierarchy (int entities, const char *suffix)
2804 FILE *f = vcg_open_name("class_hierarchy", suffix);
2808 env.dump_ent = entities;
2809 dump_vcg_header(f, "class_hierarchy", NULL);
2810 type_walk(dump_class_hierarchy_node, NULL, &env);
2814 /*---------------------------------------------------------------------*/
2815 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2817 /* dump_ir_block_graph */
2819 /* dump_type_graph */
2820 /* dump_ir_graph_w_types */
2821 /*---------------------------------------------------------------------*/
2823 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2825 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2826 dmp_grph(get_irp_irg(i), suffix);
2831 /*--------------------------------------------------------------------------------*
2832 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2833 * packed together in one subgraph/box *
2834 *--------------------------------------------------------------------------------*/
2836 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2837 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2839 ir_loop *son = NULL;
2841 /* Dump a new loop node. */
2842 dump_loop_node(F, loop);
2844 /* Dump the loop elements. */
2846 for(i = 0; i < get_loop_n_elements(loop); i++) {
2847 le = get_loop_element(loop, i);
2849 if (get_kind(son) == k_ir_loop) {
2851 /* We are a loop son -> Recurse */
2853 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2854 fprintf(F, "\" }\n");
2855 fprintf (F, "edge: {sourcename: \"");
2857 fprintf (F, "\" targetname: \"");
2859 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2860 loop_node_started = 0;
2862 dump_loop_son_edge(F, loop, son_number++);
2863 dump_loops_standalone(F, son);
2864 } else if (get_kind(son) == k_ir_node) {
2865 /* We are a loop node -> Collect firm nodes */
2867 ir_node *n = le.node;
2870 if (!loop_node_started) {
2871 /* Start a new node which contains all firm nodes of the current loop */
2872 fprintf (F, "node: { title: \"");
2874 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2875 loop_node_started = 1;
2881 bad |= dump_node_label(F, n);
2882 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2883 if (has_backedges(n)) fprintf(F, "\t loop head!");
2884 } else { /* for callgraph loop tree */
2886 assert(get_kind(son) == k_ir_graph);
2888 /* We are a loop node -> Collect firm graphs */
2889 n = (ir_graph *)le.node;
2890 if (!loop_node_started) {
2891 /* Start a new node which contains all firm nodes of the current loop */
2892 fprintf (F, "node: { title: \"");
2894 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2895 loop_node_started = 1;
2900 fprintf (F, " %s", get_irg_dump_name(n));
2901 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2905 if (loop_node_started) {
2906 fprintf(F, "\" }\n");
2907 fprintf (F, "edge: {sourcename: \"");
2909 fprintf (F, "\" targetname: \"");
2911 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2912 loop_node_started = 0;
2916 void dump_loop_tree(ir_graph *irg, const char *suffix)
2919 ir_graph *rem = current_ir_graph;
2920 int el_rem = edge_label;
2923 /* if a filter is set, dump only the irg's that match the filter */
2924 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2926 current_ir_graph = irg;
2928 f = vcg_open(irg, suffix, "-looptree");
2929 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2931 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2935 edge_label = el_rem;
2936 current_ir_graph = rem;
2939 void dump_callgraph_loop_tree(const char *suffix) {
2941 F = vcg_open_name("Callgraph_looptree", suffix);
2942 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2943 dump_loops_standalone(F, irp->outermost_cg_loop);
2948 /*-----------------------------------------------------------------------------*/
2949 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2950 /*-----------------------------------------------------------------------------*/
2952 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2953 int i, son_number = 0, node_number = 0;
2955 if (dump_loop_information_flag) dump_loop_node(F, loop);
2957 for (i = 0; i < get_loop_n_elements(loop); i++) {
2958 loop_element le = get_loop_element(loop, i);
2959 if (*(le.kind) == k_ir_loop) {
2960 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2962 collect_nodeloop(F, le.son, loopnodes);
2964 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2965 eset_insert(loopnodes, le.node);
2970 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2973 for(i = 0; i < get_loop_n_elements(loop); i++) {
2974 loop_element le = get_loop_element(loop, i);
2975 if (*(le.kind) == k_ir_loop) {
2977 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2979 if (is_Block(le.node)) start = 0; else start = -1;
2980 for (j = start; j < get_irn_arity(le.node); j++) {
2981 ir_node *pred = get_irn_n(le.node, j);
2982 if (!eset_contains(loopnodes, pred)) {
2983 eset_insert(extnodes, pred);
2984 if (!is_Block(pred)) {
2985 pred = get_nodes_block(pred);
2986 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
2994 void dump_loop(ir_loop *l, const char *suffix) {
2997 eset *loopnodes = eset_create();
2998 eset *extnodes = eset_create();
3001 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3002 F = vcg_open_name (name, suffix);
3003 dump_vcg_header(F, name, NULL);
3005 /* collect all nodes to dump */
3006 collect_nodeloop(F, l, loopnodes);
3007 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3009 /* build block lists */
3010 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3011 set_irn_link(n, NULL);
3012 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3013 set_irn_link(n, NULL);
3014 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3016 b = get_nodes_block(n);
3017 set_irn_link(n, get_irn_link(b));
3020 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3022 b = get_nodes_block(n);
3023 set_irn_link(n, get_irn_link(b));
3027 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3029 fprintf(F, "graph: { title: \"");
3031 fprintf(F, "\" label: \"");
3032 dump_node_opcode(F, b);
3033 fprintf (F, " %ld", get_irn_node_nr(b));
3034 fprintf(F, "\" status:clustered color:yellow\n");
3036 /* dump the blocks edges */
3037 dump_ir_data_edges(F, b);
3039 /* dump the nodes that go into the block */
3040 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3041 if (eset_contains(extnodes, n))
3042 overrule_nodecolor = ird_color_lightblue;
3044 overrule_nodecolor = ird_color_default;
3045 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3048 /* Close the vcg information for the block */
3050 dump_const_node_local(F, b);
3053 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3055 fprintf(F, "graph: { title: \"");
3057 fprintf(F, "\" label: \"");
3058 dump_node_opcode(F, b);
3059 fprintf (F, " %ld", get_irn_node_nr(b));
3060 fprintf(F, "\" status:clustered color:lightblue\n");
3062 /* dump the nodes that go into the block */
3063 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3064 if (!eset_contains(loopnodes, n))
3065 overrule_nodecolor = ird_color_lightblue;
3067 overrule_nodecolor = ird_color_default;
3068 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3071 /* Close the vcg information for the block */
3073 dump_const_node_local(F, b);
3077 eset_destroy(loopnodes);
3078 eset_destroy(extnodes);