2012-04-09 18:50:52 +02:00
|
|
|
/*
|
|
|
|
* Common CPU TLB handling
|
|
|
|
*
|
|
|
|
* Copyright (c) 2003 Fabrice Bellard
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2019-01-23 15:08:56 +01:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2012-04-09 18:50:52 +02:00
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2016-01-26 19:16:56 +01:00
|
|
|
#include "qemu/osdep.h"
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
#include "qemu/main-loop.h"
|
2021-02-04 17:39:23 +01:00
|
|
|
#include "hw/core/tcg-cpu-ops.h"
|
2012-12-17 18:19:49 +01:00
|
|
|
#include "exec/exec-all.h"
|
|
|
|
#include "exec/memory.h"
|
2014-03-28 19:42:10 +01:00
|
|
|
#include "exec/cpu_ldst.h"
|
2012-12-17 18:19:49 +01:00
|
|
|
#include "exec/cputlb.h"
|
|
|
|
#include "exec/memory-internal.h"
|
2013-10-14 17:13:59 +02:00
|
|
|
#include "exec/ram_addr.h"
|
2014-03-28 17:55:24 +01:00
|
|
|
#include "tcg/tcg.h"
|
cputlb: don't cpu_abort() if guest tries to execute outside RAM or RAM
In get_page_addr_code(), if the guest program counter turns out not to
be in ROM or RAM, we can't handle executing from it, and we call
cpu_abort(). This results in the message
qemu: fatal: Trying to execute code outside RAM or ROM at 0x08000000
followed by a guest register dump, and then QEMU dumps core.
This situation happens in one of two cases:
(1) a guest kernel bug, where it jumped off into nowhere
(2) a user command line mistake, where they tried to run an image for
board A on a QEMU model of board B, or where they didn't provide
an image at all, and QEMU executed through a ROM or RAM full of
NOP instructions and then fell off the end
In either case, a core dump of QEMU itself is entirely useless, and
only confuses users into thinking that this is a bug in QEMU rather
than a bug in the guest or a problem with their command line. (This
is a variation on the general idea that we shouldn't assert() on
something the user can accidentally provoke.)
Replace the cpu_abort() with something that explains the situation
a bit better and exits QEMU without dumping core.
(See LP:1062220 for several examples of confused users.)
Signed-off-by: Peter Maydell <peter.maydell@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Message-id: 1466442425-11885-1-git-send-email-peter.maydell@linaro.org
2016-06-20 19:07:05 +02:00
|
|
|
#include "qemu/error-report.h"
|
|
|
|
#include "exec/log.h"
|
2016-06-28 20:37:27 +02:00
|
|
|
#include "exec/helper-proto.h"
|
|
|
|
#include "qemu/atomic.h"
|
2018-08-16 01:31:47 +02:00
|
|
|
#include "qemu/atomic128.h"
|
2020-12-16 13:27:58 +01:00
|
|
|
#include "exec/translate-all.h"
|
2020-02-04 12:20:10 +01:00
|
|
|
#include "trace/trace-root.h"
|
2021-05-24 19:04:53 +02:00
|
|
|
#include "tb-hash.h"
|
2021-01-17 17:48:12 +01:00
|
|
|
#include "internal.h"
|
2019-06-19 21:20:08 +02:00
|
|
|
#ifdef CONFIG_PLUGIN
|
|
|
|
#include "qemu/plugin-memory.h"
|
|
|
|
#endif
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2016-03-15 15:30:24 +01:00
|
|
|
/* DEBUG defines, enable DEBUG_TLB_LOG to log to the CPU_LOG_MMU target */
|
|
|
|
/* #define DEBUG_TLB */
|
|
|
|
/* #define DEBUG_TLB_LOG */
|
|
|
|
|
|
|
|
#ifdef DEBUG_TLB
|
|
|
|
# define DEBUG_TLB_GATE 1
|
|
|
|
# ifdef DEBUG_TLB_LOG
|
|
|
|
# define DEBUG_TLB_LOG_GATE 1
|
|
|
|
# else
|
|
|
|
# define DEBUG_TLB_LOG_GATE 0
|
|
|
|
# endif
|
|
|
|
#else
|
|
|
|
# define DEBUG_TLB_GATE 0
|
|
|
|
# define DEBUG_TLB_LOG_GATE 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define tlb_debug(fmt, ...) do { \
|
|
|
|
if (DEBUG_TLB_LOG_GATE) { \
|
|
|
|
qemu_log_mask(CPU_LOG_MMU, "%s: " fmt, __func__, \
|
|
|
|
## __VA_ARGS__); \
|
|
|
|
} else if (DEBUG_TLB_GATE) { \
|
|
|
|
fprintf(stderr, "%s: " fmt, __func__, ## __VA_ARGS__); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2018-10-09 19:45:55 +02:00
|
|
|
#define assert_cpu_is_self(cpu) do { \
|
2017-02-23 19:29:16 +01:00
|
|
|
if (DEBUG_TLB_GATE) { \
|
2018-10-09 19:45:55 +02:00
|
|
|
g_assert(!(cpu)->created || qemu_cpu_is_self(cpu)); \
|
2017-02-23 19:29:16 +01:00
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
2017-02-23 19:29:18 +01:00
|
|
|
/* run_on_cpu_data.target_ptr should always be big enough for a
|
|
|
|
* target_ulong even on 32 bit builds */
|
|
|
|
QEMU_BUILD_BUG_ON(sizeof(target_ulong) > sizeof(run_on_cpu_data));
|
|
|
|
|
2017-02-23 19:29:20 +01:00
|
|
|
/* We currently can't handle more than 16 bits in the MMUIDX bitmask.
|
|
|
|
*/
|
|
|
|
QEMU_BUILD_BUG_ON(NB_MMU_MODES > 16);
|
|
|
|
#define ALL_MMUIDX_BITS ((1 << NB_MMU_MODES) - 1)
|
|
|
|
|
2019-12-07 20:47:41 +01:00
|
|
|
static inline size_t tlb_n_entries(CPUTLBDescFast *fast)
|
2019-12-07 20:37:57 +01:00
|
|
|
{
|
2019-12-07 20:47:41 +01:00
|
|
|
return (fast->mask >> CPU_TLB_ENTRY_BITS) + 1;
|
2019-12-07 20:37:57 +01:00
|
|
|
}
|
|
|
|
|
2019-12-07 20:47:41 +01:00
|
|
|
static inline size_t sizeof_tlb(CPUTLBDescFast *fast)
|
2019-01-16 18:01:13 +01:00
|
|
|
{
|
2019-12-07 20:47:41 +01:00
|
|
|
return fast->mask + (1 << CPU_TLB_ENTRY_BITS);
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
|
2019-03-22 16:36:40 +01:00
|
|
|
static void tlb_window_reset(CPUTLBDesc *desc, int64_t ns,
|
2019-01-16 18:01:13 +01:00
|
|
|
size_t max_entries)
|
|
|
|
{
|
2019-03-22 16:36:40 +01:00
|
|
|
desc->window_begin_ns = ns;
|
|
|
|
desc->window_max_entries = max_entries;
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
|
2021-01-21 06:53:20 +01:00
|
|
|
static void tb_jmp_cache_clear_page(CPUState *cpu, target_ulong page_addr)
|
|
|
|
{
|
|
|
|
unsigned int i, i0 = tb_jmp_cache_hash_page(page_addr);
|
|
|
|
|
|
|
|
for (i = 0; i < TB_JMP_PAGE_SIZE; i++) {
|
|
|
|
qatomic_set(&cpu->tb_jmp_cache[i0 + i], NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tb_flush_jmp_cache(CPUState *cpu, target_ulong addr)
|
|
|
|
{
|
|
|
|
/* Discard jump cache entries for any tb which might potentially
|
|
|
|
overlap the flushed page. */
|
|
|
|
tb_jmp_cache_clear_page(cpu, addr - TARGET_PAGE_SIZE);
|
|
|
|
tb_jmp_cache_clear_page(cpu, addr);
|
|
|
|
}
|
|
|
|
|
2019-01-16 18:01:13 +01:00
|
|
|
/**
|
|
|
|
* tlb_mmu_resize_locked() - perform TLB resize bookkeeping; resize if necessary
|
2019-12-07 20:58:50 +01:00
|
|
|
* @desc: The CPUTLBDesc portion of the TLB
|
|
|
|
* @fast: The CPUTLBDescFast portion of the same TLB
|
2019-01-16 18:01:13 +01:00
|
|
|
*
|
|
|
|
* Called with tlb_lock_held.
|
|
|
|
*
|
|
|
|
* We have two main constraints when resizing a TLB: (1) we only resize it
|
|
|
|
* on a TLB flush (otherwise we'd have to take a perf hit by either rehashing
|
|
|
|
* the array or unnecessarily flushing it), which means we do not control how
|
|
|
|
* frequently the resizing can occur; (2) we don't have access to the guest's
|
|
|
|
* future scheduling decisions, and therefore have to decide the magnitude of
|
|
|
|
* the resize based on past observations.
|
|
|
|
*
|
|
|
|
* In general, a memory-hungry process can benefit greatly from an appropriately
|
|
|
|
* sized TLB, since a guest TLB miss is very expensive. This doesn't mean that
|
|
|
|
* we just have to make the TLB as large as possible; while an oversized TLB
|
|
|
|
* results in minimal TLB miss rates, it also takes longer to be flushed
|
|
|
|
* (flushes can be _very_ frequent), and the reduced locality can also hurt
|
|
|
|
* performance.
|
|
|
|
*
|
|
|
|
* To achieve near-optimal performance for all kinds of workloads, we:
|
|
|
|
*
|
|
|
|
* 1. Aggressively increase the size of the TLB when the use rate of the
|
|
|
|
* TLB being flushed is high, since it is likely that in the near future this
|
|
|
|
* memory-hungry process will execute again, and its memory hungriness will
|
|
|
|
* probably be similar.
|
|
|
|
*
|
|
|
|
* 2. Slowly reduce the size of the TLB as the use rate declines over a
|
|
|
|
* reasonably large time window. The rationale is that if in such a time window
|
|
|
|
* we have not observed a high TLB use rate, it is likely that we won't observe
|
|
|
|
* it in the near future. In that case, once a time window expires we downsize
|
|
|
|
* the TLB to match the maximum use rate observed in the window.
|
|
|
|
*
|
|
|
|
* 3. Try to keep the maximum use rate in a time window in the 30-70% range,
|
|
|
|
* since in that range performance is likely near-optimal. Recall that the TLB
|
|
|
|
* is direct mapped, so we want the use rate to be low (or at least not too
|
|
|
|
* high), since otherwise we are likely to have a significant amount of
|
|
|
|
* conflict misses.
|
|
|
|
*/
|
2019-12-07 23:36:01 +01:00
|
|
|
static void tlb_mmu_resize_locked(CPUTLBDesc *desc, CPUTLBDescFast *fast,
|
|
|
|
int64_t now)
|
2019-01-16 18:01:13 +01:00
|
|
|
{
|
2019-12-07 20:58:50 +01:00
|
|
|
size_t old_size = tlb_n_entries(fast);
|
2019-01-16 18:01:13 +01:00
|
|
|
size_t rate;
|
|
|
|
size_t new_size = old_size;
|
|
|
|
int64_t window_len_ms = 100;
|
|
|
|
int64_t window_len_ns = window_len_ms * 1000 * 1000;
|
2019-03-22 16:36:40 +01:00
|
|
|
bool window_expired = now > desc->window_begin_ns + window_len_ns;
|
2019-01-16 18:01:13 +01:00
|
|
|
|
2019-03-22 16:36:40 +01:00
|
|
|
if (desc->n_used_entries > desc->window_max_entries) {
|
|
|
|
desc->window_max_entries = desc->n_used_entries;
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
2019-03-22 16:36:40 +01:00
|
|
|
rate = desc->window_max_entries * 100 / old_size;
|
2019-01-16 18:01:13 +01:00
|
|
|
|
|
|
|
if (rate > 70) {
|
|
|
|
new_size = MIN(old_size << 1, 1 << CPU_TLB_DYN_MAX_BITS);
|
|
|
|
} else if (rate < 30 && window_expired) {
|
2019-03-22 16:36:40 +01:00
|
|
|
size_t ceil = pow2ceil(desc->window_max_entries);
|
|
|
|
size_t expected_rate = desc->window_max_entries * 100 / ceil;
|
2019-01-16 18:01:13 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Avoid undersizing when the max number of entries seen is just below
|
|
|
|
* a pow2. For instance, if max_entries == 1025, the expected use rate
|
|
|
|
* would be 1025/2048==50%. However, if max_entries == 1023, we'd get
|
|
|
|
* 1023/1024==99.9% use rate, so we'd likely end up doubling the size
|
|
|
|
* later. Thus, make sure that the expected use rate remains below 70%.
|
|
|
|
* (and since we double the size, that means the lowest rate we'd
|
|
|
|
* expect to get is 35%, which is still in the 30-70% range where
|
|
|
|
* we consider that the size is appropriate.)
|
|
|
|
*/
|
|
|
|
if (expected_rate > 70) {
|
|
|
|
ceil *= 2;
|
|
|
|
}
|
|
|
|
new_size = MAX(ceil, 1 << CPU_TLB_DYN_MIN_BITS);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_size == old_size) {
|
|
|
|
if (window_expired) {
|
2019-03-22 16:36:40 +01:00
|
|
|
tlb_window_reset(desc, now, desc->n_used_entries);
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-12-07 20:58:50 +01:00
|
|
|
g_free(fast->table);
|
|
|
|
g_free(desc->iotlb);
|
2019-01-16 18:01:13 +01:00
|
|
|
|
2019-03-22 16:36:40 +01:00
|
|
|
tlb_window_reset(desc, now, 0);
|
2019-01-16 18:01:13 +01:00
|
|
|
/* desc->n_used_entries is cleared by the caller */
|
2019-12-07 20:58:50 +01:00
|
|
|
fast->mask = (new_size - 1) << CPU_TLB_ENTRY_BITS;
|
|
|
|
fast->table = g_try_new(CPUTLBEntry, new_size);
|
|
|
|
desc->iotlb = g_try_new(CPUIOTLBEntry, new_size);
|
|
|
|
|
2019-01-16 18:01:13 +01:00
|
|
|
/*
|
|
|
|
* If the allocations fail, try smaller sizes. We just freed some
|
|
|
|
* memory, so going back to half of new_size has a good chance of working.
|
|
|
|
* Increased memory pressure elsewhere in the system might cause the
|
|
|
|
* allocations to fail though, so we progressively reduce the allocation
|
|
|
|
* size, aborting if we cannot even allocate the smallest TLB we support.
|
|
|
|
*/
|
2019-12-07 20:58:50 +01:00
|
|
|
while (fast->table == NULL || desc->iotlb == NULL) {
|
2019-01-16 18:01:13 +01:00
|
|
|
if (new_size == (1 << CPU_TLB_DYN_MIN_BITS)) {
|
|
|
|
error_report("%s: %s", __func__, strerror(errno));
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
new_size = MAX(new_size >> 1, 1 << CPU_TLB_DYN_MIN_BITS);
|
2019-12-07 20:58:50 +01:00
|
|
|
fast->mask = (new_size - 1) << CPU_TLB_ENTRY_BITS;
|
2019-01-16 18:01:13 +01:00
|
|
|
|
2019-12-07 20:58:50 +01:00
|
|
|
g_free(fast->table);
|
|
|
|
g_free(desc->iotlb);
|
|
|
|
fast->table = g_try_new(CPUTLBEntry, new_size);
|
|
|
|
desc->iotlb = g_try_new(CPUIOTLBEntry, new_size);
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-12-07 21:08:04 +01:00
|
|
|
static void tlb_mmu_flush_locked(CPUTLBDesc *desc, CPUTLBDescFast *fast)
|
2019-01-16 18:01:13 +01:00
|
|
|
{
|
2019-12-07 21:00:56 +01:00
|
|
|
desc->n_used_entries = 0;
|
|
|
|
desc->large_page_addr = -1;
|
|
|
|
desc->large_page_mask = -1;
|
|
|
|
desc->vindex = 0;
|
|
|
|
memset(fast->table, -1, sizeof_tlb(fast));
|
|
|
|
memset(desc->vtable, -1, sizeof(desc->vtable));
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
|
2019-12-07 23:36:01 +01:00
|
|
|
static void tlb_flush_one_mmuidx_locked(CPUArchState *env, int mmu_idx,
|
|
|
|
int64_t now)
|
2019-12-07 21:08:04 +01:00
|
|
|
{
|
|
|
|
CPUTLBDesc *desc = &env_tlb(env)->d[mmu_idx];
|
|
|
|
CPUTLBDescFast *fast = &env_tlb(env)->f[mmu_idx];
|
|
|
|
|
2019-12-07 23:36:01 +01:00
|
|
|
tlb_mmu_resize_locked(desc, fast, now);
|
2019-12-07 21:08:04 +01:00
|
|
|
tlb_mmu_flush_locked(desc, fast);
|
|
|
|
}
|
|
|
|
|
2019-12-07 22:22:19 +01:00
|
|
|
static void tlb_mmu_init(CPUTLBDesc *desc, CPUTLBDescFast *fast, int64_t now)
|
|
|
|
{
|
|
|
|
size_t n_entries = 1 << CPU_TLB_DYN_DEFAULT_BITS;
|
|
|
|
|
|
|
|
tlb_window_reset(desc, now, 0);
|
|
|
|
desc->n_used_entries = 0;
|
|
|
|
fast->mask = (n_entries - 1) << CPU_TLB_ENTRY_BITS;
|
|
|
|
fast->table = g_new(CPUTLBEntry, n_entries);
|
|
|
|
desc->iotlb = g_new(CPUIOTLBEntry, n_entries);
|
2020-01-09 01:23:56 +01:00
|
|
|
tlb_mmu_flush_locked(desc, fast);
|
2019-12-07 22:22:19 +01:00
|
|
|
}
|
|
|
|
|
2019-01-16 18:01:13 +01:00
|
|
|
static inline void tlb_n_used_entries_inc(CPUArchState *env, uintptr_t mmu_idx)
|
|
|
|
{
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->d[mmu_idx].n_used_entries++;
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void tlb_n_used_entries_dec(CPUArchState *env, uintptr_t mmu_idx)
|
|
|
|
{
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->d[mmu_idx].n_used_entries--;
|
2019-01-16 18:01:13 +01:00
|
|
|
}
|
|
|
|
|
2018-10-09 19:45:54 +02:00
|
|
|
void tlb_init(CPUState *cpu)
|
|
|
|
{
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2019-12-07 22:22:19 +01:00
|
|
|
int64_t now = get_clock_realtime();
|
|
|
|
int i;
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_init(&env_tlb(env)->c.lock);
|
2018-10-20 21:04:57 +02:00
|
|
|
|
2020-01-09 01:23:56 +01:00
|
|
|
/* All tlbs are initialized flushed. */
|
|
|
|
env_tlb(env)->c.dirty = 0;
|
2019-01-16 18:01:13 +01:00
|
|
|
|
2019-12-07 22:22:19 +01:00
|
|
|
for (i = 0; i < NB_MMU_MODES; i++) {
|
|
|
|
tlb_mmu_init(&env_tlb(env)->d[i], &env_tlb(env)->f[i], now);
|
|
|
|
}
|
2018-10-09 19:45:54 +02:00
|
|
|
}
|
|
|
|
|
2020-06-12 21:02:26 +02:00
|
|
|
void tlb_destroy(CPUState *cpu)
|
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
qemu_spin_destroy(&env_tlb(env)->c.lock);
|
|
|
|
for (i = 0; i < NB_MMU_MODES; i++) {
|
|
|
|
CPUTLBDesc *desc = &env_tlb(env)->d[i];
|
|
|
|
CPUTLBDescFast *fast = &env_tlb(env)->f[i];
|
|
|
|
|
|
|
|
g_free(fast->table);
|
|
|
|
g_free(desc->iotlb);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:22 +01:00
|
|
|
/* flush_all_helper: run fn across all cpus
|
|
|
|
*
|
|
|
|
* If the wait flag is set then the src cpu's helper will be queued as
|
|
|
|
* "safe" work and the loop exited creating a synchronisation point
|
|
|
|
* where all queued work will be finished before execution starts
|
|
|
|
* again.
|
|
|
|
*/
|
|
|
|
static void flush_all_helper(CPUState *src, run_on_cpu_func fn,
|
|
|
|
run_on_cpu_data d)
|
|
|
|
{
|
|
|
|
CPUState *cpu;
|
|
|
|
|
|
|
|
CPU_FOREACH(cpu) {
|
|
|
|
if (cpu != src) {
|
|
|
|
async_run_on_cpu(cpu, fn, d);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-19 23:36:43 +02:00
|
|
|
void tlb_flush_counts(size_t *pfull, size_t *ppart, size_t *pelide)
|
2017-07-06 20:42:26 +02:00
|
|
|
{
|
|
|
|
CPUState *cpu;
|
2018-10-19 23:36:43 +02:00
|
|
|
size_t full = 0, part = 0, elide = 0;
|
2017-07-06 20:42:26 +02:00
|
|
|
|
|
|
|
CPU_FOREACH(cpu) {
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
|
|
|
|
2020-09-23 12:56:46 +02:00
|
|
|
full += qatomic_read(&env_tlb(env)->c.full_flush_count);
|
|
|
|
part += qatomic_read(&env_tlb(env)->c.part_flush_count);
|
|
|
|
elide += qatomic_read(&env_tlb(env)->c.elide_flush_count);
|
2017-07-06 20:42:26 +02:00
|
|
|
}
|
2018-10-19 23:36:43 +02:00
|
|
|
*pfull = full;
|
|
|
|
*ppart = part;
|
|
|
|
*pelide = elide;
|
2017-07-06 20:42:26 +02:00
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2017-02-23 19:29:20 +01:00
|
|
|
static void tlb_flush_by_mmuidx_async_work(CPUState *cpu, run_on_cpu_data data)
|
2015-08-25 16:45:09 +02:00
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2018-10-20 21:04:57 +02:00
|
|
|
uint16_t asked = data.host_int;
|
|
|
|
uint16_t all_dirty, work, to_clean;
|
2019-12-07 23:36:01 +01:00
|
|
|
int64_t now = get_clock_realtime();
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2017-02-23 19:29:16 +01:00
|
|
|
assert_cpu_is_self(cpu);
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2018-10-20 21:04:57 +02:00
|
|
|
tlb_debug("mmu_idx:0x%04" PRIx16 "\n", asked);
|
2017-02-23 19:29:20 +01:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
2018-10-20 22:54:46 +02:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
all_dirty = env_tlb(env)->c.dirty;
|
2018-10-20 21:04:57 +02:00
|
|
|
to_clean = asked & all_dirty;
|
|
|
|
all_dirty &= ~to_clean;
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->c.dirty = all_dirty;
|
2018-10-20 21:04:57 +02:00
|
|
|
|
|
|
|
for (work = to_clean; work != 0; work &= work - 1) {
|
|
|
|
int mmu_idx = ctz32(work);
|
2019-12-07 23:36:01 +01:00
|
|
|
tlb_flush_one_mmuidx_locked(env, mmu_idx, now);
|
2015-08-25 16:45:09 +02:00
|
|
|
}
|
2018-10-20 21:04:57 +02:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2017-06-15 02:36:13 +02:00
|
|
|
cpu_tb_jmp_cache_clear(cpu);
|
2018-10-23 07:01:01 +02:00
|
|
|
|
2018-10-20 21:04:57 +02:00
|
|
|
if (to_clean == ALL_MMUIDX_BITS) {
|
2020-09-23 12:56:46 +02:00
|
|
|
qatomic_set(&env_tlb(env)->c.full_flush_count,
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->c.full_flush_count + 1);
|
2018-10-19 23:36:43 +02:00
|
|
|
} else {
|
2020-09-23 12:56:46 +02:00
|
|
|
qatomic_set(&env_tlb(env)->c.part_flush_count,
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->c.part_flush_count + ctpop16(to_clean));
|
2018-10-20 21:04:57 +02:00
|
|
|
if (to_clean != asked) {
|
2020-09-23 12:56:46 +02:00
|
|
|
qatomic_set(&env_tlb(env)->c.elide_flush_count,
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->c.elide_flush_count +
|
2018-10-20 21:04:57 +02:00
|
|
|
ctpop16(asked & ~to_clean));
|
|
|
|
}
|
2018-10-23 07:01:01 +02:00
|
|
|
}
|
2015-08-25 16:45:09 +02:00
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:19 +01:00
|
|
|
void tlb_flush_by_mmuidx(CPUState *cpu, uint16_t idxmap)
|
2015-08-25 16:45:09 +02:00
|
|
|
{
|
2017-02-23 19:29:20 +01:00
|
|
|
tlb_debug("mmu_idx: 0x%" PRIx16 "\n", idxmap);
|
|
|
|
|
2018-10-23 07:01:01 +02:00
|
|
|
if (cpu->created && !qemu_cpu_is_self(cpu)) {
|
2018-10-23 07:58:03 +02:00
|
|
|
async_run_on_cpu(cpu, tlb_flush_by_mmuidx_async_work,
|
|
|
|
RUN_ON_CPU_HOST_INT(idxmap));
|
2017-02-23 19:29:20 +01:00
|
|
|
} else {
|
2018-10-20 22:54:46 +02:00
|
|
|
tlb_flush_by_mmuidx_async_work(cpu, RUN_ON_CPU_HOST_INT(idxmap));
|
2017-02-23 19:29:20 +01:00
|
|
|
}
|
2015-08-25 16:45:09 +02:00
|
|
|
}
|
|
|
|
|
2018-10-23 07:01:01 +02:00
|
|
|
void tlb_flush(CPUState *cpu)
|
|
|
|
{
|
|
|
|
tlb_flush_by_mmuidx(cpu, ALL_MMUIDX_BITS);
|
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:22 +01:00
|
|
|
void tlb_flush_by_mmuidx_all_cpus(CPUState *src_cpu, uint16_t idxmap)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_by_mmuidx_async_work;
|
|
|
|
|
|
|
|
tlb_debug("mmu_idx: 0x%"PRIx16"\n", idxmap);
|
|
|
|
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
fn(src_cpu, RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
}
|
|
|
|
|
2018-10-23 07:01:01 +02:00
|
|
|
void tlb_flush_all_cpus(CPUState *src_cpu)
|
|
|
|
{
|
|
|
|
tlb_flush_by_mmuidx_all_cpus(src_cpu, ALL_MMUIDX_BITS);
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_by_mmuidx_all_cpus_synced(CPUState *src_cpu, uint16_t idxmap)
|
2017-02-23 19:29:22 +01:00
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_by_mmuidx_async_work;
|
|
|
|
|
|
|
|
tlb_debug("mmu_idx: 0x%"PRIx16"\n", idxmap);
|
|
|
|
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
async_safe_run_on_cpu(src_cpu, fn, RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
}
|
|
|
|
|
2018-10-23 07:01:01 +02:00
|
|
|
void tlb_flush_all_cpus_synced(CPUState *src_cpu)
|
|
|
|
{
|
|
|
|
tlb_flush_by_mmuidx_all_cpus_synced(src_cpu, ALL_MMUIDX_BITS);
|
|
|
|
}
|
|
|
|
|
2020-10-16 23:07:53 +02:00
|
|
|
static bool tlb_hit_page_mask_anyprot(CPUTLBEntry *tlb_entry,
|
|
|
|
target_ulong page, target_ulong mask)
|
|
|
|
{
|
|
|
|
page &= mask;
|
|
|
|
mask &= TARGET_PAGE_MASK | TLB_INVALID_MASK;
|
|
|
|
|
|
|
|
return (page == (tlb_entry->addr_read & mask) ||
|
|
|
|
page == (tlb_addr_write(tlb_entry) & mask) ||
|
|
|
|
page == (tlb_entry->addr_code & mask));
|
|
|
|
}
|
|
|
|
|
2018-06-29 22:07:08 +02:00
|
|
|
static inline bool tlb_hit_page_anyprot(CPUTLBEntry *tlb_entry,
|
|
|
|
target_ulong page)
|
|
|
|
{
|
2020-10-16 23:07:53 +02:00
|
|
|
return tlb_hit_page_mask_anyprot(tlb_entry, page, -1);
|
2018-06-29 22:07:08 +02:00
|
|
|
}
|
2017-02-23 19:29:22 +01:00
|
|
|
|
2019-01-16 18:01:12 +01:00
|
|
|
/**
|
|
|
|
* tlb_entry_is_empty - return true if the entry is not in use
|
|
|
|
* @te: pointer to CPUTLBEntry
|
|
|
|
*/
|
|
|
|
static inline bool tlb_entry_is_empty(const CPUTLBEntry *te)
|
|
|
|
{
|
|
|
|
return te->addr_read == -1 && te->addr_write == -1 && te->addr_code == -1;
|
|
|
|
}
|
|
|
|
|
2018-10-23 04:57:11 +02:00
|
|
|
/* Called with tlb_c.lock held */
|
2020-10-16 23:07:53 +02:00
|
|
|
static bool tlb_flush_entry_mask_locked(CPUTLBEntry *tlb_entry,
|
|
|
|
target_ulong page,
|
|
|
|
target_ulong mask)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2020-10-16 23:07:53 +02:00
|
|
|
if (tlb_hit_page_mask_anyprot(tlb_entry, page, mask)) {
|
2013-12-06 22:44:51 +01:00
|
|
|
memset(tlb_entry, -1, sizeof(*tlb_entry));
|
2019-01-16 18:01:13 +01:00
|
|
|
return true;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
2019-01-16 18:01:13 +01:00
|
|
|
return false;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
2020-10-16 23:07:53 +02:00
|
|
|
static inline bool tlb_flush_entry_locked(CPUTLBEntry *tlb_entry,
|
|
|
|
target_ulong page)
|
|
|
|
{
|
|
|
|
return tlb_flush_entry_mask_locked(tlb_entry, page, -1);
|
|
|
|
}
|
|
|
|
|
2018-10-23 04:57:11 +02:00
|
|
|
/* Called with tlb_c.lock held */
|
2020-10-16 23:07:53 +02:00
|
|
|
static void tlb_flush_vtlb_page_mask_locked(CPUArchState *env, int mmu_idx,
|
|
|
|
target_ulong page,
|
|
|
|
target_ulong mask)
|
2018-06-29 22:07:08 +02:00
|
|
|
{
|
2019-03-22 21:52:09 +01:00
|
|
|
CPUTLBDesc *d = &env_tlb(env)->d[mmu_idx];
|
2018-06-29 22:07:08 +02:00
|
|
|
int k;
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
|
2019-03-23 00:07:18 +01:00
|
|
|
assert_cpu_is_self(env_cpu(env));
|
2018-06-29 22:07:08 +02:00
|
|
|
for (k = 0; k < CPU_VTLB_SIZE; k++) {
|
2020-10-16 23:07:53 +02:00
|
|
|
if (tlb_flush_entry_mask_locked(&d->vtable[k], page, mask)) {
|
2019-01-16 18:01:13 +01:00
|
|
|
tlb_n_used_entries_dec(env, mmu_idx);
|
|
|
|
}
|
2018-06-29 22:07:08 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-10-16 23:07:53 +02:00
|
|
|
static inline void tlb_flush_vtlb_page_locked(CPUArchState *env, int mmu_idx,
|
|
|
|
target_ulong page)
|
|
|
|
{
|
|
|
|
tlb_flush_vtlb_page_mask_locked(env, mmu_idx, page, -1);
|
|
|
|
}
|
|
|
|
|
2018-10-17 20:48:40 +02:00
|
|
|
static void tlb_flush_page_locked(CPUArchState *env, int midx,
|
|
|
|
target_ulong page)
|
|
|
|
{
|
2019-03-22 21:52:09 +01:00
|
|
|
target_ulong lp_addr = env_tlb(env)->d[midx].large_page_addr;
|
|
|
|
target_ulong lp_mask = env_tlb(env)->d[midx].large_page_mask;
|
2018-10-17 20:48:40 +02:00
|
|
|
|
|
|
|
/* Check if we need to flush due to large pages. */
|
|
|
|
if ((page & lp_mask) == lp_addr) {
|
|
|
|
tlb_debug("forcing full flush midx %d ("
|
|
|
|
TARGET_FMT_lx "/" TARGET_FMT_lx ")\n",
|
|
|
|
midx, lp_addr, lp_mask);
|
2019-12-07 23:36:01 +01:00
|
|
|
tlb_flush_one_mmuidx_locked(env, midx, get_clock_realtime());
|
2018-10-17 20:48:40 +02:00
|
|
|
} else {
|
2019-01-16 18:01:13 +01:00
|
|
|
if (tlb_flush_entry_locked(tlb_entry(env, midx, page), page)) {
|
|
|
|
tlb_n_used_entries_dec(env, midx);
|
|
|
|
}
|
2018-10-17 20:48:40 +02:00
|
|
|
tlb_flush_vtlb_page_locked(env, midx, page);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
/**
|
|
|
|
* tlb_flush_page_by_mmuidx_async_0:
|
|
|
|
* @cpu: cpu on which to flush
|
|
|
|
* @addr: page of virtual address to flush
|
|
|
|
* @idxmap: set of mmu_idx to flush
|
|
|
|
*
|
|
|
|
* Helper for tlb_flush_page_by_mmuidx and friends, flush one page
|
|
|
|
* at @addr from the tlbs indicated by @idxmap from @cpu.
|
2017-02-23 19:29:20 +01:00
|
|
|
*/
|
2019-11-11 14:53:30 +01:00
|
|
|
static void tlb_flush_page_by_mmuidx_async_0(CPUState *cpu,
|
|
|
|
target_ulong addr,
|
|
|
|
uint16_t idxmap)
|
2015-08-25 16:45:09 +02:00
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2017-02-23 19:29:20 +01:00
|
|
|
int mmu_idx;
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2017-02-23 19:29:16 +01:00
|
|
|
assert_cpu_is_self(cpu);
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
tlb_debug("page addr:" TARGET_FMT_lx " mmu_map:0x%x\n", addr, idxmap);
|
2015-08-25 16:45:09 +02:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
2017-02-23 19:29:19 +01:00
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
2019-11-11 14:53:30 +01:00
|
|
|
if ((idxmap >> mmu_idx) & 1) {
|
2018-10-17 20:48:40 +02:00
|
|
|
tlb_flush_page_locked(env, mmu_idx, addr);
|
2015-08-25 16:45:09 +02:00
|
|
|
}
|
|
|
|
}
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
2015-08-25 16:45:09 +02:00
|
|
|
|
|
|
|
tb_flush_jmp_cache(cpu, addr);
|
|
|
|
}
|
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
/**
|
|
|
|
* tlb_flush_page_by_mmuidx_async_1:
|
|
|
|
* @cpu: cpu on which to flush
|
|
|
|
* @data: encoded addr + idxmap
|
|
|
|
*
|
|
|
|
* Helper for tlb_flush_page_by_mmuidx and friends, called through
|
|
|
|
* async_run_on_cpu. The idxmap parameter is encoded in the page
|
|
|
|
* offset of the target_ptr field. This limits the set of mmu_idx
|
|
|
|
* that can be passed via this method.
|
|
|
|
*/
|
|
|
|
static void tlb_flush_page_by_mmuidx_async_1(CPUState *cpu,
|
|
|
|
run_on_cpu_data data)
|
|
|
|
{
|
|
|
|
target_ulong addr_and_idxmap = (target_ulong) data.target_ptr;
|
|
|
|
target_ulong addr = addr_and_idxmap & TARGET_PAGE_MASK;
|
|
|
|
uint16_t idxmap = addr_and_idxmap & ~TARGET_PAGE_MASK;
|
|
|
|
|
|
|
|
tlb_flush_page_by_mmuidx_async_0(cpu, addr, idxmap);
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
target_ulong addr;
|
|
|
|
uint16_t idxmap;
|
|
|
|
} TLBFlushPageByMMUIdxData;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* tlb_flush_page_by_mmuidx_async_2:
|
|
|
|
* @cpu: cpu on which to flush
|
|
|
|
* @data: allocated addr + idxmap
|
|
|
|
*
|
|
|
|
* Helper for tlb_flush_page_by_mmuidx and friends, called through
|
|
|
|
* async_run_on_cpu. The addr+idxmap parameters are stored in a
|
|
|
|
* TLBFlushPageByMMUIdxData structure that has been allocated
|
|
|
|
* specifically for this helper. Free the structure when done.
|
|
|
|
*/
|
|
|
|
static void tlb_flush_page_by_mmuidx_async_2(CPUState *cpu,
|
|
|
|
run_on_cpu_data data)
|
2017-02-23 19:29:20 +01:00
|
|
|
{
|
2019-11-11 14:53:30 +01:00
|
|
|
TLBFlushPageByMMUIdxData *d = data.host_ptr;
|
|
|
|
|
|
|
|
tlb_flush_page_by_mmuidx_async_0(cpu, d->addr, d->idxmap);
|
|
|
|
g_free(d);
|
|
|
|
}
|
2017-02-23 19:29:20 +01:00
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
void tlb_flush_page_by_mmuidx(CPUState *cpu, target_ulong addr, uint16_t idxmap)
|
|
|
|
{
|
2017-02-23 19:29:20 +01:00
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%" PRIx16 "\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
2019-11-11 14:53:30 +01:00
|
|
|
addr &= TARGET_PAGE_MASK;
|
2017-02-23 19:29:20 +01:00
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
if (qemu_cpu_is_self(cpu)) {
|
|
|
|
tlb_flush_page_by_mmuidx_async_0(cpu, addr, idxmap);
|
|
|
|
} else if (idxmap < TARGET_PAGE_SIZE) {
|
|
|
|
/*
|
|
|
|
* Most targets have only a few mmu_idx. In the case where
|
|
|
|
* we can stuff idxmap into the low TARGET_PAGE_BITS, avoid
|
|
|
|
* allocating memory for this operation.
|
|
|
|
*/
|
|
|
|
async_run_on_cpu(cpu, tlb_flush_page_by_mmuidx_async_1,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr | idxmap));
|
2017-02-23 19:29:20 +01:00
|
|
|
} else {
|
2019-11-11 14:53:30 +01:00
|
|
|
TLBFlushPageByMMUIdxData *d = g_new(TLBFlushPageByMMUIdxData, 1);
|
|
|
|
|
|
|
|
/* Otherwise allocate a structure, freed by the worker. */
|
|
|
|
d->addr = addr;
|
|
|
|
d->idxmap = idxmap;
|
|
|
|
async_run_on_cpu(cpu, tlb_flush_page_by_mmuidx_async_2,
|
|
|
|
RUN_ON_CPU_HOST_PTR(d));
|
2017-02-23 19:29:20 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-19 23:25:09 +02:00
|
|
|
void tlb_flush_page(CPUState *cpu, target_ulong addr)
|
|
|
|
{
|
|
|
|
tlb_flush_page_by_mmuidx(cpu, addr, ALL_MMUIDX_BITS);
|
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:22 +01:00
|
|
|
void tlb_flush_page_by_mmuidx_all_cpus(CPUState *src_cpu, target_ulong addr,
|
|
|
|
uint16_t idxmap)
|
2017-02-23 19:29:18 +01:00
|
|
|
{
|
2017-02-23 19:29:22 +01:00
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%"PRIx16"\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
2019-11-11 14:53:30 +01:00
|
|
|
addr &= TARGET_PAGE_MASK;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate memory to hold addr+idxmap only when needed.
|
|
|
|
* See tlb_flush_page_by_mmuidx for details.
|
|
|
|
*/
|
|
|
|
if (idxmap < TARGET_PAGE_SIZE) {
|
|
|
|
flush_all_helper(src_cpu, tlb_flush_page_by_mmuidx_async_1,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr | idxmap));
|
|
|
|
} else {
|
|
|
|
CPUState *dst_cpu;
|
|
|
|
|
|
|
|
/* Allocate a separate data block for each destination cpu. */
|
|
|
|
CPU_FOREACH(dst_cpu) {
|
|
|
|
if (dst_cpu != src_cpu) {
|
|
|
|
TLBFlushPageByMMUIdxData *d
|
|
|
|
= g_new(TLBFlushPageByMMUIdxData, 1);
|
|
|
|
|
|
|
|
d->addr = addr;
|
|
|
|
d->idxmap = idxmap;
|
|
|
|
async_run_on_cpu(dst_cpu, tlb_flush_page_by_mmuidx_async_2,
|
|
|
|
RUN_ON_CPU_HOST_PTR(d));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-02-23 19:29:22 +01:00
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
tlb_flush_page_by_mmuidx_async_0(src_cpu, addr, idxmap);
|
2017-02-23 19:29:22 +01:00
|
|
|
}
|
|
|
|
|
2018-10-19 23:25:09 +02:00
|
|
|
void tlb_flush_page_all_cpus(CPUState *src, target_ulong addr)
|
|
|
|
{
|
|
|
|
tlb_flush_page_by_mmuidx_all_cpus(src, addr, ALL_MMUIDX_BITS);
|
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:22 +01:00
|
|
|
void tlb_flush_page_by_mmuidx_all_cpus_synced(CPUState *src_cpu,
|
2018-10-17 20:48:40 +02:00
|
|
|
target_ulong addr,
|
|
|
|
uint16_t idxmap)
|
2017-02-23 19:29:22 +01:00
|
|
|
{
|
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%"PRIx16"\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
2019-11-11 14:53:30 +01:00
|
|
|
addr &= TARGET_PAGE_MASK;
|
2017-02-23 19:29:22 +01:00
|
|
|
|
2019-11-11 14:53:30 +01:00
|
|
|
/*
|
|
|
|
* Allocate memory to hold addr+idxmap only when needed.
|
|
|
|
* See tlb_flush_page_by_mmuidx for details.
|
|
|
|
*/
|
|
|
|
if (idxmap < TARGET_PAGE_SIZE) {
|
|
|
|
flush_all_helper(src_cpu, tlb_flush_page_by_mmuidx_async_1,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr | idxmap));
|
|
|
|
async_safe_run_on_cpu(src_cpu, tlb_flush_page_by_mmuidx_async_1,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr | idxmap));
|
|
|
|
} else {
|
|
|
|
CPUState *dst_cpu;
|
|
|
|
TLBFlushPageByMMUIdxData *d;
|
|
|
|
|
|
|
|
/* Allocate a separate data block for each destination cpu. */
|
|
|
|
CPU_FOREACH(dst_cpu) {
|
|
|
|
if (dst_cpu != src_cpu) {
|
|
|
|
d = g_new(TLBFlushPageByMMUIdxData, 1);
|
|
|
|
d->addr = addr;
|
|
|
|
d->idxmap = idxmap;
|
|
|
|
async_run_on_cpu(dst_cpu, tlb_flush_page_by_mmuidx_async_2,
|
|
|
|
RUN_ON_CPU_HOST_PTR(d));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
d = g_new(TLBFlushPageByMMUIdxData, 1);
|
|
|
|
d->addr = addr;
|
|
|
|
d->idxmap = idxmap;
|
|
|
|
async_safe_run_on_cpu(src_cpu, tlb_flush_page_by_mmuidx_async_2,
|
|
|
|
RUN_ON_CPU_HOST_PTR(d));
|
|
|
|
}
|
2017-02-23 19:29:22 +01:00
|
|
|
}
|
|
|
|
|
2018-10-19 23:25:09 +02:00
|
|
|
void tlb_flush_page_all_cpus_synced(CPUState *src, target_ulong addr)
|
2017-02-23 19:29:22 +01:00
|
|
|
{
|
2018-10-19 23:25:09 +02:00
|
|
|
tlb_flush_page_by_mmuidx_all_cpus_synced(src, addr, ALL_MMUIDX_BITS);
|
2017-02-23 19:29:18 +01:00
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:11 +02:00
|
|
|
static void tlb_flush_range_locked(CPUArchState *env, int midx,
|
|
|
|
target_ulong addr, target_ulong len,
|
|
|
|
unsigned bits)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
|
|
|
CPUTLBDesc *d = &env_tlb(env)->d[midx];
|
|
|
|
CPUTLBDescFast *f = &env_tlb(env)->f[midx];
|
|
|
|
target_ulong mask = MAKE_64BIT_MASK(0, bits);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If @bits is smaller than the tlb size, there may be multiple entries
|
|
|
|
* within the TLB; otherwise all addresses that match under @mask hit
|
|
|
|
* the same TLB entry.
|
|
|
|
* TODO: Perhaps allow bits to be a few bits less than the size.
|
|
|
|
* For now, just flush the entire TLB.
|
2021-05-09 17:16:11 +02:00
|
|
|
*
|
|
|
|
* If @len is larger than the tlb size, then it will take longer to
|
|
|
|
* test all of the entries in the TLB than it will to flush it all.
|
2020-10-16 23:07:53 +02:00
|
|
|
*/
|
2021-05-09 17:16:11 +02:00
|
|
|
if (mask < f->mask || len > f->mask) {
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_debug("forcing full flush midx %d ("
|
2021-05-09 17:16:11 +02:00
|
|
|
TARGET_FMT_lx "/" TARGET_FMT_lx "+" TARGET_FMT_lx ")\n",
|
|
|
|
midx, addr, mask, len);
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_flush_one_mmuidx_locked(env, midx, get_clock_realtime());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:11 +02:00
|
|
|
/*
|
|
|
|
* Check if we need to flush due to large pages.
|
|
|
|
* Because large_page_mask contains all 1's from the msb,
|
|
|
|
* we only need to test the end of the range.
|
|
|
|
*/
|
|
|
|
if (((addr + len - 1) & d->large_page_mask) == d->large_page_addr) {
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_debug("forcing full flush midx %d ("
|
|
|
|
TARGET_FMT_lx "/" TARGET_FMT_lx ")\n",
|
|
|
|
midx, d->large_page_addr, d->large_page_mask);
|
|
|
|
tlb_flush_one_mmuidx_locked(env, midx, get_clock_realtime());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:11 +02:00
|
|
|
for (target_ulong i = 0; i < len; i += TARGET_PAGE_SIZE) {
|
|
|
|
target_ulong page = addr + i;
|
|
|
|
CPUTLBEntry *entry = tlb_entry(env, midx, page);
|
|
|
|
|
|
|
|
if (tlb_flush_entry_mask_locked(entry, page, mask)) {
|
|
|
|
tlb_n_used_entries_dec(env, midx);
|
|
|
|
}
|
|
|
|
tlb_flush_vtlb_page_mask_locked(env, midx, page, mask);
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
target_ulong addr;
|
2021-05-09 17:16:11 +02:00
|
|
|
target_ulong len;
|
2020-10-16 23:07:53 +02:00
|
|
|
uint16_t idxmap;
|
|
|
|
uint16_t bits;
|
2021-05-09 17:16:12 +02:00
|
|
|
} TLBFlushRangeData;
|
2020-10-16 23:07:53 +02:00
|
|
|
|
2021-05-09 17:16:16 +02:00
|
|
|
static void tlb_flush_range_by_mmuidx_async_0(CPUState *cpu,
|
|
|
|
TLBFlushRangeData d)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
|
|
|
int mmu_idx;
|
|
|
|
|
|
|
|
assert_cpu_is_self(cpu);
|
|
|
|
|
2021-05-09 17:16:11 +02:00
|
|
|
tlb_debug("range:" TARGET_FMT_lx "/%u+" TARGET_FMT_lx " mmu_map:0x%x\n",
|
|
|
|
d.addr, d.bits, d.len, d.idxmap);
|
2020-10-16 23:07:53 +02:00
|
|
|
|
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
if ((d.idxmap >> mmu_idx) & 1) {
|
2021-05-09 17:16:11 +02:00
|
|
|
tlb_flush_range_locked(env, mmu_idx, d.addr, d.len, d.bits);
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
|
|
|
|
2021-05-09 17:16:11 +02:00
|
|
|
for (target_ulong i = 0; i < d.len; i += TARGET_PAGE_SIZE) {
|
|
|
|
tb_flush_jmp_cache(cpu, d.addr + i);
|
|
|
|
}
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:17 +02:00
|
|
|
static void tlb_flush_range_by_mmuidx_async_1(CPUState *cpu,
|
|
|
|
run_on_cpu_data data)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
2021-05-09 17:16:12 +02:00
|
|
|
TLBFlushRangeData *d = data.host_ptr;
|
2021-05-09 17:16:16 +02:00
|
|
|
tlb_flush_range_by_mmuidx_async_0(cpu, *d);
|
2020-10-16 23:07:53 +02:00
|
|
|
g_free(d);
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:13 +02:00
|
|
|
void tlb_flush_range_by_mmuidx(CPUState *cpu, target_ulong addr,
|
|
|
|
target_ulong len, uint16_t idxmap,
|
|
|
|
unsigned bits)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
2021-05-09 17:16:12 +02:00
|
|
|
TLBFlushRangeData d;
|
2020-10-16 23:07:53 +02:00
|
|
|
|
2021-05-09 17:16:13 +02:00
|
|
|
/*
|
|
|
|
* If all bits are significant, and len is small,
|
|
|
|
* this devolves to tlb_flush_page.
|
|
|
|
*/
|
|
|
|
if (bits >= TARGET_LONG_BITS && len <= TARGET_PAGE_SIZE) {
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_flush_page_by_mmuidx(cpu, addr, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* If no page bits are significant, this devolves to tlb_flush. */
|
|
|
|
if (bits < TARGET_PAGE_BITS) {
|
|
|
|
tlb_flush_by_mmuidx(cpu, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
d.addr = addr & TARGET_PAGE_MASK;
|
2021-05-09 17:16:13 +02:00
|
|
|
d.len = len;
|
2020-10-16 23:07:53 +02:00
|
|
|
d.idxmap = idxmap;
|
|
|
|
d.bits = bits;
|
|
|
|
|
|
|
|
if (qemu_cpu_is_self(cpu)) {
|
2021-05-09 17:16:16 +02:00
|
|
|
tlb_flush_range_by_mmuidx_async_0(cpu, d);
|
2020-10-16 23:07:53 +02:00
|
|
|
} else {
|
|
|
|
/* Otherwise allocate a structure, freed by the worker. */
|
2021-05-09 17:16:12 +02:00
|
|
|
TLBFlushRangeData *p = g_memdup(&d, sizeof(d));
|
2021-05-09 17:16:17 +02:00
|
|
|
async_run_on_cpu(cpu, tlb_flush_range_by_mmuidx_async_1,
|
2020-10-16 23:07:53 +02:00
|
|
|
RUN_ON_CPU_HOST_PTR(p));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:13 +02:00
|
|
|
void tlb_flush_page_bits_by_mmuidx(CPUState *cpu, target_ulong addr,
|
|
|
|
uint16_t idxmap, unsigned bits)
|
|
|
|
{
|
|
|
|
tlb_flush_range_by_mmuidx(cpu, addr, TARGET_PAGE_SIZE, idxmap, bits);
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:14 +02:00
|
|
|
void tlb_flush_range_by_mmuidx_all_cpus(CPUState *src_cpu,
|
|
|
|
target_ulong addr, target_ulong len,
|
|
|
|
uint16_t idxmap, unsigned bits)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
2021-05-09 17:16:12 +02:00
|
|
|
TLBFlushRangeData d;
|
2021-05-09 17:16:18 +02:00
|
|
|
CPUState *dst_cpu;
|
2020-10-16 23:07:53 +02:00
|
|
|
|
2021-05-09 17:16:14 +02:00
|
|
|
/*
|
|
|
|
* If all bits are significant, and len is small,
|
|
|
|
* this devolves to tlb_flush_page.
|
|
|
|
*/
|
|
|
|
if (bits >= TARGET_LONG_BITS && len <= TARGET_PAGE_SIZE) {
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_flush_page_by_mmuidx_all_cpus(src_cpu, addr, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* If no page bits are significant, this devolves to tlb_flush. */
|
|
|
|
if (bits < TARGET_PAGE_BITS) {
|
|
|
|
tlb_flush_by_mmuidx_all_cpus(src_cpu, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
d.addr = addr & TARGET_PAGE_MASK;
|
2021-05-09 17:16:14 +02:00
|
|
|
d.len = len;
|
2020-10-16 23:07:53 +02:00
|
|
|
d.idxmap = idxmap;
|
|
|
|
d.bits = bits;
|
|
|
|
|
2021-05-09 17:16:18 +02:00
|
|
|
/* Allocate a separate data block for each destination cpu. */
|
|
|
|
CPU_FOREACH(dst_cpu) {
|
|
|
|
if (dst_cpu != src_cpu) {
|
|
|
|
TLBFlushRangeData *p = g_memdup(&d, sizeof(d));
|
|
|
|
async_run_on_cpu(dst_cpu,
|
2021-05-09 17:16:17 +02:00
|
|
|
tlb_flush_range_by_mmuidx_async_1,
|
2021-05-09 17:16:18 +02:00
|
|
|
RUN_ON_CPU_HOST_PTR(p));
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:16 +02:00
|
|
|
tlb_flush_range_by_mmuidx_async_0(src_cpu, d);
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:14 +02:00
|
|
|
void tlb_flush_page_bits_by_mmuidx_all_cpus(CPUState *src_cpu,
|
|
|
|
target_ulong addr,
|
|
|
|
uint16_t idxmap, unsigned bits)
|
|
|
|
{
|
|
|
|
tlb_flush_range_by_mmuidx_all_cpus(src_cpu, addr, TARGET_PAGE_SIZE,
|
|
|
|
idxmap, bits);
|
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:15 +02:00
|
|
|
void tlb_flush_range_by_mmuidx_all_cpus_synced(CPUState *src_cpu,
|
|
|
|
target_ulong addr,
|
|
|
|
target_ulong len,
|
|
|
|
uint16_t idxmap,
|
|
|
|
unsigned bits)
|
2020-10-16 23:07:53 +02:00
|
|
|
{
|
2021-05-09 17:16:18 +02:00
|
|
|
TLBFlushRangeData d, *p;
|
|
|
|
CPUState *dst_cpu;
|
2020-10-16 23:07:53 +02:00
|
|
|
|
2021-05-09 17:16:15 +02:00
|
|
|
/*
|
|
|
|
* If all bits are significant, and len is small,
|
|
|
|
* this devolves to tlb_flush_page.
|
|
|
|
*/
|
|
|
|
if (bits >= TARGET_LONG_BITS && len <= TARGET_PAGE_SIZE) {
|
2020-10-16 23:07:53 +02:00
|
|
|
tlb_flush_page_by_mmuidx_all_cpus_synced(src_cpu, addr, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* If no page bits are significant, this devolves to tlb_flush. */
|
|
|
|
if (bits < TARGET_PAGE_BITS) {
|
|
|
|
tlb_flush_by_mmuidx_all_cpus_synced(src_cpu, idxmap);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
d.addr = addr & TARGET_PAGE_MASK;
|
2021-05-09 17:16:15 +02:00
|
|
|
d.len = len;
|
2020-10-16 23:07:53 +02:00
|
|
|
d.idxmap = idxmap;
|
|
|
|
d.bits = bits;
|
|
|
|
|
2021-05-09 17:16:18 +02:00
|
|
|
/* Allocate a separate data block for each destination cpu. */
|
|
|
|
CPU_FOREACH(dst_cpu) {
|
|
|
|
if (dst_cpu != src_cpu) {
|
|
|
|
p = g_memdup(&d, sizeof(d));
|
2021-05-09 17:16:17 +02:00
|
|
|
async_run_on_cpu(dst_cpu, tlb_flush_range_by_mmuidx_async_1,
|
2021-05-09 17:16:18 +02:00
|
|
|
RUN_ON_CPU_HOST_PTR(p));
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
}
|
2021-05-09 17:16:18 +02:00
|
|
|
|
|
|
|
p = g_memdup(&d, sizeof(d));
|
2021-05-09 17:16:17 +02:00
|
|
|
async_safe_run_on_cpu(src_cpu, tlb_flush_range_by_mmuidx_async_1,
|
2021-05-09 17:16:18 +02:00
|
|
|
RUN_ON_CPU_HOST_PTR(p));
|
2020-10-16 23:07:53 +02:00
|
|
|
}
|
|
|
|
|
2021-05-09 17:16:15 +02:00
|
|
|
void tlb_flush_page_bits_by_mmuidx_all_cpus_synced(CPUState *src_cpu,
|
|
|
|
target_ulong addr,
|
|
|
|
uint16_t idxmap,
|
|
|
|
unsigned bits)
|
|
|
|
{
|
|
|
|
tlb_flush_range_by_mmuidx_all_cpus_synced(src_cpu, addr, TARGET_PAGE_SIZE,
|
|
|
|
idxmap, bits);
|
|
|
|
}
|
|
|
|
|
2012-04-09 18:50:52 +02:00
|
|
|
/* update the TLBs so that writes to code in the virtual page 'addr'
|
|
|
|
can be detected */
|
|
|
|
void tlb_protect_code(ram_addr_t ram_addr)
|
|
|
|
{
|
2014-12-02 12:23:18 +01:00
|
|
|
cpu_physical_memory_test_and_clear_dirty(ram_addr, TARGET_PAGE_SIZE,
|
|
|
|
DIRTY_MEMORY_CODE);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* update the TLB so that writes in physical page 'phys_addr' are no longer
|
|
|
|
tested for self modifying code */
|
2015-04-22 14:24:54 +02:00
|
|
|
void tlb_unprotect_code(ram_addr_t ram_addr)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2013-10-08 12:44:04 +02:00
|
|
|
cpu_physical_memory_set_dirty_flag(ram_addr, DIRTY_MEMORY_CODE);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-02-23 19:29:21 +01:00
|
|
|
/*
|
|
|
|
* Dirty write flag handling
|
|
|
|
*
|
|
|
|
* When the TCG code writes to a location it looks up the address in
|
|
|
|
* the TLB and uses that data to compute the final address. If any of
|
|
|
|
* the lower bits of the address are set then the slow path is forced.
|
|
|
|
* There are a number of reasons to do this but for normal RAM the
|
|
|
|
* most usual is detecting writes to code regions which may invalidate
|
|
|
|
* generated code.
|
|
|
|
*
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
* Other vCPUs might be reading their TLBs during guest execution, so we update
|
2020-09-23 12:56:46 +02:00
|
|
|
* te->addr_write with qatomic_set. We don't need to worry about this for
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
* oversized guests as MTTCG is disabled for them.
|
2017-02-23 19:29:21 +01:00
|
|
|
*
|
2018-10-23 04:57:11 +02:00
|
|
|
* Called with tlb_c.lock held.
|
2017-02-23 19:29:21 +01:00
|
|
|
*/
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
static void tlb_reset_dirty_range_locked(CPUTLBEntry *tlb_entry,
|
|
|
|
uintptr_t start, uintptr_t length)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2017-02-23 19:29:21 +01:00
|
|
|
uintptr_t addr = tlb_entry->addr_write;
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2019-09-20 02:54:10 +02:00
|
|
|
if ((addr & (TLB_INVALID_MASK | TLB_MMIO |
|
|
|
|
TLB_DISCARD_WRITE | TLB_NOTDIRTY)) == 0) {
|
2017-02-23 19:29:21 +01:00
|
|
|
addr &= TARGET_PAGE_MASK;
|
|
|
|
addr += tlb_entry->addend;
|
2012-04-09 18:50:52 +02:00
|
|
|
if ((addr - start) < length) {
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
#if TCG_OVERSIZED_GUEST
|
2012-04-09 18:50:52 +02:00
|
|
|
tlb_entry->addr_write |= TLB_NOTDIRTY;
|
2017-02-23 19:29:21 +01:00
|
|
|
#else
|
2020-09-23 12:56:46 +02:00
|
|
|
qatomic_set(&tlb_entry->addr_write,
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
tlb_entry->addr_write | TLB_NOTDIRTY);
|
|
|
|
#endif
|
2017-02-23 19:29:21 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
/*
|
2018-10-23 04:57:11 +02:00
|
|
|
* Called with tlb_c.lock held.
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
* Called only from the vCPU context, i.e. the TLB's owner thread.
|
|
|
|
*/
|
|
|
|
static inline void copy_tlb_helper_locked(CPUTLBEntry *d, const CPUTLBEntry *s)
|
2017-02-23 19:29:21 +01:00
|
|
|
{
|
|
|
|
*d = *s;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:21 +01:00
|
|
|
/* This is a cross vCPU call (i.e. another vCPU resetting the flags of
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
* the target vCPU).
|
2018-10-23 04:57:11 +02:00
|
|
|
* We must take tlb_c.lock to avoid racing with another vCPU update. The only
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
* thing actually updated is the target TLB entry ->addr_write flags.
|
2017-02-23 19:29:21 +01:00
|
|
|
*/
|
2015-09-11 07:39:41 +02:00
|
|
|
void tlb_reset_dirty(CPUState *cpu, ram_addr_t start1, ram_addr_t length)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
|
|
|
CPUArchState *env;
|
|
|
|
|
2015-09-11 07:39:41 +02:00
|
|
|
int mmu_idx;
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2015-09-11 07:39:41 +02:00
|
|
|
env = cpu->env_ptr;
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
2015-09-11 07:39:41 +02:00
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
unsigned int i;
|
2019-12-07 20:47:41 +01:00
|
|
|
unsigned int n = tlb_n_entries(&env_tlb(env)->f[mmu_idx]);
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2019-01-16 18:01:13 +01:00
|
|
|
for (i = 0; i < n; i++) {
|
2019-03-22 21:52:09 +01:00
|
|
|
tlb_reset_dirty_range_locked(&env_tlb(env)->f[mmu_idx].table[i],
|
|
|
|
start1, length);
|
2015-09-11 07:39:41 +02:00
|
|
|
}
|
implementing victim TLB for QEMU system emulated TLB
QEMU system mode page table walks are expensive. Taken by running QEMU
qemu-system-x86_64 system mode on Intel PIN , a TLB miss and walking a
4-level page tables in guest Linux OS takes ~450 X86 instructions on
average.
QEMU system mode TLB is implemented using a directly-mapped hashtable.
This structure suffers from conflict misses. Increasing the
associativity of the TLB may not be the solution to conflict misses as
all the ways may have to be walked in serial.
A victim TLB is a TLB used to hold translations evicted from the
primary TLB upon replacement. The victim TLB lies between the main TLB
and its refill path. Victim TLB is of greater associativity (fully
associative in this patch). It takes longer to lookup the victim TLB,
but its likely better than a full page table walk. The memory
translation path is changed as follows :
Before Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. TLB refill.
5. Do the memory access.
6. Return to code cache.
After Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. Victim TLB lookup.
5. If victim TLB misses, TLB refill
6. Do the memory access.
7. Return to code cache
The advantage is that victim TLB can offer more associativity to a
directly mapped TLB and thus potentially fewer page table walks while
still keeping the time taken to flush within reasonable limits.
However, placing a victim TLB before the refill path increase TLB
refill path as the victim TLB is consulted before the TLB refill. The
performance results demonstrate that the pros outweigh the cons.
some performance results taken on SPECINT2006 train
datasets and kernel boot and qemu configure script on an
Intel(R) Xeon(R) CPU E5620 @ 2.40GHz Linux machine are shown in the
Google Doc link below.
https://docs.google.com/spreadsheets/d/1eiItzekZwNQOal_h-5iJmC4tMDi051m9qidi5_nwvH4/edit?usp=sharing
In summary, victim TLB improves the performance of qemu-system-x86_64 by
11% on average on SPECINT2006, kernelboot and qemu configscript and with
highest improvement of in 26% in 456.hmmer. And victim TLB does not result
in any performance degradation in any of the measured benchmarks. Furthermore,
the implemented victim TLB is architecture independent and is expected to
benefit other architectures in QEMU as well.
Although there are measurement fluctuations, the performance
improvement is very significant and by no means in the range of
noises.
Signed-off-by: Xin Tong <trent.tong@gmail.com>
Message-id: 1407202523-23553-1-git-send-email-trent.tong@gmail.com
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Signed-off-by: Peter Maydell <peter.maydell@linaro.org>
2014-08-05 03:35:23 +02:00
|
|
|
|
2015-09-11 07:39:41 +02:00
|
|
|
for (i = 0; i < CPU_VTLB_SIZE; i++) {
|
2019-03-22 21:52:09 +01:00
|
|
|
tlb_reset_dirty_range_locked(&env_tlb(env)->d[mmu_idx].vtable[i],
|
|
|
|
start1, length);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
}
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
2018-10-23 04:57:11 +02:00
|
|
|
/* Called with tlb_c.lock held */
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
static inline void tlb_set_dirty1_locked(CPUTLBEntry *tlb_entry,
|
|
|
|
target_ulong vaddr)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
|
|
|
if (tlb_entry->addr_write == (vaddr | TLB_NOTDIRTY)) {
|
|
|
|
tlb_entry->addr_write = vaddr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update the TLB corresponding to virtual page vaddr
|
|
|
|
so that it is no longer dirty */
|
2015-09-11 07:39:42 +02:00
|
|
|
void tlb_set_dirty(CPUState *cpu, target_ulong vaddr)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2015-09-11 07:39:42 +02:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2012-04-09 18:50:52 +02:00
|
|
|
int mmu_idx;
|
|
|
|
|
2017-02-23 19:29:16 +01:00
|
|
|
assert_cpu_is_self(cpu);
|
|
|
|
|
2012-04-09 18:50:52 +02:00
|
|
|
vaddr &= TARGET_PAGE_MASK;
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
2012-04-09 18:50:52 +02:00
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
2018-10-09 19:51:25 +02:00
|
|
|
tlb_set_dirty1_locked(tlb_entry(env, mmu_idx, vaddr), vaddr);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
implementing victim TLB for QEMU system emulated TLB
QEMU system mode page table walks are expensive. Taken by running QEMU
qemu-system-x86_64 system mode on Intel PIN , a TLB miss and walking a
4-level page tables in guest Linux OS takes ~450 X86 instructions on
average.
QEMU system mode TLB is implemented using a directly-mapped hashtable.
This structure suffers from conflict misses. Increasing the
associativity of the TLB may not be the solution to conflict misses as
all the ways may have to be walked in serial.
A victim TLB is a TLB used to hold translations evicted from the
primary TLB upon replacement. The victim TLB lies between the main TLB
and its refill path. Victim TLB is of greater associativity (fully
associative in this patch). It takes longer to lookup the victim TLB,
but its likely better than a full page table walk. The memory
translation path is changed as follows :
Before Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. TLB refill.
5. Do the memory access.
6. Return to code cache.
After Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. Victim TLB lookup.
5. If victim TLB misses, TLB refill
6. Do the memory access.
7. Return to code cache
The advantage is that victim TLB can offer more associativity to a
directly mapped TLB and thus potentially fewer page table walks while
still keeping the time taken to flush within reasonable limits.
However, placing a victim TLB before the refill path increase TLB
refill path as the victim TLB is consulted before the TLB refill. The
performance results demonstrate that the pros outweigh the cons.
some performance results taken on SPECINT2006 train
datasets and kernel boot and qemu configure script on an
Intel(R) Xeon(R) CPU E5620 @ 2.40GHz Linux machine are shown in the
Google Doc link below.
https://docs.google.com/spreadsheets/d/1eiItzekZwNQOal_h-5iJmC4tMDi051m9qidi5_nwvH4/edit?usp=sharing
In summary, victim TLB improves the performance of qemu-system-x86_64 by
11% on average on SPECINT2006, kernelboot and qemu configscript and with
highest improvement of in 26% in 456.hmmer. And victim TLB does not result
in any performance degradation in any of the measured benchmarks. Furthermore,
the implemented victim TLB is architecture independent and is expected to
benefit other architectures in QEMU as well.
Although there are measurement fluctuations, the performance
improvement is very significant and by no means in the range of
noises.
Signed-off-by: Xin Tong <trent.tong@gmail.com>
Message-id: 1407202523-23553-1-git-send-email-trent.tong@gmail.com
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Signed-off-by: Peter Maydell <peter.maydell@linaro.org>
2014-08-05 03:35:23 +02:00
|
|
|
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
int k;
|
|
|
|
for (k = 0; k < CPU_VTLB_SIZE; k++) {
|
2019-03-22 21:52:09 +01:00
|
|
|
tlb_set_dirty1_locked(&env_tlb(env)->d[mmu_idx].vtable[k], vaddr);
|
implementing victim TLB for QEMU system emulated TLB
QEMU system mode page table walks are expensive. Taken by running QEMU
qemu-system-x86_64 system mode on Intel PIN , a TLB miss and walking a
4-level page tables in guest Linux OS takes ~450 X86 instructions on
average.
QEMU system mode TLB is implemented using a directly-mapped hashtable.
This structure suffers from conflict misses. Increasing the
associativity of the TLB may not be the solution to conflict misses as
all the ways may have to be walked in serial.
A victim TLB is a TLB used to hold translations evicted from the
primary TLB upon replacement. The victim TLB lies between the main TLB
and its refill path. Victim TLB is of greater associativity (fully
associative in this patch). It takes longer to lookup the victim TLB,
but its likely better than a full page table walk. The memory
translation path is changed as follows :
Before Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. TLB refill.
5. Do the memory access.
6. Return to code cache.
After Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. Victim TLB lookup.
5. If victim TLB misses, TLB refill
6. Do the memory access.
7. Return to code cache
The advantage is that victim TLB can offer more associativity to a
directly mapped TLB and thus potentially fewer page table walks while
still keeping the time taken to flush within reasonable limits.
However, placing a victim TLB before the refill path increase TLB
refill path as the victim TLB is consulted before the TLB refill. The
performance results demonstrate that the pros outweigh the cons.
some performance results taken on SPECINT2006 train
datasets and kernel boot and qemu configure script on an
Intel(R) Xeon(R) CPU E5620 @ 2.40GHz Linux machine are shown in the
Google Doc link below.
https://docs.google.com/spreadsheets/d/1eiItzekZwNQOal_h-5iJmC4tMDi051m9qidi5_nwvH4/edit?usp=sharing
In summary, victim TLB improves the performance of qemu-system-x86_64 by
11% on average on SPECINT2006, kernelboot and qemu configscript and with
highest improvement of in 26% in 456.hmmer. And victim TLB does not result
in any performance degradation in any of the measured benchmarks. Furthermore,
the implemented victim TLB is architecture independent and is expected to
benefit other architectures in QEMU as well.
Although there are measurement fluctuations, the performance
improvement is very significant and by no means in the range of
noises.
Signed-off-by: Xin Tong <trent.tong@gmail.com>
Message-id: 1407202523-23553-1-git-send-email-trent.tong@gmail.com
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Signed-off-by: Peter Maydell <peter.maydell@linaro.org>
2014-08-05 03:35:23 +02:00
|
|
|
}
|
|
|
|
}
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Our TLB does not support large pages, so remember the area covered by
|
|
|
|
large pages and trigger a full TLB flush if these are invalidated. */
|
2018-10-17 20:48:40 +02:00
|
|
|
static void tlb_add_large_page(CPUArchState *env, int mmu_idx,
|
|
|
|
target_ulong vaddr, target_ulong size)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2019-03-22 21:52:09 +01:00
|
|
|
target_ulong lp_addr = env_tlb(env)->d[mmu_idx].large_page_addr;
|
2018-10-17 20:48:40 +02:00
|
|
|
target_ulong lp_mask = ~(size - 1);
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2018-10-17 20:48:40 +02:00
|
|
|
if (lp_addr == (target_ulong)-1) {
|
|
|
|
/* No previous large page. */
|
|
|
|
lp_addr = vaddr;
|
|
|
|
} else {
|
|
|
|
/* Extend the existing region to include the new page.
|
|
|
|
This is a compromise between unnecessary flushes and
|
|
|
|
the cost of maintaining a full variable size TLB. */
|
2019-03-22 21:52:09 +01:00
|
|
|
lp_mask &= env_tlb(env)->d[mmu_idx].large_page_mask;
|
2018-10-17 20:48:40 +02:00
|
|
|
while (((lp_addr ^ vaddr) & lp_mask) != 0) {
|
|
|
|
lp_mask <<= 1;
|
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
2019-03-22 21:52:09 +01:00
|
|
|
env_tlb(env)->d[mmu_idx].large_page_addr = lp_addr & lp_mask;
|
|
|
|
env_tlb(env)->d[mmu_idx].large_page_mask = lp_mask;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Add a new TLB entry. At most one entry for a given virtual address
|
2015-01-21 12:09:14 +01:00
|
|
|
* is permitted. Only a single TARGET_PAGE_SIZE region is mapped, the
|
|
|
|
* supplied size is only used by tlb_flush_page.
|
|
|
|
*
|
|
|
|
* Called from TCG-generated code, which is under an RCU read-side
|
|
|
|
* critical section.
|
|
|
|
*/
|
2015-04-26 17:49:24 +02:00
|
|
|
void tlb_set_page_with_attrs(CPUState *cpu, target_ulong vaddr,
|
|
|
|
hwaddr paddr, MemTxAttrs attrs, int prot,
|
|
|
|
int mmu_idx, target_ulong size)
|
2012-04-09 18:50:52 +02:00
|
|
|
{
|
2013-09-03 13:59:37 +02:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2019-03-22 21:52:09 +01:00
|
|
|
CPUTLB *tlb = env_tlb(env);
|
|
|
|
CPUTLBDesc *desc = &tlb->d[mmu_idx];
|
2012-04-09 18:50:52 +02:00
|
|
|
MemoryRegionSection *section;
|
|
|
|
unsigned int index;
|
|
|
|
target_ulong address;
|
2019-09-20 06:09:58 +02:00
|
|
|
target_ulong write_address;
|
2012-04-09 18:50:52 +02:00
|
|
|
uintptr_t addend;
|
2018-06-29 22:07:08 +02:00
|
|
|
CPUTLBEntry *te, tn;
|
2018-06-26 18:50:41 +02:00
|
|
|
hwaddr iotlb, xlat, sz, paddr_page;
|
|
|
|
target_ulong vaddr_page;
|
2016-01-21 15:15:05 +01:00
|
|
|
int asidx = cpu_asidx_from_attrs(cpu, attrs);
|
2019-08-24 18:51:09 +02:00
|
|
|
int wp_flags;
|
2019-09-20 06:09:58 +02:00
|
|
|
bool is_ram, is_romd;
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2017-02-23 19:29:16 +01:00
|
|
|
assert_cpu_is_self(cpu);
|
2018-06-26 18:50:41 +02:00
|
|
|
|
2018-10-17 20:48:40 +02:00
|
|
|
if (size <= TARGET_PAGE_SIZE) {
|
2018-06-26 18:50:41 +02:00
|
|
|
sz = TARGET_PAGE_SIZE;
|
|
|
|
} else {
|
2018-10-17 20:48:40 +02:00
|
|
|
tlb_add_large_page(env, mmu_idx, vaddr, size);
|
2018-06-26 18:50:41 +02:00
|
|
|
sz = size;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
2018-06-26 18:50:41 +02:00
|
|
|
vaddr_page = vaddr & TARGET_PAGE_MASK;
|
|
|
|
paddr_page = paddr & TARGET_PAGE_MASK;
|
2013-05-24 12:59:37 +02:00
|
|
|
|
2018-06-26 18:50:41 +02:00
|
|
|
section = address_space_translate_for_iotlb(cpu, asidx, paddr_page,
|
|
|
|
&xlat, &sz, attrs, &prot);
|
2013-05-24 12:59:37 +02:00
|
|
|
assert(sz >= TARGET_PAGE_SIZE);
|
|
|
|
|
2016-03-15 15:30:24 +01:00
|
|
|
tlb_debug("vaddr=" TARGET_FMT_lx " paddr=0x" TARGET_FMT_plx
|
|
|
|
" prot=%x idx=%d\n",
|
|
|
|
vaddr, paddr, prot, mmu_idx);
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2018-06-26 18:50:41 +02:00
|
|
|
address = vaddr_page;
|
|
|
|
if (size < TARGET_PAGE_SIZE) {
|
2019-08-24 00:12:32 +02:00
|
|
|
/* Repeat the MMU check and TLB fill on every access. */
|
|
|
|
address |= TLB_INVALID_MASK;
|
2018-06-26 18:50:41 +02:00
|
|
|
}
|
2019-08-23 20:36:56 +02:00
|
|
|
if (attrs.byte_swap) {
|
2019-09-10 21:47:39 +02:00
|
|
|
address |= TLB_BSWAP;
|
2019-08-23 20:36:56 +02:00
|
|
|
}
|
2019-09-20 06:09:58 +02:00
|
|
|
|
|
|
|
is_ram = memory_region_is_ram(section->mr);
|
|
|
|
is_romd = memory_region_is_romd(section->mr);
|
|
|
|
|
|
|
|
if (is_ram || is_romd) {
|
|
|
|
/* RAM and ROMD both have associated host memory. */
|
|
|
|
addend = (uintptr_t)memory_region_get_ram_ptr(section->mr) + xlat;
|
|
|
|
} else {
|
|
|
|
/* I/O does not; force the host address to NULL. */
|
2013-05-24 16:45:30 +02:00
|
|
|
addend = 0;
|
2019-09-20 06:09:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
write_address = address;
|
|
|
|
if (is_ram) {
|
|
|
|
iotlb = memory_region_get_ram_addr(section->mr) + xlat;
|
|
|
|
/*
|
|
|
|
* Computing is_clean is expensive; avoid all that unless
|
|
|
|
* the page is actually writable.
|
|
|
|
*/
|
|
|
|
if (prot & PAGE_WRITE) {
|
|
|
|
if (section->readonly) {
|
|
|
|
write_address |= TLB_DISCARD_WRITE;
|
|
|
|
} else if (cpu_physical_memory_is_clean(iotlb)) {
|
|
|
|
write_address |= TLB_NOTDIRTY;
|
|
|
|
}
|
|
|
|
}
|
2013-05-24 16:45:30 +02:00
|
|
|
} else {
|
2019-09-20 06:09:58 +02:00
|
|
|
/* I/O or ROMD */
|
|
|
|
iotlb = memory_region_section_get_iotlb(cpu, section) + xlat;
|
|
|
|
/*
|
|
|
|
* Writes to romd devices must go through MMIO to enable write.
|
|
|
|
* Reads to romd devices go through the ram_ptr found above,
|
|
|
|
* but of course reads to I/O must go through MMIO.
|
|
|
|
*/
|
|
|
|
write_address |= TLB_MMIO;
|
|
|
|
if (!is_romd) {
|
|
|
|
address = write_address;
|
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
2019-08-24 18:51:09 +02:00
|
|
|
wp_flags = cpu_watchpoint_address_matches(cpu, vaddr_page,
|
|
|
|
TARGET_PAGE_SIZE);
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2018-10-09 19:51:25 +02:00
|
|
|
index = tlb_index(env, mmu_idx, vaddr_page);
|
|
|
|
te = tlb_entry(env, mmu_idx, vaddr_page);
|
2017-02-23 19:29:21 +01:00
|
|
|
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
/*
|
|
|
|
* Hold the TLB lock for the rest of the function. We could acquire/release
|
|
|
|
* the lock several times in the function, but it is faster to amortize the
|
|
|
|
* acquisition cost by acquiring it just once. Note that this leads to
|
|
|
|
* a longer critical section, but this is not a concern since the TLB lock
|
|
|
|
* is unlikely to be contended.
|
|
|
|
*/
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&tlb->c.lock);
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
|
2018-10-20 21:04:57 +02:00
|
|
|
/* Note that the tlb is no longer clean. */
|
2019-03-22 21:52:09 +01:00
|
|
|
tlb->c.dirty |= 1 << mmu_idx;
|
2018-10-20 21:04:57 +02:00
|
|
|
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
/* Make sure there's no cached translation for the new page. */
|
|
|
|
tlb_flush_vtlb_page_locked(env, mmu_idx, vaddr_page);
|
|
|
|
|
2018-06-29 22:07:08 +02:00
|
|
|
/*
|
|
|
|
* Only evict the old entry to the victim tlb if it's for a
|
|
|
|
* different page; otherwise just overwrite the stale data.
|
|
|
|
*/
|
2019-01-16 18:01:12 +01:00
|
|
|
if (!tlb_hit_page_anyprot(te, vaddr_page) && !tlb_entry_is_empty(te)) {
|
2019-03-22 21:52:09 +01:00
|
|
|
unsigned vidx = desc->vindex++ % CPU_VTLB_SIZE;
|
|
|
|
CPUTLBEntry *tv = &desc->vtable[vidx];
|
2017-02-23 19:29:21 +01:00
|
|
|
|
2018-06-29 22:07:08 +02:00
|
|
|
/* Evict the old entry into the victim tlb. */
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
copy_tlb_helper_locked(tv, te);
|
2019-03-22 21:52:09 +01:00
|
|
|
desc->viotlb[vidx] = desc->iotlb[index];
|
2019-01-16 18:01:13 +01:00
|
|
|
tlb_n_used_entries_dec(env, mmu_idx);
|
2018-06-29 22:07:08 +02:00
|
|
|
}
|
implementing victim TLB for QEMU system emulated TLB
QEMU system mode page table walks are expensive. Taken by running QEMU
qemu-system-x86_64 system mode on Intel PIN , a TLB miss and walking a
4-level page tables in guest Linux OS takes ~450 X86 instructions on
average.
QEMU system mode TLB is implemented using a directly-mapped hashtable.
This structure suffers from conflict misses. Increasing the
associativity of the TLB may not be the solution to conflict misses as
all the ways may have to be walked in serial.
A victim TLB is a TLB used to hold translations evicted from the
primary TLB upon replacement. The victim TLB lies between the main TLB
and its refill path. Victim TLB is of greater associativity (fully
associative in this patch). It takes longer to lookup the victim TLB,
but its likely better than a full page table walk. The memory
translation path is changed as follows :
Before Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. TLB refill.
5. Do the memory access.
6. Return to code cache.
After Victim TLB:
1. Inline TLB lookup
2. Exit code cache on TLB miss.
3. Check for unaligned, IO accesses
4. Victim TLB lookup.
5. If victim TLB misses, TLB refill
6. Do the memory access.
7. Return to code cache
The advantage is that victim TLB can offer more associativity to a
directly mapped TLB and thus potentially fewer page table walks while
still keeping the time taken to flush within reasonable limits.
However, placing a victim TLB before the refill path increase TLB
refill path as the victim TLB is consulted before the TLB refill. The
performance results demonstrate that the pros outweigh the cons.
some performance results taken on SPECINT2006 train
datasets and kernel boot and qemu configure script on an
Intel(R) Xeon(R) CPU E5620 @ 2.40GHz Linux machine are shown in the
Google Doc link below.
https://docs.google.com/spreadsheets/d/1eiItzekZwNQOal_h-5iJmC4tMDi051m9qidi5_nwvH4/edit?usp=sharing
In summary, victim TLB improves the performance of qemu-system-x86_64 by
11% on average on SPECINT2006, kernelboot and qemu configscript and with
highest improvement of in 26% in 456.hmmer. And victim TLB does not result
in any performance degradation in any of the measured benchmarks. Furthermore,
the implemented victim TLB is architecture independent and is expected to
benefit other architectures in QEMU as well.
Although there are measurement fluctuations, the performance
improvement is very significant and by no means in the range of
noises.
Signed-off-by: Xin Tong <trent.tong@gmail.com>
Message-id: 1407202523-23553-1-git-send-email-trent.tong@gmail.com
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Signed-off-by: Peter Maydell <peter.maydell@linaro.org>
2014-08-05 03:35:23 +02:00
|
|
|
|
|
|
|
/* refill the tlb */
|
2018-06-15 15:57:14 +02:00
|
|
|
/*
|
|
|
|
* At this point iotlb contains a physical section number in the lower
|
|
|
|
* TARGET_PAGE_BITS, and either
|
2019-09-20 06:09:58 +02:00
|
|
|
* + the ram_addr_t of the page base of the target RAM (RAM)
|
|
|
|
* + the offset within section->mr of the page base (I/O, ROMD)
|
2018-06-26 18:50:41 +02:00
|
|
|
* We subtract the vaddr_page (which is page aligned and thus won't
|
2018-06-15 15:57:14 +02:00
|
|
|
* disturb the low bits) to give an offset which can be added to the
|
|
|
|
* (non-page-aligned) vaddr of the eventual memory access to get
|
|
|
|
* the MemoryRegion offset for the access. Note that the vaddr we
|
|
|
|
* subtract here is that of the page base, and not the same as the
|
|
|
|
* vaddr we add back in io_readx()/io_writex()/get_page_addr_code().
|
|
|
|
*/
|
2019-03-22 21:52:09 +01:00
|
|
|
desc->iotlb[index].addr = iotlb - vaddr_page;
|
|
|
|
desc->iotlb[index].attrs = attrs;
|
2017-02-23 19:29:21 +01:00
|
|
|
|
|
|
|
/* Now calculate the new entry */
|
2018-06-26 18:50:41 +02:00
|
|
|
tn.addend = addend - vaddr_page;
|
2012-04-09 18:50:52 +02:00
|
|
|
if (prot & PAGE_READ) {
|
2017-02-23 19:29:21 +01:00
|
|
|
tn.addr_read = address;
|
2019-08-24 18:51:09 +02:00
|
|
|
if (wp_flags & BP_MEM_READ) {
|
|
|
|
tn.addr_read |= TLB_WATCHPOINT;
|
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
} else {
|
2017-02-23 19:29:21 +01:00
|
|
|
tn.addr_read = -1;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (prot & PAGE_EXEC) {
|
2019-09-20 06:09:58 +02:00
|
|
|
tn.addr_code = address;
|
2012-04-09 18:50:52 +02:00
|
|
|
} else {
|
2017-02-23 19:29:21 +01:00
|
|
|
tn.addr_code = -1;
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
2017-02-23 19:29:21 +01:00
|
|
|
|
|
|
|
tn.addr_write = -1;
|
2012-04-09 18:50:52 +02:00
|
|
|
if (prot & PAGE_WRITE) {
|
2019-09-20 06:09:58 +02:00
|
|
|
tn.addr_write = write_address;
|
2017-10-16 22:23:57 +02:00
|
|
|
if (prot & PAGE_WRITE_INV) {
|
|
|
|
tn.addr_write |= TLB_INVALID_MASK;
|
|
|
|
}
|
2019-08-24 18:51:09 +02:00
|
|
|
if (wp_flags & BP_MEM_WRITE) {
|
|
|
|
tn.addr_write |= TLB_WATCHPOINT;
|
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
2017-02-23 19:29:21 +01:00
|
|
|
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
copy_tlb_helper_locked(te, &tn);
|
2019-01-16 18:01:13 +01:00
|
|
|
tlb_n_used_entries_inc(env, mmu_idx);
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&tlb->c.lock);
|
2012-04-09 18:50:52 +02:00
|
|
|
}
|
|
|
|
|
2015-04-26 17:49:24 +02:00
|
|
|
/* Add a new TLB entry, but without specifying the memory
|
|
|
|
* transaction attributes to be used.
|
|
|
|
*/
|
|
|
|
void tlb_set_page(CPUState *cpu, target_ulong vaddr,
|
|
|
|
hwaddr paddr, int prot,
|
|
|
|
int mmu_idx, target_ulong size)
|
|
|
|
{
|
|
|
|
tlb_set_page_with_attrs(cpu, vaddr, paddr, MEMTXATTRS_UNSPECIFIED,
|
|
|
|
prot, mmu_idx, size);
|
|
|
|
}
|
|
|
|
|
2017-02-23 19:29:17 +01:00
|
|
|
static inline ram_addr_t qemu_ram_addr_from_host_nofail(void *ptr)
|
|
|
|
{
|
|
|
|
ram_addr_t ram_addr;
|
|
|
|
|
|
|
|
ram_addr = qemu_ram_addr_from_host(ptr);
|
|
|
|
if (ram_addr == RAM_ADDR_INVALID) {
|
|
|
|
error_report("Bad ram pointer %p", ptr);
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
return ram_addr;
|
|
|
|
}
|
|
|
|
|
2019-04-03 04:07:11 +02:00
|
|
|
/*
|
|
|
|
* Note: tlb_fill() can trigger a resize of the TLB. This means that all of the
|
|
|
|
* caller's prior references to the TLB table (e.g. CPUTLBEntry pointers) must
|
|
|
|
* be discarded and looked up again (e.g. via tlb_entry()).
|
|
|
|
*/
|
|
|
|
static void tlb_fill(CPUState *cpu, target_ulong addr, int size,
|
|
|
|
MMUAccessType access_type, int mmu_idx, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
|
|
|
bool ok;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is not a probe, so only valid return is success; failure
|
|
|
|
* should result in exception + longjmp to the cpu loop.
|
|
|
|
*/
|
2021-02-04 17:39:23 +01:00
|
|
|
ok = cc->tcg_ops->tlb_fill(cpu, addr, size,
|
|
|
|
access_type, mmu_idx, false, retaddr);
|
2019-04-03 04:07:11 +02:00
|
|
|
assert(ok);
|
|
|
|
}
|
|
|
|
|
2021-02-04 17:39:23 +01:00
|
|
|
static inline void cpu_unaligned_access(CPUState *cpu, vaddr addr,
|
|
|
|
MMUAccessType access_type,
|
|
|
|
int mmu_idx, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
|
|
|
|
|
|
|
cc->tcg_ops->do_unaligned_access(cpu, addr, access_type, mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void cpu_transaction_failed(CPUState *cpu, hwaddr physaddr,
|
|
|
|
vaddr addr, unsigned size,
|
|
|
|
MMUAccessType access_type,
|
|
|
|
int mmu_idx, MemTxAttrs attrs,
|
|
|
|
MemTxResult response,
|
|
|
|
uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
|
|
|
|
|
|
|
if (!cpu->ignore_memory_transaction_failures &&
|
|
|
|
cc->tcg_ops->do_transaction_failed) {
|
|
|
|
cc->tcg_ops->do_transaction_failed(cpu, physaddr, addr, size,
|
|
|
|
access_type, mmu_idx, attrs,
|
|
|
|
response, retaddr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-07-09 03:51:28 +02:00
|
|
|
static uint64_t io_readx(CPUArchState *env, CPUIOTLBEntry *iotlbentry,
|
2019-04-25 23:16:34 +02:00
|
|
|
int mmu_idx, target_ulong addr, uintptr_t retaddr,
|
2019-08-23 20:36:53 +02:00
|
|
|
MMUAccessType access_type, MemOp op)
|
2016-07-09 03:51:28 +02:00
|
|
|
{
|
2019-03-23 00:07:18 +01:00
|
|
|
CPUState *cpu = env_cpu(env);
|
2018-06-15 15:57:14 +02:00
|
|
|
hwaddr mr_offset;
|
|
|
|
MemoryRegionSection *section;
|
|
|
|
MemoryRegion *mr;
|
2016-07-09 03:51:28 +02:00
|
|
|
uint64_t val;
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
bool locked = false;
|
2017-09-04 16:21:55 +02:00
|
|
|
MemTxResult r;
|
2016-07-09 03:51:28 +02:00
|
|
|
|
2018-06-15 15:57:14 +02:00
|
|
|
section = iotlb_to_section(cpu, iotlbentry->addr, iotlbentry->attrs);
|
|
|
|
mr = section->mr;
|
|
|
|
mr_offset = (iotlbentry->addr & TARGET_PAGE_MASK) + addr;
|
2016-07-09 03:51:28 +02:00
|
|
|
cpu->mem_io_pc = retaddr;
|
2019-09-18 18:15:44 +02:00
|
|
|
if (!cpu->can_do_io) {
|
2016-07-09 03:51:28 +02:00
|
|
|
cpu_io_recompile(cpu, retaddr);
|
|
|
|
}
|
|
|
|
|
2020-08-06 17:07:26 +02:00
|
|
|
if (!qemu_mutex_iothread_locked()) {
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
qemu_mutex_lock_iothread();
|
|
|
|
locked = true;
|
|
|
|
}
|
2019-08-23 20:36:53 +02:00
|
|
|
r = memory_region_dispatch_read(mr, mr_offset, &val, op, iotlbentry->attrs);
|
2017-09-04 16:21:55 +02:00
|
|
|
if (r != MEMTX_OK) {
|
2018-06-15 15:57:14 +02:00
|
|
|
hwaddr physaddr = mr_offset +
|
|
|
|
section->offset_within_address_space -
|
|
|
|
section->offset_within_region;
|
|
|
|
|
2019-08-23 20:36:53 +02:00
|
|
|
cpu_transaction_failed(cpu, physaddr, addr, memop_size(op), access_type,
|
2017-09-04 16:21:55 +02:00
|
|
|
mmu_idx, iotlbentry->attrs, r, retaddr);
|
|
|
|
}
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
if (locked) {
|
|
|
|
qemu_mutex_unlock_iothread();
|
|
|
|
}
|
|
|
|
|
2016-07-09 03:51:28 +02:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
2020-07-13 22:04:10 +02:00
|
|
|
/*
|
|
|
|
* Save a potentially trashed IOTLB entry for later lookup by plugin.
|
2020-07-20 14:23:58 +02:00
|
|
|
* This is read by tlb_plugin_lookup if the iotlb entry doesn't match
|
|
|
|
* because of the side effect of io_writex changing memory layout.
|
2020-07-13 22:04:10 +02:00
|
|
|
*/
|
|
|
|
static void save_iotlb_data(CPUState *cs, hwaddr addr,
|
|
|
|
MemoryRegionSection *section, hwaddr mr_offset)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_PLUGIN
|
|
|
|
SavedIOTLB *saved = &cs->saved_iotlb;
|
|
|
|
saved->addr = addr;
|
|
|
|
saved->section = section;
|
|
|
|
saved->mr_offset = mr_offset;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2016-07-09 03:51:28 +02:00
|
|
|
static void io_writex(CPUArchState *env, CPUIOTLBEntry *iotlbentry,
|
2019-04-25 23:16:34 +02:00
|
|
|
int mmu_idx, uint64_t val, target_ulong addr,
|
2019-08-23 20:36:53 +02:00
|
|
|
uintptr_t retaddr, MemOp op)
|
2016-07-09 03:51:28 +02:00
|
|
|
{
|
2019-03-23 00:07:18 +01:00
|
|
|
CPUState *cpu = env_cpu(env);
|
2018-06-15 15:57:14 +02:00
|
|
|
hwaddr mr_offset;
|
|
|
|
MemoryRegionSection *section;
|
|
|
|
MemoryRegion *mr;
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
bool locked = false;
|
2017-09-04 16:21:55 +02:00
|
|
|
MemTxResult r;
|
2016-07-09 03:51:28 +02:00
|
|
|
|
2018-06-15 15:57:14 +02:00
|
|
|
section = iotlb_to_section(cpu, iotlbentry->addr, iotlbentry->attrs);
|
|
|
|
mr = section->mr;
|
|
|
|
mr_offset = (iotlbentry->addr & TARGET_PAGE_MASK) + addr;
|
2019-09-18 18:15:44 +02:00
|
|
|
if (!cpu->can_do_io) {
|
2016-07-09 03:51:28 +02:00
|
|
|
cpu_io_recompile(cpu, retaddr);
|
|
|
|
}
|
|
|
|
cpu->mem_io_pc = retaddr;
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
|
2020-07-13 22:04:10 +02:00
|
|
|
/*
|
|
|
|
* The memory_region_dispatch may trigger a flush/resize
|
|
|
|
* so for plugins we save the iotlb_data just in case.
|
|
|
|
*/
|
|
|
|
save_iotlb_data(cpu, iotlbentry->addr, section, mr_offset);
|
|
|
|
|
2020-08-06 17:07:26 +02:00
|
|
|
if (!qemu_mutex_iothread_locked()) {
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
qemu_mutex_lock_iothread();
|
|
|
|
locked = true;
|
|
|
|
}
|
2019-08-23 20:36:53 +02:00
|
|
|
r = memory_region_dispatch_write(mr, mr_offset, val, op, iotlbentry->attrs);
|
2017-09-04 16:21:55 +02:00
|
|
|
if (r != MEMTX_OK) {
|
2018-06-15 15:57:14 +02:00
|
|
|
hwaddr physaddr = mr_offset +
|
|
|
|
section->offset_within_address_space -
|
|
|
|
section->offset_within_region;
|
|
|
|
|
2019-08-23 20:36:53 +02:00
|
|
|
cpu_transaction_failed(cpu, physaddr, addr, memop_size(op),
|
|
|
|
MMU_DATA_STORE, mmu_idx, iotlbentry->attrs, r,
|
|
|
|
retaddr);
|
2017-09-04 16:21:55 +02:00
|
|
|
}
|
tcg: drop global lock during TCG code execution
This finally allows TCG to benefit from the iothread introduction: Drop
the global mutex while running pure TCG CPU code. Reacquire the lock
when entering MMIO or PIO emulation, or when leaving the TCG loop.
We have to revert a few optimization for the current TCG threading
model, namely kicking the TCG thread in qemu_mutex_lock_iothread and not
kicking it in qemu_cpu_kick. We also need to disable RAM block
reordering until we have a more efficient locking mechanism at hand.
Still, a Linux x86 UP guest and my Musicpal ARM model boot fine here.
These numbers demonstrate where we gain something:
20338 jan 20 0 331m 75m 6904 R 99 0.9 0:50.95 qemu-system-arm
20337 jan 20 0 331m 75m 6904 S 20 0.9 0:26.50 qemu-system-arm
The guest CPU was fully loaded, but the iothread could still run mostly
independent on a second core. Without the patch we don't get beyond
32206 jan 20 0 330m 73m 7036 R 82 0.9 1:06.00 qemu-system-arm
32204 jan 20 0 330m 73m 7036 S 21 0.9 0:17.03 qemu-system-arm
We don't benefit significantly, though, when the guest is not fully
loading a host CPU.
Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com>
Message-Id: <1439220437-23957-10-git-send-email-fred.konrad@greensocs.com>
[FK: Rebase, fix qemu_devices_reset deadlock, rm address_space_* mutex]
Signed-off-by: KONRAD Frederic <fred.konrad@greensocs.com>
[EGC: fixed iothread lock for cpu-exec IRQ handling]
Signed-off-by: Emilio G. Cota <cota@braap.org>
[AJB: -smp single-threaded fix, clean commit msg, BQL fixes]
Signed-off-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Pranith Kumar <bobby.prani@gmail.com>
[PM: target-arm changes]
Acked-by: Peter Maydell <peter.maydell@linaro.org>
2017-02-23 19:29:11 +01:00
|
|
|
if (locked) {
|
|
|
|
qemu_mutex_unlock_iothread();
|
|
|
|
}
|
2016-07-09 03:51:28 +02:00
|
|
|
}
|
|
|
|
|
2019-04-03 05:16:56 +02:00
|
|
|
static inline target_ulong tlb_read_ofs(CPUTLBEntry *entry, size_t ofs)
|
|
|
|
{
|
|
|
|
#if TCG_OVERSIZED_GUEST
|
|
|
|
return *(target_ulong *)((uintptr_t)entry + ofs);
|
|
|
|
#else
|
2020-09-23 12:56:46 +02:00
|
|
|
/* ofs might correspond to .addr_write, so use qatomic_read */
|
|
|
|
return qatomic_read((target_ulong *)((uintptr_t)entry + ofs));
|
2019-04-03 05:16:56 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2016-07-08 21:19:32 +02:00
|
|
|
/* Return true if ADDR is present in the victim tlb, and has been copied
|
|
|
|
back to the main tlb. */
|
|
|
|
static bool victim_tlb_hit(CPUArchState *env, size_t mmu_idx, size_t index,
|
|
|
|
size_t elt_ofs, target_ulong page)
|
|
|
|
{
|
|
|
|
size_t vidx;
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
|
2019-03-23 00:07:18 +01:00
|
|
|
assert_cpu_is_self(env_cpu(env));
|
2016-07-08 21:19:32 +02:00
|
|
|
for (vidx = 0; vidx < CPU_VTLB_SIZE; ++vidx) {
|
2019-03-22 21:52:09 +01:00
|
|
|
CPUTLBEntry *vtlb = &env_tlb(env)->d[mmu_idx].vtable[vidx];
|
|
|
|
target_ulong cmp;
|
|
|
|
|
2020-09-23 12:56:46 +02:00
|
|
|
/* elt_ofs might correspond to .addr_write, so use qatomic_read */
|
2019-03-22 21:52:09 +01:00
|
|
|
#if TCG_OVERSIZED_GUEST
|
|
|
|
cmp = *(target_ulong *)((uintptr_t)vtlb + elt_ofs);
|
|
|
|
#else
|
2020-09-23 12:56:46 +02:00
|
|
|
cmp = qatomic_read((target_ulong *)((uintptr_t)vtlb + elt_ofs));
|
2019-03-22 21:52:09 +01:00
|
|
|
#endif
|
2016-07-08 21:19:32 +02:00
|
|
|
|
|
|
|
if (cmp == page) {
|
|
|
|
/* Found entry in victim tlb, swap tlb and iotlb. */
|
2019-03-22 21:52:09 +01:00
|
|
|
CPUTLBEntry tmptlb, *tlb = &env_tlb(env)->f[mmu_idx].table[index];
|
2017-02-23 19:29:21 +01:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_lock(&env_tlb(env)->c.lock);
|
cputlb: serialize tlb updates with env->tlb_lock
Currently we rely on atomic operations for cross-CPU invalidations.
There are two cases that these atomics miss: cross-CPU invalidations
can race with either (1) vCPU threads flushing their TLB, which
happens via memset, or (2) vCPUs calling tlb_reset_dirty on their TLB,
which updates .addr_write with a regular store. This results in
undefined behaviour, since we're mixing regular and atomic ops
on concurrent accesses.
Fix it by using tlb_lock, a per-vCPU lock. All updaters of tlb_table
and the corresponding victim cache now hold the lock.
The readers that do not hold tlb_lock must use atomic reads when
reading .addr_write, since this field can be updated by other threads;
the conversion to atomic reads is done in the next patch.
Note that an alternative fix would be to expand the use of atomic ops.
However, in the case of TLB flushes this would have a huge performance
impact, since (1) TLB flushes can happen very frequently and (2) we
currently use a full memory barrier to flush each TLB entry, and a TLB
has many entries. Instead, acquiring the lock is barely slower than a
full memory barrier since it is uncontended, and with a single lock
acquisition we can flush the entire TLB.
Tested-by: Alex Bennée <alex.bennee@linaro.org>
Reviewed-by: Alex Bennée <alex.bennee@linaro.org>
Signed-off-by: Emilio G. Cota <cota@braap.org>
Message-Id: <20181009174557.16125-6-cota@braap.org>
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
2018-10-09 19:45:56 +02:00
|
|
|
copy_tlb_helper_locked(&tmptlb, tlb);
|
|
|
|
copy_tlb_helper_locked(tlb, vtlb);
|
|
|
|
copy_tlb_helper_locked(vtlb, &tmptlb);
|
2019-03-22 21:52:09 +01:00
|
|
|
qemu_spin_unlock(&env_tlb(env)->c.lock);
|
2017-02-23 19:29:21 +01:00
|
|
|
|
2019-03-22 21:52:09 +01:00
|
|
|
CPUIOTLBEntry tmpio, *io = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
|
|
|
CPUIOTLBEntry *vio = &env_tlb(env)->d[mmu_idx].viotlb[vidx];
|
2016-07-08 21:19:32 +02:00
|
|
|
tmpio = *io; *io = *vio; *vio = tmpio;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Macro to call the above, with local variables from the use context. */
|
2016-07-06 20:26:52 +02:00
|
|
|
#define VICTIM_TLB_HIT(TY, ADDR) \
|
2016-07-08 21:19:32 +02:00
|
|
|
victim_tlb_hit(env, mmu_idx, index, offsetof(CPUTLBEntry, TY), \
|
2016-07-06 20:26:52 +02:00
|
|
|
(ADDR) & TARGET_PAGE_MASK)
|
2016-07-08 21:19:32 +02:00
|
|
|
|
2019-08-24 00:12:32 +02:00
|
|
|
/*
|
|
|
|
* Return a ram_addr_t for the virtual address for execution.
|
|
|
|
*
|
|
|
|
* Return -1 if we can't translate and execute from an entire page
|
|
|
|
* of RAM. This will force us to execute by loading and translating
|
|
|
|
* one insn at a time, without caching.
|
|
|
|
*
|
|
|
|
* NOTE: This function will trigger an exception if the page is
|
|
|
|
* not executable.
|
2017-02-03 16:29:50 +01:00
|
|
|
*/
|
2018-11-03 22:40:22 +01:00
|
|
|
tb_page_addr_t get_page_addr_code_hostp(CPUArchState *env, target_ulong addr,
|
|
|
|
void **hostp)
|
2017-02-03 16:29:50 +01:00
|
|
|
{
|
2018-10-09 19:51:25 +02:00
|
|
|
uintptr_t mmu_idx = cpu_mmu_index(env, true);
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
CPUTLBEntry *entry = tlb_entry(env, mmu_idx, addr);
|
2017-02-03 16:29:50 +01:00
|
|
|
void *p;
|
|
|
|
|
2018-10-09 19:51:25 +02:00
|
|
|
if (unlikely(!tlb_hit(entry->addr_code, addr))) {
|
2018-07-13 16:16:35 +02:00
|
|
|
if (!VICTIM_TLB_HIT(addr_code, addr)) {
|
2019-03-23 00:07:18 +01:00
|
|
|
tlb_fill(env_cpu(env), addr, 0, MMU_INST_FETCH, mmu_idx, 0);
|
2019-02-09 17:27:45 +01:00
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
entry = tlb_entry(env, mmu_idx, addr);
|
2019-08-24 00:12:32 +02:00
|
|
|
|
|
|
|
if (unlikely(entry->addr_code & TLB_INVALID_MASK)) {
|
|
|
|
/*
|
|
|
|
* The MMU protection covers a smaller range than a target
|
|
|
|
* page, so we must redo the MMU check for every insn.
|
|
|
|
*/
|
|
|
|
return -1;
|
|
|
|
}
|
2017-02-03 16:32:12 +01:00
|
|
|
}
|
2018-10-09 19:51:25 +02:00
|
|
|
assert(tlb_hit(entry->addr_code, addr));
|
2017-02-03 16:29:50 +01:00
|
|
|
}
|
2018-06-26 18:50:41 +02:00
|
|
|
|
2019-08-24 00:12:32 +02:00
|
|
|
if (unlikely(entry->addr_code & TLB_MMIO)) {
|
|
|
|
/* The region is not backed by RAM. */
|
2018-11-03 22:40:22 +01:00
|
|
|
if (hostp) {
|
|
|
|
*hostp = NULL;
|
|
|
|
}
|
2018-08-14 18:17:19 +02:00
|
|
|
return -1;
|
2018-06-26 18:50:41 +02:00
|
|
|
}
|
|
|
|
|
2018-10-09 19:51:25 +02:00
|
|
|
p = (void *)((uintptr_t)addr + entry->addend);
|
2018-11-03 22:40:22 +01:00
|
|
|
if (hostp) {
|
|
|
|
*hostp = p;
|
|
|
|
}
|
2017-02-03 16:29:50 +01:00
|
|
|
return qemu_ram_addr_from_host_nofail(p);
|
|
|
|
}
|
|
|
|
|
2018-11-03 22:40:22 +01:00
|
|
|
tb_page_addr_t get_page_addr_code(CPUArchState *env, target_ulong addr)
|
|
|
|
{
|
|
|
|
return get_page_addr_code_hostp(env, addr, NULL);
|
|
|
|
}
|
|
|
|
|
2019-09-22 03:47:59 +02:00
|
|
|
static void notdirty_write(CPUState *cpu, vaddr mem_vaddr, unsigned size,
|
|
|
|
CPUIOTLBEntry *iotlbentry, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
ram_addr_t ram_addr = mem_vaddr + iotlbentry->addr;
|
|
|
|
|
|
|
|
trace_memory_notdirty_write_access(mem_vaddr, ram_addr, size);
|
|
|
|
|
|
|
|
if (!cpu_physical_memory_get_dirty_flag(ram_addr, DIRTY_MEMORY_CODE)) {
|
|
|
|
struct page_collection *pages
|
|
|
|
= page_collection_lock(ram_addr, ram_addr + size);
|
2019-09-22 05:16:09 +02:00
|
|
|
tb_invalidate_phys_page_fast(pages, ram_addr, size, retaddr);
|
2019-09-22 03:47:59 +02:00
|
|
|
page_collection_unlock(pages);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set both VGA and migration bits for simplicity and to remove
|
|
|
|
* the notdirty callback faster.
|
|
|
|
*/
|
|
|
|
cpu_physical_memory_set_dirty_range(ram_addr, size, DIRTY_CLIENTS_NOCODE);
|
|
|
|
|
|
|
|
/* We remove the notdirty callback only if the code has been flushed. */
|
|
|
|
if (!cpu_physical_memory_is_clean(ram_addr)) {
|
|
|
|
trace_memory_notdirty_set_dirty(mem_vaddr);
|
|
|
|
tlb_set_dirty(cpu, mem_vaddr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
static int probe_access_internal(CPUArchState *env, target_ulong addr,
|
|
|
|
int fault_size, MMUAccessType access_type,
|
|
|
|
int mmu_idx, bool nonfault,
|
|
|
|
void **phost, uintptr_t retaddr)
|
2016-07-09 03:22:26 +02:00
|
|
|
{
|
2018-10-09 19:51:25 +02:00
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
CPUTLBEntry *entry = tlb_entry(env, mmu_idx, addr);
|
2020-05-08 17:43:45 +02:00
|
|
|
target_ulong tlb_addr, page_addr;
|
2019-08-30 12:09:59 +02:00
|
|
|
size_t elt_ofs;
|
2020-05-08 17:43:45 +02:00
|
|
|
int flags;
|
2019-08-26 09:51:09 +02:00
|
|
|
|
2019-08-30 12:09:59 +02:00
|
|
|
switch (access_type) {
|
|
|
|
case MMU_DATA_LOAD:
|
|
|
|
elt_ofs = offsetof(CPUTLBEntry, addr_read);
|
|
|
|
break;
|
|
|
|
case MMU_DATA_STORE:
|
|
|
|
elt_ofs = offsetof(CPUTLBEntry, addr_write);
|
|
|
|
break;
|
|
|
|
case MMU_INST_FETCH:
|
|
|
|
elt_ofs = offsetof(CPUTLBEntry, addr_code);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
g_assert_not_reached();
|
|
|
|
}
|
|
|
|
tlb_addr = tlb_read_ofs(entry, elt_ofs);
|
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
page_addr = addr & TARGET_PAGE_MASK;
|
|
|
|
if (!tlb_hit_page(tlb_addr, page_addr)) {
|
|
|
|
if (!victim_tlb_hit(env, mmu_idx, index, elt_ofs, page_addr)) {
|
|
|
|
CPUState *cs = env_cpu(env);
|
|
|
|
CPUClass *cc = CPU_GET_CLASS(cs);
|
|
|
|
|
2021-02-04 17:39:23 +01:00
|
|
|
if (!cc->tcg_ops->tlb_fill(cs, addr, fault_size, access_type,
|
|
|
|
mmu_idx, nonfault, retaddr)) {
|
2020-05-08 17:43:45 +02:00
|
|
|
/* Non-faulting page table read failed. */
|
|
|
|
*phost = NULL;
|
|
|
|
return TLB_INVALID_MASK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TLB resize via tlb_fill may have moved the entry. */
|
2019-08-23 12:07:41 +02:00
|
|
|
entry = tlb_entry(env, mmu_idx, addr);
|
2016-07-09 03:22:26 +02:00
|
|
|
}
|
2019-08-30 12:09:59 +02:00
|
|
|
tlb_addr = tlb_read_ofs(entry, elt_ofs);
|
2019-08-23 12:07:41 +02:00
|
|
|
}
|
2020-05-08 17:43:45 +02:00
|
|
|
flags = tlb_addr & TLB_FLAGS_MASK;
|
2019-08-23 12:07:41 +02:00
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
/* Fold all "mmio-like" bits into TLB_MMIO. This is not RAM. */
|
|
|
|
if (unlikely(flags & ~(TLB_WATCHPOINT | TLB_NOTDIRTY))) {
|
|
|
|
*phost = NULL;
|
|
|
|
return TLB_MMIO;
|
2019-08-30 12:09:58 +02:00
|
|
|
}
|
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
/* Everything else is RAM. */
|
|
|
|
*phost = (void *)((uintptr_t)addr + entry->addend);
|
|
|
|
return flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
int probe_access_flags(CPUArchState *env, target_ulong addr,
|
|
|
|
MMUAccessType access_type, int mmu_idx,
|
|
|
|
bool nonfault, void **phost, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
int flags;
|
|
|
|
|
|
|
|
flags = probe_access_internal(env, addr, 0, access_type, mmu_idx,
|
|
|
|
nonfault, phost, retaddr);
|
|
|
|
|
|
|
|
/* Handle clean RAM pages. */
|
|
|
|
if (unlikely(flags & TLB_NOTDIRTY)) {
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
2019-09-22 04:28:48 +02:00
|
|
|
CPUIOTLBEntry *iotlbentry = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
2019-08-30 12:09:58 +02:00
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
notdirty_write(env_cpu(env), addr, 1, iotlbentry, retaddr);
|
|
|
|
flags &= ~TLB_NOTDIRTY;
|
|
|
|
}
|
|
|
|
|
|
|
|
return flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *probe_access(CPUArchState *env, target_ulong addr, int size,
|
|
|
|
MMUAccessType access_type, int mmu_idx, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
void *host;
|
|
|
|
int flags;
|
|
|
|
|
|
|
|
g_assert(-(addr | TARGET_PAGE_MASK) >= size);
|
|
|
|
|
|
|
|
flags = probe_access_internal(env, addr, size, access_type, mmu_idx,
|
|
|
|
false, &host, retaddr);
|
|
|
|
|
|
|
|
/* Per the interface, size == 0 merely faults the access. */
|
|
|
|
if (size == 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (unlikely(flags & (TLB_NOTDIRTY | TLB_WATCHPOINT))) {
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
CPUIOTLBEntry *iotlbentry = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
2019-09-22 04:28:48 +02:00
|
|
|
|
|
|
|
/* Handle watchpoints. */
|
2020-05-08 17:43:45 +02:00
|
|
|
if (flags & TLB_WATCHPOINT) {
|
|
|
|
int wp_access = (access_type == MMU_DATA_STORE
|
|
|
|
? BP_MEM_WRITE : BP_MEM_READ);
|
2019-09-22 04:28:48 +02:00
|
|
|
cpu_check_watchpoint(env_cpu(env), addr, size,
|
|
|
|
iotlbentry->attrs, wp_access, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle clean RAM pages. */
|
2020-05-08 17:43:45 +02:00
|
|
|
if (flags & TLB_NOTDIRTY) {
|
|
|
|
notdirty_write(env_cpu(env), addr, 1, iotlbentry, retaddr);
|
2019-09-22 04:28:48 +02:00
|
|
|
}
|
2019-08-30 12:09:58 +02:00
|
|
|
}
|
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
return host;
|
2016-07-09 03:22:26 +02:00
|
|
|
}
|
|
|
|
|
2019-04-03 05:16:56 +02:00
|
|
|
void *tlb_vaddr_to_host(CPUArchState *env, abi_ptr addr,
|
|
|
|
MMUAccessType access_type, int mmu_idx)
|
|
|
|
{
|
2020-05-08 17:43:45 +02:00
|
|
|
void *host;
|
|
|
|
int flags;
|
2019-04-03 05:16:56 +02:00
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
flags = probe_access_internal(env, addr, 0, access_type,
|
|
|
|
mmu_idx, true, &host, 0);
|
2019-04-03 05:16:56 +02:00
|
|
|
|
2020-05-08 17:43:45 +02:00
|
|
|
/* No combination of flags are expected by the caller. */
|
|
|
|
return flags ? NULL : host;
|
2019-04-03 05:16:56 +02:00
|
|
|
}
|
|
|
|
|
2019-06-19 21:20:08 +02:00
|
|
|
#ifdef CONFIG_PLUGIN
|
|
|
|
/*
|
|
|
|
* Perform a TLB lookup and populate the qemu_plugin_hwaddr structure.
|
|
|
|
* This should be a hot path as we will have just looked this path up
|
|
|
|
* in the softmmu lookup code (or helper). We don't handle re-fills or
|
|
|
|
* checking the victim table. This is purely informational.
|
|
|
|
*
|
2020-07-13 22:04:10 +02:00
|
|
|
* This almost never fails as the memory access being instrumented
|
|
|
|
* should have just filled the TLB. The one corner case is io_writex
|
|
|
|
* which can cause TLB flushes and potential resizing of the TLBs
|
2020-07-20 14:23:58 +02:00
|
|
|
* losing the information we need. In those cases we need to recover
|
|
|
|
* data from a copy of the iotlbentry. As long as this always occurs
|
|
|
|
* from the same thread (which a mem callback will be) this is safe.
|
2019-06-19 21:20:08 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
bool tlb_plugin_lookup(CPUState *cpu, target_ulong addr, int mmu_idx,
|
|
|
|
bool is_store, struct qemu_plugin_hwaddr *data)
|
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
|
|
|
CPUTLBEntry *tlbe = tlb_entry(env, mmu_idx, addr);
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
target_ulong tlb_addr = is_store ? tlb_addr_write(tlbe) : tlbe->addr_read;
|
|
|
|
|
|
|
|
if (likely(tlb_hit(tlb_addr, addr))) {
|
|
|
|
/* We must have an iotlb entry for MMIO */
|
|
|
|
if (tlb_addr & TLB_MMIO) {
|
|
|
|
CPUIOTLBEntry *iotlbentry;
|
|
|
|
iotlbentry = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
|
|
|
data->is_io = true;
|
|
|
|
data->v.io.section = iotlb_to_section(cpu, iotlbentry->addr, iotlbentry->attrs);
|
|
|
|
data->v.io.offset = (iotlbentry->addr & TARGET_PAGE_MASK) + addr;
|
|
|
|
} else {
|
|
|
|
data->is_io = false;
|
2021-07-09 16:29:52 +02:00
|
|
|
data->v.ram.hostaddr = (void *)((uintptr_t)addr + tlbe->addend);
|
2019-06-19 21:20:08 +02:00
|
|
|
}
|
|
|
|
return true;
|
2020-07-13 22:04:10 +02:00
|
|
|
} else {
|
|
|
|
SavedIOTLB *saved = &cpu->saved_iotlb;
|
|
|
|
data->is_io = true;
|
|
|
|
data->v.io.section = saved->section;
|
|
|
|
data->v.io.offset = saved->mr_offset;
|
|
|
|
return true;
|
2019-06-19 21:20:08 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2021-06-13 02:21:06 +02:00
|
|
|
/*
|
|
|
|
* Probe for an atomic operation. Do not allow unaligned operations,
|
|
|
|
* or io operations to proceed. Return the host address.
|
|
|
|
*
|
|
|
|
* @prot may be PAGE_READ, PAGE_WRITE, or PAGE_READ|PAGE_WRITE.
|
|
|
|
*/
|
2016-06-28 20:37:27 +02:00
|
|
|
static void *atomic_mmu_lookup(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, int size, int prot,
|
2021-06-13 02:21:06 +02:00
|
|
|
uintptr_t retaddr)
|
2016-06-28 20:37:27 +02:00
|
|
|
{
|
|
|
|
size_t mmu_idx = get_mmuidx(oi);
|
2019-08-23 20:10:58 +02:00
|
|
|
MemOp mop = get_memop(oi);
|
2016-06-28 20:37:27 +02:00
|
|
|
int a_bits = get_alignment_bits(mop);
|
2021-06-13 02:21:06 +02:00
|
|
|
uintptr_t index;
|
|
|
|
CPUTLBEntry *tlbe;
|
|
|
|
target_ulong tlb_addr;
|
2017-11-20 19:08:28 +01:00
|
|
|
void *hostaddr;
|
2016-06-28 20:37:27 +02:00
|
|
|
|
|
|
|
/* Adjust the given return address. */
|
|
|
|
retaddr -= GETPC_ADJ;
|
|
|
|
|
|
|
|
/* Enforce guest required alignment. */
|
|
|
|
if (unlikely(a_bits > 0 && (addr & ((1 << a_bits) - 1)))) {
|
|
|
|
/* ??? Maybe indicate atomic op to cpu_unaligned_access */
|
2019-03-23 00:07:18 +01:00
|
|
|
cpu_unaligned_access(env_cpu(env), addr, MMU_DATA_STORE,
|
2016-06-28 20:37:27 +02:00
|
|
|
mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Enforce qemu required alignment. */
|
2021-06-13 02:21:06 +02:00
|
|
|
if (unlikely(addr & (size - 1))) {
|
2016-06-28 20:37:27 +02:00
|
|
|
/* We get here if guest alignment was not requested,
|
|
|
|
or was not enforced by cpu_unaligned_access above.
|
|
|
|
We might widen the access and emulate, but for now
|
|
|
|
mark an exception and exit the cpu loop. */
|
|
|
|
goto stop_the_world;
|
|
|
|
}
|
|
|
|
|
2021-06-13 02:21:06 +02:00
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
tlbe = tlb_entry(env, mmu_idx, addr);
|
|
|
|
|
2016-06-28 20:37:27 +02:00
|
|
|
/* Check TLB entry and enforce page permissions. */
|
2021-06-13 02:21:06 +02:00
|
|
|
if (prot & PAGE_WRITE) {
|
|
|
|
tlb_addr = tlb_addr_write(tlbe);
|
|
|
|
if (!tlb_hit(tlb_addr, addr)) {
|
|
|
|
if (!VICTIM_TLB_HIT(addr_write, addr)) {
|
|
|
|
tlb_fill(env_cpu(env), addr, size,
|
|
|
|
MMU_DATA_STORE, mmu_idx, retaddr);
|
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
tlbe = tlb_entry(env, mmu_idx, addr);
|
|
|
|
}
|
|
|
|
tlb_addr = tlb_addr_write(tlbe) & ~TLB_INVALID_MASK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Let the guest notice RMW on a write-only page. */
|
|
|
|
if ((prot & PAGE_READ) &&
|
|
|
|
unlikely(tlbe->addr_read != (tlb_addr & ~TLB_NOTDIRTY))) {
|
|
|
|
tlb_fill(env_cpu(env), addr, size,
|
|
|
|
MMU_DATA_LOAD, mmu_idx, retaddr);
|
|
|
|
/*
|
|
|
|
* Since we don't support reads and writes to different addresses,
|
|
|
|
* and we do have the proper page loaded for write, this shouldn't
|
|
|
|
* ever return. But just in case, handle via stop-the-world.
|
|
|
|
*/
|
|
|
|
goto stop_the_world;
|
|
|
|
}
|
|
|
|
} else /* if (prot & PAGE_READ) */ {
|
|
|
|
tlb_addr = tlbe->addr_read;
|
|
|
|
if (!tlb_hit(tlb_addr, addr)) {
|
|
|
|
if (!VICTIM_TLB_HIT(addr_write, addr)) {
|
|
|
|
tlb_fill(env_cpu(env), addr, size,
|
|
|
|
MMU_DATA_LOAD, mmu_idx, retaddr);
|
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
tlbe = tlb_entry(env, mmu_idx, addr);
|
|
|
|
}
|
|
|
|
tlb_addr = tlbe->addr_read & ~TLB_INVALID_MASK;
|
2016-06-28 20:37:27 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-26 18:50:41 +02:00
|
|
|
/* Notice an IO access or a needs-MMU-lookup access */
|
2019-08-24 00:12:32 +02:00
|
|
|
if (unlikely(tlb_addr & TLB_MMIO)) {
|
2016-06-28 20:37:27 +02:00
|
|
|
/* There's really nothing that can be done to
|
|
|
|
support this apart from stop-the-world. */
|
|
|
|
goto stop_the_world;
|
|
|
|
}
|
|
|
|
|
2017-11-20 19:08:28 +01:00
|
|
|
hostaddr = (void *)((uintptr_t)addr + tlbe->addend);
|
|
|
|
|
|
|
|
if (unlikely(tlb_addr & TLB_NOTDIRTY)) {
|
2021-06-13 02:21:06 +02:00
|
|
|
notdirty_write(env_cpu(env), addr, size,
|
2019-09-22 03:47:59 +02:00
|
|
|
&env_tlb(env)->d[mmu_idx].iotlb[index], retaddr);
|
2017-11-20 19:08:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return hostaddr;
|
2016-06-28 20:37:27 +02:00
|
|
|
|
|
|
|
stop_the_world:
|
2019-03-23 00:07:18 +01:00
|
|
|
cpu_loop_exit_atomic(env_cpu(env), retaddr);
|
2016-06-28 20:37:27 +02:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
/*
|
|
|
|
* Verify that we have passed the correct MemOp to the correct function.
|
|
|
|
*
|
|
|
|
* In the case of the helper_*_mmu functions, we will have done this by
|
|
|
|
* using the MemOp to look up the helper during code generation.
|
|
|
|
*
|
|
|
|
* In the case of the cpu_*_mmu functions, this is up to the caller.
|
|
|
|
* We could present one function to target code, and dispatch based on
|
|
|
|
* the MemOp, but so far we have worked hard to avoid an indirect function
|
|
|
|
* call along the memory path.
|
|
|
|
*/
|
|
|
|
static void validate_memop(MemOpIdx oi, MemOp expected)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_DEBUG_TCG
|
|
|
|
MemOp have = get_memop(oi) & (MO_SIZE | MO_BSWAP);
|
|
|
|
assert(have == expected);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2019-02-15 15:31:13 +01:00
|
|
|
/*
|
|
|
|
* Load Helpers
|
|
|
|
*
|
|
|
|
* We support two different access types. SOFTMMU_CODE_ACCESS is
|
|
|
|
* specifically for reading instructions from system memory. It is
|
|
|
|
* called by the translation loop and in some helpers where the code
|
|
|
|
* is disassembled. It shouldn't be called directly by guest code.
|
|
|
|
*/
|
2014-03-28 17:55:24 +01:00
|
|
|
|
2019-04-26 05:48:57 +02:00
|
|
|
typedef uint64_t FullLoadHelper(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr);
|
2019-04-26 05:48:57 +02:00
|
|
|
|
2019-09-10 20:56:12 +02:00
|
|
|
static inline uint64_t QEMU_ALWAYS_INLINE
|
|
|
|
load_memop(const void *haddr, MemOp op)
|
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case MO_UB:
|
|
|
|
return ldub_p(haddr);
|
|
|
|
case MO_BEUW:
|
|
|
|
return lduw_be_p(haddr);
|
|
|
|
case MO_LEUW:
|
|
|
|
return lduw_le_p(haddr);
|
|
|
|
case MO_BEUL:
|
|
|
|
return (uint32_t)ldl_be_p(haddr);
|
|
|
|
case MO_LEUL:
|
|
|
|
return (uint32_t)ldl_le_p(haddr);
|
|
|
|
case MO_BEQ:
|
|
|
|
return ldq_be_p(haddr);
|
|
|
|
case MO_LEQ:
|
|
|
|
return ldq_le_p(haddr);
|
|
|
|
default:
|
|
|
|
qemu_build_not_reached();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-09-10 18:02:36 +02:00
|
|
|
static inline uint64_t QEMU_ALWAYS_INLINE
|
2021-07-26 00:06:49 +02:00
|
|
|
load_helper(CPUArchState *env, target_ulong addr, MemOpIdx oi,
|
2019-08-23 20:36:53 +02:00
|
|
|
uintptr_t retaddr, MemOp op, bool code_read,
|
2019-04-26 05:48:57 +02:00
|
|
|
FullLoadHelper *full_load)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
uintptr_t mmu_idx = get_mmuidx(oi);
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
CPUTLBEntry *entry = tlb_entry(env, mmu_idx, addr);
|
|
|
|
target_ulong tlb_addr = code_read ? entry->addr_code : entry->addr_read;
|
|
|
|
const size_t tlb_off = code_read ?
|
|
|
|
offsetof(CPUTLBEntry, addr_code) : offsetof(CPUTLBEntry, addr_read);
|
2019-04-25 23:16:34 +02:00
|
|
|
const MMUAccessType access_type =
|
|
|
|
code_read ? MMU_INST_FETCH : MMU_DATA_LOAD;
|
2019-02-15 15:31:13 +01:00
|
|
|
unsigned a_bits = get_alignment_bits(get_memop(oi));
|
|
|
|
void *haddr;
|
|
|
|
uint64_t res;
|
2019-08-23 20:36:53 +02:00
|
|
|
size_t size = memop_size(op);
|
2019-02-15 15:31:13 +01:00
|
|
|
|
|
|
|
/* Handle CPU specific unaligned behaviour */
|
|
|
|
if (addr & ((1 << a_bits) - 1)) {
|
2019-03-23 00:07:18 +01:00
|
|
|
cpu_unaligned_access(env_cpu(env), addr, access_type,
|
2019-02-15 15:31:13 +01:00
|
|
|
mmu_idx, retaddr);
|
|
|
|
}
|
2014-03-28 17:55:24 +01:00
|
|
|
|
2019-02-15 15:31:13 +01:00
|
|
|
/* If the TLB entry is for a different page, reload and try again. */
|
|
|
|
if (!tlb_hit(tlb_addr, addr)) {
|
|
|
|
if (!victim_tlb_hit(env, mmu_idx, index, tlb_off,
|
|
|
|
addr & TARGET_PAGE_MASK)) {
|
2019-03-23 00:07:18 +01:00
|
|
|
tlb_fill(env_cpu(env), addr, size,
|
2019-04-25 23:16:34 +02:00
|
|
|
access_type, mmu_idx, retaddr);
|
2019-02-15 15:31:13 +01:00
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
entry = tlb_entry(env, mmu_idx, addr);
|
|
|
|
}
|
|
|
|
tlb_addr = code_read ? entry->addr_code : entry->addr_read;
|
2019-08-24 00:12:32 +02:00
|
|
|
tlb_addr &= ~TLB_INVALID_MASK;
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-08-24 18:51:09 +02:00
|
|
|
/* Handle anything that isn't just a straight memory access. */
|
2019-02-15 15:31:13 +01:00
|
|
|
if (unlikely(tlb_addr & ~TARGET_PAGE_MASK)) {
|
2019-08-24 18:51:09 +02:00
|
|
|
CPUIOTLBEntry *iotlbentry;
|
2019-09-10 21:47:39 +02:00
|
|
|
bool need_swap;
|
2019-08-24 18:51:09 +02:00
|
|
|
|
|
|
|
/* For anything that is unaligned, recurse through full_load. */
|
2019-02-15 15:31:13 +01:00
|
|
|
if ((addr & (size - 1)) != 0) {
|
|
|
|
goto do_unaligned_access;
|
|
|
|
}
|
2019-08-24 18:51:09 +02:00
|
|
|
|
|
|
|
iotlbentry = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
|
|
|
|
|
|
|
/* Handle watchpoints. */
|
|
|
|
if (unlikely(tlb_addr & TLB_WATCHPOINT)) {
|
|
|
|
/* On watchpoint hit, this will longjmp out. */
|
|
|
|
cpu_check_watchpoint(env_cpu(env), addr, size,
|
|
|
|
iotlbentry->attrs, BP_MEM_READ, retaddr);
|
|
|
|
}
|
|
|
|
|
2019-09-10 21:47:39 +02:00
|
|
|
need_swap = size > 1 && (tlb_addr & TLB_BSWAP);
|
|
|
|
|
2019-08-24 18:51:09 +02:00
|
|
|
/* Handle I/O access. */
|
2019-09-10 21:47:39 +02:00
|
|
|
if (likely(tlb_addr & TLB_MMIO)) {
|
|
|
|
return io_readx(env, iotlbentry, mmu_idx, addr, retaddr,
|
|
|
|
access_type, op ^ (need_swap * MO_BSWAP));
|
|
|
|
}
|
|
|
|
|
|
|
|
haddr = (void *)((uintptr_t)addr + entry->addend);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Keep these two load_memop separate to ensure that the compiler
|
|
|
|
* is able to fold the entire function to a single instruction.
|
|
|
|
* There is a build-time assert inside to remind you of this. ;-)
|
|
|
|
*/
|
|
|
|
if (unlikely(need_swap)) {
|
|
|
|
return load_memop(haddr, op ^ MO_BSWAP);
|
|
|
|
}
|
|
|
|
return load_memop(haddr, op);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle slow unaligned access (it spans two pages or IO). */
|
|
|
|
if (size > 1
|
|
|
|
&& unlikely((addr & ~TARGET_PAGE_MASK) + size - 1
|
|
|
|
>= TARGET_PAGE_SIZE)) {
|
|
|
|
target_ulong addr1, addr2;
|
2019-06-03 16:56:32 +02:00
|
|
|
uint64_t r1, r2;
|
2019-02-15 15:31:13 +01:00
|
|
|
unsigned shift;
|
|
|
|
do_unaligned_access:
|
2019-06-06 17:38:19 +02:00
|
|
|
addr1 = addr & ~((target_ulong)size - 1);
|
2019-02-15 15:31:13 +01:00
|
|
|
addr2 = addr1 + size;
|
2019-04-26 05:48:57 +02:00
|
|
|
r1 = full_load(env, addr1, oi, retaddr);
|
|
|
|
r2 = full_load(env, addr2, oi, retaddr);
|
2019-02-15 15:31:13 +01:00
|
|
|
shift = (addr & (size - 1)) * 8;
|
|
|
|
|
2019-08-23 20:36:53 +02:00
|
|
|
if (memop_big_endian(op)) {
|
2019-02-15 15:31:13 +01:00
|
|
|
/* Big-endian combine. */
|
|
|
|
res = (r1 << shift) | (r2 >> ((size * 8) - shift));
|
|
|
|
} else {
|
|
|
|
/* Little-endian combine. */
|
|
|
|
res = (r1 >> shift) | (r2 << ((size * 8) - shift));
|
|
|
|
}
|
|
|
|
return res & MAKE_64BIT_MASK(0, size * 8);
|
|
|
|
}
|
|
|
|
|
|
|
|
haddr = (void *)((uintptr_t)addr + entry->addend);
|
2019-09-10 20:56:12 +02:00
|
|
|
return load_memop(haddr, op);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For the benefit of TCG generated code, we want to avoid the
|
|
|
|
* complication of ABI-specific return type promotion and always
|
|
|
|
* return a value extended to the register size of the host. This is
|
|
|
|
* tcg_target_long, except in the case of a 32-bit host and 64-bit
|
|
|
|
* data, and for that we always have uint64_t.
|
|
|
|
*
|
|
|
|
* We don't bother with this widened value for SOFTMMU_CODE_ACCESS.
|
|
|
|
*/
|
|
|
|
|
2019-04-26 05:48:57 +02:00
|
|
|
static uint64_t full_ldub_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_UB);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_UB, false, full_ldub_mmu);
|
2019-04-26 05:48:57 +02:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
tcg_target_ulong helper_ret_ldub_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-04-26 05:48:57 +02:00
|
|
|
return full_ldub_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint64_t full_le_lduw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_LEUW);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_LEUW, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
full_le_lduw_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
tcg_target_ulong helper_le_lduw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-04-26 05:48:57 +02:00
|
|
|
return full_le_lduw_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint64_t full_be_lduw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_BEUW);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_BEUW, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
full_be_lduw_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
tcg_target_ulong helper_be_lduw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-04-26 05:48:57 +02:00
|
|
|
return full_be_lduw_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint64_t full_le_ldul_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_LEUL);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_LEUL, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
full_le_ldul_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
tcg_target_ulong helper_le_ldul_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-04-26 05:48:57 +02:00
|
|
|
return full_le_ldul_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint64_t full_be_ldul_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_BEUL);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_BEUL, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
full_be_ldul_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
tcg_target_ulong helper_be_ldul_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-04-26 05:48:57 +02:00
|
|
|
return full_be_ldul_mmu(env, addr, oi, retaddr);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
uint64_t helper_le_ldq_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_LEQ);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_LEQ, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
helper_le_ldq_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
uint64_t helper_be_ldq_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_BEQ);
|
2019-08-23 20:36:53 +02:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_BEQ, false,
|
2019-04-26 05:48:57 +02:00
|
|
|
helper_be_ldq_mmu);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Provide signed versions of the load routines as well. We can of course
|
|
|
|
* avoid this for 64-bit data, or for 32-bit data on 32-bit host.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
tcg_target_ulong helper_ret_ldsb_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
return (int8_t)helper_ret_ldub_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_target_ulong helper_le_ldsw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
return (int16_t)helper_le_lduw_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_target_ulong helper_be_ldsw_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
return (int16_t)helper_be_lduw_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_target_ulong helper_le_ldsl_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
return (int32_t)helper_le_ldul_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcg_target_ulong helper_be_ldsl_mmu(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
return (int32_t)helper_be_ldul_mmu(env, addr, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
2019-12-09 22:49:58 +01:00
|
|
|
/*
|
|
|
|
* Load helpers for cpu_ldst.h.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static inline uint64_t cpu_load_helper(CPUArchState *env, abi_ptr addr,
|
2021-07-27 19:48:55 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr,
|
|
|
|
FullLoadHelper *full_load)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
|
|
|
uint64_t ret;
|
|
|
|
|
2021-07-27 01:21:38 +02:00
|
|
|
trace_guest_ld_before_exec(env_cpu(env), addr, oi);
|
2019-12-09 22:49:58 +01:00
|
|
|
ret = full_load(env, addr, oi, retaddr);
|
2021-07-26 23:48:30 +02:00
|
|
|
qemu_plugin_vcpu_mem_cb(env_cpu(env), addr, oi, QEMU_PLUGIN_MEM_R);
|
2019-12-09 22:49:58 +01:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint8_t cpu_ldb_mmu(CPUArchState *env, abi_ptr addr, MemOpIdx oi, uintptr_t ra)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, full_ldub_mmu);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint16_t cpu_ldw_be_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2019-12-11 19:33:26 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, full_be_lduw_mmu);
|
2019-12-11 19:33:26 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint32_t cpu_ldl_be_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2019-12-11 19:33:26 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, full_be_ldul_mmu);
|
2019-12-11 19:33:26 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint64_t cpu_ldq_be_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2020-05-08 17:43:46 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, MO_BEQ, helper_be_ldq_mmu);
|
2020-05-08 17:43:46 +02:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint16_t cpu_ldw_le_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2019-12-11 19:33:26 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, full_le_lduw_mmu);
|
2019-12-11 19:33:26 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint32_t cpu_ldl_le_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2019-12-11 19:33:26 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, full_le_ldul_mmu);
|
2019-12-11 19:33:26 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
uint64_t cpu_ldq_le_mmu(CPUArchState *env, abi_ptr addr,
|
|
|
|
MemOpIdx oi, uintptr_t ra)
|
2019-12-11 19:33:26 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
return cpu_load_helper(env, addr, oi, ra, helper_le_ldq_mmu);
|
2019-12-11 19:33:26 +01:00
|
|
|
}
|
|
|
|
|
2019-02-15 15:31:13 +01:00
|
|
|
/*
|
|
|
|
* Store Helpers
|
|
|
|
*/
|
|
|
|
|
2019-09-10 20:56:12 +02:00
|
|
|
static inline void QEMU_ALWAYS_INLINE
|
|
|
|
store_memop(void *haddr, uint64_t val, MemOp op)
|
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case MO_UB:
|
|
|
|
stb_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_BEUW:
|
|
|
|
stw_be_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_LEUW:
|
|
|
|
stw_le_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_BEUL:
|
|
|
|
stl_be_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_LEUL:
|
|
|
|
stl_le_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_BEQ:
|
|
|
|
stq_be_p(haddr, val);
|
|
|
|
break;
|
|
|
|
case MO_LEQ:
|
|
|
|
stq_le_p(haddr, val);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
qemu_build_not_reached();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
static void full_stb_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr);
|
|
|
|
|
2020-07-27 00:39:53 +02:00
|
|
|
static void __attribute__((noinline))
|
|
|
|
store_helper_unaligned(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
uintptr_t retaddr, size_t size, uintptr_t mmu_idx,
|
|
|
|
bool big_endian)
|
|
|
|
{
|
|
|
|
const size_t tlb_off = offsetof(CPUTLBEntry, addr_write);
|
|
|
|
uintptr_t index, index2;
|
|
|
|
CPUTLBEntry *entry, *entry2;
|
|
|
|
target_ulong page2, tlb_addr, tlb_addr2;
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi;
|
2020-07-27 00:39:53 +02:00
|
|
|
size_t size2;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ensure the second page is in the TLB. Note that the first page
|
|
|
|
* is already guaranteed to be filled, and that the second page
|
|
|
|
* cannot evict the first.
|
|
|
|
*/
|
|
|
|
page2 = (addr + size) & TARGET_PAGE_MASK;
|
|
|
|
size2 = (addr + size) & ~TARGET_PAGE_MASK;
|
|
|
|
index2 = tlb_index(env, mmu_idx, page2);
|
|
|
|
entry2 = tlb_entry(env, mmu_idx, page2);
|
|
|
|
|
|
|
|
tlb_addr2 = tlb_addr_write(entry2);
|
|
|
|
if (!tlb_hit_page(tlb_addr2, page2)) {
|
|
|
|
if (!victim_tlb_hit(env, mmu_idx, index2, tlb_off, page2)) {
|
|
|
|
tlb_fill(env_cpu(env), page2, size2, MMU_DATA_STORE,
|
|
|
|
mmu_idx, retaddr);
|
|
|
|
index2 = tlb_index(env, mmu_idx, page2);
|
|
|
|
entry2 = tlb_entry(env, mmu_idx, page2);
|
|
|
|
}
|
|
|
|
tlb_addr2 = tlb_addr_write(entry2);
|
|
|
|
}
|
|
|
|
|
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
entry = tlb_entry(env, mmu_idx, addr);
|
|
|
|
tlb_addr = tlb_addr_write(entry);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle watchpoints. Since this may trap, all checks
|
|
|
|
* must happen before any store.
|
|
|
|
*/
|
|
|
|
if (unlikely(tlb_addr & TLB_WATCHPOINT)) {
|
|
|
|
cpu_check_watchpoint(env_cpu(env), addr, size - size2,
|
|
|
|
env_tlb(env)->d[mmu_idx].iotlb[index].attrs,
|
|
|
|
BP_MEM_WRITE, retaddr);
|
|
|
|
}
|
|
|
|
if (unlikely(tlb_addr2 & TLB_WATCHPOINT)) {
|
|
|
|
cpu_check_watchpoint(env_cpu(env), page2, size2,
|
|
|
|
env_tlb(env)->d[mmu_idx].iotlb[index2].attrs,
|
|
|
|
BP_MEM_WRITE, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX: not efficient, but simple.
|
|
|
|
* This loop must go in the forward direction to avoid issues
|
|
|
|
* with self-modifying code in Windows 64-bit.
|
|
|
|
*/
|
|
|
|
oi = make_memop_idx(MO_UB, mmu_idx);
|
|
|
|
if (big_endian) {
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
|
|
/* Big-endian extract. */
|
|
|
|
uint8_t val8 = val >> (((size - 1) * 8) - (i * 8));
|
2021-07-27 19:48:55 +02:00
|
|
|
full_stb_mmu(env, addr + i, val8, oi, retaddr);
|
2020-07-27 00:39:53 +02:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
|
|
/* Little-endian extract. */
|
|
|
|
uint8_t val8 = val >> (i * 8);
|
2021-07-27 19:48:55 +02:00
|
|
|
full_stb_mmu(env, addr + i, val8, oi, retaddr);
|
2020-07-27 00:39:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-09-10 18:02:36 +02:00
|
|
|
static inline void QEMU_ALWAYS_INLINE
|
2019-04-26 06:12:59 +02:00
|
|
|
store_helper(CPUArchState *env, target_ulong addr, uint64_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr, MemOp op)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
|
|
|
uintptr_t mmu_idx = get_mmuidx(oi);
|
|
|
|
uintptr_t index = tlb_index(env, mmu_idx, addr);
|
|
|
|
CPUTLBEntry *entry = tlb_entry(env, mmu_idx, addr);
|
|
|
|
target_ulong tlb_addr = tlb_addr_write(entry);
|
|
|
|
const size_t tlb_off = offsetof(CPUTLBEntry, addr_write);
|
|
|
|
unsigned a_bits = get_alignment_bits(get_memop(oi));
|
|
|
|
void *haddr;
|
2019-08-23 20:36:53 +02:00
|
|
|
size_t size = memop_size(op);
|
2019-02-15 15:31:13 +01:00
|
|
|
|
|
|
|
/* Handle CPU specific unaligned behaviour */
|
|
|
|
if (addr & ((1 << a_bits) - 1)) {
|
2019-03-23 00:07:18 +01:00
|
|
|
cpu_unaligned_access(env_cpu(env), addr, MMU_DATA_STORE,
|
2019-02-15 15:31:13 +01:00
|
|
|
mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If the TLB entry is for a different page, reload and try again. */
|
|
|
|
if (!tlb_hit(tlb_addr, addr)) {
|
|
|
|
if (!victim_tlb_hit(env, mmu_idx, index, tlb_off,
|
|
|
|
addr & TARGET_PAGE_MASK)) {
|
2019-03-23 00:07:18 +01:00
|
|
|
tlb_fill(env_cpu(env), addr, size, MMU_DATA_STORE,
|
2019-02-15 15:31:13 +01:00
|
|
|
mmu_idx, retaddr);
|
|
|
|
index = tlb_index(env, mmu_idx, addr);
|
|
|
|
entry = tlb_entry(env, mmu_idx, addr);
|
|
|
|
}
|
|
|
|
tlb_addr = tlb_addr_write(entry) & ~TLB_INVALID_MASK;
|
|
|
|
}
|
|
|
|
|
2019-08-24 18:51:09 +02:00
|
|
|
/* Handle anything that isn't just a straight memory access. */
|
2019-02-15 15:31:13 +01:00
|
|
|
if (unlikely(tlb_addr & ~TARGET_PAGE_MASK)) {
|
2019-08-24 18:51:09 +02:00
|
|
|
CPUIOTLBEntry *iotlbentry;
|
2019-09-10 21:47:39 +02:00
|
|
|
bool need_swap;
|
2019-08-24 18:51:09 +02:00
|
|
|
|
|
|
|
/* For anything that is unaligned, recurse through byte stores. */
|
2019-02-15 15:31:13 +01:00
|
|
|
if ((addr & (size - 1)) != 0) {
|
|
|
|
goto do_unaligned_access;
|
|
|
|
}
|
2019-08-24 18:51:09 +02:00
|
|
|
|
|
|
|
iotlbentry = &env_tlb(env)->d[mmu_idx].iotlb[index];
|
|
|
|
|
|
|
|
/* Handle watchpoints. */
|
|
|
|
if (unlikely(tlb_addr & TLB_WATCHPOINT)) {
|
|
|
|
/* On watchpoint hit, this will longjmp out. */
|
|
|
|
cpu_check_watchpoint(env_cpu(env), addr, size,
|
|
|
|
iotlbentry->attrs, BP_MEM_WRITE, retaddr);
|
|
|
|
}
|
|
|
|
|
2019-09-10 21:47:39 +02:00
|
|
|
need_swap = size > 1 && (tlb_addr & TLB_BSWAP);
|
|
|
|
|
2019-08-24 18:51:09 +02:00
|
|
|
/* Handle I/O access. */
|
2019-09-18 18:15:44 +02:00
|
|
|
if (tlb_addr & TLB_MMIO) {
|
2019-09-10 21:47:39 +02:00
|
|
|
io_writex(env, iotlbentry, mmu_idx, val, addr, retaddr,
|
|
|
|
op ^ (need_swap * MO_BSWAP));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-09-20 02:54:10 +02:00
|
|
|
/* Ignore writes to ROM. */
|
|
|
|
if (unlikely(tlb_addr & TLB_DISCARD_WRITE)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-09-18 18:15:44 +02:00
|
|
|
/* Handle clean RAM pages. */
|
|
|
|
if (tlb_addr & TLB_NOTDIRTY) {
|
2019-09-22 03:47:59 +02:00
|
|
|
notdirty_write(env_cpu(env), addr, size, iotlbentry, retaddr);
|
2019-09-18 18:15:44 +02:00
|
|
|
}
|
|
|
|
|
2019-09-22 03:47:59 +02:00
|
|
|
haddr = (void *)((uintptr_t)addr + entry->addend);
|
|
|
|
|
2019-09-10 21:47:39 +02:00
|
|
|
/*
|
|
|
|
* Keep these two store_memop separate to ensure that the compiler
|
|
|
|
* is able to fold the entire function to a single instruction.
|
|
|
|
* There is a build-time assert inside to remind you of this. ;-)
|
|
|
|
*/
|
|
|
|
if (unlikely(need_swap)) {
|
|
|
|
store_memop(haddr, val, op ^ MO_BSWAP);
|
|
|
|
} else {
|
|
|
|
store_memop(haddr, val, op);
|
|
|
|
}
|
2019-02-15 15:31:13 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle slow unaligned access (it spans two pages or IO). */
|
|
|
|
if (size > 1
|
|
|
|
&& unlikely((addr & ~TARGET_PAGE_MASK) + size - 1
|
|
|
|
>= TARGET_PAGE_SIZE)) {
|
|
|
|
do_unaligned_access:
|
2020-07-27 00:39:53 +02:00
|
|
|
store_helper_unaligned(env, addr, val, retaddr, size,
|
|
|
|
mmu_idx, memop_big_endian(op));
|
2019-02-15 15:31:13 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
haddr = (void *)((uintptr_t)addr + entry->addend);
|
2019-09-10 20:56:12 +02:00
|
|
|
store_memop(haddr, val, op);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
static void __attribute__((noinline))
|
|
|
|
full_stb_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_UB);
|
2019-08-23 20:36:53 +02:00
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_UB);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void helper_ret_stb_mmu(CPUArchState *env, target_ulong addr, uint8_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
full_stb_mmu(env, addr, val, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void full_le_stw_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
validate_memop(oi, MO_LEUW);
|
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_LEUW);
|
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_le_stw_mmu(CPUArchState *env, target_ulong addr, uint16_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
full_le_stw_mmu(env, addr, val, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void full_be_stw_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
validate_memop(oi, MO_BEUW);
|
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_BEUW);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_be_stw_mmu(CPUArchState *env, target_ulong addr, uint16_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
full_be_stw_mmu(env, addr, val, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void full_le_stl_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
validate_memop(oi, MO_LEUL);
|
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_LEUL);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_le_stl_mmu(CPUArchState *env, target_ulong addr, uint32_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
full_le_stl_mmu(env, addr, val, oi, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void full_be_stl_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
validate_memop(oi, MO_BEUL);
|
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_BEUL);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_be_stl_mmu(CPUArchState *env, target_ulong addr, uint32_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
full_be_stl_mmu(env, addr, val, oi, retaddr);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_le_stq_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_LEQ);
|
2019-08-23 20:36:53 +02:00
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_LEQ);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-04-26 05:01:37 +02:00
|
|
|
void helper_be_stq_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
validate_memop(oi, MO_BEQ);
|
2019-08-23 20:36:53 +02:00
|
|
|
store_helper(env, addr, val, oi, retaddr, MO_BEQ);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
2014-03-28 17:55:24 +01:00
|
|
|
|
2019-12-09 22:49:58 +01:00
|
|
|
/*
|
|
|
|
* Store Helpers for cpu_ldst.h
|
|
|
|
*/
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
typedef void FullStoreHelper(CPUArchState *env, target_ulong addr,
|
|
|
|
uint64_t val, MemOpIdx oi, uintptr_t retaddr);
|
2019-12-09 22:49:58 +01:00
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
static inline void cpu_store_helper(CPUArchState *env, target_ulong addr,
|
|
|
|
uint64_t val, MemOpIdx oi, uintptr_t ra,
|
|
|
|
FullStoreHelper *full_store)
|
|
|
|
{
|
2021-07-27 01:21:38 +02:00
|
|
|
trace_guest_st_before_exec(env_cpu(env), addr, oi);
|
2021-07-27 19:48:55 +02:00
|
|
|
full_store(env, addr, val, oi, ra);
|
2021-07-26 23:48:30 +02:00
|
|
|
qemu_plugin_vcpu_mem_cb(env_cpu(env), addr, oi, QEMU_PLUGIN_MEM_W);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stb_mmu(CPUArchState *env, target_ulong addr, uint8_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, full_stb_mmu);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stw_be_mmu(CPUArchState *env, target_ulong addr, uint16_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, full_be_stw_mmu);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stl_be_mmu(CPUArchState *env, target_ulong addr, uint32_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, full_be_stl_mmu);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stq_be_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2020-05-08 17:43:46 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, helper_be_stq_mmu);
|
2020-05-08 17:43:46 +02:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stw_le_mmu(CPUArchState *env, target_ulong addr, uint16_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-12-09 22:49:58 +01:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, full_le_stw_mmu);
|
2020-05-08 17:43:46 +02:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stl_le_mmu(CPUArchState *env, target_ulong addr, uint32_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2020-05-08 17:43:46 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, full_le_stl_mmu);
|
2020-05-08 17:43:46 +02:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
void cpu_stq_le_mmu(CPUArchState *env, target_ulong addr, uint64_t val,
|
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2020-05-08 17:43:46 +02:00
|
|
|
{
|
2021-07-27 19:48:55 +02:00
|
|
|
cpu_store_helper(env, addr, val, oi, retaddr, helper_le_stq_mmu);
|
2019-12-09 22:49:58 +01:00
|
|
|
}
|
|
|
|
|
2021-07-27 19:48:55 +02:00
|
|
|
#include "ldst_common.c.inc"
|
2019-12-11 19:33:26 +01:00
|
|
|
|
2021-07-16 23:20:49 +02:00
|
|
|
/*
|
|
|
|
* First set of functions passes in OI and RETADDR.
|
|
|
|
* This makes them callable from other helpers.
|
|
|
|
*/
|
2016-06-28 20:37:27 +02:00
|
|
|
|
|
|
|
#define ATOMIC_NAME(X) \
|
2021-07-16 23:20:49 +02:00
|
|
|
glue(glue(glue(cpu_atomic_ ## X, SUFFIX), END), _mmu)
|
2021-07-17 02:49:09 +02:00
|
|
|
|
2019-09-22 03:47:59 +02:00
|
|
|
#define ATOMIC_MMU_CLEANUP
|
2019-06-28 21:54:11 +02:00
|
|
|
#define ATOMIC_MMU_IDX get_mmuidx(oi)
|
2016-06-28 20:37:27 +02:00
|
|
|
|
2020-02-04 12:41:01 +01:00
|
|
|
#include "atomic_common.c.inc"
|
2016-06-28 20:37:27 +02:00
|
|
|
|
|
|
|
#define DATA_SIZE 1
|
|
|
|
#include "atomic_template.h"
|
|
|
|
|
|
|
|
#define DATA_SIZE 2
|
|
|
|
#include "atomic_template.h"
|
|
|
|
|
|
|
|
#define DATA_SIZE 4
|
|
|
|
#include "atomic_template.h"
|
|
|
|
|
2016-09-02 21:23:57 +02:00
|
|
|
#ifdef CONFIG_ATOMIC64
|
2016-06-28 20:37:27 +02:00
|
|
|
#define DATA_SIZE 8
|
|
|
|
#include "atomic_template.h"
|
2016-09-02 21:23:57 +02:00
|
|
|
#endif
|
2016-06-28 20:37:27 +02:00
|
|
|
|
2018-08-16 01:31:47 +02:00
|
|
|
#if HAVE_CMPXCHG128 || HAVE_ATOMIC128
|
2016-06-30 06:10:59 +02:00
|
|
|
#define DATA_SIZE 16
|
|
|
|
#include "atomic_template.h"
|
|
|
|
#endif
|
|
|
|
|
2016-06-28 20:37:27 +02:00
|
|
|
/* Code access functions. */
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
static uint64_t full_ldub_code(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2019-12-11 20:25:10 +01:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_8, true, full_ldub_code);
|
2019-04-26 05:48:57 +02:00
|
|
|
}
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
uint32_t cpu_ldub_code(CPUArchState *env, abi_ptr addr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi = make_memop_idx(MO_UB, cpu_mmu_index(env, true));
|
2019-12-11 20:25:10 +01:00
|
|
|
return full_ldub_code(env, addr, oi, 0);
|
2019-04-26 05:48:57 +02:00
|
|
|
}
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
static uint64_t full_lduw_code(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2019-12-11 20:25:10 +01:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_TEUW, true, full_lduw_code);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
uint32_t cpu_lduw_code(CPUArchState *env, abi_ptr addr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi = make_memop_idx(MO_TEUW, cpu_mmu_index(env, true));
|
2019-12-11 20:25:10 +01:00
|
|
|
return full_lduw_code(env, addr, oi, 0);
|
2019-04-26 05:48:57 +02:00
|
|
|
}
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
static uint64_t full_ldl_code(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-04-26 05:48:57 +02:00
|
|
|
{
|
2019-12-11 20:25:10 +01:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_TEUL, true, full_ldl_code);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
2012-04-09 18:50:52 +02:00
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
uint32_t cpu_ldl_code(CPUArchState *env, abi_ptr addr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi = make_memop_idx(MO_TEUL, cpu_mmu_index(env, true));
|
2019-12-11 20:25:10 +01:00
|
|
|
return full_ldl_code(env, addr, oi, 0);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
static uint64_t full_ldq_code(CPUArchState *env, target_ulong addr,
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi, uintptr_t retaddr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2019-12-11 20:25:10 +01:00
|
|
|
return load_helper(env, addr, oi, retaddr, MO_TEQ, true, full_ldq_code);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|
|
|
|
|
2019-12-11 20:25:10 +01:00
|
|
|
uint64_t cpu_ldq_code(CPUArchState *env, abi_ptr addr)
|
2019-02-15 15:31:13 +01:00
|
|
|
{
|
2021-07-26 00:06:49 +02:00
|
|
|
MemOpIdx oi = make_memop_idx(MO_TEQ, cpu_mmu_index(env, true));
|
2019-12-11 20:25:10 +01:00
|
|
|
return full_ldq_code(env, addr, oi, 0);
|
2019-02-15 15:31:13 +01:00
|
|
|
}
|