2 * Author: Matthias Braun
4 * Copyright: (c) Universitaet Karlsruhe
5 * License: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE.
12 #include "bespillmorgan.h"
14 #include "bechordal_t.h"
22 #include "irgraph_t.h"
26 #include "bespillbelady.h"
28 #include "benodesets.h"
32 #define DBG_PRESSURE 4
34 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
36 typedef struct morgan_env {
37 const be_chordal_env_t *cenv;
38 const arch_env_t *arch;
39 const arch_register_class_t *cls;
42 /** maximum safe register pressure */
43 int registers_available;
51 typedef struct loop_edge {
56 typedef struct loop_attr {
60 /** The set of all values that are live in the loop but not used in the loop */
61 bitset_t *livethrough_unused;
64 typedef struct block_attr {
66 /** set of all values that are live in the block but not used in the block */
67 bitset_t *livethrough_unused;
70 //---------------------------------------------------------------------------
72 static int loop_edge_cmp(const void* p1, const void* p2, size_t s) {
73 loop_edge_t *e1 = (loop_edge_t*) p1;
74 loop_edge_t *e2 = (loop_edge_t*) p2;
76 return e1->block != e2->block || e1->pos != e2->pos;
79 static int loop_attr_cmp(const void *e1, const void *e2, size_t s) {
80 loop_attr_t *la1 = (loop_attr_t*) e1;
81 loop_attr_t *la2 = (loop_attr_t*) e2;
83 return la1->loop != la2->loop;
86 static int block_attr_cmp(const void *e1, const void *e2, size_t s) {
87 block_attr_t *b1 = (block_attr_t*) e1;
88 block_attr_t *b2 = (block_attr_t*) e2;
90 return b1->block != b2->block;
93 static INLINE int loop_attr_hash(const loop_attr_t *a) {
95 return a->loop->loop_nr;
97 return HASH_PTR(a->loop);
101 static INLINE int block_attr_hash(const block_attr_t *b) {
102 return nodeset_hash(b->block);
105 static INLINE int loop_edge_hash(const loop_edge_t *e) {
106 return nodeset_hash(e->block) ^ (e->pos * 31);
109 static INLINE loop_attr_t *get_loop_attr(morgan_env_t *env, const ir_loop *loop) {
110 loop_attr_t l_attr, *res;
114 hash = loop_attr_hash(&l_attr);
115 res = set_find(env->loop_attr_set, &l_attr, sizeof(l_attr), hash);
117 // create new loop_attr if none exists yet
119 l_attr.out_edges = new_set(loop_edge_cmp, 1);
120 l_attr.in_edges = new_set(loop_edge_cmp, 1);
121 l_attr.livethrough_unused = bitset_obstack_alloc(&env->obst, get_irg_last_idx(env->irg));
122 res = set_insert(env->loop_attr_set, &l_attr, sizeof(l_attr), hash);
128 static INLINE block_attr_t *get_block_attr(morgan_env_t *env, const ir_node *block) {
129 block_attr_t b_attr, *res;
131 b_attr.block = block;
133 hash = block_attr_hash(&b_attr);
134 res = set_find(env->block_attr_set, &b_attr, sizeof(b_attr), hash);
137 b_attr.livethrough_unused = bitset_obstack_alloc(&env->obst, get_irg_last_idx(env->irg));
138 res = set_insert(env->block_attr_set, &b_attr, sizeof(b_attr), hash);
144 //---------------------------------------------------------------------------
146 static INLINE int consider_for_spilling(const arch_env_t *env, const arch_register_class_t *cls, const ir_node *node) {
147 if(!arch_irn_has_reg_class(env, node, -1, cls))
150 return !(arch_irn_get_flags(env, node) & (arch_irn_flags_ignore | arch_irn_flags_dont_spill));
154 * Determine edges going out of a loop (= edges that go to a block that is not inside
155 * the loop or one of its subloops)
157 static INLINE void construct_loop_edges(ir_node* block, void* data) {
158 morgan_env_t *env = data;
159 int n_cfgpreds = get_Block_n_cfgpreds(block);
161 ir_loop* loop = get_irn_loop(block);
162 DBG((dbg, DBG_LOOPANA, "Loop for %+F: %d (depth %d)\n", block, loop->loop_nr, loop->depth));
164 for(i = 0; i < n_cfgpreds; ++i) {
167 ir_node* cfgpred = get_Block_cfgpred(block, i);
168 ir_node* cfgpred_block = get_nodes_block(cfgpred);
169 ir_loop* cfgpred_loop = get_irn_loop(cfgpred_block);
171 if(cfgpred_loop == loop)
174 assert(get_loop_depth(cfgpred_loop) != get_loop_depth(loop));
178 hash = loop_edge_hash(&edge);
180 // edge out of a loop?
181 if(get_loop_depth(cfgpred_loop) > get_loop_depth(loop)) {
184 DBG((dbg, DBG_LOOPANA, "Loop out edge from %+F (loop %d) to %+F (loop %d)\n", block, get_loop_loop_nr(loop),
185 cfgpred_block, get_loop_loop_nr(cfgpred_loop)));
187 /* this might be a jump out of multiple loops, so add this to all
188 * needed outedge sets */
191 loop_attr_t *l_attr = get_loop_attr(env, l);
192 set_insert(l_attr->out_edges, &edge, sizeof(edge), hash);
194 l = get_loop_outer_loop(l);
201 DBG((dbg, DBG_LOOPANA, "Loop in edge from %+F (loop %d) to %+F (loop %d)\n", block, get_loop_loop_nr(loop),
202 cfgpred_block, get_loop_loop_nr(cfgpred_loop)));
206 loop_attr_t *l_attr = get_loop_attr(env, l);
207 set_insert(l_attr->in_edges, &edge, sizeof(edge), hash);
209 l = get_loop_outer_loop(l);
210 } while(l != cfgpred_loop);
215 static void free_loop_edges(morgan_env_t *env) {
218 for(l_attr = set_first(env->loop_attr_set); l_attr != NULL; l_attr = set_next(env->loop_attr_set)) {
219 del_set(l_attr->out_edges);
220 del_set(l_attr->in_edges);
225 * Debugging help, shows all nodes in a (node-)bitset
227 static void show_nodebitset(ir_graph* irg, const bitset_t* bitset) {
230 bitset_foreach(bitset, i) {
231 ir_node* node = get_idx_irn(irg, i);
232 ir_fprintf(stderr, " %+F", node);
234 fprintf(stderr, "\n");
238 * Construct the livethrough unused set for a block
240 static bitset_t *construct_block_livethrough_unused(morgan_env_t* env, const ir_node* block) {
241 block_attr_t *block_attr = get_block_attr(env, block);
245 DBG((dbg, DBG_LIVE, "Processing block %d\n", get_irn_node_nr(block)));
246 // copy all live-outs into the livethrough_unused set
247 be_lv_foreach(env->cenv->lv, block, be_lv_state_in | be_lv_state_out, i) {
248 ir_node *irn = be_lv_get_irn(env->cenv->lv, block, i);
251 if(!consider_for_spilling(env->arch, env->cls, irn))
254 node_idx = get_irn_idx(irn);
255 bitset_set(block_attr->livethrough_unused, node_idx);
259 * All values that are used within the block are not unused (and therefore not
260 * livethrough_unused)
262 sched_foreach(block, node) {
265 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
266 int idx = get_irn_idx(get_irn_n(node, i));
267 bitset_clear(block_attr->livethrough_unused, idx);
271 return block_attr->livethrough_unused;
275 * Construct the livethrough unused set for a loop (and all its subloops+blocks)
277 static bitset_t *construct_loop_livethrough_unused(morgan_env_t *env, const ir_loop *loop) {
279 loop_attr_t* loop_attr = get_loop_attr(env, loop);
281 DBG((dbg, DBG_LIVE, "Processing Loop %d\n", loop->loop_nr));
282 assert(get_loop_n_elements(loop) > 0);
283 for(i = 0; i < get_loop_n_elements(loop); ++i) {
284 loop_element elem = get_loop_element(loop, i);
285 switch (*elem.kind) {
287 bitset_t *livethrough_block_unused;
288 assert(is_Block(elem.node));
289 livethrough_block_unused = construct_block_livethrough_unused(env, elem.node);
291 bitset_copy(loop_attr->livethrough_unused, livethrough_block_unused);
293 bitset_and(loop_attr->livethrough_unused, livethrough_block_unused);
298 bitset_t *livethrough_son_unused;
300 livethrough_son_unused = construct_loop_livethrough_unused(env, elem.son);
302 bitset_copy(loop_attr->livethrough_unused, livethrough_son_unused);
304 bitset_and(loop_attr->livethrough_unused, livethrough_son_unused);
313 DBG((dbg, DBG_LIVE, "Done with loop %d\n", loop->loop_nr));
315 // remove all unused livethroughs that are remembered for this loop from child loops and blocks
316 for(i = 0; i < get_loop_n_elements(loop); ++i) {
317 const loop_element elem = get_loop_element(loop, i);
319 if(*elem.kind == k_ir_loop) {
320 loop_attr_t *son_attr = get_loop_attr(env, elem.son);
321 bitset_andnot(son_attr->livethrough_unused, loop_attr->livethrough_unused);
323 DBG((dbg, DBG_LIVE, "Livethroughs for loop %d:\n", loop->loop_nr));
324 } else if(*elem.kind == k_ir_node) {
325 block_attr_t *block_attr = get_block_attr(env, elem.node);
326 bitset_andnot(block_attr->livethrough_unused, loop_attr->livethrough_unused);
328 DBG((dbg, DBG_LIVE, "Livethroughs for block %+F\n", elem.node));
334 return loop_attr->livethrough_unused;
337 /*---------------------------------------------------------------------------*/
339 static int reduce_register_pressure_in_block(morgan_env_t *env, const ir_node* block, int loop_unused_spills_possible) {
342 int loop_unused_spills_needed;
343 pset *live_nodes = pset_new_ptr_default();
345 be_liveness_end_of_block(env->cenv->lv, env->arch, env->cls, block, live_nodes);
346 max_pressure = pset_count(live_nodes);
348 DBG((dbg, DBG_LIVE, "Reduce pressure to %d In Block %+F:\n", env->registers_available, block));
351 * Determine register pressure in block
353 sched_foreach_reverse(block, node) {
359 be_liveness_transfer(env->arch, env->cls, node, live_nodes);
360 pressure = pset_count(live_nodes);
361 if(pressure > max_pressure)
362 max_pressure = pressure;
364 del_pset(live_nodes);
366 DBG((dbg, DBG_PRESSURE, "\tMax Pressure in %+F: %d\n", block, max_pressure));
368 loop_unused_spills_needed = max_pressure - env->registers_available;
370 if(loop_unused_spills_needed < 0) {
371 loop_unused_spills_needed = 0;
372 } else if(loop_unused_spills_needed > loop_unused_spills_possible) {
373 loop_unused_spills_needed = loop_unused_spills_possible;
376 DBG((dbg, DBG_PRESSURE, "Unused spills for Block %+F needed: %d\n", block, loop_unused_spills_needed));
377 return loop_unused_spills_needed;
381 * Reduce register pressure in a loop
383 * @param unused_spills_possible Number of spills from livethrough_unused variables possible in outer loops
384 * @return Number of spills of livethrough_unused variables needed in outer loops
386 static int reduce_register_pressure_in_loop(morgan_env_t *env, const ir_loop *loop, int outer_spills_possible) {
388 loop_attr_t* loop_attr = get_loop_attr(env, loop);
389 int spills_needed = 0;
390 int spills_possible = outer_spills_possible + bitset_popcnt(loop_attr->livethrough_unused);
391 int outer_spills_needed;
393 DBG((dbg, DBG_PRESSURE, "Reducing Pressure in loop %d\n", loop->loop_nr));
394 for(i = 0; i < get_loop_n_elements(loop); ++i) {
395 loop_element elem = get_loop_element(loop, i);
396 switch (*elem.kind) {
399 assert(is_Block(elem.node));
400 needed = reduce_register_pressure_in_block(env, elem.node, spills_possible);
402 assert(needed <= spills_possible);
403 if(needed > spills_needed)
404 spills_needed = needed;
408 int needed = reduce_register_pressure_in_loop(env, elem.son, spills_possible);
410 assert(needed <= spills_possible);
411 if(needed > spills_needed)
412 spills_needed = needed;
421 /* calculate number of spills needed in outer loop and spill
422 * unused livethrough nodes around this loop
424 if(spills_needed > outer_spills_possible) {
426 outer_spills_needed = outer_spills_possible;
427 spills_needed -= outer_spills_possible;
429 spills_to_place = spills_needed;
431 DBG((dbg, DBG_SPILLS, "%d values unused in loop %d, spilling %d\n",
432 spills_possible - outer_spills_possible, loop->loop_nr, spills_to_place));
434 bitset_foreach(loop_attr->livethrough_unused, i) {
436 ir_node *to_spill = get_idx_irn(env->irg, i);
438 DBG((dbg, DBG_SPILLS, "Spilling node %+F around loop %d\n", to_spill, loop->loop_nr));
440 for(edge = set_first(loop_attr->out_edges); edge != NULL; edge = set_next(loop_attr->out_edges)) {
441 be_add_reload_on_edge(env->senv, to_spill, edge->block, edge->pos);
445 if(spills_to_place <= 0) {
450 outer_spills_needed = spills_needed;
453 return outer_spills_needed;
456 void be_spill_morgan(be_chordal_env_t *chordal_env) {
459 FIRM_DBG_REGISTER(dbg, "ir.be.spillmorgan");
460 //firm_dbg_set_mask(dbg, DBG_SPILLS | DBG_LOOPANA);
462 env.cenv = chordal_env;
463 env.arch = chordal_env->birg->main_env->arch_env;
464 env.irg = chordal_env->irg;
465 env.cls = chordal_env->cls;
466 env.senv = be_new_spill_env(chordal_env);
467 DEBUG_ONLY(be_set_spill_env_dbg_module(env.senv, dbg);)
469 obstack_init(&env.obst);
471 env.registers_available = env.cls->n_regs - be_put_ignore_regs(chordal_env->birg, env.cls, NULL);
473 env.loop_attr_set = new_set(loop_attr_cmp, 5);
474 env.block_attr_set = new_set(block_attr_cmp, 20);
476 /*-- Part1: Analysis --*/
477 be_liveness_recompute(chordal_env->lv);
479 /* construct control flow loop tree */
480 construct_cf_backedges(chordal_env->irg);
482 /* construct loop out edges and livethrough_unused sets for loops and blocks */
483 irg_block_walk_graph(chordal_env->irg, NULL, construct_loop_edges, &env);
484 construct_loop_livethrough_unused(&env, get_irg_loop(env.irg));
486 /*-- Part2: Transformation --*/
488 /* spill unused livethrough values around loops and blocks where
489 * the pressure is too high
491 reduce_register_pressure_in_loop(&env, get_irg_loop(env.irg), 0);
493 /* Insert real spill/reload nodes and fix usages */
494 be_insert_spills_reloads(env.senv);
496 /* Verify the result */
497 if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
498 be_verify_schedule(env.irg);
499 } else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
500 assert(be_verify_schedule(env.irg));
503 if (chordal_env->opts->dump_flags & BE_CH_DUMP_SPILL)
504 be_dump(env.irg, "-spillmorgan", dump_ir_block_graph_sched);
507 free_loop_edges(&env);
508 del_set(env.loop_attr_set);
509 del_set(env.block_attr_set);
511 /* fix the remaining places with too high register pressure with beladies algorithm */
512 be_spill_belady_spill_env(chordal_env, env.senv);
514 be_delete_spill_env(env.senv);
515 obstack_free(&env.obst, NULL);