diff options
author | Eric Dumazet <edumazet@google.com> | 2018-03-31 22:58:58 +0300 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2018-04-01 06:25:40 +0300 |
commit | bf66337140c64c27fa37222b7abca7e49d63fb57 (patch) | |
tree | 21a458948982fa21406bf356534516789d435661 /.get_maintainer.ignore | |
parent | c2615cf5a761b32bf74e85bddc223dfff3d9b9f0 (diff) | |
download | linux-bf66337140c64c27fa37222b7abca7e49d63fb57.tar.xz |
inet: frags: get rid of ipfrag_skb_cb/FRAG_CB
ip_defrag uses skb->cb[] to store the fragment offset, and unfortunately
this integer is currently in a different cache line than skb->next,
meaning that we use two cache lines per skb when finding the insertion point.
By aliasing skb->ip_defrag_offset and skb->dev, we pack all the fields
in a single cache line and save precious memory bandwidth.
Note that after the fast path added by Changli Gao in commit
d6bebca92c66 ("fragment: add fast path for in-order fragments")
this change wont help the fast path, since we still need
to access prev->len (2nd cache line), but will show great
benefits when slow path is entered, since we perform
a linear scan of a potentially long list.
Also, note that this potential long list is an attack vector,
we might consider also using an rb-tree there eventually.
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to '.get_maintainer.ignore')
0 files changed, 0 insertions, 0 deletions