2008-10-23 07:26:29 +02:00
|
|
|
#ifndef _ASM_X86_TIMER_H
|
|
|
|
#define _ASM_X86_TIMER_H
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <linux/init.h>
|
2005-09-04 00:57:07 +02:00
|
|
|
#include <linux/pm.h>
|
2008-01-30 13:30:06 +01:00
|
|
|
#include <linux/percpu.h>
|
2009-02-23 00:34:39 +01:00
|
|
|
#include <linux/interrupt.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
#define TICK_SIZE (tick_nsec / 1000)
|
2007-03-05 09:30:35 +01:00
|
|
|
|
|
|
|
unsigned long long native_sched_clock(void);
|
2009-08-20 15:54:21 +02:00
|
|
|
extern int recalibrate_cpu_khz(void);
|
2007-03-05 09:30:35 +01:00
|
|
|
|
2008-07-21 18:22:51 +02:00
|
|
|
extern int no_timer_check;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-30 13:30:06 +01:00
|
|
|
/* Accelerators for sched_clock()
|
2007-07-18 03:37:04 +02:00
|
|
|
* convert from cycles(64bits) => nanoseconds (64bits)
|
|
|
|
* basic equation:
|
|
|
|
* ns = cycles / (freq / ns_per_sec)
|
|
|
|
* ns = cycles * (ns_per_sec / freq)
|
|
|
|
* ns = cycles * (10^9 / (cpu_khz * 10^3))
|
|
|
|
* ns = cycles * (10^6 / cpu_khz)
|
|
|
|
*
|
|
|
|
* Then we use scaling math (suggested by george@mvista.com) to get:
|
|
|
|
* ns = cycles * (10^6 * SC / cpu_khz) / SC
|
|
|
|
* ns = cycles * cyc2ns_scale / SC
|
|
|
|
*
|
|
|
|
* And since SC is a constant power of two, we can convert the div
|
|
|
|
* into a shift.
|
|
|
|
*
|
2008-01-30 13:30:06 +01:00
|
|
|
* We can use khz divisor instead of mhz to keep a better precision, since
|
2007-07-18 03:37:04 +02:00
|
|
|
* cyc2ns_scale is limited to 10^6 * 2^10, which fits in 32 bits.
|
|
|
|
* (mathieu.desnoyers@polymtl.ca)
|
|
|
|
*
|
|
|
|
* -johnstul@us.ibm.com "math is hard, lets go shopping!"
|
2011-11-15 23:12:06 +01:00
|
|
|
*
|
|
|
|
* In:
|
|
|
|
*
|
|
|
|
* ns = cycles * cyc2ns_scale / SC
|
|
|
|
*
|
|
|
|
* Although we may still have enough bits to store the value of ns,
|
|
|
|
* in some cases, we may not have enough bits to store cycles * cyc2ns_scale,
|
|
|
|
* leading to an incorrect result.
|
|
|
|
*
|
|
|
|
* To avoid this, we can decompose 'cycles' into quotient and remainder
|
|
|
|
* of division by SC. Then,
|
|
|
|
*
|
|
|
|
* ns = (quot * SC + rem) * cyc2ns_scale / SC
|
|
|
|
* = quot * cyc2ns_scale + (rem * cyc2ns_scale) / SC
|
|
|
|
*
|
|
|
|
* - sqazi@google.com
|
2007-07-18 03:37:04 +02:00
|
|
|
*/
|
2008-01-30 13:30:06 +01:00
|
|
|
|
|
|
|
DECLARE_PER_CPU(unsigned long, cyc2ns);
|
2009-06-16 21:34:17 +02:00
|
|
|
DECLARE_PER_CPU(unsigned long long, cyc2ns_offset);
|
2007-07-18 03:37:04 +02:00
|
|
|
|
|
|
|
#define CYC2NS_SCALE_FACTOR 10 /* 2^10, carefully chosen */
|
|
|
|
|
2008-01-30 13:30:06 +01:00
|
|
|
static inline unsigned long long __cycles_2_ns(unsigned long long cyc)
|
2007-07-18 03:37:04 +02:00
|
|
|
{
|
2011-11-15 23:12:06 +01:00
|
|
|
unsigned long long quot;
|
|
|
|
unsigned long long rem;
|
2009-06-16 21:34:17 +02:00
|
|
|
int cpu = smp_processor_id();
|
|
|
|
unsigned long long ns = per_cpu(cyc2ns_offset, cpu);
|
2011-11-15 23:12:06 +01:00
|
|
|
quot = (cyc >> CYC2NS_SCALE_FACTOR);
|
|
|
|
rem = cyc & ((1ULL << CYC2NS_SCALE_FACTOR) - 1);
|
|
|
|
ns += quot * per_cpu(cyc2ns, cpu) +
|
|
|
|
((rem * per_cpu(cyc2ns, cpu)) >> CYC2NS_SCALE_FACTOR);
|
2009-06-16 21:34:17 +02:00
|
|
|
return ns;
|
2007-07-18 03:37:04 +02:00
|
|
|
}
|
|
|
|
|
2008-01-30 13:30:06 +01:00
|
|
|
static inline unsigned long long cycles_2_ns(unsigned long long cyc)
|
|
|
|
{
|
|
|
|
unsigned long long ns;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
ns = __cycles_2_ns(cyc);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
|
|
|
|
return ns;
|
|
|
|
}
|
2007-07-18 03:37:04 +02:00
|
|
|
|
2008-10-23 07:26:29 +02:00
|
|
|
#endif /* _ASM_X86_TIMER_H */
|