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));
737 if (get_Conv_strict(n))
738 fprintf (F, "strict");
739 fprintf (F, "%s", get_irn_opname(n));
744 fprintf (F, "%s", get_irn_opname(n));
751 * Dump the mode of a node n to a file F.
752 * Ignore modes that are "always known".
754 static int dump_node_mode(FILE *F, ir_node *n)
757 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
760 /* call the dump_node operation if available */
762 return ops->dump_node(n, F, dump_node_mode_txt);
764 /* default implementation */
765 iro = get_irn_opcode(n);
777 ir_mode *mode = get_irn_mode(n);
779 if (mode && mode != mode_BB && mode != mode_ANY && mode != mode_BAD &&
780 (mode != mode_T || iro == iro_Proj))
781 fprintf(F, "%s", get_mode_name_ex(mode, &bad));
789 * Dump the type of a node n to a file F if it's known.
791 static int dump_node_typeinfo(FILE *F, ir_node *n) {
794 if (opt_dump_analysed_type_info) {
795 if (get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent ||
796 get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent) {
797 ir_type *tp = get_irn_typeinfo_type(n);
798 if (tp != firm_none_type)
799 fprintf(F, "[%s] ", get_type_name_ex(tp, &bad));
807 typedef struct _pns_lookup {
808 long nr; /**< the proj number */
809 const char *name; /**< the name of the Proj */
812 typedef struct _proj_lookup {
813 opcode code; /**< the opcode of the Proj predecessor */
814 unsigned num_data; /**< number of data entries */
815 const pns_lookup_t *data; /**< the data */
818 #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
820 /** the lookup table for Proj(Start) names */
821 static const pns_lookup_t start_lut[] = {
822 #define X(a) { pn_Start_##a, #a }
832 /** the lookup table for Proj(Cond) names */
833 static const pns_lookup_t cond_lut[] = {
834 #define X(a) { pn_Cond_##a, #a }
840 /** the lookup table for Proj(Call) names */
841 static const pns_lookup_t call_lut[] = {
842 #define X(a) { pn_Call_##a, #a }
851 /** the lookup table for Proj(Quot) names */
852 static const pns_lookup_t quot_lut[] = {
853 #define X(a) { pn_Quot_##a, #a }
860 /** the lookup table for Proj(DivMod) names */
861 static const pns_lookup_t divmod_lut[] = {
862 #define X(a) { pn_DivMod_##a, #a }
870 /** the lookup table for Proj(Div) names */
871 static const pns_lookup_t div_lut[] = {
872 #define X(a) { pn_Div_##a, #a }
879 /** the lookup table for Proj(Mod) names */
880 static const pns_lookup_t mod_lut[] = {
881 #define X(a) { pn_Mod_##a, #a }
888 /** the lookup table for Proj(Load) names */
889 static const pns_lookup_t load_lut[] = {
890 #define X(a) { pn_Load_##a, #a }
897 /** the lookup table for Proj(Store) names */
898 static const pns_lookup_t store_lut[] = {
899 #define X(a) { pn_Store_##a, #a }
905 /** the lookup table for Proj(Alloc) names */
906 static const pns_lookup_t alloc_lut[] = {
907 #define X(a) { pn_Alloc_##a, #a }
914 /** the lookup table for Proj(CopyB) names */
915 static const pns_lookup_t copyb_lut[] = {
916 #define X(a) { pn_CopyB_##a, #a }
923 /** the lookup table for Proj(InstOf) names */
924 static const pns_lookup_t instof_lut[] = {
925 #define X(a) { pn_InstOf_##a, #a }
933 /** the lookup table for Proj(Raise) names */
934 static const pns_lookup_t raise_lut[] = {
935 #define X(a) { pn_Raise_##a, #a }
941 /** the lookup table for Proj(Bound) names */
942 static const pns_lookup_t bound_lut[] = {
943 #define X(a) { pn_Bound_##a, #a }
950 /** the Proj lookup table */
951 static const proj_lookup_t proj_lut[] = {
952 #define E(a) ARR_SIZE(a), a
953 { iro_Start, E(start_lut) },
954 { iro_Cond, E(cond_lut) },
955 { iro_Call, E(call_lut) },
956 { iro_Quot, E(quot_lut) },
957 { iro_DivMod, E(divmod_lut) },
958 { iro_Div, E(div_lut) },
959 { iro_Mod, E(mod_lut) },
960 { iro_Load, E(load_lut) },
961 { iro_Store, E(store_lut) },
962 { iro_Alloc, E(alloc_lut) },
963 { iro_CopyB, E(copyb_lut) },
964 { iro_InstOf, E(instof_lut) },
965 { iro_Raise, E(raise_lut) },
966 { iro_Bound, E(bound_lut) }
971 * Dump additional node attributes of some nodes to a file F.
974 dump_node_nodeattr(FILE *F, ir_node *n)
980 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
982 /* call the dump_node operation if available */
984 return ops->dump_node(n, F, dump_node_nodeattr_txt);
986 switch (get_irn_opcode(n)) {
988 if (0 && get_interprocedural_view()) {
989 fprintf (F, "%s ", get_ent_dump_name(get_irg_entity(current_ir_graph)));
994 pred = get_Proj_pred(n);
995 proj_nr = get_Proj_proj(n);
997 code = get_irn_opcode(pred);
1000 fprintf (F, "%s ", get_pnc_string(get_Proj_proj(n)));
1001 else if (code == iro_Proj && get_irn_opcode(get_Proj_pred(pred)) == iro_Start)
1002 fprintf (F, "Arg %ld ", proj_nr);
1003 else if (code == iro_Cond && get_irn_mode(get_Cond_selector(pred)) != mode_b)
1004 fprintf (F, "%ld ", proj_nr);
1006 unsigned i, j, f = 0;
1008 for (i = 0; i < ARR_SIZE(proj_lut); ++i) {
1009 if (code == proj_lut[i].code) {
1010 for (j = 0; j < proj_lut[i].num_data; ++j) {
1011 if (proj_nr == proj_lut[i].data[j].nr) {
1012 fprintf (F, "%s ", proj_lut[i].data[j].name);
1021 fprintf (F, "%ld ", proj_nr);
1022 if (code == iro_Cond && get_Cond_jmp_pred(pred) != COND_JMP_PRED_NONE) {
1023 if (proj_nr == pn_Cond_false && get_Cond_jmp_pred(pred) == COND_JMP_PRED_FALSE)
1024 fprintf(F, "PRED ");
1025 if (proj_nr == pn_Cond_true && get_Cond_jmp_pred(pred) == COND_JMP_PRED_TRUE)
1026 fprintf(F, "PRED ");
1031 proj_nr = get_Filter_proj(n);
1032 if (! get_interprocedural_view()) {
1034 pred = get_Filter_pred(n);
1038 fprintf (F, "%ld ", proj_nr);
1041 fprintf (F, "%s ", get_ent_dump_name(get_Sel_entity(n)));
1044 fprintf (F, "(%s) ", get_type_name_ex(get_Cast_type(n), &bad));
1047 fprintf (F, "%s ", get_pnc_string(get_Confirm_cmp(n)));
1050 fprintf (F, "(%s) ", get_type_name_ex(get_CopyB_type(n), &bad));
1061 #include "execution_frequency.h"
1062 #include "callgraph.h"
1064 void dump_node_ana_vals(FILE *F, ir_node *n) {
1066 fprintf(F, " %lf*(%2.0lf + %2.0lf) = %2.0lf ",
1067 get_irn_exec_freq(n),
1068 get_irg_method_execution_frequency(get_irn_irg(n)),
1069 pow(5, get_irg_recursion_depth(get_irn_irg(n))),
1070 get_irn_exec_freq(n) * (get_irg_method_execution_frequency(get_irn_irg(n)) + pow(5, get_irg_recursion_depth(get_irn_irg(n))))
1075 /* Dumps a node label without the enclosing ". */
1076 int dump_node_label(FILE *F, ir_node *n) {
1079 bad |= dump_node_opcode(F, n);
1080 bad |= dump_node_mode(F, n);
1082 bad |= dump_node_typeinfo(F, n);
1083 bad |= dump_node_nodeattr(F, n);
1084 fprintf(F, "%ld", get_irn_node_nr(n));
1091 * Dumps the attributes of a node n into the file F.
1092 * Currently this is only the color of a node.
1094 static void dump_node_vcgattr(FILE *F, ir_node *node, ir_node *local, int bad)
1099 print_vcg_color(F, ird_color_red);
1103 if (dump_node_vcgattr_hook)
1104 if (dump_node_vcgattr_hook(F, node, local))
1107 n = local ? local : node;
1109 if (overrule_nodecolor != ird_color_default) {
1110 print_vcg_color(F, overrule_nodecolor);
1114 switch (get_irn_opcode(n)) {
1121 print_vcg_color(F, ird_color_blue);
1124 if (is_Block_dead(n))
1125 print_vcg_color(F, ird_color_lightred);
1127 print_vcg_color(F, ird_color_lightyellow);
1130 print_vcg_color(F, ird_color_green);
1134 print_vcg_color(F, ird_color_gold);
1140 print_vcg_color(F, ird_color_yellow);
1143 PRINT_DEFAULT_NODE_ATTR;
1147 /* Adds a new node info dumper callback. */
1148 void *dump_add_node_info_callback(dump_node_info_cb_t *cb, void *data)
1150 hook_entry_t *info = xmalloc(sizeof(*info));
1152 info->hook._hook_node_info = cb;
1153 info->context = data;
1154 register_hook(hook_node_info, info);
1159 /* Remove a previously added info dumper callback. */
1160 void dump_remv_node_info_callback(void *handle)
1162 hook_entry_t *info = handle;
1163 unregister_hook(hook_node_info, info);
1168 * Dump the node information of a node n to a file F.
1170 static INLINE int dump_node_info(FILE *F, ir_node *n)
1173 const ir_op_ops *ops = get_op_ops(get_irn_op(n));
1175 fprintf (F, " info1: \"");
1176 bad = dump_irnode_to_file(F, n);
1177 /* call the dump_node operation if available */
1179 bad = ops->dump_node(n, F, dump_node_info_txt);
1181 /* allow additional info to be added */
1182 hook_node_info(F, n);
1189 * checks whether a node is "constant-like" ie can be treated "block-less"
1192 int is_constlike_node(ir_node *n) {
1193 ir_op *op = get_irn_op(n);
1194 return (op == op_Const || op == op_Bad || op == op_NoMem || op == op_SymConst || op == op_Unknown);
1198 /** outputs the predecessors of n, that are constants, local. I.e.,
1199 generates a copy of the constant predecessors for each node called with. */
1200 static void dump_const_node_local(FILE *F, ir_node *n) {
1202 if (!get_opt_dump_const_local()) return;
1204 /* Use visited flag to avoid outputting nodes twice.
1205 initialize it first. */
1206 for (i = 0; i < get_irn_arity(n); i++) {
1207 ir_node *con = get_irn_n(n, i);
1208 if (is_constlike_node(con)) {
1209 set_irn_visited(con, get_irg_visited(current_ir_graph) - 1);
1213 for (i = 0; i < get_irn_arity(n); i++) {
1214 ir_node *con = get_irn_n(n, i);
1215 if (is_constlike_node(con) && irn_not_visited(con)) {
1218 mark_irn_visited(con);
1219 /* Generate a new name for the node by appending the names of
1221 fprintf(F, "node: {title: "); PRINT_CONSTID(n, con);
1222 fprintf(F, " label: \"");
1223 bad |= dump_node_label(F, con);
1225 bad |= dump_node_info(F, con);
1226 dump_node_vcgattr(F, n, con, bad);
1232 /** If the block of an edge is a const_like node, dump it local with an edge */
1233 static void dump_const_block_local(FILE *F, ir_node *n) {
1236 if (!get_opt_dump_const_local()) return;
1238 blk = get_nodes_block(n);
1239 if (is_constlike_node(blk)) {
1242 /* Generate a new name for the node by appending the names of
1244 fprintf(F, "node: {title: \""); PRINT_CONSTBLKID(n, blk);
1245 fprintf(F, "\" label: \"");
1246 bad |= dump_node_label(F, blk);
1248 bad |= dump_node_info(F, blk);
1249 dump_node_vcgattr(F, n, blk, bad);
1252 fprintf (F, "edge: { sourcename: \"");
1254 fprintf (F, "\" targetname: \""); PRINT_CONSTBLKID(n,blk);
1256 if (dump_edge_vcgattr_hook) {
1258 if (dump_edge_vcgattr_hook(F, n, -1)) {
1263 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1268 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
1273 * prints the error message of a node to a file F as info2.
1275 static void INLINE print_node_error(FILE *F, const char *err_msg)
1280 fprintf (F, " info2: \"%s\"", err_msg);
1284 * prints debug messages of a node to file F as info3.
1286 static void print_dbg_info(FILE *F, dbg_info *dbg)
1290 if (__dbg_info_snprint) {
1292 if (__dbg_info_snprint(buf, sizeof(buf), dbg) > 0)
1293 fprintf (F, " info3: \"%s\"\n", buf);
1300 static void dump_node(FILE *F, ir_node *n)
1305 if (get_opt_dump_const_local() && is_constlike_node(n))
1308 /* dump this node */
1309 fprintf(F, "node: {title: \""); PRINT_NODEID(n); fprintf(F, "\" label: \"");
1311 bad = ! irn_vrfy_irg_dump(n, current_ir_graph, &p);
1312 bad |= dump_node_label(F, n);
1313 dump_node_ana_vals(F, n);
1314 //dump_node_ana_info(F, n);
1316 bad |= dump_node_info(F, n);
1317 print_node_error(F, p);
1318 print_dbg_info(F, get_irn_dbg_info(n));
1319 dump_node_vcgattr(F, n, NULL, bad);
1321 dump_const_node_local(F, n);
1323 if(dump_node_edge_hook)
1324 dump_node_edge_hook(F, n);
1326 dump_irn_chi_term(F, n);
1327 dump_irn_state(F, n);
1331 /** dump the edge to the block this node belongs to */
1333 dump_ir_block_edge(FILE *F, ir_node *n) {
1334 if (get_opt_dump_const_local() && is_constlike_node(n)) return;
1335 if (is_no_Block(n)) {
1336 ir_node *block = get_nodes_block(n);
1338 if (get_opt_dump_const_local() && is_constlike_node(block)) {
1339 dump_const_block_local(F, n);
1342 fprintf (F, "edge: { sourcename: \"");
1344 fprintf (F, "\" targetname: ");
1345 fprintf(F, "\""); PRINT_NODEID(block); fprintf(F, "\"");
1347 if (dump_edge_vcgattr_hook) {
1349 if (dump_edge_vcgattr_hook(F, n, -1)) {
1354 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1359 fprintf (F, " " BLOCK_EDGE_ATTR "}\n");
1365 print_data_edge_vcgattr(FILE *F, ir_node *from, int to) {
1367 * do not use get_nodes_block() here, will fail
1368 * if the irg is not pinned.
1370 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1371 fprintf (F, INTRA_DATA_EDGE_ATTR);
1373 fprintf (F, INTER_DATA_EDGE_ATTR);
1377 print_mem_edge_vcgattr(FILE *F, ir_node *from, int to) {
1379 * do not use get_nodes_block() here, will fail
1380 * if the irg is not pinned.
1382 if (get_irn_n(from, -1) == get_irn_n(get_irn_n(from, to), -1))
1383 fprintf (F, INTRA_MEM_EDGE_ATTR);
1385 fprintf (F, INTER_MEM_EDGE_ATTR);
1389 print_edge_vcgattr(FILE *F, ir_node *from, int to) {
1392 if (dump_edge_vcgattr_hook)
1393 if (dump_edge_vcgattr_hook(F, from, to))
1396 if (dump_backedge_information_flag && is_backedge(from, to))
1397 fprintf (F, BACK_EDGE_ATTR);
1399 switch (get_irn_opcode(from)) {
1401 fprintf (F, CF_EDGE_ATTR);
1403 case iro_Start: break;
1406 if (get_irn_mode(get_End_keepalive(from, to)) == mode_BB)
1407 fprintf (F, CF_EDGE_ATTR);
1408 if (get_irn_mode(get_End_keepalive(from, to)) == mode_X)
1409 fprintf (F, INTER_MEM_EDGE_ATTR);
1413 if (is_Proj(from)) {
1414 if (get_irn_mode(from) == mode_M)
1415 print_mem_edge_vcgattr(F, from, to);
1416 else if (get_irn_mode(from) == mode_X)
1417 fprintf(F, CF_EDGE_ATTR);
1419 print_data_edge_vcgattr(F, from, to);
1421 else if (get_irn_mode(get_irn_n(from, to)) == mode_M)
1422 print_mem_edge_vcgattr(F, from, to);
1423 else if (get_irn_mode(get_irn_n(from, to)) == mode_X)
1424 fprintf (F, CF_EDGE_ATTR);
1426 print_data_edge_vcgattr(F, from, to);
1430 /* dump edges to our inputs */
1432 dump_ir_data_edges(FILE *F, ir_node *n) {
1434 unsigned long visited = get_irn_visited(n);
1436 if ((get_irn_op(n) == op_End) && (!dump_keepalive))
1439 for (i = 0; i < get_irn_arity(n); i++) {
1440 ir_node * pred = get_irn_n(n, i);
1443 if ((get_interprocedural_view() && get_irn_visited(pred) < visited))
1444 continue; /* pred not dumped */
1446 if (dump_backedge_information_flag && is_backedge(n, i))
1447 fprintf (F, "backedge: {sourcename: \"");
1449 fprintf (F, "edge: {sourcename: \"");
1451 fprintf (F, "\" targetname: ");
1452 if ((get_opt_dump_const_local()) && is_constlike_node(pred)) {
1453 PRINT_CONSTID(n, pred);
1455 fprintf(F, "\""); PRINT_NODEID(pred); fprintf(F, "\"");
1457 fprintf (F, " label: \"%d\" ", i);
1458 print_edge_vcgattr(F, n, i);
1463 /** Dumps a node and its edges but not the block edge
1466 dump_node_wo_blockedge (ir_node *n, void *env) {
1469 dump_ir_data_edges(F, n);
1472 /** Dumps a node and its edges.
1475 dump_whole_node (ir_node *n, void *env) {
1477 dump_node_wo_blockedge(n, env);
1478 if (!node_floats(n)) dump_ir_block_edge(F, n);
1482 dump_const_node(ir_node *n, void *env) {
1483 if (is_Block(n)) return;
1484 dump_node_wo_blockedge(n, env);
1487 /***********************************************************************/
1488 /* the following routines dump the nodes/irgs bracketed to graphs. */
1489 /***********************************************************************/
1491 /** Dumps a constant expression as entity initializer, array bound ...
1493 static void dump_const_expression(FILE *F, ir_node *value) {
1494 ir_graph *rem = current_ir_graph;
1495 int rem_dump_const_local = dump_const_local;
1496 dump_const_local = 0;
1497 current_ir_graph = get_const_code_irg();
1498 irg_walk(value, dump_const_node, NULL, F);
1499 /* Decrease visited flag so that we walk with the same flag for the next
1500 expression. This guarantees that we don't dump the same node twice,
1501 as for const expressions cse is performed to save memory. */
1502 set_irg_visited(current_ir_graph, get_irg_visited(current_ir_graph) -1);
1503 current_ir_graph = rem;
1504 dump_const_local = rem_dump_const_local;
1507 /** Dump a block as graph containing its nodes.
1509 * Expects to find nodes belonging to the block as list in its
1511 * Dumps the edges of all nodes including itself. */
1513 dump_whole_block(FILE *F, ir_node *block) {
1515 dumper_colors color = ird_color_yellow;
1517 assert(is_Block(block));
1519 fprintf(F, "graph: { title: \"");
1520 PRINT_NODEID(block);
1521 fprintf(F, "\" label: \"");
1522 dump_node_label(F, block);
1524 if (get_opt_dump_abstvals())
1525 fprintf (F, " seqno: %d", (int)get_Block_seqno(block));
1528 /* colorize blocks */
1529 if (! get_Block_matured(block))
1530 color = ird_color_red;
1531 if (is_Block_dead(block))
1532 color = ird_color_orange;
1534 fprintf(F, "\" status:clustered ");
1535 print_vcg_color(F, color);
1538 /* yComp can show attributes for blocks, XVCG parses but ignores them */
1539 dump_node_info(F, block);
1540 print_dbg_info(F, get_irn_dbg_info(block));
1542 /* dump the blocks edges */
1543 dump_ir_data_edges(F, block);
1545 if (dump_block_edge_hook)
1546 dump_block_edge_hook(F, block);
1548 /* dump the nodes that go into the block */
1549 for (node = ird_get_irn_link(block); node; node = ird_get_irn_link(node)) {
1551 dump_ir_data_edges(F, node);
1554 /* Close the vcg information for the block */
1556 dump_const_node_local(F, block);
1558 dump_irn_chi_term(F, block);
1563 /** dumps a graph block-wise. Expects all blockless nodes in arr in irgs link.
1564 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1566 dump_block_graph(FILE *F, ir_graph *irg) {
1568 ir_graph *rem = current_ir_graph;
1569 ir_node **arr = ird_get_irg_link(irg);
1570 current_ir_graph = irg;
1572 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1573 ir_node * node = arr[i];
1574 if (is_Block(node)) {
1575 /* Dumps the block and all the nodes in the block, which are to
1576 be found in Block->link. */
1577 dump_whole_block(F, node);
1579 /* Nodes that are not in a Block. */
1581 if (!node_floats(node) && is_Bad(get_nodes_block(node))) {
1582 dump_const_block_local(F, node);
1584 dump_ir_data_edges(F, node);
1588 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1589 dump_loop_nodes_into_graph(F, irg);
1591 current_ir_graph = rem;
1595 * Dump the info for an irg.
1596 * Parsed by XVCG but not shown. use yComp.
1598 static void dump_graph_info(FILE *F, ir_graph *irg) {
1599 fprintf(F, "info1: \"");
1600 dump_entity_to_file(F, get_irg_entity(irg), dump_verbosity_entattrs | dump_verbosity_entconsts);
1604 /** Dumps an irg as a graph clustered by block nodes.
1605 * If interprocedural view edges can point to nodes out of this graph.
1607 static void dump_graph_from_list(FILE *F, ir_graph *irg) {
1608 entity *ent = get_irg_entity(irg);
1610 fprintf(F, "graph: { title: \"");
1612 fprintf(F, "\" label: \"%s\" status:clustered color:white \n",
1613 get_ent_dump_name(ent));
1615 dump_graph_info(F, irg);
1616 print_dbg_info(F, get_entity_dbg_info(ent));
1618 dump_block_graph(F, irg);
1620 /* Close the vcg information for the irg */
1621 fprintf(F, "}\n\n");
1624 /** dumps a graph extended block-wise. Expects all blockless nodes in arr in irgs link.
1625 * The outermost nodes: blocks and nodes not op_pin_state_pinned, Bad, Unknown. */
1627 dump_extblock_graph(FILE *F, ir_graph *irg) {
1629 ir_graph *rem = current_ir_graph;
1630 ir_extblk **arr = ird_get_irg_link(irg);
1631 current_ir_graph = irg;
1633 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
1634 ir_extblk *extbb = arr[i];
1635 ir_node *leader = get_extbb_leader(extbb);
1638 fprintf(F, "graph: { title: \"");
1639 PRINT_EXTBBID(leader);
1640 fprintf(F, "\" label: \"ExtBB %ld\" status:clustered color:lightgreen\n",
1641 get_irn_node_nr(leader));
1643 for (j = ARR_LEN(extbb->blks) - 1; j >= 0; --j) {
1644 ir_node * node = extbb->blks[j];
1645 if (is_Block(node)) {
1646 /* Dumps the block and all the nodes in the block, which are to
1647 be found in Block->link. */
1648 dump_whole_block(F, node);
1650 /* Nodes that are not in a Block. */
1652 if (is_Bad(get_nodes_block(node)) && !node_floats(node)) {
1653 dump_const_block_local(F, node);
1655 dump_ir_data_edges(F, node);
1661 if (dump_loop_information_flag && (get_irg_loopinfo_state(irg) & loopinfo_valid))
1662 dump_loop_nodes_into_graph(F, irg);
1664 current_ir_graph = rem;
1669 /*******************************************************************/
1670 /* Basic type and entity nodes and edges. */
1671 /*******************************************************************/
1673 /** dumps the edges between nodes and their type or entity attributes. */
1674 static void dump_node2type_edges(ir_node *n, void *env)
1679 switch (get_irn_opcode(n)) {
1681 /* @@@ some consts have an entity */
1684 if (SYMCONST_HAS_TYPE(get_SymConst_kind(n)))
1685 print_node_type_edge(F,n,get_SymConst_type(n),NODE2TYPE_EDGE_ATTR);
1688 print_node_ent_edge(F,n,get_Sel_entity(n),NODE2TYPE_EDGE_ATTR);
1691 print_node_type_edge(F,n,get_Call_type(n),NODE2TYPE_EDGE_ATTR);
1694 print_node_type_edge(F,n,get_Alloc_type(n),NODE2TYPE_EDGE_ATTR);
1697 print_node_type_edge(F,n,get_Free_type(n),NODE2TYPE_EDGE_ATTR);
1700 print_node_type_edge(F,n,get_Cast_type(n),NODE2TYPE_EDGE_ATTR);
1708 static int print_type_info(FILE *F, ir_type *tp) {
1711 if (get_type_state(tp) == layout_undefined) {
1712 fprintf(F, "state: layout_undefined\n");
1714 fprintf(F, "state: layout_fixed,\n");
1716 if (get_type_mode(tp))
1717 fprintf(F, "mode: %s,\n", get_mode_name_ex(get_type_mode(tp), &bad));
1718 fprintf(F, "size: %db,\n", get_type_size_bits(tp));
1723 static void print_typespecific_info(FILE *F, ir_type *tp) {
1724 switch (get_type_tpop_code(tp)) {
1727 fprintf(F, "peculiarity: %s\n", get_peculiarity_string(get_class_peculiarity(tp)));
1734 fprintf(F, "variadicity: %s\n", get_variadicity_name(get_method_variadicity(tp)));
1735 fprintf(F, "params: %d\n", get_method_n_params(tp));
1736 fprintf(F, "results: %d\n", get_method_n_ress(tp));
1744 case tpo_enumeration:
1758 static void print_typespecific_vcgattr(FILE *F, ir_type *tp) {
1759 switch (get_type_tpop_code(tp)) {
1762 if (peculiarity_existent == get_class_peculiarity(tp))
1763 fprintf (F, " " TYPE_CLASS_NODE_ATTR);
1765 fprintf (F, " " TYPE_DESCRIPTION_NODE_ATTR);
1769 fprintf (F, " " TYPE_METH_NODE_ATTR);
1780 case tpo_enumeration:
1794 int dump_type_node(FILE *F, ir_type *tp)
1798 fprintf (F, "node: {title: ");
1800 fprintf (F, " label: \"%s %s\"", get_type_tpop_name(tp), get_type_name_ex(tp, &bad));
1801 fprintf (F, " info1: \"");
1803 bad |= print_type_info(F, tp);
1804 print_typespecific_info(F, tp);
1806 dump_type_to_file(F, tp, dump_verbosity_max);
1808 fprintf (F, "\"\n");
1809 print_dbg_info(F, get_type_dbg_info(tp));
1810 print_typespecific_vcgattr(F, tp);
1817 #define X(a) case a: fprintf(F, #a); break
1818 void dump_entity_node(FILE *F, entity *ent, int color)
1820 fprintf (F, "node: {title: \"");
1821 PRINT_ENTID(ent); fprintf(F, "\"");
1822 fprintf (F, DEFAULT_TYPE_ATTRIBUTE);
1823 fprintf (F, "label: ");
1824 fprintf (F, "\"ent %s\" ", get_ent_dump_name(ent));
1826 fprintf(F, "color:%d", color);
1828 fprintf (F, ENTITY_NODE_ATTR);
1829 fprintf (F, "\n info1: \"");
1831 dump_entity_to_file(F, ent, dump_verbosity_entattrs | dump_verbosity_entconsts);
1834 print_dbg_info(F, get_entity_dbg_info(ent));
1839 static void dump_enum_item(FILE *F, ir_type *tp, int pos)
1842 ident *id = get_enumeration_nameid(tp, pos);
1843 tarval *tv = get_enumeration_enum(tp, pos);
1845 tarval_snprintf(buf, sizeof(buf), tv);
1846 fprintf (F, "node: {title: \"");
1847 PRINT_ITEMID(tp, pos); fprintf(F, "\"");
1848 fprintf (F, DEFAULT_ENUM_ITEM_ATTRIBUTE);
1849 fprintf (F, "label: ");
1850 fprintf (F, "\"enum item %s\" " ENUM_ITEM_NODE_ATTR, get_id_str(id));
1851 fprintf (F, "\n info1: \"value: %s\"}\n", buf);
1854 /* dumps a type or entity and it's edges. */
1856 dump_type_info(type_or_ent *tore, void *env) {
1858 int i = 0; /* to shutup gcc */
1860 /* dump this type or entity */
1862 switch (get_kind(tore)) {
1865 entity *ent = (entity *)tore;
1868 dump_entity_node(F, ent, 0);
1870 /* skip this to reduce graph. Member edge of type is parallel to this edge. *
1871 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1872 ENT_OWN_EDGE_ATTR "}\n", ent, get_entity_owner(ent));*/
1873 print_ent_type_edge(F,ent, get_entity_type(ent), ENT_TYPE_EDGE_ATTR);
1874 if (is_Class_type(get_entity_owner(ent))) {
1875 for(i = 0; i < get_entity_n_overwrites(ent); i++)
1876 print_ent_ent_edge(F,ent, get_entity_overwrites(ent, i), 0, ENT_OVERWRITES_EDGE_ATTR);
1878 /* attached subgraphs */
1879 if (const_entities && (get_entity_variability(ent) != variability_uninitialized)) {
1880 if (is_atomic_entity(ent)) {
1881 value = get_atomic_ent_value(ent);
1883 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1884 /* DDMN(value); $$$ */
1885 dump_const_expression(F, value);
1888 if (is_compound_entity(ent)) {
1889 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
1890 value = get_compound_ent_value(ent, i);
1892 print_ent_node_edge(F, ent, value, ENT_VALUE_EDGE_ATTR, i);
1893 dump_const_expression(F, value);
1894 print_ent_ent_edge(F, ent, get_compound_ent_value_member(ent, i), 0, ENT_CORR_EDGE_ATTR, i);
1896 fprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
1897 ENT_CORR_EDGE_ATTR "}\n", GET_ENTID(ent),
1898 get_compound_ent_value_member(ent, i), i);
1907 ir_type *tp = (ir_type *)tore;
1908 dump_type_node(F, tp);
1909 /* and now the edges */
1910 switch (get_type_tpop_code(tp)) {
1913 for (i=0; i < get_class_n_supertypes(tp); i++)
1914 print_type_type_edge(F, tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
1915 for (i=0; i < get_class_n_members(tp); i++)
1916 print_type_ent_edge(F,tp,get_class_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1920 for (i=0; i < get_struct_n_members(tp); i++)
1921 print_type_ent_edge(F,tp,get_struct_member(tp, i),TYPE_MEMBER_EDGE_ATTR);
1925 for (i = 0; i < get_method_n_params(tp); i++)
1926 print_type_type_edge(F,tp,get_method_param_type(tp, i),METH_PAR_EDGE_ATTR,i);
1927 for (i = 0; i < get_method_n_ress(tp); i++)
1928 print_type_type_edge(F,tp,get_method_res_type(tp, i),METH_RES_EDGE_ATTR,i);
1932 for (i = 0; i < get_union_n_members(tp); i++)
1933 print_type_ent_edge(F,tp,get_union_member(tp, i),UNION_EDGE_ATTR);
1937 print_type_type_edge(F,tp,get_array_element_type(tp),ARR_ELT_TYPE_EDGE_ATTR);
1938 print_type_ent_edge(F,tp,get_array_element_entity(tp),ARR_ENT_EDGE_ATTR);
1939 for (i = 0; i < get_array_n_dimensions(tp); i++) {
1940 ir_node *upper = get_array_upper_bound(tp, i);
1941 ir_node *lower = get_array_lower_bound(tp, i);
1942 print_node_type_edge(F, upper, tp, "label: \"upper %d\"", get_array_order(tp, i));
1943 print_node_type_edge(F, lower, tp, "label: \"lower %d\"", get_array_order(tp, i));
1944 dump_const_expression(F, upper);
1945 dump_const_expression(F, lower);
1949 case tpo_enumeration:
1951 for (i = 0; i < get_enumeration_n_enums(tp); ++i) {
1952 dump_enum_item(F, tp, i);
1953 print_enum_item_edge(F, tp, i, "label: \"item %d\"", i);
1958 print_type_type_edge(F,tp,get_pointer_points_to_type(tp), PTR_PTS_TO_EDGE_ATTR);
1966 break; /* case k_type */
1969 printf(" *** irdump, dump_type_info(l.%i), faulty type.\n", __LINE__);
1971 } /* switch kind_or_entity */
1974 typedef struct _h_env {
1979 /** For dumping class hierarchies.
1980 * Dumps a class type node and a superclass edge.
1981 * If env->dump_ent dumps entities of classes and overwrites edges.
1984 dump_class_hierarchy_node (type_or_ent *tore, void *ctx) {
1987 int i = 0; /* to shutup gcc */
1989 /* dump this type or entity */
1990 switch (get_kind(tore)) {
1992 entity *ent = (entity *)tore;
1993 if (get_entity_owner(ent) == get_glob_type()) break;
1994 if (!is_Method_type(get_entity_type(ent))) break; /* GL */
1995 if (env->dump_ent && is_Class_type(get_entity_owner(ent))) {
1997 dump_entity_node(F, ent, 0);
1999 print_type_ent_edge(F,get_entity_owner(ent),ent,TYPE_MEMBER_EDGE_ATTR);
2000 for(i = 0; i < get_entity_n_overwrites(ent); i++)
2001 print_ent_ent_edge(F, get_entity_overwrites(ent, i), ent, 0, ENT_OVERWRITES_EDGE_ATTR);
2003 } break; /* case k_entity */
2006 ir_type *tp = (ir_type *)tore;
2007 if (tp == get_glob_type()) break;
2008 switch (get_type_tpop_code(tp)) {
2010 dump_type_node(F, tp);
2011 /* and now the edges */
2012 for (i=0; i < get_class_n_supertypes(tp); i++)
2014 print_type_type_edge(F,tp,get_class_supertype(tp, i),TYPE_SUPER_EDGE_ATTR);
2020 break; /* case k_type */
2023 printf(" *** irdump, dump_class_hierarchy_node(l.%i), faulty type.\n", __LINE__);
2025 } /* switch kind_or_entity */
2028 /*******************************************************************/
2029 /* dump analysis information that is expressed in graph terms. */
2030 /*******************************************************************/
2032 /* dump out edges */
2034 dump_out_edge(ir_node *n, void *env) {
2037 for (i = 0; i < get_irn_n_outs(n); i++) {
2038 assert(get_irn_out(n, i));
2039 fprintf (F, "edge: {sourcename: \"");
2041 fprintf (F, "\" targetname: \"");
2042 PRINT_NODEID(get_irn_out(n, i));
2043 fprintf (F, "\" color: red linestyle: dashed");
2049 dump_loop_label(FILE *F, ir_loop *loop) {
2050 fprintf (F, "loop %d, %d sons, %d nodes",
2051 get_loop_depth(loop), get_loop_n_sons(loop), get_loop_n_nodes(loop));
2054 static INLINE void dump_loop_info(FILE *F, ir_loop *loop) {
2055 fprintf (F, " info1: \"");
2056 fprintf (F, " loop nr: %d", get_loop_loop_nr(loop));
2057 #if DEBUG_libfirm /* GL @@@ debug analyses */
2058 fprintf (F, "\n The loop was analyzed %d times.", PTR_TO_INT(get_loop_link(loop)));
2064 dump_loop_node(FILE *F, ir_loop *loop) {
2065 fprintf (F, "node: {title: \"");
2067 fprintf (F, "\" label: \"");
2068 dump_loop_label(F, loop);
2070 dump_loop_info(F, loop);
2076 dump_loop_node_edge(FILE *F, ir_loop *loop, int i) {
2078 fprintf (F, "edge: {sourcename: \"");
2080 fprintf (F, "\" targetname: \"");
2081 PRINT_NODEID(get_loop_node(loop, i));
2082 fprintf (F, "\" color: green");
2087 dump_loop_son_edge(FILE *F, ir_loop *loop, int i) {
2089 fprintf (F, "edge: {sourcename: \"");
2091 fprintf (F, "\" targetname: \"");
2092 PRINT_LOOPID(get_loop_son(loop, i));
2093 fprintf (F, "\" color: darkgreen label: \"%d\"}\n",
2094 get_loop_element_pos(loop, get_loop_son(loop, i)));
2098 void dump_loops(FILE *F, ir_loop *loop) {
2100 /* dump this loop node */
2101 dump_loop_node(F, loop);
2103 /* dump edges to nodes in loop -- only if it is a real loop */
2104 if (get_loop_depth(loop) != 0) {
2105 for (i = 0; i < get_loop_n_nodes(loop); i++) {
2106 dump_loop_node_edge(F, loop, i);
2109 for (i = 0; i < get_loop_n_sons(loop); i++) {
2110 dump_loops(F, get_loop_son(loop, i));
2111 dump_loop_son_edge(F, loop, i);
2116 void dump_loop_nodes_into_graph(FILE *F, ir_graph *irg) {
2117 ir_graph *rem = current_ir_graph;
2118 current_ir_graph = irg;
2120 if (get_irg_loop(irg)) dump_loops(F, get_irg_loop(irg));
2122 current_ir_graph = rem;
2127 * dumps the VCG header
2129 void dump_vcg_header(FILE *F, const char *name, const char *orientation) {
2138 if (!orientation) orientation = "bottom_to_top";
2142 "graph: { title: \"ir graph of %s\"\n"
2143 "display_edge_labels: %s\n"
2144 "layoutalgorithm: mindepth\n"
2145 "manhattan_edges: yes\n"
2146 "port_sharing: no\n"
2148 "classname 1: \"intrablock Data\"\n"
2149 "classname 2: \"Block\"\n"
2150 "classname 3: \"Entity type\"\n"
2151 "classname 4: \"Entity owner\"\n"
2152 "classname 5: \"Method Param\"\n"
2153 "classname 6: \"Method Res\"\n"
2154 "classname 7: \"Super\"\n"
2155 "classname 8: \"Union\"\n"
2156 "classname 9: \"Points-to\"\n"
2157 "classname 10: \"Array Element Type\"\n"
2158 "classname 11: \"Overwrites\"\n"
2159 "classname 12: \"Member\"\n"
2160 "classname 13: \"Control Flow\"\n"
2161 "classname 14: \"intrablock Memory\"\n"
2162 "classname 15: \"Dominators\"\n"
2163 "classname 16: \"interblock Data\"\n"
2164 "classname 17: \"interblock Memory\"\n"
2165 "classname 18: \"Exception Control Flow for Interval Analysis\"\n"
2166 "classname 19: \"Postdominators\"\n"
2167 "infoname 1: \"Attribute\"\n"
2168 "infoname 2: \"Verification errors\"\n"
2169 "infoname 3: \"Debug info\"\n",
2170 name, label, orientation);
2172 /* don't use all, the range is too whith/black. */
2176 "colorentry 100: 0 0 0\n"
2177 "colorentry 101: 20 0 0\n"
2178 "colorentry 102: 40 0 0\n"
2179 "colorentry 103: 60 0 0\n"
2180 "colorentry 104: 80 0 0\n"
2181 "colorentry 105: 100 0 0\n"
2182 "colorentry 106: 120 0 0\n"
2183 "colorentry 107: 140 0 0\n"
2184 "colorentry 108: 150 0 0\n"
2185 "colorentry 109: 180 0 0\n"
2186 "colorentry 110: 200 0 0\n"
2187 "colorentry 111: 220 0 0\n"
2188 "colorentry 112: 240 0 0\n"
2189 "colorentry 113: 255 0 0\n"
2190 "colorentry 113: 255 20 20\n"
2191 "colorentry 114: 255 40 40\n"
2192 "colorentry 115: 255 60 60\n"
2193 "colorentry 116: 255 80 80\n"
2194 "colorentry 117: 255 100 100\n"
2195 "colorentry 118: 255 120 120\n"
2196 "colorentry 119: 255 140 140\n"
2197 "colorentry 120: 255 150 150\n"
2198 "colorentry 121: 255 180 180\n"
2199 "colorentry 122: 255 200 200\n"
2200 "colorentry 123: 255 220 220\n"
2201 "colorentry 124: 255 240 240\n"
2202 "colorentry 125: 255 250 250\n"
2205 fprintf (F, "\n"); /* a separator */
2211 * @param irg The graph to be dumped
2212 * @param suffix1 first filename suffix
2213 * @param suffix2 second filename suffix
2215 FILE *vcg_open (ir_graph *irg, const char * suffix1, const char *suffix2) {
2217 const char *nm = get_irg_dump_name(irg);
2218 int len = strlen(nm), i, j;
2219 char *fname; /* filename to put the vcg information in */
2221 if (!suffix1) suffix1 = "";
2222 if (!suffix2) suffix2 = "";
2224 /* open file for vcg graph */
2225 fname = xmalloc (len * 2 + strlen(suffix1) + strlen(suffix2) + 5);
2227 /* strncpy (fname, nm, len); */ /* copy the filename */
2229 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2231 fname[j] = '@'; j++; fname[j] = '1'; j++;
2232 } else if (nm[i] == '@') {
2233 fname[j] = '@'; j++; fname[j] = '2'; j++;
2235 fname[j] = nm[i]; j++;
2239 strcat (fname, suffix1); /* append file suffix */
2240 strcat (fname, suffix2); /* append file suffix */
2241 strcat (fname, ".vcg"); /* append the .vcg suffix */
2243 /* vcg really expect only a <CR> at end of line, so
2244 * the "b"inary mode is what you mean (and even needed for Win32)
2246 F = fopen (fname, "wb"); /* open file for writing */
2248 panic("cannot open %s for writing (%m)", fname); /* not reached */
2258 * @param name prefix file name
2259 * @param suffix filename suffix
2261 FILE *vcg_open_name (const char *name, const char *suffix) {
2263 char *fname; /* filename to put the vcg information in */
2264 int i, j, len = strlen(name);
2266 if (!suffix) suffix = "";
2268 /** open file for vcg graph */
2269 fname = xmalloc(len * 2 + 5 + strlen(suffix));
2270 /* strcpy (fname, name);*/ /* copy the filename */
2272 for (i = 0; i < len; ++i) { /* replace '/' in the name: escape by @. */
2273 if (name[i] == '/') {
2274 fname[j] = '@'; j++; fname[j] = '1'; j++;
2275 } else if (name[i] == '@') {
2276 fname[j] = '@'; j++; fname[j] = '2'; j++;
2278 fname[j] = name[i]; j++;
2282 strcat (fname, suffix);
2283 strcat (fname, ".vcg"); /* append the .vcg suffix */
2285 /* vcg really expect only a <CR> at end of line, so
2286 * the "b"inary mode is what you mean (and even needed for Win32)
2288 F = fopen (fname, "wb"); /* open file for writing */
2290 panic ("cannot open %s for writing (%m)", fname); /* not reached */
2298 * Dumps the vcg file footer
2300 static INLINE void dump_vcg_footer (FILE *F) {
2305 * close the vcg file
2307 void vcg_close (FILE *F) {
2308 dump_vcg_footer(F); /* print footer */
2309 fclose (F); /* close vcg file */
2312 /************************************************************************/
2313 /************************************************************************/
2314 /* Routines that dump all or parts of the firm representation to a file */
2315 /************************************************************************/
2316 /************************************************************************/
2318 /************************************************************************/
2319 /* Dump ir graphs, different formats and additional information. */
2320 /************************************************************************/
2322 /** Routine to dump a graph, blocks as conventional nodes. */
2324 dump_ir_graph (ir_graph *irg, const char *suffix )
2329 rem = current_ir_graph;
2331 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2333 current_ir_graph = irg;
2334 if (get_interprocedural_view()) suffix1 = "-pure-ip";
2335 else suffix1 = "-pure";
2336 f = vcg_open(irg, suffix, suffix1);
2337 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2339 /* call the dump graph hook */
2340 if (dump_ir_graph_hook)
2341 if (dump_ir_graph_hook(f, irg))
2344 /* walk over the graph */
2345 /* dump_whole_node must be called in post visiting predecessors */
2346 ird_walk_graph(irg, NULL, dump_whole_node, f);
2348 /* dump the out edges in a separate walk */
2349 if ((dump_out_edge_flag) && (get_irg_outs_state(irg) != outs_none)) {
2350 irg_out_walk(get_irg_start(irg), dump_out_edge, NULL, f);
2355 current_ir_graph = rem;
2358 /* Dump a firm graph without explicit block nodes. */
2359 void dump_ir_block_graph (ir_graph *irg, const char *suffix)
2365 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2368 if (get_interprocedural_view()) suffix1 = "-ip";
2370 f = vcg_open(irg, suffix, suffix1);
2371 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2373 construct_block_lists(irg);
2376 * If we are in the interprocedural view, we dump not
2377 * only the requested irg but also all irgs that can be reached
2380 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2381 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2383 dump_graph_from_list(f, get_irp_irg(i));
2391 /* Dump a firm graph without explicit block nodes but grouped in extended blocks. */
2392 void dump_ir_extblock_graph (ir_graph *irg, const char *suffix)
2399 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2402 if (get_irg_extblk_state(irg) != extblk_valid)
2405 if (get_interprocedural_view()) suffix1 = "-ip";
2408 ent = get_irg_entity(irg);
2410 F = vcg_open(irg, suffix, suffix1);
2411 dump_vcg_header(F, get_irg_dump_name(irg), NULL);
2413 construct_extblock_lists(irg);
2415 fprintf(F, "graph: { title: \"");
2417 fprintf(F, "\" label: \"%s\" status:clustered color: white \n",
2418 get_ent_dump_name(ent));
2420 dump_graph_info(F, irg);
2421 print_dbg_info(F, get_entity_dbg_info(ent));
2423 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2424 ir_graph *irg = get_irp_irg(i);
2425 list_tuple *lists = ird_get_irg_link(irg);
2428 /* dump the extended blocks first */
2429 if (ARR_LEN(lists->extbb_list)) {
2430 ird_set_irg_link(irg, lists->extbb_list);
2431 dump_extblock_graph(F, irg);
2434 /* we may have blocks without extended blocks, bad for instance */
2435 if (ARR_LEN(lists->blk_list)) {
2436 ird_set_irg_link(irg, lists->blk_list);
2437 dump_block_graph(F, irg);
2440 DEL_ARR_F(lists->extbb_list);
2441 DEL_ARR_F(lists->blk_list);
2446 /* Close the vcg information for the irg */
2447 fprintf(F, "}\n\n");
2453 /* dumps a graph with type information */
2455 dump_ir_graph_w_types (ir_graph *irg, const char *suffix)
2458 ir_graph *rem = current_ir_graph;
2460 int rem_dump_const_local;
2462 /* if a filter is set, dump only the irg's that match the filter */
2463 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2466 current_ir_graph = irg;
2467 rem_dump_const_local = dump_const_local;
2468 /* dumping types does not work with local nodes */
2469 dump_const_local = 0;
2471 if (get_interprocedural_view()) suffix1 = "-pure-wtypes-ip";
2472 else suffix1 = "-pure-wtypes";
2473 f = vcg_open(irg,suffix, suffix1);
2474 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2476 /* dump common ir graph */
2477 irg_walk(get_irg_end(irg), NULL, dump_whole_node, f);
2478 /* dump type info */
2479 type_walk_irg(irg, dump_type_info, NULL, f);
2480 inc_irg_visited(get_const_code_irg());
2481 /* dump edges from graph to type info */
2482 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2485 dump_const_local = rem_dump_const_local;
2486 current_ir_graph = rem;
2490 dump_ir_block_graph_w_types (ir_graph *irg, const char *suffix)
2495 ir_graph *rem = current_ir_graph;
2496 int rem_dump_const_local;
2498 /* if a filter is set, dump only the irg's that match the filter */
2499 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2502 rem_dump_const_local = dump_const_local;
2503 /* dumping types does not work with local nodes */
2504 dump_const_local = 0;
2506 if (get_interprocedural_view()) suffix1 = "-wtypes-ip";
2507 else suffix1 = "-wtypes";
2508 f = vcg_open(irg, suffix, suffix1);
2509 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2511 /* dump common blocked ir graph */
2512 construct_block_lists(irg);
2514 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2515 ir_node **arr = ird_get_irg_link(get_irp_irg(i));
2517 dump_graph_from_list(f, get_irp_irg(i));
2522 /* dump type info */
2523 current_ir_graph = irg;
2524 type_walk_irg(irg, dump_type_info, NULL, f);
2525 inc_irg_visited(get_const_code_irg());
2527 /* dump edges from graph to type info */
2528 irg_walk(get_irg_end(irg), dump_node2type_edges, NULL, f);
2531 dump_const_local = rem_dump_const_local;
2532 current_ir_graph = rem;
2535 /*---------------------------------------------------------------------*/
2536 /* The following routines dump a control flow graph. */
2537 /*---------------------------------------------------------------------*/
2540 dump_block_to_cfg(ir_node *block, void *env) {
2545 if (is_Block(block)) {
2546 /* This is a block. Dump a node for the block. */
2547 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
2548 fprintf (F, "\" label: \"");
2549 if (block == get_irg_start_block(get_irn_irg(block)))
2550 fprintf(F, "Start ");
2551 if (block == get_irg_end_block(get_irn_irg(block)))
2554 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
2555 PRINT_NODEID(block);
2557 fprintf(F, "info1:\"");
2559 /* the generic version. */
2560 dump_irnode_to_file(F, block);
2562 /* Check whether we have bad predecessors to color the block. */
2563 for (i = 0; i < get_Block_n_cfgpreds(block); ++i)
2564 if ((fl = is_Bad(get_Block_cfgpred(block, i))))
2567 fprintf (F, "\""); /* closing quote of info */
2569 if ((block == get_irg_start_block(get_irn_irg(block))) ||
2570 (block == get_irg_end_block(get_irn_irg(block))) )
2571 fprintf(F, " color:blue ");
2573 fprintf(F, " color:yellow ");
2576 /* Dump the edges */
2577 for ( i = 0; i < get_Block_n_cfgpreds(block); i++)
2578 if (get_irn_op(skip_Proj(get_Block_cfgpred(block, i))) != op_Bad) {
2579 pred = get_nodes_block(skip_Proj(get_Block_cfgpred(block, i)));
2580 fprintf (F, "edge: { sourcename: \"");
2581 PRINT_NODEID(block);
2582 fprintf (F, "\" targetname: \"");
2584 fprintf (F, "\"}\n");
2587 /* Dump dominator/postdominator edge */
2588 if (dump_dominator_information_flag) {
2589 if (get_irg_dom_state(current_ir_graph) == dom_consistent && get_Block_idom(block)) {
2590 pred = get_Block_idom(block);
2591 fprintf (F, "edge: { sourcename: \"");
2592 PRINT_NODEID(block);
2593 fprintf (F, "\" targetname: \"");
2595 fprintf (F, "\" " DOMINATOR_EDGE_ATTR "}\n");
2597 if (get_irg_postdom_state(current_ir_graph) == dom_consistent && get_Block_ipostdom(block)) {
2598 pred = get_Block_ipostdom(block);
2599 fprintf (F, "edge: { sourcename: \"");
2600 PRINT_NODEID(block);
2601 fprintf (F, "\" targetname: \"");
2603 fprintf (F, "\" " POSTDOMINATOR_EDGE_ATTR "}\n");
2610 dump_cfg (ir_graph *irg, const char *suffix)
2613 ir_graph *rem = current_ir_graph;
2614 int ipv = get_interprocedural_view();
2616 /* if a filter is set, dump only the irg's that match the filter */
2617 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
2620 current_ir_graph = irg;
2622 f = vcg_open(irg, suffix, "-cfg");
2623 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2626 printf("Warning: dumping cfg not in interprocedural view!\n");
2627 set_interprocedural_view(0);
2630 /* walk over the blocks in the graph */
2631 irg_block_walk(get_irg_end(irg), dump_block_to_cfg, NULL, f);
2632 dump_node(f, get_irg_bad(irg));
2634 set_interprocedural_view(ipv);
2636 current_ir_graph = rem;
2640 static void descend_and_dump(FILE *F, ir_node *n, int depth, pset *mark_set) {
2641 if (pset_find_ptr(mark_set, n)) return;
2643 pset_insert_ptr(mark_set, n);
2646 int i, start = is_Block(n) ? 0 : -1;
2647 dump_whole_node(n, F);
2648 for (i = start; i < get_irn_arity(n); ++i)
2649 descend_and_dump(F, get_irn_n(n, i), depth-1, mark_set);
2652 /* Don't dump edges to nodes further out. These might be edges to
2653 nodes we already dumped, if there is a shorter path to these. */
2657 static int subgraph_counter = 0;
2658 void dump_subgraph (ir_node *root, int depth, const char *suffix) {
2661 pset *mark_set = pset_new_ptr(1);
2662 sprintf(buf, "-subg_%03d", subgraph_counter++);
2663 F = vcg_open(get_irn_irg(root), suffix, buf);
2664 dump_vcg_header(F, get_irg_dump_name(get_irn_irg(root)), NULL);
2665 descend_and_dump(F, root, depth, mark_set);
2671 static int weight_overall(int rec, int loop) {
2672 return 2*rec + loop;
2675 static int compute_color (int my, int max) {
2682 /* if small, scale to the full color range. */
2684 my = my * (n_colors/max);
2686 step = 1 + (max / n_colors);
2690 return base_color + n_colors - color;
2693 static int get_entity_color(entity *ent) {
2694 ir_graph *irg = get_entity_irg(ent);
2698 int rec_depth = get_irg_recursion_depth(irg);
2699 int loop_depth = get_irg_loop_depth(irg);
2700 int overall_depth = weight_overall(rec_depth, loop_depth);
2702 int max_rec_depth = irp->max_callgraph_recursion_depth;
2703 int max_loop_depth = irp->max_callgraph_loop_depth;
2704 int max_overall_depth = weight_overall(max_rec_depth, max_loop_depth);
2706 /* int my_rec_color = compute_color(rec_depth, max_rec_depth); */
2707 /* int my_loop_color = compute_color(loop_depth, max_loop_depth); */
2708 int my_overall_color = compute_color(overall_depth, max_overall_depth);;
2710 return my_overall_color;
2714 void dump_callgraph(const char *suffix) {
2717 int rem = edge_label;
2719 //ident *prefix = new_id_from_str("java/");
2721 F = vcg_open_name("Callgraph", suffix);
2722 dump_vcg_header(F, "Callgraph", NULL);
2724 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2725 ir_graph *irg = get_irp_irg(i);
2726 entity *ent = get_irg_entity(irg);
2727 int j, n_callees = get_irg_n_callees(irg);
2729 /* Do not dump runtime system. */
2730 //if (id_is_prefix(prefix, get_entity_ld_ident(ent))) continue;
2732 dump_entity_node(F, ent, get_entity_color(ent));
2733 for (j = 0; j < n_callees; ++j) {
2734 entity *c = get_irg_entity(get_irg_callee(irg, j));
2735 //if (id_is_prefix(prefix, get_entity_ld_ident(c))) continue;
2736 int be = is_irg_callee_backedge(irg, j);
2739 "label:\"recursion %d\" color:%d" :
2740 "label:\"calls %d\" color:%d";
2741 print_ent_ent_edge(F, ent, c, be, attr, get_irg_callee_loop_depth(irg, j), get_entity_color(ent));
2749 /* Dump all irgs in interprocedural view to a single file. */
2750 void dump_all_cg_block_graph(const char *suffix) {
2753 int rem_view = get_interprocedural_view();
2754 set_interprocedural_view(1);
2756 f = vcg_open_name("All_graphs", suffix);
2757 dump_vcg_header(f, "All_graphs", NULL);
2759 /* collect nodes in all irgs reachable in call graph*/
2760 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2761 ird_set_irg_link(get_irp_irg(i), NULL);
2763 cg_walk(clear_link, collect_node, NULL);
2765 /* dump all graphs */
2766 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2767 current_ir_graph = get_irp_irg(i);
2768 assert(ird_get_irg_link(current_ir_graph));
2769 dump_graph_from_list(f, current_ir_graph);
2770 DEL_ARR_F(ird_get_irg_link(current_ir_graph));
2774 set_interprocedural_view(rem_view);
2777 /*---------------------------------------------------------------------*/
2778 /* the following routines dumps type information without any ir nodes. */
2779 /*---------------------------------------------------------------------*/
2782 dump_type_graph (ir_graph *irg, const char *suffix)
2786 rem = current_ir_graph;
2788 /* if a filter is set, dump only the irg's that match the filter */
2789 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2791 current_ir_graph = irg;
2793 f = vcg_open(irg, suffix, "-type");
2794 dump_vcg_header(f, get_irg_dump_name(irg), NULL);
2796 /* walk over the blocks in the graph */
2797 type_walk_irg(irg, dump_type_info, NULL, f);
2798 /* The walker for the const code can be called several times for the
2799 same (sub) expression. So that no nodes are dumped several times
2800 we decrease the visited flag of the corresponding graph after each
2801 walk. So now increase it finally. */
2802 inc_irg_visited(get_const_code_irg());
2805 current_ir_graph = rem;
2809 dump_all_types (const char *suffix)
2811 FILE *f = vcg_open_name("All_types", suffix);
2812 dump_vcg_header(f, "All_types", NULL);
2813 type_walk(dump_type_info, NULL, f);
2814 inc_irg_visited(get_const_code_irg());
2819 dump_class_hierarchy (int entities, const char *suffix)
2821 FILE *f = vcg_open_name("class_hierarchy", suffix);
2825 env.dump_ent = entities;
2826 dump_vcg_header(f, "class_hierarchy", NULL);
2827 type_walk(dump_class_hierarchy_node, NULL, &env);
2831 /*---------------------------------------------------------------------*/
2832 /* dumps all graphs with the graph-dumper passed. Possible dumpers: */
2834 /* dump_ir_block_graph */
2836 /* dump_type_graph */
2837 /* dump_ir_graph_w_types */
2838 /*---------------------------------------------------------------------*/
2840 void dump_all_ir_graphs(dump_graph_func *dmp_grph, const char *suffix) {
2842 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
2843 dmp_grph(get_irp_irg(i), suffix);
2847 /*--------------------------------------------------------------------------------*
2848 * Dumps a stand alone loop graph with firm nodes which belong to one loop node *
2849 * packed together in one subgraph/box *
2850 *--------------------------------------------------------------------------------*/
2852 void dump_loops_standalone(FILE *F, ir_loop *loop) {
2853 int i = 0, loop_node_started = 0, son_number = 0, first = 0;
2855 ir_loop *son = NULL;
2857 /* Dump a new loop node. */
2858 dump_loop_node(F, loop);
2860 /* Dump the loop elements. */
2862 for(i = 0; i < get_loop_n_elements(loop); i++) {
2863 le = get_loop_element(loop, i);
2865 if (get_kind(son) == k_ir_loop) {
2867 /* We are a loop son -> Recurse */
2869 if(loop_node_started) { /* Close the "firm-nodes" node first if we started one. */
2870 fprintf(F, "\" }\n");
2871 fprintf (F, "edge: {sourcename: \"");
2873 fprintf (F, "\" targetname: \"");
2875 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2876 loop_node_started = 0;
2878 dump_loop_son_edge(F, loop, son_number++);
2879 dump_loops_standalone(F, son);
2880 } else if (get_kind(son) == k_ir_node) {
2881 /* We are a loop node -> Collect firm nodes */
2883 ir_node *n = le.node;
2886 if (!loop_node_started) {
2887 /* Start a new node which contains all firm nodes of the current loop */
2888 fprintf (F, "node: { title: \"");
2890 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2891 loop_node_started = 1;
2897 bad |= dump_node_label(F, n);
2898 /* Causes indeterministic output: if (is_Block(n)) fprintf (F, "\t ->%d", (int)get_irn_link(n)); */
2899 if (has_backedges(n)) fprintf(F, "\t loop head!");
2900 } else { /* for callgraph loop tree */
2902 assert(get_kind(son) == k_ir_graph);
2904 /* We are a loop node -> Collect firm graphs */
2905 n = (ir_graph *)le.node;
2906 if (!loop_node_started) {
2907 /* Start a new node which contains all firm nodes of the current loop */
2908 fprintf (F, "node: { title: \"");
2910 fprintf (F, "-%d-nodes\" color: lightyellow label: \"", i);
2911 loop_node_started = 1;
2916 fprintf (F, " %s", get_irg_dump_name(n));
2917 /* fprintf (F, " %s (depth %d)", get_irg_dump_name(n), n->callgraph_weighted_loop_depth); */
2921 if (loop_node_started) {
2922 fprintf(F, "\" }\n");
2923 fprintf (F, "edge: {sourcename: \"");
2925 fprintf (F, "\" targetname: \"");
2927 fprintf (F, "-%d-nodes\" label:\"%d...%d\"}\n", first, first, i-1);
2928 loop_node_started = 0;
2932 void dump_loop_tree(ir_graph *irg, const char *suffix)
2935 ir_graph *rem = current_ir_graph;
2936 int el_rem = edge_label;
2939 /* if a filter is set, dump only the irg's that match the filter */
2940 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) return;
2942 current_ir_graph = irg;
2944 f = vcg_open(irg, suffix, "-looptree");
2945 dump_vcg_header(f, get_irg_dump_name(irg), "top_to_bottom");
2947 if (get_irg_loop(irg)) dump_loops_standalone(f, get_irg_loop(irg));
2951 edge_label = el_rem;
2952 current_ir_graph = rem;
2955 void dump_callgraph_loop_tree(const char *suffix) {
2957 F = vcg_open_name("Callgraph_looptree", suffix);
2958 dump_vcg_header(F, "callgraph looptree", "top_to_bottom");
2959 dump_loops_standalone(F, irp->outermost_cg_loop);
2964 /*-----------------------------------------------------------------------------*/
2965 /* Dumps the firm nodes in the loop tree to a graph along with the loop nodes. */
2966 /*-----------------------------------------------------------------------------*/
2968 void collect_nodeloop(FILE *F, ir_loop *loop, eset *loopnodes) {
2969 int i, son_number = 0, node_number = 0;
2971 if (dump_loop_information_flag) dump_loop_node(F, loop);
2973 for (i = 0; i < get_loop_n_elements(loop); i++) {
2974 loop_element le = get_loop_element(loop, i);
2975 if (*(le.kind) == k_ir_loop) {
2976 if (dump_loop_information_flag) dump_loop_son_edge(F, loop, son_number++);
2978 collect_nodeloop(F, le.son, loopnodes);
2980 if (dump_loop_information_flag) dump_loop_node_edge(F, loop, node_number++);
2981 eset_insert(loopnodes, le.node);
2986 void collect_nodeloop_external_nodes(ir_loop *loop, eset *loopnodes, eset *extnodes) {
2989 for(i = 0; i < get_loop_n_elements(loop); i++) {
2990 loop_element le = get_loop_element(loop, i);
2991 if (*(le.kind) == k_ir_loop) {
2993 collect_nodeloop_external_nodes(le.son, loopnodes, extnodes);
2995 if (is_Block(le.node)) start = 0; else start = -1;
2996 for (j = start; j < get_irn_arity(le.node); j++) {
2997 ir_node *pred = get_irn_n(le.node, j);
2998 if (!eset_contains(loopnodes, pred)) {
2999 eset_insert(extnodes, pred);
3000 if (!is_Block(pred)) {
3001 pred = get_nodes_block(pred);
3002 if (!eset_contains(loopnodes, pred)) eset_insert(extnodes, pred);
3010 void dump_loop(ir_loop *l, const char *suffix) {
3013 eset *loopnodes = eset_create();
3014 eset *extnodes = eset_create();
3017 snprintf(name, sizeof(name), "loop_%d", get_loop_loop_nr(l));
3018 F = vcg_open_name (name, suffix);
3019 dump_vcg_header(F, name, NULL);
3021 /* collect all nodes to dump */
3022 collect_nodeloop(F, l, loopnodes);
3023 collect_nodeloop_external_nodes(l, loopnodes, extnodes);
3025 /* build block lists */
3026 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3027 set_irn_link(n, NULL);
3028 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3029 set_irn_link(n, NULL);
3030 for (n = eset_first(loopnodes); n != NULL; n = eset_next(loopnodes))
3032 b = get_nodes_block(n);
3033 set_irn_link(n, get_irn_link(b));
3036 for (n = eset_first(extnodes); n != NULL; n = eset_next(extnodes))
3038 b = get_nodes_block(n);
3039 set_irn_link(n, get_irn_link(b));
3043 for (b = eset_first(loopnodes); b != NULL; b = eset_next(loopnodes))
3045 fprintf(F, "graph: { title: \"");
3047 fprintf(F, "\" label: \"");
3048 dump_node_opcode(F, b);
3049 fprintf (F, " %ld", get_irn_node_nr(b));
3050 fprintf(F, "\" status:clustered color:yellow\n");
3052 /* dump the blocks edges */
3053 dump_ir_data_edges(F, b);
3055 /* dump the nodes that go into the block */
3056 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3057 if (eset_contains(extnodes, n))
3058 overrule_nodecolor = ird_color_lightblue;
3060 overrule_nodecolor = ird_color_default;
3061 if (!eset_contains(extnodes, n)) dump_ir_data_edges(F, n);
3064 /* Close the vcg information for the block */
3066 dump_const_node_local(F, b);
3069 for (b = eset_first(extnodes); b != NULL; b = eset_next(extnodes))
3071 fprintf(F, "graph: { title: \"");
3073 fprintf(F, "\" label: \"");
3074 dump_node_opcode(F, b);
3075 fprintf (F, " %ld", get_irn_node_nr(b));
3076 fprintf(F, "\" status:clustered color:lightblue\n");
3078 /* dump the nodes that go into the block */
3079 for (n = get_irn_link(b); n; n = get_irn_link(n)) {
3080 if (!eset_contains(loopnodes, n))
3081 overrule_nodecolor = ird_color_lightblue;
3083 overrule_nodecolor = ird_color_default;
3084 if (eset_contains(loopnodes, n)) dump_ir_data_edges(F, n);
3087 /* Close the vcg information for the block */
3089 dump_const_node_local(F, b);
3093 eset_destroy(loopnodes);
3094 eset_destroy(extnodes);