2 * graph.c: Helper routines to graph various internal states of the code generator
5 * Dietmar Maurer (dietmar@ximian.com)
7 * (C) 2003 Ximian, Inc.
10 #include <mono/metadata/debug-helpers.h>
14 extern guint8 mono_burg_arity [];
17 convert_name (const char *str)
19 int i, j, len = strlen (str);
20 char *res = g_malloc (len * 2);
23 for (i = 0; i < len; i++) {
41 dtree_emit_one_loop_level (MonoCompile *cfg, FILE *fp, MonoBasicBlock *h)
48 fprintf (fp, "subgraph cluster_%d {\n", h->block_num);
49 fprintf (fp, "label=\"loop_%d\"\n", h->block_num);
52 for (i = 1; i < cfg->num_bblocks; ++i) {
53 bb = cfg->bblocks [i];
55 if (!h || (g_list_find (h->loop_blocks, bb) && bb != h)) {
56 if (bb->nesting == level) {
57 fprintf (fp, "BB%d -> BB%d;\n", bb->idom->block_num, bb->block_num);
60 if (bb->nesting == (level + 1) && bb->loop_blocks) {
61 fprintf (fp, "BB%d -> BB%d;\n", bb->idom->block_num, bb->block_num);
62 dtree_emit_one_loop_level (cfg, fp, bb);
73 cfg_emit_one_loop_level (MonoCompile *cfg, FILE *fp, MonoBasicBlock *h)
80 fprintf (fp, "subgraph cluster_%d {\n", h->block_num);
81 fprintf (fp, "label=\"loop_%d\"\n", h->block_num);
84 for (bb = cfg->bb_entry->next_bb; bb; bb = bb->next_bb) {
85 if (bb->region != -1) {
86 switch (bb->region & (MONO_REGION_FINALLY|MONO_REGION_CATCH|MONO_REGION_FAULT|MONO_REGION_FILTER)) {
87 case MONO_REGION_CATCH:
88 fprintf (fp, "BB%d [color=blue];\n", bb->block_num);;
90 case MONO_REGION_FINALLY:
91 fprintf (fp, "BB%d [color=green];\n", bb->block_num);;
93 case MONO_REGION_FAULT:
94 case MONO_REGION_FILTER:
95 fprintf (fp, "BB%d [color=yellow];\n", bb->block_num);;
102 if (!h || (g_list_find (h->loop_blocks, bb) && bb != h)) {
104 if (bb->nesting == level) {
105 for (j = 0; j < bb->in_count; j++)
106 fprintf (fp, "BB%d -> BB%d;\n", bb->in_bb [j]->block_num, bb->block_num);
109 if (bb->nesting == (level + 1) && bb->loop_blocks) {
110 for (j = 0; j < bb->in_count; j++)
111 fprintf (fp, "BB%d -> BB%d;\n", bb->in_bb [j]->block_num, bb->block_num);
112 cfg_emit_one_loop_level (cfg, fp, bb);
123 mono_draw_dtree (MonoCompile *cfg, FILE *fp)
125 g_assert ((cfg->comp_done & MONO_COMP_IDOM));
127 fprintf (fp, "digraph %s {\n", convert_name (cfg->method->name));
128 fprintf (fp, "node [fontsize=12.0]\nedge [len=1,color=red]\n");
129 fprintf (fp, "label=\"Dominator tree for %s\";\n", mono_method_full_name (cfg->method, TRUE));
131 fprintf (fp, "BB0 [shape=doublecircle];\n");
132 fprintf (fp, "BB1 [color=red];\n");
134 dtree_emit_one_loop_level (cfg, fp, NULL);
140 mono_draw_cfg (MonoCompile *cfg, FILE *fp)
142 fprintf (fp, "digraph %s {\n", convert_name (cfg->method->name));
143 fprintf (fp, "node [fontsize=12.0]\nedge [len=1,color=red]\n");
144 fprintf (fp, "label=\"CFG for %s\";\n", mono_method_full_name (cfg->method, TRUE));
146 fprintf (fp, "BB0 [shape=doublecircle];\n");
147 fprintf (fp, "BB1 [color=red];\n");
149 cfg_emit_one_loop_level (cfg, fp, NULL);
155 mono_print_label (FILE *fp, MonoInst *tree) {
161 arity = mono_burg_arity [tree->opcode];
163 fprintf (fp, "\\ %s%s", arity? "(": "", mono_inst_name (tree->opcode));
165 switch (tree->opcode) {
167 fprintf (fp, "[%d]", tree->inst_c0);
170 fprintf (fp, "[%lld]", tree->inst_l);
173 fprintf (fp, "[%f]", *(double*)tree->inst_p0);
176 fprintf (fp, "[%f]", *(float*)tree->inst_p0);
180 fprintf (fp, "[%d]", tree->inst_c0);
183 fprintf (fp, "[0x%x(%s)]", tree->inst_offset, mono_arch_regname (tree->inst_basereg));
186 fprintf (fp, "[%s]", mono_arch_regname (tree->dreg));
189 fprintf (fp, "[%s]", tree->inst_newa_class->name);
190 mono_print_label (fp, tree->inst_newa_len);
201 case OP_VOIDCALLVIRT: {
202 MonoCallInst *call = (MonoCallInst*)tree;
204 if (call->method->signature->hasthis && tree->inst_left) {
205 mono_print_label (fp, tree->inst_left);
207 fprintf (fp, "[%s]", call->method->name);
213 fprintf (fp, "[%d\\ (", tree->inst_c0);
214 for (i = 0; i < tree->inst_phi_args [0]; i++) {
216 fprintf (fp, ",\\ ");
217 fprintf (fp, "%d", tree->inst_phi_args [i + 1]);
229 fprintf (fp, "[B%d]", tree->inst_target_bb->block_num);
239 case OP_VOIDCALL_REG:
240 mono_print_label (fp, tree->inst_left);
252 fprintf (fp, "[B%dB%d]", tree->inst_true_bb->block_num, tree->inst_false_bb->block_num);
253 mono_print_label (fp, tree->inst_left);
257 mono_print_label (fp, tree->inst_left);
259 mono_print_label (fp, tree->inst_right);
269 mono_draw_code_cfg (MonoCompile *cfg, FILE *fp)
273 fprintf (fp, "digraph %s {\n", convert_name (cfg->method->name));
274 fprintf (fp, "node [fontsize=12.0]\nedge [len=1,color=red]\n");
275 fprintf (fp, "label=\"CFG for %s\";\n", mono_method_full_name (cfg->method, TRUE));
277 fprintf (fp, "BB0 [shape=doublecircle];\n");
278 fprintf (fp, "BB1 [color=red];\n");
280 for (bb = cfg->bb_entry->next_bb; bb; bb = bb->next_bb) {
284 if (bb == cfg->bb_exit)
287 if ((cfg->comp_done & MONO_COMP_REACHABILITY) && (bb->flags & BB_REACHABLE))
288 color = "color=red,";
292 fprintf (fp, "BB%d [%sshape=record,labeljust=l,label=\"{BB%d|", bb->block_num, color, bb->block_num);
294 for (inst = bb->code; inst; inst = inst->next) {
295 mono_print_label (fp, inst);
299 fprintf (fp, "}\"];\n");
302 cfg_emit_one_loop_level (cfg, fp, NULL);
308 mono_draw_graph (MonoCompile *cfg, MonoGraphOptions draw_options)
314 fn = "/tmp/minidtree.graph";
315 fp = fopen (fn, "w+");
318 switch (draw_options) {
319 case MONO_GRAPH_DTREE:
320 mono_draw_dtree (cfg, fp);
323 mono_draw_cfg (cfg, fp);
325 case MONO_GRAPH_CFG_CODE:
326 case MONO_GRAPH_CFG_OPTCODE:
327 case MONO_GRAPH_CFG_SSA:
328 mono_draw_code_cfg (cfg, fp);
334 //com = g_strdup_printf ("dot %s -Tpng -o %s.png; eog %s.png", fn, fn, fn);
335 com = g_strdup_printf ("dot %s -Tps -o %s.ps;gv %s.ps", fn, fn, fn);