#include "bechordal_t.h"
#include "bejavacoal.h"
#include "benodesets.h"
+#include "bespilloptions.h"
+#include "bestatevent.h"
// only rematerialise when costs are less than REMAT_COST_LIMIT
// TODO determine a good value here...
-#define REMAT_COST_LIMIT 20
+#define REMAT_COST_LIMIT 10
typedef struct _reloader_t reloader_t;
const arch_env_t *arch_env;
const be_chordal_env_t *chordal_env;
struct obstack obst;
- set *spills; /**< all spill_info_t's, which must be placed */
- pset *mem_phis; /**< set of all special spilled phis. allocated and freed separately */
+ int spill_cost; /**< the cost of a single spill node */
+ int reload_cost; /**< the cost of a reload node */
+ set *spills; /**< all spill_info_t's, which must be placed */
+ pset *mem_phis; /**< set of all special spilled phis. allocated and freed separately */
DEBUG_ONLY(firm_dbg_module_t *dbg;)
};
return xx->spilled_node != yy->spilled_node;
}
+/**
+ * Returns spill info for a specific value (returns NULL if the info doesn't
+ * exist yet)
+ */
+static spill_info_t *find_spillinfo(const spill_env_t *env, ir_node *value) {
+ spill_info_t info;
+ int hash = nodeset_hash(value);
+
+ info.spilled_node = value;
+
+ return set_find(env->spills, &info, sizeof(info), hash);
+}
+
/**
* Returns spill info for a specific value (the value that is to be spilled)
*/
env->chordal_env = chordal_env;
env->arch_env = env->chordal_env->birg->main_env->arch_env;
env->mem_phis = pset_new_ptr_default();
+ // TODO, ask backend about costs...
+ env->spill_cost = 8;
+ env->reload_cost = 5;
obstack_init(&env->obst);
return env;
}
free(env);
}
-/**
+/*
* ____ _ ____ _ _
* | _ \| | __ _ ___ ___ | _ \ ___| | ___ __ _ __| |___
* | |_) | |/ _` |/ __/ _ \ | |_) / _ \ |/ _ \ / _` |/ _` / __|
spill_info_t *info;
reloader_t *rel;
- assert(sched_is_scheduled(before));
assert(arch_irn_consider_in_reg_alloc(env->arch_env, env->cls, to_spill));
info = get_spillinfo(env, to_spill);
ir_node *arg = get_irn_n(to_spill, i);
get_spillinfo(env, arg);
}
+
+#if 1
+ // hackery... sometimes the morgan algo spilled the value of a phi,
+ // the belady algo decides later to spill the whole phi, then sees the
+ // spill node and adds a reload for that spill node, problem is the
+ // reload gets attach to that same spill (and is totally unnecessary)
+ if(info->old_spill != NULL &&
+ (before == info->old_spill || value_dominates(before, info->old_spill))) {
+ printf("spilledphi hack was needed...\n");
+ before = sched_next(info->old_spill);
+ }
+#endif
}
rel = obstack_alloc(&env->obst, sizeof(rel[0]));
info->reloaders = rel;
}
-void be_add_reload_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos) {
+static ir_node *get_reload_insertion_point(ir_node *block, int pos) {
ir_node *predblock, *last;
/* simply add the reload to the beginning of the block if we only have 1 predecessor
*/
if(get_Block_n_cfgpreds(block) == 1) {
assert(!is_Phi(sched_first(block)));
- be_add_reload(env, to_spill, sched_first(block));
- return;
+ return sched_first(block);
}
/* We have to reload the value in pred-block */
last = sched_prev(last);
assert(!sched_is_end(last));
}
- assert(is_cfop(last));
+
+ if(!is_cfop(last)) {
+ ir_graph *irg = get_irn_irg(block);
+ ir_node *startblock = get_irg_start_block(irg);
+
+ last = sched_next(last);
+ // last node must be a cfop, only exception is the start block
+ assert(last == startblock);
+ }
// add the reload before the (cond-)jump
- be_add_reload(env, to_spill, last);
+ return last;
+}
+
+void be_add_reload_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos) {
+ ir_node *before = get_reload_insertion_point(block, pos);
+ be_add_reload(env, to_spill, before);
}
void be_spill_phi(spill_env_t *env, ir_node *node) {
// if we had a spill for the phi value before, then remove this spill from
// schedule, as we will remove it in the insert spill/reload phase
if(spill->spill != NULL && !is_Phi(spill->spill)) {
+ assert(spill->old_spill == NULL);
spill->old_spill = spill->spill;
spill->spill = NULL;
}
// rewire reloads from old_spill to phi
if(spillinfo->old_spill != NULL) {
const ir_edge_t *edge, *next;
- foreach_out_edge_safe(spillinfo->old_spill, edge, next) {
+ ir_node *old_spill = spillinfo->old_spill;
+
+ foreach_out_edge_safe(old_spill, edge, next) {
ir_node* reload = get_edge_src_irn(edge);
assert(be_is_Reload(reload) || is_Phi(reload));
set_irn_n(reload, get_edge_src_pos(edge), spillinfo->spill);
}
+ set_irn_n(old_spill, be_pos_Spill_frame, new_Bad());
+ set_irn_n(old_spill, be_pos_Spill_val, new_Bad());
+ //sched_remove(old_spill);
spillinfo->old_spill = NULL;
}
}
if(arg == get_irg_frame(env->chordal_env->irg))
return 1;
+ // hack for now (happens when command should be inserted at end of block)
+ if(is_Block(reloader)) {
+ return 0;
+ }
+
/* the following test does not work while spilling,
* because the liveness info is not adapted yet to the effects of the
* additional spills/reloads.
}
static int check_remat_conditions(spill_env_t *env, ir_node *spilled, ir_node *reloader) {
- int costs = check_remat_conditions_costs(env, spilled, reloader, 1);
+ int costs = check_remat_conditions_costs(env, spilled, reloader, 0);
return costs < REMAT_COST_LIMIT;
}
static ir_node *do_remat(spill_env_t *env, ir_node *spilled, ir_node *reloader) {
int i, arity;
ir_node *res;
- ir_node *bl = get_nodes_block(reloader);
+ ir_node *bl;
ir_node **ins;
+ if(is_Block(reloader)) {
+ bl = reloader;
+ } else {
+ bl = get_nodes_block(reloader);
+ }
+
ins = alloca(get_irn_arity(spilled) * sizeof(ins[0]));
for(i = 0, arity = get_irn_arity(spilled); i < arity; ++i) {
ir_node *arg = get_irn_n(spilled, i);
DBG((env->dbg, LEVEL_1, "Insert remat %+F before reloader %+F\n", res, reloader));
/* insert in schedule */
- assert(!is_Block(reloader));
sched_add_before(reloader, res);
return res;
}
+int be_get_reload_costs(spill_env_t *env, ir_node *to_spill, ir_node *before) {
+ spill_info_t *spill_info;
+
+ if(be_do_remats) {
+ // is the node rematerializable?
+ int costs = check_remat_conditions_costs(env, to_spill, before, 0);
+ if(costs < REMAT_COST_LIMIT)
+ return costs;
+ }
+
+ // do we already have a spill?
+ spill_info = find_spillinfo(env, to_spill);
+ if(spill_info != NULL && spill_info->spill != NULL)
+ return env->reload_cost;
+
+ return env->spill_cost + env->reload_cost;
+}
+
+int be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos) {
+ ir_node *before = get_reload_insertion_point(block, pos);
+ return be_get_reload_costs(env, to_spill, before);
+}
+
/*
* ___ _ ____ _ _
* |_ _|_ __ ___ ___ _ __| |_ | _ \ ___| | ___ __ _ __| |___
void be_insert_spills_reloads(spill_env_t *env) {
const arch_env_t *arch_env = env->arch_env;
spill_info_t *si;
+ int remats = 0;
+ int reloads = 0;
+ int spills = 0;
/* process each spilled node */
for(si = set_first(env->spills); si; si = set_next(env->spills)) {
for(rld = si->reloaders; rld; rld = rld->next) {
ir_node *new_val;
- if (check_remat_conditions(env, si->spilled_node, rld->reloader)) {
+ if (be_do_remats && check_remat_conditions(env, si->spilled_node, rld->reloader)) {
new_val = do_remat(env, si->spilled_node, rld->reloader);
+ remats++;
} else {
/* make sure we have a spill */
- spill_node(env, si);
+ if(si->spill == NULL) {
+ spill_node(env, si);
+ spills++;
+ }
- /* do a reload */
+ /* create a reload */
new_val = be_reload(arch_env, env->cls, rld->reloader, mode, si->spill);
+ reloads++;
}
DBG((env->dbg, LEVEL_1, " %+F of %+F before %+F\n", new_val, si->spilled_node, rld->reloader));
si->reloaders = NULL;
}
+ if(be_stat_ev_is_active()) {
+ be_stat_ev("spill_spills", spills);
+ be_stat_ev("spill_reloads", reloads);
+ be_stat_ev("spill_remats", remats);
+ }
+
be_remove_dead_nodes_from_schedule(env->chordal_env->irg);
be_liveness_recompute(env->chordal_env->lv);
}