2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write ir graph as a grgen construction rule
23 * @author Andreas Schoesser
27 #define MAX_NODENAME_LEN 100
35 #include "firm_types.h"
39 #include "firm_types.h"
45 struct pmap *mode_edge_map;
46 struct pmap *edge_name_map;
47 struct pmap *node_name_map; // Contains the mapping firm node -> node name
48 struct obstack node_names; // Contains the node name data
49 struct pmap *mode_name_map; // Contains the mapping firm mode -> mode node name
50 struct obstack mode_names; // Contains the "mode node name" data
51 struct pmap *nodes_to_dump; // Contains firm nodes, that have to be dumped
54 typedef struct // Holds information needed througout the usage of a grgen dumper instance
56 FILE *output_file; // The file the grgen rules will be dumped to
57 } irg_grgen_dumper_env_t;
59 static void dump_grg_node(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp);
60 static void dump_grg_egde(ir_node *n, int n_edge, grgen_dumpinfo_t *dump_info, FILE *fp);
61 static void dump_grgen_mode(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp, ir_mode *alt_mode);
62 static char *dump_grgen_mode_node(ir_mode *irn_mode, grgen_dumpinfo_t *dump_info, FILE *fp);
63 static void dump_grgen_eval(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp);
64 static int dump_pattern(grgen_dumpinfo_t *dump_info, FILE *fp);
65 static int get_indent(void);
66 static void set_indent(int i);
70 /*****************************************************************************
71 * Program: grgen_dumper.c
72 * Function: Dumps parts of a firm graph (those which have to be extracted
73 * as search and replace patterns) as a grGen rule.
74 * Depends on: Needs the analysis info generated by the pattern creator
75 * Author: Andreas Schoesser
77 *****************************************************************************/
80 // ---------------------------- INCLUDES --------------------------------
85 /* #include "grgen_dumper__t.h"
86 #include "create_pattern_t.h"
87 #include "firm_node_ext.h" */
89 // ----------------------------- GLOABALS --------------------------------
91 // Saves the current indent value and keeps spaces in a string
92 #define MAX_INDENT 100
93 static char indent[MAX_INDENT] = "";
94 static int current_indent = 0;
96 // Saves the current node number to generate node names
97 static int node_counter;
98 static int edge_counter;
103 /************************************************************************
104 * Initializes the grgen_dumper module and dumps the GrGen File header
105 * Returns: An environment to be passed to all functions of the GrGen
107 * Parameters: file: filename of the file to dump to
108 * append: 1 if the previous file content should be
110 ************************************************************************/
112 irg_grgen_dumper_env_t *init_irg_grgen_dumper(char *file, int append)
114 irg_grgen_dumper_env_t *grgen_dumper_env = malloc(sizeof(irg_grgen_dumper_env_t));
118 fp = fopen(file, "at");
121 fp = fopen(file, "wt");
124 fprintf(fp, "%susing Firm;\n\n", indent);
127 grgen_dumper_env -> output_file = fp;
128 return(grgen_dumper_env);
133 /************************************************************************
134 * Frees information used by the grgen_dumper and closes the output file
135 ************************************************************************/
137 void deinit_irg_grgen_dumper(irg_grgen_dumper_env_t *grgen_dumper_env)
139 fclose(grgen_dumper_env->output_file);
140 free(grgen_dumper_env);
143 static void collect_nodes(ir_node *n, void * env)
145 pmap *nodes_to_dump = (pmap *) env;
147 pmap_insert(nodes_to_dump, n, NULL);
153 /************************************************************************
155 ************************************************************************/
157 void dump_irg_grgen(ir_graph *irg, char *filename, int append)
160 grgen_dumpinfo_t dump_info;
164 irg_grgen_dumper_env_t *grgen_dumper_env = init_irg_grgen_dumper(filename, append);
165 fp = grgen_dumper_env -> output_file;
168 dump_info.irg = irg; // Basically copy the graph_ana_struct, ugly
169 dump_info.mode_edge_map = pmap_create(); // Create some additional pmaps to hold
170 dump_info.edge_name_map = pmap_create(); // node and edge name information etc.
171 dump_info.node_name_map = pmap_create();
172 dump_info.mode_name_map = pmap_create();
173 dump_info.nodes_to_dump = pmap_create();
175 // Node and egde count start at 0 for each pattern to be dumped.
178 obstack_init(&(dump_info.node_names));
179 obstack_init(&(dump_info.mode_names));
183 fprintf(fp, "\n\n%srule %s\n%s{\n", indent, get_entity_name(get_irg_entity(irg)), indent);
186 fprintf(fp, "%spattern { }\n", indent); // Empty pattern
187 fprintf(fp, "%sreplace\n%s{\n", indent, indent); // Graph is contrcuted in the replacement part
191 irg_walk_graph(irg, collect_nodes, NULL, dump_info.nodes_to_dump);
192 uses_memory = dump_pattern(&dump_info, fp);
196 fprintf(fp, "%s}\n", indent);
199 pmap_destroy(dump_info.mode_edge_map);
200 pmap_destroy(dump_info.edge_name_map);
201 pmap_destroy(dump_info.node_name_map);
202 pmap_destroy(dump_info.mode_name_map);
203 obstack_free(&(dump_info.node_names), NULL);
204 obstack_finish(&(dump_info.node_names));
205 obstack_free(&(dump_info.mode_names), NULL);
206 obstack_finish(&(dump_info.mode_names));
208 deinit_irg_grgen_dumper(grgen_dumper_env);
212 /************************************************************************
213 * Dumps the left hand side of the rule
214 ************************************************************************/
216 static int dump_pattern(grgen_dumpinfo_t *dump_info, FILE *fp)
218 struct pmap *nodes_to_dump = dump_info->nodes_to_dump;
223 pmap_foreach(nodes_to_dump, entry)
225 ir_node *n = (ir_node *) entry->key;
228 if(get_irn_opcode(n) == iro_Proj && get_irn_modecode(n) == irm_M)
230 dump_grg_node(n, dump_info, fp);
231 dump_grgen_mode(n, dump_info, fp, NULL);
235 pmap_foreach(nodes_to_dump, entry)
237 ir_node *n = (ir_node *) entry->key;
241 for(i = -1; i < get_irn_arity(n); i++)
242 dump_grg_egde(n, i, dump_info, fp);
245 fprintf(fp, "%seval {\n", indent);
247 pmap_foreach(nodes_to_dump, entry)
249 ir_node *n = (ir_node *) entry->key;
250 dump_grgen_eval(n, dump_info, fp);
253 fprintf(fp, "%s}\n", indent);
257 fprintf(fp, "%s} /* Replacement */\n", indent);
263 /************************************************************************
264 * Dumps a node in GrGen Format
265 ************************************************************************/
267 static void dump_grg_node(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp)
271 // Already dumped the node? Then do nothing
272 if(pmap_contains(dump_info -> node_name_map, n))
275 // Else generate new node name and dump the node
277 node_name = obstack_alloc(&(dump_info -> node_names), MAX_NODENAME_LEN);
279 sprintf(node_name, "%s%d", get_op_name(get_irn_op(n)), get_irn_node_nr(n));
280 fprintf(fp, "%s%s : %s;\n", indent, node_name, get_op_name(get_irn_op(n)));
282 pmap_insert(dump_info -> node_name_map, n, node_name);
288 /************************************************************************
289 * Dumps an edge in GrGen format
290 ************************************************************************/
292 static void dump_grg_egde(ir_node *n, int n_edge, grgen_dumpinfo_t *dump_info, FILE *fp)
295 char *from_node_name, *to_node_name;
296 char **nodes_edge_names;
299 // Check if to_node has also to be dumped. If not, skip this edge
300 // We have to dump to_node here, because to_node has to be known by grgen before
301 // connecting an edge to it.
302 to_node = get_irn_n(n, n_edge);
303 if(!pmap_contains(dump_info -> nodes_to_dump, to_node))
306 if((nodes_edge_names = pmap_get(dump_info -> edge_name_map, n)) == NULL)
308 nodes_edge_names = (char **) obstack_alloc(&(dump_info->node_names), (get_irn_arity(n) + 1) * sizeof(char *));
309 memset(nodes_edge_names, 0, (get_irn_arity(n) + 1) * sizeof(char *));
310 pmap_insert(dump_info->edge_name_map, n, nodes_edge_names);
313 assert(pmap_contains(dump_info -> node_name_map, n));
314 assert(pmap_contains(dump_info -> node_name_map, to_node));
315 from_node_name = (char *) pmap_get(dump_info -> node_name_map, n);
316 to_node_name = (char *) pmap_get(dump_info -> node_name_map, to_node);
320 char edge_name[50], *edge_name_obst;
322 sprintf(edge_name, "pos%d_%d", n_edge + 1, edge_counter++);
323 edge_name_obst = obstack_alloc(&(dump_info->node_names), strlen(edge_name) + 1);
324 strcpy(edge_name_obst, edge_name);
325 nodes_edge_names[n_edge + 1] = edge_name_obst;
327 fprintf(fp, "%s%s -%s:df-> %s;\n", indent, from_node_name, edge_name_obst, to_node_name);
335 /************************************************************************
336 * Dumps an FIRM Mode as GrGen Code
337 * If source_node_name == NULL, that name of n that was already
339 * If source_node_name != NULL, this given source will be used
340 * (useful for retyped nodes)
341 ************************************************************************/
343 static void dump_grgen_mode(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp, ir_mode *alt_mode)
345 char *node_name = (char *) pmap_get(dump_info -> node_name_map, n);
346 ir_mode *irn_mode = (alt_mode != NULL) ? alt_mode : get_irn_mode(n);
348 char *mode_node_name;
350 mode_node_name = dump_grgen_mode_node(irn_mode, dump_info, fp);
352 //mode_code = get_mode_modecode(irn_mode);
353 //mode_name = get_mode_name(irn_mode);
355 // Yes, use the given mode-node
356 //mode_node_name = pmap_get(dump_info -> mode_name_map, (void *) mode_code);
357 sprintf(edge_name, "m%d", edge_counter++);
359 if(pmap_get(dump_info->mode_edge_map, n) == NULL)
361 char *edge_name_obst = obstack_alloc(&(dump_info->node_names), strlen(edge_name) + 1);
362 strcpy(edge_name_obst, edge_name);
363 pmap_insert(dump_info->mode_edge_map, n, edge_name_obst);
366 // Dump the edge from the current node to it's mode node
367 fprintf(fp, "%s%s -%s:has_mode-> %s;\n", indent, node_name, edge_name, mode_node_name);
372 /************************************************************************
373 * Dumps a node representing a node
374 ************************************************************************/
376 static char *dump_grgen_mode_node(ir_mode *irn_mode, grgen_dumpinfo_t *dump_info, FILE *fp)
378 modecode mode_code = get_mode_modecode(irn_mode);
379 const char *mode_name = get_mode_name(irn_mode);
380 char *mode_node_name;
382 if(!pmap_contains(dump_info -> mode_name_map, (void *) mode_code))
384 // No, create a new mode-node
385 mode_node_name = obstack_alloc(&(dump_info -> mode_names), MAX_NODENAME_LEN);
386 sprintf(mode_node_name, "mode_%s_node", mode_name);
387 pmap_insert(dump_info -> mode_name_map, (void *) mode_code, mode_node_name);
388 fprintf(fp, "%s%s : Mode_%s;\n", indent, mode_node_name, mode_name);
389 return(mode_node_name);
393 return((char *) pmap_get(dump_info -> mode_name_map, (void *) mode_code));
400 /************************************************************************
401 * Dumps the condition for the given node, depending on the node's
402 * attributes and the node's opcode
403 ************************************************************************/
405 static void dump_grgen_eval(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp)
408 ir_opcode code = get_irn_opcode(n);
410 if(code == iro_Const)
412 node_name = pmap_get(dump_info->node_name_map, n);
413 fprintf(fp, "%s%s.value = \"%d\";\n", indent, node_name, get_tarval_long(get_Const_tarval(n)));
419 node_name = pmap_get(dump_info->node_name_map, n);
420 fprintf(fp, "%s%s.proj = %d;\n", indent, node_name, get_Proj_proj(n));
423 /*if(code == iro_Block)
425 node_name = pmap_get(dump_info->node_name_map, n);
426 fprintf(fp, "%s%s.pos = %d;\n", indent, node_name, ??);
431 node_name = pmap_get(dump_info->node_name_map, n);
432 fprintf(fp, "%s%s.pos = %d;\n", indent, node_name, ??);
435 // TODO: Dump Block evals: edge numbers
438 if(code == iro_Phi || code == iro_Block)
443 //assert((get_irn_arity(n) == get_irn_arity(phi_block)) && "Phi has other arity than it's block! Pattern seems to be broken.");
445 // Load the edge names that have been saved
446 edge_names = pmap_get(dump_info->edge_name_map, n);
447 assert(edge_names && "Some edge names have not been dumped!");
449 // Correlate the matched phi edges with the matched block edges
450 // Caution: Position 0 in the edge_names array is the block edge, so start at 1
451 for(i = 0; i < get_irn_arity(n) + 1; i++)
453 assert(edge_names[i] != NULL && "Some edges have not been dumped!");
455 fprintf(fp, "%s%s.pos = %d;\n", indent, edge_names[i], i);
465 /************************************************************************
466 * Sets current indent
467 ************************************************************************/
469 static void set_indent(int i)
473 // Generate a string containing i blank characters
474 if(i < MAX_INDENT - 1)
476 for(j = 0; j < i; j++)
485 /************************************************************************
486 * Gets current indent value
487 ************************************************************************/
489 static int get_indent(void)
491 return(current_indent);
495 /************************************************************************
496 * Collects all nodes of a ir graph, so that the ir graph can be
498 ************************************************************************/