| commit | 95f7691daa57bbd68caac2bdad79e0b08f4d46c1 | [log] [tgz] |
|---|---|---|
| author | Trond Myklebust <trond.myklebust@hammerspace.com> | Fri Sep 07 08:35:22 2018 -0400 |
| committer | Trond Myklebust <trond.myklebust@hammerspace.com> | Sun Sep 30 15:35:16 2018 -0400 |
| tree | 869abdba60f556d70cab5a6250bd373aaccfcb7a | |
| parent | bd79bc579ca5cd35c08ab4f660085b0744bd5cfd [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>