1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Martin Trapp, Christian Schaefer
6 ** irdump.h: dumping of an intermediate representation graph
18 # include "type_or_entity.h"
20 # include "typewalk.h"
22 #define DEFAULT_NODE_ATTR ""
23 #define BLOCK_EDGE_ATTR "class: 2 priority: 2 linestyle: dotted"
24 #define NODE2TYPE_EDGE_ATTR ""
25 #define DEFAULT_TYPE_ATTRIBUTE ""
26 #define TYPE_EDGE_ATTR ""
32 /*******************************************************************/
33 /* routines to dump information about a single node */
34 /*******************************************************************/
37 dump_ir_node (ir_node *n)
40 xfprintf (F, "node: {title: \"%p\" label: ", n);
42 switch (n->op->code) { /* node label */
44 xfprintf (F, "\"%I\" color: blue ", n->op->name);
45 xfprintf (F, DEFAULT_NODE_ATTR);
48 xfprintf (F, "\"%I\" color: blue ", n->op->name);
49 xfprintf (F, DEFAULT_NODE_ATTR);
52 xfprintf (F, "\"%I\" color: lightyellow ", n->op->name);
53 xfprintf (F, DEFAULT_NODE_ATTR);
56 xfprintf (F, "\"%I%I\" color: green", n->op->name, n->mode->name);
57 if (n->mode->code == irm_M)
58 xfprintf (F, DEFAULT_NODE_ATTR " color: green");
60 xfprintf (F, DEFAULT_NODE_ATTR);
63 xfprintf (F, "\"%v%I\" color: yellow ", n->attr.con, n->mode->name);
64 xfprintf (F, DEFAULT_NODE_ATTR);
67 xfprintf (F, "\"%I%I\" ", n->op->name, n->mode->name);
68 xfprintf (F, DEFAULT_NODE_ATTR);
71 if (n->in[1]->op->code == iro_Cmp) {
72 xfprintf (F, "\"%I%I %s\" color: yellow", n->op->name, n->mode->name,
73 get_pnc_string(n->attr.proj));
75 xfprintf (F, "\"%I%I %ld\"", n->op->name, n->mode->name, n->attr.proj);
77 xfprintf (F, DEFAULT_NODE_ATTR);
80 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
81 xfprintf (F, DEFAULT_NODE_ATTR);
84 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
85 xfprintf (F, DEFAULT_NODE_ATTR);
88 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
89 xfprintf (F, DEFAULT_NODE_ATTR);
92 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
93 xfprintf (F, DEFAULT_NODE_ATTR);
96 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
97 xfprintf (F, DEFAULT_NODE_ATTR);
100 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
101 xfprintf (F, DEFAULT_NODE_ATTR);
104 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
105 xfprintf (F, DEFAULT_NODE_ATTR);
108 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
109 xfprintf (F, DEFAULT_NODE_ATTR);
112 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
113 xfprintf (F, DEFAULT_NODE_ATTR);
116 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
117 xfprintf (F, DEFAULT_NODE_ATTR);
120 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
121 xfprintf (F, DEFAULT_NODE_ATTR);
124 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
125 xfprintf (F, DEFAULT_NODE_ATTR);
128 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
129 xfprintf (F, DEFAULT_NODE_ATTR);
132 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
133 xfprintf (F, DEFAULT_NODE_ATTR);
136 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
137 xfprintf (F, DEFAULT_NODE_ATTR);
140 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
141 xfprintf (F, DEFAULT_NODE_ATTR);
144 xfprintf (F, "\"%I\"", n->op->name);
145 xfprintf (F, DEFAULT_NODE_ATTR);
148 xfprintf (F, "\"%I\"", n->op->name);
149 xfprintf (F, DEFAULT_NODE_ATTR);
152 xfprintf (F, "\"%I\"", n->op->name);
153 xfprintf (F, DEFAULT_NODE_ATTR);
156 xfprintf (F, "\"%I\"", n->op->name);
157 xfprintf (F, DEFAULT_NODE_ATTR);
160 xfprintf (F, "\"%I%I\"", n->op->name, n->mode->name);
161 xfprintf (F, DEFAULT_NODE_ATTR);
165 xfprintf (F, "\"%R\"", n);
166 xfprintf (F, DEFAULT_NODE_ATTR);
169 xfprintf (F, "\"%I\" ", n->op->name);
170 xfprintf (F, DEFAULT_NODE_ATTR);
173 assert(n->attr.s.ent->kind == k_entity);
174 xfprintf (F, "\"%I ", n->op->name);
175 xfprintf (F, "%s\" ", id_to_str(n->attr.s.ent->name));
176 // xfprintf (F, "\"%I %I\" ", n->op->name, n->attr.s.ent); // GL: doesn't work for some reason.
177 xfprintf (F, DEFAULT_NODE_ATTR);
180 assert(get_kind(get_SymConst_type(n)) == k_type_class);
181 //assert(n->attr.i.type->kind == k_type_class);
182 assert(get_class_ident((type_class *)get_SymConst_type(n)));
183 //assert(n->attr.i.type->clss->name);
184 xfprintf (F, "\"%s ", id_to_str(get_class_ident((type_class *)get_SymConst_type(n))));
185 //xfprintf (F, "\"%s ", id_to_str(n->attr.i.type->name));
186 // xfprintf (F, "\"%N\" ", n->attr.i.type); // GL: doesn't work for some reason.
187 switch (n->attr.i.num){
189 xfprintf (F, "tag\" ");
192 xfprintf (F, "size\" ");
198 xfprintf (F, DEFAULT_NODE_ATTR);
201 xfprintf (F, "\"%I\" ", n->op->name);
202 xfprintf (F, DEFAULT_NODE_ATTR " color: green");
205 xfprintf (F, "\"%I%I\" ", n->op->name, n->mode->name);
206 xfprintf (F, DEFAULT_NODE_ATTR);
209 xfprintf (F, "\"%I%I\" ", n->op->name, n->mode->name);
211 xfprintf (F, "}\n"); /* footer */
215 /* dump the edge to the block this node belongs to */
217 dump_ir_block_edge(ir_node *n) {
219 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
220 BLOCK_EDGE_ATTR "}\n", n, get_nodes_Block(n));
224 /* dump edges to our inputs */
226 dump_ir_data_edges(ir_node *n) {
229 for (i = 0; i < get_irn_arity(n); i++) {
230 assert(get_irn_n(n, i));
231 xfprintf (F, "edge: {sourcename: \"%p\" targetname: \"%p\"",
233 fprintf (F, " label: \"%d\"", i+1);
238 /* dumps the edges between nodes and their type or entity attributes. */
239 void dump_node2type_edges (ir_node *n, void *env)
243 switch (get_irn_opcode(n)) {
245 if ( (get_SymConst_kind(n) == type_tag)
246 || (get_SymConst_kind(n) == size))
247 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
248 NODE2TYPE_EDGE_ATTR "}\n", n, get_SymConst_type(n));
251 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
252 NODE2TYPE_EDGE_ATTR "}\n", n, get_Sel_entity(n));
255 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
256 NODE2TYPE_EDGE_ATTR "}\n", n, get_Call_type(n));
259 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
260 NODE2TYPE_EDGE_ATTR "}\n", n, get_Alloc_type(n));
263 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
264 NODE2TYPE_EDGE_ATTR "}\n", n, get_Free_type(n));
272 /* dumps a type or entity and it's edges. */
274 dump_type_info (type_or_ent *tore, void *env) {
275 int i = 0; /* to shutup gcc */
277 /* dump this type or entity */
278 xfprintf (F, "node: {title: \"%p\" ", tore);
279 xfprintf (F, DEFAULT_TYPE_ATTRIBUTE);
280 xfprintf (F, "label: ");
282 switch (get_kind(tore)) {
285 entity *ent = (entity *)tore;
286 xfprintf (F, "\"ent %I\"}\n", get_entity_ident(ent));
287 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
289 TYPE_EDGE_ATTR "}\n", tore, get_entity_owner(ent));
290 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
292 TYPE_EDGE_ATTR "}\n", tore, get_entity_type(ent));
297 type_class *type = (type_class *)tore;
298 xfprintf (F, "\"class %I\"}\n", get_class_ident(type));
304 type_strct *type = (type_strct *)tore;
305 xfprintf (F, "\"strct %I\"}\n", get_strct_ident(type));
311 type_method *type = (type_method *)tore;
312 xfprintf (F, "\"meth %I\"}\n", get_method_ident(type));
313 for (i = 0; i < get_method_arity(type); i++)
314 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
315 " label: \"param %d\" " TYPE_EDGE_ATTR "}\n",
316 tore, get_method_param_type(type, i), i);
317 for (i = 0; i < get_method_n_res(type); i++)
318 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
319 " label: \"res %d\" " TYPE_EDGE_ATTR "}\n",
320 tore, get_method_res_type(type, i), i);
325 type_union *type = (type_union *)tore;
326 xfprintf (F, "\"union %I\"}\n", get_union_ident(type));
332 type_array *type = (type_array *)tore;
333 xfprintf (F, "\"array %I\"}\n", get_array_ident(type));
334 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
335 TYPE_EDGE_ATTR "}\n", tore, get_array_element_type(type), i);
338 case k_type_enumeration:
340 type_enumeration *type = (type_enumeration *)tore;
341 xfprintf (F, "\"enum %I\"}\n", get_enumeration_ident(type));
346 type_pointer *type = (type_pointer *)tore;
347 xfprintf (F, "\"ptr %I\"}\n", get_pointer_ident(type));
348 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" "
349 TYPE_EDGE_ATTR "}\n", tore,
350 get_pointer_points_to_type(type), i);
353 case k_type_primitive:
355 type_primitive *type = (type_primitive *)tore;
356 xfprintf (F, "\"prim %I, mode %I\"}\n", get_primitive_ident(type),
357 get_mode_ident(get_primitive_mode(type)));
366 /************************************************************************/
367 /* open and close vcg file */
368 /************************************************************************/
370 void vcg_open (ir_graph *irg, char *suffix) {
371 char *fname; /* filename to put the vcg information in */
376 /** open file for vcg graph */
377 id = get_entity_ld_name (irg->ent);
379 len = id_to_strlen (id);
381 fname = malloc (len + 5 + strlen(suffix));
382 strcpy (fname, cp); /* copy the filename */
383 strcat (fname, suffix); /* append file suffix */
384 strcat (fname, ".vcg"); /* append the .vcg suffix */
386 F = fopen (fname, "w"); /* open file for writing */
388 panic ("cannot open %s for writing (%m)", fname); /* not reached */
393 "graph: { title: \"ir graph of %s\"\n"
394 "display_edge_labels: yes\n"
395 "layoutalgorithm: mindepth\n"
396 "manhattan_edges: yes\n"
398 "orientation: bottom_to_top\n"
399 "classname 1: \"Data\"\n"
400 "classname 2: \"Block\"\n", cp);
402 xfprintf (F, "\n"); /* a separator */
407 xfprintf (F, "}\n"); /* print footer */
408 fclose (F); /* close vcg file */
413 /************************************************************************/
414 /* routines to dump a graph, blocks as conventional nodes. */
415 /************************************************************************/
418 dump_whole_node (ir_node *n, void* env) {
420 dump_ir_block_edge(n);
421 dump_ir_data_edges(n);
425 dump_ir_graph (ir_graph *irg)
429 /* walk over the graph */
430 irg_walk(irg->end, dump_whole_node, NULL, NULL);
435 /***********************************************************************/
436 /* the following routines dump the nodes as attached to the blocks. */
437 /***********************************************************************/
440 dump_ir_blocks_nodes (ir_node *n, void *env) {
441 ir_node *block = (ir_node *)env;
443 if (is_no_Block(n) && get_nodes_Block(n) == block) {
445 dump_ir_data_edges(n);
451 dump_ir_block (ir_node *block, void *env) {
452 ir_graph *irg = (ir_graph *)env;
454 if (get_irn_opcode(block) == iro_Block) {
455 /* This is a block. So dump the vcg information to make a block. */
456 xfprintf(F, "graph: { title: \"%p\" status:clustered color:lightyellow \n",
458 /* dump the blocks edges */
459 dump_ir_data_edges(block);
461 /* dump the nodes that go into the block */
462 irg_walk(irg->end, dump_ir_blocks_nodes, NULL, block);
464 /* Close the vcg information for the block */
465 xfprintf(F, "}\n\n");
470 dump_ir_block_graph (ir_graph *irg)
474 /* walk over the blocks in the graph */
475 irg_block_walk(irg->end, dump_ir_block, NULL, irg);
481 /***********************************************************************/
482 /* the following routines dump a control flow graph */
483 /***********************************************************************/
487 dump_block_to_cfg (ir_node *block, void *env) {
491 if (get_irn_opcode(block) == iro_Block) {
492 /* This is a block. Dump a node for the block. */
493 xfprintf (F, "node: {title: \"%p\" label: \"%I\"}", block,
496 for ( i = 0; i < get_Block_n_cfgpreds(block); i++) {
497 pred = get_nodes_Block(skip_Proj(get_Block_cfgpred(block, i)));
498 xfprintf (F, "edge: { sourcename: \"%p\" targetname: \"%p\" }\n",
505 dump_cfg (ir_graph *irg)
507 vcg_open (irg, "-cfg");
509 /* walk over the blocks in the graph */
510 irg_block_walk(irg->end, dump_block_to_cfg, NULL, NULL);
516 /***********************************************************************/
517 /* the following routine dumps all type information */
518 /***********************************************************************/
522 dump_type_graph (ir_graph *irg)
524 vcg_open (irg, "-type");
526 /* walk over the blocks in the graph */
527 type_walk(irg, dump_type_info, NULL, NULL);
533 /***********************************************************************/
534 /* dumps a graph with type information */
535 /***********************************************************************/
539 dump_ir_graph_w_types (ir_graph *irg)
541 vcg_open (irg, "-all");
543 /* dump common ir graph */
544 // irg_block_walk(irg->end, dump_ir_block, NULL, irg);
545 irg_walk(irg->end, dump_whole_node, NULL, NULL);
547 type_walk(irg, dump_type_info, NULL, NULL);
548 /* dump edges from graph to type info */
549 irg_walk(irg->end, dump_node2type_edges, NULL, NULL);