2011-10-05 20:03:02 +02:00
|
|
|
/*
|
|
|
|
* Tiny Code Generator for QEMU
|
|
|
|
*
|
|
|
|
* Copyright (c) 2009, 2011 Stefan Weil
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This code implements a TCG which does not generate machine code for some
|
|
|
|
* real target machine but which generates virtual machine code for an
|
|
|
|
* interpreter. Interpreted pseudo code is slow, but it works on any host.
|
|
|
|
*
|
|
|
|
* Some remarks might help in understanding the code:
|
|
|
|
*
|
|
|
|
* "target" or "TCG target" is the machine which runs the generated code.
|
|
|
|
* This is different to the usual meaning in QEMU where "target" is the
|
|
|
|
* emulated machine. So normally QEMU host is identical to TCG target.
|
|
|
|
* Here the TCG target is a virtual machine, but this virtual machine must
|
|
|
|
* use the same word size like the real machine.
|
|
|
|
* Therefore, we need both 32 and 64 bit virtual machines (interpreter).
|
|
|
|
*/
|
|
|
|
|
2016-06-29 15:29:06 +02:00
|
|
|
#ifndef TCG_TARGET_H
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_H
|
|
|
|
|
|
|
|
#define TCG_TARGET_INTERPRETER 1
|
tcg/tci: Change encoding to uint32_t units
This removes all of the problems with unaligned accesses
to the bytecode stream.
With an 8-bit opcode at the bottom, we have 24 bits remaining,
which are generally split into 6 4-bit slots. This fits well
with the maximum length opcodes, e.g. INDEX_op_add2_i32, which
have 6 register operands.
We have, in previous patches, rearranged things such that there
are no operations with a label which have more than one other
operand. Which leaves us with a 20-bit field in which to encode
a label, giving us a maximum TB size of 512k -- easily large.
Change the INDEX_op_tci_movi_{i32,i64} opcodes to tci_mov[il].
The former puts the immediate in the upper 20 bits of the insn,
like we do for the label displacement. The later uses a label
to reference an entry in the constant pool. Thus, in the worst
case we still have a single memory reference for any constant,
but now the constants are out-of-line of the bytecode and can
be shared between different moves saving space.
Change INDEX_op_call to use a label to reference a pair of
pointers in the constant pool. This removes the only slightly
dodgy link with the layout of struct TCGHelperInfo.
The re-encode cannot be done in pieces.
Tested-by: Philippe Mathieu-Daudé <f4bug@amsat.org>
Reviewed-by: Philippe Mathieu-Daudé <f4bug@amsat.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2021-02-02 08:27:41 +01:00
|
|
|
#define TCG_TARGET_INSN_UNIT_SIZE 4
|
2021-03-10 06:30:38 +01:00
|
|
|
#define MAX_CODE_GEN_BUFFER_SIZE ((size_t)-1)
|
2011-10-05 20:03:02 +02:00
|
|
|
|
|
|
|
/* Optional instructions. */
|
|
|
|
|
|
|
|
#define TCG_TARGET_HAS_bswap16_i32 1
|
|
|
|
#define TCG_TARGET_HAS_bswap32_i32 1
|
|
|
|
#define TCG_TARGET_HAS_div_i32 1
|
2013-03-12 06:41:47 +01:00
|
|
|
#define TCG_TARGET_HAS_rem_i32 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_ext8s_i32 1
|
|
|
|
#define TCG_TARGET_HAS_ext16s_i32 1
|
|
|
|
#define TCG_TARGET_HAS_ext8u_i32 1
|
|
|
|
#define TCG_TARGET_HAS_ext16u_i32 1
|
2021-02-03 01:29:18 +01:00
|
|
|
#define TCG_TARGET_HAS_andc_i32 1
|
2012-09-18 22:52:14 +02:00
|
|
|
#define TCG_TARGET_HAS_deposit_i32 1
|
2021-02-03 01:48:48 +01:00
|
|
|
#define TCG_TARGET_HAS_extract_i32 1
|
|
|
|
#define TCG_TARGET_HAS_sextract_i32 1
|
2019-02-25 19:29:25 +01:00
|
|
|
#define TCG_TARGET_HAS_extract2_i32 0
|
2021-02-03 01:29:18 +01:00
|
|
|
#define TCG_TARGET_HAS_eqv_i32 1
|
|
|
|
#define TCG_TARGET_HAS_nand_i32 1
|
|
|
|
#define TCG_TARGET_HAS_nor_i32 1
|
2021-02-03 02:01:57 +01:00
|
|
|
#define TCG_TARGET_HAS_clz_i32 1
|
|
|
|
#define TCG_TARGET_HAS_ctz_i32 1
|
|
|
|
#define TCG_TARGET_HAS_ctpop_i32 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_not_i32 1
|
2021-02-03 01:29:18 +01:00
|
|
|
#define TCG_TARGET_HAS_orc_i32 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_rot_i32 1
|
2023-08-05 01:24:04 +02:00
|
|
|
#define TCG_TARGET_HAS_negsetcond_i32 0
|
2021-02-03 02:21:27 +01:00
|
|
|
#define TCG_TARGET_HAS_muls2_i32 1
|
2013-08-14 23:35:56 +02:00
|
|
|
#define TCG_TARGET_HAS_muluh_i32 0
|
|
|
|
#define TCG_TARGET_HAS_mulsh_i32 0
|
2020-12-09 20:58:39 +01:00
|
|
|
#define TCG_TARGET_HAS_qemu_st8_i32 0
|
2011-10-05 20:03:02 +02:00
|
|
|
|
|
|
|
#if TCG_TARGET_REG_BITS == 64
|
2023-08-22 19:51:10 +02:00
|
|
|
#define TCG_TARGET_HAS_extr_i64_i32 0
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_bswap16_i64 1
|
|
|
|
#define TCG_TARGET_HAS_bswap32_i64 1
|
|
|
|
#define TCG_TARGET_HAS_bswap64_i64 1
|
2012-09-18 22:52:14 +02:00
|
|
|
#define TCG_TARGET_HAS_deposit_i64 1
|
2021-02-03 01:48:48 +01:00
|
|
|
#define TCG_TARGET_HAS_extract_i64 1
|
|
|
|
#define TCG_TARGET_HAS_sextract_i64 1
|
2019-02-25 19:29:25 +01:00
|
|
|
#define TCG_TARGET_HAS_extract2_i64 0
|
2021-01-28 07:30:00 +01:00
|
|
|
#define TCG_TARGET_HAS_div_i64 1
|
|
|
|
#define TCG_TARGET_HAS_rem_i64 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_ext8s_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ext16s_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ext32s_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ext8u_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ext16u_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ext32u_i64 1
|
2021-02-03 01:29:18 +01:00
|
|
|
#define TCG_TARGET_HAS_andc_i64 1
|
|
|
|
#define TCG_TARGET_HAS_eqv_i64 1
|
|
|
|
#define TCG_TARGET_HAS_nand_i64 1
|
|
|
|
#define TCG_TARGET_HAS_nor_i64 1
|
2021-02-03 02:01:57 +01:00
|
|
|
#define TCG_TARGET_HAS_clz_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ctz_i64 1
|
|
|
|
#define TCG_TARGET_HAS_ctpop_i64 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_not_i64 1
|
2021-02-03 01:29:18 +01:00
|
|
|
#define TCG_TARGET_HAS_orc_i64 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_HAS_rot_i64 1
|
2023-08-05 01:24:04 +02:00
|
|
|
#define TCG_TARGET_HAS_negsetcond_i64 0
|
2021-02-03 02:21:27 +01:00
|
|
|
#define TCG_TARGET_HAS_muls2_i64 1
|
2021-02-03 02:40:12 +01:00
|
|
|
#define TCG_TARGET_HAS_add2_i32 1
|
|
|
|
#define TCG_TARGET_HAS_sub2_i32 1
|
2021-02-03 02:21:27 +01:00
|
|
|
#define TCG_TARGET_HAS_mulu2_i32 1
|
2021-02-03 02:40:12 +01:00
|
|
|
#define TCG_TARGET_HAS_add2_i64 1
|
|
|
|
#define TCG_TARGET_HAS_sub2_i64 1
|
2021-02-03 02:21:27 +01:00
|
|
|
#define TCG_TARGET_HAS_mulu2_i64 1
|
2013-08-14 23:35:56 +02:00
|
|
|
#define TCG_TARGET_HAS_muluh_i64 0
|
|
|
|
#define TCG_TARGET_HAS_mulsh_i64 0
|
2014-03-26 18:59:14 +01:00
|
|
|
#else
|
|
|
|
#define TCG_TARGET_HAS_mulu2_i32 1
|
2011-10-05 20:03:02 +02:00
|
|
|
#endif /* TCG_TARGET_REG_BITS == 64 */
|
|
|
|
|
2022-11-07 00:42:56 +01:00
|
|
|
#define TCG_TARGET_HAS_qemu_ldst_i128 0
|
|
|
|
|
2021-01-29 01:54:16 +01:00
|
|
|
/* Number of registers available. */
|
2011-10-05 20:03:02 +02:00
|
|
|
#define TCG_TARGET_NB_REGS 16
|
|
|
|
|
|
|
|
/* List of registers which are used by TCG. */
|
|
|
|
typedef enum {
|
|
|
|
TCG_REG_R0 = 0,
|
|
|
|
TCG_REG_R1,
|
|
|
|
TCG_REG_R2,
|
|
|
|
TCG_REG_R3,
|
|
|
|
TCG_REG_R4,
|
|
|
|
TCG_REG_R5,
|
|
|
|
TCG_REG_R6,
|
|
|
|
TCG_REG_R7,
|
|
|
|
TCG_REG_R8,
|
|
|
|
TCG_REG_R9,
|
|
|
|
TCG_REG_R10,
|
|
|
|
TCG_REG_R11,
|
|
|
|
TCG_REG_R12,
|
|
|
|
TCG_REG_R13,
|
|
|
|
TCG_REG_R14,
|
|
|
|
TCG_REG_R15,
|
2021-01-29 01:54:16 +01:00
|
|
|
|
2021-02-01 10:26:14 +01:00
|
|
|
TCG_REG_TMP = TCG_REG_R13,
|
2021-01-29 01:54:16 +01:00
|
|
|
TCG_AREG0 = TCG_REG_R14,
|
|
|
|
TCG_REG_CALL_STACK = TCG_REG_R15,
|
2011-11-09 09:03:33 +01:00
|
|
|
} TCGReg;
|
2011-10-05 20:03:02 +02:00
|
|
|
|
2013-03-28 06:37:55 +01:00
|
|
|
/* Used for function call generation. */
|
|
|
|
#define TCG_TARGET_CALL_STACK_OFFSET 0
|
2021-01-30 23:24:25 +01:00
|
|
|
#define TCG_TARGET_STACK_ALIGN 8
|
2022-10-16 04:48:48 +02:00
|
|
|
#if TCG_TARGET_REG_BITS == 32
|
2022-10-17 07:55:56 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I32 TCG_CALL_ARG_EVEN
|
2022-10-16 04:48:48 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I64 TCG_CALL_ARG_EVEN
|
2022-10-21 02:47:54 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I128 TCG_CALL_ARG_EVEN
|
2022-10-16 04:48:48 +02:00
|
|
|
#else
|
2022-10-17 07:55:56 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I32 TCG_CALL_ARG_NORMAL
|
2022-10-16 04:48:48 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I64 TCG_CALL_ARG_NORMAL
|
2022-10-21 02:47:54 +02:00
|
|
|
# define TCG_TARGET_CALL_ARG_I128 TCG_CALL_ARG_NORMAL
|
2022-10-16 04:48:48 +02:00
|
|
|
#endif
|
2022-10-21 02:47:54 +02:00
|
|
|
#define TCG_TARGET_CALL_RET_I128 TCG_CALL_RET_NORMAL
|
2013-03-28 06:37:55 +01:00
|
|
|
|
2015-05-19 09:59:34 +02:00
|
|
|
#define HAVE_TCG_QEMU_TB_EXEC
|
tcg/tci: Change encoding to uint32_t units
This removes all of the problems with unaligned accesses
to the bytecode stream.
With an 8-bit opcode at the bottom, we have 24 bits remaining,
which are generally split into 6 4-bit slots. This fits well
with the maximum length opcodes, e.g. INDEX_op_add2_i32, which
have 6 register operands.
We have, in previous patches, rearranged things such that there
are no operations with a label which have more than one other
operand. Which leaves us with a 20-bit field in which to encode
a label, giving us a maximum TB size of 512k -- easily large.
Change the INDEX_op_tci_movi_{i32,i64} opcodes to tci_mov[il].
The former puts the immediate in the upper 20 bits of the insn,
like we do for the label displacement. The later uses a label
to reference an entry in the constant pool. Thus, in the worst
case we still have a single memory reference for any constant,
but now the constants are out-of-line of the bytecode and can
be shared between different moves saving space.
Change INDEX_op_call to use a label to reference a pair of
pointers in the constant pool. This removes the only slightly
dodgy link with the layout of struct TCGHelperInfo.
The re-encode cannot be done in pieces.
Tested-by: Philippe Mathieu-Daudé <f4bug@amsat.org>
Reviewed-by: Philippe Mathieu-Daudé <f4bug@amsat.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2021-02-02 08:27:41 +01:00
|
|
|
#define TCG_TARGET_NEED_POOL_LABELS
|
2011-10-05 20:03:02 +02:00
|
|
|
|
2017-09-07 19:54:30 +02:00
|
|
|
/* We could notice __i386__ or __s390x__ and reduce the barriers depending
|
|
|
|
on the host. But if you want performance, you use the normal backend.
|
|
|
|
We prefer consistency across hosts on this. */
|
|
|
|
#define TCG_TARGET_DEFAULT_MO (0)
|
|
|
|
|
2011-10-05 20:03:02 +02:00
|
|
|
#endif /* TCG_TARGET_H */
|