X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespilldaemel.c;h=a38cdd3f183f6e736a15ca6cf5057950d6795d7d;hb=12aaa3fc53618991634823a6738f50360a54633b;hp=f015f6e6b8e32370503b190409fe541bd0c5e962;hpb=673590264d6f8e4e52ecbae2e63282e4e7d3d02a;p=libfirm diff --git a/ir/be/bespilldaemel.c b/ir/be/bespilldaemel.c index f015f6e6b..a38cdd3f1 100644 --- a/ir/be/bespilldaemel.c +++ b/ir/be/bespilldaemel.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -22,7 +22,6 @@ * @brief Naive spilling algorithm * @author Matthias Braun * @date 20.09.2005 - * @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $ * @brief * This implements a naive spilling algorithm. It is designed to produce * similar effects to the spill decisions produced by traditional graph @@ -51,13 +50,12 @@ #include "bearch.h" #include "be_t.h" #include "benode.h" -#include "beirg.h" #include "belive.h" DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) static spill_env_t *spill_env; -static int n_regs; +static unsigned n_regs; static const arch_register_class_t *cls; static const be_lv_t *lv; static bitset_t *spilled_nodes; @@ -70,18 +68,16 @@ struct spill_candidate_t { static int compare_spill_candidates_desc(const void *d1, const void *d2) { - const spill_candidate_t *c1 = d1; - const spill_candidate_t *c2 = d2; + const spill_candidate_t *c1 = (const spill_candidate_t*)d1; + const spill_candidate_t *c2 = (const spill_candidate_t*)d2; return (int) (c1->costs - c2->costs); } static double get_spill_costs(ir_node *node) { - const ir_edge_t *edge; - ir_node *spill_place = skip_Proj(node); - double costs = be_get_spill_costs(spill_env, node, - spill_place); + ir_node *spill_place = skip_Proj(node); + double costs = be_get_spill_costs(spill_env, node, spill_place); foreach_out_edge(node, edge) { ir_node *use = get_edge_src_irn(edge); @@ -109,8 +105,6 @@ static double get_spill_costs(ir_node *node) */ static void spill_node(ir_node *node) { - const ir_edge_t *edge; - DBG((dbg, LEVEL_3, "\tspilling %+F\n", node)); foreach_out_edge(node, edge) { @@ -121,8 +115,8 @@ static void spill_node(ir_node *node) continue; if (is_Phi(use)) { - int in = get_edge_src_pos(edge); - ir_node *block = get_nodes_block(use); + int in = get_edge_src_pos(edge); + ir_node *block = get_nodes_block(use); be_add_reload_on_edge(spill_env, node, block, in, cls, 1); } else { @@ -135,7 +129,7 @@ static void spill_node(ir_node *node) static unsigned get_value_width(const ir_node *node) { - const arch_register_req_t *req = arch_get_register_req_out(node); + const arch_register_req_t *req = arch_get_irn_register_req(node); return req->width; } @@ -145,81 +139,69 @@ static unsigned get_value_width(const ir_node *node) */ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node) { - size_t n_live_nodes = ir_nodeset_size(live_nodes); - size_t values_defined = 0; - size_t free_regs_needed = 0; - spill_candidate_t *candidates; - ir_nodeset_iterator_t iter; - size_t i, arity; - int spills_needed; - size_t cand_idx; - ir_node *n; - ir_node *value; - - be_foreach_definition(node, cls, value, - assert(req_->width >= 1); - values_defined += req_->width; + size_t values_defined = 0; + be_foreach_definition(node, cls, value, req, + (void)value; + assert(req->width >= 1); + values_defined += req->width; ); /* we need registers for the non-live argument values */ - arity = get_irn_arity(node); - for (i = 0; i < arity; ++i) { - ir_node *pred = get_irn_n(node, i); - if (arch_irn_consider_in_reg_alloc(cls, pred) - && !ir_nodeset_contains(live_nodes, pred)) { - free_regs_needed += get_value_width(pred); + size_t free_regs_needed = 0; + be_foreach_use(node, cls, in_req_, use, pred_req_, + if (!ir_nodeset_contains(live_nodes, use)) { + free_regs_needed += get_value_width(use); } - } + ); /* we can reuse all reloaded values for the defined values, but we might * need even more registers */ if (values_defined > free_regs_needed) free_regs_needed = values_defined; - spills_needed = (n_live_nodes + free_regs_needed) - n_regs; + size_t n_live_nodes = ir_nodeset_size(live_nodes); + int spills_needed = (n_live_nodes + free_regs_needed) - n_regs; if (spills_needed <= 0) return; DBG((dbg, LEVEL_2, "\tspills needed after %+F: %d\n", node, spills_needed)); - candidates = ALLOCAN(spill_candidate_t, n_live_nodes); + spill_candidate_t *candidates = ALLOCAN(spill_candidate_t, n_live_nodes); /* construct array with spill candidates and calculate their costs */ - i = 0; + size_t c = 0; foreach_ir_nodeset(live_nodes, n, iter) { - spill_candidate_t *candidate = & candidates[i]; + spill_candidate_t *candidate = & candidates[c]; assert(!bitset_is_set(spilled_nodes, get_irn_idx(n))); candidate->node = n; candidate->costs = get_spill_costs(n); - ++i; + ++c; } - assert(i == n_live_nodes); + assert(c == n_live_nodes); /* sort spill candidates */ qsort(candidates, n_live_nodes, sizeof(candidates[0]), compare_spill_candidates_desc); /* spill cheapest ones */ - cand_idx = 0; + size_t cand_idx = 0; while (spills_needed > 0) { - bool is_use = false; - spill_candidate_t *candidate; - ir_node *cand_node; - if (cand_idx >= n_live_nodes) { panic("can't spill enough values for node %+F", node); } - candidate = &candidates[cand_idx]; - cand_node = candidate->node; + spill_candidate_t *candidate = &candidates[cand_idx]; + ir_node *cand_node = candidate->node; ++cand_idx; if (arch_irn_is(skip_Proj_const(cand_node), dont_spill)) continue; /* make sure the node is not an argument of the instruction */ - for (i = 0; i < arity; ++i) { + bool is_use = false; + int arity = get_irn_arity(node); + for (int i = 0; i < arity; ++i) { ir_node *in = get_irn_n(node, i); if (in == cand_node) { is_use = true; @@ -240,21 +222,18 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node) */ static void remove_defs(ir_node *node, ir_nodeset_t *nodeset) { - ir_node *value; /* You must break out of your loop when hitting the first phi function. */ assert(!is_Phi(node)); - be_foreach_definition(node, cls, value, + be_foreach_definition(node, cls, value, req, ir_nodeset_remove(nodeset, value); ); } static void add_uses(ir_node *node, ir_nodeset_t *nodeset) { - int i, arity; - - arity = get_irn_arity(node); - for (i = 0; i < arity; ++i) { + int arity = get_irn_arity(node); + for (int i = 0; i < arity; ++i) { ir_node *op = get_irn_n(node, i); if (arch_irn_consider_in_reg_alloc(cls, op) && @@ -267,9 +246,6 @@ static void add_uses(ir_node *node, ir_nodeset_t *nodeset) static __attribute__((unused)) void print_nodeset(ir_nodeset_t *nodeset) { - ir_nodeset_iterator_t iter; - ir_node *node; - foreach_ir_nodeset(nodeset, node, iter) { ir_fprintf(stderr, "%+F ", node); } @@ -282,18 +258,11 @@ void print_nodeset(ir_nodeset_t *nodeset) */ static void spill_block(ir_node *block, void *data) { - ir_nodeset_t live_nodes; - ir_nodeset_iterator_t iter; - ir_node *node; - int n_phi_values_spilled; - int regpressure; - int live_nodes_pressure; - int phi_spills_needed; (void) data; - DBG((dbg, LEVEL_1, "spilling block %+F\n", block)); /* construct set of live nodes at end of block */ + ir_nodeset_t live_nodes; ir_nodeset_init(&live_nodes); be_liveness_end_of_block(lv, cls, block, &live_nodes); @@ -322,7 +291,7 @@ static void spill_block(ir_node *block, void *data) /* until now only the values of some phis have been spilled the phis itself * are still there and occupy registers, so we need to count them and might * have to spill some of them. */ - n_phi_values_spilled = 0; + int n_phi_values_spilled = 0; sched_foreach(block, node) { if (!is_Phi(node)) break; @@ -332,14 +301,14 @@ static void spill_block(ir_node *block, void *data) } } - live_nodes_pressure = 0; + int live_nodes_pressure = 0; foreach_ir_nodeset(&live_nodes, node, iter) { live_nodes_pressure += get_value_width(node); } /* calculate how many of the phis need to be spilled */ - regpressure = live_nodes_pressure + n_phi_values_spilled; - phi_spills_needed = regpressure - n_regs; + int regpressure = live_nodes_pressure + n_phi_values_spilled; + int phi_spills_needed = regpressure - n_regs; DBG((dbg, LEVEL_3, "Regpressure before phis: %d phispills: %d\n", regpressure, phi_spills_needed)); @@ -365,11 +334,11 @@ static void spill_block(ir_node *block, void *data) static void be_spill_daemel(ir_graph *irg, const arch_register_class_t *new_cls) { - n_regs = new_cls->n_regs - be_put_ignore_regs(irg, new_cls, NULL); + n_regs = be_get_n_allocatable_regs(irg, new_cls); if (n_regs == 0) return; - be_liveness_assure_sets(be_assure_liveness(irg)); + be_assure_live_sets(irg); spill_env = be_new_spill_env(irg); cls = new_cls; @@ -386,7 +355,7 @@ static void be_spill_daemel(ir_graph *irg, const arch_register_class_t *new_cls) be_delete_spill_env(spill_env); } -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_daemelspill); +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_daemelspill) void be_init_daemelspill(void) { static be_spiller_t daemel_spiller = {