* @brief Implements a trace scheduler as presented in Muchnik[TM].
* @author Michael Beck
* @date 28.08.2006
- * @version $Id$
*/
#include "config.h"
env->curr_time = 0;
env->sched_info = NEW_ARR_F(trace_irn_t, nn);
- env->liveness = be_liveness(irg);
+ env->liveness = be_get_irg_liveness(irg);
FIRM_DBG_REGISTER(env->dbg, "firm.be.sched.trace");
- be_liveness_assure_chk(env->liveness);
+ be_assure_live_chk(irg);
memset(env->sched_info, 0, nn * sizeof(*(env->sched_info)));
return env;
static void trace_free(void *data)
{
trace_env_t *env = (trace_env_t*)data;
- be_liveness_free(env->liveness);
DEL_ARR_F(env->sched_info);
free(env);
}
/**
* The muchnik selector.
*/
-static ir_node *muchnik_select(void *block_env, ir_nodeset_t *ready_set, ir_nodeset_t *live_set)
+static ir_node *muchnik_select(void *block_env, ir_nodeset_t *ready_set)
{
trace_env_t *env = (trace_env_t*)block_env;
ir_nodeset_t mcands, ecands;
ir_nodeset_iterator_t iter;
sched_timestep_t max_delay = 0;
ir_node *irn;
- (void) live_set;
/* calculate the max delay of all candidates */
foreach_ir_nodeset(ready_set, irn, iter) {
/**
* Execute the heuristic function.
*/
-static ir_node *heuristic_select(void *block_env, ir_nodeset_t *ns, ir_nodeset_t *lv)
+static ir_node *heuristic_select(void *block_env, ir_nodeset_t *ns)
{
trace_env_t *trace_env = (trace_env_t*)block_env;
ir_node *irn, *cand = NULL;
int max_prio = INT_MIN;
int cur_prio = INT_MIN;
- int cur_pressure = ir_nodeset_size(lv);
- int reg_fact, cand_reg_fact;
+ int reg_fact;
ir_nodeset_iterator_t iter;
+ /* Note: register pressure calculation needs an overhaul, you need correct
+ * tracking for each register class indidually and weight by each class
+ int cur_pressure = ir_nodeset_size(lv); */
+ int cur_pressure = 1;
/* prefer instructions which can be scheduled early */
#define PRIO_TIME 3
int sign = rdiff < 0;
int chg = (rdiff < 0 ? -rdiff : rdiff) << PRIO_CHG_PRESS;
- /* reg_fact = chg << cur_pressure; */
reg_fact = chg * cur_pressure;
if (reg_fact < chg)
reg_fact = INT_MAX - 2;
if (cur_prio > max_prio) {
cand = irn;
max_prio = cur_prio;
- cand_reg_fact = reg_fact;
}
DBG((trace_env->dbg, LEVEL_4, "checked NODE %+F\n", irn));
be_list_sched_graph(irg, &heuristic_selector);
}
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trace);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trace)
void be_init_sched_trace(void)
{
be_register_scheduler("heur", sched_heuristic);