blob: 5469630b27f56d732b10036ba381df39f28ca52b [file] [log] [blame]
H. Peter Anvin1965aae2008-10-22 22:26:29 -07001#ifndef _ASM_X86_TIMER_H
2#define _ASM_X86_TIMER_H
Linus Torvalds1da177e2005-04-16 15:20:36 -07003#include <linux/init.h>
Shaohua Lic3c433e2005-09-03 15:57:07 -07004#include <linux/pm.h>
Guillaume Chazarain53d517c2008-01-30 13:30:06 +01005#include <linux/percpu.h>
Ingo Molnar8e6dafd2009-02-23 00:34:39 +01006#include <linux/interrupt.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007
Linus Torvalds1da177e2005-04-16 15:20:36 -07008#define TICK_SIZE (tick_nsec / 1000)
Zachary Amsden6cb9a832007-03-05 00:30:35 -08009
Zachary Amsden6cb9a832007-03-05 00:30:35 -080010unsigned long long native_sched_clock(void);
Stephen Rothwell25c1a412009-03-30 11:10:27 +110011extern int recalibrate_cpu_khz(void);
Jaswinder Singhcc038492008-07-21 21:52:51 +053012
Thomas Gleixner64fcbac2009-08-20 15:54:21 +020013#if defined(CONFIG_X86_32) && defined(CONFIG_X86_IO_APIC)
14extern int timer_ack;
15#else
16# define timer_ack (0)
17#endif
18
Jaswinder Singhcc038492008-07-21 21:52:51 +053019extern int no_timer_check;
Linus Torvalds1da177e2005-04-16 15:20:36 -070020
Guillaume Chazarain53d517c2008-01-30 13:30:06 +010021/* Accelerators for sched_clock()
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070022 * convert from cycles(64bits) => nanoseconds (64bits)
23 * basic equation:
24 * ns = cycles / (freq / ns_per_sec)
25 * ns = cycles * (ns_per_sec / freq)
26 * ns = cycles * (10^9 / (cpu_khz * 10^3))
27 * ns = cycles * (10^6 / cpu_khz)
28 *
29 * Then we use scaling math (suggested by george@mvista.com) to get:
30 * ns = cycles * (10^6 * SC / cpu_khz) / SC
31 * ns = cycles * cyc2ns_scale / SC
32 *
33 * And since SC is a constant power of two, we can convert the div
34 * into a shift.
35 *
Guillaume Chazarain53d517c2008-01-30 13:30:06 +010036 * We can use khz divisor instead of mhz to keep a better precision, since
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070037 * cyc2ns_scale is limited to 10^6 * 2^10, which fits in 32 bits.
38 * (mathieu.desnoyers@polymtl.ca)
39 *
40 * -johnstul@us.ibm.com "math is hard, lets go shopping!"
41 */
Guillaume Chazarain53d517c2008-01-30 13:30:06 +010042
43DECLARE_PER_CPU(unsigned long, cyc2ns);
Peter Zijlstra84599f82009-06-16 12:34:17 -070044DECLARE_PER_CPU(unsigned long long, cyc2ns_offset);
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070045
46#define CYC2NS_SCALE_FACTOR 10 /* 2^10, carefully chosen */
47
Guillaume Chazarain53d517c2008-01-30 13:30:06 +010048static inline unsigned long long __cycles_2_ns(unsigned long long cyc)
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070049{
Peter Zijlstra84599f82009-06-16 12:34:17 -070050 int cpu = smp_processor_id();
51 unsigned long long ns = per_cpu(cyc2ns_offset, cpu);
52 ns += cyc * per_cpu(cyc2ns, cpu) >> CYC2NS_SCALE_FACTOR;
53 return ns;
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070054}
55
Guillaume Chazarain53d517c2008-01-30 13:30:06 +010056static inline unsigned long long cycles_2_ns(unsigned long long cyc)
57{
58 unsigned long long ns;
59 unsigned long flags;
60
61 local_irq_save(flags);
62 ns = __cycles_2_ns(cyc);
63 local_irq_restore(flags);
64
65 return ns;
66}
Jeremy Fitzhardinge688340e2007-07-17 18:37:04 -070067
H. Peter Anvin1965aae2008-10-22 22:26:29 -070068#endif /* _ASM_X86_TIMER_H */