aboutsummaryrefslogtreecommitdiffstats
path: root/kernel/time/hrtimer.c
diff options
context:
space:
mode:
authorDavidlohr Bueso <dave@stgolabs.net>2019-07-24 08:23:23 -0700
committerThomas Gleixner <tglx@linutronix.de>2019-07-24 17:38:01 +0200
commit511885d7061eda3eb1faf3f57dcc936ff75863f1 (patch)
treeaa17e0932d884a2088909c8523d8c3c17e34af06 /kernel/time/hrtimer.c
parentMerge branch 'parisc-5.3-3' of git://git.kernel.org/pub/scm/linux/kernel/git/deller/parisc-linux (diff)
downloadlinux-dev-511885d7061eda3eb1faf3f57dcc936ff75863f1.tar.xz
linux-dev-511885d7061eda3eb1faf3f57dcc936ff75863f1.zip
lib/timerqueue: Rely on rbtree semantics for next timer
Simplify the timerqueue code by using cached rbtrees and rely on the tree leftmost node semantics to get the timer with earliest expiration time. This is a drop in conversion, and therefore semantics remain untouched. The runtime overhead of cached rbtrees is be pretty much the same as the current head->next method, noting that when removing the leftmost node, a common operation for the timerqueue, the rb_next(leftmost) is O(1) as well, so the next timer will either be the right node or its parent. Therefore no extra pointer chasing. Finally, the size of the struct timerqueue_head remains the same. Passes several hours of rcutorture. Signed-off-by: Davidlohr Bueso <dbueso@suse.de> Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Link: https://lkml.kernel.org/r/20190724152323.bojciei3muvfxalm@linux-r8p5
Diffstat (limited to 'kernel/time/hrtimer.c')
0 files changed, 0 insertions, 0 deletions