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 }
827 /** the lookup table for Proj(Cond) names */
828 static const pns_lookup_t cond_lut[] = {
829 #define X(a) { pn_Cond_##a, #a }
835 /** the lookup table for Proj(Call) names */
836 static const pns_lookup_t call_lut[] = {
837 #define X(a) { pn_Call_##a, #a }
846 /** the lookup table for Proj(Quot) names */
847 static const pns_lookup_t quot_lut[] = {
848 #define X(a) { pn_Quot_##a, #a }
855 /** the lookup table for Proj(DivMod) names */
856 static const pns_lookup_t divmod_lut[] = {
857 #define X(a) { pn_DivMod_##a, #a }
865 /** the lookup table for Proj(Div) names */
866 static const pns_lookup_t div_lut[] = {
867 #define X(a) { pn_Div_##a, #a }
874 /** the lookup table for Proj(Mod) names */
875 static const pns_lookup_t mod_lut[] = {
876 #define X(a) { pn_Mod_##a, #a }
883 /** the lookup table for Proj(Load) names */
884 static const pns_lookup_t load_lut[] = {
885 #define X(a) { pn_Load_##a, #a }
892 /** the lookup table for Proj(Store) names */
893 static const pns_lookup_t store_lut[] = {
894 #define X(a) { pn_Store_##a, #a }
900 /** the lookup table for Proj(Alloc) names */
901 static const pns_lookup_t alloc_lut[] = {
902 #define X(a) { pn_Alloc_##a, #a }
909 /** the lookup table for Proj(CopyB) names */
910 static const pns_lookup_t copyb_lut[] = {
911 #define X(a) { pn_CopyB_##a, #a }
918 /** the lookup table for Proj(InstOf) names */
919 static const pns_lookup_t instof_lut[] = {
920 #define X(a) { pn_InstOf_##a, #a }
928 /** the lookup table for Proj(Raise) names */
929 static const pns_lookup_t raise_lut[] = {
930 #define X(a) { pn_Raise_##a, #a }
936 /** the lookup table for Proj(Bound) names */
937 static const pns_lookup_t bound_lut[] = {
938 #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 (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1680 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1683 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1686 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1689 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1692 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1695 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1703 static int print_type_info(FILE *F, ir_type *tp) {
1706 if (get_type_state(tp) == layout_undefined) {
1707 fprintf(F, "state: layout_undefined\n");
1709 fprintf(F, "state: layout_fixed,\n");
1711 if (get_type_mode(tp))
1712 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1713 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1718 static void print_typespecific_info(FILE *F, ir_type *tp) {
1719 switch (get_type_tpop_code(tp)) {
1722 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1729 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1730 fprintf(F, "params: %d\n", get_method_n_params(tp));
1731 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1739 case tpo_enumeration:
1753 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1754 switch (get_type_tpop_code(tp)) {
1757 if (peculiarity_existent == get_class_peculiarity(tp))
1758 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1760 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1764 fprintf (F, " " TYPE_METH_NODE_ATTR);
1775 case tpo_enumeration:
1789 int dump_type_node(FILE *F, ir_type *tp)
1793 fprintf (F, "node: {title: ");
1795 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1796 fprintf (F, " info1: \"");
1798 bad |= print_type_info(F, tp);
1799 print_typespecific_info(F, tp);
1801 dump_type_to_file(F, tp, dump_verbosity_max);
1803 fprintf (F, "\"\n");
1804 print_dbg_info(F, get_type_dbg_info(tp));
1805 print_typespecific_vcgattr(F, tp);
1812 #define X(a) case a: fprintf(F, #a); break
1813 void dump_entity_node(FILE *F, entity *ent, int color)
1815 fprintf (F, "node: {title: \"");
1816 PRINT_ENTID(ent); fprintf(F, "\"");
1817 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1818 fprintf (F, "label: ");
1819 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1821 fprintf(F, "color:%d", color);
1823 fprintf (F, ENTITY_NODE_ATTR);
1824 fprintf (F, "\n info1: \"");
1826 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1829 print_dbg_info(F, get_entity_dbg_info(ent));
1834 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1837 ident *id = get_enumeration_nameid(tp, pos);
1838 tarval *tv = get_enumeration_enum(tp, pos);
1840 tarval_snprintf(buf, sizeof(buf), tv);
1841 fprintf (F, "node: {title: \"");
1842 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1843 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1844 fprintf (F, "label: ");
1845 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1846 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1849 /* dumps a type or entity and it's edges. */
1851 dump_type_info(type_or_ent *tore, void *env) {
1853 int i = 0; /* to shutup gcc */
1855 /* dump this type or entity */
1857 switch (get_kind(tore)) {
1860 entity *ent = (entity *)tore;
1863 dump_entity_node(F, ent, 0);
1865 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1866 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1867 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1868 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1869 if (is_Class_type(get_entity_owner(ent))) {
1870 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1871 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1873 /* attached subgraphs */
1874 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1875 if (is_atomic_entity(ent)) {
1876 value = get_atomic_ent_value(ent);
1878 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1879 /* DDMN(value); $$$ */
1880 dump_const_expression(F, value);
1883 if (is_compound_entity(ent)) {
1884 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1885 value = get_compound_ent_value(ent, i);
1887 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1888 dump_const_expression(F, value);
1889 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1891 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1892 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1893 get_compound_ent_value_member(ent, i), i);
1902 ir_type *tp = (ir_type *)tore;
1903 dump_type_node(F, tp);
1904 /* and now the edges */
1905 switch (get_type_tpop_code(tp)) {
1908 for (i=0; i < get_class_n_supertypes(tp); i++)
1909 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1910 for (i=0; i < get_class_n_members(tp); i++)
1911 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1915 for (i=0; i < get_struct_n_members(tp); i++)
1916 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1920 for (i = 0; i < get_method_n_params(tp); i++)
1921 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1922 for (i = 0; i < get_method_n_ress(tp); i++)
1923 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1927 for (i = 0; i < get_union_n_members(tp); i++)
1928 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1932 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1933 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1934 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1935 ir_node *upper = get_array_upper_bound(tp, i);
1936 ir_node *lower = get_array_lower_bound(tp, i);
1937 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1938 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1939 dump_const_expression(F, upper);
1940 dump_const_expression(F, lower);
1944 case tpo_enumeration:
1946 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1947 dump_enum_item(F, tp, i);
1948 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1953 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1961 break; /* case k_type */
1964 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1966 } /* switch kind_or_entity */
1969 typedef struct _h_env {
1974 /** For dumping class hierarchies.
1975 * Dumps a class type node and a superclass edge.
1976 * If env->dump_ent dumps entities of classes and overwrites edges.
1979 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1982 int i = 0; /* to shutup gcc */
1984 /* dump this type or entity */
1985 switch (get_kind(tore)) {
1987 entity *ent = (entity *)tore;
1988 if (get_entity_owner(ent) == get_glob_type()) break;
1989 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1990 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1992 dump_entity_node(F, ent, 0);
1994 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
1995 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1996 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
1998 } break; /* case k_entity */
2001 ir_type *tp = (ir_type *)tore;
2002 if (tp == get_glob_type()) break;
2003 switch (get_type_tpop_code(tp)) {
2005 dump_type_node(F, tp);
2006 /* and now the edges */
2007 for (i=0; i < get_class_n_supertypes(tp); i++)
2009 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2015 break; /* case k_type */
2018 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2020 } /* switch kind_or_entity */
2023 /*******************************************************************/
2024 /* dump analysis information that is expressed in graph terms. */
2025 /*******************************************************************/
2027 /* dump out edges */
2029 dump_out_edge(ir_node *n, void *env) {
2032 for (i = 0; i < get_irn_n_outs(n); i++) {
2033 assert(get_irn_out(n, i));
2034 fprintf (F, "edge: {sourcename: \"");
2036 fprintf (F, "\" targetname: \"");
2037 PRINT_NODEID(get_irn_out(n, i));
2038 fprintf (F, "\" color: red linestyle: dashed");
2044 dump_loop_label(FILE *F, ir_loop *loop) {
2045 fprintf (F, "loop %d, %d sons, %d nodes",
2046 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2049 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2050 fprintf (F, " info1: \"");
2051 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2052 #if DEBUG_libfirm /* GL @@@ debug analyses */
2053 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2059 dump_loop_node(FILE *F, ir_loop *loop) {
2060 fprintf (F, "node: {title: \"");
2062 fprintf (F, "\" label: \"");
2063 dump_loop_label(F, loop);
2065 dump_loop_info(F, loop);
2071 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2073 fprintf (F, "edge: {sourcename: \"");
2075 fprintf (F, "\" targetname: \"");
2076 PRINT_NODEID(get_loop_node(loop, i));
2077 fprintf (F, "\" color: green");
2082 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2084 fprintf (F, "edge: {sourcename: \"");
2086 fprintf (F, "\" targetname: \"");
2087 PRINT_LOOPID(get_loop_son(loop, i));
2088 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2089 get_loop_element_pos(loop, get_loop_son(loop, i)));
2093 void dump_loops(FILE *F, ir_loop *loop) {
2095 /* dump this loop node */
2096 dump_loop_node(F, loop);
2098 /* dump edges to nodes in loop -- only if it is a real loop */
2099 if (get_loop_depth(loop) != 0) {
2100 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2101 dump_loop_node_edge(F, loop, i);
2104 for (i = 0; i < get_loop_n_sons(loop); i++) {
2105 dump_loops(F, get_loop_son(loop, i));
2106 dump_loop_son_edge(F, loop, i);
2111 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2112 ir_graph *rem = current_ir_graph;
2113 current_ir_graph = irg;
2115 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2117 current_ir_graph = rem;
2122 * dumps the VCG header
2124 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2133 if (!orientation) orientation = "bottom_to_top";
2137 "graph: { title: \"ir graph of %s\"\n"
2138 "display_edge_labels: %s\n"
2139 "layoutalgorithm: mindepth\n"
2140 "manhattan_edges: yes\n"
2141 "port_sharing: no\n"
2143 "classname 1: \"intrablock Data\"\n"
2144 "classname 2: \"Block\"\n"
2145 "classname 3: \"Entity type\"\n"
2146 "classname 4: \"Entity owner\"\n"
2147 "classname 5: \"Method Param\"\n"
2148 "classname 6: \"Method Res\"\n"
2149 "classname 7: \"Super\"\n"
2150 "classname 8: \"Union\"\n"
2151 "classname 9: \"Points-to\"\n"
2152 "classname 10: \"Array Element Type\"\n"
2153 "classname 11: \"Overwrites\"\n"
2154 "classname 12: \"Member\"\n"
2155 "classname 13: \"Control Flow\"\n"
2156 "classname 14: \"intrablock Memory\"\n"
2157 "classname 15: \"Dominators\"\n"
2158 "classname 16: \"interblock Data\"\n"
2159 "classname 17: \"interblock Memory\"\n"
2160 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2161 "classname 19: \"Postdominators\"\n"
2162 "infoname 1: \"Attribute\"\n"
2163 "infoname 2: \"Verification errors\"\n"
2164 "infoname 3: \"Debug info\"\n",
2165 name, label, orientation);
2167 /* don't use all, the range is too whith/black. */
2171 "colorentry 100: 0 0 0\n"
2172 "colorentry 101: 20 0 0\n"
2173 "colorentry 102: 40 0 0\n"
2174 "colorentry 103: 60 0 0\n"
2175 "colorentry 104: 80 0 0\n"
2176 "colorentry 105: 100 0 0\n"
2177 "colorentry 106: 120 0 0\n"
2178 "colorentry 107: 140 0 0\n"
2179 "colorentry 108: 150 0 0\n"
2180 "colorentry 109: 180 0 0\n"
2181 "colorentry 110: 200 0 0\n"
2182 "colorentry 111: 220 0 0\n"
2183 "colorentry 112: 240 0 0\n"
2184 "colorentry 113: 255 0 0\n"
2185 "colorentry 113: 255 20 20\n"
2186 "colorentry 114: 255 40 40\n"
2187 "colorentry 115: 255 60 60\n"
2188 "colorentry 116: 255 80 80\n"
2189 "colorentry 117: 255 100 100\n"
2190 "colorentry 118: 255 120 120\n"
2191 "colorentry 119: 255 140 140\n"
2192 "colorentry 120: 255 150 150\n"
2193 "colorentry 121: 255 180 180\n"
2194 "colorentry 122: 255 200 200\n"
2195 "colorentry 123: 255 220 220\n"
2196 "colorentry 124: 255 240 240\n"
2197 "colorentry 125: 255 250 250\n"
2200 fprintf (F, "\n"); /* a separator */
2206 * @param irg The graph to be dumped
2207 * @param suffix1 first filename suffix
2208 * @param suffix2 second filename suffix
2210 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2212 const char *nm = get_irg_dump_name(irg);
2213 int len = strlen(nm), i, j;
2214 char *fname; /* filename to put the vcg information in */
2216 if (!suffix1) suffix1 = "";
2217 if (!suffix2) suffix2 = "";
2219 /* open file for vcg graph */
2220 fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2222 /* strncpy (fname, nm, len); */ /* copy the filename */
2224 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2226 fname[j] = '@'; j++; fname[j] = '1'; j++;
2227 } else if (nm[i] == '@') {
2228 fname[j] = '@'; j++; fname[j] = '2'; j++;
2230 fname[j] = nm[i]; j++;
2234 strcat (fname, suffix1); /* append file suffix */
2235 strcat (fname, suffix2); /* append file suffix */
2236 strcat (fname, ".vcg"); /* append the .vcg suffix */
2238 /* vcg really expect only a <CR> at end of line, so
2239 * the "b"inary mode is what you mean (and even needed for Win32)
2241 F = fopen (fname, "wb"); /* open file for writing */
2243 panic("cannot open %s for writing (%m)", fname); /* not reached */
2253 * @param name prefix file name
2254 * @param suffix filename suffix
2256 FILE *vcg_open_name (const char *name, const char *suffix) {
2258 char *fname; /* filename to put the vcg information in */
2259 int i, j, len = strlen(name);
2261 if (!suffix) suffix = "";
2263 /** open file for vcg graph */
2264 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2265 /* strcpy (fname, name);*/ /* copy the filename */
2267 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2268 if (name[i] == '/') {
2269 fname[j] = '@'; j++; fname[j] = '1'; j++;
2270 } else if (name[i] == '@') {
2271 fname[j] = '@'; j++; fname[j] = '2'; j++;
2273 fname[j] = name[i]; j++;
2277 strcat (fname, suffix);
2278 strcat (fname, ".vcg"); /* append the .vcg suffix */
2280 /* vcg really expect only a <CR> at end of line, so
2281 * the "b"inary mode is what you mean (and even needed for Win32)
2283 F = fopen (fname, "wb"); /* open file for writing */
2285 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2293 * Dumps the vcg file footer
2295 static INLINE void dump_vcg_footer (FILE *F) {
2300 * close the vcg file
2302 void vcg_close (FILE *F) {
2303 dump_vcg_footer(F); /* print footer */
2304 fclose (F); /* close vcg file */
2307 /************************************************************************/
2308 /************************************************************************/
2309 /* Routines that dump all or parts of the firm representation to a file */
2310 /************************************************************************/
2311 /************************************************************************/
2313 /************************************************************************/
2314 /* Dump ir graphs, different formats and additional information. */
2315 /************************************************************************/
2317 /** Routine to dump a graph, blocks as conventional nodes. */
2319 dump_ir_graph (ir_graph *irg, const char *suffix )
2324 rem = current_ir_graph;
2326 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2328 current_ir_graph = irg;
2329 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2330 else suffix1 = "-pure";
2331 f = vcg_open(irg, suffix, suffix1);
2332 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2334 /* call the dump graph hook */
2335 if (dump_ir_graph_hook)
2336 if (dump_ir_graph_hook(f, irg))
2339 /* walk over the graph */
2340 /* dump_whole_node must be called in post visiting predecessors */
2341 ird_walk_graph(irg, NULL, dump_whole_node, f);
2343 /* dump the out edges in a separate walk */
2344 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2345 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2350 current_ir_graph = rem;
2353 /* Dump a firm graph without explicit block nodes. */
2354 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2360 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2363 if (get_interprocedural_view()) suffix1 = "-ip";
2365 f = vcg_open(irg, suffix, suffix1);
2366 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2368 construct_block_lists(irg);
2371 * If we are in the interprocedural view, we dump not
2372 * only the requested irg but also all irgs that can be reached
2375 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2376 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2378 dump_graph_from_list(f, get_irp_irg(i));
2386 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2387 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2394 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2397 if (get_irg_extblk_state(irg) != extblk_valid)
2400 if (get_interprocedural_view()) suffix1 = "-ip";
2403 ent = get_irg_entity(irg);
2405 F = vcg_open(irg, suffix, suffix1);
2406 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2408 construct_extblock_lists(irg);
2410 fprintf(F, "graph: { title: \"");
2412 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2413 get_ent_dump_name(ent));
2415 dump_graph_info(F, irg);
2416 print_dbg_info(F, get_entity_dbg_info(ent));
2418 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2419 ir_graph *irg = get_irp_irg(i);
2420 list_tuple *lists = ird_get_irg_link(irg);
2423 /* dump the extended blocks first */
2424 if (ARR_LEN(lists->extbb_list)) {
2425 ird_set_irg_link(irg, lists->extbb_list);
2426 dump_extblock_graph(F, irg);
2429 /* we may have blocks without extended blocks, bad for instance */
2430 if (ARR_LEN(lists->blk_list)) {
2431 ird_set_irg_link(irg, lists->blk_list);
2432 dump_block_graph(F, irg);
2435 DEL_ARR_F(lists->extbb_list);
2436 DEL_ARR_F(lists->blk_list);
2441 /* Close the vcg information for the irg */
2442 fprintf(F, "}\n\n");
2448 /* dumps a graph with type information */
2450 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2453 ir_graph *rem = current_ir_graph;
2455 int rem_dump_const_local;
2457 /* if a filter is set, dump only the irg's that match the filter */
2458 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2461 current_ir_graph = irg;
2462 rem_dump_const_local = dump_const_local;
2463 /* dumping types does not work with local nodes */
2464 dump_const_local = 0;
2466 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2467 else suffix1 = "-pure-wtypes";
2468 f = vcg_open(irg,suffix, suffix1);
2469 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2471 /* dump common ir graph */
2472 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2473 /* dump type info */
2474 type_walk_irg(irg, dump_type_info, NULL, f);
2475 inc_irg_visited(get_const_code_irg());
2476 /* dump edges from graph to type info */
2477 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2480 dump_const_local = rem_dump_const_local;
2481 current_ir_graph = rem;
2485 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2490 ir_graph *rem = current_ir_graph;
2491 int rem_dump_const_local;
2493 /* if a filter is set, dump only the irg's that match the filter */
2494 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2497 rem_dump_const_local = dump_const_local;
2498 /* dumping types does not work with local nodes */
2499 dump_const_local = 0;
2501 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2502 else suffix1 = "-wtypes";
2503 f = vcg_open(irg, suffix, suffix1);
2504 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2506 /* dump common blocked ir graph */
2507 construct_block_lists(irg);
2509 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2510 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2512 dump_graph_from_list(f, get_irp_irg(i));
2517 /* dump type info */
2518 current_ir_graph = irg;
2519 type_walk_irg(irg, dump_type_info, NULL, f);
2520 inc_irg_visited(get_const_code_irg());
2522 /* dump edges from graph to type info */
2523 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2526 dump_const_local = rem_dump_const_local;
2527 current_ir_graph = rem;
2530 /*---------------------------------------------------------------------*/
2531 /* The following routines dump a control flow graph. */
2532 /*---------------------------------------------------------------------*/
2535 dump_block_to_cfg(ir_node *block, void *env) {
2540 if (is_Block(block)) {
2541 /* This is a block. Dump a node for the block. */
2542 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2543 fprintf (F, "\" label: \"");
2544 if (block == get_irg_start_block(get_irn_irg(block)))
2545 fprintf(F, "Start ");
2546 if (block == get_irg_end_block(get_irn_irg(block)))
2549 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2550 PRINT_NODEID(block);
2552 fprintf(F, "info1:\"");
2554 /* the generic version. */
2555 dump_irnode_to_file(F, block);
2557 /* Check whether we have bad predecessors to color the block. */
2558 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2559 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2562 fprintf (F, "\""); /* closing quote of info */
2564 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2565 (block == get_irg_end_block(get_irn_irg(block))) )
2566 fprintf(F, " color:blue ");
2568 fprintf(F, " color:yellow ");
2571 /* Dump the edges */
2572 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2573 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2574 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2575 fprintf (F, "edge: { sourcename: \"");
2576 PRINT_NODEID(block);
2577 fprintf (F, "\" targetname: \"");
2579 fprintf (F, "\"}\n");
2582 /* Dump dominator/postdominator edge */
2583 if (dump_dominator_information_flag) {
2584 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2585 pred = get_Block_idom(block);
2586 fprintf (F, "edge: { sourcename: \"");
2587 PRINT_NODEID(block);
2588 fprintf (F, "\" targetname: \"");
2590 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2592 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2593 pred = get_Block_ipostdom(block);
2594 fprintf (F, "edge: { sourcename: \"");
2595 PRINT_NODEID(block);
2596 fprintf (F, "\" targetname: \"");
2598 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2605 dump_cfg (ir_graph *irg, const char *suffix)
2608 ir_graph *rem = current_ir_graph;
2609 int ipv = get_interprocedural_view();
2611 /* if a filter is set, dump only the irg's that match the filter */
2612 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2615 current_ir_graph = irg;
2617 f = vcg_open(irg, suffix, "-cfg");
2618 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2621 printf("Warning: dumping cfg not in interprocedural view!\n");
2622 set_interprocedural_view(0);
2625 /* walk over the blocks in the graph */
2626 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2627 dump_node(f, get_irg_bad(irg));
2629 set_interprocedural_view(ipv);
2631 current_ir_graph = rem;
2635 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2636 if (pset_find_ptr(mark_set, n)) return;
2638 pset_insert_ptr(mark_set, n);
2641 int i, start = is_Block(n) ? 0 : -1;
2642 dump_whole_node(n, F);
2643 for (i = start; i < get_irn_arity(n); ++i)
2644 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2647 /* Don't dump edges to nodes further out. These might be edges to
2648 nodes we already dumped, if there is a shorter path to these. */
2652 static int subgraph_counter = 0;
2653 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2656 pset *mark_set = pset_new_ptr(1);
2657 sprintf(buf, "-subg_%03d", subgraph_counter++);
2658 F = vcg_open(get_irn_irg(root), suffix, buf);
2659 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2660 descend_and_dump(F, root, depth, mark_set);
2666 static int weight_overall(int rec, int loop) {
2667 return 2*rec + loop;
2670 static int compute_color (int my, int max) {
2677 /* if small, scale to the full color range. */
2679 my = my * (n_colors/max);
2681 step = 1 + (max / n_colors);
2685 return base_color + n_colors - color;
2688 static int get_entity_color(entity *ent) {
2689 ir_graph *irg = get_entity_irg(ent);
2693 int rec_depth = get_irg_recursion_depth(irg);
2694 int loop_depth = get_irg_loop_depth(irg);
2695 int overall_depth = weight_overall(rec_depth, loop_depth);
2697 int max_rec_depth = irp->max_callgraph_recursion_depth;
2698 int max_loop_depth = irp->max_callgraph_loop_depth;
2699 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2701 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2702 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2703 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2705 return my_overall_color;
2709 void dump_callgraph(const char *suffix) {
2712 int rem = edge_label;
2714 //ident *prefix = new_id_from_str("java/");
2716 F = vcg_open_name("Callgraph", suffix);
2717 dump_vcg_header(F, "Callgraph", NULL);
2719 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2720 ir_graph *irg = get_irp_irg(i);
2721 entity *ent = get_irg_entity(irg);
2722 int j, n_callees = get_irg_n_callees(irg);
2724 /* Do not dump runtime system. */
2725 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2727 dump_entity_node(F, ent, get_entity_color(ent));
2728 for (j = 0; j < n_callees; ++j) {
2729 entity *c = get_irg_entity(get_irg_callee(irg, j));
2730 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2731 int be = is_irg_callee_backedge(irg, j);
2734 "label:\"recursion %d\" color:%d" :
2735 "label:\"calls %d\" color:%d";
2736 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2744 /* Dump all irgs in interprocedural view to a single file. */
2745 void dump_all_cg_block_graph(const char *suffix) {
2748 int rem_view = get_interprocedural_view();
2749 set_interprocedural_view(1);
2751 f = vcg_open_name("All_graphs", suffix);
2752 dump_vcg_header(f, "All_graphs", NULL);
2754 /* collect nodes in all irgs reachable in call graph*/
2755 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2756 ird_set_irg_link(get_irp_irg(i), NULL);
2758 cg_walk(clear_link, collect_node, NULL);
2760 /* dump all graphs */
2761 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2762 current_ir_graph = get_irp_irg(i);
2763 assert(ird_get_irg_link(current_ir_graph));
2764 dump_graph_from_list(f, current_ir_graph);
2765 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2769 set_interprocedural_view(rem_view);
2772 /*---------------------------------------------------------------------*/
2773 /* the following routines dumps type information without any ir nodes. */
2774 /*---------------------------------------------------------------------*/
2777 dump_type_graph (ir_graph *irg, const char *suffix)
2781 rem = current_ir_graph;
2783 /* if a filter is set, dump only the irg's that match the filter */
2784 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2786 current_ir_graph = irg;
2788 f = vcg_open(irg, suffix, "-type");
2789 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2791 /* walk over the blocks in the graph */
2792 type_walk_irg(irg, dump_type_info, NULL, f);
2793 /* The walker for the const code can be called several times for the
2794 same (sub) expression. So that no nodes are dumped several times
2795 we decrease the visited flag of the corresponding graph after each
2796 walk. So now increase it finally. */
2797 inc_irg_visited(get_const_code_irg());
2800 current_ir_graph = rem;
2804 dump_all_types (const char *suffix)
2806 FILE *f = vcg_open_name("All_types", suffix);
2807 dump_vcg_header(f, "All_types", NULL);
2808 type_walk(dump_type_info, NULL, f);
2809 inc_irg_visited(get_const_code_irg());
2814 dump_class_hierarchy (int entities, const char *suffix)
2816 FILE *f = vcg_open_name("class_hierarchy", suffix);
2820 env.dump_ent = entities;
2821 dump_vcg_header(f, "class_hierarchy", NULL);
2822 type_walk(dump_class_hierarchy_node, NULL, &env);
2826 /*---------------------------------------------------------------------*/
2827 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2829 /* dump_ir_block_graph */
2831 /* dump_type_graph */
2832 /* dump_ir_graph_w_types */
2833 /*---------------------------------------------------------------------*/
2835 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2837 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2838 dmp_grph(get_irp_irg(i), suffix);
2842 /*--------------------------------------------------------------------------------*
2843 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2844 * packed together in one subgraph/box *
2845 *--------------------------------------------------------------------------------*/
2847 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2848 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2850 ir_loop *son = NULL;
2852 /* Dump a new loop node. */
2853 dump_loop_node(F, loop);
2855 /* Dump the loop elements. */
2857 for(i = 0; i < get_loop_n_elements(loop); i++) {
2858 le = get_loop_element(loop, i);
2860 if (get_kind(son) == k_ir_loop) {
2862 /* We are a loop son -> Recurse */
2864 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2865 fprintf(F, "\" }\n");
2866 fprintf (F, "edge: {sourcename: \"");
2868 fprintf (F, "\" targetname: \"");
2870 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2871 loop_node_started = 0;
2873 dump_loop_son_edge(F, loop, son_number++);
2874 dump_loops_standalone(F, son);
2875 } else if (get_kind(son) == k_ir_node) {
2876 /* We are a loop node -> Collect firm nodes */
2878 ir_node *n = le.node;
2881 if (!loop_node_started) {
2882 /* Start a new node which contains all firm nodes of the current loop */
2883 fprintf (F, "node: { title: \"");
2885 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2886 loop_node_started = 1;
2892 bad |= dump_node_label(F, n);
2893 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2894 if (has_backedges(n)) fprintf(F, "\t loop head!");
2895 } else { /* for callgraph loop tree */
2897 assert(get_kind(son) == k_ir_graph);
2899 /* We are a loop node -> Collect firm graphs */
2900 n = (ir_graph *)le.node;
2901 if (!loop_node_started) {
2902 /* Start a new node which contains all firm nodes of the current loop */
2903 fprintf (F, "node: { title: \"");
2905 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2906 loop_node_started = 1;
2911 fprintf (F, " %s", get_irg_dump_name(n));
2912 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2916 if (loop_node_started) {
2917 fprintf(F, "\" }\n");
2918 fprintf (F, "edge: {sourcename: \"");
2920 fprintf (F, "\" targetname: \"");
2922 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2923 loop_node_started = 0;
2927 void dump_loop_tree(ir_graph *irg, const char *suffix)
2930 ir_graph *rem = current_ir_graph;
2931 int el_rem = edge_label;
2934 /* if a filter is set, dump only the irg's that match the filter */
2935 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2937 current_ir_graph = irg;
2939 f = vcg_open(irg, suffix, "-looptree");
2940 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2942 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2946 edge_label = el_rem;
2947 current_ir_graph = rem;
2950 void dump_callgraph_loop_tree(const char *suffix) {
2952 F = vcg_open_name("Callgraph_looptree", suffix);
2953 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2954 dump_loops_standalone(F, irp->outermost_cg_loop);
2959 /*-----------------------------------------------------------------------------*/
2960 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2961 /*-----------------------------------------------------------------------------*/
2963 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2964 int i, son_number = 0, node_number = 0;
2966 if (dump_loop_information_flag) dump_loop_node(F, loop);
2968 for (i = 0; i < get_loop_n_elements(loop); i++) {
2969 loop_element le = get_loop_element(loop, i);
2970 if (*(le.kind) == k_ir_loop) {
2971 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2973 collect_nodeloop(F, le.son, loopnodes);
2975 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2976 eset_insert(loopnodes, le.node);
2981 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2984 for(i = 0; i < get_loop_n_elements(loop); i++) {
2985 loop_element le = get_loop_element(loop, i);
2986 if (*(le.kind) == k_ir_loop) {
2988 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2990 if (is_Block(le.node)) start = 0; else start = -1;
2991 for (j = start; j < get_irn_arity(le.node); j++) {
2992 ir_node *pred = get_irn_n(le.node, j);
2993 if (!eset_contains(loopnodes, pred)) {
2994 eset_insert(extnodes, pred);
2995 if (!is_Block(pred)) {
2996 pred = get_nodes_block(pred);
2997 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3005 void dump_loop(ir_loop *l, const char *suffix) {
3008 eset *loopnodes = eset_create();
3009 eset *extnodes = eset_create();
3012 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3013 F = vcg_open_name (name, suffix);
3014 dump_vcg_header(F, name, NULL);
3016 /* collect all nodes to dump */
3017 collect_nodeloop(F, l, loopnodes);
3018 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3020 /* build block lists */
3021 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3022 set_irn_link(n, NULL);
3023 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3024 set_irn_link(n, NULL);
3025 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3027 b = get_nodes_block(n);
3028 set_irn_link(n, get_irn_link(b));
3031 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3033 b = get_nodes_block(n);
3034 set_irn_link(n, get_irn_link(b));
3038 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3040 fprintf(F, "graph: { title: \"");
3042 fprintf(F, "\" label: \"");
3043 dump_node_opcode(F, b);
3044 fprintf (F, " %ld", get_irn_node_nr(b));
3045 fprintf(F, "\" status:clustered color:yellow\n");
3047 /* dump the blocks edges */
3048 dump_ir_data_edges(F, b);
3050 /* dump the nodes that go into the block */
3051 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3052 if (eset_contains(extnodes, n))
3053 overrule_nodecolor = ird_color_lightblue;
3055 overrule_nodecolor = ird_color_default;
3056 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3059 /* Close the vcg information for the block */
3061 dump_const_node_local(F, b);
3064 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3066 fprintf(F, "graph: { title: \"");
3068 fprintf(F, "\" label: \"");
3069 dump_node_opcode(F, b);
3070 fprintf (F, " %ld", get_irn_node_nr(b));
3071 fprintf(F, "\" status:clustered color:lightblue\n");
3073 /* dump the nodes that go into the block */
3074 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3075 if (!eset_contains(loopnodes, n))
3076 overrule_nodecolor = ird_color_lightblue;
3078 overrule_nodecolor = ird_color_default;
3079 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3082 /* Close the vcg information for the block */
3084 dump_const_node_local(F, b);
3088 eset_destroy(loopnodes);
3089 eset_destroy(extnodes);