aboutsummaryrefslogtreecommitdiff
path: root/stdlib
diff options
context:
space:
mode:
Diffstat (limited to 'stdlib')
-rw-r--r--stdlib/Makefile10
-rw-r--r--stdlib/tst-qsort.c42
2 files changed, 47 insertions, 5 deletions
diff --git a/stdlib/Makefile b/stdlib/Makefile
index 5c91f26..bfb8e1f 100644
--- a/stdlib/Makefile
+++ b/stdlib/Makefile
@@ -1,4 +1,4 @@
-# Copyright (C) 1991-1999, 2000, 2001 Free Software Foundation, Inc.
+# Copyright (C) 1991-1999, 2000, 2001, 2002 Free Software Foundation, Inc.
# This file is part of the GNU C Library.
# The GNU C Library is free software; you can redistribute it and/or
@@ -56,10 +56,10 @@ static-only-routines = atexit
distribute := exit.h grouping.h abort-instr.h isomac.c tst-fmtmsg.sh
test-srcs := tst-fmtmsg
-tests := tst-strtol tst-strtod testmb testrand testsort testdiv \
- test-canon test-canon2 tst-strtoll tst-environ \
- tst-xpg-basename tst-random tst-bsearch tst-limits \
- tst-rand48 bug-strtod tst-setcontext test-a64l
+tests := tst-strtol tst-strtod testmb testrand testsort testdiv \
+ test-canon test-canon2 tst-strtoll tst-environ \
+ tst-xpg-basename tst-random tst-bsearch tst-limits \
+ tst-rand48 bug-strtod tst-setcontext test-a64l tst-qsort
# Several mpn functions from GNU MP are used by the strtod function.
diff --git a/stdlib/tst-qsort.c b/stdlib/tst-qsort.c
new file mode 100644
index 0000000..f39667b
--- /dev/null
+++ b/stdlib/tst-qsort.c
@@ -0,0 +1,42 @@
+/* Test case by Paul Eggert <eggert@twinsun.com> */
+#include <stdio.h>
+#include <stdlib.h>
+
+struct big { char c[4 * 1024]; };
+
+struct big *array;
+struct big *array_end;
+
+int
+compare (void const *a1, void const *b1)
+{
+ struct big const *a = a1;
+ struct big const *b = b1;
+ if (! (array <= a && a < array_end
+ && array <= b && b < array_end))
+ {
+ exit (EXIT_FAILURE);
+ }
+ return b->c[0] - a->c[0];
+}
+
+int
+main (int argc, char **argv)
+{
+ size_t i;
+ size_t array_members = argv[1] ? atoi (argv[1]) : 50;
+ array = (struct big *) malloc (array_members * sizeof *array);
+ if (array == NULL)
+ {
+ puts ("no memory");
+ exit (EXIT_FAILURE);
+ }
+
+ array_end = array + array_members;
+ for (i = 0; i < array_members; i++)
+ array[i].c[0] = i % 128;
+
+ qsort (array, array_members, sizeof *array, compare);
+
+ return 0;
+}