* @file
* @brief Write ir graph as a grgen construction rule
* @author Andreas Schoesser
-* @version $Id:$
+* @version $Id$
*/
+/*
+ * THIS IS A COMPLETE QUICK HACK! USE WITH CARE
+ * NOT FOR PRODUCTION BUILD ;-)
+ */
+
#define MAX_NODENAME_LEN 100
#include <assert.h>
#include "tv.h"
#include "irgwalk.h"
#include "firm_types.h"
+#include "irdump_grgen.h"
typedef struct
static char *dump_grgen_mode_node(ir_mode *irn_mode, grgen_dumpinfo_t *dump_info, FILE *fp);
static void dump_grgen_eval(ir_node *n, grgen_dumpinfo_t *dump_info, FILE *fp);
static int dump_pattern(grgen_dumpinfo_t *dump_info, FILE *fp);
-static int get_indent(void);
static void set_indent(int i);
// Saves the current indent value and keeps spaces in a string
#define MAX_INDENT 100
static char indent[MAX_INDENT] = "";
-static int current_indent = 0;
// Saves the current node number to generate node names
static int node_counter;
irg_grgen_dumper_env_t *init_irg_grgen_dumper(char *file, int append)
{
- irg_grgen_dumper_env_t *grgen_dumper_env = malloc(sizeof(irg_grgen_dumper_env_t));
+ irg_grgen_dumper_env_t *const grgen_dumper_env = XMALLOC(irg_grgen_dumper_env_t);
FILE *fp;
if(append)
void deinit_irg_grgen_dumper(irg_grgen_dumper_env_t *grgen_dumper_env)
{
fclose(grgen_dumper_env->output_file);
- free(grgen_dumper_env);
+ xfree(grgen_dumper_env);
}
static void collect_nodes(ir_node *n, void * env)
* Starts dumping
************************************************************************/
-void dump_irg_grgen(ir_graph *irg, char *filename, int append)
+void dump_irg_grgen_file(ir_graph *irg, char *filename, int append)
{
FILE *fp;
grgen_dumpinfo_t dump_info;
}
+void dump_irg_grgen(ir_graph *irg, char *suffix)
+{
+ char filename[100] = "";
+
+ strncat(filename, get_entity_name(get_irg_entity(irg)), sizeof(filename)-1);
+ strncat(filename, suffix, sizeof(filename)-1);
+ strncat(filename, ".grg", sizeof(filename)-1);
+
+ dump_irg_grgen_file(irg, filename, 0);
+}
+
+
/************************************************************************
* Dumps the left hand side of the rule
************************************************************************/
int uses_memory = 0;
// Dump all nodes
- pmap_foreach(nodes_to_dump, entry)
+ foreach_pmap(nodes_to_dump, entry)
{
ir_node *n = (ir_node *) entry->key;
// Dump node
- if(get_irn_opcode(n) == iro_Proj && get_irn_modecode(n) == irm_M)
+ if(get_irn_opcode(n) == iro_Proj && get_irn_mode(n) == mode_M)
uses_memory = 1;
dump_grg_node(n, dump_info, fp);
dump_grgen_mode(n, dump_info, fp, NULL);
}
// Dump all edges
- pmap_foreach(nodes_to_dump, entry)
+ foreach_pmap(nodes_to_dump, entry)
{
ir_node *n = (ir_node *) entry->key;
int i;
// Dump edges
- for(i = -1; i < get_irn_arity(n); i++)
+ for(i = is_Block(n) ? 0 : -1; i < get_irn_arity(n); i++)
dump_grg_egde(n, i, dump_info, fp);
}
fprintf(fp, "%seval {\n", indent);
set_indent(6);
- pmap_foreach(nodes_to_dump, entry)
+ foreach_pmap(nodes_to_dump, entry)
{
ir_node *n = (ir_node *) entry->key;
dump_grgen_eval(n, dump_info, fp);
// Else generate new node name and dump the node
- node_name = obstack_alloc(&(dump_info -> node_names), MAX_NODENAME_LEN);
+ node_name = OALLOCN(&dump_info->node_names, char, MAX_NODENAME_LEN);
- sprintf(node_name, "%s%d", get_op_name(get_irn_op(n)), get_irn_node_nr(n));
+ sprintf(node_name, "%s%ld", get_op_name(get_irn_op(n)), get_irn_node_nr(n));
fprintf(fp, "%s%s : %s;\n", indent, node_name, get_op_name(get_irn_op(n)));
pmap_insert(dump_info -> node_name_map, n, node_name);
if((nodes_edge_names = pmap_get(dump_info -> edge_name_map, n)) == NULL)
{
- nodes_edge_names = (char **) obstack_alloc(&(dump_info->node_names), (get_irn_arity(n) + 1) * sizeof(char *));
- memset(nodes_edge_names, 0, (get_irn_arity(n) + 1) * sizeof(char *));
+ size_t const count = get_irn_arity(n) + 1;
+ nodes_edge_names = OALLOCNZ(&dump_info->node_names, char*, count);
pmap_insert(dump_info->edge_name_map, n, nodes_edge_names);
}
char edge_name[50], *edge_name_obst;
sprintf(edge_name, "pos%d_%d", n_edge + 1, edge_counter++);
- edge_name_obst = obstack_alloc(&(dump_info->node_names), strlen(edge_name) + 1);
+ edge_name_obst = OALLOCN(&dump_info->node_names, char, strlen(edge_name) + 1);
strcpy(edge_name_obst, edge_name);
nodes_edge_names[n_edge + 1] = edge_name_obst;
if(pmap_get(dump_info->mode_edge_map, n) == NULL)
{
- char *edge_name_obst = obstack_alloc(&(dump_info->node_names), strlen(edge_name) + 1);
+ char *edge_name_obst = OALLOCN(&dump_info->node_names, char, strlen(edge_name) + 1);
strcpy(edge_name_obst, edge_name);
pmap_insert(dump_info->mode_edge_map, n, edge_name_obst);
}
static char *dump_grgen_mode_node(ir_mode *irn_mode, grgen_dumpinfo_t *dump_info, FILE *fp)
{
- modecode mode_code = get_mode_modecode(irn_mode);
const char *mode_name = get_mode_name(irn_mode);
char *mode_node_name;
- if(!pmap_contains(dump_info -> mode_name_map, (void *) mode_code))
+ if(!pmap_contains(dump_info -> mode_name_map, irn_mode))
{
// No, create a new mode-node
- mode_node_name = obstack_alloc(&(dump_info -> mode_names), MAX_NODENAME_LEN);
+ mode_node_name = OALLOCN(&dump_info->mode_names, char, MAX_NODENAME_LEN);
sprintf(mode_node_name, "mode_%s_node", mode_name);
- pmap_insert(dump_info -> mode_name_map, (void *) mode_code, mode_node_name);
+ pmap_insert(dump_info -> mode_name_map, irn_mode, mode_node_name);
fprintf(fp, "%s%s : Mode_%s;\n", indent, mode_node_name, mode_name);
return(mode_node_name);
}
else
{
- return((char *) pmap_get(dump_info -> mode_name_map, (void *) mode_code));
+ return((char *) pmap_get(dump_info -> mode_name_map, irn_mode));
}
}
if(code == iro_Const)
{
node_name = pmap_get(dump_info->node_name_map, n);
- fprintf(fp, "%s%s.value = \"%d\";\n", indent, node_name, get_tarval_long(get_Const_tarval(n)));
+ fprintf(fp, "%s%s.value = \"%ld\";\n", indent, node_name, get_tarval_long(get_Const_tarval(n)));
}
if(code == iro_Proj)
{
node_name = pmap_get(dump_info->node_name_map, n);
- fprintf(fp, "%s%s.proj = %d;\n", indent, node_name, get_Proj_proj(n));
+ fprintf(fp, "%s%s.proj = %ld;\n", indent, node_name, get_Proj_proj(n));
}
/*if(code == iro_Block)
// Correlate the matched phi edges with the matched block edges
// Caution: Position 0 in the edge_names array is the block edge, so start at 1
- for(i = 0; i < get_irn_arity(n) + 1; i++)
+ for(i = code == iro_Block; i < get_irn_arity(n) + 1; i++)
{
assert(edge_names[i] != NULL && "Some edges have not been dumped!");
for(j = 0; j < i; j++)
indent[j] = ' ';
indent[j] = 0x0;
- current_indent = i;
}
}
-
-
-
-/************************************************************************
-* Gets current indent value
-************************************************************************/
-
-static int get_indent(void)
-{
- return(current_indent);
-}
-
-
-/************************************************************************
-* Collects all nodes of a ir graph, so that the ir graph can be
-* dumped completely
-************************************************************************/
projects / libfirm / blobdiff