2 * Copyright (C) 1995-2011 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 Performs lowering of perm nodes. Inserts copies to assure
23 * register constraints.
24 * @author Christian Wuerdig
34 #include "irnodeset.h"
35 #include "irnodehashmap.h"
37 #include "iredges_t.h"
46 #include "bessaconstr.h"
47 #include "beintlive_t.h"
49 #undef KEEP_ALIVE_COPYKEEP_HACK
51 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
52 DEBUG_ONLY(static firm_dbg_module_t *dbg_constr;)
53 DEBUG_ONLY(static firm_dbg_module_t *dbg_permmove;)
55 /** Associates an ir_node with its copy and CopyKeep. */
57 ir_nodeset_t copies; /**< all non-spillable copies of this irn */
58 const arch_register_class_t *cls;
61 /** Environment for constraints. */
64 ir_nodehashmap_t op_set;
68 /** Lowering walker environment. */
69 typedef struct lower_env_t {
74 /** Holds a Perm register pair. */
75 typedef struct reg_pair_t {
76 const arch_register_t *in_reg; /**< a perm IN register */
77 ir_node *in_node; /**< the in node to which the register belongs */
79 const arch_register_t *out_reg; /**< a perm OUT register */
80 ir_node *out_node; /**< the out node to which the register belongs */
82 int checked; /**< indicates whether the pair was check for cycle or not */
85 typedef enum perm_type_t {
92 /** Structure to represent cycles or chains in a Perm. */
93 typedef struct perm_cycle_t {
94 const arch_register_t **elems; /**< the registers in the cycle */
95 int n_elems; /**< number of elements in the cycle */
96 perm_type_t type; /**< type (CHAIN or CYCLE) */
99 /** returns the number register pairs marked as checked. */
100 static int get_n_unchecked_pairs(reg_pair_t const *const pairs, int const n)
105 for (i = 0; i < n; i++) {
106 if (!pairs[i].checked)
114 * Gets the node corresponding to an IN register from an array of register pairs.
115 * NOTE: The given registers pairs and the register to look for must belong
116 * to the same register class.
118 * @param pairs The array of register pairs
119 * @param n The number of pairs
120 * @param reg The register to look for
121 * @return The corresponding node or NULL if not found
123 static ir_node *get_node_for_in_register(reg_pair_t *pairs, int n, const arch_register_t *reg)
127 for (i = 0; i < n; i++) {
128 /* in register matches */
129 if (pairs[i].in_reg->index == reg->index)
130 return pairs[i].in_node;
137 * Gets the node corresponding to an OUT register from an array of register pairs.
138 * NOTE: The given registers pairs and the register to look for must belong
139 * to the same register class.
141 * @param pairs The array of register pairs
142 * @param n The number of pairs
143 * @param reg The register to look for
144 * @return The corresponding node or NULL if not found
146 static ir_node *get_node_for_out_register(reg_pair_t *pairs, int n, const arch_register_t *reg)
150 for (i = 0; i < n; i++) {
151 /* out register matches */
152 if (pairs[i].out_reg->index == reg->index)
153 return pairs[i].out_node;
160 * Gets the index in the register pair array where the in register
161 * corresponds to reg_idx.
163 * @param pairs The array of register pairs
164 * @param n The number of pairs
165 * @param reg The register index to look for
167 * @return The corresponding index in pairs or -1 if not found
169 static int get_pairidx_for_in_regidx(reg_pair_t *pairs, int n, unsigned reg_idx)
173 for (i = 0; i < n; i++) {
174 /* in register matches */
175 if (pairs[i].in_reg->index == reg_idx)
182 * Gets the index in the register pair array where the out register
183 * corresponds to reg_idx.
185 * @param pairs The array of register pairs
186 * @param n The number of pairs
187 * @param reg The register index to look for
189 * @return The corresponding index in pairs or -1 if not found
191 static int get_pairidx_for_out_regidx(reg_pair_t *pairs, int n, unsigned reg_idx)
195 for (i = 0; i < n; i++) {
196 /* out register matches */
197 if (pairs[i].out_reg->index == reg_idx)
204 * Gets an array of register pairs and tries to identify a cycle or chain
205 * starting at position start.
207 * @param cycle Variable to hold the cycle
208 * @param pairs Array of register pairs
209 * @param n length of the pairs array
210 * @param start Index to start
212 * @return The cycle or chain
214 static void get_perm_cycle(perm_cycle_t *const cycle,
215 reg_pair_t *const pairs,
219 int head = pairs[start].in_reg->index;
220 int cur_idx = pairs[start].out_reg->index;
221 int const n_pairs_todo = get_n_unchecked_pairs(pairs, n);
222 perm_type_t cycle_tp = PERM_CYCLE;
225 /* We could be right in the middle of a chain, so we need to find the start */
226 while (head != cur_idx) {
227 /* goto previous register in cycle or chain */
228 int const cur_pair_idx = get_pairidx_for_out_regidx(pairs, n, head);
230 if (cur_pair_idx < 0) {
231 cycle_tp = PERM_CHAIN;
234 head = pairs[cur_pair_idx].in_reg->index;
235 start = cur_pair_idx;
239 /* assume worst case: all remaining pairs build a cycle or chain */
240 cycle->elems = XMALLOCNZ(const arch_register_t*, n_pairs_todo * 2);
241 cycle->n_elems = 2; /* initial number of elements is 2 */
242 cycle->elems[0] = pairs[start].in_reg;
243 cycle->elems[1] = pairs[start].out_reg;
244 cycle->type = cycle_tp;
245 cur_idx = pairs[start].out_reg->index;
248 /* check for cycle or end of a chain */
249 while (cur_idx != head) {
250 /* goto next register in cycle or chain */
251 int const cur_pair_idx = get_pairidx_for_in_regidx(pairs, n, cur_idx);
253 if (cur_pair_idx < 0)
256 cur_idx = pairs[cur_pair_idx].out_reg->index;
258 /* it's not the first element: insert it */
259 if (cur_idx != head) {
260 cycle->elems[idx++] = pairs[cur_pair_idx].out_reg;
263 /* we are there where we started -> CYCLE */
264 cycle->type = PERM_CYCLE;
268 /* mark all pairs having one in/out register with cycle in common as checked */
269 for (idx = 0; idx < cycle->n_elems; idx++) {
272 cur_pair_idx = get_pairidx_for_in_regidx(pairs, n, cycle->elems[idx]->index);
273 if (cur_pair_idx >= 0)
274 pairs[cur_pair_idx].checked = 1;
276 cur_pair_idx = get_pairidx_for_out_regidx(pairs, n, cycle->elems[idx]->index);
277 if (cur_pair_idx >= 0)
278 pairs[cur_pair_idx].checked = 1;
283 * Lowers a perm node. Resolves cycles and creates a bunch of
284 * copy and swap operations to permute registers.
285 * Note: The caller of this function has to make sure, that irn
288 * @param irn The perm node
289 * @param block The block the perm node belongs to
290 * @param env The lowerer environment
292 static void lower_perm_node(ir_node *irn, lower_env_t *env)
294 const arch_register_class_t *const reg_class = arch_get_irn_register(get_irn_n(irn, 0))->reg_class;
295 ir_node *const block = get_nodes_block(irn);
296 int const arity = get_irn_arity(irn);
297 reg_pair_t *const pairs = ALLOCAN(reg_pair_t, arity);
299 int do_copy = env->do_copy;
300 /* Get the schedule predecessor node to the perm.
301 * NOTE: This works with auto-magic. If we insert the new copy/exchange
302 * nodes after this node, everything should be ok. */
303 ir_node * sched_point = sched_prev(irn);
307 DBG((dbg, LEVEL_1, "perm: %+F, sched point is %+F\n", irn, sched_point));
308 assert(sched_point && "Perm is not scheduled or has no predecessor");
310 assert(arity == get_irn_n_edges(irn) && "perm's in and out numbers different");
312 /* build the list of register pairs (in, out) */
314 foreach_out_edge_safe(irn, edge) {
315 ir_node *const out = get_edge_src_irn(edge);
316 long const pn = get_Proj_proj(out);
317 ir_node *const in = get_irn_n(irn, pn);
318 arch_register_t const *const in_reg = arch_get_irn_register(in);
319 arch_register_t const *const out_reg = arch_get_irn_register(out);
322 if (in_reg == out_reg) {
323 DBG((dbg, LEVEL_1, "%+F removing equal perm register pair (%+F, %+F, %s)\n",
324 irn, in, out, out_reg->name));
331 pair->in_reg = in_reg;
332 pair->out_node = out;
333 pair->out_reg = out_reg;
337 DBG((dbg, LEVEL_1, "%+F has %d unresolved constraints\n", irn, n));
339 /* Set do_copy to 0 if it's on but we have no free register */
340 /* TODO check for free register */
345 /* check for cycles and chains */
346 while (get_n_unchecked_pairs(pairs, n) > 0) {
350 /* go to the first not-checked pair */
351 for (i = 0; pairs[i].checked; ++i) {}
352 get_perm_cycle(&cycle, pairs, n, i);
354 DB((dbg, LEVEL_1, "%+F: following %s created:\n ", irn, cycle.type == PERM_CHAIN ? "chain" : "cycle"));
355 for (j = 0; j < cycle.n_elems; j++) {
356 DB((dbg, LEVEL_1, " %s", cycle.elems[j]->name));
358 DB((dbg, LEVEL_1, "\n"));
360 if (cycle.type == PERM_CYCLE && arity == 2) {
361 /* We don't need to do anything if we have a Perm with two elements
362 * which represents a cycle, because those nodes already represent
366 /* TODO: - iff PERM_CYCLE && do_copy -> determine free temp reg and
367 * insert copy to/from it before/after the copy cascade (this
368 * reduces the cycle into a chain) */
370 /* build copy/swap nodes from back to front */
371 for (i = cycle.n_elems - 2; i >= 0; i--) {
372 ir_node *arg1 = get_node_for_in_register(pairs, n, cycle.elems[i]);
373 ir_node *arg2 = get_node_for_in_register(pairs, n, cycle.elems[i + 1]);
375 ir_node *res1 = get_node_for_out_register(pairs, n, cycle.elems[i]);
376 ir_node *res2 = get_node_for_out_register(pairs, n, cycle.elems[i + 1]);
377 /* If we have a cycle and don't copy: we need to create exchange
379 * NOTE: An exchange node is a perm node with 2 INs and 2 OUTs
380 * IN_1 = in node with register i
381 * IN_2 = in node with register i + 1
382 * OUT_1 = out node with register i + 1
383 * OUT_2 = out node with register i */
384 if (cycle.type == PERM_CYCLE && !do_copy) {
391 /* At this point we have to handle the following problem:
393 * If we have a cycle with more than two elements, then this
394 * could correspond to the following Perm node:
396 * +----+ +----+ +----+
397 * | r1 | | r2 | | r3 |
398 * +-+--+ +-+--+ +--+-+
401 * +-+--------+---------+-+
403 * +-+--------+---------+-+
406 * +-+--+ +-+--+ +--+-+
407 * |Proj| |Proj| |Proj|
408 * | r2 | | r3 | | r1 |
409 * +----+ +----+ +----+
411 * This node is about to be split up into two 2x Perm's for
412 * which we need 4 Proj's and the one additional Proj of the
413 * first Perm has to be one IN of the second. So in general
414 * we need to create one additional Proj for each "middle"
415 * Perm and set this to one in node of the successor Perm. */
417 DBG((dbg, LEVEL_1, "%+F creating exchange node (%+F, %s) and (%+F, %s) with\n",
418 irn, arg1, cycle.elems[i]->name, arg2, cycle.elems[i + 1]->name));
419 DBG((dbg, LEVEL_1, "%+F (%+F, %s) and (%+F, %s)\n",
420 irn, res1, cycle.elems[i]->name, res2, cycle.elems[i + 1]->name));
422 cpyxchg = be_new_Perm(reg_class, block, 2, in);
425 /* cycle is not done yet */
426 int pidx = get_pairidx_for_in_regidx(pairs, n, cycle.elems[i]->index);
428 /* create intermediate proj */
429 res1 = new_r_Proj(cpyxchg, get_irn_mode(res1), 0);
431 /* set as in for next Perm */
432 pairs[pidx].in_node = res1;
435 set_Proj_pred(res2, cpyxchg);
436 set_Proj_proj(res2, 0);
437 set_Proj_pred(res1, cpyxchg);
438 set_Proj_proj(res1, 1);
440 arch_set_irn_register(res2, cycle.elems[i + 1]);
441 arch_set_irn_register(res1, cycle.elems[i]);
443 /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
444 sched_add_after(skip_Proj(sched_point), cpyxchg);
446 DB((dbg, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point));
448 /* set the new scheduling point */
453 DB((dbg, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n",
454 irn, arg1, cycle.elems[i]->name, res2, cycle.elems[i + 1]->name));
456 cpyxchg = be_new_Copy(block, arg1);
457 arch_set_irn_register(cpyxchg, cycle.elems[i + 1]);
459 /* exchange copy node and proj */
460 exchange(res2, cpyxchg);
462 /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
463 sched_add_after(skip_Proj(sched_point), cpyxchg);
465 /* set the new scheduling point */
466 sched_point = cpyxchg;
471 free((void*)cycle.elems);
474 /* remove the perm from schedule */
483 static int has_irn_users(const ir_node *irn)
485 return get_irn_out_edge_first_kind(irn, EDGE_KIND_NORMAL) != 0;
488 static ir_node *find_copy(ir_node *irn, ir_node *op)
492 for (cur_node = irn;;) {
493 cur_node = sched_prev(cur_node);
494 if (! be_is_Copy(cur_node))
496 if (be_get_Copy_op(cur_node) == op && arch_irn_is(cur_node, dont_spill))
501 static void gen_assure_different_pattern(ir_node *irn, ir_node *other_different, constraint_env_t *env)
503 ir_nodehashmap_t *op_set;
505 const arch_register_class_t *cls;
507 op_copy_assoc_t *entry;
509 if (arch_irn_is_ignore(other_different) ||
510 !mode_is_datab(get_irn_mode(other_different))) {
511 DB((dbg_constr, LEVEL_1, "ignore constraint for %+F because other_irn is ignore or not a datab node\n", irn));
515 op_set = &env->op_set;
516 block = get_nodes_block(irn);
517 cls = arch_get_irn_reg_class(other_different);
519 /* Make a not spillable copy of the different node */
520 /* this is needed because the different irn could be */
521 /* in block far far away */
522 /* The copy is optimized later if not needed */
524 /* check if already exists such a copy in the schedule immediately before */
525 cpy = find_copy(skip_Proj(irn), other_different);
527 cpy = be_new_Copy(block, other_different);
528 arch_set_irn_flags(cpy, arch_irn_flags_dont_spill);
529 DB((dbg_constr, LEVEL_1, "created non-spillable %+F for value %+F\n", cpy, other_different));
531 DB((dbg_constr, LEVEL_1, "using already existing %+F for value %+F\n", cpy, other_different));
534 /* Add the Keep resp. CopyKeep and reroute the users */
535 /* of the other_different irn in case of CopyKeep. */
536 if (has_irn_users(other_different)) {
537 keep = be_new_CopyKeep_single(block, cpy, irn);
538 be_node_set_reg_class_in(keep, 1, cls);
544 keep = be_new_Keep(block, 2, in);
547 DB((dbg_constr, LEVEL_1, "created %+F(%+F, %+F)\n\n", keep, irn, cpy));
549 /* insert copy and keep into schedule */
550 assert(sched_is_scheduled(irn) && "need schedule to assure constraints");
551 if (! sched_is_scheduled(cpy))
552 sched_add_before(skip_Proj(irn), cpy);
553 sched_add_after(skip_Proj(irn), keep);
555 /* insert the other different and its copies into the map */
556 entry = ir_nodehashmap_get(op_copy_assoc_t, op_set, other_different);
558 entry = OALLOC(&env->obst, op_copy_assoc_t);
560 ir_nodeset_init(&entry->copies);
562 ir_nodehashmap_insert(op_set, other_different, entry);
566 ir_nodeset_insert(&entry->copies, cpy);
568 /* insert keep in case of CopyKeep */
569 if (be_is_CopyKeep(keep))
570 ir_nodeset_insert(&entry->copies, keep);
574 * Checks if node has a must_be_different constraint in output and adds a Keep
575 * then to assure the constraint.
577 * @param irn the node to check
578 * @param skipped_irn if irn is a Proj node, its predecessor, else irn
579 * @param env the constraint environment
581 static void assure_different_constraints(ir_node *irn, ir_node *skipped_irn, constraint_env_t *env)
583 const arch_register_req_t *req = arch_get_irn_register_req(irn);
585 if (arch_register_req_is(req, must_be_different)) {
586 const unsigned other = req->other_different;
589 if (arch_register_req_is(req, should_be_same)) {
590 const unsigned same = req->other_same;
592 if (is_po2(other) && is_po2(same)) {
593 int idx_other = ntz(other);
594 int idx_same = ntz(same);
597 * We can safely ignore a should_be_same x must_be_different y
598 * IFF both inputs are equal!
600 if (get_irn_n(skipped_irn, idx_other) == get_irn_n(skipped_irn, idx_same)) {
605 for (i = 0; 1U << i <= other; ++i) {
606 if (other & (1U << i)) {
607 ir_node *different_from = get_irn_n(skipped_irn, i);
608 gen_assure_different_pattern(irn, different_from, env);
615 * Calls the functions to assure register constraints.
617 * @param block The block to be checked
618 * @param walk_env The walker environment
620 static void assure_constraints_walker(ir_node *block, void *walk_env)
622 constraint_env_t *env = (constraint_env_t*)walk_env;
624 sched_foreach_reverse(block, irn) {
625 ir_mode *mode = get_irn_mode(irn);
627 if (mode == mode_T) {
628 foreach_out_edge(irn, edge) {
629 ir_node *proj = get_edge_src_irn(edge);
631 mode = get_irn_mode(proj);
632 if (mode_is_datab(mode))
633 assure_different_constraints(proj, irn, env);
635 } else if (mode_is_datab(mode)) {
636 assure_different_constraints(irn, irn, env);
642 * Melt all copykeeps pointing to the same node
643 * (or Projs of the same node), copying the same operand.
645 static void melt_copykeeps(constraint_env_t *cenv)
647 ir_nodehashmap_iterator_t map_iter;
648 ir_nodehashmap_entry_t map_entry;
651 foreach_ir_nodehashmap(&cenv->op_set, map_entry, map_iter) {
652 op_copy_assoc_t *entry = (op_copy_assoc_t*)map_entry.data;
655 ir_node **ck_arr, **melt_arr;
659 /* collect all copykeeps */
661 foreach_ir_nodeset(&entry->copies, cp, iter) {
662 if (be_is_CopyKeep(cp)) {
663 obstack_grow(&obst, &cp, sizeof(cp));
666 #ifdef KEEP_ALIVE_COPYKEEP_HACK
668 set_irn_mode(cp, mode_ANY);
671 #endif /* KEEP_ALIVE_COPYKEEP_HACK */
674 /* compare each copykeep with all other copykeeps */
675 ck_arr = (ir_node **)obstack_finish(&obst);
676 for (idx = 0; idx < num_ck; ++idx) {
677 ir_node *ref, *ref_mode_T;
683 ir_node *sched_pt = NULL;
687 ref_mode_T = skip_Proj(get_irn_n(ref, 1));
688 obstack_grow(&obst, &ref, sizeof(ref));
690 DB((dbg_constr, LEVEL_1, "Trying to melt %+F:\n", ref));
692 /* check for copykeeps pointing to the same mode_T node as the reference copykeep */
693 for (j = 0; j < num_ck; ++j) {
694 ir_node *cur_ck = ck_arr[j];
696 if (j != idx && cur_ck && skip_Proj(get_irn_n(cur_ck, 1)) == ref_mode_T) {
697 obstack_grow(&obst, &cur_ck, sizeof(cur_ck));
698 ir_nodeset_remove(&entry->copies, cur_ck);
699 DB((dbg_constr, LEVEL_1, "\t%+F\n", cur_ck));
702 sched_remove(cur_ck);
707 /* check, if we found some candidates for melting */
709 DB((dbg_constr, LEVEL_1, "\tno candidate found\n"));
713 ir_nodeset_remove(&entry->copies, ref);
716 melt_arr = (ir_node **)obstack_finish(&obst);
717 /* melt all found copykeeps */
718 NEW_ARR_A(ir_node *, new_ck_in, n_melt);
719 for (j = 0; j < n_melt; ++j) {
720 new_ck_in[j] = get_irn_n(melt_arr[j], 1);
722 /* now, we can kill the melted keep, except the */
723 /* ref one, we still need some information */
724 if (melt_arr[j] != ref)
725 kill_node(melt_arr[j]);
728 #ifdef KEEP_ALIVE_COPYKEEP_HACK
729 new_ck = be_new_CopyKeep(get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in);
732 new_ck = be_new_CopyKeep(get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in);
733 #endif /* KEEP_ALIVE_COPYKEEP_HACK */
735 /* set register class for all kept inputs */
736 for (j = 1; j <= n_melt; ++j)
737 be_node_set_reg_class_in(new_ck, j, entry->cls);
739 ir_nodeset_insert(&entry->copies, new_ck);
741 /* find scheduling point */
742 sched_pt = ref_mode_T;
744 /* just walk along the schedule until a non-Keep/CopyKeep node is found */
745 sched_pt = sched_next(sched_pt);
746 } while (be_is_Keep(sched_pt) || be_is_CopyKeep(sched_pt));
748 sched_add_before(sched_pt, new_ck);
749 DB((dbg_constr, LEVEL_1, "created %+F, scheduled before %+F\n", new_ck, sched_pt));
751 /* finally: kill the reference copykeep */
756 obstack_free(&obst, NULL);
760 void assure_constraints(ir_graph *irg)
762 constraint_env_t cenv;
763 ir_nodehashmap_iterator_t map_iter;
764 ir_nodehashmap_entry_t map_entry;
766 FIRM_DBG_REGISTER(dbg_constr, "firm.be.lower.constr");
769 ir_nodehashmap_init(&cenv.op_set);
770 obstack_init(&cenv.obst);
772 irg_block_walk_graph(irg, NULL, assure_constraints_walker, &cenv);
774 /* melt copykeeps, pointing to projs of */
775 /* the same mode_T node and keeping the */
777 melt_copykeeps(&cenv);
780 foreach_ir_nodehashmap(&cenv.op_set, map_entry, map_iter) {
781 op_copy_assoc_t *entry = (op_copy_assoc_t*)map_entry.data;
782 size_t n = ir_nodeset_size(&entry->copies);
783 ir_node **nodes = ALLOCAN(ir_node*, n);
784 be_ssa_construction_env_t senv;
786 /* put the node in an array */
787 DBG((dbg_constr, LEVEL_1, "introduce copies for %+F ", map_entry.node));
789 /* collect all copies */
791 foreach_ir_nodeset(&entry->copies, cp, iter) {
793 DB((dbg_constr, LEVEL_1, ", %+F ", cp));
796 DB((dbg_constr, LEVEL_1, "\n"));
798 /* introduce the copies for the operand and its copies */
799 be_ssa_construction_init(&senv, irg);
800 be_ssa_construction_add_copy(&senv, map_entry.node);
801 be_ssa_construction_add_copies(&senv, nodes, n);
802 be_ssa_construction_fix_users(&senv, map_entry.node);
803 be_ssa_construction_destroy(&senv);
805 /* Could be that not all CopyKeeps are really needed, */
806 /* so we transform unnecessary ones into Keeps. */
807 foreach_ir_nodeset(&entry->copies, cp, iter) {
808 if (be_is_CopyKeep(cp) && get_irn_n_edges(cp) < 1) {
809 int n = get_irn_arity(cp);
812 keep = be_new_Keep(get_nodes_block(cp), n, get_irn_in(cp) + 1);
813 sched_add_before(cp, keep);
815 /* Set all ins (including the block) of the CopyKeep BAD to keep the verifier happy. */
821 ir_nodeset_destroy(&entry->copies);
824 ir_nodehashmap_destroy(&cenv.op_set);
825 obstack_free(&cenv.obst, NULL);
826 be_invalidate_live_sets(irg);
830 * Push nodes that do not need to be permed through the Perm.
831 * This is commonly a reload cascade at block ends.
832 * @note This routine needs interference.
833 * @note Probably, we can implement it a little more efficient.
834 * Especially searching the frontier lazily might be better.
836 * @param perm The perm
837 * @param env The lowerer environment
839 * @return 1, if there is something left to perm over.
840 * 0, if removed the complete perm.
842 static int push_through_perm(ir_node *perm)
844 ir_graph *irg = get_irn_irg(perm);
845 ir_node *bl = get_nodes_block(perm);
847 int arity = get_irn_arity(perm);
850 bitset_t *moved = bitset_alloca(arity);
853 ir_node *frontier = bl;
856 /* get some Proj and find out the register class of that Proj. */
857 ir_node *one_proj = get_edge_src_irn(get_irn_out_edge_first_kind(perm, EDGE_KIND_NORMAL));
858 const arch_register_class_t *cls = arch_get_irn_reg_class(one_proj);
859 assert(is_Proj(one_proj));
861 DB((dbg_permmove, LEVEL_1, "perm move %+F irg %+F\n", perm, irg));
863 /* Find the point in the schedule after which the
864 * potentially movable nodes must be defined.
865 * A Perm will only be pushed up to first instruction
866 * which lets an operand of itself die.
867 * If we would allow to move the Perm above this instruction,
868 * the former dead operand would be live now at the point of
869 * the Perm, increasing the register pressure by one.
871 sched_foreach_reverse_from(sched_prev(perm), irn) {
872 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
873 ir_node *op = get_irn_n(irn, i);
874 be_lv_t *lv = be_get_irg_liveness(irg);
875 if (arch_irn_consider_in_reg_alloc(cls, op) &&
876 !be_values_interfere(lv, op, one_proj)) {
884 DB((dbg_permmove, LEVEL_2, "\tfrontier: %+F\n", frontier));
886 node = sched_prev(perm);
888 while (!sched_is_begin(node)) {
889 const arch_register_req_t *req;
891 ir_node *proj = NULL;
893 /* search if node is a INPUT of Perm */
894 foreach_out_edge(perm, edge) {
895 ir_node *out = get_edge_src_irn(edge);
896 int pn = get_Proj_proj(out);
897 ir_node *in = get_irn_n(perm, pn);
904 /* it wasn't an input to the perm, we can't do anything more */
907 if (!sched_comes_after(frontier, node))
909 if (arch_irn_is(node, modify_flags))
911 req = arch_get_irn_register_req(node);
912 if (req->type != arch_register_req_type_normal)
914 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
915 ir_node *opop = get_irn_n(node, i);
916 if (arch_irn_consider_in_reg_alloc(cls, opop)) {
923 DBG((dbg_permmove, LEVEL_2, "\tmoving %+F after %+F, killing %+F\n", node, perm, proj));
925 /* move the movable node in front of the Perm */
927 sched_add_after(perm, node);
929 /* give it the proj's register */
930 arch_set_irn_register(node, arch_get_irn_register(proj));
932 /* reroute all users of the proj to the moved node. */
933 exchange(proj, node);
935 bitset_set(moved, input);
938 node = sched_prev(node);
941 /* well, we could not push anything through the perm */
945 new_size = arity - n_moved;
952 map = ALLOCAN(int, new_size);
953 proj_map = ALLOCAN(int, arity);
954 memset(proj_map, -1, sizeof(proj_map[0]));
956 for (i = 0; i < arity; ++i) {
957 if (bitset_is_set(moved, i))
963 assert(n == new_size);
964 foreach_out_edge(perm, edge) {
965 ir_node *proj = get_edge_src_irn(edge);
966 int pn = get_Proj_proj(proj);
969 set_Proj_proj(proj, pn);
972 be_Perm_reduce(perm, new_size, map);
977 * Calls the corresponding lowering function for the node.
979 * @param irn The node to be checked for lowering
980 * @param walk_env The walker environment
982 static void lower_nodes_after_ra_walker(ir_node *irn, void *walk_env)
986 if (!be_is_Perm(irn))
989 perm_stayed = push_through_perm(irn);
991 lower_perm_node(irn, (lower_env_t*)walk_env);
994 void lower_nodes_after_ra(ir_graph *irg, int do_copy)
998 FIRM_DBG_REGISTER(dbg, "firm.be.lower");
999 FIRM_DBG_REGISTER(dbg_permmove, "firm.be.lower.permmove");
1002 env.do_copy = do_copy;
1004 /* we will need interference */
1005 be_assure_live_chk(irg);
1007 irg_walk_graph(irg, NULL, lower_nodes_after_ra_walker, &env);