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