]> asedeno.scripts.mit.edu Git - linux.git/commit
projects / linux.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: bd79bc5) | patch
SUNRPC: Convert xprt receive queue to use an rbtree
authorTrond Myklebust <trond.myklebust@hammerspace.com>
Fri, 7 Sep 2018 12:35:22 +0000 (08:35 -0400)
committerTrond Myklebust <trond.myklebust@hammerspace.com>
Sun, 30 Sep 2018 19:35:16 +0000 (15:35 -0400)
commit95f7691daa57bbd68caac2bdad79e0b08f4d46c1
tree869abdba60f556d70cab5a6250bd373aaccfcb7atree | snapshot
parentbd79bc579ca5cd35c08ab4f660085b0744bd5cfdcommit | diff
SUNRPC: Convert xprt receive queue to use an rbtree

If the server is slow, we can find ourselves with quite a lot of entries
on the receive queue. Converting the search from an O(n) to O(log(n))
can make a significant difference, particularly since we have to hold
a number of locks while searching.

Signed-off-by: Trond Myklebust <trond.myklebust@hammerspace.com>
include/linux/sunrpc/xprt.h diff | blob | history
net/sunrpc/xprt.c diff | blob | history
local clone of linux.git