Re: Using qsort(3) in the kernel (was: CVS commit: src)

To: tech-kern%NetBSD.org@localhost
Subject: Re: Using qsort(3) in the kernel (was: CVS commit: src)
From: "Martin S. Weber" <Ephaeton%gmx.net@localhost>
Date: Sun, 16 Nov 2008 16:23:28 -0500

On Sun, Nov 16, 2008 at 10:04:11PM +0100, Joerg Sonnenberger wrote:
> On Sun, Nov 16, 2008 at 03:38:24PM +0000, Matthias Scheler wrote:
> > Our implementation of qsort() uses recursion. That is IMHO a dangerous
> > thing to do in the kernel.
> 
> Another good reason to prefer mergesort is that it is a real time
> algorithm -- no degenerated cases.

Uh yes. mergesort is rt thus let's use heapsort, yay!

-Martin

References:
- Using qsort(3) in the kernel (was: CVS commit: src)
  - From: Matthias Scheler
- Re: Using qsort(3) in the kernel (was: CVS commit: src)
  - From: Joerg Sonnenberger

Prev by Date: Re: Using qsort(3) in the kernel (was: CVS commit: src)
Next by Date: Re: Using qsort(3) in the kernel
Previous by Thread: Re: Using qsort(3) in the kernel (was: CVS commit: src)
Next by Thread: Re: Using qsort(3) in the kernel
Indexes:

Home | Main Index | Thread Index | Old Index