aboutsummaryrefslogtreecommitdiff
path: root/malloc/tst-calloc.c
diff options
context:
space:
mode:
authorUlrich Drepper <drepper@redhat.com>2000-04-12 23:53:40 +0000
committerUlrich Drepper <drepper@redhat.com>2000-04-12 23:53:40 +0000
commitaa780baba8ddf1845a5b8caeeaf98d2149fb68b8 (patch)
tree4a1700fe52068d5f8e8db7dc0845f9fd47cb81e8 /malloc/tst-calloc.c
parentc49b2a4e55127452b9f9b8cd307be150a8c0e3b6 (diff)
downloadglibc-aa780baba8ddf1845a5b8caeeaf98d2149fb68b8.tar
glibc-aa780baba8ddf1845a5b8caeeaf98d2149fb68b8.tar.gz
glibc-aa780baba8ddf1845a5b8caeeaf98d2149fb68b8.tar.bz2
glibc-aa780baba8ddf1845a5b8caeeaf98d2149fb68b8.zip
Update.
* malloc/Makefile (tests): Add tst-calloc. * malloc/tst-calloc.c: New file.
Diffstat (limited to 'malloc/tst-calloc.c')
-rw-r--r--malloc/tst-calloc.c110
1 files changed, 110 insertions, 0 deletions
diff --git a/malloc/tst-calloc.c b/malloc/tst-calloc.c
new file mode 100644
index 0000000000..371cfeb11a
--- /dev/null
+++ b/malloc/tst-calloc.c
@@ -0,0 +1,110 @@
+/* Copyright (C) 2000 Free Software Foundation, Inc.
+ This file is part of the GNU C Library.
+ Contributed by Ulrich Drepper <drepper@redhat.com>.
+
+ The GNU C Library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Library General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ The GNU C Library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Library General Public License for more details.
+
+ You should have received a copy of the GNU Library General Public
+ License along with the GNU C Library; see the file COPYING.LIB. If not,
+ write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+#include <errno.h>
+#include <error.h>
+#include <malloc.h>
+#include <stdlib.h>
+#include <stdio.h>
+
+
+/* Number of samples per size. */
+#define N 50000
+
+
+static void
+fixed_test (int size)
+{
+ char *ptrs[N];
+ int i;
+
+ for (i = 0; i < N; ++i)
+ {
+ int j;
+
+ ptrs[i] = (char *) calloc (1, size);
+
+ if (ptrs[i] == NULL)
+ break;
+
+ for (j = 0; j < size; ++j)
+ {
+ if (ptrs[i][j] != '\0')
+ error (EXIT_FAILURE, 0,
+ "byte not cleared (size %d, element %d, byte %d)",
+ size, i, j);
+ ptrs[i][j] = '\xff';
+ }
+ }
+
+ while (i-- > 0)
+ free (ptrs[i]);
+}
+
+
+static void
+random_test (void)
+{
+ char *ptrs[N];
+ int i;
+
+ for (i = 0; i < N; ++i)
+ {
+ int j;
+ int n = 1 + random () % 10;
+ int elem = 1 + random () % 100;
+ int size = n * elem;
+
+ ptrs[i] = (char *) calloc (n, elem);
+
+ if (ptrs[i] == NULL)
+ break;
+
+ for (j = 0; j < size; ++j)
+ {
+ if (ptrs[i][j] != '\0')
+ error (EXIT_FAILURE, 0,
+ "byte not cleared (size %d, element %d, byte %d)",
+ size, i, j);
+ ptrs[i][j] = '\xff';
+ }
+ }
+
+ while (i-- > 0)
+ free (ptrs[i]);
+}
+
+
+int
+main (void)
+{
+ /* We are allocating blocks with `calloc' and check whether every
+ block is completely cleared. We first try this for some fixed
+ times and then with random size. */
+ fixed_test (15);
+ fixed_test (5);
+ fixed_test (17);
+ fixed_test (6);
+ fixed_test (31);
+ fixed_test (96);
+
+ random_test ();
+
+ return 0;
+}