diff options
author | Craig Gallek <kraig@google.com> | 2016-01-04 17:41:46 -0500 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2016-01-04 22:49:58 -0500 |
commit | e32ea7e747271a0abcd37e265005e97cc81d9df5 (patch) | |
tree | f3176589179db2e0df7a306bb3564ef6c6fddc17 /include/linux/filter.h | |
parent | ef456144da8ef507c8cf504284b6042e9201a05c (diff) | |
download | linux-stable-e32ea7e747271a0abcd37e265005e97cc81d9df5.tar.gz linux-stable-e32ea7e747271a0abcd37e265005e97cc81d9df5.tar.bz2 linux-stable-e32ea7e747271a0abcd37e265005e97cc81d9df5.zip |
soreuseport: fast reuseport UDP socket selection
Include a struct sock_reuseport instance when a UDP socket binds to
a specific address for the first time with the reuseport flag set.
When selecting a socket for an incoming UDP packet, use the information
available in sock_reuseport if present.
This required adding an additional field to the UDP source address
equality function to differentiate between exact and wildcard matches.
The original use case allowed wildcard matches when checking for
existing port uses during bind. The new use case of adding a socket
to a reuseport group requires exact address matching.
Performance test (using a machine with 2 CPU sockets and a total of
48 cores): Create reuseport groups of varying size. Use one socket
from this group per user thread (pinning each thread to a different
core) calling recvmmsg in a tight loop. Record number of messages
received per second while saturating a 10G link.
10 sockets: 18% increase (~2.8M -> 3.3M pkts/s)
20 sockets: 14% increase (~2.9M -> 3.3M pkts/s)
40 sockets: 13% increase (~3.0M -> 3.4M pkts/s)
This work is based off a similar implementation written by
Ying Cai <ycai@google.com> for implementing policy-based reuseport
selection.
Signed-off-by: Craig Gallek <kraig@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'include/linux/filter.h')
0 files changed, 0 insertions, 0 deletions