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"
39 #include "type_or_entity.h"
43 #include "callgraph.h"
44 #include "irextbb_t.h"
46 #include "dbginfo_t.h"
58 extern void dump_irn_chi_term(FILE *FL, ir_node *n);
59 extern void dump_irn_state(FILE *FL, ir_node *n);
60 extern int get_opt_dump_abstvals(void);
61 typedef unsigned long SeqNo;
62 extern SeqNo get_Block_seqno(ir_node *n);
65 /* basis for a color range for vcg */
66 static int n_colors = 0;
67 static int base_color = 0;
69 /** Dump only irgs with names that start with this string */
70 static ident *dump_file_filter_id = NULL;
72 #define ERROR_TXT "<ERROR>"
74 /*******************************************************************/
75 /* flags to steer output */
76 /*******************************************************************/
78 /** An option to turn off edge labels */
79 static int edge_label = 1;
80 /** An option to turn off dumping values of constant entities */
81 static int const_entities = 1;
82 /** An option to dump the keep alive edges */
83 static int dump_keepalive = 0;
84 /** An option to dump ld_names instead of names. */
85 static int dump_ld_name = 1;
86 /** Compiler options to dump analysis information in dump_ir_graph */
87 static int dump_out_edge_flag = 0;
88 static int dump_loop_information_flag = 0;
89 static int dump_backedge_information_flag = 1;
90 static int dump_const_local = 0;
91 /** An option to dump all graph anchors */
92 static int dump_anchors = 0;
94 int dump_dominator_information_flag = 0;
95 int opt_dump_analysed_type_info = 1;
96 int opt_dump_pointer_values_to_info = 0; /* default off: for test compares!! */
98 static dumper_colors overrule_nodecolor = ird_color_default;
100 /** An additional edge hook. */
101 static DUMP_NODE_EDGE_FUNC dump_node_edge_hook = NULL;
103 void set_dump_node_edge_hook(DUMP_NODE_EDGE_FUNC func)
105 dump_node_edge_hook = func;
108 DUMP_NODE_EDGE_FUNC get_dump_node_edge_hook(void)
110 return dump_node_edge_hook;
114 static DUMP_NODE_EDGE_FUNC dump_block_edge_hook = NULL;
116 void set_dump_block_edge_hook(DUMP_NODE_EDGE_FUNC func)
118 dump_block_edge_hook = func;
121 DUMP_NODE_EDGE_FUNC get_dump_block_edge_hook(void)
123 return dump_node_edge_hook;
127 /** The vcg node attribute hook. */
128 static DUMP_IR_GRAPH_FUNC dump_ir_graph_hook = NULL;
129 /** The vcg node attribute hook. */
130 static DUMP_NODE_VCGATTR_FUNC dump_node_vcgattr_hook = NULL;
131 /** The vcg edge attribute hook. */
132 static DUMP_EDGE_VCGATTR_FUNC dump_edge_vcgattr_hook = NULL;
134 /* set the ir graph hook */
135 void set_dump_ir_graph_hook(DUMP_IR_GRAPH_FUNC hook) {
136 dump_ir_graph_hook = hook;
138 /* set the node attribute hook */
139 void set_dump_node_vcgattr_hook(DUMP_NODE_VCGATTR_FUNC hook) {
140 dump_node_vcgattr_hook = hook;
142 /* set the edge attribute hook */
143 void set_dump_edge_vcgattr_hook(DUMP_EDGE_VCGATTR_FUNC hook) {
144 dump_edge_vcgattr_hook = hook;
147 int get_opt_dump_const_local(void) {
148 if (!dump_out_edge_flag && !dump_loop_information_flag)
149 return dump_const_local;
154 void only_dump_method_with_name(ident *name) {
155 dump_file_filter_id = name;
158 ident *get_dump_file_filter_ident(void) {
159 return dump_file_filter_id;
162 /** Returns non-zero if dump file filter is not set, or if it is a
164 int is_filtered_dump_name(ident *name) {
165 if (!dump_file_filter_id) return 1;
166 return id_is_prefix(dump_file_filter_id, name);
169 /* To turn off display of edge labels. Edge labels often cause xvcg to
170 abort with a segmentation fault. */
171 void turn_off_edge_labels(void) {
175 void dump_consts_local(int flag) {
176 dump_const_local = flag;
179 void dump_constant_entity_values(int flag) {
180 const_entities = flag;
183 void dump_keepalive_edges(int flag) {
184 dump_keepalive = flag;
187 int get_opt_dump_keepalive_edges(void) {
188 return dump_keepalive;
191 void dump_out_edges(int flag) {
192 dump_out_edge_flag = flag;
195 void dump_dominator_information(int flag) {
196 dump_dominator_information_flag = flag;
199 void dump_loop_information(int flag) {
200 dump_loop_information_flag = flag;
203 void dump_backedge_information(int flag) {
204 dump_backedge_information_flag = flag;
207 /* Dump the information of type field specified in ana/irtypeinfo.h.
208 * If the flag is set, the type name is output in [] in the node label,
209 * else it is output as info.
211 void set_opt_dump_analysed_type_info(int flag) {
212 opt_dump_analysed_type_info = flag;
215 void dump_pointer_values_to_info(int flag) {
216 opt_dump_pointer_values_to_info = flag;
219 void dump_ld_names(int flag) {
223 void dump_all_anchors(int flag) {
227 /* -------------- some extended helper functions ----------------- */
230 * returns the name of a mode or <ERROR> if mode is NOT a mode object.
231 * in the later case, sets bad
233 const char *get_mode_name_ex(ir_mode *mode, int *bad)
236 return get_mode_name(mode);
242 * returns the name of a type or <ERROR> if mode is NOT a mode object.
243 * in the later case, sets bad
245 const char *get_type_name_ex(ir_type *tp, int *bad)
248 return get_type_name(tp);
254 * printf the VCG color
256 static void print_vcg_color(FILE *F, dumper_colors color) {
257 static const char *color_names[32] = {
258 "white", "blue", "red", "green",
259 "yellow", "magenta", "cyan", "darkgray",
260 "darkblue", "darkred", "darkgreen", "darkyellow",
261 "darkmagenta", "darkcyan", "gold", "lightgray",
262 "lightblue", "lightred", "lightgreen", "lightyellow",
263 "lightmagenta", "lightcyan", "lilac", "turquoise",
264 "aquamarine", "khaki", "purple", "yellowgreen",
265 "pink", "orange", "orchid", "black"
268 if (color != ird_color_default)
269 fprintf(F, "color:%s", color_names[color]);
273 * prints the edge from a type S to a type T with additional info fmt, ...
276 static void print_type_type_edge(FILE *F, ir_type *S, ir_type *T, const char *fmt, ...)
281 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(S);
282 fprintf(F, " targetname: "); PRINT_TYPEID(T);
283 vfprintf(F, fmt, ap);
289 * prints the edge from a type T to an entity E with additional info fmt, ...
292 static void print_type_ent_edge(FILE *F, ir_type *T, entity *E, const char *fmt, ...)
297 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(T);
298 fprintf(F, " targetname: \""); PRINT_ENTID(E); fprintf(F, "\"");
299 vfprintf(F, fmt, ap);
305 * prints the edge from an entity E to an entity T with additional info fmt, ...
308 static void print_ent_ent_edge(FILE *F, entity *E, entity *T, int backedge, const char *fmt, ...)
314 fprintf(F, "backedge: { sourcename: \"");
316 fprintf(F, "edge: { sourcename: \"");
318 fprintf(F, "\" targetname: \""); PRINT_ENTID(T); fprintf(F, "\"");
319 vfprintf(F, fmt, ap);
325 * prints the edge from an entity E to a type T with additional info fmt, ...
328 static void print_ent_type_edge(FILE *F, entity *E, ir_type *T, const char *fmt, ...)
333 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
334 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
335 vfprintf(F, fmt, ap);
341 * prints the edge from a node N to a type T with additional info fmt, ...
344 static void print_node_type_edge(FILE *F, const ir_node *N, ir_type *T, const char *fmt, ...)
349 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
350 fprintf(F, "\" targetname: "); PRINT_TYPEID(T);
351 vfprintf(F, fmt, ap);
357 * prints the edge from a node N to an entity E with additional info fmt, ...
360 static void print_node_ent_edge(FILE *F, const ir_node *N, entity *E, const char *fmt, ...)
365 fprintf(F, "edge: { sourcename: \""); PRINT_NODEID(N);
366 fprintf(F, "\" targetname: \""); PRINT_ENTID(E);
368 vfprintf(F, fmt, ap);
374 * prints the edge from an entity E to a node N with additional info fmt, ...
377 static void print_ent_node_edge(FILE *F, entity *E, const ir_node *N, const char *fmt, ...)
382 fprintf(F, "edge: { sourcename: \""); PRINT_ENTID(E);
383 fprintf(F, "\" targetname: \""); PRINT_NODEID(N); fprintf(F, "\"");
384 vfprintf(F, fmt, ap);
390 * prints the edge from a type E to an enumeration item item with additional info fmt, ...
393 static void print_enum_item_edge(FILE *F, ir_type *E, int item, const char *fmt, ...)
398 fprintf(F, "edge: { sourcename: "); PRINT_TYPEID(E);
399 fprintf(F, " targetname: \""); PRINT_ITEMID(E, item); fprintf(F, "\" ");
400 vfprintf(F, fmt, ap);
405 /*-----------------------------------------------------------------*/
406 /* global and ahead declarations */
407 /*-----------------------------------------------------------------*/
409 static void dump_whole_node(ir_node *n, void *env);
410 static INLINE void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg);
412 /*-----------------------------------------------------------------*/
413 /* Helper functions. */
414 /*-----------------------------------------------------------------*/
417 * This map is used as a private link attr to be able to call dumper
418 * anywhere without destroying link fields.
420 static pmap *irdump_link_map = NULL;
422 /** NOT A STANDARD LIBFIRM INIT METHOD
424 * We do not want to integrate dumping into libfirm, i.e., if the dumpers
425 * are off, we want to have as few interferences as possible. Therefore the
426 * initialization is performed lazily and not called from within init_firm.
428 * Creates the link attribute map. */
429 static void init_irdump(void) {
430 /* We need a new, empty map. */
431 if (irdump_link_map) pmap_destroy(irdump_link_map);
432 irdump_link_map = pmap_create();
433 if (!dump_file_filter_id)
434 dump_file_filter_id = new_id_from_str("");
437 * Returns the private link field.
439 static void *ird_get_irn_link(ir_node *n) {
441 if (!irdump_link_map) return NULL;
443 if (pmap_contains(irdump_link_map, (void *)n))
444 res = pmap_get(irdump_link_map, (void *)n);
449 * Sets the private link field.
451 static void ird_set_irn_link(ir_node *n, void *x) {
452 if (!irdump_link_map)
454 pmap_insert(irdump_link_map, (void *)n, x);
458 * Gets the private link field of an irg.
460 static void *ird_get_irg_link(ir_graph *irg) {
462 if (!irdump_link_map) return NULL;
464 if (pmap_contains(irdump_link_map, (void *)irg))
465 res = pmap_get(irdump_link_map, (void *)irg);
470 * Sets the private link field of an irg.
472 static void ird_set_irg_link(ir_graph *irg, void *x) {
473 if (!irdump_link_map) init_irdump();
474 pmap_insert(irdump_link_map, (void *)irg, x);
478 * Walker, clears the private link field.
480 static void clear_link(ir_node * node, void * env) {
481 ird_set_irn_link(node, NULL);
485 * If the entity has a ld_name, returns it if the dump_ld_name is set,
486 * else returns the name of the entity.
488 static const char *_get_ent_dump_name(entity *ent, int dump_ld_name) {
490 return "<NULL entity>";
492 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
493 if (ent->ld_name) return get_id_str(ent->ld_name);
495 return get_id_str(ent->name);
499 * If the entity has a ld_name, returns it if the option dump_ld_name is set,
500 * else returns the name of the entity.
502 const char *get_ent_dump_name(entity *ent) {
503 return _get_ent_dump_name(ent, dump_ld_name);
506 /* Returns the name of an IRG. */
507 const char *get_irg_dump_name(ir_graph *irg) {
508 /* Don't use get_entity_ld_ident (ent) as it computes the mangled name! */
509 return _get_ent_dump_name(get_irg_entity(irg), 1);
513 * Returns non-zero if a node is in floating state.
515 static int node_floats(ir_node *n) {
516 return ((get_irn_pinned(n) == op_pin_state_floats) &&
517 (get_irg_pinned(current_ir_graph) == op_pin_state_floats));
521 * Walker that visits the anchors
523 static void ird_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
524 irg_walk_graph(irg, pre, post, env);
529 for (i = anchor_max - 1; i >= 0; --i) {
530 ir_node *n = irg->anchors[i];
533 /* reset the visit flag: will be increase in the walker */
534 set_irg_visited(irg, get_irg_visited(irg) - 1);
535 irg_walk(n, pre, post, env);
542 * Walker, allocates an array for all blocks and puts it's nodes non-floating nodes into this array.
544 static void collect_node(ir_node * node, void *env) {
547 || get_irn_op(node) == op_Bad
548 || get_irn_op(node) == op_Unknown
549 || get_irn_op(node) == op_NoMem) {
550 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
551 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
552 ARR_APP1(ir_node *, arr, node);
553 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
555 ir_node * block = get_nodes_block(node);
558 /* this node is in a Bad block, so we must place it into the graph's list */
559 ir_node ** arr = (ir_node **) ird_get_irg_link(get_irn_irg(node));
560 if (!arr) arr = NEW_ARR_F(ir_node *, 0);
561 ARR_APP1(ir_node *, arr, node);
562 ird_set_irg_link(get_irn_irg(node), arr); /* arr is an l-value, APP_ARR might change it! */
565 ird_set_irn_link(node, ird_get_irn_link(block));
566 ird_set_irn_link(block, node);
571 /** Construct lists to walk ir block-wise.
573 * Collects all blocks, nodes not op_pin_state_pinned,
574 * Bad, NoMem and Unknown into a flexible array in link field of
575 * irg they belong to. Sets the irg link field to NULL in all
576 * graphs not visited.
577 * Free the list with DEL_ARR_F().
579 static ir_node **construct_block_lists(ir_graph *irg) {
580 int i, rem_view = get_interprocedural_view();
581 ir_graph *rem = current_ir_graph;
582 current_ir_graph = irg;
584 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
585 ird_set_irg_link(get_irp_irg(i), NULL);
587 ird_walk_graph(current_ir_graph, clear_link, collect_node, current_ir_graph);
589 /* Collect also EndReg and EndExcept. We do not want to change the walker. */
590 set_interprocedural_view(0);
592 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
593 irg_walk(get_irg_end_reg(current_ir_graph), clear_link, collect_node, current_ir_graph);
594 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph)-1);
595 irg_walk(get_irg_end_except(current_ir_graph), clear_link, collect_node, current_ir_graph);
597 set_interprocedural_view(rem_view);
599 current_ir_graph = rem;
600 return ird_get_irg_link(irg);
603 typedef struct _list_tuple {
605 ir_extblk **extbb_list;
608 /** Construct lists to walk IR extended block-wise.
609 * Free the lists in the tuple with DEL_ARR_F().
610 * Sets the irg link field to NULL in all
611 * graphs not visited.
613 static list_tuple *construct_extblock_lists(ir_graph *irg) {
614 ir_node **blk_list = construct_block_lists(irg);
616 ir_graph *rem = current_ir_graph;
617 list_tuple *lists = xmalloc(sizeof(*lists));
619 current_ir_graph = irg;
621 lists->blk_list = NEW_ARR_F(ir_node *, 0);
622 lists->extbb_list = NEW_ARR_F(ir_extblk *, 0);
624 inc_irg_block_visited(irg);
625 for (i = ARR_LEN(blk_list) - 1; i >= 0; --i) {
628 if (is_Block(blk_list[i])) {
629 ext = get_Block_extbb(blk_list[i]);
631 if (extbb_not_visited(ext)) {
632 ARR_APP1(ir_extblk *, lists->extbb_list, ext);
633 mark_extbb_visited(ext);
637 ARR_APP1(ir_node *, lists->blk_list, blk_list[i]);
641 current_ir_graph = rem;
642 ird_set_irg_link(irg, lists);
646 /*-----------------------------------------------------------------*/
647 /* Routines to dump information about a single ir node. */
648 /*-----------------------------------------------------------------*/
651 * dump the name of a node n to the File F.
653 int dump_node_opcode(FILE *F, ir_node *n)
656 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
658 /* call the dump_node operation if available */
660 return ops->dump_node(n, F, dump_node_opcode_txt);
662 /* implementation for default nodes */
663 switch (get_irn_opcode(n)) {
668 res = tarval_snprintf(buf, sizeof(buf), get_Const_tarval(n));
669 assert(res < sizeof(buf) && "buffer to small for tarval_snprintf");
674 if (get_SymConst_kind(n) == symconst_addr_name) {
675 /* don't use get_SymConst_ptr_info as it mangles the name. */
676 fprintf (F, "SymC %s", get_id_str(get_SymConst_name(n)));
677 } else if (get_SymConst_kind(n) == symconst_addr_ent) {
678 assert(get_SymConst_entity(n));
679 assert(is_entity(get_SymConst_entity(n)));
680 fprintf (F, "SymC &%s", get_entity_name(get_SymConst_entity(n)));
682 assert(get_kind(get_SymConst_type(n)) == k_type);
683 assert(get_type_ident(get_SymConst_type(n)));
684 fprintf (F, "SymC %s ", get_type_name_ex(get_SymConst_type(n), &bad));
685 if (get_SymConst_kind(n) == symconst_type_tag)
693 if (!get_interprocedural_view())
700 ir_node *pred = get_Proj_pred(n);
702 if (get_irn_opcode(pred) == iro_Cond
703 && get_Proj_proj(n) == get_Cond_defaultProj(pred)
704 && get_irn_mode(get_Cond_selector(pred)) != mode_b)
705 fprintf (F, "defProj");
713 if (get_interprocedural_view()) {
714 fprintf(F, "%s %s", get_irn_opname(n), get_ent_dump_name(get_irg_entity(get_irn_irg(n))));
719 case iro_CallBegin: {
720 ir_node *addr = get_CallBegin_ptr(n);
722 if (get_irn_op(addr) == op_Sel)
723 ent = get_Sel_entity(addr);
724 else if ((get_irn_op(addr) == op_SymConst) && (get_SymConst_kind(addr) == symconst_addr_ent))
725 ent = get_SymConst_entity(addr);
726 fprintf (F, "%s", get_irn_opname(n));
727 if (ent) fprintf (F, " %s", get_entity_name(ent));
731 fprintf (F, "%s[%s]", get_irn_opname(n), get_mode_name_ex(get_Load_mode(n), &bad));
734 fprintf (F, "%s%s", is_Block_dead(n) ? "Dead " : "", get_irn_opname(n));
739 fprintf (F, "%s", get_irn_opname(n));
746 * Dump the mode of a node n to a file F.
747 * Ignore modes that are "always known".
749 static int dump_node_mode(FILE *F, ir_node *n)
752 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
755 /* call the dump_node operation if available */
757 return ops->dump_node(n, F, dump_node_mode_txt);
759 /* default implementation */
760 iro = get_irn_opcode(n);
772 ir_mode *mode = get_irn_mode(n);
774 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
775 (mode != mode_T || iro == iro_Proj))
776 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
784 * Dump the type of a node n to a file F if it's known.
786 static int dump_node_typeinfo(FILE *F, ir_node *n) {
789 if (opt_dump_analysed_type_info) {
790 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
791 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
792 ir_type *tp = get_irn_typeinfo_type(n);
793 if (tp != firm_none_type)
794 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
802 typedef struct _pns_lookup {
803 long nr; /**< the proj number */
804 const char *name; /**< the name of the Proj */
807 typedef struct _proj_lookup {
808 opcode code; /**< the opcode of the Proj predecessor */
809 unsigned num_data; /**< number of data entries */
810 const pns_lookup_t *data; /**< the data */
813 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
815 /** the lookup table for Proj(Start) names */
816 static const pns_lookup_t start_lut[] = {
817 #define X(a) { pn_Start_##a, #a }
826 /** the lookup table for Proj(Cond) names */
827 static const pns_lookup_t cond_lut[] = {
828 #define X(a) { pn_Cond_##a, #a }
834 /** the lookup table for Proj(Call) names */
835 static const pns_lookup_t call_lut[] = {
836 #define X(a) { pn_Call_##a, #a }
845 /** the lookup table for Proj(Quot) names */
846 static const pns_lookup_t quot_lut[] = {
847 #define X(a) { pn_Quot_##a, #a }
854 /** the lookup table for Proj(DivMod) names */
855 static const pns_lookup_t divmod_lut[] = {
856 #define X(a) { pn_DivMod_##a, #a }
864 /** the lookup table for Proj(Div) names */
865 static const pns_lookup_t div_lut[] = {
866 #define X(a) { pn_Div_##a, #a }
873 /** the lookup table for Proj(Mod) names */
874 static const pns_lookup_t mod_lut[] = {
875 #define X(a) { pn_Mod_##a, #a }
882 /** the lookup table for Proj(Load) names */
883 static const pns_lookup_t load_lut[] = {
884 #define X(a) { pn_Load_##a, #a }
891 /** the lookup table for Proj(Store) names */
892 static const pns_lookup_t store_lut[] = {
893 #define X(a) { pn_Store_##a, #a }
899 /** the lookup table for Proj(Alloc) names */
900 static const pns_lookup_t alloc_lut[] = {
901 #define X(a) { pn_Alloc_##a, #a }
908 /** the lookup table for Proj(CopyB) names */
909 static const pns_lookup_t copyb_lut[] = {
910 #define X(a) { pn_CopyB_##a, #a }
917 /** the lookup table for Proj(InstOf) names */
918 static const pns_lookup_t instof_lut[] = {
919 #define X(a) { pn_InstOf_##a, #a }
927 /** the lookup table for Proj(Raise) names */
928 static const pns_lookup_t raise_lut[] = {
929 #define X(a) { pn_Raise_##a, #a }
935 /** the lookup table for Proj(Bound) names */
936 static const pns_lookup_t bound_lut[] = {
937 #define X(a) { pn_Bound_##a, #a }
945 /** the Proj lookup table */
946 static const proj_lookup_t proj_lut[] = {
947 #define E(a) ARR_SIZE(a), a
948 { iro_Start, E(start_lut) },
949 { iro_Cond, E(cond_lut) },
950 { iro_Call, E(call_lut) },
951 { iro_Quot, E(quot_lut) },
952 { iro_DivMod, E(divmod_lut) },
953 { iro_Div, E(div_lut) },
954 { iro_Mod, E(mod_lut) },
955 { iro_Load, E(load_lut) },
956 { iro_Store, E(store_lut) },
957 { iro_Alloc, E(alloc_lut) },
958 { iro_CopyB, E(copyb_lut) },
959 { iro_InstOf, E(instof_lut) },
960 { iro_Raise, E(raise_lut) },
961 { iro_Bound, E(bound_lut) }
966 * Dump additional node attributes of some nodes to a file F.
969 dump_node_nodeattr(FILE *F, ir_node *n)
975 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
977 /* call the dump_node operation if available */
979 return ops->dump_node(n, F, dump_node_nodeattr_txt);
981 switch (get_irn_opcode(n)) {
983 if (0 && get_interprocedural_view()) {
984 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
989 pred = get_Proj_pred(n);
990 proj_nr = get_Proj_proj(n);
992 code = get_irn_opcode(pred);
995 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
996 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
997 fprintf (F, "Arg %ld ", proj_nr);
998 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
999 fprintf (F, "%ld ", proj_nr);
1001 unsigned i, j, f = 0;
1003 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1004 if (code == proj_lut[i].code) {
1005 for (j = 0; j < proj_lut[i].num_data; ++j) {
1006 if (proj_nr == proj_lut[i].data[j].nr) {
1007 fprintf (F, "%s ", proj_lut[i].data[j].name);
1016 fprintf (F, "%ld ", proj_nr);
1017 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1018 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1019 fprintf(F, "PRED ");
1020 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1021 fprintf(F, "PRED ");
1026 proj_nr = get_Filter_proj(n);
1027 if (! get_interprocedural_view()) {
1029 pred = get_Filter_pred(n);
1033 fprintf (F, "%ld ", proj_nr);
1036 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1039 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1042 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1045 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1056 #include "execution_frequency.h"
1057 #include "callgraph.h"
1059 void dump_node_ana_vals(FILE *F, ir_node *n) {
1061 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1062 get_irn_exec_freq(n),
1063 get_irg_method_execution_frequency(get_irn_irg(n)),
1064 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1065 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1070 /* Dumps a node label without the enclosing ". */
1071 int dump_node_label(FILE *F, ir_node *n) {
1074 bad |= dump_node_opcode(F, n);
1075 bad |= dump_node_mode(F, n);
1077 bad |= dump_node_typeinfo(F, n);
1078 bad |= dump_node_nodeattr(F, n);
1079 fprintf(F, "%ld", get_irn_node_nr(n));
1086 * Dumps the attributes of a node n into the file F.
1087 * Currently this is only the color of a node.
1089 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1094 print_vcg_color(F, ird_color_red);
1098 if (dump_node_vcgattr_hook)
1099 if (dump_node_vcgattr_hook(F, node, local))
1102 n = local ? local : node;
1104 if (overrule_nodecolor != ird_color_default) {
1105 print_vcg_color(F, overrule_nodecolor);
1109 switch (get_irn_opcode(n)) {
1116 print_vcg_color(F, ird_color_blue);
1119 if (is_Block_dead(n))
1120 print_vcg_color(F, ird_color_lightred);
1122 print_vcg_color(F, ird_color_lightyellow);
1125 print_vcg_color(F, ird_color_green);
1129 print_vcg_color(F, ird_color_gold);
1135 print_vcg_color(F, ird_color_yellow);
1138 PRINT_DEFAULT_NODE_ATTR;
1142 /* Adds a new node info dumper callback. */
1143 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1145 hook_entry_t *info = xmalloc(sizeof(*info));
1147 info->hook._hook_node_info = cb;
1148 info->context = data;
1149 register_hook(hook_node_info, info);
1154 /* Remove a previously added info dumper callback. */
1155 void dump_remv_node_info_callback(void *handle)
1157 hook_entry_t *info = handle;
1158 unregister_hook(hook_node_info, info);
1163 * Dump the node information of a node n to a file F.
1165 static INLINE int dump_node_info(FILE *F, ir_node *n)
1168 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1170 fprintf (F, " info1: \"");
1171 bad = dump_irnode_to_file(F, n);
1172 /* call the dump_node operation if available */
1174 bad = ops->dump_node(n, F, dump_node_info_txt);
1176 /* allow additional info to be added */
1177 hook_node_info(F, n);
1184 * checks whether a node is "constant-like" ie can be treated "block-less"
1187 int is_constlike_node(ir_node *n) {
1188 ir_op *op = get_irn_op(n);
1189 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1193 /** outputs the predecessors of n, that are constants, local. I.e.,
1194 generates a copy of the constant predecessors for each node called with. */
1195 static void dump_const_node_local(FILE *F, ir_node *n) {
1197 if (!get_opt_dump_const_local()) return;
1199 /* Use visited flag to avoid outputting nodes twice.
1200 initialize it first. */
1201 for (i = 0; i < get_irn_arity(n); i++) {
1202 ir_node *con = get_irn_n(n, i);
1203 if (is_constlike_node(con)) {
1204 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1208 for (i = 0; i < get_irn_arity(n); i++) {
1209 ir_node *con = get_irn_n(n, i);
1210 if (is_constlike_node(con) && irn_not_visited(con)) {
1213 mark_irn_visited(con);
1214 /* Generate a new name for the node by appending the names of
1216 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1217 fprintf(F, " label: \"");
1218 bad |= dump_node_label(F, con);
1220 bad |= dump_node_info(F, con);
1221 dump_node_vcgattr(F, n, con, bad);
1227 /** If the block of an edge is a const_like node, dump it local with an edge */
1228 static void dump_const_block_local(FILE *F, ir_node *n) {
1231 if (!get_opt_dump_const_local()) return;
1233 blk = get_nodes_block(n);
1234 if (is_constlike_node(blk)) {
1237 /* Generate a new name for the node by appending the names of
1239 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1240 fprintf(F, "\" label: \"");
1241 bad |= dump_node_label(F, blk);
1243 bad |= dump_node_info(F, blk);
1244 dump_node_vcgattr(F, n, blk, bad);
1247 fprintf (F, "edge: { sourcename: \"");
1249 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1251 if (dump_edge_vcgattr_hook) {
1253 if (dump_edge_vcgattr_hook(F, n, -1)) {
1258 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1263 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1268 * prints the error message of a node to a file F as info2.
1270 static void INLINE print_node_error(FILE *F, const char *err_msg)
1275 fprintf (F, " info2: \"%s\"", err_msg);
1279 * prints debug messages of a node to file F as info3.
1281 static void print_dbg_info(FILE *F, dbg_info *dbg)
1285 if (__dbg_info_snprint) {
1287 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1288 fprintf (F, " info3: \"%s\"\n", buf);
1295 static void dump_node(FILE *F, ir_node *n)
1300 if (get_opt_dump_const_local() && is_constlike_node(n))
1303 /* dump this node */
1304 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1306 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1307 bad |= dump_node_label(F, n);
1308 dump_node_ana_vals(F, n);
1309 //dump_node_ana_info(F, n);
1311 bad |= dump_node_info(F, n);
1312 print_node_error(F, p);
1313 print_dbg_info(F, get_irn_dbg_info(n));
1314 dump_node_vcgattr(F, n, NULL, bad);
1316 dump_const_node_local(F, n);
1318 if(dump_node_edge_hook)
1319 dump_node_edge_hook(F, n);
1321 dump_irn_chi_term(F, n);
1322 dump_irn_state(F, n);
1326 /** dump the edge to the block this node belongs to */
1328 dump_ir_block_edge(FILE *F, ir_node *n) {
1329 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1330 if (is_no_Block(n)) {
1331 ir_node *block = get_nodes_block(n);
1333 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1334 dump_const_block_local(F, n);
1337 fprintf (F, "edge: { sourcename: \"");
1339 fprintf (F, "\" targetname: ");
1340 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1342 if (dump_edge_vcgattr_hook) {
1344 if (dump_edge_vcgattr_hook(F, n, -1)) {
1349 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1354 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1360 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1362 * do not use get_nodes_block() here, will fail
1363 * if the irg is not pinned.
1365 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1366 fprintf (F, INTRA_DATA_EDGE_ATTR);
1368 fprintf (F, INTER_DATA_EDGE_ATTR);
1372 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1374 * do not use get_nodes_block() here, will fail
1375 * if the irg is not pinned.
1377 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1378 fprintf (F, INTRA_MEM_EDGE_ATTR);
1380 fprintf (F, INTER_MEM_EDGE_ATTR);
1384 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1387 if (dump_edge_vcgattr_hook)
1388 if (dump_edge_vcgattr_hook(F, from, to))
1391 if (dump_backedge_information_flag && is_backedge(from, to))
1392 fprintf (F, BACK_EDGE_ATTR);
1394 switch (get_irn_opcode(from)) {
1396 fprintf (F, CF_EDGE_ATTR);
1398 case iro_Start: break;
1401 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1402 fprintf (F, CF_EDGE_ATTR);
1403 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1404 fprintf (F, INTER_MEM_EDGE_ATTR);
1408 if (is_Proj(from)) {
1409 if (get_irn_mode(from) == mode_M)
1410 print_mem_edge_vcgattr(F, from, to);
1411 else if (get_irn_mode(from) == mode_X)
1412 fprintf(F, CF_EDGE_ATTR);
1414 print_data_edge_vcgattr(F, from, to);
1416 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1417 print_mem_edge_vcgattr(F, from, to);
1418 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1419 fprintf (F, CF_EDGE_ATTR);
1421 print_data_edge_vcgattr(F, from, to);
1425 /* dump edges to our inputs */
1427 dump_ir_data_edges(FILE *F, ir_node *n) {
1429 unsigned long visited = get_irn_visited(n);
1431 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1434 for (i = 0; i < get_irn_arity(n); i++) {
1435 ir_node * pred = get_irn_n(n, i);
1438 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1439 continue; /* pred not dumped */
1441 if (dump_backedge_information_flag && is_backedge(n, i))
1442 fprintf (F, "backedge: {sourcename: \"");
1444 fprintf (F, "edge: {sourcename: \"");
1446 fprintf (F, "\" targetname: ");
1447 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1448 PRINT_CONSTID(n, pred);
1450 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1452 fprintf (F, " label: \"%d\" ", i);
1453 print_edge_vcgattr(F, n, i);
1458 /** Dumps a node and its edges but not the block edge
1461 dump_node_wo_blockedge (ir_node *n, void *env) {
1464 dump_ir_data_edges(F, n);
1467 /** Dumps a node and its edges.
1470 dump_whole_node (ir_node *n, void *env) {
1472 dump_node_wo_blockedge(n, env);
1473 if (!node_floats(n)) dump_ir_block_edge(F, n);
1477 dump_const_node(ir_node *n, void *env) {
1478 if (is_Block(n)) return;
1479 dump_node_wo_blockedge(n, env);
1482 /***********************************************************************/
1483 /* the following routines dump the nodes/irgs bracketed to graphs. */
1484 /***********************************************************************/
1486 /** Dumps a constant expression as entity initializer, array bound ...
1488 static void dump_const_expression(FILE *F, ir_node *value) {
1489 ir_graph *rem = current_ir_graph;
1490 int rem_dump_const_local = dump_const_local;
1491 dump_const_local = 0;
1492 current_ir_graph = get_const_code_irg();
1493 irg_walk(value, dump_const_node, NULL, F);
1494 /* Decrease visited flag so that we walk with the same flag for the next
1495 expression. This guarantees that we don't dump the same node twice,
1496 as for const expressions cse is performed to save memory. */
1497 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1498 current_ir_graph = rem;
1499 dump_const_local = rem_dump_const_local;
1502 /** Dump a block as graph containing its nodes.
1504 * Expects to find nodes belonging to the block as list in its
1506 * Dumps the edges of all nodes including itself. */
1508 dump_whole_block(FILE *F, ir_node *block) {
1510 dumper_colors color = ird_color_yellow;
1512 assert(is_Block(block));
1514 fprintf(F, "graph: { title: \"");
1515 PRINT_NODEID(block);
1516 fprintf(F, "\" label: \"");
1517 dump_node_label(F, block);
1519 if (get_opt_dump_abstvals())
1520 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1523 /* colorize blocks */
1524 if (! get_Block_matured(block))
1525 color = ird_color_red;
1526 if (is_Block_dead(block))
1527 color = ird_color_orange;
1529 fprintf(F, "\" status:clustered ");
1530 print_vcg_color(F, color);
1533 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1534 dump_node_info(F, block);
1535 print_dbg_info(F, get_irn_dbg_info(block));
1537 /* dump the blocks edges */
1538 dump_ir_data_edges(F, block);
1540 if (dump_block_edge_hook)
1541 dump_block_edge_hook(F, block);
1543 /* dump the nodes that go into the block */
1544 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1546 dump_ir_data_edges(F, node);
1549 /* Close the vcg information for the block */
1551 dump_const_node_local(F, block);
1553 dump_irn_chi_term(F, block);
1558 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1559 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1561 dump_block_graph(FILE *F, ir_graph *irg) {
1563 ir_graph *rem = current_ir_graph;
1564 ir_node **arr = ird_get_irg_link(irg);
1565 current_ir_graph = irg;
1567 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1568 ir_node * node = arr[i];
1569 if (is_Block(node)) {
1570 /* Dumps the block and all the nodes in the block, which are to
1571 be found in Block->link. */
1572 dump_whole_block(F, node);
1574 /* Nodes that are not in a Block. */
1576 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1577 dump_const_block_local(F, node);
1579 dump_ir_data_edges(F, node);
1583 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1584 dump_loop_nodes_into_graph(F, irg);
1586 current_ir_graph = rem;
1590 * Dump the info for an irg.
1591 * Parsed by XVCG but not shown. use yComp.
1593 static void dump_graph_info(FILE *F, ir_graph *irg) {
1594 fprintf(F, "info1: \"");
1595 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1599 /** Dumps an irg as a graph clustered by block nodes.
1600 * If interprocedural view edges can point to nodes out of this graph.
1602 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1603 entity *ent = get_irg_entity(irg);
1605 fprintf(F, "graph: { title: \"");
1607 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1608 get_ent_dump_name(ent));
1610 dump_graph_info(F, irg);
1611 print_dbg_info(F, get_entity_dbg_info(ent));
1613 dump_block_graph(F, irg);
1615 /* Close the vcg information for the irg */
1616 fprintf(F, "}\n\n");
1619 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1620 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1622 dump_extblock_graph(FILE *F, ir_graph *irg) {
1624 ir_graph *rem = current_ir_graph;
1625 ir_extblk **arr = ird_get_irg_link(irg);
1626 current_ir_graph = irg;
1628 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1629 ir_extblk *extbb = arr[i];
1630 ir_node *leader = get_extbb_leader(extbb);
1633 fprintf(F, "graph: { title: \"");
1634 PRINT_EXTBBID(leader);
1635 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1636 get_irn_node_nr(leader));
1638 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1639 ir_node * node = extbb->blks[j];
1640 if (is_Block(node)) {
1641 /* Dumps the block and all the nodes in the block, which are to
1642 be found in Block->link. */
1643 dump_whole_block(F, node);
1645 /* Nodes that are not in a Block. */
1647 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1648 dump_const_block_local(F, node);
1650 dump_ir_data_edges(F, node);
1656 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1657 dump_loop_nodes_into_graph(F, irg);
1659 current_ir_graph = rem;
1664 /*******************************************************************/
1665 /* Basic type and entity nodes and edges. */
1666 /*******************************************************************/
1668 /** dumps the edges between nodes and their type or entity attributes. */
1669 static void dump_node2type_edges(ir_node *n, void *env)
1674 switch (get_irn_opcode(n)) {
1676 /* @@@ some consts have an entity */
1679 if ( (get_SymConst_kind(n) ==symconst_type_tag)
1680 || (get_SymConst_kind(n) ==symconst_size))
1682 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1686 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1689 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1692 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1695 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1698 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1706 static int print_type_info(FILE *F, ir_type *tp) {
1709 if (get_type_state(tp) == layout_undefined) {
1710 fprintf(F, "state: layout_undefined\n");
1712 fprintf(F, "state: layout_fixed,\n");
1714 if (get_type_mode(tp))
1715 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1716 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1721 static void print_typespecific_info(FILE *F, ir_type *tp) {
1722 switch (get_type_tpop_code(tp)) {
1725 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1732 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1733 fprintf(F, "params: %d\n", get_method_n_params(tp));
1734 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1742 case tpo_enumeration:
1756 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1757 switch (get_type_tpop_code(tp)) {
1760 if (peculiarity_existent == get_class_peculiarity(tp))
1761 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1763 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1767 fprintf (F, " " TYPE_METH_NODE_ATTR);
1778 case tpo_enumeration:
1792 int dump_type_node(FILE *F, ir_type *tp)
1796 fprintf (F, "node: {title: ");
1798 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1799 fprintf (F, " info1: \"");
1801 bad |= print_type_info(F, tp);
1802 print_typespecific_info(F, tp);
1804 dump_type_to_file(F, tp, dump_verbosity_max);
1806 fprintf (F, "\"\n");
1807 print_dbg_info(F, get_type_dbg_info(tp));
1808 print_typespecific_vcgattr(F, tp);
1815 #define X(a) case a: fprintf(F, #a); break
1816 void dump_entity_node(FILE *F, entity *ent, int color)
1818 fprintf (F, "node: {title: \"");
1819 PRINT_ENTID(ent); fprintf(F, "\"");
1820 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1821 fprintf (F, "label: ");
1822 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1824 fprintf(F, "color:%d", color);
1826 fprintf (F, ENTITY_NODE_ATTR);
1827 fprintf (F, "\n info1: \"");
1829 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1832 print_dbg_info(F, get_entity_dbg_info(ent));
1837 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1840 ident *id = get_enumeration_nameid(tp, pos);
1841 tarval *tv = get_enumeration_enum(tp, pos);
1843 tarval_snprintf(buf, sizeof(buf), tv);
1844 fprintf (F, "node: {title: \"");
1845 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1846 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1847 fprintf (F, "label: ");
1848 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1849 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1852 /* dumps a type or entity and it's edges. */
1854 dump_type_info(type_or_ent *tore, void *env) {
1856 int i = 0; /* to shutup gcc */
1858 /* dump this type or entity */
1860 switch (get_kind(tore)) {
1863 entity *ent = (entity *)tore;
1866 dump_entity_node(F, ent, 0);
1868 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1869 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1870 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1871 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1872 if (is_Class_type(get_entity_owner(ent))) {
1873 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1874 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1876 /* attached subgraphs */
1877 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1878 if (is_atomic_entity(ent)) {
1879 value = get_atomic_ent_value(ent);
1881 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1882 /* DDMN(value); $$$ */
1883 dump_const_expression(F, value);
1886 if (is_compound_entity(ent)) {
1887 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1888 value = get_compound_ent_value(ent, i);
1890 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1891 dump_const_expression(F, value);
1892 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1894 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1895 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1896 get_compound_ent_value_member(ent, i), i);
1905 ir_type *tp = (ir_type *)tore;
1906 dump_type_node(F, tp);
1907 /* and now the edges */
1908 switch (get_type_tpop_code(tp)) {
1911 for (i=0; i < get_class_n_supertypes(tp); i++)
1912 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1913 for (i=0; i < get_class_n_members(tp); i++)
1914 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1918 for (i=0; i < get_struct_n_members(tp); i++)
1919 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1923 for (i = 0; i < get_method_n_params(tp); i++)
1924 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1925 for (i = 0; i < get_method_n_ress(tp); i++)
1926 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1930 for (i = 0; i < get_union_n_members(tp); i++)
1931 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1935 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1936 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1937 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1938 ir_node *upper = get_array_upper_bound(tp, i);
1939 ir_node *lower = get_array_lower_bound(tp, i);
1940 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1941 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1942 dump_const_expression(F, upper);
1943 dump_const_expression(F, lower);
1947 case tpo_enumeration:
1949 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1950 dump_enum_item(F, tp, i);
1951 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1956 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1964 break; /* case k_type */
1967 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1969 } /* switch kind_or_entity */
1972 typedef struct _h_env {
1977 /** For dumping class hierarchies.
1978 * Dumps a class type node and a superclass edge.
1979 * If env->dump_ent dumps entities of classes and overwrites edges.
1982 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1985 int i = 0; /* to shutup gcc */
1987 /* dump this type or entity */
1988 switch (get_kind(tore)) {
1990 entity *ent = (entity *)tore;
1991 if (get_entity_owner(ent) == get_glob_type()) break;
1992 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1993 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1995 dump_entity_node(F, ent, 0);
1997 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1998 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1999 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2001 } break; /* case k_entity */
2004 ir_type *tp = (ir_type *)tore;
2005 if (tp == get_glob_type()) break;
2006 switch (get_type_tpop_code(tp)) {
2008 dump_type_node(F, tp);
2009 /* and now the edges */
2010 for (i=0; i < get_class_n_supertypes(tp); i++)
2012 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2018 break; /* case k_type */
2021 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2023 } /* switch kind_or_entity */
2026 /*******************************************************************/
2027 /* dump analysis information that is expressed in graph terms. */
2028 /*******************************************************************/
2030 /* dump out edges */
2032 dump_out_edge(ir_node *n, void *env) {
2035 for (i = 0; i < get_irn_n_outs(n); i++) {
2036 assert(get_irn_out(n, i));
2037 fprintf (F, "edge: {sourcename: \"");
2039 fprintf (F, "\" targetname: \"");
2040 PRINT_NODEID(get_irn_out(n, i));
2041 fprintf (F, "\" color: red linestyle: dashed");
2047 dump_loop_label(FILE *F, ir_loop *loop) {
2048 fprintf (F, "loop %d, %d sons, %d nodes",
2049 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2052 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2053 fprintf (F, " info1: \"");
2054 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2055 #if DEBUG_libfirm /* GL @@@ debug analyses */
2056 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2062 dump_loop_node(FILE *F, ir_loop *loop) {
2063 fprintf (F, "node: {title: \"");
2065 fprintf (F, "\" label: \"");
2066 dump_loop_label(F, loop);
2068 dump_loop_info(F, loop);
2074 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2076 fprintf (F, "edge: {sourcename: \"");
2078 fprintf (F, "\" targetname: \"");
2079 PRINT_NODEID(get_loop_node(loop, i));
2080 fprintf (F, "\" color: green");
2085 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2087 fprintf (F, "edge: {sourcename: \"");
2089 fprintf (F, "\" targetname: \"");
2090 PRINT_LOOPID(get_loop_son(loop, i));
2091 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2092 get_loop_element_pos(loop, get_loop_son(loop, i)));
2096 void dump_loops(FILE *F, ir_loop *loop) {
2098 /* dump this loop node */
2099 dump_loop_node(F, loop);
2101 /* dump edges to nodes in loop -- only if it is a real loop */
2102 if (get_loop_depth(loop) != 0) {
2103 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2104 dump_loop_node_edge(F, loop, i);
2107 for (i = 0; i < get_loop_n_sons(loop); i++) {
2108 dump_loops(F, get_loop_son(loop, i));
2109 dump_loop_son_edge(F, loop, i);
2114 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2115 ir_graph *rem = current_ir_graph;
2116 current_ir_graph = irg;
2118 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2120 current_ir_graph = rem;
2125 * dumps the VCG header
2127 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2136 if (!orientation) orientation = "bottom_to_top";
2140 "graph: { title: \"ir graph of %s\"\n"
2141 "display_edge_labels: %s\n"
2142 "layoutalgorithm: mindepth\n"
2143 "manhattan_edges: yes\n"
2144 "port_sharing: no\n"
2146 "classname 1: \"intrablock Data\"\n"
2147 "classname 2: \"Block\"\n"
2148 "classname 3: \"Entity type\"\n"
2149 "classname 4: \"Entity owner\"\n"
2150 "classname 5: \"Method Param\"\n"
2151 "classname 6: \"Method Res\"\n"
2152 "classname 7: \"Super\"\n"
2153 "classname 8: \"Union\"\n"
2154 "classname 9: \"Points-to\"\n"
2155 "classname 10: \"Array Element Type\"\n"
2156 "classname 11: \"Overwrites\"\n"
2157 "classname 12: \"Member\"\n"
2158 "classname 13: \"Control Flow\"\n"
2159 "classname 14: \"intrablock Memory\"\n"
2160 "classname 15: \"Dominators\"\n"
2161 "classname 16: \"interblock Data\"\n"
2162 "classname 17: \"interblock Memory\"\n"
2163 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2164 "classname 19: \"Postdominators\"\n"
2165 "infoname 1: \"Attribute\"\n"
2166 "infoname 2: \"Verification errors\"\n"
2167 "infoname 3: \"Debug info\"\n",
2168 name, label, orientation);
2170 /* don't use all, the range is too whith/black. */
2174 "colorentry 100: 0 0 0\n"
2175 "colorentry 101: 20 0 0\n"
2176 "colorentry 102: 40 0 0\n"
2177 "colorentry 103: 60 0 0\n"
2178 "colorentry 104: 80 0 0\n"
2179 "colorentry 105: 100 0 0\n"
2180 "colorentry 106: 120 0 0\n"
2181 "colorentry 107: 140 0 0\n"
2182 "colorentry 108: 150 0 0\n"
2183 "colorentry 109: 180 0 0\n"
2184 "colorentry 110: 200 0 0\n"
2185 "colorentry 111: 220 0 0\n"
2186 "colorentry 112: 240 0 0\n"
2187 "colorentry 113: 255 0 0\n"
2188 "colorentry 113: 255 20 20\n"
2189 "colorentry 114: 255 40 40\n"
2190 "colorentry 115: 255 60 60\n"
2191 "colorentry 116: 255 80 80\n"
2192 "colorentry 117: 255 100 100\n"
2193 "colorentry 118: 255 120 120\n"
2194 "colorentry 119: 255 140 140\n"
2195 "colorentry 120: 255 150 150\n"
2196 "colorentry 121: 255 180 180\n"
2197 "colorentry 122: 255 200 200\n"
2198 "colorentry 123: 255 220 220\n"
2199 "colorentry 124: 255 240 240\n"
2200 "colorentry 125: 255 250 250\n"
2203 fprintf (F, "\n"); /* a separator */
2209 * @param irg The graph to be dumped
2210 * @param suffix1 first filename suffix
2211 * @param suffix2 second filename suffix
2213 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2215 const char *nm = get_irg_dump_name(irg);
2216 int len = strlen(nm), i, j;
2217 char *fname; /* filename to put the vcg information in */
2219 if (!suffix1) suffix1 = "";
2220 if (!suffix2) suffix2 = "";
2222 /* open file for vcg graph */
2223 fname = malloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2225 /* strncpy (fname, nm, len); */ /* copy the filename */
2227 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2229 fname[j] = '@'; j++; fname[j] = '1'; j++;
2230 } else if (nm[i] == '@') {
2231 fname[j] = '@'; j++; fname[j] = '2'; j++;
2233 fname[j] = nm[i]; j++;
2237 strcat (fname, suffix1); /* append file suffix */
2238 strcat (fname, suffix2); /* append file suffix */
2239 strcat (fname, ".vcg"); /* append the .vcg suffix */
2241 /* vcg really expect only a <CR> at end of line, so
2242 * the "b"inary mode is what you mean (and even needed for Win32)
2244 F = fopen (fname, "wb"); /* open file for writing */
2246 panic("cannot open %s for writing (%m)", fname); /* not reached */
2256 * @param name prefix file name
2257 * @param suffix filename suffix
2259 FILE *vcg_open_name (const char *name, const char *suffix) {
2261 char *fname; /* filename to put the vcg information in */
2262 int i, j, len = strlen(name);
2264 if (!suffix) suffix = "";
2266 /** open file for vcg graph */
2267 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2268 /* strcpy (fname, name);*/ /* copy the filename */
2270 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2271 if (name[i] == '/') {
2272 fname[j] = '@'; j++; fname[j] = '1'; j++;
2273 } else if (name[i] == '@') {
2274 fname[j] = '@'; j++; fname[j] = '2'; j++;
2276 fname[j] = name[i]; j++;
2280 strcat (fname, suffix);
2281 strcat (fname, ".vcg"); /* append the .vcg suffix */
2283 /* vcg really expect only a <CR> at end of line, so
2284 * the "b"inary mode is what you mean (and even needed for Win32)
2286 F = fopen (fname, "wb"); /* open file for writing */
2288 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2296 * Dumps the vcg file footer
2298 static INLINE void dump_vcg_footer (FILE *F) {
2303 * close the vcg file
2305 void vcg_close (FILE *F) {
2306 dump_vcg_footer(F); /* print footer */
2307 fclose (F); /* close vcg file */
2310 /************************************************************************/
2311 /************************************************************************/
2312 /* Routines that dump all or parts of the firm representation to a file */
2313 /************************************************************************/
2314 /************************************************************************/
2316 /************************************************************************/
2317 /* Dump ir graphs, different formats and additional information. */
2318 /************************************************************************/
2320 /** Routine to dump a graph, blocks as conventional nodes. */
2322 dump_ir_graph (ir_graph *irg, const char *suffix )
2327 rem = current_ir_graph;
2329 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2331 current_ir_graph = irg;
2332 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2333 else suffix1 = "-pure";
2334 f = vcg_open(irg, suffix, suffix1);
2335 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2337 /* call the dump graph hook */
2338 if (dump_ir_graph_hook)
2339 if (dump_ir_graph_hook(f, irg))
2342 /* walk over the graph */
2343 /* dump_whole_node must be called in post visiting predecessors */
2344 ird_walk_graph(irg, NULL, dump_whole_node, f);
2346 /* dump the out edges in a separate walk */
2347 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2348 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2353 current_ir_graph = rem;
2356 /* Dump a firm graph without explicit block nodes. */
2357 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2363 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2366 if (get_interprocedural_view()) suffix1 = "-ip";
2368 f = vcg_open(irg, suffix, suffix1);
2369 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2371 construct_block_lists(irg);
2374 * If we are in the interprocedural view, we dump not
2375 * only the requested irg but also all irgs that can be reached
2378 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2379 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2381 dump_graph_from_list(f, get_irp_irg(i));
2389 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2390 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2397 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2400 if (get_irg_extblk_state(irg) != extblk_valid)
2403 if (get_interprocedural_view()) suffix1 = "-ip";
2406 ent = get_irg_entity(irg);
2408 F = vcg_open(irg, suffix, suffix1);
2409 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2411 construct_extblock_lists(irg);
2413 fprintf(F, "graph: { title: \"");
2415 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2416 get_ent_dump_name(ent));
2418 dump_graph_info(F, irg);
2419 print_dbg_info(F, get_entity_dbg_info(ent));
2421 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2422 ir_graph *irg = get_irp_irg(i);
2423 list_tuple *lists = ird_get_irg_link(irg);
2426 /* dump the extended blocks first */
2427 if (ARR_LEN(lists->extbb_list)) {
2428 ird_set_irg_link(irg, lists->extbb_list);
2429 dump_extblock_graph(F, irg);
2432 /* we may have blocks without extended blocks, bad for instance */
2433 if (ARR_LEN(lists->blk_list)) {
2434 ird_set_irg_link(irg, lists->blk_list);
2435 dump_block_graph(F, irg);
2438 DEL_ARR_F(lists->extbb_list);
2439 DEL_ARR_F(lists->blk_list);
2444 /* Close the vcg information for the irg */
2445 fprintf(F, "}\n\n");
2451 /* dumps a graph with type information */
2453 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2456 ir_graph *rem = current_ir_graph;
2458 int rem_dump_const_local;
2460 /* if a filter is set, dump only the irg's that match the filter */
2461 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2464 current_ir_graph = irg;
2465 rem_dump_const_local = dump_const_local;
2466 /* dumping types does not work with local nodes */
2467 dump_const_local = 0;
2469 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2470 else suffix1 = "-pure-wtypes";
2471 f = vcg_open(irg,suffix, suffix1);
2472 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2474 /* dump common ir graph */
2475 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2476 /* dump type info */
2477 type_walk_irg(irg, dump_type_info, NULL, f);
2478 inc_irg_visited(get_const_code_irg());
2479 /* dump edges from graph to type info */
2480 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2483 dump_const_local = rem_dump_const_local;
2484 current_ir_graph = rem;
2488 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2493 ir_graph *rem = current_ir_graph;
2494 int rem_dump_const_local;
2496 /* if a filter is set, dump only the irg's that match the filter */
2497 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2500 rem_dump_const_local = dump_const_local;
2501 /* dumping types does not work with local nodes */
2502 dump_const_local = 0;
2504 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2505 else suffix1 = "-wtypes";
2506 f = vcg_open(irg, suffix, suffix1);
2507 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2509 /* dump common blocked ir graph */
2510 construct_block_lists(irg);
2512 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2513 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2515 dump_graph_from_list(f, get_irp_irg(i));
2520 /* dump type info */
2521 current_ir_graph = irg;
2522 type_walk_irg(irg, dump_type_info, NULL, f);
2523 inc_irg_visited(get_const_code_irg());
2525 /* dump edges from graph to type info */
2526 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2529 dump_const_local = rem_dump_const_local;
2530 current_ir_graph = rem;
2533 /*---------------------------------------------------------------------*/
2534 /* The following routines dump a control flow graph. */
2535 /*---------------------------------------------------------------------*/
2538 dump_block_to_cfg(ir_node *block, void *env) {
2543 if (is_Block(block)) {
2544 /* This is a block. Dump a node for the block. */
2545 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2546 fprintf (F, "\" label: \"");
2547 if (block == get_irg_start_block(get_irn_irg(block)))
2548 fprintf(F, "Start ");
2549 if (block == get_irg_end_block(get_irn_irg(block)))
2552 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2553 PRINT_NODEID(block);
2555 fprintf(F, "info1:\"");
2557 /* the generic version. */
2558 dump_irnode_to_file(F, block);
2560 /* Check whether we have bad predecessors to color the block. */
2561 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2562 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2565 fprintf (F, "\""); /* closing quote of info */
2567 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2568 (block == get_irg_end_block(get_irn_irg(block))) )
2569 fprintf(F, " color:blue ");
2571 fprintf(F, " color:yellow ");
2574 /* Dump the edges */
2575 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2576 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2577 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2578 fprintf (F, "edge: { sourcename: \"");
2579 PRINT_NODEID(block);
2580 fprintf (F, "\" targetname: \"");
2582 fprintf (F, "\"}\n");
2585 /* Dump dominator/postdominator edge */
2586 if (dump_dominator_information_flag) {
2587 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2588 pred = get_Block_idom(block);
2589 fprintf (F, "edge: { sourcename: \"");
2590 PRINT_NODEID(block);
2591 fprintf (F, "\" targetname: \"");
2593 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2595 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2596 pred = get_Block_ipostdom(block);
2597 fprintf (F, "edge: { sourcename: \"");
2598 PRINT_NODEID(block);
2599 fprintf (F, "\" targetname: \"");
2601 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2608 dump_cfg (ir_graph *irg, const char *suffix)
2611 ir_graph *rem = current_ir_graph;
2612 int ipv = get_interprocedural_view();
2614 /* if a filter is set, dump only the irg's that match the filter */
2615 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2618 current_ir_graph = irg;
2620 f = vcg_open(irg, suffix, "-cfg");
2621 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2624 printf("Warning: dumping cfg not in interprocedural view!\n");
2625 set_interprocedural_view(0);
2628 /* walk over the blocks in the graph */
2629 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2630 dump_node(f, get_irg_bad(irg));
2632 set_interprocedural_view(ipv);
2634 current_ir_graph = rem;
2638 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2639 if (pset_find_ptr(mark_set, n)) return;
2641 pset_insert_ptr(mark_set, n);
2644 int i, start = is_Block(n) ? 0 : -1;
2645 dump_whole_node(n, F);
2646 for (i = start; i < get_irn_arity(n); ++i)
2647 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2650 /* Don't dump edges to nodes further out. These might be edges to
2651 nodes we already dumped, if there is a shorter path to these. */
2655 static int subgraph_counter = 0;
2656 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2659 pset *mark_set = pset_new_ptr(1);
2660 sprintf(buf, "-subg_%03d", subgraph_counter++);
2661 F = vcg_open(get_irn_irg(root), suffix, buf);
2662 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2663 descend_and_dump(F, root, depth, mark_set);
2669 static int weight_overall(int rec, int loop) {
2670 return 2*rec + loop;
2673 static int compute_color (int my, int max) {
2680 /* if small, scale to the full color range. */
2682 my = my * (n_colors/max);
2684 step = 1 + (max / n_colors);
2688 return base_color + n_colors - color;
2691 static int get_entity_color(entity *ent) {
2692 ir_graph *irg = get_entity_irg(ent);
2696 int rec_depth = get_irg_recursion_depth(irg);
2697 int loop_depth = get_irg_loop_depth(irg);
2698 int overall_depth = weight_overall(rec_depth, loop_depth);
2700 int max_rec_depth = irp->max_callgraph_recursion_depth;
2701 int max_loop_depth = irp->max_callgraph_loop_depth;
2702 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2704 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2705 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2706 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2708 return my_overall_color;
2712 void dump_callgraph(const char *suffix) {
2715 int rem = edge_label;
2717 //ident *prefix = new_id_from_str("java/");
2719 F = vcg_open_name("Callgraph", suffix);
2720 dump_vcg_header(F, "Callgraph", NULL);
2722 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2723 ir_graph *irg = get_irp_irg(i);
2724 entity *ent = get_irg_entity(irg);
2725 int j, n_callees = get_irg_n_callees(irg);
2727 /* Do not dump runtime system. */
2728 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2730 dump_entity_node(F, ent, get_entity_color(ent));
2731 for (j = 0; j < n_callees; ++j) {
2732 entity *c = get_irg_entity(get_irg_callee(irg, j));
2733 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2734 int be = is_irg_callee_backedge(irg, j);
2737 "label:\"recursion %d\" color:%d" :
2738 "label:\"calls %d\" color:%d";
2739 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2747 /* Dump all irgs in interprocedural view to a single file. */
2748 void dump_all_cg_block_graph(const char *suffix) {
2751 int rem_view = get_interprocedural_view();
2752 set_interprocedural_view(1);
2754 f = vcg_open_name("All_graphs", suffix);
2755 dump_vcg_header(f, "All_graphs", NULL);
2757 /* collect nodes in all irgs reachable in call graph*/
2758 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2759 ird_set_irg_link(get_irp_irg(i), NULL);
2761 cg_walk(clear_link, collect_node, NULL);
2763 /* dump all graphs */
2764 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2765 current_ir_graph = get_irp_irg(i);
2766 assert(ird_get_irg_link(current_ir_graph));
2767 dump_graph_from_list(f, current_ir_graph);
2768 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2772 set_interprocedural_view(rem_view);
2775 /*---------------------------------------------------------------------*/
2776 /* the following routines dumps type information without any ir nodes. */
2777 /*---------------------------------------------------------------------*/
2780 dump_type_graph (ir_graph *irg, const char *suffix)
2784 rem = current_ir_graph;
2786 /* if a filter is set, dump only the irg's that match the filter */
2787 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2789 current_ir_graph = irg;
2791 f = vcg_open(irg, suffix, "-type");
2792 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2794 /* walk over the blocks in the graph */
2795 type_walk_irg(irg, dump_type_info, NULL, f);
2796 /* The walker for the const code can be called several times for the
2797 same (sub) expression. So that no nodes are dumped several times
2798 we decrease the visited flag of the corresponding graph after each
2799 walk. So now increase it finally. */
2800 inc_irg_visited(get_const_code_irg());
2803 current_ir_graph = rem;
2807 dump_all_types (const char *suffix)
2809 FILE *f = vcg_open_name("All_types", suffix);
2810 dump_vcg_header(f, "All_types", NULL);
2811 type_walk(dump_type_info, NULL, f);
2812 inc_irg_visited(get_const_code_irg());
2817 dump_class_hierarchy (int entities, const char *suffix)
2819 FILE *f = vcg_open_name("class_hierarchy", suffix);
2823 env.dump_ent = entities;
2824 dump_vcg_header(f, "class_hierarchy", NULL);
2825 type_walk(dump_class_hierarchy_node, NULL, &env);
2829 /*---------------------------------------------------------------------*/
2830 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2832 /* dump_ir_block_graph */
2834 /* dump_type_graph */
2835 /* dump_ir_graph_w_types */
2836 /*---------------------------------------------------------------------*/
2838 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2840 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2841 dmp_grph(get_irp_irg(i), suffix);
2845 /*--------------------------------------------------------------------------------*
2846 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2847 * packed together in one subgraph/box *
2848 *--------------------------------------------------------------------------------*/
2850 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2851 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2853 ir_loop *son = NULL;
2855 /* Dump a new loop node. */
2856 dump_loop_node(F, loop);
2858 /* Dump the loop elements. */
2860 for(i = 0; i < get_loop_n_elements(loop); i++) {
2861 le = get_loop_element(loop, i);
2863 if (get_kind(son) == k_ir_loop) {
2865 /* We are a loop son -> Recurse */
2867 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2868 fprintf(F, "\" }\n");
2869 fprintf (F, "edge: {sourcename: \"");
2871 fprintf (F, "\" targetname: \"");
2873 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2874 loop_node_started = 0;
2876 dump_loop_son_edge(F, loop, son_number++);
2877 dump_loops_standalone(F, son);
2878 } else if (get_kind(son) == k_ir_node) {
2879 /* We are a loop node -> Collect firm nodes */
2881 ir_node *n = le.node;
2884 if (!loop_node_started) {
2885 /* Start a new node which contains all firm nodes of the current loop */
2886 fprintf (F, "node: { title: \"");
2888 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2889 loop_node_started = 1;
2895 bad |= dump_node_label(F, n);
2896 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2897 if (has_backedges(n)) fprintf(F, "\t loop head!");
2898 } else { /* for callgraph loop tree */
2900 assert(get_kind(son) == k_ir_graph);
2902 /* We are a loop node -> Collect firm graphs */
2903 n = (ir_graph *)le.node;
2904 if (!loop_node_started) {
2905 /* Start a new node which contains all firm nodes of the current loop */
2906 fprintf (F, "node: { title: \"");
2908 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2909 loop_node_started = 1;
2914 fprintf (F, " %s", get_irg_dump_name(n));
2915 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2919 if (loop_node_started) {
2920 fprintf(F, "\" }\n");
2921 fprintf (F, "edge: {sourcename: \"");
2923 fprintf (F, "\" targetname: \"");
2925 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2926 loop_node_started = 0;
2930 void dump_loop_tree(ir_graph *irg, const char *suffix)
2933 ir_graph *rem = current_ir_graph;
2934 int el_rem = edge_label;
2937 /* if a filter is set, dump only the irg's that match the filter */
2938 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2940 current_ir_graph = irg;
2942 f = vcg_open(irg, suffix, "-looptree");
2943 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2945 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2949 edge_label = el_rem;
2950 current_ir_graph = rem;
2953 void dump_callgraph_loop_tree(const char *suffix) {
2955 F = vcg_open_name("Callgraph_looptree", suffix);
2956 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2957 dump_loops_standalone(F, irp->outermost_cg_loop);
2962 /*-----------------------------------------------------------------------------*/
2963 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2964 /*-----------------------------------------------------------------------------*/
2966 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2967 int i, son_number = 0, node_number = 0;
2969 if (dump_loop_information_flag) dump_loop_node(F, loop);
2971 for (i = 0; i < get_loop_n_elements(loop); i++) {
2972 loop_element le = get_loop_element(loop, i);
2973 if (*(le.kind) == k_ir_loop) {
2974 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2976 collect_nodeloop(F, le.son, loopnodes);
2978 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2979 eset_insert(loopnodes, le.node);
2984 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2987 for(i = 0; i < get_loop_n_elements(loop); i++) {
2988 loop_element le = get_loop_element(loop, i);
2989 if (*(le.kind) == k_ir_loop) {
2991 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2993 if (is_Block(le.node)) start = 0; else start = -1;
2994 for (j = start; j < get_irn_arity(le.node); j++) {
2995 ir_node *pred = get_irn_n(le.node, j);
2996 if (!eset_contains(loopnodes, pred)) {
2997 eset_insert(extnodes, pred);
2998 if (!is_Block(pred)) {
2999 pred = get_nodes_block(pred);
3000 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3008 void dump_loop(ir_loop *l, const char *suffix) {
3011 eset *loopnodes = eset_create();
3012 eset *extnodes = eset_create();
3015 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3016 F = vcg_open_name (name, suffix);
3017 dump_vcg_header(F, name, NULL);
3019 /* collect all nodes to dump */
3020 collect_nodeloop(F, l, loopnodes);
3021 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3023 /* build block lists */
3024 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3025 set_irn_link(n, NULL);
3026 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3027 set_irn_link(n, NULL);
3028 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3030 b = get_nodes_block(n);
3031 set_irn_link(n, get_irn_link(b));
3034 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3036 b = get_nodes_block(n);
3037 set_irn_link(n, get_irn_link(b));
3041 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3043 fprintf(F, "graph: { title: \"");
3045 fprintf(F, "\" label: \"");
3046 dump_node_opcode(F, b);
3047 fprintf (F, " %ld", get_irn_node_nr(b));
3048 fprintf(F, "\" status:clustered color:yellow\n");
3050 /* dump the blocks edges */
3051 dump_ir_data_edges(F, b);
3053 /* dump the nodes that go into the block */
3054 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3055 if (eset_contains(extnodes, n))
3056 overrule_nodecolor = ird_color_lightblue;
3058 overrule_nodecolor = ird_color_default;
3059 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3062 /* Close the vcg information for the block */
3064 dump_const_node_local(F, b);
3067 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3069 fprintf(F, "graph: { title: \"");
3071 fprintf(F, "\" label: \"");
3072 dump_node_opcode(F, b);
3073 fprintf (F, " %ld", get_irn_node_nr(b));
3074 fprintf(F, "\" status:clustered color:lightblue\n");
3076 /* dump the nodes that go into the block */
3077 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3078 if (!eset_contains(loopnodes, n))
3079 overrule_nodecolor = ird_color_lightblue;
3081 overrule_nodecolor = ird_color_default;
3082 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3085 /* Close the vcg information for the block */
3087 dump_const_node_local(F, b);
3091 eset_destroy(loopnodes);
3092 eset_destroy(extnodes);