From owner-svn-src-head@freebsd.org Thu May 26 12:15:19 2016 Return-Path: Delivered-To: svn-src-head@mailman.ysv.freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) by mailman.ysv.freebsd.org (Postfix) with ESMTP id 91A9EB494A4; Thu, 26 May 2016 12:15:19 +0000 (UTC) (envelope-from hps@selasky.org) Received: from mail.turbocat.net (mail.turbocat.net [IPv6:2a01:4f8:d16:4514::2]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (Client did not present a certificate) by mx1.freebsd.org (Postfix) with ESMTPS id 5C7001065; Thu, 26 May 2016 12:15:19 +0000 (UTC) (envelope-from hps@selasky.org) Received: from laptop015.home.selasky.org (unknown [62.141.129.119]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by mail.turbocat.net (Postfix) with ESMTPSA id CD0261FE024; Thu, 26 May 2016 14:15:16 +0200 (CEST) Subject: Re: svn commit: r300731 - head/sys/netinet To: Ed Schouten References: <201605261110.u4QBAW7W099643@repo.freebsd.org> Cc: src-committers , svn-src-all@freebsd.org, svn-src-head@freebsd.org From: Hans Petter Selasky Message-ID: Date: Thu, 26 May 2016 14:18:36 +0200 User-Agent: Mozilla/5.0 (X11; FreeBSD amd64; rv:45.0) Gecko/20100101 Thunderbird/45.0 MIME-Version: 1.0 In-Reply-To: Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-BeenThere: svn-src-head@freebsd.org X-Mailman-Version: 2.1.22 Precedence: list List-Id: SVN commit messages for the src tree for head/-current List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 26 May 2016 12:15:19 -0000 On 05/26/16 14:10, Ed Schouten wrote: > Hi Hans, > > 2016-05-26 13:10 GMT+02:00 Hans Petter Selasky : >> 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