use size_t to index arrays; avoids big array bugs; ok millert@ guenther@

1 files changed, 1 insertions, 1 deletions

diff --git a/src/lib/libc/stdlib/heapsort.c b/src/lib/libc/stdlib/heapsort.c
index e6fb61ba2f..ad3fffbcd9 100644
--- a/src/lib/libc/stdlib/heapsort.c
+++ b/src/lib/libc/stdlib/heapsort.c
@@ -133,7 +133,7 @@ int
 heapsort(void *vbase, size_t nmemb, size_t size,
     int (*compar)(const void *, const void *))
 {
-        int cnt, i, j, l;
+        size_t cnt, i, j, l;
         char tmp, *tmp1, *tmp2;
         char *base, *k, *p, *t;