1 | /* Test and measure strcat functions.
|
---|
2 | Copyright (C) 1999, 2002, 2003 Free Software Foundation, Inc.
|
---|
3 | This file is part of the GNU C Library.
|
---|
4 | Written by Jakub Jelinek <jakub@redhat.com>, 1999.
|
---|
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, write to the Free
|
---|
18 | Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
---|
19 | 02111-1307 USA. */
|
---|
20 |
|
---|
21 | #define TEST_MAIN
|
---|
22 | #include "test-string.h"
|
---|
23 |
|
---|
24 | typedef char *(*proto_t) (char *, const char *);
|
---|
25 | char *simple_strcat (char *, const char *);
|
---|
26 |
|
---|
27 | IMPL (simple_strcat, 0)
|
---|
28 | IMPL (strcat, 1)
|
---|
29 |
|
---|
30 | char *
|
---|
31 | simple_strcat (char *dst, const char *src)
|
---|
32 | {
|
---|
33 | char *ret = dst;
|
---|
34 | while (*dst++ != '\0');
|
---|
35 | --dst;
|
---|
36 | while ((*dst++ = *src++) != '\0');
|
---|
37 | return ret;
|
---|
38 | }
|
---|
39 |
|
---|
40 | static void
|
---|
41 | do_one_test (impl_t *impl, char *dst, const char *src)
|
---|
42 | {
|
---|
43 | size_t k = strlen (dst);
|
---|
44 | if (CALL (impl, dst, src) != dst)
|
---|
45 | {
|
---|
46 | error (0, 0, "Wrong result in function %s %p %p", impl->name,
|
---|
47 | CALL (impl, dst, src), dst);
|
---|
48 | ret = 1;
|
---|
49 | return;
|
---|
50 | }
|
---|
51 |
|
---|
52 | if (strcmp (dst + k, src) != 0)
|
---|
53 | {
|
---|
54 | error (0, 0, "Wrong result in function %s dst \"%s\" src \"%s\"",
|
---|
55 | impl->name, dst, src);
|
---|
56 | ret = 1;
|
---|
57 | return;
|
---|
58 | }
|
---|
59 |
|
---|
60 | if (HP_TIMING_AVAIL)
|
---|
61 | {
|
---|
62 | hp_timing_t start __attribute ((unused));
|
---|
63 | hp_timing_t stop __attribute ((unused));
|
---|
64 | hp_timing_t best_time = ~ (hp_timing_t) 0;
|
---|
65 | size_t i;
|
---|
66 |
|
---|
67 | for (i = 0; i < 32; ++i)
|
---|
68 | {
|
---|
69 | dst[k] = '\0';
|
---|
70 | HP_TIMING_NOW (start);
|
---|
71 | CALL (impl, dst, src);
|
---|
72 | HP_TIMING_NOW (stop);
|
---|
73 | HP_TIMING_BEST (best_time, start, stop);
|
---|
74 | }
|
---|
75 |
|
---|
76 | printf ("\t%zd", (size_t) best_time);
|
---|
77 | }
|
---|
78 | }
|
---|
79 |
|
---|
80 | static void
|
---|
81 | do_test (size_t align1, size_t align2, size_t len1, size_t len2, int max_char)
|
---|
82 | {
|
---|
83 | size_t i;
|
---|
84 | char *s1, *s2;
|
---|
85 |
|
---|
86 | align1 &= 7;
|
---|
87 | if (align1 + len1 >= page_size)
|
---|
88 | return;
|
---|
89 |
|
---|
90 | align2 &= 7;
|
---|
91 | if (align2 + len1 + len2 >= page_size)
|
---|
92 | return;
|
---|
93 |
|
---|
94 | s1 = buf1 + align1;
|
---|
95 | s2 = buf2 + align2;
|
---|
96 |
|
---|
97 | for (i = 0; i < len1; ++i)
|
---|
98 | s1[i] = 32 + 23 * i % (max_char - 32);
|
---|
99 | s1[len1] = '\0';
|
---|
100 |
|
---|
101 | for (i = 0; i < len2; i++)
|
---|
102 | s2[i] = 32 + 23 * i % (max_char - 32);
|
---|
103 |
|
---|
104 | if (HP_TIMING_AVAIL)
|
---|
105 | printf ("Length %4zd/%4zd, alignment %2zd/%2zd:", len1, len2, align1, align2);
|
---|
106 |
|
---|
107 | FOR_EACH_IMPL (impl, 0)
|
---|
108 | {
|
---|
109 | s2[len2] = '\0';
|
---|
110 | do_one_test (impl, s2, s1);
|
---|
111 | }
|
---|
112 |
|
---|
113 | if (HP_TIMING_AVAIL)
|
---|
114 | putchar ('\n');
|
---|
115 | }
|
---|
116 |
|
---|
117 | static void
|
---|
118 | do_random_tests (void)
|
---|
119 | {
|
---|
120 | size_t i, j, n, align1, align2, len1, len2;
|
---|
121 | unsigned char *p1 = buf1 + page_size - 512;
|
---|
122 | unsigned char *p2 = buf2 + page_size - 512;
|
---|
123 | unsigned char *res;
|
---|
124 |
|
---|
125 | for (n = 0; n < ITERATIONS; n++)
|
---|
126 | {
|
---|
127 | align1 = random () & 31;
|
---|
128 | if (random () & 1)
|
---|
129 | align2 = random () & 31;
|
---|
130 | else
|
---|
131 | align2 = align1 + (random () & 24);
|
---|
132 | len1 = random () & 511;
|
---|
133 | if (len1 + align2 > 512)
|
---|
134 | len2 = random () & 7;
|
---|
135 | else
|
---|
136 | len2 = (512 - len1 - align2) * (random () & (1024 * 1024 - 1))
|
---|
137 | / (1024 * 1024);
|
---|
138 | j = align1;
|
---|
139 | if (align2 + len2 > j)
|
---|
140 | j = align2 + len2;
|
---|
141 | if (len1 + j >= 511)
|
---|
142 | len1 = 510 - j - (random () & 7);
|
---|
143 | if (len1 >= 512)
|
---|
144 | len1 = 0;
|
---|
145 | if (align1 + len1 < 512 - 8)
|
---|
146 | {
|
---|
147 | j = 510 - align1 - len1 - (random () & 31);
|
---|
148 | if (j > 0 && j < 512)
|
---|
149 | align1 += j;
|
---|
150 | }
|
---|
151 | j = len1 + align1 + 64;
|
---|
152 | if (j > 512)
|
---|
153 | j = 512;
|
---|
154 | for (i = 0; i < j; i++)
|
---|
155 | {
|
---|
156 | if (i == len1 + align1)
|
---|
157 | p1[i] = 0;
|
---|
158 | else
|
---|
159 | {
|
---|
160 | p1[i] = random () & 255;
|
---|
161 | if (i >= align1 && i < len1 + align1 && !p1[i])
|
---|
162 | p1[i] = (random () & 127) + 3;
|
---|
163 | }
|
---|
164 | }
|
---|
165 | for (i = 0; i < len2; i++)
|
---|
166 | {
|
---|
167 | buf1[i] = random () & 255;
|
---|
168 | if (!buf1[i])
|
---|
169 | buf1[i] = (random () & 127) + 3;
|
---|
170 | }
|
---|
171 | buf1[len2] = 0;
|
---|
172 |
|
---|
173 | FOR_EACH_IMPL (impl, 1)
|
---|
174 | {
|
---|
175 | memset (p2 - 64, '\1', align2 + 64);
|
---|
176 | memset (p2 + align2 + len2 + 1, '\1', 512 - align2 - len2 - 1);
|
---|
177 | memcpy (p2 + align2, buf1, len2 + 1);
|
---|
178 | res = CALL (impl, p2 + align2, p1 + align1);
|
---|
179 | if (res != p2 + align2)
|
---|
180 | {
|
---|
181 | error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd %zd) %p != %p",
|
---|
182 | n, impl->name, align1, align2, len1, len2, res,
|
---|
183 | p2 + align2);
|
---|
184 | ret = 1;
|
---|
185 | }
|
---|
186 | for (j = 0; j < align2 + 64; ++j)
|
---|
187 | {
|
---|
188 | if (p2[j - 64] != '\1')
|
---|
189 | {
|
---|
190 | error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd, %zd)",
|
---|
191 | n, impl->name, align1, align2, len1, len2);
|
---|
192 | ret = 1;
|
---|
193 | break;
|
---|
194 | }
|
---|
195 | }
|
---|
196 | if (memcmp (p2 + align2, buf1, len2))
|
---|
197 | {
|
---|
198 | error (0, 0, "Iteration %zd - garbage in string before, %s (%zd, %zd, %zd, %zd)",
|
---|
199 | n, impl->name, align1, align2, len1, len2);
|
---|
200 | ret = 1;
|
---|
201 | }
|
---|
202 | for (j = align2 + len1 + len2 + 1; j < 512; ++j)
|
---|
203 | {
|
---|
204 | if (p2[j] != '\1')
|
---|
205 | {
|
---|
206 | error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd, %zd)",
|
---|
207 | n, impl->name, align1, align2, len1, len2);
|
---|
208 | ret = 1;
|
---|
209 | break;
|
---|
210 | }
|
---|
211 | }
|
---|
212 | if (memcmp (p1 + align1, p2 + align2 + len2, len1 + 1))
|
---|
213 | {
|
---|
214 | error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd, %zd)",
|
---|
215 | n, impl->name, align1, align2, len1, len2);
|
---|
216 | ret = 1;
|
---|
217 | }
|
---|
218 | }
|
---|
219 | }
|
---|
220 | }
|
---|
221 |
|
---|
222 | int
|
---|
223 | test_main (void)
|
---|
224 | {
|
---|
225 | size_t i;
|
---|
226 |
|
---|
227 | test_init ();
|
---|
228 |
|
---|
229 | printf ("%28s", "");
|
---|
230 | FOR_EACH_IMPL (impl, 0)
|
---|
231 | printf ("\t%s", impl->name);
|
---|
232 | putchar ('\n');
|
---|
233 |
|
---|
234 | for (i = 0; i < 16; ++i)
|
---|
235 | {
|
---|
236 | do_test (0, 0, i, i, 127);
|
---|
237 | do_test (0, 0, i, i, 255);
|
---|
238 | do_test (0, i, i, i, 127);
|
---|
239 | do_test (i, 0, i, i, 255);
|
---|
240 | }
|
---|
241 |
|
---|
242 | for (i = 1; i < 8; ++i)
|
---|
243 | {
|
---|
244 | do_test (0, 0, 8 << i, 8 << i, 127);
|
---|
245 | do_test (8 - i, 2 * i, 8 << i, 8 << i, 127);
|
---|
246 | do_test (0, 0, 8 << i, 2 << i, 127);
|
---|
247 | do_test (8 - i, 2 * i, 8 << i, 2 << i, 127);
|
---|
248 | }
|
---|
249 |
|
---|
250 | for (i = 1; i < 8; ++i)
|
---|
251 | {
|
---|
252 | do_test (i, 2 * i, 8 << i, 1, 127);
|
---|
253 | do_test (2 * i, i, 8 << i, 1, 255);
|
---|
254 | do_test (i, i, 8 << i, 10, 127);
|
---|
255 | do_test (i, i, 8 << i, 10, 255);
|
---|
256 | }
|
---|
257 |
|
---|
258 | do_random_tests ();
|
---|
259 | return ret;
|
---|
260 | }
|
---|
261 |
|
---|
262 | #include "../test-skeleton.c"
|
---|