1 /* Test memchr functions.
2 Copyright (C) 1999-2021 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Written by Jakub Jelinek <jakub@redhat.com>, 1999.
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.
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.
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 <https://www.gnu.org/licenses/>. */
22 # define TEST_NAME "memchr"
24 # define TEST_NAME "wmemchr"
27 #include "test-string.h"
31 # define MEMCHR memchr
33 # define UCHAR unsigned char
34 # define SIMPLE_MEMCHR simple_memchr
35 # define BIG_CHAR CHAR_MAX
36 # define SMALL_CHAR 127
39 # define MEMCHR wmemchr
41 # define UCHAR wchar_t
42 # define SIMPLE_MEMCHR simple_wmemchr
43 # define BIG_CHAR WCHAR_MAX
44 # define SMALL_CHAR 1273
47 typedef CHAR
*(*proto_t
) (const CHAR
*, int, size_t);
48 CHAR
*SIMPLE_MEMCHR (const CHAR
*, int, size_t);
50 IMPL (SIMPLE_MEMCHR
, 0)
54 SIMPLE_MEMCHR (const CHAR
*s
, int c
, size_t n
)
58 return (CHAR
*) s
- 1;
63 do_one_test (impl_t
*impl
, const CHAR
*s
, int c
, size_t n
, CHAR
*exp_res
)
65 CHAR
*res
= CALL (impl
, s
, c
, n
);
68 error (0, 0, "Wrong result in function %s (%p, %d, %zu) -> %p != %p",
69 impl
->name
, s
, c
, n
, res
, exp_res
);
76 do_test (size_t align
, size_t pos
, size_t len
, size_t n
, int seek_char
)
81 if ((align
+ len
) * sizeof (CHAR
) >= page_size
)
84 CHAR
*buf
= (CHAR
*) (buf1
);
86 for (i
= 0; i
< len
; ++i
)
88 buf
[align
+ i
] = 1 + 23 * i
% SMALL_CHAR
;
89 if (buf
[align
+ i
] == seek_char
)
90 buf
[align
+ i
] = seek_char
+ 1;
94 if (pos
< MIN(n
, len
))
96 buf
[align
+ pos
] = seek_char
;
97 buf
[align
+ len
] = -seek_char
;
98 result
= (CHAR
*) (buf
+ align
+ pos
);
103 buf
[align
+ len
] = seek_char
;
106 FOR_EACH_IMPL (impl
, 0)
107 do_one_test (impl
, (CHAR
*) (buf
+ align
), seek_char
, n
, result
);
111 do_overflow_tests (void)
114 const size_t one
= 1;
115 uintptr_t buf_addr
= (uintptr_t) buf1
;
117 for (i
= 0; i
< 750; ++i
)
119 do_test (0, i
, 751, SIZE_MAX
- i
, BIG_CHAR
);
120 do_test (0, i
, 751, i
- buf_addr
, BIG_CHAR
);
121 do_test (0, i
, 751, -buf_addr
- i
, BIG_CHAR
);
122 do_test (0, i
, 751, SIZE_MAX
- buf_addr
- i
, BIG_CHAR
);
123 do_test (0, i
, 751, SIZE_MAX
- buf_addr
+ i
, BIG_CHAR
);
126 for (j
= 8 * sizeof(size_t) - 1; j
; --j
)
129 do_test (0, i
, 751, len
- i
, BIG_CHAR
);
130 do_test (0, i
, 751, len
+ i
, BIG_CHAR
);
131 do_test (0, i
, 751, len
- buf_addr
- i
, BIG_CHAR
);
132 do_test (0, i
, 751, len
- buf_addr
+ i
, BIG_CHAR
);
134 do_test (0, i
, 751, ~len
- i
, BIG_CHAR
);
135 do_test (0, i
, 751, ~len
+ i
, BIG_CHAR
);
136 do_test (0, i
, 751, ~len
- buf_addr
- i
, BIG_CHAR
);
137 do_test (0, i
, 751, ~len
- buf_addr
+ i
, BIG_CHAR
);
143 do_random_tests (void)
145 size_t i
, j
, n
, align
, pos
, len
;
148 UCHAR
*p
= (UCHAR
*) (buf1
+ page_size
) - 512;
150 for (n
= 0; n
< ITERATIONS
; n
++)
152 align
= random () & 15;
153 pos
= random () & 511;
154 if (pos
+ align
>= 512)
155 pos
= 511 - align
- (random () & 7);
156 len
= random () & 511;
158 len
= pos
+ (random () & 7);
159 if (len
+ align
>= 512)
160 len
= 512 - align
- (random () & 7);
161 seek_char
= random () & BIG_CHAR
;
162 j
= len
+ align
+ 64;
166 for (i
= 0; i
< j
; i
++)
168 if (i
== pos
+ align
)
172 p
[i
] = random () & BIG_CHAR
;
173 if (i
< pos
+ align
&& p
[i
] == seek_char
)
174 p
[i
] = seek_char
+ 13;
180 size_t r
= random ();
182 len
= ~(uintptr_t) (p
+ align
) - ((r
>> 5) & 31);
183 result
= (CHAR
*) (p
+ pos
+ align
);
188 FOR_EACH_IMPL (impl
, 1)
189 if (CALL (impl
, (CHAR
*) (p
+ align
), seek_char
, len
) != result
)
191 error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p",
192 n
, impl
->name
, align
, seek_char
, len
, pos
,
193 CALL (impl
, (CHAR
*) (p
+ align
), seek_char
, len
),
208 FOR_EACH_IMPL (impl
, 0)
209 printf ("\t%s", impl
->name
);
212 for (i
= 1; i
< 8; ++i
)
215 do_test (i
, i
, 0, 0, 23);
216 do_test (i
, i
, 0, 0, 0);
218 do_test (0, 16 << i
, 2048, 2048, 23);
219 do_test (i
, 64, 256, 256, 23);
220 do_test (0, 16 << i
, 2048, 2048, 0);
221 do_test (i
, 64, 256, 256, 0);
223 /* Check for large input sizes and for these cases we need to
224 make sure the byte is within the size range (that's why
225 7 << i must be smaller than 2048). */
226 do_test (0, 7 << i
, 2048, SIZE_MAX
, 23);
227 do_test (0, 2048 - i
, 2048, SIZE_MAX
, 23);
228 do_test (i
, 64, 256, SIZE_MAX
, 23);
229 do_test (0, 7 << i
, 2048, SIZE_MAX
, 0);
230 do_test (0, 2048 - i
, 2048, SIZE_MAX
, 0);
231 do_test (i
, 64, 256, SIZE_MAX
, 0);
234 for (i
= 1; i
< 64; ++i
)
236 for (j
= 1; j
< 64; j
++)
238 do_test (0, 64 - j
, 64, SIZE_MAX
, 23);
239 do_test (i
, 64 - j
, 64, SIZE_MAX
, 23);
243 for (i
= 1; i
< 32; ++i
)
245 do_test (0, i
, i
+ 1, i
+ 1, 23);
246 do_test (0, i
, i
+ 1, i
+ 1, 0);
249 /* BZ#21182 - wrong overflow calculation for i686 implementation
250 with address near end of the page. */
251 for (i
= 2; i
< 16; ++i
)
252 /* page_size is in fact getpagesize() * 2. */
253 do_test (page_size
/ 2 - i
, i
, i
, 1, 0x9B);
256 do_overflow_tests ();
260 #include <support/test-driver.c>