4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 typedef struct _reloader_t reloader_t;
18 typedef struct _spill_info_t spill_info_t;
25 struct _spill_info_t {
26 ir_node *spilled_node;
27 reloader_t *reloaders;
30 typedef struct _spill_ctx_t {
31 ir_node *spilled; /**< The spilled node. */
32 ir_node *user; /**< The node this spill is for. */
33 ir_node *spill; /**< The spill itself. */
37 firm_dbg_module_t *dbg;
38 const arch_register_class_t *cls;
39 const be_main_session_env_t *session;
42 set *spills; /**< all spill_info_t's, which must be placed */
45 static int cmp_spillctx(const void *a, const void *b, size_t n) {
46 const spill_ctx_t *p = a;
47 const spill_ctx_t *q = b;
48 return !(p->user == q->user && p->spilled == q->spilled);
51 static int cmp_spillinfo(const void *x, const void *y, size_t size) {
52 const spill_info_t *xx = x;
53 const spill_info_t *yy = y;
54 return ! (xx->spilled_node == yy->spilled_node);
57 spill_env_t *be_new_spill_env(const be_main_session_env_t *session,
58 const arch_register_class_t *cls)
60 spill_env_t *env = malloc(sizeof(env[0]));
61 env->spill_ctxs = new_set(cmp_spillctx, 1024);
62 env->spills = new_set(cmp_spillinfo, 1024);
63 env->session = session;
65 env->dbg = firm_dbg_register("be.ra.spill_env");
66 obstack_init(&env->obst);
70 void be_delete_spill_env(spill_env_t *senv)
72 del_set(senv->spill_ctxs);
73 del_set(senv->spills);
74 obstack_free(&senv->obst, NULL);
78 static spill_ctx_t *be_get_spill_ctx(set *sc, ir_node *to_spill, ir_node *ctx_irn) {
81 templ.spilled = to_spill;
85 return set_insert(sc, &templ, sizeof(templ), HASH_COMBINE(HASH_PTR(to_spill), HASH_PTR(ctx_irn)));
88 static ir_node *be_spill_irn(spill_env_t *senv, ir_node *irn, ir_node *ctx_irn) {
90 // DBG((dbg, DBG_SPILL, "spill_irn %+F\n", irn));
92 ctx = be_get_spill_ctx(senv->spill_ctxs, irn, ctx_irn);
94 const be_main_env_t *env = senv->session->main_env;
95 ctx->spill = be_spill(env->node_factory, env->arch_env, irn);
102 * If the first usage of a phi result would be out of memory
103 * there is no sense in allocating a register for it.
104 * Thus we spill it and all its operands to the same spill slot.
105 * Therefore the phi/dataB becomes a phi/Memory
107 static ir_node *be_spill_phi(spill_env_t *senv, ir_node *phi, ir_node *ctx_irn,
109 int i, n = get_irn_arity(phi);
110 ir_node **ins, *bl = get_nodes_block(phi);
111 ir_graph *irg = senv->session->irg;
115 // DBG((dbg, DBG_SPILL, "spill_phi %+F\n", phi));
117 /* search an existing spill for this context */
118 ctx = be_get_spill_ctx(senv->spill_ctxs, phi, ctx_irn);
120 /* if not found spill the phi */
122 /* build a new PhiM with dummy in-array */
123 ins = malloc(n * sizeof(ins[0]));
125 ins[i] = new_r_Unknown(irg, mode_M);
126 ctx->spill = new_r_Phi(senv->session->irg, bl, n, ins, mode_M);
129 /* re-wire the phiM */
131 ir_node *arg = get_irn_n(phi, i);
134 if(is_Phi(arg) && pset_find_ptr(mem_phis, arg))
135 sub_res = be_spill_phi(senv, arg, ctx_irn, mem_phis);
137 sub_res = be_spill_irn(senv, arg, ctx_irn);
139 set_irn_n(ctx->spill, i, sub_res);
145 ir_node *be_spill_node(spill_env_t *senv, ir_node *to_spill, pset *mem_phis) {
147 if (pset_find_ptr(mem_phis, to_spill))
148 res = be_spill_phi(senv, to_spill, to_spill, mem_phis);
150 res = be_spill_irn(senv, to_spill, to_spill);
155 void insert_spills_reloads(spill_env_t *senv, pset *mem_phis, pset *reload_set)
157 ir_graph *irg = senv->session->irg;
164 /* process each spilled node */
165 for(si = set_first(senv->spills); si; si = set_next(senv->spills)) {
169 ir_mode *mode = get_irn_mode(si->spilled_node);
171 /* go through all reloads for this spill */
172 for(rld = si->reloaders; rld; rld = rld->next) {
173 /* the spill for this reloader */
174 ir_node *spill = be_spill_node(senv, si->spilled_node, mem_phis);
177 ir_node *bl = is_Block(rld->reloader) ? rld->reloader : get_nodes_block(rld->reloader);
178 ir_node *reload = new_Reload(senv->session->main_env->node_factory,
179 senv->cls, irg, bl, mode, spill);
181 DBG((senv->dbg, LEVEL_2, " RELOADER %+F Reload %+F of %+F\n",
182 rld->reloader, reload, si->spilled_node));
184 pset_insert_ptr(reload_set, reload);
186 /* remember the reaload */
187 obstack_ptr_grow(&ob, reload);
188 sched_add_before(rld->reloader, reload);
192 assert(n_reloads > 0);
193 reloads = obstack_finish(&ob);
194 be_introduce_copies_ignore(senv->session->dom_front, si->spilled_node,
195 n_reloads, reloads, mem_phis);
196 obstack_free(&ob, reloads);
199 obstack_free(&ob, NULL);
201 for(irn = pset_first(mem_phis); irn; irn = pset_next(mem_phis)) {
203 for(i = 0, n = get_irn_arity(irn); i < n; ++i)
204 set_irn_n(irn, i, new_r_Bad(senv->session->irg));
209 void be_add_spill(spill_env_t *senv, ir_node *to_spill, ir_node *before)
211 spill_info_t templ, *res;
214 templ.spilled_node = to_spill;
215 templ.reloaders = NULL;
216 res = set_insert(senv->spills, &templ, sizeof(templ), HASH_PTR(to_spill));
218 rel = obstack_alloc(&senv->obst, sizeof(rel[0]));
219 rel->reloader = before;
220 rel->next = res->reloaders;
221 res->reloaders = rel;
224 void be_add_spill_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl, int pos)
226 ir_node *insert_bl = get_irn_arity(bl) == 1
227 ? sched_first(bl) : get_Block_cfgpred_block(bl, pos);
228 be_add_spill(senv, to_spill, insert_bl);