2003-03-07 00:23:54 +01:00
|
|
|
/*
|
2012-02-06 07:02:55 +01:00
|
|
|
* emulator main execution loop
|
2007-09-16 23:08:06 +02:00
|
|
|
*
|
2005-04-06 22:47:48 +02:00
|
|
|
* Copyright (c) 2003-2005 Fabrice Bellard
|
2003-03-07 00:23:54 +01:00
|
|
|
*
|
2003-03-23 21:17:16 +01:00
|
|
|
* 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.
|
2003-03-07 00:23:54 +01:00
|
|
|
*
|
2003-03-23 21:17:16 +01: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.
|
2003-03-07 00:23:54 +01:00
|
|
|
*
|
2003-03-23 21:17:16 +01:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2009-07-16 22:47:01 +02:00
|
|
|
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
|
2003-03-07 00:23:54 +01:00
|
|
|
*/
|
2003-06-15 21:51:39 +02:00
|
|
|
#include "config.h"
|
2011-05-15 18:03:25 +02:00
|
|
|
#include "cpu.h"
|
2014-08-01 18:08:57 +02:00
|
|
|
#include "trace.h"
|
2012-10-24 11:12:21 +02:00
|
|
|
#include "disas/disas.h"
|
2008-05-10 12:55:51 +02:00
|
|
|
#include "tcg.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/atomic.h"
|
2012-12-17 18:20:04 +01:00
|
|
|
#include "sysemu/qtest.h"
|
2014-07-25 11:56:31 +02:00
|
|
|
#include "qemu/timer.h"
|
2013-08-16 08:26:30 +02:00
|
|
|
#include "exec/address-spaces.h"
|
|
|
|
#include "exec/memory-internal.h"
|
2015-01-21 12:09:14 +01:00
|
|
|
#include "qemu/rcu.h"
|
2014-07-25 11:56:31 +02:00
|
|
|
|
|
|
|
/* -icount align implementation. */
|
|
|
|
|
|
|
|
typedef struct SyncClocks {
|
|
|
|
int64_t diff_clk;
|
|
|
|
int64_t last_cpu_icount;
|
2014-07-25 11:56:32 +02:00
|
|
|
int64_t realtime_clock;
|
2014-07-25 11:56:31 +02:00
|
|
|
} SyncClocks;
|
|
|
|
|
|
|
|
#if !defined(CONFIG_USER_ONLY)
|
|
|
|
/* Allow the guest to have a max 3ms advance.
|
|
|
|
* The difference between the 2 clocks could therefore
|
|
|
|
* oscillate around 0.
|
|
|
|
*/
|
|
|
|
#define VM_CLOCK_ADVANCE 3000000
|
2014-07-25 11:56:32 +02:00
|
|
|
#define THRESHOLD_REDUCE 1.5
|
|
|
|
#define MAX_DELAY_PRINT_RATE 2000000000LL
|
|
|
|
#define MAX_NB_PRINTS 100
|
2014-07-25 11:56:31 +02:00
|
|
|
|
|
|
|
static void align_clocks(SyncClocks *sc, const CPUState *cpu)
|
|
|
|
{
|
|
|
|
int64_t cpu_icount;
|
|
|
|
|
|
|
|
if (!icount_align_option) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
cpu_icount = cpu->icount_extra + cpu->icount_decr.u16.low;
|
|
|
|
sc->diff_clk += cpu_icount_to_ns(sc->last_cpu_icount - cpu_icount);
|
|
|
|
sc->last_cpu_icount = cpu_icount;
|
|
|
|
|
|
|
|
if (sc->diff_clk > VM_CLOCK_ADVANCE) {
|
|
|
|
#ifndef _WIN32
|
|
|
|
struct timespec sleep_delay, rem_delay;
|
|
|
|
sleep_delay.tv_sec = sc->diff_clk / 1000000000LL;
|
|
|
|
sleep_delay.tv_nsec = sc->diff_clk % 1000000000LL;
|
|
|
|
if (nanosleep(&sleep_delay, &rem_delay) < 0) {
|
2015-01-28 10:09:55 +01:00
|
|
|
sc->diff_clk = rem_delay.tv_sec * 1000000000LL + rem_delay.tv_nsec;
|
2014-07-25 11:56:31 +02:00
|
|
|
} else {
|
|
|
|
sc->diff_clk = 0;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
Sleep(sc->diff_clk / SCALE_MS);
|
|
|
|
sc->diff_clk = 0;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-25 11:56:32 +02:00
|
|
|
static void print_delay(const SyncClocks *sc)
|
|
|
|
{
|
|
|
|
static float threshold_delay;
|
|
|
|
static int64_t last_realtime_clock;
|
|
|
|
static int nb_prints;
|
|
|
|
|
|
|
|
if (icount_align_option &&
|
|
|
|
sc->realtime_clock - last_realtime_clock >= MAX_DELAY_PRINT_RATE &&
|
|
|
|
nb_prints < MAX_NB_PRINTS) {
|
|
|
|
if ((-sc->diff_clk / (float)1000000000LL > threshold_delay) ||
|
|
|
|
(-sc->diff_clk / (float)1000000000LL <
|
|
|
|
(threshold_delay - THRESHOLD_REDUCE))) {
|
|
|
|
threshold_delay = (-sc->diff_clk / 1000000000LL) + 1;
|
|
|
|
printf("Warning: The guest is now late by %.1f to %.1f seconds\n",
|
|
|
|
threshold_delay - 1,
|
|
|
|
threshold_delay);
|
|
|
|
nb_prints++;
|
|
|
|
last_realtime_clock = sc->realtime_clock;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-25 11:56:31 +02:00
|
|
|
static void init_delay_params(SyncClocks *sc,
|
|
|
|
const CPUState *cpu)
|
|
|
|
{
|
|
|
|
if (!icount_align_option) {
|
|
|
|
return;
|
|
|
|
}
|
2015-01-28 10:16:37 +01:00
|
|
|
sc->realtime_clock = qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL_RT);
|
|
|
|
sc->diff_clk = qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL) - sc->realtime_clock;
|
2014-07-25 11:56:31 +02:00
|
|
|
sc->last_cpu_icount = cpu->icount_extra + cpu->icount_decr.u16.low;
|
2014-07-25 11:56:33 +02:00
|
|
|
if (sc->diff_clk < max_delay) {
|
|
|
|
max_delay = sc->diff_clk;
|
|
|
|
}
|
|
|
|
if (sc->diff_clk > max_advance) {
|
|
|
|
max_advance = sc->diff_clk;
|
|
|
|
}
|
2014-07-25 11:56:32 +02:00
|
|
|
|
|
|
|
/* Print every 2s max if the guest is late. We limit the number
|
|
|
|
of printed messages to NB_PRINT_MAX(currently 100) */
|
|
|
|
print_delay(sc);
|
2014-07-25 11:56:31 +02:00
|
|
|
}
|
|
|
|
#else
|
|
|
|
static void align_clocks(SyncClocks *sc, const CPUState *cpu)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static void init_delay_params(SyncClocks *sc, const CPUState *cpu)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif /* CONFIG USER ONLY */
|
2003-03-07 00:23:54 +01:00
|
|
|
|
2013-08-27 17:52:12 +02:00
|
|
|
void cpu_loop_exit(CPUState *cpu)
|
2003-06-15 21:51:39 +02:00
|
|
|
{
|
2013-01-16 19:29:31 +01:00
|
|
|
cpu->current_tb = NULL;
|
2013-08-26 06:22:03 +02:00
|
|
|
siglongjmp(cpu->jmp_env, 1);
|
2003-06-15 21:51:39 +02:00
|
|
|
}
|
2007-06-03 19:44:37 +02:00
|
|
|
|
2004-04-25 23:21:33 +02:00
|
|
|
/* exit the current TB from a signal handler. The host registers are
|
|
|
|
restored in a state compatible with the CPU emulator
|
|
|
|
*/
|
2011-05-21 10:42:35 +02:00
|
|
|
#if defined(CONFIG_SOFTMMU)
|
2013-09-03 02:12:23 +02:00
|
|
|
void cpu_resume_from_signal(CPUState *cpu, void *puc)
|
2011-05-21 10:42:35 +02:00
|
|
|
{
|
|
|
|
/* XXX: restore cpu registers saved in host registers */
|
|
|
|
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = -1;
|
2013-08-26 06:22:03 +02:00
|
|
|
siglongjmp(cpu->jmp_env, 1);
|
2011-05-21 10:42:35 +02:00
|
|
|
}
|
2015-01-15 12:46:47 +01:00
|
|
|
|
|
|
|
void cpu_reload_memory_map(CPUState *cpu)
|
|
|
|
{
|
2015-01-21 12:09:14 +01:00
|
|
|
AddressSpaceDispatch *d;
|
|
|
|
|
|
|
|
if (qemu_in_vcpu_thread()) {
|
|
|
|
/* Do not let the guest prolong the critical section as much as it
|
|
|
|
* as it desires.
|
|
|
|
*
|
|
|
|
* Currently, this is prevented by the I/O thread's periodinc kicking
|
|
|
|
* of the VCPU thread (iothread_requesting_mutex, qemu_cpu_kick_thread)
|
|
|
|
* but this will go away once TCG's execution moves out of the global
|
|
|
|
* mutex.
|
|
|
|
*
|
|
|
|
* This pair matches cpu_exec's rcu_read_lock()/rcu_read_unlock(), which
|
|
|
|
* only protects cpu->as->dispatch. Since we reload it below, we can
|
|
|
|
* split the critical section.
|
|
|
|
*/
|
|
|
|
rcu_read_unlock();
|
|
|
|
rcu_read_lock();
|
|
|
|
}
|
|
|
|
|
2013-08-16 08:26:30 +02:00
|
|
|
/* The CPU and TLB are protected by the iothread lock. */
|
2015-01-21 12:09:14 +01:00
|
|
|
d = atomic_rcu_read(&cpu->as->dispatch);
|
2013-08-16 08:26:30 +02:00
|
|
|
cpu->memory_dispatch = d;
|
2015-01-15 12:46:47 +01:00
|
|
|
tlb_flush(cpu, 1);
|
|
|
|
}
|
2011-05-21 10:42:35 +02:00
|
|
|
#endif
|
2004-04-25 23:21:33 +02:00
|
|
|
|
2013-02-22 19:10:02 +01:00
|
|
|
/* Execute a TB, and fix up the CPU state afterwards if necessary */
|
|
|
|
static inline tcg_target_ulong cpu_tb_exec(CPUState *cpu, uint8_t *tb_ptr)
|
|
|
|
{
|
|
|
|
CPUArchState *env = cpu->env_ptr;
|
2013-11-06 08:29:39 +01:00
|
|
|
uintptr_t next_tb;
|
|
|
|
|
|
|
|
#if defined(DEBUG_DISAS)
|
|
|
|
if (qemu_loglevel_mask(CPU_LOG_TB_CPU)) {
|
|
|
|
#if defined(TARGET_I386)
|
|
|
|
log_cpu_state(cpu, CPU_DUMP_CCOP);
|
|
|
|
#elif defined(TARGET_M68K)
|
|
|
|
/* ??? Should not modify env state for dumping. */
|
|
|
|
cpu_m68k_flush_flags(env, env->cc_op);
|
|
|
|
env->cc_op = CC_OP_FLAGS;
|
|
|
|
env->sr = (env->sr & 0xffe0) | env->cc_dest | (env->cc_x << 4);
|
|
|
|
log_cpu_state(cpu, 0);
|
|
|
|
#else
|
|
|
|
log_cpu_state(cpu, 0);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#endif /* DEBUG_DISAS */
|
|
|
|
|
2014-12-08 08:53:17 +01:00
|
|
|
cpu->can_do_io = 0;
|
2013-11-06 08:29:39 +01:00
|
|
|
next_tb = tcg_qemu_tb_exec(env, tb_ptr);
|
2014-12-08 08:53:17 +01:00
|
|
|
cpu->can_do_io = 1;
|
2014-08-01 18:08:57 +02:00
|
|
|
trace_exec_tb_exit((void *) (next_tb & ~TB_EXIT_MASK),
|
|
|
|
next_tb & TB_EXIT_MASK);
|
|
|
|
|
2013-02-22 19:10:02 +01:00
|
|
|
if ((next_tb & TB_EXIT_MASK) > TB_EXIT_IDX1) {
|
|
|
|
/* We didn't start executing this TB (eg because the instruction
|
|
|
|
* counter hit zero); we must restore the guest PC to the address
|
|
|
|
* of the start of the TB.
|
|
|
|
*/
|
2013-06-28 19:31:32 +02:00
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
2013-02-22 19:10:02 +01:00
|
|
|
TranslationBlock *tb = (TranslationBlock *)(next_tb & ~TB_EXIT_MASK);
|
2013-06-28 19:31:32 +02:00
|
|
|
if (cc->synchronize_from_tb) {
|
|
|
|
cc->synchronize_from_tb(cpu, tb);
|
|
|
|
} else {
|
|
|
|
assert(cc->set_pc);
|
|
|
|
cc->set_pc(cpu, tb->pc);
|
|
|
|
}
|
2013-02-22 19:10:02 +01:00
|
|
|
}
|
2013-02-22 19:10:03 +01:00
|
|
|
if ((next_tb & TB_EXIT_MASK) == TB_EXIT_REQUESTED) {
|
|
|
|
/* We were asked to stop executing TBs (probably a pending
|
|
|
|
* interrupt. We've now stopped, so clear the flag.
|
|
|
|
*/
|
|
|
|
cpu->tcg_exit_req = 0;
|
|
|
|
}
|
2013-02-22 19:10:02 +01:00
|
|
|
return next_tb;
|
|
|
|
}
|
|
|
|
|
2008-06-29 03:03:05 +02:00
|
|
|
/* Execute the code without caching the generated code. An interpreter
|
|
|
|
could be used if available. */
|
2012-03-14 01:38:32 +01:00
|
|
|
static void cpu_exec_nocache(CPUArchState *env, int max_cycles,
|
2011-05-15 18:03:25 +02:00
|
|
|
TranslationBlock *orig_tb)
|
2008-06-29 03:03:05 +02:00
|
|
|
{
|
2013-01-16 19:29:31 +01:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
2008-06-29 03:03:05 +02:00
|
|
|
TranslationBlock *tb;
|
2014-11-26 11:38:52 +01:00
|
|
|
target_ulong pc = orig_tb->pc;
|
|
|
|
target_ulong cs_base = orig_tb->cs_base;
|
|
|
|
uint64_t flags = orig_tb->flags;
|
2008-06-29 03:03:05 +02:00
|
|
|
|
|
|
|
/* Should never happen.
|
|
|
|
We only end up here when an existing TB is too long. */
|
|
|
|
if (max_cycles > CF_COUNT_MASK)
|
|
|
|
max_cycles = CF_COUNT_MASK;
|
|
|
|
|
2014-11-26 11:38:52 +01:00
|
|
|
/* tb_gen_code can flush our orig_tb, invalidate it now */
|
|
|
|
tb_phys_invalidate(orig_tb, -1);
|
|
|
|
tb = tb_gen_code(cpu, pc, cs_base, flags,
|
2014-11-26 11:40:16 +01:00
|
|
|
max_cycles | CF_NOCACHE);
|
2013-01-16 19:29:31 +01:00
|
|
|
cpu->current_tb = tb;
|
2008-06-29 03:03:05 +02:00
|
|
|
/* execute the generated code */
|
2014-08-01 18:08:57 +02:00
|
|
|
trace_exec_tb_nocache(tb, tb->pc);
|
2013-02-22 19:10:02 +01:00
|
|
|
cpu_tb_exec(cpu, tb->tc_ptr);
|
2013-01-16 19:29:31 +01:00
|
|
|
cpu->current_tb = NULL;
|
2008-06-29 03:03:05 +02:00
|
|
|
tb_phys_invalidate(tb, -1);
|
|
|
|
tb_free(tb);
|
|
|
|
}
|
|
|
|
|
2012-03-14 01:38:32 +01:00
|
|
|
static TranslationBlock *tb_find_slow(CPUArchState *env,
|
2011-05-15 18:03:25 +02:00
|
|
|
target_ulong pc,
|
2005-11-20 11:35:40 +01:00
|
|
|
target_ulong cs_base,
|
2007-09-21 00:47:42 +02:00
|
|
|
uint64_t flags)
|
2005-11-20 11:35:40 +01:00
|
|
|
{
|
2013-08-26 06:03:38 +02:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
2005-11-20 11:35:40 +01:00
|
|
|
TranslationBlock *tb, **ptb1;
|
|
|
|
unsigned int h;
|
2011-09-04 13:06:22 +02:00
|
|
|
tb_page_addr_t phys_pc, phys_page1;
|
2010-03-12 17:54:58 +01:00
|
|
|
target_ulong virt_page2;
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2013-01-31 19:47:23 +01:00
|
|
|
tcg_ctx.tb_ctx.tb_invalidated_flag = 0;
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2005-11-20 11:35:40 +01:00
|
|
|
/* find translated block using physical mappings */
|
2010-03-12 17:54:58 +01:00
|
|
|
phys_pc = get_page_addr_code(env, pc);
|
2005-11-20 11:35:40 +01:00
|
|
|
phys_page1 = phys_pc & TARGET_PAGE_MASK;
|
|
|
|
h = tb_phys_hash_func(phys_pc);
|
2013-01-31 19:47:23 +01:00
|
|
|
ptb1 = &tcg_ctx.tb_ctx.tb_phys_hash[h];
|
2005-11-20 11:35:40 +01:00
|
|
|
for(;;) {
|
|
|
|
tb = *ptb1;
|
|
|
|
if (!tb)
|
|
|
|
goto not_found;
|
2007-09-16 23:08:06 +02:00
|
|
|
if (tb->pc == pc &&
|
2005-11-20 11:35:40 +01:00
|
|
|
tb->page_addr[0] == phys_page1 &&
|
2007-09-16 23:08:06 +02:00
|
|
|
tb->cs_base == cs_base &&
|
2005-11-20 11:35:40 +01:00
|
|
|
tb->flags == flags) {
|
|
|
|
/* check next page if needed */
|
|
|
|
if (tb->page_addr[1] != -1) {
|
2011-09-04 13:06:22 +02:00
|
|
|
tb_page_addr_t phys_page2;
|
|
|
|
|
2007-09-16 23:08:06 +02:00
|
|
|
virt_page2 = (pc & TARGET_PAGE_MASK) +
|
2005-11-20 11:35:40 +01:00
|
|
|
TARGET_PAGE_SIZE;
|
2010-03-12 17:54:58 +01:00
|
|
|
phys_page2 = get_page_addr_code(env, virt_page2);
|
2005-11-20 11:35:40 +01:00
|
|
|
if (tb->page_addr[1] == phys_page2)
|
|
|
|
goto found;
|
|
|
|
} else {
|
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ptb1 = &tb->phys_hash_next;
|
|
|
|
}
|
|
|
|
not_found:
|
2008-06-29 03:03:05 +02:00
|
|
|
/* if no translated code available, then translate it now */
|
2013-09-01 17:43:17 +02:00
|
|
|
tb = tb_gen_code(cpu, pc, cs_base, flags, 0);
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2005-11-20 11:35:40 +01:00
|
|
|
found:
|
2010-12-02 14:12:46 +01:00
|
|
|
/* Move the last found TB to the head of the list */
|
|
|
|
if (likely(*ptb1)) {
|
|
|
|
*ptb1 = tb->phys_hash_next;
|
2013-01-31 19:47:23 +01:00
|
|
|
tb->phys_hash_next = tcg_ctx.tb_ctx.tb_phys_hash[h];
|
|
|
|
tcg_ctx.tb_ctx.tb_phys_hash[h] = tb;
|
2010-12-02 14:12:46 +01:00
|
|
|
}
|
2005-11-20 11:35:40 +01:00
|
|
|
/* we add the TB in the virtual pc hash table */
|
2013-08-26 06:03:38 +02:00
|
|
|
cpu->tb_jmp_cache[tb_jmp_cache_hash_func(pc)] = tb;
|
2005-11-20 11:35:40 +01:00
|
|
|
return tb;
|
|
|
|
}
|
|
|
|
|
2012-03-14 01:38:32 +01:00
|
|
|
static inline TranslationBlock *tb_find_fast(CPUArchState *env)
|
2005-11-20 11:35:40 +01:00
|
|
|
{
|
2013-08-26 06:03:38 +02:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
2005-11-20 11:35:40 +01:00
|
|
|
TranslationBlock *tb;
|
|
|
|
target_ulong cs_base, pc;
|
2008-11-18 20:46:41 +01:00
|
|
|
int flags;
|
2005-11-20 11:35:40 +01:00
|
|
|
|
|
|
|
/* we record a subset of the CPU state. It will
|
|
|
|
always be the same before a given translated block
|
|
|
|
is executed. */
|
2008-11-18 20:46:41 +01:00
|
|
|
cpu_get_tb_cpu_state(env, &pc, &cs_base, &flags);
|
2013-08-26 06:03:38 +02:00
|
|
|
tb = cpu->tb_jmp_cache[tb_jmp_cache_hash_func(pc)];
|
2008-07-03 19:57:36 +02:00
|
|
|
if (unlikely(!tb || tb->pc != pc || tb->cs_base != cs_base ||
|
|
|
|
tb->flags != flags)) {
|
2011-05-15 18:03:25 +02:00
|
|
|
tb = tb_find_slow(env, pc, cs_base, flags);
|
2005-11-20 11:35:40 +01:00
|
|
|
}
|
|
|
|
return tb;
|
|
|
|
}
|
|
|
|
|
2012-03-14 01:38:32 +01:00
|
|
|
static void cpu_handle_debug_exception(CPUArchState *env)
|
2011-03-15 12:26:13 +01:00
|
|
|
{
|
2013-08-26 18:23:18 +02:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
2014-09-12 15:06:48 +02:00
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
2011-03-15 12:26:13 +01:00
|
|
|
CPUWatchpoint *wp;
|
|
|
|
|
2013-08-26 18:23:18 +02:00
|
|
|
if (!cpu->watchpoint_hit) {
|
|
|
|
QTAILQ_FOREACH(wp, &cpu->watchpoints, entry) {
|
2011-03-15 12:26:13 +01:00
|
|
|
wp->flags &= ~BP_WATCHPOINT_HIT;
|
|
|
|
}
|
|
|
|
}
|
2014-09-12 15:06:48 +02:00
|
|
|
|
|
|
|
cc->debug_excp_handler(cpu);
|
2011-03-15 12:26:13 +01:00
|
|
|
}
|
|
|
|
|
2003-03-07 00:23:54 +01:00
|
|
|
/* main execution loop */
|
|
|
|
|
2010-05-04 14:45:20 +02:00
|
|
|
volatile sig_atomic_t exit_request;
|
|
|
|
|
2012-03-14 01:38:32 +01:00
|
|
|
int cpu_exec(CPUArchState *env)
|
2003-03-07 00:23:54 +01:00
|
|
|
{
|
2012-05-04 19:39:23 +02:00
|
|
|
CPUState *cpu = ENV_GET_CPU(env);
|
2013-02-02 10:57:51 +01:00
|
|
|
CPUClass *cc = CPU_GET_CLASS(cpu);
|
2013-12-24 03:18:12 +01:00
|
|
|
#ifdef TARGET_I386
|
|
|
|
X86CPU *x86_cpu = X86_CPU(cpu);
|
2013-02-02 10:57:51 +01:00
|
|
|
#endif
|
2005-11-20 11:35:40 +01:00
|
|
|
int ret, interrupt_request;
|
|
|
|
TranslationBlock *tb;
|
2005-01-04 00:35:10 +01:00
|
|
|
uint8_t *tc_ptr;
|
2013-08-20 23:40:25 +02:00
|
|
|
uintptr_t next_tb;
|
2014-07-25 11:56:31 +02:00
|
|
|
SyncClocks sc;
|
|
|
|
|
2014-04-04 18:42:56 +02:00
|
|
|
/* This must be volatile so it is not trashed by longjmp() */
|
|
|
|
volatile bool have_tb_lock = false;
|
2003-06-09 17:28:00 +02:00
|
|
|
|
2013-01-17 18:51:17 +01:00
|
|
|
if (cpu->halted) {
|
2012-05-03 06:43:49 +02:00
|
|
|
if (!cpu_has_work(cpu)) {
|
2011-03-12 17:43:56 +01:00
|
|
|
return EXCP_HALTED;
|
|
|
|
}
|
|
|
|
|
2013-01-17 18:51:17 +01:00
|
|
|
cpu->halted = 0;
|
2011-03-12 17:43:56 +01:00
|
|
|
}
|
2005-11-23 22:02:53 +01:00
|
|
|
|
2013-05-27 05:17:50 +02:00
|
|
|
current_cpu = cpu;
|
2003-06-15 21:51:39 +02:00
|
|
|
|
2013-05-27 05:17:50 +02:00
|
|
|
/* As long as current_cpu is null, up to the assignment just above,
|
2013-04-09 18:06:54 +02:00
|
|
|
* requests by other threads to exit the execution loop are expected to
|
|
|
|
* be issued using the exit_request global. We must make sure that our
|
2013-05-27 05:17:50 +02:00
|
|
|
* evaluation of the global value is performed past the current_cpu
|
2013-04-09 18:06:54 +02:00
|
|
|
* value transition point, which requires a memory barrier as well as
|
|
|
|
* an instruction scheduling constraint on modern architectures. */
|
|
|
|
smp_mb();
|
|
|
|
|
2015-01-21 12:09:14 +01:00
|
|
|
rcu_read_lock();
|
|
|
|
|
2010-06-25 16:56:52 +02:00
|
|
|
if (unlikely(exit_request)) {
|
2012-12-17 08:02:44 +01:00
|
|
|
cpu->exit_request = 1;
|
2010-05-04 14:45:20 +02:00
|
|
|
}
|
|
|
|
|
2014-09-13 18:45:12 +02:00
|
|
|
cc->cpu_exec_enter(cpu);
|
2003-05-10 15:13:54 +02:00
|
|
|
|
2014-07-25 11:56:31 +02:00
|
|
|
/* Calculate difference between guest clock and host clock.
|
|
|
|
* This delay includes the delay of the last cycle, so
|
|
|
|
* what we have to do is sleep until it is 0. As for the
|
|
|
|
* advance/delay we gain here, we try to fix it next time.
|
|
|
|
*/
|
|
|
|
init_delay_params(&sc, cpu);
|
|
|
|
|
2003-03-07 00:23:54 +01:00
|
|
|
/* prepare setjmp context for exception handling */
|
2003-06-24 15:22:59 +02:00
|
|
|
for(;;) {
|
2013-08-26 06:22:03 +02:00
|
|
|
if (sigsetjmp(cpu->jmp_env, 0) == 0) {
|
2003-06-24 15:22:59 +02:00
|
|
|
/* if an exception is pending, we execute it here */
|
2013-08-26 08:31:06 +02:00
|
|
|
if (cpu->exception_index >= 0) {
|
|
|
|
if (cpu->exception_index >= EXCP_INTERRUPT) {
|
2003-06-24 15:22:59 +02:00
|
|
|
/* exit request from the cpu execution loop */
|
2013-08-26 08:31:06 +02:00
|
|
|
ret = cpu->exception_index;
|
2011-03-15 12:26:13 +01:00
|
|
|
if (ret == EXCP_DEBUG) {
|
|
|
|
cpu_handle_debug_exception(env);
|
|
|
|
}
|
2014-11-26 11:39:20 +01:00
|
|
|
cpu->exception_index = -1;
|
2003-06-24 15:22:59 +02:00
|
|
|
break;
|
2009-01-14 20:40:27 +01:00
|
|
|
} else {
|
|
|
|
#if defined(CONFIG_USER_ONLY)
|
2003-06-24 15:22:59 +02:00
|
|
|
/* if user mode only, we simulate a fake exception
|
2006-12-07 19:28:42 +01:00
|
|
|
which will be handled outside the cpu execution
|
2003-06-24 15:22:59 +02:00
|
|
|
loop */
|
2003-06-25 18:12:37 +02:00
|
|
|
#if defined(TARGET_I386)
|
2013-02-02 10:57:51 +01:00
|
|
|
cc->do_interrupt(cpu);
|
2003-06-25 18:12:37 +02:00
|
|
|
#endif
|
2013-08-26 08:31:06 +02:00
|
|
|
ret = cpu->exception_index;
|
2014-11-26 11:39:20 +01:00
|
|
|
cpu->exception_index = -1;
|
2003-06-24 15:22:59 +02:00
|
|
|
break;
|
2009-01-14 20:40:27 +01:00
|
|
|
#else
|
2013-02-02 10:57:51 +01:00
|
|
|
cc->do_interrupt(cpu);
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = -1;
|
2003-06-25 18:12:37 +02:00
|
|
|
#endif
|
2003-06-24 15:22:59 +02:00
|
|
|
}
|
2007-09-16 23:08:06 +02:00
|
|
|
}
|
2005-02-10 23:05:51 +01:00
|
|
|
|
2008-05-04 08:38:18 +02:00
|
|
|
next_tb = 0; /* force lookup of first TB */
|
2003-06-24 15:22:59 +02:00
|
|
|
for(;;) {
|
2013-01-17 18:51:17 +01:00
|
|
|
interrupt_request = cpu->interrupt_request;
|
2008-11-06 19:54:46 +01:00
|
|
|
if (unlikely(interrupt_request)) {
|
2013-06-21 20:20:45 +02:00
|
|
|
if (unlikely(cpu->singlestep_enabled & SSTEP_NOIRQ)) {
|
2008-11-06 19:54:46 +01:00
|
|
|
/* Mask out external interrupts for this step. */
|
2011-05-04 22:34:25 +02:00
|
|
|
interrupt_request &= ~CPU_INTERRUPT_SSTEP_MASK;
|
2008-11-06 19:54:46 +01:00
|
|
|
}
|
2007-03-17 00:58:11 +01:00
|
|
|
if (interrupt_request & CPU_INTERRUPT_DEBUG) {
|
2013-01-17 18:51:17 +01:00
|
|
|
cpu->interrupt_request &= ~CPU_INTERRUPT_DEBUG;
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = EXCP_DEBUG;
|
2013-08-27 17:52:12 +02:00
|
|
|
cpu_loop_exit(cpu);
|
2007-03-17 00:58:11 +01:00
|
|
|
}
|
2007-05-01 03:28:01 +02:00
|
|
|
if (interrupt_request & CPU_INTERRUPT_HALT) {
|
2013-01-17 18:51:17 +01:00
|
|
|
cpu->interrupt_request &= ~CPU_INTERRUPT_HALT;
|
|
|
|
cpu->halted = 1;
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = EXCP_HLT;
|
2013-08-27 17:52:12 +02:00
|
|
|
cpu_loop_exit(cpu);
|
2007-05-01 03:28:01 +02:00
|
|
|
}
|
2013-03-05 15:35:17 +01:00
|
|
|
#if defined(TARGET_I386)
|
|
|
|
if (interrupt_request & CPU_INTERRUPT_INIT) {
|
|
|
|
cpu_svm_check_intercept_param(env, SVM_EXIT_INIT, 0);
|
|
|
|
do_cpu_init(x86_cpu);
|
|
|
|
cpu->exception_index = EXCP_HALTED;
|
|
|
|
cpu_loop_exit(cpu);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
if (interrupt_request & CPU_INTERRUPT_RESET) {
|
|
|
|
cpu_reset(cpu);
|
|
|
|
}
|
2003-06-30 15:12:32 +02:00
|
|
|
#endif
|
2014-09-13 18:45:17 +02:00
|
|
|
/* The target hook has 3 exit conditions:
|
|
|
|
False when the interrupt isn't processed,
|
|
|
|
True when it is, and we should restart on a new TB,
|
|
|
|
and via longjmp via cpu_loop_exit. */
|
|
|
|
if (cc->cpu_exec_interrupt(cpu, interrupt_request)) {
|
|
|
|
next_tb = 0;
|
|
|
|
}
|
|
|
|
/* Don't use the cached interrupt_request value,
|
|
|
|
do_interrupt may have updated the EXITTB flag. */
|
2013-01-17 18:51:17 +01:00
|
|
|
if (cpu->interrupt_request & CPU_INTERRUPT_EXITTB) {
|
|
|
|
cpu->interrupt_request &= ~CPU_INTERRUPT_EXITTB;
|
2004-02-16 22:58:54 +01:00
|
|
|
/* ensure that no TB jump will be modified as
|
|
|
|
the program flow was changed */
|
2008-05-04 08:38:18 +02:00
|
|
|
next_tb = 0;
|
2004-02-16 22:58:54 +01:00
|
|
|
}
|
2009-03-06 22:48:00 +01:00
|
|
|
}
|
2012-12-17 08:02:44 +01:00
|
|
|
if (unlikely(cpu->exit_request)) {
|
|
|
|
cpu->exit_request = 0;
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = EXCP_INTERRUPT;
|
2013-08-27 17:52:12 +02:00
|
|
|
cpu_loop_exit(cpu);
|
2003-06-24 15:22:59 +02:00
|
|
|
}
|
2013-01-31 19:47:23 +01:00
|
|
|
spin_lock(&tcg_ctx.tb_ctx.tb_lock);
|
2014-04-04 18:42:56 +02:00
|
|
|
have_tb_lock = true;
|
2011-05-15 18:03:25 +02:00
|
|
|
tb = tb_find_fast(env);
|
2008-06-07 22:50:51 +02:00
|
|
|
/* Note: we do it here to avoid a gcc bug on Mac OS X when
|
|
|
|
doing it in tb_find_slow */
|
2013-01-31 19:47:23 +01:00
|
|
|
if (tcg_ctx.tb_ctx.tb_invalidated_flag) {
|
2008-06-07 22:50:51 +02:00
|
|
|
/* as some TB could have been invalidated because
|
|
|
|
of memory exceptions while generating the code, we
|
|
|
|
must recompute the hash index here */
|
|
|
|
next_tb = 0;
|
2013-01-31 19:47:23 +01:00
|
|
|
tcg_ctx.tb_ctx.tb_invalidated_flag = 0;
|
2008-06-07 22:50:51 +02:00
|
|
|
}
|
2013-04-11 22:21:46 +02:00
|
|
|
if (qemu_loglevel_mask(CPU_LOG_EXEC)) {
|
|
|
|
qemu_log("Trace %p [" TARGET_FMT_lx "] %s\n",
|
|
|
|
tb->tc_ptr, tb->pc, lookup_symbol(tb->pc));
|
|
|
|
}
|
2005-11-20 11:35:40 +01:00
|
|
|
/* see if we can patch the calling TB. When the TB
|
|
|
|
spans two pages, we cannot safely do a direct
|
|
|
|
jump. */
|
2010-01-15 08:56:36 +01:00
|
|
|
if (next_tb != 0 && tb->page_addr[1] == -1) {
|
2013-02-22 19:10:00 +01:00
|
|
|
tb_add_jump((TranslationBlock *)(next_tb & ~TB_EXIT_MASK),
|
|
|
|
next_tb & TB_EXIT_MASK, tb);
|
2003-06-24 15:22:59 +02:00
|
|
|
}
|
2014-04-04 18:42:56 +02:00
|
|
|
have_tb_lock = false;
|
2013-01-31 19:47:23 +01:00
|
|
|
spin_unlock(&tcg_ctx.tb_ctx.tb_lock);
|
2008-11-04 15:18:13 +01:00
|
|
|
|
|
|
|
/* cpu_interrupt might be called while translating the
|
|
|
|
TB, but before it is linked into a potentially
|
|
|
|
infinite loop and becomes env->current_tb. Avoid
|
|
|
|
starting execution if there is a pending interrupt. */
|
2013-01-16 19:29:31 +01:00
|
|
|
cpu->current_tb = tb;
|
2010-06-25 16:56:50 +02:00
|
|
|
barrier();
|
2012-12-17 08:02:44 +01:00
|
|
|
if (likely(!cpu->exit_request)) {
|
2014-08-01 18:08:57 +02:00
|
|
|
trace_exec_tb(tb, tb->pc);
|
2008-06-29 03:03:05 +02:00
|
|
|
tc_ptr = tb->tc_ptr;
|
2012-02-06 07:02:55 +01:00
|
|
|
/* execute the generated code */
|
2013-02-22 19:10:02 +01:00
|
|
|
next_tb = cpu_tb_exec(cpu, tc_ptr);
|
2013-02-22 19:10:03 +01:00
|
|
|
switch (next_tb & TB_EXIT_MASK) {
|
|
|
|
case TB_EXIT_REQUESTED:
|
|
|
|
/* Something asked us to stop executing
|
|
|
|
* chained TBs; just continue round the main
|
|
|
|
* loop. Whatever requested the exit will also
|
|
|
|
* have set something else (eg exit_request or
|
|
|
|
* interrupt_request) which we will handle
|
|
|
|
* next time around the loop.
|
|
|
|
*/
|
|
|
|
next_tb = 0;
|
|
|
|
break;
|
|
|
|
case TB_EXIT_ICOUNT_EXPIRED:
|
|
|
|
{
|
2008-06-30 19:22:19 +02:00
|
|
|
/* Instruction counter expired. */
|
2015-01-26 12:12:22 +01:00
|
|
|
int insns_left = cpu->icount_decr.u32;
|
2013-08-26 05:39:29 +02:00
|
|
|
if (cpu->icount_extra && insns_left >= 0) {
|
2008-06-29 03:03:05 +02:00
|
|
|
/* Refill decrementer and continue execution. */
|
2013-08-26 05:39:29 +02:00
|
|
|
cpu->icount_extra += insns_left;
|
2015-01-26 12:12:22 +01:00
|
|
|
insns_left = MIN(0xffff, cpu->icount_extra);
|
2013-08-26 05:39:29 +02:00
|
|
|
cpu->icount_extra -= insns_left;
|
2013-08-26 05:51:49 +02:00
|
|
|
cpu->icount_decr.u16.low = insns_left;
|
2008-06-29 03:03:05 +02:00
|
|
|
} else {
|
|
|
|
if (insns_left > 0) {
|
|
|
|
/* Execute remaining instructions. */
|
2015-01-26 12:12:22 +01:00
|
|
|
tb = (TranslationBlock *)(next_tb & ~TB_EXIT_MASK);
|
2011-05-15 18:03:25 +02:00
|
|
|
cpu_exec_nocache(env, insns_left, tb);
|
2014-07-25 11:56:31 +02:00
|
|
|
align_clocks(&sc, cpu);
|
2008-06-29 03:03:05 +02:00
|
|
|
}
|
2013-08-26 08:31:06 +02:00
|
|
|
cpu->exception_index = EXCP_INTERRUPT;
|
2008-06-29 03:03:05 +02:00
|
|
|
next_tb = 0;
|
2013-08-27 17:52:12 +02:00
|
|
|
cpu_loop_exit(cpu);
|
2008-06-29 03:03:05 +02:00
|
|
|
}
|
2013-02-22 19:10:03 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
2008-06-29 03:03:05 +02:00
|
|
|
}
|
|
|
|
}
|
2013-01-16 19:29:31 +01:00
|
|
|
cpu->current_tb = NULL;
|
2014-07-25 11:56:31 +02:00
|
|
|
/* Try to align the host and virtual clocks
|
|
|
|
if the guest is in advance */
|
|
|
|
align_clocks(&sc, cpu);
|
2003-08-10 23:48:43 +02:00
|
|
|
/* reset soft MMU for next block (it can currently
|
|
|
|
only be set by a memory fault) */
|
2007-06-03 20:52:15 +02:00
|
|
|
} /* for(;;) */
|
2011-07-02 09:50:51 +02:00
|
|
|
} else {
|
|
|
|
/* Reload env after longjmp - the compiler may have smashed all
|
|
|
|
* local variables as longjmp is marked 'noreturn'. */
|
2013-05-27 05:17:50 +02:00
|
|
|
cpu = current_cpu;
|
|
|
|
env = cpu->env_ptr;
|
2013-10-03 16:09:37 +02:00
|
|
|
cc = CPU_GET_CLASS(cpu);
|
2014-12-08 08:53:17 +01:00
|
|
|
cpu->can_do_io = 1;
|
2013-12-24 03:18:12 +01:00
|
|
|
#ifdef TARGET_I386
|
|
|
|
x86_cpu = X86_CPU(cpu);
|
2013-10-03 16:09:37 +02:00
|
|
|
#endif
|
2014-04-04 18:42:56 +02:00
|
|
|
if (have_tb_lock) {
|
|
|
|
spin_unlock(&tcg_ctx.tb_ctx.tb_lock);
|
|
|
|
have_tb_lock = false;
|
|
|
|
}
|
2003-03-07 00:23:54 +01:00
|
|
|
}
|
2003-06-24 15:22:59 +02:00
|
|
|
} /* for(;;) */
|
|
|
|
|
2014-09-13 18:45:12 +02:00
|
|
|
cc->cpu_exec_exit(cpu);
|
2015-01-21 12:09:14 +01:00
|
|
|
rcu_read_unlock();
|
2007-02-04 14:37:44 +01:00
|
|
|
|
2013-05-27 05:17:50 +02:00
|
|
|
/* fail safe : never use current_cpu outside cpu_exec() */
|
|
|
|
current_cpu = NULL;
|
2003-03-07 00:23:54 +01:00
|
|
|
return ret;
|
|
|
|
}
|