#else
/**
- * This function searches linearily for the node in the array.
+ * This function searches linearly for the node in the array.
*/
static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
unsigned n = arr[0].u.head.n_members;
{
int problem_found = 0;
+ assure_doms(irg);
irg_walk_graph(irg, dom_check, NULL, &problem_found);
return !problem_found;
pset *be_liveness_transfer(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, pset *live)
{
int i, n;
- ir_node *x;
FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
DEBUG_ONLY(
+ const ir_node *x;
DBG((dbg, LEVEL_1, "%+F\n", irn));
for(x = pset_first(live); x; x = pset_next(live))
DBG((dbg, LEVEL_1, "\tlive: %+F\n", x));