diff options
author | pat <> | 2005-03-30 18:51:49 +0000 |
---|---|---|
committer | pat <> | 2005-03-30 18:51:49 +0000 |
commit | 894b6ab0099e7d9ca2ad9acb75246cd0a4542167 (patch) | |
tree | f9fb8e9324f6cbdc10d72cab8b889d470252465a /src/lib/libc/stdlib/merge.c | |
parent | 162f8b042bf31ab94714a6f194e9836c08c085f5 (diff) | |
download | openbsd-894b6ab0099e7d9ca2ad9acb75246cd0a4542167.tar.gz openbsd-894b6ab0099e7d9ca2ad9acb75246cd0a4542167.tar.bz2 openbsd-894b6ab0099e7d9ca2ad9acb75246cd0a4542167.zip |
ansi + de-register
ok otto deraadt
Diffstat (limited to 'src/lib/libc/stdlib/merge.c')
-rw-r--r-- | src/lib/libc/stdlib/merge.c | 25 |
1 files changed, 9 insertions, 16 deletions
diff --git a/src/lib/libc/stdlib/merge.c b/src/lib/libc/stdlib/merge.c index 1826acc369..b193ae345c 100644 --- a/src/lib/libc/stdlib/merge.c +++ b/src/lib/libc/stdlib/merge.c | |||
@@ -31,7 +31,7 @@ | |||
31 | */ | 31 | */ |
32 | 32 | ||
33 | #if defined(LIBC_SCCS) && !defined(lint) | 33 | #if defined(LIBC_SCCS) && !defined(lint) |
34 | static char *rcsid = "$OpenBSD: merge.c,v 1.6 2003/06/02 20:18:38 millert Exp $"; | 34 | static char *rcsid = "$OpenBSD: merge.c,v 1.7 2005/03/30 18:51:49 pat Exp $"; |
35 | #endif /* LIBC_SCCS and not lint */ | 35 | #endif /* LIBC_SCCS and not lint */ |
36 | 36 | ||
37 | /* | 37 | /* |
@@ -91,15 +91,12 @@ static void insertionsort(u_char *, size_t, size_t, int (*)()); | |||
91 | * Arguments are as for qsort. | 91 | * Arguments are as for qsort. |
92 | */ | 92 | */ |
93 | int | 93 | int |
94 | mergesort(base, nmemb, size, cmp) | 94 | mergesort(void *base, size_t nmemb, size_t size, |
95 | void *base; | 95 | int (*cmp)(const void *, const void *)) |
96 | size_t nmemb; | ||
97 | register size_t size; | ||
98 | int (*cmp)(const void *, const void *); | ||
99 | { | 96 | { |
100 | register int i, sense; | 97 | int i, sense; |
101 | int big, iflag; | 98 | int big, iflag; |
102 | register u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2; | 99 | u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2; |
103 | u_char *list2, *list1, *p2, *p, *last, **p1; | 100 | u_char *list2, *list1, *p2, *p, *last, **p1; |
104 | 101 | ||
105 | if (size < PSIZE / 2) { /* Pointers must fit into 2 * size. */ | 102 | if (size < PSIZE / 2) { /* Pointers must fit into 2 * size. */ |
@@ -251,10 +248,8 @@ COPY: b = t; | |||
251 | * is defined. Otherwise simple pairwise merging is used.) | 248 | * is defined. Otherwise simple pairwise merging is used.) |
252 | */ | 249 | */ |
253 | void | 250 | void |
254 | setup(list1, list2, n, size, cmp) | 251 | setup(u_char *list1, u_char *list2, size_t n, size_t size, |
255 | size_t n, size; | 252 | int (*cmp)(const void *, const void *)) |
256 | int (*cmp)(const void *, const void *); | ||
257 | u_char *list1, *list2; | ||
258 | { | 253 | { |
259 | int i, length, size2, tmp, sense; | 254 | int i, length, size2, tmp, sense; |
260 | u_char *f1, *f2, *s, *l2, *last, *p2; | 255 | u_char *f1, *f2, *s, *l2, *last, *p2; |
@@ -325,10 +320,8 @@ setup(list1, list2, n, size, cmp) | |||
325 | * last 4 elements. | 320 | * last 4 elements. |
326 | */ | 321 | */ |
327 | static void | 322 | static void |
328 | insertionsort(a, n, size, cmp) | 323 | insertionsort(u_char *a, size_t n, size_t size, |
329 | u_char *a; | 324 | int (*cmp)(const void *, const void *)) |
330 | size_t n, size; | ||
331 | int (*cmp)(const void *, const void *); | ||
332 | { | 325 | { |
333 | u_char *ai, *s, *t, *u, tmp; | 326 | u_char *ai, *s, *t, *u, tmp; |
334 | int i; | 327 | int i; |