lkml.org 
[lkml]   [2002]   [Apr]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC] 2.5.8 sort kernel tables
On Thu, Apr 18, 2002 at 08:16:00PM +0200, Kai Henningsen wrote:
> wli@holomorphy.com (William Lee Irwin III) wrote on 18.04.02 in <20020418135931.GU21206@holomorphy.com>:
>
> > On Thu, Apr 18, 2002 at 07:46:26PM +1000, Keith Owens wrote:
> > > The use of __init and __exit sections breaks the assumption that tables
> > > such as __ex_table are sorted, it has already broken the dbe table in
> > > mips on 2.5. This patch against 2.5.8 adds a generic sort routine and
> > > sorts the i386 exception table.
> > > This sorting needs to be extended to several other tables, to all
> > > architectures, to modutils (insmod loads some of these tables for
> > > modules) and back ported to 2.4. Before I spend the rest of the time,
> > > any objections?
> >
> > It doesn't have to be an O(n lg(n)) method but could you use something
> > besides bubblesort? Insertion sort, selection sort, etc. are just as
> > easy and they don't have the horrific stigma of being "the worst sorting
> > algorithm ever" etc.
>
> Surely the worst (working) sort is randomsort? (Check if sorted. If not,
> pick two entries at random, exchange, retry.)

I've always been a fan of bit-decay sort.

while (!sorted(data))
;

/David
_ _
// David Weinehall <tao@acc.umu.se> /> Northern lights wander \\
// Maintainer of the v2.0 kernel // Dance across the winter sky //
\> http://www.acc.umu.se/~tao/ </ Full colour fire </
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
\
 
 \ /
  Last update: 2005-03-22 13:25    [W:0.292 / U:0.120 seconds]
©2003-2014 Jasper Spaans. Advertise on this site