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 "bearch_ia32_t.h"
51 #include "ia32_new_nodes.h"
52 #include "gen_ia32_new_nodes.h"
53 #include "gen_ia32_regalloc_if.h"
55 #include "ia32_architecture.h"
62 #define MASK_TOS(x) ((x) & (N_x87_REGS - 1))
64 /** the debug handle */
65 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
67 /* Forward declaration. */
68 typedef struct _x87_simulator x87_simulator;
71 * An exchange template.
72 * Note that our virtual functions have the same inputs
73 * and attributes as the real ones, so we can simple exchange
75 * Further, x87 supports inverse instructions, so we can handle them.
77 typedef struct _exchange_tmpl {
78 ir_op *normal_op; /**< the normal one */
79 ir_op *reverse_op; /**< the reverse one if exists */
80 ir_op *normal_pop_op; /**< the normal one with tos pop */
81 ir_op *reverse_pop_op; /**< the reverse one with tos pop */
85 * An entry on the simulated x87 stack.
87 typedef struct _st_entry {
88 int reg_idx; /**< the virtual register index of this stack value */
89 ir_node *node; /**< the node that produced this value */
95 typedef struct _x87_state {
96 st_entry st[N_x87_REGS]; /**< the register stack */
97 int depth; /**< the current stack depth */
98 int tos; /**< position of the tos */
99 x87_simulator *sim; /**< The simulator. */
102 /** An empty state, used for blocks without fp instructions. */
103 static x87_state _empty = { { {0, NULL}, }, 0, 0, NULL };
104 static x87_state *empty = (x87_state *)&_empty;
107 NO_NODE_ADDED = 0, /**< No node was added. */
108 NODE_ADDED = 1 /**< A node was added by the simulator in the schedule. */
112 * The type of an instruction simulator function.
114 * @param state the x87 state
115 * @param n the node to be simulated
117 * @return NODE_ADDED if a node was added AFTER n in schedule,
120 typedef int (*sim_func)(x87_state *state, ir_node *n);
123 * A block state: Every block has a x87 state at the beginning and at the end.
125 typedef struct _blk_state {
126 x87_state *begin; /**< state at the begin or NULL if not assigned */
127 x87_state *end; /**< state at the end or NULL if not assigned */
130 #define PTR_TO_BLKSTATE(p) ((blk_state *)(p))
132 /** liveness bitset for vfp registers. */
133 typedef unsigned char vfp_liveness;
138 struct _x87_simulator {
139 struct obstack obst; /**< An obstack for fast allocating. */
140 pmap *blk_states; /**< Map blocks to states. */
141 const arch_env_t *arch_env; /**< The architecture environment. */
142 be_lv_t *lv; /**< intrablock liveness. */
143 vfp_liveness *live; /**< Liveness information. */
144 unsigned n_idx; /**< The cached get_irg_last_idx() result. */
145 waitq *worklist; /**< Worklist of blocks that must be processed. */
146 ia32_isa_t *isa; /**< the ISA object */
150 * Returns the current stack depth.
152 * @param state the x87 state
154 * @return the x87 stack depth
156 static int x87_get_depth(const x87_state *state) {
158 } /* x87_get_depth */
161 * Return the virtual register index at st(pos).
163 * @param state the x87 state
164 * @param pos a stack position
166 * @return the vfp register index that produced the value at st(pos)
168 static int x87_get_st_reg(const x87_state *state, int pos) {
169 assert(pos < state->depth);
170 return state->st[MASK_TOS(state->tos + pos)].reg_idx;
171 } /* x87_get_st_reg */
175 * Return the node at st(pos).
177 * @param state the x87 state
178 * @param pos a stack position
180 * @return the IR node that produced the value at st(pos)
182 static ir_node *x87_get_st_node(const x87_state *state, int pos) {
183 assert(pos < state->depth);
184 return state->st[MASK_TOS(state->tos + pos)].node;
185 } /* x87_get_st_node */
188 * Dump the stack for debugging.
190 * @param state the x87 state
192 static void x87_dump_stack(const x87_state *state) {
195 for (i = state->depth - 1; i >= 0; --i) {
196 DB((dbg, LEVEL_2, "vf%d(%+F) ", x87_get_st_reg(state, i),
197 x87_get_st_node(state, i)));
199 DB((dbg, LEVEL_2, "<-- TOS\n"));
200 } /* x87_dump_stack */
201 #endif /* DEBUG_libfirm */
204 * Set a virtual register to st(pos).
206 * @param state the x87 state
207 * @param reg_idx the vfp register index that should be set
208 * @param node the IR node that produces the value of the vfp register
209 * @param pos the stack position where the new value should be entered
211 static void x87_set_st(x87_state *state, int reg_idx, ir_node *node, int pos) {
212 assert(0 < state->depth);
213 state->st[MASK_TOS(state->tos + pos)].reg_idx = reg_idx;
214 state->st[MASK_TOS(state->tos + pos)].node = node;
216 DB((dbg, LEVEL_2, "After SET_REG: "));
217 DEBUG_ONLY(x87_dump_stack(state));
221 * Set the tos virtual register.
223 * @param state the x87 state
224 * @param reg_idx the vfp register index that should be set
225 * @param node the IR node that produces the value of the vfp register
227 static void x87_set_tos(x87_state *state, int reg_idx, ir_node *node) {
228 x87_set_st(state, reg_idx, node, 0);
232 * Swap st(0) with st(pos).
234 * @param state the x87 state
235 * @param pos the stack position to change the tos with
237 static void x87_fxch(x87_state *state, int pos) {
239 assert(pos < state->depth);
241 entry = state->st[MASK_TOS(state->tos + pos)];
242 state->st[MASK_TOS(state->tos + pos)] = state->st[MASK_TOS(state->tos)];
243 state->st[MASK_TOS(state->tos)] = entry;
245 DB((dbg, LEVEL_2, "After FXCH: ")); DEBUG_ONLY(x87_dump_stack(state));
249 * Convert a virtual register to the stack index.
251 * @param state the x87 state
252 * @param reg_idx the register vfp index
254 * @return the stack position where the register is stacked
255 * or -1 if the virtual register was not found
257 static int x87_on_stack(const x87_state *state, int reg_idx) {
258 int i, tos = state->tos;
260 for (i = 0; i < state->depth; ++i)
261 if (state->st[MASK_TOS(tos + i)].reg_idx == reg_idx)
267 * Push a virtual Register onto the stack, double pushed allowed.
269 * @param state the x87 state
270 * @param reg_idx the register vfp index
271 * @param node the node that produces the value of the vfp register
273 static void x87_push_dbl(x87_state *state, int reg_idx, ir_node *node) {
274 assert(state->depth < N_x87_REGS && "stack overrun");
277 state->tos = MASK_TOS(state->tos - 1);
278 state->st[state->tos].reg_idx = reg_idx;
279 state->st[state->tos].node = node;
281 DB((dbg, LEVEL_2, "After PUSH: ")); DEBUG_ONLY(x87_dump_stack(state));
285 * Push a virtual Register onto the stack, double pushes are NOT allowed.
287 * @param state the x87 state
288 * @param reg_idx the register vfp index
289 * @param node the node that produces the value of the vfp register
290 * @param dbl_push if != 0 double pushes are allowed
292 static void x87_push(x87_state *state, int reg_idx, ir_node *node) {
293 assert(x87_on_stack(state, reg_idx) == -1 && "double push");
295 x87_push_dbl(state, reg_idx, node);
299 * Pop a virtual Register from the stack.
301 * @param state the x87 state
303 static void x87_pop(x87_state *state) {
304 assert(state->depth > 0 && "stack underrun");
307 state->tos = MASK_TOS(state->tos + 1);
309 DB((dbg, LEVEL_2, "After POP: ")); DEBUG_ONLY(x87_dump_stack(state));
313 * Empty the fpu stack
315 * @param state the x87 state
317 static void x87_emms(x87_state *state) {
323 * Returns the block state of a block.
325 * @param sim the x87 simulator handle
326 * @param block the current block
328 * @return the block state
330 static blk_state *x87_get_bl_state(x87_simulator *sim, ir_node *block) {
331 pmap_entry *entry = pmap_find(sim->blk_states, block);
334 blk_state *bl_state = obstack_alloc(&sim->obst, sizeof(*bl_state));
335 bl_state->begin = NULL;
336 bl_state->end = NULL;
338 pmap_insert(sim->blk_states, block, bl_state);
342 return PTR_TO_BLKSTATE(entry->value);
343 } /* x87_get_bl_state */
346 * Creates a new x87 state.
348 * @param sim the x87 simulator handle
350 * @return a new x87 state
352 static x87_state *x87_alloc_state(x87_simulator *sim) {
353 x87_state *res = obstack_alloc(&sim->obst, sizeof(*res));
357 } /* x87_alloc_state */
362 * @param sim the x87 simulator handle
363 * @param src the x87 state that will be cloned
365 * @return a cloned copy of the src state
367 static x87_state *x87_clone_state(x87_simulator *sim, const x87_state *src) {
368 x87_state *res = x87_alloc_state(sim);
370 memcpy(res, src, sizeof(*res));
372 } /* x87_clone_state */
375 * Patch a virtual instruction into a x87 one and return
376 * the node representing the result value.
378 * @param n the IR node to patch
379 * @param op the x87 opcode to patch in
381 static ir_node *x87_patch_insn(ir_node *n, ir_op *op) {
382 ir_mode *mode = get_irn_mode(n);
387 if (mode == mode_T) {
388 /* patch all Proj's */
389 const ir_edge_t *edge;
391 foreach_out_edge(n, edge) {
392 ir_node *proj = get_edge_src_irn(edge);
394 mode = get_irn_mode(proj);
395 if (mode_is_float(mode)) {
397 set_irn_mode(proj, mode_E);
401 } else if (mode_is_float(mode))
402 set_irn_mode(n, mode_E);
404 } /* x87_patch_insn */
407 * Returns the first Proj of a mode_T node having a given mode.
409 * @param n the mode_T node
410 * @param m the desired mode of the Proj
411 * @return The first Proj of mode @p m found or NULL.
413 static ir_node *get_irn_Proj_for_mode(ir_node *n, ir_mode *m) {
414 const ir_edge_t *edge;
416 assert(get_irn_mode(n) == mode_T && "Need mode_T node");
418 foreach_out_edge(n, edge) {
419 ir_node *proj = get_edge_src_irn(edge);
420 if (get_irn_mode(proj) == m)
425 } /* get_irn_Proj_for_mode */
428 * Wrap the arch_* function here so we can check for errors.
430 static INLINE const arch_register_t *x87_get_irn_register(x87_simulator *sim, const ir_node *irn) {
431 const arch_register_t *res;
433 res = arch_get_irn_register(sim->arch_env, irn);
434 assert(res->reg_class->regs == ia32_vfp_regs);
436 } /* x87_get_irn_register */
438 /* -------------- x87 perm --------------- */
441 * Creates a fxch for shuffle.
443 * @param state the x87 state
444 * @param pos parameter for fxch
445 * @param block the block were fxch is inserted
447 * Creates a new fxch node and reroute the user of the old node
450 * @return the fxch node
452 static ir_node *x87_fxch_shuffle(x87_state *state, int pos, ir_node *block) {
454 ia32_x87_attr_t *attr;
456 fxch = new_rd_ia32_fxch(NULL, get_irn_irg(block), block);
457 attr = get_ia32_x87_attr(fxch);
458 attr->x87[0] = &ia32_st_regs[pos];
459 attr->x87[2] = &ia32_st_regs[0];
463 x87_fxch(state, pos);
465 } /* x87_fxch_shuffle */
468 * Calculate the necessary permutations to reach dst_state.
470 * These permutations are done with fxch instructions and placed
471 * at the end of the block.
473 * Note that critical edges are removed here, so we need only
474 * a shuffle if the current block has only one successor.
476 * @param sim the simulator handle
477 * @param block the current block
478 * @param state the current x87 stack state, might be modified
479 * @param dst_block the destination block
480 * @param dst_state destination state
484 static x87_state *x87_shuffle(x87_simulator *sim, ir_node *block,
485 x87_state *state, ir_node *dst_block,
486 const x87_state *dst_state)
488 int i, n_cycles, k, ri;
489 unsigned cycles[4], all_mask;
490 char cycle_idx[4][8];
491 ir_node *fxch, *before, *after;
495 assert(state->depth == dst_state->depth);
497 /* Some mathematics here:
498 If we have a cycle of length n that includes the tos,
499 we need n-1 exchange operations.
500 We can always add the tos and restore it, so we need
501 n+1 exchange operations for a cycle not containing the tos.
502 So, the maximum of needed operations is for a cycle of 7
503 not including the tos == 8.
504 This is the same number of ops we would need for using stores,
505 so exchange is cheaper (we save the loads).
506 On the other hand, we might need an additional exchange
507 in the next block to bring one operand on top, so the
508 number of ops in the first case is identical.
509 Further, no more than 4 cycles can exists (4 x 2).
511 all_mask = (1 << (state->depth)) - 1;
513 for (n_cycles = 0; all_mask; ++n_cycles) {
514 int src_idx, dst_idx;
516 /* find the first free slot */
517 for (i = 0; i < state->depth; ++i) {
518 if (all_mask & (1 << i)) {
519 all_mask &= ~(1 << i);
521 /* check if there are differences here */
522 if (x87_get_st_reg(state, i) != x87_get_st_reg(dst_state, i))
528 /* no more cycles found */
533 cycles[n_cycles] = (1 << i);
534 cycle_idx[n_cycles][k++] = i;
535 for (src_idx = i; ; src_idx = dst_idx) {
536 dst_idx = x87_on_stack(dst_state, x87_get_st_reg(state, src_idx));
538 if ((all_mask & (1 << dst_idx)) == 0)
541 cycle_idx[n_cycles][k++] = dst_idx;
542 cycles[n_cycles] |= (1 << dst_idx);
543 all_mask &= ~(1 << dst_idx);
545 cycle_idx[n_cycles][k] = -1;
549 /* no permutation needed */
553 /* Hmm: permutation needed */
554 DB((dbg, LEVEL_2, "\n%+F needs permutation: from\n", block));
555 DEBUG_ONLY(x87_dump_stack(state));
556 DB((dbg, LEVEL_2, " to\n"));
557 DEBUG_ONLY(x87_dump_stack(dst_state));
561 DB((dbg, LEVEL_2, "Need %d cycles\n", n_cycles));
562 for (ri = 0; ri < n_cycles; ++ri) {
563 DB((dbg, LEVEL_2, " Ring %d:\n ", ri));
564 for (k = 0; cycle_idx[ri][k] != -1; ++k)
565 DB((dbg, LEVEL_2, " st%d ->", cycle_idx[ri][k]));
566 DB((dbg, LEVEL_2, "\n"));
573 * Find the place node must be insert.
574 * We have only one successor block, so the last instruction should
577 before = sched_last(block);
578 assert(is_cfop(before));
580 /* now do the permutations */
581 for (ri = 0; ri < n_cycles; ++ri) {
582 if ((cycles[ri] & 1) == 0) {
583 /* this cycle does not include the tos */
584 fxch = x87_fxch_shuffle(state, cycle_idx[ri][0], block);
586 sched_add_after(after, fxch);
588 sched_add_before(before, fxch);
591 for (k = 1; cycle_idx[ri][k] != -1; ++k) {
592 fxch = x87_fxch_shuffle(state, cycle_idx[ri][k], block);
594 sched_add_after(after, fxch);
596 sched_add_before(before, fxch);
599 if ((cycles[ri] & 1) == 0) {
600 /* this cycle does not include the tos */
601 fxch = x87_fxch_shuffle(state, cycle_idx[ri][0], block);
602 sched_add_after(after, fxch);
609 * Create a fxch node before another node.
611 * @param state the x87 state
612 * @param n the node after the fxch
613 * @param pos exchange st(pos) with st(0)
617 static ir_node *x87_create_fxch(x87_state *state, ir_node *n, int pos)
620 ia32_x87_attr_t *attr;
621 ir_graph *irg = get_irn_irg(n);
622 ir_node *block = get_nodes_block(n);
624 x87_fxch(state, pos);
626 fxch = new_rd_ia32_fxch(NULL, irg, block);
627 attr = get_ia32_x87_attr(fxch);
628 attr->x87[0] = &ia32_st_regs[pos];
629 attr->x87[2] = &ia32_st_regs[0];
633 sched_add_before(n, fxch);
634 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(fxch), attr->x87[0]->name, attr->x87[2]->name));
636 } /* x87_create_fxch */
639 * Create a fpush before node n.
641 * @param state the x87 state
642 * @param n the node after the fpush
643 * @param pos push st(pos) on stack
644 * @param op_idx replace input op_idx of n with the fpush result
646 static void x87_create_fpush(x87_state *state, ir_node *n, int pos, int op_idx) {
647 ir_node *fpush, *pred = get_irn_n(n, op_idx);
648 ia32_x87_attr_t *attr;
649 const arch_register_t *out = x87_get_irn_register(state->sim, pred);
651 x87_push_dbl(state, arch_register_get_index(out), pred);
653 fpush = new_rd_ia32_fpush(NULL, get_irn_irg(n), get_nodes_block(n));
654 attr = get_ia32_x87_attr(fpush);
655 attr->x87[0] = &ia32_st_regs[pos];
656 attr->x87[2] = &ia32_st_regs[0];
659 sched_add_before(n, fpush);
661 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(fpush), attr->x87[0]->name, attr->x87[2]->name));
662 } /* x87_create_fpush */
665 * Create a fpop before node n.
667 * @param state the x87 state
668 * @param n the node after the fpop
669 * @param num pop 1 or 2 values
671 * @return the fpop node
673 static ir_node *x87_create_fpop(x87_state *state, ir_node *n, int num)
675 ir_node *fpop = NULL;
676 ia32_x87_attr_t *attr;
681 if (ia32_cg_config.use_ffreep)
682 fpop = new_rd_ia32_ffreep(NULL, get_irn_irg(n), get_nodes_block(n));
684 fpop = new_rd_ia32_fpop(NULL, get_irn_irg(n), get_nodes_block(n));
685 attr = get_ia32_x87_attr(fpop);
686 attr->x87[0] = &ia32_st_regs[0];
687 attr->x87[1] = &ia32_st_regs[0];
688 attr->x87[2] = &ia32_st_regs[0];
691 sched_add_before(n, fpop);
692 DB((dbg, LEVEL_1, "<<< %s %s\n", get_irn_opname(fpop), attr->x87[0]->name));
697 } /* x87_create_fpop */
700 * Creates an fldz before node n
702 * @param state the x87 state
703 * @param n the node after the fldz
705 * @return the fldz node
707 static ir_node *x87_create_fldz(x87_state *state, ir_node *n, int regidx) {
708 ir_graph *irg = get_irn_irg(n);
709 ir_node *block = get_nodes_block(n);
712 fldz = new_rd_ia32_fldz(NULL, irg, block, mode_E);
714 sched_add_before(n, fldz);
715 DB((dbg, LEVEL_1, "<<< %s\n", get_irn_opname(fldz)));
718 x87_push(state, regidx, fldz);
723 /* --------------------------------- liveness ------------------------------------------ */
726 * The liveness transfer function.
727 * Updates a live set over a single step from a given node to its predecessor.
728 * Everything defined at the node is removed from the set, the uses of the node get inserted.
730 * @param sim The simulator handle.
731 * @param irn The node at which liveness should be computed.
732 * @param live The bitset of registers live before @p irn. This set gets modified by updating it to
733 * the registers live after irn.
735 * @return The live bitset.
737 static vfp_liveness vfp_liveness_transfer(x87_simulator *sim, ir_node *irn, vfp_liveness live)
740 const arch_register_class_t *cls = &ia32_reg_classes[CLASS_ia32_vfp];
741 const arch_env_t *arch_env = sim->arch_env;
743 if (get_irn_mode(irn) == mode_T) {
744 const ir_edge_t *edge;
746 foreach_out_edge(irn, edge) {
747 ir_node *proj = get_edge_src_irn(edge);
749 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
750 const arch_register_t *reg = x87_get_irn_register(sim, proj);
751 live &= ~(1 << arch_register_get_index(reg));
756 if (arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) {
757 const arch_register_t *reg = x87_get_irn_register(sim, irn);
758 live &= ~(1 << arch_register_get_index(reg));
761 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
762 ir_node *op = get_irn_n(irn, i);
764 if (mode_is_float(get_irn_mode(op)) && arch_irn_consider_in_reg_alloc(arch_env, cls, op)) {
765 const arch_register_t *reg = x87_get_irn_register(sim, op);
766 live |= 1 << arch_register_get_index(reg);
770 } /* vfp_liveness_transfer */
773 * Put all live virtual registers at the end of a block into a bitset.
775 * @param sim the simulator handle
776 * @param lv the liveness information
777 * @param bl the block
779 * @return The live bitset at the end of this block
781 static vfp_liveness vfp_liveness_end_of_block(x87_simulator *sim, const ir_node *block)
784 vfp_liveness live = 0;
785 const arch_register_class_t *cls = &ia32_reg_classes[CLASS_ia32_vfp];
786 const arch_env_t *arch_env = sim->arch_env;
787 const be_lv_t *lv = sim->lv;
789 be_lv_foreach(lv, block, be_lv_state_end, i) {
790 const arch_register_t *reg;
791 const ir_node *node = be_lv_get_irn(lv, block, i);
792 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
795 reg = x87_get_irn_register(sim, node);
796 live |= 1 << arch_register_get_index(reg);
800 } /* vfp_liveness_end_of_block */
802 /** get the register mask from an arch_register */
803 #define REGMASK(reg) (1 << (arch_register_get_index(reg)))
806 * Return a bitset of argument registers which are live at the end of a node.
808 * @param sim the simulator handle
809 * @param pos the node
810 * @param kill kill mask for the output registers
812 * @return The live bitset.
814 static unsigned vfp_live_args_after(x87_simulator *sim, const ir_node *pos, unsigned kill)
816 unsigned idx = get_irn_idx(pos);
818 assert(idx < sim->n_idx);
819 return sim->live[idx] & ~kill;
820 } /* vfp_live_args_after */
823 * Calculate the liveness for a whole block and cache it.
825 * @param sim the simulator handle
826 * @param lv the liveness handle
827 * @param block the block
829 static void update_liveness(x87_simulator *sim, ir_node *block) {
830 vfp_liveness live = vfp_liveness_end_of_block(sim, block);
834 /* now iterate through the block backward and cache the results */
835 sched_foreach_reverse(block, irn) {
836 /* stop at the first Phi: this produces the live-in */
840 idx = get_irn_idx(irn);
841 sim->live[idx] = live;
843 live = vfp_liveness_transfer(sim, irn, live);
845 idx = get_irn_idx(block);
846 sim->live[idx] = live;
847 } /* update_liveness */
850 * Returns true if a register is live in a set.
852 * @param reg_idx the vfp register index
853 * @param live a live bitset
855 #define is_vfp_live(reg_idx, live) ((live) & (1 << (reg_idx)))
859 * Dump liveness info.
861 * @param live the live bitset
863 static void vfp_dump_live(vfp_liveness live) {
866 DB((dbg, LEVEL_2, "Live after: "));
867 for (i = 0; i < 8; ++i) {
868 if (live & (1 << i)) {
869 DB((dbg, LEVEL_2, "vf%d ", i));
872 DB((dbg, LEVEL_2, "\n"));
873 } /* vfp_dump_live */
874 #endif /* DEBUG_libfirm */
876 /* --------------------------------- simulators ---------------------------------------- */
878 #define XCHG(a, b) do { int t = (a); (a) = (b); (b) = t; } while (0)
890 * Simulate a virtual binop.
892 * @param state the x87 state
893 * @param n the node that should be simulated (and patched)
894 * @param tmpl the template containing the 4 possible x87 opcodes
896 * @return NO_NODE_ADDED
898 static int sim_binop(x87_state *state, ir_node *n, const exchange_tmpl *tmpl) {
899 int op2_idx = 0, op1_idx;
900 int out_idx, do_pop = 0;
901 ia32_x87_attr_t *attr;
902 ir_node *patched_insn;
904 x87_simulator *sim = state->sim;
905 ir_node *op1 = get_irn_n(n, n_ia32_binary_left);
906 ir_node *op2 = get_irn_n(n, n_ia32_binary_right);
907 const arch_register_t *op1_reg = x87_get_irn_register(sim, op1);
908 const arch_register_t *op2_reg = x87_get_irn_register(sim, op2);
909 const arch_register_t *out = x87_get_irn_register(sim, n);
910 int reg_index_1 = arch_register_get_index(op1_reg);
911 int reg_index_2 = arch_register_get_index(op2_reg);
912 vfp_liveness live = vfp_live_args_after(sim, n, REGMASK(out));
916 DB((dbg, LEVEL_1, ">>> %+F %s, %s -> %s\n", n,
917 arch_register_get_name(op1_reg), arch_register_get_name(op2_reg),
918 arch_register_get_name(out)));
919 DEBUG_ONLY(vfp_dump_live(live));
920 DB((dbg, LEVEL_1, "Stack before: "));
921 DEBUG_ONLY(x87_dump_stack(state));
923 if(reg_index_1 == REG_VFP_UKNWN) {
927 op1_idx = x87_on_stack(state, reg_index_1);
928 assert(op1_idx >= 0);
929 op1_live_after = is_vfp_live(arch_register_get_index(op1_reg), live);
932 if (reg_index_2 != REG_VFP_NOREG) {
933 if(reg_index_2 == REG_VFP_UKNWN) {
937 /* second operand is a vfp register */
938 op2_idx = x87_on_stack(state, reg_index_2);
939 assert(op2_idx >= 0);
941 = is_vfp_live(arch_register_get_index(op2_reg), live);
944 if (op2_live_after) {
945 /* Second operand is live. */
947 if (op1_live_after) {
948 /* Both operands are live: push the first one.
949 This works even for op1 == op2. */
950 x87_create_fpush(state, n, op1_idx, n_ia32_binary_right);
951 /* now do fxxx (tos=tos X op) */
955 dst = tmpl->normal_op;
957 /* Second live, first operand is dead here, bring it to tos. */
959 x87_create_fxch(state, n, op1_idx);
964 /* now do fxxx (tos=tos X op) */
966 dst = tmpl->normal_op;
969 /* Second operand is dead. */
970 if (op1_live_after) {
971 /* First operand is live: bring second to tos. */
973 x87_create_fxch(state, n, op2_idx);
978 /* now do fxxxr (tos = op X tos) */
980 dst = tmpl->reverse_op;
982 /* Both operands are dead here, pop them from the stack. */
985 /* Both are identically and on tos, no pop needed. */
986 /* here fxxx (tos = tos X tos) */
987 dst = tmpl->normal_op;
990 /* now do fxxxp (op = op X tos, pop) */
991 dst = tmpl->normal_pop_op;
995 } else if (op1_idx == 0) {
996 assert(op1_idx != op2_idx);
997 /* now do fxxxrp (op = tos X op, pop) */
998 dst = tmpl->reverse_pop_op;
1002 /* Bring the second on top. */
1003 x87_create_fxch(state, n, op2_idx);
1004 if (op1_idx == op2_idx) {
1005 /* Both are identically and on tos now, no pop needed. */
1008 /* use fxxx (tos = tos X tos) */
1009 dst = tmpl->normal_op;
1012 /* op2 is on tos now */
1014 /* use fxxxp (op = op X tos, pop) */
1015 dst = tmpl->normal_pop_op;
1023 /* second operand is an address mode */
1024 if (op1_live_after) {
1025 /* first operand is live: push it here */
1026 x87_create_fpush(state, n, op1_idx, n_ia32_binary_left);
1028 /* use fxxx (tos = tos X mem) */
1029 dst = tmpl->normal_op;
1032 /* first operand is dead: bring it to tos */
1034 x87_create_fxch(state, n, op1_idx);
1038 /* use fxxxp (tos = tos X mem) */
1039 dst = tmpl->normal_op;
1044 patched_insn = x87_patch_insn(n, dst);
1045 x87_set_st(state, arch_register_get_index(out), patched_insn, out_idx);
1050 /* patch the operation */
1051 attr = get_ia32_x87_attr(n);
1052 attr->x87[0] = op1_reg = &ia32_st_regs[op1_idx];
1053 if (reg_index_2 != REG_VFP_NOREG) {
1054 attr->x87[1] = op2_reg = &ia32_st_regs[op2_idx];
1056 attr->x87[2] = out = &ia32_st_regs[out_idx];
1058 if (reg_index_2 != REG_VFP_NOREG) {
1059 DB((dbg, LEVEL_1, "<<< %s %s, %s -> %s\n", get_irn_opname(n),
1060 arch_register_get_name(op1_reg), arch_register_get_name(op2_reg),
1061 arch_register_get_name(out)));
1063 DB((dbg, LEVEL_1, "<<< %s %s, [AM] -> %s\n", get_irn_opname(n),
1064 arch_register_get_name(op1_reg),
1065 arch_register_get_name(out)));
1068 return NO_NODE_ADDED;
1072 * Simulate a virtual Unop.
1074 * @param state the x87 state
1075 * @param n the node that should be simulated (and patched)
1076 * @param op the x87 opcode that will replace n's opcode
1078 * @return NO_NODE_ADDED
1080 static int sim_unop(x87_state *state, ir_node *n, ir_op *op) {
1081 int op1_idx, out_idx;
1082 x87_simulator *sim = state->sim;
1083 const arch_register_t *op1 = x87_get_irn_register(sim, get_irn_n(n, UNOP_IDX));
1084 const arch_register_t *out = x87_get_irn_register(sim, n);
1085 ia32_x87_attr_t *attr;
1086 unsigned live = vfp_live_args_after(sim, n, REGMASK(out));
1088 DB((dbg, LEVEL_1, ">>> %+F -> %s\n", n, out->name));
1089 DEBUG_ONLY(vfp_dump_live(live));
1091 op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1093 if (is_vfp_live(arch_register_get_index(op1), live)) {
1094 /* push the operand here */
1095 x87_create_fpush(state, n, op1_idx, UNOP_IDX);
1099 /* operand is dead, bring it to tos */
1101 x87_create_fxch(state, n, op1_idx);
1106 x87_set_tos(state, arch_register_get_index(out), x87_patch_insn(n, op));
1108 attr = get_ia32_x87_attr(n);
1109 attr->x87[0] = op1 = &ia32_st_regs[0];
1110 attr->x87[2] = out = &ia32_st_regs[0];
1111 DB((dbg, LEVEL_1, "<<< %s -> %s\n", get_irn_opname(n), out->name));
1113 return NO_NODE_ADDED;
1117 * Simulate a virtual Load instruction.
1119 * @param state the x87 state
1120 * @param n the node that should be simulated (and patched)
1121 * @param op the x87 opcode that will replace n's opcode
1123 * @return NO_NODE_ADDED
1125 static int sim_load(x87_state *state, ir_node *n, ir_op *op) {
1126 const arch_register_t *out = x87_get_irn_register(state->sim, n);
1127 ia32_x87_attr_t *attr;
1129 DB((dbg, LEVEL_1, ">>> %+F -> %s\n", n, arch_register_get_name(out)));
1130 x87_push(state, arch_register_get_index(out), x87_patch_insn(n, op));
1131 assert(out == x87_get_irn_register(state->sim, n));
1132 attr = get_ia32_x87_attr(n);
1133 attr->x87[2] = out = &ia32_st_regs[0];
1134 DB((dbg, LEVEL_1, "<<< %s -> %s\n", get_irn_opname(n), arch_register_get_name(out)));
1136 return NO_NODE_ADDED;
1140 * Rewire all users of @p old_val to @new_val iff they are scheduled after @p store.
1142 * @param store The store
1143 * @param old_val The former value
1144 * @param new_val The new value
1146 static void collect_and_rewire_users(ir_node *store, ir_node *old_val, ir_node *new_val) {
1147 const ir_edge_t *edge, *ne;
1149 foreach_out_edge_safe(old_val, edge, ne) {
1150 ir_node *user = get_edge_src_irn(edge);
1152 if (! user || user == store)
1155 /* if the user is scheduled after the store: rewire */
1156 if (sched_is_scheduled(user) && sched_comes_after(store, user)) {
1158 /* find the input of the user pointing to the old value */
1159 for (i = get_irn_arity(user) - 1; i >= 0; i--) {
1160 if (get_irn_n(user, i) == old_val)
1161 set_irn_n(user, i, new_val);
1165 } /* collect_and_rewire_users */
1168 * Simulate a virtual Store.
1170 * @param state the x87 state
1171 * @param n the node that should be simulated (and patched)
1172 * @param op the x87 store opcode
1173 * @param op_p the x87 store and pop opcode
1175 static int sim_store(x87_state *state, ir_node *n, ir_op *op, ir_op *op_p) {
1176 x87_simulator *sim = state->sim;
1177 ir_node *val = get_irn_n(n, n_ia32_vfst_val);
1178 const arch_register_t *op2 = x87_get_irn_register(sim, val);
1179 unsigned live = vfp_live_args_after(sim, n, 0);
1180 int insn = NO_NODE_ADDED;
1181 ia32_x87_attr_t *attr;
1182 int op2_reg_idx, op2_idx, depth;
1183 int live_after_node;
1186 op2_reg_idx = arch_register_get_index(op2);
1187 if (op2_reg_idx == REG_VFP_UKNWN) {
1188 /* just take any value from stack */
1189 if(state->depth > 0) {
1191 DEBUG_ONLY(op2 = NULL);
1192 live_after_node = 1;
1194 /* produce a new value which we will consume immediately */
1195 x87_create_fldz(state, n, op2_reg_idx);
1196 live_after_node = 0;
1197 op2_idx = x87_on_stack(state, op2_reg_idx);
1198 assert(op2_idx >= 0);
1201 op2_idx = x87_on_stack(state, op2_reg_idx);
1202 live_after_node = is_vfp_live(arch_register_get_index(op2), live);
1203 DB((dbg, LEVEL_1, ">>> %+F %s ->\n", n, arch_register_get_name(op2)));
1204 assert(op2_idx >= 0);
1207 mode = get_ia32_ls_mode(n);
1208 depth = x87_get_depth(state);
1210 if (live_after_node) {
1212 Problem: fst doesn't support mode_E (spills), only fstp does
1214 - stack not full: push value and fstp
1215 - stack full: fstp value and load again
1217 if (mode == mode_E || mode == mode_Ls) {
1218 if (depth < N_x87_REGS) {
1219 /* ok, we have a free register: push + fstp */
1220 x87_create_fpush(state, n, op2_idx, n_ia32_vfst_val);
1222 x87_patch_insn(n, op_p);
1224 ir_node *vfld, *mem, *block, *rproj, *mproj;
1227 /* stack full here: need fstp + load */
1229 x87_patch_insn(n, op_p);
1231 block = get_nodes_block(n);
1232 irg = get_irn_irg(n);
1233 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));
1235 /* copy all attributes */
1236 set_ia32_frame_ent(vfld, get_ia32_frame_ent(n));
1237 if (is_ia32_use_frame(n))
1238 set_ia32_use_frame(vfld);
1239 set_ia32_op_type(vfld, ia32_am_Source);
1240 add_ia32_am_offs_int(vfld, get_ia32_am_offs_int(n));
1241 set_ia32_am_sc(vfld, get_ia32_am_sc(n));
1242 set_ia32_ls_mode(vfld, get_ia32_ls_mode(n));
1244 rproj = new_r_Proj(irg, block, vfld, get_ia32_ls_mode(vfld), pn_ia32_vfld_res);
1245 mproj = new_r_Proj(irg, block, vfld, mode_M, pn_ia32_vfld_M);
1246 mem = get_irn_Proj_for_mode(n, mode_M);
1248 assert(mem && "Store memory not found");
1250 arch_set_irn_register(sim->arch_env, rproj, op2);
1252 /* reroute all former users of the store memory to the load memory */
1253 edges_reroute(mem, mproj, irg);
1254 /* set the memory input of the load to the store memory */
1255 set_irn_n(vfld, n_ia32_vfld_mem, mem);
1257 sched_add_after(n, vfld);
1258 sched_add_after(vfld, rproj);
1260 /* rewire all users, scheduled after the store, to the loaded value */
1261 collect_and_rewire_users(n, val, rproj);
1266 /* we can only store the tos to memory */
1268 x87_create_fxch(state, n, op2_idx);
1270 /* mode != mode_E -> use normal fst */
1271 x87_patch_insn(n, op);
1274 /* we can only store the tos to memory */
1276 x87_create_fxch(state, n, op2_idx);
1279 x87_patch_insn(n, op_p);
1282 attr = get_ia32_x87_attr(n);
1283 attr->x87[1] = op2 = &ia32_st_regs[0];
1284 DB((dbg, LEVEL_1, "<<< %s %s ->\n", get_irn_opname(n), arch_register_get_name(op2)));
1289 #define _GEN_BINOP(op, rev) \
1290 static int sim_##op(x87_state *state, ir_node *n) { \
1291 exchange_tmpl tmpl = { op_ia32_##op, op_ia32_##rev, op_ia32_##op##p, op_ia32_##rev##p }; \
1292 return sim_binop(state, n, &tmpl); \
1295 #define GEN_BINOP(op) _GEN_BINOP(op, op)
1296 #define GEN_BINOPR(op) _GEN_BINOP(op, op##r)
1298 #define GEN_LOAD2(op, nop) \
1299 static int sim_##op(x87_state *state, ir_node *n) { \
1300 return sim_load(state, n, op_ia32_##nop); \
1303 #define GEN_LOAD(op) GEN_LOAD2(op, op)
1305 #define GEN_UNOP(op) \
1306 static int sim_##op(x87_state *state, ir_node *n) { \
1307 return sim_unop(state, n, op_ia32_##op); \
1310 #define GEN_STORE(op) \
1311 static int sim_##op(x87_state *state, ir_node *n) { \
1312 return sim_store(state, n, op_ia32_##op, op_ia32_##op##p); \
1333 static int sim_FtstFnstsw(x87_state *state, ir_node *n) {
1334 x87_simulator *sim = state->sim;
1335 ia32_x87_attr_t *attr = get_ia32_x87_attr(n);
1336 ir_node *op1_node = get_irn_n(n, n_ia32_vFtstFnstsw_left);
1337 const arch_register_t *reg1 = x87_get_irn_register(sim, op1_node);
1338 int reg_index_1 = arch_register_get_index(reg1);
1339 int op1_idx = x87_on_stack(state, reg_index_1);
1340 unsigned live = vfp_live_args_after(sim, n, 0);
1342 DB((dbg, LEVEL_1, ">>> %+F %s\n", n, arch_register_get_name(reg1)));
1343 DEBUG_ONLY(vfp_dump_live(live));
1344 DB((dbg, LEVEL_1, "Stack before: "));
1345 DEBUG_ONLY(x87_dump_stack(state));
1346 assert(op1_idx >= 0);
1349 /* bring the value to tos */
1350 x87_create_fxch(state, n, op1_idx);
1354 /* patch the operation */
1355 x87_patch_insn(n, op_ia32_FtstFnstsw);
1356 reg1 = &ia32_st_regs[op1_idx];
1357 attr->x87[0] = reg1;
1358 attr->x87[1] = NULL;
1359 attr->x87[2] = NULL;
1361 if(!is_vfp_live(reg_index_1, live)) {
1362 x87_create_fpop(state, sched_next(n), 1);
1366 return NO_NODE_ADDED;
1370 * @param state the x87 state
1371 * @param n the node that should be simulated (and patched)
1373 static int sim_Fucom(x87_state *state, ir_node *n) {
1376 ia32_x87_attr_t *attr = get_ia32_x87_attr(n);
1378 x87_simulator *sim = state->sim;
1379 ir_node *op1_node = get_irn_n(n, n_ia32_vFucomFnstsw_left);
1380 ir_node *op2_node = get_irn_n(n, n_ia32_vFucomFnstsw_right);
1381 const arch_register_t *op1 = x87_get_irn_register(sim, op1_node);
1382 const arch_register_t *op2 = x87_get_irn_register(sim, op2_node);
1383 int reg_index_1 = arch_register_get_index(op1);
1384 int reg_index_2 = arch_register_get_index(op2);
1385 unsigned live = vfp_live_args_after(sim, n, 0);
1386 int permuted = attr->attr.data.ins_permuted;
1389 int node_added = NO_NODE_ADDED;
1391 DB((dbg, LEVEL_1, ">>> %+F %s, %s\n", n,
1392 arch_register_get_name(op1), arch_register_get_name(op2)));
1393 DEBUG_ONLY(vfp_dump_live(live));
1394 DB((dbg, LEVEL_1, "Stack before: "));
1395 DEBUG_ONLY(x87_dump_stack(state));
1397 op1_idx = x87_on_stack(state, reg_index_1);
1398 assert(op1_idx >= 0);
1400 /* BEWARE: check for comp a,a cases, they might happen */
1401 if (reg_index_2 != REG_VFP_NOREG) {
1402 /* second operand is a vfp register */
1403 op2_idx = x87_on_stack(state, reg_index_2);
1404 assert(op2_idx >= 0);
1406 if (is_vfp_live(reg_index_2, live)) {
1407 /* second operand is live */
1409 if (is_vfp_live(reg_index_1, live)) {
1410 /* both operands are live */
1413 /* res = tos X op */
1414 } else if (op2_idx == 0) {
1415 /* res = op X tos */
1416 permuted = !permuted;
1419 /* bring the first one to tos */
1420 x87_create_fxch(state, n, op1_idx);
1424 /* res = tos X op */
1427 /* second live, first operand is dead here, bring it to tos.
1428 This means further, op1_idx != op2_idx. */
1429 assert(op1_idx != op2_idx);
1431 x87_create_fxch(state, n, op1_idx);
1436 /* res = tos X op, pop */
1440 /* second operand is dead */
1441 if (is_vfp_live(reg_index_1, live)) {
1442 /* first operand is live: bring second to tos.
1443 This means further, op1_idx != op2_idx. */
1444 assert(op1_idx != op2_idx);
1446 x87_create_fxch(state, n, op2_idx);
1451 /* res = op X tos, pop */
1453 permuted = !permuted;
1456 /* both operands are dead here, check first for identity. */
1457 if (op1_idx == op2_idx) {
1458 /* identically, one pop needed */
1460 x87_create_fxch(state, n, op1_idx);
1464 /* res = tos X op, pop */
1467 /* different, move them to st and st(1) and pop both.
1468 The tricky part is to get one into st(1).*/
1469 else if (op2_idx == 1) {
1470 /* good, second operand is already in the right place, move the first */
1472 /* bring the first on top */
1473 x87_create_fxch(state, n, op1_idx);
1474 assert(op2_idx != 0);
1477 /* res = tos X op, pop, pop */
1479 } else if (op1_idx == 1) {
1480 /* good, first operand is already in the right place, move the second */
1482 /* bring the first on top */
1483 x87_create_fxch(state, n, op2_idx);
1484 assert(op1_idx != 0);
1487 /* res = op X tos, pop, pop */
1488 permuted = !permuted;
1492 /* if one is already the TOS, we need two fxch */
1494 /* first one is TOS, move to st(1) */
1495 x87_create_fxch(state, n, 1);
1496 assert(op2_idx != 1);
1498 x87_create_fxch(state, n, op2_idx);
1500 /* res = op X tos, pop, pop */
1502 permuted = !permuted;
1504 } else if (op2_idx == 0) {
1505 /* second one is TOS, move to st(1) */
1506 x87_create_fxch(state, n, 1);
1507 assert(op1_idx != 1);
1509 x87_create_fxch(state, n, op1_idx);
1511 /* res = tos X op, pop, pop */
1514 /* none of them is either TOS or st(1), 3 fxch needed */
1515 x87_create_fxch(state, n, op2_idx);
1516 assert(op1_idx != 0);
1517 x87_create_fxch(state, n, 1);
1519 x87_create_fxch(state, n, op1_idx);
1521 /* res = tos X op, pop, pop */
1528 /* second operand is an address mode */
1529 if (is_vfp_live(reg_index_1, live)) {
1530 /* first operand is live: bring it to TOS */
1532 x87_create_fxch(state, n, op1_idx);
1536 /* first operand is dead: bring it to tos */
1538 x87_create_fxch(state, n, op1_idx);
1545 /* patch the operation */
1546 if(is_ia32_vFucomFnstsw(n)) {
1550 case 0: dst = op_ia32_FucomFnstsw; break;
1551 case 1: dst = op_ia32_FucompFnstsw; break;
1552 case 2: dst = op_ia32_FucomppFnstsw; break;
1553 default: panic("invalid popcount in sim_Fucom");
1556 for(i = 0; i < pops; ++i) {
1559 } else if(is_ia32_vFucomi(n)) {
1561 case 0: dst = op_ia32_Fucomi; break;
1562 case 1: dst = op_ia32_Fucompi; x87_pop(state); break;
1564 dst = op_ia32_Fucompi;
1566 x87_create_fpop(state, sched_next(n), 1);
1567 node_added = NODE_ADDED;
1569 default: panic("invalid popcount in sim_Fucom");
1572 panic("invalid operation %+F in sim_FucomFnstsw", n);
1575 x87_patch_insn(n, dst);
1582 op1 = &ia32_st_regs[op1_idx];
1585 op2 = &ia32_st_regs[op2_idx];
1588 attr->x87[2] = NULL;
1589 attr->attr.data.ins_permuted = permuted;
1592 DB((dbg, LEVEL_1, "<<< %s %s, %s\n", get_irn_opname(n),
1593 arch_register_get_name(op1), arch_register_get_name(op2)));
1595 DB((dbg, LEVEL_1, "<<< %s %s, [AM]\n", get_irn_opname(n),
1596 arch_register_get_name(op1)));
1602 static int sim_Keep(x87_state *state, ir_node *node)
1605 const arch_register_t *op_reg;
1610 int node_added = NO_NODE_ADDED;
1612 DB((dbg, LEVEL_1, ">>> %+F\n", node));
1614 arity = get_irn_arity(node);
1615 for(i = 0; i < arity; ++i) {
1616 op = get_irn_n(node, i);
1617 op_reg = arch_get_irn_register(state->sim->arch_env, op);
1618 if(arch_register_get_class(op_reg) != &ia32_reg_classes[CLASS_ia32_vfp])
1621 reg_id = arch_register_get_index(op_reg);
1622 live = vfp_live_args_after(state->sim, node, 0);
1624 op_stack_idx = x87_on_stack(state, reg_id);
1625 if(op_stack_idx >= 0 && !is_vfp_live(reg_id, live)) {
1626 x87_create_fpop(state, sched_next(node), 1);
1627 node_added = NODE_ADDED;
1631 DB((dbg, LEVEL_1, "Stack after: "));
1632 DEBUG_ONLY(x87_dump_stack(state));
1638 void keep_float_node_alive(x87_state *state, ir_node *node)
1644 const arch_register_class_t *cls;
1646 irg = get_irn_irg(node);
1647 block = get_nodes_block(node);
1648 cls = arch_get_irn_reg_class(state->sim->arch_env, node, -1);
1650 keep = be_new_Keep(cls, irg, block, 1, in);
1652 assert(sched_is_scheduled(node));
1653 sched_add_after(node, keep);
1657 * Create a copy of a node. Recreate the node if it's a constant.
1659 * @param state the x87 state
1660 * @param n the node to be copied
1662 * @return the copy of n
1664 static ir_node *create_Copy(x87_state *state, ir_node *n) {
1665 x87_simulator *sim = state->sim;
1666 ir_graph *irg = get_irn_irg(n);
1667 dbg_info *n_dbg = get_irn_dbg_info(n);
1668 ir_mode *mode = get_irn_mode(n);
1669 ir_node *block = get_nodes_block(n);
1670 ir_node *pred = get_irn_n(n, 0);
1671 ir_node *(*cnstr)(dbg_info *, ir_graph *, ir_node *, ir_mode *) = NULL;
1673 const arch_register_t *out;
1674 const arch_register_t *op1;
1675 ia32_x87_attr_t *attr;
1677 /* Do not copy constants, recreate them. */
1678 switch (get_ia32_irn_opcode(pred)) {
1679 case iro_ia32_Unknown_VFP:
1681 cnstr = new_rd_ia32_fldz;
1684 cnstr = new_rd_ia32_fld1;
1686 case iro_ia32_fldpi:
1687 cnstr = new_rd_ia32_fldpi;
1689 case iro_ia32_fldl2e:
1690 cnstr = new_rd_ia32_fldl2e;
1692 case iro_ia32_fldl2t:
1693 cnstr = new_rd_ia32_fldl2t;
1695 case iro_ia32_fldlg2:
1696 cnstr = new_rd_ia32_fldlg2;
1698 case iro_ia32_fldln2:
1699 cnstr = new_rd_ia32_fldln2;
1705 out = x87_get_irn_register(sim, n);
1706 op1 = x87_get_irn_register(sim, pred);
1708 if (cnstr != NULL) {
1709 /* copy a constant */
1710 res = (*cnstr)(n_dbg, irg, block, mode);
1712 x87_push(state, arch_register_get_index(out), res);
1714 attr = get_ia32_x87_attr(res);
1715 attr->x87[2] = &ia32_st_regs[0];
1717 int op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1719 res = new_rd_ia32_fpushCopy(n_dbg, irg, block, pred, mode);
1721 x87_push(state, arch_register_get_index(out), res);
1723 attr = get_ia32_x87_attr(res);
1724 attr->x87[0] = &ia32_st_regs[op1_idx];
1725 attr->x87[2] = &ia32_st_regs[0];
1727 arch_set_irn_register(sim->arch_env, res, out);
1733 * Simulate a be_Copy.
1735 * @param state the x87 state
1736 * @param n the node that should be simulated (and patched)
1738 * @return NO_NODE_ADDED
1740 static int sim_Copy(x87_state *state, ir_node *n) {
1741 x87_simulator *sim = state->sim;
1743 const arch_register_t *out;
1744 const arch_register_t *op1;
1745 const arch_register_class_t *class;
1746 ir_node *node, *next;
1747 ia32_x87_attr_t *attr;
1748 int op1_idx, out_idx;
1751 class = arch_get_irn_reg_class(sim->arch_env, n, -1);
1752 if (class->regs != ia32_vfp_regs)
1755 pred = get_irn_n(n, 0);
1756 out = x87_get_irn_register(sim, n);
1757 op1 = x87_get_irn_register(sim, pred);
1758 live = vfp_live_args_after(sim, n, REGMASK(out));
1760 DB((dbg, LEVEL_1, ">>> %+F %s -> %s\n", n,
1761 arch_register_get_name(op1), arch_register_get_name(out)));
1762 DEBUG_ONLY(vfp_dump_live(live));
1764 /* handle the infamous unknown value */
1765 if (arch_register_get_index(op1) == REG_VFP_UKNWN) {
1766 /* Operand is still live, a real copy. We need here an fpush that can
1767 hold a a register, so use the fpushCopy or recreate constants */
1768 node = create_Copy(state, n);
1770 assert(is_ia32_fldz(node));
1771 next = sched_next(n);
1774 sched_add_before(next, node);
1776 DB((dbg, LEVEL_1, "<<< %+F %s -> %s\n", node, op1->name,
1777 arch_get_irn_register(sim->arch_env, node)->name));
1778 return NO_NODE_ADDED;
1781 op1_idx = x87_on_stack(state, arch_register_get_index(op1));
1783 if (is_vfp_live(arch_register_get_index(op1), live)) {
1784 ir_node *pred = get_irn_n(n, 0);
1786 /* Operand is still live, a real copy. We need here an fpush that can
1787 hold a a register, so use the fpushCopy or recreate constants */
1788 node = create_Copy(state, n);
1790 /* We have to make sure the old value doesn't go dead (which can happen
1791 * when we recreate constants). As the simulator expected that value in
1792 * the pred blocks. This is unfortunate as removing it would save us 1
1793 * instruction, but we would have to rerun all the simulation to get
1796 next = sched_next(n);
1799 sched_add_before(next, node);
1801 if(get_irn_n_edges(pred) == 0) {
1802 keep_float_node_alive(state, pred);
1805 DB((dbg, LEVEL_1, "<<< %+F %s -> ?\n", node, op1->name));
1807 out_idx = x87_on_stack(state, arch_register_get_index(out));
1809 if (out_idx >= 0 && out_idx != op1_idx) {
1810 /* Matze: out already on stack? how can this happen? */
1813 /* op1 must be killed and placed where out is */
1815 /* best case, simple remove and rename */
1816 x87_patch_insn(n, op_ia32_Pop);
1817 attr = get_ia32_x87_attr(n);
1818 attr->x87[0] = op1 = &ia32_st_regs[0];
1821 x87_set_st(state, arch_register_get_index(out), n, op1_idx - 1);
1823 /* move op1 to tos, store and pop it */
1825 x87_create_fxch(state, n, op1_idx);
1828 x87_patch_insn(n, op_ia32_Pop);
1829 attr = get_ia32_x87_attr(n);
1830 attr->x87[0] = op1 = &ia32_st_regs[out_idx];
1833 x87_set_st(state, arch_register_get_index(out), n, out_idx - 1);
1835 DB((dbg, LEVEL_1, "<<< %+F %s\n", n, op1->name));
1837 /* just a virtual copy */
1838 x87_set_st(state, arch_register_get_index(out), get_unop_op(n), op1_idx);
1839 /* don't remove the node to keep the verifier quiet :),
1840 the emitter won't emit any code for the node */
1843 DB((dbg, LEVEL_1, "<<< KILLED %s\n", get_irn_opname(n)));
1844 exchange(n, get_unop_op(n));
1848 return NO_NODE_ADDED;
1852 * Returns the result proj of the call
1854 static ir_node *get_call_result_proj(ir_node *call) {
1855 const ir_edge_t *edge;
1857 /* search the result proj */
1858 foreach_out_edge(call, edge) {
1859 ir_node *proj = get_edge_src_irn(edge);
1860 long pn = get_Proj_proj(proj);
1862 if (pn == pn_be_Call_first_res) {
1868 } /* get_call_result_proj */
1871 * Simulate a be_Call.
1873 * @param state the x87 state
1874 * @param n the node that should be simulated
1876 * @return NO_NODE_ADDED
1878 static int sim_Call(x87_state *state, ir_node *n)
1880 ir_type *call_tp = be_Call_get_type(n);
1884 const arch_register_t *reg;
1886 DB((dbg, LEVEL_1, ">>> %+F\n", n));
1888 /* at the begin of a call the x87 state should be empty */
1889 assert(state->depth == 0 && "stack not empty before call");
1891 if (get_method_n_ress(call_tp) <= 0)
1895 * If the called function returns a float, it is returned in st(0).
1896 * This even happens if the return value is NOT used.
1897 * Moreover, only one return result is supported.
1899 res_type = get_method_res_type(call_tp, 0);
1900 mode = get_type_mode(res_type);
1902 if (mode == NULL || !mode_is_float(mode))
1905 resproj = get_call_result_proj(n);
1906 assert(resproj != NULL);
1908 reg = x87_get_irn_register(state->sim, resproj);
1909 x87_push(state, arch_register_get_index(reg), resproj);
1912 DB((dbg, LEVEL_1, "Stack after: "));
1913 DEBUG_ONLY(x87_dump_stack(state));
1915 return NO_NODE_ADDED;
1919 * Simulate a be_Spill.
1921 * @param state the x87 state
1922 * @param n the node that should be simulated (and patched)
1924 * Should not happen, spills are lowered before x87 simulator see them.
1926 static int sim_Spill(x87_state *state, ir_node *n) {
1927 assert(0 && "Spill not lowered");
1928 return sim_fst(state, n);
1932 * Simulate a be_Reload.
1934 * @param state the x87 state
1935 * @param n the node that should be simulated (and patched)
1937 * Should not happen, reloads are lowered before x87 simulator see them.
1939 static int sim_Reload(x87_state *state, ir_node *n) {
1940 assert(0 && "Reload not lowered");
1941 return sim_fld(state, n);
1945 * Simulate a be_Return.
1947 * @param state the x87 state
1948 * @param n the node that should be simulated (and patched)
1950 * @return NO_NODE_ADDED
1952 static int sim_Return(x87_state *state, ir_node *n) {
1953 int n_res = be_Return_get_n_rets(n);
1954 int i, n_float_res = 0;
1956 /* only floating point return values must resist on stack */
1957 for (i = 0; i < n_res; ++i) {
1958 ir_node *res = get_irn_n(n, be_pos_Return_val + i);
1960 if (mode_is_float(get_irn_mode(res)))
1963 assert(x87_get_depth(state) == n_float_res);
1965 /* pop them virtually */
1966 for (i = n_float_res - 1; i >= 0; --i)
1969 return NO_NODE_ADDED;
1972 typedef struct _perm_data_t {
1973 const arch_register_t *in;
1974 const arch_register_t *out;
1978 * Simulate a be_Perm.
1980 * @param state the x87 state
1981 * @param irn the node that should be simulated (and patched)
1983 * @return NO_NODE_ADDED
1985 static int sim_Perm(x87_state *state, ir_node *irn) {
1987 x87_simulator *sim = state->sim;
1988 ir_node *pred = get_irn_n(irn, 0);
1990 const ir_edge_t *edge;
1992 /* handle only floating point Perms */
1993 if (! mode_is_float(get_irn_mode(pred)))
1994 return NO_NODE_ADDED;
1996 DB((dbg, LEVEL_1, ">>> %+F\n", irn));
1998 /* Perm is a pure virtual instruction on x87.
1999 All inputs must be on the FPU stack and are pairwise
2000 different from each other.
2001 So, all we need to do is to permutate the stack state. */
2002 n = get_irn_arity(irn);
2003 NEW_ARR_A(int, stack_pos, n);
2005 /* collect old stack positions */
2006 for (i = 0; i < n; ++i) {
2007 const arch_register_t *inreg = x87_get_irn_register(sim, get_irn_n(irn, i));
2008 int idx = x87_on_stack(state, arch_register_get_index(inreg));
2010 assert(idx >= 0 && "Perm argument not on x87 stack");
2014 /* now do the permutation */
2015 foreach_out_edge(irn, edge) {
2016 ir_node *proj = get_edge_src_irn(edge);
2017 const arch_register_t *out = x87_get_irn_register(sim, proj);
2018 long num = get_Proj_proj(proj);
2020 assert(0 <= num && num < n && "More Proj's than Perm inputs");
2021 x87_set_st(state, arch_register_get_index(out), proj, stack_pos[(unsigned)num]);
2023 DB((dbg, LEVEL_1, "<<< %+F\n", irn));
2025 return NO_NODE_ADDED;
2028 static int sim_Barrier(x87_state *state, ir_node *node) {
2029 //const arch_env_t *arch_env = state->sim->arch_env;
2032 /* materialize unknown if needed */
2033 arity = get_irn_arity(node);
2034 for(i = 0; i < arity; ++i) {
2035 const arch_register_t *reg;
2038 ia32_x87_attr_t *attr;
2039 ir_node *in = get_irn_n(node, i);
2041 if(!is_ia32_Unknown_VFP(in))
2044 /* TODO: not completely correct... */
2045 reg = &ia32_vfp_regs[REG_VFP_UKNWN];
2048 block = get_nodes_block(node);
2049 zero = new_rd_ia32_fldz(NULL, current_ir_graph, block, mode_E);
2050 x87_push(state, arch_register_get_index(reg), zero);
2052 attr = get_ia32_x87_attr(zero);
2053 attr->x87[2] = &ia32_st_regs[0];
2055 sched_add_before(node, zero);
2057 set_irn_n(node, i, zero);
2060 return NO_NODE_ADDED;
2065 * Kill any dead registers at block start by popping them from the stack.
2067 * @param sim the simulator handle
2068 * @param block the current block
2069 * @param start_state the x87 state at the begin of the block
2071 * @return the x87 state after dead register killed
2073 static x87_state *x87_kill_deads(x87_simulator *sim, ir_node *block, x87_state *start_state) {
2074 x87_state *state = start_state;
2075 ir_node *first_insn = sched_first(block);
2076 ir_node *keep = NULL;
2077 unsigned live = vfp_live_args_after(sim, block, 0);
2079 int i, depth, num_pop;
2082 depth = x87_get_depth(state);
2083 for (i = depth - 1; i >= 0; --i) {
2084 int reg = x87_get_st_reg(state, i);
2086 if (! is_vfp_live(reg, live))
2087 kill_mask |= (1 << i);
2091 /* create a new state, will be changed */
2092 state = x87_clone_state(sim, state);
2094 DB((dbg, LEVEL_1, "Killing deads:\n"));
2095 DEBUG_ONLY(vfp_dump_live(live));
2096 DEBUG_ONLY(x87_dump_stack(state));
2098 if (kill_mask != 0 && live == 0) {
2099 /* special case: kill all registers */
2100 if (ia32_cg_config.use_femms || ia32_cg_config.use_emms) {
2101 if (ia32_cg_config.use_femms) {
2102 /* use FEMMS on AMD processors to clear all */
2103 keep = new_rd_ia32_femms(NULL, get_irn_irg(block), block);
2105 /* use EMMS to clear all */
2106 keep = new_rd_ia32_emms(NULL, get_irn_irg(block), block);
2108 sched_add_before(first_insn, keep);
2114 /* now kill registers */
2116 /* we can only kill from TOS, so bring them up */
2117 if (! (kill_mask & 1)) {
2118 /* search from behind, because we can to a double-pop */
2119 for (i = depth - 1; i >= 0; --i) {
2120 if (kill_mask & (1 << i)) {
2121 kill_mask &= ~(1 << i);
2128 x87_set_st(state, -1, keep, i);
2129 x87_create_fxch(state, first_insn, i);
2132 if ((kill_mask & 3) == 3) {
2133 /* we can do a double-pop */
2137 /* only a single pop */
2142 kill_mask >>= num_pop;
2143 keep = x87_create_fpop(state, first_insn, num_pop);
2148 } /* x87_kill_deads */
2151 * If we have PhiEs with unknown operands then we have to make sure that some
2152 * value is actually put onto the stack.
2154 static void fix_unknown_phis(x87_state *state, ir_node *block,
2155 ir_node *pred_block, int pos)
2159 sched_foreach(block, node) {
2161 const arch_register_t *reg;
2162 ia32_x87_attr_t *attr;
2167 op = get_Phi_pred(node, pos);
2168 if(!is_ia32_Unknown_VFP(op))
2171 reg = arch_get_irn_register(state->sim->arch_env, node);
2173 /* create a zero at end of pred block */
2174 zero = new_rd_ia32_fldz(NULL, current_ir_graph, pred_block, mode_E);
2175 x87_push(state, arch_register_get_index(reg), zero);
2177 attr = get_ia32_x87_attr(zero);
2178 attr->x87[2] = &ia32_st_regs[0];
2180 assert(is_ia32_fldz(zero));
2181 sched_add_before(sched_last(pred_block), zero);
2183 set_Phi_pred(node, pos, zero);
2188 * Run a simulation and fix all virtual instructions for a block.
2190 * @param sim the simulator handle
2191 * @param block the current block
2193 static void x87_simulate_block(x87_simulator *sim, ir_node *block) {
2195 blk_state *bl_state = x87_get_bl_state(sim, block);
2196 x87_state *state = bl_state->begin;
2197 const ir_edge_t *edge;
2198 ir_node *start_block;
2200 assert(state != NULL);
2201 /* already processed? */
2202 if (bl_state->end != NULL)
2205 DB((dbg, LEVEL_1, "Simulate %+F\n", block));
2206 DB((dbg, LEVEL_2, "State at Block begin:\n "));
2207 DEBUG_ONLY(x87_dump_stack(state));
2209 /* at block begin, kill all dead registers */
2210 state = x87_kill_deads(sim, block, state);
2211 /* create a new state, will be changed */
2212 state = x87_clone_state(sim, state);
2214 /* beware, n might change */
2215 for (n = sched_first(block); !sched_is_end(n); n = next) {
2218 ir_op *op = get_irn_op(n);
2220 next = sched_next(n);
2221 if (op->ops.generic == NULL)
2224 func = (sim_func)op->ops.generic;
2227 node_inserted = (*func)(state, n);
2230 sim_func might have added an additional node after n,
2232 beware: n must not be changed by sim_func
2233 (i.e. removed from schedule) in this case
2235 if (node_inserted != NO_NODE_ADDED)
2236 next = sched_next(n);
2239 start_block = get_irg_start_block(get_irn_irg(block));
2241 DB((dbg, LEVEL_2, "State at Block end:\n ")); DEBUG_ONLY(x87_dump_stack(state));
2243 /* check if the state must be shuffled */
2244 foreach_block_succ(block, edge) {
2245 ir_node *succ = get_edge_src_irn(edge);
2246 blk_state *succ_state;
2248 if (succ == start_block)
2251 succ_state = x87_get_bl_state(sim, succ);
2253 fix_unknown_phis(state, succ, block, get_edge_src_pos(edge));
2255 if (succ_state->begin == NULL) {
2256 DB((dbg, LEVEL_2, "Set begin state for succ %+F:\n", succ));
2257 DEBUG_ONLY(x87_dump_stack(state));
2258 succ_state->begin = state;
2260 waitq_put(sim->worklist, succ);
2262 DB((dbg, LEVEL_2, "succ %+F already has a state, shuffling\n", succ));
2263 /* There is already a begin state for the successor, bad.
2264 Do the necessary permutations.
2265 Note that critical edges are removed, so this is always possible:
2266 If the successor has more than one possible input, then it must
2269 x87_shuffle(sim, block, state, succ, succ_state->begin);
2272 bl_state->end = state;
2273 } /* x87_simulate_block */
2275 static void register_sim(ir_op *op, sim_func func)
2277 assert(op->ops.generic == NULL);
2278 op->ops.generic = (op_func) func;
2282 * Create a new x87 simulator.
2284 * @param sim a simulator handle, will be initialized
2285 * @param irg the current graph
2286 * @param arch_env the architecture environment
2288 static void x87_init_simulator(x87_simulator *sim, ir_graph *irg,
2289 const arch_env_t *arch_env)
2291 obstack_init(&sim->obst);
2292 sim->blk_states = pmap_create();
2293 sim->arch_env = arch_env;
2294 sim->n_idx = get_irg_last_idx(irg);
2295 sim->live = obstack_alloc(&sim->obst, sizeof(*sim->live) * sim->n_idx);
2296 sim->isa = (ia32_isa_t *)arch_env->isa;
2298 DB((dbg, LEVEL_1, "--------------------------------\n"
2299 "x87 Simulator started for %+F\n", irg));
2301 /* set the generic function pointer of instruction we must simulate */
2302 clear_irp_opcodes_generic_func();
2304 register_sim(op_ia32_vfld, sim_fld);
2305 register_sim(op_ia32_vfild, sim_fild);
2306 register_sim(op_ia32_vfld1, sim_fld1);
2307 register_sim(op_ia32_vfldz, sim_fldz);
2308 register_sim(op_ia32_vfadd, sim_fadd);
2309 register_sim(op_ia32_vfsub, sim_fsub);
2310 register_sim(op_ia32_vfmul, sim_fmul);
2311 register_sim(op_ia32_vfdiv, sim_fdiv);
2312 register_sim(op_ia32_vfprem, sim_fprem);
2313 register_sim(op_ia32_vfabs, sim_fabs);
2314 register_sim(op_ia32_vfchs, sim_fchs);
2315 register_sim(op_ia32_vfist, sim_fist);
2316 register_sim(op_ia32_vfst, sim_fst);
2317 register_sim(op_ia32_vFtstFnstsw, sim_FtstFnstsw);
2318 register_sim(op_ia32_vFucomFnstsw, sim_Fucom);
2319 register_sim(op_ia32_vFucomi, sim_Fucom);
2320 register_sim(op_be_Copy, sim_Copy);
2321 register_sim(op_be_Call, sim_Call);
2322 register_sim(op_be_Spill, sim_Spill);
2323 register_sim(op_be_Reload, sim_Reload);
2324 register_sim(op_be_Return, sim_Return);
2325 register_sim(op_be_Perm, sim_Perm);
2326 register_sim(op_be_Keep, sim_Keep);
2327 register_sim(op_be_Barrier, sim_Barrier);
2328 } /* x87_init_simulator */
2331 * Destroy a x87 simulator.
2333 * @param sim the simulator handle
2335 static void x87_destroy_simulator(x87_simulator *sim) {
2336 pmap_destroy(sim->blk_states);
2337 obstack_free(&sim->obst, NULL);
2338 DB((dbg, LEVEL_1, "x87 Simulator stopped\n\n"));
2339 } /* x87_destroy_simulator */
2342 * Pre-block walker: calculate the liveness information for the block
2343 * and store it into the sim->live cache.
2345 static void update_liveness_walker(ir_node *block, void *data) {
2346 x87_simulator *sim = data;
2347 update_liveness(sim, block);
2348 } /* update_liveness_walker */
2351 * Run a simulation and fix all virtual instructions for a graph.
2353 * @param env the architecture environment
2354 * @param irg the current graph
2356 * Needs a block-schedule.
2358 void x87_simulate_graph(const arch_env_t *arch_env, be_irg_t *birg) {
2359 ir_node *block, *start_block;
2360 blk_state *bl_state;
2362 ir_graph *irg = be_get_birg_irg(birg);
2364 /* create the simulator */
2365 x87_init_simulator(&sim, irg, arch_env);
2367 start_block = get_irg_start_block(irg);
2368 bl_state = x87_get_bl_state(&sim, start_block);
2370 /* start with the empty state */
2371 bl_state->begin = empty;
2374 sim.worklist = new_waitq();
2375 waitq_put(sim.worklist, start_block);
2377 be_assure_liveness(birg);
2378 sim.lv = be_get_birg_liveness(birg);
2379 // sim.lv = be_liveness(be_get_birg_irg(birg));
2380 be_liveness_assure_sets(sim.lv);
2382 /* Calculate the liveness for all nodes. We must precalculate this info,
2383 * because the simulator adds new nodes (possible before Phi nodes) which
2384 * would let a lazy calculation fail.
2385 * On the other hand we reduce the computation amount due to
2386 * precaching from O(n^2) to O(n) at the expense of O(n) cache memory.
2388 irg_block_walk_graph(irg, update_liveness_walker, NULL, &sim);
2392 block = waitq_get(sim.worklist);
2393 x87_simulate_block(&sim, block);
2394 } while (! waitq_empty(sim.worklist));
2397 del_waitq(sim.worklist);
2398 x87_destroy_simulator(&sim);
2399 } /* x87_simulate_graph */
2401 void ia32_init_x87(void) {
2402 FIRM_DBG_REGISTER(dbg, "firm.be.ia32.x87");
2403 } /* ia32_init_x87 */