* Chordal register allocation.
* @author Sebastian Hack
* @date 8.12.2004
+ *
+ * Copyright (C) Universitaet Karlsruhe
+ * Released under the GPL
*/
+
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "bechordal_t.h"
#include "bearch.h"
-#undef BUILD_GRAPH
-#define DUMP_INTERVALS
+#define BUILD_GRAPH
+#undef DUMP_INTERVALS
#undef DUMP_PRESSURE
-#define DUMP_IFG
+#undef DUMP_IFG
#if defined(DUMP_IFG) && !defined(BUILD_GRAPH)
#define BUILD_GRAPH
struct obstack obst; /**< An obstack for temporary storage. */
ir_graph *irg; /**< The graph the reg alloc is running on. */
#ifdef BUILD_GRAPH
- set *graph; /**< The interference graph. */
+ set *nodes; /**< The interference graph nodes. */
+ set *edges; /**< The interference graph edges. */
#endif
bitset_t *live; /**< A liveness bitset. */
bitset_t *colors; /**< The color mask. */
bitset_t *in_colors; /**< Colors used by live in values. */
int colors_n; /**< The number of colors. */
- const arch_isa_if_t *isa; /**< The isa interface. */
+ const arch_env_t *arch_env; /**< The arch interface environment. */
const arch_register_class_t *cls; /**< The current register class. */
void *data; /**< Some pointer, to which different
phases can attach data to. */
#ifdef BUILD_GRAPH
#define IF_EDGE_HASH(e) ((e)->src)
+#define IF_NODE_HASH(n) ((n)->nnr)
static int if_edge_cmp(const void *p1, const void *p2, size_t size)
{
return !(e1->src == e2->src && e1->tgt == e2->tgt);
}
+static int if_node_cmp(const void *p1, const void *p2, size_t size)
+{
+ const if_node_t *n1 = p1;
+ const if_node_t *n2 = p2;
+
+ return n1->nnr != n2->nnr;
+}
+
static INLINE if_edge_t *edge_init(if_edge_t *edge, int src, int tgt)
{
/* Bring the smaller entry to src. */
static INLINE void add_if(const env_t *env, int src, int tgt)
{
if_edge_t edge;
+ if_node_t node, *src_node, *tgt_node;
+ /* insert edge */
edge_init(&edge, src, tgt);
- set_insert(env->graph, &edge, sizeof(edge), IF_EDGE_HASH(&edge));
+ set_insert(env->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge));
+
+ /* insert nodes */
+ node.nnr = src;
+ node.neighb = pset_new_ptr(8);
+ src_node = set_insert(env->nodes, &node, sizeof(node), IF_NODE_HASH(&node));
+ node.nnr = tgt;
+ node.neighb = pset_new_ptr(8);
+ tgt_node = set_insert(env->nodes, &node, sizeof(node), IF_NODE_HASH(&node));
+
+ /* insert neighbors into nodes */
+ pset_insert_ptr(src_node->neighb, tgt_node);
+ pset_insert_ptr(tgt_node->neighb, src_node);
}
static INLINE int are_connected(const env_t *env, int src, int tgt)
{
if_edge_t edge;
edge_init(&edge, src, tgt);
- return set_find(env->graph, &edge, sizeof(edge), IF_EDGE_HASH(&edge)) != NULL;
+ return set_find(env->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge)) != NULL;
+}
+
+int ifg_has_edge(const ir_graph *irg, if_node_t *n1, if_node_t* n2) {
+ return are_connected(get_irg_ra_link(irg), n1->nnr, n2->nnr);
}
static void dump_ifg(ir_graph *irg, set *edges, const char *filename)
#endif /* BUILD_GRAPH */
+
/**
* Add an interval border to the list of a block's list
* of interval border.
pset *live_in = get_live_in(block);
pset *live_end = get_live_end(block);
const arch_register_class_t *cls = env->cls;
- const arch_isa_if_t *isa = env->isa;
DBG((dbg, LEVEL_1, "Computing pressure in block %n\n", block));
bitset_clear_all(live);
for(irn = pset_first(live_end); irn; irn = pset_next(live_end)) {
DBG((dbg, LEVEL_3, "\tMaking live: %n/%d\n", irn, get_irn_graph_nr(irn)));
bitset_set(live, get_irn_graph_nr(irn));
- if(arch_isa_irn_has_reg_class(isa, irn, cls))
+ if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls))
border_use(irn, step, 0);
}
* If the node defines some value, which can put into a
* register of the current class, make a border for it.
*/
- if(arch_isa_irn_has_reg_class(isa, irn, cls)) {
+ if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
bitset_pos_t elm;
int nr = get_irn_graph_nr(irn);
for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
- if(arch_isa_irn_has_reg_class(isa, op, cls)) {
+ if(arch_irn_has_reg_class(env->arch_env, op, 0, cls)) {
int nr = get_irn_graph_nr(op);
DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %n\n", i, op));
* Add initial defs for all values live in.
*/
for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) {
- if(arch_isa_irn_has_reg_class(isa, irn, cls)) {
+ if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
/* Mark the value live in. */
bitset_set(live, get_irn_graph_nr(irn));
bitset_t *live = env->live;
bitset_t *colors = env->colors;
bitset_t *in_colors = env->in_colors;
- const arch_isa_if_t *isa = env->isa;
const arch_register_class_t *cls = env->cls;
- /* The used colors will remain on the obstack. */
- bitset_t *used_colors = bitset_obstack_alloc(obst, env->colors_n);
-
/* Mark the obstack level and allocate the temporary tmp_colors */
void *obstack_level = obstack_base(obst);
/*bitset_t *tmp_colors = bitset_obstack_alloc(obst, env->colors_n);*/
* allocated before), we have to mark their colors as used also.
*/
for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) {
- if(arch_isa_irn_has_reg_class(isa, irn, cls)) {
- int col = get_irn_color(irn);
+ if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
+ const arch_register_t *reg = arch_get_irn_register(env->arch_env, irn, 0);
+ int col;
+
+ assert(reg && "Nodfe must have been assigned a register");
+ col = arch_register_get_index(reg);
/* Mark the color of the live in value as used. */
- assert(is_color(col) && "Node must have been assigned a color.");
bitset_set(colors, col);
bitset_set(in_colors, col);
- bitset_set(used_colors, col);
/* Mark the value live in. */
bitset_set(live, get_irn_graph_nr(irn));
* will work.
*/
list_for_each_entry_reverse(border_t, b, head, list) {
- const ir_node *irn = b->irn;
+ ir_node *irn = b->irn;
int nr = get_irn_graph_nr(irn);
/*
* color.
*/
if(b->is_def && !is_live_in(block, irn)) {
- ra_node_info_t *ri = get_ra_node_info(irn);
+ const arch_register_t *reg;
int col = NO_COLOR;
DBG((dbg, LEVEL_4, "\tcolors in use: %b\n", colors));
- /*
- * Try to assign live out values colors which are not used by live
- * in values.
- */
-#if 0
- if(is_live_out(block, irn)) {
- int next_clear;
-
- bitset_copy(tmp_colors, colors);
- bitset_or(tmp_colors, in_colors);
- next_clear = bitset_next_clear(tmp_colors, 0);
- col = next_clear != -1 ? next_clear : NO_COLOR;
-
- DBG((dbg, LEVEL_5, "next clear in only outs %b: %d\n", tmp_colors, col));
- }
-#endif
+ col = bitset_next_clear(colors, 0);
+ reg = arch_register_for_index(env->cls, col);
- /* If a color is not yet assigned, do it now. */
- if(!is_color(col))
- col = bitset_next_clear(colors, 0);
-
- assert(!is_color(get_irn_color(irn)) && "Color must not have assigned");
- assert(!bitset_is_set(live, nr) && "Value def must not have been encountered");
+ assert(arch_get_irn_register(env->arch_env, irn, 0) == NULL
+ && "This node must not have been assigned a register yet");
+ assert(!bitset_is_set(live, nr) && "Value's definition must not have been encountered");
bitset_set(colors, col);
- bitset_set(used_colors, col);
bitset_set(live, nr);
- ri->color = col;
-
- DBG((dbg, LEVEL_1, "\tassigning color %d to %n\n", col, irn));
+ arch_set_irn_register(env->arch_env, irn, 0, reg);
+ DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %n\n",
+ arch_register_get_name(reg), col, irn));
}
/* Clear the color upon a use. */
else if(!b->is_def) {
- int col = get_irn_color(irn);
+ const arch_register_t *reg = arch_get_irn_register(env->arch_env, irn, 0);
+ int col;
+ assert(reg && "Register must have been assigned");
+
+ col = arch_register_get_index(reg);
assert(bitset_is_set(live, nr) && "Cannot have a non live use");
- assert(is_color(col) && "A color must have been assigned");
bitset_clear(colors, col);
bitset_clear(live, nr);
}
}
-#ifdef DUMP_PRESSURE
- {
- char buf[128];
- FILE *f;
-
- ir_snprintf(buf, sizeof(buf), "pres_%s_bl_%N.txt",
- get_entity_name(get_irg_entity(irg)), block);
-
- if((f = fopen(buf, "wt")) != NULL) {
- sched_foreach_reverse(block, irn) {
- if(arch_isa_irn_has_reg_class(isa, irn, cls))
- ir_fprintf(f, "\"%n\" %d %d\n", irn, sched_get_time_step(irn),
- get_ra_node_info(irn)->pressure);
-
- }
- fclose(f);
- }
- }
-#endif
-
-
- /*
- * Allocate the used colors array in the blocks ra info structure and
- * fill it.
- */
- get_ra_block_info(block)->used_colors = used_colors;
-
/* Free the auxillary data on the obstack. */
obstack_free(obst, obstack_level);
}
void be_ra_chordal_init(void)
{
dbg = firm_dbg_register(DBG_BERA);
- firm_dbg_set_mask(dbg, -1);
+ firm_dbg_set_mask(dbg, 0);
}
void be_ra_chordal(ir_graph *irg,
- const arch_isa_if_t *isa,
+ const arch_env_t *arch_env,
const arch_register_class_t *cls)
{
int node_count = get_graph_node_count(irg);
obstack_init(&env->obst);
#ifdef BUILD_GRAPH
- env->graph = new_set(if_edge_cmp, node_count);
+ env->edges = new_set(if_edge_cmp, node_count);
+ env->nodes = new_set(if_node_cmp, node_count);
#endif
env->live = bitset_obstack_alloc(&env->obst, node_count);
env->in_colors = bitset_obstack_alloc(&env->obst, colors_n);
env->colors_n = colors_n;
env->cls = cls;
- env->isa = isa;
+ env->arch_env = arch_env;
env->irg = irg;
/* First, determine the pressure */
char buf[128];
ir_snprintf(buf, sizeof(buf), "ifg_%F.dot", irg);
- dump_ifg(irg, env->graph, buf);
+ dump_ifg(irg, env->edges, buf);
}
#endif
env_t *env = get_irg_ra_link(irg);
#ifdef BUILD_GRAPH
- free(env->graph);
+ {
+ if_node_t *ifn;
+ for(ifn = set_first(env->nodes); ifn; ifn = set_next(env->nodes))
+ free(ifn->neighb);
+ free(env->nodes);
+ free(env->edges);
+ }
#endif
obstack_free(&env->obst, NULL);
}
#ifdef BUILD_GRAPH
+/** TODO remove this
+ * Deprecated. Use be_ra_get_ifg_edges instead.
+ */
set *be_ra_get_ifg(ir_graph *irg) {
- return ((env_t *)get_irg_ra_link(irg))->graph;
+ return ((env_t *)get_irg_ra_link(irg))->edges;
}
+
+set *be_ra_get_ifg_edges(ir_graph *irg) {
+ return ((env_t *)get_irg_ra_link(irg))->edges;
+}
+
+set *be_ra_get_ifg_nodes(ir_graph *irg) {
+ return ((env_t *)get_irg_ra_link(irg))->nodes;
+}
+
#endif
projects / libfirm / blobdiff