svn commit: r300731 - head/sys/netinet

[Ed Schouten]

Hi Hans,

2016-05-26 13:10 GMT+02:00 Hans Petter Selasky <hselasky at freebsd.org>:
>   Use optimised complexity safe sorting routine instead of the kernel's
>   "qsort()".

Cool! Thanks for working on this!

>   The custom sorting routine takes advantage of that the sorting key is
>   only 64 bits. Based on set and cleared bits in the sorting key it
>   partitions the array until it is sorted.

A sorting algorithm that uses such an approach is typically called Radix Sort:

https://en.wikipedia.org/wiki/Radix_sort

Would it make sense to mention this in the comments, instead of
referring to it as a "bit-slice sorter algorithm"?

-- 
Ed Schouten <ed at nuxi.nl>
Nuxi, 's-Hertogenbosch, the Netherlands
KvK-nr.: 62051717