]>
Commit | Line | Data |
---|---|---|
dbc676d4 | 1 | /* Test and measure strstr functions. |
04277e02 | 2 | Copyright (C) 2010-2019 Free Software Foundation, Inc. |
dbc676d4 UD |
3 | This file is part of the GNU C Library. |
4 | Written by Ulrich Drepper <drepper@redhat.com>, 2010. | |
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 | |
59ba27a6 | 17 | License along with the GNU C Library; if not, see |
5a82c748 | 18 | <https://www.gnu.org/licenses/>. */ |
dbc676d4 UD |
19 | |
20 | #define TEST_MAIN | |
69f07e5f | 21 | #define TEST_NAME "strstr" |
dbc676d4 UD |
22 | #include "test-string.h" |
23 | ||
24 | ||
25 | #define STRSTR simple_strstr | |
7c3018f9 | 26 | #define libc_hidden_builtin_def(arg) /* nothing */ |
3ae725df | 27 | #define __strnlen strnlen |
dbc676d4 UD |
28 | #include "strstr.c" |
29 | ||
30 | ||
31 | static char * | |
32 | stupid_strstr (const char *s1, const char *s2) | |
33 | { | |
34 | ssize_t s1len = strlen (s1); | |
35 | ssize_t s2len = strlen (s2); | |
36 | ||
37 | if (s2len > s1len) | |
38 | return NULL; | |
39 | ||
40 | for (ssize_t i = 0; i <= s1len - s2len; ++i) | |
41 | { | |
42 | size_t j; | |
43 | for (j = 0; j < s2len; ++j) | |
44 | if (s1[i + j] != s2[j]) | |
45 | break; | |
46 | if (j == s2len) | |
47 | return (char *) s1 + i; | |
48 | } | |
49 | ||
50 | return NULL; | |
51 | } | |
52 | ||
53 | ||
54 | typedef char *(*proto_t) (const char *, const char *); | |
55 | ||
56 | IMPL (stupid_strstr, 0) | |
57 | IMPL (simple_strstr, 0) | |
58 | IMPL (strstr, 1) | |
59 | ||
60 | ||
03759f47 L |
61 | static int |
62 | check_result (impl_t *impl, const char *s1, const char *s2, | |
63 | char *exp_result) | |
dbc676d4 UD |
64 | { |
65 | char *result = CALL (impl, s1, s2); | |
66 | if (result != exp_result) | |
67 | { | |
68 | error (0, 0, "Wrong result in function %s %s %s", impl->name, | |
f0c5a803 SL |
69 | (result == NULL) ? "(null)" : result, |
70 | (exp_result == NULL) ? "(null)" : exp_result); | |
dbc676d4 | 71 | ret = 1; |
03759f47 | 72 | return -1; |
dbc676d4 UD |
73 | } |
74 | ||
03759f47 L |
75 | return 0; |
76 | } | |
77 | ||
78 | static void | |
79 | do_one_test (impl_t *impl, const char *s1, const char *s2, char *exp_result) | |
80 | { | |
81 | if (check_result (impl, s1, s2, exp_result) < 0) | |
82 | return; | |
dbc676d4 UD |
83 | } |
84 | ||
85 | ||
86 | static void | |
87 | do_test (size_t align1, size_t align2, size_t len1, size_t len2, | |
88 | int fail) | |
89 | { | |
90 | char *s1 = (char *) (buf1 + align1); | |
91 | char *s2 = (char *) (buf2 + align2); | |
92 | ||
93 | static const char d[] = "1234567890abcdef"; | |
94 | #define dl (sizeof (d) - 1) | |
95 | char *ss2 = s2; | |
96 | for (size_t l = len2; l > 0; l = l > dl ? l - dl : 0) | |
97 | { | |
98 | size_t t = l > dl ? dl : l; | |
99 | ss2 = mempcpy (ss2, d, t); | |
100 | } | |
101 | s2[len2] = '\0'; | |
102 | ||
103 | if (fail) | |
104 | { | |
105 | char *ss1 = s1; | |
106 | for (size_t l = len1; l > 0; l = l > dl ? l - dl : 0) | |
107 | { | |
108 | size_t t = l > dl ? dl : l; | |
109 | memcpy (ss1, d, t); | |
110 | ++ss1[len2 > 7 ? 7 : len2 - 1]; | |
111 | ss1 += t; | |
112 | } | |
113 | } | |
114 | else | |
115 | { | |
116 | memset (s1, '0', len1); | |
117 | memcpy (s1 + len1 - len2, s2, len2); | |
118 | } | |
119 | s1[len1] = '\0'; | |
120 | ||
dbc676d4 UD |
121 | FOR_EACH_IMPL (impl, 0) |
122 | do_one_test (impl, s1, s2, fail ? NULL : s1 + len1 - len2); | |
123 | ||
dbc676d4 UD |
124 | } |
125 | ||
03759f47 L |
126 | static void |
127 | check1 (void) | |
128 | { | |
129 | const char s1[] = | |
130 | "F_BD_CE_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_C3_88_20_EF_BF_BD_EF_BF_BD_EF_BF_BD_C3_A7_20_EF_BF_BD"; | |
131 | const char s2[] = "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD"; | |
132 | char *exp_result; | |
133 | ||
134 | exp_result = stupid_strstr (s1, s2); | |
135 | FOR_EACH_IMPL (impl, 0) | |
136 | check_result (impl, s1, s2, exp_result); | |
137 | } | |
dbc676d4 | 138 | |
d7e0dab9 L |
139 | static void |
140 | check2 (void) | |
141 | { | |
142 | const char s1[] = ", enable_static, \0, enable_shared, "; | |
143 | char *exp_result; | |
5d41d91a | 144 | char *s2 = (void *) buf1 + page_size - 18; |
d7e0dab9 | 145 | |
5d41d91a | 146 | strcpy (s2, s1); |
d7e0dab9 L |
147 | exp_result = stupid_strstr (s1, s1 + 18); |
148 | FOR_EACH_IMPL (impl, 0) | |
5d41d91a L |
149 | { |
150 | check_result (impl, s1, s1 + 18, exp_result); | |
151 | check_result (impl, s2, s1 + 18, exp_result); | |
152 | } | |
d7e0dab9 L |
153 | } |
154 | ||
83a552b0 WD |
155 | #define N 1024 |
156 | ||
157 | static void | |
158 | pr23637 (void) | |
159 | { | |
160 | char *h = (char*) buf1; | |
161 | char *n = (char*) buf2; | |
162 | ||
163 | for (int i = 0; i < N; i++) | |
164 | { | |
165 | n[i] = 'x'; | |
166 | h[i] = ' '; | |
167 | h[i + N] = 'x'; | |
168 | } | |
169 | ||
170 | n[N] = '\0'; | |
171 | h[N * 2] = '\0'; | |
172 | ||
173 | /* Ensure we don't match at the first 'x'. */ | |
174 | h[0] = 'x'; | |
175 | ||
176 | char *exp_result = stupid_strstr (h, n); | |
177 | FOR_EACH_IMPL (impl, 0) | |
178 | check_result (impl, h, n, exp_result); | |
179 | } | |
180 | ||
dbc676d4 UD |
181 | static int |
182 | test_main (void) | |
183 | { | |
184 | test_init (); | |
185 | ||
03759f47 | 186 | check1 (); |
d7e0dab9 | 187 | check2 (); |
83a552b0 | 188 | pr23637 (); |
03759f47 | 189 | |
dbc676d4 UD |
190 | printf ("%23s", ""); |
191 | FOR_EACH_IMPL (impl, 0) | |
192 | printf ("\t%s", impl->name); | |
193 | putchar ('\n'); | |
194 | ||
195 | for (size_t klen = 2; klen < 32; ++klen) | |
196 | for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen) | |
197 | { | |
198 | do_test (0, 0, hlen, klen, 0); | |
199 | do_test (0, 0, hlen, klen, 1); | |
200 | do_test (0, 3, hlen, klen, 0); | |
201 | do_test (0, 3, hlen, klen, 1); | |
202 | do_test (0, 9, hlen, klen, 0); | |
203 | do_test (0, 9, hlen, klen, 1); | |
204 | do_test (0, 15, hlen, klen, 0); | |
205 | do_test (0, 15, hlen, klen, 1); | |
206 | ||
207 | do_test (3, 0, hlen, klen, 0); | |
208 | do_test (3, 0, hlen, klen, 1); | |
209 | do_test (3, 3, hlen, klen, 0); | |
210 | do_test (3, 3, hlen, klen, 1); | |
211 | do_test (3, 9, hlen, klen, 0); | |
212 | do_test (3, 9, hlen, klen, 1); | |
213 | do_test (3, 15, hlen, klen, 0); | |
214 | do_test (3, 15, hlen, klen, 1); | |
215 | ||
216 | do_test (9, 0, hlen, klen, 0); | |
217 | do_test (9, 0, hlen, klen, 1); | |
218 | do_test (9, 3, hlen, klen, 0); | |
219 | do_test (9, 3, hlen, klen, 1); | |
220 | do_test (9, 9, hlen, klen, 0); | |
221 | do_test (9, 9, hlen, klen, 1); | |
222 | do_test (9, 15, hlen, klen, 0); | |
223 | do_test (9, 15, hlen, klen, 1); | |
224 | ||
225 | do_test (15, 0, hlen, klen, 0); | |
226 | do_test (15, 0, hlen, klen, 1); | |
227 | do_test (15, 3, hlen, klen, 0); | |
228 | do_test (15, 3, hlen, klen, 1); | |
229 | do_test (15, 9, hlen, klen, 0); | |
230 | do_test (15, 9, hlen, klen, 1); | |
231 | do_test (15, 15, hlen, klen, 0); | |
232 | do_test (15, 15, hlen, klen, 1); | |
83a552b0 WD |
233 | |
234 | do_test (15, 15, hlen + klen * 4, klen * 4, 0); | |
235 | do_test (15, 15, hlen + klen * 4, klen * 4, 1); | |
dbc676d4 UD |
236 | } |
237 | ||
238 | do_test (0, 0, page_size - 1, 16, 0); | |
239 | do_test (0, 0, page_size - 1, 16, 1); | |
240 | ||
241 | return ret; | |
242 | } | |
243 | ||
fb82116f | 244 | #include <support/test-driver.c> |