2007-10-18 16:48:11 +00:00
|
|
|
/*
|
|
|
|
* This file is subject to the terms and conditions of the GNU General Public
|
|
|
|
* License. See the file "COPYING" in the main directory of this archive
|
|
|
|
* for more details.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2007 MIPS Technologies, Inc.
|
|
|
|
* Copyright (C) 2007 Ralf Baechle <ralf@linux-mips.org>
|
|
|
|
*/
|
|
|
|
#include <linux/clockchips.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/percpu.h>
|
2009-06-19 13:05:26 +00:00
|
|
|
#include <linux/smp.h>
|
2010-10-07 13:08:54 +00:00
|
|
|
#include <linux/irq.h>
|
2007-10-18 16:48:11 +00:00
|
|
|
|
|
|
|
#include <asm/time.h>
|
2008-09-09 19:48:52 +00:00
|
|
|
#include <asm/cevt-r4k.h>
|
|
|
|
|
2007-10-18 16:48:11 +00:00
|
|
|
static int mips_next_event(unsigned long delta,
|
2013-01-22 11:59:30 +00:00
|
|
|
struct clock_event_device *evt)
|
2007-10-18 16:48:11 +00:00
|
|
|
{
|
|
|
|
unsigned int cnt;
|
|
|
|
int res;
|
|
|
|
|
|
|
|
cnt = read_c0_count();
|
|
|
|
cnt += delta;
|
|
|
|
write_c0_compare(cnt);
|
2010-11-23 18:26:44 +00:00
|
|
|
res = ((int)(read_c0_count() - cnt) >= 0) ? -ETIME : 0;
|
2007-10-18 16:48:11 +00:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2016-04-22 17:19:17 +00:00
|
|
|
/**
|
|
|
|
* calculate_min_delta() - Calculate a good minimum delta for mips_next_event().
|
|
|
|
*
|
|
|
|
* Running under virtualisation can introduce overhead into mips_next_event() in
|
|
|
|
* the form of hypervisor emulation of CP0_Count/CP0_Compare registers,
|
|
|
|
* potentially with an unnatural frequency, which makes a fixed min_delta_ns
|
|
|
|
* value inappropriate as it may be too small.
|
|
|
|
*
|
|
|
|
* It can also introduce occasional latency from the guest being descheduled.
|
|
|
|
*
|
|
|
|
* This function calculates a good minimum delta based roughly on the 75th
|
|
|
|
* percentile of the time taken to do the mips_next_event() sequence, in order
|
|
|
|
* to handle potentially higher overhead while also eliminating outliers due to
|
|
|
|
* unpredictable hypervisor latency (which can be handled by retries).
|
|
|
|
*
|
|
|
|
* Return: An appropriate minimum delta for the clock event device.
|
|
|
|
*/
|
|
|
|
static unsigned int calculate_min_delta(void)
|
|
|
|
{
|
|
|
|
unsigned int cnt, i, j, k, l;
|
|
|
|
unsigned int buf1[4], buf2[3];
|
|
|
|
unsigned int min_delta;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Calculate the median of 5 75th percentiles of 5 samples of how long
|
|
|
|
* it takes to set CP0_Compare = CP0_Count + delta.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < 5; ++i) {
|
|
|
|
for (j = 0; j < 5; ++j) {
|
|
|
|
/*
|
|
|
|
* This is like the code in mips_next_event(), and
|
|
|
|
* directly measures the borderline "safe" delta.
|
|
|
|
*/
|
|
|
|
cnt = read_c0_count();
|
|
|
|
write_c0_compare(cnt);
|
|
|
|
cnt = read_c0_count() - cnt;
|
|
|
|
|
|
|
|
/* Sorted insert into buf1 */
|
|
|
|
for (k = 0; k < j; ++k) {
|
|
|
|
if (cnt < buf1[k]) {
|
|
|
|
l = min_t(unsigned int,
|
|
|
|
j, ARRAY_SIZE(buf1) - 1);
|
|
|
|
for (; l > k; --l)
|
|
|
|
buf1[l] = buf1[l - 1];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (k < ARRAY_SIZE(buf1))
|
|
|
|
buf1[k] = cnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Sorted insert of 75th percentile into buf2 */
|
2017-04-05 15:32:45 +00:00
|
|
|
for (k = 0; k < i && k < ARRAY_SIZE(buf2); ++k) {
|
2016-04-22 17:19:17 +00:00
|
|
|
if (buf1[ARRAY_SIZE(buf1) - 1] < buf2[k]) {
|
|
|
|
l = min_t(unsigned int,
|
|
|
|
i, ARRAY_SIZE(buf2) - 1);
|
|
|
|
for (; l > k; --l)
|
|
|
|
buf2[l] = buf2[l - 1];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (k < ARRAY_SIZE(buf2))
|
|
|
|
buf2[k] = buf1[ARRAY_SIZE(buf1) - 1];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Use 2 * median of 75th percentiles */
|
|
|
|
min_delta = buf2[ARRAY_SIZE(buf2) - 1] * 2;
|
|
|
|
|
|
|
|
/* Don't go too low */
|
|
|
|
if (min_delta < 0x300)
|
|
|
|
min_delta = 0x300;
|
|
|
|
|
|
|
|
pr_debug("%s: median 75th percentile=%#x, min_delta=%#x\n",
|
|
|
|
__func__, buf2[ARRAY_SIZE(buf2) - 1], min_delta);
|
|
|
|
return min_delta;
|
|
|
|
}
|
|
|
|
|
2008-09-09 19:48:52 +00:00
|
|
|
DEFINE_PER_CPU(struct clock_event_device, mips_clockevent_device);
|
|
|
|
int cp0_timer_irq_installed;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2015-01-27 21:45:47 +00:00
|
|
|
/*
|
|
|
|
* Possibly handle a performance counter interrupt.
|
|
|
|
* Return true if the timer interrupt should not be checked
|
|
|
|
*/
|
|
|
|
static inline int handle_perf_irq(int r2)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* The performance counter overflow interrupt may be shared with the
|
|
|
|
* timer interrupt (cp0_perfcount_irq < 0). If it is and a
|
|
|
|
* performance counter has overflowed (perf_irq() == IRQ_HANDLED)
|
|
|
|
* and we can't reliably determine if a counter interrupt has also
|
|
|
|
* happened (!r2) then don't check for a timer interrupt.
|
|
|
|
*/
|
|
|
|
return (cp0_perfcount_irq < 0) &&
|
|
|
|
perf_irq() == IRQ_HANDLED &&
|
|
|
|
!r2;
|
|
|
|
}
|
|
|
|
|
2008-09-09 19:48:52 +00:00
|
|
|
irqreturn_t c0_compare_interrupt(int irq, void *dev_id)
|
2007-10-18 16:48:11 +00:00
|
|
|
{
|
2014-11-13 13:39:39 +00:00
|
|
|
const int r2 = cpu_has_mips_r2_r6;
|
2007-10-18 16:48:11 +00:00
|
|
|
struct clock_event_device *cd;
|
|
|
|
int cpu = smp_processor_id();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Suckage alert:
|
|
|
|
* Before R2 of the architecture there was no way to see if a
|
|
|
|
* performance counter interrupt was pending, so we have to run
|
|
|
|
* the performance counter interrupt handler anyway.
|
|
|
|
*/
|
|
|
|
if (handle_perf_irq(r2))
|
2015-03-20 18:45:09 +00:00
|
|
|
return IRQ_HANDLED;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
|
|
|
/*
|
2013-01-22 11:59:30 +00:00
|
|
|
* The same applies to performance counter interrupts. But with the
|
2007-10-18 16:48:11 +00:00
|
|
|
* above we now know that the reason we got here must be a timer
|
|
|
|
* interrupt. Being the paranoiacs we are we check anyway.
|
|
|
|
*/
|
2015-01-27 21:45:48 +00:00
|
|
|
if (!r2 || (read_c0_cause() & CAUSEF_TI)) {
|
2008-09-09 19:48:52 +00:00
|
|
|
/* Clear Count/Compare Interrupt */
|
|
|
|
write_c0_compare(read_c0_compare());
|
2007-10-18 16:48:11 +00:00
|
|
|
cd = &per_cpu(mips_clockevent_device, cpu);
|
|
|
|
cd->event_handler(cd);
|
2015-03-20 18:45:09 +00:00
|
|
|
|
|
|
|
return IRQ_HANDLED;
|
2007-10-18 16:48:11 +00:00
|
|
|
}
|
|
|
|
|
2015-03-20 18:45:09 +00:00
|
|
|
return IRQ_NONE;
|
2007-10-18 16:48:11 +00:00
|
|
|
}
|
|
|
|
|
2008-09-09 19:48:52 +00:00
|
|
|
struct irqaction c0_compare_irqaction = {
|
2007-10-18 16:48:11 +00:00
|
|
|
.handler = c0_compare_interrupt,
|
2015-01-27 21:45:52 +00:00
|
|
|
/*
|
|
|
|
* IRQF_SHARED: The timer interrupt may be shared with other interrupts
|
|
|
|
* such as perf counter and FDC interrupts.
|
|
|
|
*/
|
|
|
|
.flags = IRQF_PERCPU | IRQF_TIMER | IRQF_SHARED,
|
2007-10-18 16:48:11 +00:00
|
|
|
.name = "timer",
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2008-09-09 19:48:52 +00:00
|
|
|
void mips_event_handler(struct clock_event_device *dev)
|
2007-10-18 16:48:11 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* FIXME: This doesn't hold for the relocated E9000 compare interrupt.
|
|
|
|
*/
|
|
|
|
static int c0_compare_int_pending(void)
|
|
|
|
{
|
2015-01-19 12:00:55 +00:00
|
|
|
/* When cpu_has_mips_r2, this checks Cause.TI instead of Cause.IP7 */
|
2009-12-22 01:49:22 +00:00
|
|
|
return (read_c0_cause() >> cp0_compare_irq_shift) & (1ul << CAUSEB_IP);
|
2007-10-18 16:48:11 +00:00
|
|
|
}
|
|
|
|
|
2008-09-09 19:48:52 +00:00
|
|
|
/*
|
|
|
|
* Compare interrupt can be routed and latched outside the core,
|
2011-11-08 14:59:01 +00:00
|
|
|
* so wait up to worst case number of cycle counter ticks for timer interrupt
|
|
|
|
* changes to propagate to the cause register.
|
2008-09-09 19:48:52 +00:00
|
|
|
*/
|
2011-11-08 14:59:01 +00:00
|
|
|
#define COMPARE_INT_SEEN_TICKS 50
|
2008-09-09 19:48:52 +00:00
|
|
|
|
|
|
|
int c0_compare_int_usable(void)
|
2007-10-18 16:48:11 +00:00
|
|
|
{
|
2007-10-23 12:55:42 +00:00
|
|
|
unsigned int delta;
|
2007-10-18 16:48:11 +00:00
|
|
|
unsigned int cnt;
|
|
|
|
|
2012-11-22 02:34:03 +00:00
|
|
|
#ifdef CONFIG_KVM_GUEST
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
|
2007-10-18 16:48:11 +00:00
|
|
|
/*
|
2013-01-22 11:59:30 +00:00
|
|
|
* IP7 already pending? Try to clear it by acking the timer.
|
2007-10-18 16:48:11 +00:00
|
|
|
*/
|
|
|
|
if (c0_compare_int_pending()) {
|
2011-11-08 14:59:01 +00:00
|
|
|
cnt = read_c0_count();
|
|
|
|
write_c0_compare(cnt);
|
|
|
|
back_to_back_c0_hazard();
|
|
|
|
while (read_c0_count() < (cnt + COMPARE_INT_SEEN_TICKS))
|
|
|
|
if (!c0_compare_int_pending())
|
|
|
|
break;
|
2007-10-18 16:48:11 +00:00
|
|
|
if (c0_compare_int_pending())
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-10-23 12:55:42 +00:00
|
|
|
for (delta = 0x10; delta <= 0x400000; delta <<= 1) {
|
|
|
|
cnt = read_c0_count();
|
|
|
|
cnt += delta;
|
|
|
|
write_c0_compare(cnt);
|
2011-11-08 14:59:01 +00:00
|
|
|
back_to_back_c0_hazard();
|
2007-10-23 12:55:42 +00:00
|
|
|
if ((int)(read_c0_count() - cnt) < 0)
|
|
|
|
break;
|
|
|
|
/* increase delta if the timer was already expired */
|
|
|
|
}
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2007-10-23 12:51:19 +00:00
|
|
|
while ((int)(read_c0_count() - cnt) <= 0)
|
2007-10-18 16:48:11 +00:00
|
|
|
; /* Wait for expiry */
|
|
|
|
|
2011-11-08 14:59:01 +00:00
|
|
|
while (read_c0_count() < (cnt + COMPARE_INT_SEEN_TICKS))
|
|
|
|
if (c0_compare_int_pending())
|
|
|
|
break;
|
2007-10-18 16:48:11 +00:00
|
|
|
if (!c0_compare_int_pending())
|
|
|
|
return 0;
|
2011-11-08 14:59:01 +00:00
|
|
|
cnt = read_c0_count();
|
|
|
|
write_c0_compare(cnt);
|
|
|
|
back_to_back_c0_hazard();
|
|
|
|
while (read_c0_count() < (cnt + COMPARE_INT_SEEN_TICKS))
|
|
|
|
if (!c0_compare_int_pending())
|
|
|
|
break;
|
2007-10-18 16:48:11 +00:00
|
|
|
if (c0_compare_int_pending())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Feels like a real count / compare timer.
|
|
|
|
*/
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2015-07-12 23:11:38 +00:00
|
|
|
unsigned int __weak get_c0_compare_int(void)
|
|
|
|
{
|
|
|
|
return MIPS_CPU_IRQ_BASE + cp0_compare_irq;
|
|
|
|
}
|
|
|
|
|
MIPS: Delete __cpuinit/__CPUINIT usage from MIPS code
commit 3747069b25e419f6b51395f48127e9812abc3596 upstream.
The __cpuinit type of throwaway sections might have made sense
some time ago when RAM was more constrained, but now the savings
do not offset the cost and complications. For example, the fix in
commit 5e427ec2d0 ("x86: Fix bit corruption at CPU resume time")
is a good example of the nasty type of bugs that can be created
with improper use of the various __init prefixes.
After a discussion on LKML[1] it was decided that cpuinit should go
the way of devinit and be phased out. Once all the users are gone,
we can then finally remove the macros themselves from linux/init.h.
Note that some harmless section mismatch warnings may result, since
notify_cpu_starting() and cpu_up() are arch independent (kernel/cpu.c)
and are flagged as __cpuinit -- so if we remove the __cpuinit from
the arch specific callers, we will also get section mismatch warnings.
As an intermediate step, we intend to turn the linux/init.h cpuinit
related content into no-ops as early as possible, since that will get
rid of these warnings. In any case, they are temporary and harmless.
Here, we remove all the MIPS __cpuinit from C code and __CPUINIT
from asm files. MIPS is interesting in this respect, because there
are also uasm users hiding behind their own renamed versions of the
__cpuinit macros.
[1] https://lkml.org/lkml/2013/5/20/589
[ralf@linux-mips.org: Folded in Paul's followup fix.]
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
Cc: linux-mips@linux-mips.org
Patchwork: https://patchwork.linux-mips.org/patch/5494/
Patchwork: https://patchwork.linux-mips.org/patch/5495/
Patchwork: https://patchwork.linux-mips.org/patch/5509/
Signed-off-by: Ralf Baechle <ralf@linux-mips.org>
2013-06-18 13:38:59 +00:00
|
|
|
int r4k_clockevent_init(void)
|
2007-10-18 16:48:11 +00:00
|
|
|
{
|
|
|
|
unsigned int cpu = smp_processor_id();
|
|
|
|
struct clock_event_device *cd;
|
2016-04-22 17:19:17 +00:00
|
|
|
unsigned int irq, min_delta;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2007-10-26 13:27:05 +00:00
|
|
|
if (!cpu_has_counter || !mips_hpt_frequency)
|
2007-11-21 16:39:44 +00:00
|
|
|
return -ENXIO;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
|
|
|
if (!c0_compare_int_usable())
|
2007-11-21 16:39:44 +00:00
|
|
|
return -ENXIO;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2007-10-29 14:23:43 +00:00
|
|
|
/*
|
|
|
|
* With vectored interrupts things are getting platform specific.
|
|
|
|
* get_c0_compare_int is a hook to allow a platform to return the
|
2015-07-12 23:11:38 +00:00
|
|
|
* interrupt number of its liking.
|
2007-10-29 14:23:43 +00:00
|
|
|
*/
|
2015-07-12 23:11:38 +00:00
|
|
|
irq = get_c0_compare_int();
|
2007-10-29 14:23:43 +00:00
|
|
|
|
2007-10-18 16:48:11 +00:00
|
|
|
cd = &per_cpu(mips_clockevent_device, cpu);
|
|
|
|
|
|
|
|
cd->name = "MIPS";
|
2014-02-14 09:20:15 +00:00
|
|
|
cd->features = CLOCK_EVT_FEAT_ONESHOT |
|
2014-04-15 11:05:24 +00:00
|
|
|
CLOCK_EVT_FEAT_C3STOP |
|
|
|
|
CLOCK_EVT_FEAT_PERCPU;
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2016-04-22 17:19:17 +00:00
|
|
|
min_delta = calculate_min_delta();
|
2007-10-18 16:48:11 +00:00
|
|
|
|
|
|
|
cd->rating = 300;
|
|
|
|
cd->irq = irq;
|
2008-12-13 10:50:26 +00:00
|
|
|
cd->cpumask = cpumask_of(cpu);
|
2007-10-18 16:48:11 +00:00
|
|
|
cd->set_next_event = mips_next_event;
|
|
|
|
cd->event_handler = mips_event_handler;
|
|
|
|
|
2016-07-21 06:27:49 +00:00
|
|
|
clockevents_config_and_register(cd, mips_hpt_frequency, min_delta, 0x7fffffff);
|
2007-10-18 16:48:11 +00:00
|
|
|
|
2007-10-30 02:21:08 +00:00
|
|
|
if (cp0_timer_irq_installed)
|
2007-11-21 16:39:44 +00:00
|
|
|
return 0;
|
2007-10-29 14:23:43 +00:00
|
|
|
|
|
|
|
cp0_timer_irq_installed = 1;
|
|
|
|
|
|
|
|
setup_irq(irq, &c0_compare_irqaction);
|
2007-11-21 16:39:44 +00:00
|
|
|
|
|
|
|
return 0;
|
2007-10-18 16:48:11 +00:00
|
|
|
}
|
2008-09-09 19:48:52 +00:00
|
|
|
|