2 * Copyright (C) 1995-2007 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 This file implements the x87 support and virtual to stack
23 * register translation for the ia32 backend.
24 * @author Michael Beck
36 #include "iredges_t.h"
47 #include "../belive_t.h"
48 #include "../besched_t.h"
49 #include "../benode_t.h"
50 #include "ia32_new_nodes.h"
51 #include "gen_ia32_new_nodes.h"
52 #include "gen_ia32_regalloc_if.h"
57 /* first and second binop index */
64 /* the store val index */
65 #define STORE_VAL_IDX 2
67 #define MASK_TOS(x) ((x) & (N_x87_REGS - 1))
69 /** the debug handle */
70 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
72 /* Forward declaration. */
73 typedef struct _x87_simulator x87_simulator;
76 * An exchange template.
77 * Note that our virtual functions have the same inputs
78 * and attributes as the real ones, so we can simple exchange
80 * Further, x87 supports inverse instructions, so we can handle them.
82 typedef struct _exchange_tmpl {
83 ir_op *normal_op; /**< the normal one */
84 ir_op *reverse_op; /**< the reverse one if exists */
85 ir_op *normal_pop_op; /**< the normal one with tos pop */
86 ir_op *reverse_pop_op; /**< the reverse one with tos pop */
90 * An entry on the simulated x87 stack.
92 typedef struct _st_entry {
93 int reg_idx; /**< the virtual register index of this stack value */
94 ir_node *node; /**< the node that produced this value */
100 typedef struct _x87_state {
101 st_entry st[N_x87_REGS]; /**< the register stack */
102 int depth; /**< the current stack depth */
103 int tos; /**< position of the tos */
104 x87_simulator *sim; /**< The simulator. */
107 /** An empty state, used for blocks without fp instructions. */
108 static x87_state _empty = { { {0, NULL}, }, 0, 0, NULL };
109 static x87_state *empty = (x87_state *)&_empty;
112 NO_NODE_ADDED = 0, /**< No node was added. */
113 NODE_ADDED = 1 /**< A node was added by the simulator in the schedule. */
117 * The type of an instruction simulator function.
119 * @param state the x87 state
120 * @param n the node to be simulated
122 * @return NODE_ADDED if a node was added AFTER n in schedule,
125 typedef int (*sim_func)(x87_state *state, ir_node *n);
128 * A block state: Every block has a x87 state at the beginning and at the end.
130 typedef struct _blk_state {
131 x87_state *begin; /**< state at the begin or NULL if not assigned */
132 x87_state *end; /**< state at the end or NULL if not assigned */
135 #define PTR_TO_BLKSTATE(p) ((blk_state *)(p))
137 /** liveness bitset for vfp registers. */
138 typedef unsigned char vfp_liveness;
143 struct _x87_simulator {
144 struct obstack obst; /**< An obstack for fast allocating. */
145 pmap *blk_states; /**< Map blocks to states. */
146 const arch_env_t *arch_env; /**< The architecture environment. */
147 be_lv_t *lv; /**< intrablock liveness. */
148 vfp_liveness *live; /**< Liveness information. */
149 unsigned n_idx; /**< The cached get_irg_last_idx() result. */
150 waitq *worklist; /**< Worklist of blocks that must be processed. */
154 * Returns the current stack depth.
156 * @param state the x87 state
158 * @return the x87 stack depth
160 static int x87_get_depth(const x87_state *state) {
162 } /* x87_get_depth */
165 * Return the virtual register index at st(pos).
167 * @param state the x87 state
168 * @param pos a stack position
170 * @return the vfp register index that produced the value at st(pos)
172 static int x87_get_st_reg(const x87_state *state, int pos) {
173 assert(pos < state->depth);
174 return state->st[MASK_TOS(state->tos + pos)].reg_idx;
175 } /* x87_get_st_reg */
178 * Return the node at st(pos).
180 * @param state the x87 state
181 * @param pos a stack position
183 * @return the IR node that produced the value at st(pos)
185 static ir_node *x87_get_st_node(const x87_state *state, int pos) {
186 assert(pos < state->depth);
187 return state->st[MASK_TOS(state->tos + pos)].node;
188 } /* x87_get_st_node */
192 * Dump the stack for debugging.
194 * @param state the x87 state
196 static void x87_dump_stack(const x87_state *state) {
199 for (i = state->depth - 1; i >= 0; --i) {
200 DB((dbg, LEVEL_2, "vf%d(%+F) ", x87_get_st_reg(state, i),
201 x87_get_st_node(state, i)));
203 DB((dbg, LEVEL_2, "<-- TOS\n"));
204 } /* x87_dump_stack */
205 #endif /* DEBUG_libfirm */
208 * Set a virtual register to st(pos).
210 * @param state the x87 state
211 * @param reg_idx the vfp register index that should be set
212 * @param node the IR node that produces the value of the vfp register
213 * @param pos the stack position where the new value should be entered
215 static void x87_set_st(x87_state *state, int reg_idx, ir_node *node, int pos) {
216 assert(0 < state->depth);
217 state->st[MASK_TOS(state->tos + pos)].reg_idx = reg_idx;
218 state->st[MASK_TOS(state->tos + pos)].node = node;
220 DB((dbg, LEVEL_2, "After SET_REG: "));
221 DEBUG_ONLY(x87_dump_stack(state));
225 * Set the tos virtual register.
227 * @param state the x87 state
228 * @param reg_idx the vfp register index that should be set
229 * @param node the IR node that produces the value of the vfp register
231 static void x87_set_tos(x87_state *state, int reg_idx, ir_node *node) {
232 x87_set_st(state, reg_idx, node, 0);
236 * Swap st(0) with st(pos).
238 * @param state the x87 state
239 * @param pos the stack position to change the tos with
241 static void x87_fxch(x87_state *state, int pos) {
243 assert(pos < state->depth);
245 entry = state->st[MASK_TOS(state->tos + pos)];
246 state->st[MASK_TOS(state->tos + pos)] = state->st[MASK_TOS(state->tos)];
247 state->st[MASK_TOS(state->tos)] = entry;
249 DB((dbg, LEVEL_2, "After FXCH: ")); DEBUG_ONLY(x87_dump_stack(state));
253 * Convert a virtual register to the stack index.
255 * @param state the x87 state
256 * @param reg_idx the register vfp index
258 * @return the stack position where the register is stacked
259 * or -1 if the virtual register was not found
261 static int x87_on_stack(const x87_state *state, int reg_idx) {
262 int i, tos = state->tos;
264 for (i = 0; i < state->depth; ++i)
265 if (state->st[MASK_TOS(tos + i)].reg_idx == reg_idx)
271 * Push a virtual Register onto the stack, double pushed allowed.
273 * @param state the x87 state
274 * @param reg_idx the register vfp index
275 * @param node the node that produces the value of the vfp register
277 static void x87_push_dbl(x87_state *state, int reg_idx, ir_node *node) {
278 assert(state->depth < N_x87_REGS && "stack overrun");
281 state->tos = MASK_TOS(state->tos - 1);
282 state->st[state->tos].reg_idx = reg_idx;
283 state->st[state->tos].node = node;
285 DB((dbg, LEVEL_2, "After PUSH: ")); DEBUG_ONLY(x87_dump_stack(state));
289 * Push a virtual Register onto the stack, double pushes are NOT allowed.
291 * @param state the x87 state
292 * @param reg_idx the register vfp index
293 * @param node the node that produces the value of the vfp register
294 * @param dbl_push if != 0 double pushes are allowed
296 static void x87_push(x87_state *state, int reg_idx, ir_node *node) {
297 assert(x87_on_stack(state, reg_idx) == -1 && "double push");
299 x87_push_dbl(state, reg_idx, node);
303 * Pop a virtual Register from the stack.
305 * @param state the x87 state
307 static void x87_pop(x87_state *state) {
308 assert(state->depth > 0 && "stack underrun");
311 state->tos = MASK_TOS(state->tos + 1);
313 DB((dbg, LEVEL_2, "After POP: ")); DEBUG_ONLY(x87_dump_stack(state));
317 * Returns the block state of a block.
319 * @param sim the x87 simulator handle
320 * @param block the current block
322 * @return the block state
324 static blk_state *x87_get_bl_state(x87_simulator *sim, ir_node *block) {
325 pmap_entry *entry = pmap_find(sim->blk_states, block);
328 blk_state *bl_state = obstack_alloc(&sim->obst, sizeof(*bl_state));
329 bl_state->begin = NULL;
330 bl_state->end = NULL;
332 pmap_insert(sim->blk_states, block, bl_state);
336 return PTR_TO_BLKSTATE(entry->value);
337 } /* x87_get_bl_state */
340 * Creates a new x87 state.
342 * @param sim the x87 simulator handle
344 * @return a new x87 state
346 static x87_state *x87_alloc_state(x87_simulator *sim) {
347 x87_state *res = obstack_alloc(&sim->obst, sizeof(*res));
351 } /* x87_alloc_state */
356 * @param sim the x87 simulator handle
357 * @param src the x87 state that will be cloned
359 * @return a cloned copy of the src state
361 static x87_state *x87_clone_state(x87_simulator *sim, const x87_state *src) {
362 x87_state *res = x87_alloc_state(sim);
364 memcpy(res, src, sizeof(*res));
366 } /* x87_clone_state */
369 * Patch a virtual instruction into a x87 one and return
370 * the node representing the result value.
372 * @param n the IR node to patch
373 * @param op the x87 opcode to patch in
375 static ir_node *x87_patch_insn(ir_node *n, ir_op *op) {
376 ir_mode *mode = get_irn_mode(n);
381 if (mode == mode_T) {
382 /* patch all Proj's */
383 const ir_edge_t *edge;
385 foreach_out_edge(n, edge) {
386 ir_node *proj = get_edge_src_irn(edge);
388 mode = get_irn_mode(proj);
389 if (mode_is_float(mode)) {
391 set_irn_mode(proj, mode_E);
395 } else if (mode_is_float(mode))
396 set_irn_mode(n, mode_E);
398 } /* x87_patch_insn */
401 * Returns the first Proj of a mode_T node having a given mode.
403 * @param n the mode_T node
404 * @param m the desired mode of the Proj
405 * @return The first Proj of mode @p m found or NULL.
407 static ir_node *get_irn_Proj_for_mode(ir_node *n, ir_mode *m) {
408 const ir_edge_t *edge;
410 assert(get_irn_mode(n) == mode_T && "Need mode_T node");
412 foreach_out_edge(n, edge) {
413 ir_node *proj = get_edge_src_irn(edge);
414 if (get_irn_mode(proj) == m)
419 } /* get_irn_Proj_for_mode */
422 * Wrap the arch_* function here so we can check for errors.
424 static INLINE const arch_register_t *x87_get_irn_register(x87_simulator *sim, const ir_node *irn) {
425 const arch_register_t *res;
427 res = arch_get_irn_register(sim->arch_env, irn);
428 assert(res->reg_class->regs == ia32_vfp_regs);
430 } /* x87_get_irn_register */
432 /* -------------- x87 perm --------------- */
435 * Creates a fxch for shuffle.
437 * @param state the x87 state
438 * @param pos parameter for fxch
439 * @param block the block were fxch is inserted
441 * Creates a new fxch node and reroute the user of the old node
444 * @return the fxch node
446 static ir_node *x87_fxch_shuffle(x87_state *state, int pos, ir_node *block) {
448 ia32_x87_attr_t *attr;
450 fxch = new_rd_ia32_fxch(NULL, get_irn_irg(block), block, mode_E);
451 attr = get_ia32_x87_attr(fxch);
452 attr->x87[0] = &ia32_st_regs[pos];
453 attr->x87[2] = &ia32_st_regs[0];
457 x87_fxch(state, pos);
459 } /* x87_fxch_shuffle */
462 * Calculate the necessary permutations to reach dst_state.
464 * These permutations are done with fxch instructions and placed
465 * at the end of the block.
467 * Note that critical edges are removed here, so we need only
468 * a shuffle if the current block has only one successor.
470 * @param sim the simulator handle
471 * @param block the current block
472 * @param state the current x87 stack state, might be modified
473 * @param dst_block the destination block
474 * @param dst_state destination state
478 static x87_state *x87_shuffle(x87_simulator *sim, ir_node *block,
479 x87_state *state, ir_node *dst_block,
480 const x87_state *dst_state)
482 int i, n_cycles, k, ri;
483 unsigned cycles[4], all_mask;
484 char cycle_idx[4][8];
485 ir_node *fxch, *before, *after;
489 assert(state->depth == dst_state->depth);
491 /* Some mathematics here:
492 If we have a cycle of length n that includes the tos,
493 we need n-1 exchange operations.
494 We can always add the tos and restore it, so we need
495 n+1 exchange operations for a cycle not containing the tos.
496 So, the maximum of needed operations is for a cycle of 7
497 not including the tos == 8.
498 This is the same number of ops we would need for using stores,
499 so exchange is cheaper (we save the loads).
500 On the other hand, we might need an additional exchange
501 in the next block to bring one operand on top, so the
502 number of ops in the first case is identical.
503 Further, no more than 4 cycles can exists (4 x 2).
505 all_mask = (1 << (state->depth)) - 1;
507 for (n_cycles = 0; all_mask; ++n_cycles) {
508 int src_idx, dst_idx;
510 /* find the first free slot */
511 for (i = 0; i < state->depth; ++i) {
512 if (all_mask & (1 << i)) {
513 all_mask &= ~(1 << i);
515 /* check if there are differences here */
516 if (x87_get_st_reg(state, i) != x87_get_st_reg(dst_state, i))
522 /* no more cycles found */
527 cycles[n_cycles] = (1 << i);
528 cycle_idx[n_cycles][k++] = i;
529 for (src_idx = i; ; src_idx = dst_idx) {
530 dst_idx = x87_on_stack(dst_state, x87_get_st_reg(state, src_idx));
532 if ((all_mask & (1 << dst_idx)) == 0)
535 cycle_idx[n_cycles][k++] = dst_idx;
536 cycles[n_cycles] |= (1 << dst_idx);
537 all_mask &= ~(1 << dst_idx);
539 cycle_idx[n_cycles][k] = -1;
543 /* no permutation needed */
547 /* Hmm: permutation needed */
548 DB((dbg, LEVEL_2, "\n%+F needs permutation: from\n", block));
549 DEBUG_ONLY(x87_dump_stack(state));
550 DB((dbg, LEVEL_2, " to\n"));
551 DEBUG_ONLY(x87_dump_stack(dst_state));
555 DB((dbg, LEVEL_2, "Need %d cycles\n", n_cycles));
556 for (ri = 0; ri < n_cycles; ++ri) {
557 DB((dbg, LEVEL_2, " Ring %d:\n ", ri));
558 for (k = 0; cycle_idx[ri][k] != -1; ++k)
559 DB((dbg, LEVEL_2, " st%d ->", cycle_idx[ri][k]));
560 DB((dbg, LEVEL_2, "\n"));
567 * Find the place node must be insert.
568 * We have only one successor block, so the last instruction should
571 before = sched_last(block);
572 assert(is_cfop(before));
574 /* now do the permutations */
575 for (ri = 0; ri < n_cycles; ++ri) {
576 if ((cycles[ri] & 1) == 0) {
577 /* this cycle does not include the tos */
578 fxch = x87_fxch_shuffle(state, cycle_idx[ri][0], block);
580 sched_add_after(after, fxch);
582 sched_add_before(before, fxch);
585 for (k = 1; cycle_idx[ri][k] != -1; ++k) {
586 fxch = x87_fxch_shuffle(state, cycle_idx[ri][k], block);
588 sched_add_after(after, fxch);
590 sched_add_before(before, fxch);
593 if ((cycles[ri] & 1) == 0) {
594 /* this cycle does not include the tos */
595 fxch = x87_fxch_shuffle(state, cycle_idx[ri][0], block);
596 sched_add_after(after, fxch);
603 * Create a fxch node before another node.
605 * @param state the x87 state
606 * @param n the node after the fxch
607 * @param pos exchange st(pos) with st(0)
611 static ir_node *x87_create_fxch(x87_state *state, ir_node *n, int pos)
614 ia32_x87_attr_t *attr;
615 ir_graph *irg = get_irn_irg(n);
616 ir_node *block = get_nodes_block(n);
618 x87_fxch(state, pos);
620 fxch = new_rd_ia32_fxch(NULL, irg, block, mode_E);
621 attr = get_ia32_x87_attr(fxch);
622 attr->x87[0] = &ia32_st_regs[pos];
623 attr->x87[2] = &ia32_st_regs[0];
627 sched_add_before(n, fxch);
628 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(fxch), attr->x87[0]->name, attr->x87[2]->name));
630 } /* x87_create_fxch */
633 * Create a fpush before node n.
635 * @param state the x87 state
636 * @param n the node after the fpush
637 * @param pos push st(pos) on stack
638 * @param op_idx replace input op_idx of n with the fpush result
640 static void x87_create_fpush(x87_state *state, ir_node *n, int pos, int op_idx) {
641 ir_node *fpush, *pred = get_irn_n(n, op_idx);
642 ia32_x87_attr_t *attr;
643 const arch_register_t *out = x87_get_irn_register(state->sim, pred);
645 x87_push_dbl(state, arch_register_get_index(out), pred);
647 fpush = new_rd_ia32_fpush(NULL, get_irn_irg(n), get_nodes_block(n), mode_E);
648 attr = get_ia32_x87_attr(fpush);
649 attr->x87[0] = &ia32_st_regs[pos];
650 attr->x87[2] = &ia32_st_regs[0];
653 sched_add_before(n, fpush);
655 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(fpush), attr->x87[0]->name, attr->x87[2]->name));
656 } /* x87_create_fpush */
659 * Create a fpop before node n.
661 * @param state the x87 state
662 * @param n the node after the fpop
663 * @param num pop 1 or 2 values
665 * @return the fpop node
667 static ir_node *x87_create_fpop(x87_state *state, ir_node *n, int num)
670 ia32_x87_attr_t *attr;
674 fpop = new_rd_ia32_fpop(NULL, get_irn_irg(n), get_nodes_block(n), mode_E);
675 attr = get_ia32_x87_attr(fpop);
676 attr->x87[0] = &ia32_st_regs[0];
677 attr->x87[1] = &ia32_st_regs[0];
678 attr->x87[2] = &ia32_st_regs[0];
681 sched_add_before(n, fpop);
682 DB((dbg, LEVEL_1, "<<< %s %s\n", get_irn_opname(fpop), attr->x87[0]->name));
687 } /* x87_create_fpop */
690 * Creates an fldz before node n
692 * @param state the x87 state
693 * @param n the node after the fldz
695 * @return the fldz node
697 static ir_node *x87_create_fldz(x87_state *state, ir_node *n, int regidx) {
698 ir_graph *irg = get_irn_irg(n);
699 ir_node *block = get_nodes_block(n);
702 fldz = new_rd_ia32_fldz(NULL, irg, block, mode_E);
704 sched_add_before(n, fldz);
705 DB((dbg, LEVEL_1, "<<< %s\n", get_irn_opname(fldz)));
708 x87_push(state, regidx, fldz);
713 /* --------------------------------- liveness ------------------------------------------ */
716 * The liveness transfer function.
717 * Updates a live set over a single step from a given node to its predecessor.
718 * Everything defined at the node is removed from the set, the uses of the node get inserted.
720 * @param sim The simulator handle.
721 * @param irn The node at which liveness should be computed.
722 * @param live The bitset of registers live before @p irn. This set gets modified by updating it to
723 * the registers live after irn.
725 * @return The live bitset.
727 static vfp_liveness vfp_liveness_transfer(x87_simulator *sim, ir_node *irn, vfp_liveness live)
730 const arch_register_class_t *cls = &ia32_reg_classes[CLASS_ia32_vfp];
731 const arch_env_t *arch_env = sim->arch_env;
733 if (get_irn_mode(irn) == mode_T) {
734 const ir_edge_t *edge;
736 foreach_out_edge(irn, edge) {
737 ir_node *proj = get_edge_src_irn(edge);
739 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
740 const arch_register_t *reg = x87_get_irn_register(sim, proj);
741 live &= ~(1 << arch_register_get_index(reg));
746 if (arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) {
747 const arch_register_t *reg = x87_get_irn_register(sim, irn);
748 live &= ~(1 << arch_register_get_index(reg));
751 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
752 ir_node *op = get_irn_n(irn, i);
754 if (mode_is_float(get_irn_mode(op)) && arch_irn_consider_in_reg_alloc(arch_env, cls, op)) {
755 const arch_register_t *reg = x87_get_irn_register(sim, op);
756 live |= 1 << arch_register_get_index(reg);
760 } /* vfp_liveness_transfer */
763 * Put all live virtual registers at the end of a block into a bitset.
765 * @param sim the simulator handle
766 * @param lv the liveness information
767 * @param bl the block
769 * @return The live bitset at the end of this block
771 static vfp_liveness vfp_liveness_end_of_block(x87_simulator *sim, const ir_node *block)
774 vfp_liveness live = 0;
775 const arch_register_class_t *cls = &ia32_reg_classes[CLASS_ia32_vfp];
776 const arch_env_t *arch_env = sim->arch_env;
777 const be_lv_t *lv = sim->lv;
779 be_lv_foreach(lv, block, be_lv_state_end, i) {
780 const arch_register_t *reg;
781 const ir_node *node = be_lv_get_irn(lv, block, i);
782 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
785 reg = x87_get_irn_register(sim, node);
786 live |= 1 << arch_register_get_index(reg);
790 } /* vfp_liveness_end_of_block */
792 /** get the register mask from an arch_register */
793 #define REGMASK(reg) (1 << (arch_register_get_index(reg)))
796 * Return a bitset of argument registers which are live at the end of a node.
798 * @param sim the simulator handle
799 * @param pos the node
800 * @param kill kill mask for the output registers
802 * @return The live bitset.
804 static unsigned vfp_live_args_after(x87_simulator *sim, const ir_node *pos, unsigned kill)
806 unsigned idx = get_irn_idx(pos);
808 assert(idx < sim->n_idx);
809 return sim->live[idx] & ~kill;
810 } /* vfp_live_args_after */
813 * Calculate the liveness for a whole block and cache it.
815 * @param sim the simulator handle
816 * @param lv the liveness handle
817 * @param block the block
819 static void update_liveness(x87_simulator *sim, ir_node *block) {
820 vfp_liveness live = vfp_liveness_end_of_block(sim, block);
824 /* now iterate through the block backward and cache the results */
825 sched_foreach_reverse(block, irn) {
826 /* stop at the first Phi: this produces the live-in */
830 idx = get_irn_idx(irn);
831 sim->live[idx] = live;
833 live = vfp_liveness_transfer(sim, irn, live);
835 idx = get_irn_idx(block);
836 sim->live[idx] = live;
837 } /* update_liveness */
840 * Returns true if a register is live in a set.
842 * @param reg_idx the vfp register index
843 * @param live a live bitset
845 #define is_vfp_live(reg_idx, live) ((live) & (1 << (reg_idx)))
849 * Dump liveness info.
851 * @param live the live bitset
853 static void vfp_dump_live(vfp_liveness live) {
856 DB((dbg, LEVEL_2, "Live after: "));
857 for (i = 0; i < 8; ++i) {
858 if (live & (1 << i)) {
859 DB((dbg, LEVEL_2, "vf%d ", i));
862 DB((dbg, LEVEL_2, "\n"));
863 } /* vfp_dump_live */
864 #endif /* DEBUG_libfirm */
866 /* --------------------------------- simulators ---------------------------------------- */
868 #define XCHG(a, b) do { int t = (a); (a) = (b); (b) = t; } while (0)
880 * Simulate a virtual binop.
882 * @param state the x87 state
883 * @param n the node that should be simulated (and patched)
884 * @param tmpl the template containing the 4 possible x87 opcodes
886 * @return NO_NODE_ADDED
888 static int sim_binop(x87_state *state, ir_node *n, const exchange_tmpl *tmpl) {
889 int op2_idx = 0, op1_idx;
890 int out_idx, do_pop = 0;
891 ia32_x87_attr_t *attr;
892 ir_node *patched_insn;
894 x87_simulator *sim = state->sim;
895 ir_node *op1 = get_irn_n(n, BINOP_IDX_1);
896 ir_node *op2 = get_irn_n(n, BINOP_IDX_2);
897 const arch_register_t *op1_reg = x87_get_irn_register(sim, op1);
898 const arch_register_t *op2_reg = x87_get_irn_register(sim, op2);
899 const arch_register_t *out = x87_get_irn_register(sim, n);
900 int reg_index_1 = arch_register_get_index(op1_reg);
901 int reg_index_2 = arch_register_get_index(op2_reg);
902 vfp_liveness live = vfp_live_args_after(sim, n, REGMASK(out));
906 DB((dbg, LEVEL_1, ">>> %+F %s, %s -> %s\n", n,
907 arch_register_get_name(op1_reg), arch_register_get_name(op2_reg),
908 arch_register_get_name(out)));
909 DEBUG_ONLY(vfp_dump_live(live));
910 DB((dbg, LEVEL_1, "Stack before: "));
911 DEBUG_ONLY(x87_dump_stack(state));
913 if(reg_index_1 == REG_VFP_UKNWN) {
917 op1_idx = x87_on_stack(state, reg_index_1);
918 assert(op1_idx >= 0);
919 op1_live_after = is_vfp_live(arch_register_get_index(op1_reg), live);
922 if (reg_index_2 != REG_VFP_NOREG) {
923 if(reg_index_2 == REG_VFP_UKNWN) {
927 /* second operand is a vfp register */
928 op2_idx = x87_on_stack(state, reg_index_2);
929 assert(op2_idx >= 0);
931 = is_vfp_live(arch_register_get_index(op2_reg), live);
934 if (op2_live_after) {
935 /* Second operand is live. */
937 if (op1_live_after) {
938 /* Both operands are live: push the first one.
939 This works even for op1 == op2. */
940 x87_create_fpush(state, n, op1_idx, BINOP_IDX_2);
941 /* now do fxxx (tos=tos X op) */
945 dst = tmpl->normal_op;
947 /* Second live, first operand is dead here, bring it to tos. */
949 x87_create_fxch(state, n, op1_idx);
954 /* now do fxxx (tos=tos X op) */
956 dst = tmpl->normal_op;
959 /* Second operand is dead. */
960 if (op1_live_after) {
961 /* First operand is live: bring second to tos. */
963 x87_create_fxch(state, n, op2_idx);
968 /* now do fxxxr (tos = op X tos) */
970 dst = tmpl->reverse_op;
972 /* Both operands are dead here, pop them from the stack. */
975 /* Both are identically and on tos, no pop needed. */
976 /* here fxxx (tos = tos X tos) */
977 dst = tmpl->normal_op;
980 /* now do fxxxp (op = op X tos, pop) */
981 dst = tmpl->normal_pop_op;
985 } else if (op1_idx == 0) {
986 assert(op1_idx != op2_idx);
987 /* now do fxxxrp (op = tos X op, pop) */
988 dst = tmpl->reverse_pop_op;
992 /* Bring the second on top. */
993 x87_create_fxch(state, n, op2_idx);
994 if (op1_idx == op2_idx) {
995 /* Both are identically and on tos now, no pop needed. */
998 /* use fxxx (tos = tos X tos) */
999 dst = tmpl->normal_op;
1002 /* op2 is on tos now */
1004 /* use fxxxp (op = op X tos, pop) */
1005 dst = tmpl->normal_pop_op;
1013 /* second operand is an address mode */
1014 if (op1_live_after) {
1015 /* first operand is live: push it here */
1016 x87_create_fpush(state, n, op1_idx, BINOP_IDX_1);
1018 /* use fxxx (tos = tos X mem) */
1019 dst = tmpl->normal_op;
1022 /* first operand is dead: bring it to tos */
1024 x87_create_fxch(state, n, op1_idx);
1028 /* use fxxxp (tos = tos X mem) */
1029 dst = tmpl->normal_op;
1034 patched_insn = x87_patch_insn(n, dst);
1035 x87_set_st(state, arch_register_get_index(out), patched_insn, out_idx);
1040 /* patch the operation */
1041 attr = get_ia32_x87_attr(n);
1042 attr->x87[0] = op1_reg = &ia32_st_regs[op1_idx];
1043 if (reg_index_2 != REG_VFP_NOREG) {
1044 attr->x87[1] = op2_reg = &ia32_st_regs[op2_idx];
1046 attr->x87[2] = out = &ia32_st_regs[out_idx];
1048 if (reg_index_2 != REG_VFP_NOREG) {
1049 DB((dbg, LEVEL_1, "<<< %s %s, %s -> %s\n", get_irn_opname(n),
1050 arch_register_get_name(op1_reg), arch_register_get_name(op2_reg),
1051 arch_register_get_name(out)));
1053 DB((dbg, LEVEL_1, "<<< %s %s, [AM] -> %s\n", get_irn_opname(n),
1054 arch_register_get_name(op1_reg),
1055 arch_register_get_name(out)));
1058 return NO_NODE_ADDED;
1062 * Simulate a virtual Unop.
1064 * @param state the x87 state
1065 * @param n the node that should be simulated (and patched)
1066 * @param op the x87 opcode that will replace n's opcode
1068 * @return NO_NODE_ADDED
1070 static int sim_unop(x87_state *state, ir_node *n, ir_op *op) {
1071 int op1_idx, out_idx;
1072 x87_simulator *sim = state->sim;
1073 const arch_register_t *op1 = x87_get_irn_register(sim, get_irn_n(n, UNOP_IDX));
1074 const arch_register_t *out = x87_get_irn_register(sim, n);
1075 ia32_x87_attr_t *attr;
1076 unsigned live = vfp_live_args_after(sim, n, REGMASK(out));
1078 DB((dbg, LEVEL_1, ">>> %+F -> %s\n", n, out->name));
1079 DEBUG_ONLY(vfp_dump_live(live));
1081 op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1083 if (is_vfp_live(arch_register_get_index(op1), live)) {
1084 /* push the operand here */
1085 x87_create_fpush(state, n, op1_idx, UNOP_IDX);
1089 /* operand is dead, bring it to tos */
1091 x87_create_fxch(state, n, op1_idx);
1096 x87_set_tos(state, arch_register_get_index(out), x87_patch_insn(n, op));
1098 attr = get_ia32_x87_attr(n);
1099 attr->x87[0] = op1 = &ia32_st_regs[0];
1100 attr->x87[2] = out = &ia32_st_regs[0];
1101 DB((dbg, LEVEL_1, "<<< %s -> %s\n", get_irn_opname(n), out->name));
1103 return NO_NODE_ADDED;
1107 * Simulate a virtual Load instruction.
1109 * @param state the x87 state
1110 * @param n the node that should be simulated (and patched)
1111 * @param op the x87 opcode that will replace n's opcode
1113 * @return NO_NODE_ADDED
1115 static int sim_load(x87_state *state, ir_node *n, ir_op *op) {
1116 const arch_register_t *out = x87_get_irn_register(state->sim, n);
1117 ia32_x87_attr_t *attr;
1119 DB((dbg, LEVEL_1, ">>> %+F -> %s\n", n, arch_register_get_name(out)));
1120 x87_push(state, arch_register_get_index(out), x87_patch_insn(n, op));
1121 assert(out == x87_get_irn_register(state->sim, n));
1122 attr = get_ia32_x87_attr(n);
1123 attr->x87[2] = out = &ia32_st_regs[0];
1124 DB((dbg, LEVEL_1, "<<< %s -> %s\n", get_irn_opname(n), arch_register_get_name(out)));
1126 return NO_NODE_ADDED;
1130 * Rewire all users of @p old_val to @new_val iff they are scheduled after @p store.
1132 * @param store The store
1133 * @param old_val The former value
1134 * @param new_val The new value
1136 static void collect_and_rewire_users(ir_node *store, ir_node *old_val, ir_node *new_val) {
1137 const ir_edge_t *edge, *ne;
1139 foreach_out_edge_safe(old_val, edge, ne) {
1140 ir_node *user = get_edge_src_irn(edge);
1142 if (! user || user == store)
1145 /* if the user is scheduled after the store: rewire */
1146 if (sched_is_scheduled(user) && sched_comes_after(store, user)) {
1148 /* find the input of the user pointing to the old value */
1149 for (i = get_irn_arity(user) - 1; i >= 0; i--) {
1150 if (get_irn_n(user, i) == old_val)
1151 set_irn_n(user, i, new_val);
1155 } /* collect_and_rewire_users */
1158 * Simulate a virtual Store.
1160 * @param state the x87 state
1161 * @param n the node that should be simulated (and patched)
1162 * @param op the x87 store opcode
1163 * @param op_p the x87 store and pop opcode
1165 static int sim_store(x87_state *state, ir_node *n, ir_op *op, ir_op *op_p) {
1166 x87_simulator *sim = state->sim;
1167 ir_node *val = get_irn_n(n, STORE_VAL_IDX);
1168 const arch_register_t *op2 = x87_get_irn_register(sim, val);
1169 unsigned live = vfp_live_args_after(sim, n, 0);
1170 int insn = NO_NODE_ADDED;
1171 ia32_x87_attr_t *attr;
1172 int op2_reg_idx, op2_idx, depth;
1173 int live_after_node;
1176 op2_reg_idx = arch_register_get_index(op2);
1177 if (op2_reg_idx == REG_VFP_UKNWN) {
1178 /* just take any value from stack */
1179 if(state->depth > 0) {
1181 DEBUG_ONLY(op2 = NULL);
1182 live_after_node = 1;
1184 /* produce a new value which we will consume immediately */
1185 x87_create_fldz(state, n, op2_reg_idx);
1186 live_after_node = 0;
1187 op2_idx = x87_on_stack(state, op2_reg_idx);
1188 assert(op2_idx >= 0);
1191 op2_idx = x87_on_stack(state, op2_reg_idx);
1192 live_after_node = is_vfp_live(arch_register_get_index(op2), live);
1193 DB((dbg, LEVEL_1, ">>> %+F %s ->\n", n, arch_register_get_name(op2)));
1194 assert(op2_idx >= 0);
1197 mode = get_ia32_ls_mode(n);
1198 depth = x87_get_depth(state);
1200 if (live_after_node) {
1202 Problem: fst doesn't support mode_E (spills), only fstp does
1204 - stack not full: push value and fstp
1205 - stack full: fstp value and load again
1207 if (mode == mode_E) {
1208 if (depth < N_x87_REGS) {
1209 /* ok, we have a free register: push + fstp */
1210 x87_create_fpush(state, n, op2_idx, STORE_VAL_IDX);
1212 x87_patch_insn(n, op_p);
1214 ir_node *vfld, *mem, *block, *rproj, *mproj;
1217 /* stack full here: need fstp + load */
1219 x87_patch_insn(n, op_p);
1221 block = get_nodes_block(n);
1222 irg = get_irn_irg(n);
1223 vfld = new_rd_ia32_vfld(NULL, irg, block, get_irn_n(n, 0), get_irn_n(n, 1), new_rd_NoMem(irg), get_ia32_ls_mode(n));
1225 /* copy all attributes */
1226 set_ia32_frame_ent(vfld, get_ia32_frame_ent(n));
1227 if (is_ia32_use_frame(n))
1228 set_ia32_use_frame(vfld);
1229 set_ia32_op_type(vfld, ia32_am_Source);
1230 add_ia32_am_offs_int(vfld, get_ia32_am_offs_int(n));
1231 set_ia32_am_sc(vfld, get_ia32_am_sc(n));
1232 set_ia32_ls_mode(vfld, get_ia32_ls_mode(n));
1234 rproj = new_r_Proj(irg, block, vfld, get_ia32_ls_mode(vfld), pn_ia32_vfld_res);
1235 mproj = new_r_Proj(irg, block, vfld, mode_M, pn_ia32_vfld_M);
1236 mem = get_irn_Proj_for_mode(n, mode_M);
1238 assert(mem && "Store memory not found");
1240 arch_set_irn_register(sim->arch_env, rproj, op2);
1242 /* reroute all former users of the store memory to the load memory */
1243 edges_reroute(mem, mproj, irg);
1244 /* set the memory input of the load to the store memory */
1245 set_irn_n(vfld, 2, mem);
1247 sched_add_after(n, vfld);
1248 sched_add_after(vfld, rproj);
1250 /* rewire all users, scheduled after the store, to the loaded value */
1251 collect_and_rewire_users(n, val, rproj);
1256 /* we can only store the tos to memory */
1258 x87_create_fxch(state, n, op2_idx);
1260 /* mode != mode_E -> use normal fst */
1261 x87_patch_insn(n, op);
1264 /* we can only store the tos to memory */
1266 x87_create_fxch(state, n, op2_idx);
1269 x87_patch_insn(n, op_p);
1272 attr = get_ia32_x87_attr(n);
1273 attr->x87[1] = op2 = &ia32_st_regs[0];
1274 DB((dbg, LEVEL_1, "<<< %s %s ->\n", get_irn_opname(n), arch_register_get_name(op2)));
1279 #define _GEN_BINOP(op, rev) \
1280 static int sim_##op(x87_state *state, ir_node *n) { \
1281 exchange_tmpl tmpl = { op_ia32_##op, op_ia32_##rev, op_ia32_##op##p, op_ia32_##rev##p }; \
1282 return sim_binop(state, n, &tmpl); \
1285 #define GEN_BINOP(op) _GEN_BINOP(op, op)
1286 #define GEN_BINOPR(op) _GEN_BINOP(op, op##r)
1288 #define GEN_LOAD2(op, nop) \
1289 static int sim_##op(x87_state *state, ir_node *n) { \
1290 return sim_load(state, n, op_ia32_##nop); \
1293 #define GEN_LOAD(op) GEN_LOAD2(op, op)
1295 #define GEN_UNOP(op) \
1296 static int sim_##op(x87_state *state, ir_node *n) { \
1297 return sim_unop(state, n, op_ia32_##op); \
1300 #define GEN_STORE(op) \
1301 static int sim_##op(x87_state *state, ir_node *n) { \
1302 return sim_store(state, n, op_ia32_##op, op_ia32_##op##p); \
1324 * Simulate a fCondJmp.
1326 * @param state the x87 state
1327 * @param n the node that should be simulated (and patched)
1329 * @return NO_NODE_ADDED
1331 static int sim_fCmpJmp(x87_state *state, ir_node *n) {
1335 ia32_x87_attr_t *attr;
1337 x87_simulator *sim = state->sim;
1338 ir_node *op1_node = get_irn_n(n, n_ia32_vfCmpJmp_left);
1339 ir_node *op2_node = get_irn_n(n, n_ia32_vfCmpJmp_right);
1340 const arch_register_t *op1 = x87_get_irn_register(sim, op1_node);
1341 const arch_register_t *op2 = x87_get_irn_register(sim, op2_node);
1342 int reg_index_1 = arch_register_get_index(op1);
1343 int reg_index_2 = arch_register_get_index(op2);
1344 unsigned live = vfp_live_args_after(sim, n, 0);
1346 DB((dbg, LEVEL_1, ">>> %+F %s, %s\n", n,
1347 arch_register_get_name(op1), arch_register_get_name(op2)));
1348 DEBUG_ONLY(vfp_dump_live(live));
1349 DB((dbg, LEVEL_1, "Stack before: "));
1350 DEBUG_ONLY(x87_dump_stack(state));
1352 op1_idx = x87_on_stack(state, reg_index_1);
1353 assert(op1_idx >= 0);
1355 /* BEWARE: check for comp a,a cases, they might happen */
1356 if (reg_index_2 != REG_VFP_NOREG) {
1357 /* second operand is a vfp register */
1358 op2_idx = x87_on_stack(state, reg_index_2);
1359 assert(op2_idx >= 0);
1361 if (is_vfp_live(arch_register_get_index(op2), live)) {
1362 /* second operand is live */
1364 if (is_vfp_live(arch_register_get_index(op1), live)) {
1365 /* both operands are live */
1368 /* res = tos X op */
1369 dst = op_ia32_fcomJmp;
1370 } else if (op2_idx == 0) {
1371 /* res = op X tos */
1372 dst = op_ia32_fcomrJmp;
1374 /* bring the first one to tos */
1375 x87_create_fxch(state, n, op1_idx);
1379 /* res = tos X op */
1380 dst = op_ia32_fcomJmp;
1383 /* second live, first operand is dead here, bring it to tos.
1384 This means further, op1_idx != op2_idx. */
1385 assert(op1_idx != op2_idx);
1387 x87_create_fxch(state, n, op1_idx);
1392 /* res = tos X op, pop */
1393 dst = op_ia32_fcompJmp;
1397 /* second operand is dead */
1398 if (is_vfp_live(arch_register_get_index(op1), live)) {
1399 /* first operand is live: bring second to tos.
1400 This means further, op1_idx != op2_idx. */
1401 assert(op1_idx != op2_idx);
1403 x87_create_fxch(state, n, op2_idx);
1408 /* res = op X tos, pop */
1409 dst = op_ia32_fcomrpJmp;
1412 /* both operands are dead here, check first for identity. */
1413 if (op1_idx == op2_idx) {
1414 /* identically, one pop needed */
1416 x87_create_fxch(state, n, op1_idx);
1420 /* res = tos X op, pop */
1421 dst = op_ia32_fcompJmp;
1424 /* different, move them to st and st(1) and pop both.
1425 The tricky part is to get one into st(1).*/
1426 else if (op2_idx == 1) {
1427 /* good, second operand is already in the right place, move the first */
1429 /* bring the first on top */
1430 x87_create_fxch(state, n, op1_idx);
1431 assert(op2_idx != 0);
1434 /* res = tos X op, pop, pop */
1435 dst = op_ia32_fcomppJmp;
1437 } else if (op1_idx == 1) {
1438 /* good, first operand is already in the right place, move the second */
1440 /* bring the first on top */
1441 x87_create_fxch(state, n, op2_idx);
1442 assert(op1_idx != 0);
1445 dst = op_ia32_fcomrppJmp;
1448 /* if one is already the TOS, we need two fxch */
1450 /* first one is TOS, move to st(1) */
1451 x87_create_fxch(state, n, 1);
1452 assert(op2_idx != 1);
1454 x87_create_fxch(state, n, op2_idx);
1456 /* res = op X tos, pop, pop */
1457 dst = op_ia32_fcomrppJmp;
1459 } else if (op2_idx == 0) {
1460 /* second one is TOS, move to st(1) */
1461 x87_create_fxch(state, n, 1);
1462 assert(op1_idx != 1);
1464 x87_create_fxch(state, n, op1_idx);
1466 /* res = tos X op, pop, pop */
1467 dst = op_ia32_fcomppJmp;
1470 /* none of them is either TOS or st(1), 3 fxch needed */
1471 x87_create_fxch(state, n, op2_idx);
1472 assert(op1_idx != 0);
1473 x87_create_fxch(state, n, 1);
1475 x87_create_fxch(state, n, op1_idx);
1477 /* res = tos X op, pop, pop */
1478 dst = op_ia32_fcomppJmp;
1485 /* second operand is an address mode */
1486 if (is_vfp_live(arch_register_get_index(op1), live)) {
1487 /* first operand is live: bring it to TOS */
1489 x87_create_fxch(state, n, op1_idx);
1492 dst = op_ia32_fcomJmp;
1494 /* first operand is dead: bring it to tos */
1496 x87_create_fxch(state, n, op1_idx);
1499 dst = op_ia32_fcompJmp;
1504 x87_patch_insn(n, dst);
1505 assert(pop_cnt < 3);
1511 /* patch the operation */
1512 attr = get_ia32_x87_attr(n);
1513 op1 = &ia32_st_regs[op1_idx];
1516 op2 = &ia32_st_regs[op2_idx];
1519 attr->x87[2] = NULL;
1522 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(n),
1523 arch_register_get_name(op1), arch_register_get_name(op2)));
1525 DB((dbg, LEVEL_1, "<<< %s %s, [AM]\n", get_irn_opname(n),
1526 arch_register_get_name(op1)));
1528 return NO_NODE_ADDED;
1529 } /* sim_fCondJmp */
1532 int sim_Keep(x87_state *state, ir_node *node)
1535 const arch_register_t *op_reg;
1540 int node_added = NO_NODE_ADDED;
1542 DB((dbg, LEVEL_1, ">>> %+F\n", node));
1544 arity = get_irn_arity(node);
1545 for(i = 0; i < arity; ++i) {
1546 op = get_irn_n(node, i);
1547 op_reg = arch_get_irn_register(state->sim->arch_env, op);
1548 if(arch_register_get_class(op_reg) != &ia32_reg_classes[CLASS_ia32_vfp])
1551 reg_id = arch_register_get_index(op_reg);
1552 live = vfp_live_args_after(state->sim, node, 0);
1554 op_stack_idx = x87_on_stack(state, reg_id);
1555 if(op_stack_idx >= 0 && !is_vfp_live(reg_id, live)) {
1556 x87_create_fpop(state, sched_next(node), 1);
1557 node_added = NODE_ADDED;
1561 DB((dbg, LEVEL_1, "Stack after: "));
1562 DEBUG_ONLY(x87_dump_stack(state));
1568 void keep_float_node_alive(x87_state *state, ir_node *node)
1574 const arch_register_class_t *cls;
1576 irg = get_irn_irg(node);
1577 block = get_nodes_block(node);
1578 cls = arch_get_irn_reg_class(state->sim->arch_env, node, -1);
1580 keep = be_new_Keep(cls, irg, block, 1, in);
1582 assert(sched_is_scheduled(node));
1583 sched_add_after(node, keep);
1587 * Create a copy of a node. Recreate the node if it's a constant.
1589 * @param state the x87 state
1590 * @param n the node to be copied
1592 * @return the copy of n
1594 static ir_node *create_Copy(x87_state *state, ir_node *n) {
1595 x87_simulator *sim = state->sim;
1596 ir_graph *irg = get_irn_irg(n);
1597 dbg_info *n_dbg = get_irn_dbg_info(n);
1598 ir_mode *mode = get_irn_mode(n);
1599 ir_node *block = get_nodes_block(n);
1600 ir_node *pred = get_irn_n(n, 0);
1601 ir_node *(*cnstr)(dbg_info *, ir_graph *, ir_node *, ir_mode *) = NULL;
1603 const arch_register_t *out;
1604 const arch_register_t *op1;
1605 ia32_x87_attr_t *attr;
1607 /* Do not copy constants, recreate them. */
1608 switch (get_ia32_irn_opcode(pred)) {
1609 case iro_ia32_Unknown_VFP:
1611 cnstr = new_rd_ia32_fldz;
1614 cnstr = new_rd_ia32_fld1;
1616 case iro_ia32_fldpi:
1617 cnstr = new_rd_ia32_fldpi;
1619 case iro_ia32_fldl2e:
1620 cnstr = new_rd_ia32_fldl2e;
1622 case iro_ia32_fldl2t:
1623 cnstr = new_rd_ia32_fldl2t;
1625 case iro_ia32_fldlg2:
1626 cnstr = new_rd_ia32_fldlg2;
1628 case iro_ia32_fldln2:
1629 cnstr = new_rd_ia32_fldln2;
1635 out = x87_get_irn_register(sim, n);
1636 op1 = x87_get_irn_register(sim, pred);
1638 if (cnstr != NULL) {
1639 /* copy a constant */
1640 res = (*cnstr)(n_dbg, irg, block, mode);
1642 x87_push(state, arch_register_get_index(out), res);
1644 attr = get_ia32_x87_attr(res);
1645 attr->x87[2] = &ia32_st_regs[0];
1647 int op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1649 res = new_rd_ia32_fpushCopy(n_dbg, irg, block, pred, mode);
1651 x87_push(state, arch_register_get_index(out), res);
1653 attr = get_ia32_x87_attr(res);
1654 attr->x87[0] = &ia32_st_regs[op1_idx];
1655 attr->x87[2] = &ia32_st_regs[0];
1657 arch_set_irn_register(sim->arch_env, res, out);
1663 * Simulate a be_Copy.
1665 * @param state the x87 state
1666 * @param n the node that should be simulated (and patched)
1668 * @return NO_NODE_ADDED
1670 static int sim_Copy(x87_state *state, ir_node *n) {
1671 x87_simulator *sim = state->sim;
1673 const arch_register_t *out;
1674 const arch_register_t *op1;
1675 const arch_register_class_t *class;
1676 ir_node *node, *next;
1677 ia32_x87_attr_t *attr;
1678 int op1_idx, out_idx;
1681 class = arch_get_irn_reg_class(sim->arch_env, n, -1);
1682 if (class->regs != ia32_vfp_regs)
1685 pred = get_irn_n(n, 0);
1686 out = x87_get_irn_register(sim, n);
1687 op1 = x87_get_irn_register(sim, pred);
1688 live = vfp_live_args_after(sim, n, REGMASK(out));
1690 DB((dbg, LEVEL_1, ">>> %+F %s -> %s\n", n,
1691 arch_register_get_name(op1), arch_register_get_name(out)));
1692 DEBUG_ONLY(vfp_dump_live(live));
1694 /* handle the infamous unknown value */
1695 if (arch_register_get_index(op1) == REG_VFP_UKNWN) {
1696 /* Operand is still live, a real copy. We need here an fpush that can
1697 hold a a register, so use the fpushCopy or recreate constants */
1698 node = create_Copy(state, n);
1700 assert(is_ia32_fldz(node));
1701 next = sched_next(n);
1704 sched_add_before(next, node);
1706 DB((dbg, LEVEL_1, "<<< %+F %s -> %s\n", node, op1->name,
1707 arch_get_irn_register(sim->arch_env, node)->name));
1708 return NO_NODE_ADDED;
1711 op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1713 if (is_vfp_live(arch_register_get_index(op1), live)) {
1714 ir_node *pred = get_irn_n(n, 0);
1716 /* Operand is still live, a real copy. We need here an fpush that can
1717 hold a a register, so use the fpushCopy or recreate constants */
1718 node = create_Copy(state, n);
1720 /* We have to make sure the old value doesn't go dead (which can happen
1721 * when we recreate constants). As the simulator expected that value in
1722 * the pred blocks. This is unfortunate as removing it would save us 1
1723 * instruction, but we would have to rerun all the simulation to get
1726 next = sched_next(n);
1729 sched_add_before(next, node);
1731 if(get_irn_n_edges(pred) == 0) {
1732 keep_float_node_alive(state, pred);
1735 DB((dbg, LEVEL_1, "<<< %+F %s -> %s\n", node, op1->name,
1736 arch_get_irn_register(sim->arch_env, node)->name));
1738 out_idx = x87_on_stack(state, arch_register_get_index(out));
1740 if (out_idx >= 0 && out_idx != op1_idx) {
1741 /* Matze: out already on stack? how can this happen? */
1744 /* op1 must be killed and placed where out is */
1746 /* best case, simple remove and rename */
1747 x87_patch_insn(n, op_ia32_Pop);
1748 attr = get_ia32_x87_attr(n);
1749 attr->x87[0] = op1 = &ia32_st_regs[0];
1752 x87_set_st(state, arch_register_get_index(out), n, op1_idx - 1);
1754 /* move op1 to tos, store and pop it */
1756 x87_create_fxch(state, n, op1_idx);
1759 x87_patch_insn(n, op_ia32_Pop);
1760 attr = get_ia32_x87_attr(n);
1761 attr->x87[0] = op1 = &ia32_st_regs[out_idx];
1764 x87_set_st(state, arch_register_get_index(out), n, out_idx - 1);
1766 DB((dbg, LEVEL_1, "<<< %+F %s\n", n, op1->name));
1768 /* just a virtual copy */
1769 x87_set_st(state, arch_register_get_index(out), get_unop_op(n), op1_idx);
1770 /* don't remove the node to keep the verifier quiet :),
1771 the emitter won't emit any code for the node */
1774 DB((dbg, LEVEL_1, "<<< KILLED %s\n", get_irn_opname(n)));
1775 exchange(n, get_unop_op(n));
1779 return NO_NODE_ADDED;
1783 * Returns the result proj of the call
1785 static ir_node *get_call_result_proj(ir_node *call) {
1786 const ir_edge_t *edge;
1788 /* search the result proj */
1789 foreach_out_edge(call, edge) {
1790 ir_node *proj = get_edge_src_irn(edge);
1791 long pn = get_Proj_proj(proj);
1793 if (pn == pn_be_Call_first_res) {
1799 } /* get_call_result_proj */
1802 * Simulate a be_Call.
1804 * @param state the x87 state
1805 * @param n the node that should be simulated
1806 * @param arch_env the architecture environment
1808 * @return NO_NODE_ADDED
1810 static int sim_Call(x87_state *state, ir_node *n, const arch_env_t *arch_env)
1812 ir_type *call_tp = be_Call_get_type(n);
1816 const arch_register_t *reg;
1819 DB((dbg, LEVEL_1, ">>> %+F\n", n));
1821 /* at the begin of a call the x87 state should be empty */
1822 assert(state->depth == 0 && "stack not empty before call");
1824 if (get_method_n_ress(call_tp) <= 0)
1828 * If the called function returns a float, it is returned in st(0).
1829 * This even happens if the return value is NOT used.
1830 * Moreover, only one return result is supported.
1832 res_type = get_method_res_type(call_tp, 0);
1833 mode = get_type_mode(res_type);
1835 if (mode == NULL || !mode_is_float(mode))
1838 resproj = get_call_result_proj(n);
1839 assert(resproj != NULL);
1841 reg = x87_get_irn_register(state->sim, resproj);
1842 x87_push(state, arch_register_get_index(reg), resproj);
1845 DB((dbg, LEVEL_1, "Stack after: "));
1846 DEBUG_ONLY(x87_dump_stack(state));
1848 return NO_NODE_ADDED;
1852 * Simulate a be_Spill.
1854 * @param state the x87 state
1855 * @param n the node that should be simulated (and patched)
1857 * Should not happen, spills are lowered before x87 simulator see them.
1859 static int sim_Spill(x87_state *state, ir_node *n) {
1860 assert(0 && "Spill not lowered");
1861 return sim_fst(state, n);
1865 * Simulate a be_Reload.
1867 * @param state the x87 state
1868 * @param n the node that should be simulated (and patched)
1870 * Should not happen, reloads are lowered before x87 simulator see them.
1872 static int sim_Reload(x87_state *state, ir_node *n) {
1873 assert(0 && "Reload not lowered");
1874 return sim_fld(state, n);
1878 * Simulate a be_Return.
1880 * @param state the x87 state
1881 * @param n the node that should be simulated (and patched)
1883 * @return NO_NODE_ADDED
1885 static int sim_Return(x87_state *state, ir_node *n) {
1886 int n_res = be_Return_get_n_rets(n);
1887 int i, n_float_res = 0;
1889 /* only floating point return values must resist on stack */
1890 for (i = 0; i < n_res; ++i) {
1891 ir_node *res = get_irn_n(n, be_pos_Return_val + i);
1893 if (mode_is_float(get_irn_mode(res)))
1896 assert(x87_get_depth(state) == n_float_res);
1898 /* pop them virtually */
1899 for (i = n_float_res - 1; i >= 0; --i)
1902 return NO_NODE_ADDED;
1905 typedef struct _perm_data_t {
1906 const arch_register_t *in;
1907 const arch_register_t *out;
1911 * Simulate a be_Perm.
1913 * @param state the x87 state
1914 * @param irn the node that should be simulated (and patched)
1916 * @return NO_NODE_ADDED
1918 static int sim_Perm(x87_state *state, ir_node *irn) {
1920 x87_simulator *sim = state->sim;
1921 ir_node *pred = get_irn_n(irn, 0);
1923 const ir_edge_t *edge;
1925 /* handle only floating point Perms */
1926 if (! mode_is_float(get_irn_mode(pred)))
1927 return NO_NODE_ADDED;
1929 DB((dbg, LEVEL_1, ">>> %+F\n", irn));
1931 /* Perm is a pure virtual instruction on x87.
1932 All inputs must be on the FPU stack and are pairwise
1933 different from each other.
1934 So, all we need to do is to permutate the stack state. */
1935 n = get_irn_arity(irn);
1936 NEW_ARR_A(int, stack_pos, n);
1938 /* collect old stack positions */
1939 for (i = 0; i < n; ++i) {
1940 const arch_register_t *inreg = x87_get_irn_register(sim, get_irn_n(irn, i));
1941 int idx = x87_on_stack(state, arch_register_get_index(inreg));
1943 assert(idx >= 0 && "Perm argument not on x87 stack");
1947 /* now do the permutation */
1948 foreach_out_edge(irn, edge) {
1949 ir_node *proj = get_edge_src_irn(edge);
1950 const arch_register_t *out = x87_get_irn_register(sim, proj);
1951 long num = get_Proj_proj(proj);
1953 assert(0 <= num && num < n && "More Proj's than Perm inputs");
1954 x87_set_st(state, arch_register_get_index(out), proj, stack_pos[(unsigned)num]);
1956 DB((dbg, LEVEL_1, "<<< %+F\n", irn));
1958 return NO_NODE_ADDED;
1961 static int sim_Barrier(x87_state *state, ir_node *node) {
1962 //const arch_env_t *arch_env = state->sim->arch_env;
1965 /* materialize unknown if needed */
1966 arity = get_irn_arity(node);
1967 for(i = 0; i < arity; ++i) {
1968 const arch_register_t *reg;
1971 ia32_x87_attr_t *attr;
1972 ir_node *in = get_irn_n(node, i);
1974 if(!is_ia32_Unknown_VFP(in))
1977 /* TODO: not completely correct... */
1978 reg = &ia32_vfp_regs[REG_VFP_UKNWN];
1981 block = get_nodes_block(node);
1982 zero = new_rd_ia32_fldz(NULL, current_ir_graph, block, mode_E);
1983 x87_push(state, arch_register_get_index(reg), zero);
1985 attr = get_ia32_x87_attr(zero);
1986 attr->x87[2] = &ia32_st_regs[0];
1988 sched_add_before(node, zero);
1990 set_irn_n(node, i, zero);
1993 return NO_NODE_ADDED;
1998 * Kill any dead registers at block start by popping them from the stack.
2000 * @param sim the simulator handle
2001 * @param block the current block
2002 * @param start_state the x87 state at the begin of the block
2004 * @return the x87 state after dead register killed
2006 static x87_state *x87_kill_deads(x87_simulator *sim, ir_node *block, x87_state *start_state) {
2007 x87_state *state = start_state;
2008 ir_node *first_insn = sched_first(block);
2009 ir_node *keep = NULL;
2010 unsigned live = vfp_live_args_after(sim, block, 0);
2012 int i, depth, num_pop;
2015 depth = x87_get_depth(state);
2016 for (i = depth - 1; i >= 0; --i) {
2017 int reg = x87_get_st_reg(state, i);
2019 if (! is_vfp_live(reg, live))
2020 kill_mask |= (1 << i);
2024 /* create a new state, will be changed */
2025 state = x87_clone_state(sim, state);
2027 DB((dbg, LEVEL_1, "Killing deads:\n"));
2028 DEBUG_ONLY(vfp_dump_live(live));
2029 DEBUG_ONLY(x87_dump_stack(state));
2031 /* now kill registers */
2033 /* we can only kill from TOS, so bring them up */
2034 if (! (kill_mask & 1)) {
2035 /* search from behind, because we can to a double-pop */
2036 for (i = depth - 1; i >= 0; --i) {
2037 if (kill_mask & (1 << i)) {
2038 kill_mask &= ~(1 << i);
2045 x87_set_st(state, -1, keep, i);
2046 x87_create_fxch(state, first_insn, i);
2049 if ((kill_mask & 3) == 3) {
2050 /* we can do a double-pop */
2054 /* only a single pop */
2059 kill_mask >>= num_pop;
2060 keep = x87_create_fpop(state, first_insn, num_pop);
2065 } /* x87_kill_deads */
2068 * If we have PhiEs with unknown operands then we have to make sure that some
2069 * value is actually put onto the stack.
2071 static void fix_unknown_phis(x87_state *state, ir_node *block,
2072 ir_node *pred_block, int pos)
2076 sched_foreach(block, node) {
2078 const arch_register_t *reg;
2079 ia32_x87_attr_t *attr;
2084 op = get_Phi_pred(node, pos);
2085 if(!is_ia32_Unknown_VFP(op))
2088 reg = arch_get_irn_register(state->sim->arch_env, node);
2090 /* create a zero at end of pred block */
2091 zero = new_rd_ia32_fldz(NULL, current_ir_graph, pred_block, mode_E);
2092 x87_push(state, arch_register_get_index(reg), zero);
2094 attr = get_ia32_x87_attr(zero);
2095 attr->x87[2] = &ia32_st_regs[0];
2097 assert(is_ia32_fldz(zero));
2098 sched_add_before(sched_last(pred_block), zero);
2100 set_Phi_pred(node, pos, zero);
2105 * Run a simulation and fix all virtual instructions for a block.
2107 * @param sim the simulator handle
2108 * @param block the current block
2110 static void x87_simulate_block(x87_simulator *sim, ir_node *block) {
2112 blk_state *bl_state = x87_get_bl_state(sim, block);
2113 x87_state *state = bl_state->begin;
2114 const ir_edge_t *edge;
2115 ir_node *start_block;
2117 assert(state != NULL);
2118 /* already processed? */
2119 if (bl_state->end != NULL)
2122 DB((dbg, LEVEL_1, "Simulate %+F\n", block));
2123 DB((dbg, LEVEL_2, "State at Block begin:\n "));
2124 DEBUG_ONLY(x87_dump_stack(state));
2126 /* at block begin, kill all dead registers */
2127 state = x87_kill_deads(sim, block, state);
2128 /* create a new state, will be changed */
2129 state = x87_clone_state(sim, state);
2131 /* beware, n might change */
2132 for (n = sched_first(block); !sched_is_end(n); n = next) {
2135 ir_op *op = get_irn_op(n);
2137 next = sched_next(n);
2138 if (op->ops.generic == NULL)
2141 func = (sim_func)op->ops.generic;
2144 node_inserted = (*func)(state, n);
2147 sim_func might have added an additional node after n,
2149 beware: n must not be changed by sim_func
2150 (i.e. removed from schedule) in this case
2152 if (node_inserted != NO_NODE_ADDED)
2153 next = sched_next(n);
2156 start_block = get_irg_start_block(get_irn_irg(block));
2158 DB((dbg, LEVEL_2, "State at Block end:\n ")); DEBUG_ONLY(x87_dump_stack(state));
2160 /* check if the state must be shuffled */
2161 foreach_block_succ(block, edge) {
2162 ir_node *succ = get_edge_src_irn(edge);
2163 blk_state *succ_state;
2165 if (succ == start_block)
2168 succ_state = x87_get_bl_state(sim, succ);
2170 fix_unknown_phis(state, succ, block, get_edge_src_pos(edge));
2172 if (succ_state->begin == NULL) {
2173 DB((dbg, LEVEL_2, "Set begin state for succ %+F:\n", succ));
2174 DEBUG_ONLY(x87_dump_stack(state));
2175 succ_state->begin = state;
2177 waitq_put(sim->worklist, succ);
2179 DB((dbg, LEVEL_2, "succ %+F already has a state, shuffling\n", succ));
2180 /* There is already a begin state for the successor, bad.
2181 Do the necessary permutations.
2182 Note that critical edges are removed, so this is always possible:
2183 If the successor has more than one possible input, then it must
2186 x87_shuffle(sim, block, state, succ, succ_state->begin);
2189 bl_state->end = state;
2190 } /* x87_simulate_block */
2193 * Create a new x87 simulator.
2195 * @param sim a simulator handle, will be initialized
2196 * @param irg the current graph
2197 * @param arch_env the architecture environment
2199 static void x87_init_simulator(x87_simulator *sim, ir_graph *irg,
2200 const arch_env_t *arch_env)
2202 obstack_init(&sim->obst);
2203 sim->blk_states = pmap_create();
2204 sim->arch_env = arch_env;
2205 sim->n_idx = get_irg_last_idx(irg);
2206 sim->live = obstack_alloc(&sim->obst, sizeof(*sim->live) * sim->n_idx);
2208 DB((dbg, LEVEL_1, "--------------------------------\n"
2209 "x87 Simulator started for %+F\n", irg));
2211 /* set the generic function pointer of instruction we must simulate */
2212 clear_irp_opcodes_generic_func();
2214 #define ASSOC(op) (op_ ## op)->ops.generic = (op_func)(sim_##op)
2215 #define ASSOC_IA32(op) (op_ia32_v ## op)->ops.generic = (op_func)(sim_##op)
2216 #define ASSOC_BE(op) (op_be_ ## op)->ops.generic = (op_func)(sim_##op)
2230 ASSOC_IA32(fCmpJmp);
2242 } /* x87_init_simulator */
2245 * Destroy a x87 simulator.
2247 * @param sim the simulator handle
2249 static void x87_destroy_simulator(x87_simulator *sim) {
2250 pmap_destroy(sim->blk_states);
2251 obstack_free(&sim->obst, NULL);
2252 DB((dbg, LEVEL_1, "x87 Simulator stopped\n\n"));
2253 } /* x87_destroy_simulator */
2256 * Pre-block walker: calculate the liveness information for the block
2257 * and store it into the sim->live cache.
2259 static void update_liveness_walker(ir_node *block, void *data) {
2260 x87_simulator *sim = data;
2261 update_liveness(sim, block);
2262 } /* update_liveness_walker */
2265 * Run a simulation and fix all virtual instructions for a graph.
2267 * @param env the architecture environment
2268 * @param irg the current graph
2270 * Needs a block-schedule.
2272 void x87_simulate_graph(const arch_env_t *arch_env, be_irg_t *birg) {
2273 ir_node *block, *start_block;
2274 blk_state *bl_state;
2276 ir_graph *irg = be_get_birg_irg(birg);
2278 /* create the simulator */
2279 x87_init_simulator(&sim, irg, arch_env);
2281 start_block = get_irg_start_block(irg);
2282 bl_state = x87_get_bl_state(&sim, start_block);
2284 /* start with the empty state */
2285 bl_state->begin = empty;
2288 sim.worklist = new_waitq();
2289 waitq_put(sim.worklist, start_block);
2291 be_assure_liveness(birg);
2292 sim.lv = be_get_birg_liveness(birg);
2293 // sim.lv = be_liveness(be_get_birg_irg(birg));
2294 be_liveness_assure_sets(sim.lv);
2296 /* Calculate the liveness for all nodes. We must precalculate this info,
2297 * because the simulator adds new nodes (possible before Phi nodes) which
2298 * would let a lazy calculation fail.
2299 * On the other hand we reduce the computation amount due to
2300 * precaching from O(n^2) to O(n) at the expense of O(n) cache memory.
2302 irg_block_walk_graph(irg, update_liveness_walker, NULL, &sim);
2306 block = waitq_get(sim.worklist);
2307 x87_simulate_block(&sim, block);
2308 } while (! waitq_empty(sim.worklist));
2311 del_waitq(sim.worklist);
2312 x87_destroy_simulator(&sim);
2313 } /* x87_simulate_graph */
2315 void ia32_init_x87(void) {
2316 FIRM_DBG_REGISTER(dbg, "firm.be.ia32.x87");
2317 } /* ia32_init_x87 */