4 * Kernel internal timers
6 * Copyright (C) 1991, 1992 Linus Torvalds
8 * 1997-01-28 Modified by Finn Arne Gangstad to make timers scale better.
10 * 1997-09-10 Updated NTP code according to technical memorandum Jan '96
11 * "A Kernel Model for Precision Timekeeping" by Dave Mills
12 * 1998-12-24 Fixed a xtime SMP race (we need the xtime_lock rw spinlock to
13 * serialize accesses to xtime/lost_ticks).
14 * Copyright (C) 1998 Andrea Arcangeli
15 * 1999-03-10 Improved NTP compatibility by Ulrich Windl
16 * 2002-05-31 Move sys_sysinfo here and make its locking sane, Robert Love
17 * 2000-10-05 Implemented scalable SMP per-CPU timer handling.
18 * Copyright (C) 2000, 2001, 2002 Ingo Molnar
19 * Designed by David S. Miller, Alexey Kuznetsov and Ingo Molnar
22 #include <linux/kernel_stat.h>
23 #include <linux/export.h>
24 #include <linux/interrupt.h>
25 #include <linux/percpu.h>
26 #include <linux/init.h>
28 #include <linux/swap.h>
29 #include <linux/pid_namespace.h>
30 #include <linux/notifier.h>
31 #include <linux/thread_info.h>
32 #include <linux/time.h>
33 #include <linux/jiffies.h>
34 #include <linux/posix-timers.h>
35 #include <linux/cpu.h>
36 #include <linux/syscalls.h>
37 #include <linux/delay.h>
38 #include <linux/tick.h>
39 #include <linux/kallsyms.h>
40 #include <linux/irq_work.h>
41 #include <linux/sched.h>
42 #include <linux/sched/sysctl.h>
43 #include <linux/slab.h>
44 #include <linux/compat.h>
46 #include <asm/uaccess.h>
47 #include <asm/unistd.h>
48 #include <asm/div64.h>
49 #include <asm/timex.h>
52 #include "tick-internal.h"
54 #define CREATE_TRACE_POINTS
55 #include <trace/events/timer.h>
57 __visible u64 jiffies_64 __cacheline_aligned_in_smp = INITIAL_JIFFIES;
59 EXPORT_SYMBOL(jiffies_64);
62 * The timer wheel has LVL_DEPTH array levels. Each level provides an array of
63 * LVL_SIZE buckets. Each level is driven by its own clock and therefor each
64 * level has a different granularity.
66 * The level granularity is: LVL_CLK_DIV ^ lvl
67 * The level clock frequency is: HZ / (LVL_CLK_DIV ^ level)
69 * The array level of a newly armed timer depends on the relative expiry
70 * time. The farther the expiry time is away the higher the array level and
71 * therefor the granularity becomes.
73 * Contrary to the original timer wheel implementation, which aims for 'exact'
74 * expiry of the timers, this implementation removes the need for recascading
75 * the timers into the lower array levels. The previous 'classic' timer wheel
76 * implementation of the kernel already violated the 'exact' expiry by adding
77 * slack to the expiry time to provide batched expiration. The granularity
78 * levels provide implicit batching.
80 * This is an optimization of the original timer wheel implementation for the
81 * majority of the timer wheel use cases: timeouts. The vast majority of
82 * timeout timers (networking, disk I/O ...) are canceled before expiry. If
83 * the timeout expires it indicates that normal operation is disturbed, so it
84 * does not matter much whether the timeout comes with a slight delay.
86 * The only exception to this are networking timers with a small expiry
87 * time. They rely on the granularity. Those fit into the first wheel level,
88 * which has HZ granularity.
90 * We don't have cascading anymore. timers with a expiry time above the
91 * capacity of the last wheel level are force expired at the maximum timeout
92 * value of the last wheel level. From data sampling we know that the maximum
93 * value observed is 5 days (network connection tracking), so this should not
96 * The currently chosen array constants values are a good compromise between
97 * array size and granularity.
99 * This results in the following granularity and range levels:
102 * Level Offset Granularity Range
103 * 0 0 1 ms 0 ms - 63 ms
104 * 1 64 8 ms 64 ms - 511 ms
105 * 2 128 64 ms 512 ms - 4095 ms (512ms - ~4s)
106 * 3 192 512 ms 4096 ms - 32767 ms (~4s - ~32s)
107 * 4 256 4096 ms (~4s) 32768 ms - 262143 ms (~32s - ~4m)
108 * 5 320 32768 ms (~32s) 262144 ms - 2097151 ms (~4m - ~34m)
109 * 6 384 262144 ms (~4m) 2097152 ms - 16777215 ms (~34m - ~4h)
110 * 7 448 2097152 ms (~34m) 16777216 ms - 134217727 ms (~4h - ~1d)
111 * 8 512 16777216 ms (~4h) 134217728 ms - 1073741822 ms (~1d - ~12d)
114 * Level Offset Granularity Range
115 * 0 0 3 ms 0 ms - 210 ms
116 * 1 64 26 ms 213 ms - 1703 ms (213ms - ~1s)
117 * 2 128 213 ms 1706 ms - 13650 ms (~1s - ~13s)
118 * 3 192 1706 ms (~1s) 13653 ms - 109223 ms (~13s - ~1m)
119 * 4 256 13653 ms (~13s) 109226 ms - 873810 ms (~1m - ~14m)
120 * 5 320 109226 ms (~1m) 873813 ms - 6990503 ms (~14m - ~1h)
121 * 6 384 873813 ms (~14m) 6990506 ms - 55924050 ms (~1h - ~15h)
122 * 7 448 6990506 ms (~1h) 55924053 ms - 447392423 ms (~15h - ~5d)
123 * 8 512 55924053 ms (~15h) 447392426 ms - 3579139406 ms (~5d - ~41d)
126 * Level Offset Granularity Range
127 * 0 0 4 ms 0 ms - 255 ms
128 * 1 64 32 ms 256 ms - 2047 ms (256ms - ~2s)
129 * 2 128 256 ms 2048 ms - 16383 ms (~2s - ~16s)
130 * 3 192 2048 ms (~2s) 16384 ms - 131071 ms (~16s - ~2m)
131 * 4 256 16384 ms (~16s) 131072 ms - 1048575 ms (~2m - ~17m)
132 * 5 320 131072 ms (~2m) 1048576 ms - 8388607 ms (~17m - ~2h)
133 * 6 384 1048576 ms (~17m) 8388608 ms - 67108863 ms (~2h - ~18h)
134 * 7 448 8388608 ms (~2h) 67108864 ms - 536870911 ms (~18h - ~6d)
135 * 8 512 67108864 ms (~18h) 536870912 ms - 4294967288 ms (~6d - ~49d)
138 * Level Offset Granularity Range
139 * 0 0 10 ms 0 ms - 630 ms
140 * 1 64 80 ms 640 ms - 5110 ms (640ms - ~5s)
141 * 2 128 640 ms 5120 ms - 40950 ms (~5s - ~40s)
142 * 3 192 5120 ms (~5s) 40960 ms - 327670 ms (~40s - ~5m)
143 * 4 256 40960 ms (~40s) 327680 ms - 2621430 ms (~5m - ~43m)
144 * 5 320 327680 ms (~5m) 2621440 ms - 20971510 ms (~43m - ~5h)
145 * 6 384 2621440 ms (~43m) 20971520 ms - 167772150 ms (~5h - ~1d)
146 * 7 448 20971520 ms (~5h) 167772160 ms - 1342177270 ms (~1d - ~15d)
149 /* Clock divisor for the next level */
150 #define LVL_CLK_SHIFT 3
151 #define LVL_CLK_DIV (1UL << LVL_CLK_SHIFT)
152 #define LVL_CLK_MASK (LVL_CLK_DIV - 1)
153 #define LVL_SHIFT(n) ((n) * LVL_CLK_SHIFT)
154 #define LVL_GRAN(n) (1UL << LVL_SHIFT(n))
157 * The time start value for each level to select the bucket at enqueue
160 #define LVL_START(n) ((LVL_SIZE - 1) << (((n) - 1) * LVL_CLK_SHIFT))
162 /* Size of each clock level */
164 #define LVL_SIZE (1UL << LVL_BITS)
165 #define LVL_MASK (LVL_SIZE - 1)
166 #define LVL_OFFS(n) ((n) * LVL_SIZE)
175 /* The cutoff (max. capacity of the wheel) */
176 #define WHEEL_TIMEOUT_CUTOFF (LVL_START(LVL_DEPTH))
177 #define WHEEL_TIMEOUT_MAX (WHEEL_TIMEOUT_CUTOFF - LVL_GRAN(LVL_DEPTH - 1))
180 * The resulting wheel size. If NOHZ is configured we allocate two
181 * wheels so we have a separate storage for the deferrable timers.
183 #define WHEEL_SIZE (LVL_SIZE * LVL_DEPTH)
185 #ifdef CONFIG_NO_HZ_COMMON
197 struct timer_list *running_timer;
199 unsigned long next_expiry;
201 bool migration_enabled;
204 DECLARE_BITMAP(pending_map, WHEEL_SIZE);
205 struct hlist_head vectors[WHEEL_SIZE];
206 } ____cacheline_aligned;
208 static DEFINE_PER_CPU(struct timer_base, timer_bases[NR_BASES]);
210 #if defined(CONFIG_SMP) && defined(CONFIG_NO_HZ_COMMON)
211 unsigned int sysctl_timer_migration = 1;
213 void timers_update_migration(bool update_nohz)
215 bool on = sysctl_timer_migration && tick_nohz_active;
218 /* Avoid the loop, if nothing to update */
219 if (this_cpu_read(timer_bases[BASE_STD].migration_enabled) == on)
222 for_each_possible_cpu(cpu) {
223 per_cpu(timer_bases[BASE_STD].migration_enabled, cpu) = on;
224 per_cpu(timer_bases[BASE_DEF].migration_enabled, cpu) = on;
225 per_cpu(hrtimer_bases.migration_enabled, cpu) = on;
228 per_cpu(timer_bases[BASE_STD].nohz_active, cpu) = true;
229 per_cpu(timer_bases[BASE_DEF].nohz_active, cpu) = true;
230 per_cpu(hrtimer_bases.nohz_active, cpu) = true;
234 int timer_migration_handler(struct ctl_table *table, int write,
235 void __user *buffer, size_t *lenp,
238 static DEFINE_MUTEX(mutex);
242 ret = proc_dointvec(table, write, buffer, lenp, ppos);
244 timers_update_migration(false);
245 mutex_unlock(&mutex);
250 static unsigned long round_jiffies_common(unsigned long j, int cpu,
254 unsigned long original = j;
257 * We don't want all cpus firing their timers at once hitting the
258 * same lock or cachelines, so we skew each extra cpu with an extra
259 * 3 jiffies. This 3 jiffies came originally from the mm/ code which
261 * The skew is done by adding 3*cpunr, then round, then subtract this
262 * extra offset again.
269 * If the target jiffie is just after a whole second (which can happen
270 * due to delays of the timer irq, long irq off times etc etc) then
271 * we should round down to the whole second, not up. Use 1/4th second
272 * as cutoff for this rounding as an extreme upper bound for this.
273 * But never round down if @force_up is set.
275 if (rem < HZ/4 && !force_up) /* round down */
280 /* now that we have rounded, subtract the extra skew again */
284 * Make sure j is still in the future. Otherwise return the
287 return time_is_after_jiffies(j) ? j : original;
291 * __round_jiffies - function to round jiffies to a full second
292 * @j: the time in (absolute) jiffies that should be rounded
293 * @cpu: the processor number on which the timeout will happen
295 * __round_jiffies() rounds an absolute time in the future (in jiffies)
296 * up or down to (approximately) full seconds. This is useful for timers
297 * for which the exact time they fire does not matter too much, as long as
298 * they fire approximately every X seconds.
300 * By rounding these timers to whole seconds, all such timers will fire
301 * at the same time, rather than at various times spread out. The goal
302 * of this is to have the CPU wake up less, which saves power.
304 * The exact rounding is skewed for each processor to avoid all
305 * processors firing at the exact same time, which could lead
306 * to lock contention or spurious cache line bouncing.
308 * The return value is the rounded version of the @j parameter.
310 unsigned long __round_jiffies(unsigned long j, int cpu)
312 return round_jiffies_common(j, cpu, false);
314 EXPORT_SYMBOL_GPL(__round_jiffies);
317 * __round_jiffies_relative - function to round jiffies to a full second
318 * @j: the time in (relative) jiffies that should be rounded
319 * @cpu: the processor number on which the timeout will happen
321 * __round_jiffies_relative() rounds a time delta in the future (in jiffies)
322 * up or down to (approximately) full seconds. This is useful for timers
323 * for which the exact time they fire does not matter too much, as long as
324 * they fire approximately every X seconds.
326 * By rounding these timers to whole seconds, all such timers will fire
327 * at the same time, rather than at various times spread out. The goal
328 * of this is to have the CPU wake up less, which saves power.
330 * The exact rounding is skewed for each processor to avoid all
331 * processors firing at the exact same time, which could lead
332 * to lock contention or spurious cache line bouncing.
334 * The return value is the rounded version of the @j parameter.
336 unsigned long __round_jiffies_relative(unsigned long j, int cpu)
338 unsigned long j0 = jiffies;
340 /* Use j0 because jiffies might change while we run */
341 return round_jiffies_common(j + j0, cpu, false) - j0;
343 EXPORT_SYMBOL_GPL(__round_jiffies_relative);
346 * round_jiffies - function to round jiffies to a full second
347 * @j: the time in (absolute) jiffies that should be rounded
349 * round_jiffies() rounds an absolute time in the future (in jiffies)
350 * up or down to (approximately) full seconds. This is useful for timers
351 * for which the exact time they fire does not matter too much, as long as
352 * they fire approximately every X seconds.
354 * By rounding these timers to whole seconds, all such timers will fire
355 * at the same time, rather than at various times spread out. The goal
356 * of this is to have the CPU wake up less, which saves power.
358 * The return value is the rounded version of the @j parameter.
360 unsigned long round_jiffies(unsigned long j)
362 return round_jiffies_common(j, raw_smp_processor_id(), false);
364 EXPORT_SYMBOL_GPL(round_jiffies);
367 * round_jiffies_relative - function to round jiffies to a full second
368 * @j: the time in (relative) jiffies that should be rounded
370 * round_jiffies_relative() rounds a time delta in the future (in jiffies)
371 * up or down to (approximately) full seconds. This is useful for timers
372 * for which the exact time they fire does not matter too much, as long as
373 * they fire approximately every X seconds.
375 * By rounding these timers to whole seconds, all such timers will fire
376 * at the same time, rather than at various times spread out. The goal
377 * of this is to have the CPU wake up less, which saves power.
379 * The return value is the rounded version of the @j parameter.
381 unsigned long round_jiffies_relative(unsigned long j)
383 return __round_jiffies_relative(j, raw_smp_processor_id());
385 EXPORT_SYMBOL_GPL(round_jiffies_relative);
388 * __round_jiffies_up - function to round jiffies up to a full second
389 * @j: the time in (absolute) jiffies that should be rounded
390 * @cpu: the processor number on which the timeout will happen
392 * This is the same as __round_jiffies() except that it will never
393 * round down. This is useful for timeouts for which the exact time
394 * of firing does not matter too much, as long as they don't fire too
397 unsigned long __round_jiffies_up(unsigned long j, int cpu)
399 return round_jiffies_common(j, cpu, true);
401 EXPORT_SYMBOL_GPL(__round_jiffies_up);
404 * __round_jiffies_up_relative - function to round jiffies up to a full second
405 * @j: the time in (relative) jiffies that should be rounded
406 * @cpu: the processor number on which the timeout will happen
408 * This is the same as __round_jiffies_relative() except that it will never
409 * round down. This is useful for timeouts for which the exact time
410 * of firing does not matter too much, as long as they don't fire too
413 unsigned long __round_jiffies_up_relative(unsigned long j, int cpu)
415 unsigned long j0 = jiffies;
417 /* Use j0 because jiffies might change while we run */
418 return round_jiffies_common(j + j0, cpu, true) - j0;
420 EXPORT_SYMBOL_GPL(__round_jiffies_up_relative);
423 * round_jiffies_up - function to round jiffies up to a full second
424 * @j: the time in (absolute) jiffies that should be rounded
426 * This is the same as round_jiffies() except that it will never
427 * round down. This is useful for timeouts for which the exact time
428 * of firing does not matter too much, as long as they don't fire too
431 unsigned long round_jiffies_up(unsigned long j)
433 return round_jiffies_common(j, raw_smp_processor_id(), true);
435 EXPORT_SYMBOL_GPL(round_jiffies_up);
438 * round_jiffies_up_relative - function to round jiffies up to a full second
439 * @j: the time in (relative) jiffies that should be rounded
441 * This is the same as round_jiffies_relative() except that it will never
442 * round down. This is useful for timeouts for which the exact time
443 * of firing does not matter too much, as long as they don't fire too
446 unsigned long round_jiffies_up_relative(unsigned long j)
448 return __round_jiffies_up_relative(j, raw_smp_processor_id());
450 EXPORT_SYMBOL_GPL(round_jiffies_up_relative);
453 static inline unsigned int timer_get_idx(struct timer_list *timer)
455 return (timer->flags & TIMER_ARRAYMASK) >> TIMER_ARRAYSHIFT;
458 static inline void timer_set_idx(struct timer_list *timer, unsigned int idx)
460 timer->flags = (timer->flags & ~TIMER_ARRAYMASK) |
461 idx << TIMER_ARRAYSHIFT;
465 * Helper function to calculate the array index for a given expiry
468 static inline unsigned calc_index(unsigned expires, unsigned lvl)
470 expires = (expires + LVL_GRAN(lvl)) >> LVL_SHIFT(lvl);
471 return LVL_OFFS(lvl) + (expires & LVL_MASK);
474 static int calc_wheel_index(unsigned long expires, unsigned long clk)
476 unsigned long delta = expires - clk;
479 if (delta < LVL_START(1)) {
480 idx = calc_index(expires, 0);
481 } else if (delta < LVL_START(2)) {
482 idx = calc_index(expires, 1);
483 } else if (delta < LVL_START(3)) {
484 idx = calc_index(expires, 2);
485 } else if (delta < LVL_START(4)) {
486 idx = calc_index(expires, 3);
487 } else if (delta < LVL_START(5)) {
488 idx = calc_index(expires, 4);
489 } else if (delta < LVL_START(6)) {
490 idx = calc_index(expires, 5);
491 } else if (delta < LVL_START(7)) {
492 idx = calc_index(expires, 6);
493 } else if (LVL_DEPTH > 8 && delta < LVL_START(8)) {
494 idx = calc_index(expires, 7);
495 } else if ((long) delta < 0) {
496 idx = clk & LVL_MASK;
499 * Force expire obscene large timeouts to expire at the
500 * capacity limit of the wheel.
502 if (expires >= WHEEL_TIMEOUT_CUTOFF)
503 expires = WHEEL_TIMEOUT_MAX;
505 idx = calc_index(expires, LVL_DEPTH - 1);
511 * Enqueue the timer into the hash bucket, mark it pending in
512 * the bitmap and store the index in the timer flags.
514 static void enqueue_timer(struct timer_base *base, struct timer_list *timer,
517 hlist_add_head(&timer->entry, base->vectors + idx);
518 __set_bit(idx, base->pending_map);
519 timer_set_idx(timer, idx);
523 __internal_add_timer(struct timer_base *base, struct timer_list *timer)
527 idx = calc_wheel_index(timer->expires, base->clk);
528 enqueue_timer(base, timer, idx);
532 trigger_dyntick_cpu(struct timer_base *base, struct timer_list *timer)
534 if (!IS_ENABLED(CONFIG_NO_HZ_COMMON) || !base->nohz_active)
538 * TODO: This wants some optimizing similar to the code below, but we
539 * will do that when we switch from push to pull for deferrable timers.
541 if (timer->flags & TIMER_DEFERRABLE) {
542 if (tick_nohz_full_cpu(base->cpu))
543 wake_up_nohz_cpu(base->cpu);
548 * We might have to IPI the remote CPU if the base is idle and the
549 * timer is not deferrable. If the other CPU is on the way to idle
550 * then it can't set base->is_idle as we hold the base lock:
555 /* Check whether this is the new first expiring timer: */
556 if (time_after_eq(timer->expires, base->next_expiry))
560 * Set the next expiry time and kick the CPU so it can reevaluate the
563 base->next_expiry = timer->expires;
564 wake_up_nohz_cpu(base->cpu);
568 internal_add_timer(struct timer_base *base, struct timer_list *timer)
570 __internal_add_timer(base, timer);
571 trigger_dyntick_cpu(base, timer);
574 #ifdef CONFIG_TIMER_STATS
575 void __timer_stats_timer_set_start_info(struct timer_list *timer, void *addr)
577 if (timer->start_site)
580 timer->start_site = addr;
581 memcpy(timer->start_comm, current->comm, TASK_COMM_LEN);
582 timer->start_pid = current->pid;
585 static void timer_stats_account_timer(struct timer_list *timer)
590 * start_site can be concurrently reset by
591 * timer_stats_timer_clear_start_info()
593 site = READ_ONCE(timer->start_site);
597 timer_stats_update_stats(timer, timer->start_pid, site,
598 timer->function, timer->start_comm,
603 static void timer_stats_account_timer(struct timer_list *timer) {}
606 #ifdef CONFIG_DEBUG_OBJECTS_TIMERS
608 static struct debug_obj_descr timer_debug_descr;
610 static void *timer_debug_hint(void *addr)
612 return ((struct timer_list *) addr)->function;
615 static bool timer_is_static_object(void *addr)
617 struct timer_list *timer = addr;
619 return (timer->entry.pprev == NULL &&
620 timer->entry.next == TIMER_ENTRY_STATIC);
624 * fixup_init is called when:
625 * - an active object is initialized
627 static bool timer_fixup_init(void *addr, enum debug_obj_state state)
629 struct timer_list *timer = addr;
632 case ODEBUG_STATE_ACTIVE:
633 del_timer_sync(timer);
634 debug_object_init(timer, &timer_debug_descr);
641 /* Stub timer callback for improperly used timers. */
642 static void stub_timer(unsigned long data)
648 * fixup_activate is called when:
649 * - an active object is activated
650 * - an unknown non-static object is activated
652 static bool timer_fixup_activate(void *addr, enum debug_obj_state state)
654 struct timer_list *timer = addr;
657 case ODEBUG_STATE_NOTAVAILABLE:
658 setup_timer(timer, stub_timer, 0);
661 case ODEBUG_STATE_ACTIVE:
670 * fixup_free is called when:
671 * - an active object is freed
673 static bool timer_fixup_free(void *addr, enum debug_obj_state state)
675 struct timer_list *timer = addr;
678 case ODEBUG_STATE_ACTIVE:
679 del_timer_sync(timer);
680 debug_object_free(timer, &timer_debug_descr);
688 * fixup_assert_init is called when:
689 * - an untracked/uninit-ed object is found
691 static bool timer_fixup_assert_init(void *addr, enum debug_obj_state state)
693 struct timer_list *timer = addr;
696 case ODEBUG_STATE_NOTAVAILABLE:
697 setup_timer(timer, stub_timer, 0);
704 static struct debug_obj_descr timer_debug_descr = {
705 .name = "timer_list",
706 .debug_hint = timer_debug_hint,
707 .is_static_object = timer_is_static_object,
708 .fixup_init = timer_fixup_init,
709 .fixup_activate = timer_fixup_activate,
710 .fixup_free = timer_fixup_free,
711 .fixup_assert_init = timer_fixup_assert_init,
714 static inline void debug_timer_init(struct timer_list *timer)
716 debug_object_init(timer, &timer_debug_descr);
719 static inline void debug_timer_activate(struct timer_list *timer)
721 debug_object_activate(timer, &timer_debug_descr);
724 static inline void debug_timer_deactivate(struct timer_list *timer)
726 debug_object_deactivate(timer, &timer_debug_descr);
729 static inline void debug_timer_free(struct timer_list *timer)
731 debug_object_free(timer, &timer_debug_descr);
734 static inline void debug_timer_assert_init(struct timer_list *timer)
736 debug_object_assert_init(timer, &timer_debug_descr);
739 static void do_init_timer(struct timer_list *timer, unsigned int flags,
740 const char *name, struct lock_class_key *key);
742 void init_timer_on_stack_key(struct timer_list *timer, unsigned int flags,
743 const char *name, struct lock_class_key *key)
745 debug_object_init_on_stack(timer, &timer_debug_descr);
746 do_init_timer(timer, flags, name, key);
748 EXPORT_SYMBOL_GPL(init_timer_on_stack_key);
750 void destroy_timer_on_stack(struct timer_list *timer)
752 debug_object_free(timer, &timer_debug_descr);
754 EXPORT_SYMBOL_GPL(destroy_timer_on_stack);
757 static inline void debug_timer_init(struct timer_list *timer) { }
758 static inline void debug_timer_activate(struct timer_list *timer) { }
759 static inline void debug_timer_deactivate(struct timer_list *timer) { }
760 static inline void debug_timer_assert_init(struct timer_list *timer) { }
763 static inline void debug_init(struct timer_list *timer)
765 debug_timer_init(timer);
766 trace_timer_init(timer);
770 debug_activate(struct timer_list *timer, unsigned long expires)
772 debug_timer_activate(timer);
773 trace_timer_start(timer, expires, timer->flags);
776 static inline void debug_deactivate(struct timer_list *timer)
778 debug_timer_deactivate(timer);
779 trace_timer_cancel(timer);
782 static inline void debug_assert_init(struct timer_list *timer)
784 debug_timer_assert_init(timer);
787 static void do_init_timer(struct timer_list *timer, unsigned int flags,
788 const char *name, struct lock_class_key *key)
790 timer->entry.pprev = NULL;
791 timer->flags = flags | raw_smp_processor_id();
792 #ifdef CONFIG_TIMER_STATS
793 timer->start_site = NULL;
794 timer->start_pid = -1;
795 memset(timer->start_comm, 0, TASK_COMM_LEN);
797 lockdep_init_map(&timer->lockdep_map, name, key, 0);
801 * init_timer_key - initialize a timer
802 * @timer: the timer to be initialized
803 * @flags: timer flags
804 * @name: name of the timer
805 * @key: lockdep class key of the fake lock used for tracking timer
806 * sync lock dependencies
808 * init_timer_key() must be done to a timer prior calling *any* of the
809 * other timer functions.
811 void init_timer_key(struct timer_list *timer, unsigned int flags,
812 const char *name, struct lock_class_key *key)
815 do_init_timer(timer, flags, name, key);
817 EXPORT_SYMBOL(init_timer_key);
819 static inline void detach_timer(struct timer_list *timer, bool clear_pending)
821 struct hlist_node *entry = &timer->entry;
823 debug_deactivate(timer);
828 entry->next = LIST_POISON2;
831 static int detach_if_pending(struct timer_list *timer, struct timer_base *base,
834 unsigned idx = timer_get_idx(timer);
836 if (!timer_pending(timer))
839 if (hlist_is_singular_node(&timer->entry, base->vectors + idx))
840 __clear_bit(idx, base->pending_map);
842 detach_timer(timer, clear_pending);
846 static inline struct timer_base *get_timer_cpu_base(u32 tflags, u32 cpu)
848 struct timer_base *base = per_cpu_ptr(&timer_bases[BASE_STD], cpu);
851 * If the timer is deferrable and nohz is active then we need to use
852 * the deferrable base.
854 if (IS_ENABLED(CONFIG_NO_HZ_COMMON) && base->nohz_active &&
855 (tflags & TIMER_DEFERRABLE))
856 base = per_cpu_ptr(&timer_bases[BASE_DEF], cpu);
860 static inline struct timer_base *get_timer_this_cpu_base(u32 tflags)
862 struct timer_base *base = this_cpu_ptr(&timer_bases[BASE_STD]);
865 * If the timer is deferrable and nohz is active then we need to use
866 * the deferrable base.
868 if (IS_ENABLED(CONFIG_NO_HZ_COMMON) && base->nohz_active &&
869 (tflags & TIMER_DEFERRABLE))
870 base = this_cpu_ptr(&timer_bases[BASE_DEF]);
874 static inline struct timer_base *get_timer_base(u32 tflags)
876 return get_timer_cpu_base(tflags, tflags & TIMER_CPUMASK);
879 #ifdef CONFIG_NO_HZ_COMMON
880 static inline struct timer_base *
881 __get_target_base(struct timer_base *base, unsigned tflags)
884 if ((tflags & TIMER_PINNED) || !base->migration_enabled)
885 return get_timer_this_cpu_base(tflags);
886 return get_timer_cpu_base(tflags, get_nohz_timer_target());
888 return get_timer_this_cpu_base(tflags);
892 static inline void forward_timer_base(struct timer_base *base)
895 * We only forward the base when it's idle and we have a delta between
896 * base clock and jiffies.
898 if (!base->is_idle || (long) (jiffies - base->clk) < 2)
902 * If the next expiry value is > jiffies, then we fast forward to
903 * jiffies otherwise we forward to the next expiry value.
905 if (time_after(base->next_expiry, jiffies))
908 base->clk = base->next_expiry;
911 static inline struct timer_base *
912 __get_target_base(struct timer_base *base, unsigned tflags)
914 return get_timer_this_cpu_base(tflags);
917 static inline void forward_timer_base(struct timer_base *base) { }
920 static inline struct timer_base *
921 get_target_base(struct timer_base *base, unsigned tflags)
923 struct timer_base *target = __get_target_base(base, tflags);
925 forward_timer_base(target);
930 * We are using hashed locking: Holding per_cpu(timer_bases[x]).lock means
931 * that all timers which are tied to this base are locked, and the base itself
934 * So __run_timers/migrate_timers can safely modify all timers which could
935 * be found in the base->vectors array.
937 * When a timer is migrating then the TIMER_MIGRATING flag is set and we need
938 * to wait until the migration is done.
940 static struct timer_base *lock_timer_base(struct timer_list *timer,
941 unsigned long *flags)
942 __acquires(timer->base->lock)
945 struct timer_base *base;
949 * We need to use READ_ONCE() here, otherwise the compiler
950 * might re-read @tf between the check for TIMER_MIGRATING
953 tf = READ_ONCE(timer->flags);
955 if (!(tf & TIMER_MIGRATING)) {
956 base = get_timer_base(tf);
957 spin_lock_irqsave(&base->lock, *flags);
958 if (timer->flags == tf)
960 spin_unlock_irqrestore(&base->lock, *flags);
967 __mod_timer(struct timer_list *timer, unsigned long expires, bool pending_only)
969 struct timer_base *base, *new_base;
970 unsigned int idx = UINT_MAX;
971 unsigned long clk = 0, flags;
975 * This is a common optimization triggered by the networking code - if
976 * the timer is re-modified to have the same timeout or ends up in the
977 * same array bucket then just return:
979 if (timer_pending(timer)) {
980 if (timer->expires == expires)
983 * Take the current timer_jiffies of base, but without holding
986 base = get_timer_base(timer->flags);
989 idx = calc_wheel_index(expires, clk);
992 * Retrieve and compare the array index of the pending
993 * timer. If it matches set the expiry to the new value so a
994 * subsequent call will exit in the expires check above.
996 if (idx == timer_get_idx(timer)) {
997 timer->expires = expires;
1002 timer_stats_timer_set_start_info(timer);
1003 BUG_ON(!timer->function);
1005 base = lock_timer_base(timer, &flags);
1007 ret = detach_if_pending(timer, base, false);
1008 if (!ret && pending_only)
1011 debug_activate(timer, expires);
1013 new_base = get_target_base(base, timer->flags);
1015 if (base != new_base) {
1017 * We are trying to schedule the timer on the new base.
1018 * However we can't change timer's base while it is running,
1019 * otherwise del_timer_sync() can't detect that the timer's
1020 * handler yet has not finished. This also guarantees that the
1021 * timer is serialized wrt itself.
1023 if (likely(base->running_timer != timer)) {
1024 /* See the comment in lock_timer_base() */
1025 timer->flags |= TIMER_MIGRATING;
1027 spin_unlock(&base->lock);
1029 spin_lock(&base->lock);
1030 WRITE_ONCE(timer->flags,
1031 (timer->flags & ~TIMER_BASEMASK) | base->cpu);
1035 timer->expires = expires;
1037 * If 'idx' was calculated above and the base time did not advance
1038 * between calculating 'idx' and taking the lock, only enqueue_timer()
1039 * and trigger_dyntick_cpu() is required. Otherwise we need to
1040 * (re)calculate the wheel index via internal_add_timer().
1042 if (idx != UINT_MAX && clk == base->clk) {
1043 enqueue_timer(base, timer, idx);
1044 trigger_dyntick_cpu(base, timer);
1046 internal_add_timer(base, timer);
1050 spin_unlock_irqrestore(&base->lock, flags);
1056 * mod_timer_pending - modify a pending timer's timeout
1057 * @timer: the pending timer to be modified
1058 * @expires: new timeout in jiffies
1060 * mod_timer_pending() is the same for pending timers as mod_timer(),
1061 * but will not re-activate and modify already deleted timers.
1063 * It is useful for unserialized use of timers.
1065 int mod_timer_pending(struct timer_list *timer, unsigned long expires)
1067 return __mod_timer(timer, expires, true);
1069 EXPORT_SYMBOL(mod_timer_pending);
1072 * mod_timer - modify a timer's timeout
1073 * @timer: the timer to be modified
1074 * @expires: new timeout in jiffies
1076 * mod_timer() is a more efficient way to update the expire field of an
1077 * active timer (if the timer is inactive it will be activated)
1079 * mod_timer(timer, expires) is equivalent to:
1081 * del_timer(timer); timer->expires = expires; add_timer(timer);
1083 * Note that if there are multiple unserialized concurrent users of the
1084 * same timer, then mod_timer() is the only safe way to modify the timeout,
1085 * since add_timer() cannot modify an already running timer.
1087 * The function returns whether it has modified a pending timer or not.
1088 * (ie. mod_timer() of an inactive timer returns 0, mod_timer() of an
1089 * active timer returns 1.)
1091 int mod_timer(struct timer_list *timer, unsigned long expires)
1093 return __mod_timer(timer, expires, false);
1095 EXPORT_SYMBOL(mod_timer);
1098 * add_timer - start a timer
1099 * @timer: the timer to be added
1101 * The kernel will do a ->function(->data) callback from the
1102 * timer interrupt at the ->expires point in the future. The
1103 * current time is 'jiffies'.
1105 * The timer's ->expires, ->function (and if the handler uses it, ->data)
1106 * fields must be set prior calling this function.
1108 * Timers with an ->expires field in the past will be executed in the next
1111 void add_timer(struct timer_list *timer)
1113 BUG_ON(timer_pending(timer));
1114 mod_timer(timer, timer->expires);
1116 EXPORT_SYMBOL(add_timer);
1119 * add_timer_on - start a timer on a particular CPU
1120 * @timer: the timer to be added
1121 * @cpu: the CPU to start it on
1123 * This is not very scalable on SMP. Double adds are not possible.
1125 void add_timer_on(struct timer_list *timer, int cpu)
1127 struct timer_base *new_base, *base;
1128 unsigned long flags;
1130 timer_stats_timer_set_start_info(timer);
1131 BUG_ON(timer_pending(timer) || !timer->function);
1133 new_base = get_timer_cpu_base(timer->flags, cpu);
1136 * If @timer was on a different CPU, it should be migrated with the
1137 * old base locked to prevent other operations proceeding with the
1138 * wrong base locked. See lock_timer_base().
1140 base = lock_timer_base(timer, &flags);
1141 if (base != new_base) {
1142 timer->flags |= TIMER_MIGRATING;
1144 spin_unlock(&base->lock);
1146 spin_lock(&base->lock);
1147 WRITE_ONCE(timer->flags,
1148 (timer->flags & ~TIMER_BASEMASK) | cpu);
1151 debug_activate(timer, timer->expires);
1152 internal_add_timer(base, timer);
1153 spin_unlock_irqrestore(&base->lock, flags);
1155 EXPORT_SYMBOL_GPL(add_timer_on);
1158 * del_timer - deactive a timer.
1159 * @timer: the timer to be deactivated
1161 * del_timer() deactivates a timer - this works on both active and inactive
1164 * The function returns whether it has deactivated a pending timer or not.
1165 * (ie. del_timer() of an inactive timer returns 0, del_timer() of an
1166 * active timer returns 1.)
1168 int del_timer(struct timer_list *timer)
1170 struct timer_base *base;
1171 unsigned long flags;
1174 debug_assert_init(timer);
1176 timer_stats_timer_clear_start_info(timer);
1177 if (timer_pending(timer)) {
1178 base = lock_timer_base(timer, &flags);
1179 ret = detach_if_pending(timer, base, true);
1180 spin_unlock_irqrestore(&base->lock, flags);
1185 EXPORT_SYMBOL(del_timer);
1188 * try_to_del_timer_sync - Try to deactivate a timer
1189 * @timer: timer do del
1191 * This function tries to deactivate a timer. Upon successful (ret >= 0)
1192 * exit the timer is not queued and the handler is not running on any CPU.
1194 int try_to_del_timer_sync(struct timer_list *timer)
1196 struct timer_base *base;
1197 unsigned long flags;
1200 debug_assert_init(timer);
1202 base = lock_timer_base(timer, &flags);
1204 if (base->running_timer != timer) {
1205 timer_stats_timer_clear_start_info(timer);
1206 ret = detach_if_pending(timer, base, true);
1208 spin_unlock_irqrestore(&base->lock, flags);
1212 EXPORT_SYMBOL(try_to_del_timer_sync);
1216 * del_timer_sync - deactivate a timer and wait for the handler to finish.
1217 * @timer: the timer to be deactivated
1219 * This function only differs from del_timer() on SMP: besides deactivating
1220 * the timer it also makes sure the handler has finished executing on other
1223 * Synchronization rules: Callers must prevent restarting of the timer,
1224 * otherwise this function is meaningless. It must not be called from
1225 * interrupt contexts unless the timer is an irqsafe one. The caller must
1226 * not hold locks which would prevent completion of the timer's
1227 * handler. The timer's handler must not call add_timer_on(). Upon exit the
1228 * timer is not queued and the handler is not running on any CPU.
1230 * Note: For !irqsafe timers, you must not hold locks that are held in
1231 * interrupt context while calling this function. Even if the lock has
1232 * nothing to do with the timer in question. Here's why:
1238 * base->running_timer = mytimer;
1239 * spin_lock_irq(somelock);
1241 * spin_lock(somelock);
1242 * del_timer_sync(mytimer);
1243 * while (base->running_timer == mytimer);
1245 * Now del_timer_sync() will never return and never release somelock.
1246 * The interrupt on the other CPU is waiting to grab somelock but
1247 * it has interrupted the softirq that CPU0 is waiting to finish.
1249 * The function returns whether it has deactivated a pending timer or not.
1251 int del_timer_sync(struct timer_list *timer)
1253 #ifdef CONFIG_LOCKDEP
1254 unsigned long flags;
1257 * If lockdep gives a backtrace here, please reference
1258 * the synchronization rules above.
1260 local_irq_save(flags);
1261 lock_map_acquire(&timer->lockdep_map);
1262 lock_map_release(&timer->lockdep_map);
1263 local_irq_restore(flags);
1266 * don't use it in hardirq context, because it
1267 * could lead to deadlock.
1269 WARN_ON(in_irq() && !(timer->flags & TIMER_IRQSAFE));
1271 int ret = try_to_del_timer_sync(timer);
1277 EXPORT_SYMBOL(del_timer_sync);
1280 static void call_timer_fn(struct timer_list *timer, void (*fn)(unsigned long),
1283 int count = preempt_count();
1285 #ifdef CONFIG_LOCKDEP
1287 * It is permissible to free the timer from inside the
1288 * function that is called from it, this we need to take into
1289 * account for lockdep too. To avoid bogus "held lock freed"
1290 * warnings as well as problems when looking into
1291 * timer->lockdep_map, make a copy and use that here.
1293 struct lockdep_map lockdep_map;
1295 lockdep_copy_map(&lockdep_map, &timer->lockdep_map);
1298 * Couple the lock chain with the lock chain at
1299 * del_timer_sync() by acquiring the lock_map around the fn()
1300 * call here and in del_timer_sync().
1302 lock_map_acquire(&lockdep_map);
1304 trace_timer_expire_entry(timer);
1306 trace_timer_expire_exit(timer);
1308 lock_map_release(&lockdep_map);
1310 if (count != preempt_count()) {
1311 WARN_ONCE(1, "timer: %pF preempt leak: %08x -> %08x\n",
1312 fn, count, preempt_count());
1314 * Restore the preempt count. That gives us a decent
1315 * chance to survive and extract information. If the
1316 * callback kept a lock held, bad luck, but not worse
1317 * than the BUG() we had.
1319 preempt_count_set(count);
1323 static void expire_timers(struct timer_base *base, struct hlist_head *head)
1325 while (!hlist_empty(head)) {
1326 struct timer_list *timer;
1327 void (*fn)(unsigned long);
1330 timer = hlist_entry(head->first, struct timer_list, entry);
1331 timer_stats_account_timer(timer);
1333 base->running_timer = timer;
1334 detach_timer(timer, true);
1336 fn = timer->function;
1339 if (timer->flags & TIMER_IRQSAFE) {
1340 spin_unlock(&base->lock);
1341 call_timer_fn(timer, fn, data);
1342 spin_lock(&base->lock);
1344 spin_unlock_irq(&base->lock);
1345 call_timer_fn(timer, fn, data);
1346 spin_lock_irq(&base->lock);
1351 static int __collect_expired_timers(struct timer_base *base,
1352 struct hlist_head *heads)
1354 unsigned long clk = base->clk;
1355 struct hlist_head *vec;
1359 for (i = 0; i < LVL_DEPTH; i++) {
1360 idx = (clk & LVL_MASK) + i * LVL_SIZE;
1362 if (__test_and_clear_bit(idx, base->pending_map)) {
1363 vec = base->vectors + idx;
1364 hlist_move_list(vec, heads++);
1367 /* Is it time to look at the next level? */
1368 if (clk & LVL_CLK_MASK)
1370 /* Shift clock for the next level granularity */
1371 clk >>= LVL_CLK_SHIFT;
1376 #ifdef CONFIG_NO_HZ_COMMON
1378 * Find the next pending bucket of a level. Search from level start (@offset)
1379 * + @clk upwards and if nothing there, search from start of the level
1380 * (@offset) up to @offset + clk.
1382 static int next_pending_bucket(struct timer_base *base, unsigned offset,
1385 unsigned pos, start = offset + clk;
1386 unsigned end = offset + LVL_SIZE;
1388 pos = find_next_bit(base->pending_map, end, start);
1392 pos = find_next_bit(base->pending_map, start, offset);
1393 return pos < start ? pos + LVL_SIZE - start : -1;
1397 * Search the first expiring timer in the various clock levels. Caller must
1400 static unsigned long __next_timer_interrupt(struct timer_base *base)
1402 unsigned long clk, next, adj;
1403 unsigned lvl, offset = 0;
1405 next = base->clk + NEXT_TIMER_MAX_DELTA;
1407 for (lvl = 0; lvl < LVL_DEPTH; lvl++, offset += LVL_SIZE) {
1408 int pos = next_pending_bucket(base, offset, clk & LVL_MASK);
1411 unsigned long tmp = clk + (unsigned long) pos;
1413 tmp <<= LVL_SHIFT(lvl);
1414 if (time_before(tmp, next))
1418 * Clock for the next level. If the current level clock lower
1419 * bits are zero, we look at the next level as is. If not we
1420 * need to advance it by one because that's going to be the
1421 * next expiring bucket in that level. base->clk is the next
1422 * expiring jiffie. So in case of:
1424 * LVL5 LVL4 LVL3 LVL2 LVL1 LVL0
1427 * we have to look at all levels @index 0. With
1429 * LVL5 LVL4 LVL3 LVL2 LVL1 LVL0
1432 * LVL0 has the next expiring bucket @index 2. The upper
1433 * levels have the next expiring bucket @index 1.
1435 * In case that the propagation wraps the next level the same
1438 * LVL5 LVL4 LVL3 LVL2 LVL1 LVL0
1441 * So after looking at LVL0 we get:
1443 * LVL5 LVL4 LVL3 LVL2 LVL1
1446 * So no propagation from LVL1 to LVL2 because that happened
1447 * with the add already, but then we need to propagate further
1448 * from LVL2 to LVL3.
1450 * So the simple check whether the lower bits of the current
1451 * level are 0 or not is sufficient for all cases.
1453 adj = clk & LVL_CLK_MASK ? 1 : 0;
1454 clk >>= LVL_CLK_SHIFT;
1461 * Check, if the next hrtimer event is before the next timer wheel
1464 static u64 cmp_next_hrtimer_event(u64 basem, u64 expires)
1466 u64 nextevt = hrtimer_get_next_event();
1469 * If high resolution timers are enabled
1470 * hrtimer_get_next_event() returns KTIME_MAX.
1472 if (expires <= nextevt)
1476 * If the next timer is already expired, return the tick base
1477 * time so the tick is fired immediately.
1479 if (nextevt <= basem)
1483 * Round up to the next jiffie. High resolution timers are
1484 * off, so the hrtimers are expired in the tick and we need to
1485 * make sure that this tick really expires the timer to avoid
1486 * a ping pong of the nohz stop code.
1488 * Use DIV_ROUND_UP_ULL to prevent gcc calling __divdi3
1490 return DIV_ROUND_UP_ULL(nextevt, TICK_NSEC) * TICK_NSEC;
1494 * get_next_timer_interrupt - return the time (clock mono) of the next timer
1495 * @basej: base time jiffies
1496 * @basem: base time clock monotonic
1498 * Returns the tick aligned clock monotonic time of the next pending
1499 * timer or KTIME_MAX if no timer is pending.
1501 u64 get_next_timer_interrupt(unsigned long basej, u64 basem)
1503 struct timer_base *base = this_cpu_ptr(&timer_bases[BASE_STD]);
1504 u64 expires = KTIME_MAX;
1505 unsigned long nextevt;
1509 * Pretend that there is no timer pending if the cpu is offline.
1510 * Possible pending timers will be migrated later to an active cpu.
1512 if (cpu_is_offline(smp_processor_id()))
1515 spin_lock(&base->lock);
1516 nextevt = __next_timer_interrupt(base);
1517 is_max_delta = (nextevt == base->clk + NEXT_TIMER_MAX_DELTA);
1518 base->next_expiry = nextevt;
1520 * We have a fresh next event. Check whether we can forward the base:
1522 if (time_after(nextevt, jiffies))
1523 base->clk = jiffies;
1524 else if (time_after(nextevt, base->clk))
1525 base->clk = nextevt;
1527 if (time_before_eq(nextevt, basej)) {
1529 base->is_idle = false;
1532 expires = basem + (nextevt - basej) * TICK_NSEC;
1534 * If we expect to sleep more than a tick, mark the base idle:
1536 if ((expires - basem) > TICK_NSEC)
1537 base->is_idle = true;
1539 spin_unlock(&base->lock);
1541 return cmp_next_hrtimer_event(basem, expires);
1545 * timer_clear_idle - Clear the idle state of the timer base
1547 * Called with interrupts disabled
1549 void timer_clear_idle(void)
1551 struct timer_base *base = this_cpu_ptr(&timer_bases[BASE_STD]);
1554 * We do this unlocked. The worst outcome is a remote enqueue sending
1555 * a pointless IPI, but taking the lock would just make the window for
1556 * sending the IPI a few instructions smaller for the cost of taking
1557 * the lock in the exit from idle path.
1559 base->is_idle = false;
1562 static int collect_expired_timers(struct timer_base *base,
1563 struct hlist_head *heads)
1566 * NOHZ optimization. After a long idle sleep we need to forward the
1567 * base to current jiffies. Avoid a loop by searching the bitfield for
1568 * the next expiring timer.
1570 if ((long)(jiffies - base->clk) > 2) {
1571 unsigned long next = __next_timer_interrupt(base);
1574 * If the next timer is ahead of time forward to current
1575 * jiffies, otherwise forward to the next expiry time:
1577 if (time_after(next, jiffies)) {
1578 /* The call site will increment clock! */
1579 base->clk = jiffies - 1;
1584 return __collect_expired_timers(base, heads);
1587 static inline int collect_expired_timers(struct timer_base *base,
1588 struct hlist_head *heads)
1590 return __collect_expired_timers(base, heads);
1595 * Called from the timer interrupt handler to charge one tick to the current
1596 * process. user_tick is 1 if the tick is user time, 0 for system.
1598 void update_process_times(int user_tick)
1600 struct task_struct *p = current;
1602 /* Note: this timer irq context must be accounted for as well. */
1603 account_process_tick(p, user_tick);
1605 rcu_check_callbacks(user_tick);
1606 #ifdef CONFIG_IRQ_WORK
1611 run_posix_cpu_timers(p);
1615 * __run_timers - run all expired timers (if any) on this CPU.
1616 * @base: the timer vector to be processed.
1618 static inline void __run_timers(struct timer_base *base)
1620 struct hlist_head heads[LVL_DEPTH];
1623 if (!time_after_eq(jiffies, base->clk))
1626 spin_lock_irq(&base->lock);
1628 while (time_after_eq(jiffies, base->clk)) {
1630 levels = collect_expired_timers(base, heads);
1634 expire_timers(base, heads + levels);
1636 base->running_timer = NULL;
1637 spin_unlock_irq(&base->lock);
1641 * This function runs timers and the timer-tq in bottom half context.
1643 static __latent_entropy void run_timer_softirq(struct softirq_action *h)
1645 struct timer_base *base = this_cpu_ptr(&timer_bases[BASE_STD]);
1648 if (IS_ENABLED(CONFIG_NO_HZ_COMMON) && base->nohz_active)
1649 __run_timers(this_cpu_ptr(&timer_bases[BASE_DEF]));
1653 * Called by the local, per-CPU timer interrupt on SMP.
1655 void run_local_timers(void)
1657 struct timer_base *base = this_cpu_ptr(&timer_bases[BASE_STD]);
1659 hrtimer_run_queues();
1660 /* Raise the softirq only if required. */
1661 if (time_before(jiffies, base->clk)) {
1662 if (!IS_ENABLED(CONFIG_NO_HZ_COMMON) || !base->nohz_active)
1664 /* CPU is awake, so check the deferrable base. */
1666 if (time_before(jiffies, base->clk))
1669 raise_softirq(TIMER_SOFTIRQ);
1672 #ifdef __ARCH_WANT_SYS_ALARM
1675 * For backwards compatibility? This can be done in libc so Alpha
1676 * and all newer ports shouldn't need it.
1678 SYSCALL_DEFINE1(alarm, unsigned int, seconds)
1680 return alarm_setitimer(seconds);
1685 static void process_timeout(unsigned long __data)
1687 wake_up_process((struct task_struct *)__data);
1691 * schedule_timeout - sleep until timeout
1692 * @timeout: timeout value in jiffies
1694 * Make the current task sleep until @timeout jiffies have
1695 * elapsed. The routine will return immediately unless
1696 * the current task state has been set (see set_current_state()).
1698 * You can set the task state as follows -
1700 * %TASK_UNINTERRUPTIBLE - at least @timeout jiffies are guaranteed to
1701 * pass before the routine returns. The routine will return 0
1703 * %TASK_INTERRUPTIBLE - the routine may return early if a signal is
1704 * delivered to the current task. In this case the remaining time
1705 * in jiffies will be returned, or 0 if the timer expired in time
1707 * The current task state is guaranteed to be TASK_RUNNING when this
1710 * Specifying a @timeout value of %MAX_SCHEDULE_TIMEOUT will schedule
1711 * the CPU away without a bound on the timeout. In this case the return
1712 * value will be %MAX_SCHEDULE_TIMEOUT.
1714 * In all cases the return value is guaranteed to be non-negative.
1716 signed long __sched schedule_timeout(signed long timeout)
1718 struct timer_list timer;
1719 unsigned long expire;
1723 case MAX_SCHEDULE_TIMEOUT:
1725 * These two special cases are useful to be comfortable
1726 * in the caller. Nothing more. We could take
1727 * MAX_SCHEDULE_TIMEOUT from one of the negative value
1728 * but I' d like to return a valid offset (>=0) to allow
1729 * the caller to do everything it want with the retval.
1735 * Another bit of PARANOID. Note that the retval will be
1736 * 0 since no piece of kernel is supposed to do a check
1737 * for a negative retval of schedule_timeout() (since it
1738 * should never happens anyway). You just have the printk()
1739 * that will tell you if something is gone wrong and where.
1742 printk(KERN_ERR "schedule_timeout: wrong timeout "
1743 "value %lx\n", timeout);
1745 current->state = TASK_RUNNING;
1750 expire = timeout + jiffies;
1752 setup_timer_on_stack(&timer, process_timeout, (unsigned long)current);
1753 __mod_timer(&timer, expire, false);
1755 del_singleshot_timer_sync(&timer);
1757 /* Remove the timer from the object tracker */
1758 destroy_timer_on_stack(&timer);
1760 timeout = expire - jiffies;
1763 return timeout < 0 ? 0 : timeout;
1765 EXPORT_SYMBOL(schedule_timeout);
1768 * We can use __set_current_state() here because schedule_timeout() calls
1769 * schedule() unconditionally.
1771 signed long __sched schedule_timeout_interruptible(signed long timeout)
1773 __set_current_state(TASK_INTERRUPTIBLE);
1774 return schedule_timeout(timeout);
1776 EXPORT_SYMBOL(schedule_timeout_interruptible);
1778 signed long __sched schedule_timeout_killable(signed long timeout)
1780 __set_current_state(TASK_KILLABLE);
1781 return schedule_timeout(timeout);
1783 EXPORT_SYMBOL(schedule_timeout_killable);
1785 signed long __sched schedule_timeout_uninterruptible(signed long timeout)
1787 __set_current_state(TASK_UNINTERRUPTIBLE);
1788 return schedule_timeout(timeout);
1790 EXPORT_SYMBOL(schedule_timeout_uninterruptible);
1793 * Like schedule_timeout_uninterruptible(), except this task will not contribute
1796 signed long __sched schedule_timeout_idle(signed long timeout)
1798 __set_current_state(TASK_IDLE);
1799 return schedule_timeout(timeout);
1801 EXPORT_SYMBOL(schedule_timeout_idle);
1803 #ifdef CONFIG_HOTPLUG_CPU
1804 static void migrate_timer_list(struct timer_base *new_base, struct hlist_head *head)
1806 struct timer_list *timer;
1807 int cpu = new_base->cpu;
1809 while (!hlist_empty(head)) {
1810 timer = hlist_entry(head->first, struct timer_list, entry);
1811 detach_timer(timer, false);
1812 timer->flags = (timer->flags & ~TIMER_BASEMASK) | cpu;
1813 internal_add_timer(new_base, timer);
1817 int timers_dead_cpu(unsigned int cpu)
1819 struct timer_base *old_base;
1820 struct timer_base *new_base;
1823 BUG_ON(cpu_online(cpu));
1825 for (b = 0; b < NR_BASES; b++) {
1826 old_base = per_cpu_ptr(&timer_bases[b], cpu);
1827 new_base = get_cpu_ptr(&timer_bases[b]);
1829 * The caller is globally serialized and nobody else
1830 * takes two locks at once, deadlock is not possible.
1832 spin_lock_irq(&new_base->lock);
1833 spin_lock_nested(&old_base->lock, SINGLE_DEPTH_NESTING);
1835 BUG_ON(old_base->running_timer);
1837 for (i = 0; i < WHEEL_SIZE; i++)
1838 migrate_timer_list(new_base, old_base->vectors + i);
1840 spin_unlock(&old_base->lock);
1841 spin_unlock_irq(&new_base->lock);
1842 put_cpu_ptr(&timer_bases);
1847 #endif /* CONFIG_HOTPLUG_CPU */
1849 static void __init init_timer_cpu(int cpu)
1851 struct timer_base *base;
1854 for (i = 0; i < NR_BASES; i++) {
1855 base = per_cpu_ptr(&timer_bases[i], cpu);
1857 spin_lock_init(&base->lock);
1858 base->clk = jiffies;
1862 static void __init init_timer_cpus(void)
1866 for_each_possible_cpu(cpu)
1867 init_timer_cpu(cpu);
1870 void __init init_timers(void)
1874 open_softirq(TIMER_SOFTIRQ, run_timer_softirq);
1878 * msleep - sleep safely even with waitqueue interruptions
1879 * @msecs: Time in milliseconds to sleep for
1881 void msleep(unsigned int msecs)
1883 unsigned long timeout = msecs_to_jiffies(msecs) + 1;
1886 timeout = schedule_timeout_uninterruptible(timeout);
1889 EXPORT_SYMBOL(msleep);
1892 * msleep_interruptible - sleep waiting for signals
1893 * @msecs: Time in milliseconds to sleep for
1895 unsigned long msleep_interruptible(unsigned int msecs)
1897 unsigned long timeout = msecs_to_jiffies(msecs) + 1;
1899 while (timeout && !signal_pending(current))
1900 timeout = schedule_timeout_interruptible(timeout);
1901 return jiffies_to_msecs(timeout);
1904 EXPORT_SYMBOL(msleep_interruptible);
1906 static void __sched do_usleep_range(unsigned long min, unsigned long max)
1911 kmin = ktime_set(0, min * NSEC_PER_USEC);
1912 delta = (u64)(max - min) * NSEC_PER_USEC;
1913 schedule_hrtimeout_range(&kmin, delta, HRTIMER_MODE_REL);
1917 * usleep_range - Sleep for an approximate time
1918 * @min: Minimum time in usecs to sleep
1919 * @max: Maximum time in usecs to sleep
1921 * In non-atomic context where the exact wakeup time is flexible, use
1922 * usleep_range() instead of udelay(). The sleep improves responsiveness
1923 * by avoiding the CPU-hogging busy-wait of udelay(), and the range reduces
1924 * power usage by allowing hrtimers to take advantage of an already-
1925 * scheduled interrupt instead of scheduling a new one just for this sleep.
1927 void __sched usleep_range(unsigned long min, unsigned long max)
1929 __set_current_state(TASK_UNINTERRUPTIBLE);
1930 do_usleep_range(min, max);
1932 EXPORT_SYMBOL(usleep_range);