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 Performs lowering of perm nodes. Inserts copies to assure register constraints.
23 * @author Christian Wuerdig
37 #include "irnodeset.h"
39 #include "iredges_t.h"
46 #include "besched_t.h"
48 #include "bessaconstr.h"
49 #include "beintlive_t.h"
51 #undef KEEP_ALIVE_COPYKEEP_HACK
53 /** Associates an op with it's copy and CopyKeep. */
55 ir_node *op; /**< an irn which must be different */
56 ir_nodeset_t copies; /**< all non-spillable copies of this irn */
57 const arch_register_class_t *cls;
60 /** Environment for constraints. */
65 DEBUG_ONLY(firm_dbg_module_t *dbg;)
68 /** Lowering walker environment. */
69 typedef struct _lower_env_t {
71 const arch_env_t *arch_env;
73 DEBUG_ONLY(firm_dbg_module_t *dbg_module;)
76 /** Holds a Perm register pair. */
77 typedef struct _reg_pair_t {
78 const arch_register_t *in_reg; /**< a perm IN register */
79 ir_node *in_node; /**< the in node to which the register belongs */
81 const arch_register_t *out_reg; /**< a perm OUT register */
82 ir_node *out_node; /**< the out node to which the register belongs */
84 int checked; /**< indicates whether the pair was check for cycle or not */
87 typedef enum _perm_type_t {
94 /** Structure to represent cycles or chains in a Perm. */
95 typedef struct _perm_cycle_t {
96 const arch_register_t **elems; /**< the registers in the cycle */
97 int n_elems; /**< number of elements in the cycle */
98 perm_type_t type; /**< type (CHAIN or CYCLE) */
101 /** Compare the two operands. */
102 static int cmp_op_copy_assoc(const void *a, const void *b) {
103 const op_copy_assoc_t *op1 = a;
104 const op_copy_assoc_t *op2 = b;
106 return op1->op != op2->op;
109 /** Compare the in registers of two register pairs. */
110 static int compare_reg_pair(const void *a, const void *b) {
111 const reg_pair_t *pair_a = a;
112 const reg_pair_t *pair_b = b;
114 if (pair_a->in_reg->index > pair_b->in_reg->index)
120 /** returns the number register pairs marked as checked. */
121 static int get_n_checked_pairs(reg_pair_t *pairs, int n) {
122 int i, n_checked = 0;
124 for (i = 0; i < n; i++) {
125 if (pairs[i].checked)
133 * Gets the node corresponding to a register from an array of register pairs.
134 * NOTE: The given registers pairs and the register to look for must belong
135 * to the same register class.
137 * @param pairs The array of register pairs
138 * @param n The number of pairs
139 * @param reg The register to look for
140 * @param in_out 0 == look for IN register, 1 == look for OUT register
141 * @return The corresponding node or NULL if not found
143 static ir_node *get_node_for_register(reg_pair_t *pairs, int n, const arch_register_t *reg, int in_out) {
147 for (i = 0; i < n; i++) {
148 /* out register matches */
149 if (pairs[i].out_reg->index == reg->index)
150 return pairs[i].out_node;
154 for (i = 0; i < n; i++) {
155 /* in register matches */
156 if (pairs[i].in_reg->index == reg->index)
157 return pairs[i].in_node;
165 * Gets the index in the register pair array where the in/out register
166 * corresponds to reg_idx.
168 * @param pairs The array of register pairs
169 * @param n The number of pairs
170 * @param reg The register index to look for
171 * @param in_out 0 == look for IN register, 1 == look for OUT register
172 * @return The corresponding index in pairs or -1 if not found
174 static int get_pairidx_for_regidx(reg_pair_t *pairs, int n, int reg_idx, int in_out) {
178 for (i = 0; i < n; i++) {
179 /* out register matches */
180 if ((int) pairs[i].out_reg->index == reg_idx)
185 for (i = 0; i < n; i++) {
186 /* in register matches */
187 if ((int) pairs[i].in_reg->index == reg_idx)
196 * Gets an array of register pairs and tries to identify a cycle or chain starting
199 * @param cycle Variable to hold the cycle
200 * @param pairs Array of register pairs
201 * @param start Index to start
202 * @return The cycle or chain
204 static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int n, int start) {
205 int head = pairs[start].in_reg->index;
206 int cur_idx = pairs[start].out_reg->index;
207 int cur_pair_idx = start;
208 int n_pairs_done = get_n_checked_pairs(pairs, n);
210 perm_type_t cycle_tp = PERM_CYCLE;
212 /* We could be right in the middle of a chain, so we need to find the start */
213 while (head != cur_idx) {
214 /* goto previous register in cycle or chain */
215 cur_pair_idx = get_pairidx_for_regidx(pairs, n, head, 1);
217 if (cur_pair_idx < 0) {
218 cycle_tp = PERM_CHAIN;
222 head = pairs[cur_pair_idx].in_reg->index;
223 start = cur_pair_idx;
227 /* assume worst case: all remaining pairs build a cycle or chain */
228 cycle->elems = XMALLOCNZ(const arch_register_t*, (n - n_pairs_done) * 2);
229 cycle->n_elems = 2; /* initial number of elements is 2 */
230 cycle->elems[0] = pairs[start].in_reg;
231 cycle->elems[1] = pairs[start].out_reg;
232 cycle->type = cycle_tp;
233 cur_idx = pairs[start].out_reg->index;
236 /* check for cycle or end of a chain */
237 while (cur_idx != head) {
238 /* goto next register in cycle or chain */
239 cur_pair_idx = get_pairidx_for_regidx(pairs, n, cur_idx, 0);
241 if (cur_pair_idx < 0)
244 cur_idx = pairs[cur_pair_idx].out_reg->index;
246 /* it's not the first element: insert it */
247 if (cur_idx != head) {
248 cycle->elems[idx++] = pairs[cur_pair_idx].out_reg;
252 /* we are there where we started -> CYCLE */
253 cycle->type = PERM_CYCLE;
257 /* mark all pairs having one in/out register with cycle in common as checked */
258 for (idx = 0; idx < cycle->n_elems; idx++) {
259 cur_pair_idx = get_pairidx_for_regidx(pairs, n, cycle->elems[idx]->index, 0);
261 if (cur_pair_idx >= 0)
262 pairs[cur_pair_idx].checked = 1;
264 cur_pair_idx = get_pairidx_for_regidx(pairs, n, cycle->elems[idx]->index, 1);
266 if (cur_pair_idx >= 0)
267 pairs[cur_pair_idx].checked = 1;
274 * Lowers a perm node. Resolves cycles and creates a bunch of
275 * copy and swap operations to permute registers.
276 * Note: The caller of this function has to make sure, that irn
279 * @param irn The perm node
280 * @param block The block the perm node belongs to
281 * @param walk_env The environment
283 static void lower_perm_node(ir_node *irn, void *walk_env) {
284 ir_graph *irg = get_irn_irg(irn);
285 const arch_register_class_t *reg_class;
286 const arch_env_t *arch_env;
287 lower_env_t *env = walk_env;
290 int n, i, pn, do_copy, j, n_ops;
292 const ir_edge_t *edge;
293 ir_node *sched_point, *block, *in[2];
294 ir_node *arg1, *arg2, *res1, *res2;
295 ir_node *cpyxchg = NULL;
296 DEBUG_ONLY(firm_dbg_module_t *mod;)
298 arch_env = env->arch_env;
299 do_copy = env->do_copy;
300 DEBUG_ONLY(mod = env->dbg_module;)
301 block = get_nodes_block(irn);
304 Get the schedule predecessor node to the perm
305 NOTE: This works with auto-magic. If we insert the
306 new copy/exchange nodes after this node, everything
309 sched_point = sched_prev(irn);
310 DBG((mod, LEVEL_1, "perm: %+F\n", irn));
311 DBG((mod, LEVEL_1, "sched point is %+F\n", sched_point));
312 assert(sched_point && "Perm is not scheduled or has no predecessor");
314 n = get_irn_arity(irn);
315 assert(n == get_irn_n_edges(irn) && "perm's in and out numbers different");
317 reg_class = arch_get_irn_register(get_irn_n(irn, 0))->reg_class;
318 pairs = alloca(n * sizeof(pairs[0]));
320 /* build the list of register pairs (in, out) */
322 foreach_out_edge(irn, edge) {
323 pairs[i].out_node = get_edge_src_irn(edge);
324 pn = get_Proj_proj(pairs[i].out_node);
325 pairs[i].in_node = get_irn_n(irn, pn);
327 pairs[i].in_reg = arch_get_irn_register(pairs[i].in_node);
328 pairs[i].out_reg = arch_get_irn_register(pairs[i].out_node);
330 pairs[i].checked = 0;
334 /* sort the register pairs by the indices of the in registers */
335 qsort(pairs, n, sizeof(pairs[0]), compare_reg_pair);
337 /* Mark all equal pairs as checked, and exchange the OUT proj with
339 for (i = 0; i < n; i++) {
340 if (pairs[i].in_reg->index == pairs[i].out_reg->index) {
341 DBG((mod, LEVEL_1, "%+F removing equal perm register pair (%+F, %+F, %s)\n",
342 irn, pairs[i].in_node, pairs[i].out_node, pairs[i].out_reg->name));
344 /* We have to check for a special case:
345 The in-node could be a Proj from a Perm. In this case,
346 we need to correct the projnum */
347 if (be_is_Perm(pairs[i].in_node) && is_Proj(pairs[i].in_node)) {
348 set_Proj_proj(pairs[i].out_node, get_Proj_proj(pairs[i].in_node));
351 /* reroute the edges from the proj to the argument */
352 exchange(pairs[i].out_node, pairs[i].in_node);
353 //edges_reroute(pairs[i].out_node, pairs[i].in_node, env->birg->irg);
354 //set_irn_n(pairs[i].out_node, 0, new_Bad());
356 pairs[i].checked = 1;
360 /* Set do_copy to 0 if it's on but we have no free register */
365 real_size = n - get_n_checked_pairs(pairs, n);
367 /* check for cycles and chains */
368 while (get_n_checked_pairs(pairs, n) < n) {
373 /* go to the first not-checked pair */
374 while (pairs[i].checked) i++;
375 cycle = XMALLOCZ(perm_cycle_t);
376 cycle = get_perm_cycle(cycle, pairs, n, i);
378 DB((mod, LEVEL_1, "%+F: following %s created:\n ", irn, cycle->type == PERM_CHAIN ? "chain" : "cycle"));
379 for (j = 0; j < cycle->n_elems; j++) {
380 DB((mod, LEVEL_1, " %s", cycle->elems[j]->name));
382 DB((mod, LEVEL_1, "\n"));
385 We don't need to do anything if we have a Perm with two
386 elements which represents a cycle, because those nodes
387 already represent exchange nodes
389 if (n == 2 && cycle->type == PERM_CYCLE) {
395 //TODO: - iff PERM_CYCLE && do_copy -> determine free temp reg and insert copy to/from it before/after
396 // the copy cascade (this reduces the cycle into a chain)
398 /* build copy/swap nodes from back to front */
399 for (i = cycle->n_elems - 2; i >= 0; i--) {
400 arg1 = get_node_for_register(pairs, n, cycle->elems[i], 0);
401 arg2 = get_node_for_register(pairs, n, cycle->elems[i + 1], 0);
403 res1 = get_node_for_register(pairs, n, cycle->elems[i], 1);
404 res2 = get_node_for_register(pairs, n, cycle->elems[i + 1], 1);
406 If we have a cycle and don't copy: we need to create exchange nodes
407 NOTE: An exchange node is a perm node with 2 INs and 2 OUTs
408 IN_1 = in node with register i
409 IN_2 = in node with register i + 1
410 OUT_1 = out node with register i + 1
411 OUT_2 = out node with register i
413 if (cycle->type == PERM_CYCLE && !do_copy) {
417 /* At this point we have to handle the following problem: */
419 /* If we have a cycle with more than two elements, then */
420 /* this could correspond to the following Perm node: */
422 /* +----+ +----+ +----+ */
423 /* | r1 | | r2 | | r3 | */
424 /* +-+--+ +-+--+ +--+-+ */
427 /* +-+--------+---------+-+ */
429 /* +-+--------+---------+-+ */
432 /* +-+--+ +-+--+ +--+-+ */
433 /* |Proj| |Proj| |Proj| */
434 /* | r2 | | r3 | | r1 | */
435 /* +----+ +----+ +----+ */
437 /* This node is about to be split up into two 2x Perm's */
438 /* for which we need 4 Proj's and the one additional Proj */
439 /* of the first Perm has to be one IN of the second. So in */
440 /* general we need to create one additional Proj for each */
441 /* "middle" Perm and set this to one in node of the successor */
444 DBG((mod, LEVEL_1, "%+F creating exchange node (%+F, %s) and (%+F, %s) with\n",
445 irn, arg1, cycle->elems[i]->name, arg2, cycle->elems[i + 1]->name));
446 DBG((mod, LEVEL_1, "%+F (%+F, %s) and (%+F, %s)\n",
447 irn, res1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name));
449 cpyxchg = be_new_Perm(reg_class, irg, block, 2, in);
453 /* cycle is not done yet */
454 int pidx = get_pairidx_for_regidx(pairs, n, cycle->elems[i]->index, 0);
456 /* create intermediate proj */
457 res1 = new_r_Proj(irg, block, cpyxchg, get_irn_mode(res1), 0);
459 /* set as in for next Perm */
460 pairs[pidx].in_node = res1;
463 set_Proj_pred(res2, cpyxchg);
464 set_Proj_proj(res2, 0);
465 set_Proj_pred(res1, cpyxchg);
466 set_Proj_proj(res1, 1);
468 arch_set_irn_register(arch_env, res2, cycle->elems[i + 1]);
469 arch_set_irn_register(arch_env, res1, cycle->elems[i]);
471 /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
472 sched_add_after(sched_point, cpyxchg);
474 DBG((mod, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point));
476 /* set the new scheduling point */
480 DBG((mod, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n",
481 irn, arg1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name));
483 cpyxchg = be_new_Copy(reg_class, irg, block, arg1);
484 arch_set_irn_register(arch_env, cpyxchg, cycle->elems[i + 1]);
487 /* exchange copy node and proj */
488 exchange(res2, cpyxchg);
490 /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
491 sched_add_after(sched_point, cpyxchg);
493 /* set the new scheduling point */
494 sched_point = cpyxchg;
498 free((void *) cycle->elems);
502 /* remove the perm from schedule */
511 static int has_irn_users(const ir_node *irn) {
512 return get_irn_out_edge_first_kind(irn, EDGE_KIND_NORMAL) != 0;
516 * Skip all Proj nodes.
518 static INLINE ir_node *belower_skip_proj(ir_node *irn) {
520 irn = get_Proj_pred(irn);
524 static ir_node *find_copy(constraint_env_t *env, ir_node *irn, ir_node *op) {
525 const arch_env_t *arch_env = be_get_birg_arch_env(env->birg);
526 ir_node *block = get_nodes_block(irn);
529 for (cur_node = sched_prev(irn);
530 ! is_Block(cur_node) && be_is_Copy(cur_node) && get_nodes_block(cur_node) == block;
531 cur_node = sched_prev(cur_node))
533 if (be_get_Copy_op(cur_node) == op && arch_irn_is(arch_env, cur_node, dont_spill))
540 static void gen_assure_different_pattern(ir_node *irn, ir_node *other_different, constraint_env_t *env) {
541 be_irg_t *birg = env->birg;
542 ir_graph *irg = be_get_birg_irg(birg);
543 pset *op_set = env->op_set;
544 const arch_env_t *arch_env = be_get_birg_arch_env(birg);
545 ir_node *block = get_nodes_block(irn);
546 const arch_register_class_t *cls = arch_get_irn_reg_class(other_different, -1);
547 ir_node *in[2], *keep, *cpy;
548 op_copy_assoc_t key, *entry;
549 DEBUG_ONLY(firm_dbg_module_t *mod = env->dbg;)
551 if (arch_irn_is(arch_env, other_different, ignore) || ! mode_is_datab(get_irn_mode(other_different))) {
552 DBG((mod, LEVEL_1, "ignore constraint for %+F because other_irn is ignore or not a datab node\n", irn));
556 /* Make a not spillable copy of the different node */
557 /* this is needed because the different irn could be */
558 /* in block far far away */
559 /* The copy is optimized later if not needed */
561 /* check if already exists such a copy in the schedule immediately before */
562 cpy = find_copy(env, belower_skip_proj(irn), other_different);
564 cpy = be_new_Copy(cls, irg, block, other_different);
565 be_node_set_flags(cpy, BE_OUT_POS(0), arch_irn_flags_dont_spill);
566 DBG((mod, LEVEL_1, "created non-spillable %+F for value %+F\n", cpy, other_different));
569 DBG((mod, LEVEL_1, "using already existing %+F for value %+F\n", cpy, other_different));
575 /* Add the Keep resp. CopyKeep and reroute the users */
576 /* of the other_different irn in case of CopyKeep. */
577 if (has_irn_users(other_different)) {
578 keep = be_new_CopyKeep_single(cls, irg, block, cpy, irn, get_irn_mode(other_different));
579 be_node_set_reg_class(keep, 1, cls);
582 keep = be_new_Keep(cls, irg, block, 2, in);
585 DBG((mod, LEVEL_1, "created %+F(%+F, %+F)\n\n", keep, irn, cpy));
587 /* insert copy and keep into schedule */
588 assert(sched_is_scheduled(irn) && "need schedule to assure constraints");
589 if (! sched_is_scheduled(cpy))
590 sched_add_before(belower_skip_proj(irn), cpy);
591 sched_add_after(irn, keep);
593 /* insert the other different and it's copies into the set */
594 key.op = other_different;
595 entry = pset_find(op_set, &key, hash_irn(other_different));
598 entry = obstack_alloc(&env->obst, sizeof(*entry));
599 ir_nodeset_init(&entry->copies);
600 entry->op = other_different;
605 ir_nodeset_insert(&entry->copies, cpy);
607 /* insert keep in case of CopyKeep */
608 if (be_is_CopyKeep(keep)) {
609 ir_nodeset_insert(&entry->copies, keep);
612 pset_insert(op_set, entry, hash_irn(other_different));
616 * Checks if node has a must_be_different constraint in output and adds a Keep
617 * then to assure the constraint.
619 static void assure_different_constraints(ir_node *irn, constraint_env_t *env) {
620 ir_node *skipped_irn = belower_skip_proj(irn);
621 const arch_register_req_t *req = arch_get_register_req(irn, -1);
623 if (arch_register_req_is(req, must_be_different)) {
624 const unsigned other = req->other_different;
627 if (arch_register_req_is(req, should_be_same)) {
628 const unsigned same = req->other_same;
630 if (is_po2(other) && is_po2(same)) {
631 int idx_other = ntz(other);
632 int idx_same = ntz(same);
635 * We can safely ignore a should_be_same x must_be_different y
636 * IFF both inputs are equal!
638 if (get_irn_n(skipped_irn, idx_other) == get_irn_n(skipped_irn, idx_same)) {
643 for (i = 0; 1U << i <= other; ++i) {
644 if (other & (1U << i)) {
645 ir_node *different_from = get_irn_n(skipped_irn, i);
646 gen_assure_different_pattern(irn, different_from, env);
653 * Calls the functions to assure register constraints.
655 * @param irn The node to be checked for lowering
656 * @param walk_env The walker environment
658 static void assure_constraints_walker(ir_node *irn, void *walk_env) {
662 if (sched_is_scheduled(irn) && mode_is_datab(get_irn_mode(irn)))
663 assure_different_constraints(irn, walk_env);
667 * Melt all copykeeps pointing to the same node
668 * (or Projs of the same node), copying the same operand.
670 static void melt_copykeeps(constraint_env_t *cenv) {
671 be_irg_t *birg = cenv->birg;
672 ir_graph *irg = be_get_birg_irg(birg);
673 op_copy_assoc_t *entry;
676 foreach_pset(cenv->op_set, entry) {
680 ir_nodeset_iterator_t iter;
681 ir_node **ck_arr, **melt_arr;
685 /* collect all copykeeps */
687 foreach_ir_nodeset(&entry->copies, cp, iter) {
688 if (be_is_CopyKeep(cp)) {
689 obstack_grow(&obst, &cp, sizeof(cp));
692 #ifdef KEEP_ALIVE_COPYKEEP_HACK
694 set_irn_mode(cp, mode_ANY);
697 #endif /* KEEP_ALIVE_COPYKEEP_HACK */
700 /* compare each copykeep with all other copykeeps */
701 ck_arr = (ir_node **)obstack_finish(&obst);
702 for (idx = 0; idx < num_ck; ++idx) {
703 ir_node *ref, *ref_mode_T;
709 ir_node *sched_pt = NULL;
713 ref_mode_T = skip_Proj(get_irn_n(ref, 1));
714 obstack_grow(&obst, &ref, sizeof(ref));
716 DBG((cenv->dbg, LEVEL_1, "Trying to melt %+F:\n", ref));
718 /* check for copykeeps pointing to the same mode_T node as the reference copykeep */
719 for (j = 0; j < num_ck; ++j) {
720 ir_node *cur_ck = ck_arr[j];
722 if (j != idx && cur_ck && skip_Proj(get_irn_n(cur_ck, 1)) == ref_mode_T) {
723 obstack_grow(&obst, &cur_ck, sizeof(cur_ck));
724 ir_nodeset_remove(&entry->copies, cur_ck);
725 DBG((cenv->dbg, LEVEL_1, "\t%+F\n", cur_ck));
728 sched_remove(cur_ck);
733 /* check, if we found some candidates for melting */
735 DBG((cenv->dbg, LEVEL_1, "\tno candidate found\n"));
739 ir_nodeset_remove(&entry->copies, ref);
742 melt_arr = (ir_node **)obstack_finish(&obst);
743 /* melt all found copykeeps */
744 NEW_ARR_A(ir_node *, new_ck_in, n_melt);
745 for (j = 0; j < n_melt; ++j) {
746 new_ck_in[j] = get_irn_n(melt_arr[j], 1);
748 /* now, we can kill the melted keep, except the */
749 /* ref one, we still need some information */
750 if (melt_arr[j] != ref)
751 kill_node(melt_arr[j]);
754 #ifdef KEEP_ALIVE_COPYKEEP_HACK
755 new_ck = be_new_CopyKeep(entry->cls, irg, get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in, mode_ANY);
758 new_ck = be_new_CopyKeep(entry->cls, irg, get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in, get_irn_mode(ref));
759 #endif /* KEEP_ALIVE_COPYKEEP_HACK */
761 /* set register class for all kept inputs */
762 for (j = 1; j <= n_melt; ++j)
763 be_node_set_reg_class(new_ck, j, entry->cls);
765 ir_nodeset_insert(&entry->copies, new_ck);
767 /* find scheduling point */
768 sched_pt = ref_mode_T;
770 /* just walk along the schedule until a non-Keep/CopyKeep node is found */
771 sched_pt = sched_next(sched_pt);
772 } while (be_is_Keep(sched_pt) || be_is_CopyKeep(sched_pt));
774 sched_add_before(sched_pt, new_ck);
775 DBG((cenv->dbg, LEVEL_1, "created %+F, scheduled before %+F\n", new_ck, sched_pt));
777 /* finally: kill the reference copykeep */
782 obstack_free(&obst, NULL);
787 * Walks over all nodes to assure register constraints.
789 * @param birg The birg structure containing the irg
791 void assure_constraints(be_irg_t *birg) {
792 ir_graph *irg = be_get_birg_irg(birg);
793 constraint_env_t cenv;
794 op_copy_assoc_t *entry;
796 FIRM_DBG_REGISTER(firm_dbg_module_t *mod, "firm.be.lower.constr");
798 DEBUG_ONLY(cenv.dbg = mod;)
800 cenv.op_set = new_pset(cmp_op_copy_assoc, 16);
801 obstack_init(&cenv.obst);
803 irg_walk_blkwise_graph(irg, NULL, assure_constraints_walker, &cenv);
805 /* melt copykeeps, pointing to projs of */
806 /* the same mode_T node and keeping the */
808 melt_copykeeps(&cenv);
811 foreach_pset(cenv.op_set, entry) {
814 ir_nodeset_iterator_t iter;
815 be_ssa_construction_env_t senv;
817 n = ir_nodeset_size(&entry->copies);
818 nodes = alloca(n * sizeof(nodes[0]));
820 /* put the node in an array */
821 DBG((mod, LEVEL_1, "introduce copies for %+F ", entry->op));
823 /* collect all copies */
825 foreach_ir_nodeset(&entry->copies, cp, iter) {
827 DB((mod, LEVEL_1, ", %+F ", cp));
830 DB((mod, LEVEL_1, "\n"));
832 /* introduce the copies for the operand and it's copies */
833 be_ssa_construction_init(&senv, birg);
834 be_ssa_construction_add_copy(&senv, entry->op);
835 be_ssa_construction_add_copies(&senv, nodes, n);
836 be_ssa_construction_fix_users(&senv, entry->op);
837 be_ssa_construction_destroy(&senv);
839 /* Could be that not all CopyKeeps are really needed, */
840 /* so we transform unnecessary ones into Keeps. */
841 foreach_ir_nodeset(&entry->copies, cp, iter) {
842 if (be_is_CopyKeep(cp) && get_irn_n_edges(cp) < 1) {
844 int n = get_irn_arity(cp);
846 keep = be_new_Keep(arch_get_irn_reg_class(cp, -1),
847 irg, get_nodes_block(cp), n, get_irn_in(cp) + 1);
848 sched_add_before(cp, keep);
850 /* Set all ins (including the block) of the CopyKeep BAD to keep the verifier happy. */
856 ir_nodeset_destroy(&entry->copies);
859 del_pset(cenv.op_set);
860 obstack_free(&cenv.obst, NULL);
861 be_liveness_invalidate(be_get_birg_liveness(birg));
866 * Push nodes that do not need to be permed through the Perm.
867 * This is commonly a reload cascade at block ends.
868 * @note This routine needs interference.
869 * @note Probably, we can implement it a little more efficient.
870 * Especially searching the frontier lazily might be better.
871 * @param perm The perm.
872 * @param data The walker data (lower_env_t).
873 * @return 1, if there is something left to perm over.
874 * 0, if removed the complete perm.
876 static int push_through_perm(ir_node *perm, void *data)
878 lower_env_t *env = data;
879 const arch_env_t *aenv = env->arch_env;
881 ir_graph *irg = get_irn_irg(perm);
882 ir_node *bl = get_nodes_block(perm);
884 int arity = get_irn_arity(perm);
887 bitset_t *moved = bitset_alloca(arity);
890 ir_node *frontier = bl;
891 FIRM_DBG_REGISTER(firm_dbg_module_t *mod, "firm.be.lower.permmove");
894 const ir_edge_t *edge;
895 ir_node *one_proj = NULL, *irn;
896 const arch_register_class_t *cls = NULL;
898 DBG((mod, LEVEL_1, "perm move %+F irg %+F\n", perm, irg));
900 /* get some Proj and find out the register class of that Proj. */
901 edge = get_irn_out_edge_first_kind(perm, EDGE_KIND_NORMAL);
902 one_proj = get_edge_src_irn(edge);
903 assert(is_Proj(one_proj));
904 cls = arch_get_irn_reg_class(one_proj, -1);
906 /* Find the point in the schedule after which the
907 * potentially movable nodes must be defined.
908 * A Perm will only be pushed up to first instruction
909 * which lets an operand of itself die.
910 * If we would allow to move the Perm above this instruction,
911 * the former dead operand would be live now at the point of
912 * the Perm, increasing the register pressure by one.
914 sched_foreach_reverse_from (sched_prev(perm), irn) {
915 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
916 ir_node *op = get_irn_n(irn, i);
917 if (arch_irn_consider_in_reg_alloc(aenv, cls, op) &&
918 !values_interfere(env->birg, op, one_proj)) {
926 DBG((mod, LEVEL_2, "\tfrontier: %+F\n", frontier));
928 node = sched_prev(perm);
930 while(!sched_is_begin(node)) {
931 const arch_register_req_t *req;
935 /* search if node is a INPUT of Perm */
936 foreach_out_edge(perm, edge) {
937 ir_node *out = get_edge_src_irn(edge);
938 int pn = get_Proj_proj(out);
939 ir_node *in = get_irn_n(perm, pn);
946 /* it wasn't an input to the perm, we can't do anything more */
949 if(!sched_comes_after(frontier, node))
951 if(arch_irn_is(aenv, node, modify_flags))
954 req = arch_get_register_req(get_Proj_pred(node),
955 -1 - get_Proj_proj(node));
957 req = arch_get_register_req(node, -1);
959 if(req->type != arch_register_req_type_normal)
961 for(i = get_irn_arity(node) - 1; i >= 0; --i) {
962 ir_node *opop = get_irn_n(node, i);
963 if (arch_irn_consider_in_reg_alloc(aenv, cls, opop)) {
970 DBG((mod, LEVEL_2, "\tmoving %+F after %+F, killing %+F\n", node, perm, proj));
972 /* move the movable node in front of the Perm */
974 sched_add_after(perm, node);
976 /* give it the proj's register */
977 arch_set_irn_register(aenv, node, arch_get_irn_register(proj));
979 /* reroute all users of the proj to the moved node. */
980 edges_reroute(proj, node, irg);
983 set_Proj_pred(proj, new_Bad());
986 bitset_set(moved, input);
989 node = sched_prev(node);
992 /* well, we could not push anything through the perm */
996 new_size = arity - n_moved;
1001 map = alloca(new_size * sizeof(map[0]));
1002 proj_map = alloca(arity * sizeof(proj_map[0]));
1003 memset(proj_map, -1, sizeof(proj_map[0]));
1005 for(i = 0; i < arity; ++i) {
1006 if(bitset_is_set(moved, i))
1012 assert(n == new_size);
1013 foreach_out_edge(perm, edge) {
1014 ir_node *proj = get_edge_src_irn(edge);
1015 int pn = get_Proj_proj(proj);
1018 set_Proj_proj(proj, pn);
1021 be_Perm_reduce(perm, new_size, map);
1026 * Calls the corresponding lowering function for the node.
1028 * @param irn The node to be checked for lowering
1029 * @param walk_env The walker environment
1031 static void lower_nodes_after_ra_walker(ir_node *irn, void *walk_env) {
1034 if (is_Block(irn) || is_Proj(irn))
1036 if (!be_is_Perm(irn))
1039 perm_stayed = push_through_perm(irn, walk_env);
1043 lower_perm_node(irn, walk_env);
1047 * Walks over all blocks in an irg and performs lowering need to be
1048 * done after register allocation (e.g. perm lowering).
1050 * @param birg The birg object
1051 * @param do_copy 1 == resolve cycles with a free reg if available
1053 void lower_nodes_after_ra(be_irg_t *birg, int do_copy) {
1055 ir_graph *irg = be_get_birg_irg(birg);
1058 env.arch_env = be_get_birg_arch_env(birg);
1059 env.do_copy = do_copy;
1060 FIRM_DBG_REGISTER(env.dbg_module, "firm.be.lower");
1062 /* we will need interference */
1063 be_liveness_assure_chk(be_get_birg_liveness(birg));
1065 irg_walk_blkwise_graph(irg, NULL, lower_nodes_after_ra_walker, &env);