]> git.ipfire.org Git - thirdparty/glibc.git/blob - string/test-strstr.c
06dea30ff153134f3a21f7d363f0dc16d850b76f
[thirdparty/glibc.git] / string / test-strstr.c
1 /* Test and measure strstr functions.
2 Copyright (C) 2010-2020 Free Software Foundation, Inc.
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
17 License along with the GNU C Library; if not, see
18 <https://www.gnu.org/licenses/>. */
19
20 #define TEST_MAIN
21 #define TEST_NAME "strstr"
22 #include "test-string.h"
23
24
25 #define STRSTR simple_strstr
26 #define libc_hidden_builtin_def(arg) /* nothing */
27 #define __strnlen strnlen
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
61 static int
62 check_result (impl_t *impl, const char *s1, const char *s2,
63 char *exp_result)
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,
69 (result == NULL) ? "(null)" : result,
70 (exp_result == NULL) ? "(null)" : exp_result);
71 ret = 1;
72 return -1;
73 }
74
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;
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
121 FOR_EACH_IMPL (impl, 0)
122 do_one_test (impl, s1, s2, fail ? NULL : s1 + len1 - len2);
123
124 }
125
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 }
138
139 static void
140 check2 (void)
141 {
142 const char s1_stack[] = ", enable_static, \0, enable_shared, ";
143 const size_t s1_byte_count = 18;
144 const char *s2_stack = &(s1_stack[s1_byte_count]);
145 const size_t s2_byte_count = 18;
146 char *exp_result;
147 const size_t page_size_real = getpagesize ();
148
149 /* Haystack at end of page. The following page is protected. */
150 char *s1_page_end = (void *) buf1 + page_size - s1_byte_count;
151 strcpy (s1_page_end, s1_stack);
152
153 /* Haystack which crosses a page boundary.
154 Note: page_size is at least 2 * getpagesize. See test_init. */
155 char *s1_page_cross = (void *) buf1 + page_size_real - 8;
156 strcpy (s1_page_cross, s1_stack);
157
158 /* Needle at end of page. The following page is protected. */
159 char *s2_page_end = (void *) buf2 + page_size - s2_byte_count;
160 strcpy (s2_page_end, s2_stack);
161
162 /* Needle which crosses a page boundary.
163 Note: page_size is at least 2 * getpagesize. See test_init. */
164 char *s2_page_cross = (void *) buf2 + page_size_real - 8;
165 strcpy (s2_page_cross, s2_stack);
166
167 exp_result = stupid_strstr (s1_stack, s2_stack);
168 FOR_EACH_IMPL (impl, 0)
169 {
170 check_result (impl, s1_stack, s2_stack, exp_result);
171 check_result (impl, s1_stack, s2_page_end, exp_result);
172 check_result (impl, s1_stack, s2_page_cross, exp_result);
173
174 check_result (impl, s1_page_end, s2_stack, exp_result);
175 check_result (impl, s1_page_end, s2_page_end, exp_result);
176 check_result (impl, s1_page_end, s2_page_cross, exp_result);
177
178 check_result (impl, s1_page_cross, s2_stack, exp_result);
179 check_result (impl, s1_page_cross, s2_page_end, exp_result);
180 check_result (impl, s1_page_cross, s2_page_cross, exp_result);
181 }
182 }
183
184 #define N 1024
185
186 static void
187 pr23637 (void)
188 {
189 char *h = (char*) buf1;
190 char *n = (char*) buf2;
191
192 for (int i = 0; i < N; i++)
193 {
194 n[i] = 'x';
195 h[i] = ' ';
196 h[i + N] = 'x';
197 }
198
199 n[N] = '\0';
200 h[N * 2] = '\0';
201
202 /* Ensure we don't match at the first 'x'. */
203 h[0] = 'x';
204
205 char *exp_result = stupid_strstr (h, n);
206 FOR_EACH_IMPL (impl, 0)
207 check_result (impl, h, n, exp_result);
208 }
209
210 static int
211 test_main (void)
212 {
213 test_init ();
214
215 check1 ();
216 check2 ();
217 pr23637 ();
218
219 printf ("%23s", "");
220 FOR_EACH_IMPL (impl, 0)
221 printf ("\t%s", impl->name);
222 putchar ('\n');
223
224 for (size_t klen = 2; klen < 32; ++klen)
225 for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen)
226 {
227 do_test (0, 0, hlen, klen, 0);
228 do_test (0, 0, hlen, klen, 1);
229 do_test (0, 3, hlen, klen, 0);
230 do_test (0, 3, hlen, klen, 1);
231 do_test (0, 9, hlen, klen, 0);
232 do_test (0, 9, hlen, klen, 1);
233 do_test (0, 15, hlen, klen, 0);
234 do_test (0, 15, hlen, klen, 1);
235
236 do_test (3, 0, hlen, klen, 0);
237 do_test (3, 0, hlen, klen, 1);
238 do_test (3, 3, hlen, klen, 0);
239 do_test (3, 3, hlen, klen, 1);
240 do_test (3, 9, hlen, klen, 0);
241 do_test (3, 9, hlen, klen, 1);
242 do_test (3, 15, hlen, klen, 0);
243 do_test (3, 15, hlen, klen, 1);
244
245 do_test (9, 0, hlen, klen, 0);
246 do_test (9, 0, hlen, klen, 1);
247 do_test (9, 3, hlen, klen, 0);
248 do_test (9, 3, hlen, klen, 1);
249 do_test (9, 9, hlen, klen, 0);
250 do_test (9, 9, hlen, klen, 1);
251 do_test (9, 15, hlen, klen, 0);
252 do_test (9, 15, hlen, klen, 1);
253
254 do_test (15, 0, hlen, klen, 0);
255 do_test (15, 0, hlen, klen, 1);
256 do_test (15, 3, hlen, klen, 0);
257 do_test (15, 3, hlen, klen, 1);
258 do_test (15, 9, hlen, klen, 0);
259 do_test (15, 9, hlen, klen, 1);
260 do_test (15, 15, hlen, klen, 0);
261 do_test (15, 15, hlen, klen, 1);
262
263 do_test (15, 15, hlen + klen * 4, klen * 4, 0);
264 do_test (15, 15, hlen + klen * 4, klen * 4, 1);
265 }
266
267 do_test (0, 0, page_size - 1, 16, 0);
268 do_test (0, 0, page_size - 1, 16, 1);
269
270 return ret;
271 }
272
273 #include <support/test-driver.c>