| commit | b2ac2ea6296e7dd779168eb085b09d0fab9d1294 | [log] [tgz] |
|---|---|---|
| author | Davidlohr Bueso <[email protected]> | Fri Sep 08 16:15:18 2017 -0700 |
| committer | Linus Torvalds <[email protected]> | Fri Sep 08 18:26:49 2017 -0700 |
| tree | 8fefe90ed4da5ac94000fd160d42c5c39a225670 | |
| parent | 410bd5ecb276593e7ec1552014083215d4a43c3a [diff] |
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/[email protected] Signed-off-by: Davidlohr Bueso <[email protected]> Acked-by: Peter Zijlstra (Intel) <[email protected]> Cc: Jan Kara <[email protected]> Signed-off-by: Andrew Morton <[email protected]> Signed-off-by: Linus Torvalds <[email protected]>