+ 3. Insert the new values into the workset
+ */
+ for (i = 0; i < demand; ++i)
+ workset_insert(env, env->ws, to_insert[i]);
+}
+
+static void belady(ir_node *block, void *env);
+
+static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, ir_node *node, ir_node *block, ir_loop *loop) {
+ be_next_use_t next_use;
+ loc_t loc;
+ loc.time = USES_INFINITY;
+
+ if (!arch_irn_consider_in_reg_alloc(env->arch, env->cls, node)) {
+ loc.time = USES_INFINITY;
+ return loc;
+ }
+
+ loc.irn = node;
+
+ /* We have to keep nonspillable nodes in the workingset */
+ if(arch_irn_get_flags(env->arch, node) & arch_irn_flags_dont_spill) {
+ loc.time = 0;
+ DBG((dbg, DBG_START, " %+F taken (dontspill node)\n", node, loc.time));
+ return loc;
+ }
+
+ next_use = be_get_next_use(env->uses, first, 0, node, 0);
+ if(USES_IS_INFINITE(next_use.time)) {
+ // the nodes marked as live in shouldn't be dead, so it must be a phi
+ loc.time = USES_INFINITY;
+ DBG((dbg, DBG_START, " %+F not taken (dead)\n", node));
+ assert(is_Phi(node));
+ return loc;
+ }
+
+ loc.time = next_use.time;
+
+ if(next_use.outermost_loop >= get_loop_depth(loop)) {
+ DBG((dbg, DBG_START, " %+F taken (%u, loop %d)\n", node, loc.time, next_use.outermost_loop));
+ return loc;
+ // ARR_APP1(loc_t, starters, loc);
+ } else {
+ loc.time = USES_INFINITY;
+ DBG((dbg, DBG_START, " %+F not taken (outerloopdepth %d < loopdetph %d)\n", node, next_use.outermost_loop, get_loop_depth(loop)));
+ return loc;
+ }
+}
+
+/*
+ * Computes set of live-ins for each block with multiple predecessors
+ * and notifies spill algorithm which phis need to be spilled
+ */
+static void compute_live_ins(ir_node *block, void *data) {
+ belady_env_t *env = data;
+ block_info_t *block_info;
+ ir_node *first, *irn;
+ loc_t loc, *starters;
+ int i, len, ws_count;
+ ir_loop *loop = get_irn_loop(block);
+ be_lv_t *lv = env->cenv->birg->lv;
+
+ if(get_Block_n_cfgpreds(block) == 1 && get_irg_start_block(get_irn_irg(block)) != block)
+ return;
+
+ block_info = new_block_info(&env->ob);
+ set_block_info(block, block_info);
+
+ /* Collect all values living at start of block */
+ starters = NEW_ARR_F(loc_t, 0);
+
+ /* rebuild schedule time information, because it seems to be broken */
+ // Matze: is this still true?
+ //sched_renumber(block);
+
+ DBG((dbg, DBG_START, "Living at start of %+F:\n", block));
+ first = sched_first(block);
+
+ sched_foreach(block, irn) {
+ if(!is_Phi(irn))
+ break;
+
+ loc = to_take_or_not_to_take(env, first, irn, block, loop);
+
+ if(!USES_IS_INFINITE(loc.time)) {
+ ARR_APP1(loc_t, starters, loc);
+ } else {
+ be_spill_phi(env->senv, irn);
+ }
+ }
+
+ be_lv_foreach(lv, block, be_lv_state_in, i) {
+ ir_node *node = be_lv_get_irn(lv, block, i);
+
+ loc = to_take_or_not_to_take(env, first, node, block, loop);
+
+ if(!USES_IS_INFINITE(loc.time)) {
+ ARR_APP1(loc_t, starters, loc);
+ }
+ }
+
+ // Sort start values by first use
+ qsort(starters, ARR_LEN(starters), sizeof(starters[0]), loc_compare);
+
+ /* Copy the best ones from starters to start workset */
+ ws_count = MIN(ARR_LEN(starters), env->n_regs);
+ block_info->ws_start = new_workset(env, &env->ob);
+ workset_bulk_fill(block_info->ws_start, ws_count, starters);
+
+ /* The phis of this block which are not in the start set have to be spilled later. */
+ len = ARR_LEN(starters);
+ for (i = ws_count; i < len; ++i) {
+ irn = starters[i].irn;
+ if (!is_Phi(irn) || get_nodes_block(irn) != block)
+ continue;
+
+ be_spill_phi(env->senv, irn);
+ }
+
+ DEL_ARR_F(starters);