projects / linux-2.6-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: a2e4a21) | patch
inetpeer: speed up inetpeer_invalidate_tree()
authorEric Dumazet <edumazet@google.com>
Mon, 25 Sep 2017 16:14:14 +0000 (09:14 -0700)
committerDavid S. Miller <davem@davemloft.net>
Thu, 28 Sep 2017 16:40:59 +0000 (09:40 -0700)
commit8f1975e31d8ed0c021a1993a4d9123dd39c740ea
treec6a89ea132e322e203ae6cd3817819c71062f5fdtree | snapshot
parenta2e4a21906e1ff7d2db9ce2e446e76abc905b79fcommit | diff
inetpeer: speed up inetpeer_invalidate_tree()

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)

From: Eric Dumazet <edumazet@google.com>

Signed-off-by: David S. Miller <davem@davemloft.net>
net/ipv4/inetpeer.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)