2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Implements several optimizations for IA32.
23 * @author Matthias Braun, Christian Wuerdig
32 #include "firm_types.h"
45 #include "../benode.h"
46 #include "../besched.h"
47 #include "../bepeephole.h"
49 #include "ia32_new_nodes.h"
50 #include "ia32_optimize.h"
51 #include "bearch_ia32_t.h"
52 #include "gen_ia32_regalloc_if.h"
53 #include "ia32_common_transform.h"
54 #include "ia32_transform.h"
55 #include "ia32_dbg_stat.h"
56 #include "ia32_util.h"
57 #include "ia32_architecture.h"
59 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
61 static void copy_mark(const ir_node *old, ir_node *newn)
63 if (is_ia32_is_reload(old))
64 set_ia32_is_reload(newn);
65 if (is_ia32_is_spill(old))
66 set_ia32_is_spill(newn);
67 if (is_ia32_is_remat(old))
68 set_ia32_is_remat(newn);
71 typedef enum produces_flag_t {
78 * Return which usable flag the given node produces
80 * @param node the node to check
81 * @param pn the projection number of the used result
83 static produces_flag_t produces_test_flag(ir_node *node, int pn)
86 const ia32_immediate_attr_t *imm_attr;
88 if (!is_ia32_irn(node))
89 return produces_no_flag;
91 switch (get_ia32_irn_opcode(node)) {
106 assert((int)n_ia32_ShlD_count == (int)n_ia32_ShrD_count);
107 count = get_irn_n(node, n_ia32_ShlD_count);
108 goto check_shift_amount;
113 assert((int)n_ia32_Shl_count == (int)n_ia32_Shr_count
114 && (int)n_ia32_Shl_count == (int)n_ia32_Sar_count);
115 count = get_irn_n(node, n_ia32_Shl_count);
117 /* when shift count is zero the flags are not affected, so we can only
118 * do this for constants != 0 */
119 if (!is_ia32_Immediate(count))
120 return produces_no_flag;
122 imm_attr = get_ia32_immediate_attr_const(count);
123 if (imm_attr->symconst != NULL)
124 return produces_no_flag;
125 if ((imm_attr->offset & 0x1f) == 0)
126 return produces_no_flag;
130 return pn == pn_ia32_Mul_res_high ?
131 produces_flag_carry : produces_no_flag;
134 return produces_no_flag;
137 return pn == pn_ia32_res ?
138 produces_flag_zero : produces_no_flag;
142 * Replace Cmp(x, 0) by a Test(x, x)
144 static void peephole_ia32_Cmp(ir_node *const node)
148 ia32_immediate_attr_t const *imm;
154 ia32_attr_t const *attr;
157 arch_register_t const *reg;
158 ir_edge_t const *edge;
159 ir_edge_t const *tmp;
161 if (get_ia32_op_type(node) != ia32_Normal)
164 right = get_irn_n(node, n_ia32_Cmp_right);
165 if (!is_ia32_Immediate(right))
168 imm = get_ia32_immediate_attr_const(right);
169 if (imm->symconst != NULL || imm->offset != 0)
172 dbgi = get_irn_dbg_info(node);
173 irg = get_irn_irg(node);
174 block = get_nodes_block(node);
175 noreg = ia32_new_NoReg_gp(irg);
176 nomem = get_irg_no_mem(current_ir_graph);
177 op = get_irn_n(node, n_ia32_Cmp_left);
178 attr = get_ia32_attr(node);
179 ins_permuted = attr->data.ins_permuted;
181 if (is_ia32_Cmp(node)) {
182 test = new_bd_ia32_Test(dbgi, block, noreg, noreg, nomem,
183 op, op, ins_permuted);
185 test = new_bd_ia32_Test8Bit(dbgi, block, noreg, noreg, nomem,
186 op, op, ins_permuted);
188 set_ia32_ls_mode(test, get_ia32_ls_mode(node));
190 reg = arch_irn_get_register(node, pn_ia32_Cmp_eflags);
191 arch_irn_set_register(test, pn_ia32_Test_eflags, reg);
193 foreach_out_edge_safe(node, edge, tmp) {
194 ir_node *const user = get_edge_src_irn(edge);
197 exchange(user, test);
200 sched_add_before(node, test);
201 copy_mark(node, test);
202 be_peephole_exchange(node, test);
206 * Peephole optimization for Test instructions.
207 * - Remove the Test, if an appropriate flag was produced which is still live
208 * - Change a Test(x, c) to 8Bit, if 0 <= c < 256 (3 byte shorter opcode)
210 static void peephole_ia32_Test(ir_node *node)
212 ir_node *left = get_irn_n(node, n_ia32_Test_left);
213 ir_node *right = get_irn_n(node, n_ia32_Test_right);
215 assert((int)n_ia32_Test_left == (int)n_ia32_Test8Bit_left
216 && (int)n_ia32_Test_right == (int)n_ia32_Test8Bit_right);
218 if (left == right) { /* we need a test for 0 */
219 ir_node *block = get_nodes_block(node);
220 int pn = pn_ia32_res;
224 const ir_edge_t *edge;
226 if (get_nodes_block(left) != block)
230 pn = get_Proj_proj(left);
231 left = get_Proj_pred(left);
234 /* walk schedule up and abort when we find left or some other node
235 * destroys the flags */
238 schedpoint = sched_prev(schedpoint);
239 if (schedpoint == left)
241 if (arch_irn_is(schedpoint, modify_flags))
243 if (schedpoint == block)
244 panic("couldn't find left");
247 /* make sure only Lg/Eq tests are used */
248 foreach_out_edge(node, edge) {
249 ir_node *user = get_edge_src_irn(edge);
250 ia32_condition_code_t cc = get_ia32_condcode(user);
252 if (cc != ia32_cc_equal && cc != ia32_cc_not_equal) {
257 switch (produces_test_flag(left, pn)) {
258 case produces_flag_zero:
261 case produces_flag_carry:
262 foreach_out_edge(node, edge) {
263 ir_node *user = get_edge_src_irn(edge);
264 ia32_condition_code_t cc = get_ia32_condcode(user);
267 case ia32_cc_equal: cc = ia32_cc_above_equal; break; /* CF = 0 */
268 case ia32_cc_not_equal: cc = ia32_cc_below; break; /* CF = 1 */
269 default: panic("unexpected pn");
271 set_ia32_condcode(user, cc);
279 if (get_irn_mode(left) != mode_T) {
280 set_irn_mode(left, mode_T);
282 /* If there are other users, reroute them to result proj */
283 if (get_irn_n_edges(left) != 2) {
284 ir_node *res = new_r_Proj(left, mode_Iu, pn_ia32_res);
286 edges_reroute(left, res, current_ir_graph);
287 /* Reattach the result proj to left */
288 set_Proj_pred(res, left);
292 flags_mode = ia32_reg_classes[CLASS_ia32_flags].mode;
293 flags_proj = new_r_Proj(left, flags_mode, pn_ia32_flags);
294 arch_set_irn_register(flags_proj, &ia32_registers[REG_EFLAGS]);
296 assert(get_irn_mode(node) != mode_T);
298 be_peephole_exchange(node, flags_proj);
299 } else if (is_ia32_Immediate(right)) {
300 ia32_immediate_attr_t const *const imm = get_ia32_immediate_attr_const(right);
303 /* A test with a symconst is rather strange, but better safe than sorry */
304 if (imm->symconst != NULL)
307 offset = imm->offset;
308 if (get_ia32_op_type(node) == ia32_AddrModeS) {
309 ia32_attr_t *const attr = get_ia32_attr(node);
311 if ((offset & 0xFFFFFF00) == 0) {
312 /* attr->am_offs += 0; */
313 } else if ((offset & 0xFFFF00FF) == 0) {
314 ir_node *imm = ia32_create_Immediate(NULL, 0, offset >> 8);
315 set_irn_n(node, n_ia32_Test_right, imm);
317 } else if ((offset & 0xFF00FFFF) == 0) {
318 ir_node *imm = ia32_create_Immediate(NULL, 0, offset >> 16);
319 set_irn_n(node, n_ia32_Test_right, imm);
321 } else if ((offset & 0x00FFFFFF) == 0) {
322 ir_node *imm = ia32_create_Immediate(NULL, 0, offset >> 24);
323 set_irn_n(node, n_ia32_Test_right, imm);
328 } else if (offset < 256) {
329 arch_register_t const* const reg = arch_get_irn_register(left);
331 if (reg != &ia32_registers[REG_EAX] &&
332 reg != &ia32_registers[REG_EBX] &&
333 reg != &ia32_registers[REG_ECX] &&
334 reg != &ia32_registers[REG_EDX]) {
341 /* Technically we should build a Test8Bit because of the register
342 * constraints, but nobody changes registers at this point anymore. */
343 set_ia32_ls_mode(node, mode_Bu);
348 * AMD Athlon works faster when RET is not destination of
349 * conditional jump or directly preceded by other jump instruction.
350 * Can be avoided by placing a Rep prefix before the return.
352 static void peephole_ia32_Return(ir_node *node)
354 ir_node *block, *irn;
356 if (!ia32_cg_config.use_pad_return)
359 block = get_nodes_block(node);
361 /* check if this return is the first on the block */
362 sched_foreach_reverse_from(node, irn) {
363 switch (get_irn_opcode(irn)) {
365 /* the return node itself, ignore */
369 /* ignore no code generated */
372 /* arg, IncSP 0 nodes might occur, ignore these */
373 if (be_get_IncSP_offset(irn) == 0)
383 /* ensure, that the 3 byte return is generated */
384 be_Return_set_emit_pop(node, 1);
387 /* only optimize up to 48 stores behind IncSPs */
388 #define MAXPUSH_OPTIMIZE 48
391 * Tries to create Push's from IncSP, Store combinations.
392 * The Stores are replaced by Push's, the IncSP is modified
393 * (possibly into IncSP 0, but not removed).
395 static void peephole_IncSP_Store_to_push(ir_node *irn)
401 ir_node *stores[MAXPUSH_OPTIMIZE];
406 ir_node *first_push = NULL;
407 ir_edge_t const *edge;
408 ir_edge_t const *next;
410 memset(stores, 0, sizeof(stores));
412 assert(be_is_IncSP(irn));
414 inc_ofs = be_get_IncSP_offset(irn);
419 * We first walk the schedule after the IncSP node as long as we find
420 * suitable Stores that could be transformed to a Push.
421 * We save them into the stores array which is sorted by the frame offset/4
422 * attached to the node
425 for (node = sched_next(irn); !sched_is_end(node); node = sched_next(node)) {
430 /* it has to be a Store */
431 if (!is_ia32_Store(node))
434 /* it has to use our sp value */
435 if (get_irn_n(node, n_ia32_base) != irn)
437 /* Store has to be attached to NoMem */
438 mem = get_irn_n(node, n_ia32_mem);
442 /* unfortunately we can't support the full AMs possible for push at the
443 * moment. TODO: fix this */
444 if (!is_ia32_NoReg_GP(get_irn_n(node, n_ia32_index)))
447 offset = get_ia32_am_offs_int(node);
448 /* we should NEVER access uninitialized stack BELOW the current SP */
451 /* storing at half-slots is bad */
452 if ((offset & 3) != 0)
455 if (inc_ofs - 4 < offset || offset >= MAXPUSH_OPTIMIZE * 4)
457 storeslot = offset >> 2;
459 /* storing into the same slot twice is bad (and shouldn't happen...) */
460 if (stores[storeslot] != NULL)
463 stores[storeslot] = node;
464 if (storeslot > maxslot)
470 for (i = -1; i < maxslot; ++i) {
471 if (stores[i + 1] == NULL)
475 /* walk through the Stores and create Pushs for them */
476 block = get_nodes_block(irn);
477 spmode = get_irn_mode(irn);
478 irg = get_irn_irg(irn);
479 for (; i >= 0; --i) {
480 const arch_register_t *spreg;
482 ir_node *val, *mem, *mem_proj;
483 ir_node *store = stores[i];
484 ir_node *noreg = ia32_new_NoReg_gp(irg);
486 val = get_irn_n(store, n_ia32_unary_op);
487 mem = get_irn_n(store, n_ia32_mem);
488 spreg = arch_get_irn_register(curr_sp);
490 push = new_bd_ia32_Push(get_irn_dbg_info(store), block, noreg, noreg, mem, val, curr_sp);
491 copy_mark(store, push);
493 if (first_push == NULL)
496 sched_add_after(skip_Proj(curr_sp), push);
498 /* create stackpointer Proj */
499 curr_sp = new_r_Proj(push, spmode, pn_ia32_Push_stack);
500 arch_set_irn_register(curr_sp, spreg);
502 /* create memory Proj */
503 mem_proj = new_r_Proj(push, mode_M, pn_ia32_Push_M);
505 /* use the memproj now */
506 be_peephole_exchange(store, mem_proj);
511 foreach_out_edge_safe(irn, edge, next) {
512 ir_node *const src = get_edge_src_irn(edge);
513 int const pos = get_edge_src_pos(edge);
515 if (src == first_push)
518 set_irn_n(src, pos, curr_sp);
521 be_set_IncSP_offset(irn, inc_ofs);
526 * Creates a Push instruction before the given schedule point.
528 * @param dbgi debug info
529 * @param block the block
530 * @param stack the previous stack value
531 * @param schedpoint the new node is added before this node
532 * @param reg the register to pop
534 * @return the new stack value
536 static ir_node *create_push(dbg_info *dbgi, ir_node *block,
537 ir_node *stack, ir_node *schedpoint)
539 const arch_register_t *esp = &ia32_registers[REG_ESP];
541 ir_node *val = ia32_new_NoReg_gp(cg);
542 ir_node *noreg = ia32_new_NoReg_gp(cg);
543 ir_graph *irg = get_irn_irg(block);
544 ir_node *nomem = new_r_NoMem(irg);
545 ir_node *push = new_bd_ia32_Push(dbgi, block, noreg, noreg, nomem, val, stack);
546 sched_add_before(schedpoint, push);
548 stack = new_r_Proj(push, mode_Iu, pn_ia32_Push_stack);
549 arch_set_irn_register(stack, esp);
554 static void peephole_store_incsp(ir_node *store)
565 ir_node *am_base = get_irn_n(store, n_ia32_Store_base);
566 if (!be_is_IncSP(am_base)
567 || get_nodes_block(am_base) != get_nodes_block(store))
569 mem = get_irn_n(store, n_ia32_Store_mem);
570 if (!is_ia32_NoReg_GP(get_irn_n(store, n_ia32_Store_index))
574 int incsp_offset = be_get_IncSP_offset(am_base);
575 if (incsp_offset <= 0)
578 /* we have to be at offset 0 */
579 int my_offset = get_ia32_am_offs_int(store);
580 if (my_offset != 0) {
581 /* TODO here: find out whether there is a store with offset 0 before
582 * us and whether we can move it down to our place */
585 ir_mode *ls_mode = get_ia32_ls_mode(store);
586 int my_store_size = get_mode_size_bytes(ls_mode);
588 if (my_offset + my_store_size > incsp_offset)
591 /* correctness checking:
592 - noone else must write to that stackslot
593 (because after translation incsp won't allocate it anymore)
595 sched_foreach_reverse_from(store, node) {
601 /* make sure noone else can use the space on the stack */
602 arity = get_irn_arity(node);
603 for (i = 0; i < arity; ++i) {
604 ir_node *pred = get_irn_n(node, i);
608 if (i == n_ia32_base &&
609 (get_ia32_op_type(node) == ia32_AddrModeS
610 || get_ia32_op_type(node) == ia32_AddrModeD)) {
611 int node_offset = get_ia32_am_offs_int(node);
612 ir_mode *node_ls_mode = get_ia32_ls_mode(node);
613 int node_size = get_mode_size_bytes(node_ls_mode);
614 /* overlapping with our position? abort */
615 if (node_offset < my_offset + my_store_size
616 && node_offset + node_size >= my_offset)
618 /* otherwise it's fine */
622 /* strange use of esp: abort */
627 /* all ok, change to push */
628 dbgi = get_irn_dbg_info(store);
629 block = get_nodes_block(store);
630 noreg = ia32_new_NoReg_gp(cg);
631 val = get_irn_n(store, n_ia32_Store_val);
633 push = new_bd_ia32_Push(dbgi, block, noreg, noreg, mem,
635 create_push(dbgi, current_ir_graph, block, am_base, store);
640 * Return true if a mode can be stored in the GP register set
642 static inline int mode_needs_gp_reg(ir_mode *mode)
644 if (mode == ia32_mode_fpcw)
646 if (get_mode_size_bits(mode) > 32)
648 return mode_is_int(mode) || mode_is_reference(mode) || mode == mode_b;
652 * Tries to create Pops from Load, IncSP combinations.
653 * The Loads are replaced by Pops, the IncSP is modified
654 * (possibly into IncSP 0, but not removed).
656 static void peephole_Load_IncSP_to_pop(ir_node *irn)
658 const arch_register_t *esp = &ia32_registers[REG_ESP];
659 int i, maxslot, inc_ofs, ofs;
660 ir_node *node, *pred_sp, *block;
661 ir_node *loads[MAXPUSH_OPTIMIZE];
663 unsigned regmask = 0;
664 unsigned copymask = ~0;
666 memset(loads, 0, sizeof(loads));
667 assert(be_is_IncSP(irn));
669 inc_ofs = -be_get_IncSP_offset(irn);
674 * We first walk the schedule before the IncSP node as long as we find
675 * suitable Loads that could be transformed to a Pop.
676 * We save them into the stores array which is sorted by the frame offset/4
677 * attached to the node
680 pred_sp = be_get_IncSP_pred(irn);
681 for (node = sched_prev(irn); !sched_is_end(node); node = sched_prev(node)) {
684 const arch_register_t *sreg, *dreg;
686 /* it has to be a Load */
687 if (!is_ia32_Load(node)) {
688 if (be_is_Copy(node)) {
689 if (!mode_needs_gp_reg(get_irn_mode(node))) {
690 /* not a GP copy, ignore */
693 dreg = arch_get_irn_register(node);
694 sreg = arch_get_irn_register(be_get_Copy_op(node));
695 if (regmask & copymask & (1 << sreg->index)) {
698 if (regmask & copymask & (1 << dreg->index)) {
701 /* we CAN skip Copies if neither the destination nor the source
702 * is not in our regmask, ie none of our future Pop will overwrite it */
703 regmask |= (1 << dreg->index) | (1 << sreg->index);
704 copymask &= ~((1 << dreg->index) | (1 << sreg->index));
710 /* we can handle only GP loads */
711 if (!mode_needs_gp_reg(get_ia32_ls_mode(node)))
714 /* it has to use our predecessor sp value */
715 if (get_irn_n(node, n_ia32_base) != pred_sp) {
716 /* it would be ok if this load does not use a Pop result,
717 * but we do not check this */
721 /* should have NO index */
722 if (!is_ia32_NoReg_GP(get_irn_n(node, n_ia32_index)))
725 offset = get_ia32_am_offs_int(node);
726 /* we should NEVER access uninitialized stack BELOW the current SP */
729 /* storing at half-slots is bad */
730 if ((offset & 3) != 0)
733 if (offset < 0 || offset >= MAXPUSH_OPTIMIZE * 4)
735 /* ignore those outside the possible windows */
736 if (offset > inc_ofs - 4)
738 loadslot = offset >> 2;
740 /* loading from the same slot twice is bad (and shouldn't happen...) */
741 if (loads[loadslot] != NULL)
744 dreg = arch_irn_get_register(node, pn_ia32_Load_res);
745 if (regmask & (1 << dreg->index)) {
746 /* this register is already used */
749 regmask |= 1 << dreg->index;
751 loads[loadslot] = node;
752 if (loadslot > maxslot)
759 /* find the first slot */
760 for (i = maxslot; i >= 0; --i) {
761 ir_node *load = loads[i];
767 ofs = inc_ofs - (maxslot + 1) * 4;
770 /* create a new IncSP if needed */
771 block = get_nodes_block(irn);
772 irg = get_irn_irg(irn);
774 pred_sp = be_new_IncSP(esp, block, pred_sp, -inc_ofs, be_get_IncSP_align(irn));
775 sched_add_before(irn, pred_sp);
778 /* walk through the Loads and create Pops for them */
779 for (++i; i <= maxslot; ++i) {
780 ir_node *load = loads[i];
782 const ir_edge_t *edge, *tmp;
783 const arch_register_t *reg;
785 mem = get_irn_n(load, n_ia32_mem);
786 reg = arch_irn_get_register(load, pn_ia32_Load_res);
788 pop = new_bd_ia32_Pop(get_irn_dbg_info(load), block, mem, pred_sp);
789 arch_irn_set_register(pop, pn_ia32_Load_res, reg);
791 copy_mark(load, pop);
793 /* create stackpointer Proj */
794 pred_sp = new_r_Proj(pop, mode_Iu, pn_ia32_Pop_stack);
795 arch_set_irn_register(pred_sp, esp);
797 sched_add_before(irn, pop);
800 foreach_out_edge_safe(load, edge, tmp) {
801 ir_node *proj = get_edge_src_irn(edge);
803 set_Proj_pred(proj, pop);
806 /* we can remove the Load now */
811 be_set_IncSP_offset(irn, -ofs);
812 be_set_IncSP_pred(irn, pred_sp);
817 * Find a free GP register if possible, else return NULL.
819 static const arch_register_t *get_free_gp_reg(ir_graph *irg)
821 be_irg_t *birg = be_birg_from_irg(irg);
824 for (i = 0; i < N_ia32_gp_REGS; ++i) {
825 const arch_register_t *reg = &ia32_reg_classes[CLASS_ia32_gp].regs[i];
826 if (!rbitset_is_set(birg->allocatable_regs, reg->global_index))
829 if (be_peephole_get_value(CLASS_ia32_gp, i) == NULL)
837 * Creates a Pop instruction before the given schedule point.
839 * @param dbgi debug info
840 * @param block the block
841 * @param stack the previous stack value
842 * @param schedpoint the new node is added before this node
843 * @param reg the register to pop
845 * @return the new stack value
847 static ir_node *create_pop(dbg_info *dbgi, ir_node *block,
848 ir_node *stack, ir_node *schedpoint,
849 const arch_register_t *reg)
851 const arch_register_t *esp = &ia32_registers[REG_ESP];
852 ir_graph *irg = get_irn_irg(block);
858 pop = new_bd_ia32_Pop(dbgi, block, new_r_NoMem(irg), stack);
860 stack = new_r_Proj(pop, mode_Iu, pn_ia32_Pop_stack);
861 arch_set_irn_register(stack, esp);
862 val = new_r_Proj(pop, mode_Iu, pn_ia32_Pop_res);
863 arch_set_irn_register(val, reg);
865 sched_add_before(schedpoint, pop);
868 keep = be_new_Keep(block, 1, in);
869 sched_add_before(schedpoint, keep);
875 * Optimize an IncSp by replacing it with Push/Pop.
877 static void peephole_be_IncSP(ir_node *node)
879 const arch_register_t *esp = &ia32_registers[REG_ESP];
880 const arch_register_t *reg;
886 /* first optimize incsp->incsp combinations */
887 node = be_peephole_IncSP_IncSP(node);
889 /* transform IncSP->Store combinations to Push where possible */
890 peephole_IncSP_Store_to_push(node);
892 /* transform Load->IncSP combinations to Pop where possible */
893 peephole_Load_IncSP_to_pop(node);
895 if (arch_get_irn_register(node) != esp)
898 /* replace IncSP -4 by Pop freereg when possible */
899 offset = be_get_IncSP_offset(node);
900 if ((offset != -8 || ia32_cg_config.use_add_esp_8) &&
901 (offset != -4 || ia32_cg_config.use_add_esp_4) &&
902 (offset != +4 || ia32_cg_config.use_sub_esp_4) &&
903 (offset != +8 || ia32_cg_config.use_sub_esp_8))
907 /* we need a free register for pop */
908 reg = get_free_gp_reg(get_irn_irg(node));
912 dbgi = get_irn_dbg_info(node);
913 block = get_nodes_block(node);
914 stack = be_get_IncSP_pred(node);
916 stack = create_pop(dbgi, block, stack, node, reg);
919 stack = create_pop(dbgi, block, stack, node, reg);
922 dbgi = get_irn_dbg_info(node);
923 block = get_nodes_block(node);
924 stack = be_get_IncSP_pred(node);
925 stack = new_bd_ia32_PushEax(dbgi, block, stack);
926 arch_set_irn_register(stack, esp);
927 sched_add_before(node, stack);
930 stack = new_bd_ia32_PushEax(dbgi, block, stack);
931 arch_set_irn_register(stack, esp);
932 sched_add_before(node, stack);
936 be_peephole_exchange(node, stack);
940 * Peephole optimisation for ia32_Const's
942 static void peephole_ia32_Const(ir_node *node)
944 const ia32_immediate_attr_t *attr = get_ia32_immediate_attr_const(node);
945 const arch_register_t *reg;
950 /* try to transform a mov 0, reg to xor reg reg */
951 if (attr->offset != 0 || attr->symconst != NULL)
953 if (ia32_cg_config.use_mov_0)
955 /* xor destroys the flags, so no-one must be using them */
956 if (be_peephole_get_value(CLASS_ia32_flags, REG_FLAGS_EFLAGS) != NULL)
959 reg = arch_get_irn_register(node);
960 assert(be_peephole_get_reg_value(reg) == NULL);
962 /* create xor(produceval, produceval) */
963 block = get_nodes_block(node);
964 dbgi = get_irn_dbg_info(node);
965 xorn = new_bd_ia32_Xor0(dbgi, block);
966 arch_set_irn_register(xorn, reg);
968 sched_add_before(node, xorn);
970 copy_mark(node, xorn);
971 be_peephole_exchange(node, xorn);
974 static inline int is_noreg(const ir_node *node)
976 return is_ia32_NoReg_GP(node);
979 ir_node *ia32_immediate_from_long(long val)
981 ir_graph *irg = current_ir_graph;
982 ir_node *start_block = get_irg_start_block(irg);
984 = new_bd_ia32_Immediate(NULL, start_block, NULL, 0, 0, val);
985 arch_set_irn_register(immediate, &ia32_registers[REG_GP_NOREG]);
990 static ir_node *create_immediate_from_am(const ir_node *node)
992 ir_node *block = get_nodes_block(node);
993 int offset = get_ia32_am_offs_int(node);
994 int sc_sign = is_ia32_am_sc_sign(node);
995 const ia32_attr_t *attr = get_ia32_attr_const(node);
996 int sc_no_pic_adjust = attr->data.am_sc_no_pic_adjust;
997 ir_entity *entity = get_ia32_am_sc(node);
1000 res = new_bd_ia32_Immediate(NULL, block, entity, sc_sign, sc_no_pic_adjust,
1002 arch_set_irn_register(res, &ia32_registers[REG_GP_NOREG]);
1006 static int is_am_one(const ir_node *node)
1008 int offset = get_ia32_am_offs_int(node);
1009 ir_entity *entity = get_ia32_am_sc(node);
1011 return offset == 1 && entity == NULL;
1014 static int is_am_minus_one(const ir_node *node)
1016 int offset = get_ia32_am_offs_int(node);
1017 ir_entity *entity = get_ia32_am_sc(node);
1019 return offset == -1 && entity == NULL;
1023 * Transforms a LEA into an Add or SHL if possible.
1025 static void peephole_ia32_Lea(ir_node *node)
1030 const arch_register_t *base_reg;
1031 const arch_register_t *index_reg;
1032 const arch_register_t *out_reg;
1043 assert(is_ia32_Lea(node));
1045 /* we can only do this if it is allowed to clobber the flags */
1046 if (be_peephole_get_value(CLASS_ia32_flags, REG_FLAGS_EFLAGS) != NULL)
1049 base = get_irn_n(node, n_ia32_Lea_base);
1050 index = get_irn_n(node, n_ia32_Lea_index);
1052 if (is_noreg(base)) {
1056 base_reg = arch_get_irn_register(base);
1058 if (is_noreg(index)) {
1062 index_reg = arch_get_irn_register(index);
1065 if (base == NULL && index == NULL) {
1066 /* we shouldn't construct these in the first place... */
1067 #ifdef DEBUG_libfirm
1068 ir_fprintf(stderr, "Optimisation warning: found immediate only lea\n");
1073 out_reg = arch_get_irn_register(node);
1074 scale = get_ia32_am_scale(node);
1075 assert(!is_ia32_need_stackent(node) || get_ia32_frame_ent(node) != NULL);
1076 /* check if we have immediates values (frame entities should already be
1077 * expressed in the offsets) */
1078 if (get_ia32_am_offs_int(node) != 0 || get_ia32_am_sc(node) != NULL) {
1084 /* we can transform leas where the out register is the same as either the
1085 * base or index register back to an Add or Shl */
1086 if (out_reg == base_reg) {
1087 if (index == NULL) {
1088 #ifdef DEBUG_libfirm
1089 if (!has_immediates) {
1090 ir_fprintf(stderr, "Optimisation warning: found lea which is "
1095 goto make_add_immediate;
1097 if (scale == 0 && !has_immediates) {
1102 /* can't create an add */
1104 } else if (out_reg == index_reg) {
1106 if (has_immediates && scale == 0) {
1108 goto make_add_immediate;
1109 } else if (!has_immediates && scale > 0) {
1111 op2 = ia32_immediate_from_long(scale);
1113 } else if (!has_immediates) {
1114 #ifdef DEBUG_libfirm
1115 ir_fprintf(stderr, "Optimisation warning: found lea which is "
1119 } else if (scale == 0 && !has_immediates) {
1124 /* can't create an add */
1127 /* can't create an add */
1132 if (ia32_cg_config.use_incdec) {
1133 if (is_am_one(node)) {
1134 dbgi = get_irn_dbg_info(node);
1135 block = get_nodes_block(node);
1136 res = new_bd_ia32_Inc(dbgi, block, op1);
1137 arch_set_irn_register(res, out_reg);
1140 if (is_am_minus_one(node)) {
1141 dbgi = get_irn_dbg_info(node);
1142 block = get_nodes_block(node);
1143 res = new_bd_ia32_Dec(dbgi, block, op1);
1144 arch_set_irn_register(res, out_reg);
1148 op2 = create_immediate_from_am(node);
1151 dbgi = get_irn_dbg_info(node);
1152 block = get_nodes_block(node);
1153 irg = get_irn_irg(node);
1154 noreg = ia32_new_NoReg_gp(irg);
1155 nomem = new_r_NoMem(irg);
1156 res = new_bd_ia32_Add(dbgi, block, noreg, noreg, nomem, op1, op2);
1157 arch_set_irn_register(res, out_reg);
1158 set_ia32_commutative(res);
1162 dbgi = get_irn_dbg_info(node);
1163 block = get_nodes_block(node);
1164 irg = get_irn_irg(node);
1165 noreg = ia32_new_NoReg_gp(irg);
1166 nomem = new_r_NoMem(irg);
1167 res = new_bd_ia32_Shl(dbgi, block, op1, op2);
1168 arch_set_irn_register(res, out_reg);
1172 SET_IA32_ORIG_NODE(res, node);
1174 /* add new ADD/SHL to schedule */
1175 DBG_OPT_LEA2ADD(node, res);
1177 /* exchange the Add and the LEA */
1178 sched_add_before(node, res);
1179 copy_mark(node, res);
1180 be_peephole_exchange(node, res);
1184 * Split a Imul mem, imm into a Load mem and Imul reg, imm if possible.
1186 static void peephole_ia32_Imul_split(ir_node *imul)
1188 const ir_node *right = get_irn_n(imul, n_ia32_IMul_right);
1189 const arch_register_t *reg;
1192 if (!is_ia32_Immediate(right) || get_ia32_op_type(imul) != ia32_AddrModeS) {
1193 /* no memory, imm form ignore */
1196 /* we need a free register */
1197 reg = get_free_gp_reg(get_irn_irg(imul));
1201 /* fine, we can rebuild it */
1202 res = ia32_turn_back_am(imul);
1203 arch_set_irn_register(res, reg);
1207 * Replace xorps r,r and xorpd r,r by pxor r,r
1209 static void peephole_ia32_xZero(ir_node *xorn)
1211 set_irn_op(xorn, op_ia32_xPzero);
1215 * Replace 16bit sign extension from ax to eax by shorter cwtl
1217 static void peephole_ia32_Conv_I2I(ir_node *node)
1219 const arch_register_t *eax = &ia32_registers[REG_EAX];
1220 ir_mode *smaller_mode = get_ia32_ls_mode(node);
1221 ir_node *val = get_irn_n(node, n_ia32_Conv_I2I_val);
1226 if (get_mode_size_bits(smaller_mode) != 16 ||
1227 !mode_is_signed(smaller_mode) ||
1228 eax != arch_get_irn_register(val) ||
1229 eax != arch_irn_get_register(node, pn_ia32_Conv_I2I_res))
1232 dbgi = get_irn_dbg_info(node);
1233 block = get_nodes_block(node);
1234 cwtl = new_bd_ia32_Cwtl(dbgi, block, val);
1235 arch_set_irn_register(cwtl, eax);
1236 sched_add_before(node, cwtl);
1237 be_peephole_exchange(node, cwtl);
1241 * Register a peephole optimisation function.
1243 static void register_peephole_optimisation(ir_op *op, peephole_opt_func func)
1245 assert(op->ops.generic == NULL);
1246 op->ops.generic = (op_func)func;
1249 /* Perform peephole-optimizations. */
1250 void ia32_peephole_optimization(ir_graph *irg)
1252 /* register peephole optimisations */
1253 clear_irp_opcodes_generic_func();
1254 register_peephole_optimisation(op_ia32_Const, peephole_ia32_Const);
1255 register_peephole_optimisation(op_be_IncSP, peephole_be_IncSP);
1256 register_peephole_optimisation(op_ia32_Lea, peephole_ia32_Lea);
1257 register_peephole_optimisation(op_ia32_Cmp, peephole_ia32_Cmp);
1258 register_peephole_optimisation(op_ia32_Cmp8Bit, peephole_ia32_Cmp);
1259 register_peephole_optimisation(op_ia32_Test, peephole_ia32_Test);
1260 register_peephole_optimisation(op_ia32_Test8Bit, peephole_ia32_Test);
1261 register_peephole_optimisation(op_be_Return, peephole_ia32_Return);
1262 if (! ia32_cg_config.use_imul_mem_imm32)
1263 register_peephole_optimisation(op_ia32_IMul, peephole_ia32_Imul_split);
1264 if (ia32_cg_config.use_pxor)
1265 register_peephole_optimisation(op_ia32_xZero, peephole_ia32_xZero);
1266 if (ia32_cg_config.use_short_sex_eax)
1267 register_peephole_optimisation(op_ia32_Conv_I2I, peephole_ia32_Conv_I2I);
1269 be_peephole_opt(irg);
1273 * Removes node from schedule if it is not used anymore. If irn is a mode_T node
1274 * all its Projs are removed as well.
1275 * @param irn The irn to be removed from schedule
1277 static inline void try_kill(ir_node *node)
1279 if (get_irn_mode(node) == mode_T) {
1280 const ir_edge_t *edge, *next;
1281 foreach_out_edge_safe(node, edge, next) {
1282 ir_node *proj = get_edge_src_irn(edge);
1287 if (get_irn_n_edges(node) != 0)
1290 if (sched_is_scheduled(node)) {
1297 static void optimize_conv_store(ir_node *node)
1302 ir_mode *store_mode;
1304 if (!is_ia32_Store(node) && !is_ia32_Store8Bit(node))
1307 assert((int)n_ia32_Store_val == (int)n_ia32_Store8Bit_val);
1308 pred_proj = get_irn_n(node, n_ia32_Store_val);
1309 if (is_Proj(pred_proj)) {
1310 pred = get_Proj_pred(pred_proj);
1314 if (!is_ia32_Conv_I2I(pred) && !is_ia32_Conv_I2I8Bit(pred))
1316 if (get_ia32_op_type(pred) != ia32_Normal)
1319 /* the store only stores the lower bits, so we only need the conv
1320 * it it shrinks the mode */
1321 conv_mode = get_ia32_ls_mode(pred);
1322 store_mode = get_ia32_ls_mode(node);
1323 if (get_mode_size_bits(conv_mode) < get_mode_size_bits(store_mode))
1326 set_irn_n(node, n_ia32_Store_val, get_irn_n(pred, n_ia32_Conv_I2I_val));
1327 if (get_irn_n_edges(pred_proj) == 0) {
1328 kill_node(pred_proj);
1329 if (pred != pred_proj)
1334 static void optimize_load_conv(ir_node *node)
1336 ir_node *pred, *predpred;
1340 if (!is_ia32_Conv_I2I(node) && !is_ia32_Conv_I2I8Bit(node))
1343 assert((int)n_ia32_Conv_I2I_val == (int)n_ia32_Conv_I2I8Bit_val);
1344 pred = get_irn_n(node, n_ia32_Conv_I2I_val);
1348 predpred = get_Proj_pred(pred);
1349 if (!is_ia32_Load(predpred))
1352 /* the load is sign extending the upper bits, so we only need the conv
1353 * if it shrinks the mode */
1354 load_mode = get_ia32_ls_mode(predpred);
1355 conv_mode = get_ia32_ls_mode(node);
1356 if (get_mode_size_bits(conv_mode) < get_mode_size_bits(load_mode))
1359 if (get_mode_sign(conv_mode) != get_mode_sign(load_mode)) {
1360 /* change the load if it has only 1 user */
1361 if (get_irn_n_edges(pred) == 1) {
1363 if (get_mode_sign(conv_mode)) {
1364 newmode = find_signed_mode(load_mode);
1366 newmode = find_unsigned_mode(load_mode);
1368 assert(newmode != NULL);
1369 set_ia32_ls_mode(predpred, newmode);
1371 /* otherwise we have to keep the conv */
1377 exchange(node, pred);
1380 static void optimize_conv_conv(ir_node *node)
1382 ir_node *pred_proj, *pred, *result_conv;
1383 ir_mode *pred_mode, *conv_mode;
1387 if (!is_ia32_Conv_I2I(node) && !is_ia32_Conv_I2I8Bit(node))
1390 assert((int)n_ia32_Conv_I2I_val == (int)n_ia32_Conv_I2I8Bit_val);
1391 pred_proj = get_irn_n(node, n_ia32_Conv_I2I_val);
1392 if (is_Proj(pred_proj))
1393 pred = get_Proj_pred(pred_proj);
1397 if (!is_ia32_Conv_I2I(pred) && !is_ia32_Conv_I2I8Bit(pred))
1400 /* we know that after a conv, the upper bits are sign extended
1401 * so we only need the 2nd conv if it shrinks the mode */
1402 conv_mode = get_ia32_ls_mode(node);
1403 conv_mode_bits = get_mode_size_bits(conv_mode);
1404 pred_mode = get_ia32_ls_mode(pred);
1405 pred_mode_bits = get_mode_size_bits(pred_mode);
1407 if (conv_mode_bits == pred_mode_bits
1408 && get_mode_sign(conv_mode) == get_mode_sign(pred_mode)) {
1409 result_conv = pred_proj;
1410 } else if (conv_mode_bits <= pred_mode_bits) {
1411 /* if 2nd conv is smaller then first conv, then we can always take the
1413 if (get_irn_n_edges(pred_proj) == 1) {
1414 result_conv = pred_proj;
1415 set_ia32_ls_mode(pred, conv_mode);
1417 /* Argh:We must change the opcode to 8bit AND copy the register constraints */
1418 if (get_mode_size_bits(conv_mode) == 8) {
1419 set_irn_op(pred, op_ia32_Conv_I2I8Bit);
1420 arch_set_in_register_reqs(pred,
1421 arch_get_in_register_reqs(node));
1424 /* we don't want to end up with 2 loads, so we better do nothing */
1425 if (get_irn_mode(pred) == mode_T) {
1429 result_conv = exact_copy(pred);
1430 set_ia32_ls_mode(result_conv, conv_mode);
1432 /* Argh:We must change the opcode to 8bit AND copy the register constraints */
1433 if (get_mode_size_bits(conv_mode) == 8) {
1434 set_irn_op(result_conv, op_ia32_Conv_I2I8Bit);
1435 arch_set_in_register_reqs(result_conv,
1436 arch_get_in_register_reqs(node));
1440 /* if both convs have the same sign, then we can take the smaller one */
1441 if (get_mode_sign(conv_mode) == get_mode_sign(pred_mode)) {
1442 result_conv = pred_proj;
1444 /* no optimisation possible if smaller conv is sign-extend */
1445 if (mode_is_signed(pred_mode)) {
1448 /* we can take the smaller conv if it is unsigned */
1449 result_conv = pred_proj;
1453 /* Some user (like Phis) won't be happy if we change the mode. */
1454 set_irn_mode(result_conv, get_irn_mode(node));
1457 exchange(node, result_conv);
1459 if (get_irn_n_edges(pred_proj) == 0) {
1460 kill_node(pred_proj);
1461 if (pred != pred_proj)
1464 optimize_conv_conv(result_conv);
1467 static void optimize_node(ir_node *node, void *env)
1471 optimize_load_conv(node);
1472 optimize_conv_store(node);
1473 optimize_conv_conv(node);
1477 * Performs conv and address mode optimization.
1479 void ia32_optimize_graph(ir_graph *irg)
1481 irg_walk_blkwise_graph(irg, NULL, optimize_node, NULL);
1484 void ia32_init_optimize(void)
1486 FIRM_DBG_REGISTER(dbg, "firm.be.ia32.optimize");