]>
Commit | Line | Data |
---|---|---|
4660856c | 1 | /* Test and measure memrchr functions. |
2b778ceb | 2 | Copyright (C) 2013-2021 Free Software Foundation, Inc. |
4660856c | 3 | This file is part of the GNU C Library. |
4660856c AZ |
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 | |
5a82c748 | 17 | <https://www.gnu.org/licenses/>. */ |
4660856c AZ |
18 | |
19 | #define TEST_MAIN | |
20 | #define TEST_NAME "memrchr" | |
21 | #include "test-string.h" | |
22 | ||
23 | typedef char *(*proto_t) (const char *, int, size_t); | |
24 | char *simple_memrchr (const char *, int, size_t); | |
25 | ||
26 | IMPL (simple_memrchr, 0) | |
27 | IMPL (memrchr, 1) | |
28 | ||
29 | char * | |
30 | simple_memrchr (const char *s, int c, size_t n) | |
31 | { | |
32 | s = s + n; | |
33 | while (n--) | |
34 | if (*--s == (char) c) | |
35 | return (char *) s; | |
36 | return NULL; | |
37 | } | |
38 | ||
39 | static void | |
40 | do_one_test (impl_t *impl, const char *s, int c, size_t n, char *exp_res) | |
41 | { | |
42 | char *res = CALL (impl, s, c, n); | |
43 | if (res != exp_res) | |
44 | { | |
45 | error (0, 0, "Wrong result in function %s %p %p", impl->name, | |
46 | res, exp_res); | |
47 | ret = 1; | |
48 | return; | |
49 | } | |
50 | } | |
51 | ||
52 | static void | |
53 | do_test (size_t align, size_t pos, size_t len, int seek_char) | |
54 | { | |
55 | size_t i; | |
56 | char *result; | |
57 | ||
58 | align &= 7; | |
59 | if (align + len >= page_size) | |
60 | return; | |
61 | ||
62 | for (i = 0; i < len; ++i) | |
63 | { | |
64 | buf1[align + i] = 1 + 23 * i % 127; | |
65 | if (buf1[align + i] == seek_char) | |
66 | buf1[align + i] = seek_char + 1; | |
67 | } | |
68 | buf1[align + len] = 0; | |
69 | ||
70 | if (pos < len) | |
71 | { | |
72 | buf1[align + pos] = seek_char; | |
73 | buf1[align + len] = -seek_char; | |
74 | result = (char *) (buf1 + align + pos); | |
75 | } | |
76 | else | |
77 | { | |
78 | result = NULL; | |
79 | buf1[align + len] = seek_char; | |
80 | } | |
81 | ||
82 | FOR_EACH_IMPL (impl, 0) | |
83 | do_one_test (impl, (char *) (buf1 + align), seek_char, len, result); | |
84 | } | |
85 | ||
86 | static void | |
87 | do_random_tests (void) | |
88 | { | |
89 | size_t i, j, n, align, pos, len; | |
90 | int seek_char; | |
91 | char *result; | |
92 | unsigned char *p = buf1 + page_size - 512; | |
93 | ||
94 | for (n = 0; n < ITERATIONS; n++) | |
95 | { | |
96 | align = random () & 15; | |
97 | pos = random () & 511; | |
98 | if (pos + align >= 512) | |
99 | pos = 511 - align - (random () & 7); | |
100 | len = random () & 511; | |
101 | if (pos >= len) | |
102 | len = pos + (random () & 7); | |
103 | if (len + align >= 512) | |
104 | len = 512 - align - (random () & 7); | |
105 | seek_char = random () & 255; | |
106 | j = len + align + 64; | |
107 | if (j > 512) | |
108 | j = 512; | |
109 | ||
110 | for (i = 0; i < j; i++) | |
111 | { | |
112 | if (i == pos + align) | |
113 | p[i] = seek_char; | |
114 | else | |
115 | { | |
116 | p[i] = random () & 255; | |
117 | if (p[i] == seek_char) | |
118 | p[i] = seek_char + 13; | |
119 | } | |
120 | } | |
121 | ||
122 | if (pos < len) | |
123 | result = (char *) (p + pos + align); | |
124 | else | |
125 | result = NULL; | |
126 | ||
127 | FOR_EACH_IMPL (impl, 1) | |
128 | if (CALL (impl, (char *) (p + align), seek_char, len) != result) | |
129 | { | |
130 | error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p", | |
131 | n, impl->name, align, seek_char, len, pos, | |
132 | CALL (impl, (char *) (p + align), seek_char, len), | |
133 | result, p); | |
134 | ret = 1; | |
135 | } | |
136 | } | |
137 | } | |
138 | ||
139 | int | |
140 | test_main (void) | |
141 | { | |
142 | size_t i; | |
143 | ||
144 | test_init (); | |
145 | ||
146 | printf ("%20s", ""); | |
147 | FOR_EACH_IMPL (impl, 0) | |
148 | printf ("\t%s", impl->name); | |
149 | putchar ('\n'); | |
150 | ||
151 | for (i = 1; i < 8; ++i) | |
152 | { | |
4615f5ae L |
153 | /* Test len == 0. */ |
154 | do_test (i, i, 0, 0); | |
155 | do_test (i, i, 0, 23); | |
156 | ||
4660856c AZ |
157 | do_test (0, 16 << i, 2048, 23); |
158 | do_test (i, 64, 256, 23); | |
159 | do_test (0, 16 << i, 2048, 0); | |
160 | do_test (i, 64, 256, 0); | |
4615f5ae L |
161 | |
162 | do_test (0, i, 256, 23); | |
163 | do_test (0, i, 256, 0); | |
164 | do_test (i, i, 256, 23); | |
165 | do_test (i, i, 256, 0); | |
166 | ||
4660856c AZ |
167 | } |
168 | for (i = 1; i < 32; ++i) | |
169 | { | |
170 | do_test (0, i, i + 1, 23); | |
171 | do_test (0, i, i + 1, 0); | |
4615f5ae L |
172 | do_test (i, i, i + 1, 23); |
173 | do_test (i, i, i + 1, 0); | |
174 | ||
175 | do_test (0, 1, i + 1, 23); | |
176 | do_test (0, 2, i + 1, 0); | |
177 | do_test (i, 1, i + 1, 23); | |
178 | do_test (i, 2, i + 1, 0); | |
4660856c AZ |
179 | } |
180 | ||
181 | do_random_tests (); | |
182 | return ret; | |
183 | } | |
184 | ||
fb82116f | 185 | #include <support/test-driver.c> |