]>
Commit | Line | Data |
---|---|---|
1 | /* Test memchr functions. | |
2 | Copyright (C) 1999-2019 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 | ||
27 | #include "test-string.h" | |
28 | #include <stdint.h> | |
29 | ||
30 | #ifndef WIDE | |
31 | # define MEMCHR memchr | |
32 | # define CHAR char | |
33 | # define UCHAR unsigned char | |
34 | # define SIMPLE_MEMCHR simple_memchr | |
35 | # define BIG_CHAR CHAR_MAX | |
36 | # define SMALL_CHAR 127 | |
37 | #else | |
38 | # include <wchar.h> | |
39 | # define MEMCHR wmemchr | |
40 | # define CHAR wchar_t | |
41 | # define UCHAR wchar_t | |
42 | # define SIMPLE_MEMCHR simple_wmemchr | |
43 | # define BIG_CHAR WCHAR_MAX | |
44 | # define SMALL_CHAR 1273 | |
45 | #endif /* WIDE */ | |
46 | ||
47 | typedef CHAR *(*proto_t) (const CHAR *, int, size_t); | |
48 | CHAR *SIMPLE_MEMCHR (const CHAR *, int, size_t); | |
49 | ||
50 | IMPL (SIMPLE_MEMCHR, 0) | |
51 | IMPL (MEMCHR, 1) | |
52 | ||
53 | CHAR * | |
54 | SIMPLE_MEMCHR (const CHAR *s, int c, size_t n) | |
55 | { | |
56 | while (n--) | |
57 | if (*s++ == (CHAR) c) | |
58 | return (CHAR *) s - 1; | |
59 | return NULL; | |
60 | } | |
61 | ||
62 | static void | |
63 | do_one_test (impl_t *impl, const CHAR *s, int c, size_t n, CHAR *exp_res) | |
64 | { | |
65 | CHAR *res = CALL (impl, s, c, n); | |
66 | if (res != exp_res) | |
67 | { | |
68 | error (0, 0, "Wrong result in function %s %p %p", impl->name, | |
69 | res, exp_res); | |
70 | ret = 1; | |
71 | return; | |
72 | } | |
73 | } | |
74 | ||
75 | static void | |
76 | do_test (size_t align, size_t pos, size_t len, size_t n, int seek_char) | |
77 | { | |
78 | size_t i; | |
79 | CHAR *result; | |
80 | ||
81 | if ((align + len) * sizeof (CHAR) >= page_size) | |
82 | return; | |
83 | ||
84 | CHAR *buf = (CHAR *) (buf1); | |
85 | ||
86 | for (i = 0; i < len; ++i) | |
87 | { | |
88 | buf[align + i] = 1 + 23 * i % SMALL_CHAR; | |
89 | if (buf[align + i] == seek_char) | |
90 | buf[align + i] = seek_char + 1; | |
91 | } | |
92 | buf[align + len] = 0; | |
93 | ||
94 | if (pos < len) | |
95 | { | |
96 | buf[align + pos] = seek_char; | |
97 | buf[align + len] = -seek_char; | |
98 | result = (CHAR *) (buf + align + pos); | |
99 | } | |
100 | else | |
101 | { | |
102 | result = NULL; | |
103 | buf[align + len] = seek_char; | |
104 | } | |
105 | ||
106 | FOR_EACH_IMPL (impl, 0) | |
107 | do_one_test (impl, (CHAR *) (buf + align), seek_char, n, result); | |
108 | } | |
109 | ||
110 | static void | |
111 | do_random_tests (void) | |
112 | { | |
113 | size_t i, j, n, align, pos, len; | |
114 | int seek_char; | |
115 | CHAR *result; | |
116 | UCHAR *p = (UCHAR *) (buf1 + page_size) - 512; | |
117 | ||
118 | for (n = 0; n < ITERATIONS; n++) | |
119 | { | |
120 | align = random () & 15; | |
121 | pos = random () & 511; | |
122 | if (pos + align >= 512) | |
123 | pos = 511 - align - (random () & 7); | |
124 | len = random () & 511; | |
125 | if (pos >= len) | |
126 | len = pos + (random () & 7); | |
127 | if (len + align >= 512) | |
128 | len = 512 - align - (random () & 7); | |
129 | seek_char = random () & BIG_CHAR; | |
130 | j = len + align + 64; | |
131 | if (j > 512) | |
132 | j = 512; | |
133 | ||
134 | for (i = 0; i < j; i++) | |
135 | { | |
136 | if (i == pos + align) | |
137 | p[i] = seek_char; | |
138 | else | |
139 | { | |
140 | p[i] = random () & BIG_CHAR; | |
141 | if (i < pos + align && p[i] == seek_char) | |
142 | p[i] = seek_char + 13; | |
143 | } | |
144 | } | |
145 | ||
146 | if (pos < len) | |
147 | { | |
148 | size_t r = random (); | |
149 | if ((r & 31) == 0) | |
150 | len = ~(uintptr_t) (p + align) - ((r >> 5) & 31); | |
151 | result = (CHAR *) (p + pos + align); | |
152 | } | |
153 | else | |
154 | result = NULL; | |
155 | ||
156 | FOR_EACH_IMPL (impl, 1) | |
157 | if (CALL (impl, (CHAR *) (p + align), seek_char, len) != result) | |
158 | { | |
159 | error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p", | |
160 | n, impl->name, align, seek_char, len, pos, | |
161 | CALL (impl, (CHAR *) (p + align), seek_char, len), | |
162 | result, p); | |
163 | ret = 1; | |
164 | } | |
165 | } | |
166 | } | |
167 | ||
168 | int | |
169 | test_main (void) | |
170 | { | |
171 | size_t i, j; | |
172 | ||
173 | test_init (); | |
174 | ||
175 | printf ("%20s", ""); | |
176 | FOR_EACH_IMPL (impl, 0) | |
177 | printf ("\t%s", impl->name); | |
178 | putchar ('\n'); | |
179 | ||
180 | for (i = 1; i < 8; ++i) | |
181 | { | |
182 | /* Test n == 0. */ | |
183 | do_test (i, i, 0, 0, 23); | |
184 | do_test (i, i, 0, 0, 0); | |
185 | ||
186 | do_test (0, 16 << i, 2048, 2048, 23); | |
187 | do_test (i, 64, 256, 256, 23); | |
188 | do_test (0, 16 << i, 2048, 2048, 0); | |
189 | do_test (i, 64, 256, 256, 0); | |
190 | ||
191 | /* Check for large input sizes and for these cases we need to | |
192 | make sure the byte is within the size range (that's why | |
193 | 7 << i must be smaller than 2048). */ | |
194 | do_test (0, 7 << i, 2048, SIZE_MAX, 23); | |
195 | do_test (0, 2048 - i, 2048, SIZE_MAX, 23); | |
196 | do_test (i, 64, 256, SIZE_MAX, 23); | |
197 | do_test (0, 7 << i, 2048, SIZE_MAX, 0); | |
198 | do_test (0, 2048 - i, 2048, SIZE_MAX, 0); | |
199 | do_test (i, 64, 256, SIZE_MAX, 0); | |
200 | } | |
201 | ||
202 | for (i = 1; i < 64; ++i) | |
203 | { | |
204 | for (j = 1; j < 64; j++) | |
205 | { | |
206 | do_test (0, 64 - j, 64, SIZE_MAX, 23); | |
207 | do_test (i, 64 - j, 64, SIZE_MAX, 23); | |
208 | } | |
209 | } | |
210 | ||
211 | for (i = 1; i < 32; ++i) | |
212 | { | |
213 | do_test (0, i, i + 1, i + 1, 23); | |
214 | do_test (0, i, i + 1, i + 1, 0); | |
215 | } | |
216 | ||
217 | /* BZ#21182 - wrong overflow calculation for i686 implementation | |
218 | with address near end of the page. */ | |
219 | for (i = 2; i < 16; ++i) | |
220 | /* page_size is in fact getpagesize() * 2. */ | |
221 | do_test (page_size / 2 - i, i, i, 1, 0x9B); | |
222 | ||
223 | do_random_tests (); | |
224 | return ret; | |
225 | } | |
226 | ||
227 | #include <support/test-driver.c> |