Hi, The following patchset contains two fixes for the rbtree set backend: 1) Switch back to the list walk to detect overlap as proposed by Stefano. Use tree descent to locate nearest more than element to speed up overlap detection. Perform garbarge collection of expired element from the insert path while walking the list to avoid bogus overlap reports. 2) Do not interfer with ongoing transaction from garbage collector. Skip inactive elements from the garbage collection. Reset annotated end element coming before expired start element when it is busy with transaction update. nftables shell test sets/0044interval_overlap_0 passes without errors. This also passes this test when disabling set_overlap() in userspace nft which perform overlap detection from userspace for older kernels (< 5.7). Pablo Neira Ayuso (2): netfilter: nft_set_rbtree: Switch to node list walk for overlap detection netfilter: nft_set_rbtree: skip elements in transaction from garbage collection net/netfilter/nft_set_rbtree.c | 331 ++++++++++++++++++++------------- 1 file changed, 204 insertions(+), 127 deletions(-) -- 2.30.2
