]> Git Repo - qemu.git/blame - tcg/tcg.c
tcg: Improve register allocation for matching constraints
[qemu.git] / tcg / tcg.c
CommitLineData
c896fe29
FB
1/*
2 * Tiny Code Generator for QEMU
3 *
4 * Copyright (c) 2008 Fabrice Bellard
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
22 * THE SOFTWARE.
23 */
24
c896fe29 25/* define it to use liveness analysis (better code) */
8f2e8c07 26#define USE_TCG_OPTIMIZATIONS
c896fe29 27
757e725b 28#include "qemu/osdep.h"
cca82982 29
813da627
RH
30/* Define to jump the ELF file used to communicate with GDB. */
31#undef DEBUG_JIT
32
72fd2efb 33#include "qemu/error-report.h"
f348b6d1 34#include "qemu/cutils.h"
1de7afc9
PB
35#include "qemu/host-utils.h"
36#include "qemu/timer.h"
c896fe29 37
c5d3c498 38/* Note: the long term plan is to reduce the dependencies on the QEMU
c896fe29
FB
39 CPU definitions. Currently they are used for qemu_ld/st
40 instructions */
41#define NO_CPU_IO_DEFS
42#include "cpu.h"
c896fe29 43
63c91552
PB
44#include "exec/cpu-common.h"
45#include "exec/exec-all.h"
46
c896fe29 47#include "tcg-op.h"
813da627 48
edee2579 49#if UINTPTR_MAX == UINT32_MAX
813da627 50# define ELF_CLASS ELFCLASS32
edee2579
RH
51#else
52# define ELF_CLASS ELFCLASS64
813da627
RH
53#endif
54#ifdef HOST_WORDS_BIGENDIAN
55# define ELF_DATA ELFDATA2MSB
56#else
57# define ELF_DATA ELFDATA2LSB
58#endif
59
c896fe29 60#include "elf.h"
508127e2 61#include "exec/log.h"
3468b59e 62#include "sysemu/sysemu.h"
c896fe29 63
ce151109
PM
64/* Forward declarations for functions declared in tcg-target.inc.c and
65 used here. */
e4d58b41 66static void tcg_target_init(TCGContext *s);
f69d277e 67static const TCGTargetOpDef *tcg_target_op_def(TCGOpcode);
e4d58b41 68static void tcg_target_qemu_prologue(TCGContext *s);
6ac17786 69static bool patch_reloc(tcg_insn_unit *code_ptr, int type,
2ba7fae2 70 intptr_t value, intptr_t addend);
c896fe29 71
497a22eb
RH
72/* The CIE and FDE header definitions will be common to all hosts. */
73typedef struct {
74 uint32_t len __attribute__((aligned((sizeof(void *)))));
75 uint32_t id;
76 uint8_t version;
77 char augmentation[1];
78 uint8_t code_align;
79 uint8_t data_align;
80 uint8_t return_column;
81} DebugFrameCIE;
82
83typedef struct QEMU_PACKED {
84 uint32_t len __attribute__((aligned((sizeof(void *)))));
85 uint32_t cie_offset;
edee2579
RH
86 uintptr_t func_start;
87 uintptr_t func_len;
497a22eb
RH
88} DebugFrameFDEHeader;
89
2c90784a
RH
90typedef struct QEMU_PACKED {
91 DebugFrameCIE cie;
92 DebugFrameFDEHeader fde;
93} DebugFrameHeader;
94
813da627 95static void tcg_register_jit_int(void *buf, size_t size,
2c90784a
RH
96 const void *debug_frame,
97 size_t debug_frame_size)
813da627
RH
98 __attribute__((unused));
99
ce151109 100/* Forward declarations for functions declared and used in tcg-target.inc.c. */
069ea736
RH
101static const char *target_parse_constraint(TCGArgConstraint *ct,
102 const char *ct_str, TCGType type);
2a534aff 103static void tcg_out_ld(TCGContext *s, TCGType type, TCGReg ret, TCGReg arg1,
a05b5b9b 104 intptr_t arg2);
2a534aff 105static void tcg_out_mov(TCGContext *s, TCGType type, TCGReg ret, TCGReg arg);
c0ad3001 106static void tcg_out_movi(TCGContext *s, TCGType type,
2a534aff 107 TCGReg ret, tcg_target_long arg);
c0ad3001
SW
108static void tcg_out_op(TCGContext *s, TCGOpcode opc, const TCGArg *args,
109 const int *const_args);
d2fd745f
RH
110#if TCG_TARGET_MAYBE_vec
111static void tcg_out_vec_op(TCGContext *s, TCGOpcode opc, unsigned vecl,
112 unsigned vece, const TCGArg *args,
113 const int *const_args);
114#else
115static inline void tcg_out_vec_op(TCGContext *s, TCGOpcode opc, unsigned vecl,
116 unsigned vece, const TCGArg *args,
117 const int *const_args)
118{
119 g_assert_not_reached();
120}
121#endif
2a534aff 122static void tcg_out_st(TCGContext *s, TCGType type, TCGReg arg, TCGReg arg1,
a05b5b9b 123 intptr_t arg2);
59d7c14e
RH
124static bool tcg_out_sti(TCGContext *s, TCGType type, TCGArg val,
125 TCGReg base, intptr_t ofs);
cf066674 126static void tcg_out_call(TCGContext *s, tcg_insn_unit *target);
f6c6afc1 127static int tcg_target_const_match(tcg_target_long val, TCGType type,
c0ad3001 128 const TCGArgConstraint *arg_ct);
659ef5cb
RH
129#ifdef TCG_TARGET_NEED_LDST_LABELS
130static bool tcg_out_ldst_finalize(TCGContext *s);
131#endif
c896fe29 132
a505785c
EC
133#define TCG_HIGHWATER 1024
134
df2cce29
EC
135static TCGContext **tcg_ctxs;
136static unsigned int n_tcg_ctxs;
1c2adb95 137TCGv_env cpu_env = 0;
df2cce29 138
be2cdc5e
EC
139struct tcg_region_tree {
140 QemuMutex lock;
141 GTree *tree;
142 /* padding to avoid false sharing is computed at run-time */
143};
144
e8feb96f
EC
145/*
146 * We divide code_gen_buffer into equally-sized "regions" that TCG threads
147 * dynamically allocate from as demand dictates. Given appropriate region
148 * sizing, this minimizes flushes even when some TCG threads generate a lot
149 * more code than others.
150 */
151struct tcg_region_state {
152 QemuMutex lock;
153
154 /* fields set at init time */
155 void *start;
156 void *start_aligned;
157 void *end;
158 size_t n;
159 size_t size; /* size of one region */
160 size_t stride; /* .size + guard size */
161
162 /* fields protected by the lock */
163 size_t current; /* current region index */
164 size_t agg_size_full; /* aggregate size of full regions */
165};
166
167static struct tcg_region_state region;
be2cdc5e
EC
168/*
169 * This is an array of struct tcg_region_tree's, with padding.
170 * We use void * to simplify the computation of region_trees[i]; each
171 * struct is found every tree_size bytes.
172 */
173static void *region_trees;
174static size_t tree_size;
d2fd745f 175static TCGRegSet tcg_target_available_regs[TCG_TYPE_COUNT];
b1d8e52e 176static TCGRegSet tcg_target_call_clobber_regs;
c896fe29 177
1813e175 178#if TCG_TARGET_INSN_UNIT_SIZE == 1
4196dca6 179static __attribute__((unused)) inline void tcg_out8(TCGContext *s, uint8_t v)
c896fe29
FB
180{
181 *s->code_ptr++ = v;
182}
183
4196dca6
PM
184static __attribute__((unused)) inline void tcg_patch8(tcg_insn_unit *p,
185 uint8_t v)
5c53bb81 186{
1813e175 187 *p = v;
5c53bb81 188}
1813e175 189#endif
5c53bb81 190
1813e175 191#if TCG_TARGET_INSN_UNIT_SIZE <= 2
4196dca6 192static __attribute__((unused)) inline void tcg_out16(TCGContext *s, uint16_t v)
c896fe29 193{
1813e175
RH
194 if (TCG_TARGET_INSN_UNIT_SIZE == 2) {
195 *s->code_ptr++ = v;
196 } else {
197 tcg_insn_unit *p = s->code_ptr;
198 memcpy(p, &v, sizeof(v));
199 s->code_ptr = p + (2 / TCG_TARGET_INSN_UNIT_SIZE);
200 }
c896fe29
FB
201}
202
4196dca6
PM
203static __attribute__((unused)) inline void tcg_patch16(tcg_insn_unit *p,
204 uint16_t v)
5c53bb81 205{
1813e175
RH
206 if (TCG_TARGET_INSN_UNIT_SIZE == 2) {
207 *p = v;
208 } else {
209 memcpy(p, &v, sizeof(v));
210 }
5c53bb81 211}
1813e175 212#endif
5c53bb81 213
1813e175 214#if TCG_TARGET_INSN_UNIT_SIZE <= 4
4196dca6 215static __attribute__((unused)) inline void tcg_out32(TCGContext *s, uint32_t v)
c896fe29 216{
1813e175
RH
217 if (TCG_TARGET_INSN_UNIT_SIZE == 4) {
218 *s->code_ptr++ = v;
219 } else {
220 tcg_insn_unit *p = s->code_ptr;
221 memcpy(p, &v, sizeof(v));
222 s->code_ptr = p + (4 / TCG_TARGET_INSN_UNIT_SIZE);
223 }
c896fe29
FB
224}
225
4196dca6
PM
226static __attribute__((unused)) inline void tcg_patch32(tcg_insn_unit *p,
227 uint32_t v)
5c53bb81 228{
1813e175
RH
229 if (TCG_TARGET_INSN_UNIT_SIZE == 4) {
230 *p = v;
231 } else {
232 memcpy(p, &v, sizeof(v));
233 }
5c53bb81 234}
1813e175 235#endif
5c53bb81 236
1813e175 237#if TCG_TARGET_INSN_UNIT_SIZE <= 8
4196dca6 238static __attribute__((unused)) inline void tcg_out64(TCGContext *s, uint64_t v)
ac26eb69 239{
1813e175
RH
240 if (TCG_TARGET_INSN_UNIT_SIZE == 8) {
241 *s->code_ptr++ = v;
242 } else {
243 tcg_insn_unit *p = s->code_ptr;
244 memcpy(p, &v, sizeof(v));
245 s->code_ptr = p + (8 / TCG_TARGET_INSN_UNIT_SIZE);
246 }
ac26eb69
RH
247}
248
4196dca6
PM
249static __attribute__((unused)) inline void tcg_patch64(tcg_insn_unit *p,
250 uint64_t v)
5c53bb81 251{
1813e175
RH
252 if (TCG_TARGET_INSN_UNIT_SIZE == 8) {
253 *p = v;
254 } else {
255 memcpy(p, &v, sizeof(v));
256 }
5c53bb81 257}
1813e175 258#endif
5c53bb81 259
c896fe29
FB
260/* label relocation processing */
261
1813e175 262static void tcg_out_reloc(TCGContext *s, tcg_insn_unit *code_ptr, int type,
bec16311 263 TCGLabel *l, intptr_t addend)
c896fe29 264{
c896fe29
FB
265 TCGRelocation *r;
266
c896fe29 267 if (l->has_value) {
623e265c
PB
268 /* FIXME: This may break relocations on RISC targets that
269 modify instruction fields in place. The caller may not have
270 written the initial value. */
6ac17786
RH
271 bool ok = patch_reloc(code_ptr, type, l->u.value, addend);
272 tcg_debug_assert(ok);
c896fe29
FB
273 } else {
274 /* add a new relocation entry */
275 r = tcg_malloc(sizeof(TCGRelocation));
276 r->type = type;
277 r->ptr = code_ptr;
278 r->addend = addend;
279 r->next = l->u.first_reloc;
280 l->u.first_reloc = r;
281 }
282}
283
bec16311 284static void tcg_out_label(TCGContext *s, TCGLabel *l, tcg_insn_unit *ptr)
c896fe29 285{
2ba7fae2 286 intptr_t value = (intptr_t)ptr;
1813e175 287 TCGRelocation *r;
c896fe29 288
eabb7b91 289 tcg_debug_assert(!l->has_value);
1813e175
RH
290
291 for (r = l->u.first_reloc; r != NULL; r = r->next) {
6ac17786
RH
292 bool ok = patch_reloc(r->ptr, r->type, value, r->addend);
293 tcg_debug_assert(ok);
c896fe29 294 }
1813e175 295
c896fe29 296 l->has_value = 1;
1813e175 297 l->u.value_ptr = ptr;
c896fe29
FB
298}
299
42a268c2 300TCGLabel *gen_new_label(void)
c896fe29 301{
b1311c4a 302 TCGContext *s = tcg_ctx;
51e3972c 303 TCGLabel *l = tcg_malloc(sizeof(TCGLabel));
c896fe29 304
51e3972c
RH
305 *l = (TCGLabel){
306 .id = s->nb_labels++
307 };
42a268c2
RH
308
309 return l;
c896fe29
FB
310}
311
9f754620
RH
312static void set_jmp_reset_offset(TCGContext *s, int which)
313{
314 size_t off = tcg_current_code_size(s);
315 s->tb_jmp_reset_offset[which] = off;
316 /* Make sure that we didn't overflow the stored offset. */
317 assert(s->tb_jmp_reset_offset[which] == off);
318}
319
ce151109 320#include "tcg-target.inc.c"
c896fe29 321
be2cdc5e
EC
322/* compare a pointer @ptr and a tb_tc @s */
323static int ptr_cmp_tb_tc(const void *ptr, const struct tb_tc *s)
324{
325 if (ptr >= s->ptr + s->size) {
326 return 1;
327 } else if (ptr < s->ptr) {
328 return -1;
329 }
330 return 0;
331}
332
333static gint tb_tc_cmp(gconstpointer ap, gconstpointer bp)
334{
335 const struct tb_tc *a = ap;
336 const struct tb_tc *b = bp;
337
338 /*
339 * When both sizes are set, we know this isn't a lookup.
340 * This is the most likely case: every TB must be inserted; lookups
341 * are a lot less frequent.
342 */
343 if (likely(a->size && b->size)) {
344 if (a->ptr > b->ptr) {
345 return 1;
346 } else if (a->ptr < b->ptr) {
347 return -1;
348 }
349 /* a->ptr == b->ptr should happen only on deletions */
350 g_assert(a->size == b->size);
351 return 0;
352 }
353 /*
354 * All lookups have either .size field set to 0.
355 * From the glib sources we see that @ap is always the lookup key. However
356 * the docs provide no guarantee, so we just mark this case as likely.
357 */
358 if (likely(a->size == 0)) {
359 return ptr_cmp_tb_tc(a->ptr, b);
360 }
361 return ptr_cmp_tb_tc(b->ptr, a);
362}
363
364static void tcg_region_trees_init(void)
365{
366 size_t i;
367
368 tree_size = ROUND_UP(sizeof(struct tcg_region_tree), qemu_dcache_linesize);
369 region_trees = qemu_memalign(qemu_dcache_linesize, region.n * tree_size);
370 for (i = 0; i < region.n; i++) {
371 struct tcg_region_tree *rt = region_trees + i * tree_size;
372
373 qemu_mutex_init(&rt->lock);
374 rt->tree = g_tree_new(tb_tc_cmp);
375 }
376}
377
378static struct tcg_region_tree *tc_ptr_to_region_tree(void *p)
379{
380 size_t region_idx;
381
382 if (p < region.start_aligned) {
383 region_idx = 0;
384 } else {
385 ptrdiff_t offset = p - region.start_aligned;
386
387 if (offset > region.stride * (region.n - 1)) {
388 region_idx = region.n - 1;
389 } else {
390 region_idx = offset / region.stride;
391 }
392 }
393 return region_trees + region_idx * tree_size;
394}
395
396void tcg_tb_insert(TranslationBlock *tb)
397{
398 struct tcg_region_tree *rt = tc_ptr_to_region_tree(tb->tc.ptr);
399
400 qemu_mutex_lock(&rt->lock);
401 g_tree_insert(rt->tree, &tb->tc, tb);
402 qemu_mutex_unlock(&rt->lock);
403}
404
405void tcg_tb_remove(TranslationBlock *tb)
406{
407 struct tcg_region_tree *rt = tc_ptr_to_region_tree(tb->tc.ptr);
408
409 qemu_mutex_lock(&rt->lock);
410 g_tree_remove(rt->tree, &tb->tc);
411 qemu_mutex_unlock(&rt->lock);
412}
413
414/*
415 * Find the TB 'tb' such that
416 * tb->tc.ptr <= tc_ptr < tb->tc.ptr + tb->tc.size
417 * Return NULL if not found.
418 */
419TranslationBlock *tcg_tb_lookup(uintptr_t tc_ptr)
420{
421 struct tcg_region_tree *rt = tc_ptr_to_region_tree((void *)tc_ptr);
422 TranslationBlock *tb;
423 struct tb_tc s = { .ptr = (void *)tc_ptr };
424
425 qemu_mutex_lock(&rt->lock);
426 tb = g_tree_lookup(rt->tree, &s);
427 qemu_mutex_unlock(&rt->lock);
428 return tb;
429}
430
431static void tcg_region_tree_lock_all(void)
432{
433 size_t i;
434
435 for (i = 0; i < region.n; i++) {
436 struct tcg_region_tree *rt = region_trees + i * tree_size;
437
438 qemu_mutex_lock(&rt->lock);
439 }
440}
441
442static void tcg_region_tree_unlock_all(void)
443{
444 size_t i;
445
446 for (i = 0; i < region.n; i++) {
447 struct tcg_region_tree *rt = region_trees + i * tree_size;
448
449 qemu_mutex_unlock(&rt->lock);
450 }
451}
452
453void tcg_tb_foreach(GTraverseFunc func, gpointer user_data)
454{
455 size_t i;
456
457 tcg_region_tree_lock_all();
458 for (i = 0; i < region.n; i++) {
459 struct tcg_region_tree *rt = region_trees + i * tree_size;
460
461 g_tree_foreach(rt->tree, func, user_data);
462 }
463 tcg_region_tree_unlock_all();
464}
465
466size_t tcg_nb_tbs(void)
467{
468 size_t nb_tbs = 0;
469 size_t i;
470
471 tcg_region_tree_lock_all();
472 for (i = 0; i < region.n; i++) {
473 struct tcg_region_tree *rt = region_trees + i * tree_size;
474
475 nb_tbs += g_tree_nnodes(rt->tree);
476 }
477 tcg_region_tree_unlock_all();
478 return nb_tbs;
479}
480
481static void tcg_region_tree_reset_all(void)
482{
483 size_t i;
484
485 tcg_region_tree_lock_all();
486 for (i = 0; i < region.n; i++) {
487 struct tcg_region_tree *rt = region_trees + i * tree_size;
488
489 /* Increment the refcount first so that destroy acts as a reset */
490 g_tree_ref(rt->tree);
491 g_tree_destroy(rt->tree);
492 }
493 tcg_region_tree_unlock_all();
494}
495
e8feb96f
EC
496static void tcg_region_bounds(size_t curr_region, void **pstart, void **pend)
497{
498 void *start, *end;
499
500 start = region.start_aligned + curr_region * region.stride;
501 end = start + region.size;
502
503 if (curr_region == 0) {
504 start = region.start;
505 }
506 if (curr_region == region.n - 1) {
507 end = region.end;
508 }
509
510 *pstart = start;
511 *pend = end;
512}
513
514static void tcg_region_assign(TCGContext *s, size_t curr_region)
515{
516 void *start, *end;
517
518 tcg_region_bounds(curr_region, &start, &end);
519
520 s->code_gen_buffer = start;
521 s->code_gen_ptr = start;
522 s->code_gen_buffer_size = end - start;
523 s->code_gen_highwater = end - TCG_HIGHWATER;
524}
525
526static bool tcg_region_alloc__locked(TCGContext *s)
527{
528 if (region.current == region.n) {
529 return true;
530 }
531 tcg_region_assign(s, region.current);
532 region.current++;
533 return false;
534}
535
536/*
537 * Request a new region once the one in use has filled up.
538 * Returns true on error.
539 */
540static bool tcg_region_alloc(TCGContext *s)
541{
542 bool err;
543 /* read the region size now; alloc__locked will overwrite it on success */
544 size_t size_full = s->code_gen_buffer_size;
545
546 qemu_mutex_lock(&region.lock);
547 err = tcg_region_alloc__locked(s);
548 if (!err) {
549 region.agg_size_full += size_full - TCG_HIGHWATER;
550 }
551 qemu_mutex_unlock(&region.lock);
552 return err;
553}
554
555/*
556 * Perform a context's first region allocation.
557 * This function does _not_ increment region.agg_size_full.
558 */
559static inline bool tcg_region_initial_alloc__locked(TCGContext *s)
560{
561 return tcg_region_alloc__locked(s);
562}
563
564/* Call from a safe-work context */
565void tcg_region_reset_all(void)
566{
3468b59e 567 unsigned int n_ctxs = atomic_read(&n_tcg_ctxs);
e8feb96f
EC
568 unsigned int i;
569
570 qemu_mutex_lock(&region.lock);
571 region.current = 0;
572 region.agg_size_full = 0;
573
3468b59e
EC
574 for (i = 0; i < n_ctxs; i++) {
575 TCGContext *s = atomic_read(&tcg_ctxs[i]);
576 bool err = tcg_region_initial_alloc__locked(s);
e8feb96f
EC
577
578 g_assert(!err);
579 }
580 qemu_mutex_unlock(&region.lock);
be2cdc5e
EC
581
582 tcg_region_tree_reset_all();
e8feb96f
EC
583}
584
3468b59e
EC
585#ifdef CONFIG_USER_ONLY
586static size_t tcg_n_regions(void)
587{
588 return 1;
589}
590#else
591/*
592 * It is likely that some vCPUs will translate more code than others, so we
593 * first try to set more regions than max_cpus, with those regions being of
594 * reasonable size. If that's not possible we make do by evenly dividing
595 * the code_gen_buffer among the vCPUs.
596 */
597static size_t tcg_n_regions(void)
598{
599 size_t i;
600
601 /* Use a single region if all we have is one vCPU thread */
602 if (max_cpus == 1 || !qemu_tcg_mttcg_enabled()) {
603 return 1;
604 }
605
606 /* Try to have more regions than max_cpus, with each region being >= 2 MB */
607 for (i = 8; i > 0; i--) {
608 size_t regions_per_thread = i;
609 size_t region_size;
610
611 region_size = tcg_init_ctx.code_gen_buffer_size;
612 region_size /= max_cpus * regions_per_thread;
613
614 if (region_size >= 2 * 1024u * 1024) {
615 return max_cpus * regions_per_thread;
616 }
617 }
618 /* If we can't, then just allocate one region per vCPU thread */
619 return max_cpus;
620}
621#endif
622
e8feb96f
EC
623/*
624 * Initializes region partitioning.
625 *
626 * Called at init time from the parent thread (i.e. the one calling
627 * tcg_context_init), after the target's TCG globals have been set.
3468b59e
EC
628 *
629 * Region partitioning works by splitting code_gen_buffer into separate regions,
630 * and then assigning regions to TCG threads so that the threads can translate
631 * code in parallel without synchronization.
632 *
633 * In softmmu the number of TCG threads is bounded by max_cpus, so we use at
634 * least max_cpus regions in MTTCG. In !MTTCG we use a single region.
635 * Note that the TCG options from the command-line (i.e. -accel accel=tcg,[...])
636 * must have been parsed before calling this function, since it calls
637 * qemu_tcg_mttcg_enabled().
638 *
639 * In user-mode we use a single region. Having multiple regions in user-mode
640 * is not supported, because the number of vCPU threads (recall that each thread
641 * spawned by the guest corresponds to a vCPU thread) is only bounded by the
642 * OS, and usually this number is huge (tens of thousands is not uncommon).
643 * Thus, given this large bound on the number of vCPU threads and the fact
644 * that code_gen_buffer is allocated at compile-time, we cannot guarantee
645 * that the availability of at least one region per vCPU thread.
646 *
647 * However, this user-mode limitation is unlikely to be a significant problem
648 * in practice. Multi-threaded guests share most if not all of their translated
649 * code, which makes parallel code generation less appealing than in softmmu.
e8feb96f
EC
650 */
651void tcg_region_init(void)
652{
653 void *buf = tcg_init_ctx.code_gen_buffer;
654 void *aligned;
655 size_t size = tcg_init_ctx.code_gen_buffer_size;
656 size_t page_size = qemu_real_host_page_size;
657 size_t region_size;
658 size_t n_regions;
659 size_t i;
660
3468b59e 661 n_regions = tcg_n_regions();
e8feb96f
EC
662
663 /* The first region will be 'aligned - buf' bytes larger than the others */
664 aligned = QEMU_ALIGN_PTR_UP(buf, page_size);
665 g_assert(aligned < tcg_init_ctx.code_gen_buffer + size);
666 /*
667 * Make region_size a multiple of page_size, using aligned as the start.
668 * As a result of this we might end up with a few extra pages at the end of
669 * the buffer; we will assign those to the last region.
670 */
671 region_size = (size - (aligned - buf)) / n_regions;
672 region_size = QEMU_ALIGN_DOWN(region_size, page_size);
673
674 /* A region must have at least 2 pages; one code, one guard */
675 g_assert(region_size >= 2 * page_size);
676
677 /* init the region struct */
678 qemu_mutex_init(&region.lock);
679 region.n = n_regions;
680 region.size = region_size - page_size;
681 region.stride = region_size;
682 region.start = buf;
683 region.start_aligned = aligned;
684 /* page-align the end, since its last page will be a guard page */
685 region.end = QEMU_ALIGN_PTR_DOWN(buf + size, page_size);
686 /* account for that last guard page */
687 region.end -= page_size;
688
689 /* set guard pages */
690 for (i = 0; i < region.n; i++) {
691 void *start, *end;
692 int rc;
693
694 tcg_region_bounds(i, &start, &end);
695 rc = qemu_mprotect_none(end, page_size);
696 g_assert(!rc);
697 }
698
be2cdc5e
EC
699 tcg_region_trees_init();
700
3468b59e
EC
701 /* In user-mode we support only one ctx, so do the initial allocation now */
702#ifdef CONFIG_USER_ONLY
e8feb96f
EC
703 {
704 bool err = tcg_region_initial_alloc__locked(tcg_ctx);
705
706 g_assert(!err);
707 }
3468b59e
EC
708#endif
709}
710
711/*
712 * All TCG threads except the parent (i.e. the one that called tcg_context_init
713 * and registered the target's TCG globals) must register with this function
714 * before initiating translation.
715 *
716 * In user-mode we just point tcg_ctx to tcg_init_ctx. See the documentation
717 * of tcg_region_init() for the reasoning behind this.
718 *
719 * In softmmu each caller registers its context in tcg_ctxs[]. Note that in
720 * softmmu tcg_ctxs[] does not track tcg_ctx_init, since the initial context
721 * is not used anymore for translation once this function is called.
722 *
723 * Not tracking tcg_init_ctx in tcg_ctxs[] in softmmu keeps code that iterates
724 * over the array (e.g. tcg_code_size() the same for both softmmu and user-mode.
725 */
726#ifdef CONFIG_USER_ONLY
727void tcg_register_thread(void)
728{
729 tcg_ctx = &tcg_init_ctx;
730}
731#else
732void tcg_register_thread(void)
733{
734 TCGContext *s = g_malloc(sizeof(*s));
735 unsigned int i, n;
736 bool err;
737
738 *s = tcg_init_ctx;
739
740 /* Relink mem_base. */
741 for (i = 0, n = tcg_init_ctx.nb_globals; i < n; ++i) {
742 if (tcg_init_ctx.temps[i].mem_base) {
743 ptrdiff_t b = tcg_init_ctx.temps[i].mem_base - tcg_init_ctx.temps;
744 tcg_debug_assert(b >= 0 && b < n);
745 s->temps[i].mem_base = &s->temps[b];
746 }
747 }
748
749 /* Claim an entry in tcg_ctxs */
750 n = atomic_fetch_inc(&n_tcg_ctxs);
751 g_assert(n < max_cpus);
752 atomic_set(&tcg_ctxs[n], s);
753
754 tcg_ctx = s;
755 qemu_mutex_lock(&region.lock);
756 err = tcg_region_initial_alloc__locked(tcg_ctx);
757 g_assert(!err);
758 qemu_mutex_unlock(&region.lock);
e8feb96f 759}
3468b59e 760#endif /* !CONFIG_USER_ONLY */
e8feb96f
EC
761
762/*
763 * Returns the size (in bytes) of all translated code (i.e. from all regions)
764 * currently in the cache.
765 * See also: tcg_code_capacity()
766 * Do not confuse with tcg_current_code_size(); that one applies to a single
767 * TCG context.
768 */
769size_t tcg_code_size(void)
770{
3468b59e 771 unsigned int n_ctxs = atomic_read(&n_tcg_ctxs);
e8feb96f
EC
772 unsigned int i;
773 size_t total;
774
775 qemu_mutex_lock(&region.lock);
776 total = region.agg_size_full;
3468b59e
EC
777 for (i = 0; i < n_ctxs; i++) {
778 const TCGContext *s = atomic_read(&tcg_ctxs[i]);
e8feb96f
EC
779 size_t size;
780
781 size = atomic_read(&s->code_gen_ptr) - s->code_gen_buffer;
782 g_assert(size <= s->code_gen_buffer_size);
783 total += size;
784 }
785 qemu_mutex_unlock(&region.lock);
786 return total;
787}
788
789/*
790 * Returns the code capacity (in bytes) of the entire cache, i.e. including all
791 * regions.
792 * See also: tcg_code_size()
793 */
794size_t tcg_code_capacity(void)
795{
796 size_t guard_size, capacity;
797
798 /* no need for synchronization; these variables are set at init time */
799 guard_size = region.stride - region.size;
800 capacity = region.end + guard_size - region.start;
801 capacity -= region.n * (guard_size + TCG_HIGHWATER);
802 return capacity;
803}
804
128ed227
EC
805size_t tcg_tb_phys_invalidate_count(void)
806{
807 unsigned int n_ctxs = atomic_read(&n_tcg_ctxs);
808 unsigned int i;
809 size_t total = 0;
810
811 for (i = 0; i < n_ctxs; i++) {
812 const TCGContext *s = atomic_read(&tcg_ctxs[i]);
813
814 total += atomic_read(&s->tb_phys_invalidate_count);
815 }
816 return total;
817}
818
c896fe29
FB
819/* pool based memory allocation */
820void *tcg_malloc_internal(TCGContext *s, int size)
821{
822 TCGPool *p;
823 int pool_size;
824
825 if (size > TCG_POOL_CHUNK_SIZE) {
826 /* big malloc: insert a new pool (XXX: could optimize) */
7267c094 827 p = g_malloc(sizeof(TCGPool) + size);
c896fe29 828 p->size = size;
4055299e
KB
829 p->next = s->pool_first_large;
830 s->pool_first_large = p;
831 return p->data;
c896fe29
FB
832 } else {
833 p = s->pool_current;
834 if (!p) {
835 p = s->pool_first;
836 if (!p)
837 goto new_pool;
838 } else {
839 if (!p->next) {
840 new_pool:
841 pool_size = TCG_POOL_CHUNK_SIZE;
7267c094 842 p = g_malloc(sizeof(TCGPool) + pool_size);
c896fe29
FB
843 p->size = pool_size;
844 p->next = NULL;
845 if (s->pool_current)
846 s->pool_current->next = p;
847 else
848 s->pool_first = p;
849 } else {
850 p = p->next;
851 }
852 }
853 }
854 s->pool_current = p;
855 s->pool_cur = p->data + size;
856 s->pool_end = p->data + p->size;
857 return p->data;
858}
859
860void tcg_pool_reset(TCGContext *s)
861{
4055299e
KB
862 TCGPool *p, *t;
863 for (p = s->pool_first_large; p; p = t) {
864 t = p->next;
865 g_free(p);
866 }
867 s->pool_first_large = NULL;
c896fe29
FB
868 s->pool_cur = s->pool_end = NULL;
869 s->pool_current = NULL;
870}
871
100b5e01
RH
872typedef struct TCGHelperInfo {
873 void *func;
874 const char *name;
afb49896
RH
875 unsigned flags;
876 unsigned sizemask;
100b5e01
RH
877} TCGHelperInfo;
878
2ef6175a
RH
879#include "exec/helper-proto.h"
880
100b5e01 881static const TCGHelperInfo all_helpers[] = {
2ef6175a 882#include "exec/helper-tcg.h"
100b5e01 883};
619205fd 884static GHashTable *helper_table;
100b5e01 885
91478cef 886static int indirect_reg_alloc_order[ARRAY_SIZE(tcg_target_reg_alloc_order)];
f69d277e 887static void process_op_defs(TCGContext *s);
1c2adb95
RH
888static TCGTemp *tcg_global_reg_new_internal(TCGContext *s, TCGType type,
889 TCGReg reg, const char *name);
91478cef 890
c896fe29
FB
891void tcg_context_init(TCGContext *s)
892{
100b5e01 893 int op, total_args, n, i;
c896fe29
FB
894 TCGOpDef *def;
895 TCGArgConstraint *args_ct;
896 int *sorted_args;
1c2adb95 897 TCGTemp *ts;
c896fe29
FB
898
899 memset(s, 0, sizeof(*s));
c896fe29 900 s->nb_globals = 0;
c70fbf0a 901
c896fe29
FB
902 /* Count total number of arguments and allocate the corresponding
903 space */
904 total_args = 0;
905 for(op = 0; op < NB_OPS; op++) {
906 def = &tcg_op_defs[op];
907 n = def->nb_iargs + def->nb_oargs;
908 total_args += n;
909 }
910
7267c094
AL
911 args_ct = g_malloc(sizeof(TCGArgConstraint) * total_args);
912 sorted_args = g_malloc(sizeof(int) * total_args);
c896fe29
FB
913
914 for(op = 0; op < NB_OPS; op++) {
915 def = &tcg_op_defs[op];
916 def->args_ct = args_ct;
917 def->sorted_args = sorted_args;
918 n = def->nb_iargs + def->nb_oargs;
919 sorted_args += n;
920 args_ct += n;
921 }
5cd8f621
RH
922
923 /* Register helpers. */
84fd9dd3 924 /* Use g_direct_hash/equal for direct pointer comparisons on func. */
619205fd 925 helper_table = g_hash_table_new(NULL, NULL);
84fd9dd3 926
100b5e01 927 for (i = 0; i < ARRAY_SIZE(all_helpers); ++i) {
84fd9dd3 928 g_hash_table_insert(helper_table, (gpointer)all_helpers[i].func,
72866e82 929 (gpointer)&all_helpers[i]);
100b5e01 930 }
5cd8f621 931
c896fe29 932 tcg_target_init(s);
f69d277e 933 process_op_defs(s);
91478cef
RH
934
935 /* Reverse the order of the saved registers, assuming they're all at
936 the start of tcg_target_reg_alloc_order. */
937 for (n = 0; n < ARRAY_SIZE(tcg_target_reg_alloc_order); ++n) {
938 int r = tcg_target_reg_alloc_order[n];
939 if (tcg_regset_test_reg(tcg_target_call_clobber_regs, r)) {
940 break;
941 }
942 }
943 for (i = 0; i < n; ++i) {
944 indirect_reg_alloc_order[i] = tcg_target_reg_alloc_order[n - 1 - i];
945 }
946 for (; i < ARRAY_SIZE(tcg_target_reg_alloc_order); ++i) {
947 indirect_reg_alloc_order[i] = tcg_target_reg_alloc_order[i];
948 }
b1311c4a
EC
949
950 tcg_ctx = s;
3468b59e
EC
951 /*
952 * In user-mode we simply share the init context among threads, since we
953 * use a single region. See the documentation tcg_region_init() for the
954 * reasoning behind this.
955 * In softmmu we will have at most max_cpus TCG threads.
956 */
957#ifdef CONFIG_USER_ONLY
df2cce29
EC
958 tcg_ctxs = &tcg_ctx;
959 n_tcg_ctxs = 1;
3468b59e
EC
960#else
961 tcg_ctxs = g_new(TCGContext *, max_cpus);
962#endif
1c2adb95
RH
963
964 tcg_debug_assert(!tcg_regset_test_reg(s->reserved_regs, TCG_AREG0));
965 ts = tcg_global_reg_new_internal(s, TCG_TYPE_PTR, TCG_AREG0, "env");
966 cpu_env = temp_tcgv_ptr(ts);
9002ec79 967}
b03cce8e 968
6e3b2bfd
EC
969/*
970 * Allocate TBs right before their corresponding translated code, making
971 * sure that TBs and code are on different cache lines.
972 */
973TranslationBlock *tcg_tb_alloc(TCGContext *s)
974{
975 uintptr_t align = qemu_icache_linesize;
976 TranslationBlock *tb;
977 void *next;
978
e8feb96f 979 retry:
6e3b2bfd
EC
980 tb = (void *)ROUND_UP((uintptr_t)s->code_gen_ptr, align);
981 next = (void *)ROUND_UP((uintptr_t)(tb + 1), align);
982
983 if (unlikely(next > s->code_gen_highwater)) {
e8feb96f
EC
984 if (tcg_region_alloc(s)) {
985 return NULL;
986 }
987 goto retry;
6e3b2bfd 988 }
e8feb96f 989 atomic_set(&s->code_gen_ptr, next);
57a26946 990 s->data_gen_ptr = NULL;
6e3b2bfd
EC
991 return tb;
992}
993
9002ec79
RH
994void tcg_prologue_init(TCGContext *s)
995{
8163b749
RH
996 size_t prologue_size, total_size;
997 void *buf0, *buf1;
998
999 /* Put the prologue at the beginning of code_gen_buffer. */
1000 buf0 = s->code_gen_buffer;
5b38ee31 1001 total_size = s->code_gen_buffer_size;
8163b749
RH
1002 s->code_ptr = buf0;
1003 s->code_buf = buf0;
5b38ee31 1004 s->data_gen_ptr = NULL;
8163b749
RH
1005 s->code_gen_prologue = buf0;
1006
5b38ee31
RH
1007 /* Compute a high-water mark, at which we voluntarily flush the buffer
1008 and start over. The size here is arbitrary, significantly larger
1009 than we expect the code generation for any one opcode to require. */
1010 s->code_gen_highwater = s->code_gen_buffer + (total_size - TCG_HIGHWATER);
1011
1012#ifdef TCG_TARGET_NEED_POOL_LABELS
1013 s->pool_labels = NULL;
1014#endif
1015
8163b749 1016 /* Generate the prologue. */
b03cce8e 1017 tcg_target_qemu_prologue(s);
5b38ee31
RH
1018
1019#ifdef TCG_TARGET_NEED_POOL_LABELS
1020 /* Allow the prologue to put e.g. guest_base into a pool entry. */
1021 {
1022 bool ok = tcg_out_pool_finalize(s);
1023 tcg_debug_assert(ok);
1024 }
1025#endif
1026
8163b749
RH
1027 buf1 = s->code_ptr;
1028 flush_icache_range((uintptr_t)buf0, (uintptr_t)buf1);
1029
1030 /* Deduct the prologue from the buffer. */
1031 prologue_size = tcg_current_code_size(s);
1032 s->code_gen_ptr = buf1;
1033 s->code_gen_buffer = buf1;
1034 s->code_buf = buf1;
5b38ee31 1035 total_size -= prologue_size;
8163b749
RH
1036 s->code_gen_buffer_size = total_size;
1037
8163b749 1038 tcg_register_jit(s->code_gen_buffer, total_size);
d6b64b2b
RH
1039
1040#ifdef DEBUG_DISAS
1041 if (qemu_loglevel_mask(CPU_LOG_TB_OUT_ASM)) {
1ee73216 1042 qemu_log_lock();
8163b749 1043 qemu_log("PROLOGUE: [size=%zu]\n", prologue_size);
5b38ee31
RH
1044 if (s->data_gen_ptr) {
1045 size_t code_size = s->data_gen_ptr - buf0;
1046 size_t data_size = prologue_size - code_size;
1047 size_t i;
1048
1049 log_disas(buf0, code_size);
1050
1051 for (i = 0; i < data_size; i += sizeof(tcg_target_ulong)) {
1052 if (sizeof(tcg_target_ulong) == 8) {
1053 qemu_log("0x%08" PRIxPTR ": .quad 0x%016" PRIx64 "\n",
1054 (uintptr_t)s->data_gen_ptr + i,
1055 *(uint64_t *)(s->data_gen_ptr + i));
1056 } else {
1057 qemu_log("0x%08" PRIxPTR ": .long 0x%08x\n",
1058 (uintptr_t)s->data_gen_ptr + i,
1059 *(uint32_t *)(s->data_gen_ptr + i));
1060 }
1061 }
1062 } else {
1063 log_disas(buf0, prologue_size);
1064 }
d6b64b2b
RH
1065 qemu_log("\n");
1066 qemu_log_flush();
1ee73216 1067 qemu_log_unlock();
d6b64b2b
RH
1068 }
1069#endif
cedbcb01
EC
1070
1071 /* Assert that goto_ptr is implemented completely. */
1072 if (TCG_TARGET_HAS_goto_ptr) {
1073 tcg_debug_assert(s->code_gen_epilogue != NULL);
1074 }
c896fe29
FB
1075}
1076
c896fe29
FB
1077void tcg_func_start(TCGContext *s)
1078{
1079 tcg_pool_reset(s);
1080 s->nb_temps = s->nb_globals;
0ec9eabc
RH
1081
1082 /* No temps have been previously allocated for size or locality. */
1083 memset(s->free_temps, 0, sizeof(s->free_temps));
1084
abebf925 1085 s->nb_ops = 0;
c896fe29
FB
1086 s->nb_labels = 0;
1087 s->current_frame_offset = s->frame_start;
1088
0a209d4b
RH
1089#ifdef CONFIG_DEBUG_TCG
1090 s->goto_tb_issue_mask = 0;
1091#endif
1092
15fa08f8
RH
1093 QTAILQ_INIT(&s->ops);
1094 QTAILQ_INIT(&s->free_ops);
c896fe29
FB
1095}
1096
7ca4b752
RH
1097static inline TCGTemp *tcg_temp_alloc(TCGContext *s)
1098{
1099 int n = s->nb_temps++;
1100 tcg_debug_assert(n < TCG_MAX_TEMPS);
1101 return memset(&s->temps[n], 0, sizeof(TCGTemp));
1102}
1103
1104static inline TCGTemp *tcg_global_alloc(TCGContext *s)
1105{
fa477d25
RH
1106 TCGTemp *ts;
1107
7ca4b752
RH
1108 tcg_debug_assert(s->nb_globals == s->nb_temps);
1109 s->nb_globals++;
fa477d25
RH
1110 ts = tcg_temp_alloc(s);
1111 ts->temp_global = 1;
1112
1113 return ts;
c896fe29
FB
1114}
1115
085272b3
RH
1116static TCGTemp *tcg_global_reg_new_internal(TCGContext *s, TCGType type,
1117 TCGReg reg, const char *name)
c896fe29 1118{
c896fe29 1119 TCGTemp *ts;
c896fe29 1120
b3a62939 1121 if (TCG_TARGET_REG_BITS == 32 && type != TCG_TYPE_I32) {
c896fe29 1122 tcg_abort();
b3a62939 1123 }
7ca4b752
RH
1124
1125 ts = tcg_global_alloc(s);
c896fe29
FB
1126 ts->base_type = type;
1127 ts->type = type;
1128 ts->fixed_reg = 1;
1129 ts->reg = reg;
c896fe29 1130 ts->name = name;
c896fe29 1131 tcg_regset_set_reg(s->reserved_regs, reg);
7ca4b752 1132
085272b3 1133 return ts;
a7812ae4
PB
1134}
1135
b6638662 1136void tcg_set_frame(TCGContext *s, TCGReg reg, intptr_t start, intptr_t size)
b3a62939 1137{
b3a62939
RH
1138 s->frame_start = start;
1139 s->frame_end = start + size;
085272b3
RH
1140 s->frame_temp
1141 = tcg_global_reg_new_internal(s, TCG_TYPE_PTR, reg, "_frame");
b3a62939
RH
1142}
1143
085272b3
RH
1144TCGTemp *tcg_global_mem_new_internal(TCGType type, TCGv_ptr base,
1145 intptr_t offset, const char *name)
c896fe29 1146{
b1311c4a 1147 TCGContext *s = tcg_ctx;
dc41aa7d 1148 TCGTemp *base_ts = tcgv_ptr_temp(base);
7ca4b752 1149 TCGTemp *ts = tcg_global_alloc(s);
b3915dbb 1150 int indirect_reg = 0, bigendian = 0;
7ca4b752
RH
1151#ifdef HOST_WORDS_BIGENDIAN
1152 bigendian = 1;
1153#endif
c896fe29 1154
b3915dbb 1155 if (!base_ts->fixed_reg) {
5a18407f
RH
1156 /* We do not support double-indirect registers. */
1157 tcg_debug_assert(!base_ts->indirect_reg);
b3915dbb 1158 base_ts->indirect_base = 1;
5a18407f
RH
1159 s->nb_indirects += (TCG_TARGET_REG_BITS == 32 && type == TCG_TYPE_I64
1160 ? 2 : 1);
1161 indirect_reg = 1;
b3915dbb
RH
1162 }
1163
7ca4b752
RH
1164 if (TCG_TARGET_REG_BITS == 32 && type == TCG_TYPE_I64) {
1165 TCGTemp *ts2 = tcg_global_alloc(s);
c896fe29 1166 char buf[64];
7ca4b752
RH
1167
1168 ts->base_type = TCG_TYPE_I64;
c896fe29 1169 ts->type = TCG_TYPE_I32;
b3915dbb 1170 ts->indirect_reg = indirect_reg;
c896fe29 1171 ts->mem_allocated = 1;
b3a62939 1172 ts->mem_base = base_ts;
7ca4b752 1173 ts->mem_offset = offset + bigendian * 4;
c896fe29
FB
1174 pstrcpy(buf, sizeof(buf), name);
1175 pstrcat(buf, sizeof(buf), "_0");
1176 ts->name = strdup(buf);
c896fe29 1177
7ca4b752
RH
1178 tcg_debug_assert(ts2 == ts + 1);
1179 ts2->base_type = TCG_TYPE_I64;
1180 ts2->type = TCG_TYPE_I32;
b3915dbb 1181 ts2->indirect_reg = indirect_reg;
7ca4b752
RH
1182 ts2->mem_allocated = 1;
1183 ts2->mem_base = base_ts;
1184 ts2->mem_offset = offset + (1 - bigendian) * 4;
c896fe29
FB
1185 pstrcpy(buf, sizeof(buf), name);
1186 pstrcat(buf, sizeof(buf), "_1");
120c1084 1187 ts2->name = strdup(buf);
7ca4b752 1188 } else {
c896fe29
FB
1189 ts->base_type = type;
1190 ts->type = type;
b3915dbb 1191 ts->indirect_reg = indirect_reg;
c896fe29 1192 ts->mem_allocated = 1;
b3a62939 1193 ts->mem_base = base_ts;
c896fe29 1194 ts->mem_offset = offset;
c896fe29 1195 ts->name = name;
c896fe29 1196 }
085272b3 1197 return ts;
a7812ae4
PB
1198}
1199
5bfa8034 1200TCGTemp *tcg_temp_new_internal(TCGType type, bool temp_local)
c896fe29 1201{
b1311c4a 1202 TCGContext *s = tcg_ctx;
c896fe29 1203 TCGTemp *ts;
641d5fbe 1204 int idx, k;
c896fe29 1205
0ec9eabc
RH
1206 k = type + (temp_local ? TCG_TYPE_COUNT : 0);
1207 idx = find_first_bit(s->free_temps[k].l, TCG_MAX_TEMPS);
1208 if (idx < TCG_MAX_TEMPS) {
1209 /* There is already an available temp with the right type. */
1210 clear_bit(idx, s->free_temps[k].l);
1211
e8996ee0 1212 ts = &s->temps[idx];
e8996ee0 1213 ts->temp_allocated = 1;
7ca4b752
RH
1214 tcg_debug_assert(ts->base_type == type);
1215 tcg_debug_assert(ts->temp_local == temp_local);
e8996ee0 1216 } else {
7ca4b752
RH
1217 ts = tcg_temp_alloc(s);
1218 if (TCG_TARGET_REG_BITS == 32 && type == TCG_TYPE_I64) {
1219 TCGTemp *ts2 = tcg_temp_alloc(s);
1220
f6aa2f7d 1221 ts->base_type = type;
e8996ee0
FB
1222 ts->type = TCG_TYPE_I32;
1223 ts->temp_allocated = 1;
641d5fbe 1224 ts->temp_local = temp_local;
7ca4b752
RH
1225
1226 tcg_debug_assert(ts2 == ts + 1);
1227 ts2->base_type = TCG_TYPE_I64;
1228 ts2->type = TCG_TYPE_I32;
1229 ts2->temp_allocated = 1;
1230 ts2->temp_local = temp_local;
1231 } else {
e8996ee0
FB
1232 ts->base_type = type;
1233 ts->type = type;
1234 ts->temp_allocated = 1;
641d5fbe 1235 ts->temp_local = temp_local;
e8996ee0 1236 }
c896fe29 1237 }
27bfd83c
PM
1238
1239#if defined(CONFIG_DEBUG_TCG)
1240 s->temps_in_use++;
1241#endif
085272b3 1242 return ts;
c896fe29
FB
1243}
1244
d2fd745f
RH
1245TCGv_vec tcg_temp_new_vec(TCGType type)
1246{
1247 TCGTemp *t;
1248
1249#ifdef CONFIG_DEBUG_TCG
1250 switch (type) {
1251 case TCG_TYPE_V64:
1252 assert(TCG_TARGET_HAS_v64);
1253 break;
1254 case TCG_TYPE_V128:
1255 assert(TCG_TARGET_HAS_v128);
1256 break;
1257 case TCG_TYPE_V256:
1258 assert(TCG_TARGET_HAS_v256);
1259 break;
1260 default:
1261 g_assert_not_reached();
1262 }
1263#endif
1264
1265 t = tcg_temp_new_internal(type, 0);
1266 return temp_tcgv_vec(t);
1267}
1268
1269/* Create a new temp of the same type as an existing temp. */
1270TCGv_vec tcg_temp_new_vec_matching(TCGv_vec match)
1271{
1272 TCGTemp *t = tcgv_vec_temp(match);
1273
1274 tcg_debug_assert(t->temp_allocated != 0);
1275
1276 t = tcg_temp_new_internal(t->base_type, 0);
1277 return temp_tcgv_vec(t);
1278}
1279
5bfa8034 1280void tcg_temp_free_internal(TCGTemp *ts)
c896fe29 1281{
b1311c4a 1282 TCGContext *s = tcg_ctx;
085272b3 1283 int k, idx;
c896fe29 1284
27bfd83c
PM
1285#if defined(CONFIG_DEBUG_TCG)
1286 s->temps_in_use--;
1287 if (s->temps_in_use < 0) {
1288 fprintf(stderr, "More temporaries freed than allocated!\n");
1289 }
1290#endif
1291
085272b3 1292 tcg_debug_assert(ts->temp_global == 0);
eabb7b91 1293 tcg_debug_assert(ts->temp_allocated != 0);
e8996ee0 1294 ts->temp_allocated = 0;
0ec9eabc 1295
085272b3 1296 idx = temp_idx(ts);
18d13fa2 1297 k = ts->base_type + (ts->temp_local ? TCG_TYPE_COUNT : 0);
0ec9eabc 1298 set_bit(idx, s->free_temps[k].l);
c896fe29
FB
1299}
1300
a7812ae4 1301TCGv_i32 tcg_const_i32(int32_t val)
c896fe29 1302{
a7812ae4
PB
1303 TCGv_i32 t0;
1304 t0 = tcg_temp_new_i32();
e8996ee0
FB
1305 tcg_gen_movi_i32(t0, val);
1306 return t0;
1307}
c896fe29 1308
a7812ae4 1309TCGv_i64 tcg_const_i64(int64_t val)
e8996ee0 1310{
a7812ae4
PB
1311 TCGv_i64 t0;
1312 t0 = tcg_temp_new_i64();
e8996ee0
FB
1313 tcg_gen_movi_i64(t0, val);
1314 return t0;
c896fe29
FB
1315}
1316
a7812ae4 1317TCGv_i32 tcg_const_local_i32(int32_t val)
bdffd4a9 1318{
a7812ae4
PB
1319 TCGv_i32 t0;
1320 t0 = tcg_temp_local_new_i32();
bdffd4a9
AJ
1321 tcg_gen_movi_i32(t0, val);
1322 return t0;
1323}
1324
a7812ae4 1325TCGv_i64 tcg_const_local_i64(int64_t val)
bdffd4a9 1326{
a7812ae4
PB
1327 TCGv_i64 t0;
1328 t0 = tcg_temp_local_new_i64();
bdffd4a9
AJ
1329 tcg_gen_movi_i64(t0, val);
1330 return t0;
1331}
1332
27bfd83c
PM
1333#if defined(CONFIG_DEBUG_TCG)
1334void tcg_clear_temp_count(void)
1335{
b1311c4a 1336 TCGContext *s = tcg_ctx;
27bfd83c
PM
1337 s->temps_in_use = 0;
1338}
1339
1340int tcg_check_temp_count(void)
1341{
b1311c4a 1342 TCGContext *s = tcg_ctx;
27bfd83c
PM
1343 if (s->temps_in_use) {
1344 /* Clear the count so that we don't give another
1345 * warning immediately next time around.
1346 */
1347 s->temps_in_use = 0;
1348 return 1;
1349 }
1350 return 0;
1351}
1352#endif
1353
be0f34b5
RH
1354/* Return true if OP may appear in the opcode stream.
1355 Test the runtime variable that controls each opcode. */
1356bool tcg_op_supported(TCGOpcode op)
1357{
d2fd745f
RH
1358 const bool have_vec
1359 = TCG_TARGET_HAS_v64 | TCG_TARGET_HAS_v128 | TCG_TARGET_HAS_v256;
1360
be0f34b5
RH
1361 switch (op) {
1362 case INDEX_op_discard:
1363 case INDEX_op_set_label:
1364 case INDEX_op_call:
1365 case INDEX_op_br:
1366 case INDEX_op_mb:
1367 case INDEX_op_insn_start:
1368 case INDEX_op_exit_tb:
1369 case INDEX_op_goto_tb:
1370 case INDEX_op_qemu_ld_i32:
1371 case INDEX_op_qemu_st_i32:
1372 case INDEX_op_qemu_ld_i64:
1373 case INDEX_op_qemu_st_i64:
1374 return true;
1375
1376 case INDEX_op_goto_ptr:
1377 return TCG_TARGET_HAS_goto_ptr;
1378
1379 case INDEX_op_mov_i32:
1380 case INDEX_op_movi_i32:
1381 case INDEX_op_setcond_i32:
1382 case INDEX_op_brcond_i32:
1383 case INDEX_op_ld8u_i32:
1384 case INDEX_op_ld8s_i32:
1385 case INDEX_op_ld16u_i32:
1386 case INDEX_op_ld16s_i32:
1387 case INDEX_op_ld_i32:
1388 case INDEX_op_st8_i32:
1389 case INDEX_op_st16_i32:
1390 case INDEX_op_st_i32:
1391 case INDEX_op_add_i32:
1392 case INDEX_op_sub_i32:
1393 case INDEX_op_mul_i32:
1394 case INDEX_op_and_i32:
1395 case INDEX_op_or_i32:
1396 case INDEX_op_xor_i32:
1397 case INDEX_op_shl_i32:
1398 case INDEX_op_shr_i32:
1399 case INDEX_op_sar_i32:
1400 return true;
1401
1402 case INDEX_op_movcond_i32:
1403 return TCG_TARGET_HAS_movcond_i32;
1404 case INDEX_op_div_i32:
1405 case INDEX_op_divu_i32:
1406 return TCG_TARGET_HAS_div_i32;
1407 case INDEX_op_rem_i32:
1408 case INDEX_op_remu_i32:
1409 return TCG_TARGET_HAS_rem_i32;
1410 case INDEX_op_div2_i32:
1411 case INDEX_op_divu2_i32:
1412 return TCG_TARGET_HAS_div2_i32;
1413 case INDEX_op_rotl_i32:
1414 case INDEX_op_rotr_i32:
1415 return TCG_TARGET_HAS_rot_i32;
1416 case INDEX_op_deposit_i32:
1417 return TCG_TARGET_HAS_deposit_i32;
1418 case INDEX_op_extract_i32:
1419 return TCG_TARGET_HAS_extract_i32;
1420 case INDEX_op_sextract_i32:
1421 return TCG_TARGET_HAS_sextract_i32;
1422 case INDEX_op_add2_i32:
1423 return TCG_TARGET_HAS_add2_i32;
1424 case INDEX_op_sub2_i32:
1425 return TCG_TARGET_HAS_sub2_i32;
1426 case INDEX_op_mulu2_i32:
1427 return TCG_TARGET_HAS_mulu2_i32;
1428 case INDEX_op_muls2_i32:
1429 return TCG_TARGET_HAS_muls2_i32;
1430 case INDEX_op_muluh_i32:
1431 return TCG_TARGET_HAS_muluh_i32;
1432 case INDEX_op_mulsh_i32:
1433 return TCG_TARGET_HAS_mulsh_i32;
1434 case INDEX_op_ext8s_i32:
1435 return TCG_TARGET_HAS_ext8s_i32;
1436 case INDEX_op_ext16s_i32:
1437 return TCG_TARGET_HAS_ext16s_i32;
1438 case INDEX_op_ext8u_i32:
1439 return TCG_TARGET_HAS_ext8u_i32;
1440 case INDEX_op_ext16u_i32:
1441 return TCG_TARGET_HAS_ext16u_i32;
1442 case INDEX_op_bswap16_i32:
1443 return TCG_TARGET_HAS_bswap16_i32;
1444 case INDEX_op_bswap32_i32:
1445 return TCG_TARGET_HAS_bswap32_i32;
1446 case INDEX_op_not_i32:
1447 return TCG_TARGET_HAS_not_i32;
1448 case INDEX_op_neg_i32:
1449 return TCG_TARGET_HAS_neg_i32;
1450 case INDEX_op_andc_i32:
1451 return TCG_TARGET_HAS_andc_i32;
1452 case INDEX_op_orc_i32:
1453 return TCG_TARGET_HAS_orc_i32;
1454 case INDEX_op_eqv_i32:
1455 return TCG_TARGET_HAS_eqv_i32;
1456 case INDEX_op_nand_i32:
1457 return TCG_TARGET_HAS_nand_i32;
1458 case INDEX_op_nor_i32:
1459 return TCG_TARGET_HAS_nor_i32;
1460 case INDEX_op_clz_i32:
1461 return TCG_TARGET_HAS_clz_i32;
1462 case INDEX_op_ctz_i32:
1463 return TCG_TARGET_HAS_ctz_i32;
1464 case INDEX_op_ctpop_i32:
1465 return TCG_TARGET_HAS_ctpop_i32;
1466
1467 case INDEX_op_brcond2_i32:
1468 case INDEX_op_setcond2_i32:
1469 return TCG_TARGET_REG_BITS == 32;
1470
1471 case INDEX_op_mov_i64:
1472 case INDEX_op_movi_i64:
1473 case INDEX_op_setcond_i64:
1474 case INDEX_op_brcond_i64:
1475 case INDEX_op_ld8u_i64:
1476 case INDEX_op_ld8s_i64:
1477 case INDEX_op_ld16u_i64:
1478 case INDEX_op_ld16s_i64:
1479 case INDEX_op_ld32u_i64:
1480 case INDEX_op_ld32s_i64:
1481 case INDEX_op_ld_i64:
1482 case INDEX_op_st8_i64:
1483 case INDEX_op_st16_i64:
1484 case INDEX_op_st32_i64:
1485 case INDEX_op_st_i64:
1486 case INDEX_op_add_i64:
1487 case INDEX_op_sub_i64:
1488 case INDEX_op_mul_i64:
1489 case INDEX_op_and_i64:
1490 case INDEX_op_or_i64:
1491 case INDEX_op_xor_i64:
1492 case INDEX_op_shl_i64:
1493 case INDEX_op_shr_i64:
1494 case INDEX_op_sar_i64:
1495 case INDEX_op_ext_i32_i64:
1496 case INDEX_op_extu_i32_i64:
1497 return TCG_TARGET_REG_BITS == 64;
1498
1499 case INDEX_op_movcond_i64:
1500 return TCG_TARGET_HAS_movcond_i64;
1501 case INDEX_op_div_i64:
1502 case INDEX_op_divu_i64:
1503 return TCG_TARGET_HAS_div_i64;
1504 case INDEX_op_rem_i64:
1505 case INDEX_op_remu_i64:
1506 return TCG_TARGET_HAS_rem_i64;
1507 case INDEX_op_div2_i64:
1508 case INDEX_op_divu2_i64:
1509 return TCG_TARGET_HAS_div2_i64;
1510 case INDEX_op_rotl_i64:
1511 case INDEX_op_rotr_i64:
1512 return TCG_TARGET_HAS_rot_i64;
1513 case INDEX_op_deposit_i64:
1514 return TCG_TARGET_HAS_deposit_i64;
1515 case INDEX_op_extract_i64:
1516 return TCG_TARGET_HAS_extract_i64;
1517 case INDEX_op_sextract_i64:
1518 return TCG_TARGET_HAS_sextract_i64;
1519 case INDEX_op_extrl_i64_i32:
1520 return TCG_TARGET_HAS_extrl_i64_i32;
1521 case INDEX_op_extrh_i64_i32:
1522 return TCG_TARGET_HAS_extrh_i64_i32;
1523 case INDEX_op_ext8s_i64:
1524 return TCG_TARGET_HAS_ext8s_i64;
1525 case INDEX_op_ext16s_i64:
1526 return TCG_TARGET_HAS_ext16s_i64;
1527 case INDEX_op_ext32s_i64:
1528 return TCG_TARGET_HAS_ext32s_i64;
1529 case INDEX_op_ext8u_i64:
1530 return TCG_TARGET_HAS_ext8u_i64;
1531 case INDEX_op_ext16u_i64:
1532 return TCG_TARGET_HAS_ext16u_i64;
1533 case INDEX_op_ext32u_i64:
1534 return TCG_TARGET_HAS_ext32u_i64;
1535 case INDEX_op_bswap16_i64:
1536 return TCG_TARGET_HAS_bswap16_i64;
1537 case INDEX_op_bswap32_i64:
1538 return TCG_TARGET_HAS_bswap32_i64;
1539 case INDEX_op_bswap64_i64:
1540 return TCG_TARGET_HAS_bswap64_i64;
1541 case INDEX_op_not_i64:
1542 return TCG_TARGET_HAS_not_i64;
1543 case INDEX_op_neg_i64:
1544 return TCG_TARGET_HAS_neg_i64;
1545 case INDEX_op_andc_i64:
1546 return TCG_TARGET_HAS_andc_i64;
1547 case INDEX_op_orc_i64:
1548 return TCG_TARGET_HAS_orc_i64;
1549 case INDEX_op_eqv_i64:
1550 return TCG_TARGET_HAS_eqv_i64;
1551 case INDEX_op_nand_i64:
1552 return TCG_TARGET_HAS_nand_i64;
1553 case INDEX_op_nor_i64:
1554 return TCG_TARGET_HAS_nor_i64;
1555 case INDEX_op_clz_i64:
1556 return TCG_TARGET_HAS_clz_i64;
1557 case INDEX_op_ctz_i64:
1558 return TCG_TARGET_HAS_ctz_i64;
1559 case INDEX_op_ctpop_i64:
1560 return TCG_TARGET_HAS_ctpop_i64;
1561 case INDEX_op_add2_i64:
1562 return TCG_TARGET_HAS_add2_i64;
1563 case INDEX_op_sub2_i64:
1564 return TCG_TARGET_HAS_sub2_i64;
1565 case INDEX_op_mulu2_i64:
1566 return TCG_TARGET_HAS_mulu2_i64;
1567 case INDEX_op_muls2_i64:
1568 return TCG_TARGET_HAS_muls2_i64;
1569 case INDEX_op_muluh_i64:
1570 return TCG_TARGET_HAS_muluh_i64;
1571 case INDEX_op_mulsh_i64:
1572 return TCG_TARGET_HAS_mulsh_i64;
1573
d2fd745f
RH
1574 case INDEX_op_mov_vec:
1575 case INDEX_op_dup_vec:
1576 case INDEX_op_dupi_vec:
1577 case INDEX_op_ld_vec:
1578 case INDEX_op_st_vec:
1579 case INDEX_op_add_vec:
1580 case INDEX_op_sub_vec:
1581 case INDEX_op_and_vec:
1582 case INDEX_op_or_vec:
1583 case INDEX_op_xor_vec:
212be173 1584 case INDEX_op_cmp_vec:
d2fd745f
RH
1585 return have_vec;
1586 case INDEX_op_dup2_vec:
1587 return have_vec && TCG_TARGET_REG_BITS == 32;
1588 case INDEX_op_not_vec:
1589 return have_vec && TCG_TARGET_HAS_not_vec;
1590 case INDEX_op_neg_vec:
1591 return have_vec && TCG_TARGET_HAS_neg_vec;
1592 case INDEX_op_andc_vec:
1593 return have_vec && TCG_TARGET_HAS_andc_vec;
1594 case INDEX_op_orc_vec:
1595 return have_vec && TCG_TARGET_HAS_orc_vec;
3774030a
RH
1596 case INDEX_op_mul_vec:
1597 return have_vec && TCG_TARGET_HAS_mul_vec;
d0ec9796
RH
1598 case INDEX_op_shli_vec:
1599 case INDEX_op_shri_vec:
1600 case INDEX_op_sari_vec:
1601 return have_vec && TCG_TARGET_HAS_shi_vec;
1602 case INDEX_op_shls_vec:
1603 case INDEX_op_shrs_vec:
1604 case INDEX_op_sars_vec:
1605 return have_vec && TCG_TARGET_HAS_shs_vec;
1606 case INDEX_op_shlv_vec:
1607 case INDEX_op_shrv_vec:
1608 case INDEX_op_sarv_vec:
1609 return have_vec && TCG_TARGET_HAS_shv_vec;
d2fd745f 1610
db432672
RH
1611 default:
1612 tcg_debug_assert(op > INDEX_op_last_generic && op < NB_OPS);
1613 return true;
be0f34b5 1614 }
be0f34b5
RH
1615}
1616
39cf05d3
FB
1617/* Note: we convert the 64 bit args to 32 bit and do some alignment
1618 and endian swap. Maybe it would be better to do the alignment
1619 and endian swap in tcg_reg_alloc_call(). */
ae8b75dc 1620void tcg_gen_callN(void *func, TCGTemp *ret, int nargs, TCGTemp **args)
c896fe29 1621{
75e8b9b7 1622 int i, real_args, nb_rets, pi;
bbb8a1b4 1623 unsigned sizemask, flags;
afb49896 1624 TCGHelperInfo *info;
75e8b9b7 1625 TCGOp *op;
afb49896 1626
619205fd 1627 info = g_hash_table_lookup(helper_table, (gpointer)func);
bbb8a1b4
RH
1628 flags = info->flags;
1629 sizemask = info->sizemask;
2bece2c8 1630
34b1a49c
RH
1631#if defined(__sparc__) && !defined(__arch64__) \
1632 && !defined(CONFIG_TCG_INTERPRETER)
1633 /* We have 64-bit values in one register, but need to pass as two
1634 separate parameters. Split them. */
1635 int orig_sizemask = sizemask;
1636 int orig_nargs = nargs;
1637 TCGv_i64 retl, reth;
ae8b75dc 1638 TCGTemp *split_args[MAX_OPC_PARAM];
34b1a49c 1639
f764718d
RH
1640 retl = NULL;
1641 reth = NULL;
34b1a49c 1642 if (sizemask != 0) {
34b1a49c
RH
1643 for (i = real_args = 0; i < nargs; ++i) {
1644 int is_64bit = sizemask & (1 << (i+1)*2);
1645 if (is_64bit) {
085272b3 1646 TCGv_i64 orig = temp_tcgv_i64(args[i]);
34b1a49c
RH
1647 TCGv_i32 h = tcg_temp_new_i32();
1648 TCGv_i32 l = tcg_temp_new_i32();
1649 tcg_gen_extr_i64_i32(l, h, orig);
ae8b75dc
RH
1650 split_args[real_args++] = tcgv_i32_temp(h);
1651 split_args[real_args++] = tcgv_i32_temp(l);
34b1a49c
RH
1652 } else {
1653 split_args[real_args++] = args[i];
1654 }
1655 }
1656 nargs = real_args;
1657 args = split_args;
1658 sizemask = 0;
1659 }
1660#elif defined(TCG_TARGET_EXTEND_ARGS) && TCG_TARGET_REG_BITS == 64
2bece2c8
RH
1661 for (i = 0; i < nargs; ++i) {
1662 int is_64bit = sizemask & (1 << (i+1)*2);
1663 int is_signed = sizemask & (2 << (i+1)*2);
1664 if (!is_64bit) {
1665 TCGv_i64 temp = tcg_temp_new_i64();
085272b3 1666 TCGv_i64 orig = temp_tcgv_i64(args[i]);
2bece2c8
RH
1667 if (is_signed) {
1668 tcg_gen_ext32s_i64(temp, orig);
1669 } else {
1670 tcg_gen_ext32u_i64(temp, orig);
1671 }
ae8b75dc 1672 args[i] = tcgv_i64_temp(temp);
2bece2c8
RH
1673 }
1674 }
1675#endif /* TCG_TARGET_EXTEND_ARGS */
1676
15fa08f8 1677 op = tcg_emit_op(INDEX_op_call);
75e8b9b7
RH
1678
1679 pi = 0;
ae8b75dc 1680 if (ret != NULL) {
34b1a49c
RH
1681#if defined(__sparc__) && !defined(__arch64__) \
1682 && !defined(CONFIG_TCG_INTERPRETER)
1683 if (orig_sizemask & 1) {
1684 /* The 32-bit ABI is going to return the 64-bit value in
1685 the %o0/%o1 register pair. Prepare for this by using
1686 two return temporaries, and reassemble below. */
1687 retl = tcg_temp_new_i64();
1688 reth = tcg_temp_new_i64();
ae8b75dc
RH
1689 op->args[pi++] = tcgv_i64_arg(reth);
1690 op->args[pi++] = tcgv_i64_arg(retl);
34b1a49c
RH
1691 nb_rets = 2;
1692 } else {
ae8b75dc 1693 op->args[pi++] = temp_arg(ret);
34b1a49c
RH
1694 nb_rets = 1;
1695 }
1696#else
1697 if (TCG_TARGET_REG_BITS < 64 && (sizemask & 1)) {
02eb19d0 1698#ifdef HOST_WORDS_BIGENDIAN
ae8b75dc
RH
1699 op->args[pi++] = temp_arg(ret + 1);
1700 op->args[pi++] = temp_arg(ret);
39cf05d3 1701#else
ae8b75dc
RH
1702 op->args[pi++] = temp_arg(ret);
1703 op->args[pi++] = temp_arg(ret + 1);
39cf05d3 1704#endif
a7812ae4 1705 nb_rets = 2;
34b1a49c 1706 } else {
ae8b75dc 1707 op->args[pi++] = temp_arg(ret);
a7812ae4 1708 nb_rets = 1;
c896fe29 1709 }
34b1a49c 1710#endif
a7812ae4
PB
1711 } else {
1712 nb_rets = 0;
c896fe29 1713 }
cd9090aa 1714 TCGOP_CALLO(op) = nb_rets;
75e8b9b7 1715
a7812ae4
PB
1716 real_args = 0;
1717 for (i = 0; i < nargs; i++) {
2bece2c8 1718 int is_64bit = sizemask & (1 << (i+1)*2);
bbb8a1b4 1719 if (TCG_TARGET_REG_BITS < 64 && is_64bit) {
39cf05d3
FB
1720#ifdef TCG_TARGET_CALL_ALIGN_ARGS
1721 /* some targets want aligned 64 bit args */
ebd486d5 1722 if (real_args & 1) {
75e8b9b7 1723 op->args[pi++] = TCG_CALL_DUMMY_ARG;
ebd486d5 1724 real_args++;
39cf05d3
FB
1725 }
1726#endif
c70fbf0a
RH
1727 /* If stack grows up, then we will be placing successive
1728 arguments at lower addresses, which means we need to
1729 reverse the order compared to how we would normally
1730 treat either big or little-endian. For those arguments
1731 that will wind up in registers, this still works for
1732 HPPA (the only current STACK_GROWSUP target) since the
1733 argument registers are *also* allocated in decreasing
1734 order. If another such target is added, this logic may
1735 have to get more complicated to differentiate between
1736 stack arguments and register arguments. */
02eb19d0 1737#if defined(HOST_WORDS_BIGENDIAN) != defined(TCG_TARGET_STACK_GROWSUP)
ae8b75dc
RH
1738 op->args[pi++] = temp_arg(args[i] + 1);
1739 op->args[pi++] = temp_arg(args[i]);
c896fe29 1740#else
ae8b75dc
RH
1741 op->args[pi++] = temp_arg(args[i]);
1742 op->args[pi++] = temp_arg(args[i] + 1);
c896fe29 1743#endif
a7812ae4 1744 real_args += 2;
2bece2c8 1745 continue;
c896fe29 1746 }
2bece2c8 1747
ae8b75dc 1748 op->args[pi++] = temp_arg(args[i]);
2bece2c8 1749 real_args++;
c896fe29 1750 }
75e8b9b7
RH
1751 op->args[pi++] = (uintptr_t)func;
1752 op->args[pi++] = flags;
cd9090aa 1753 TCGOP_CALLI(op) = real_args;
a7812ae4 1754
75e8b9b7 1755 /* Make sure the fields didn't overflow. */
cd9090aa 1756 tcg_debug_assert(TCGOP_CALLI(op) == real_args);
75e8b9b7 1757 tcg_debug_assert(pi <= ARRAY_SIZE(op->args));
2bece2c8 1758
34b1a49c
RH
1759#if defined(__sparc__) && !defined(__arch64__) \
1760 && !defined(CONFIG_TCG_INTERPRETER)
1761 /* Free all of the parts we allocated above. */
1762 for (i = real_args = 0; i < orig_nargs; ++i) {
1763 int is_64bit = orig_sizemask & (1 << (i+1)*2);
1764 if (is_64bit) {
085272b3
RH
1765 tcg_temp_free_internal(args[real_args++]);
1766 tcg_temp_free_internal(args[real_args++]);
34b1a49c
RH
1767 } else {
1768 real_args++;
1769 }
1770 }
1771 if (orig_sizemask & 1) {
1772 /* The 32-bit ABI returned two 32-bit pieces. Re-assemble them.
1773 Note that describing these as TCGv_i64 eliminates an unnecessary
1774 zero-extension that tcg_gen_concat_i32_i64 would create. */
085272b3 1775 tcg_gen_concat32_i64(temp_tcgv_i64(ret), retl, reth);
34b1a49c
RH
1776 tcg_temp_free_i64(retl);
1777 tcg_temp_free_i64(reth);
1778 }
1779#elif defined(TCG_TARGET_EXTEND_ARGS) && TCG_TARGET_REG_BITS == 64
2bece2c8
RH
1780 for (i = 0; i < nargs; ++i) {
1781 int is_64bit = sizemask & (1 << (i+1)*2);
1782 if (!is_64bit) {
085272b3 1783 tcg_temp_free_internal(args[i]);
2bece2c8
RH
1784 }
1785 }
1786#endif /* TCG_TARGET_EXTEND_ARGS */
c896fe29 1787}
c896fe29 1788
8fcd3692 1789static void tcg_reg_alloc_start(TCGContext *s)
c896fe29 1790{
ac3b8891 1791 int i, n;
c896fe29 1792 TCGTemp *ts;
ac3b8891
RH
1793
1794 for (i = 0, n = s->nb_globals; i < n; i++) {
c896fe29 1795 ts = &s->temps[i];
ac3b8891 1796 ts->val_type = (ts->fixed_reg ? TEMP_VAL_REG : TEMP_VAL_MEM);
c896fe29 1797 }
ac3b8891 1798 for (n = s->nb_temps; i < n; i++) {
e8996ee0 1799 ts = &s->temps[i];
ac3b8891 1800 ts->val_type = (ts->temp_local ? TEMP_VAL_MEM : TEMP_VAL_DEAD);
e8996ee0
FB
1801 ts->mem_allocated = 0;
1802 ts->fixed_reg = 0;
1803 }
f8b2f202
RH
1804
1805 memset(s->reg_to_temp, 0, sizeof(s->reg_to_temp));
c896fe29
FB
1806}
1807
f8b2f202
RH
1808static char *tcg_get_arg_str_ptr(TCGContext *s, char *buf, int buf_size,
1809 TCGTemp *ts)
c896fe29 1810{
1807f4c4 1811 int idx = temp_idx(ts);
ac56dd48 1812
fa477d25 1813 if (ts->temp_global) {
ac56dd48 1814 pstrcpy(buf, buf_size, ts->name);
f8b2f202
RH
1815 } else if (ts->temp_local) {
1816 snprintf(buf, buf_size, "loc%d", idx - s->nb_globals);
c896fe29 1817 } else {
f8b2f202 1818 snprintf(buf, buf_size, "tmp%d", idx - s->nb_globals);
c896fe29
FB
1819 }
1820 return buf;
1821}
1822
43439139
RH
1823static char *tcg_get_arg_str(TCGContext *s, char *buf,
1824 int buf_size, TCGArg arg)
f8b2f202 1825{
43439139 1826 return tcg_get_arg_str_ptr(s, buf, buf_size, arg_temp(arg));
f8b2f202
RH
1827}
1828
6e085f72
RH
1829/* Find helper name. */
1830static inline const char *tcg_find_helper(TCGContext *s, uintptr_t val)
4dc81f28 1831{
6e085f72 1832 const char *ret = NULL;
619205fd
EC
1833 if (helper_table) {
1834 TCGHelperInfo *info = g_hash_table_lookup(helper_table, (gpointer)val);
72866e82
RH
1835 if (info) {
1836 ret = info->name;
1837 }
4dc81f28 1838 }
6e085f72 1839 return ret;
4dc81f28
FB
1840}
1841
f48f3ede
BS
1842static const char * const cond_name[] =
1843{
0aed257f
RH
1844 [TCG_COND_NEVER] = "never",
1845 [TCG_COND_ALWAYS] = "always",
f48f3ede
BS
1846 [TCG_COND_EQ] = "eq",
1847 [TCG_COND_NE] = "ne",
1848 [TCG_COND_LT] = "lt",
1849 [TCG_COND_GE] = "ge",
1850 [TCG_COND_LE] = "le",
1851 [TCG_COND_GT] = "gt",
1852 [TCG_COND_LTU] = "ltu",
1853 [TCG_COND_GEU] = "geu",
1854 [TCG_COND_LEU] = "leu",
1855 [TCG_COND_GTU] = "gtu"
1856};
1857
f713d6ad
RH
1858static const char * const ldst_name[] =
1859{
1860 [MO_UB] = "ub",
1861 [MO_SB] = "sb",
1862 [MO_LEUW] = "leuw",
1863 [MO_LESW] = "lesw",
1864 [MO_LEUL] = "leul",
1865 [MO_LESL] = "lesl",
1866 [MO_LEQ] = "leq",
1867 [MO_BEUW] = "beuw",
1868 [MO_BESW] = "besw",
1869 [MO_BEUL] = "beul",
1870 [MO_BESL] = "besl",
1871 [MO_BEQ] = "beq",
1872};
1873
1f00b27f
SS
1874static const char * const alignment_name[(MO_AMASK >> MO_ASHIFT) + 1] = {
1875#ifdef ALIGNED_ONLY
1876 [MO_UNALN >> MO_ASHIFT] = "un+",
1877 [MO_ALIGN >> MO_ASHIFT] = "",
1878#else
1879 [MO_UNALN >> MO_ASHIFT] = "",
1880 [MO_ALIGN >> MO_ASHIFT] = "al+",
1881#endif
1882 [MO_ALIGN_2 >> MO_ASHIFT] = "al2+",
1883 [MO_ALIGN_4 >> MO_ASHIFT] = "al4+",
1884 [MO_ALIGN_8 >> MO_ASHIFT] = "al8+",
1885 [MO_ALIGN_16 >> MO_ASHIFT] = "al16+",
1886 [MO_ALIGN_32 >> MO_ASHIFT] = "al32+",
1887 [MO_ALIGN_64 >> MO_ASHIFT] = "al64+",
1888};
1889
b016486e
RH
1890static inline bool tcg_regset_single(TCGRegSet d)
1891{
1892 return (d & (d - 1)) == 0;
1893}
1894
1895static inline TCGReg tcg_regset_first(TCGRegSet d)
1896{
1897 if (TCG_TARGET_NB_REGS <= 32) {
1898 return ctz32(d);
1899 } else {
1900 return ctz64(d);
1901 }
1902}
1903
eeacee4d 1904void tcg_dump_ops(TCGContext *s)
c896fe29 1905{
c896fe29 1906 char buf[128];
c45cb8bb 1907 TCGOp *op;
c45cb8bb 1908
15fa08f8 1909 QTAILQ_FOREACH(op, &s->ops, link) {
c45cb8bb
RH
1910 int i, k, nb_oargs, nb_iargs, nb_cargs;
1911 const TCGOpDef *def;
c45cb8bb 1912 TCGOpcode c;
bdfb460e 1913 int col = 0;
c896fe29 1914
c45cb8bb 1915 c = op->opc;
c896fe29 1916 def = &tcg_op_defs[c];
c45cb8bb 1917
765b842a 1918 if (c == INDEX_op_insn_start) {
b016486e 1919 nb_oargs = 0;
15fa08f8 1920 col += qemu_log("\n ----");
9aef40ed
RH
1921
1922 for (i = 0; i < TARGET_INSN_START_WORDS; ++i) {
1923 target_ulong a;
7e4597d7 1924#if TARGET_LONG_BITS > TCG_TARGET_REG_BITS
efee3746 1925 a = deposit64(op->args[i * 2], 32, 32, op->args[i * 2 + 1]);
7e4597d7 1926#else
efee3746 1927 a = op->args[i];
7e4597d7 1928#endif
bdfb460e 1929 col += qemu_log(" " TARGET_FMT_lx, a);
eeacee4d 1930 }
7e4597d7 1931 } else if (c == INDEX_op_call) {
c896fe29 1932 /* variable number of arguments */
cd9090aa
RH
1933 nb_oargs = TCGOP_CALLO(op);
1934 nb_iargs = TCGOP_CALLI(op);
c896fe29 1935 nb_cargs = def->nb_cargs;
c896fe29 1936
cf066674 1937 /* function name, flags, out args */
bdfb460e 1938 col += qemu_log(" %s %s,$0x%" TCG_PRIlx ",$%d", def->name,
efee3746
RH
1939 tcg_find_helper(s, op->args[nb_oargs + nb_iargs]),
1940 op->args[nb_oargs + nb_iargs + 1], nb_oargs);
cf066674 1941 for (i = 0; i < nb_oargs; i++) {
43439139
RH
1942 col += qemu_log(",%s", tcg_get_arg_str(s, buf, sizeof(buf),
1943 op->args[i]));
b03cce8e 1944 }
cf066674 1945 for (i = 0; i < nb_iargs; i++) {
efee3746 1946 TCGArg arg = op->args[nb_oargs + i];
cf066674
RH
1947 const char *t = "<dummy>";
1948 if (arg != TCG_CALL_DUMMY_ARG) {
43439139 1949 t = tcg_get_arg_str(s, buf, sizeof(buf), arg);
eeacee4d 1950 }
bdfb460e 1951 col += qemu_log(",%s", t);
e8996ee0 1952 }
b03cce8e 1953 } else {
bdfb460e 1954 col += qemu_log(" %s ", def->name);
c45cb8bb
RH
1955
1956 nb_oargs = def->nb_oargs;
1957 nb_iargs = def->nb_iargs;
1958 nb_cargs = def->nb_cargs;
1959
d2fd745f
RH
1960 if (def->flags & TCG_OPF_VECTOR) {
1961 col += qemu_log("v%d,e%d,", 64 << TCGOP_VECL(op),
1962 8 << TCGOP_VECE(op));
1963 }
1964
b03cce8e 1965 k = 0;
c45cb8bb 1966 for (i = 0; i < nb_oargs; i++) {
eeacee4d 1967 if (k != 0) {
bdfb460e 1968 col += qemu_log(",");
eeacee4d 1969 }
43439139
RH
1970 col += qemu_log("%s", tcg_get_arg_str(s, buf, sizeof(buf),
1971 op->args[k++]));
b03cce8e 1972 }
c45cb8bb 1973 for (i = 0; i < nb_iargs; i++) {
eeacee4d 1974 if (k != 0) {
bdfb460e 1975 col += qemu_log(",");
eeacee4d 1976 }
43439139
RH
1977 col += qemu_log("%s", tcg_get_arg_str(s, buf, sizeof(buf),
1978 op->args[k++]));
b03cce8e 1979 }
be210acb
RH
1980 switch (c) {
1981 case INDEX_op_brcond_i32:
be210acb 1982 case INDEX_op_setcond_i32:
ffc5ea09 1983 case INDEX_op_movcond_i32:
ffc5ea09 1984 case INDEX_op_brcond2_i32:
be210acb 1985 case INDEX_op_setcond2_i32:
ffc5ea09 1986 case INDEX_op_brcond_i64:
be210acb 1987 case INDEX_op_setcond_i64:
ffc5ea09 1988 case INDEX_op_movcond_i64:
212be173 1989 case INDEX_op_cmp_vec:
efee3746
RH
1990 if (op->args[k] < ARRAY_SIZE(cond_name)
1991 && cond_name[op->args[k]]) {
1992 col += qemu_log(",%s", cond_name[op->args[k++]]);
eeacee4d 1993 } else {
efee3746 1994 col += qemu_log(",$0x%" TCG_PRIlx, op->args[k++]);
eeacee4d 1995 }
f48f3ede 1996 i = 1;
be210acb 1997 break;
f713d6ad
RH
1998 case INDEX_op_qemu_ld_i32:
1999 case INDEX_op_qemu_st_i32:
2000 case INDEX_op_qemu_ld_i64:
2001 case INDEX_op_qemu_st_i64:
59227d5d 2002 {
efee3746 2003 TCGMemOpIdx oi = op->args[k++];
59227d5d
RH
2004 TCGMemOp op = get_memop(oi);
2005 unsigned ix = get_mmuidx(oi);
2006
59c4b7e8 2007 if (op & ~(MO_AMASK | MO_BSWAP | MO_SSIZE)) {
bdfb460e 2008 col += qemu_log(",$0x%x,%u", op, ix);
59c4b7e8 2009 } else {
1f00b27f
SS
2010 const char *s_al, *s_op;
2011 s_al = alignment_name[(op & MO_AMASK) >> MO_ASHIFT];
59c4b7e8 2012 s_op = ldst_name[op & (MO_BSWAP | MO_SSIZE)];
bdfb460e 2013 col += qemu_log(",%s%s,%u", s_al, s_op, ix);
59227d5d
RH
2014 }
2015 i = 1;
f713d6ad 2016 }
f713d6ad 2017 break;
be210acb 2018 default:
f48f3ede 2019 i = 0;
be210acb
RH
2020 break;
2021 }
51e3972c
RH
2022 switch (c) {
2023 case INDEX_op_set_label:
2024 case INDEX_op_br:
2025 case INDEX_op_brcond_i32:
2026 case INDEX_op_brcond_i64:
2027 case INDEX_op_brcond2_i32:
efee3746
RH
2028 col += qemu_log("%s$L%d", k ? "," : "",
2029 arg_label(op->args[k])->id);
51e3972c
RH
2030 i++, k++;
2031 break;
2032 default:
2033 break;
2034 }
2035 for (; i < nb_cargs; i++, k++) {
efee3746 2036 col += qemu_log("%s$0x%" TCG_PRIlx, k ? "," : "", op->args[k]);
bdfb460e
RH
2037 }
2038 }
2039 if (op->life) {
2040 unsigned life = op->life;
2041
2042 for (; col < 48; ++col) {
2043 putc(' ', qemu_logfile);
2044 }
2045
2046 if (life & (SYNC_ARG * 3)) {
2047 qemu_log(" sync:");
2048 for (i = 0; i < 2; ++i) {
2049 if (life & (SYNC_ARG << i)) {
2050 qemu_log(" %d", i);
2051 }
2052 }
2053 }
2054 life /= DEAD_ARG;
2055 if (life) {
2056 qemu_log(" dead:");
2057 for (i = 0; life; ++i, life >>= 1) {
2058 if (life & 1) {
2059 qemu_log(" %d", i);
2060 }
2061 }
b03cce8e 2062 }
c896fe29 2063 }
eeacee4d 2064 qemu_log("\n");
c896fe29
FB
2065 }
2066}
2067
2068/* we give more priority to constraints with less registers */
2069static int get_constraint_priority(const TCGOpDef *def, int k)
2070{
2071 const TCGArgConstraint *arg_ct;
2072
2073 int i, n;
2074 arg_ct = &def->args_ct[k];
2075 if (arg_ct->ct & TCG_CT_ALIAS) {
2076 /* an alias is equivalent to a single register */
2077 n = 1;
2078 } else {
2079 if (!(arg_ct->ct & TCG_CT_REG))
2080 return 0;
2081 n = 0;
2082 for(i = 0; i < TCG_TARGET_NB_REGS; i++) {
2083 if (tcg_regset_test_reg(arg_ct->u.regs, i))
2084 n++;
2085 }
2086 }
2087 return TCG_TARGET_NB_REGS - n + 1;
2088}
2089
2090/* sort from highest priority to lowest */
2091static void sort_constraints(TCGOpDef *def, int start, int n)
2092{
2093 int i, j, p1, p2, tmp;
2094
2095 for(i = 0; i < n; i++)
2096 def->sorted_args[start + i] = start + i;
2097 if (n <= 1)
2098 return;
2099 for(i = 0; i < n - 1; i++) {
2100 for(j = i + 1; j < n; j++) {
2101 p1 = get_constraint_priority(def, def->sorted_args[start + i]);
2102 p2 = get_constraint_priority(def, def->sorted_args[start + j]);
2103 if (p1 < p2) {
2104 tmp = def->sorted_args[start + i];
2105 def->sorted_args[start + i] = def->sorted_args[start + j];
2106 def->sorted_args[start + j] = tmp;
2107 }
2108 }
2109 }
2110}
2111
f69d277e 2112static void process_op_defs(TCGContext *s)
c896fe29 2113{
a9751609 2114 TCGOpcode op;
c896fe29 2115
f69d277e
RH
2116 for (op = 0; op < NB_OPS; op++) {
2117 TCGOpDef *def = &tcg_op_defs[op];
2118 const TCGTargetOpDef *tdefs;
069ea736
RH
2119 TCGType type;
2120 int i, nb_args;
f69d277e
RH
2121
2122 if (def->flags & TCG_OPF_NOT_PRESENT) {
2123 continue;
2124 }
2125
c896fe29 2126 nb_args = def->nb_iargs + def->nb_oargs;
f69d277e
RH
2127 if (nb_args == 0) {
2128 continue;
2129 }
2130
2131 tdefs = tcg_target_op_def(op);
2132 /* Missing TCGTargetOpDef entry. */
2133 tcg_debug_assert(tdefs != NULL);
2134
069ea736 2135 type = (def->flags & TCG_OPF_64BIT ? TCG_TYPE_I64 : TCG_TYPE_I32);
f69d277e
RH
2136 for (i = 0; i < nb_args; i++) {
2137 const char *ct_str = tdefs->args_ct_str[i];
2138 /* Incomplete TCGTargetOpDef entry. */
eabb7b91 2139 tcg_debug_assert(ct_str != NULL);
f69d277e 2140
ccb1bb66 2141 def->args_ct[i].u.regs = 0;
c896fe29 2142 def->args_ct[i].ct = 0;
17280ff4
RH
2143 while (*ct_str != '\0') {
2144 switch(*ct_str) {
2145 case '0' ... '9':
2146 {
2147 int oarg = *ct_str - '0';
2148 tcg_debug_assert(ct_str == tdefs->args_ct_str[i]);
2149 tcg_debug_assert(oarg < def->nb_oargs);
2150 tcg_debug_assert(def->args_ct[oarg].ct & TCG_CT_REG);
2151 /* TCG_CT_ALIAS is for the output arguments.
2152 The input is tagged with TCG_CT_IALIAS. */
2153 def->args_ct[i] = def->args_ct[oarg];
2154 def->args_ct[oarg].ct |= TCG_CT_ALIAS;
2155 def->args_ct[oarg].alias_index = i;
2156 def->args_ct[i].ct |= TCG_CT_IALIAS;
2157 def->args_ct[i].alias_index = oarg;
c896fe29 2158 }
17280ff4
RH
2159 ct_str++;
2160 break;
2161 case '&':
2162 def->args_ct[i].ct |= TCG_CT_NEWREG;
2163 ct_str++;
2164 break;
2165 case 'i':
2166 def->args_ct[i].ct |= TCG_CT_CONST;
2167 ct_str++;
2168 break;
2169 default:
2170 ct_str = target_parse_constraint(&def->args_ct[i],
2171 ct_str, type);
2172 /* Typo in TCGTargetOpDef constraint. */
2173 tcg_debug_assert(ct_str != NULL);
c896fe29
FB
2174 }
2175 }
2176 }
2177
c68aaa18 2178 /* TCGTargetOpDef entry with too much information? */
eabb7b91 2179 tcg_debug_assert(i == TCG_MAX_OP_ARGS || tdefs->args_ct_str[i] == NULL);
c68aaa18 2180
c896fe29
FB
2181 /* sort the constraints (XXX: this is just an heuristic) */
2182 sort_constraints(def, 0, def->nb_oargs);
2183 sort_constraints(def, def->nb_oargs, def->nb_iargs);
a9751609 2184 }
c896fe29
FB
2185}
2186
0c627cdc
RH
2187void tcg_op_remove(TCGContext *s, TCGOp *op)
2188{
d88a117e
RH
2189 TCGLabel *label;
2190
2191 switch (op->opc) {
2192 case INDEX_op_br:
2193 label = arg_label(op->args[0]);
2194 label->refs--;
2195 break;
2196 case INDEX_op_brcond_i32:
2197 case INDEX_op_brcond_i64:
2198 label = arg_label(op->args[3]);
2199 label->refs--;
2200 break;
2201 case INDEX_op_brcond2_i32:
2202 label = arg_label(op->args[5]);
2203 label->refs--;
2204 break;
2205 default:
2206 break;
2207 }
2208
15fa08f8
RH
2209 QTAILQ_REMOVE(&s->ops, op, link);
2210 QTAILQ_INSERT_TAIL(&s->free_ops, op, link);
abebf925 2211 s->nb_ops--;
0c627cdc
RH
2212
2213#ifdef CONFIG_PROFILER
c3fac113 2214 atomic_set(&s->prof.del_op_count, s->prof.del_op_count + 1);
0c627cdc
RH
2215#endif
2216}
2217
15fa08f8 2218static TCGOp *tcg_op_alloc(TCGOpcode opc)
5a18407f 2219{
15fa08f8
RH
2220 TCGContext *s = tcg_ctx;
2221 TCGOp *op;
5a18407f 2222
15fa08f8
RH
2223 if (likely(QTAILQ_EMPTY(&s->free_ops))) {
2224 op = tcg_malloc(sizeof(TCGOp));
2225 } else {
2226 op = QTAILQ_FIRST(&s->free_ops);
2227 QTAILQ_REMOVE(&s->free_ops, op, link);
2228 }
2229 memset(op, 0, offsetof(TCGOp, link));
2230 op->opc = opc;
abebf925 2231 s->nb_ops++;
5a18407f 2232
15fa08f8
RH
2233 return op;
2234}
2235
2236TCGOp *tcg_emit_op(TCGOpcode opc)
2237{
2238 TCGOp *op = tcg_op_alloc(opc);
2239 QTAILQ_INSERT_TAIL(&tcg_ctx->ops, op, link);
2240 return op;
2241}
5a18407f 2242
ac1043f6 2243TCGOp *tcg_op_insert_before(TCGContext *s, TCGOp *old_op, TCGOpcode opc)
15fa08f8
RH
2244{
2245 TCGOp *new_op = tcg_op_alloc(opc);
2246 QTAILQ_INSERT_BEFORE(old_op, new_op, link);
5a18407f
RH
2247 return new_op;
2248}
2249
ac1043f6 2250TCGOp *tcg_op_insert_after(TCGContext *s, TCGOp *old_op, TCGOpcode opc)
5a18407f 2251{
15fa08f8
RH
2252 TCGOp *new_op = tcg_op_alloc(opc);
2253 QTAILQ_INSERT_AFTER(&s->ops, old_op, new_op, link);
5a18407f
RH
2254 return new_op;
2255}
2256
b4fc67c7
RH
2257/* Reachable analysis : remove unreachable code. */
2258static void reachable_code_pass(TCGContext *s)
2259{
2260 TCGOp *op, *op_next;
2261 bool dead = false;
2262
2263 QTAILQ_FOREACH_SAFE(op, &s->ops, link, op_next) {
2264 bool remove = dead;
2265 TCGLabel *label;
2266 int call_flags;
2267
2268 switch (op->opc) {
2269 case INDEX_op_set_label:
2270 label = arg_label(op->args[0]);
2271 if (label->refs == 0) {
2272 /*
2273 * While there is an occasional backward branch, virtually
2274 * all branches generated by the translators are forward.
2275 * Which means that generally we will have already removed
2276 * all references to the label that will be, and there is
2277 * little to be gained by iterating.
2278 */
2279 remove = true;
2280 } else {
2281 /* Once we see a label, insns become live again. */
2282 dead = false;
2283 remove = false;
2284
2285 /*
2286 * Optimization can fold conditional branches to unconditional.
2287 * If we find a label with one reference which is preceded by
2288 * an unconditional branch to it, remove both. This needed to
2289 * wait until the dead code in between them was removed.
2290 */
2291 if (label->refs == 1) {
2292 TCGOp *op_prev = QTAILQ_PREV(op, TCGOpHead, link);
2293 if (op_prev->opc == INDEX_op_br &&
2294 label == arg_label(op_prev->args[0])) {
2295 tcg_op_remove(s, op_prev);
2296 remove = true;
2297 }
2298 }
2299 }
2300 break;
2301
2302 case INDEX_op_br:
2303 case INDEX_op_exit_tb:
2304 case INDEX_op_goto_ptr:
2305 /* Unconditional branches; everything following is dead. */
2306 dead = true;
2307 break;
2308
2309 case INDEX_op_call:
2310 /* Notice noreturn helper calls, raising exceptions. */
2311 call_flags = op->args[TCGOP_CALLO(op) + TCGOP_CALLI(op) + 1];
2312 if (call_flags & TCG_CALL_NO_RETURN) {
2313 dead = true;
2314 }
2315 break;
2316
2317 case INDEX_op_insn_start:
2318 /* Never remove -- we need to keep these for unwind. */
2319 remove = false;
2320 break;
2321
2322 default:
2323 break;
2324 }
2325
2326 if (remove) {
2327 tcg_op_remove(s, op);
2328 }
2329 }
2330}
2331
c70fbf0a
RH
2332#define TS_DEAD 1
2333#define TS_MEM 2
2334
5a18407f
RH
2335#define IS_DEAD_ARG(n) (arg_life & (DEAD_ARG << (n)))
2336#define NEED_SYNC_ARG(n) (arg_life & (SYNC_ARG << (n)))
2337
9c43b68d
AJ
2338/* liveness analysis: end of function: all temps are dead, and globals
2339 should be in memory. */
b83eabea 2340static void tcg_la_func_end(TCGContext *s)
c896fe29 2341{
b83eabea
RH
2342 int ng = s->nb_globals;
2343 int nt = s->nb_temps;
2344 int i;
2345
2346 for (i = 0; i < ng; ++i) {
2347 s->temps[i].state = TS_DEAD | TS_MEM;
2348 }
2349 for (i = ng; i < nt; ++i) {
2350 s->temps[i].state = TS_DEAD;
2351 }
c896fe29
FB
2352}
2353
9c43b68d
AJ
2354/* liveness analysis: end of basic block: all temps are dead, globals
2355 and local temps should be in memory. */
b83eabea 2356static void tcg_la_bb_end(TCGContext *s)
641d5fbe 2357{
b83eabea
RH
2358 int ng = s->nb_globals;
2359 int nt = s->nb_temps;
2360 int i;
641d5fbe 2361
b83eabea
RH
2362 for (i = 0; i < ng; ++i) {
2363 s->temps[i].state = TS_DEAD | TS_MEM;
2364 }
2365 for (i = ng; i < nt; ++i) {
2366 s->temps[i].state = (s->temps[i].temp_local
2367 ? TS_DEAD | TS_MEM
2368 : TS_DEAD);
641d5fbe
FB
2369 }
2370}
2371
a1b3c48d 2372/* Liveness analysis : update the opc_arg_life array to tell if a
c896fe29
FB
2373 given input arguments is dead. Instructions updating dead
2374 temporaries are removed. */
b83eabea 2375static void liveness_pass_1(TCGContext *s)
c896fe29 2376{
c70fbf0a 2377 int nb_globals = s->nb_globals;
15fa08f8 2378 TCGOp *op, *op_prev;
a1b3c48d 2379
b83eabea 2380 tcg_la_func_end(s);
c896fe29 2381
15fa08f8 2382 QTAILQ_FOREACH_REVERSE_SAFE(op, &s->ops, TCGOpHead, link, op_prev) {
c45cb8bb
RH
2383 int i, nb_iargs, nb_oargs;
2384 TCGOpcode opc_new, opc_new2;
2385 bool have_opc_new2;
a1b3c48d 2386 TCGLifeData arg_life = 0;
b83eabea 2387 TCGTemp *arg_ts;
c45cb8bb
RH
2388 TCGOpcode opc = op->opc;
2389 const TCGOpDef *def = &tcg_op_defs[opc];
2390
c45cb8bb 2391 switch (opc) {
c896fe29 2392 case INDEX_op_call:
c6e113f5
FB
2393 {
2394 int call_flags;
c896fe29 2395
cd9090aa
RH
2396 nb_oargs = TCGOP_CALLO(op);
2397 nb_iargs = TCGOP_CALLI(op);
efee3746 2398 call_flags = op->args[nb_oargs + nb_iargs + 1];
c6e113f5 2399
c45cb8bb 2400 /* pure functions can be removed if their result is unused */
78505279 2401 if (call_flags & TCG_CALL_NO_SIDE_EFFECTS) {
cf066674 2402 for (i = 0; i < nb_oargs; i++) {
b83eabea
RH
2403 arg_ts = arg_temp(op->args[i]);
2404 if (arg_ts->state != TS_DEAD) {
c6e113f5 2405 goto do_not_remove_call;
9c43b68d 2406 }
c6e113f5 2407 }
c45cb8bb 2408 goto do_remove;
c6e113f5
FB
2409 } else {
2410 do_not_remove_call:
c896fe29 2411
c6e113f5 2412 /* output args are dead */
cf066674 2413 for (i = 0; i < nb_oargs; i++) {
b83eabea
RH
2414 arg_ts = arg_temp(op->args[i]);
2415 if (arg_ts->state & TS_DEAD) {
a1b3c48d 2416 arg_life |= DEAD_ARG << i;
6b64b624 2417 }
b83eabea 2418 if (arg_ts->state & TS_MEM) {
a1b3c48d 2419 arg_life |= SYNC_ARG << i;
9c43b68d 2420 }
b83eabea 2421 arg_ts->state = TS_DEAD;
c6e113f5 2422 }
78505279 2423
78505279
AJ
2424 if (!(call_flags & (TCG_CALL_NO_WRITE_GLOBALS |
2425 TCG_CALL_NO_READ_GLOBALS))) {
9c43b68d 2426 /* globals should go back to memory */
b83eabea
RH
2427 for (i = 0; i < nb_globals; i++) {
2428 s->temps[i].state = TS_DEAD | TS_MEM;
2429 }
c70fbf0a
RH
2430 } else if (!(call_flags & TCG_CALL_NO_READ_GLOBALS)) {
2431 /* globals should be synced to memory */
2432 for (i = 0; i < nb_globals; i++) {
b83eabea 2433 s->temps[i].state |= TS_MEM;
c70fbf0a 2434 }
b9c18f56
AJ
2435 }
2436
c19f47bf 2437 /* record arguments that die in this helper */
cf066674 2438 for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
b83eabea
RH
2439 arg_ts = arg_temp(op->args[i]);
2440 if (arg_ts && arg_ts->state & TS_DEAD) {
2441 arg_life |= DEAD_ARG << i;
c6e113f5 2442 }
c6e113f5 2443 }
67cc32eb 2444 /* input arguments are live for preceding opcodes */
c70fbf0a 2445 for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
b83eabea
RH
2446 arg_ts = arg_temp(op->args[i]);
2447 if (arg_ts) {
2448 arg_ts->state &= ~TS_DEAD;
c70fbf0a 2449 }
c19f47bf 2450 }
c896fe29 2451 }
c896fe29 2452 }
c896fe29 2453 break;
765b842a 2454 case INDEX_op_insn_start:
c896fe29 2455 break;
5ff9d6a4 2456 case INDEX_op_discard:
5ff9d6a4 2457 /* mark the temporary as dead */
b83eabea 2458 arg_temp(op->args[0])->state = TS_DEAD;
5ff9d6a4 2459 break;
1305c451
RH
2460
2461 case INDEX_op_add2_i32:
c45cb8bb 2462 opc_new = INDEX_op_add_i32;
f1fae40c 2463 goto do_addsub2;
1305c451 2464 case INDEX_op_sub2_i32:
c45cb8bb 2465 opc_new = INDEX_op_sub_i32;
f1fae40c
RH
2466 goto do_addsub2;
2467 case INDEX_op_add2_i64:
c45cb8bb 2468 opc_new = INDEX_op_add_i64;
f1fae40c
RH
2469 goto do_addsub2;
2470 case INDEX_op_sub2_i64:
c45cb8bb 2471 opc_new = INDEX_op_sub_i64;
f1fae40c 2472 do_addsub2:
1305c451
RH
2473 nb_iargs = 4;
2474 nb_oargs = 2;
2475 /* Test if the high part of the operation is dead, but not
2476 the low part. The result can be optimized to a simple
2477 add or sub. This happens often for x86_64 guest when the
2478 cpu mode is set to 32 bit. */
b83eabea
RH
2479 if (arg_temp(op->args[1])->state == TS_DEAD) {
2480 if (arg_temp(op->args[0])->state == TS_DEAD) {
1305c451
RH
2481 goto do_remove;
2482 }
c45cb8bb
RH
2483 /* Replace the opcode and adjust the args in place,
2484 leaving 3 unused args at the end. */
2485 op->opc = opc = opc_new;
efee3746
RH
2486 op->args[1] = op->args[2];
2487 op->args[2] = op->args[4];
1305c451
RH
2488 /* Fall through and mark the single-word operation live. */
2489 nb_iargs = 2;
2490 nb_oargs = 1;
2491 }
2492 goto do_not_remove;
2493
1414968a 2494 case INDEX_op_mulu2_i32:
c45cb8bb
RH
2495 opc_new = INDEX_op_mul_i32;
2496 opc_new2 = INDEX_op_muluh_i32;
2497 have_opc_new2 = TCG_TARGET_HAS_muluh_i32;
03271524 2498 goto do_mul2;
f1fae40c 2499 case INDEX_op_muls2_i32:
c45cb8bb
RH
2500 opc_new = INDEX_op_mul_i32;
2501 opc_new2 = INDEX_op_mulsh_i32;
2502 have_opc_new2 = TCG_TARGET_HAS_mulsh_i32;
f1fae40c
RH
2503 goto do_mul2;
2504 case INDEX_op_mulu2_i64:
c45cb8bb
RH
2505 opc_new = INDEX_op_mul_i64;
2506 opc_new2 = INDEX_op_muluh_i64;
2507 have_opc_new2 = TCG_TARGET_HAS_muluh_i64;
03271524 2508 goto do_mul2;
f1fae40c 2509 case INDEX_op_muls2_i64:
c45cb8bb
RH
2510 opc_new = INDEX_op_mul_i64;
2511 opc_new2 = INDEX_op_mulsh_i64;
2512 have_opc_new2 = TCG_TARGET_HAS_mulsh_i64;
03271524 2513 goto do_mul2;
f1fae40c 2514 do_mul2:
1414968a
RH
2515 nb_iargs = 2;
2516 nb_oargs = 2;
b83eabea
RH
2517 if (arg_temp(op->args[1])->state == TS_DEAD) {
2518 if (arg_temp(op->args[0])->state == TS_DEAD) {
03271524 2519 /* Both parts of the operation are dead. */
1414968a
RH
2520 goto do_remove;
2521 }
03271524 2522 /* The high part of the operation is dead; generate the low. */
c45cb8bb 2523 op->opc = opc = opc_new;
efee3746
RH
2524 op->args[1] = op->args[2];
2525 op->args[2] = op->args[3];
b83eabea 2526 } else if (arg_temp(op->args[0])->state == TS_DEAD && have_opc_new2) {
c45cb8bb
RH
2527 /* The low part of the operation is dead; generate the high. */
2528 op->opc = opc = opc_new2;
efee3746
RH
2529 op->args[0] = op->args[1];
2530 op->args[1] = op->args[2];
2531 op->args[2] = op->args[3];
03271524
RH
2532 } else {
2533 goto do_not_remove;
1414968a 2534 }
03271524
RH
2535 /* Mark the single-word operation live. */
2536 nb_oargs = 1;
1414968a
RH
2537 goto do_not_remove;
2538
c896fe29 2539 default:
1305c451 2540 /* XXX: optimize by hardcoding common cases (e.g. triadic ops) */
49516bc0
AJ
2541 nb_iargs = def->nb_iargs;
2542 nb_oargs = def->nb_oargs;
c896fe29 2543
49516bc0
AJ
2544 /* Test if the operation can be removed because all
2545 its outputs are dead. We assume that nb_oargs == 0
2546 implies side effects */
2547 if (!(def->flags & TCG_OPF_SIDE_EFFECTS) && nb_oargs != 0) {
c45cb8bb 2548 for (i = 0; i < nb_oargs; i++) {
b83eabea 2549 if (arg_temp(op->args[i])->state != TS_DEAD) {
49516bc0 2550 goto do_not_remove;
9c43b68d 2551 }
49516bc0 2552 }
1305c451 2553 do_remove:
0c627cdc 2554 tcg_op_remove(s, op);
49516bc0
AJ
2555 } else {
2556 do_not_remove:
49516bc0 2557 /* output args are dead */
c45cb8bb 2558 for (i = 0; i < nb_oargs; i++) {
b83eabea
RH
2559 arg_ts = arg_temp(op->args[i]);
2560 if (arg_ts->state & TS_DEAD) {
a1b3c48d 2561 arg_life |= DEAD_ARG << i;
6b64b624 2562 }
b83eabea 2563 if (arg_ts->state & TS_MEM) {
a1b3c48d 2564 arg_life |= SYNC_ARG << i;
9c43b68d 2565 }
b83eabea 2566 arg_ts->state = TS_DEAD;
49516bc0
AJ
2567 }
2568
2569 /* if end of basic block, update */
2570 if (def->flags & TCG_OPF_BB_END) {
b83eabea 2571 tcg_la_bb_end(s);
3d5c5f87
AJ
2572 } else if (def->flags & TCG_OPF_SIDE_EFFECTS) {
2573 /* globals should be synced to memory */
c70fbf0a 2574 for (i = 0; i < nb_globals; i++) {
b83eabea 2575 s->temps[i].state |= TS_MEM;
c70fbf0a 2576 }
49516bc0
AJ
2577 }
2578
c19f47bf 2579 /* record arguments that die in this opcode */
c45cb8bb 2580 for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
b83eabea
RH
2581 arg_ts = arg_temp(op->args[i]);
2582 if (arg_ts->state & TS_DEAD) {
a1b3c48d 2583 arg_life |= DEAD_ARG << i;
c896fe29 2584 }
c19f47bf 2585 }
67cc32eb 2586 /* input arguments are live for preceding opcodes */
c19f47bf 2587 for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
b83eabea 2588 arg_temp(op->args[i])->state &= ~TS_DEAD;
c896fe29 2589 }
c896fe29
FB
2590 }
2591 break;
2592 }
bee158cb 2593 op->life = arg_life;
69e3706d
RH
2594 op->output_pref[0] = 0;
2595 op->output_pref[1] = 0;
1ff0a2c5 2596 }
c896fe29 2597}
c896fe29 2598
5a18407f 2599/* Liveness analysis: Convert indirect regs to direct temporaries. */
b83eabea 2600static bool liveness_pass_2(TCGContext *s)
5a18407f
RH
2601{
2602 int nb_globals = s->nb_globals;
15fa08f8 2603 int nb_temps, i;
5a18407f 2604 bool changes = false;
15fa08f8 2605 TCGOp *op, *op_next;
5a18407f 2606
5a18407f
RH
2607 /* Create a temporary for each indirect global. */
2608 for (i = 0; i < nb_globals; ++i) {
2609 TCGTemp *its = &s->temps[i];
2610 if (its->indirect_reg) {
2611 TCGTemp *dts = tcg_temp_alloc(s);
2612 dts->type = its->type;
2613 dts->base_type = its->base_type;
b83eabea
RH
2614 its->state_ptr = dts;
2615 } else {
2616 its->state_ptr = NULL;
5a18407f 2617 }
b83eabea
RH
2618 /* All globals begin dead. */
2619 its->state = TS_DEAD;
2620 }
2621 for (nb_temps = s->nb_temps; i < nb_temps; ++i) {
2622 TCGTemp *its = &s->temps[i];
2623 its->state_ptr = NULL;
2624 its->state = TS_DEAD;
5a18407f 2625 }
5a18407f 2626
15fa08f8 2627 QTAILQ_FOREACH_SAFE(op, &s->ops, link, op_next) {
5a18407f
RH
2628 TCGOpcode opc = op->opc;
2629 const TCGOpDef *def = &tcg_op_defs[opc];
2630 TCGLifeData arg_life = op->life;
2631 int nb_iargs, nb_oargs, call_flags;
b83eabea 2632 TCGTemp *arg_ts, *dir_ts;
5a18407f 2633
5a18407f 2634 if (opc == INDEX_op_call) {
cd9090aa
RH
2635 nb_oargs = TCGOP_CALLO(op);
2636 nb_iargs = TCGOP_CALLI(op);
efee3746 2637 call_flags = op->args[nb_oargs + nb_iargs + 1];
5a18407f
RH
2638 } else {
2639 nb_iargs = def->nb_iargs;
2640 nb_oargs = def->nb_oargs;
2641
2642 /* Set flags similar to how calls require. */
2643 if (def->flags & TCG_OPF_BB_END) {
2644 /* Like writing globals: save_globals */
2645 call_flags = 0;
2646 } else if (def->flags & TCG_OPF_SIDE_EFFECTS) {
2647 /* Like reading globals: sync_globals */
2648 call_flags = TCG_CALL_NO_WRITE_GLOBALS;
2649 } else {
2650 /* No effect on globals. */
2651 call_flags = (TCG_CALL_NO_READ_GLOBALS |
2652 TCG_CALL_NO_WRITE_GLOBALS);
2653 }
2654 }
2655
2656 /* Make sure that input arguments are available. */
2657 for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
b83eabea
RH
2658 arg_ts = arg_temp(op->args[i]);
2659 if (arg_ts) {
2660 dir_ts = arg_ts->state_ptr;
2661 if (dir_ts && arg_ts->state == TS_DEAD) {
2662 TCGOpcode lopc = (arg_ts->type == TCG_TYPE_I32
5a18407f
RH
2663 ? INDEX_op_ld_i32
2664 : INDEX_op_ld_i64);
ac1043f6 2665 TCGOp *lop = tcg_op_insert_before(s, op, lopc);
5a18407f 2666
b83eabea
RH
2667 lop->args[0] = temp_arg(dir_ts);
2668 lop->args[1] = temp_arg(arg_ts->mem_base);
2669 lop->args[2] = arg_ts->mem_offset;
5a18407f
RH
2670
2671 /* Loaded, but synced with memory. */
b83eabea 2672 arg_ts->state = TS_MEM;
5a18407f
RH
2673 }
2674 }
2675 }
2676
2677 /* Perform input replacement, and mark inputs that became dead.
2678 No action is required except keeping temp_state up to date
2679 so that we reload when needed. */
2680 for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
b83eabea
RH
2681 arg_ts = arg_temp(op->args[i]);
2682 if (arg_ts) {
2683 dir_ts = arg_ts->state_ptr;
2684 if (dir_ts) {
2685 op->args[i] = temp_arg(dir_ts);
5a18407f
RH
2686 changes = true;
2687 if (IS_DEAD_ARG(i)) {
b83eabea 2688 arg_ts->state = TS_DEAD;
5a18407f
RH
2689 }
2690 }
2691 }
2692 }
2693
2694 /* Liveness analysis should ensure that the following are
2695 all correct, for call sites and basic block end points. */
2696 if (call_flags & TCG_CALL_NO_READ_GLOBALS) {
2697 /* Nothing to do */
2698 } else if (call_flags & TCG_CALL_NO_WRITE_GLOBALS) {
2699 for (i = 0; i < nb_globals; ++i) {
2700 /* Liveness should see that globals are synced back,
2701 that is, either TS_DEAD or TS_MEM. */
b83eabea
RH
2702 arg_ts = &s->temps[i];
2703 tcg_debug_assert(arg_ts->state_ptr == 0
2704 || arg_ts->state != 0);
5a18407f
RH
2705 }
2706 } else {
2707 for (i = 0; i < nb_globals; ++i) {
2708 /* Liveness should see that globals are saved back,
2709 that is, TS_DEAD, waiting to be reloaded. */
b83eabea
RH
2710 arg_ts = &s->temps[i];
2711 tcg_debug_assert(arg_ts->state_ptr == 0
2712 || arg_ts->state == TS_DEAD);
5a18407f
RH
2713 }
2714 }
2715
2716 /* Outputs become available. */
2717 for (i = 0; i < nb_oargs; i++) {
b83eabea
RH
2718 arg_ts = arg_temp(op->args[i]);
2719 dir_ts = arg_ts->state_ptr;
2720 if (!dir_ts) {
5a18407f
RH
2721 continue;
2722 }
b83eabea 2723 op->args[i] = temp_arg(dir_ts);
5a18407f
RH
2724 changes = true;
2725
2726 /* The output is now live and modified. */
b83eabea 2727 arg_ts->state = 0;
5a18407f
RH
2728
2729 /* Sync outputs upon their last write. */
2730 if (NEED_SYNC_ARG(i)) {
b83eabea 2731 TCGOpcode sopc = (arg_ts->type == TCG_TYPE_I32
5a18407f
RH
2732 ? INDEX_op_st_i32
2733 : INDEX_op_st_i64);
ac1043f6 2734 TCGOp *sop = tcg_op_insert_after(s, op, sopc);
5a18407f 2735
b83eabea
RH
2736 sop->args[0] = temp_arg(dir_ts);
2737 sop->args[1] = temp_arg(arg_ts->mem_base);
2738 sop->args[2] = arg_ts->mem_offset;
5a18407f 2739
b83eabea 2740 arg_ts->state = TS_MEM;
5a18407f
RH
2741 }
2742 /* Drop outputs that are dead. */
2743 if (IS_DEAD_ARG(i)) {
b83eabea 2744 arg_ts->state = TS_DEAD;
5a18407f
RH
2745 }
2746 }
2747 }
2748
2749 return changes;
2750}
2751
8d8fdbae 2752#ifdef CONFIG_DEBUG_TCG
c896fe29
FB
2753static void dump_regs(TCGContext *s)
2754{
2755 TCGTemp *ts;
2756 int i;
2757 char buf[64];
2758
2759 for(i = 0; i < s->nb_temps; i++) {
2760 ts = &s->temps[i];
43439139 2761 printf(" %10s: ", tcg_get_arg_str_ptr(s, buf, sizeof(buf), ts));
c896fe29
FB
2762 switch(ts->val_type) {
2763 case TEMP_VAL_REG:
2764 printf("%s", tcg_target_reg_names[ts->reg]);
2765 break;
2766 case TEMP_VAL_MEM:
b3a62939
RH
2767 printf("%d(%s)", (int)ts->mem_offset,
2768 tcg_target_reg_names[ts->mem_base->reg]);
c896fe29
FB
2769 break;
2770 case TEMP_VAL_CONST:
2771 printf("$0x%" TCG_PRIlx, ts->val);
2772 break;
2773 case TEMP_VAL_DEAD:
2774 printf("D");
2775 break;
2776 default:
2777 printf("???");
2778 break;
2779 }
2780 printf("\n");
2781 }
2782
2783 for(i = 0; i < TCG_TARGET_NB_REGS; i++) {
f8b2f202 2784 if (s->reg_to_temp[i] != NULL) {
c896fe29
FB
2785 printf("%s: %s\n",
2786 tcg_target_reg_names[i],
f8b2f202 2787 tcg_get_arg_str_ptr(s, buf, sizeof(buf), s->reg_to_temp[i]));
c896fe29
FB
2788 }
2789 }
2790}
2791
2792static void check_regs(TCGContext *s)
2793{
869938ae 2794 int reg;
b6638662 2795 int k;
c896fe29
FB
2796 TCGTemp *ts;
2797 char buf[64];
2798
f8b2f202
RH
2799 for (reg = 0; reg < TCG_TARGET_NB_REGS; reg++) {
2800 ts = s->reg_to_temp[reg];
2801 if (ts != NULL) {
2802 if (ts->val_type != TEMP_VAL_REG || ts->reg != reg) {
c896fe29
FB
2803 printf("Inconsistency for register %s:\n",
2804 tcg_target_reg_names[reg]);
b03cce8e 2805 goto fail;
c896fe29
FB
2806 }
2807 }
2808 }
f8b2f202 2809 for (k = 0; k < s->nb_temps; k++) {
c896fe29 2810 ts = &s->temps[k];
f8b2f202
RH
2811 if (ts->val_type == TEMP_VAL_REG && !ts->fixed_reg
2812 && s->reg_to_temp[ts->reg] != ts) {
2813 printf("Inconsistency for temp %s:\n",
2814 tcg_get_arg_str_ptr(s, buf, sizeof(buf), ts));
b03cce8e 2815 fail:
f8b2f202
RH
2816 printf("reg state:\n");
2817 dump_regs(s);
2818 tcg_abort();
c896fe29
FB
2819 }
2820 }
2821}
2822#endif
2823
2272e4a7 2824static void temp_allocate_frame(TCGContext *s, TCGTemp *ts)
c896fe29 2825{
9b9c37c3
RH
2826#if !(defined(__sparc__) && TCG_TARGET_REG_BITS == 64)
2827 /* Sparc64 stack is accessed with offset of 2047 */
b591dc59
BS
2828 s->current_frame_offset = (s->current_frame_offset +
2829 (tcg_target_long)sizeof(tcg_target_long) - 1) &
2830 ~(sizeof(tcg_target_long) - 1);
f44c9960 2831#endif
b591dc59
BS
2832 if (s->current_frame_offset + (tcg_target_long)sizeof(tcg_target_long) >
2833 s->frame_end) {
5ff9d6a4 2834 tcg_abort();
b591dc59 2835 }
c896fe29 2836 ts->mem_offset = s->current_frame_offset;
b3a62939 2837 ts->mem_base = s->frame_temp;
c896fe29 2838 ts->mem_allocated = 1;
e2c6d1b4 2839 s->current_frame_offset += sizeof(tcg_target_long);
c896fe29
FB
2840}
2841
b722452a 2842static void temp_load(TCGContext *, TCGTemp *, TCGRegSet, TCGRegSet, TCGRegSet);
b3915dbb 2843
59d7c14e
RH
2844/* Mark a temporary as free or dead. If 'free_or_dead' is negative,
2845 mark it free; otherwise mark it dead. */
2846static void temp_free_or_dead(TCGContext *s, TCGTemp *ts, int free_or_dead)
7f6ceedf 2847{
59d7c14e
RH
2848 if (ts->fixed_reg) {
2849 return;
2850 }
2851 if (ts->val_type == TEMP_VAL_REG) {
2852 s->reg_to_temp[ts->reg] = NULL;
2853 }
2854 ts->val_type = (free_or_dead < 0
2855 || ts->temp_local
fa477d25 2856 || ts->temp_global
59d7c14e
RH
2857 ? TEMP_VAL_MEM : TEMP_VAL_DEAD);
2858}
7f6ceedf 2859
59d7c14e
RH
2860/* Mark a temporary as dead. */
2861static inline void temp_dead(TCGContext *s, TCGTemp *ts)
2862{
2863 temp_free_or_dead(s, ts, 1);
2864}
2865
2866/* Sync a temporary to memory. 'allocated_regs' is used in case a temporary
2867 registers needs to be allocated to store a constant. If 'free_or_dead'
2868 is non-zero, subsequently release the temporary; if it is positive, the
2869 temp is dead; if it is negative, the temp is free. */
98b4e186
RH
2870static void temp_sync(TCGContext *s, TCGTemp *ts, TCGRegSet allocated_regs,
2871 TCGRegSet preferred_regs, int free_or_dead)
59d7c14e
RH
2872{
2873 if (ts->fixed_reg) {
2874 return;
2875 }
2876 if (!ts->mem_coherent) {
7f6ceedf 2877 if (!ts->mem_allocated) {
2272e4a7 2878 temp_allocate_frame(s, ts);
59d7c14e 2879 }
59d7c14e
RH
2880 switch (ts->val_type) {
2881 case TEMP_VAL_CONST:
2882 /* If we're going to free the temp immediately, then we won't
2883 require it later in a register, so attempt to store the
2884 constant to memory directly. */
2885 if (free_or_dead
2886 && tcg_out_sti(s, ts->type, ts->val,
2887 ts->mem_base->reg, ts->mem_offset)) {
2888 break;
2889 }
2890 temp_load(s, ts, tcg_target_available_regs[ts->type],
98b4e186 2891 allocated_regs, preferred_regs);
59d7c14e
RH
2892 /* fallthrough */
2893
2894 case TEMP_VAL_REG:
2895 tcg_out_st(s, ts->type, ts->reg,
2896 ts->mem_base->reg, ts->mem_offset);
2897 break;
2898
2899 case TEMP_VAL_MEM:
2900 break;
2901
2902 case TEMP_VAL_DEAD:
2903 default:
2904 tcg_abort();
2905 }
2906 ts->mem_coherent = 1;
2907 }
2908 if (free_or_dead) {
2909 temp_free_or_dead(s, ts, free_or_dead);
7f6ceedf 2910 }
7f6ceedf
AJ
2911}
2912
c896fe29 2913/* free register 'reg' by spilling the corresponding temporary if necessary */
b3915dbb 2914static void tcg_reg_free(TCGContext *s, TCGReg reg, TCGRegSet allocated_regs)
c896fe29 2915{
f8b2f202 2916 TCGTemp *ts = s->reg_to_temp[reg];
f8b2f202 2917 if (ts != NULL) {
98b4e186 2918 temp_sync(s, ts, allocated_regs, 0, -1);
c896fe29
FB
2919 }
2920}
2921
b016486e
RH
2922/**
2923 * tcg_reg_alloc:
2924 * @required_regs: Set of registers in which we must allocate.
2925 * @allocated_regs: Set of registers which must be avoided.
2926 * @preferred_regs: Set of registers we should prefer.
2927 * @rev: True if we search the registers in "indirect" order.
2928 *
2929 * The allocated register must be in @required_regs & ~@allocated_regs,
2930 * but if we can put it in @preferred_regs we may save a move later.
2931 */
2932static TCGReg tcg_reg_alloc(TCGContext *s, TCGRegSet required_regs,
2933 TCGRegSet allocated_regs,
2934 TCGRegSet preferred_regs, bool rev)
c896fe29 2935{
b016486e
RH
2936 int i, j, f, n = ARRAY_SIZE(tcg_target_reg_alloc_order);
2937 TCGRegSet reg_ct[2];
91478cef 2938 const int *order;
c896fe29 2939
b016486e
RH
2940 reg_ct[1] = required_regs & ~allocated_regs;
2941 tcg_debug_assert(reg_ct[1] != 0);
2942 reg_ct[0] = reg_ct[1] & preferred_regs;
2943
2944 /* Skip the preferred_regs option if it cannot be satisfied,
2945 or if the preference made no difference. */
2946 f = reg_ct[0] == 0 || reg_ct[0] == reg_ct[1];
2947
91478cef 2948 order = rev ? indirect_reg_alloc_order : tcg_target_reg_alloc_order;
c896fe29 2949
b016486e
RH
2950 /* Try free registers, preferences first. */
2951 for (j = f; j < 2; j++) {
2952 TCGRegSet set = reg_ct[j];
2953
2954 if (tcg_regset_single(set)) {
2955 /* One register in the set. */
2956 TCGReg reg = tcg_regset_first(set);
2957 if (s->reg_to_temp[reg] == NULL) {
2958 return reg;
2959 }
2960 } else {
2961 for (i = 0; i < n; i++) {
2962 TCGReg reg = order[i];
2963 if (s->reg_to_temp[reg] == NULL &&
2964 tcg_regset_test_reg(set, reg)) {
2965 return reg;
2966 }
2967 }
2968 }
c896fe29
FB
2969 }
2970
b016486e
RH
2971 /* We must spill something. */
2972 for (j = f; j < 2; j++) {
2973 TCGRegSet set = reg_ct[j];
2974
2975 if (tcg_regset_single(set)) {
2976 /* One register in the set. */
2977 TCGReg reg = tcg_regset_first(set);
b3915dbb 2978 tcg_reg_free(s, reg, allocated_regs);
c896fe29 2979 return reg;
b016486e
RH
2980 } else {
2981 for (i = 0; i < n; i++) {
2982 TCGReg reg = order[i];
2983 if (tcg_regset_test_reg(set, reg)) {
2984 tcg_reg_free(s, reg, allocated_regs);
2985 return reg;
2986 }
2987 }
c896fe29
FB
2988 }
2989 }
2990
2991 tcg_abort();
2992}
2993
40ae5c62
RH
2994/* Make sure the temporary is in a register. If needed, allocate the register
2995 from DESIRED while avoiding ALLOCATED. */
2996static void temp_load(TCGContext *s, TCGTemp *ts, TCGRegSet desired_regs,
b722452a 2997 TCGRegSet allocated_regs, TCGRegSet preferred_regs)
40ae5c62
RH
2998{
2999 TCGReg reg;
3000
3001 switch (ts->val_type) {
3002 case TEMP_VAL_REG:
3003 return;
3004 case TEMP_VAL_CONST:
b016486e 3005 reg = tcg_reg_alloc(s, desired_regs, allocated_regs,
b722452a 3006 preferred_regs, ts->indirect_base);
40ae5c62
RH
3007 tcg_out_movi(s, ts->type, reg, ts->val);
3008 ts->mem_coherent = 0;
3009 break;
3010 case TEMP_VAL_MEM:
b016486e 3011 reg = tcg_reg_alloc(s, desired_regs, allocated_regs,
b722452a 3012 preferred_regs, ts->indirect_base);
40ae5c62
RH
3013 tcg_out_ld(s, ts->type, reg, ts->mem_base->reg, ts->mem_offset);
3014 ts->mem_coherent = 1;
3015 break;
3016 case TEMP_VAL_DEAD:
3017 default:
3018 tcg_abort();
3019 }
3020 ts->reg = reg;
3021 ts->val_type = TEMP_VAL_REG;
3022 s->reg_to_temp[reg] = ts;
3023}
3024
59d7c14e
RH
3025/* Save a temporary to memory. 'allocated_regs' is used in case a
3026 temporary registers needs to be allocated to store a constant. */
3027static void temp_save(TCGContext *s, TCGTemp *ts, TCGRegSet allocated_regs)
1ad80729 3028{
5a18407f
RH
3029 /* The liveness analysis already ensures that globals are back
3030 in memory. Keep an tcg_debug_assert for safety. */
3031 tcg_debug_assert(ts->val_type == TEMP_VAL_MEM || ts->fixed_reg);
1ad80729
AJ
3032}
3033
9814dd27 3034/* save globals to their canonical location and assume they can be
e8996ee0
FB
3035 modified be the following code. 'allocated_regs' is used in case a
3036 temporary registers needs to be allocated to store a constant. */
3037static void save_globals(TCGContext *s, TCGRegSet allocated_regs)
c896fe29 3038{
ac3b8891 3039 int i, n;
c896fe29 3040
ac3b8891 3041 for (i = 0, n = s->nb_globals; i < n; i++) {
b13eb728 3042 temp_save(s, &s->temps[i], allocated_regs);
c896fe29 3043 }
e5097dc8
FB
3044}
3045
3d5c5f87
AJ
3046/* sync globals to their canonical location and assume they can be
3047 read by the following code. 'allocated_regs' is used in case a
3048 temporary registers needs to be allocated to store a constant. */
3049static void sync_globals(TCGContext *s, TCGRegSet allocated_regs)
3050{
ac3b8891 3051 int i, n;
3d5c5f87 3052
ac3b8891 3053 for (i = 0, n = s->nb_globals; i < n; i++) {
12b9b11a 3054 TCGTemp *ts = &s->temps[i];
5a18407f
RH
3055 tcg_debug_assert(ts->val_type != TEMP_VAL_REG
3056 || ts->fixed_reg
3057 || ts->mem_coherent);
3d5c5f87
AJ
3058 }
3059}
3060
e5097dc8 3061/* at the end of a basic block, we assume all temporaries are dead and
e8996ee0
FB
3062 all globals are stored at their canonical location. */
3063static void tcg_reg_alloc_bb_end(TCGContext *s, TCGRegSet allocated_regs)
e5097dc8 3064{
e5097dc8
FB
3065 int i;
3066
b13eb728
RH
3067 for (i = s->nb_globals; i < s->nb_temps; i++) {
3068 TCGTemp *ts = &s->temps[i];
641d5fbe 3069 if (ts->temp_local) {
b13eb728 3070 temp_save(s, ts, allocated_regs);
641d5fbe 3071 } else {
5a18407f
RH
3072 /* The liveness analysis already ensures that temps are dead.
3073 Keep an tcg_debug_assert for safety. */
3074 tcg_debug_assert(ts->val_type == TEMP_VAL_DEAD);
c896fe29
FB
3075 }
3076 }
e8996ee0
FB
3077
3078 save_globals(s, allocated_regs);
c896fe29
FB
3079}
3080
0fe4fca4 3081static void tcg_reg_alloc_do_movi(TCGContext *s, TCGTemp *ots,
ba87719c
RH
3082 tcg_target_ulong val, TCGLifeData arg_life,
3083 TCGRegSet preferred_regs)
e8996ee0 3084{
e8996ee0 3085 if (ots->fixed_reg) {
59d7c14e 3086 /* For fixed registers, we do not do any constant propagation. */
e8996ee0 3087 tcg_out_movi(s, ots->type, ots->reg, val);
59d7c14e 3088 return;
e8996ee0 3089 }
59d7c14e
RH
3090
3091 /* The movi is not explicitly generated here. */
3092 if (ots->val_type == TEMP_VAL_REG) {
3093 s->reg_to_temp[ots->reg] = NULL;
ec7a869d 3094 }
59d7c14e
RH
3095 ots->val_type = TEMP_VAL_CONST;
3096 ots->val = val;
3097 ots->mem_coherent = 0;
3098 if (NEED_SYNC_ARG(0)) {
ba87719c 3099 temp_sync(s, ots, s->reserved_regs, preferred_regs, IS_DEAD_ARG(0));
59d7c14e 3100 } else if (IS_DEAD_ARG(0)) {
f8bf00f1 3101 temp_dead(s, ots);
4c4e1ab2 3102 }
e8996ee0
FB
3103}
3104
dd186292 3105static void tcg_reg_alloc_movi(TCGContext *s, const TCGOp *op)
0fe4fca4 3106{
43439139 3107 TCGTemp *ots = arg_temp(op->args[0]);
dd186292 3108 tcg_target_ulong val = op->args[1];
0fe4fca4 3109
69e3706d 3110 tcg_reg_alloc_do_movi(s, ots, val, op->life, op->output_pref[0]);
0fe4fca4
PB
3111}
3112
dd186292 3113static void tcg_reg_alloc_mov(TCGContext *s, const TCGOp *op)
c896fe29 3114{
dd186292 3115 const TCGLifeData arg_life = op->life;
69e3706d 3116 TCGRegSet allocated_regs, preferred_regs;
c896fe29 3117 TCGTemp *ts, *ots;
450445d5 3118 TCGType otype, itype;
c896fe29 3119
d21369f5 3120 allocated_regs = s->reserved_regs;
69e3706d 3121 preferred_regs = op->output_pref[0];
43439139
RH
3122 ots = arg_temp(op->args[0]);
3123 ts = arg_temp(op->args[1]);
450445d5
RH
3124
3125 /* Note that otype != itype for no-op truncation. */
3126 otype = ots->type;
3127 itype = ts->type;
c29c1d7e 3128
0fe4fca4
PB
3129 if (ts->val_type == TEMP_VAL_CONST) {
3130 /* propagate constant or generate sti */
3131 tcg_target_ulong val = ts->val;
3132 if (IS_DEAD_ARG(1)) {
3133 temp_dead(s, ts);
3134 }
69e3706d 3135 tcg_reg_alloc_do_movi(s, ots, val, arg_life, preferred_regs);
0fe4fca4
PB
3136 return;
3137 }
3138
3139 /* If the source value is in memory we're going to be forced
3140 to have it in a register in order to perform the copy. Copy
3141 the SOURCE value into its own register first, that way we
3142 don't have to reload SOURCE the next time it is used. */
3143 if (ts->val_type == TEMP_VAL_MEM) {
69e3706d
RH
3144 temp_load(s, ts, tcg_target_available_regs[itype],
3145 allocated_regs, preferred_regs);
c29c1d7e 3146 }
c896fe29 3147
0fe4fca4 3148 tcg_debug_assert(ts->val_type == TEMP_VAL_REG);
c29c1d7e
AJ
3149 if (IS_DEAD_ARG(0) && !ots->fixed_reg) {
3150 /* mov to a non-saved dead register makes no sense (even with
3151 liveness analysis disabled). */
eabb7b91 3152 tcg_debug_assert(NEED_SYNC_ARG(0));
c29c1d7e 3153 if (!ots->mem_allocated) {
2272e4a7 3154 temp_allocate_frame(s, ots);
c29c1d7e 3155 }
b3a62939 3156 tcg_out_st(s, otype, ts->reg, ots->mem_base->reg, ots->mem_offset);
c29c1d7e 3157 if (IS_DEAD_ARG(1)) {
f8bf00f1 3158 temp_dead(s, ts);
c29c1d7e 3159 }
f8bf00f1 3160 temp_dead(s, ots);
c29c1d7e 3161 } else {
866cb6cb 3162 if (IS_DEAD_ARG(1) && !ts->fixed_reg && !ots->fixed_reg) {
c896fe29 3163 /* the mov can be suppressed */
c29c1d7e 3164 if (ots->val_type == TEMP_VAL_REG) {
f8b2f202 3165 s->reg_to_temp[ots->reg] = NULL;
c29c1d7e
AJ
3166 }
3167 ots->reg = ts->reg;
f8bf00f1 3168 temp_dead(s, ts);
c896fe29 3169 } else {
c29c1d7e
AJ
3170 if (ots->val_type != TEMP_VAL_REG) {
3171 /* When allocating a new register, make sure to not spill the
3172 input one. */
3173 tcg_regset_set_reg(allocated_regs, ts->reg);
450445d5 3174 ots->reg = tcg_reg_alloc(s, tcg_target_available_regs[otype],
69e3706d 3175 allocated_regs, preferred_regs,
b016486e 3176 ots->indirect_base);
c896fe29 3177 }
450445d5 3178 tcg_out_mov(s, otype, ots->reg, ts->reg);
c896fe29 3179 }
c29c1d7e
AJ
3180 ots->val_type = TEMP_VAL_REG;
3181 ots->mem_coherent = 0;
f8b2f202 3182 s->reg_to_temp[ots->reg] = ots;
c29c1d7e 3183 if (NEED_SYNC_ARG(0)) {
98b4e186 3184 temp_sync(s, ots, allocated_regs, 0, 0);
c896fe29 3185 }
ec7a869d 3186 }
c896fe29
FB
3187}
3188
dd186292 3189static void tcg_reg_alloc_op(TCGContext *s, const TCGOp *op)
c896fe29 3190{
dd186292
RH
3191 const TCGLifeData arg_life = op->life;
3192 const TCGOpDef * const def = &tcg_op_defs[op->opc];
82790a87
RH
3193 TCGRegSet i_allocated_regs;
3194 TCGRegSet o_allocated_regs;
b6638662
RH
3195 int i, k, nb_iargs, nb_oargs;
3196 TCGReg reg;
c896fe29
FB
3197 TCGArg arg;
3198 const TCGArgConstraint *arg_ct;
3199 TCGTemp *ts;
3200 TCGArg new_args[TCG_MAX_OP_ARGS];
3201 int const_args[TCG_MAX_OP_ARGS];
3202
3203 nb_oargs = def->nb_oargs;
3204 nb_iargs = def->nb_iargs;
3205
3206 /* copy constants */
3207 memcpy(new_args + nb_oargs + nb_iargs,
dd186292 3208 op->args + nb_oargs + nb_iargs,
c896fe29
FB
3209 sizeof(TCGArg) * def->nb_cargs);
3210
d21369f5
RH
3211 i_allocated_regs = s->reserved_regs;
3212 o_allocated_regs = s->reserved_regs;
82790a87 3213
c896fe29 3214 /* satisfy input constraints */
dd186292 3215 for (k = 0; k < nb_iargs; k++) {
d62816f2
RH
3216 TCGRegSet i_preferred_regs, o_preferred_regs;
3217
c896fe29 3218 i = def->sorted_args[nb_oargs + k];
dd186292 3219 arg = op->args[i];
c896fe29 3220 arg_ct = &def->args_ct[i];
43439139 3221 ts = arg_temp(arg);
40ae5c62
RH
3222
3223 if (ts->val_type == TEMP_VAL_CONST
3224 && tcg_target_const_match(ts->val, ts->type, arg_ct)) {
3225 /* constant is OK for instruction */
3226 const_args[i] = 1;
3227 new_args[i] = ts->val;
d62816f2 3228 continue;
c896fe29 3229 }
40ae5c62 3230
d62816f2 3231 i_preferred_regs = o_preferred_regs = 0;
5ff9d6a4 3232 if (arg_ct->ct & TCG_CT_IALIAS) {
d62816f2 3233 o_preferred_regs = op->output_pref[arg_ct->alias_index];
5ff9d6a4
FB
3234 if (ts->fixed_reg) {
3235 /* if fixed register, we must allocate a new register
3236 if the alias is not the same register */
d62816f2 3237 if (arg != op->args[arg_ct->alias_index]) {
5ff9d6a4 3238 goto allocate_in_reg;
d62816f2 3239 }
5ff9d6a4
FB
3240 } else {
3241 /* if the input is aliased to an output and if it is
3242 not dead after the instruction, we must allocate
3243 a new register and move it */
866cb6cb 3244 if (!IS_DEAD_ARG(i)) {
5ff9d6a4 3245 goto allocate_in_reg;
866cb6cb 3246 }
d62816f2 3247
7e1df267
AJ
3248 /* check if the current register has already been allocated
3249 for another input aliased to an output */
d62816f2
RH
3250 if (ts->val_type == TEMP_VAL_REG) {
3251 int k2, i2;
3252 reg = ts->reg;
3253 for (k2 = 0 ; k2 < k ; k2++) {
3254 i2 = def->sorted_args[nb_oargs + k2];
3255 if ((def->args_ct[i2].ct & TCG_CT_IALIAS) &&
3256 reg == new_args[i2]) {
3257 goto allocate_in_reg;
3258 }
7e1df267
AJ
3259 }
3260 }
d62816f2 3261 i_preferred_regs = o_preferred_regs;
5ff9d6a4 3262 }
c896fe29 3263 }
d62816f2
RH
3264
3265 temp_load(s, ts, arg_ct->u.regs, i_allocated_regs, i_preferred_regs);
c896fe29 3266 reg = ts->reg;
d62816f2 3267
c896fe29
FB
3268 if (tcg_regset_test_reg(arg_ct->u.regs, reg)) {
3269 /* nothing to do : the constraint is satisfied */
3270 } else {
3271 allocate_in_reg:
3272 /* allocate a new register matching the constraint
3273 and move the temporary register into it */
d62816f2
RH
3274 temp_load(s, ts, tcg_target_available_regs[ts->type],
3275 i_allocated_regs, 0);
82790a87 3276 reg = tcg_reg_alloc(s, arg_ct->u.regs, i_allocated_regs,
d62816f2 3277 o_preferred_regs, ts->indirect_base);
3b6dac34 3278 tcg_out_mov(s, ts->type, reg, ts->reg);
c896fe29 3279 }
c896fe29
FB
3280 new_args[i] = reg;
3281 const_args[i] = 0;
82790a87 3282 tcg_regset_set_reg(i_allocated_regs, reg);
c896fe29
FB
3283 }
3284
a52ad07e
AJ
3285 /* mark dead temporaries and free the associated registers */
3286 for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
3287 if (IS_DEAD_ARG(i)) {
43439139 3288 temp_dead(s, arg_temp(op->args[i]));
a52ad07e
AJ
3289 }
3290 }
3291
e8996ee0 3292 if (def->flags & TCG_OPF_BB_END) {
82790a87 3293 tcg_reg_alloc_bb_end(s, i_allocated_regs);
e8996ee0 3294 } else {
e8996ee0
FB
3295 if (def->flags & TCG_OPF_CALL_CLOBBER) {
3296 /* XXX: permit generic clobber register list ? */
c8074023
RH
3297 for (i = 0; i < TCG_TARGET_NB_REGS; i++) {
3298 if (tcg_regset_test_reg(tcg_target_call_clobber_regs, i)) {
82790a87 3299 tcg_reg_free(s, i, i_allocated_regs);
e8996ee0 3300 }
c896fe29 3301 }
3d5c5f87
AJ
3302 }
3303 if (def->flags & TCG_OPF_SIDE_EFFECTS) {
3304 /* sync globals if the op has side effects and might trigger
3305 an exception. */
82790a87 3306 sync_globals(s, i_allocated_regs);
c896fe29 3307 }
e8996ee0
FB
3308
3309 /* satisfy the output constraints */
e8996ee0
FB
3310 for(k = 0; k < nb_oargs; k++) {
3311 i = def->sorted_args[k];
dd186292 3312 arg = op->args[i];
e8996ee0 3313 arg_ct = &def->args_ct[i];
43439139 3314 ts = arg_temp(arg);
17280ff4
RH
3315 if ((arg_ct->ct & TCG_CT_ALIAS)
3316 && !const_args[arg_ct->alias_index]) {
e8996ee0 3317 reg = new_args[arg_ct->alias_index];
82790a87
RH
3318 } else if (arg_ct->ct & TCG_CT_NEWREG) {
3319 reg = tcg_reg_alloc(s, arg_ct->u.regs,
3320 i_allocated_regs | o_allocated_regs,
69e3706d 3321 op->output_pref[k], ts->indirect_base);
e8996ee0
FB
3322 } else {
3323 /* if fixed register, we try to use it */
3324 reg = ts->reg;
3325 if (ts->fixed_reg &&
3326 tcg_regset_test_reg(arg_ct->u.regs, reg)) {
3327 goto oarg_end;
3328 }
82790a87 3329 reg = tcg_reg_alloc(s, arg_ct->u.regs, o_allocated_regs,
69e3706d 3330 op->output_pref[k], ts->indirect_base);
c896fe29 3331 }
82790a87 3332 tcg_regset_set_reg(o_allocated_regs, reg);
e8996ee0
FB
3333 /* if a fixed register is used, then a move will be done afterwards */
3334 if (!ts->fixed_reg) {
ec7a869d 3335 if (ts->val_type == TEMP_VAL_REG) {
f8b2f202 3336 s->reg_to_temp[ts->reg] = NULL;
ec7a869d
AJ
3337 }
3338 ts->val_type = TEMP_VAL_REG;
3339 ts->reg = reg;
3340 /* temp value is modified, so the value kept in memory is
3341 potentially not the same */
3342 ts->mem_coherent = 0;
f8b2f202 3343 s->reg_to_temp[reg] = ts;
e8996ee0
FB
3344 }
3345 oarg_end:
3346 new_args[i] = reg;
c896fe29 3347 }
c896fe29
FB
3348 }
3349
c896fe29 3350 /* emit instruction */
d2fd745f
RH
3351 if (def->flags & TCG_OPF_VECTOR) {
3352 tcg_out_vec_op(s, op->opc, TCGOP_VECL(op), TCGOP_VECE(op),
3353 new_args, const_args);
3354 } else {
3355 tcg_out_op(s, op->opc, new_args, const_args);
3356 }
3357
c896fe29
FB
3358 /* move the outputs in the correct register if needed */
3359 for(i = 0; i < nb_oargs; i++) {
43439139 3360 ts = arg_temp(op->args[i]);
c896fe29
FB
3361 reg = new_args[i];
3362 if (ts->fixed_reg && ts->reg != reg) {
3b6dac34 3363 tcg_out_mov(s, ts->type, ts->reg, reg);
c896fe29 3364 }
ec7a869d 3365 if (NEED_SYNC_ARG(i)) {
98b4e186 3366 temp_sync(s, ts, o_allocated_regs, 0, IS_DEAD_ARG(i));
59d7c14e 3367 } else if (IS_DEAD_ARG(i)) {
f8bf00f1 3368 temp_dead(s, ts);
ec7a869d 3369 }
c896fe29
FB
3370 }
3371}
3372
b03cce8e
FB
3373#ifdef TCG_TARGET_STACK_GROWSUP
3374#define STACK_DIR(x) (-(x))
3375#else
3376#define STACK_DIR(x) (x)
3377#endif
3378
dd186292 3379static void tcg_reg_alloc_call(TCGContext *s, TCGOp *op)
c896fe29 3380{
cd9090aa
RH
3381 const int nb_oargs = TCGOP_CALLO(op);
3382 const int nb_iargs = TCGOP_CALLI(op);
dd186292 3383 const TCGLifeData arg_life = op->life;
b6638662
RH
3384 int flags, nb_regs, i;
3385 TCGReg reg;
cf066674 3386 TCGArg arg;
c896fe29 3387 TCGTemp *ts;
d3452f1f
RH
3388 intptr_t stack_offset;
3389 size_t call_stack_size;
cf066674
RH
3390 tcg_insn_unit *func_addr;
3391 int allocate_args;
c896fe29 3392 TCGRegSet allocated_regs;
c896fe29 3393
dd186292
RH
3394 func_addr = (tcg_insn_unit *)(intptr_t)op->args[nb_oargs + nb_iargs];
3395 flags = op->args[nb_oargs + nb_iargs + 1];
c896fe29 3396
6e17d0c5 3397 nb_regs = ARRAY_SIZE(tcg_target_call_iarg_regs);
c45cb8bb
RH
3398 if (nb_regs > nb_iargs) {
3399 nb_regs = nb_iargs;
cf066674 3400 }
c896fe29
FB
3401
3402 /* assign stack slots first */
c45cb8bb 3403 call_stack_size = (nb_iargs - nb_regs) * sizeof(tcg_target_long);
c896fe29
FB
3404 call_stack_size = (call_stack_size + TCG_TARGET_STACK_ALIGN - 1) &
3405 ~(TCG_TARGET_STACK_ALIGN - 1);
b03cce8e
FB
3406 allocate_args = (call_stack_size > TCG_STATIC_CALL_ARGS_SIZE);
3407 if (allocate_args) {
345649c0
BS
3408 /* XXX: if more than TCG_STATIC_CALL_ARGS_SIZE is needed,
3409 preallocate call stack */
3410 tcg_abort();
b03cce8e 3411 }
39cf05d3
FB
3412
3413 stack_offset = TCG_TARGET_CALL_STACK_OFFSET;
dd186292
RH
3414 for (i = nb_regs; i < nb_iargs; i++) {
3415 arg = op->args[nb_oargs + i];
39cf05d3
FB
3416#ifdef TCG_TARGET_STACK_GROWSUP
3417 stack_offset -= sizeof(tcg_target_long);
3418#endif
3419 if (arg != TCG_CALL_DUMMY_ARG) {
43439139 3420 ts = arg_temp(arg);
40ae5c62 3421 temp_load(s, ts, tcg_target_available_regs[ts->type],
b722452a 3422 s->reserved_regs, 0);
40ae5c62 3423 tcg_out_st(s, ts->type, ts->reg, TCG_REG_CALL_STACK, stack_offset);
c896fe29 3424 }
39cf05d3
FB
3425#ifndef TCG_TARGET_STACK_GROWSUP
3426 stack_offset += sizeof(tcg_target_long);
3427#endif
c896fe29
FB
3428 }
3429
3430 /* assign input registers */
d21369f5 3431 allocated_regs = s->reserved_regs;
dd186292
RH
3432 for (i = 0; i < nb_regs; i++) {
3433 arg = op->args[nb_oargs + i];
39cf05d3 3434 if (arg != TCG_CALL_DUMMY_ARG) {
43439139 3435 ts = arg_temp(arg);
39cf05d3 3436 reg = tcg_target_call_iarg_regs[i];
b3915dbb 3437 tcg_reg_free(s, reg, allocated_regs);
40ae5c62 3438
39cf05d3
FB
3439 if (ts->val_type == TEMP_VAL_REG) {
3440 if (ts->reg != reg) {
3b6dac34 3441 tcg_out_mov(s, ts->type, reg, ts->reg);
39cf05d3 3442 }
39cf05d3 3443 } else {
ccb1bb66 3444 TCGRegSet arg_set = 0;
40ae5c62 3445
40ae5c62 3446 tcg_regset_set_reg(arg_set, reg);
b722452a 3447 temp_load(s, ts, arg_set, allocated_regs, 0);
c896fe29 3448 }
40ae5c62 3449
39cf05d3 3450 tcg_regset_set_reg(allocated_regs, reg);
c896fe29 3451 }
c896fe29
FB
3452 }
3453
c896fe29 3454 /* mark dead temporaries and free the associated registers */
dd186292 3455 for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
866cb6cb 3456 if (IS_DEAD_ARG(i)) {
43439139 3457 temp_dead(s, arg_temp(op->args[i]));
c896fe29
FB
3458 }
3459 }
3460
3461 /* clobber call registers */
c8074023
RH
3462 for (i = 0; i < TCG_TARGET_NB_REGS; i++) {
3463 if (tcg_regset_test_reg(tcg_target_call_clobber_regs, i)) {
b3915dbb 3464 tcg_reg_free(s, i, allocated_regs);
c896fe29
FB
3465 }
3466 }
78505279
AJ
3467
3468 /* Save globals if they might be written by the helper, sync them if
3469 they might be read. */
3470 if (flags & TCG_CALL_NO_READ_GLOBALS) {
3471 /* Nothing to do */
3472 } else if (flags & TCG_CALL_NO_WRITE_GLOBALS) {
3473 sync_globals(s, allocated_regs);
3474 } else {
b9c18f56
AJ
3475 save_globals(s, allocated_regs);
3476 }
c896fe29 3477
cf066674 3478 tcg_out_call(s, func_addr);
c896fe29
FB
3479
3480 /* assign output registers and emit moves if needed */
3481 for(i = 0; i < nb_oargs; i++) {
dd186292 3482 arg = op->args[i];
43439139 3483 ts = arg_temp(arg);
c896fe29 3484 reg = tcg_target_call_oarg_regs[i];
eabb7b91 3485 tcg_debug_assert(s->reg_to_temp[reg] == NULL);
34b1a49c 3486
c896fe29
FB
3487 if (ts->fixed_reg) {
3488 if (ts->reg != reg) {
3b6dac34 3489 tcg_out_mov(s, ts->type, ts->reg, reg);
c896fe29
FB
3490 }
3491 } else {
ec7a869d 3492 if (ts->val_type == TEMP_VAL_REG) {
f8b2f202 3493 s->reg_to_temp[ts->reg] = NULL;
ec7a869d
AJ
3494 }
3495 ts->val_type = TEMP_VAL_REG;
3496 ts->reg = reg;
3497 ts->mem_coherent = 0;
f8b2f202 3498 s->reg_to_temp[reg] = ts;
ec7a869d 3499 if (NEED_SYNC_ARG(i)) {
98b4e186 3500 temp_sync(s, ts, allocated_regs, 0, IS_DEAD_ARG(i));
59d7c14e 3501 } else if (IS_DEAD_ARG(i)) {
f8bf00f1 3502 temp_dead(s, ts);
8c11ad25 3503 }
c896fe29
FB
3504 }
3505 }
c896fe29
FB
3506}
3507
3508#ifdef CONFIG_PROFILER
3509
c3fac113
EC
3510/* avoid copy/paste errors */
3511#define PROF_ADD(to, from, field) \
3512 do { \
3513 (to)->field += atomic_read(&((from)->field)); \
3514 } while (0)
3515
3516#define PROF_MAX(to, from, field) \
3517 do { \
3518 typeof((from)->field) val__ = atomic_read(&((from)->field)); \
3519 if (val__ > (to)->field) { \
3520 (to)->field = val__; \
3521 } \
3522 } while (0)
3523
3524/* Pass in a zero'ed @prof */
3525static inline
3526void tcg_profile_snapshot(TCGProfile *prof, bool counters, bool table)
3527{
3468b59e 3528 unsigned int n_ctxs = atomic_read(&n_tcg_ctxs);
c3fac113
EC
3529 unsigned int i;
3530
3468b59e
EC
3531 for (i = 0; i < n_ctxs; i++) {
3532 TCGContext *s = atomic_read(&tcg_ctxs[i]);
3533 const TCGProfile *orig = &s->prof;
c3fac113
EC
3534
3535 if (counters) {
72fd2efb 3536 PROF_ADD(prof, orig, cpu_exec_time);
c3fac113
EC
3537 PROF_ADD(prof, orig, tb_count1);
3538 PROF_ADD(prof, orig, tb_count);
3539 PROF_ADD(prof, orig, op_count);
3540 PROF_MAX(prof, orig, op_count_max);
3541 PROF_ADD(prof, orig, temp_count);
3542 PROF_MAX(prof, orig, temp_count_max);
3543 PROF_ADD(prof, orig, del_op_count);
3544 PROF_ADD(prof, orig, code_in_len);
3545 PROF_ADD(prof, orig, code_out_len);
3546 PROF_ADD(prof, orig, search_out_len);
3547 PROF_ADD(prof, orig, interm_time);
3548 PROF_ADD(prof, orig, code_time);
3549 PROF_ADD(prof, orig, la_time);
3550 PROF_ADD(prof, orig, opt_time);
3551 PROF_ADD(prof, orig, restore_count);
3552 PROF_ADD(prof, orig, restore_time);
3553 }
3554 if (table) {
3555 int i;
3556
3557 for (i = 0; i < NB_OPS; i++) {
3558 PROF_ADD(prof, orig, table_op_count[i]);
3559 }
3560 }
3561 }
3562}
3563
3564#undef PROF_ADD
3565#undef PROF_MAX
3566
3567static void tcg_profile_snapshot_counters(TCGProfile *prof)
3568{
3569 tcg_profile_snapshot(prof, true, false);
3570}
3571
3572static void tcg_profile_snapshot_table(TCGProfile *prof)
3573{
3574 tcg_profile_snapshot(prof, false, true);
3575}
c896fe29 3576
246ae24d 3577void tcg_dump_op_count(FILE *f, fprintf_function cpu_fprintf)
c896fe29 3578{
c3fac113 3579 TCGProfile prof = {};
c896fe29 3580 int i;
d70724ce 3581
c3fac113 3582 tcg_profile_snapshot_table(&prof);
15fc7daa 3583 for (i = 0; i < NB_OPS; i++) {
246ae24d 3584 cpu_fprintf(f, "%s %" PRId64 "\n", tcg_op_defs[i].name,
c3fac113 3585 prof.table_op_count[i]);
c896fe29 3586 }
c896fe29 3587}
72fd2efb
EC
3588
3589int64_t tcg_cpu_exec_time(void)
3590{
3591 unsigned int n_ctxs = atomic_read(&n_tcg_ctxs);
3592 unsigned int i;
3593 int64_t ret = 0;
3594
3595 for (i = 0; i < n_ctxs; i++) {
3596 const TCGContext *s = atomic_read(&tcg_ctxs[i]);
3597 const TCGProfile *prof = &s->prof;
3598
3599 ret += atomic_read(&prof->cpu_exec_time);
3600 }
3601 return ret;
3602}
246ae24d
MF
3603#else
3604void tcg_dump_op_count(FILE *f, fprintf_function cpu_fprintf)
3605{
3606 cpu_fprintf(f, "[TCG profiler not compiled]\n");
3607}
72fd2efb
EC
3608
3609int64_t tcg_cpu_exec_time(void)
3610{
3611 error_report("%s: TCG profiler not compiled", __func__);
3612 exit(EXIT_FAILURE);
3613}
c896fe29
FB
3614#endif
3615
3616
5bd2ec3d 3617int tcg_gen_code(TCGContext *s, TranslationBlock *tb)
c896fe29 3618{
c3fac113
EC
3619#ifdef CONFIG_PROFILER
3620 TCGProfile *prof = &s->prof;
3621#endif
15fa08f8
RH
3622 int i, num_insns;
3623 TCGOp *op;
c896fe29 3624
04fe6400
RH
3625#ifdef CONFIG_PROFILER
3626 {
c1f543b7 3627 int n = 0;
04fe6400 3628
15fa08f8
RH
3629 QTAILQ_FOREACH(op, &s->ops, link) {
3630 n++;
3631 }
c3fac113
EC
3632 atomic_set(&prof->op_count, prof->op_count + n);
3633 if (n > prof->op_count_max) {
3634 atomic_set(&prof->op_count_max, n);
04fe6400
RH
3635 }
3636
3637 n = s->nb_temps;
c3fac113
EC
3638 atomic_set(&prof->temp_count, prof->temp_count + n);
3639 if (n > prof->temp_count_max) {
3640 atomic_set(&prof->temp_count_max, n);
04fe6400
RH
3641 }
3642 }
3643#endif
3644
c896fe29 3645#ifdef DEBUG_DISAS
d977e1c2
AB
3646 if (unlikely(qemu_loglevel_mask(CPU_LOG_TB_OP)
3647 && qemu_log_in_addr_range(tb->pc))) {
1ee73216 3648 qemu_log_lock();
93fcfe39 3649 qemu_log("OP:\n");
eeacee4d 3650 tcg_dump_ops(s);
93fcfe39 3651 qemu_log("\n");
1ee73216 3652 qemu_log_unlock();
c896fe29
FB
3653 }
3654#endif
3655
c5cc28ff 3656#ifdef CONFIG_PROFILER
c3fac113 3657 atomic_set(&prof->opt_time, prof->opt_time - profile_getclock());
c5cc28ff
AJ
3658#endif
3659
8f2e8c07 3660#ifdef USE_TCG_OPTIMIZATIONS
c45cb8bb 3661 tcg_optimize(s);
8f2e8c07
KB
3662#endif
3663
a23a9ec6 3664#ifdef CONFIG_PROFILER
c3fac113
EC
3665 atomic_set(&prof->opt_time, prof->opt_time + profile_getclock());
3666 atomic_set(&prof->la_time, prof->la_time - profile_getclock());
a23a9ec6 3667#endif
c5cc28ff 3668
b4fc67c7 3669 reachable_code_pass(s);
b83eabea 3670 liveness_pass_1(s);
5a18407f 3671
b83eabea 3672 if (s->nb_indirects > 0) {
5a18407f 3673#ifdef DEBUG_DISAS
b83eabea
RH
3674 if (unlikely(qemu_loglevel_mask(CPU_LOG_TB_OP_IND)
3675 && qemu_log_in_addr_range(tb->pc))) {
3676 qemu_log_lock();
3677 qemu_log("OP before indirect lowering:\n");
3678 tcg_dump_ops(s);
3679 qemu_log("\n");
3680 qemu_log_unlock();
3681 }
5a18407f 3682#endif
b83eabea
RH
3683 /* Replace indirect temps with direct temps. */
3684 if (liveness_pass_2(s)) {
3685 /* If changes were made, re-run liveness. */
3686 liveness_pass_1(s);
5a18407f
RH
3687 }
3688 }
c5cc28ff 3689
a23a9ec6 3690#ifdef CONFIG_PROFILER
c3fac113 3691 atomic_set(&prof->la_time, prof->la_time + profile_getclock());
a23a9ec6 3692#endif
c896fe29
FB
3693
3694#ifdef DEBUG_DISAS
d977e1c2
AB
3695 if (unlikely(qemu_loglevel_mask(CPU_LOG_TB_OP_OPT)
3696 && qemu_log_in_addr_range(tb->pc))) {
1ee73216 3697 qemu_log_lock();
c5cc28ff 3698 qemu_log("OP after optimization and liveness analysis:\n");
eeacee4d 3699 tcg_dump_ops(s);
93fcfe39 3700 qemu_log("\n");
1ee73216 3701 qemu_log_unlock();
c896fe29
FB
3702 }
3703#endif
3704
3705 tcg_reg_alloc_start(s);
3706
e7e168f4
EC
3707 s->code_buf = tb->tc.ptr;
3708 s->code_ptr = tb->tc.ptr;
c896fe29 3709
659ef5cb 3710#ifdef TCG_TARGET_NEED_LDST_LABELS
6001f772 3711 QSIMPLEQ_INIT(&s->ldst_labels);
659ef5cb 3712#endif
57a26946
RH
3713#ifdef TCG_TARGET_NEED_POOL_LABELS
3714 s->pool_labels = NULL;
3715#endif
9ecefc84 3716
fca8a500 3717 num_insns = -1;
15fa08f8 3718 QTAILQ_FOREACH(op, &s->ops, link) {
c45cb8bb 3719 TCGOpcode opc = op->opc;
b3db8758 3720
c896fe29 3721#ifdef CONFIG_PROFILER
c3fac113 3722 atomic_set(&prof->table_op_count[opc], prof->table_op_count[opc] + 1);
c896fe29 3723#endif
c45cb8bb
RH
3724
3725 switch (opc) {
c896fe29 3726 case INDEX_op_mov_i32:
c896fe29 3727 case INDEX_op_mov_i64:
d2fd745f 3728 case INDEX_op_mov_vec:
dd186292 3729 tcg_reg_alloc_mov(s, op);
c896fe29 3730 break;
e8996ee0 3731 case INDEX_op_movi_i32:
e8996ee0 3732 case INDEX_op_movi_i64:
d2fd745f 3733 case INDEX_op_dupi_vec:
dd186292 3734 tcg_reg_alloc_movi(s, op);
e8996ee0 3735 break;
765b842a 3736 case INDEX_op_insn_start:
fca8a500 3737 if (num_insns >= 0) {
9f754620
RH
3738 size_t off = tcg_current_code_size(s);
3739 s->gen_insn_end_off[num_insns] = off;
3740 /* Assert that we do not overflow our stored offset. */
3741 assert(s->gen_insn_end_off[num_insns] == off);
fca8a500
RH
3742 }
3743 num_insns++;
bad729e2
RH
3744 for (i = 0; i < TARGET_INSN_START_WORDS; ++i) {
3745 target_ulong a;
3746#if TARGET_LONG_BITS > TCG_TARGET_REG_BITS
efee3746 3747 a = deposit64(op->args[i * 2], 32, 32, op->args[i * 2 + 1]);
bad729e2 3748#else
efee3746 3749 a = op->args[i];
bad729e2 3750#endif
fca8a500 3751 s->gen_insn_data[num_insns][i] = a;
bad729e2 3752 }
c896fe29 3753 break;
5ff9d6a4 3754 case INDEX_op_discard:
43439139 3755 temp_dead(s, arg_temp(op->args[0]));
5ff9d6a4 3756 break;
c896fe29 3757 case INDEX_op_set_label:
e8996ee0 3758 tcg_reg_alloc_bb_end(s, s->reserved_regs);
efee3746 3759 tcg_out_label(s, arg_label(op->args[0]), s->code_ptr);
c896fe29
FB
3760 break;
3761 case INDEX_op_call:
dd186292 3762 tcg_reg_alloc_call(s, op);
c45cb8bb 3763 break;
c896fe29 3764 default:
25c4d9cc 3765 /* Sanity check that we've not introduced any unhandled opcodes. */
be0f34b5 3766 tcg_debug_assert(tcg_op_supported(opc));
c896fe29
FB
3767 /* Note: in order to speed up the code, it would be much
3768 faster to have specialized register allocator functions for
3769 some common argument patterns */
dd186292 3770 tcg_reg_alloc_op(s, op);
c896fe29
FB
3771 break;
3772 }
8d8fdbae 3773#ifdef CONFIG_DEBUG_TCG
c896fe29
FB
3774 check_regs(s);
3775#endif
b125f9dc
RH
3776 /* Test for (pending) buffer overflow. The assumption is that any
3777 one operation beginning below the high water mark cannot overrun
3778 the buffer completely. Thus we can test for overflow after
3779 generating code without having to check during generation. */
644da9b3 3780 if (unlikely((void *)s->code_ptr > s->code_gen_highwater)) {
b125f9dc
RH
3781 return -1;
3782 }
c896fe29 3783 }
fca8a500
RH
3784 tcg_debug_assert(num_insns >= 0);
3785 s->gen_insn_end_off[num_insns] = tcg_current_code_size(s);
c45cb8bb 3786
b76f0d8c 3787 /* Generate TB finalization at the end of block */
659ef5cb
RH
3788#ifdef TCG_TARGET_NEED_LDST_LABELS
3789 if (!tcg_out_ldst_finalize(s)) {
23dceda6
RH
3790 return -1;
3791 }
659ef5cb 3792#endif
57a26946
RH
3793#ifdef TCG_TARGET_NEED_POOL_LABELS
3794 if (!tcg_out_pool_finalize(s)) {
3795 return -1;
3796 }
3797#endif
c896fe29
FB
3798
3799 /* flush instruction cache */
1813e175 3800 flush_icache_range((uintptr_t)s->code_buf, (uintptr_t)s->code_ptr);
2aeabc08 3801
1813e175 3802 return tcg_current_code_size(s);
c896fe29
FB
3803}
3804
a23a9ec6 3805#ifdef CONFIG_PROFILER
405cf9ff 3806void tcg_dump_info(FILE *f, fprintf_function cpu_fprintf)
a23a9ec6 3807{
c3fac113
EC
3808 TCGProfile prof = {};
3809 const TCGProfile *s;
3810 int64_t tb_count;
3811 int64_t tb_div_count;
3812 int64_t tot;
3813
3814 tcg_profile_snapshot_counters(&prof);
3815 s = &prof;
3816 tb_count = s->tb_count;
3817 tb_div_count = tb_count ? tb_count : 1;
3818 tot = s->interm_time + s->code_time;
a23a9ec6 3819
a23a9ec6
FB
3820 cpu_fprintf(f, "JIT cycles %" PRId64 " (%0.3f s at 2.4 GHz)\n",
3821 tot, tot / 2.4e9);
3822 cpu_fprintf(f, "translated TBs %" PRId64 " (aborted=%" PRId64 " %0.1f%%)\n",
fca8a500
RH
3823 tb_count, s->tb_count1 - tb_count,
3824 (double)(s->tb_count1 - s->tb_count)
3825 / (s->tb_count1 ? s->tb_count1 : 1) * 100.0);
a23a9ec6 3826 cpu_fprintf(f, "avg ops/TB %0.1f max=%d\n",
fca8a500 3827 (double)s->op_count / tb_div_count, s->op_count_max);
a23a9ec6 3828 cpu_fprintf(f, "deleted ops/TB %0.2f\n",
fca8a500 3829 (double)s->del_op_count / tb_div_count);
a23a9ec6 3830 cpu_fprintf(f, "avg temps/TB %0.2f max=%d\n",
fca8a500
RH
3831 (double)s->temp_count / tb_div_count, s->temp_count_max);
3832 cpu_fprintf(f, "avg host code/TB %0.1f\n",
3833 (double)s->code_out_len / tb_div_count);
3834 cpu_fprintf(f, "avg search data/TB %0.1f\n",
3835 (double)s->search_out_len / tb_div_count);
a23a9ec6
FB
3836
3837 cpu_fprintf(f, "cycles/op %0.1f\n",
3838 s->op_count ? (double)tot / s->op_count : 0);
3839 cpu_fprintf(f, "cycles/in byte %0.1f\n",
3840 s->code_in_len ? (double)tot / s->code_in_len : 0);
3841 cpu_fprintf(f, "cycles/out byte %0.1f\n",
3842 s->code_out_len ? (double)tot / s->code_out_len : 0);
fca8a500
RH
3843 cpu_fprintf(f, "cycles/search byte %0.1f\n",
3844 s->search_out_len ? (double)tot / s->search_out_len : 0);
3845 if (tot == 0) {
a23a9ec6 3846 tot = 1;
fca8a500 3847 }
a23a9ec6
FB
3848 cpu_fprintf(f, " gen_interm time %0.1f%%\n",
3849 (double)s->interm_time / tot * 100.0);
3850 cpu_fprintf(f, " gen_code time %0.1f%%\n",
3851 (double)s->code_time / tot * 100.0);
c5cc28ff
AJ
3852 cpu_fprintf(f, "optim./code time %0.1f%%\n",
3853 (double)s->opt_time / (s->code_time ? s->code_time : 1)
3854 * 100.0);
a23a9ec6
FB
3855 cpu_fprintf(f, "liveness/code time %0.1f%%\n",
3856 (double)s->la_time / (s->code_time ? s->code_time : 1) * 100.0);
3857 cpu_fprintf(f, "cpu_restore count %" PRId64 "\n",
3858 s->restore_count);
3859 cpu_fprintf(f, " avg cycles %0.1f\n",
3860 s->restore_count ? (double)s->restore_time / s->restore_count : 0);
a23a9ec6
FB
3861}
3862#else
405cf9ff 3863void tcg_dump_info(FILE *f, fprintf_function cpu_fprintf)
a23a9ec6 3864{
24bf7b3a 3865 cpu_fprintf(f, "[TCG profiler not compiled]\n");
a23a9ec6
FB
3866}
3867#endif
813da627
RH
3868
3869#ifdef ELF_HOST_MACHINE
5872bbf2
RH
3870/* In order to use this feature, the backend needs to do three things:
3871
3872 (1) Define ELF_HOST_MACHINE to indicate both what value to
3873 put into the ELF image and to indicate support for the feature.
3874
3875 (2) Define tcg_register_jit. This should create a buffer containing
3876 the contents of a .debug_frame section that describes the post-
3877 prologue unwind info for the tcg machine.
3878
3879 (3) Call tcg_register_jit_int, with the constructed .debug_frame.
3880*/
813da627
RH
3881
3882/* Begin GDB interface. THE FOLLOWING MUST MATCH GDB DOCS. */
3883typedef enum {
3884 JIT_NOACTION = 0,
3885 JIT_REGISTER_FN,
3886 JIT_UNREGISTER_FN
3887} jit_actions_t;
3888
3889struct jit_code_entry {
3890 struct jit_code_entry *next_entry;
3891 struct jit_code_entry *prev_entry;
3892 const void *symfile_addr;
3893 uint64_t symfile_size;
3894};
3895
3896struct jit_descriptor {
3897 uint32_t version;
3898 uint32_t action_flag;
3899 struct jit_code_entry *relevant_entry;
3900 struct jit_code_entry *first_entry;
3901};
3902
3903void __jit_debug_register_code(void) __attribute__((noinline));
3904void __jit_debug_register_code(void)
3905{
3906 asm("");
3907}
3908
3909/* Must statically initialize the version, because GDB may check
3910 the version before we can set it. */
3911struct jit_descriptor __jit_debug_descriptor = { 1, 0, 0, 0 };
3912
3913/* End GDB interface. */
3914
3915static int find_string(const char *strtab, const char *str)
3916{
3917 const char *p = strtab + 1;
3918
3919 while (1) {
3920 if (strcmp(p, str) == 0) {
3921 return p - strtab;
3922 }
3923 p += strlen(p) + 1;
3924 }
3925}
3926
5872bbf2 3927static void tcg_register_jit_int(void *buf_ptr, size_t buf_size,
2c90784a
RH
3928 const void *debug_frame,
3929 size_t debug_frame_size)
813da627 3930{
5872bbf2
RH
3931 struct __attribute__((packed)) DebugInfo {
3932 uint32_t len;
3933 uint16_t version;
3934 uint32_t abbrev;
3935 uint8_t ptr_size;
3936 uint8_t cu_die;
3937 uint16_t cu_lang;
3938 uintptr_t cu_low_pc;
3939 uintptr_t cu_high_pc;
3940 uint8_t fn_die;
3941 char fn_name[16];
3942 uintptr_t fn_low_pc;
3943 uintptr_t fn_high_pc;
3944 uint8_t cu_eoc;
3945 };
813da627
RH
3946
3947 struct ElfImage {
3948 ElfW(Ehdr) ehdr;
3949 ElfW(Phdr) phdr;
5872bbf2
RH
3950 ElfW(Shdr) shdr[7];
3951 ElfW(Sym) sym[2];
3952 struct DebugInfo di;
3953 uint8_t da[24];
3954 char str[80];
3955 };
3956
3957 struct ElfImage *img;
3958
3959 static const struct ElfImage img_template = {
3960 .ehdr = {
3961 .e_ident[EI_MAG0] = ELFMAG0,
3962 .e_ident[EI_MAG1] = ELFMAG1,
3963 .e_ident[EI_MAG2] = ELFMAG2,
3964 .e_ident[EI_MAG3] = ELFMAG3,
3965 .e_ident[EI_CLASS] = ELF_CLASS,
3966 .e_ident[EI_DATA] = ELF_DATA,
3967 .e_ident[EI_VERSION] = EV_CURRENT,
3968 .e_type = ET_EXEC,
3969 .e_machine = ELF_HOST_MACHINE,
3970 .e_version = EV_CURRENT,
3971 .e_phoff = offsetof(struct ElfImage, phdr),
3972 .e_shoff = offsetof(struct ElfImage, shdr),
3973 .e_ehsize = sizeof(ElfW(Shdr)),
3974 .e_phentsize = sizeof(ElfW(Phdr)),
3975 .e_phnum = 1,
3976 .e_shentsize = sizeof(ElfW(Shdr)),
3977 .e_shnum = ARRAY_SIZE(img->shdr),
3978 .e_shstrndx = ARRAY_SIZE(img->shdr) - 1,
abbb3eae
RH
3979#ifdef ELF_HOST_FLAGS
3980 .e_flags = ELF_HOST_FLAGS,
3981#endif
3982#ifdef ELF_OSABI
3983 .e_ident[EI_OSABI] = ELF_OSABI,
3984#endif
5872bbf2
RH
3985 },
3986 .phdr = {
3987 .p_type = PT_LOAD,
3988 .p_flags = PF_X,
3989 },
3990 .shdr = {
3991 [0] = { .sh_type = SHT_NULL },
3992 /* Trick: The contents of code_gen_buffer are not present in
3993 this fake ELF file; that got allocated elsewhere. Therefore
3994 we mark .text as SHT_NOBITS (similar to .bss) so that readers
3995 will not look for contents. We can record any address. */
3996 [1] = { /* .text */
3997 .sh_type = SHT_NOBITS,
3998 .sh_flags = SHF_EXECINSTR | SHF_ALLOC,
3999 },
4000 [2] = { /* .debug_info */
4001 .sh_type = SHT_PROGBITS,
4002 .sh_offset = offsetof(struct ElfImage, di),
4003 .sh_size = sizeof(struct DebugInfo),
4004 },
4005 [3] = { /* .debug_abbrev */
4006 .sh_type = SHT_PROGBITS,
4007 .sh_offset = offsetof(struct ElfImage, da),
4008 .sh_size = sizeof(img->da),
4009 },
4010 [4] = { /* .debug_frame */
4011 .sh_type = SHT_PROGBITS,
4012 .sh_offset = sizeof(struct ElfImage),
4013 },
4014 [5] = { /* .symtab */
4015 .sh_type = SHT_SYMTAB,
4016 .sh_offset = offsetof(struct ElfImage, sym),
4017 .sh_size = sizeof(img->sym),
4018 .sh_info = 1,
4019 .sh_link = ARRAY_SIZE(img->shdr) - 1,
4020 .sh_entsize = sizeof(ElfW(Sym)),
4021 },
4022 [6] = { /* .strtab */
4023 .sh_type = SHT_STRTAB,
4024 .sh_offset = offsetof(struct ElfImage, str),
4025 .sh_size = sizeof(img->str),
4026 }
4027 },
4028 .sym = {
4029 [1] = { /* code_gen_buffer */
4030 .st_info = ELF_ST_INFO(STB_GLOBAL, STT_FUNC),
4031 .st_shndx = 1,
4032 }
4033 },
4034 .di = {
4035 .len = sizeof(struct DebugInfo) - 4,
4036 .version = 2,
4037 .ptr_size = sizeof(void *),
4038 .cu_die = 1,
4039 .cu_lang = 0x8001, /* DW_LANG_Mips_Assembler */
4040 .fn_die = 2,
4041 .fn_name = "code_gen_buffer"
4042 },
4043 .da = {
4044 1, /* abbrev number (the cu) */
4045 0x11, 1, /* DW_TAG_compile_unit, has children */
4046 0x13, 0x5, /* DW_AT_language, DW_FORM_data2 */
4047 0x11, 0x1, /* DW_AT_low_pc, DW_FORM_addr */
4048 0x12, 0x1, /* DW_AT_high_pc, DW_FORM_addr */
4049 0, 0, /* end of abbrev */
4050 2, /* abbrev number (the fn) */
4051 0x2e, 0, /* DW_TAG_subprogram, no children */
4052 0x3, 0x8, /* DW_AT_name, DW_FORM_string */
4053 0x11, 0x1, /* DW_AT_low_pc, DW_FORM_addr */
4054 0x12, 0x1, /* DW_AT_high_pc, DW_FORM_addr */
4055 0, 0, /* end of abbrev */
4056 0 /* no more abbrev */
4057 },
4058 .str = "\0" ".text\0" ".debug_info\0" ".debug_abbrev\0"
4059 ".debug_frame\0" ".symtab\0" ".strtab\0" "code_gen_buffer",
813da627
RH
4060 };
4061
4062 /* We only need a single jit entry; statically allocate it. */
4063 static struct jit_code_entry one_entry;
4064
5872bbf2 4065 uintptr_t buf = (uintptr_t)buf_ptr;
813da627 4066 size_t img_size = sizeof(struct ElfImage) + debug_frame_size;
2c90784a 4067 DebugFrameHeader *dfh;
813da627 4068
5872bbf2
RH
4069 img = g_malloc(img_size);
4070 *img = img_template;
813da627 4071
5872bbf2
RH
4072 img->phdr.p_vaddr = buf;
4073 img->phdr.p_paddr = buf;
4074 img->phdr.p_memsz = buf_size;
813da627 4075
813da627 4076 img->shdr[1].sh_name = find_string(img->str, ".text");
5872bbf2 4077 img->shdr[1].sh_addr = buf;
813da627
RH
4078 img->shdr[1].sh_size = buf_size;
4079
5872bbf2
RH
4080 img->shdr[2].sh_name = find_string(img->str, ".debug_info");
4081 img->shdr[3].sh_name = find_string(img->str, ".debug_abbrev");
4082
4083 img->shdr[4].sh_name = find_string(img->str, ".debug_frame");
4084 img->shdr[4].sh_size = debug_frame_size;
4085
4086 img->shdr[5].sh_name = find_string(img->str, ".symtab");
4087 img->shdr[6].sh_name = find_string(img->str, ".strtab");
4088
4089 img->sym[1].st_name = find_string(img->str, "code_gen_buffer");
4090 img->sym[1].st_value = buf;
4091 img->sym[1].st_size = buf_size;
813da627 4092
5872bbf2 4093 img->di.cu_low_pc = buf;
45aba097 4094 img->di.cu_high_pc = buf + buf_size;
5872bbf2 4095 img->di.fn_low_pc = buf;
45aba097 4096 img->di.fn_high_pc = buf + buf_size;
813da627 4097
2c90784a
RH
4098 dfh = (DebugFrameHeader *)(img + 1);
4099 memcpy(dfh, debug_frame, debug_frame_size);
4100 dfh->fde.func_start = buf;
4101 dfh->fde.func_len = buf_size;
4102
813da627
RH
4103#ifdef DEBUG_JIT
4104 /* Enable this block to be able to debug the ELF image file creation.
4105 One can use readelf, objdump, or other inspection utilities. */
4106 {
4107 FILE *f = fopen("/tmp/qemu.jit", "w+b");
4108 if (f) {
5872bbf2 4109 if (fwrite(img, img_size, 1, f) != img_size) {
813da627
RH
4110 /* Avoid stupid unused return value warning for fwrite. */
4111 }
4112 fclose(f);
4113 }
4114 }
4115#endif
4116
4117 one_entry.symfile_addr = img;
4118 one_entry.symfile_size = img_size;
4119
4120 __jit_debug_descriptor.action_flag = JIT_REGISTER_FN;
4121 __jit_debug_descriptor.relevant_entry = &one_entry;
4122 __jit_debug_descriptor.first_entry = &one_entry;
4123 __jit_debug_register_code();
4124}
4125#else
5872bbf2
RH
4126/* No support for the feature. Provide the entry point expected by exec.c,
4127 and implement the internal function we declared earlier. */
813da627
RH
4128
4129static void tcg_register_jit_int(void *buf, size_t size,
2c90784a
RH
4130 const void *debug_frame,
4131 size_t debug_frame_size)
813da627
RH
4132{
4133}
4134
4135void tcg_register_jit(void *buf, size_t buf_size)
4136{
4137}
4138#endif /* ELF_HOST_MACHINE */
db432672
RH
4139
4140#if !TCG_TARGET_MAYBE_vec
4141void tcg_expand_vec_op(TCGOpcode o, TCGType t, unsigned e, TCGArg a0, ...)
4142{
4143 g_assert_not_reached();
4144}
4145#endif
This page took 1.574947 seconds and 4 git commands to generate.