diff options
| author |   Eric Dumazet <edumazet@google.com> | 2017-09-23 12:39:12 -0700 |
|---|---|---|
| committer |   David S. Miller <davem@davemloft.net> | 2017-09-25 20:35:11 -0700 |
| commit | 7c90584c66cc4b033a3b684b0e0950f79e7b7166 (patch) | |
| tree | 884ffbcadfd487468650145f79ab702716c4a7d4 /include/net/neighbour.h | |
| parent | sch_netem: faster rb tree removal (diff) | |
| download | linux-dev-7c90584c66cc4b033a3b684b0e0950f79e7b7166.tar.xz linux-dev-7c90584c66cc4b033a3b684b0e0950f79e7b7166.zip | |
net: speed up skb_rbtree_purge()
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>
Diffstat (limited to 'include/net/neighbour.h')
0 files changed, 0 insertions, 0 deletions