summaryrefslogtreecommitdiff
path: root/fs/reiserfs
diff options
context:
space:
mode:
authorDavidlohr Bueso <dave@stgolabs.net>2017-09-09 02:15:18 +0300
committerLinus Torvalds <torvalds@linux-foundation.org>2017-09-09 04:26:49 +0300
commitb2ac2ea6296e7dd779168eb085b09d0fab9d1294 (patch)
tree8fefe90ed4da5ac94000fd160d42c5c39a225670 /fs/reiserfs
parent410bd5ecb276593e7ec1552014083215d4a43c3a (diff)
downloadlinux-b2ac2ea6296e7dd779168eb085b09d0fab9d1294.tar.xz
fs/epoll: use faster rb_first_cached()
... such that we can avoid the tree walks to get the node with the smallest key. Semantically the same, as the previously used rb_first(), but O(1). The main overhead is the extra footprint for the cached rb_node pointer, which should not matter for epoll. Link: http://lkml.kernel.org/r/20170719014603.19029-15-dave@stgolabs.net Signed-off-by: Davidlohr Bueso <dbueso@suse.de> Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org> Cc: Jan Kara <jack@suse.cz> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'fs/reiserfs')
0 files changed, 0 insertions, 0 deletions