xf.li | bdd93d5 | 2023-05-12 07:10:14 -0700 | [diff] [blame^] | 1 | /* Test memchr functions. |
| 2 | Copyright (C) 1999-2016 Free Software Foundation, Inc. |
| 3 | This file is part of the GNU C Library. |
| 4 | Written by Jakub Jelinek <jakub@redhat.com>, 1999. |
| 5 | |
| 6 | The GNU C Library is free software; you can redistribute it and/or |
| 7 | modify it under the terms of the GNU Lesser General Public |
| 8 | License as published by the Free Software Foundation; either |
| 9 | version 2.1 of the License, or (at your option) any later version. |
| 10 | |
| 11 | The GNU C Library is distributed in the hope that it will be useful, |
| 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 | Lesser General Public License for more details. |
| 15 | |
| 16 | You should have received a copy of the GNU Lesser General Public |
| 17 | License along with the GNU C Library; if not, see |
| 18 | <http://www.gnu.org/licenses/>. */ |
| 19 | |
| 20 | #define TEST_MAIN |
| 21 | #ifndef WIDE |
| 22 | # define TEST_NAME "memchr" |
| 23 | #else |
| 24 | # define TEST_NAME "wmemchr" |
| 25 | #endif /* WIDE */ |
| 26 | #include "test-string.h" |
| 27 | |
| 28 | #ifndef WIDE |
| 29 | # define MEMCHR memchr |
| 30 | # define CHAR char |
| 31 | # define UCHAR unsigned char |
| 32 | # define SIMPLE_MEMCHR simple_memchr |
| 33 | # define BIG_CHAR CHAR_MAX |
| 34 | # define SMALL_CHAR 127 |
| 35 | #else |
| 36 | # include <wchar.h> |
| 37 | # define MEMCHR wmemchr |
| 38 | # define CHAR wchar_t |
| 39 | # define UCHAR wchar_t |
| 40 | # define SIMPLE_MEMCHR simple_wmemchr |
| 41 | # define BIG_CHAR WCHAR_MAX |
| 42 | # define SMALL_CHAR 1273 |
| 43 | #endif /* WIDE */ |
| 44 | |
| 45 | typedef CHAR *(*proto_t) (const CHAR *, int, size_t); |
| 46 | CHAR *SIMPLE_MEMCHR (const CHAR *, int, size_t); |
| 47 | |
| 48 | IMPL (SIMPLE_MEMCHR, 0) |
| 49 | IMPL (MEMCHR, 1) |
| 50 | |
| 51 | CHAR * |
| 52 | SIMPLE_MEMCHR (const CHAR *s, int c, size_t n) |
| 53 | { |
| 54 | while (n--) |
| 55 | if (*s++ == (CHAR) c) |
| 56 | return (CHAR *) s - 1; |
| 57 | return NULL; |
| 58 | } |
| 59 | |
| 60 | static void |
| 61 | do_one_test (impl_t *impl, const CHAR *s, int c, size_t n, CHAR *exp_res) |
| 62 | { |
| 63 | CHAR *res = CALL (impl, s, c, n); |
| 64 | if (res != exp_res) |
| 65 | { |
| 66 | error (0, 0, "Wrong result in function %s %p %p", impl->name, |
| 67 | res, exp_res); |
| 68 | ret = 1; |
| 69 | return; |
| 70 | } |
| 71 | } |
| 72 | |
| 73 | static void |
| 74 | do_test (size_t align, size_t pos, size_t len, int seek_char) |
| 75 | { |
| 76 | size_t i; |
| 77 | CHAR *result; |
| 78 | |
| 79 | align &= 7; |
| 80 | if ((align + len) * sizeof (CHAR) >= page_size) |
| 81 | return; |
| 82 | |
| 83 | CHAR *buf = (CHAR *) (buf1); |
| 84 | |
| 85 | for (i = 0; i < len; ++i) |
| 86 | { |
| 87 | buf[align + i] = 1 + 23 * i % SMALL_CHAR; |
| 88 | if (buf[align + i] == seek_char) |
| 89 | buf[align + i] = seek_char + 1; |
| 90 | } |
| 91 | buf[align + len] = 0; |
| 92 | |
| 93 | if (pos < len) |
| 94 | { |
| 95 | buf[align + pos] = seek_char; |
| 96 | buf[align + len] = -seek_char; |
| 97 | result = (CHAR *) (buf + align + pos); |
| 98 | } |
| 99 | else |
| 100 | { |
| 101 | result = NULL; |
| 102 | buf[align + len] = seek_char; |
| 103 | } |
| 104 | |
| 105 | FOR_EACH_IMPL (impl, 0) |
| 106 | do_one_test (impl, (CHAR *) (buf + align), seek_char, len, result); |
| 107 | } |
| 108 | |
| 109 | static void |
| 110 | do_random_tests (void) |
| 111 | { |
| 112 | size_t i, j, n, align, pos, len; |
| 113 | int seek_char; |
| 114 | CHAR *result; |
| 115 | UCHAR *p = (UCHAR *) (buf1 + page_size) - 512; |
| 116 | |
| 117 | for (n = 0; n < ITERATIONS; n++) |
| 118 | { |
| 119 | align = random () & 15; |
| 120 | pos = random () & 511; |
| 121 | if (pos + align >= 512) |
| 122 | pos = 511 - align - (random () & 7); |
| 123 | len = random () & 511; |
| 124 | if (pos >= len) |
| 125 | len = pos + (random () & 7); |
| 126 | if (len + align >= 512) |
| 127 | len = 512 - align - (random () & 7); |
| 128 | seek_char = random () & BIG_CHAR; |
| 129 | j = len + align + 64; |
| 130 | if (j > 512) |
| 131 | j = 512; |
| 132 | |
| 133 | for (i = 0; i < j; i++) |
| 134 | { |
| 135 | if (i == pos + align) |
| 136 | p[i] = seek_char; |
| 137 | else |
| 138 | { |
| 139 | p[i] = random () & BIG_CHAR; |
| 140 | if (i < pos + align && p[i] == seek_char) |
| 141 | p[i] = seek_char + 13; |
| 142 | } |
| 143 | } |
| 144 | |
| 145 | if (pos < len) |
| 146 | { |
| 147 | size_t r = random (); |
| 148 | if ((r & 31) == 0) |
| 149 | len = ~(uintptr_t) (p + align) - ((r >> 5) & 31); |
| 150 | result = (CHAR *) (p + pos + align); |
| 151 | } |
| 152 | else |
| 153 | result = NULL; |
| 154 | |
| 155 | FOR_EACH_IMPL (impl, 1) |
| 156 | if (CALL (impl, (CHAR *) (p + align), seek_char, len) != result) |
| 157 | { |
| 158 | error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p", |
| 159 | n, impl->name, align, seek_char, len, pos, |
| 160 | CALL (impl, (CHAR *) (p + align), seek_char, len), |
| 161 | result, p); |
| 162 | ret = 1; |
| 163 | } |
| 164 | } |
| 165 | } |
| 166 | |
| 167 | int |
| 168 | test_main (void) |
| 169 | { |
| 170 | size_t i; |
| 171 | |
| 172 | test_init (); |
| 173 | |
| 174 | printf ("%20s", ""); |
| 175 | FOR_EACH_IMPL (impl, 0) |
| 176 | printf ("\t%s", impl->name); |
| 177 | putchar ('\n'); |
| 178 | |
| 179 | for (i = 1; i < 8; ++i) |
| 180 | { |
| 181 | do_test (0, 16 << i, 2048, 23); |
| 182 | do_test (i, 64, 256, 23); |
| 183 | do_test (0, 16 << i, 2048, 0); |
| 184 | do_test (i, 64, 256, 0); |
| 185 | } |
| 186 | for (i = 1; i < 32; ++i) |
| 187 | { |
| 188 | do_test (0, i, i + 1, 23); |
| 189 | do_test (0, i, i + 1, 0); |
| 190 | } |
| 191 | |
| 192 | do_random_tests (); |
| 193 | return ret; |
| 194 | } |
| 195 | |
| 196 | #include "../test-skeleton.c" |