]> git.proxmox.com Git - mirror_qemu.git/blame - tcg/optimize.c
tcg: Split out subroutines from do_constant_folding_cond
[mirror_qemu.git] / tcg / optimize.c
CommitLineData
8f2e8c07
KB
1/*
2 * Optimizations for Tiny Code Generator for QEMU
3 *
4 * Copyright (c) 2010 Samsung Electronics.
5 * Contributed by Kirill Batuzov <batuzovk@ispras.ru>
6 *
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:
13 *
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
16 *
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
23 * THE SOFTWARE.
24 */
25
26#include "config.h"
27
28#include <stdlib.h>
29#include <stdio.h>
30
31#include "qemu-common.h"
32#include "tcg-op.h"
33
8f2e8c07
KB
34#define CASE_OP_32_64(x) \
35 glue(glue(case INDEX_op_, x), _i32): \
36 glue(glue(case INDEX_op_, x), _i64)
8f2e8c07 37
22613af4
KB
38typedef enum {
39 TCG_TEMP_UNDEF = 0,
40 TCG_TEMP_CONST,
41 TCG_TEMP_COPY,
22613af4
KB
42} tcg_temp_state;
43
44struct tcg_temp_info {
45 tcg_temp_state state;
46 uint16_t prev_copy;
47 uint16_t next_copy;
48 tcg_target_ulong val;
49};
50
51static struct tcg_temp_info temps[TCG_MAX_TEMPS];
52
e590d4e6
AJ
53/* Reset TEMP's state to TCG_TEMP_UNDEF. If TEMP only had one copy, remove
54 the copy flag from the left temp. */
55static void reset_temp(TCGArg temp)
22613af4 56{
e590d4e6
AJ
57 if (temps[temp].state == TCG_TEMP_COPY) {
58 if (temps[temp].prev_copy == temps[temp].next_copy) {
59 temps[temps[temp].next_copy].state = TCG_TEMP_UNDEF;
60 } else {
61 temps[temps[temp].next_copy].prev_copy = temps[temp].prev_copy;
62 temps[temps[temp].prev_copy].next_copy = temps[temp].next_copy;
22613af4 63 }
22613af4 64 }
48b56ce1 65 temps[temp].state = TCG_TEMP_UNDEF;
22613af4
KB
66}
67
fe0de7aa 68static int op_bits(TCGOpcode op)
22613af4 69{
8399ad59
RH
70 const TCGOpDef *def = &tcg_op_defs[op];
71 return def->flags & TCG_OPF_64BIT ? 64 : 32;
22613af4
KB
72}
73
fe0de7aa 74static TCGOpcode op_to_movi(TCGOpcode op)
22613af4
KB
75{
76 switch (op_bits(op)) {
77 case 32:
78 return INDEX_op_movi_i32;
22613af4
KB
79 case 64:
80 return INDEX_op_movi_i64;
22613af4
KB
81 default:
82 fprintf(stderr, "op_to_movi: unexpected return value of "
83 "function op_bits.\n");
84 tcg_abort();
85 }
86}
87
e590d4e6
AJ
88static TCGArg find_better_copy(TCGContext *s, TCGArg temp)
89{
90 TCGArg i;
91
92 /* If this is already a global, we can't do better. */
93 if (temp < s->nb_globals) {
94 return temp;
95 }
96
97 /* Search for a global first. */
98 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
99 if (i < s->nb_globals) {
100 return i;
101 }
102 }
103
104 /* If it is a temp, search for a temp local. */
105 if (!s->temps[temp].temp_local) {
106 for (i = temps[temp].next_copy ; i != temp ; i = temps[i].next_copy) {
107 if (s->temps[i].temp_local) {
108 return i;
109 }
110 }
111 }
112
113 /* Failure to find a better representation, return the same temp. */
114 return temp;
115}
116
117static bool temps_are_copies(TCGArg arg1, TCGArg arg2)
118{
119 TCGArg i;
120
121 if (arg1 == arg2) {
122 return true;
123 }
124
125 if (temps[arg1].state != TCG_TEMP_COPY
126 || temps[arg2].state != TCG_TEMP_COPY) {
127 return false;
128 }
129
130 for (i = temps[arg1].next_copy ; i != arg1 ; i = temps[i].next_copy) {
131 if (i == arg2) {
132 return true;
133 }
134 }
135
136 return false;
137}
138
b80bb016
AJ
139static void tcg_opt_gen_mov(TCGContext *s, TCGArg *gen_args,
140 TCGArg dst, TCGArg src)
22613af4 141{
e590d4e6
AJ
142 reset_temp(dst);
143 assert(temps[src].state != TCG_TEMP_CONST);
144
145 if (s->temps[src].type == s->temps[dst].type) {
146 if (temps[src].state != TCG_TEMP_COPY) {
147 temps[src].state = TCG_TEMP_COPY;
22613af4
KB
148 temps[src].next_copy = src;
149 temps[src].prev_copy = src;
150 }
151 temps[dst].state = TCG_TEMP_COPY;
22613af4
KB
152 temps[dst].next_copy = temps[src].next_copy;
153 temps[dst].prev_copy = src;
154 temps[temps[dst].next_copy].prev_copy = dst;
155 temps[src].next_copy = dst;
156 }
e590d4e6 157
22613af4
KB
158 gen_args[0] = dst;
159 gen_args[1] = src;
160}
161
e590d4e6 162static void tcg_opt_gen_movi(TCGArg *gen_args, TCGArg dst, TCGArg val)
22613af4 163{
e590d4e6 164 reset_temp(dst);
22613af4
KB
165 temps[dst].state = TCG_TEMP_CONST;
166 temps[dst].val = val;
167 gen_args[0] = dst;
168 gen_args[1] = val;
169}
170
fe0de7aa 171static TCGOpcode op_to_mov(TCGOpcode op)
53108fb5
KB
172{
173 switch (op_bits(op)) {
174 case 32:
175 return INDEX_op_mov_i32;
53108fb5
KB
176 case 64:
177 return INDEX_op_mov_i64;
53108fb5
KB
178 default:
179 fprintf(stderr, "op_to_mov: unexpected return value of "
180 "function op_bits.\n");
181 tcg_abort();
182 }
183}
184
fe0de7aa 185static TCGArg do_constant_folding_2(TCGOpcode op, TCGArg x, TCGArg y)
53108fb5
KB
186{
187 switch (op) {
188 CASE_OP_32_64(add):
189 return x + y;
190
191 CASE_OP_32_64(sub):
192 return x - y;
193
194 CASE_OP_32_64(mul):
195 return x * y;
196
9a81090b
KB
197 CASE_OP_32_64(and):
198 return x & y;
199
200 CASE_OP_32_64(or):
201 return x | y;
202
203 CASE_OP_32_64(xor):
204 return x ^ y;
205
55c0975c
KB
206 case INDEX_op_shl_i32:
207 return (uint32_t)x << (uint32_t)y;
208
55c0975c
KB
209 case INDEX_op_shl_i64:
210 return (uint64_t)x << (uint64_t)y;
55c0975c
KB
211
212 case INDEX_op_shr_i32:
213 return (uint32_t)x >> (uint32_t)y;
214
55c0975c
KB
215 case INDEX_op_shr_i64:
216 return (uint64_t)x >> (uint64_t)y;
55c0975c
KB
217
218 case INDEX_op_sar_i32:
219 return (int32_t)x >> (int32_t)y;
220
55c0975c
KB
221 case INDEX_op_sar_i64:
222 return (int64_t)x >> (int64_t)y;
55c0975c
KB
223
224 case INDEX_op_rotr_i32:
25c4d9cc 225 x = ((uint32_t)x << (32 - y)) | ((uint32_t)x >> y);
55c0975c
KB
226 return x;
227
55c0975c 228 case INDEX_op_rotr_i64:
25c4d9cc 229 x = ((uint64_t)x << (64 - y)) | ((uint64_t)x >> y);
55c0975c 230 return x;
55c0975c
KB
231
232 case INDEX_op_rotl_i32:
25c4d9cc 233 x = ((uint32_t)x << y) | ((uint32_t)x >> (32 - y));
55c0975c
KB
234 return x;
235
55c0975c 236 case INDEX_op_rotl_i64:
25c4d9cc 237 x = ((uint64_t)x << y) | ((uint64_t)x >> (64 - y));
55c0975c 238 return x;
25c4d9cc
RH
239
240 CASE_OP_32_64(not):
a640f031 241 return ~x;
25c4d9cc 242
cb25c80a
RH
243 CASE_OP_32_64(neg):
244 return -x;
245
246 CASE_OP_32_64(andc):
247 return x & ~y;
248
249 CASE_OP_32_64(orc):
250 return x | ~y;
251
252 CASE_OP_32_64(eqv):
253 return ~(x ^ y);
254
255 CASE_OP_32_64(nand):
256 return ~(x & y);
257
258 CASE_OP_32_64(nor):
259 return ~(x | y);
260
25c4d9cc 261 CASE_OP_32_64(ext8s):
a640f031 262 return (int8_t)x;
25c4d9cc
RH
263
264 CASE_OP_32_64(ext16s):
a640f031 265 return (int16_t)x;
25c4d9cc
RH
266
267 CASE_OP_32_64(ext8u):
a640f031 268 return (uint8_t)x;
25c4d9cc
RH
269
270 CASE_OP_32_64(ext16u):
a640f031
KB
271 return (uint16_t)x;
272
a640f031
KB
273 case INDEX_op_ext32s_i64:
274 return (int32_t)x;
275
276 case INDEX_op_ext32u_i64:
277 return (uint32_t)x;
a640f031 278
53108fb5
KB
279 default:
280 fprintf(stderr,
281 "Unrecognized operation %d in do_constant_folding.\n", op);
282 tcg_abort();
283 }
284}
285
fe0de7aa 286static TCGArg do_constant_folding(TCGOpcode op, TCGArg x, TCGArg y)
53108fb5
KB
287{
288 TCGArg res = do_constant_folding_2(op, x, y);
53108fb5
KB
289 if (op_bits(op) == 32) {
290 res &= 0xffffffff;
291 }
53108fb5
KB
292 return res;
293}
294
9519da7e
RH
295static bool do_constant_folding_cond_32(uint32_t x, uint32_t y, TCGCond c)
296{
297 switch (c) {
298 case TCG_COND_EQ:
299 return x == y;
300 case TCG_COND_NE:
301 return x != y;
302 case TCG_COND_LT:
303 return (int32_t)x < (int32_t)y;
304 case TCG_COND_GE:
305 return (int32_t)x >= (int32_t)y;
306 case TCG_COND_LE:
307 return (int32_t)x <= (int32_t)y;
308 case TCG_COND_GT:
309 return (int32_t)x > (int32_t)y;
310 case TCG_COND_LTU:
311 return x < y;
312 case TCG_COND_GEU:
313 return x >= y;
314 case TCG_COND_LEU:
315 return x <= y;
316 case TCG_COND_GTU:
317 return x > y;
318 default:
319 tcg_abort();
320 }
321}
322
323static bool do_constant_folding_cond_64(uint64_t x, uint64_t y, TCGCond c)
324{
325 switch (c) {
326 case TCG_COND_EQ:
327 return x == y;
328 case TCG_COND_NE:
329 return x != y;
330 case TCG_COND_LT:
331 return (int64_t)x < (int64_t)y;
332 case TCG_COND_GE:
333 return (int64_t)x >= (int64_t)y;
334 case TCG_COND_LE:
335 return (int64_t)x <= (int64_t)y;
336 case TCG_COND_GT:
337 return (int64_t)x > (int64_t)y;
338 case TCG_COND_LTU:
339 return x < y;
340 case TCG_COND_GEU:
341 return x >= y;
342 case TCG_COND_LEU:
343 return x <= y;
344 case TCG_COND_GTU:
345 return x > y;
346 default:
347 tcg_abort();
348 }
349}
350
351static bool do_constant_folding_cond_eq(TCGCond c)
352{
353 switch (c) {
354 case TCG_COND_GT:
355 case TCG_COND_LTU:
356 case TCG_COND_LT:
357 case TCG_COND_GTU:
358 case TCG_COND_NE:
359 return 0;
360 case TCG_COND_GE:
361 case TCG_COND_GEU:
362 case TCG_COND_LE:
363 case TCG_COND_LEU:
364 case TCG_COND_EQ:
365 return 1;
366 default:
367 tcg_abort();
368 }
369}
370
b336ceb6
AJ
371/* Return 2 if the condition can't be simplified, and the result
372 of the condition (0 or 1) if it can */
f8dd19e5
AJ
373static TCGArg do_constant_folding_cond(TCGOpcode op, TCGArg x,
374 TCGArg y, TCGCond c)
375{
b336ceb6
AJ
376 if (temps[x].state == TCG_TEMP_CONST && temps[y].state == TCG_TEMP_CONST) {
377 switch (op_bits(op)) {
378 case 32:
9519da7e 379 return do_constant_folding_cond_32(temps[x].val, temps[y].val, c);
b336ceb6 380 case 64:
9519da7e 381 return do_constant_folding_cond_64(temps[x].val, temps[y].val, c);
0aed257f 382 default:
9519da7e 383 tcg_abort();
b336ceb6 384 }
9519da7e
RH
385 } else if (temps_are_copies(x, y)) {
386 return do_constant_folding_cond_eq(c);
b336ceb6
AJ
387 } else if (temps[y].state == TCG_TEMP_CONST && temps[y].val == 0) {
388 switch (c) {
f8dd19e5 389 case TCG_COND_LTU:
b336ceb6 390 return 0;
f8dd19e5 391 case TCG_COND_GEU:
b336ceb6
AJ
392 return 1;
393 default:
394 return 2;
f8dd19e5 395 }
b336ceb6
AJ
396 } else {
397 return 2;
f8dd19e5 398 }
f8dd19e5
AJ
399}
400
24c9ae4e
RH
401static bool swap_commutative(TCGArg dest, TCGArg *p1, TCGArg *p2)
402{
403 TCGArg a1 = *p1, a2 = *p2;
404 int sum = 0;
405 sum += temps[a1].state == TCG_TEMP_CONST;
406 sum -= temps[a2].state == TCG_TEMP_CONST;
407
408 /* Prefer the constant in second argument, and then the form
409 op a, a, b, which is better handled on non-RISC hosts. */
410 if (sum > 0 || (sum == 0 && dest == a2)) {
411 *p1 = a2;
412 *p2 = a1;
413 return true;
414 }
415 return false;
416}
417
0bfcb865
RH
418static bool swap_commutative2(TCGArg *p1, TCGArg *p2)
419{
420 int sum = 0;
421 sum += temps[p1[0]].state == TCG_TEMP_CONST;
422 sum += temps[p1[1]].state == TCG_TEMP_CONST;
423 sum -= temps[p2[0]].state == TCG_TEMP_CONST;
424 sum -= temps[p2[1]].state == TCG_TEMP_CONST;
425 if (sum > 0) {
426 TCGArg t;
427 t = p1[0], p1[0] = p2[0], p2[0] = t;
428 t = p1[1], p1[1] = p2[1], p2[1] = t;
429 return true;
430 }
431 return false;
432}
433
22613af4 434/* Propagate constants and copies, fold constant expressions. */
8f2e8c07
KB
435static TCGArg *tcg_constant_folding(TCGContext *s, uint16_t *tcg_opc_ptr,
436 TCGArg *args, TCGOpDef *tcg_op_defs)
437{
fe0de7aa
BS
438 int i, nb_ops, op_index, nb_temps, nb_globals, nb_call_args;
439 TCGOpcode op;
8f2e8c07
KB
440 const TCGOpDef *def;
441 TCGArg *gen_args;
53108fb5 442 TCGArg tmp;
5d8f5363 443
22613af4
KB
444 /* Array VALS has an element for each temp.
445 If this temp holds a constant then its value is kept in VALS' element.
e590d4e6
AJ
446 If this temp is a copy of other ones then the other copies are
447 available through the doubly linked circular list. */
8f2e8c07
KB
448
449 nb_temps = s->nb_temps;
450 nb_globals = s->nb_globals;
22613af4 451 memset(temps, 0, nb_temps * sizeof(struct tcg_temp_info));
8f2e8c07
KB
452
453 nb_ops = tcg_opc_ptr - gen_opc_buf;
454 gen_args = args;
455 for (op_index = 0; op_index < nb_ops; op_index++) {
456 op = gen_opc_buf[op_index];
457 def = &tcg_op_defs[op];
22613af4 458 /* Do copy propagation */
1ff8c541
AJ
459 if (op == INDEX_op_call) {
460 int nb_oargs = args[0] >> 16;
461 int nb_iargs = args[0] & 0xffff;
462 for (i = nb_oargs + 1; i < nb_oargs + nb_iargs + 1; i++) {
463 if (temps[args[i]].state == TCG_TEMP_COPY) {
464 args[i] = find_better_copy(s, args[i]);
465 }
466 }
467 } else {
22613af4
KB
468 for (i = def->nb_oargs; i < def->nb_oargs + def->nb_iargs; i++) {
469 if (temps[args[i]].state == TCG_TEMP_COPY) {
e590d4e6 470 args[i] = find_better_copy(s, args[i]);
22613af4
KB
471 }
472 }
473 }
474
53108fb5
KB
475 /* For commutative operations make constant second argument */
476 switch (op) {
477 CASE_OP_32_64(add):
478 CASE_OP_32_64(mul):
9a81090b
KB
479 CASE_OP_32_64(and):
480 CASE_OP_32_64(or):
481 CASE_OP_32_64(xor):
cb25c80a
RH
482 CASE_OP_32_64(eqv):
483 CASE_OP_32_64(nand):
484 CASE_OP_32_64(nor):
24c9ae4e 485 swap_commutative(args[0], &args[1], &args[2]);
53108fb5 486 break;
65a7cce1 487 CASE_OP_32_64(brcond):
24c9ae4e 488 if (swap_commutative(-1, &args[0], &args[1])) {
65a7cce1
AJ
489 args[2] = tcg_swap_cond(args[2]);
490 }
491 break;
492 CASE_OP_32_64(setcond):
24c9ae4e 493 if (swap_commutative(args[0], &args[1], &args[2])) {
65a7cce1
AJ
494 args[3] = tcg_swap_cond(args[3]);
495 }
496 break;
fa01a208 497 CASE_OP_32_64(movcond):
24c9ae4e
RH
498 if (swap_commutative(-1, &args[1], &args[2])) {
499 args[5] = tcg_swap_cond(args[5]);
5d8f5363
RH
500 }
501 /* For movcond, we canonicalize the "false" input reg to match
502 the destination reg so that the tcg backend can implement
503 a "move if true" operation. */
24c9ae4e
RH
504 if (swap_commutative(args[0], &args[4], &args[3])) {
505 args[5] = tcg_invert_cond(args[5]);
fa01a208 506 }
1e484e61
RH
507 break;
508 case INDEX_op_add2_i32:
509 swap_commutative(args[0], &args[2], &args[4]);
510 swap_commutative(args[1], &args[3], &args[5]);
511 break;
0bfcb865
RH
512 case INDEX_op_brcond2_i32:
513 if (swap_commutative2(&args[0], &args[2])) {
514 args[4] = tcg_swap_cond(args[4]);
515 }
516 break;
517 case INDEX_op_setcond2_i32:
518 if (swap_commutative2(&args[1], &args[3])) {
519 args[5] = tcg_swap_cond(args[5]);
520 }
521 break;
53108fb5
KB
522 default:
523 break;
524 }
525
01ee5282
AJ
526 /* Simplify expressions for "shift/rot r, 0, a => movi r, 0" */
527 switch (op) {
528 CASE_OP_32_64(shl):
529 CASE_OP_32_64(shr):
530 CASE_OP_32_64(sar):
531 CASE_OP_32_64(rotl):
532 CASE_OP_32_64(rotr):
533 if (temps[args[1]].state == TCG_TEMP_CONST
534 && temps[args[1]].val == 0) {
535 gen_opc_buf[op_index] = op_to_movi(op);
e590d4e6 536 tcg_opt_gen_movi(gen_args, args[0], 0);
01ee5282
AJ
537 args += 3;
538 gen_args += 2;
539 continue;
540 }
541 break;
542 default:
543 break;
544 }
545
56e49438 546 /* Simplify expression for "op r, a, 0 => mov r, a" cases */
53108fb5
KB
547 switch (op) {
548 CASE_OP_32_64(add):
549 CASE_OP_32_64(sub):
55c0975c
KB
550 CASE_OP_32_64(shl):
551 CASE_OP_32_64(shr):
552 CASE_OP_32_64(sar):
25c4d9cc
RH
553 CASE_OP_32_64(rotl):
554 CASE_OP_32_64(rotr):
38ee188b
AJ
555 CASE_OP_32_64(or):
556 CASE_OP_32_64(xor):
53108fb5
KB
557 if (temps[args[1]].state == TCG_TEMP_CONST) {
558 /* Proceed with possible constant folding. */
559 break;
560 }
561 if (temps[args[2]].state == TCG_TEMP_CONST
562 && temps[args[2]].val == 0) {
e590d4e6 563 if (temps_are_copies(args[0], args[1])) {
53108fb5
KB
564 gen_opc_buf[op_index] = INDEX_op_nop;
565 } else {
566 gen_opc_buf[op_index] = op_to_mov(op);
b80bb016 567 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
53108fb5 568 gen_args += 2;
53108fb5 569 }
fedc0da2 570 args += 3;
53108fb5
KB
571 continue;
572 }
573 break;
56e49438
AJ
574 default:
575 break;
576 }
577
578 /* Simplify expression for "op r, a, 0 => movi r, 0" cases */
579 switch (op) {
61251c0c 580 CASE_OP_32_64(and):
53108fb5
KB
581 CASE_OP_32_64(mul):
582 if ((temps[args[2]].state == TCG_TEMP_CONST
583 && temps[args[2]].val == 0)) {
584 gen_opc_buf[op_index] = op_to_movi(op);
e590d4e6 585 tcg_opt_gen_movi(gen_args, args[0], 0);
53108fb5
KB
586 args += 3;
587 gen_args += 2;
588 continue;
589 }
590 break;
56e49438
AJ
591 default:
592 break;
593 }
594
595 /* Simplify expression for "op r, a, a => mov r, a" cases */
596 switch (op) {
9a81090b
KB
597 CASE_OP_32_64(or):
598 CASE_OP_32_64(and):
0aba1c73 599 if (temps_are_copies(args[1], args[2])) {
e590d4e6 600 if (temps_are_copies(args[0], args[1])) {
9a81090b
KB
601 gen_opc_buf[op_index] = INDEX_op_nop;
602 } else {
603 gen_opc_buf[op_index] = op_to_mov(op);
b80bb016 604 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
9a81090b 605 gen_args += 2;
9a81090b 606 }
fedc0da2 607 args += 3;
9a81090b
KB
608 continue;
609 }
610 break;
fe0de7aa
BS
611 default:
612 break;
53108fb5
KB
613 }
614
3c94193e
AJ
615 /* Simplify expression for "op r, a, a => movi r, 0" cases */
616 switch (op) {
617 CASE_OP_32_64(sub):
618 CASE_OP_32_64(xor):
619 if (temps_are_copies(args[1], args[2])) {
620 gen_opc_buf[op_index] = op_to_movi(op);
621 tcg_opt_gen_movi(gen_args, args[0], 0);
622 gen_args += 2;
623 args += 3;
624 continue;
625 }
626 break;
627 default:
628 break;
629 }
630
22613af4
KB
631 /* Propagate constants through copy operations and do constant
632 folding. Constants will be substituted to arguments by register
633 allocator where needed and possible. Also detect copies. */
8f2e8c07 634 switch (op) {
22613af4 635 CASE_OP_32_64(mov):
e590d4e6 636 if (temps_are_copies(args[0], args[1])) {
22613af4
KB
637 args += 2;
638 gen_opc_buf[op_index] = INDEX_op_nop;
639 break;
640 }
641 if (temps[args[1]].state != TCG_TEMP_CONST) {
b80bb016 642 tcg_opt_gen_mov(s, gen_args, args[0], args[1]);
22613af4
KB
643 gen_args += 2;
644 args += 2;
645 break;
646 }
647 /* Source argument is constant. Rewrite the operation and
648 let movi case handle it. */
649 op = op_to_movi(op);
650 gen_opc_buf[op_index] = op;
651 args[1] = temps[args[1]].val;
652 /* fallthrough */
653 CASE_OP_32_64(movi):
e590d4e6 654 tcg_opt_gen_movi(gen_args, args[0], args[1]);
22613af4
KB
655 gen_args += 2;
656 args += 2;
657 break;
6e14e91b 658
a640f031 659 CASE_OP_32_64(not):
cb25c80a 660 CASE_OP_32_64(neg):
25c4d9cc
RH
661 CASE_OP_32_64(ext8s):
662 CASE_OP_32_64(ext8u):
663 CASE_OP_32_64(ext16s):
664 CASE_OP_32_64(ext16u):
a640f031
KB
665 case INDEX_op_ext32s_i64:
666 case INDEX_op_ext32u_i64:
a640f031
KB
667 if (temps[args[1]].state == TCG_TEMP_CONST) {
668 gen_opc_buf[op_index] = op_to_movi(op);
669 tmp = do_constant_folding(op, temps[args[1]].val, 0);
e590d4e6 670 tcg_opt_gen_movi(gen_args, args[0], tmp);
6e14e91b
RH
671 gen_args += 2;
672 args += 2;
673 break;
a640f031 674 }
6e14e91b
RH
675 goto do_default;
676
53108fb5
KB
677 CASE_OP_32_64(add):
678 CASE_OP_32_64(sub):
679 CASE_OP_32_64(mul):
9a81090b
KB
680 CASE_OP_32_64(or):
681 CASE_OP_32_64(and):
682 CASE_OP_32_64(xor):
55c0975c
KB
683 CASE_OP_32_64(shl):
684 CASE_OP_32_64(shr):
685 CASE_OP_32_64(sar):
25c4d9cc
RH
686 CASE_OP_32_64(rotl):
687 CASE_OP_32_64(rotr):
cb25c80a
RH
688 CASE_OP_32_64(andc):
689 CASE_OP_32_64(orc):
690 CASE_OP_32_64(eqv):
691 CASE_OP_32_64(nand):
692 CASE_OP_32_64(nor):
53108fb5
KB
693 if (temps[args[1]].state == TCG_TEMP_CONST
694 && temps[args[2]].state == TCG_TEMP_CONST) {
695 gen_opc_buf[op_index] = op_to_movi(op);
696 tmp = do_constant_folding(op, temps[args[1]].val,
697 temps[args[2]].val);
e590d4e6 698 tcg_opt_gen_movi(gen_args, args[0], tmp);
53108fb5 699 gen_args += 2;
6e14e91b
RH
700 args += 3;
701 break;
53108fb5 702 }
6e14e91b
RH
703 goto do_default;
704
7ef55fc9
AJ
705 CASE_OP_32_64(deposit):
706 if (temps[args[1]].state == TCG_TEMP_CONST
707 && temps[args[2]].state == TCG_TEMP_CONST) {
708 gen_opc_buf[op_index] = op_to_movi(op);
709 tmp = ((1ull << args[4]) - 1);
710 tmp = (temps[args[1]].val & ~(tmp << args[3]))
711 | ((temps[args[2]].val & tmp) << args[3]);
712 tcg_opt_gen_movi(gen_args, args[0], tmp);
713 gen_args += 2;
6e14e91b
RH
714 args += 5;
715 break;
7ef55fc9 716 }
6e14e91b
RH
717 goto do_default;
718
f8dd19e5 719 CASE_OP_32_64(setcond):
b336ceb6
AJ
720 tmp = do_constant_folding_cond(op, args[1], args[2], args[3]);
721 if (tmp != 2) {
f8dd19e5 722 gen_opc_buf[op_index] = op_to_movi(op);
e590d4e6 723 tcg_opt_gen_movi(gen_args, args[0], tmp);
f8dd19e5 724 gen_args += 2;
6e14e91b
RH
725 args += 4;
726 break;
f8dd19e5 727 }
6e14e91b
RH
728 goto do_default;
729
fbeaa26c 730 CASE_OP_32_64(brcond):
b336ceb6
AJ
731 tmp = do_constant_folding_cond(op, args[0], args[1], args[2]);
732 if (tmp != 2) {
733 if (tmp) {
fbeaa26c
AJ
734 memset(temps, 0, nb_temps * sizeof(struct tcg_temp_info));
735 gen_opc_buf[op_index] = INDEX_op_br;
736 gen_args[0] = args[3];
737 gen_args += 1;
fbeaa26c
AJ
738 } else {
739 gen_opc_buf[op_index] = INDEX_op_nop;
fbeaa26c 740 }
6e14e91b
RH
741 args += 4;
742 break;
fbeaa26c 743 }
6e14e91b
RH
744 goto do_default;
745
fa01a208 746 CASE_OP_32_64(movcond):
b336ceb6
AJ
747 tmp = do_constant_folding_cond(op, args[1], args[2], args[5]);
748 if (tmp != 2) {
e590d4e6 749 if (temps_are_copies(args[0], args[4-tmp])) {
fa01a208
RH
750 gen_opc_buf[op_index] = INDEX_op_nop;
751 } else if (temps[args[4-tmp]].state == TCG_TEMP_CONST) {
752 gen_opc_buf[op_index] = op_to_movi(op);
e590d4e6 753 tcg_opt_gen_movi(gen_args, args[0], temps[args[4-tmp]].val);
fa01a208
RH
754 gen_args += 2;
755 } else {
756 gen_opc_buf[op_index] = op_to_mov(op);
e590d4e6 757 tcg_opt_gen_mov(s, gen_args, args[0], args[4-tmp]);
fa01a208
RH
758 gen_args += 2;
759 }
6e14e91b
RH
760 args += 6;
761 break;
fa01a208 762 }
6e14e91b
RH
763 goto do_default;
764
bc1473ef
RH
765 case INDEX_op_brcond2_i32:
766 /* Simplify LT/GE comparisons vs zero to a single compare
767 vs the high word of the input. */
768 if ((args[4] == TCG_COND_LT || args[4] == TCG_COND_GE)
769 && temps[args[2]].state == TCG_TEMP_CONST
770 && temps[args[3]].state == TCG_TEMP_CONST
771 && temps[args[2]].val == 0
772 && temps[args[3]].val == 0) {
773 gen_opc_buf[op_index] = INDEX_op_brcond_i32;
774 gen_args[0] = args[1];
775 gen_args[1] = args[3];
776 gen_args[2] = args[4];
777 gen_args[3] = args[5];
778 gen_args += 4;
779 args += 6;
780 memset(temps, 0, nb_temps * sizeof(struct tcg_temp_info));
781 break;
782 }
783 goto do_default;
784
785 case INDEX_op_setcond2_i32:
786 /* Simplify LT/GE comparisons vs zero to a single compare
787 vs the high word of the input. */
788 if ((args[5] == TCG_COND_LT || args[5] == TCG_COND_GE)
789 && temps[args[3]].state == TCG_TEMP_CONST
790 && temps[args[4]].state == TCG_TEMP_CONST
791 && temps[args[3]].val == 0
792 && temps[args[4]].val == 0) {
793 gen_opc_buf[op_index] = INDEX_op_setcond_i32;
794 gen_args[0] = args[0];
795 gen_args[1] = args[2];
796 gen_args[2] = args[4];
797 gen_args[3] = args[5];
798 gen_args += 4;
799 args += 6;
800 break;
801 }
802 goto do_default;
803
8f2e8c07 804 case INDEX_op_call:
22613af4
KB
805 nb_call_args = (args[0] >> 16) + (args[0] & 0xffff);
806 if (!(args[nb_call_args + 1] & (TCG_CALL_CONST | TCG_CALL_PURE))) {
807 for (i = 0; i < nb_globals; i++) {
e590d4e6 808 reset_temp(i);
22613af4
KB
809 }
810 }
811 for (i = 0; i < (args[0] >> 16); i++) {
e590d4e6 812 reset_temp(args[i + 1]);
22613af4
KB
813 }
814 i = nb_call_args + 3;
8f2e8c07
KB
815 while (i) {
816 *gen_args = *args;
817 args++;
818 gen_args++;
819 i--;
820 }
821 break;
6e14e91b 822
8f2e8c07 823 default:
6e14e91b
RH
824 do_default:
825 /* Default case: we know nothing about operation (or were unable
826 to compute the operation result) so no propagation is done.
827 We trash everything if the operation is the end of a basic
828 block, otherwise we only trash the output args. */
a2550660
AJ
829 if (def->flags & TCG_OPF_BB_END) {
830 memset(temps, 0, nb_temps * sizeof(struct tcg_temp_info));
831 } else {
832 for (i = 0; i < def->nb_oargs; i++) {
e590d4e6 833 reset_temp(args[i]);
a2550660 834 }
22613af4 835 }
8f2e8c07
KB
836 for (i = 0; i < def->nb_args; i++) {
837 gen_args[i] = args[i];
838 }
839 args += def->nb_args;
840 gen_args += def->nb_args;
841 break;
842 }
843 }
844
845 return gen_args;
846}
847
848TCGArg *tcg_optimize(TCGContext *s, uint16_t *tcg_opc_ptr,
849 TCGArg *args, TCGOpDef *tcg_op_defs)
850{
851 TCGArg *res;
852 res = tcg_constant_folding(s, tcg_opc_ptr, args, tcg_op_defs);
853 return res;
854}