2010-03-15 01:30:19 +03:00
|
|
|
/*
|
|
|
|
* QEMU MIPS timer support
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2013-02-04 18:40:22 +04:00
|
|
|
#include "hw/hw.h"
|
2013-02-05 20:06:20 +04:00
|
|
|
#include "hw/mips/cpudevs.h"
|
2012-12-17 21:20:00 +04:00
|
|
|
#include "qemu/timer.h"
|
2014-06-18 02:10:27 +04:00
|
|
|
#include "sysemu/kvm.h"
|
2006-12-07 00:38:37 +03:00
|
|
|
|
2015-08-25 17:16:21 +03:00
|
|
|
#define TIMER_PERIOD 10 /* 10 ns period for 100 Mhz frequency */
|
2008-04-11 08:55:31 +04:00
|
|
|
|
2006-12-07 00:38:37 +03:00
|
|
|
/* XXX: do not use a global */
|
2012-03-14 04:38:23 +04:00
|
|
|
uint32_t cpu_mips_get_random (CPUMIPSState *env)
|
2006-12-07 00:38:37 +03:00
|
|
|
{
|
pic32: use LCG algorithm for generated random index of TLBWR instruction
The LFSR algorithm, used for generating random TLB indexes for TLBWR
instruction, was inclined to produce a degenerate sequence in some cases.
For example, for 16-entry TLB size and Wired=1, it gives: 15, 6, 7, 2,
7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2...
When replaced with LCG algorithm from ISO/IEC 9899 standard, the sequence
looks much better, with about the same computational effort needed.
Signed-off-by: Serge Vakulenko <serge.vakulenko@gmail.com>
Reviewed-by: Aurelien Jarno <aurelien@aurel32.net>
Reviewed-by: Leon Alrae <leon.alrae@imgtec.com>
Signed-off-by: Leon Alrae <leon.alrae@imgtec.com>
2015-07-06 09:14:50 +03:00
|
|
|
static uint32_t seed = 1;
|
2009-01-08 21:48:12 +03:00
|
|
|
static uint32_t prev_idx = 0;
|
2006-12-07 00:38:37 +03:00
|
|
|
uint32_t idx;
|
2015-09-10 12:15:28 +03:00
|
|
|
uint32_t nb_rand_tlb = env->tlb->nb_tlb - env->CP0_Wired;
|
|
|
|
|
|
|
|
if (nb_rand_tlb == 1) {
|
|
|
|
return env->tlb->nb_tlb - 1;
|
|
|
|
}
|
|
|
|
|
2009-01-08 21:48:12 +03:00
|
|
|
/* Don't return same value twice, so get another value */
|
|
|
|
do {
|
pic32: use LCG algorithm for generated random index of TLBWR instruction
The LFSR algorithm, used for generating random TLB indexes for TLBWR
instruction, was inclined to produce a degenerate sequence in some cases.
For example, for 16-entry TLB size and Wired=1, it gives: 15, 6, 7, 2,
7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2, 7, 2...
When replaced with LCG algorithm from ISO/IEC 9899 standard, the sequence
looks much better, with about the same computational effort needed.
Signed-off-by: Serge Vakulenko <serge.vakulenko@gmail.com>
Reviewed-by: Aurelien Jarno <aurelien@aurel32.net>
Reviewed-by: Leon Alrae <leon.alrae@imgtec.com>
Signed-off-by: Leon Alrae <leon.alrae@imgtec.com>
2015-07-06 09:14:50 +03:00
|
|
|
/* Use a simple algorithm of Linear Congruential Generator
|
|
|
|
* from ISO/IEC 9899 standard. */
|
|
|
|
seed = 1103515245 * seed + 12345;
|
2015-09-10 12:15:28 +03:00
|
|
|
idx = (seed >> 16) % nb_rand_tlb + env->CP0_Wired;
|
2009-01-08 21:48:12 +03:00
|
|
|
} while (idx == prev_idx);
|
|
|
|
prev_idx = idx;
|
2006-12-07 00:38:37 +03:00
|
|
|
return idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* MIPS R4K timer */
|
2012-03-14 04:38:23 +04:00
|
|
|
static void cpu_mips_timer_update(CPUMIPSState *env)
|
2006-12-07 00:38:37 +03:00
|
|
|
{
|
|
|
|
uint64_t now, next;
|
2008-04-11 08:55:31 +04:00
|
|
|
uint32_t wait;
|
2007-03-18 15:43:40 +03:00
|
|
|
|
2013-08-21 19:03:08 +04:00
|
|
|
now = qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL);
|
2015-08-25 17:16:21 +03:00
|
|
|
wait = env->CP0_Compare - env->CP0_Count - (uint32_t)(now / TIMER_PERIOD);
|
|
|
|
next = now + (uint64_t)wait * TIMER_PERIOD;
|
2013-08-21 19:03:08 +04:00
|
|
|
timer_mod(env->timer, next);
|
2006-12-07 00:38:37 +03:00
|
|
|
}
|
|
|
|
|
2011-01-18 02:07:49 +03:00
|
|
|
/* Expire the timer. */
|
2012-03-14 04:38:23 +04:00
|
|
|
static void cpu_mips_timer_expire(CPUMIPSState *env)
|
2011-01-18 02:07:49 +03:00
|
|
|
{
|
|
|
|
cpu_mips_timer_update(env);
|
|
|
|
if (env->insn_flags & ISA_MIPS32R2) {
|
|
|
|
env->CP0_Cause |= 1 << CP0Ca_TI;
|
|
|
|
}
|
|
|
|
qemu_irq_raise(env->irq[(env->CP0_IntCtl >> CP0IntCtl_IPTI) & 0x7]);
|
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
uint32_t cpu_mips_get_count (CPUMIPSState *env)
|
2011-01-18 02:07:49 +03:00
|
|
|
{
|
|
|
|
if (env->CP0_Cause & (1 << CP0Ca_DC)) {
|
|
|
|
return env->CP0_Count;
|
|
|
|
} else {
|
2011-01-18 02:12:22 +03:00
|
|
|
uint64_t now;
|
|
|
|
|
2013-08-21 19:03:08 +04:00
|
|
|
now = qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL);
|
2013-08-21 19:02:39 +04:00
|
|
|
if (timer_pending(env->timer)
|
|
|
|
&& timer_expired(env->timer, now)) {
|
2011-01-18 02:12:22 +03:00
|
|
|
/* The timer has already expired. */
|
|
|
|
cpu_mips_timer_expire(env);
|
|
|
|
}
|
|
|
|
|
2015-08-25 17:16:21 +03:00
|
|
|
return env->CP0_Count + (uint32_t)(now / TIMER_PERIOD);
|
2011-01-18 02:07:49 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
void cpu_mips_store_count (CPUMIPSState *env, uint32_t count)
|
2006-12-07 00:38:37 +03:00
|
|
|
{
|
2014-06-18 02:10:26 +04:00
|
|
|
/*
|
|
|
|
* This gets called from cpu_state_reset(), potentially before timer init.
|
|
|
|
* So env->timer may be NULL, which is also the case with KVM enabled so
|
|
|
|
* treat timer as disabled in that case.
|
|
|
|
*/
|
|
|
|
if (env->CP0_Cause & (1 << CP0Ca_DC) || !env->timer)
|
2008-04-11 08:55:31 +04:00
|
|
|
env->CP0_Count = count;
|
|
|
|
else {
|
|
|
|
/* Store new count register */
|
2015-08-25 17:16:21 +03:00
|
|
|
env->CP0_Count = count -
|
|
|
|
(uint32_t)(qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL) / TIMER_PERIOD);
|
2008-04-11 08:55:31 +04:00
|
|
|
/* Update timer timer */
|
|
|
|
cpu_mips_timer_update(env);
|
|
|
|
}
|
2006-12-07 00:38:37 +03:00
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
void cpu_mips_store_compare (CPUMIPSState *env, uint32_t value)
|
2006-12-07 00:38:37 +03:00
|
|
|
{
|
2007-04-06 03:17:40 +04:00
|
|
|
env->CP0_Compare = value;
|
2008-04-11 08:55:31 +04:00
|
|
|
if (!(env->CP0_Cause & (1 << CP0Ca_DC)))
|
|
|
|
cpu_mips_timer_update(env);
|
|
|
|
if (env->insn_flags & ISA_MIPS32R2)
|
2007-03-18 15:43:40 +03:00
|
|
|
env->CP0_Cause &= ~(1 << CP0Ca_TI);
|
2007-09-25 20:53:15 +04:00
|
|
|
qemu_irq_lower(env->irq[(env->CP0_IntCtl >> CP0IntCtl_IPTI) & 0x7]);
|
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
void cpu_mips_start_count(CPUMIPSState *env)
|
2007-09-25 20:53:15 +04:00
|
|
|
{
|
|
|
|
cpu_mips_store_count(env, env->CP0_Count);
|
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
void cpu_mips_stop_count(CPUMIPSState *env)
|
2007-09-25 20:53:15 +04:00
|
|
|
{
|
|
|
|
/* Store the current value */
|
2015-08-25 17:16:21 +03:00
|
|
|
env->CP0_Count += (uint32_t)(qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL) /
|
|
|
|
TIMER_PERIOD);
|
2006-12-07 00:38:37 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static void mips_timer_cb (void *opaque)
|
|
|
|
{
|
2012-03-14 04:38:23 +04:00
|
|
|
CPUMIPSState *env;
|
2006-12-07 00:38:37 +03:00
|
|
|
|
|
|
|
env = opaque;
|
|
|
|
#if 0
|
2009-01-16 01:34:14 +03:00
|
|
|
qemu_log("%s\n", __func__);
|
2006-12-07 00:38:37 +03:00
|
|
|
#endif
|
2007-09-25 20:53:15 +04:00
|
|
|
|
|
|
|
if (env->CP0_Cause & (1 << CP0Ca_DC))
|
|
|
|
return;
|
|
|
|
|
2008-06-29 05:03:05 +04:00
|
|
|
/* ??? This callback should occur when the counter is exactly equal to
|
|
|
|
the comparator value. Offset the count by one to avoid immediately
|
|
|
|
retriggering the callback before any virtual time has passed. */
|
|
|
|
env->CP0_Count++;
|
2011-01-18 02:07:49 +03:00
|
|
|
cpu_mips_timer_expire(env);
|
2008-06-29 05:03:05 +04:00
|
|
|
env->CP0_Count--;
|
2006-12-07 00:38:37 +03:00
|
|
|
}
|
|
|
|
|
2012-03-14 04:38:23 +04:00
|
|
|
void cpu_mips_clock_init (CPUMIPSState *env)
|
2006-12-07 00:38:37 +03:00
|
|
|
{
|
2014-06-18 02:10:27 +04:00
|
|
|
/*
|
|
|
|
* If we're in KVM mode, don't create the periodic timer, that is handled in
|
|
|
|
* kernel.
|
|
|
|
*/
|
|
|
|
if (!kvm_enabled()) {
|
|
|
|
env->timer = timer_new_ns(QEMU_CLOCK_VIRTUAL, &mips_timer_cb, env);
|
|
|
|
}
|
2006-12-07 00:38:37 +03:00
|
|
|
}
|