xf.li | bdd93d5 | 2023-05-12 07:10:14 -0700 | [diff] [blame] | 1 | /* Copyright (C) 2000-2016 Free Software Foundation, Inc. |
| 2 | This file is part of the GNU C Library. |
| 3 | Contributed by Ulrich Drepper <drepper@redhat.com>. |
| 4 | |
| 5 | The GNU C Library is free software; you can redistribute it and/or |
| 6 | modify it under the terms of the GNU Lesser General Public |
| 7 | License as published by the Free Software Foundation; either |
| 8 | version 2.1 of the License, or (at your option) any later version. |
| 9 | |
| 10 | The GNU C Library is distributed in the hope that it will be useful, |
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 13 | Lesser General Public License for more details. |
| 14 | |
| 15 | You should have received a copy of the GNU Lesser General Public |
| 16 | License along with the GNU C Library; if not, see |
| 17 | <http://www.gnu.org/licenses/>. */ |
| 18 | |
| 19 | #include <errno.h> |
| 20 | #include <error.h> |
| 21 | #include <limits.h> |
| 22 | #include <malloc.h> |
| 23 | #include <stdlib.h> |
| 24 | #include <stdio.h> |
| 25 | |
| 26 | |
| 27 | /* Number of samples per size. */ |
| 28 | #define N 50000 |
| 29 | |
| 30 | |
| 31 | static void |
| 32 | fixed_test (int size) |
| 33 | { |
| 34 | char *ptrs[N]; |
| 35 | int i; |
| 36 | |
| 37 | for (i = 0; i < N; ++i) |
| 38 | { |
| 39 | int j; |
| 40 | |
| 41 | ptrs[i] = (char *) calloc (1, size); |
| 42 | |
| 43 | if (ptrs[i] == NULL) |
| 44 | break; |
| 45 | |
| 46 | for (j = 0; j < size; ++j) |
| 47 | { |
| 48 | if (ptrs[i][j] != '\0') |
| 49 | error (EXIT_FAILURE, 0, |
| 50 | "byte not cleared (size %d, element %d, byte %d)", |
| 51 | size, i, j); |
| 52 | ptrs[i][j] = '\xff'; |
| 53 | } |
| 54 | } |
| 55 | |
| 56 | while (i-- > 0) |
| 57 | free (ptrs[i]); |
| 58 | } |
| 59 | |
| 60 | |
| 61 | static void |
| 62 | random_test (void) |
| 63 | { |
| 64 | char *ptrs[N]; |
| 65 | int i; |
| 66 | |
| 67 | for (i = 0; i < N; ++i) |
| 68 | { |
| 69 | int j; |
| 70 | int n = 1 + random () % 10; |
| 71 | int elem = 1 + random () % 100; |
| 72 | int size = n * elem; |
| 73 | |
| 74 | ptrs[i] = (char *) calloc (n, elem); |
| 75 | |
| 76 | if (ptrs[i] == NULL) |
| 77 | break; |
| 78 | |
| 79 | for (j = 0; j < size; ++j) |
| 80 | { |
| 81 | if (ptrs[i][j] != '\0') |
| 82 | error (EXIT_FAILURE, 0, |
| 83 | "byte not cleared (size %d, element %d, byte %d)", |
| 84 | size, i, j); |
| 85 | ptrs[i][j] = '\xff'; |
| 86 | } |
| 87 | } |
| 88 | |
| 89 | while (i-- > 0) |
| 90 | free (ptrs[i]); |
| 91 | } |
| 92 | |
| 93 | |
| 94 | static void |
| 95 | null_test (void) |
| 96 | { |
| 97 | /* If the size is 0 the result is implementation defined. Just make |
| 98 | sure the program doesn't crash. */ |
| 99 | calloc (0, 0); |
| 100 | calloc (0, UINT_MAX); |
| 101 | calloc (UINT_MAX, 0); |
| 102 | calloc (0, ~((size_t) 0)); |
| 103 | calloc (~((size_t) 0), 0); |
| 104 | } |
| 105 | |
| 106 | |
| 107 | static int |
| 108 | do_test (void) |
| 109 | { |
| 110 | /* We are allocating blocks with `calloc' and check whether every |
| 111 | block is completely cleared. We first try this for some fixed |
| 112 | times and then with random size. */ |
| 113 | fixed_test (15); |
| 114 | fixed_test (5); |
| 115 | fixed_test (17); |
| 116 | fixed_test (6); |
| 117 | fixed_test (31); |
| 118 | fixed_test (96); |
| 119 | |
| 120 | random_test (); |
| 121 | |
| 122 | null_test (); |
| 123 | |
| 124 | return 0; |
| 125 | } |
| 126 | |
| 127 | #define TEST_FUNCTION do_test () |
| 128 | #include "../test-skeleton.c" |