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 /* Reset all temporaries, given that there are NB_TEMPS of them. */
71 static void reset_all_temps(int nb_temps)
74 for (i = 0; i < nb_temps; i++) {
75 temps[i].state = TCG_TEMP_UNDEF;
80 static int op_bits(TCGOpcode op)
82 const TCGOpDef *def = &tcg_op_defs[op];
83 return def->flags & TCG_OPF_64BIT ? 64 : 32;
86 static TCGOpcode op_to_movi(TCGOpcode op)
88 switch (op_bits(op)) {
90 return INDEX_op_movi_i32;
92 return INDEX_op_movi_i64;
94 fprintf(stderr, "op_to_movi: unexpected return value of "
95 "function op_bits.\n");
100 static TCGArg find_better_copy(TCGContext *s, TCGArg temp)
104 /* If this is already a global, we can't do better. */
105 if (temp < s->nb_globals) {
109 /* Search for a global first. */
110 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
111 if (i < s->nb_globals) {
116 /* If it is a temp, search for a temp local. */
117 if (!s->temps[temp].temp_local) {
118 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
119 if (s->temps[i].temp_local) {
125 /* Failure to find a better representation, return the same temp. */
129 static bool temps_are_copies(TCGArg arg1, TCGArg arg2)
137 if (temps[arg1].state != TCG_TEMP_COPY
138 || temps[arg2].state != TCG_TEMP_COPY) {
142 for (i = temps[arg1].next_copy ; i != arg1 ; i = temps[i].next_copy) {
151 static void tcg_opt_gen_mov(TCGContext *s, TCGArg *gen_args,
152 TCGArg dst, TCGArg src)
155 temps[dst].mask = temps[src].mask;
156 assert(temps[src].state != TCG_TEMP_CONST);
158 if (s->temps[src].type == s->temps[dst].type) {
159 if (temps[src].state != TCG_TEMP_COPY) {
160 temps[src].state = TCG_TEMP_COPY;
161 temps[src].next_copy = src;
162 temps[src].prev_copy = src;
164 temps[dst].state = TCG_TEMP_COPY;
165 temps[dst].next_copy = temps[src].next_copy;
166 temps[dst].prev_copy = src;
167 temps[temps[dst].next_copy].prev_copy = dst;
168 temps[src].next_copy = dst;
175 static void tcg_opt_gen_movi(TCGArg *gen_args, TCGArg dst, TCGArg val)
178 temps[dst].state = TCG_TEMP_CONST;
179 temps[dst].val = val;
180 temps[dst].mask = val;
185 static TCGOpcode op_to_mov(TCGOpcode op)
187 switch (op_bits(op)) {
189 return INDEX_op_mov_i32;
191 return INDEX_op_mov_i64;
193 fprintf(stderr, "op_to_mov: unexpected return value of "
194 "function op_bits.\n");
199 static TCGArg do_constant_folding_2(TCGOpcode op, TCGArg x, TCGArg y)
220 case INDEX_op_shl_i32:
221 return (uint32_t)x << (uint32_t)y;
223 case INDEX_op_shl_i64:
224 return (uint64_t)x << (uint64_t)y;
226 case INDEX_op_shr_i32:
227 return (uint32_t)x >> (uint32_t)y;
229 case INDEX_op_shr_i64:
230 return (uint64_t)x >> (uint64_t)y;
232 case INDEX_op_sar_i32:
233 return (int32_t)x >> (int32_t)y;
235 case INDEX_op_sar_i64:
236 return (int64_t)x >> (int64_t)y;
238 case INDEX_op_rotr_i32:
239 x = ((uint32_t)x << (32 - y)) | ((uint32_t)x >> y);
242 case INDEX_op_rotr_i64:
243 x = ((uint64_t)x << (64 - y)) | ((uint64_t)x >> y);
246 case INDEX_op_rotl_i32:
247 x = ((uint32_t)x << y) | ((uint32_t)x >> (32 - y));
250 case INDEX_op_rotl_i64:
251 x = ((uint64_t)x << y) | ((uint64_t)x >> (64 - y));
275 CASE_OP_32_64(ext8s):
278 CASE_OP_32_64(ext16s):
281 CASE_OP_32_64(ext8u):
284 CASE_OP_32_64(ext16u):
287 case INDEX_op_ext32s_i64:
290 case INDEX_op_ext32u_i64:
295 "Unrecognized operation %d in do_constant_folding.\n", op);
300 static TCGArg do_constant_folding(TCGOpcode op, TCGArg x, TCGArg y)
302 TCGArg res = do_constant_folding_2(op, x, y);
303 if (op_bits(op) == 32) {
309 static bool do_constant_folding_cond_32(uint32_t x, uint32_t y, TCGCond c)
317 return (int32_t)x < (int32_t)y;
319 return (int32_t)x >= (int32_t)y;
321 return (int32_t)x <= (int32_t)y;
323 return (int32_t)x > (int32_t)y;
337 static bool do_constant_folding_cond_64(uint64_t x, uint64_t y, TCGCond c)
345 return (int64_t)x < (int64_t)y;
347 return (int64_t)x >= (int64_t)y;
349 return (int64_t)x <= (int64_t)y;
351 return (int64_t)x > (int64_t)y;
365 static bool do_constant_folding_cond_eq(TCGCond c)
385 /* Return 2 if the condition can't be simplified, and the result
386 of the condition (0 or 1) if it can */
387 static TCGArg do_constant_folding_cond(TCGOpcode op, TCGArg x,
390 if (temps[x].state == TCG_TEMP_CONST && temps[y].state == TCG_TEMP_CONST) {
391 switch (op_bits(op)) {
393 return do_constant_folding_cond_32(temps[x].val, temps[y].val, c);
395 return do_constant_folding_cond_64(temps[x].val, temps[y].val, c);
399 } else if (temps_are_copies(x, y)) {
400 return do_constant_folding_cond_eq(c);
401 } else if (temps[y].state == TCG_TEMP_CONST && temps[y].val == 0) {
415 /* Return 2 if the condition can't be simplified, and the result
416 of the condition (0 or 1) if it can */
417 static TCGArg do_constant_folding_cond2(TCGArg *p1, TCGArg *p2, TCGCond c)
419 TCGArg al = p1[0], ah = p1[1];
420 TCGArg bl = p2[0], bh = p2[1];
422 if (temps[bl].state == TCG_TEMP_CONST
423 && temps[bh].state == TCG_TEMP_CONST) {
424 uint64_t b = ((uint64_t)temps[bh].val << 32) | (uint32_t)temps[bl].val;
426 if (temps[al].state == TCG_TEMP_CONST
427 && temps[ah].state == TCG_TEMP_CONST) {
429 a = ((uint64_t)temps[ah].val << 32) | (uint32_t)temps[al].val;
430 return do_constant_folding_cond_64(a, b, c);
443 if (temps_are_copies(al, bl) && temps_are_copies(ah, bh)) {
444 return do_constant_folding_cond_eq(c);
449 static bool swap_commutative(TCGArg dest, TCGArg *p1, TCGArg *p2)
451 TCGArg a1 = *p1, a2 = *p2;
453 sum += temps[a1].state == TCG_TEMP_CONST;
454 sum -= temps[a2].state == TCG_TEMP_CONST;
456 /* Prefer the constant in second argument, and then the form
457 op a, a, b, which is better handled on non-RISC hosts. */
458 if (sum > 0 || (sum == 0 && dest == a2)) {
466 static bool swap_commutative2(TCGArg *p1, TCGArg *p2)
469 sum += temps[p1[0]].state == TCG_TEMP_CONST;
470 sum += temps[p1[1]].state == TCG_TEMP_CONST;
471 sum -= temps[p2[0]].state == TCG_TEMP_CONST;
472 sum -= temps[p2[1]].state == TCG_TEMP_CONST;
475 t = p1[0], p1[0] = p2[0], p2[0] = t;
476 t = p1[1], p1[1] = p2[1], p2[1] = t;
482 /* Propagate constants and copies, fold constant expressions. */
483 static TCGArg *tcg_constant_folding(TCGContext *s, uint16_t *tcg_opc_ptr,
484 TCGArg *args, TCGOpDef *tcg_op_defs)
486 int i, nb_ops, op_index, nb_temps, nb_globals, nb_call_args;
487 tcg_target_ulong mask, affected;
493 /* Array VALS has an element for each temp.
494 If this temp holds a constant then its value is kept in VALS' element.
495 If this temp is a copy of other ones then the other copies are
496 available through the doubly linked circular list. */
498 nb_temps = s->nb_temps;
499 nb_globals = s->nb_globals;
500 reset_all_temps(nb_temps);
502 nb_ops = tcg_opc_ptr - s->gen_opc_buf;
504 for (op_index = 0; op_index < nb_ops; op_index++) {
505 op = s->gen_opc_buf[op_index];
506 def = &tcg_op_defs[op];
507 /* Do copy propagation */
508 if (op == INDEX_op_call) {
509 int nb_oargs = args[0] >> 16;
510 int nb_iargs = args[0] & 0xffff;
511 for (i = nb_oargs + 1; i < nb_oargs + nb_iargs + 1; i++) {
512 if (temps[args[i]].state == TCG_TEMP_COPY) {
513 args[i] = find_better_copy(s, args[i]);
517 for (i = def->nb_oargs; i < def->nb_oargs + def->nb_iargs; i++) {
518 if (temps[args[i]].state == TCG_TEMP_COPY) {
519 args[i] = find_better_copy(s, args[i]);
524 /* For commutative operations make constant second argument */
534 swap_commutative(args[0], &args[1], &args[2]);
536 CASE_OP_32_64(brcond):
537 if (swap_commutative(-1, &args[0], &args[1])) {
538 args[2] = tcg_swap_cond(args[2]);
541 CASE_OP_32_64(setcond):
542 if (swap_commutative(args[0], &args[1], &args[2])) {
543 args[3] = tcg_swap_cond(args[3]);
546 CASE_OP_32_64(movcond):
547 if (swap_commutative(-1, &args[1], &args[2])) {
548 args[5] = tcg_swap_cond(args[5]);
550 /* For movcond, we canonicalize the "false" input reg to match
551 the destination reg so that the tcg backend can implement
552 a "move if true" operation. */
553 if (swap_commutative(args[0], &args[4], &args[3])) {
554 args[5] = tcg_invert_cond(args[5]);
557 case INDEX_op_add2_i32:
558 swap_commutative(args[0], &args[2], &args[4]);
559 swap_commutative(args[1], &args[3], &args[5]);
561 case INDEX_op_mulu2_i32:
562 swap_commutative(args[0], &args[2], &args[3]);
564 case INDEX_op_brcond2_i32:
565 if (swap_commutative2(&args[0], &args[2])) {
566 args[4] = tcg_swap_cond(args[4]);
569 case INDEX_op_setcond2_i32:
570 if (swap_commutative2(&args[1], &args[3])) {
571 args[5] = tcg_swap_cond(args[5]);
578 /* Simplify expressions for "shift/rot r, 0, a => movi r, 0" */
585 if (temps[args[1]].state == TCG_TEMP_CONST
586 && temps[args[1]].val == 0) {
587 s->gen_opc_buf[op_index] = op_to_movi(op);
588 tcg_opt_gen_movi(gen_args, args[0], 0);
598 /* Simplify expression for "op r, a, 0 => mov r, a" cases */
609 if (temps[args[1]].state == TCG_TEMP_CONST) {
610 /* Proceed with possible constant folding. */
613 if (temps[args[2]].state == TCG_TEMP_CONST
614 && temps[args[2]].val == 0) {
615 if (temps_are_copies(args[0], args[1])) {
616 s->gen_opc_buf[op_index] = INDEX_op_nop;
618 s->gen_opc_buf[op_index] = op_to_mov(op);
619 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
630 /* Simplify using known-zero bits */
634 CASE_OP_32_64(ext8s):
635 if ((temps[args[1]].mask & 0x80) != 0) {
638 CASE_OP_32_64(ext8u):
641 CASE_OP_32_64(ext16s):
642 if ((temps[args[1]].mask & 0x8000) != 0) {
645 CASE_OP_32_64(ext16u):
648 case INDEX_op_ext32s_i64:
649 if ((temps[args[1]].mask & 0x80000000) != 0) {
652 case INDEX_op_ext32u_i64:
657 mask = temps[args[2]].mask;
658 if (temps[args[2]].state == TCG_TEMP_CONST) {
660 affected = temps[args[1]].mask & ~mask;
662 mask = temps[args[1]].mask & mask;
666 if (temps[args[2]].state == TCG_TEMP_CONST) {
667 mask = ((tcg_target_long)temps[args[1]].mask
668 >> temps[args[2]].val);
673 if (temps[args[2]].state == TCG_TEMP_CONST) {
674 mask = temps[args[1]].mask >> temps[args[2]].val;
679 if (temps[args[2]].state == TCG_TEMP_CONST) {
680 mask = temps[args[1]].mask << temps[args[2]].val;
685 /* Set to 1 all bits to the left of the rightmost. */
686 mask = -(temps[args[1]].mask & -temps[args[1]].mask);
689 CASE_OP_32_64(deposit):
690 tmp = ((1ull << args[4]) - 1);
691 mask = ((temps[args[1]].mask & ~(tmp << args[3]))
692 | ((temps[args[2]].mask & tmp) << args[3]));
697 mask = temps[args[1]].mask | temps[args[2]].mask;
700 CASE_OP_32_64(setcond):
704 CASE_OP_32_64(movcond):
705 mask = temps[args[3]].mask | temps[args[4]].mask;
713 assert(def->nb_oargs == 1);
714 s->gen_opc_buf[op_index] = op_to_movi(op);
715 tcg_opt_gen_movi(gen_args, args[0], 0);
716 args += def->nb_oargs + def->nb_iargs + def->nb_cargs;
721 assert(def->nb_oargs == 1);
722 if (temps_are_copies(args[0], args[1])) {
723 s->gen_opc_buf[op_index] = INDEX_op_nop;
724 } else if (temps[args[1]].state != TCG_TEMP_CONST) {
725 s->gen_opc_buf[op_index] = op_to_mov(op);
726 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
729 s->gen_opc_buf[op_index] = op_to_movi(op);
730 tcg_opt_gen_movi(gen_args, args[0], temps[args[1]].val);
733 args += def->nb_iargs + 1;
737 /* Simplify expression for "op r, a, 0 => movi r, 0" cases */
741 if ((temps[args[2]].state == TCG_TEMP_CONST
742 && temps[args[2]].val == 0)) {
743 s->gen_opc_buf[op_index] = op_to_movi(op);
744 tcg_opt_gen_movi(gen_args, args[0], 0);
754 /* Simplify expression for "op r, a, a => mov r, a" cases */
758 if (temps_are_copies(args[1], args[2])) {
759 if (temps_are_copies(args[0], args[1])) {
760 s->gen_opc_buf[op_index] = INDEX_op_nop;
762 s->gen_opc_buf[op_index] = op_to_mov(op);
763 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
774 /* Simplify expression for "op r, a, a => movi r, 0" cases */
778 if (temps_are_copies(args[1], args[2])) {
779 s->gen_opc_buf[op_index] = op_to_movi(op);
780 tcg_opt_gen_movi(gen_args, args[0], 0);
790 /* Propagate constants through copy operations and do constant
791 folding. Constants will be substituted to arguments by register
792 allocator where needed and possible. Also detect copies. */
795 if (temps_are_copies(args[0], args[1])) {
797 s->gen_opc_buf[op_index] = INDEX_op_nop;
800 if (temps[args[1]].state != TCG_TEMP_CONST) {
801 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
806 /* Source argument is constant. Rewrite the operation and
807 let movi case handle it. */
809 s->gen_opc_buf[op_index] = op;
810 args[1] = temps[args[1]].val;
813 tcg_opt_gen_movi(gen_args, args[0], args[1]);
820 CASE_OP_32_64(ext8s):
821 CASE_OP_32_64(ext8u):
822 CASE_OP_32_64(ext16s):
823 CASE_OP_32_64(ext16u):
824 case INDEX_op_ext32s_i64:
825 case INDEX_op_ext32u_i64:
826 if (temps[args[1]].state == TCG_TEMP_CONST) {
827 s->gen_opc_buf[op_index] = op_to_movi(op);
828 tmp = do_constant_folding(op, temps[args[1]].val, 0);
829 tcg_opt_gen_movi(gen_args, args[0], tmp);
852 if (temps[args[1]].state == TCG_TEMP_CONST
853 && temps[args[2]].state == TCG_TEMP_CONST) {
854 s->gen_opc_buf[op_index] = op_to_movi(op);
855 tmp = do_constant_folding(op, temps[args[1]].val,
857 tcg_opt_gen_movi(gen_args, args[0], tmp);
864 CASE_OP_32_64(deposit):
865 if (temps[args[1]].state == TCG_TEMP_CONST
866 && temps[args[2]].state == TCG_TEMP_CONST) {
867 s->gen_opc_buf[op_index] = op_to_movi(op);
868 tmp = ((1ull << args[4]) - 1);
869 tmp = (temps[args[1]].val & ~(tmp << args[3]))
870 | ((temps[args[2]].val & tmp) << args[3]);
871 tcg_opt_gen_movi(gen_args, args[0], tmp);
878 CASE_OP_32_64(setcond):
879 tmp = do_constant_folding_cond(op, args[1], args[2], args[3]);
881 s->gen_opc_buf[op_index] = op_to_movi(op);
882 tcg_opt_gen_movi(gen_args, args[0], tmp);
889 CASE_OP_32_64(brcond):
890 tmp = do_constant_folding_cond(op, args[0], args[1], args[2]);
893 reset_all_temps(nb_temps);
894 s->gen_opc_buf[op_index] = INDEX_op_br;
895 gen_args[0] = args[3];
898 s->gen_opc_buf[op_index] = INDEX_op_nop;
905 CASE_OP_32_64(movcond):
906 tmp = do_constant_folding_cond(op, args[1], args[2], args[5]);
908 if (temps_are_copies(args[0], args[4-tmp])) {
909 s->gen_opc_buf[op_index] = INDEX_op_nop;
910 } else if (temps[args[4-tmp]].state == TCG_TEMP_CONST) {
911 s->gen_opc_buf[op_index] = op_to_movi(op);
912 tcg_opt_gen_movi(gen_args, args[0], temps[args[4-tmp]].val);
915 s->gen_opc_buf[op_index] = op_to_mov(op);
916 tcg_opt_gen_mov(s, gen_args, args[0], args[4-tmp]);
924 case INDEX_op_add2_i32:
925 case INDEX_op_sub2_i32:
926 if (temps[args[2]].state == TCG_TEMP_CONST
927 && temps[args[3]].state == TCG_TEMP_CONST
928 && temps[args[4]].state == TCG_TEMP_CONST
929 && temps[args[5]].state == TCG_TEMP_CONST) {
930 uint32_t al = temps[args[2]].val;
931 uint32_t ah = temps[args[3]].val;
932 uint32_t bl = temps[args[4]].val;
933 uint32_t bh = temps[args[5]].val;
934 uint64_t a = ((uint64_t)ah << 32) | al;
935 uint64_t b = ((uint64_t)bh << 32) | bl;
938 if (op == INDEX_op_add2_i32) {
944 /* We emit the extra nop when we emit the add2/sub2. */
945 assert(s->gen_opc_buf[op_index + 1] == INDEX_op_nop);
949 s->gen_opc_buf[op_index] = INDEX_op_movi_i32;
950 s->gen_opc_buf[++op_index] = INDEX_op_movi_i32;
951 tcg_opt_gen_movi(&gen_args[0], rl, (uint32_t)a);
952 tcg_opt_gen_movi(&gen_args[2], rh, (uint32_t)(a >> 32));
959 case INDEX_op_mulu2_i32:
960 if (temps[args[2]].state == TCG_TEMP_CONST
961 && temps[args[3]].state == TCG_TEMP_CONST) {
962 uint32_t a = temps[args[2]].val;
963 uint32_t b = temps[args[3]].val;
964 uint64_t r = (uint64_t)a * b;
967 /* We emit the extra nop when we emit the mulu2. */
968 assert(s->gen_opc_buf[op_index + 1] == INDEX_op_nop);
972 s->gen_opc_buf[op_index] = INDEX_op_movi_i32;
973 s->gen_opc_buf[++op_index] = INDEX_op_movi_i32;
974 tcg_opt_gen_movi(&gen_args[0], rl, (uint32_t)r);
975 tcg_opt_gen_movi(&gen_args[2], rh, (uint32_t)(r >> 32));
982 case INDEX_op_brcond2_i32:
983 tmp = do_constant_folding_cond2(&args[0], &args[2], args[4]);
986 reset_all_temps(nb_temps);
987 s->gen_opc_buf[op_index] = INDEX_op_br;
988 gen_args[0] = args[5];
991 s->gen_opc_buf[op_index] = INDEX_op_nop;
993 } else if ((args[4] == TCG_COND_LT || args[4] == TCG_COND_GE)
994 && temps[args[2]].state == TCG_TEMP_CONST
995 && temps[args[3]].state == TCG_TEMP_CONST
996 && temps[args[2]].val == 0
997 && temps[args[3]].val == 0) {
998 /* Simplify LT/GE comparisons vs zero to a single compare
999 vs the high word of the input. */
1000 reset_all_temps(nb_temps);
1001 s->gen_opc_buf[op_index] = INDEX_op_brcond_i32;
1002 gen_args[0] = args[1];
1003 gen_args[1] = args[3];
1004 gen_args[2] = args[4];
1005 gen_args[3] = args[5];
1013 case INDEX_op_setcond2_i32:
1014 tmp = do_constant_folding_cond2(&args[1], &args[3], args[5]);
1016 s->gen_opc_buf[op_index] = INDEX_op_movi_i32;
1017 tcg_opt_gen_movi(gen_args, args[0], tmp);
1019 } else if ((args[5] == TCG_COND_LT || args[5] == TCG_COND_GE)
1020 && temps[args[3]].state == TCG_TEMP_CONST
1021 && temps[args[4]].state == TCG_TEMP_CONST
1022 && temps[args[3]].val == 0
1023 && temps[args[4]].val == 0) {
1024 /* Simplify LT/GE comparisons vs zero to a single compare
1025 vs the high word of the input. */
1026 s->gen_opc_buf[op_index] = INDEX_op_setcond_i32;
1027 gen_args[0] = args[0];
1028 gen_args[1] = args[2];
1029 gen_args[2] = args[4];
1030 gen_args[3] = args[5];
1039 nb_call_args = (args[0] >> 16) + (args[0] & 0xffff);
1040 if (!(args[nb_call_args + 1] & (TCG_CALL_NO_READ_GLOBALS |
1041 TCG_CALL_NO_WRITE_GLOBALS))) {
1042 for (i = 0; i < nb_globals; i++) {
1046 for (i = 0; i < (args[0] >> 16); i++) {
1047 reset_temp(args[i + 1]);
1049 i = nb_call_args + 3;
1060 /* Default case: we know nothing about operation (or were unable
1061 to compute the operation result) so no propagation is done.
1062 We trash everything if the operation is the end of a basic
1063 block, otherwise we only trash the output args. "mask" is
1064 the non-zero bits mask for the first output arg. */
1065 if (def->flags & TCG_OPF_BB_END) {
1066 reset_all_temps(nb_temps);
1068 for (i = 0; i < def->nb_oargs; i++) {
1069 reset_temp(args[i]);
1072 for (i = 0; i < def->nb_args; i++) {
1073 gen_args[i] = args[i];
1075 args += def->nb_args;
1076 gen_args += def->nb_args;
1084 TCGArg *tcg_optimize(TCGContext *s, uint16_t *tcg_opc_ptr,
1085 TCGArg *args, TCGOpDef *tcg_op_defs)
1088 res = tcg_constant_folding(s, tcg_opc_ptr, args, tcg_op_defs);