On Wed, Nov 20, 2019 at 04:16:53PM +0100, Florian Westphal wrote: > Stefano Brivio <sbrivio@xxxxxxxxxx> wrote: > > If the AVX2 set is available, we can exploit the repetitive > > characteristic of this algorithm to provide a fast, vectorised > > version by using 256-bit wide AVX2 operands for bucket loads and > > bitwise intersections. > > > > In most cases, this implementation consistently outperforms rbtree > > set instances despite the fact they are configured to use a given, > > single, ranged data type out of the ones used for performance > > measurements by the nft_concat_range.sh kselftest. > > I think in that case it makes sense to remove rbtree once this new > set type has had some upstream exposure and let pipapo handle the > range sets. Agreed.
