for (i = get_irn_arity(irn) - 1; i >= 0; i--) {
ir_node *in = get_irn_n(irn, i);
- if (! be_is_live_end(env->liveness, block, in) && /* if the value lives outside of block: do not count */
- mode_is_datab(get_irn_mode(in)) && /* must be data node */
- ! arch_irn_is(env->arch_env, in, ignore)) /* ignore "ignore" nodes :) */
+ if (mode_is_datab(get_irn_mode(in)) && /* must be data node */
+ ! arch_irn_is(env->arch_env, in, ignore) && /* ignore "ignore" nodes :) */
+ ! be_is_live_end(env->liveness, block, in) /* if the value lives outside of block: do not count */
+
+ ) {
num_in++;
+ }
}
return num_out - num_in;
return graph_env;
}
-static const list_sched_selector_t muchnik_selector_struct = {
+const list_sched_selector_t muchnik_selector = {
muchnik_init_graph,
muchnik_init_block,
muchnik_select,
trace_free /* finish_graph */
};
-const list_sched_selector_t *muchnik_selector = &muchnik_selector_struct;
-
/**
* Execute the heuristic function.
*/
return cand;
}
-static const list_sched_selector_t heuristic_selector_struct = {
+const list_sched_selector_t heuristic_selector = {
muchnik_init_graph,
muchnik_init_block,
heuristic_select,
NULL, /* finish_block */
trace_free /* finish_graph */
};
-
-const list_sched_selector_t *heuristic_selector = &heuristic_selector_struct;