2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Naiv spilling algorithm
23 * @author Matthias Braun
25 * @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
27 * This implements a naiv spilling algorithm. It is design to produce similar
28 * effects to the spill decisions produced by traditional graph coloring
29 * register allocators that spill while they are coloring the graph.
31 * This spiller walks over all blocks and looks for places with too high
32 * register pressure where it spills the values that are cheapest to spill.
33 * Spilling in this context means placing a spill instruction behind the
34 * definition of the value and a reload before each usage.
42 #include "irnodeset.h"
45 #include "iredges_t.h"
49 #include "bespilloptions.h"
58 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
60 typedef struct daemel_env_t daemel_env_t;
62 spill_env_t *spill_env;
64 const arch_env_t *arch_env;
65 const arch_register_class_t *cls;
67 bitset_t *spilled_nodes;
70 typedef struct spill_candidate_t spill_candidate_t;
71 struct spill_candidate_t {
77 int compare_spill_candidates_desc(const void *d1, const void *d2)
79 const spill_candidate_t *c1 = d1;
80 const spill_candidate_t *c2 = d2;
82 return (int) (c1->costs - c2->costs);
86 double get_spill_costs(daemel_env_t *env, ir_node *node)
88 const ir_edge_t *edge;
89 spill_env_t *spill_env = env->spill_env;
90 double costs = be_get_spill_costs(spill_env, node, node);
92 foreach_out_edge(node, edge) {
93 ir_node *use = get_edge_src_irn(edge);
96 int in = get_edge_src_pos(edge);
97 ir_node *block = get_nodes_block(use);
99 costs += be_get_reload_costs_on_edge(spill_env, node, block, in);
101 costs += be_get_reload_costs(spill_env, node, use);
109 * spills a node by placing a reload before each usage
112 void spill_node(daemel_env_t *env, ir_node *node)
114 const ir_edge_t *edge;
115 spill_env_t *spill_env = env->spill_env;
116 const arch_register_class_t *cls = env->cls;
118 DBG((dbg, LEVEL_3, "\tspilling %+F\n", node));
120 foreach_out_edge(node, edge) {
121 ir_node *use = get_edge_src_irn(edge);
124 int in = get_edge_src_pos(edge);
125 ir_node *block = get_nodes_block(use);
127 be_add_reload_on_edge(spill_env, node, block, in, cls, 1);
128 } else if(!be_is_Keep(use)) {
129 be_add_reload(spill_env, node, use, cls, 1);
133 bitset_set(env->spilled_nodes, get_irn_idx(node));
137 * spill @p n nodes from a nodeset. Removes the nodes from the nodeset and
138 * sets the spilled bits in env->spilled_nodes.
141 void do_spilling(daemel_env_t *env, ir_nodeset_t *live_nodes, ir_node *node)
143 size_t node_count = ir_nodeset_size(live_nodes);
144 size_t additional_defines = 0;
145 size_t reload_values = 0;
146 int registers = env->n_regs;
147 const arch_env_t *arch_env = env->arch_env;
148 const arch_register_class_t *cls = env->cls;
149 spill_candidate_t *candidates;
150 ir_nodeset_iterator_t iter;
155 const bitset_t *spilled_nodes = env->spilled_nodes;
157 /* mode_T nodes define several values at once. Count them */
158 if(get_irn_mode(node) == mode_T) {
159 ir_node *proj = sched_next(node);
161 while(is_Proj(proj)) {
162 if(arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
163 ++additional_defines;
165 proj = sched_next(proj);
168 if(bitset_is_set(spilled_nodes, get_irn_idx(node)))
169 ++additional_defines;
171 /* we need registers for the non-live argument values */
172 arity = get_irn_arity(node);
173 for(i = 0; i < arity; ++i) {
174 ir_node *pred = get_irn_n(node, i);
175 if(arch_irn_consider_in_reg_alloc(arch_env, cls, pred)
176 && !ir_nodeset_contains(live_nodes, pred)) {
181 if(reload_values > additional_defines)
182 additional_defines = reload_values;
184 spills_needed = (node_count + additional_defines) - registers;
185 if(spills_needed <= 0)
187 DBG((dbg, LEVEL_2, "\tspills needed after %+F: %d\n", node, spills_needed));
189 candidates = malloc(node_count * sizeof(candidates[0]));
191 /* construct array with spill candidates and calculate their costs */
193 foreach_ir_nodeset(live_nodes, n, iter) {
194 spill_candidate_t *candidate = & candidates[i];
196 assert(!bitset_is_set(spilled_nodes, get_irn_idx(n)));
199 candidate->costs = get_spill_costs(env, n);
202 assert(i == node_count);
204 /* sort spill candidates */
205 qsort(candidates, node_count, sizeof(candidates[0]),
206 compare_spill_candidates_desc);
208 /* spill cheapest ones */
210 while(spills_needed > 0) {
211 if(cand_idx >= node_count) {
212 panic("can't spill enough values for node %+F\n", node);
215 spill_candidate_t *candidate = &candidates[cand_idx];
216 ir_node *cand_node = candidate->node;
220 if(arch_irn_is(arch_env, cand_node, dont_spill))
223 /* make sure the node is not an argument of the instruction */
225 for(i = 0; i < arity; ++i) {
226 ir_node *in = get_irn_n(node, i);
227 if(in == cand_node) {
236 spill_node(env, cand_node);
237 ir_nodeset_remove(live_nodes, cand_node);
245 * similar to be_liveness_transfer.
246 * custom liveness transfer function, that doesn't place already spilled values
247 * into the liveness set
250 void liveness_transfer(daemel_env_t *env, ir_node *node, ir_nodeset_t *nodeset)
253 const arch_register_class_t *cls = env->cls;
254 const arch_env_t *arch_env = env->arch_env;
255 const bitset_t *bitset = env->spilled_nodes;
257 /* You should better break out of your loop when hitting the first phi
259 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
261 if(arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
262 ir_nodeset_remove(nodeset, node);
265 arity = get_irn_arity(node);
266 for(i = 0; i < arity; ++i) {
267 ir_node *op = get_irn_n(node, i);
269 if(arch_irn_consider_in_reg_alloc(arch_env, cls, op)
270 && !bitset_is_set(bitset, get_irn_idx(op))) {
271 ir_nodeset_insert(nodeset, op);
276 static __attribute__((unused))
277 void print_nodeset(ir_nodeset_t *nodeset)
279 ir_nodeset_iterator_t iter;
282 foreach_ir_nodeset(nodeset, node, iter) {
283 ir_fprintf(stderr, "%+F ", node);
285 fprintf(stderr, "\n");
289 * make sure register pressure in a block is always equal or below the number
290 * of available registers
293 void spill_block(ir_node *block, void *data)
295 daemel_env_t *env = data;
296 const arch_env_t *arch_env = env->arch_env;
297 const arch_register_class_t *cls = env->cls;
298 const be_lv_t *lv = env->lv;
299 ir_nodeset_t live_nodes;
300 ir_nodeset_iterator_t iter;
302 bitset_t *spilled_nodes = env->spilled_nodes;
305 DBG((dbg, LEVEL_1, "spilling block %+F\n", block));
307 ir_nodeset_init(&live_nodes);
308 be_liveness_end_of_block_ir_nodeset(lv, arch_env, cls, block, &live_nodes);
310 foreach_ir_nodeset(&live_nodes, node, iter) {
311 DBG((dbg, LEVEL_2, "\t%+F is live-end... ", node));
312 if(bitset_is_set(spilled_nodes, get_irn_idx(node))) {
313 DBG((dbg, LEVEL_2, "but spilled; removing.\n"));
314 ir_nodeset_remove_iterator(&live_nodes, &iter);
316 DBG((dbg, LEVEL_2, "keeping.\n"));
320 sched_foreach_reverse(block, node) {
324 if(is_Proj(node) || be_is_Keep(node)) {
325 liveness_transfer(env, node, &live_nodes);
329 do_spilling(env, &live_nodes, node);
330 liveness_transfer(env, node, &live_nodes);
334 int spilled_phis = 0;
335 sched_foreach(block, node) {
340 if(bitset_is_set(spilled_nodes, get_irn_idx(node))) {
344 int regpressure = ir_nodeset_size(&live_nodes) + spilled_phis;
345 int phi_spills_needed = regpressure - env->n_regs;
346 DBG((dbg, LEVEL_3, "Regpressure before phis: %d phispills: %d\n",
347 regpressure, phi_spills_needed));
348 sched_foreach(block, node) {
351 if(phi_spills_needed <= 0)
354 if(bitset_is_set(spilled_nodes, get_irn_idx(node))) {
355 be_spill_phi(env->spill_env, node);
359 assert(phi_spills_needed <= 0);
361 ir_nodeset_destroy(&live_nodes);
364 void be_spill_daemel(be_irg_t *birg, const arch_register_class_t *cls)
367 ir_graph *irg = be_get_birg_irg(birg);
368 int n_regs = cls->n_regs - be_put_ignore_regs(birg, cls, NULL);
373 be_invalidate_liveness(birg);
374 be_assure_liveness(birg);
376 env.spill_env = be_new_spill_env(birg);
378 env.arch_env = be_get_birg_arch_env(birg);
380 env.lv = be_get_birg_liveness(birg);
381 env.spilled_nodes = bitset_malloc(get_irg_last_idx(irg));
383 DBG((dbg, LEVEL_1, "*** RegClass %s\n", cls->name));
385 irg_block_walk_graph(irg, spill_block, NULL, &env);
387 bitset_free(env.spilled_nodes);
389 be_insert_spills_reloads(env.spill_env);
391 be_delete_spill_env(env.spill_env);
394 void be_init_daemelspill(void)
396 static be_spiller_t daemel_spiller = {
400 be_register_spiller("daemel", &daemel_spiller);
401 FIRM_DBG_REGISTER(dbg, "ir.be.spilldaemel");
404 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_doedelspill);