blob: c0a205101c231a5b6e29e786228fb69c46772f5e [file] [log] [blame]
Peter Zijlstra3e51f332008-05-03 18:29:28 +02001/*
2 * sched_clock for unstable cpu clocks
3 *
4 * Copyright (C) 2008 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
5 *
Steven Rostedtc300ba22008-07-09 00:15:33 -04006 * Updates and enhancements:
7 * Copyright (C) 2008 Red Hat, Inc. Steven Rostedt <srostedt@redhat.com>
8 *
Peter Zijlstra3e51f332008-05-03 18:29:28 +02009 * Based on code by:
10 * Ingo Molnar <mingo@redhat.com>
11 * Guillaume Chazarain <guichaz@gmail.com>
12 *
Peter Zijlstrac6763292010-05-25 10:48:51 +020013 *
14 * What:
15 *
16 * cpu_clock(i) provides a fast (execution time) high resolution
17 * clock with bounded drift between CPUs. The value of cpu_clock(i)
18 * is monotonic for constant i. The timestamp returned is in nanoseconds.
19 *
20 * ######################### BIG FAT WARNING ##########################
21 * # when comparing cpu_clock(i) to cpu_clock(j) for i != j, time can #
22 * # go backwards !! #
23 * ####################################################################
24 *
25 * There is no strict promise about the base, although it tends to start
26 * at 0 on boot (but people really shouldn't rely on that).
27 *
28 * cpu_clock(i) -- can be used from any context, including NMI.
Peter Zijlstrac6763292010-05-25 10:48:51 +020029 * local_clock() -- is cpu_clock() on the current cpu.
30 *
Peter Zijlstraef08f0f2013-11-28 19:31:23 +010031 * sched_clock_cpu(i)
32 *
Peter Zijlstrac6763292010-05-25 10:48:51 +020033 * How:
34 *
35 * The implementation either uses sched_clock() when
36 * !CONFIG_HAVE_UNSTABLE_SCHED_CLOCK, which means in that case the
37 * sched_clock() is assumed to provide these properties (mostly it means
38 * the architecture provides a globally synchronized highres time source).
39 *
40 * Otherwise it tries to create a semi stable clock from a mixture of other
41 * clocks, including:
42 *
43 * - GTOD (clock monotomic)
Peter Zijlstra3e51f332008-05-03 18:29:28 +020044 * - sched_clock()
45 * - explicit idle events
46 *
Peter Zijlstrac6763292010-05-25 10:48:51 +020047 * We use GTOD as base and use sched_clock() deltas to improve resolution. The
48 * deltas are filtered to provide monotonicity and keeping it within an
49 * expected window.
Peter Zijlstra3e51f332008-05-03 18:29:28 +020050 *
51 * Furthermore, explicit sleep and wakeup hooks allow us to account for time
52 * that is otherwise invisible (TSC gets stopped).
53 *
Peter Zijlstra3e51f332008-05-03 18:29:28 +020054 */
Peter Zijlstra3e51f332008-05-03 18:29:28 +020055#include <linux/spinlock.h>
Ingo Molnar6409c4d2008-05-12 21:21:14 +020056#include <linux/hardirq.h>
Paul Gortmaker9984de12011-05-23 14:51:41 -040057#include <linux/export.h>
Ingo Molnarb3425012009-02-26 20:20:29 +010058#include <linux/percpu.h>
59#include <linux/ktime.h>
60#include <linux/sched.h>
Peter Zijlstra35af99e2013-11-28 19:38:42 +010061#include <linux/static_key.h>
Peter Zijlstra6577e422013-12-11 18:55:53 +010062#include <linux/workqueue.h>
Gideon Israel Dsouza52f5684c2014-04-07 15:39:20 -070063#include <linux/compiler.h>
Peter Zijlstra3e51f332008-05-03 18:29:28 +020064
Hugh Dickins2c3d1032008-07-25 19:45:00 +010065/*
66 * Scheduler clock - returns current time in nanosec units.
67 * This is default implementation.
68 * Architectures and sub-architectures can override this.
69 */
Gideon Israel Dsouza52f5684c2014-04-07 15:39:20 -070070unsigned long long __weak sched_clock(void)
Hugh Dickins2c3d1032008-07-25 19:45:00 +010071{
Ron92d23f72009-05-08 22:54:49 +093072 return (unsigned long long)(jiffies - INITIAL_JIFFIES)
73 * (NSEC_PER_SEC / HZ);
Hugh Dickins2c3d1032008-07-25 19:45:00 +010074}
Divyesh Shahb6ac23af2010-04-15 08:54:59 +020075EXPORT_SYMBOL_GPL(sched_clock);
Peter Zijlstra3e51f332008-05-03 18:29:28 +020076
Peter Zijlstra5bb6b1e2010-11-19 21:11:09 +010077__read_mostly int sched_clock_running;
Peter Zijlstrac1955a32008-08-11 08:59:03 +020078
Peter Zijlstra3e51f332008-05-03 18:29:28 +020079#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
Peter Zijlstra35af99e2013-11-28 19:38:42 +010080static struct static_key __sched_clock_stable = STATIC_KEY_INIT;
Peter Zijlstrad375b4e2014-01-22 12:59:18 +010081static int __sched_clock_stable_early;
Peter Zijlstra35af99e2013-11-28 19:38:42 +010082
83int sched_clock_stable(void)
84{
Peter Zijlstrad375b4e2014-01-22 12:59:18 +010085 return static_key_false(&__sched_clock_stable);
86}
87
88static void __set_sched_clock_stable(void)
89{
90 if (!sched_clock_stable())
91 static_key_slow_inc(&__sched_clock_stable);
Peter Zijlstra35af99e2013-11-28 19:38:42 +010092}
93
94void set_sched_clock_stable(void)
95{
Peter Zijlstrad375b4e2014-01-22 12:59:18 +010096 __sched_clock_stable_early = 1;
97
98 smp_mb(); /* matches sched_clock_init() */
99
100 if (!sched_clock_running)
101 return;
102
103 __set_sched_clock_stable();
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100104}
105
Peter Zijlstra6577e422013-12-11 18:55:53 +0100106static void __clear_sched_clock_stable(struct work_struct *work)
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100107{
108 /* XXX worry about clock continuity */
109 if (sched_clock_stable())
Peter Zijlstrad375b4e2014-01-22 12:59:18 +0100110 static_key_slow_dec(&__sched_clock_stable);
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100111}
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200112
Peter Zijlstra6577e422013-12-11 18:55:53 +0100113static DECLARE_WORK(sched_clock_work, __clear_sched_clock_stable);
114
115void clear_sched_clock_stable(void)
116{
Peter Zijlstrad375b4e2014-01-22 12:59:18 +0100117 __sched_clock_stable_early = 0;
118
119 smp_mb(); /* matches sched_clock_init() */
120
121 if (!sched_clock_running)
122 return;
123
124 schedule_work(&sched_clock_work);
Peter Zijlstra6577e422013-12-11 18:55:53 +0100125}
126
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200127struct sched_clock_data {
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200128 u64 tick_raw;
129 u64 tick_gtod;
130 u64 clock;
131};
132
133static DEFINE_PER_CPU_SHARED_ALIGNED(struct sched_clock_data, sched_clock_data);
134
135static inline struct sched_clock_data *this_scd(void)
136{
Christoph Lameter22127e92014-08-17 12:30:25 -0500137 return this_cpu_ptr(&sched_clock_data);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200138}
139
140static inline struct sched_clock_data *cpu_sdc(int cpu)
141{
142 return &per_cpu(sched_clock_data, cpu);
143}
144
145void sched_clock_init(void)
146{
147 u64 ktime_now = ktime_to_ns(ktime_get());
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200148 int cpu;
149
150 for_each_possible_cpu(cpu) {
151 struct sched_clock_data *scd = cpu_sdc(cpu);
152
Peter Zijlstraa3817592008-05-29 10:07:15 +0200153 scd->tick_raw = 0;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200154 scd->tick_gtod = ktime_now;
155 scd->clock = ktime_now;
156 }
Peter Zijlstraa3817592008-05-29 10:07:15 +0200157
158 sched_clock_running = 1;
Peter Zijlstrad375b4e2014-01-22 12:59:18 +0100159
160 /*
161 * Ensure that it is impossible to not do a static_key update.
162 *
163 * Either {set,clear}_sched_clock_stable() must see sched_clock_running
164 * and do the update, or we must see their __sched_clock_stable_early
165 * and do the update, or both.
166 */
167 smp_mb(); /* matches {set,clear}_sched_clock_stable() */
168
169 if (__sched_clock_stable_early)
170 __set_sched_clock_stable();
171 else
172 __clear_sched_clock_stable(NULL);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200173}
174
175/*
Ingo Molnarb3425012009-02-26 20:20:29 +0100176 * min, max except they take wrapping into account
Peter Zijlstra354879b2008-08-25 17:15:34 +0200177 */
178
179static inline u64 wrap_min(u64 x, u64 y)
180{
181 return (s64)(x - y) < 0 ? x : y;
182}
183
184static inline u64 wrap_max(u64 x, u64 y)
185{
186 return (s64)(x - y) > 0 ? x : y;
187}
188
189/*
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200190 * update the percpu scd from the raw @now value
191 *
192 * - filter out backward motion
Peter Zijlstra354879b2008-08-25 17:15:34 +0200193 * - use the GTOD tick value to create a window to filter crazy TSC values
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200194 */
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200195static u64 sched_clock_local(struct sched_clock_data *scd)
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200196{
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200197 u64 now, clock, old_clock, min_clock, max_clock;
198 s64 delta;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200199
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200200again:
201 now = sched_clock();
202 delta = now - scd->tick_raw;
Peter Zijlstra354879b2008-08-25 17:15:34 +0200203 if (unlikely(delta < 0))
204 delta = 0;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200205
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200206 old_clock = scd->clock;
207
Peter Zijlstra354879b2008-08-25 17:15:34 +0200208 /*
209 * scd->clock = clamp(scd->tick_gtod + delta,
Ingo Molnarb3425012009-02-26 20:20:29 +0100210 * max(scd->tick_gtod, scd->clock),
211 * scd->tick_gtod + TICK_NSEC);
Peter Zijlstra354879b2008-08-25 17:15:34 +0200212 */
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200213
Peter Zijlstra354879b2008-08-25 17:15:34 +0200214 clock = scd->tick_gtod + delta;
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200215 min_clock = wrap_max(scd->tick_gtod, old_clock);
216 max_clock = wrap_max(old_clock, scd->tick_gtod + TICK_NSEC);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200217
Peter Zijlstra354879b2008-08-25 17:15:34 +0200218 clock = wrap_max(clock, min_clock);
219 clock = wrap_min(clock, max_clock);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200220
Eric Dumazet152f9d02009-09-30 20:36:19 +0200221 if (cmpxchg64(&scd->clock, old_clock, clock) != old_clock)
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200222 goto again;
Ingo Molnar56b90612008-07-30 10:15:55 +0200223
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200224 return clock;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200225}
226
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200227static u64 sched_clock_remote(struct sched_clock_data *scd)
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200228{
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200229 struct sched_clock_data *my_scd = this_scd();
230 u64 this_clock, remote_clock;
231 u64 *ptr, old_val, val;
232
Thomas Gleixnera1cbcaa2013-04-06 10:10:27 +0200233#if BITS_PER_LONG != 64
234again:
235 /*
236 * Careful here: The local and the remote clock values need to
237 * be read out atomic as we need to compare the values and
238 * then update either the local or the remote side. So the
239 * cmpxchg64 below only protects one readout.
240 *
241 * We must reread via sched_clock_local() in the retry case on
242 * 32bit as an NMI could use sched_clock_local() via the
243 * tracer and hit between the readout of
244 * the low32bit and the high 32bit portion.
245 */
246 this_clock = sched_clock_local(my_scd);
247 /*
248 * We must enforce atomic readout on 32bit, otherwise the
249 * update on the remote cpu can hit inbetween the readout of
250 * the low32bit and the high 32bit portion.
251 */
252 remote_clock = cmpxchg64(&scd->clock, 0, 0);
253#else
254 /*
255 * On 64bit the read of [my]scd->clock is atomic versus the
256 * update, so we can avoid the above 32bit dance.
257 */
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200258 sched_clock_local(my_scd);
259again:
260 this_clock = my_scd->clock;
261 remote_clock = scd->clock;
Thomas Gleixnera1cbcaa2013-04-06 10:10:27 +0200262#endif
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200263
264 /*
265 * Use the opportunity that we have both locks
266 * taken to couple the two clocks: we take the
267 * larger time as the latest time for both
268 * runqueues. (this creates monotonic movement)
269 */
270 if (likely((s64)(remote_clock - this_clock) < 0)) {
271 ptr = &scd->clock;
272 old_val = remote_clock;
273 val = this_clock;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200274 } else {
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200275 /*
276 * Should be rare, but possible:
277 */
278 ptr = &my_scd->clock;
279 old_val = this_clock;
280 val = remote_clock;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200281 }
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200282
Eric Dumazet152f9d02009-09-30 20:36:19 +0200283 if (cmpxchg64(ptr, old_val, val) != old_val)
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200284 goto again;
285
286 return val;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200287}
288
Peter Zijlstrac6763292010-05-25 10:48:51 +0200289/*
290 * Similar to cpu_clock(), but requires local IRQs to be disabled.
291 *
292 * See cpu_clock().
293 */
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200294u64 sched_clock_cpu(int cpu)
295{
Ingo Molnarb3425012009-02-26 20:20:29 +0100296 struct sched_clock_data *scd;
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200297 u64 clock;
298
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100299 if (sched_clock_stable())
Ingo Molnarb3425012009-02-26 20:20:29 +0100300 return sched_clock();
Peter Zijlstraa3817592008-05-29 10:07:15 +0200301
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200302 if (unlikely(!sched_clock_running))
303 return 0ull;
304
Fernando Luis Vazquez Cao96b3d282014-03-06 14:25:28 +0900305 preempt_disable_notrace();
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200306 scd = cpu_sdc(cpu);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200307
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200308 if (cpu != smp_processor_id())
309 clock = sched_clock_remote(scd);
310 else
311 clock = sched_clock_local(scd);
Fernando Luis Vazquez Cao96b3d282014-03-06 14:25:28 +0900312 preempt_enable_notrace();
Ingo Molnare4e4e532008-04-14 08:50:02 +0200313
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200314 return clock;
315}
316
317void sched_clock_tick(void)
318{
Peter Zijlstra8325d9c2009-02-26 21:40:16 +0100319 struct sched_clock_data *scd;
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200320 u64 now, now_gtod;
321
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100322 if (sched_clock_stable())
Peter Zijlstra8325d9c2009-02-26 21:40:16 +0100323 return;
324
Peter Zijlstraa3817592008-05-29 10:07:15 +0200325 if (unlikely(!sched_clock_running))
326 return;
327
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200328 WARN_ON_ONCE(!irqs_disabled());
329
Peter Zijlstra8325d9c2009-02-26 21:40:16 +0100330 scd = this_scd();
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200331 now_gtod = ktime_to_ns(ktime_get());
Steven Rostedta83bc472008-07-09 00:15:32 -0400332 now = sched_clock();
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200333
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200334 scd->tick_raw = now;
335 scd->tick_gtod = now_gtod;
Peter Zijlstradef0a9b2009-09-18 20:14:01 +0200336 sched_clock_local(scd);
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200337}
338
339/*
340 * We are going deep-idle (irqs are disabled):
341 */
342void sched_clock_idle_sleep_event(void)
343{
344 sched_clock_cpu(smp_processor_id());
345}
346EXPORT_SYMBOL_GPL(sched_clock_idle_sleep_event);
347
348/*
349 * We just idled delta nanoseconds (called with irqs disabled):
350 */
351void sched_clock_idle_wakeup_event(u64 delta_ns)
352{
Thomas Gleixner1c5745a2008-12-22 23:05:28 +0100353 if (timekeeping_suspended)
354 return;
355
Peter Zijlstra354879b2008-08-25 17:15:34 +0200356 sched_clock_tick();
Peter Zijlstra3e51f332008-05-03 18:29:28 +0200357 touch_softlockup_watchdog();
358}
359EXPORT_SYMBOL_GPL(sched_clock_idle_wakeup_event);
360
Peter Zijlstrac6763292010-05-25 10:48:51 +0200361/*
362 * As outlined at the top, provides a fast, high resolution, nanosecond
363 * time source that is monotonic per cpu argument and has bounded drift
364 * between cpus.
365 *
366 * ######################### BIG FAT WARNING ##########################
367 * # when comparing cpu_clock(i) to cpu_clock(j) for i != j, time can #
368 * # go backwards !! #
369 * ####################################################################
370 */
371u64 cpu_clock(int cpu)
David Millerb9f8fcd2009-12-13 18:25:02 -0800372{
Peter Zijlstrad375b4e2014-01-22 12:59:18 +0100373 if (!sched_clock_stable())
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100374 return sched_clock_cpu(cpu);
375
376 return sched_clock();
David Millerb9f8fcd2009-12-13 18:25:02 -0800377}
378
Peter Zijlstrac6763292010-05-25 10:48:51 +0200379/*
380 * Similar to cpu_clock() for the current cpu. Time will only be observed
381 * to be monotonic if care is taken to only compare timestampt taken on the
382 * same CPU.
383 *
384 * See cpu_clock().
385 */
386u64 local_clock(void)
387{
Peter Zijlstrad375b4e2014-01-22 12:59:18 +0100388 if (!sched_clock_stable())
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100389 return sched_clock_cpu(raw_smp_processor_id());
390
391 return sched_clock();
Peter Zijlstrac6763292010-05-25 10:48:51 +0200392}
393
Peter Zijlstra8325d9c2009-02-26 21:40:16 +0100394#else /* CONFIG_HAVE_UNSTABLE_SCHED_CLOCK */
395
396void sched_clock_init(void)
397{
398 sched_clock_running = 1;
399}
400
401u64 sched_clock_cpu(int cpu)
402{
403 if (unlikely(!sched_clock_running))
404 return 0;
405
406 return sched_clock();
407}
408
Peter Zijlstrac6763292010-05-25 10:48:51 +0200409u64 cpu_clock(int cpu)
Peter Zijlstra76a2a6e2008-06-27 13:41:15 +0200410{
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100411 return sched_clock();
Peter Zijlstra76a2a6e2008-06-27 13:41:15 +0200412}
David Millerb9f8fcd2009-12-13 18:25:02 -0800413
Peter Zijlstrac6763292010-05-25 10:48:51 +0200414u64 local_clock(void)
415{
Peter Zijlstra35af99e2013-11-28 19:38:42 +0100416 return sched_clock();
Peter Zijlstrac6763292010-05-25 10:48:51 +0200417}
418
David Millerb9f8fcd2009-12-13 18:25:02 -0800419#endif /* CONFIG_HAVE_UNSTABLE_SCHED_CLOCK */
420
Ingo Molnar4c9fe8a2008-06-27 14:49:35 +0200421EXPORT_SYMBOL_GPL(cpu_clock);
Peter Zijlstrac6763292010-05-25 10:48:51 +0200422EXPORT_SYMBOL_GPL(local_clock);
Cyril Bur545a2bf2015-02-12 15:01:24 -0800423
424/*
425 * Running clock - returns the time that has elapsed while a guest has been
426 * running.
427 * On a guest this value should be local_clock minus the time the guest was
428 * suspended by the hypervisor (for any reason).
429 * On bare metal this function should return the same as local_clock.
430 * Architectures and sub-architectures can override this.
431 */
432u64 __weak running_clock(void)
433{
434 return local_clock();
435}