summaryrefslogtreecommitdiff
path: root/include/linux/backing-dev-defs.h
diff options
context:
space:
mode:
authorEric Dumazet <edumazet@google.com>2017-09-23 12:39:12 -0700
committerGreg Kroah-Hartman <gregkh@linuxfoundation.org>2019-01-26 09:42:55 +0100
commitde614973ee159fef48ca6255a7324cb64ea31f44 (patch)
tree3eeb318848d4c33c954672c706c762734e2b9938 /include/linux/backing-dev-defs.h
parente660576a53db1f4d73c786fe3a2c67fc2d878d93 (diff)
net: speed up skb_rbtree_purge()
commit 7c90584c66cc4b033a3b684b0e0950f79e7b7166 upstream. As measured in my prior patch ("sch_netem: faster rb tree removal"), rbtree_postorder_for_each_entry_safe() is nice looking but much slower than using rb_next() directly, except when tree is small enough to fit in CPU caches (then the cost is the same) Also note that there is not even an increase of text size : $ size net/core/skbuff.o.before net/core/skbuff.o text data bss dec hex filename 40711 1298 0 42009 a419 net/core/skbuff.o.before 40711 1298 0 42009 a419 net/core/skbuff.o From: Eric Dumazet <edumazet@google.com> Signed-off-by: David S. Miller <davem@davemloft.net> Signed-off-by: Mao Wenan <maowenan@huawei.com> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Diffstat (limited to 'include/linux/backing-dev-defs.h')
0 files changed, 0 insertions, 0 deletions