From 894b6ab0099e7d9ca2ad9acb75246cd0a4542167 Mon Sep 17 00:00:00 2001 From: pat <> Date: Wed, 30 Mar 2005 18:51:49 +0000 Subject: ansi + de-register ok otto deraadt --- src/lib/libc/stdlib/heapsort.c | 12 +++++------- 1 file changed, 5 insertions(+), 7 deletions(-) (limited to 'src/lib/libc/stdlib/heapsort.c') diff --git a/src/lib/libc/stdlib/heapsort.c b/src/lib/libc/stdlib/heapsort.c index f4aeeef7a3..dcc0c8baad 100644 --- a/src/lib/libc/stdlib/heapsort.c +++ b/src/lib/libc/stdlib/heapsort.c @@ -31,7 +31,7 @@ */ #if defined(LIBC_SCCS) && !defined(lint) -static char *rcsid = "$OpenBSD: heapsort.c,v 1.6 2003/09/08 16:24:05 deraadt Exp $"; +static char *rcsid = "$OpenBSD: heapsort.c,v 1.7 2005/03/30 18:51:49 pat Exp $"; #endif /* LIBC_SCCS and not lint */ #include @@ -134,13 +134,11 @@ static char *rcsid = "$OpenBSD: heapsort.c,v 1.6 2003/09/08 16:24:05 deraadt Exp * only advantage over quicksort is that it requires little additional memory. */ int -heapsort(vbase, nmemb, size, compar) - void *vbase; - size_t nmemb, size; - int (*compar)(const void *, const void *); +heapsort(void *vbase, size_t nmemb, size_t size, + int (*compar)(const void *, const void *)) { - register int cnt, i, j, l; - register char tmp, *tmp1, *tmp2; + int cnt, i, j, l; + char tmp, *tmp1, *tmp2; char *base, *k, *p, *t; if (nmemb <= 1) -- cgit v1.2.3-55-g6feb