DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
+/* see comment in compute_liveness() */
+#define LV_COMPUTE_SORTED
#define LV_STD_SIZE 64
#define LV_USE_BINARY_SEARCH
#undef LV_INTESIVE_CHECKS
static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old)
{
struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
+ (void) irn;
+
memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
info[0].u.head.n_size = LV_STD_SIZE - 1;
return info;
}
+static void collect_nodes(ir_node *irn, void *data)
+{
+ struct obstack *obst = data;
+ if (is_liveness_node(irn))
+ obstack_ptr_grow(obst, irn);
+}
+
+static int node_idx_cmp(const void *a, const void *b)
+{
+ int ia = get_irn_idx(a);
+ int ib = get_irn_idx(b);
+ return ia - ib;
+}
+
static void compute_liveness(be_lv_t *lv)
{
+ struct obstack obst;
struct _lv_walker_t w;
+ ir_node **nodes;
+ int i, n;
+
+ obstack_init(&obst);
+ irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
+ n = obstack_object_size(&obst) / sizeof(nodes[0]);
+ nodes = obstack_finish(&obst);
+
+ /*
+ * inserting the variables sorted by their ID is probably
+ * more efficient since the binary sorted set insertion
+ * will not need to move arounf the data.
+ * However, if sorting the variables a priori pays off
+ * needs to be checked, hence the define.
+ */
+#ifdef LV_COMPUTE_SORTED
+ qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
+#endif
+
w.lv = lv;
- w.data = bitset_malloc(get_irg_last_idx(lv->irg));
- irg_walk_graph(lv->irg, liveness_for_node, NULL, &w);
- bitset_free(w.data);
+ w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
+
+ for (i = 0; i < n; ++i)
+ liveness_for_node(nodes[i], &w);
+
+ obstack_free(&obst, NULL);
+ register_hook(hook_node_info, &lv->hook_info);
+}
+
+void be_liveness_assure_sets(be_lv_t *lv)
+{
+ if (!lv->nodes) {
+ lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
+ phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
+ compute_liveness(lv);
+ }
+}
+
+void be_liveness_assure_chk(be_lv_t *lv)
+{
+#ifndef USE_LIVE_CHK
+ be_liveness_assure_sets(be_lv_t *lv);
+#endif
+}
+
+void be_liveness_invalidate(be_lv_t *lv)
+{
+ if (lv && lv->nodes) {
+ unregister_hook(hook_node_info, &lv->hook_info);
+ phase_free(&lv->ph);
+ bitset_free(lv->nodes);
+ lv->nodes = NULL;
+ }
}
/* Compute the inter block liveness for a graph. */
memset(lv, 0, sizeof(lv[0]));
lv->irg = irg;
- lv->nodes = bitset_malloc(2 * get_irg_last_idx(irg));
+ lv->lvc = lv_chk_new(irg);
lv->hook_info.context = lv;
lv->hook_info.hook._hook_node_info = lv_dump_block;
- register_hook(hook_node_info, &lv->hook_info);
- phase_init(&lv->ph, "liveness", irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
- compute_liveness(lv);
return lv;
}
void be_liveness_free(be_lv_t *lv)
{
- unregister_hook(hook_node_info, &lv->hook_info);
- phase_free(&lv->ph);
- bitset_free(lv->nodes);
+ be_liveness_invalidate(lv);
free(lv);
}
void be_liveness_remove(be_lv_t *lv, ir_node *irn)
{
- unsigned idx = get_irn_idx(irn);
- struct _lv_walker_t w;
+ if (lv->nodes) {
+ unsigned idx = get_irn_idx(irn);
+ struct _lv_walker_t w;
- /*
- * Removes a single irn from the liveness information.
- * Since an irn can only be live at blocks dominated by the block of its
- * definition, we only have to process that dominance subtree.
- */
- w.lv = lv;
- w.data = irn;
- dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
- if(idx < bitset_size(lv->nodes))
- bitset_clear(lv->nodes, idx);
+ /*
+ * Removes a single irn from the liveness information.
+ * Since an irn can only be live at blocks dominated by the block of its
+ * definition, we only have to process that dominance subtree.
+ */
+ w.lv = lv;
+ w.data = irn;
+ dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
+ if(idx < bitset_size(lv->nodes))
+ bitset_clear(lv->nodes, idx);
+ }
}
void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
{
- struct _lv_walker_t w;
- w.lv = lv;
- w.data = bitset_malloc(get_irg_last_idx(lv->irg));
- liveness_for_node(irn, &w);
- bitset_free(w.data);
+ if (lv->nodes) {
+ struct _lv_walker_t w;
+ w.lv = lv;
+ w.data = bitset_malloc(get_irg_last_idx(lv->irg));
+ liveness_for_node(irn, &w);
+ bitset_free(w.data);
+ }
}
void be_liveness_update(be_lv_t *lv, ir_node *irn)
be_liveness_introduce(lv, irn);
}
-static void lv_add_missing_walker(ir_node *irn, void *data)
-{
- struct _lv_walker_t *w = data;
- if(!is_Block(irn) && !bitset_contains_irn(w->lv->nodes, irn)) {
- liveness_for_node(irn, w);
- }
-}
-
-void be_liveness_add_missing(be_lv_t *lv)
-{
- struct _lv_walker_t w;
- w.lv = lv;
- w.data = bitset_malloc(get_irg_last_idx(lv->irg));
- irg_walk_graph(lv->irg, lv_add_missing_walker, NULL, &w);
- bitset_free(w.data);
-}
-
static void lv_check_walker(ir_node *bl, void *data)
{
struct _lv_walker_t *w = data;
pset *be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *bl, pset *live)
{
int i;
+ assert(lv->nodes && "live sets must be computed");
be_lv_foreach(lv, bl, be_lv_state_end, i) {
ir_node *irn = be_lv_get_irn(lv, bl, i);
if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
{
int i;
+ assert(lv->nodes && "live sets must be computed");
be_lv_foreach(lv, block, be_lv_state_end, i) {
ir_node *node = be_lv_get_irn(lv, block, i);
if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
ir_node *irn;
+ assert(lv->nodes && "live sets must be computed");
be_liveness_end_of_block(lv, arch_env, cls, bl, live);
sched_foreach_reverse(bl, irn) {
be_liveness_transfer(arch_env, cls, irn, live);
obstack_ptr_grow(obst, irn);
}
-void be_live_chk_compare(be_irg_t *birg)
+void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
{
- ir_graph *irg = be_get_birg_irg(birg);
+ ir_graph *irg = lv->irg;
struct obstack obst;
ir_node **nodes;
ir_node **blocks;
- be_lv_t *lv;
- lv_chk_t *lvc;
int i, j;
- be_assure_liveness(birg);
- be_assure_liveness_chk(birg);
- lv = be_get_birg_liveness(birg);
- lvc = be_get_birg_liveness_chk(birg);
-
obstack_init(&obst);
irg_block_walk_graph(irg, collect_node, NULL, &obst);
projects / libfirm / blobdiff