summaryrefslogtreecommitdiffstats
path: root/crypto/ahash.c
diff options
context:
space:
mode:
authorThomas Gleixner <tglx@linutronix.de>2012-05-26 00:08:58 +0200
committerThomas Gleixner <tglx@linutronix.de>2012-06-06 13:49:01 +0200
commit99d5f3aac674fe081ffddd2dbb8946ccbc14c410 (patch)
treed4a6cb5f0d4906f2ce983d2db8b4046b96706f53 /crypto/ahash.c
parenttimers: Consolidate base->next_timer update (diff)
downloadlinux-99d5f3aac674fe081ffddd2dbb8946ccbc14c410.tar.xz
linux-99d5f3aac674fe081ffddd2dbb8946ccbc14c410.zip
timers: Add accounting of non deferrable timers
The code in get_next_timer_interrupt() is suboptimal as it has to run through the cascade to find the next expiring timer. On a completely idle core we should only do that when there is an active timer enqueued and base->next_timer does not give us a fast answer. Add accounting of the active timers to the now consolidated attach/detach code. I deliberately avoided sanity checks because the code is fully symetric and any fiddling with timers w/o using the API functions will lead to cute explosions anyway. ulong is big enough even on 32bit and if we really run into the situation to have more than 1<<32 timers enqueued there, then we are definitely not in a state to go idle and run through that code. This allows us to fix another shortcoming of get_next_timer_interrupt(). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Gilad Ben-Yossef <gilad@benyossef.com> Cc: Frederic Weisbecker <fweisbec@gmail.com> Link: http://lkml.kernel.org/r/20120525214819.236377028@linutronix.de
Diffstat (limited to 'crypto/ahash.c')
0 files changed, 0 insertions, 0 deletions