tree 8fefe90ed4da5ac94000fd160d42c5c39a225670
parent 410bd5ecb276593e7ec1552014083215d4a43c3a
author Davidlohr Bueso <dave@stgolabs.net> 1504912518 -0700
committer Linus Torvalds <torvalds@linux-foundation.org> 1504920409 -0700

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>