2012-04-10 00:50:52 +08: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
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* 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-27 02:16:56 +08: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-24 02:29:11 +08:00
|
|
|
#include "qemu/main-loop.h"
|
2012-04-10 00:50:52 +08:00
|
|
|
#include "cpu.h"
|
2012-12-18 01:19:49 +08:00
|
|
|
#include "exec/exec-all.h"
|
|
|
|
#include "exec/memory.h"
|
|
|
|
#include "exec/address-spaces.h"
|
2014-03-29 02:42:10 +08:00
|
|
|
#include "exec/cpu_ldst.h"
|
2012-12-18 01:19:49 +08:00
|
|
|
#include "exec/cputlb.h"
|
|
|
|
#include "exec/memory-internal.h"
|
2013-10-14 23:13:59 +08:00
|
|
|
#include "exec/ram_addr.h"
|
2014-03-29 00:55:24 +08: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-21 01:07:05 +08:00
|
|
|
#include "qemu/error-report.h"
|
|
|
|
#include "exec/log.h"
|
2016-06-29 02:37:27 +08:00
|
|
|
#include "exec/helper-proto.h"
|
|
|
|
#include "qemu/atomic.h"
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2016-03-15 22:30:24 +08: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-10 00:50:52 +08:00
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
#define assert_cpu_is_self(this_cpu) do { \
|
|
|
|
if (DEBUG_TLB_GATE) { \
|
|
|
|
g_assert(!cpu->created || qemu_cpu_is_self(cpu)); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
2017-02-24 02:29:18 +08: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-24 02:29:20 +08: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)
|
|
|
|
|
2017-02-24 02:29:22 +08: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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-04-10 00:50:52 +08:00
|
|
|
/* statistics */
|
|
|
|
int tlb_flush_count;
|
|
|
|
|
2016-11-14 22:17:28 +08:00
|
|
|
/* This is OK because CPU architectures generally permit an
|
|
|
|
* implementation to drop entries from the TLB at any time, so
|
|
|
|
* flushing more entries than required is only an efficiency issue,
|
|
|
|
* not a correctness issue.
|
2012-04-10 00:50:52 +08:00
|
|
|
*/
|
2017-02-24 02:29:18 +08:00
|
|
|
static void tlb_flush_nocheck(CPUState *cpu)
|
2012-04-10 00:50:52 +08:00
|
|
|
{
|
2013-09-04 08:19:44 +08:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
/* The QOM tests will trigger tlb_flushes without setting up TCG
|
|
|
|
* so we bug out here in that case.
|
|
|
|
*/
|
|
|
|
if (!tcg_enabled()) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
|
|
|
tlb_debug("(count: %d)\n", tlb_flush_count++);
|
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
tb_lock();
|
|
|
|
|
2013-12-07 05:44:51 +08:00
|
|
|
memset(env->tlb_table, -1, sizeof(env->tlb_table));
|
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 09:35:23 +08:00
|
|
|
memset(env->tlb_v_table, -1, sizeof(env->tlb_v_table));
|
2013-08-26 12:03:38 +08:00
|
|
|
memset(cpu->tb_jmp_cache, 0, sizeof(cpu->tb_jmp_cache));
|
2012-04-10 00:50:52 +08: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 09:35:23 +08:00
|
|
|
env->vtlb_index = 0;
|
2012-04-10 00:50:52 +08:00
|
|
|
env->tlb_flush_addr = -1;
|
|
|
|
env->tlb_flush_mask = 0;
|
2017-02-24 02:29:18 +08:00
|
|
|
|
|
|
|
tb_unlock();
|
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
atomic_mb_set(&cpu->pending_tlb_flush, 0);
|
2017-02-24 02:29:18 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void tlb_flush_global_async_work(CPUState *cpu, run_on_cpu_data data)
|
|
|
|
{
|
|
|
|
tlb_flush_nocheck(cpu);
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush(CPUState *cpu)
|
|
|
|
{
|
|
|
|
if (cpu->created && !qemu_cpu_is_self(cpu)) {
|
2017-02-24 02:29:20 +08:00
|
|
|
if (atomic_mb_read(&cpu->pending_tlb_flush) != ALL_MMUIDX_BITS) {
|
|
|
|
atomic_mb_set(&cpu->pending_tlb_flush, ALL_MMUIDX_BITS);
|
2017-02-24 02:29:18 +08:00
|
|
|
async_run_on_cpu(cpu, tlb_flush_global_async_work,
|
|
|
|
RUN_ON_CPU_NULL);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
tlb_flush_nocheck(cpu);
|
|
|
|
}
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:22 +08:00
|
|
|
void tlb_flush_all_cpus(CPUState *src_cpu)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_global_async_work;
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_NULL);
|
|
|
|
fn(src_cpu, RUN_ON_CPU_NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_all_cpus_synced(CPUState *src_cpu)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_global_async_work;
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_NULL);
|
|
|
|
async_safe_run_on_cpu(src_cpu, fn, RUN_ON_CPU_NULL);
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
static void tlb_flush_by_mmuidx_async_work(CPUState *cpu, run_on_cpu_data data)
|
2015-08-25 22:45:09 +08:00
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2017-02-24 02:29:20 +08:00
|
|
|
unsigned long mmu_idx_bitmask = data.host_int;
|
2017-02-24 02:29:19 +08:00
|
|
|
int mmu_idx;
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
tb_lock();
|
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
tlb_debug("start: mmu_idx:0x%04lx\n", mmu_idx_bitmask);
|
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
if (test_bit(mmu_idx, &mmu_idx_bitmask)) {
|
|
|
|
tlb_debug("%d\n", mmu_idx);
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
memset(env->tlb_table[mmu_idx], -1, sizeof(env->tlb_table[0]));
|
|
|
|
memset(env->tlb_v_table[mmu_idx], -1, sizeof(env->tlb_v_table[0]));
|
|
|
|
}
|
2015-08-25 22:45:09 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
memset(cpu->tb_jmp_cache, 0, sizeof(cpu->tb_jmp_cache));
|
2017-02-24 02:29:18 +08:00
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
tlb_debug("done\n");
|
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
tb_unlock();
|
2015-08-25 22:45:09 +08:00
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
void tlb_flush_by_mmuidx(CPUState *cpu, uint16_t idxmap)
|
2015-08-25 22:45:09 +08:00
|
|
|
{
|
2017-02-24 02:29:20 +08:00
|
|
|
tlb_debug("mmu_idx: 0x%" PRIx16 "\n", idxmap);
|
|
|
|
|
|
|
|
if (!qemu_cpu_is_self(cpu)) {
|
|
|
|
uint16_t pending_flushes = idxmap;
|
|
|
|
pending_flushes &= ~atomic_mb_read(&cpu->pending_tlb_flush);
|
|
|
|
|
|
|
|
if (pending_flushes) {
|
|
|
|
tlb_debug("reduced mmu_idx: 0x%" PRIx16 "\n", pending_flushes);
|
|
|
|
|
|
|
|
atomic_or(&cpu->pending_tlb_flush, pending_flushes);
|
|
|
|
async_run_on_cpu(cpu, tlb_flush_by_mmuidx_async_work,
|
|
|
|
RUN_ON_CPU_HOST_INT(pending_flushes));
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
tlb_flush_by_mmuidx_async_work(cpu,
|
|
|
|
RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
}
|
2015-08-25 22:45:09 +08:00
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:22 +08: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));
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_by_mmuidx_all_cpus_synced(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));
|
|
|
|
async_safe_run_on_cpu(src_cpu, fn, RUN_ON_CPU_HOST_INT(idxmap));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-04-10 00:50:52 +08:00
|
|
|
static inline void tlb_flush_entry(CPUTLBEntry *tlb_entry, target_ulong addr)
|
|
|
|
{
|
|
|
|
if (addr == (tlb_entry->addr_read &
|
|
|
|
(TARGET_PAGE_MASK | TLB_INVALID_MASK)) ||
|
|
|
|
addr == (tlb_entry->addr_write &
|
|
|
|
(TARGET_PAGE_MASK | TLB_INVALID_MASK)) ||
|
|
|
|
addr == (tlb_entry->addr_code &
|
|
|
|
(TARGET_PAGE_MASK | TLB_INVALID_MASK))) {
|
2013-12-07 05:44:51 +08:00
|
|
|
memset(tlb_entry, -1, sizeof(*tlb_entry));
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
static void tlb_flush_page_async_work(CPUState *cpu, run_on_cpu_data data)
|
2012-04-10 00:50:52 +08:00
|
|
|
{
|
2013-09-04 07:29:02 +08:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2017-02-24 02:29:18 +08:00
|
|
|
target_ulong addr = (target_ulong) data.target_ptr;
|
2012-04-10 00:50:52 +08:00
|
|
|
int i;
|
|
|
|
int mmu_idx;
|
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
2017-02-24 02:29:18 +08:00
|
|
|
|
2016-03-15 22:30:24 +08:00
|
|
|
tlb_debug("page :" TARGET_FMT_lx "\n", addr);
|
|
|
|
|
2012-04-10 00:50:52 +08:00
|
|
|
/* Check if we need to flush due to large pages. */
|
|
|
|
if ((addr & env->tlb_flush_mask) == env->tlb_flush_addr) {
|
2016-03-15 22:30:24 +08:00
|
|
|
tlb_debug("forcing full flush ("
|
|
|
|
TARGET_FMT_lx "/" TARGET_FMT_lx ")\n",
|
|
|
|
env->tlb_flush_addr, env->tlb_flush_mask);
|
|
|
|
|
2016-11-14 22:17:28 +08:00
|
|
|
tlb_flush(cpu);
|
2012-04-10 00:50:52 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
addr &= TARGET_PAGE_MASK;
|
|
|
|
i = (addr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
tlb_flush_entry(&env->tlb_table[mmu_idx][i], addr);
|
|
|
|
}
|
|
|
|
|
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 09:35:23 +08:00
|
|
|
/* check whether there are entries that need to be flushed in the vtlb */
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
int k;
|
|
|
|
for (k = 0; k < CPU_VTLB_SIZE; k++) {
|
|
|
|
tlb_flush_entry(&env->tlb_v_table[mmu_idx][k], addr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-01 23:52:07 +08:00
|
|
|
tb_flush_jmp_cache(cpu, addr);
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:18 +08:00
|
|
|
void tlb_flush_page(CPUState *cpu, target_ulong addr)
|
|
|
|
{
|
|
|
|
tlb_debug("page :" TARGET_FMT_lx "\n", addr);
|
|
|
|
|
|
|
|
if (!qemu_cpu_is_self(cpu)) {
|
|
|
|
async_run_on_cpu(cpu, tlb_flush_page_async_work,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr));
|
|
|
|
} else {
|
|
|
|
tlb_flush_page_async_work(cpu, RUN_ON_CPU_TARGET_PTR(addr));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
/* As we are going to hijack the bottom bits of the page address for a
|
|
|
|
* mmuidx bit mask we need to fail to build if we can't do that
|
|
|
|
*/
|
|
|
|
QEMU_BUILD_BUG_ON(NB_MMU_MODES > TARGET_PAGE_BITS_MIN);
|
|
|
|
|
|
|
|
static void tlb_flush_page_by_mmuidx_async_work(CPUState *cpu,
|
|
|
|
run_on_cpu_data data)
|
2015-08-25 22:45:09 +08:00
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2017-02-24 02:29:20 +08:00
|
|
|
target_ulong addr_and_mmuidx = (target_ulong) data.target_ptr;
|
|
|
|
target_ulong addr = addr_and_mmuidx & TARGET_PAGE_MASK;
|
|
|
|
unsigned long mmu_idx_bitmap = addr_and_mmuidx & ALL_MMUIDX_BITS;
|
|
|
|
int page = (addr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
int mmu_idx;
|
|
|
|
int i;
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
tlb_debug("page:%d addr:"TARGET_FMT_lx" mmu_idx:0x%lx\n",
|
|
|
|
page, addr, mmu_idx_bitmap);
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
if (test_bit(mmu_idx, &mmu_idx_bitmap)) {
|
|
|
|
tlb_flush_entry(&env->tlb_table[mmu_idx][page], addr);
|
2015-08-25 22:45:09 +08:00
|
|
|
|
2017-02-24 02:29:19 +08:00
|
|
|
/* check whether there are vltb entries that need to be flushed */
|
|
|
|
for (i = 0; i < CPU_VTLB_SIZE; i++) {
|
|
|
|
tlb_flush_entry(&env->tlb_v_table[mmu_idx][i], addr);
|
|
|
|
}
|
2015-08-25 22:45:09 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
tb_flush_jmp_cache(cpu, addr);
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:20 +08:00
|
|
|
static void tlb_check_page_and_flush_by_mmuidx_async_work(CPUState *cpu,
|
|
|
|
run_on_cpu_data data)
|
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
|
|
|
target_ulong addr_and_mmuidx = (target_ulong) data.target_ptr;
|
|
|
|
target_ulong addr = addr_and_mmuidx & TARGET_PAGE_MASK;
|
|
|
|
unsigned long mmu_idx_bitmap = addr_and_mmuidx & ALL_MMUIDX_BITS;
|
|
|
|
|
|
|
|
tlb_debug("addr:"TARGET_FMT_lx" mmu_idx: %04lx\n", addr, mmu_idx_bitmap);
|
|
|
|
|
|
|
|
/* Check if we need to flush due to large pages. */
|
|
|
|
if ((addr & env->tlb_flush_mask) == env->tlb_flush_addr) {
|
|
|
|
tlb_debug("forced full flush ("
|
|
|
|
TARGET_FMT_lx "/" TARGET_FMT_lx ")\n",
|
|
|
|
env->tlb_flush_addr, env->tlb_flush_mask);
|
|
|
|
|
|
|
|
tlb_flush_by_mmuidx_async_work(cpu,
|
|
|
|
RUN_ON_CPU_HOST_INT(mmu_idx_bitmap));
|
|
|
|
} else {
|
|
|
|
tlb_flush_page_by_mmuidx_async_work(cpu, data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_page_by_mmuidx(CPUState *cpu, target_ulong addr, uint16_t idxmap)
|
|
|
|
{
|
|
|
|
target_ulong addr_and_mmu_idx;
|
|
|
|
|
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%" PRIx16 "\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
addr_and_mmu_idx = addr & TARGET_PAGE_MASK;
|
|
|
|
addr_and_mmu_idx |= idxmap;
|
|
|
|
|
|
|
|
if (!qemu_cpu_is_self(cpu)) {
|
|
|
|
async_run_on_cpu(cpu, tlb_check_page_and_flush_by_mmuidx_async_work,
|
|
|
|
RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
} else {
|
|
|
|
tlb_check_page_and_flush_by_mmuidx_async_work(
|
|
|
|
cpu, RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:22 +08:00
|
|
|
void tlb_flush_page_by_mmuidx_all_cpus(CPUState *src_cpu, target_ulong addr,
|
|
|
|
uint16_t idxmap)
|
2017-02-24 02:29:18 +08:00
|
|
|
{
|
2017-02-24 02:29:22 +08:00
|
|
|
const run_on_cpu_func fn = tlb_check_page_and_flush_by_mmuidx_async_work;
|
|
|
|
target_ulong addr_and_mmu_idx;
|
2017-02-24 02:29:18 +08:00
|
|
|
|
2017-02-24 02:29:22 +08:00
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%"PRIx16"\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
addr_and_mmu_idx = addr & TARGET_PAGE_MASK;
|
|
|
|
addr_and_mmu_idx |= idxmap;
|
|
|
|
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
fn(src_cpu, RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_page_by_mmuidx_all_cpus_synced(CPUState *src_cpu,
|
|
|
|
target_ulong addr,
|
|
|
|
uint16_t idxmap)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_check_page_and_flush_by_mmuidx_async_work;
|
|
|
|
target_ulong addr_and_mmu_idx;
|
|
|
|
|
|
|
|
tlb_debug("addr: "TARGET_FMT_lx" mmu_idx:%"PRIx16"\n", addr, idxmap);
|
|
|
|
|
|
|
|
/* This should already be page aligned */
|
|
|
|
addr_and_mmu_idx = addr & TARGET_PAGE_MASK;
|
|
|
|
addr_and_mmu_idx |= idxmap;
|
|
|
|
|
|
|
|
flush_all_helper(src_cpu, fn, RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
async_safe_run_on_cpu(src_cpu, fn, RUN_ON_CPU_TARGET_PTR(addr_and_mmu_idx));
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_page_all_cpus(CPUState *src, target_ulong addr)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_page_async_work;
|
|
|
|
|
|
|
|
flush_all_helper(src, fn, RUN_ON_CPU_TARGET_PTR(addr));
|
|
|
|
fn(src, RUN_ON_CPU_TARGET_PTR(addr));
|
|
|
|
}
|
|
|
|
|
|
|
|
void tlb_flush_page_all_cpus_synced(CPUState *src,
|
|
|
|
target_ulong addr)
|
|
|
|
{
|
|
|
|
const run_on_cpu_func fn = tlb_flush_page_async_work;
|
|
|
|
|
|
|
|
flush_all_helper(src, fn, RUN_ON_CPU_TARGET_PTR(addr));
|
|
|
|
async_safe_run_on_cpu(src, fn, RUN_ON_CPU_TARGET_PTR(addr));
|
2017-02-24 02:29:18 +08:00
|
|
|
}
|
|
|
|
|
2012-04-10 00:50:52 +08: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 19:23:18 +08:00
|
|
|
cpu_physical_memory_test_and_clear_dirty(ram_addr, TARGET_PAGE_SIZE,
|
|
|
|
DIRTY_MEMORY_CODE);
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* update the TLB so that writes in physical page 'phys_addr' are no longer
|
|
|
|
tested for self modifying code */
|
2015-04-22 20:24:54 +08:00
|
|
|
void tlb_unprotect_code(ram_addr_t ram_addr)
|
2012-04-10 00:50:52 +08:00
|
|
|
{
|
2013-10-08 18:44:04 +08:00
|
|
|
cpu_physical_memory_set_dirty_flag(ram_addr, DIRTY_MEMORY_CODE);
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-02-24 02:29:21 +08: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.
|
|
|
|
*
|
|
|
|
* Because we want other vCPUs to respond to changes straight away we
|
|
|
|
* update the te->addr_write field atomically. If the TLB entry has
|
|
|
|
* been changed by the vCPU in the mean time we skip the update.
|
|
|
|
*
|
|
|
|
* As this function uses atomic accesses we also need to ensure
|
|
|
|
* updates to tlb_entries follow the same access rules. We don't need
|
|
|
|
* to worry about this for oversized guests as MTTCG is disabled for
|
|
|
|
* them.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void tlb_reset_dirty_range(CPUTLBEntry *tlb_entry, uintptr_t start,
|
2012-04-10 00:50:52 +08:00
|
|
|
uintptr_t length)
|
|
|
|
{
|
2017-02-24 02:29:21 +08:00
|
|
|
#if TCG_OVERSIZED_GUEST
|
|
|
|
uintptr_t addr = tlb_entry->addr_write;
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2017-02-24 02:29:21 +08:00
|
|
|
if ((addr & (TLB_INVALID_MASK | TLB_MMIO | TLB_NOTDIRTY)) == 0) {
|
|
|
|
addr &= TARGET_PAGE_MASK;
|
|
|
|
addr += tlb_entry->addend;
|
2012-04-10 00:50:52 +08:00
|
|
|
if ((addr - start) < length) {
|
|
|
|
tlb_entry->addr_write |= TLB_NOTDIRTY;
|
|
|
|
}
|
|
|
|
}
|
2017-02-24 02:29:21 +08:00
|
|
|
#else
|
|
|
|
/* paired with atomic_mb_set in tlb_set_page_with_attrs */
|
|
|
|
uintptr_t orig_addr = atomic_mb_read(&tlb_entry->addr_write);
|
|
|
|
uintptr_t addr = orig_addr;
|
|
|
|
|
|
|
|
if ((addr & (TLB_INVALID_MASK | TLB_MMIO | TLB_NOTDIRTY)) == 0) {
|
|
|
|
addr &= TARGET_PAGE_MASK;
|
|
|
|
addr += atomic_read(&tlb_entry->addend);
|
|
|
|
if ((addr - start) < length) {
|
|
|
|
uintptr_t notdirty_addr = orig_addr | TLB_NOTDIRTY;
|
|
|
|
atomic_cmpxchg(&tlb_entry->addr_write, orig_addr, notdirty_addr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/* For atomic correctness when running MTTCG we need to use the right
|
|
|
|
* primitives when copying entries */
|
|
|
|
static inline void copy_tlb_helper(CPUTLBEntry *d, CPUTLBEntry *s,
|
|
|
|
bool atomic_set)
|
|
|
|
{
|
|
|
|
#if TCG_OVERSIZED_GUEST
|
|
|
|
*d = *s;
|
|
|
|
#else
|
|
|
|
if (atomic_set) {
|
|
|
|
d->addr_read = s->addr_read;
|
|
|
|
d->addr_code = s->addr_code;
|
|
|
|
atomic_set(&d->addend, atomic_read(&s->addend));
|
|
|
|
/* Pairs with flag setting in tlb_reset_dirty_range */
|
|
|
|
atomic_mb_set(&d->addr_write, atomic_read(&s->addr_write));
|
|
|
|
} else {
|
|
|
|
d->addr_read = s->addr_read;
|
|
|
|
d->addr_write = atomic_read(&s->addr_write);
|
|
|
|
d->addr_code = s->addr_code;
|
|
|
|
d->addend = atomic_read(&s->addend);
|
|
|
|
}
|
|
|
|
#endif
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:21 +08:00
|
|
|
/* This is a cross vCPU call (i.e. another vCPU resetting the flags of
|
|
|
|
* the target vCPU). As such care needs to be taken that we don't
|
|
|
|
* dangerously race with another vCPU update. The only thing actually
|
|
|
|
* updated is the target TLB entry ->addr_write flags.
|
|
|
|
*/
|
2015-09-11 13:39:41 +08:00
|
|
|
void tlb_reset_dirty(CPUState *cpu, ram_addr_t start1, ram_addr_t length)
|
2012-04-10 00:50:52 +08:00
|
|
|
{
|
|
|
|
CPUArchState *env;
|
|
|
|
|
2015-09-11 13:39:41 +08:00
|
|
|
int mmu_idx;
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2015-09-11 13:39:41 +08:00
|
|
|
env = cpu->env_ptr;
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
unsigned int i;
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2015-09-11 13:39:41 +08:00
|
|
|
for (i = 0; i < CPU_TLB_SIZE; i++) {
|
|
|
|
tlb_reset_dirty_range(&env->tlb_table[mmu_idx][i],
|
|
|
|
start1, length);
|
|
|
|
}
|
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 09:35:23 +08:00
|
|
|
|
2015-09-11 13:39:41 +08:00
|
|
|
for (i = 0; i < CPU_VTLB_SIZE; i++) {
|
|
|
|
tlb_reset_dirty_range(&env->tlb_v_table[mmu_idx][i],
|
|
|
|
start1, length);
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void tlb_set_dirty1(CPUTLBEntry *tlb_entry, target_ulong vaddr)
|
|
|
|
{
|
|
|
|
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 13:39:42 +08:00
|
|
|
void tlb_set_dirty(CPUState *cpu, target_ulong vaddr)
|
2012-04-10 00:50:52 +08:00
|
|
|
{
|
2015-09-11 13:39:42 +08:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2012-04-10 00:50:52 +08:00
|
|
|
int i;
|
|
|
|
int mmu_idx;
|
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
|
|
|
|
2012-04-10 00:50:52 +08:00
|
|
|
vaddr &= TARGET_PAGE_MASK;
|
|
|
|
i = (vaddr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
tlb_set_dirty1(&env->tlb_table[mmu_idx][i], 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 09:35:23 +08:00
|
|
|
|
|
|
|
for (mmu_idx = 0; mmu_idx < NB_MMU_MODES; mmu_idx++) {
|
|
|
|
int k;
|
|
|
|
for (k = 0; k < CPU_VTLB_SIZE; k++) {
|
|
|
|
tlb_set_dirty1(&env->tlb_v_table[mmu_idx][k], vaddr);
|
|
|
|
}
|
|
|
|
}
|
2012-04-10 00:50:52 +08: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. */
|
|
|
|
static void tlb_add_large_page(CPUArchState *env, target_ulong vaddr,
|
|
|
|
target_ulong size)
|
|
|
|
{
|
|
|
|
target_ulong mask = ~(size - 1);
|
|
|
|
|
|
|
|
if (env->tlb_flush_addr == (target_ulong)-1) {
|
|
|
|
env->tlb_flush_addr = vaddr & mask;
|
|
|
|
env->tlb_flush_mask = mask;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* 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. */
|
|
|
|
mask &= env->tlb_flush_mask;
|
|
|
|
while (((env->tlb_flush_addr ^ vaddr) & mask) != 0) {
|
|
|
|
mask <<= 1;
|
|
|
|
}
|
|
|
|
env->tlb_flush_addr &= mask;
|
|
|
|
env->tlb_flush_mask = mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add a new TLB entry. At most one entry for a given virtual address
|
2015-01-21 19:09:14 +08: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 23:49:24 +08: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-10 00:50:52 +08:00
|
|
|
{
|
2013-09-03 19:59:37 +08:00
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2012-04-10 00:50:52 +08:00
|
|
|
MemoryRegionSection *section;
|
|
|
|
unsigned int index;
|
|
|
|
target_ulong address;
|
|
|
|
target_ulong code_address;
|
|
|
|
uintptr_t addend;
|
2017-02-24 02:29:21 +08:00
|
|
|
CPUTLBEntry *te, *tv, tn;
|
2013-05-24 18:59:37 +08:00
|
|
|
hwaddr iotlb, xlat, sz;
|
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 09:35:23 +08:00
|
|
|
unsigned vidx = env->vtlb_index++ % CPU_VTLB_SIZE;
|
2016-01-21 22:15:05 +08:00
|
|
|
int asidx = cpu_asidx_from_attrs(cpu, attrs);
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2017-02-24 02:29:16 +08:00
|
|
|
assert_cpu_is_self(cpu);
|
2012-04-10 00:50:52 +08:00
|
|
|
assert(size >= TARGET_PAGE_SIZE);
|
|
|
|
if (size != TARGET_PAGE_SIZE) {
|
|
|
|
tlb_add_large_page(env, vaddr, size);
|
|
|
|
}
|
2013-05-24 18:59:37 +08:00
|
|
|
|
|
|
|
sz = size;
|
2016-01-21 22:15:05 +08:00
|
|
|
section = address_space_translate_for_iotlb(cpu, asidx, paddr, &xlat, &sz);
|
2013-05-24 18:59:37 +08:00
|
|
|
assert(sz >= TARGET_PAGE_SIZE);
|
|
|
|
|
2016-03-15 22:30:24 +08:00
|
|
|
tlb_debug("vaddr=" TARGET_FMT_lx " paddr=0x" TARGET_FMT_plx
|
|
|
|
" prot=%x idx=%d\n",
|
|
|
|
vaddr, paddr, prot, mmu_idx);
|
2012-04-10 00:50:52 +08:00
|
|
|
|
|
|
|
address = vaddr;
|
2013-05-24 22:45:30 +08:00
|
|
|
if (!memory_region_is_ram(section->mr) && !memory_region_is_romd(section->mr)) {
|
|
|
|
/* IO memory case */
|
2012-04-10 00:50:52 +08:00
|
|
|
address |= TLB_MMIO;
|
2013-05-24 22:45:30 +08:00
|
|
|
addend = 0;
|
|
|
|
} else {
|
|
|
|
/* TLB_MMIO for rom/romd handled below */
|
2013-05-24 18:59:37 +08:00
|
|
|
addend = (uintptr_t)memory_region_get_ram_ptr(section->mr) + xlat;
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
code_address = address;
|
2013-09-03 19:32:01 +08:00
|
|
|
iotlb = memory_region_section_get_iotlb(cpu, section, vaddr, paddr, xlat,
|
2013-05-24 18:59:37 +08:00
|
|
|
prot, &address);
|
2012-04-10 00:50:52 +08:00
|
|
|
|
|
|
|
index = (vaddr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
te = &env->tlb_table[mmu_idx][index];
|
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 09:35:23 +08:00
|
|
|
/* do not discard the translation in te, evict it into a victim tlb */
|
2017-02-24 02:29:21 +08:00
|
|
|
tv = &env->tlb_v_table[mmu_idx][vidx];
|
|
|
|
|
|
|
|
/* addr_write can race with tlb_reset_dirty_range */
|
|
|
|
copy_tlb_helper(tv, te, true);
|
|
|
|
|
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 09:35:23 +08:00
|
|
|
env->iotlb_v[mmu_idx][vidx] = env->iotlb[mmu_idx][index];
|
|
|
|
|
|
|
|
/* refill the tlb */
|
2015-04-26 23:49:23 +08:00
|
|
|
env->iotlb[mmu_idx][index].addr = iotlb - vaddr;
|
2015-04-26 23:49:24 +08:00
|
|
|
env->iotlb[mmu_idx][index].attrs = attrs;
|
2017-02-24 02:29:21 +08:00
|
|
|
|
|
|
|
/* Now calculate the new entry */
|
|
|
|
tn.addend = addend - vaddr;
|
2012-04-10 00:50:52 +08:00
|
|
|
if (prot & PAGE_READ) {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_read = address;
|
2012-04-10 00:50:52 +08:00
|
|
|
} else {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_read = -1;
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (prot & PAGE_EXEC) {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_code = code_address;
|
2012-04-10 00:50:52 +08:00
|
|
|
} else {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_code = -1;
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
2017-02-24 02:29:21 +08:00
|
|
|
|
|
|
|
tn.addr_write = -1;
|
2012-04-10 00:50:52 +08:00
|
|
|
if (prot & PAGE_WRITE) {
|
|
|
|
if ((memory_region_is_ram(section->mr) && section->readonly)
|
2012-04-14 22:56:48 +08:00
|
|
|
|| memory_region_is_romd(section->mr)) {
|
2012-04-10 00:50:52 +08:00
|
|
|
/* Write access calls the I/O callback. */
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_write = address | TLB_MMIO;
|
2012-04-10 00:50:52 +08:00
|
|
|
} else if (memory_region_is_ram(section->mr)
|
2016-03-01 14:18:21 +08:00
|
|
|
&& cpu_physical_memory_is_clean(
|
|
|
|
memory_region_get_ram_addr(section->mr) + xlat)) {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_write = address | TLB_NOTDIRTY;
|
2012-04-10 00:50:52 +08:00
|
|
|
} else {
|
2017-02-24 02:29:21 +08:00
|
|
|
tn.addr_write = address;
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
}
|
2017-02-24 02:29:21 +08:00
|
|
|
|
|
|
|
/* Pairs with flag setting in tlb_reset_dirty_range */
|
|
|
|
copy_tlb_helper(te, &tn, true);
|
|
|
|
/* atomic_mb_set(&te->addr_write, write_address); */
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
|
2015-04-26 23:49:24 +08: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);
|
|
|
|
}
|
|
|
|
|
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-21 01:07:05 +08:00
|
|
|
static void report_bad_exec(CPUState *cpu, target_ulong addr)
|
|
|
|
{
|
|
|
|
/* Accidentally executing outside RAM or ROM is quite common for
|
|
|
|
* several user-error situations, so report it in a way that
|
|
|
|
* makes it clear that this isn't a QEMU bug and provide suggestions
|
|
|
|
* about what a user could do to fix things.
|
|
|
|
*/
|
|
|
|
error_report("Trying to execute code outside RAM or ROM at 0x"
|
|
|
|
TARGET_FMT_lx, addr);
|
|
|
|
error_printf("This usually means one of the following happened:\n\n"
|
|
|
|
"(1) You told QEMU to execute a kernel for the wrong machine "
|
|
|
|
"type, and it crashed on startup (eg trying to run a "
|
|
|
|
"raspberry pi kernel on a versatilepb QEMU machine)\n"
|
|
|
|
"(2) You didn't give QEMU a kernel or BIOS filename at all, "
|
|
|
|
"and QEMU executed a ROM full of no-op instructions until "
|
|
|
|
"it fell off the end\n"
|
|
|
|
"(3) Your guest kernel has a bug and crashed by jumping "
|
|
|
|
"off into nowhere\n\n"
|
|
|
|
"This is almost always one of the first two, so check your "
|
|
|
|
"command line and that you are using the right type of kernel "
|
|
|
|
"for this machine.\n"
|
|
|
|
"If you think option (3) is likely then you can try debugging "
|
|
|
|
"your guest with the -d debug options; in particular "
|
|
|
|
"-d guest_errors will cause the log to include a dump of the "
|
|
|
|
"guest register state at this point.\n\n"
|
|
|
|
"Execution cannot continue; stopping here.\n\n");
|
|
|
|
|
|
|
|
/* Report also to the logs, with more detail including register dump */
|
|
|
|
qemu_log_mask(LOG_GUEST_ERROR, "qemu: fatal: Trying to execute code "
|
|
|
|
"outside RAM or ROM at 0x" TARGET_FMT_lx "\n", addr);
|
|
|
|
log_cpu_state_mask(LOG_GUEST_ERROR, cpu, CPU_DUMP_FPU | CPU_DUMP_CCOP);
|
|
|
|
}
|
|
|
|
|
2017-02-24 02:29:17 +08: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;
|
|
|
|
}
|
|
|
|
|
2012-04-10 00:50:52 +08:00
|
|
|
/* NOTE: this function can trigger an exception */
|
|
|
|
/* NOTE2: the returned address is not exactly the physical address: it
|
2012-08-11 00:14:05 +08:00
|
|
|
* is actually a ram_addr_t (in system mode; the user mode emulation
|
|
|
|
* version of this function returns a guest virtual address).
|
|
|
|
*/
|
2012-04-10 00:50:52 +08:00
|
|
|
tb_page_addr_t get_page_addr_code(CPUArchState *env1, target_ulong addr)
|
|
|
|
{
|
|
|
|
int mmu_idx, page_index, pd;
|
|
|
|
void *p;
|
|
|
|
MemoryRegion *mr;
|
2013-12-17 11:06:51 +08:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env1);
|
2016-01-21 22:15:05 +08:00
|
|
|
CPUIOTLBEntry *iotlbentry;
|
2012-04-10 00:50:52 +08:00
|
|
|
|
|
|
|
page_index = (addr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
2015-08-17 15:34:10 +08:00
|
|
|
mmu_idx = cpu_mmu_index(env1, true);
|
2012-04-10 00:50:52 +08:00
|
|
|
if (unlikely(env1->tlb_table[mmu_idx][page_index].addr_code !=
|
|
|
|
(addr & TARGET_PAGE_MASK))) {
|
|
|
|
cpu_ldub_code(env1, addr);
|
|
|
|
}
|
2016-01-21 22:15:05 +08:00
|
|
|
iotlbentry = &env1->iotlb[mmu_idx][page_index];
|
|
|
|
pd = iotlbentry->addr & ~TARGET_PAGE_MASK;
|
|
|
|
mr = iotlb_to_region(cpu, pd, iotlbentry->attrs);
|
2012-04-10 00:50:52 +08:00
|
|
|
if (memory_region_is_unassigned(mr)) {
|
2017-02-28 20:08:15 +08:00
|
|
|
cpu_unassigned_access(cpu, addr, false, true, 0, 4);
|
|
|
|
/* The CPU's unassigned access hook might have longjumped out
|
|
|
|
* with an exception. If it didn't (or there was no hook) then
|
|
|
|
* we can't proceed further.
|
|
|
|
*/
|
|
|
|
report_bad_exec(cpu, addr);
|
|
|
|
exit(1);
|
2012-04-10 00:50:52 +08:00
|
|
|
}
|
|
|
|
p = (void *)((uintptr_t)addr + env1->tlb_table[mmu_idx][page_index].addend);
|
|
|
|
return qemu_ram_addr_from_host_nofail(p);
|
|
|
|
}
|
|
|
|
|
2016-07-09 09:51:28 +08:00
|
|
|
static uint64_t io_readx(CPUArchState *env, CPUIOTLBEntry *iotlbentry,
|
|
|
|
target_ulong addr, uintptr_t retaddr, int size)
|
|
|
|
{
|
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
|
|
|
hwaddr physaddr = iotlbentry->addr;
|
|
|
|
MemoryRegion *mr = iotlb_to_region(cpu, physaddr, iotlbentry->attrs);
|
|
|
|
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-24 02:29:11 +08:00
|
|
|
bool locked = false;
|
2016-07-09 09:51:28 +08:00
|
|
|
|
|
|
|
physaddr = (physaddr & TARGET_PAGE_MASK) + addr;
|
|
|
|
cpu->mem_io_pc = retaddr;
|
|
|
|
if (mr != &io_mem_rom && mr != &io_mem_notdirty && !cpu->can_do_io) {
|
|
|
|
cpu_io_recompile(cpu, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
cpu->mem_io_vaddr = addr;
|
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-24 02:29:11 +08:00
|
|
|
|
|
|
|
if (mr->global_locking) {
|
|
|
|
qemu_mutex_lock_iothread();
|
|
|
|
locked = true;
|
|
|
|
}
|
2016-07-09 09:51:28 +08:00
|
|
|
memory_region_dispatch_read(mr, physaddr, &val, size, iotlbentry->attrs);
|
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-24 02:29:11 +08:00
|
|
|
if (locked) {
|
|
|
|
qemu_mutex_unlock_iothread();
|
|
|
|
}
|
|
|
|
|
2016-07-09 09:51:28 +08:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void io_writex(CPUArchState *env, CPUIOTLBEntry *iotlbentry,
|
|
|
|
uint64_t val, target_ulong addr,
|
|
|
|
uintptr_t retaddr, int size)
|
|
|
|
{
|
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
|
|
|
hwaddr physaddr = iotlbentry->addr;
|
|
|
|
MemoryRegion *mr = iotlb_to_region(cpu, physaddr, iotlbentry->attrs);
|
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-24 02:29:11 +08:00
|
|
|
bool locked = false;
|
2016-07-09 09:51:28 +08:00
|
|
|
|
|
|
|
physaddr = (physaddr & TARGET_PAGE_MASK) + addr;
|
|
|
|
if (mr != &io_mem_rom && mr != &io_mem_notdirty && !cpu->can_do_io) {
|
|
|
|
cpu_io_recompile(cpu, retaddr);
|
|
|
|
}
|
|
|
|
cpu->mem_io_vaddr = addr;
|
|
|
|
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-24 02:29:11 +08:00
|
|
|
|
|
|
|
if (mr->global_locking) {
|
|
|
|
qemu_mutex_lock_iothread();
|
|
|
|
locked = true;
|
|
|
|
}
|
2016-07-09 09:51:28 +08:00
|
|
|
memory_region_dispatch_write(mr, physaddr, val, size, iotlbentry->attrs);
|
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-24 02:29:11 +08:00
|
|
|
if (locked) {
|
|
|
|
qemu_mutex_unlock_iothread();
|
|
|
|
}
|
2016-07-09 09:51:28 +08:00
|
|
|
}
|
|
|
|
|
2016-07-09 03:19:32 +08: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;
|
|
|
|
for (vidx = 0; vidx < CPU_VTLB_SIZE; ++vidx) {
|
|
|
|
CPUTLBEntry *vtlb = &env->tlb_v_table[mmu_idx][vidx];
|
|
|
|
target_ulong cmp = *(target_ulong *)((uintptr_t)vtlb + elt_ofs);
|
|
|
|
|
|
|
|
if (cmp == page) {
|
|
|
|
/* Found entry in victim tlb, swap tlb and iotlb. */
|
|
|
|
CPUTLBEntry tmptlb, *tlb = &env->tlb_table[mmu_idx][index];
|
2017-02-24 02:29:21 +08:00
|
|
|
|
|
|
|
copy_tlb_helper(&tmptlb, tlb, false);
|
|
|
|
copy_tlb_helper(tlb, vtlb, true);
|
|
|
|
copy_tlb_helper(vtlb, &tmptlb, true);
|
|
|
|
|
2016-07-09 03:19:32 +08:00
|
|
|
CPUIOTLBEntry tmpio, *io = &env->iotlb[mmu_idx][index];
|
|
|
|
CPUIOTLBEntry *vio = &env->iotlb_v[mmu_idx][vidx];
|
|
|
|
tmpio = *io; *io = *vio; *vio = tmpio;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Macro to call the above, with local variables from the use context. */
|
2016-07-07 02:26:52 +08:00
|
|
|
#define VICTIM_TLB_HIT(TY, ADDR) \
|
2016-07-09 03:19:32 +08:00
|
|
|
victim_tlb_hit(env, mmu_idx, index, offsetof(CPUTLBEntry, TY), \
|
2016-07-07 02:26:52 +08:00
|
|
|
(ADDR) & TARGET_PAGE_MASK)
|
2016-07-09 03:19:32 +08:00
|
|
|
|
2016-07-09 09:22:26 +08:00
|
|
|
/* Probe for whether the specified guest write access is permitted.
|
|
|
|
* If it is not permitted then an exception will be taken in the same
|
|
|
|
* way as if this were a real write access (and we will not return).
|
|
|
|
* Otherwise the function will return, and there will be a valid
|
|
|
|
* entry in the TLB for this access.
|
|
|
|
*/
|
|
|
|
void probe_write(CPUArchState *env, target_ulong addr, int mmu_idx,
|
|
|
|
uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
int index = (addr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
target_ulong tlb_addr = env->tlb_table[mmu_idx][index].addr_write;
|
|
|
|
|
|
|
|
if ((addr & TARGET_PAGE_MASK)
|
|
|
|
!= (tlb_addr & (TARGET_PAGE_MASK | TLB_INVALID_MASK))) {
|
|
|
|
/* TLB entry is for a different page */
|
|
|
|
if (!VICTIM_TLB_HIT(addr_write, addr)) {
|
|
|
|
tlb_fill(ENV_GET_CPU(env), addr, MMU_DATA_STORE, mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-06-29 02:37:27 +08:00
|
|
|
/* Probe for a read-modify-write atomic operation. Do not allow unaligned
|
|
|
|
* operations, or io operations to proceed. Return the host address. */
|
|
|
|
static void *atomic_mmu_lookup(CPUArchState *env, target_ulong addr,
|
|
|
|
TCGMemOpIdx oi, uintptr_t retaddr)
|
|
|
|
{
|
|
|
|
size_t mmu_idx = get_mmuidx(oi);
|
|
|
|
size_t index = (addr >> TARGET_PAGE_BITS) & (CPU_TLB_SIZE - 1);
|
|
|
|
CPUTLBEntry *tlbe = &env->tlb_table[mmu_idx][index];
|
|
|
|
target_ulong tlb_addr = tlbe->addr_write;
|
|
|
|
TCGMemOp mop = get_memop(oi);
|
|
|
|
int a_bits = get_alignment_bits(mop);
|
|
|
|
int s_bits = mop & MO_SIZE;
|
|
|
|
|
|
|
|
/* 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 */
|
|
|
|
cpu_unaligned_access(ENV_GET_CPU(env), addr, MMU_DATA_STORE,
|
|
|
|
mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Enforce qemu required alignment. */
|
|
|
|
if (unlikely(addr & ((1 << s_bits) - 1))) {
|
|
|
|
/* 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check TLB entry and enforce page permissions. */
|
|
|
|
if ((addr & TARGET_PAGE_MASK)
|
|
|
|
!= (tlb_addr & (TARGET_PAGE_MASK | TLB_INVALID_MASK))) {
|
|
|
|
if (!VICTIM_TLB_HIT(addr_write, addr)) {
|
|
|
|
tlb_fill(ENV_GET_CPU(env), addr, MMU_DATA_STORE, mmu_idx, retaddr);
|
|
|
|
}
|
|
|
|
tlb_addr = tlbe->addr_write;
|
|
|
|
}
|
|
|
|
|
2017-04-27 13:18:20 +08:00
|
|
|
/* Check notdirty */
|
|
|
|
if (unlikely(tlb_addr & TLB_NOTDIRTY)) {
|
|
|
|
tlb_set_dirty(ENV_GET_CPU(env), addr);
|
|
|
|
tlb_addr = tlb_addr & ~TLB_NOTDIRTY;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Notice an IO access */
|
2016-06-29 02:37:27 +08:00
|
|
|
if (unlikely(tlb_addr & ~TARGET_PAGE_MASK)) {
|
|
|
|
/* There's really nothing that can be done to
|
|
|
|
support this apart from stop-the-world. */
|
|
|
|
goto stop_the_world;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Let the guest notice RMW on a write-only page. */
|
|
|
|
if (unlikely(tlbe->addr_read != tlb_addr)) {
|
|
|
|
tlb_fill(ENV_GET_CPU(env), addr, 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (void *)((uintptr_t)addr + tlbe->addend);
|
|
|
|
|
|
|
|
stop_the_world:
|
|
|
|
cpu_loop_exit_atomic(ENV_GET_CPU(env), retaddr);
|
|
|
|
}
|
|
|
|
|
2016-07-09 10:02:33 +08:00
|
|
|
#ifdef TARGET_WORDS_BIGENDIAN
|
|
|
|
# define TGT_BE(X) (X)
|
|
|
|
# define TGT_LE(X) BSWAP(X)
|
|
|
|
#else
|
|
|
|
# define TGT_BE(X) BSWAP(X)
|
|
|
|
# define TGT_LE(X) (X)
|
|
|
|
#endif
|
|
|
|
|
2014-03-29 00:55:24 +08:00
|
|
|
#define MMUSUFFIX _mmu
|
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 1
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2014-03-29 00:55:24 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 2
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2014-03-29 00:55:24 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 4
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2014-03-29 00:55:24 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 8
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2014-03-29 00:55:24 +08:00
|
|
|
|
2016-06-29 02:37:27 +08:00
|
|
|
/* First set of helpers allows passing in of OI and RETADDR. This makes
|
|
|
|
them callable from other helpers. */
|
|
|
|
|
|
|
|
#define EXTRA_ARGS , TCGMemOpIdx oi, uintptr_t retaddr
|
|
|
|
#define ATOMIC_NAME(X) \
|
|
|
|
HELPER(glue(glue(glue(atomic_ ## X, SUFFIX), END), _mmu))
|
|
|
|
#define ATOMIC_MMU_LOOKUP atomic_mmu_lookup(env, addr, oi, retaddr)
|
|
|
|
|
|
|
|
#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-03 03:23:57 +08:00
|
|
|
#ifdef CONFIG_ATOMIC64
|
2016-06-29 02:37:27 +08:00
|
|
|
#define DATA_SIZE 8
|
|
|
|
#include "atomic_template.h"
|
2016-09-03 03:23:57 +08:00
|
|
|
#endif
|
2016-06-29 02:37:27 +08:00
|
|
|
|
2016-06-30 12:10:59 +08:00
|
|
|
#ifdef CONFIG_ATOMIC128
|
|
|
|
#define DATA_SIZE 16
|
|
|
|
#include "atomic_template.h"
|
|
|
|
#endif
|
|
|
|
|
2016-06-29 02:37:27 +08:00
|
|
|
/* Second set of helpers are directly callable from TCG as helpers. */
|
|
|
|
|
|
|
|
#undef EXTRA_ARGS
|
|
|
|
#undef ATOMIC_NAME
|
|
|
|
#undef ATOMIC_MMU_LOOKUP
|
|
|
|
#define EXTRA_ARGS , TCGMemOpIdx oi
|
|
|
|
#define ATOMIC_NAME(X) HELPER(glue(glue(atomic_ ## X, SUFFIX), END))
|
|
|
|
#define ATOMIC_MMU_LOOKUP atomic_mmu_lookup(env, addr, oi, GETPC())
|
|
|
|
|
|
|
|
#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-03 03:23:57 +08:00
|
|
|
#ifdef CONFIG_ATOMIC64
|
2016-06-29 02:37:27 +08:00
|
|
|
#define DATA_SIZE 8
|
|
|
|
#include "atomic_template.h"
|
2016-09-03 03:23:57 +08:00
|
|
|
#endif
|
2016-06-29 02:37:27 +08:00
|
|
|
|
|
|
|
/* Code access functions. */
|
|
|
|
|
|
|
|
#undef MMUSUFFIX
|
2012-04-10 00:50:52 +08:00
|
|
|
#define MMUSUFFIX _cmmu
|
2016-07-26 08:39:16 +08:00
|
|
|
#undef GETPC
|
|
|
|
#define GETPC() ((uintptr_t)0)
|
2012-04-10 00:50:52 +08:00
|
|
|
#define SOFTMMU_CODE_ACCESS
|
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 1
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 2
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 4
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|
2012-04-10 00:50:52 +08:00
|
|
|
|
2016-07-09 09:14:28 +08:00
|
|
|
#define DATA_SIZE 8
|
2014-03-29 01:00:25 +08:00
|
|
|
#include "softmmu_template.h"
|