diff options
Diffstat (limited to 'stdlib')
| -rw-r--r-- | stdlib/msort.c | 2 | ||||
| -rw-r--r-- | stdlib/tst-bsearch.c | 6 | ||||
| -rw-r--r-- | stdlib/tst-xpg-basename.c | 4 |
3 files changed, 6 insertions, 6 deletions
diff --git a/stdlib/msort.c b/stdlib/msort.c index 880c5d1e3d..45d6a99b83 100644 --- a/stdlib/msort.c +++ b/stdlib/msort.c @@ -130,7 +130,7 @@ qsort (void *b, size_t n, size_t s, __compar_fn_t cmp) measured in bytes. */ /* If the memory requirements are too high don't allocate memory. */ - if (size / pagesize > phys_pages) + if (size / pagesize > (size_t) phys_pages) _quicksort (b, n, s, cmp); else { diff --git a/stdlib/tst-bsearch.c b/stdlib/tst-bsearch.c index 808ab9d8e5..04ec02a411 100644 --- a/stdlib/tst-bsearch.c +++ b/stdlib/tst-bsearch.c @@ -1,4 +1,4 @@ -/* Copyright (C) 2000 Free Software Foundation, Inc. +/* Copyright (C) 2000, 2002 Free Software Foundation, Inc. This file is part of the GNU C Library. Contributed by Ulrich Drepper <drepper@redhat.com>, 2000. @@ -54,7 +54,7 @@ comp (const void *p1, const void *p2) int main (void) { - int cnt; + size_t cnt; int result = 0; struct entry key; struct entry *res; @@ -101,7 +101,7 @@ main (void) puts ("found an entry that's not there"); result = 1; } - + /* Now the array contains only one element - no entry should be found. */ for (cnt = 0; cnt < narr; ++cnt) { diff --git a/stdlib/tst-xpg-basename.c b/stdlib/tst-xpg-basename.c index dd22cf73b2..38f995ecb0 100644 --- a/stdlib/tst-xpg-basename.c +++ b/stdlib/tst-xpg-basename.c @@ -1,4 +1,4 @@ -/* Copyright (C) 1999, 2000 Free Software Foundation, Inc. +/* Copyright (C) 1999, 2000, 2002 Free Software Foundation, Inc. This file is part of the GNU C Library. Contributed by Andreas Jaeger <aj@suse.de>, 1999. @@ -41,7 +41,7 @@ static struct int main (void) { - int i = 0; + size_t i = 0; int errors = 0; char path[1024]; char *file; |