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. Stefano, if I understand this right then we could figure out which implementation (C or AVX) is used via "grep avx2 /proc/cpuinfo". If not, I think we might want to expose some additional debug info on set dumps.
