Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 1 | /* |
| 2 | * sched_clock for unstable cpu clocks |
| 3 | * |
| 4 | * Copyright (C) 2008 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> |
| 5 | * |
Steven Rostedt | c300ba2 | 2008-07-09 00:15:33 -0400 | [diff] [blame] | 6 | * Updates and enhancements: |
| 7 | * Copyright (C) 2008 Red Hat, Inc. Steven Rostedt <srostedt@redhat.com> |
| 8 | * |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 9 | * Based on code by: |
| 10 | * Ingo Molnar <mingo@redhat.com> |
| 11 | * Guillaume Chazarain <guichaz@gmail.com> |
| 12 | * |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 13 | * |
| 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 Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 29 | * local_clock() -- is cpu_clock() on the current cpu. |
| 30 | * |
Peter Zijlstra | ef08f0f | 2013-11-28 19:31:23 +0100 | [diff] [blame] | 31 | * sched_clock_cpu(i) |
| 32 | * |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 33 | * 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 Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 44 | * - sched_clock() |
| 45 | * - explicit idle events |
| 46 | * |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 47 | * 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 Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 50 | * |
| 51 | * Furthermore, explicit sleep and wakeup hooks allow us to account for time |
| 52 | * that is otherwise invisible (TSC gets stopped). |
| 53 | * |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 54 | */ |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 55 | #include <linux/spinlock.h> |
Ingo Molnar | 6409c4d | 2008-05-12 21:21:14 +0200 | [diff] [blame] | 56 | #include <linux/hardirq.h> |
Paul Gortmaker | 9984de1 | 2011-05-23 14:51:41 -0400 | [diff] [blame] | 57 | #include <linux/export.h> |
Ingo Molnar | b342501 | 2009-02-26 20:20:29 +0100 | [diff] [blame] | 58 | #include <linux/percpu.h> |
| 59 | #include <linux/ktime.h> |
| 60 | #include <linux/sched.h> |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 61 | #include <linux/static_key.h> |
Peter Zijlstra | 6577e42 | 2013-12-11 18:55:53 +0100 | [diff] [blame] | 62 | #include <linux/workqueue.h> |
Gideon Israel Dsouza | 52f5684c | 2014-04-07 15:39:20 -0700 | [diff] [blame] | 63 | #include <linux/compiler.h> |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 64 | |
Hugh Dickins | 2c3d103 | 2008-07-25 19:45:00 +0100 | [diff] [blame] | 65 | /* |
| 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 Dsouza | 52f5684c | 2014-04-07 15:39:20 -0700 | [diff] [blame] | 70 | unsigned long long __weak sched_clock(void) |
Hugh Dickins | 2c3d103 | 2008-07-25 19:45:00 +0100 | [diff] [blame] | 71 | { |
Ron | 92d23f7 | 2009-05-08 22:54:49 +0930 | [diff] [blame] | 72 | return (unsigned long long)(jiffies - INITIAL_JIFFIES) |
| 73 | * (NSEC_PER_SEC / HZ); |
Hugh Dickins | 2c3d103 | 2008-07-25 19:45:00 +0100 | [diff] [blame] | 74 | } |
Divyesh Shah | b6ac23af | 2010-04-15 08:54:59 +0200 | [diff] [blame] | 75 | EXPORT_SYMBOL_GPL(sched_clock); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 76 | |
Peter Zijlstra | 5bb6b1e | 2010-11-19 21:11:09 +0100 | [diff] [blame] | 77 | __read_mostly int sched_clock_running; |
Peter Zijlstra | c1955a3 | 2008-08-11 08:59:03 +0200 | [diff] [blame] | 78 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 79 | #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 80 | static struct static_key __sched_clock_stable = STATIC_KEY_INIT; |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 81 | static int __sched_clock_stable_early; |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 82 | |
| 83 | int sched_clock_stable(void) |
| 84 | { |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 85 | return static_key_false(&__sched_clock_stable); |
| 86 | } |
| 87 | |
| 88 | static void __set_sched_clock_stable(void) |
| 89 | { |
| 90 | if (!sched_clock_stable()) |
| 91 | static_key_slow_inc(&__sched_clock_stable); |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 92 | } |
| 93 | |
| 94 | void set_sched_clock_stable(void) |
| 95 | { |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 96 | __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 Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 104 | } |
| 105 | |
Peter Zijlstra | 6577e42 | 2013-12-11 18:55:53 +0100 | [diff] [blame] | 106 | static void __clear_sched_clock_stable(struct work_struct *work) |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 107 | { |
| 108 | /* XXX worry about clock continuity */ |
| 109 | if (sched_clock_stable()) |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 110 | static_key_slow_dec(&__sched_clock_stable); |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 111 | } |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 112 | |
Peter Zijlstra | 6577e42 | 2013-12-11 18:55:53 +0100 | [diff] [blame] | 113 | static DECLARE_WORK(sched_clock_work, __clear_sched_clock_stable); |
| 114 | |
| 115 | void clear_sched_clock_stable(void) |
| 116 | { |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 117 | __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 Zijlstra | 6577e42 | 2013-12-11 18:55:53 +0100 | [diff] [blame] | 125 | } |
| 126 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 127 | struct sched_clock_data { |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 128 | u64 tick_raw; |
| 129 | u64 tick_gtod; |
| 130 | u64 clock; |
| 131 | }; |
| 132 | |
| 133 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct sched_clock_data, sched_clock_data); |
| 134 | |
| 135 | static inline struct sched_clock_data *this_scd(void) |
| 136 | { |
Christoph Lameter | 22127e9 | 2014-08-17 12:30:25 -0500 | [diff] [blame] | 137 | return this_cpu_ptr(&sched_clock_data); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 138 | } |
| 139 | |
| 140 | static inline struct sched_clock_data *cpu_sdc(int cpu) |
| 141 | { |
| 142 | return &per_cpu(sched_clock_data, cpu); |
| 143 | } |
| 144 | |
| 145 | void sched_clock_init(void) |
| 146 | { |
| 147 | u64 ktime_now = ktime_to_ns(ktime_get()); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 148 | int cpu; |
| 149 | |
| 150 | for_each_possible_cpu(cpu) { |
| 151 | struct sched_clock_data *scd = cpu_sdc(cpu); |
| 152 | |
Peter Zijlstra | a381759 | 2008-05-29 10:07:15 +0200 | [diff] [blame] | 153 | scd->tick_raw = 0; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 154 | scd->tick_gtod = ktime_now; |
| 155 | scd->clock = ktime_now; |
| 156 | } |
Peter Zijlstra | a381759 | 2008-05-29 10:07:15 +0200 | [diff] [blame] | 157 | |
| 158 | sched_clock_running = 1; |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 159 | |
| 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 Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 173 | } |
| 174 | |
| 175 | /* |
Ingo Molnar | b342501 | 2009-02-26 20:20:29 +0100 | [diff] [blame] | 176 | * min, max except they take wrapping into account |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 177 | */ |
| 178 | |
| 179 | static inline u64 wrap_min(u64 x, u64 y) |
| 180 | { |
| 181 | return (s64)(x - y) < 0 ? x : y; |
| 182 | } |
| 183 | |
| 184 | static inline u64 wrap_max(u64 x, u64 y) |
| 185 | { |
| 186 | return (s64)(x - y) > 0 ? x : y; |
| 187 | } |
| 188 | |
| 189 | /* |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 190 | * update the percpu scd from the raw @now value |
| 191 | * |
| 192 | * - filter out backward motion |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 193 | * - use the GTOD tick value to create a window to filter crazy TSC values |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 194 | */ |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 195 | static u64 sched_clock_local(struct sched_clock_data *scd) |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 196 | { |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 197 | u64 now, clock, old_clock, min_clock, max_clock; |
| 198 | s64 delta; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 199 | |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 200 | again: |
| 201 | now = sched_clock(); |
| 202 | delta = now - scd->tick_raw; |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 203 | if (unlikely(delta < 0)) |
| 204 | delta = 0; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 205 | |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 206 | old_clock = scd->clock; |
| 207 | |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 208 | /* |
| 209 | * scd->clock = clamp(scd->tick_gtod + delta, |
Ingo Molnar | b342501 | 2009-02-26 20:20:29 +0100 | [diff] [blame] | 210 | * max(scd->tick_gtod, scd->clock), |
| 211 | * scd->tick_gtod + TICK_NSEC); |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 212 | */ |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 213 | |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 214 | clock = scd->tick_gtod + delta; |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 215 | min_clock = wrap_max(scd->tick_gtod, old_clock); |
| 216 | max_clock = wrap_max(old_clock, scd->tick_gtod + TICK_NSEC); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 217 | |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 218 | clock = wrap_max(clock, min_clock); |
| 219 | clock = wrap_min(clock, max_clock); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 220 | |
Eric Dumazet | 152f9d0 | 2009-09-30 20:36:19 +0200 | [diff] [blame] | 221 | if (cmpxchg64(&scd->clock, old_clock, clock) != old_clock) |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 222 | goto again; |
Ingo Molnar | 56b9061 | 2008-07-30 10:15:55 +0200 | [diff] [blame] | 223 | |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 224 | return clock; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 225 | } |
| 226 | |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 227 | static u64 sched_clock_remote(struct sched_clock_data *scd) |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 228 | { |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 229 | struct sched_clock_data *my_scd = this_scd(); |
| 230 | u64 this_clock, remote_clock; |
| 231 | u64 *ptr, old_val, val; |
| 232 | |
Thomas Gleixner | a1cbcaa | 2013-04-06 10:10:27 +0200 | [diff] [blame] | 233 | #if BITS_PER_LONG != 64 |
| 234 | again: |
| 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 Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 258 | sched_clock_local(my_scd); |
| 259 | again: |
| 260 | this_clock = my_scd->clock; |
| 261 | remote_clock = scd->clock; |
Thomas Gleixner | a1cbcaa | 2013-04-06 10:10:27 +0200 | [diff] [blame] | 262 | #endif |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 263 | |
| 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 Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 274 | } else { |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 275 | /* |
| 276 | * Should be rare, but possible: |
| 277 | */ |
| 278 | ptr = &my_scd->clock; |
| 279 | old_val = this_clock; |
| 280 | val = remote_clock; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 281 | } |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 282 | |
Eric Dumazet | 152f9d0 | 2009-09-30 20:36:19 +0200 | [diff] [blame] | 283 | if (cmpxchg64(ptr, old_val, val) != old_val) |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 284 | goto again; |
| 285 | |
| 286 | return val; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 287 | } |
| 288 | |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 289 | /* |
| 290 | * Similar to cpu_clock(), but requires local IRQs to be disabled. |
| 291 | * |
| 292 | * See cpu_clock(). |
| 293 | */ |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 294 | u64 sched_clock_cpu(int cpu) |
| 295 | { |
Ingo Molnar | b342501 | 2009-02-26 20:20:29 +0100 | [diff] [blame] | 296 | struct sched_clock_data *scd; |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 297 | u64 clock; |
| 298 | |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 299 | if (sched_clock_stable()) |
Ingo Molnar | b342501 | 2009-02-26 20:20:29 +0100 | [diff] [blame] | 300 | return sched_clock(); |
Peter Zijlstra | a381759 | 2008-05-29 10:07:15 +0200 | [diff] [blame] | 301 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 302 | if (unlikely(!sched_clock_running)) |
| 303 | return 0ull; |
| 304 | |
Fernando Luis Vazquez Cao | 96b3d28 | 2014-03-06 14:25:28 +0900 | [diff] [blame] | 305 | preempt_disable_notrace(); |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 306 | scd = cpu_sdc(cpu); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 307 | |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 308 | if (cpu != smp_processor_id()) |
| 309 | clock = sched_clock_remote(scd); |
| 310 | else |
| 311 | clock = sched_clock_local(scd); |
Fernando Luis Vazquez Cao | 96b3d28 | 2014-03-06 14:25:28 +0900 | [diff] [blame] | 312 | preempt_enable_notrace(); |
Ingo Molnar | e4e4e53 | 2008-04-14 08:50:02 +0200 | [diff] [blame] | 313 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 314 | return clock; |
| 315 | } |
| 316 | |
| 317 | void sched_clock_tick(void) |
| 318 | { |
Peter Zijlstra | 8325d9c | 2009-02-26 21:40:16 +0100 | [diff] [blame] | 319 | struct sched_clock_data *scd; |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 320 | u64 now, now_gtod; |
| 321 | |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 322 | if (sched_clock_stable()) |
Peter Zijlstra | 8325d9c | 2009-02-26 21:40:16 +0100 | [diff] [blame] | 323 | return; |
| 324 | |
Peter Zijlstra | a381759 | 2008-05-29 10:07:15 +0200 | [diff] [blame] | 325 | if (unlikely(!sched_clock_running)) |
| 326 | return; |
| 327 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 328 | WARN_ON_ONCE(!irqs_disabled()); |
| 329 | |
Peter Zijlstra | 8325d9c | 2009-02-26 21:40:16 +0100 | [diff] [blame] | 330 | scd = this_scd(); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 331 | now_gtod = ktime_to_ns(ktime_get()); |
Steven Rostedt | a83bc47 | 2008-07-09 00:15:32 -0400 | [diff] [blame] | 332 | now = sched_clock(); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 333 | |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 334 | scd->tick_raw = now; |
| 335 | scd->tick_gtod = now_gtod; |
Peter Zijlstra | def0a9b | 2009-09-18 20:14:01 +0200 | [diff] [blame] | 336 | sched_clock_local(scd); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 337 | } |
| 338 | |
| 339 | /* |
| 340 | * We are going deep-idle (irqs are disabled): |
| 341 | */ |
| 342 | void sched_clock_idle_sleep_event(void) |
| 343 | { |
| 344 | sched_clock_cpu(smp_processor_id()); |
| 345 | } |
| 346 | EXPORT_SYMBOL_GPL(sched_clock_idle_sleep_event); |
| 347 | |
| 348 | /* |
| 349 | * We just idled delta nanoseconds (called with irqs disabled): |
| 350 | */ |
| 351 | void sched_clock_idle_wakeup_event(u64 delta_ns) |
| 352 | { |
Thomas Gleixner | 1c5745a | 2008-12-22 23:05:28 +0100 | [diff] [blame] | 353 | if (timekeeping_suspended) |
| 354 | return; |
| 355 | |
Peter Zijlstra | 354879b | 2008-08-25 17:15:34 +0200 | [diff] [blame] | 356 | sched_clock_tick(); |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 357 | touch_softlockup_watchdog(); |
| 358 | } |
| 359 | EXPORT_SYMBOL_GPL(sched_clock_idle_wakeup_event); |
| 360 | |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 361 | /* |
| 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 | */ |
| 371 | u64 cpu_clock(int cpu) |
David Miller | b9f8fcd | 2009-12-13 18:25:02 -0800 | [diff] [blame] | 372 | { |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 373 | if (!sched_clock_stable()) |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 374 | return sched_clock_cpu(cpu); |
| 375 | |
| 376 | return sched_clock(); |
David Miller | b9f8fcd | 2009-12-13 18:25:02 -0800 | [diff] [blame] | 377 | } |
| 378 | |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 379 | /* |
| 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 | */ |
| 386 | u64 local_clock(void) |
| 387 | { |
Peter Zijlstra | d375b4e | 2014-01-22 12:59:18 +0100 | [diff] [blame] | 388 | if (!sched_clock_stable()) |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 389 | return sched_clock_cpu(raw_smp_processor_id()); |
| 390 | |
| 391 | return sched_clock(); |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 392 | } |
| 393 | |
Peter Zijlstra | 8325d9c | 2009-02-26 21:40:16 +0100 | [diff] [blame] | 394 | #else /* CONFIG_HAVE_UNSTABLE_SCHED_CLOCK */ |
| 395 | |
| 396 | void sched_clock_init(void) |
| 397 | { |
| 398 | sched_clock_running = 1; |
| 399 | } |
| 400 | |
| 401 | u64 sched_clock_cpu(int cpu) |
| 402 | { |
| 403 | if (unlikely(!sched_clock_running)) |
| 404 | return 0; |
| 405 | |
| 406 | return sched_clock(); |
| 407 | } |
| 408 | |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 409 | u64 cpu_clock(int cpu) |
Peter Zijlstra | 76a2a6e | 2008-06-27 13:41:15 +0200 | [diff] [blame] | 410 | { |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 411 | return sched_clock(); |
Peter Zijlstra | 76a2a6e | 2008-06-27 13:41:15 +0200 | [diff] [blame] | 412 | } |
David Miller | b9f8fcd | 2009-12-13 18:25:02 -0800 | [diff] [blame] | 413 | |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 414 | u64 local_clock(void) |
| 415 | { |
Peter Zijlstra | 35af99e | 2013-11-28 19:38:42 +0100 | [diff] [blame] | 416 | return sched_clock(); |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 417 | } |
| 418 | |
David Miller | b9f8fcd | 2009-12-13 18:25:02 -0800 | [diff] [blame] | 419 | #endif /* CONFIG_HAVE_UNSTABLE_SCHED_CLOCK */ |
| 420 | |
Ingo Molnar | 4c9fe8a | 2008-06-27 14:49:35 +0200 | [diff] [blame] | 421 | EXPORT_SYMBOL_GPL(cpu_clock); |
Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 422 | EXPORT_SYMBOL_GPL(local_clock); |
Cyril Bur | 545a2bf | 2015-02-12 15:01:24 -0800 | [diff] [blame] | 423 | |
| 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 | */ |
| 432 | u64 __weak running_clock(void) |
| 433 | { |
| 434 | return local_clock(); |
| 435 | } |