Date: Thu, 26 May 2016 14:18:36 +0200 From: Hans Petter Selasky <hps@selasky.org> To: Ed Schouten <ed@nuxi.nl> Cc: src-committers <src-committers@freebsd.org>, svn-src-all@freebsd.org, svn-src-head@freebsd.org Subject: Re: svn commit: r300731 - head/sys/netinet Message-ID: <a4858a93-cfa6-421c-cd3b-3ff9b3feb95f@selasky.org> In-Reply-To: <CABh_MK=RKCwUpwuXd5YX0o9OgLUXn3wfVFEhd1f3HQbZyDavew@mail.gmail.com> References: <201605261110.u4QBAW7W099643@repo.freebsd.org> <CABh_MK=RKCwUpwuXd5YX0o9OgLUXn3wfVFEhd1f3HQbZyDavew@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On 05/26/16 14:10, Ed Schouten wrote: > Hi Hans, > > 2016-05-26 13:10 GMT+02:00 Hans Petter Selasky <hselasky@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"? Sure. Can you send me a patch? --HPS
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?a4858a93-cfa6-421c-cd3b-3ff9b3feb95f>