Messages in this thread | | | Date | Mon, 31 Jan 2005 08:53:55 -0800 | From | Matt Mackall <> | Subject | Re: [PATCH 1/8] lib/sort: Heapsort implementation of sort() |
| |
On Mon, Jan 31, 2005 at 01:52:57PM +0200, Alexey Dobriyan wrote: > On Mon, 31 Jan 2005 01:34:59 -0600, Matt Mackall wrote: > > > This patch adds a generic array sorting library routine. This is meant > > to replace qsort, which has two problem areas for kernel use. > > > --- /dev/null > > +++ mm2/include/linux/sort.h > > @@ -0,0 +1,8 @@ > > > +void sort(void *base, size_t num, size_t size, > > + int (*cmp)(const void *, const void *), > > + void (*swap)(void *, void *, int)); > > extern void sort(...) ?
Extern is 100% redundant on function declarations.
> P. S.: Andrew's email ends with ".org".
I should not mail off patches just before going to sleep.
-- Mathematics is the supreme nostalgia of our time. - 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/
| |