int be_ifg_connected(const be_ifg_t *ifg, const ir_node *a, const ir_node *b)
{
- return be_values_interfere(ifg->env->birg->lv, a, b);
+ be_lv_t *lv = be_get_irg_liveness(ifg->env->irg);
+ return be_values_interfere(lv, a, b);
}
static void nodes_walker(ir_node *bl, void *data)
{
- nodes_iter_t *it = data;
+ nodes_iter_t *it = (nodes_iter_t*)data;
struct list_head *head = get_block_border_head(it->env, bl);
border_t *b;
irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, iter);
obstack_ptr_grow(&iter->obst, NULL);
- iter->nodes = obstack_finish(&iter->obst);
+ iter->nodes = (ir_node**)obstack_finish(&iter->obst);
}
static inline void node_break(nodes_iter_t *it, int force)
static void find_neighbour_walker(ir_node *block, void *data)
{
- neighbours_iter_t *it = data;
+ neighbours_iter_t *it = (neighbours_iter_t*)data;
struct list_head *head = get_block_border_head(it->env, block);
+ be_lv_t *lv = be_get_irg_liveness(it->env->irg);
border_t *b;
int has_started = 0;
- if (!be_is_live_in(it->env->birg->lv, block, it->irn) && block != get_nodes_block(it->irn))
+ if (!be_is_live_in(lv, block, it->irn) && block != get_nodes_block(it->irn))
return;
foreach_border_head(head, b) {
static void get_blocks_dom_order(ir_node *blk, void *env)
{
- cliques_iter_t *it = env;
+ cliques_iter_t *it = (cliques_iter_t*)env;
obstack_ptr_grow(&it->ob, blk);
}
ir_node *irn;
/* fill the output buffer */
- for (irn = pset_first(it->living); irn != NULL;
- irn = pset_next(it->living)) {
+ for (irn = (ir_node*)pset_first(it->living); irn != NULL;
+ irn = (ir_node*)pset_next(it->living)) {
it->buf[count++] = irn;
}
it->cenv = ifg->env;
it->buf = buf;
it->n_blocks = obstack_object_size(&it->ob) / sizeof(void *);
- it->blocks = obstack_finish(&it->ob);
+ it->blocks = (ir_node**)obstack_finish(&it->ob);
it->blk = 0;
it->bor = NULL;
it->living = pset_new_ptr(2 * arch_register_class_n_regs(it->cenv->cls));
}
-static int int_component_stat(be_irg_t *birg, be_ifg_t *ifg)
+static int int_component_stat(ir_graph *irg, be_ifg_t *ifg)
{
int n_comp = 0;
nodes_iter_t nodes_it;
- bitset_t *seen = bitset_irg_malloc(birg->irg);
+ bitset_t *seen = bitset_irg_malloc(irg);
ir_node *n;
return n_comp;
}
-void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat)
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat)
{
nodes_iter_t nodes_it;
neighbours_iter_t neigh_it;
- bitset_t *nodes = bitset_irg_malloc(birg->irg);
+ bitset_t *nodes = bitset_irg_malloc(irg);
ir_node *n, *m;
memset(stat, 0, sizeof(stat[0]));
}
}
- stat->n_comps = int_component_stat(birg, ifg);
+ stat->n_comps = int_component_stat(irg, ifg);
bitset_free(nodes);
}