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