2 * Author: Daniel Grund, Sebastian Hack
4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 #include "iredges_t.h"
26 #include "besched_t.h"
29 #include "bechordal_t.h"
32 /* This enables re-computation of values. Current state: Unfinished and buggy. */
35 typedef struct _reloader_t reloader_t;
36 typedef struct _spill_info_t spill_info_t;
43 struct _spill_info_t {
44 ir_node *spilled_node;
45 reloader_t *reloaders;
48 typedef struct _spill_ctx_t {
49 ir_node *spilled; /**< The spilled node. */
50 ir_node *user; /**< The node this spill is for. */
51 ir_node *spill; /**< The spill itself. */
55 const arch_register_class_t *cls;
56 const be_chordal_env_t *chordal_env;
59 set *spills; /**< all spill_info_t's, which must be placed */
60 pset *mem_phis; /**< set of all special spilled phis. allocated and freed separately */
61 ir_node **copies; /**< set of copies placed because of phi spills */
62 DEBUG_ONLY(firm_dbg_module_t *dbg;)
65 /* associated Phi -> Spill*/
66 typedef struct _phi_spill_assoc_t {
72 * Compare two Phi->Spill associations.
74 static int cmp_phi_spill_assoc(const void *a, const void *b, size_t n) {
75 const phi_spill_assoc_t *p1 = a;
76 const phi_spill_assoc_t *p2 = b;
77 return p1->phi != p2->phi;
81 * compare two spill contexts.
83 static int cmp_spillctx(const void *a, const void *b, size_t n) {
84 const spill_ctx_t *p = a;
85 const spill_ctx_t *q = b;
86 return p->user != q->user || p->spilled != q->spilled;
90 * Compare two spill infos.
92 static int cmp_spillinfo(const void *x, const void *y, size_t size) {
93 const spill_info_t *xx = x;
94 const spill_info_t *yy = y;
95 return xx->spilled_node != yy->spilled_node;
99 /* Sets the debug module of a spill environment. */
100 void be_set_spill_env_dbg_module(spill_env_t *env, firm_dbg_module_t *dbg) {
105 /* Creates a new spill environment. */
106 spill_env_t *be_new_spill_env(const be_chordal_env_t *chordal_env) {
107 spill_env_t *env = xmalloc(sizeof(env[0]));
108 env->spill_ctxs = new_set(cmp_spillctx, 1024);
109 env->spills = new_set(cmp_spillinfo, 1024);
110 env->cls = chordal_env->cls;
111 env->chordal_env = chordal_env;
112 env->mem_phis = pset_new_ptr_default();
113 env->copies = NEW_ARR_F(ir_node*, 0);
114 obstack_init(&env->obst);
118 /* Deletes a spill environment. */
119 void be_delete_spill_env(spill_env_t *env) {
120 del_set(env->spill_ctxs);
121 del_set(env->spills);
122 del_pset(env->mem_phis);
123 DEL_ARR_F(env->copies);
124 obstack_free(&env->obst, NULL);
129 * Returns a spill context. If the context did not exists, create one.
131 * @param sc the set containing all spill contexts
132 * @param to_spill the node that should be spilled
133 * @param ctx_irn an user of the spilled node
135 * @return a spill context.
137 static spill_ctx_t *be_get_spill_ctx(set *sc, ir_node *to_spill, ir_node *ctx_irn) {
140 templ.spilled = to_spill;
141 templ.user = ctx_irn;
144 return set_insert(sc, &templ, sizeof(templ), HASH_COMBINE(HASH_PTR(to_spill), HASH_PTR(ctx_irn)));
150 * @param senv the spill environment
151 * @param irn the node that should be spilled
152 * @param ctx_irn an user of the spilled node
154 * @return a be_Spill node
156 static ir_node *be_spill_irn(spill_env_t *senv, ir_node *irn, ir_node *ctx_irn) {
158 const be_main_env_t *env = senv->chordal_env->birg->main_env;
159 DBG((senv->dbg, LEVEL_1, "%+F in ctx %+F\n", irn, ctx_irn));
161 // Has the value already been spilled?
162 ctx = be_get_spill_ctx(senv->spill_ctxs, irn, ctx_irn);
166 /* Trying to spill an already spilled value, no need for a new spill
167 * node then, we can simply connect to the same one for this reload
169 if(be_is_Reload(irn)) {
170 return get_irn_n(irn, be_pos_Reload_mem);
173 ctx->spill = be_spill(env->arch_env, irn, ctx_irn);
179 * Removes all copies introduced for phi-spills
181 static void remove_copies(spill_env_t *env) {
184 for(i = 0; i < ARR_LEN(env->copies); ++i) {
185 ir_node *node = env->copies[i];
187 const ir_edge_t *edge, *ne;
189 assert(be_is_Copy(node));
191 src = be_get_Copy_op(node);
192 foreach_out_edge_safe(node, edge, ne) {
193 ir_node *user = get_edge_src_irn(edge);
194 int user_pos = get_edge_src_pos(edge);
196 set_irn_n(user, user_pos, src);
200 ARR_SETLEN(ir_node*, env->copies, 0);
204 * Inserts a copy (needed for spilled phi handling) of a value at the earliest
205 * possible location in a block. That is after the last use/def of the value or at
206 * the beginning of the block if there is no use/def.
208 static ir_node *insert_copy(spill_env_t *env, ir_node *block, ir_node *value) {
210 ir_graph *irg = get_irn_irg(block);
211 ir_node *copy = be_new_Copy(env->cls, irg, block, value);
213 ARR_APP1(ir_node*, env->copies, copy);
215 // walk schedule backwards until we find a use, a def, or until we have reached the first phi
216 sched_foreach_reverse(block, node) {
220 sched_add_after(node, copy);
224 sched_add_after(node, copy);
227 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
228 ir_node *arg = get_irn_n(node, i);
230 sched_add_after(node, copy);
235 // we didn't find a use or a phi yet, so place the copy at the beginning of the block
236 sched_add_before(sched_first(block), copy);
244 * If the first usage of a Phi result would be out of memory
245 * there is no sense in allocating a register for it.
246 * Thus we spill it and all its operands to the same spill slot.
247 * Therefore the phi/dataB becomes a phi/Memory
249 * @param senv the spill environment
250 * @param phi the Phi node that should be spilled
251 * @param ctx_irn an user of the spilled node
253 * @return a be_Spill node
255 static ir_node *spill_phi(spill_env_t *senv, ir_node *phi, ir_node *ctx_irn, set *already_visited_phis, bitset_t *bs) {
257 int arity = get_irn_arity(phi);
258 ir_graph *irg = senv->chordal_env->irg;
259 ir_node *bl = get_nodes_block(phi);
260 ir_node **ins, *phi_spill;
261 phi_spill_assoc_t key;
265 DBG((senv->dbg, LEVEL_1, "%+F in ctx %+F\n", phi, ctx_irn));
267 /* build a new PhiM */
268 NEW_ARR_A(ir_node *, ins, arity);
269 for (i = 0; i < arity; ++i) {
270 ins[i] = new_r_Bad(irg);
272 phi_spill = new_r_Phi(senv->chordal_env->irg, bl, arity, ins, mode_M);
274 key.spill = phi_spill;
275 set_insert(already_visited_phis, &key, sizeof(key), HASH_PTR(phi));
276 bitset_set(bs, get_irn_idx(phi));
278 /* search an existing spill for this context */
279 ctx = be_get_spill_ctx(senv->spill_ctxs, phi, ctx_irn);
281 /* if not found spill the phi */
283 /* collect all arguments of the phi */
284 for (i = 0; i < arity; ++i) {
285 ir_node *arg = get_irn_n(phi, i);
287 phi_spill_assoc_t *entry;
289 if(is_Phi(arg) && pset_find_ptr(senv->mem_phis, arg)) {
293 } else if (! bitset_is_set(bs, get_irn_idx(arg))) {
294 sub_res = spill_phi(senv, arg, ctx_irn, already_visited_phis, bs);
296 /* we already visited the argument phi: get it's spill */
299 entry = set_find(already_visited_phis, &key, sizeof(key), HASH_PTR(arg));
300 assert(entry && "argument phi already visited, but no spill found?!?");
301 sub_res = entry->spill;
302 assert(sub_res && "spill missing?!?");
306 sub_res = be_spill_irn(senv, arg, ctx_irn);
308 set_irn_n(phi_spill, i, sub_res);
311 ctx->spill = phi_spill;
319 * @param senv the spill environment
320 * @param to_spill the node that should be spilled
322 * @return a be_Spill node
324 static ir_node *be_spill_node(spill_env_t *senv, ir_node *to_spill) {
325 ir_graph *irg = get_irn_irg(to_spill);
328 if (pset_find_ptr(senv->mem_phis, to_spill)) {
329 set *already_visited_phis = new_set(cmp_phi_spill_assoc, 10);
330 bitset_t *bs = bitset_alloca(get_irg_last_idx(irg));
331 res = spill_phi(senv, to_spill, to_spill, already_visited_phis, bs);
332 del_set(already_visited_phis);
334 res = be_spill_irn(senv, to_spill, to_spill);
345 * Check if a spilled node could be rematerialized.
347 * @param senv the spill environment
348 * @param spill the Spill node
349 * @param spilled the node that was spilled
350 * @param reloader a irn that requires a reload
352 static int check_remat_conditions(spill_env_t *senv, ir_node *spill, ir_node *spilled, ir_node *reloader) {
355 /* check for 'normal' spill and general remat condition */
356 if (!be_is_Spill(spill) || !arch_irn_is(senv->chordal_env->birg->main_env->arch_env, spilled, rematerializable))
359 /* check availability of original arguments */
360 if (is_Block(reloader)) {
362 /* we want to remat at the end of a block.
363 * thus all arguments must be alive at the end of the block
365 for (pos=0, max=get_irn_arity(spilled); pos<max; ++pos) {
366 ir_node *arg = get_irn_n(spilled, pos);
367 if (!is_live_end(reloader, arg))
373 /* we want to remat before the insn reloader
374 * thus an arguments is alive if
375 * - it interferes with the reloaders result
377 * - or it is (last-) used by reloader itself
379 for (pos=0, max=get_irn_arity(spilled); pos<max; ++pos) {
380 ir_node *arg = get_irn_n(spilled, pos);
383 if (values_interfere(reloader, arg))
386 for (i=0, m=get_irn_arity(reloader); i<m; ++i) {
387 ir_node *rel_arg = get_irn_n(reloader, i);
392 /* arg is not alive before reloader */
404 #else /* BUGGY_REMAT */
407 * A very simple rematerialization checker.
409 * @param senv the spill environment
410 * @param spill the Spill node
411 * @param spilled the node that was spilled
412 * @param reloader a irn that requires a reload
414 static int check_remat_conditions(spill_env_t *senv, ir_node *spill, ir_node *spilled, ir_node *reloader) {
415 const arch_env_t *aenv = senv->chordal_env->birg->main_env->arch_env;
417 return get_irn_arity(spilled) == 0 &&
418 be_is_Spill(spill) &&
419 arch_irn_is(aenv, spilled, rematerializable);
422 #endif /* BUGGY_REMAT */
427 * Re-materialize a node.
429 * @param senv the spill environment
430 * @param spilled the node that was spilled
431 * @param reloader a irn that requires a reload
433 static ir_node *do_remat(spill_env_t *senv, ir_node *spilled, ir_node *reloader) {
435 ir_node *bl = (is_Block(reloader)) ? reloader : get_nodes_block(reloader);
437 /* recompute the value */
438 res = new_ir_node(get_irn_dbg_info(spilled), senv->chordal_env->irg, bl,
440 get_irn_mode(spilled),
441 get_irn_arity(spilled),
442 get_irn_in(spilled) + 1);
443 copy_node_attr(spilled, res);
445 DBG((senv->dbg, LEVEL_1, "Insert remat %+F before reloader %+F\n", res, reloader));
447 /* insert in schedule */
448 if (is_Block(reloader)) {
449 ir_node *insert = sched_skip(reloader, 0, sched_skip_cf_predicator, (void *) senv->chordal_env->birg->main_env->arch_env);
450 sched_add_after(insert, res);
452 sched_add_before(reloader, res);
458 void be_spill_phi(spill_env_t *env, ir_node *node) {
459 assert(is_Phi(node));
461 pset_insert_ptr(env->mem_phis, node);
464 void be_insert_spills_reloads(spill_env_t *env) {
465 const arch_env_t *arch_env = env->chordal_env->birg->main_env->arch_env;
469 DBG((env->dbg, LEVEL_1, "Reloads for mem-phis:\n"));
470 foreach_pset(env->mem_phis, node) {
474 assert(is_Phi(node));
476 /* We have to place copy nodes in the predecessor blocks to temporarily
477 * produce new values that get separate spill slots
479 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
480 ir_node *pred_block, *arg, *copy;
482 /* Don't do anything for looping edges (there's no need
483 * and placing copies here breaks stuff as it suddenly
484 * generates new living values through the whole loop)
486 arg = get_irn_n(node, i);
490 pred_block = get_Block_cfgpred_block(get_nodes_block(node), i);
491 copy = insert_copy(env, pred_block, arg);
493 set_irn_n(node, i, copy);
496 /* Add reloads for mem_phis */
497 /* BETTER: These reloads (1) should only be inserted, if they are really needed */
498 DBG((env->dbg, LEVEL_1, " Mem-phi %+F\n", node));
499 foreach_out_edge(node, e) {
500 ir_node *user = e->src;
501 if (is_Phi(user) && !pset_find_ptr(env->mem_phis, user)) {
502 ir_node *use_bl = get_nodes_block(user);
503 DBG((env->dbg, LEVEL_1, " non-mem-phi user %+F\n", user));
504 be_add_reload_on_edge(env, node, use_bl, e->pos); /* (1) */
509 /* process each spilled node */
510 DBG((env->dbg, LEVEL_1, "Insert spills and reloads:\n"));
511 for(si = set_first(env->spills); si; si = set_next(env->spills)) {
513 ir_mode *mode = get_irn_mode(si->spilled_node);
515 pset *values = pset_new_ptr(16);
517 /* go through all reloads for this spill */
518 for(rld = si->reloaders; rld; rld = rld->next) {
521 /* the spill for this reloader */
522 ir_node *spill = be_spill_node(env, si->spilled_node);
525 if (check_remat_conditions(env, spill, si->spilled_node, rld->reloader)) {
526 new_val = do_remat(env, si->spilled_node, rld->reloader);
527 //pdeq_putl(possibly_dead, spill);
532 new_val = be_reload(arch_env, env->cls, rld->reloader, mode, spill);
534 DBG((env->dbg, LEVEL_1, " %+F of %+F before %+F\n", new_val, si->spilled_node, rld->reloader));
535 pset_insert_ptr(values, new_val);
538 /* introduce copies, rewire the uses */
539 assert(pset_count(values) > 0 && "???");
540 pset_insert_ptr(values, si->spilled_node);
541 be_ssa_constr_set_ignore(env->chordal_env->dom_front, values, env->mem_phis);
548 // reloads are placed now, but we might reuse the spill environment for further spilling decisions
549 del_set(env->spills);
550 env->spills = new_set(cmp_spillinfo, 1024);
553 void be_add_reload(spill_env_t *env, ir_node *to_spill, ir_node *before) {
554 spill_info_t templ, *res;
557 assert(sched_is_scheduled(before));
558 assert(arch_irn_consider_in_reg_alloc(env->chordal_env->birg->main_env->arch_env, env->cls, to_spill));
560 templ.spilled_node = to_spill;
561 templ.reloaders = NULL;
562 res = set_insert(env->spills, &templ, sizeof(templ), HASH_PTR(to_spill));
564 rel = obstack_alloc(&env->obst, sizeof(rel[0]));
565 rel->reloader = before;
566 rel->next = res->reloaders;
567 res->reloaders = rel;
570 void be_add_reload_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos) {
571 ir_node *predblock, *last;
573 /* simply add the reload to the beginning of the block if we only have 1 predecessor
574 * (we don't need to check for phis as there can't be any in a block with only 1 pred)
576 if(get_Block_n_cfgpreds(block) == 1) {
577 assert(!is_Phi(sched_first(block)));
578 be_add_reload(env, to_spill, sched_first(block));
582 // We have to reload the value in pred-block
583 predblock = get_Block_cfgpred_block(block, pos);
584 last = sched_last(predblock);
585 // there should be exactly 1 jump at the end of the block
586 assert(is_cfop(last));
588 // add the reload before the (cond-)jump
589 be_add_reload(env, to_spill, last);
592 /****************************************
594 SPILL SLOT MANAGEMENT AND OPTS
596 ****************************************/
598 typedef struct _spill_slot_t {
602 ir_mode *largest_mode; /* the mode of all members with largest size */
605 typedef struct _ss_env_t {
607 be_chordal_env_t *cenv;
608 pmap *slots; /* maps spill_contexts to spill_slots */
609 pmap *types; /* maps modes to types */
610 DEBUG_ONLY(firm_dbg_module_t *dbg;)
615 * Walker: compute the spill slots
617 static void compute_spill_slots_walker(ir_node *spill, void *env) {
618 ss_env_t *ssenv = env;
623 if (!be_is_Spill(spill))
626 /* check, if this spill is for a context already known */
627 ctx = be_get_Spill_context(spill);
628 entry = pmap_find(ssenv->slots, ctx);
631 struct _arch_env_t *arch_env = ssenv->cenv->birg->main_env->arch_env;
632 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, spill, be_pos_Spill_val);
633 ir_mode *largest_mode = arch_register_class_mode(cls);
635 /* this is a new spill context */
636 ss = obstack_alloc(&ssenv->ob, sizeof(*ss));
637 ss->members = pset_new_ptr(8);
638 ss->largest_mode = largest_mode;
639 ss->size = get_mode_size_bytes(ss->largest_mode);
640 ss->align = arch_isa_get_reg_class_alignment(arch_env->isa, cls);
641 pmap_insert(ssenv->slots, ctx, ss);
643 /* values with the same spill_ctx must go into the same spill slot */
647 /* ugly mega assert :-) */
650 struct _arch_env_t *arch_env = ssenv->cenv->birg->main_env->arch_env;
651 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, spill, be_pos_Spill_val);
652 int size = get_mode_size_bytes(arch_register_class_mode(cls));
653 assert((int) ss->size == size && "Different sizes for the same spill slot are not allowed.");
654 for (irn = pset_first(ss->members); irn; irn = pset_next(ss->members)) {
655 /* use values_interfere here, because it uses the dominance check,
656 which does work for values in memory */
657 assert(!values_interfere(spill, irn) && "Spills for the same spill slot must not interfere!");
663 pset_insert_ptr(ss->members, spill);
667 * qsort compare function, sort spill slots by size.
669 static int ss_sorter(const void *v1, const void *v2) {
670 const spill_slot_t **ss1 = (const spill_slot_t **)v1;
671 const spill_slot_t **ss2 = (const spill_slot_t **)v2;
672 return ((int) (*ss2)->size) - ((int) (*ss1)->size);
677 * This function should optimize the spill slots.
678 * - Coalescing of multiple slots
679 * - Ordering the slots
681 * Input slots are in @p ssenv->slots
682 * @p size The count of initial spill slots in @p ssenv->slots
683 * This also is the size of the preallocated array @p ass
685 * @return An array of spill slots @p ass in specific order
687 static void optimize_slots(ss_env_t *ssenv, int size, spill_slot_t *ass[]) {
688 int i, o, used_slots;
692 pmap_foreach(ssenv->slots, entr)
693 ass[i++] = entr->value;
695 /* Sort the array to minimize fragmentation and cache footprint.
696 Large slots come first */
697 qsort(ass, size, sizeof(ass[0]), ss_sorter);
699 /* For each spill slot:
700 - assign a new offset to this slot
701 - xor find another slot to coalesce with */
703 for (i=0; i<size; ++i) { /* for each spill slot */
707 DBG((ssenv->dbg, LEVEL_1, "Spill slot %d members:\n", i));
708 for(n1 = pset_first(ass[i]->members); n1; n1 = pset_next(ass[i]->members))
709 DBG((ssenv->dbg, LEVEL_1, " %+F\n", n1));
712 for (o=0; o < used_slots && tgt_slot == -1; ++o) { /* for each offset-assigned spill slot */
713 /* check inter-slot-pairs for interference */
715 for(n1 = pset_first(ass[i]->members); n1; n1 = pset_next(ass[i]->members))
716 for(n2 = pset_first(ass[o]->members); n2; n2 = pset_next(ass[o]->members))
717 if(values_interfere(n1, n2)) {
718 pset_break(ass[i]->members);
719 pset_break(ass[o]->members);
720 DBG((ssenv->dbg, LEVEL_1, " Interf %+F -- %+F\n", n1, n2));
721 goto interf_detected;
724 /* if we are here, there is no interference between ass[i] and ass[o] */
727 interf_detected: /*nothing*/ ;
730 /* now the members of ass[i] join the members of ass[tgt_slot] */
732 /* do we need a new slot? */
733 if (tgt_slot == -1) {
734 tgt_slot = used_slots;
739 ass[tgt_slot]->size = ass[i]->size;
740 del_pset(ass[tgt_slot]->members);
741 ass[tgt_slot]->members = pset_new_ptr(8);
745 /* copy the members to the target pset */
746 /* NOTE: If src and tgt pset are the same, inserting while iterating is not allowed */
748 for(n1 = pset_first(ass[i]->members); n1; n1 = pset_next(ass[i]->members))
749 pset_insert_ptr(ass[tgt_slot]->members, n1);
753 #define ALIGN_SPILL_AREA 16
754 #define pset_foreach(pset, elm) for(elm=pset_first(pset); elm; elm=pset_next(pset))
757 * Returns a spill type for a mode. Keep them in a map to reduce
758 * the number of types.
760 * @param types a map containing all created types
761 * @param ss the spill slot
763 * Note that type types should are identical for every mode.
764 * This rule might break if two different register classes return the same
765 * mode but different alignments.
767 static ir_type *get_spill_type(pmap *types, spill_slot_t *ss) {
768 pmap_entry *e = pmap_find(types, ss->largest_mode);
773 snprintf(buf, sizeof(buf), "spill_slot_type_%s", get_mode_name(ss->largest_mode));
774 res = new_type_primitive(new_id_from_str(buf), ss->largest_mode);
775 set_type_alignment_bytes(res, ss->align);
776 pmap_insert(types, ss->largest_mode, res);
779 assert(get_type_alignment_bytes(res) == (int)ss->align);
786 * Create spill slot entities on the frame type.
788 * @param ssenv the spill environment
789 * @param n number of spill slots
790 * @param ss array of spill slots
792 static void assign_entities(ss_env_t *ssenv, int n_slots, spill_slot_t *ss[]) {
793 int i, offset, frame_align;
794 ir_type *frame = get_irg_frame_type(ssenv->cenv->irg);
796 /* aligning by increasing frame size */
797 offset = get_type_size_bits(frame) / 8;
798 offset = round_up2(offset, ALIGN_SPILL_AREA);
799 set_type_size_bytes(frame, -1);
801 /* create entities and assign offsets according to size and alignment*/
802 for (i = 0; i < n_slots; ++i) {
809 snprintf(buf, sizeof(buf), "spill_slot_%d", i);
810 name = new_id_from_str(buf);
812 spill_ent = new_entity(frame, name, get_spill_type(ssenv->types, ss[i]));
815 offset = round_up2(offset, ss[i]->align);
817 set_entity_offset_bytes(spill_ent, offset);
818 /* next possible offset */
819 offset += round_up2(ss[i]->size, ss[i]->align);
821 pset_foreach(ss[i]->members, irn)
822 be_set_Spill_entity(irn, spill_ent);
826 /* set final size of stack frame */
827 frame_align = get_type_alignment_bytes(frame);
828 set_type_size_bytes(frame, round_up2(offset, frame_align));
831 void be_compute_spill_offsets(be_chordal_env_t *cenv) {
837 obstack_init(&ssenv.ob);
839 ssenv.slots = pmap_create();
840 ssenv.types = pmap_create();
841 FIRM_DBG_REGISTER(ssenv.dbg, "ir.be.spillslots");
843 /* Get initial spill slots */
844 irg_walk_graph(cenv->irg, NULL, compute_spill_slots_walker, &ssenv);
846 /* Build an empty array for optimized spill slots */
847 ss_size = pmap_count(ssenv.slots);
848 ss = obstack_alloc(&ssenv.ob, ss_size * sizeof(*ss));
849 optimize_slots(&ssenv, ss_size, ss);
851 /* Integrate slots into the stack frame entity */
852 assign_entities(&ssenv, ss_size, ss);
855 pmap_foreach(ssenv.slots, pme)
856 del_pset(((spill_slot_t *)pme->value)->members);
857 pmap_destroy(ssenv.slots);
858 pmap_destroy(ssenv.types);
859 obstack_free(&ssenv.ob, NULL);
861 be_copy_entities_to_reloads(cenv->irg);