2 * Optimizations for Tiny Code Generator for QEMU
4 * Copyright (c) 2010 Samsung Electronics.
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
31 #include "qemu-common.h"
34 #define CASE_OP_32_64(x) \
35 glue(glue(case INDEX_op_, x), _i32): \
36 glue(glue(case INDEX_op_, x), _i64)
44 struct tcg_temp_info {
49 tcg_target_ulong mask;
52 static struct tcg_temp_info temps[TCG_MAX_TEMPS];
54 /* Reset TEMP's state to TCG_TEMP_UNDEF. If TEMP only had one copy, remove
55 the copy flag from the left temp. */
56 static void reset_temp(TCGArg temp)
58 if (temps[temp].state == TCG_TEMP_COPY) {
59 if (temps[temp].prev_copy == temps[temp].next_copy) {
60 temps[temps[temp].next_copy].state = TCG_TEMP_UNDEF;
62 temps[temps[temp].next_copy].prev_copy = temps[temp].prev_copy;
63 temps[temps[temp].prev_copy].next_copy = temps[temp].next_copy;
66 temps[temp].state = TCG_TEMP_UNDEF;
67 temps[temp].mask = -1;
70 static TCGOp *insert_op_before(TCGContext *s, TCGOp *old_op,
71 TCGOpcode opc, int nargs)
73 int oi = s->gen_next_op_idx;
74 int pi = s->gen_next_parm_idx;
75 int prev = old_op->prev;
76 int next = old_op - s->gen_op_buf;
79 tcg_debug_assert(oi < OPC_BUF_SIZE);
80 tcg_debug_assert(pi + nargs <= OPPARAM_BUF_SIZE);
81 s->gen_next_op_idx = oi + 1;
82 s->gen_next_parm_idx = pi + nargs;
84 new_op = &s->gen_op_buf[oi];
92 s->gen_op_buf[prev].next = oi;
94 s->gen_first_op_idx = oi;
101 /* Reset all temporaries, given that there are NB_TEMPS of them. */
102 static void reset_all_temps(int nb_temps)
105 for (i = 0; i < nb_temps; i++) {
106 temps[i].state = TCG_TEMP_UNDEF;
111 static int op_bits(TCGOpcode op)
113 const TCGOpDef *def = &tcg_op_defs[op];
114 return def->flags & TCG_OPF_64BIT ? 64 : 32;
117 static TCGOpcode op_to_mov(TCGOpcode op)
119 switch (op_bits(op)) {
121 return INDEX_op_mov_i32;
123 return INDEX_op_mov_i64;
125 fprintf(stderr, "op_to_mov: unexpected return value of "
126 "function op_bits.\n");
131 static TCGOpcode op_to_movi(TCGOpcode op)
133 switch (op_bits(op)) {
135 return INDEX_op_movi_i32;
137 return INDEX_op_movi_i64;
139 fprintf(stderr, "op_to_movi: unexpected return value of "
140 "function op_bits.\n");
145 static TCGArg find_better_copy(TCGContext *s, TCGArg temp)
149 /* If this is already a global, we can't do better. */
150 if (temp < s->nb_globals) {
154 /* Search for a global first. */
155 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
156 if (i < s->nb_globals) {
161 /* If it is a temp, search for a temp local. */
162 if (!s->temps[temp].temp_local) {
163 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
164 if (s->temps[i].temp_local) {
170 /* Failure to find a better representation, return the same temp. */
174 static bool temps_are_copies(TCGArg arg1, TCGArg arg2)
182 if (temps[arg1].state != TCG_TEMP_COPY
183 || temps[arg2].state != TCG_TEMP_COPY) {
187 for (i = temps[arg1].next_copy ; i != arg1 ; i = temps[i].next_copy) {
196 static void tcg_opt_gen_mov(TCGContext *s, TCGOp *op, TCGArg *args,
197 TCGOpcode old_op, TCGArg dst, TCGArg src)
199 TCGOpcode new_op = op_to_mov(old_op);
200 tcg_target_ulong mask;
205 mask = temps[src].mask;
206 if (TCG_TARGET_REG_BITS > 32 && new_op == INDEX_op_mov_i32) {
207 /* High bits of the destination are now garbage. */
208 mask |= ~0xffffffffull;
210 temps[dst].mask = mask;
212 assert(temps[src].state != TCG_TEMP_CONST);
214 if (s->temps[src].type == s->temps[dst].type) {
215 if (temps[src].state != TCG_TEMP_COPY) {
216 temps[src].state = TCG_TEMP_COPY;
217 temps[src].next_copy = src;
218 temps[src].prev_copy = src;
220 temps[dst].state = TCG_TEMP_COPY;
221 temps[dst].next_copy = temps[src].next_copy;
222 temps[dst].prev_copy = src;
223 temps[temps[dst].next_copy].prev_copy = dst;
224 temps[src].next_copy = dst;
231 static void tcg_opt_gen_movi(TCGContext *s, TCGOp *op, TCGArg *args,
232 TCGOpcode old_op, TCGArg dst, TCGArg val)
234 TCGOpcode new_op = op_to_movi(old_op);
235 tcg_target_ulong mask;
240 temps[dst].state = TCG_TEMP_CONST;
241 temps[dst].val = val;
243 if (TCG_TARGET_REG_BITS > 32 && new_op == INDEX_op_mov_i32) {
244 /* High bits of the destination are now garbage. */
245 mask |= ~0xffffffffull;
247 temps[dst].mask = mask;
253 static TCGArg do_constant_folding_2(TCGOpcode op, TCGArg x, TCGArg y)
276 case INDEX_op_shl_i32:
277 return (uint32_t)x << (y & 31);
279 case INDEX_op_shl_i64:
280 return (uint64_t)x << (y & 63);
282 case INDEX_op_shr_i32:
283 return (uint32_t)x >> (y & 31);
285 case INDEX_op_trunc_shr_i32:
286 case INDEX_op_shr_i64:
287 return (uint64_t)x >> (y & 63);
289 case INDEX_op_sar_i32:
290 return (int32_t)x >> (y & 31);
292 case INDEX_op_sar_i64:
293 return (int64_t)x >> (y & 63);
295 case INDEX_op_rotr_i32:
296 return ror32(x, y & 31);
298 case INDEX_op_rotr_i64:
299 return ror64(x, y & 63);
301 case INDEX_op_rotl_i32:
302 return rol32(x, y & 31);
304 case INDEX_op_rotl_i64:
305 return rol64(x, y & 63);
328 CASE_OP_32_64(ext8s):
331 CASE_OP_32_64(ext16s):
334 CASE_OP_32_64(ext8u):
337 CASE_OP_32_64(ext16u):
340 case INDEX_op_ext32s_i64:
343 case INDEX_op_ext32u_i64:
346 case INDEX_op_muluh_i32:
347 return ((uint64_t)(uint32_t)x * (uint32_t)y) >> 32;
348 case INDEX_op_mulsh_i32:
349 return ((int64_t)(int32_t)x * (int32_t)y) >> 32;
351 case INDEX_op_muluh_i64:
352 mulu64(&l64, &h64, x, y);
354 case INDEX_op_mulsh_i64:
355 muls64(&l64, &h64, x, y);
358 case INDEX_op_div_i32:
359 /* Avoid crashing on divide by zero, otherwise undefined. */
360 return (int32_t)x / ((int32_t)y ? : 1);
361 case INDEX_op_divu_i32:
362 return (uint32_t)x / ((uint32_t)y ? : 1);
363 case INDEX_op_div_i64:
364 return (int64_t)x / ((int64_t)y ? : 1);
365 case INDEX_op_divu_i64:
366 return (uint64_t)x / ((uint64_t)y ? : 1);
368 case INDEX_op_rem_i32:
369 return (int32_t)x % ((int32_t)y ? : 1);
370 case INDEX_op_remu_i32:
371 return (uint32_t)x % ((uint32_t)y ? : 1);
372 case INDEX_op_rem_i64:
373 return (int64_t)x % ((int64_t)y ? : 1);
374 case INDEX_op_remu_i64:
375 return (uint64_t)x % ((uint64_t)y ? : 1);
379 "Unrecognized operation %d in do_constant_folding.\n", op);
384 static TCGArg do_constant_folding(TCGOpcode op, TCGArg x, TCGArg y)
386 TCGArg res = do_constant_folding_2(op, x, y);
387 if (op_bits(op) == 32) {
393 static bool do_constant_folding_cond_32(uint32_t x, uint32_t y, TCGCond c)
401 return (int32_t)x < (int32_t)y;
403 return (int32_t)x >= (int32_t)y;
405 return (int32_t)x <= (int32_t)y;
407 return (int32_t)x > (int32_t)y;
421 static bool do_constant_folding_cond_64(uint64_t x, uint64_t y, TCGCond c)
429 return (int64_t)x < (int64_t)y;
431 return (int64_t)x >= (int64_t)y;
433 return (int64_t)x <= (int64_t)y;
435 return (int64_t)x > (int64_t)y;
449 static bool do_constant_folding_cond_eq(TCGCond c)
469 /* Return 2 if the condition can't be simplified, and the result
470 of the condition (0 or 1) if it can */
471 static TCGArg do_constant_folding_cond(TCGOpcode op, TCGArg x,
474 if (temps[x].state == TCG_TEMP_CONST && temps[y].state == TCG_TEMP_CONST) {
475 switch (op_bits(op)) {
477 return do_constant_folding_cond_32(temps[x].val, temps[y].val, c);
479 return do_constant_folding_cond_64(temps[x].val, temps[y].val, c);
483 } else if (temps_are_copies(x, y)) {
484 return do_constant_folding_cond_eq(c);
485 } else if (temps[y].state == TCG_TEMP_CONST && temps[y].val == 0) {
499 /* Return 2 if the condition can't be simplified, and the result
500 of the condition (0 or 1) if it can */
501 static TCGArg do_constant_folding_cond2(TCGArg *p1, TCGArg *p2, TCGCond c)
503 TCGArg al = p1[0], ah = p1[1];
504 TCGArg bl = p2[0], bh = p2[1];
506 if (temps[bl].state == TCG_TEMP_CONST
507 && temps[bh].state == TCG_TEMP_CONST) {
508 uint64_t b = ((uint64_t)temps[bh].val << 32) | (uint32_t)temps[bl].val;
510 if (temps[al].state == TCG_TEMP_CONST
511 && temps[ah].state == TCG_TEMP_CONST) {
513 a = ((uint64_t)temps[ah].val << 32) | (uint32_t)temps[al].val;
514 return do_constant_folding_cond_64(a, b, c);
527 if (temps_are_copies(al, bl) && temps_are_copies(ah, bh)) {
528 return do_constant_folding_cond_eq(c);
533 static bool swap_commutative(TCGArg dest, TCGArg *p1, TCGArg *p2)
535 TCGArg a1 = *p1, a2 = *p2;
537 sum += temps[a1].state == TCG_TEMP_CONST;
538 sum -= temps[a2].state == TCG_TEMP_CONST;
540 /* Prefer the constant in second argument, and then the form
541 op a, a, b, which is better handled on non-RISC hosts. */
542 if (sum > 0 || (sum == 0 && dest == a2)) {
550 static bool swap_commutative2(TCGArg *p1, TCGArg *p2)
553 sum += temps[p1[0]].state == TCG_TEMP_CONST;
554 sum += temps[p1[1]].state == TCG_TEMP_CONST;
555 sum -= temps[p2[0]].state == TCG_TEMP_CONST;
556 sum -= temps[p2[1]].state == TCG_TEMP_CONST;
559 t = p1[0], p1[0] = p2[0], p2[0] = t;
560 t = p1[1], p1[1] = p2[1], p2[1] = t;
566 /* Propagate constants and copies, fold constant expressions. */
567 static void tcg_constant_folding(TCGContext *s)
569 int oi, oi_next, nb_temps, nb_globals;
571 /* Array VALS has an element for each temp.
572 If this temp holds a constant then its value is kept in VALS' element.
573 If this temp is a copy of other ones then the other copies are
574 available through the doubly linked circular list. */
576 nb_temps = s->nb_temps;
577 nb_globals = s->nb_globals;
578 reset_all_temps(nb_temps);
580 for (oi = s->gen_first_op_idx; oi >= 0; oi = oi_next) {
581 tcg_target_ulong mask, partmask, affected;
582 int nb_oargs, nb_iargs, i;
585 TCGOp * const op = &s->gen_op_buf[oi];
586 TCGArg * const args = &s->gen_opparam_buf[op->args];
587 TCGOpcode opc = op->opc;
588 const TCGOpDef *def = &tcg_op_defs[opc];
591 if (opc == INDEX_op_call) {
592 nb_oargs = op->callo;
593 nb_iargs = op->calli;
595 nb_oargs = def->nb_oargs;
596 nb_iargs = def->nb_iargs;
599 /* Do copy propagation */
600 for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
601 if (temps[args[i]].state == TCG_TEMP_COPY) {
602 args[i] = find_better_copy(s, args[i]);
606 /* For commutative operations make constant second argument */
616 CASE_OP_32_64(muluh):
617 CASE_OP_32_64(mulsh):
618 swap_commutative(args[0], &args[1], &args[2]);
620 CASE_OP_32_64(brcond):
621 if (swap_commutative(-1, &args[0], &args[1])) {
622 args[2] = tcg_swap_cond(args[2]);
625 CASE_OP_32_64(setcond):
626 if (swap_commutative(args[0], &args[1], &args[2])) {
627 args[3] = tcg_swap_cond(args[3]);
630 CASE_OP_32_64(movcond):
631 if (swap_commutative(-1, &args[1], &args[2])) {
632 args[5] = tcg_swap_cond(args[5]);
634 /* For movcond, we canonicalize the "false" input reg to match
635 the destination reg so that the tcg backend can implement
636 a "move if true" operation. */
637 if (swap_commutative(args[0], &args[4], &args[3])) {
638 args[5] = tcg_invert_cond(args[5]);
642 swap_commutative(args[0], &args[2], &args[4]);
643 swap_commutative(args[1], &args[3], &args[5]);
645 CASE_OP_32_64(mulu2):
646 CASE_OP_32_64(muls2):
647 swap_commutative(args[0], &args[2], &args[3]);
649 case INDEX_op_brcond2_i32:
650 if (swap_commutative2(&args[0], &args[2])) {
651 args[4] = tcg_swap_cond(args[4]);
654 case INDEX_op_setcond2_i32:
655 if (swap_commutative2(&args[1], &args[3])) {
656 args[5] = tcg_swap_cond(args[5]);
663 /* Simplify expressions for "shift/rot r, 0, a => movi r, 0",
664 and "sub r, 0, a => neg r, a" case. */
671 if (temps[args[1]].state == TCG_TEMP_CONST
672 && temps[args[1]].val == 0) {
673 tcg_opt_gen_movi(s, op, args, opc, args[0], 0);
682 if (temps[args[2]].state == TCG_TEMP_CONST) {
683 /* Proceed with possible constant folding. */
686 if (opc == INDEX_op_sub_i32) {
687 neg_op = INDEX_op_neg_i32;
688 have_neg = TCG_TARGET_HAS_neg_i32;
690 neg_op = INDEX_op_neg_i64;
691 have_neg = TCG_TARGET_HAS_neg_i64;
696 if (temps[args[1]].state == TCG_TEMP_CONST
697 && temps[args[1]].val == 0) {
707 if (temps[args[1]].state != TCG_TEMP_CONST
708 && temps[args[2]].state == TCG_TEMP_CONST
709 && temps[args[2]].val == -1) {
715 if (temps[args[1]].state != TCG_TEMP_CONST
716 && temps[args[2]].state == TCG_TEMP_CONST
717 && temps[args[2]].val == 0) {
723 if (temps[args[2]].state != TCG_TEMP_CONST
724 && temps[args[1]].state == TCG_TEMP_CONST
725 && temps[args[1]].val == -1) {
732 if (temps[args[2]].state != TCG_TEMP_CONST
733 && temps[args[1]].state == TCG_TEMP_CONST
734 && temps[args[1]].val == 0) {
744 if (def->flags & TCG_OPF_64BIT) {
745 not_op = INDEX_op_not_i64;
746 have_not = TCG_TARGET_HAS_not_i64;
748 not_op = INDEX_op_not_i32;
749 have_not = TCG_TARGET_HAS_not_i32;
763 /* Simplify expression for "op r, a, const => mov r, a" cases */
775 if (temps[args[1]].state != TCG_TEMP_CONST
776 && temps[args[2]].state == TCG_TEMP_CONST
777 && temps[args[2]].val == 0) {
784 if (temps[args[1]].state != TCG_TEMP_CONST
785 && temps[args[2]].state == TCG_TEMP_CONST
786 && temps[args[2]].val == -1) {
791 if (temps_are_copies(args[0], args[1])) {
792 tcg_op_remove(s, op);
794 tcg_opt_gen_mov(s, op, args, opc, args[0], args[1]);
801 /* Simplify using known-zero bits. Currently only ops with a single
802 output argument is supported. */
806 CASE_OP_32_64(ext8s):
807 if ((temps[args[1]].mask & 0x80) != 0) {
810 CASE_OP_32_64(ext8u):
813 CASE_OP_32_64(ext16s):
814 if ((temps[args[1]].mask & 0x8000) != 0) {
817 CASE_OP_32_64(ext16u):
820 case INDEX_op_ext32s_i64:
821 if ((temps[args[1]].mask & 0x80000000) != 0) {
824 case INDEX_op_ext32u_i64:
829 mask = temps[args[2]].mask;
830 if (temps[args[2]].state == TCG_TEMP_CONST) {
832 affected = temps[args[1]].mask & ~mask;
834 mask = temps[args[1]].mask & mask;
838 /* Known-zeros does not imply known-ones. Therefore unless
839 args[2] is constant, we can't infer anything from it. */
840 if (temps[args[2]].state == TCG_TEMP_CONST) {
841 mask = ~temps[args[2]].mask;
844 /* But we certainly know nothing outside args[1] may be set. */
845 mask = temps[args[1]].mask;
848 case INDEX_op_sar_i32:
849 if (temps[args[2]].state == TCG_TEMP_CONST) {
850 tmp = temps[args[2]].val & 31;
851 mask = (int32_t)temps[args[1]].mask >> tmp;
854 case INDEX_op_sar_i64:
855 if (temps[args[2]].state == TCG_TEMP_CONST) {
856 tmp = temps[args[2]].val & 63;
857 mask = (int64_t)temps[args[1]].mask >> tmp;
861 case INDEX_op_shr_i32:
862 if (temps[args[2]].state == TCG_TEMP_CONST) {
863 tmp = temps[args[2]].val & 31;
864 mask = (uint32_t)temps[args[1]].mask >> tmp;
867 case INDEX_op_shr_i64:
868 if (temps[args[2]].state == TCG_TEMP_CONST) {
869 tmp = temps[args[2]].val & 63;
870 mask = (uint64_t)temps[args[1]].mask >> tmp;
874 case INDEX_op_trunc_shr_i32:
875 mask = (uint64_t)temps[args[1]].mask >> args[2];
879 if (temps[args[2]].state == TCG_TEMP_CONST) {
880 tmp = temps[args[2]].val & (TCG_TARGET_REG_BITS - 1);
881 mask = temps[args[1]].mask << tmp;
886 /* Set to 1 all bits to the left of the rightmost. */
887 mask = -(temps[args[1]].mask & -temps[args[1]].mask);
890 CASE_OP_32_64(deposit):
891 mask = deposit64(temps[args[1]].mask, args[3], args[4],
892 temps[args[2]].mask);
897 mask = temps[args[1]].mask | temps[args[2]].mask;
900 CASE_OP_32_64(setcond):
901 case INDEX_op_setcond2_i32:
905 CASE_OP_32_64(movcond):
906 mask = temps[args[3]].mask | temps[args[4]].mask;
912 CASE_OP_32_64(ld16u):
915 case INDEX_op_ld32u_i64:
919 CASE_OP_32_64(qemu_ld):
921 TCGMemOp mop = args[nb_oargs + nb_iargs];
922 if (!(mop & MO_SIGN)) {
923 mask = (2ULL << ((8 << (mop & MO_SIZE)) - 1)) - 1;
932 /* 32-bit ops generate 32-bit results. For the result is zero test
933 below, we can ignore high bits, but for further optimizations we
934 need to record that the high bits contain garbage. */
936 if (!(def->flags & TCG_OPF_64BIT)) {
937 mask |= ~(tcg_target_ulong)0xffffffffu;
938 partmask &= 0xffffffffu;
939 affected &= 0xffffffffu;
943 assert(nb_oargs == 1);
944 tcg_opt_gen_movi(s, op, args, opc, args[0], 0);
948 assert(nb_oargs == 1);
949 if (temps_are_copies(args[0], args[1])) {
950 tcg_op_remove(s, op);
951 } else if (temps[args[1]].state != TCG_TEMP_CONST) {
952 tcg_opt_gen_mov(s, op, args, opc, args[0], args[1]);
954 tcg_opt_gen_movi(s, op, args, opc,
955 args[0], temps[args[1]].val);
960 /* Simplify expression for "op r, a, 0 => movi r, 0" cases */
964 CASE_OP_32_64(muluh):
965 CASE_OP_32_64(mulsh):
966 if ((temps[args[2]].state == TCG_TEMP_CONST
967 && temps[args[2]].val == 0)) {
968 tcg_opt_gen_movi(s, op, args, opc, args[0], 0);
976 /* Simplify expression for "op r, a, a => mov r, a" cases */
980 if (temps_are_copies(args[1], args[2])) {
981 if (temps_are_copies(args[0], args[1])) {
982 tcg_op_remove(s, op);
984 tcg_opt_gen_mov(s, op, args, opc, args[0], args[1]);
993 /* Simplify expression for "op r, a, a => movi r, 0" cases */
998 if (temps_are_copies(args[1], args[2])) {
999 tcg_opt_gen_movi(s, op, args, opc, args[0], 0);
1007 /* Propagate constants through copy operations and do constant
1008 folding. Constants will be substituted to arguments by register
1009 allocator where needed and possible. Also detect copies. */
1012 if (temps_are_copies(args[0], args[1])) {
1013 tcg_op_remove(s, op);
1016 if (temps[args[1]].state != TCG_TEMP_CONST) {
1017 tcg_opt_gen_mov(s, op, args, opc, args[0], args[1]);
1020 /* Source argument is constant. Rewrite the operation and
1021 let movi case handle it. */
1022 args[1] = temps[args[1]].val;
1024 CASE_OP_32_64(movi):
1025 tcg_opt_gen_movi(s, op, args, opc, args[0], args[1]);
1030 CASE_OP_32_64(ext8s):
1031 CASE_OP_32_64(ext8u):
1032 CASE_OP_32_64(ext16s):
1033 CASE_OP_32_64(ext16u):
1034 case INDEX_op_ext32s_i64:
1035 case INDEX_op_ext32u_i64:
1036 if (temps[args[1]].state == TCG_TEMP_CONST) {
1037 tmp = do_constant_folding(opc, temps[args[1]].val, 0);
1038 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1043 case INDEX_op_trunc_shr_i32:
1044 if (temps[args[1]].state == TCG_TEMP_CONST) {
1045 tmp = do_constant_folding(opc, temps[args[1]].val, args[2]);
1046 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1060 CASE_OP_32_64(rotl):
1061 CASE_OP_32_64(rotr):
1062 CASE_OP_32_64(andc):
1065 CASE_OP_32_64(nand):
1067 CASE_OP_32_64(muluh):
1068 CASE_OP_32_64(mulsh):
1070 CASE_OP_32_64(divu):
1072 CASE_OP_32_64(remu):
1073 if (temps[args[1]].state == TCG_TEMP_CONST
1074 && temps[args[2]].state == TCG_TEMP_CONST) {
1075 tmp = do_constant_folding(opc, temps[args[1]].val,
1076 temps[args[2]].val);
1077 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1082 CASE_OP_32_64(deposit):
1083 if (temps[args[1]].state == TCG_TEMP_CONST
1084 && temps[args[2]].state == TCG_TEMP_CONST) {
1085 tmp = deposit64(temps[args[1]].val, args[3], args[4],
1086 temps[args[2]].val);
1087 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1092 CASE_OP_32_64(setcond):
1093 tmp = do_constant_folding_cond(opc, args[1], args[2], args[3]);
1095 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1100 CASE_OP_32_64(brcond):
1101 tmp = do_constant_folding_cond(opc, args[0], args[1], args[2]);
1104 reset_all_temps(nb_temps);
1105 op->opc = INDEX_op_br;
1108 tcg_op_remove(s, op);
1114 CASE_OP_32_64(movcond):
1115 tmp = do_constant_folding_cond(opc, args[1], args[2], args[5]);
1117 if (temps_are_copies(args[0], args[4-tmp])) {
1118 tcg_op_remove(s, op);
1119 } else if (temps[args[4-tmp]].state == TCG_TEMP_CONST) {
1120 tcg_opt_gen_movi(s, op, args, opc,
1121 args[0], temps[args[4-tmp]].val);
1123 tcg_opt_gen_mov(s, op, args, opc, args[0], args[4-tmp]);
1129 case INDEX_op_add2_i32:
1130 case INDEX_op_sub2_i32:
1131 if (temps[args[2]].state == TCG_TEMP_CONST
1132 && temps[args[3]].state == TCG_TEMP_CONST
1133 && temps[args[4]].state == TCG_TEMP_CONST
1134 && temps[args[5]].state == TCG_TEMP_CONST) {
1135 uint32_t al = temps[args[2]].val;
1136 uint32_t ah = temps[args[3]].val;
1137 uint32_t bl = temps[args[4]].val;
1138 uint32_t bh = temps[args[5]].val;
1139 uint64_t a = ((uint64_t)ah << 32) | al;
1140 uint64_t b = ((uint64_t)bh << 32) | bl;
1142 TCGOp *op2 = insert_op_before(s, op, INDEX_op_movi_i32, 2);
1143 TCGArg *args2 = &s->gen_opparam_buf[op2->args];
1145 if (opc == INDEX_op_add2_i32) {
1153 tcg_opt_gen_movi(s, op, args, opc, rl, (uint32_t)a);
1154 tcg_opt_gen_movi(s, op2, args2, opc, rh, (uint32_t)(a >> 32));
1156 /* We've done all we need to do with the movi. Skip it. */
1157 oi_next = op2->next;
1162 case INDEX_op_mulu2_i32:
1163 if (temps[args[2]].state == TCG_TEMP_CONST
1164 && temps[args[3]].state == TCG_TEMP_CONST) {
1165 uint32_t a = temps[args[2]].val;
1166 uint32_t b = temps[args[3]].val;
1167 uint64_t r = (uint64_t)a * b;
1169 TCGOp *op2 = insert_op_before(s, op, INDEX_op_movi_i32, 2);
1170 TCGArg *args2 = &s->gen_opparam_buf[op2->args];
1174 tcg_opt_gen_movi(s, op, args, opc, rl, (uint32_t)r);
1175 tcg_opt_gen_movi(s, op2, args2, opc, rh, (uint32_t)(r >> 32));
1177 /* We've done all we need to do with the movi. Skip it. */
1178 oi_next = op2->next;
1183 case INDEX_op_brcond2_i32:
1184 tmp = do_constant_folding_cond2(&args[0], &args[2], args[4]);
1188 reset_all_temps(nb_temps);
1189 op->opc = INDEX_op_br;
1193 tcg_op_remove(s, op);
1195 } else if ((args[4] == TCG_COND_LT || args[4] == TCG_COND_GE)
1196 && temps[args[2]].state == TCG_TEMP_CONST
1197 && temps[args[3]].state == TCG_TEMP_CONST
1198 && temps[args[2]].val == 0
1199 && temps[args[3]].val == 0) {
1200 /* Simplify LT/GE comparisons vs zero to a single compare
1201 vs the high word of the input. */
1203 reset_all_temps(nb_temps);
1204 op->opc = INDEX_op_brcond_i32;
1209 } else if (args[4] == TCG_COND_EQ) {
1210 /* Simplify EQ comparisons where one of the pairs
1211 can be simplified. */
1212 tmp = do_constant_folding_cond(INDEX_op_brcond_i32,
1213 args[0], args[2], TCG_COND_EQ);
1215 goto do_brcond_false;
1216 } else if (tmp == 1) {
1217 goto do_brcond_high;
1219 tmp = do_constant_folding_cond(INDEX_op_brcond_i32,
1220 args[1], args[3], TCG_COND_EQ);
1222 goto do_brcond_false;
1223 } else if (tmp != 1) {
1227 reset_all_temps(nb_temps);
1228 op->opc = INDEX_op_brcond_i32;
1232 } else if (args[4] == TCG_COND_NE) {
1233 /* Simplify NE comparisons where one of the pairs
1234 can be simplified. */
1235 tmp = do_constant_folding_cond(INDEX_op_brcond_i32,
1236 args[0], args[2], TCG_COND_NE);
1238 goto do_brcond_high;
1239 } else if (tmp == 1) {
1240 goto do_brcond_true;
1242 tmp = do_constant_folding_cond(INDEX_op_brcond_i32,
1243 args[1], args[3], TCG_COND_NE);
1246 } else if (tmp == 1) {
1247 goto do_brcond_true;
1255 case INDEX_op_setcond2_i32:
1256 tmp = do_constant_folding_cond2(&args[1], &args[3], args[5]);
1259 tcg_opt_gen_movi(s, op, args, opc, args[0], tmp);
1260 } else if ((args[5] == TCG_COND_LT || args[5] == TCG_COND_GE)
1261 && temps[args[3]].state == TCG_TEMP_CONST
1262 && temps[args[4]].state == TCG_TEMP_CONST
1263 && temps[args[3]].val == 0
1264 && temps[args[4]].val == 0) {
1265 /* Simplify LT/GE comparisons vs zero to a single compare
1266 vs the high word of the input. */
1268 reset_temp(args[0]);
1269 temps[args[0]].mask = 1;
1270 op->opc = INDEX_op_setcond_i32;
1274 } else if (args[5] == TCG_COND_EQ) {
1275 /* Simplify EQ comparisons where one of the pairs
1276 can be simplified. */
1277 tmp = do_constant_folding_cond(INDEX_op_setcond_i32,
1278 args[1], args[3], TCG_COND_EQ);
1280 goto do_setcond_const;
1281 } else if (tmp == 1) {
1282 goto do_setcond_high;
1284 tmp = do_constant_folding_cond(INDEX_op_setcond_i32,
1285 args[2], args[4], TCG_COND_EQ);
1287 goto do_setcond_high;
1288 } else if (tmp != 1) {
1292 reset_temp(args[0]);
1293 temps[args[0]].mask = 1;
1294 op->opc = INDEX_op_setcond_i32;
1297 } else if (args[5] == TCG_COND_NE) {
1298 /* Simplify NE comparisons where one of the pairs
1299 can be simplified. */
1300 tmp = do_constant_folding_cond(INDEX_op_setcond_i32,
1301 args[1], args[3], TCG_COND_NE);
1303 goto do_setcond_high;
1304 } else if (tmp == 1) {
1305 goto do_setcond_const;
1307 tmp = do_constant_folding_cond(INDEX_op_setcond_i32,
1308 args[2], args[4], TCG_COND_NE);
1310 goto do_setcond_low;
1311 } else if (tmp == 1) {
1312 goto do_setcond_const;
1321 if (!(args[nb_oargs + nb_iargs + 1]
1322 & (TCG_CALL_NO_READ_GLOBALS | TCG_CALL_NO_WRITE_GLOBALS))) {
1323 for (i = 0; i < nb_globals; i++) {
1327 goto do_reset_output;
1331 /* Default case: we know nothing about operation (or were unable
1332 to compute the operation result) so no propagation is done.
1333 We trash everything if the operation is the end of a basic
1334 block, otherwise we only trash the output args. "mask" is
1335 the non-zero bits mask for the first output arg. */
1336 if (def->flags & TCG_OPF_BB_END) {
1337 reset_all_temps(nb_temps);
1340 for (i = 0; i < nb_oargs; i++) {
1341 reset_temp(args[i]);
1342 /* Save the corresponding known-zero bits mask for the
1343 first output argument (only one supported so far). */
1345 temps[args[i]].mask = mask;
1354 void tcg_optimize(TCGContext *s)
1356 tcg_constant_folding(s);