#include "array.h"
#include "pdeq.h"
-
+#include "beirg.h"
#include "iredges.h"
#include "irgwalk.h"
#include "irnode_t.h"
struct blocksched_env_t {
ir_graph *irg;
struct obstack *obst;
- ir_exec_freq *execfreqs;
edge_t *edges;
pdeq *worklist;
int blockcount;
} else if (arity == 1) {
ir_node *pred_block = get_Block_cfgpred_block(block, 0);
ir_loop *pred_loop = get_irn_loop(pred_block);
- float freq = (float)get_block_execfreq(env->execfreqs, block);
+ float freq = (float)get_block_execfreq(block);
/* is it an edge leaving a loop */
if (get_loop_depth(pred_loop) > get_loop_depth(loop)) {
- float pred_freq = (float)get_block_execfreq(env->execfreqs, pred_block);
+ float pred_freq = (float)get_block_execfreq(pred_block);
edge.outedge_penalty_freq = -(pred_freq - freq);
}
double execfreq;
ir_node *pred_block = get_Block_cfgpred_block(block, i);
- execfreq = get_block_execfreq(env->execfreqs, pred_block);
+ execfreq = get_block_execfreq(pred_block);
edge.pos = i;
edge.execfreq = execfreq;
continue;
pred_block = get_Block_cfgpred_block(block, pos);
- entry = (blocksched_entry_t*)get_irn_link(block);
- pred_entry = (blocksched_entry_t*)get_irn_link(pred_block);
+ entry = get_blocksched_entry(block);
+ pred_entry = get_blocksched_entry(pred_block);
if (pred_entry->next != NULL || entry->prev != NULL)
continue;
continue;
pred_block = get_Block_cfgpred_block(block, pos);
- entry = (blocksched_entry_t*)get_irn_link(block);
- pred_entry = (blocksched_entry_t*)get_irn_link(pred_block);
+ entry = get_blocksched_entry(block);
+ pred_entry = get_blocksched_entry(pred_block);
if (pred_entry->next != NULL || entry->prev != NULL)
continue;
continue;
pred_block = get_Block_cfgpred_block(block, pos);
- entry = (blocksched_entry_t*)get_irn_link(block);
- pred_entry = (blocksched_entry_t*)get_irn_link(pred_block);
+ entry = get_blocksched_entry(block);
+ pred_entry = get_blocksched_entry(pred_block);
/* is 1 of the blocks already attached to another block? */
if (pred_entry->next != NULL || entry->prev != NULL)
/* we only need to put the first of a series of already connected
* blocks into the worklist */
- succ_entry = (blocksched_entry_t*)get_irn_link(succ_block);
+ succ_entry = get_blocksched_entry(succ_block);
while (succ_entry->prev != NULL) {
/* break cycles... */
if (succ_entry->prev->block == succ_block) {
foreach_block_succ(block, edge) {
ir_node *succ_block = get_edge_src_irn(edge);
- double execfreq;
if (irn_visited(succ_block))
continue;
- succ_entry = (blocksched_entry_t*)get_irn_link(succ_block);
+ succ_entry = get_blocksched_entry(succ_block);
if (succ_entry->prev != NULL)
continue;
- execfreq = get_block_execfreq(env->execfreqs, succ_block);
+ double execfreq = get_block_execfreq(succ_block);
if (execfreq > best_succ_execfreq) {
best_succ_execfreq = execfreq;
succ = succ_block;
} while (irn_visited(succ));
}
- succ_entry = (blocksched_entry_t*)get_irn_link(succ);
+ succ_entry = get_blocksched_entry(succ);
entry->next = succ_entry;
succ_entry->prev = entry;
{
ir_graph *irg = env->irg;
ir_node *startblock = get_irg_start_block(irg);
- blocksched_entry_t *entry = (blocksched_entry_t*)get_irn_link(startblock);
+ blocksched_entry_t *entry = get_blocksched_entry(startblock);
ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
inc_irg_visited(irg);
return block_list;
}
-static ir_node **create_block_schedule_greedy(ir_graph *irg, ir_exec_freq *execfreqs)
+static ir_node **create_block_schedule_greedy(ir_graph *irg)
{
blocksched_env_t env;
struct obstack obst;
env.irg = irg;
env.obst = &obst;
- env.execfreqs = execfreqs;
env.edges = NEW_ARR_F(edge_t, 0);
env.worklist = NULL;
env.blockcount = 0;
arity = get_irn_arity(block);
if (arity == 1) {
- double execfreq = get_block_execfreq(env->env.execfreqs, block);
+ double execfreq = get_block_execfreq(block);
add_ilp_edge(block, 0, execfreq, env);
}
else {
ilp_edge_t *edge;
ir_node *pred_block = get_Block_cfgpred_block(block, i);
- execfreq = get_block_execfreq(env->env.execfreqs, pred_block);
+ execfreq = get_block_execfreq(pred_block);
edgenum = add_ilp_edge(block, i, execfreq, env);
edge = &env->ilpedges[edgenum];
lpp_set_factor_fast(env->lpp, cst_idx, edge->ilpvar, 1.0);
}
}
-static ir_node **create_block_schedule_ilp(ir_graph *irg, ir_exec_freq *execfreqs)
+static ir_node **create_block_schedule_ilp(ir_graph *irg)
{
blocksched_ilp_env_t env;
struct obstack obst;
env.env.irg = irg;
env.env.obst = &obst;
- env.env.execfreqs = execfreqs;
env.env.worklist = NULL;
env.env.blockcount = 0;
env.ilpedges = NEW_ARR_F(ilp_edge_t, 0);
ir_node **be_create_block_schedule(ir_graph *irg)
{
- ir_exec_freq *execfreqs = be_get_irg_exec_freq(irg);
-
switch (algo) {
case BLOCKSCHED_GREEDY:
case BLOCKSCHED_NAIV:
- return create_block_schedule_greedy(irg, execfreqs);
+ return create_block_schedule_greedy(irg);
case BLOCKSCHED_ILP:
- return create_block_schedule_ilp(irg, execfreqs);
+ return create_block_schedule_ilp(irg);
}
panic("unknown blocksched algo");