2 * Copyright (C) 1995-2008 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 implementation of the spill/reload placement abstraction layer
23 * @author Daniel Grund, Sebastian Hack, Matthias Braun
35 #include "iredges_t.h"
36 #include "irbackedge_t.h"
46 #include "irnodeset.h"
53 #include "bespillutil.h"
56 #include "bechordal_t.h"
57 #include "bestatevent.h"
58 #include "bessaconstr.h"
60 #include "beintlive_t.h"
64 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
66 #define REMAT_COST_INFINITE 1000
68 typedef struct reloader_t reloader_t;
71 ir_node *can_spill_after;
73 ir_node *rematted_node;
74 int remat_cost_delta; /** costs needed for rematerialization,
75 compared to placing a reload */
78 typedef struct spill_t spill_t;
81 ir_node *after; /**< spill has to be placed after this node (or earlier) */
85 typedef struct spill_info_t spill_info_t;
87 ir_node *to_spill; /**< the value that should get spilled */
88 reloader_t *reloaders; /**< list of places where the value should get
90 spill_t *spills; /**< list of latest places where spill must be
92 double spill_costs; /**< costs needed for spilling the value */
93 const arch_register_class_t *reload_cls; /** the register class in which the
94 reload should be placed */
98 const arch_env_t *arch_env;
101 int spill_cost; /**< the cost of a single spill node */
102 int reload_cost; /**< the cost of a reload node */
103 set *spills; /**< all spill_info_t's, which must be
105 ir_nodeset_t mem_phis; /**< set of all spilled phis. */
106 ir_exec_freq *exec_freq;
108 #ifdef FIRM_STATISTICS
109 unsigned spill_count;
110 unsigned reload_count;
111 unsigned remat_count;
112 unsigned spilled_phi_count;
117 * Compare two spill infos.
119 static int cmp_spillinfo(const void *x, const void *y, size_t size)
121 const spill_info_t *xx = x;
122 const spill_info_t *yy = y;
125 return xx->to_spill != yy->to_spill;
129 * Returns spill info for a specific value (the value that is to be spilled)
131 static spill_info_t *get_spillinfo(const spill_env_t *env, ir_node *value)
133 spill_info_t info, *res;
134 int hash = hash_irn(value);
136 info.to_spill = value;
137 res = set_find(env->spills, &info, sizeof(info), hash);
140 info.reloaders = NULL;
142 info.spill_costs = -1;
143 info.reload_cls = NULL;
144 res = set_insert(env->spills, &info, sizeof(info), hash);
150 spill_env_t *be_new_spill_env(ir_graph *irg)
152 const arch_env_t *arch_env = be_get_irg_arch_env(irg);
154 spill_env_t *env = XMALLOC(spill_env_t);
155 env->spills = new_set(cmp_spillinfo, 1024);
157 env->arch_env = arch_env;
158 ir_nodeset_init(&env->mem_phis);
159 env->spill_cost = arch_env->spill_cost;
160 env->reload_cost = arch_env->reload_cost;
161 env->exec_freq = be_get_irg_exec_freq(irg);
162 obstack_init(&env->obst);
164 #ifdef FIRM_STATISTICS
165 env->spill_count = 0;
166 env->reload_count = 0;
167 env->remat_count = 0;
168 env->spilled_phi_count = 0;
174 void be_delete_spill_env(spill_env_t *env)
176 del_set(env->spills);
177 ir_nodeset_destroy(&env->mem_phis);
178 obstack_free(&env->obst, NULL);
184 * | _ \| | __ _ ___ ___ | _ \ ___| | ___ __ _ __| |___
185 * | |_) | |/ _` |/ __/ _ \ | |_) / _ \ |/ _ \ / _` |/ _` / __|
186 * | __/| | (_| | (_| __/ | _ < __/ | (_) | (_| | (_| \__ \
187 * |_| |_|\__,_|\___\___| |_| \_\___|_|\___/ \__,_|\__,_|___/
191 void be_add_spill(spill_env_t *env, ir_node *to_spill, ir_node *after)
193 spill_info_t *spill_info = get_spillinfo(env, to_spill);
198 assert(!arch_irn_is(skip_Proj_const(to_spill), dont_spill));
199 DB((dbg, LEVEL_1, "Add spill of %+F after %+F\n", to_spill, after));
201 /* Just for safety make sure that we do not insert the spill in front of a phi */
202 assert(!is_Phi(sched_next(after)));
204 /* spills that are dominated by others are not needed */
206 s = spill_info->spills;
207 for ( ; s != NULL; s = s->next) {
208 /* no need to add this spill if it is dominated by another */
209 if (value_dominates(s->after, after)) {
210 DB((dbg, LEVEL_1, "...dominated by %+F, not added\n", s->after));
213 /* remove spills that we dominate */
214 if (value_dominates(after, s->after)) {
215 DB((dbg, LEVEL_1, "...remove old spill at %+F\n", s->after));
217 last->next = s->next;
219 spill_info->spills = s->next;
226 spill = OALLOC(&env->obst, spill_t);
227 spill->after = after;
228 spill->next = spill_info->spills;
231 spill_info->spills = spill;
234 void be_add_remat(spill_env_t *env, ir_node *to_spill, ir_node *before,
235 ir_node *rematted_node)
237 spill_info_t *spill_info;
238 reloader_t *reloader;
240 spill_info = get_spillinfo(env, to_spill);
242 /* add the remat information */
243 reloader = OALLOC(&env->obst, reloader_t);
244 reloader->next = spill_info->reloaders;
245 reloader->reloader = before;
246 reloader->rematted_node = rematted_node;
247 reloader->remat_cost_delta = 0; /* We will never have a cost win over a
248 reload since we're not even allowed to
251 spill_info->reloaders = reloader;
253 DBG((dbg, LEVEL_1, "creating spillinfo for %+F, will be rematerialized before %+F\n",
257 void be_add_reload2(spill_env_t *env, ir_node *to_spill, ir_node *before,
258 ir_node *can_spill_after, const arch_register_class_t *reload_cls,
264 assert(!arch_irn_is(skip_Proj_const(to_spill), dont_spill));
266 info = get_spillinfo(env, to_spill);
268 if (is_Phi(to_spill)) {
271 /* create spillinfos for the phi arguments */
272 for (i = 0, arity = get_irn_arity(to_spill); i < arity; ++i) {
273 ir_node *arg = get_irn_n(to_spill, i);
274 get_spillinfo(env, arg);
278 assert(!is_Proj(before) && !be_is_Keep(before));
280 /* put reload into list */
281 rel = OALLOC(&env->obst, reloader_t);
282 rel->next = info->reloaders;
283 rel->reloader = before;
284 rel->rematted_node = NULL;
285 rel->can_spill_after = can_spill_after;
286 rel->remat_cost_delta = allow_remat ? 0 : REMAT_COST_INFINITE;
288 info->reloaders = rel;
289 assert(info->reload_cls == NULL || info->reload_cls == reload_cls);
290 info->reload_cls = reload_cls;
292 DBG((dbg, LEVEL_1, "creating spillinfo for %+F, will be reloaded before %+F, may%s be rematerialized\n",
293 to_spill, before, allow_remat ? "" : " not"));
296 void be_add_reload(spill_env_t *senv, ir_node *to_spill, ir_node *before,
297 const arch_register_class_t *reload_cls, int allow_remat)
299 be_add_reload2(senv, to_spill, before, to_spill, reload_cls, allow_remat);
303 ir_node *be_get_end_of_block_insertion_point(const ir_node *block)
305 ir_node *last = sched_last(block);
307 /* we might have keeps behind the jump... */
308 while (be_is_Keep(last)) {
309 last = sched_prev(last);
310 assert(!sched_is_end(last));
313 assert(is_cfop(last));
315 /* add the reload before the (cond-)jump */
319 static ir_node *skip_keeps_phis(ir_node *node)
322 ir_node *next = sched_next(node);
323 if (!is_Phi(next) && !be_is_Keep(next) && !be_is_CopyKeep(next))
331 * Returns the point at which you can insert a node that should be executed
332 * before block @p block when coming from pred @p pos.
334 static ir_node *get_block_insertion_point(ir_node *block, int pos)
338 /* simply add the reload to the beginning of the block if we only have 1
339 * predecessor. We don't need to check for phis as there can't be any in a
340 * block with only 1 pred. */
341 if (get_Block_n_cfgpreds(block) == 1) {
342 assert(!is_Phi(sched_first(block)));
343 return sched_first(block);
346 /* We have to reload the value in pred-block */
347 predblock = get_Block_cfgpred_block(block, pos);
348 return be_get_end_of_block_insertion_point(predblock);
351 void be_add_reload_at_end(spill_env_t *env, ir_node *to_spill,
352 const ir_node *block,
353 const arch_register_class_t *reload_cls,
356 ir_node *before = be_get_end_of_block_insertion_point(block);
357 be_add_reload(env, to_spill, before, reload_cls, allow_remat);
360 void be_add_reload_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block,
361 int pos, const arch_register_class_t *reload_cls,
364 ir_node *before = get_block_insertion_point(block, pos);
365 be_add_reload(env, to_spill, before, reload_cls, allow_remat);
368 void be_spill_phi(spill_env_t *env, ir_node *node)
373 assert(is_Phi(node));
375 ir_nodeset_insert(&env->mem_phis, node);
377 /* create spills for the phi arguments */
378 block = get_nodes_block(node);
379 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
380 ir_node *arg = get_irn_n(node, i);
383 /* some backends have virtual noreg/unknown nodes that are not scheduled
384 * and simply always available. */
385 if (!sched_is_scheduled(arg)) {
386 ir_node *pred_block = get_Block_cfgpred_block(block, i);
387 insert = be_get_end_of_block_insertion_point(pred_block);
388 insert = sched_prev(insert);
390 insert = skip_keeps_phis(arg);
393 be_add_spill(env, arg, insert);
399 * / ___|_ __ ___ __ _| |_ ___ / ___| _ __ (_) | |___
400 * | | | '__/ _ \/ _` | __/ _ \ \___ \| '_ \| | | / __|
401 * | |___| | | __/ (_| | || __/ ___) | |_) | | | \__ \
402 * \____|_| \___|\__,_|\__\___| |____/| .__/|_|_|_|___/
406 static void determine_spill_costs(spill_env_t *env, spill_info_t *spillinfo);
411 * @param senv the spill environment
412 * @param irn the node that should be spilled
413 * @param ctx_irn an user of the spilled node
415 * @return a be_Spill node
417 static void spill_irn(spill_env_t *env, spill_info_t *spillinfo)
419 ir_node *to_spill = spillinfo->to_spill;
420 const ir_node *insn = skip_Proj_const(to_spill);
423 /* determine_spill_costs must have been run before */
424 assert(spillinfo->spill_costs >= 0);
426 /* some backends have virtual noreg/unknown nodes that are not scheduled
427 * and simply always available. */
428 if (!sched_is_scheduled(insn)) {
429 /* override spillinfos or create a new one */
430 spillinfo->spills->spill = new_NoMem();
431 DB((dbg, LEVEL_1, "don't spill %+F use NoMem\n", to_spill));
435 DBG((dbg, LEVEL_1, "spilling %+F ... \n", to_spill));
436 spill = spillinfo->spills;
437 for ( ; spill != NULL; spill = spill->next) {
438 ir_node *after = spill->after;
439 ir_node *block = get_block(after);
441 after = skip_keeps_phis(after);
443 spill->spill = be_spill(block, to_spill);
444 sched_add_after(skip_Proj(after), spill->spill);
445 DB((dbg, LEVEL_1, "\t%+F after %+F\n", spill->spill, after));
446 #ifdef FIRM_STATISTICS
450 DBG((dbg, LEVEL_1, "\n"));
453 static void spill_node(spill_env_t *env, spill_info_t *spillinfo);
456 * If the first usage of a Phi result would be out of memory
457 * there is no sense in allocating a register for it.
458 * Thus we spill it and all its operands to the same spill slot.
459 * Therefore the phi/dataB becomes a phi/Memory
461 * @param senv the spill environment
462 * @param phi the Phi node that should be spilled
463 * @param ctx_irn an user of the spilled node
465 static void spill_phi(spill_env_t *env, spill_info_t *spillinfo)
467 ir_graph *irg = env->irg;
468 ir_node *phi = spillinfo->to_spill;
469 ir_node *block = get_nodes_block(phi);
477 assert(!get_opt_cse());
478 DBG((dbg, LEVEL_1, "spilling Phi %+F:\n", phi));
480 /* build a new PhiM */
481 arity = get_irn_arity(phi);
482 ins = ALLOCAN(ir_node*, arity);
483 unknown = new_r_Unknown(irg, mode_M);
484 for (i = 0; i < arity; ++i) {
488 /* override or replace spills list... */
489 spill = OALLOC(&env->obst, spill_t);
490 spill->after = skip_keeps_phis(phi);
491 spill->spill = new_r_Phi(block, arity, ins, mode_M);
494 spillinfo->spills = spill;
495 #ifdef FIRM_STATISTICS
496 env->spilled_phi_count++;
499 for (i = 0; i < arity; ++i) {
500 ir_node *arg = get_irn_n(phi, i);
501 spill_info_t *arg_info = get_spillinfo(env, arg);
503 determine_spill_costs(env, arg_info);
504 spill_node(env, arg_info);
506 set_irn_n(spill->spill, i, arg_info->spills->spill);
508 DBG((dbg, LEVEL_1, "... done spilling Phi %+F, created PhiM %+F\n", phi,
515 * @param senv the spill environment
516 * @param to_spill the node that should be spilled
518 static void spill_node(spill_env_t *env, spill_info_t *spillinfo)
522 /* node is already spilled */
523 if (spillinfo->spills != NULL && spillinfo->spills->spill != NULL)
526 to_spill = spillinfo->to_spill;
528 if (is_Phi(to_spill) && ir_nodeset_contains(&env->mem_phis, to_spill)) {
529 spill_phi(env, spillinfo);
531 spill_irn(env, spillinfo);
538 * | _ \ ___ _ __ ___ __ _| |_ ___ _ __(_) __ _| (_)_______
539 * | |_) / _ \ '_ ` _ \ / _` | __/ _ \ '__| |/ _` | | |_ / _ \
540 * | _ < __/ | | | | | (_| | || __/ | | | (_| | | |/ / __/
541 * |_| \_\___|_| |_| |_|\__,_|\__\___|_| |_|\__,_|_|_/___\___|
546 * Tests whether value @p arg is available before node @p reloader
547 * @returns 1 if value is available, 0 otherwise
549 static int is_value_available(spill_env_t *env, const ir_node *arg,
550 const ir_node *reloader)
552 if (is_Unknown(arg) || arg == new_NoMem())
555 if (be_is_Spill(skip_Proj_const(arg)))
558 if (arg == get_irg_frame(env->irg))
563 if (get_irn_mode(arg) == mode_T)
567 * Ignore registers are always available
569 if (arch_irn_is_ignore(arg))
576 * Check if a node is rematerializable. This tests for the following conditions:
578 * - The node itself is rematerializable
579 * - All arguments of the node are available or also rematerialisable
580 * - The costs for the rematerialisation operation is less or equal a limit
582 * Returns the costs needed for rematerialisation or something
583 * >= REMAT_COST_INFINITE if remat is not possible.
585 static int check_remat_conditions_costs(spill_env_t *env,
586 const ir_node *spilled, const ir_node *reloader, int parentcosts)
591 const ir_node *insn = skip_Proj_const(spilled);
593 assert(!be_is_Spill(insn));
594 if (!arch_irn_is(insn, rematerializable))
595 return REMAT_COST_INFINITE;
597 if (be_is_Reload(insn)) {
600 costs += arch_get_op_estimated_cost(insn);
602 if (parentcosts + costs >= env->reload_cost + env->spill_cost) {
603 return REMAT_COST_INFINITE;
605 /* never rematerialize a node which modifies the flags.
606 * (would be better to test wether the flags are actually live at point
609 if (arch_irn_is(insn, modify_flags)) {
610 return REMAT_COST_INFINITE;
614 for (i = 0, arity = get_irn_arity(insn); i < arity; ++i) {
615 ir_node *arg = get_irn_n(insn, i);
617 if (is_value_available(env, arg, reloader))
620 /* we have to rematerialize the argument as well */
623 /* we only support rematerializing 1 argument at the moment,
624 * as multiple arguments could increase register pressure */
625 return REMAT_COST_INFINITE;
628 costs += check_remat_conditions_costs(env, arg, reloader,
629 parentcosts + costs);
630 if (parentcosts + costs >= env->reload_cost + env->spill_cost)
631 return REMAT_COST_INFINITE;
638 * Re-materialize a node.
640 * @param senv the spill environment
641 * @param spilled the node that was spilled
642 * @param reloader a irn that requires a reload
644 static ir_node *do_remat(spill_env_t *env, ir_node *spilled, ir_node *reloader)
651 if (is_Block(reloader)) {
654 bl = get_nodes_block(reloader);
657 ins = ALLOCAN(ir_node*, get_irn_arity(spilled));
658 for (i = 0, arity = get_irn_arity(spilled); i < arity; ++i) {
659 ir_node *arg = get_irn_n(spilled, i);
661 if (is_value_available(env, arg, reloader)) {
664 ins[i] = do_remat(env, arg, reloader);
665 #ifdef FIRM_STATISTICS
666 /* don't count the recursive call as remat */
672 /* create a copy of the node */
673 res = new_ir_node(get_irn_dbg_info(spilled), env->irg, bl,
674 get_irn_op(spilled), get_irn_mode(spilled),
675 get_irn_arity(spilled), ins);
676 copy_node_attr(env->irg, spilled, res);
677 arch_env_mark_remat(env->arch_env, res);
679 DBG((dbg, LEVEL_1, "Insert remat %+F of %+F before reloader %+F\n", res, spilled, reloader));
681 if (! is_Proj(res)) {
682 /* insert in schedule */
684 sched_add_before(reloader, res);
685 #ifdef FIRM_STATISTICS
693 double be_get_spill_costs(spill_env_t *env, ir_node *to_spill, ir_node *before)
695 ir_node *block = get_nodes_block(before);
696 double freq = get_block_execfreq(env->exec_freq, block);
699 return env->spill_cost * freq;
702 unsigned be_get_reload_costs_no_weight(spill_env_t *env, const ir_node *to_spill,
703 const ir_node *before)
706 /* is the node rematerializable? */
707 unsigned costs = check_remat_conditions_costs(env, to_spill, before, 0);
708 if (costs < (unsigned) env->reload_cost)
712 return env->reload_cost;
715 double be_get_reload_costs(spill_env_t *env, ir_node *to_spill, ir_node *before)
717 ir_node *block = get_nodes_block(before);
718 double freq = get_block_execfreq(env->exec_freq, block);
721 /* is the node rematerializable? */
722 int costs = check_remat_conditions_costs(env, to_spill, before, 0);
723 if (costs < env->reload_cost)
727 return env->reload_cost * freq;
730 int be_is_rematerializable(spill_env_t *env, const ir_node *to_remat,
731 const ir_node *before)
733 return check_remat_conditions_costs(env, to_remat, before, 0) < REMAT_COST_INFINITE;
736 double be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill,
737 ir_node *block, int pos)
739 ir_node *before = get_block_insertion_point(block, pos);
740 return be_get_reload_costs(env, to_spill, before);
745 * |_ _|_ __ ___ ___ _ __| |_ | _ \ ___| | ___ __ _ __| |___
746 * | || '_ \/ __|/ _ \ '__| __| | |_) / _ \ |/ _ \ / _` |/ _` / __|
747 * | || | | \__ \ __/ | | |_ | _ < __/ | (_) | (_| | (_| \__ \
748 * |___|_| |_|___/\___|_| \__| |_| \_\___|_|\___/ \__,_|\__,_|___/
753 * analyzes how to best spill a node and determine costs for that
755 static void determine_spill_costs(spill_env_t *env, spill_info_t *spillinfo)
757 ir_node *to_spill = spillinfo->to_spill;
758 const ir_node *insn = skip_Proj_const(to_spill);
759 ir_node *spill_block;
761 double spill_execfreq;
763 /* already calculated? */
764 if (spillinfo->spill_costs >= 0)
767 assert(!arch_irn_is(insn, dont_spill));
768 assert(!be_is_Reload(insn));
770 /* some backends have virtual noreg/unknown nodes that are not scheduled
771 * and simply always available.
772 * TODO: this is kinda hairy, the NoMem is correct for an Unknown as Phi
773 * predecessor (of a PhiM) but this test might match other things too...
775 if (!sched_is_scheduled(insn)) {
776 /* override spillinfos or create a new one */
777 spill_t *spill = OALLOC(&env->obst, spill_t);
780 spill->spill = new_NoMem();
782 spillinfo->spills = spill;
783 spillinfo->spill_costs = 0;
785 DB((dbg, LEVEL_1, "don't spill %+F use NoMem\n", to_spill));
789 spill_block = get_nodes_block(insn);
790 spill_execfreq = get_block_execfreq(env->exec_freq, spill_block);
792 if (is_Phi(to_spill) && ir_nodeset_contains(&env->mem_phis, to_spill)) {
793 /* TODO calculate correct costs...
794 * (though we can't remat this node anyway so no big problem) */
795 spillinfo->spill_costs = env->spill_cost * spill_execfreq;
799 if (spillinfo->spills != NULL) {
801 double spills_execfreq;
803 /* calculate sum of execution frequencies of individual spills */
805 s = spillinfo->spills;
806 for ( ; s != NULL; s = s->next) {
807 ir_node *spill_block = get_block(s->after);
808 double freq = get_block_execfreq(env->exec_freq, spill_block);
810 spills_execfreq += freq;
813 DB((dbg, LEVEL_1, "%+F: latespillcosts %f after def: %f\n", to_spill,
814 spills_execfreq * env->spill_cost,
815 spill_execfreq * env->spill_cost));
817 /* multi-/latespill is advantageous -> return*/
818 if (spills_execfreq < spill_execfreq) {
819 DB((dbg, LEVEL_1, "use latespills for %+F\n", to_spill));
820 spillinfo->spill_costs = spills_execfreq * env->spill_cost;
825 /* override spillinfos or create a new one */
826 spill = OALLOC(&env->obst, spill_t);
827 spill->after = skip_keeps_phis(to_spill);
831 spillinfo->spills = spill;
832 spillinfo->spill_costs = spill_execfreq * env->spill_cost;
833 DB((dbg, LEVEL_1, "spill %+F after definition\n", to_spill));
836 void make_spill_locations_dominate_irn(spill_env_t *env, ir_node *irn)
838 const spill_info_t *si = get_spillinfo(env, irn);
839 ir_node *start_block = get_irg_start_block(get_irn_irg(irn));
840 int n_blocks = get_Block_dom_max_subtree_pre_num(start_block);
841 bitset_t *reloads = bitset_alloca(n_blocks);
848 /* Fill the bitset with the dominance pre-order numbers
849 * of the blocks the reloads are located in. */
850 for (r = si->reloaders; r != NULL; r = r->next) {
851 ir_node *bl = get_nodes_block(r->reloader);
852 bitset_set(reloads, get_Block_dom_tree_pre_num(bl));
855 /* Now, cancel out all the blocks that are dominated by each spill.
856 * If the bitset is not empty after that, we have reloads that are
857 * not dominated by any spill. */
858 for (s = si->spills; s != NULL; s = s->next) {
859 ir_node *bl = get_nodes_block(s->after);
860 int start = get_Block_dom_tree_pre_num(bl);
861 int end = get_Block_dom_max_subtree_pre_num(bl);
863 bitset_clear_range(reloads, start, end);
866 if (!bitset_is_empty(reloads))
867 be_add_spill(env, si->to_spill, si->to_spill);
870 void be_insert_spills_reloads(spill_env_t *env)
872 const ir_exec_freq *exec_freq = env->exec_freq;
874 ir_nodeset_iterator_t iter;
877 be_timer_push(T_RA_SPILL_APPLY);
879 /* create all phi-ms first, this is needed so, that phis, hanging on
880 spilled phis work correctly */
881 foreach_ir_nodeset(&env->mem_phis, node, iter) {
882 spill_info_t *info = get_spillinfo(env, node);
883 spill_node(env, info);
886 /* process each spilled node */
887 for (si = set_first(env->spills); si; si = set_next(env->spills)) {
889 ir_node *to_spill = si->to_spill;
890 ir_mode *mode = get_irn_mode(to_spill);
891 ir_node **copies = NEW_ARR_F(ir_node*, 0);
892 double all_remat_costs = 0; /** costs when we would remat all nodes */
895 DBG((dbg, LEVEL_1, "\nhandling all reloaders of %+F:\n", to_spill));
897 determine_spill_costs(env, si);
899 /* determine possibility of rematerialisations */
901 /* calculate cost savings for each indivial value when it would
902 be rematted instead of reloaded */
903 for (rld = si->reloaders; rld != NULL; rld = rld->next) {
906 int remat_cost_delta;
908 ir_node *reloader = rld->reloader;
910 if (rld->rematted_node != NULL) {
911 DBG((dbg, LEVEL_2, "\tforced remat %+F before %+F\n",
912 rld->rematted_node, reloader));
915 if (rld->remat_cost_delta >= REMAT_COST_INFINITE) {
916 DBG((dbg, LEVEL_2, "\treload before %+F is forbidden\n",
918 all_remat_costs = REMAT_COST_INFINITE;
922 remat_cost = check_remat_conditions_costs(env, to_spill,
924 if (remat_cost >= REMAT_COST_INFINITE) {
925 DBG((dbg, LEVEL_2, "\tremat before %+F not possible\n",
927 rld->remat_cost_delta = REMAT_COST_INFINITE;
928 all_remat_costs = REMAT_COST_INFINITE;
932 remat_cost_delta = remat_cost - env->reload_cost;
933 rld->remat_cost_delta = remat_cost_delta;
934 block = is_Block(reloader) ? reloader : get_nodes_block(reloader);
935 freq = get_block_execfreq(exec_freq, block);
936 all_remat_costs += remat_cost_delta * freq;
937 DBG((dbg, LEVEL_2, "\tremat costs delta before %+F: "
938 "%d (rel %f)\n", reloader, remat_cost_delta,
939 remat_cost_delta * freq));
941 if (all_remat_costs < REMAT_COST_INFINITE) {
942 /* we don't need the costs for the spill if we can remat
944 all_remat_costs -= si->spill_costs;
946 DBG((dbg, LEVEL_2, "\tspill costs %d (rel %f)\n",
947 env->spill_cost, si->spill_costs));
950 if (all_remat_costs < 0) {
951 DBG((dbg, LEVEL_1, "\nforcing remats of all reloaders (%f)\n",
957 /* go through all reloads for this spill */
958 for (rld = si->reloaders; rld != NULL; rld = rld->next) {
959 ir_node *copy; /* a reload is a "copy" of the original value */
961 if (rld->rematted_node != NULL) {
962 copy = rld->rematted_node;
963 sched_add_before(rld->reloader, copy);
964 } else if (be_do_remats &&
965 (force_remat || rld->remat_cost_delta < 0)) {
966 copy = do_remat(env, to_spill, rld->reloader);
968 /* make sure we have a spill */
971 /* create a reload, use the first spill for now SSA
972 * reconstruction for memory comes below */
973 assert(si->spills != NULL);
974 copy = be_reload(si->reload_cls, rld->reloader, mode,
976 #ifdef FIRM_STATISTICS
981 DBG((dbg, LEVEL_1, " %+F of %+F before %+F\n",
982 copy, to_spill, rld->reloader));
983 ARR_APP1(ir_node*, copies, copy);
986 /* if we had any reloads or remats, then we need to reconstruct the
987 * SSA form for the spilled value */
988 if (ARR_LEN(copies) > 0) {
989 be_ssa_construction_env_t senv;
990 /* be_lv_t *lv = be_get_irg_liveness(env->irg); */
992 be_ssa_construction_init(&senv, env->irg);
993 be_ssa_construction_add_copy(&senv, to_spill);
994 be_ssa_construction_add_copies(&senv, copies, ARR_LEN(copies));
995 be_ssa_construction_fix_users(&senv, to_spill);
998 /* no need to enable this as long as we invalidate liveness
999 after this function... */
1000 be_ssa_construction_update_liveness_phis(&senv);
1001 be_liveness_update(to_spill);
1002 len = ARR_LEN(copies);
1003 for (i = 0; i < len; ++i) {
1004 be_liveness_update(lv, copies[i]);
1007 be_ssa_construction_destroy(&senv);
1009 /* need to reconstruct SSA form if we had multiple spills */
1010 if (si->spills != NULL && si->spills->next != NULL) {
1012 int spill_count = 0;
1014 be_ssa_construction_env_t senv;
1016 be_ssa_construction_init(&senv, env->irg);
1018 for ( ; spill != NULL; spill = spill->next) {
1019 /* maybe we rematerialized the value and need no spill */
1020 if (spill->spill == NULL)
1022 be_ssa_construction_add_copy(&senv, spill->spill);
1025 if (spill_count > 1) {
1026 /* all reloads are attached to the first spill, fix them now */
1027 be_ssa_construction_fix_users(&senv, si->spills->spill);
1030 be_ssa_construction_destroy(&senv);
1034 si->reloaders = NULL;
1037 stat_ev_dbl("spill_spills", env->spill_count);
1038 stat_ev_dbl("spill_reloads", env->reload_count);
1039 stat_ev_dbl("spill_remats", env->remat_count);
1040 stat_ev_dbl("spill_spilled_phis", env->spilled_phi_count);
1042 /* Matze: In theory be_ssa_construction should take care of the liveness...
1043 * try to disable this again in the future */
1044 be_liveness_invalidate(be_get_irg_liveness(env->irg));
1046 be_remove_dead_nodes_from_schedule(env->irg);
1048 be_timer_pop(T_RA_SPILL_APPLY);
1051 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_spill);
1052 void be_init_spill(void)
1054 FIRM_DBG_REGISTER(dbg, "firm.be.spill");