2015-08-21 09:04:50 +02:00
|
|
|
/*
|
|
|
|
* Tiny Code Generator for QEMU
|
|
|
|
*
|
|
|
|
* Copyright (c) 2008 Fabrice Bellard
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* define it to use liveness analysis (better code) */
|
|
|
|
#define USE_LIVENESS_ANALYSIS
|
|
|
|
#define USE_TCG_OPTIMIZATIONS
|
|
|
|
|
2018-02-19 07:04:06 +01:00
|
|
|
#include "qemu/osdep.h"
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
/* Define to jump the ELF file used to communicate with GDB. */
|
|
|
|
#undef DEBUG_JIT
|
|
|
|
|
|
|
|
#if !defined(CONFIG_DEBUG_TCG) && !defined(NDEBUG)
|
|
|
|
/* define it to suppress various consistency checks (faster) */
|
|
|
|
#define NDEBUG
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "qemu-common.h"
|
|
|
|
#include "qemu/host-utils.h"
|
|
|
|
#include "qemu/timer.h"
|
|
|
|
|
|
|
|
/* Note: the long term plan is to reduce the dependencies on the QEMU
|
|
|
|
CPU definitions. Currently they are used for qemu_ld/st
|
|
|
|
instructions */
|
|
|
|
#define NO_CPU_IO_DEFS
|
|
|
|
#include "cpu.h"
|
|
|
|
|
|
|
|
#include "tcg-op.h"
|
|
|
|
|
|
|
|
#if UINTPTR_MAX == UINT32_MAX
|
|
|
|
# define ELF_CLASS ELFCLASS32
|
|
|
|
#else
|
|
|
|
# define ELF_CLASS ELFCLASS64
|
|
|
|
#endif
|
|
|
|
#ifdef HOST_WORDS_BIGENDIAN
|
|
|
|
# define ELF_DATA ELFDATA2MSB
|
|
|
|
#else
|
|
|
|
# define ELF_DATA ELFDATA2LSB
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "elf.h"
|
|
|
|
|
|
|
|
/* Forward declarations for functions declared in tcg-target.c and used here. */
|
|
|
|
static void tcg_target_init(TCGContext *s);
|
|
|
|
static void tcg_target_qemu_prologue(TCGContext *s);
|
|
|
|
static void patch_reloc(tcg_insn_unit *code_ptr, int type,
|
|
|
|
intptr_t value, intptr_t addend);
|
|
|
|
|
|
|
|
/* The CIE and FDE header definitions will be common to all hosts. */
|
|
|
|
typedef struct {
|
2017-01-19 12:50:28 +01:00
|
|
|
//uint32_t QEMU_ALIGN(sizeof(void *), len);
|
2017-01-21 02:28:22 +01:00
|
|
|
uint32_t QEMU_ALIGN(8, len);
|
2015-08-21 09:04:50 +02:00
|
|
|
uint32_t id;
|
|
|
|
uint8_t version;
|
|
|
|
char augmentation[1];
|
|
|
|
uint8_t code_align;
|
|
|
|
uint8_t data_align;
|
|
|
|
uint8_t return_column;
|
|
|
|
} DebugFrameCIE;
|
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
QEMU_PACK( typedef struct {
|
|
|
|
// uint32_t QEMU_ALIGN(sizeof(void *), len);
|
2017-01-21 02:28:22 +01:00
|
|
|
uint32_t QEMU_ALIGN(8, len);
|
2015-08-21 09:04:50 +02:00
|
|
|
uint32_t cie_offset;
|
|
|
|
uintptr_t func_start;
|
|
|
|
uintptr_t func_len;
|
2017-01-19 12:50:28 +01:00
|
|
|
}) DebugFrameFDEHeader;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
QEMU_PACK( typedef struct {
|
2015-08-21 09:04:50 +02:00
|
|
|
DebugFrameCIE cie;
|
|
|
|
DebugFrameFDEHeader fde;
|
2017-01-19 12:50:28 +01:00
|
|
|
}) DebugFrameHeader;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
/* Forward declarations for functions declared and used in tcg-target.c. */
|
|
|
|
static int target_parse_constraint(TCGArgConstraint *ct, const char **pct_str);
|
|
|
|
static void tcg_out_ld(TCGContext *s, TCGType type, TCGReg ret, TCGReg arg1,
|
|
|
|
intptr_t arg2);
|
|
|
|
static void tcg_out_mov(TCGContext *s, TCGType type, TCGReg ret, TCGReg arg);
|
|
|
|
static void tcg_out_movi(TCGContext *s, TCGType type,
|
|
|
|
TCGReg ret, tcg_target_long arg);
|
|
|
|
static void tcg_out_op(TCGContext *s, TCGOpcode opc, const TCGArg *args,
|
|
|
|
const int *const_args);
|
|
|
|
static void tcg_out_st(TCGContext *s, TCGType type, TCGReg arg, TCGReg arg1,
|
|
|
|
intptr_t arg2);
|
|
|
|
static void tcg_out_call(TCGContext *s, tcg_insn_unit *target);
|
|
|
|
static int tcg_target_const_match(tcg_target_long val, TCGType type,
|
|
|
|
const TCGArgConstraint *arg_ct);
|
|
|
|
static void tcg_out_tb_init(TCGContext *s);
|
2018-02-19 07:40:12 +01:00
|
|
|
static bool tcg_out_tb_finalize(TCGContext *s);
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
#if TCG_TARGET_INSN_UNIT_SIZE == 1
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_out8(TCGContext *s, uint8_t v)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
*s->code_ptr++ = v;
|
|
|
|
}
|
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_patch8(tcg_insn_unit *p,
|
2015-08-21 09:04:50 +02:00
|
|
|
uint8_t v)
|
|
|
|
{
|
|
|
|
*p = v;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if TCG_TARGET_INSN_UNIT_SIZE <= 2
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_out16(TCGContext *s, uint16_t v)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 2) {
|
2017-01-19 12:50:28 +01:00
|
|
|
*s->code_ptr++ = (tcg_insn_unit)v;
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
tcg_insn_unit *p = s->code_ptr;
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
s->code_ptr = p + (2 / TCG_TARGET_INSN_UNIT_SIZE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_patch16(tcg_insn_unit *p,
|
2015-08-21 09:04:50 +02:00
|
|
|
uint16_t v)
|
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 2) {
|
2017-01-19 12:50:28 +01:00
|
|
|
*p = (tcg_insn_unit)v;
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if TCG_TARGET_INSN_UNIT_SIZE <= 4
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_out32(TCGContext *s, uint32_t v)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 4) {
|
|
|
|
*s->code_ptr++ = v;
|
|
|
|
} else {
|
|
|
|
tcg_insn_unit *p = s->code_ptr;
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
s->code_ptr = p + (4 / TCG_TARGET_INSN_UNIT_SIZE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_patch32(tcg_insn_unit *p,
|
2015-08-21 09:04:50 +02:00
|
|
|
uint32_t v)
|
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 4) {
|
|
|
|
*p = v;
|
|
|
|
} else {
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if TCG_TARGET_INSN_UNIT_SIZE <= 8
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_out64(TCGContext *s, uint64_t v)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 8) {
|
2017-01-19 12:50:28 +01:00
|
|
|
*s->code_ptr++ = (tcg_insn_unit)v;
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
tcg_insn_unit *p = s->code_ptr;
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
s->code_ptr = p + (8 / TCG_TARGET_INSN_UNIT_SIZE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-19 12:50:28 +01:00
|
|
|
static QEMU_UNUSED_FUNC inline void tcg_patch64(tcg_insn_unit *p,
|
2015-08-21 09:04:50 +02:00
|
|
|
uint64_t v)
|
|
|
|
{
|
|
|
|
if (TCG_TARGET_INSN_UNIT_SIZE == 8) {
|
2017-01-19 12:50:28 +01:00
|
|
|
*p = (tcg_insn_unit)v;
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
memcpy(p, &v, sizeof(v));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* label relocation processing */
|
|
|
|
|
|
|
|
static void tcg_out_reloc(TCGContext *s, tcg_insn_unit *code_ptr, int type,
|
2018-02-09 20:38:37 +01:00
|
|
|
TCGLabel *l, intptr_t addend)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
TCGRelocation *r;
|
|
|
|
|
|
|
|
if (l->has_value) {
|
|
|
|
/* FIXME: This may break relocations on RISC targets that
|
|
|
|
modify instruction fields in place. The caller may not have
|
|
|
|
written the initial value. */
|
|
|
|
patch_reloc(code_ptr, type, l->u.value, addend);
|
|
|
|
} else {
|
|
|
|
/* add a new relocation entry */
|
|
|
|
r = tcg_malloc(s, sizeof(TCGRelocation));
|
|
|
|
r->type = type;
|
|
|
|
r->ptr = code_ptr;
|
|
|
|
r->addend = addend;
|
|
|
|
r->next = l->u.first_reloc;
|
|
|
|
l->u.first_reloc = r;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-02-09 20:38:37 +01:00
|
|
|
static void tcg_out_label(TCGContext *s, TCGLabel *l, tcg_insn_unit *ptr)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
intptr_t value = (intptr_t)ptr;
|
|
|
|
TCGRelocation *r;
|
|
|
|
|
|
|
|
assert(!l->has_value);
|
|
|
|
|
|
|
|
for (r = l->u.first_reloc; r != NULL; r = r->next) {
|
|
|
|
patch_reloc(r->ptr, r->type, value, r->addend);
|
|
|
|
}
|
|
|
|
|
|
|
|
l->has_value = 1;
|
|
|
|
l->u.value_ptr = ptr;
|
|
|
|
}
|
|
|
|
|
2018-02-09 20:10:32 +01:00
|
|
|
TCGLabel *gen_new_label(TCGContext *s)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
2018-02-09 20:47:48 +01:00
|
|
|
TCGLabel *l = tcg_malloc(s, sizeof(TCGLabel));
|
|
|
|
TCGLabel ltmp = {0};
|
|
|
|
ltmp.id = s->nb_labels++;
|
|
|
|
*l = ltmp;
|
2018-02-09 20:10:32 +01:00
|
|
|
return l;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#include "tcg-target.c"
|
|
|
|
|
|
|
|
/* pool based memory allocation */
|
|
|
|
void *tcg_malloc_internal(TCGContext *s, int size)
|
|
|
|
{
|
|
|
|
TCGPool *p;
|
|
|
|
int pool_size;
|
|
|
|
|
|
|
|
if (size > TCG_POOL_CHUNK_SIZE) {
|
|
|
|
/* big malloc: insert a new pool (XXX: could optimize) */
|
|
|
|
p = g_malloc(sizeof(TCGPool) + size);
|
|
|
|
p->size = size;
|
|
|
|
p->next = s->pool_first_large;
|
|
|
|
s->pool_first_large = p;
|
|
|
|
return p->data;
|
|
|
|
} else {
|
|
|
|
p = s->pool_current;
|
|
|
|
if (!p) {
|
|
|
|
p = s->pool_first;
|
|
|
|
if (!p)
|
|
|
|
goto new_pool;
|
|
|
|
} else {
|
|
|
|
if (!p->next) {
|
|
|
|
new_pool:
|
|
|
|
pool_size = TCG_POOL_CHUNK_SIZE;
|
|
|
|
p = g_malloc(sizeof(TCGPool) + pool_size);
|
|
|
|
p->size = pool_size;
|
|
|
|
p->next = NULL;
|
|
|
|
if (s->pool_current)
|
|
|
|
s->pool_current->next = p;
|
|
|
|
else
|
|
|
|
s->pool_first = p;
|
|
|
|
} else {
|
|
|
|
p = p->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s->pool_current = p;
|
|
|
|
s->pool_cur = p->data + size;
|
|
|
|
s->pool_end = p->data + p->size;
|
|
|
|
return p->data;
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_pool_reset(TCGContext *s)
|
|
|
|
{
|
|
|
|
TCGPool *p, *t;
|
|
|
|
for (p = s->pool_first_large; p; p = t) {
|
|
|
|
t = p->next;
|
2016-12-21 15:28:36 +01:00
|
|
|
g_free(p);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
s->pool_first_large = NULL;
|
|
|
|
s->pool_cur = s->pool_end = NULL;
|
|
|
|
s->pool_current = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct TCGHelperInfo {
|
|
|
|
void *func;
|
|
|
|
const char *name;
|
|
|
|
unsigned flags;
|
|
|
|
unsigned sizemask;
|
|
|
|
} TCGHelperInfo;
|
|
|
|
|
|
|
|
#include "exec/helper-proto.h"
|
|
|
|
|
|
|
|
static const TCGHelperInfo all_helpers[] = {
|
|
|
|
#include "exec/helper-tcg.h"
|
|
|
|
};
|
|
|
|
|
|
|
|
void tcg_context_init(TCGContext *s)
|
|
|
|
{
|
|
|
|
int op, total_args, n, i;
|
|
|
|
TCGOpDef *def;
|
|
|
|
TCGArgConstraint *args_ct;
|
|
|
|
int *sorted_args;
|
|
|
|
GHashTable *helper_table;
|
|
|
|
|
|
|
|
memset(s, 0, sizeof(*s));
|
|
|
|
s->nb_globals = 0;
|
|
|
|
|
|
|
|
// copy original tcg_op_defs_org for private usage
|
|
|
|
s->tcg_op_defs = g_malloc(sizeof(tcg_op_defs_org));
|
|
|
|
memcpy(s->tcg_op_defs, tcg_op_defs_org, sizeof(tcg_op_defs_org));
|
|
|
|
|
|
|
|
/* Count total number of arguments and allocate the corresponding
|
|
|
|
space */
|
|
|
|
total_args = 0;
|
|
|
|
for(op = 0; op < NB_OPS; op++) {
|
|
|
|
def = &s->tcg_op_defs[op];
|
|
|
|
n = def->nb_iargs + def->nb_oargs;
|
|
|
|
total_args += n;
|
|
|
|
}
|
|
|
|
|
|
|
|
args_ct = g_malloc(sizeof(TCGArgConstraint) * total_args);
|
|
|
|
sorted_args = g_malloc(sizeof(int) * total_args);
|
|
|
|
|
|
|
|
for(op = 0; op < NB_OPS; op++) {
|
|
|
|
def = &s->tcg_op_defs[op];
|
|
|
|
def->args_ct = args_ct;
|
|
|
|
def->sorted_args = sorted_args;
|
|
|
|
n = def->nb_iargs + def->nb_oargs;
|
|
|
|
sorted_args += n;
|
|
|
|
args_ct += n;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Register helpers. */
|
|
|
|
/* Use g_direct_hash/equal for direct pointer comparisons on func. */
|
|
|
|
s->helpers = helper_table = g_hash_table_new(NULL, NULL);
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(all_helpers); ++i) {
|
|
|
|
g_hash_table_insert(helper_table, (gpointer)all_helpers[i].func,
|
|
|
|
(gpointer)&all_helpers[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_target_init(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_prologue_init(TCGContext *s)
|
|
|
|
{
|
2018-02-16 16:25:01 +01:00
|
|
|
size_t prologue_size, total_size;
|
|
|
|
void *buf0, *buf1;
|
|
|
|
|
|
|
|
/* Put the prologue at the beginning of code_gen_buffer. */
|
|
|
|
buf0 = s->code_gen_buffer;
|
|
|
|
s->code_ptr = buf0;
|
|
|
|
s->code_buf = buf0;
|
|
|
|
s->code_gen_prologue = buf0;
|
|
|
|
|
|
|
|
/* Generate the prologue. */
|
2015-08-21 09:04:50 +02:00
|
|
|
tcg_target_qemu_prologue(s);
|
2018-02-16 16:25:01 +01:00
|
|
|
buf1 = s->code_ptr;
|
|
|
|
flush_icache_range((uintptr_t)buf0, (uintptr_t)buf1);
|
|
|
|
|
|
|
|
/* Deduct the prologue from the buffer. */
|
|
|
|
prologue_size = tcg_current_code_size(s);
|
|
|
|
s->code_gen_ptr = buf1;
|
|
|
|
s->code_gen_buffer = buf1;
|
|
|
|
s->code_buf = buf1;
|
|
|
|
total_size = s->code_gen_buffer_size - prologue_size;
|
|
|
|
s->code_gen_buffer_size = total_size;
|
|
|
|
|
2018-02-16 20:26:29 +01:00
|
|
|
/* Compute a high-water mark, at which we voluntarily flush the buffer
|
|
|
|
and start over. The size here is arbitrary, significantly larger
|
|
|
|
than we expect the code generation for any one opcode to require. */
|
|
|
|
s->code_gen_highwater = s->code_gen_buffer + (total_size - 1024);
|
2018-02-16 16:25:01 +01:00
|
|
|
|
|
|
|
// Unicorn: commented out
|
|
|
|
// tcg_register_jit(s->code_gen_buffer, total_size);
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
#ifdef DEBUG_DISAS
|
|
|
|
if (qemu_loglevel_mask(CPU_LOG_TB_OUT_ASM)) {
|
|
|
|
size_t size = tcg_current_code_size(s);
|
|
|
|
qemu_log("PROLOGUE: [size=%zu]\n", size);
|
2018-02-16 16:25:01 +01:00
|
|
|
qemu_log("PROLOGUE: [size=%zu]\n", prologue_size);
|
|
|
|
// Unicorn: commented out
|
|
|
|
//log_disas(buf0, prologue_size);
|
2015-08-21 09:04:50 +02:00
|
|
|
qemu_log("\n");
|
|
|
|
qemu_log_flush();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_func_start(TCGContext *s)
|
|
|
|
{
|
|
|
|
tcg_pool_reset(s);
|
|
|
|
s->nb_temps = s->nb_globals;
|
|
|
|
|
|
|
|
/* No temps have been previously allocated for size or locality. */
|
|
|
|
memset(s->free_temps, 0, sizeof(s->free_temps));
|
|
|
|
|
|
|
|
s->nb_labels = 0;
|
|
|
|
s->current_frame_offset = s->frame_start;
|
|
|
|
|
|
|
|
#ifdef CONFIG_DEBUG_TCG
|
|
|
|
s->goto_tb_issue_mask = 0;
|
|
|
|
#endif
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_first_op_idx = 0;
|
|
|
|
s->gen_last_op_idx = -1;
|
|
|
|
s->gen_next_op_idx = 0;
|
|
|
|
s->gen_next_parm_idx = 0;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
s->be = tcg_malloc(s, sizeof(TCGBackendData));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void tcg_temp_alloc(TCGContext *s, int n)
|
|
|
|
{
|
|
|
|
if (n > TCG_MAX_TEMPS)
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
|
2018-02-08 19:03:59 +01:00
|
|
|
static int tcg_global_reg_new_internal(TCGContext *s, TCGType type,
|
|
|
|
int reg, const char *name)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int idx;
|
|
|
|
|
2018-02-08 19:03:59 +01:00
|
|
|
if (TCG_TARGET_REG_BITS == 32 && type != TCG_TYPE_I32) {
|
2015-08-21 09:04:50 +02:00
|
|
|
tcg_abort();
|
2018-02-08 19:03:59 +01:00
|
|
|
}
|
2015-08-21 09:04:50 +02:00
|
|
|
idx = s->nb_globals;
|
|
|
|
tcg_temp_alloc(s, s->nb_globals + 1);
|
|
|
|
ts = &s->temps[s->nb_globals];
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = type;
|
|
|
|
ts->fixed_reg = 1;
|
|
|
|
ts->reg = reg;
|
|
|
|
ts->name = name;
|
|
|
|
s->nb_globals++;
|
|
|
|
tcg_regset_set_reg(s->reserved_regs, reg);
|
|
|
|
return idx;
|
|
|
|
}
|
|
|
|
|
2018-02-08 19:03:59 +01:00
|
|
|
void tcg_set_frame(TCGContext *s, int reg, intptr_t start, intptr_t size)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
s->frame_start = start;
|
|
|
|
s->frame_end = start + size;
|
|
|
|
idx = tcg_global_reg_new_internal(s, TCG_TYPE_PTR, reg, "_frame");
|
|
|
|
s->frame_temp = &s->temps[idx];
|
|
|
|
}
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
TCGv_i32 tcg_global_reg_new_i32(TCGContext *s, int reg, const char *name)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
|
2018-02-08 19:03:59 +01:00
|
|
|
if (tcg_regset_test_reg(s->reserved_regs, reg)) {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
idx = tcg_global_reg_new_internal(s, TCG_TYPE_I32, reg, name);
|
|
|
|
return MAKE_TCGV_I32(idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i64 tcg_global_reg_new_i64(TCGContext *s, int reg, const char *name)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
|
2018-02-08 19:03:59 +01:00
|
|
|
if (tcg_regset_test_reg(s->reserved_regs, reg)) {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
idx = tcg_global_reg_new_internal(s, TCG_TYPE_I64, reg, name);
|
|
|
|
return MAKE_TCGV_I64(idx);
|
|
|
|
}
|
|
|
|
|
2018-02-08 18:16:49 +01:00
|
|
|
int tcg_global_mem_new_internal(TCGContext *s, TCGType type, TCGv_ptr base,
|
|
|
|
intptr_t offset, const char *name)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
2018-02-08 18:16:49 +01:00
|
|
|
TCGTemp *ts, *base_ts = &s->temps[GET_TCGV_PTR(base)];
|
2018-02-08 19:03:59 +01:00
|
|
|
int idx;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
idx = s->nb_globals;
|
|
|
|
#if TCG_TARGET_REG_BITS == 32
|
|
|
|
if (type == TCG_TYPE_I64) {
|
|
|
|
char buf[64];
|
|
|
|
tcg_temp_alloc(s, s->nb_globals + 2);
|
|
|
|
ts = &s->temps[s->nb_globals];
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = TCG_TYPE_I32;
|
|
|
|
ts->fixed_reg = 0;
|
|
|
|
ts->mem_allocated = 1;
|
2018-02-08 19:03:59 +01:00
|
|
|
ts->mem_base = base_ts;
|
2015-08-21 09:04:50 +02:00
|
|
|
#ifdef HOST_WORDS_BIGENDIAN
|
|
|
|
ts->mem_offset = offset + 4;
|
|
|
|
#else
|
|
|
|
ts->mem_offset = offset;
|
|
|
|
#endif
|
|
|
|
pstrcpy(buf, sizeof(buf), name);
|
|
|
|
pstrcat(buf, sizeof(buf), "_0");
|
2017-01-19 12:50:28 +01:00
|
|
|
ts->name = g_strdup(buf);
|
2015-08-21 09:04:50 +02:00
|
|
|
ts++;
|
|
|
|
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = TCG_TYPE_I32;
|
|
|
|
ts->fixed_reg = 0;
|
|
|
|
ts->mem_allocated = 1;
|
2018-02-08 19:03:59 +01:00
|
|
|
ts->mem_base = base_ts;
|
2015-08-21 09:04:50 +02:00
|
|
|
#ifdef HOST_WORDS_BIGENDIAN
|
|
|
|
ts->mem_offset = offset;
|
|
|
|
#else
|
|
|
|
ts->mem_offset = offset + 4;
|
|
|
|
#endif
|
|
|
|
pstrcpy(buf, sizeof(buf), name);
|
|
|
|
pstrcat(buf, sizeof(buf), "_1");
|
2017-01-19 12:50:28 +01:00
|
|
|
ts->name = g_strdup(buf);
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
s->nb_globals += 2;
|
|
|
|
} else
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
tcg_temp_alloc(s, s->nb_globals + 1);
|
|
|
|
ts = &s->temps[s->nb_globals];
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = type;
|
|
|
|
ts->fixed_reg = 0;
|
|
|
|
ts->mem_allocated = 1;
|
2018-02-08 19:03:59 +01:00
|
|
|
ts->mem_base = base_ts;
|
2015-08-21 09:04:50 +02:00
|
|
|
ts->mem_offset = offset;
|
|
|
|
ts->name = name;
|
|
|
|
s->nb_globals++;
|
|
|
|
}
|
|
|
|
return idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int tcg_temp_new_internal(TCGContext *s, TCGType type, int temp_local)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int idx, k;
|
|
|
|
|
|
|
|
k = type + (temp_local ? TCG_TYPE_COUNT : 0);
|
|
|
|
idx = find_first_bit(s->free_temps[k].l, TCG_MAX_TEMPS);
|
|
|
|
if (idx < TCG_MAX_TEMPS) {
|
|
|
|
/* There is already an available temp with the right type. */
|
|
|
|
clear_bit(idx, s->free_temps[k].l);
|
|
|
|
|
|
|
|
ts = &s->temps[idx];
|
|
|
|
ts->temp_allocated = 1;
|
|
|
|
assert(ts->base_type == type);
|
|
|
|
assert(ts->temp_local == temp_local);
|
|
|
|
} else {
|
|
|
|
idx = s->nb_temps;
|
|
|
|
#if TCG_TARGET_REG_BITS == 32
|
|
|
|
if (type == TCG_TYPE_I64) {
|
|
|
|
tcg_temp_alloc(s, s->nb_temps + 2);
|
|
|
|
ts = &s->temps[s->nb_temps];
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = TCG_TYPE_I32;
|
|
|
|
ts->temp_allocated = 1;
|
|
|
|
ts->temp_local = temp_local;
|
|
|
|
ts->name = NULL;
|
|
|
|
ts++;
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = TCG_TYPE_I32;
|
|
|
|
ts->temp_allocated = 1;
|
|
|
|
ts->temp_local = temp_local;
|
|
|
|
ts->name = NULL;
|
|
|
|
s->nb_temps += 2;
|
|
|
|
} else
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
tcg_temp_alloc(s, s->nb_temps + 1);
|
|
|
|
ts = &s->temps[s->nb_temps];
|
|
|
|
ts->base_type = type;
|
|
|
|
ts->type = type;
|
|
|
|
ts->temp_allocated = 1;
|
|
|
|
ts->temp_local = temp_local;
|
|
|
|
ts->name = NULL;
|
|
|
|
s->nb_temps++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(CONFIG_DEBUG_TCG)
|
|
|
|
s->temps_in_use++;
|
|
|
|
#endif
|
|
|
|
return idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i32 tcg_temp_new_internal_i32(TCGContext *s, int temp_local)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
|
|
|
|
idx = tcg_temp_new_internal(s, TCG_TYPE_I32, temp_local);
|
|
|
|
return MAKE_TCGV_I32(idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i64 tcg_temp_new_internal_i64(TCGContext *s, int temp_local)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
|
|
|
|
idx = tcg_temp_new_internal(s, TCG_TYPE_I64, temp_local);
|
|
|
|
return MAKE_TCGV_I64(idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tcg_temp_free_internal(TCGContext *s, int idx)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int k;
|
|
|
|
|
|
|
|
#if defined(CONFIG_DEBUG_TCG)
|
|
|
|
s->temps_in_use--;
|
|
|
|
if (s->temps_in_use < 0) {
|
|
|
|
fprintf(stderr, "More temporaries freed than allocated!\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
assert(idx >= s->nb_globals && idx < s->nb_temps);
|
|
|
|
ts = &s->temps[idx];
|
|
|
|
assert(ts->temp_allocated != 0);
|
|
|
|
ts->temp_allocated = 0;
|
|
|
|
|
|
|
|
k = ts->base_type + (ts->temp_local ? TCG_TYPE_COUNT : 0);
|
|
|
|
set_bit(idx, s->free_temps[k].l);
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_temp_free_i32(TCGContext *s, TCGv_i32 arg)
|
|
|
|
{
|
|
|
|
tcg_temp_free_internal(s, GET_TCGV_I32(arg));
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_temp_free_i64(TCGContext *s, TCGv_i64 arg)
|
|
|
|
{
|
|
|
|
tcg_temp_free_internal(s, GET_TCGV_I64(arg));
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i32 tcg_const_i32(TCGContext *s, int32_t val)
|
|
|
|
{
|
|
|
|
TCGv_i32 t0;
|
|
|
|
t0 = tcg_temp_new_i32(s);
|
|
|
|
tcg_gen_movi_i32(s, t0, val);
|
|
|
|
return t0;
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i64 tcg_const_i64(TCGContext *s, int64_t val)
|
|
|
|
{
|
|
|
|
TCGv_i64 t0;
|
|
|
|
t0 = tcg_temp_new_i64(s);
|
|
|
|
tcg_gen_movi_i64(s, t0, val);
|
|
|
|
return t0;
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i32 tcg_const_local_i32(TCGContext *s, int32_t val)
|
|
|
|
{
|
|
|
|
TCGv_i32 t0;
|
|
|
|
t0 = tcg_temp_local_new_i32(s);
|
|
|
|
tcg_gen_movi_i32(s, t0, val);
|
|
|
|
return t0;
|
|
|
|
}
|
|
|
|
|
|
|
|
TCGv_i64 tcg_const_local_i64(TCGContext *s, int64_t val)
|
|
|
|
{
|
|
|
|
TCGv_i64 t0;
|
|
|
|
t0 = tcg_temp_local_new_i64(s);
|
|
|
|
tcg_gen_movi_i64(s, t0, val);
|
|
|
|
return t0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(CONFIG_DEBUG_TCG)
|
|
|
|
void tcg_clear_temp_count(TCGContext *s)
|
|
|
|
{
|
|
|
|
s->temps_in_use = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int tcg_check_temp_count(TCGContext *s)
|
|
|
|
{
|
|
|
|
if (s->temps_in_use) {
|
|
|
|
/* Clear the count so that we don't give another
|
|
|
|
* warning immediately next time around.
|
|
|
|
*/
|
|
|
|
s->temps_in_use = 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Note: we convert the 64 bit args to 32 bit and do some alignment
|
|
|
|
and endian swap. Maybe it would be better to do the alignment
|
|
|
|
and endian swap in tcg_reg_alloc_call(). */
|
|
|
|
void tcg_gen_callN(TCGContext *s, void *func, TCGArg ret,
|
|
|
|
int nargs, TCGArg *args)
|
|
|
|
{
|
2018-02-09 15:54:01 +01:00
|
|
|
int i, real_args, nb_rets, pi, pi_first;
|
2015-08-21 09:04:50 +02:00
|
|
|
unsigned sizemask, flags;
|
|
|
|
TCGHelperInfo *info;
|
|
|
|
|
|
|
|
info = g_hash_table_lookup(s->helpers, (gpointer)func);
|
|
|
|
flags = info->flags;
|
|
|
|
sizemask = info->sizemask;
|
|
|
|
|
|
|
|
#if defined(__sparc__) && !defined(__arch64__) \
|
|
|
|
&& !defined(CONFIG_TCG_INTERPRETER)
|
|
|
|
/* We have 64-bit values in one register, but need to pass as two
|
|
|
|
separate parameters. Split them. */
|
|
|
|
int orig_sizemask = sizemask;
|
|
|
|
int orig_nargs = nargs;
|
|
|
|
TCGv_i64 retl, reth;
|
|
|
|
|
|
|
|
TCGV_UNUSED_I64(retl);
|
|
|
|
TCGV_UNUSED_I64(reth);
|
|
|
|
if (sizemask != 0) {
|
|
|
|
TCGArg *split_args = __builtin_alloca(sizeof(TCGArg) * nargs * 2);
|
|
|
|
for (i = real_args = 0; i < nargs; ++i) {
|
|
|
|
int is_64bit = sizemask & (1 << (i+1)*2);
|
|
|
|
if (is_64bit) {
|
|
|
|
TCGv_i64 orig = MAKE_TCGV_I64(args[i]);
|
2017-02-26 02:47:40 +01:00
|
|
|
TCGv_i32 h = tcg_temp_new_i32(s);
|
|
|
|
TCGv_i32 l = tcg_temp_new_i32(s);
|
2015-08-21 09:04:50 +02:00
|
|
|
tcg_gen_extr_i64_i32(l, h, orig);
|
|
|
|
split_args[real_args++] = GET_TCGV_I32(h);
|
|
|
|
split_args[real_args++] = GET_TCGV_I32(l);
|
|
|
|
} else {
|
|
|
|
split_args[real_args++] = args[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
nargs = real_args;
|
|
|
|
args = split_args;
|
|
|
|
sizemask = 0;
|
|
|
|
}
|
|
|
|
#elif defined(TCG_TARGET_EXTEND_ARGS) && TCG_TARGET_REG_BITS == 64
|
|
|
|
for (i = 0; i < nargs; ++i) {
|
|
|
|
int is_64bit = sizemask & (1 << (i+1)*2);
|
|
|
|
int is_signed = sizemask & (2 << (i+1)*2);
|
|
|
|
if (!is_64bit) {
|
|
|
|
TCGv_i64 temp = tcg_temp_new_i64(s);
|
|
|
|
TCGv_i64 orig = MAKE_TCGV_I64(args[i]);
|
|
|
|
if (is_signed) {
|
2017-02-26 02:47:40 +01:00
|
|
|
tcg_gen_ext32s_i64(s, temp, orig);
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
2017-02-26 02:47:40 +01:00
|
|
|
tcg_gen_ext32u_i64(s, temp, orig);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
args[i] = GET_TCGV_I64(temp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* TCG_TARGET_EXTEND_ARGS */
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
pi_first = pi = s->gen_next_parm_idx;
|
2015-08-21 09:04:50 +02:00
|
|
|
if (ret != TCG_CALL_DUMMY_ARG) {
|
|
|
|
#if defined(__sparc__) && !defined(__arch64__) \
|
|
|
|
&& !defined(CONFIG_TCG_INTERPRETER)
|
|
|
|
if (orig_sizemask & 1) {
|
|
|
|
/* The 32-bit ABI is going to return the 64-bit value in
|
|
|
|
the %o0/%o1 register pair. Prepare for this by using
|
|
|
|
two return temporaries, and reassemble below. */
|
|
|
|
retl = tcg_temp_new_i64(s);
|
|
|
|
reth = tcg_temp_new_i64(s);
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = GET_TCGV_I64(reth);
|
|
|
|
s->gen_opparam_buf[pi++] = GET_TCGV_I64(retl);
|
2015-08-21 09:04:50 +02:00
|
|
|
nb_rets = 2;
|
|
|
|
} else {
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = ret;
|
2015-08-21 09:04:50 +02:00
|
|
|
nb_rets = 1;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
if (TCG_TARGET_REG_BITS < 64 && (sizemask & 1)) {
|
|
|
|
#ifdef HOST_WORDS_BIGENDIAN
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = ret + 1;
|
|
|
|
s->gen_opparam_buf[pi++] = ret;
|
2015-08-21 09:04:50 +02:00
|
|
|
#else
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = ret;
|
|
|
|
s->gen_opparam_buf[pi++] = ret + 1;
|
2015-08-21 09:04:50 +02:00
|
|
|
#endif
|
|
|
|
nb_rets = 2;
|
|
|
|
} else {
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = ret;
|
2015-08-21 09:04:50 +02:00
|
|
|
nb_rets = 1;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
nb_rets = 0;
|
|
|
|
}
|
|
|
|
real_args = 0;
|
|
|
|
for (i = 0; i < nargs; i++) {
|
|
|
|
int is_64bit = sizemask & (1 << (i+1)*2);
|
|
|
|
if (TCG_TARGET_REG_BITS < 64 && is_64bit) {
|
|
|
|
#ifdef TCG_TARGET_CALL_ALIGN_ARGS
|
|
|
|
/* some targets want aligned 64 bit args */
|
|
|
|
if (real_args & 1) {
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = TCG_CALL_DUMMY_ARG;
|
2015-08-21 09:04:50 +02:00
|
|
|
real_args++;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
/* If stack grows up, then we will be placing successive
|
|
|
|
arguments at lower addresses, which means we need to
|
|
|
|
reverse the order compared to how we would normally
|
|
|
|
treat either big or little-endian. For those arguments
|
|
|
|
that will wind up in registers, this still works for
|
|
|
|
HPPA (the only current STACK_GROWSUP target) since the
|
|
|
|
argument registers are *also* allocated in decreasing
|
|
|
|
order. If another such target is added, this logic may
|
|
|
|
have to get more complicated to differentiate between
|
|
|
|
stack arguments and register arguments. */
|
|
|
|
#if defined(HOST_WORDS_BIGENDIAN) != defined(TCG_TARGET_STACK_GROWSUP)
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = args[i] + 1;
|
|
|
|
s->gen_opparam_buf[pi++] = args[i];
|
2015-08-21 09:04:50 +02:00
|
|
|
#else
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = args[i];
|
|
|
|
s->gen_opparam_buf[pi++] = args[i] + 1;
|
2015-08-21 09:04:50 +02:00
|
|
|
#endif
|
|
|
|
real_args += 2;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = args[i];
|
2015-08-21 09:04:50 +02:00
|
|
|
real_args++;
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
s->gen_opparam_buf[pi++] = (uintptr_t)func;
|
|
|
|
s->gen_opparam_buf[pi++] = flags;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
i = s->gen_next_op_idx;
|
|
|
|
tcg_debug_assert(i < OPC_BUF_SIZE);
|
|
|
|
tcg_debug_assert(pi <= OPPARAM_BUF_SIZE);
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
/* Set links for sequential allocation during translation. */
|
|
|
|
TCGOp op = {0};
|
|
|
|
op.opc = INDEX_op_call;
|
|
|
|
op.callo = nb_rets;
|
|
|
|
op.calli = real_args;
|
|
|
|
op.args = pi_first;
|
|
|
|
op.prev = i - 1;
|
|
|
|
op.next = i + 1;
|
|
|
|
s->gen_op_buf[i] = op;
|
|
|
|
|
|
|
|
/* Make sure the calli field didn't overflow. */
|
|
|
|
tcg_debug_assert(s->gen_op_buf[i].calli == real_args);
|
|
|
|
|
|
|
|
s->gen_last_op_idx = i;
|
|
|
|
s->gen_next_op_idx = i + 1;
|
|
|
|
s->gen_next_parm_idx = pi;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
#if defined(__sparc__) && !defined(__arch64__) \
|
|
|
|
&& !defined(CONFIG_TCG_INTERPRETER)
|
|
|
|
/* Free all of the parts we allocated above. */
|
|
|
|
for (i = real_args = 0; i < orig_nargs; ++i) {
|
|
|
|
int is_64bit = orig_sizemask & (1 << (i+1)*2);
|
|
|
|
if (is_64bit) {
|
|
|
|
TCGv_i32 h = MAKE_TCGV_I32(args[real_args++]);
|
|
|
|
TCGv_i32 l = MAKE_TCGV_I32(args[real_args++]);
|
2017-02-26 02:47:40 +01:00
|
|
|
tcg_temp_free_i32(s, h);
|
|
|
|
tcg_temp_free_i32(s, l);
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
real_args++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (orig_sizemask & 1) {
|
|
|
|
/* The 32-bit ABI returned two 32-bit pieces. Re-assemble them.
|
|
|
|
Note that describing these as TCGv_i64 eliminates an unnecessary
|
|
|
|
zero-extension that tcg_gen_concat_i32_i64 would create. */
|
|
|
|
tcg_gen_concat32_i64(MAKE_TCGV_I64(ret), retl, reth);
|
2017-02-26 02:47:40 +01:00
|
|
|
tcg_temp_free_i64(s, retl);
|
|
|
|
tcg_temp_free_i64(s, reth);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
#elif defined(TCG_TARGET_EXTEND_ARGS) && TCG_TARGET_REG_BITS == 64
|
|
|
|
for (i = 0; i < nargs; ++i) {
|
|
|
|
int is_64bit = sizemask & (1 << (i+1)*2);
|
|
|
|
if (!is_64bit) {
|
|
|
|
TCGv_i64 temp = MAKE_TCGV_I64(args[i]);
|
2017-02-26 02:47:40 +01:00
|
|
|
tcg_temp_free_i64(s, temp);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* TCG_TARGET_EXTEND_ARGS */
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tcg_reg_alloc_start(TCGContext *s)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
TCGTemp *ts;
|
|
|
|
for(i = 0; i < s->nb_globals; i++) {
|
|
|
|
ts = &s->temps[i];
|
|
|
|
if (ts->fixed_reg) {
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
} else {
|
|
|
|
ts->val_type = TEMP_VAL_MEM;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for(i = s->nb_globals; i < s->nb_temps; i++) {
|
|
|
|
ts = &s->temps[i];
|
|
|
|
if (ts->temp_local) {
|
|
|
|
ts->val_type = TEMP_VAL_MEM;
|
|
|
|
} else {
|
|
|
|
ts->val_type = TEMP_VAL_DEAD;
|
|
|
|
}
|
|
|
|
ts->mem_allocated = 0;
|
|
|
|
ts->fixed_reg = 0;
|
|
|
|
}
|
|
|
|
for(i = 0; i < TCG_TARGET_NB_REGS; i++) {
|
|
|
|
s->reg_to_temp[i] = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *tcg_get_arg_str_idx(TCGContext *s, char *buf, int buf_size,
|
|
|
|
int idx)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
|
|
|
|
assert(idx >= 0 && idx < s->nb_temps);
|
|
|
|
ts = &s->temps[idx];
|
|
|
|
if (idx < s->nb_globals) {
|
|
|
|
pstrcpy(buf, buf_size, ts->name);
|
|
|
|
} else {
|
|
|
|
if (ts->temp_local)
|
|
|
|
snprintf(buf, buf_size, "loc%d", idx - s->nb_globals);
|
|
|
|
else
|
|
|
|
snprintf(buf, buf_size, "tmp%d", idx - s->nb_globals);
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *tcg_get_arg_str_i32(TCGContext *s, char *buf, int buf_size, TCGv_i32 arg)
|
|
|
|
{
|
|
|
|
return tcg_get_arg_str_idx(s, buf, buf_size, GET_TCGV_I32(arg));
|
|
|
|
}
|
|
|
|
|
|
|
|
char *tcg_get_arg_str_i64(TCGContext *s, char *buf, int buf_size, TCGv_i64 arg)
|
|
|
|
{
|
|
|
|
return tcg_get_arg_str_idx(s, buf, buf_size, GET_TCGV_I64(arg));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Find helper name. */
|
|
|
|
static inline const char *tcg_find_helper(TCGContext *s, uintptr_t val)
|
|
|
|
{
|
|
|
|
const char *ret = NULL;
|
|
|
|
if (s->helpers) {
|
|
|
|
TCGHelperInfo *info = g_hash_table_lookup(s->helpers, (gpointer)val);
|
|
|
|
if (info) {
|
|
|
|
ret = info->name;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char * const cond_name[] =
|
|
|
|
{
|
2017-01-19 12:50:28 +01:00
|
|
|
#ifdef _MSC_VER
|
2017-01-21 02:28:22 +01:00
|
|
|
"never", // TCG_COND_NEVER
|
|
|
|
"always", // TCG_COND_ALWAYS
|
|
|
|
"lt", // TCG_COND_LT
|
|
|
|
"ge", // TCG_COND_GE
|
|
|
|
"ltu", // TCG_COND_LTU
|
|
|
|
"geu", // TCG_COND_GEU
|
|
|
|
NULL, // n/a
|
|
|
|
NULL, // n/a
|
|
|
|
"eq", // TCG_COND_EQ
|
|
|
|
"ne", // TCG_COND_NE
|
|
|
|
"le", // TCG_COND_LE
|
|
|
|
"gt", // TCG_COND_GT
|
|
|
|
"leu", // TCG_COND_LEU
|
|
|
|
"gtu", // TCG_COND_GTU
|
|
|
|
NULL, // n/a
|
|
|
|
NULL, // n/a
|
2017-01-19 12:50:28 +01:00
|
|
|
#else
|
2015-08-21 09:04:50 +02:00
|
|
|
[TCG_COND_NEVER] = "never",
|
|
|
|
[TCG_COND_ALWAYS] = "always",
|
|
|
|
[TCG_COND_EQ] = "eq",
|
|
|
|
[TCG_COND_NE] = "ne",
|
|
|
|
[TCG_COND_LT] = "lt",
|
|
|
|
[TCG_COND_GE] = "ge",
|
|
|
|
[TCG_COND_LE] = "le",
|
|
|
|
[TCG_COND_GT] = "gt",
|
|
|
|
[TCG_COND_LTU] = "ltu",
|
|
|
|
[TCG_COND_GEU] = "geu",
|
|
|
|
[TCG_COND_LEU] = "leu",
|
|
|
|
[TCG_COND_GTU] = "gtu"
|
2017-01-19 12:50:28 +01:00
|
|
|
#endif
|
2015-08-21 09:04:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
static const char * const ldst_name[] =
|
|
|
|
{
|
2017-01-19 12:50:28 +01:00
|
|
|
#ifdef _MSC_VER
|
2017-01-21 02:28:22 +01:00
|
|
|
"ub", // MO_UB
|
2017-01-19 12:50:28 +01:00
|
|
|
# ifdef HOST_WORDS_BIGENDIAN
|
2017-01-21 02:28:22 +01:00
|
|
|
"beuw", // MO_BEUW
|
|
|
|
"beul", // MO_BEUL
|
|
|
|
"beq", // MO_BEQ
|
|
|
|
"sb", // MO_SB
|
|
|
|
"besw", // MO_BESW
|
|
|
|
"besl", // MO_BESL
|
|
|
|
NULL, // n/a
|
|
|
|
NULL, // n/a
|
|
|
|
"leuw", // MO_LEUW
|
|
|
|
"leul", // MO_LEUL
|
|
|
|
"leq", // MO_LEQ
|
|
|
|
NULL, // n/a
|
|
|
|
"lesw", // MO_LESW
|
|
|
|
"lesl", // MO_LESL
|
|
|
|
NULL, // n/a
|
2017-01-19 12:50:28 +01:00
|
|
|
# else // !HOST_WORDS_BIGENDIAN
|
2017-01-21 02:28:22 +01:00
|
|
|
"leuw", // MO_LEUW
|
|
|
|
"leul", // MO_LEUL
|
|
|
|
"leq", // MO_LEQ
|
|
|
|
"sb", // MO_SB
|
|
|
|
"lesw", // MO_LESW
|
|
|
|
"lesl", // MO_LESL
|
|
|
|
NULL, // n/a
|
|
|
|
NULL, // n/a
|
|
|
|
"beuw", // MO_BEUW
|
|
|
|
"beul", // MO_BEUL
|
|
|
|
"beq", // MO_BEQ
|
|
|
|
NULL, // n/a
|
|
|
|
"besw", // MO_BESW
|
|
|
|
"besl", // MO_BESL
|
|
|
|
NULL, // n/a
|
2017-01-19 12:50:28 +01:00
|
|
|
# endif // HOST_WORDS_BIGENDIAN
|
|
|
|
|
|
|
|
#else //_MSC_VER
|
2017-01-21 02:28:22 +01:00
|
|
|
[MO_UB] = "ub",
|
2015-08-21 09:04:50 +02:00
|
|
|
[MO_SB] = "sb",
|
|
|
|
[MO_LEUW] = "leuw",
|
|
|
|
[MO_LESW] = "lesw",
|
|
|
|
[MO_LEUL] = "leul",
|
|
|
|
[MO_LESL] = "lesl",
|
|
|
|
[MO_LEQ] = "leq",
|
|
|
|
[MO_BEUW] = "beuw",
|
|
|
|
[MO_BESW] = "besw",
|
|
|
|
[MO_BEUL] = "beul",
|
|
|
|
[MO_BESL] = "besl",
|
|
|
|
[MO_BEQ] = "beq",
|
2017-01-19 12:50:28 +01:00
|
|
|
#endif // _MSC_VER
|
2015-08-21 09:04:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
void tcg_dump_ops(TCGContext *s)
|
|
|
|
{
|
|
|
|
char buf[128];
|
2018-02-09 15:54:01 +01:00
|
|
|
TCGOp *op;
|
|
|
|
int oi;
|
|
|
|
|
|
|
|
for (oi = s->gen_first_op_idx; oi >= 0; oi = op->next) {
|
|
|
|
int i, k, nb_oargs, nb_iargs, nb_cargs;
|
|
|
|
const TCGOpDef *def;
|
|
|
|
const TCGArg *args;
|
|
|
|
TCGOpcode c;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
op = &s->gen_op_buf[oi];
|
|
|
|
c = op->opc;
|
2015-08-21 09:04:50 +02:00
|
|
|
def = &s->tcg_op_defs[c];
|
2018-02-09 15:54:01 +01:00
|
|
|
args = &s->gen_opparam_buf[op->args];
|
|
|
|
|
2018-02-11 18:31:22 +01:00
|
|
|
if (c == INDEX_op_insn_start) {
|
2018-02-11 19:03:29 +01:00
|
|
|
printf("%s ----", oi != s->gen_first_op_idx ? "\n" : "");
|
|
|
|
|
|
|
|
for (i = 0; i < TARGET_INSN_START_WORDS; ++i) {
|
|
|
|
target_ulong a;
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
#if TARGET_LONG_BITS > TCG_TARGET_REG_BITS
|
2018-02-11 19:03:29 +01:00
|
|
|
a = ((target_ulong)args[i * 2 + 1] << 32) | args[i * 2];
|
2015-08-21 09:04:50 +02:00
|
|
|
#else
|
2018-02-11 19:03:29 +01:00
|
|
|
a = args[i];
|
2015-08-21 09:04:50 +02:00
|
|
|
#endif
|
2018-02-11 19:03:29 +01:00
|
|
|
printf(" " TARGET_FMT_lx, a);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
} else if (c == INDEX_op_call) {
|
|
|
|
/* variable number of arguments */
|
2018-02-09 15:54:01 +01:00
|
|
|
nb_oargs = op->callo;
|
|
|
|
nb_iargs = op->calli;
|
2015-08-21 09:04:50 +02:00
|
|
|
nb_cargs = def->nb_cargs;
|
|
|
|
|
|
|
|
/* function name, flags, out args */
|
|
|
|
printf(" %s %s,$0x%" TCG_PRIlx ",$%d", def->name,
|
|
|
|
tcg_find_helper(s, args[nb_oargs + nb_iargs]),
|
|
|
|
args[nb_oargs + nb_iargs + 1], nb_oargs);
|
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
|
|
|
printf(",%s", tcg_get_arg_str_idx(s, buf, sizeof(buf),
|
|
|
|
args[i]));
|
|
|
|
}
|
|
|
|
for (i = 0; i < nb_iargs; i++) {
|
|
|
|
TCGArg arg = args[nb_oargs + i];
|
|
|
|
const char *t = "<dummy>";
|
|
|
|
if (arg != TCG_CALL_DUMMY_ARG) {
|
|
|
|
t = tcg_get_arg_str_idx(s, buf, sizeof(buf), arg);
|
|
|
|
}
|
|
|
|
printf(",%s", t);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
printf(" %s ", def->name);
|
2018-02-09 15:54:01 +01:00
|
|
|
|
|
|
|
nb_oargs = def->nb_oargs;
|
|
|
|
nb_iargs = def->nb_iargs;
|
|
|
|
nb_cargs = def->nb_cargs;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
k = 0;
|
2018-02-09 15:54:01 +01:00
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
if (k != 0) {
|
|
|
|
printf(",");
|
|
|
|
}
|
|
|
|
printf("%s", tcg_get_arg_str_idx(s, buf, sizeof(buf),
|
|
|
|
args[k++]));
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
for (i = 0; i < nb_iargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
if (k != 0) {
|
|
|
|
printf(",");
|
|
|
|
}
|
|
|
|
printf("%s", tcg_get_arg_str_idx(s, buf, sizeof(buf),
|
|
|
|
args[k++]));
|
|
|
|
}
|
|
|
|
switch (c) {
|
|
|
|
case INDEX_op_brcond_i32:
|
|
|
|
case INDEX_op_setcond_i32:
|
|
|
|
case INDEX_op_movcond_i32:
|
|
|
|
case INDEX_op_brcond2_i32:
|
|
|
|
case INDEX_op_setcond2_i32:
|
|
|
|
case INDEX_op_brcond_i64:
|
|
|
|
case INDEX_op_setcond_i64:
|
|
|
|
case INDEX_op_movcond_i64:
|
|
|
|
if (args[k] < ARRAY_SIZE(cond_name) && cond_name[args[k]]) {
|
|
|
|
printf(",%s", cond_name[args[k++]]);
|
|
|
|
} else {
|
|
|
|
printf(",$0x%" TCG_PRIlx, args[k++]);
|
|
|
|
}
|
|
|
|
i = 1;
|
|
|
|
break;
|
|
|
|
case INDEX_op_qemu_ld_i32:
|
|
|
|
case INDEX_op_qemu_st_i32:
|
|
|
|
case INDEX_op_qemu_ld_i64:
|
|
|
|
case INDEX_op_qemu_st_i64:
|
2018-02-11 01:01:17 +01:00
|
|
|
{
|
|
|
|
TCGMemOpIdx oi = args[k++];
|
|
|
|
TCGMemOp op = get_memop(oi);
|
|
|
|
unsigned ix = get_mmuidx(oi);
|
|
|
|
|
2018-02-11 02:32:48 +01:00
|
|
|
if (op & ~(MO_AMASK | MO_BSWAP | MO_SSIZE)) {
|
2018-02-11 01:01:17 +01:00
|
|
|
printf(",%s,%u", ldst_name[op], ix);
|
|
|
|
} else {
|
2018-02-11 02:32:48 +01:00
|
|
|
const char *s_al = "", *s_op;
|
|
|
|
if (op & MO_AMASK) {
|
|
|
|
if ((op & MO_AMASK) == MO_ALIGN) {
|
|
|
|
s_al = "al+";
|
|
|
|
} else {
|
|
|
|
s_al = "un+";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s_op = ldst_name[op & (MO_BSWAP | MO_SSIZE)];
|
|
|
|
printf(",%s%s,%u", s_al, s_op, ix);
|
2018-02-11 01:01:17 +01:00
|
|
|
}
|
|
|
|
i = 1;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
i = 0;
|
|
|
|
break;
|
|
|
|
}
|
2018-02-09 20:47:48 +01:00
|
|
|
switch (c) {
|
|
|
|
case INDEX_op_set_label:
|
|
|
|
case INDEX_op_br:
|
|
|
|
case INDEX_op_brcond_i32:
|
|
|
|
case INDEX_op_brcond_i64:
|
|
|
|
case INDEX_op_brcond2_i32:
|
|
|
|
qemu_log("%s$L%d", k ? "," : "", arg_label(s, args[k])->id);
|
|
|
|
i++, k++;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
for (; i < nb_cargs; i++, k++) {
|
|
|
|
qemu_log("%s$0x%" TCG_PRIlx, k ? "," : "", args[k]);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
printf("###########\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we give more priority to constraints with less registers */
|
|
|
|
static int get_constraint_priority(const TCGOpDef *def, int k)
|
|
|
|
{
|
|
|
|
const TCGArgConstraint *arg_ct;
|
|
|
|
|
|
|
|
int i, n;
|
|
|
|
arg_ct = &def->args_ct[k];
|
|
|
|
if (arg_ct->ct & TCG_CT_ALIAS) {
|
|
|
|
/* an alias is equivalent to a single register */
|
|
|
|
n = 1;
|
|
|
|
} else {
|
|
|
|
if (!(arg_ct->ct & TCG_CT_REG))
|
|
|
|
return 0;
|
|
|
|
n = 0;
|
|
|
|
for(i = 0; i < TCG_TARGET_NB_REGS; i++) {
|
|
|
|
if (tcg_regset_test_reg(arg_ct->u.regs, i))
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return TCG_TARGET_NB_REGS - n + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort from highest priority to lowest */
|
|
|
|
static void sort_constraints(TCGOpDef *def, int start, int n)
|
|
|
|
{
|
|
|
|
int i, j, p1, p2, tmp;
|
|
|
|
|
|
|
|
for(i = 0; i < n; i++)
|
|
|
|
def->sorted_args[start + i] = start + i;
|
|
|
|
if (n <= 1)
|
|
|
|
return;
|
|
|
|
for(i = 0; i < n - 1; i++) {
|
|
|
|
for(j = i + 1; j < n; j++) {
|
|
|
|
p1 = get_constraint_priority(def, def->sorted_args[start + i]);
|
|
|
|
p2 = get_constraint_priority(def, def->sorted_args[start + j]);
|
|
|
|
if (p1 < p2) {
|
|
|
|
tmp = def->sorted_args[start + i];
|
|
|
|
def->sorted_args[start + i] = def->sorted_args[start + j];
|
|
|
|
def->sorted_args[start + j] = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void tcg_add_target_add_op_defs(TCGContext *s, const TCGTargetOpDef *tdefs)
|
|
|
|
{
|
|
|
|
TCGOpcode op;
|
|
|
|
TCGOpDef *def;
|
|
|
|
const char *ct_str;
|
|
|
|
int i, nb_args;
|
|
|
|
|
|
|
|
for(;;) {
|
|
|
|
if (tdefs->op == (TCGOpcode)-1)
|
|
|
|
break;
|
|
|
|
op = tdefs->op;
|
|
|
|
assert((unsigned)op < NB_OPS);
|
|
|
|
def = &s->tcg_op_defs[op];
|
|
|
|
#if defined(CONFIG_DEBUG_TCG)
|
|
|
|
/* Duplicate entry in op definitions? */
|
|
|
|
assert(!def->used);
|
|
|
|
def->used = 1;
|
|
|
|
#endif
|
|
|
|
nb_args = def->nb_iargs + def->nb_oargs;
|
|
|
|
for(i = 0; i < nb_args; i++) {
|
|
|
|
ct_str = tdefs->args_ct_str[i];
|
|
|
|
/* Incomplete TCGTargetOpDef entry? */
|
|
|
|
assert(ct_str != NULL);
|
|
|
|
tcg_regset_clear(def->args_ct[i].u.regs);
|
|
|
|
def->args_ct[i].ct = 0;
|
|
|
|
if (ct_str[0] >= '0' && ct_str[0] <= '9') {
|
|
|
|
int oarg;
|
|
|
|
oarg = ct_str[0] - '0';
|
|
|
|
assert(oarg < def->nb_oargs);
|
|
|
|
assert(def->args_ct[oarg].ct & TCG_CT_REG);
|
|
|
|
/* TCG_CT_ALIAS is for the output arguments. The input
|
|
|
|
argument is tagged with TCG_CT_IALIAS. */
|
|
|
|
def->args_ct[i] = def->args_ct[oarg];
|
|
|
|
def->args_ct[oarg].ct = TCG_CT_ALIAS;
|
|
|
|
def->args_ct[oarg].alias_index = i;
|
|
|
|
def->args_ct[i].ct |= TCG_CT_IALIAS;
|
|
|
|
def->args_ct[i].alias_index = oarg;
|
|
|
|
} else {
|
|
|
|
for(;;) {
|
|
|
|
if (*ct_str == '\0')
|
|
|
|
break;
|
|
|
|
switch(*ct_str) {
|
|
|
|
case 'i':
|
|
|
|
def->args_ct[i].ct |= TCG_CT_CONST;
|
|
|
|
ct_str++;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
if (target_parse_constraint(&def->args_ct[i], &ct_str) < 0) {
|
|
|
|
fprintf(stderr, "Invalid constraint '%s' for arg %d of operation '%s'\n",
|
|
|
|
ct_str, i, def->name);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TCGTargetOpDef entry with too much information? */
|
|
|
|
assert(i == TCG_MAX_OP_ARGS || tdefs->args_ct_str[i] == NULL);
|
|
|
|
|
|
|
|
/* sort the constraints (XXX: this is just an heuristic) */
|
|
|
|
sort_constraints(def, 0, def->nb_oargs);
|
|
|
|
sort_constraints(def, def->nb_oargs, def->nb_iargs);
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
printf("%s: sorted=", def->name);
|
|
|
|
for(i = 0; i < def->nb_oargs + def->nb_iargs; i++)
|
|
|
|
printf(" %d", def->sorted_args[i]);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
tdefs++;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(CONFIG_DEBUG_TCG)
|
|
|
|
i = 0;
|
2018-02-15 21:11:02 +01:00
|
|
|
for (op = 0; op < tcg_op_defs_org_max; op++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
const TCGOpDef *def = &s->tcg_op_defs[op];
|
|
|
|
if (def->flags & TCG_OPF_NOT_PRESENT) {
|
|
|
|
/* Wrong entry in op definitions? */
|
|
|
|
if (def->used) {
|
|
|
|
fprintf(stderr, "Invalid op definition for %s\n", def->name);
|
|
|
|
i = 1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Missing entry in op definitions? */
|
|
|
|
if (!def->used) {
|
|
|
|
fprintf(stderr, "Missing op definition for %s\n", def->name);
|
|
|
|
i = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (i == 1) {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2018-02-09 19:03:25 +01:00
|
|
|
void tcg_op_remove(TCGContext *s, TCGOp *op)
|
|
|
|
{
|
|
|
|
int next = op->next;
|
|
|
|
int prev = op->prev;
|
|
|
|
|
|
|
|
if (next >= 0) {
|
|
|
|
s->gen_op_buf[next].prev = prev;
|
|
|
|
} else {
|
|
|
|
s->gen_last_op_idx = prev;
|
|
|
|
}
|
|
|
|
if (prev >= 0) {
|
|
|
|
s->gen_op_buf[prev].next = next;
|
|
|
|
} else {
|
|
|
|
s->gen_first_op_idx = next;
|
|
|
|
}
|
|
|
|
|
2018-02-09 19:20:10 +01:00
|
|
|
memset(op, -1, sizeof(*op));
|
2018-02-09 19:03:25 +01:00
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
s->del_op_count++;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
#ifdef USE_LIVENESS_ANALYSIS
|
|
|
|
|
|
|
|
/* liveness analysis: end of function: all temps are dead, and globals
|
|
|
|
should be in memory. */
|
|
|
|
static inline void tcg_la_func_end(TCGContext *s, uint8_t *dead_temps,
|
|
|
|
uint8_t *mem_temps)
|
|
|
|
{
|
|
|
|
memset(dead_temps, 1, s->nb_temps);
|
|
|
|
memset(mem_temps, 1, s->nb_globals);
|
|
|
|
memset(mem_temps + s->nb_globals, 0, s->nb_temps - s->nb_globals);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* liveness analysis: end of basic block: all temps are dead, globals
|
|
|
|
and local temps should be in memory. */
|
|
|
|
static inline void tcg_la_bb_end(TCGContext *s, uint8_t *dead_temps,
|
|
|
|
uint8_t *mem_temps)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
memset(dead_temps, 1, s->nb_temps);
|
|
|
|
memset(mem_temps, 1, s->nb_globals);
|
|
|
|
for(i = s->nb_globals; i < s->nb_temps; i++) {
|
|
|
|
mem_temps[i] = s->temps[i].temp_local;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-12-21 11:01:01 +01:00
|
|
|
/*
|
|
|
|
Unicorn: for brcond, we should refresh liveness states for TCG globals
|
|
|
|
*/
|
|
|
|
static inline void tcg_la_br_end(TCGContext *s, uint8_t *mem_temps)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
memset(mem_temps, 1, s->nb_globals);
|
|
|
|
for(i = s->nb_globals; i < s->nb_temps; i++) {
|
|
|
|
mem_temps[i] = s->temps[i].temp_local;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
/* Liveness analysis : update the opc_dead_args array to tell if a
|
|
|
|
given input arguments is dead. Instructions updating dead
|
|
|
|
temporaries are removed. */
|
|
|
|
static void tcg_liveness_analysis(TCGContext *s)
|
|
|
|
{
|
|
|
|
uint8_t *dead_temps, *mem_temps;
|
2018-02-09 15:54:01 +01:00
|
|
|
int oi, oi_prev, nb_ops;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
nb_ops = s->gen_next_op_idx;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
s->op_dead_args = tcg_malloc(s, nb_ops * sizeof(uint16_t));
|
|
|
|
s->op_sync_args = tcg_malloc(s, nb_ops * sizeof(uint8_t));
|
|
|
|
|
|
|
|
dead_temps = tcg_malloc(s, s->nb_temps);
|
|
|
|
mem_temps = tcg_malloc(s, s->nb_temps);
|
|
|
|
tcg_la_func_end(s, dead_temps, mem_temps);
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
for (oi = s->gen_last_op_idx; oi >= 0; oi = oi_prev) {
|
|
|
|
int i, nb_iargs, nb_oargs;
|
|
|
|
TCGOpcode opc_new, opc_new2;
|
|
|
|
bool have_opc_new2;
|
|
|
|
uint16_t dead_args;
|
|
|
|
uint8_t sync_args;
|
|
|
|
TCGArg arg;
|
|
|
|
|
|
|
|
TCGOp * const op = &s->gen_op_buf[oi];
|
|
|
|
TCGArg * const args = &s->gen_opparam_buf[op->args];
|
|
|
|
TCGOpcode opc = op->opc;
|
|
|
|
const TCGOpDef *def = &s->tcg_op_defs[opc];
|
|
|
|
|
|
|
|
oi_prev = op->prev;
|
|
|
|
|
|
|
|
switch(opc) {
|
2015-08-21 09:04:50 +02:00
|
|
|
case INDEX_op_call:
|
|
|
|
{
|
|
|
|
int call_flags;
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
nb_oargs = op->callo;
|
|
|
|
nb_iargs = op->calli;
|
2015-08-21 09:04:50 +02:00
|
|
|
call_flags = args[nb_oargs + nb_iargs + 1];
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
/* pure functions can be removed if their result is unused */
|
2015-08-21 09:04:50 +02:00
|
|
|
if (call_flags & TCG_CALL_NO_SIDE_EFFECTS) {
|
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
|
|
|
arg = args[i];
|
|
|
|
if (!dead_temps[arg] || mem_temps[arg]) {
|
|
|
|
goto do_not_remove_call;
|
|
|
|
}
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
goto do_remove;
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
do_not_remove_call:
|
|
|
|
|
|
|
|
/* output args are dead */
|
|
|
|
dead_args = 0;
|
|
|
|
sync_args = 0;
|
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
|
|
|
arg = args[i];
|
|
|
|
if (dead_temps[arg]) {
|
|
|
|
dead_args |= (1 << i);
|
|
|
|
}
|
|
|
|
if (mem_temps[arg]) {
|
|
|
|
sync_args |= (1 << i);
|
|
|
|
}
|
|
|
|
dead_temps[arg] = 1;
|
|
|
|
mem_temps[arg] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(call_flags & TCG_CALL_NO_READ_GLOBALS)) {
|
|
|
|
/* globals should be synced to memory */
|
|
|
|
memset(mem_temps, 1, s->nb_globals);
|
|
|
|
}
|
|
|
|
if (!(call_flags & (TCG_CALL_NO_WRITE_GLOBALS |
|
|
|
|
TCG_CALL_NO_READ_GLOBALS))) {
|
|
|
|
/* globals should go back to memory */
|
|
|
|
memset(dead_temps, 1, s->nb_globals);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* input args are live */
|
|
|
|
for (i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
|
|
|
|
arg = args[i];
|
|
|
|
if (arg != TCG_CALL_DUMMY_ARG) {
|
|
|
|
if (dead_temps[arg]) {
|
|
|
|
dead_args |= (1 << i);
|
|
|
|
}
|
|
|
|
dead_temps[arg] = 0;
|
|
|
|
}
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
s->op_dead_args[oi] = dead_args;
|
|
|
|
s->op_sync_args[oi] = sync_args;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2018-02-11 18:31:22 +01:00
|
|
|
case INDEX_op_insn_start:
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
case INDEX_op_discard:
|
|
|
|
/* mark the temporary as dead */
|
|
|
|
dead_temps[args[0]] = 1;
|
|
|
|
mem_temps[args[0]] = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case INDEX_op_add2_i32:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_add_i32;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_addsub2;
|
|
|
|
case INDEX_op_sub2_i32:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_sub_i32;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_addsub2;
|
|
|
|
case INDEX_op_add2_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_add_i64;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_addsub2;
|
|
|
|
case INDEX_op_sub2_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_sub_i64;
|
2015-08-21 09:04:50 +02:00
|
|
|
do_addsub2:
|
|
|
|
nb_iargs = 4;
|
|
|
|
nb_oargs = 2;
|
|
|
|
/* Test if the high part of the operation is dead, but not
|
|
|
|
the low part. The result can be optimized to a simple
|
|
|
|
add or sub. This happens often for x86_64 guest when the
|
|
|
|
cpu mode is set to 32 bit. */
|
|
|
|
if (dead_temps[args[1]] && !mem_temps[args[1]]) {
|
|
|
|
if (dead_temps[args[0]] && !mem_temps[args[0]]) {
|
|
|
|
goto do_remove;
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
/* Replace the opcode and adjust the args in place,
|
|
|
|
leaving 3 unused args at the end. */
|
|
|
|
op->opc = opc = opc_new;
|
2015-08-21 09:04:50 +02:00
|
|
|
args[1] = args[2];
|
|
|
|
args[2] = args[4];
|
|
|
|
/* Fall through and mark the single-word operation live. */
|
|
|
|
nb_iargs = 2;
|
|
|
|
nb_oargs = 1;
|
|
|
|
}
|
|
|
|
goto do_not_remove;
|
|
|
|
|
|
|
|
case INDEX_op_mulu2_i32:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_mul_i32;
|
|
|
|
opc_new2 = INDEX_op_muluh_i32;
|
|
|
|
have_opc_new2 = TCG_TARGET_HAS_muluh_i32;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_mul2;
|
|
|
|
case INDEX_op_muls2_i32:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_mul_i32;
|
|
|
|
opc_new2 = INDEX_op_mulsh_i32;
|
|
|
|
have_opc_new2 = TCG_TARGET_HAS_mulsh_i32;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_mul2;
|
|
|
|
case INDEX_op_mulu2_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_mul_i64;
|
|
|
|
opc_new2 = INDEX_op_muluh_i64;
|
|
|
|
have_opc_new2 = TCG_TARGET_HAS_muluh_i64;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_mul2;
|
|
|
|
case INDEX_op_muls2_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
opc_new = INDEX_op_mul_i64;
|
|
|
|
opc_new2 = INDEX_op_mulsh_i64;
|
|
|
|
have_opc_new2 = TCG_TARGET_HAS_mulsh_i64;
|
2015-08-21 09:04:50 +02:00
|
|
|
goto do_mul2;
|
|
|
|
do_mul2:
|
|
|
|
nb_iargs = 2;
|
|
|
|
nb_oargs = 2;
|
|
|
|
if (dead_temps[args[1]] && !mem_temps[args[1]]) {
|
|
|
|
if (dead_temps[args[0]] && !mem_temps[args[0]]) {
|
|
|
|
/* Both parts of the operation are dead. */
|
|
|
|
goto do_remove;
|
|
|
|
}
|
|
|
|
/* The high part of the operation is dead; generate the low. */
|
2018-02-09 15:54:01 +01:00
|
|
|
op->opc = opc = opc_new;
|
2015-08-21 09:04:50 +02:00
|
|
|
args[1] = args[2];
|
|
|
|
args[2] = args[3];
|
2018-02-09 15:54:01 +01:00
|
|
|
} else if (have_opc_new2 && dead_temps[args[0]]
|
2015-08-21 09:04:50 +02:00
|
|
|
&& !mem_temps[args[0]]) {
|
|
|
|
/* The low part of the operation is dead; generate the high. */
|
2018-02-09 15:54:01 +01:00
|
|
|
op->opc = opc = opc_new2;
|
2015-08-21 09:04:50 +02:00
|
|
|
args[0] = args[1];
|
|
|
|
args[1] = args[2];
|
|
|
|
args[2] = args[3];
|
|
|
|
} else {
|
|
|
|
goto do_not_remove;
|
|
|
|
}
|
|
|
|
/* Mark the single-word operation live. */
|
|
|
|
nb_oargs = 1;
|
|
|
|
goto do_not_remove;
|
|
|
|
|
|
|
|
default:
|
|
|
|
/* XXX: optimize by hardcoding common cases (e.g. triadic ops) */
|
|
|
|
nb_iargs = def->nb_iargs;
|
|
|
|
nb_oargs = def->nb_oargs;
|
|
|
|
|
|
|
|
/* Test if the operation can be removed because all
|
|
|
|
its outputs are dead. We assume that nb_oargs == 0
|
|
|
|
implies side effects */
|
|
|
|
if (!(def->flags & TCG_OPF_SIDE_EFFECTS) && nb_oargs != 0) {
|
2018-02-09 15:54:01 +01:00
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
arg = args[i];
|
|
|
|
if (!dead_temps[arg] || mem_temps[arg]) {
|
|
|
|
goto do_not_remove;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
do_remove:
|
2018-02-09 19:20:10 +01:00
|
|
|
tcg_op_remove(s, op);
|
2015-08-21 09:04:50 +02:00
|
|
|
} else {
|
|
|
|
do_not_remove:
|
|
|
|
/* output args are dead */
|
|
|
|
dead_args = 0;
|
|
|
|
sync_args = 0;
|
2018-02-09 15:54:01 +01:00
|
|
|
for (i = 0; i < nb_oargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
arg = args[i];
|
|
|
|
if (dead_temps[arg]) {
|
|
|
|
dead_args |= (1 << i);
|
|
|
|
}
|
|
|
|
if (mem_temps[arg]) {
|
|
|
|
sync_args |= (1 << i);
|
|
|
|
}
|
|
|
|
dead_temps[arg] = 1;
|
|
|
|
mem_temps[arg] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if end of basic block, update */
|
2015-12-21 11:01:01 +01:00
|
|
|
if (def->flags & TCG_OPF_BB_END) {
|
2015-09-22 03:30:05 +02:00
|
|
|
// Unicorn: do not optimize dead temps on brcond,
|
2015-08-21 09:04:50 +02:00
|
|
|
// this causes problem because check_exit_request() inserts
|
|
|
|
// brcond instruction in the middle of the TB,
|
|
|
|
// which incorrectly flags end-of-block
|
2018-02-09 15:54:01 +01:00
|
|
|
if (opc != INDEX_op_brcond_i32)
|
2015-12-28 06:04:59 +01:00
|
|
|
tcg_la_bb_end(s, dead_temps, mem_temps);
|
|
|
|
// Unicorn: we do not touch dead temps for brcond,
|
|
|
|
// but we should refresh TCG globals In-Memory states,
|
|
|
|
// otherwise, important CPU states(especially conditional flags) might be forgotten,
|
|
|
|
// result in wrongly generated host code that run into wrong branch.
|
|
|
|
// Refer to https://github.com/unicorn-engine/unicorn/issues/287 for further information
|
|
|
|
else
|
|
|
|
tcg_la_br_end(s, mem_temps);
|
2015-08-21 09:04:50 +02:00
|
|
|
} else if (def->flags & TCG_OPF_SIDE_EFFECTS) {
|
|
|
|
/* globals should be synced to memory */
|
|
|
|
memset(mem_temps, 1, s->nb_globals);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* input args are live */
|
2018-02-09 15:54:01 +01:00
|
|
|
for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
arg = args[i];
|
|
|
|
if (dead_temps[arg]) {
|
|
|
|
dead_args |= (1 << i);
|
|
|
|
}
|
|
|
|
dead_temps[arg] = 0;
|
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
s->op_dead_args[oi] = dead_args;
|
|
|
|
s->op_sync_args[oi] = sync_args;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
/* dummy liveness analysis */
|
|
|
|
static void tcg_liveness_analysis(TCGContext *s)
|
|
|
|
{
|
2018-02-19 07:42:49 +01:00
|
|
|
int nb_ops = s->gen_next_op_idx;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
s->op_dead_args = tcg_malloc(s, nb_ops * sizeof(uint16_t));
|
|
|
|
memset(s->op_dead_args, 0, nb_ops * sizeof(uint16_t));
|
|
|
|
s->op_sync_args = tcg_malloc(s, nb_ops * sizeof(uint8_t));
|
|
|
|
memset(s->op_sync_args, 0, nb_ops * sizeof(uint8_t));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
static void dump_regs(TCGContext *s)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int i;
|
|
|
|
char buf[64];
|
|
|
|
|
|
|
|
for(i = 0; i < s->nb_temps; i++) {
|
|
|
|
ts = &s->temps[i];
|
|
|
|
printf(" %10s: ", tcg_get_arg_str_idx(s, buf, sizeof(buf), i));
|
|
|
|
switch(ts->val_type) {
|
|
|
|
case TEMP_VAL_REG:
|
|
|
|
printf("%s", tcg_target_reg_names[ts->reg]);
|
|
|
|
break;
|
|
|
|
case TEMP_VAL_MEM:
|
2018-02-08 19:03:59 +01:00
|
|
|
printf("%d(%s)", (int)ts->mem_offset
|
|
|
|
tcg_target_reg_names[ts->mem_base->reg]);
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
case TEMP_VAL_CONST:
|
|
|
|
printf("$0x%" TCG_PRIlx, ts->val);
|
|
|
|
break;
|
|
|
|
case TEMP_VAL_DEAD:
|
|
|
|
printf("D");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("???");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
for(i = 0; i < TCG_TARGET_NB_REGS; i++) {
|
|
|
|
if (s->reg_to_temp[i] >= 0) {
|
|
|
|
printf("%s: %s\n",
|
|
|
|
tcg_target_reg_names[i],
|
|
|
|
tcg_get_arg_str_idx(s, buf, sizeof(buf), s->reg_to_temp[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_regs(TCGContext *s)
|
|
|
|
{
|
|
|
|
int reg, k;
|
|
|
|
TCGTemp *ts;
|
|
|
|
char buf[64];
|
|
|
|
|
|
|
|
for(reg = 0; reg < TCG_TARGET_NB_REGS; reg++) {
|
|
|
|
k = s->reg_to_temp[reg];
|
|
|
|
if (k >= 0) {
|
|
|
|
ts = &s->temps[k];
|
|
|
|
if (ts->val_type != TEMP_VAL_REG ||
|
|
|
|
ts->reg != reg) {
|
|
|
|
printf("Inconsistency for register %s:\n",
|
|
|
|
tcg_target_reg_names[reg]);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for(k = 0; k < s->nb_temps; k++) {
|
|
|
|
ts = &s->temps[k];
|
|
|
|
if (ts->val_type == TEMP_VAL_REG &&
|
|
|
|
!ts->fixed_reg &&
|
|
|
|
s->reg_to_temp[ts->reg] != k) {
|
|
|
|
printf("Inconsistency for temp %s:\n",
|
|
|
|
tcg_get_arg_str_idx(s, buf, sizeof(buf), k));
|
|
|
|
fail:
|
|
|
|
printf("reg state:\n");
|
|
|
|
dump_regs(s);
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static void temp_allocate_frame(TCGContext *s, int temp)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
ts = &s->temps[temp];
|
|
|
|
#if !(defined(__sparc__) && TCG_TARGET_REG_BITS == 64)
|
|
|
|
/* Sparc64 stack is accessed with offset of 2047 */
|
|
|
|
s->current_frame_offset = (s->current_frame_offset +
|
|
|
|
(tcg_target_long)sizeof(tcg_target_long) - 1) &
|
|
|
|
~(sizeof(tcg_target_long) - 1);
|
|
|
|
#endif
|
|
|
|
if (s->current_frame_offset + (tcg_target_long)sizeof(tcg_target_long) >
|
|
|
|
s->frame_end) {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
ts->mem_offset = s->current_frame_offset;
|
2018-02-08 19:03:59 +01:00
|
|
|
ts->mem_base = s->frame_temp;
|
2015-08-21 09:04:50 +02:00
|
|
|
ts->mem_allocated = 1;
|
|
|
|
s->current_frame_offset += sizeof(tcg_target_long);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sync register 'reg' by saving it to the corresponding temporary */
|
|
|
|
static inline void tcg_reg_sync(TCGContext *s, int reg)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int temp;
|
|
|
|
|
|
|
|
temp = s->reg_to_temp[reg];
|
|
|
|
ts = &s->temps[temp];
|
|
|
|
assert(ts->val_type == TEMP_VAL_REG);
|
|
|
|
if (!ts->mem_coherent && !ts->fixed_reg) {
|
|
|
|
if (!ts->mem_allocated) {
|
|
|
|
temp_allocate_frame(s, temp);
|
|
|
|
}
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_st(s, ts->type, reg, ts->mem_base->reg, ts->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
ts->mem_coherent = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* free register 'reg' by spilling the corresponding temporary if necessary */
|
|
|
|
static void tcg_reg_free(TCGContext *s, int reg)
|
|
|
|
{
|
|
|
|
int temp;
|
|
|
|
|
|
|
|
temp = s->reg_to_temp[reg];
|
|
|
|
if (temp != -1) {
|
|
|
|
tcg_reg_sync(s, reg);
|
|
|
|
s->temps[temp].val_type = TEMP_VAL_MEM;
|
|
|
|
s->reg_to_temp[reg] = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Allocate a register belonging to reg1 & ~reg2 */
|
|
|
|
static int tcg_reg_alloc(TCGContext *s, TCGRegSet reg1, TCGRegSet reg2)
|
|
|
|
{
|
|
|
|
int i, reg;
|
|
|
|
TCGRegSet reg_ct;
|
|
|
|
|
|
|
|
tcg_regset_andnot(reg_ct, reg1, reg2);
|
|
|
|
|
|
|
|
/* first try free registers */
|
|
|
|
for(i = 0; i < ARRAY_SIZE(tcg_target_reg_alloc_order); i++) {
|
|
|
|
reg = tcg_target_reg_alloc_order[i];
|
|
|
|
if (tcg_regset_test_reg(reg_ct, reg) && s->reg_to_temp[reg] == -1)
|
|
|
|
return reg;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* XXX: do better spill choice */
|
|
|
|
for(i = 0; i < ARRAY_SIZE(tcg_target_reg_alloc_order); i++) {
|
|
|
|
reg = tcg_target_reg_alloc_order[i];
|
|
|
|
if (tcg_regset_test_reg(reg_ct, reg)) {
|
|
|
|
tcg_reg_free(s, reg);
|
|
|
|
return reg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
/* mark a temporary as dead. */
|
|
|
|
static inline void temp_dead(TCGContext *s, int temp)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
|
|
|
|
ts = &s->temps[temp];
|
|
|
|
if (!ts->fixed_reg) {
|
|
|
|
if (ts->val_type == TEMP_VAL_REG) {
|
|
|
|
s->reg_to_temp[ts->reg] = -1;
|
|
|
|
}
|
|
|
|
if (temp < s->nb_globals || ts->temp_local) {
|
|
|
|
ts->val_type = TEMP_VAL_MEM;
|
|
|
|
} else {
|
|
|
|
ts->val_type = TEMP_VAL_DEAD;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sync a temporary to memory. 'allocated_regs' is used in case a
|
|
|
|
temporary registers needs to be allocated to store a constant. */
|
|
|
|
static inline void temp_sync(TCGContext *s, int temp, TCGRegSet allocated_regs)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
|
|
|
|
ts = &s->temps[temp];
|
|
|
|
if (!ts->fixed_reg) {
|
|
|
|
switch(ts->val_type) {
|
|
|
|
case TEMP_VAL_CONST:
|
2017-01-19 12:50:28 +01:00
|
|
|
ts->reg = tcg_reg_alloc(s, (TCGRegSet)s->tcg_target_available_regs[ts->type],
|
2015-08-21 09:04:50 +02:00
|
|
|
allocated_regs);
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
s->reg_to_temp[ts->reg] = temp;
|
|
|
|
ts->mem_coherent = 0;
|
|
|
|
tcg_out_movi(s, ts->type, ts->reg, ts->val);
|
|
|
|
/* fallthrough*/
|
|
|
|
case TEMP_VAL_REG:
|
|
|
|
tcg_reg_sync(s, ts->reg);
|
|
|
|
break;
|
|
|
|
case TEMP_VAL_DEAD:
|
|
|
|
case TEMP_VAL_MEM:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* save a temporary to memory. 'allocated_regs' is used in case a
|
|
|
|
temporary registers needs to be allocated to store a constant. */
|
|
|
|
static inline void temp_save(TCGContext *s, int temp, TCGRegSet allocated_regs)
|
|
|
|
{
|
|
|
|
#ifdef USE_LIVENESS_ANALYSIS
|
|
|
|
/* The liveness analysis already ensures that globals are back
|
|
|
|
in memory. Keep an assert for safety. */
|
|
|
|
assert(s->temps[temp].val_type == TEMP_VAL_MEM || s->temps[temp].fixed_reg);
|
|
|
|
#else
|
|
|
|
temp_sync(s, temp, allocated_regs);
|
|
|
|
temp_dead(s, temp);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/* save globals to their canonical location and assume they can be
|
|
|
|
modified be the following code. 'allocated_regs' is used in case a
|
|
|
|
temporary registers needs to be allocated to store a constant. */
|
|
|
|
static void save_globals(TCGContext *s, TCGRegSet allocated_regs)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i = 0; i < s->nb_globals; i++) {
|
|
|
|
temp_save(s, i, allocated_regs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sync globals to their canonical location and assume they can be
|
|
|
|
read by the following code. 'allocated_regs' is used in case a
|
|
|
|
temporary registers needs to be allocated to store a constant. */
|
|
|
|
static void sync_globals(TCGContext *s, TCGRegSet allocated_regs)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < s->nb_globals; i++) {
|
|
|
|
#ifdef USE_LIVENESS_ANALYSIS
|
|
|
|
assert(s->temps[i].val_type != TEMP_VAL_REG || s->temps[i].fixed_reg ||
|
|
|
|
s->temps[i].mem_coherent);
|
|
|
|
#else
|
|
|
|
temp_sync(s, i, allocated_regs);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* at the end of a basic block, we assume all temporaries are dead and
|
|
|
|
all globals are stored at their canonical location. */
|
|
|
|
static void tcg_reg_alloc_bb_end(TCGContext *s, TCGRegSet allocated_regs)
|
|
|
|
{
|
|
|
|
TCGTemp *ts;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i = s->nb_globals; i < s->nb_temps; i++) {
|
|
|
|
ts = &s->temps[i];
|
|
|
|
if (ts->temp_local) {
|
|
|
|
temp_save(s, i, allocated_regs);
|
|
|
|
} else {
|
|
|
|
#ifdef USE_LIVENESS_ANALYSIS
|
|
|
|
/* The liveness analysis already ensures that temps are dead.
|
|
|
|
Keep an assert for safety. */
|
|
|
|
assert(ts->val_type == TEMP_VAL_DEAD);
|
|
|
|
#else
|
|
|
|
temp_dead(s, i);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
save_globals(s, allocated_regs);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define IS_DEAD_ARG(n) ((dead_args >> (n)) & 1)
|
|
|
|
#define NEED_SYNC_ARG(n) ((sync_args >> (n)) & 1)
|
|
|
|
|
|
|
|
static void tcg_reg_alloc_movi(TCGContext *s, const TCGArg *args,
|
|
|
|
uint16_t dead_args, uint8_t sync_args)
|
|
|
|
{
|
|
|
|
TCGTemp *ots;
|
|
|
|
tcg_target_ulong val;
|
|
|
|
|
|
|
|
ots = &s->temps[args[0]];
|
|
|
|
val = args[1];
|
|
|
|
|
|
|
|
if (ots->fixed_reg) {
|
|
|
|
/* for fixed registers, we do not do any constant
|
|
|
|
propagation */
|
|
|
|
tcg_out_movi(s, ots->type, ots->reg, val);
|
|
|
|
} else {
|
|
|
|
/* The movi is not explicitly generated here */
|
|
|
|
if (ots->val_type == TEMP_VAL_REG)
|
|
|
|
s->reg_to_temp[ots->reg] = -1;
|
|
|
|
ots->val_type = TEMP_VAL_CONST;
|
|
|
|
ots->val = val;
|
|
|
|
}
|
|
|
|
if (NEED_SYNC_ARG(0)) {
|
|
|
|
temp_sync(s, args[0], s->reserved_regs);
|
|
|
|
}
|
|
|
|
if (IS_DEAD_ARG(0)) {
|
|
|
|
temp_dead(s, args[0]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tcg_reg_alloc_mov(TCGContext *s, const TCGOpDef *def,
|
|
|
|
const TCGArg *args, uint16_t dead_args,
|
|
|
|
uint8_t sync_args)
|
|
|
|
{
|
|
|
|
TCGRegSet allocated_regs;
|
|
|
|
TCGTemp *ts, *ots;
|
|
|
|
TCGType otype, itype;
|
|
|
|
|
|
|
|
tcg_regset_set(allocated_regs, s->reserved_regs);
|
|
|
|
ots = &s->temps[args[0]];
|
|
|
|
ts = &s->temps[args[1]];
|
|
|
|
|
|
|
|
/* Note that otype != itype for no-op truncation. */
|
|
|
|
otype = ots->type;
|
|
|
|
itype = ts->type;
|
|
|
|
|
|
|
|
/* If the source value is not in a register, and we're going to be
|
|
|
|
forced to have it in a register in order to perform the copy,
|
|
|
|
then copy the SOURCE value into its own register first. That way
|
|
|
|
we don't have to reload SOURCE the next time it is used. */
|
|
|
|
if (((NEED_SYNC_ARG(0) || ots->fixed_reg) && ts->val_type != TEMP_VAL_REG)
|
|
|
|
|| ts->val_type == TEMP_VAL_MEM) {
|
2017-01-19 12:50:28 +01:00
|
|
|
ts->reg = tcg_reg_alloc(s, (TCGRegSet)s->tcg_target_available_regs[itype],
|
2015-08-21 09:04:50 +02:00
|
|
|
allocated_regs);
|
|
|
|
if (ts->val_type == TEMP_VAL_MEM) {
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_ld(s, itype, ts->reg, ts->mem_base->reg, ts->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
ts->mem_coherent = 1;
|
|
|
|
} else if (ts->val_type == TEMP_VAL_CONST) {
|
|
|
|
tcg_out_movi(s, itype, ts->reg, ts->val);
|
2015-11-17 17:34:38 +01:00
|
|
|
ts->mem_coherent = 0;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
s->reg_to_temp[ts->reg] = args[1];
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IS_DEAD_ARG(0) && !ots->fixed_reg) {
|
|
|
|
/* mov to a non-saved dead register makes no sense (even with
|
|
|
|
liveness analysis disabled). */
|
|
|
|
assert(NEED_SYNC_ARG(0));
|
|
|
|
/* The code above should have moved the temp to a register. */
|
|
|
|
assert(ts->val_type == TEMP_VAL_REG);
|
|
|
|
if (!ots->mem_allocated) {
|
|
|
|
temp_allocate_frame(s, args[0]);
|
|
|
|
}
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_st(s, otype, ts->reg, ots->mem_base->reg, ots->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
if (IS_DEAD_ARG(1)) {
|
|
|
|
temp_dead(s, args[1]);
|
|
|
|
}
|
|
|
|
temp_dead(s, args[0]);
|
|
|
|
} else if (ts->val_type == TEMP_VAL_CONST) {
|
|
|
|
/* propagate constant */
|
|
|
|
if (ots->val_type == TEMP_VAL_REG) {
|
|
|
|
s->reg_to_temp[ots->reg] = -1;
|
|
|
|
}
|
|
|
|
ots->val_type = TEMP_VAL_CONST;
|
|
|
|
ots->val = ts->val;
|
|
|
|
} else {
|
|
|
|
/* The code in the first if block should have moved the
|
|
|
|
temp to a register. */
|
|
|
|
assert(ts->val_type == TEMP_VAL_REG);
|
|
|
|
if (IS_DEAD_ARG(1) && !ts->fixed_reg && !ots->fixed_reg) {
|
|
|
|
/* the mov can be suppressed */
|
|
|
|
if (ots->val_type == TEMP_VAL_REG) {
|
|
|
|
s->reg_to_temp[ots->reg] = -1;
|
|
|
|
}
|
|
|
|
ots->reg = ts->reg;
|
|
|
|
temp_dead(s, args[1]);
|
|
|
|
} else {
|
|
|
|
if (ots->val_type != TEMP_VAL_REG) {
|
|
|
|
/* When allocating a new register, make sure to not spill the
|
|
|
|
input one. */
|
|
|
|
tcg_regset_set_reg(allocated_regs, ts->reg);
|
2017-01-19 12:50:28 +01:00
|
|
|
ots->reg = tcg_reg_alloc(s, (TCGRegSet)s->tcg_target_available_regs[otype],
|
2015-08-21 09:04:50 +02:00
|
|
|
allocated_regs);
|
|
|
|
}
|
|
|
|
tcg_out_mov(s, otype, ots->reg, ts->reg);
|
|
|
|
}
|
|
|
|
ots->val_type = TEMP_VAL_REG;
|
|
|
|
ots->mem_coherent = 0;
|
|
|
|
s->reg_to_temp[ots->reg] = args[0];
|
|
|
|
if (NEED_SYNC_ARG(0)) {
|
|
|
|
tcg_reg_sync(s, ots->reg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tcg_reg_alloc_op(TCGContext *s,
|
|
|
|
const TCGOpDef *def, TCGOpcode opc,
|
|
|
|
const TCGArg *args, uint16_t dead_args,
|
|
|
|
uint8_t sync_args)
|
|
|
|
{
|
|
|
|
TCGRegSet allocated_regs;
|
|
|
|
int i, k, nb_iargs, nb_oargs, reg;
|
|
|
|
TCGArg arg;
|
|
|
|
const TCGArgConstraint *arg_ct;
|
|
|
|
TCGTemp *ts;
|
|
|
|
TCGArg new_args[TCG_MAX_OP_ARGS];
|
|
|
|
int const_args[TCG_MAX_OP_ARGS];
|
|
|
|
|
|
|
|
nb_oargs = def->nb_oargs;
|
|
|
|
nb_iargs = def->nb_iargs;
|
|
|
|
|
|
|
|
/* copy constants */
|
|
|
|
memcpy(new_args + nb_oargs + nb_iargs,
|
|
|
|
args + nb_oargs + nb_iargs,
|
|
|
|
sizeof(TCGArg) * def->nb_cargs);
|
|
|
|
|
|
|
|
/* satisfy input constraints */
|
|
|
|
tcg_regset_set(allocated_regs, s->reserved_regs);
|
|
|
|
for(k = 0; k < nb_iargs; k++) {
|
|
|
|
i = def->sorted_args[nb_oargs + k];
|
|
|
|
arg = args[i];
|
|
|
|
arg_ct = &def->args_ct[i];
|
|
|
|
ts = &s->temps[arg];
|
|
|
|
if (ts->val_type == TEMP_VAL_MEM) {
|
|
|
|
reg = tcg_reg_alloc(s, arg_ct->u.regs, allocated_regs);
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_ld(s, ts->type, reg, ts->mem_base->reg, ts->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
ts->reg = reg;
|
|
|
|
ts->mem_coherent = 1;
|
|
|
|
s->reg_to_temp[reg] = arg;
|
|
|
|
} else if (ts->val_type == TEMP_VAL_CONST) {
|
|
|
|
if (tcg_target_const_match(ts->val, ts->type, arg_ct)) {
|
|
|
|
/* constant is OK for instruction */
|
|
|
|
const_args[i] = 1;
|
|
|
|
new_args[i] = ts->val;
|
|
|
|
goto iarg_end;
|
|
|
|
} else {
|
|
|
|
/* need to move to a register */
|
|
|
|
reg = tcg_reg_alloc(s, arg_ct->u.regs, allocated_regs);
|
|
|
|
tcg_out_movi(s, ts->type, reg, ts->val);
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
ts->reg = reg;
|
|
|
|
ts->mem_coherent = 0;
|
|
|
|
s->reg_to_temp[reg] = arg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
assert(ts->val_type == TEMP_VAL_REG);
|
|
|
|
if (arg_ct->ct & TCG_CT_IALIAS) {
|
|
|
|
if (ts->fixed_reg) {
|
|
|
|
/* if fixed register, we must allocate a new register
|
|
|
|
if the alias is not the same register */
|
|
|
|
if (arg != args[arg_ct->alias_index])
|
|
|
|
goto allocate_in_reg;
|
|
|
|
} else {
|
|
|
|
/* if the input is aliased to an output and if it is
|
|
|
|
not dead after the instruction, we must allocate
|
|
|
|
a new register and move it */
|
|
|
|
if (!IS_DEAD_ARG(i)) {
|
|
|
|
goto allocate_in_reg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
reg = ts->reg;
|
|
|
|
if (tcg_regset_test_reg(arg_ct->u.regs, reg)) {
|
|
|
|
/* nothing to do : the constraint is satisfied */
|
|
|
|
} else {
|
|
|
|
allocate_in_reg:
|
|
|
|
/* allocate a new register matching the constraint
|
|
|
|
and move the temporary register into it */
|
|
|
|
reg = tcg_reg_alloc(s, arg_ct->u.regs, allocated_regs);
|
|
|
|
tcg_out_mov(s, ts->type, reg, ts->reg);
|
|
|
|
}
|
|
|
|
new_args[i] = reg;
|
|
|
|
const_args[i] = 0;
|
|
|
|
tcg_regset_set_reg(allocated_regs, reg);
|
|
|
|
iarg_end: ;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* mark dead temporaries and free the associated registers */
|
|
|
|
for (i = nb_oargs; i < nb_oargs + nb_iargs; i++) {
|
|
|
|
if (IS_DEAD_ARG(i)) {
|
|
|
|
temp_dead(s, args[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (def->flags & TCG_OPF_BB_END) {
|
|
|
|
tcg_reg_alloc_bb_end(s, allocated_regs);
|
|
|
|
} else {
|
|
|
|
if (def->flags & TCG_OPF_CALL_CLOBBER) {
|
|
|
|
/* XXX: permit generic clobber register list ? */
|
|
|
|
for(reg = 0; reg < TCG_TARGET_NB_REGS; reg++) {
|
|
|
|
if (tcg_regset_test_reg(s->tcg_target_call_clobber_regs, reg)) {
|
|
|
|
tcg_reg_free(s, reg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (def->flags & TCG_OPF_SIDE_EFFECTS) {
|
|
|
|
/* sync globals if the op has side effects and might trigger
|
|
|
|
an exception. */
|
|
|
|
sync_globals(s, allocated_regs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* satisfy the output constraints */
|
|
|
|
tcg_regset_set(allocated_regs, s->reserved_regs);
|
|
|
|
for(k = 0; k < nb_oargs; k++) {
|
|
|
|
i = def->sorted_args[k];
|
|
|
|
arg = args[i];
|
|
|
|
arg_ct = &def->args_ct[i];
|
|
|
|
ts = &s->temps[arg];
|
|
|
|
if (arg_ct->ct & TCG_CT_ALIAS) {
|
|
|
|
reg = new_args[arg_ct->alias_index];
|
|
|
|
} else {
|
|
|
|
/* if fixed register, we try to use it */
|
|
|
|
reg = ts->reg;
|
|
|
|
if (ts->fixed_reg &&
|
|
|
|
tcg_regset_test_reg(arg_ct->u.regs, reg)) {
|
|
|
|
goto oarg_end;
|
|
|
|
}
|
|
|
|
reg = tcg_reg_alloc(s, arg_ct->u.regs, allocated_regs);
|
|
|
|
}
|
|
|
|
tcg_regset_set_reg(allocated_regs, reg);
|
|
|
|
/* if a fixed register is used, then a move will be done afterwards */
|
|
|
|
if (!ts->fixed_reg) {
|
|
|
|
if (ts->val_type == TEMP_VAL_REG) {
|
|
|
|
s->reg_to_temp[ts->reg] = -1;
|
|
|
|
}
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
ts->reg = reg;
|
|
|
|
/* temp value is modified, so the value kept in memory is
|
|
|
|
potentially not the same */
|
|
|
|
ts->mem_coherent = 0;
|
|
|
|
s->reg_to_temp[reg] = arg;
|
|
|
|
}
|
|
|
|
oarg_end:
|
|
|
|
new_args[i] = reg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* emit instruction */
|
|
|
|
tcg_out_op(s, opc, new_args, const_args);
|
|
|
|
|
|
|
|
/* move the outputs in the correct register if needed */
|
|
|
|
for(i = 0; i < nb_oargs; i++) {
|
|
|
|
ts = &s->temps[args[i]];
|
|
|
|
reg = new_args[i];
|
|
|
|
if (ts->fixed_reg && ts->reg != reg) {
|
|
|
|
tcg_out_mov(s, ts->type, ts->reg, reg);
|
|
|
|
}
|
|
|
|
if (NEED_SYNC_ARG(i)) {
|
|
|
|
tcg_reg_sync(s, reg);
|
|
|
|
}
|
|
|
|
if (IS_DEAD_ARG(i)) {
|
|
|
|
temp_dead(s, args[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef TCG_TARGET_STACK_GROWSUP
|
|
|
|
#define STACK_DIR(x) (-(x))
|
|
|
|
#else
|
|
|
|
#define STACK_DIR(x) (x)
|
|
|
|
#endif
|
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
static void tcg_reg_alloc_call(TCGContext *s, int nb_oargs, int nb_iargs,
|
|
|
|
const TCGArg * const args, uint16_t dead_args,
|
|
|
|
uint8_t sync_args)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
2018-02-09 15:54:01 +01:00
|
|
|
int flags, nb_regs, i, reg;
|
2015-08-21 09:04:50 +02:00
|
|
|
TCGArg arg;
|
|
|
|
TCGTemp *ts;
|
|
|
|
intptr_t stack_offset;
|
|
|
|
size_t call_stack_size;
|
|
|
|
tcg_insn_unit *func_addr;
|
|
|
|
int allocate_args;
|
|
|
|
TCGRegSet allocated_regs;
|
|
|
|
|
|
|
|
func_addr = (tcg_insn_unit *)(intptr_t)args[nb_oargs + nb_iargs];
|
|
|
|
flags = args[nb_oargs + nb_iargs + 1];
|
|
|
|
|
|
|
|
nb_regs = ARRAY_SIZE(tcg_target_call_iarg_regs);
|
2017-01-20 07:27:22 +01:00
|
|
|
#if TCG_TARGET_REG_BITS == 32
|
2017-01-21 02:28:22 +01:00
|
|
|
// do this because msvc cannot have arrays with 0 entries.
|
|
|
|
nb_regs = 0;
|
2017-01-20 07:27:22 +01:00
|
|
|
#endif
|
2018-02-09 15:54:01 +01:00
|
|
|
if (nb_regs > nb_iargs) {
|
|
|
|
nb_regs = nb_iargs;
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* assign stack slots first */
|
2018-02-09 15:54:01 +01:00
|
|
|
call_stack_size = (nb_iargs - nb_regs) * sizeof(tcg_target_long);
|
2015-08-21 09:04:50 +02:00
|
|
|
call_stack_size = (call_stack_size + TCG_TARGET_STACK_ALIGN - 1) &
|
|
|
|
~(TCG_TARGET_STACK_ALIGN - 1);
|
|
|
|
allocate_args = (call_stack_size > TCG_STATIC_CALL_ARGS_SIZE);
|
|
|
|
if (allocate_args) {
|
|
|
|
/* XXX: if more than TCG_STATIC_CALL_ARGS_SIZE is needed,
|
|
|
|
preallocate call stack */
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
stack_offset = TCG_TARGET_CALL_STACK_OFFSET;
|
2018-02-09 15:54:01 +01:00
|
|
|
for(i = nb_regs; i < nb_iargs; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
arg = args[nb_oargs + i];
|
|
|
|
#ifdef TCG_TARGET_STACK_GROWSUP
|
|
|
|
stack_offset -= sizeof(tcg_target_long);
|
|
|
|
#endif
|
|
|
|
if (arg != TCG_CALL_DUMMY_ARG) {
|
|
|
|
ts = &s->temps[arg];
|
|
|
|
if (ts->val_type == TEMP_VAL_REG) {
|
|
|
|
tcg_out_st(s, ts->type, ts->reg, TCG_REG_CALL_STACK, stack_offset);
|
|
|
|
} else if (ts->val_type == TEMP_VAL_MEM) {
|
2017-01-19 12:50:28 +01:00
|
|
|
reg = tcg_reg_alloc(s, (TCGRegSet)s->tcg_target_available_regs[ts->type],
|
2015-08-21 09:04:50 +02:00
|
|
|
s->reserved_regs);
|
|
|
|
/* XXX: not correct if reading values from the stack */
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_ld(s, ts->type, reg, ts->mem_base->reg, ts->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
tcg_out_st(s, ts->type, reg, TCG_REG_CALL_STACK, stack_offset);
|
|
|
|
} else if (ts->val_type == TEMP_VAL_CONST) {
|
2017-01-19 12:50:28 +01:00
|
|
|
reg = tcg_reg_alloc(s, (TCGRegSet)s->tcg_target_available_regs[ts->type],
|
2015-08-21 09:04:50 +02:00
|
|
|
s->reserved_regs);
|
|
|
|
/* XXX: sign extend may be needed on some targets */
|
|
|
|
tcg_out_movi(s, ts->type, reg, ts->val);
|
|
|
|
tcg_out_st(s, ts->type, reg, TCG_REG_CALL_STACK, stack_offset);
|
|
|
|
} else {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifndef TCG_TARGET_STACK_GROWSUP
|
|
|
|
stack_offset += sizeof(tcg_target_long);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/* assign input registers */
|
|
|
|
tcg_regset_set(allocated_regs, s->reserved_regs);
|
|
|
|
for(i = 0; i < nb_regs; i++) {
|
|
|
|
arg = args[nb_oargs + i];
|
|
|
|
if (arg != TCG_CALL_DUMMY_ARG) {
|
|
|
|
ts = &s->temps[arg];
|
|
|
|
reg = tcg_target_call_iarg_regs[i];
|
|
|
|
tcg_reg_free(s, reg);
|
|
|
|
if (ts->val_type == TEMP_VAL_REG) {
|
|
|
|
if (ts->reg != reg) {
|
|
|
|
tcg_out_mov(s, ts->type, reg, ts->reg);
|
|
|
|
}
|
|
|
|
} else if (ts->val_type == TEMP_VAL_MEM) {
|
2018-02-08 19:03:59 +01:00
|
|
|
tcg_out_ld(s, ts->type, reg, ts->mem_base->reg, ts->mem_offset);
|
2015-08-21 09:04:50 +02:00
|
|
|
} else if (ts->val_type == TEMP_VAL_CONST) {
|
|
|
|
/* XXX: sign extend ? */
|
|
|
|
tcg_out_movi(s, ts->type, reg, ts->val);
|
|
|
|
} else {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
tcg_regset_set_reg(allocated_regs, reg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* mark dead temporaries and free the associated registers */
|
|
|
|
for(i = nb_oargs; i < nb_iargs + nb_oargs; i++) {
|
|
|
|
if (IS_DEAD_ARG(i)) {
|
|
|
|
temp_dead(s, args[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* clobber call registers */
|
|
|
|
for(reg = 0; reg < TCG_TARGET_NB_REGS; reg++) {
|
|
|
|
if (tcg_regset_test_reg(s->tcg_target_call_clobber_regs, reg)) {
|
|
|
|
tcg_reg_free(s, reg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Save globals if they might be written by the helper, sync them if
|
|
|
|
they might be read. */
|
|
|
|
if (flags & TCG_CALL_NO_READ_GLOBALS) {
|
|
|
|
/* Nothing to do */
|
|
|
|
} else if (flags & TCG_CALL_NO_WRITE_GLOBALS) {
|
|
|
|
sync_globals(s, allocated_regs);
|
|
|
|
} else {
|
|
|
|
save_globals(s, allocated_regs);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_out_call(s, func_addr);
|
|
|
|
|
|
|
|
/* assign output registers and emit moves if needed */
|
|
|
|
for(i = 0; i < nb_oargs; i++) {
|
|
|
|
arg = args[i];
|
|
|
|
ts = &s->temps[arg];
|
|
|
|
reg = tcg_target_call_oarg_regs[i];
|
|
|
|
assert(s->reg_to_temp[reg] == -1);
|
|
|
|
|
|
|
|
if (ts->fixed_reg) {
|
|
|
|
if (ts->reg != reg) {
|
|
|
|
tcg_out_mov(s, ts->type, ts->reg, reg);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (ts->val_type == TEMP_VAL_REG) {
|
|
|
|
s->reg_to_temp[ts->reg] = -1;
|
|
|
|
}
|
|
|
|
ts->val_type = TEMP_VAL_REG;
|
|
|
|
ts->reg = reg;
|
|
|
|
ts->mem_coherent = 0;
|
|
|
|
s->reg_to_temp[reg] = arg;
|
|
|
|
if (NEED_SYNC_ARG(i)) {
|
|
|
|
tcg_reg_sync(s, reg);
|
|
|
|
}
|
|
|
|
if (IS_DEAD_ARG(i)) {
|
|
|
|
temp_dead(s, args[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
|
|
|
|
static void dump_op_count(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2018-02-09 19:20:10 +01:00
|
|
|
for(i = 0; i < NB_OPS; i++) {
|
2015-08-21 09:04:50 +02:00
|
|
|
qemu_log("%s %" PRId64 "\n", s->tcg_op_defs[i].name, tcg_table_op_count[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2018-02-16 16:18:47 +01:00
|
|
|
int tcg_gen_code(TCGContext *s, tcg_insn_unit *gen_code_buf)
|
2015-08-21 09:04:50 +02:00
|
|
|
{
|
2018-02-16 15:45:15 +01:00
|
|
|
int i, oi, oi_next, num_insns;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-16 16:18:47 +01:00
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
{
|
|
|
|
int n;
|
|
|
|
|
|
|
|
n = s->gen_last_op_idx + 1;
|
|
|
|
s->op_count += n;
|
|
|
|
if (n > s->op_count_max) {
|
|
|
|
s->op_count_max = n;
|
|
|
|
}
|
|
|
|
|
|
|
|
n = s->nb_temps;
|
|
|
|
s->temp_count += n;
|
|
|
|
if (n > s->temp_count_max) {
|
|
|
|
s->temp_count_max = n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
#ifdef DEBUG_DISAS
|
|
|
|
if (unlikely(qemu_loglevel_mask(CPU_LOG_TB_OP))) {
|
|
|
|
qemu_log("OP:\n");
|
|
|
|
tcg_dump_ops(s);
|
|
|
|
qemu_log("\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
s->opt_time -= profile_getclock();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef USE_TCG_OPTIMIZATIONS
|
2018-02-09 15:54:01 +01:00
|
|
|
tcg_optimize(s);
|
2015-08-21 09:04:50 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
s->opt_time += profile_getclock();
|
|
|
|
s->la_time -= profile_getclock();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
tcg_liveness_analysis(s);
|
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
s->la_time += profile_getclock();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef DEBUG_DISAS
|
|
|
|
if (unlikely(qemu_loglevel_mask(CPU_LOG_TB_OP_OPT))) {
|
|
|
|
qemu_log("OP after optimization and liveness analysis:\n");
|
|
|
|
tcg_dump_ops(s);
|
|
|
|
qemu_log("\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
tcg_reg_alloc_start(s);
|
|
|
|
|
|
|
|
s->code_buf = gen_code_buf;
|
|
|
|
s->code_ptr = gen_code_buf;
|
|
|
|
|
|
|
|
tcg_out_tb_init(s);
|
|
|
|
|
2018-02-16 15:45:15 +01:00
|
|
|
num_insns = -1;
|
2018-02-09 15:54:01 +01:00
|
|
|
for (oi = s->gen_first_op_idx; oi >= 0; oi = oi_next) {
|
|
|
|
TCGOp * const op = &s->gen_op_buf[oi];
|
|
|
|
TCGArg * const args = &s->gen_opparam_buf[op->args];
|
|
|
|
TCGOpcode opc = op->opc;
|
|
|
|
const TCGOpDef *def = &s->tcg_op_defs[opc];
|
|
|
|
uint16_t dead_args = s->op_dead_args[oi];
|
|
|
|
uint8_t sync_args = s->op_sync_args[oi];
|
2015-08-21 09:04:50 +02:00
|
|
|
|
2018-02-09 15:54:01 +01:00
|
|
|
oi_next = op->next;
|
2015-08-21 09:04:50 +02:00
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
tcg_table_op_count[opc]++;
|
|
|
|
#endif
|
2018-02-09 15:54:01 +01:00
|
|
|
switch (opc) {
|
2015-08-21 09:04:50 +02:00
|
|
|
case INDEX_op_mov_i32:
|
|
|
|
case INDEX_op_mov_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
tcg_reg_alloc_mov(s, def, args, dead_args, sync_args);
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
case INDEX_op_movi_i32:
|
|
|
|
case INDEX_op_movi_i64:
|
2018-02-09 15:54:01 +01:00
|
|
|
tcg_reg_alloc_movi(s, args, dead_args, sync_args);
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
2018-02-11 18:31:22 +01:00
|
|
|
case INDEX_op_insn_start:
|
2018-02-16 15:45:15 +01:00
|
|
|
if (num_insns >= 0) {
|
|
|
|
s->gen_insn_end_off[num_insns] = tcg_current_code_size(s);
|
|
|
|
}
|
|
|
|
num_insns++;
|
2018-02-16 14:12:33 +01:00
|
|
|
for (i = 0; i < TARGET_INSN_START_WORDS; ++i) {
|
|
|
|
target_ulong a;
|
|
|
|
#if TARGET_LONG_BITS > TCG_TARGET_REG_BITS
|
|
|
|
a = ((target_ulong)args[i * 2 + 1] << 32) | args[i * 2];
|
|
|
|
#else
|
|
|
|
a = args[i];
|
|
|
|
#endif
|
2018-02-16 15:45:15 +01:00
|
|
|
s->gen_insn_data[num_insns][i] = a;
|
2018-02-16 14:12:33 +01:00
|
|
|
}
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
case INDEX_op_discard:
|
|
|
|
temp_dead(s, args[0]);
|
|
|
|
break;
|
|
|
|
case INDEX_op_set_label:
|
|
|
|
tcg_reg_alloc_bb_end(s, s->reserved_regs);
|
2018-02-09 20:38:37 +01:00
|
|
|
tcg_out_label(s, arg_label(s, args[0]), s->code_ptr);
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
case INDEX_op_call:
|
2018-02-09 15:54:01 +01:00
|
|
|
tcg_reg_alloc_call(s, op->callo, op->calli, args,
|
|
|
|
dead_args, sync_args);
|
|
|
|
break;
|
2015-08-21 09:04:50 +02:00
|
|
|
default:
|
|
|
|
/* Sanity check that we've not introduced any unhandled opcodes. */
|
|
|
|
if (def->flags & TCG_OPF_NOT_PRESENT) {
|
|
|
|
tcg_abort();
|
|
|
|
}
|
|
|
|
/* Note: in order to speed up the code, it would be much
|
|
|
|
faster to have specialized register allocator functions for
|
|
|
|
some common argument patterns */
|
2018-02-09 15:54:01 +01:00
|
|
|
tcg_reg_alloc_op(s, def, opc, args, dead_args, sync_args);
|
2015-08-21 09:04:50 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
#ifndef NDEBUG
|
|
|
|
check_regs(s);
|
|
|
|
#endif
|
2018-02-16 20:26:29 +01:00
|
|
|
/* Test for (pending) buffer overflow. The assumption is that any
|
|
|
|
one operation beginning below the high water mark cannot overrun
|
|
|
|
the buffer completely. Thus we can test for overflow after
|
|
|
|
generating code without having to check during generation. */
|
2018-02-18 00:53:06 +01:00
|
|
|
if (unlikely((void *)s->code_ptr > s->code_gen_highwater)) {
|
2018-02-16 20:26:29 +01:00
|
|
|
return -1;
|
|
|
|
}
|
2015-08-21 09:04:50 +02:00
|
|
|
}
|
2018-02-09 15:54:01 +01:00
|
|
|
|
2018-02-16 15:45:15 +01:00
|
|
|
tcg_debug_assert(num_insns >= 0);
|
|
|
|
s->gen_insn_end_off[num_insns] = tcg_current_code_size(s);
|
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
/* Generate TB finalization at the end of block */
|
2018-02-19 07:40:12 +01:00
|
|
|
if (!tcg_out_tb_finalize(s)) {
|
|
|
|
return -1;
|
|
|
|
}
|
2015-09-28 04:58:43 +02:00
|
|
|
|
2015-08-21 09:04:50 +02:00
|
|
|
/* flush instruction cache */
|
|
|
|
flush_icache_range((uintptr_t)s->code_buf, (uintptr_t)s->code_ptr);
|
|
|
|
|
|
|
|
return tcg_current_code_size(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_PROFILER
|
|
|
|
void tcg_dump_info(FILE *f, fprintf_function cpu_fprintf)
|
|
|
|
{
|
|
|
|
#if 0
|
|
|
|
TCGContext *s = &tcg_ctx;
|
2018-02-16 15:45:15 +01:00
|
|
|
int64_t tb_count = s->tb_count;
|
|
|
|
int64_t tb_div_count = tb_count ? tb_count : 1;
|
|
|
|
int64_t tot = s->interm_time + s->code_time;
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
cpu_fprintf(f, "JIT cycles %" PRId64 " (%0.3f s at 2.4 GHz)\n",
|
|
|
|
tot, tot / 2.4e9);
|
|
|
|
cpu_fprintf(f, "translated TBs %" PRId64 " (aborted=%" PRId64 " %0.1f%%)\n",
|
2018-02-16 15:45:15 +01:00
|
|
|
tb_count, s->tb_count1 - tb_count,
|
|
|
|
(double)(s->tb_count1 - s->tb_count)
|
|
|
|
/ (s->tb_count1 ? s->tb_count1 : 1) * 100.0);
|
2015-08-21 09:04:50 +02:00
|
|
|
cpu_fprintf(f, "avg ops/TB %0.1f max=%d\n",
|
2018-02-16 15:45:15 +01:00
|
|
|
(double)s->op_count / tb_div_count, s->op_count_max);
|
2015-08-21 09:04:50 +02:00
|
|
|
cpu_fprintf(f, "deleted ops/TB %0.2f\n",
|
2018-02-16 15:45:15 +01:00
|
|
|
(double)s->del_op_count / tb_div_count);
|
2015-08-21 09:04:50 +02:00
|
|
|
cpu_fprintf(f, "avg temps/TB %0.2f max=%d\n",
|
2018-02-16 15:45:15 +01:00
|
|
|
(double)s->temp_count / tb_div_count, s->temp_count_max);
|
|
|
|
cpu_fprintf(f, "avg host code/TB %0.1f\n",
|
|
|
|
(double)s->code_out_len / tb_div_count);
|
|
|
|
cpu_fprintf(f, "avg search data/TB %0.1f\n",
|
|
|
|
(double)s->search_out_len / tb_div_count);
|
2015-08-21 09:04:50 +02:00
|
|
|
|
|
|
|
cpu_fprintf(f, "cycles/op %0.1f\n",
|
|
|
|
s->op_count ? (double)tot / s->op_count : 0);
|
|
|
|
cpu_fprintf(f, "cycles/in byte %0.1f\n",
|
|
|
|
s->code_in_len ? (double)tot / s->code_in_len : 0);
|
|
|
|
cpu_fprintf(f, "cycles/out byte %0.1f\n",
|
|
|
|
s->code_out_len ? (double)tot / s->code_out_len : 0);
|
2018-02-16 15:45:15 +01:00
|
|
|
cpu_fprintf(f, "cycles/search byte %0.1f\n",
|
|
|
|
s->search_out_len ? (double)tot / s->search_out_len : 0);
|
|
|
|
if (tot == 0) {
|
2015-08-21 09:04:50 +02:00
|
|
|
tot = 1;
|
2018-02-16 15:45:15 +01:00
|
|
|
}
|
2015-08-21 09:04:50 +02:00
|
|
|
cpu_fprintf(f, " gen_interm time %0.1f%%\n",
|
|
|
|
(double)s->interm_time / tot * 100.0);
|
|
|
|
cpu_fprintf(f, " gen_code time %0.1f%%\n",
|
|
|
|
(double)s->code_time / tot * 100.0);
|
|
|
|
cpu_fprintf(f, "optim./code time %0.1f%%\n",
|
|
|
|
(double)s->opt_time / (s->code_time ? s->code_time : 1)
|
|
|
|
* 100.0);
|
|
|
|
cpu_fprintf(f, "liveness/code time %0.1f%%\n",
|
|
|
|
(double)s->la_time / (s->code_time ? s->code_time : 1) * 100.0);
|
|
|
|
cpu_fprintf(f, "cpu_restore count %" PRId64 "\n",
|
|
|
|
s->restore_count);
|
|
|
|
cpu_fprintf(f, " avg cycles %0.1f\n",
|
|
|
|
s->restore_count ? (double)s->restore_time / s->restore_count : 0);
|
|
|
|
|
|
|
|
dump_op_count();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
void tcg_dump_info(FILE *f, fprintf_function cpu_fprintf)
|
|
|
|
{
|
|
|
|
cpu_fprintf(f, "[TCG profiler not compiled]\n");
|
|
|
|
}
|
|
|
|
#endif
|