1 /* Test and measure strcmp and wcscmp functions.
2 Copyright (C) 1999, 2002, 2003, 2005, 2011 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Written by Jakub Jelinek <jakub@redhat.com>, 1999.
5 Added wcscmp support by Liubov Dmitrieva <liubov.dmitrieva@gmail.com>, 2011.
7 The GNU C Library is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 The GNU C Library is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with the GNU C Library; if not, write to the Free
19 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
23 #include "test-string.h"
28 # define L(str) L##str
29 # define STRCMP wcscmp
30 # define STRCPY wcscpy
31 # define STRLEN wcslen
32 # define MEMCPY wmemcpy
33 # define SIMPLE_STRCMP simple_wcscmp
34 # define STUPID_STRCMP stupid_wcscmp
36 # define UCHAR wchar_t
38 # define CHARBYTESLOG 2
39 # define CHARALIGN __alignof__ (CHAR)
40 # define MIDCHAR 0x7fffffff
41 # define LARGECHAR 0xfffffffe
42 # define CHAR__MAX WCHAR_MAX
43 # define CHAR__MIN WCHAR_MIN
45 /* Wcscmp uses signed semantics for comparison, not unsigned */
46 /* Avoid using substraction since possible overflow */
49 simple_wcscmp (const wchar_t *s1, const wchar_t *s2)
61 return c1 < c2 ? -1 : 1;
65 stupid_wcscmp (const wchar_t *s1, const wchar_t *s2)
67 size_t ns1 = wcslen (s1) + 1;
68 size_t ns2 = wcslen (s2) + 1;
69 size_t n = ns1 < ns2 ? ns1 : ns2;
77 if ((ret = c1 < c2 ? -1 : c1 == c2 ? 0 : 1) != 0)
85 # define STRCMP strcmp
86 # define STRCPY strcpy
87 # define STRLEN strlen
88 # define MEMCPY memcpy
89 # define SIMPLE_STRCMP simple_strcmp
90 # define STUPID_STRCMP stupid_strcmp
92 # define UCHAR unsigned char
94 # define CHARBYTESLOG 0
97 # define LARGECHAR 0xfe
98 # define CHAR__MAX CHAR_MAX
99 # define CHAR__MIN CHAR_MIN
101 /* Strcmp uses unsigned semantics for comparison. */
103 simple_strcmp (const char *s1, const char *s2)
107 while ((ret = *(unsigned char *) s1 - *(unsigned char*) s2++) == 0 && *s1++);
112 stupid_strcmp (const char *s1, const char *s2)
114 size_t ns1 = strlen (s1) + 1;
115 size_t ns2 = strlen (s2) + 1;
116 size_t n = ns1 < ns2 ? ns1 : ns2;
120 if ((ret = *(unsigned char *) s1++ - *(unsigned char *) s2++) != 0)
126 typedef int (*proto_t) (const CHAR *, const CHAR *);
128 IMPL (STUPID_STRCMP, 1)
129 IMPL (SIMPLE_STRCMP, 1)
133 check_result (impl_t *impl,
134 const CHAR *s1, const CHAR *s2,
137 int result = CALL (impl, s1, s2);
138 if ((exp_result == 0 && result != 0)
139 || (exp_result < 0 && result >= 0)
140 || (exp_result > 0 && result <= 0))
142 error (0, 0, "Wrong result in function %s %d %d", impl->name,
152 do_one_test (impl_t *impl,
153 const CHAR *s1, const CHAR *s2,
156 if (check_result (impl, s1, s2, exp_result) < 0)
161 hp_timing_t start __attribute ((unused));
162 hp_timing_t stop __attribute ((unused));
163 hp_timing_t best_time = ~ (hp_timing_t) 0;
166 for (i = 0; i < 32; ++i)
168 HP_TIMING_NOW (start);
170 HP_TIMING_NOW (stop);
171 HP_TIMING_BEST (best_time, start, stop);
174 printf ("\t%zd", (size_t) best_time);
179 do_test (size_t align1, size_t align2, size_t len, int max_char,
190 if (align1 + (len + 1) * CHARBYTES >= page_size)
194 if (align2 + (len + 1) * CHARBYTES >= page_size)
197 /* Put them close to the end of page. */
198 i = align1 + CHARBYTES * (len + 2);
199 s1 = (CHAR *) (buf1 + ((page_size - i) / 16 * 16) + align1);
200 i = align2 + CHARBYTES * (len + 2);
201 s2 = (CHAR *) (buf2 + ((page_size - i) / 16 * 16) + align2);
203 for (i = 0; i < len; i++)
204 s1[i] = s2[i] = 1 + (23 << ((CHARBYTES - 1) * 8)) * i % max_char;
206 s1[len] = s2[len] = 0;
208 s2[len + 1] = 24 + exp_result;
209 s2[len - 1] -= exp_result;
212 printf ("Length %4zd, alignment %2zd/%2zd:", len, align1, align2);
214 FOR_EACH_IMPL (impl, 0)
215 do_one_test (impl, s1, s2, exp_result);
222 do_random_tests (void)
224 for (size_t a = 0; a < CHARBYTES; a += CHARALIGN)
225 for (size_t b = 0; b < CHARBYTES; b += CHARALIGN)
227 UCHAR *p1 = (UCHAR *) (buf1 + page_size - 512 * CHARBYTES - a);
228 UCHAR *p2 = (UCHAR *) (buf2 + page_size - 512 * CHARBYTES - b);
230 for (size_t n = 0; n < ITERATIONS; n++)
232 size_t align1 = random () & 31;
235 align2 = random () & 31;
237 align2 = align1 + (random () & 24);
238 size_t pos = random () & 511;
239 size_t j = align1 > align2 ? align1 : align2;
241 pos = 510 - j - (random () & 7);
242 size_t len1 = random () & 511;
243 if (pos >= len1 && (random () & 1))
244 len1 = pos + (random () & 7);
246 len1 = 511 - j - (random () & 7);
251 len2 = len1 + (len1 != 511 - j ? random () % (511 - j - len1) : 0);
252 j = (pos > len2 ? pos : len2) + align1 + 64;
255 for (size_t i = 0; i < j; ++i)
257 p1[i] = random () & 255;
258 if (i < len1 + align1 && !p1[i])
260 p1[i] = random () & 255;
262 p1[i] = 1 + (random () & 127);
265 for (size_t i = 0; i < j; ++i)
267 p2[i] = random () & 255;
268 if (i < len2 + align2 && !p2[i])
270 p2[i] = random () & 255;
272 p2[i] = 1 + (random () & 127);
277 MEMCPY ((CHAR *) (p2 + align2), (CHAR *) (p1 + align1), pos);
280 if (p2[align2 + pos] == p1[align1 + pos])
282 p2[align2 + pos] = random () & 255;
283 if (p2[align2 + pos] == p1[align1 + pos])
284 p2[align2 + pos] = p1[align1 + pos] + 3 + (random () & 127);
287 if (p1[align1 + pos] < p2[align2 + pos])
292 p1[len1 + align1] = 0;
293 p2[len2 + align2] = 0;
295 FOR_EACH_IMPL (impl, 1)
297 int r = CALL (impl, (CHAR *) (p1 + align1), (CHAR *) (p2 + align2));
298 /* Test whether on 64-bit architectures where ABI requires
299 callee to promote has the promotion been done. */
300 asm ("" : "=g" (r) : "0" (r));
301 if ((r == 0 && result)
302 || (r < 0 && result >= 0)
303 || (r > 0 && result <= 0))
305 error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %zd) %d != %d, p1 %p p2 %p",
306 n, impl->name, (size_t) (p1 + align1) & 63, (size_t) (p1 + align2) & 63, len1, len2, pos, r, result, p1, p2);
317 CHAR *s1 = (CHAR *) (buf1 + 0xb2c);
318 CHAR *s2 = (CHAR *) (buf1 + 0xfd8);
320 STRCPY(s1, L("abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrs"));
321 STRCPY(s2, L("abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijkLMNOPQRSTUV"));
323 /* Check correct working for negatives values */
334 /* Check possible overflow bug, actual more for wcscmp */
339 size_t l1 = STRLEN (s1);
340 size_t l2 = STRLEN (s2);
342 for (size_t i1 = 0; i1 < l1; i1++)
343 for (size_t i2 = 0; i2 < l2; i2++)
345 int exp_result = SIMPLE_STRCMP (s1 + i1, s2 + i2);
346 FOR_EACH_IMPL (impl, 0)
347 check_result (impl, s1 + i1, s2 + i2, exp_result);
361 FOR_EACH_IMPL (impl, 0)
362 printf ("\t%s", impl->name);
365 for (i = 1; i < 32; ++i)
367 do_test (CHARBYTES * i, CHARBYTES * i, i, MIDCHAR, 0);
368 do_test (CHARBYTES * i, CHARBYTES * i, i, MIDCHAR, 1);
369 do_test (CHARBYTES * i, CHARBYTES * i, i, MIDCHAR, -1);
372 for (i = 1; i < 10 + CHARBYTESLOG; ++i)
374 do_test (0, 0, 2 << i, MIDCHAR, 0);
375 do_test (0, 0, 2 << i, LARGECHAR, 0);
376 do_test (0, 0, 2 << i, MIDCHAR, 1);
377 do_test (0, 0, 2 << i, LARGECHAR, 1);
378 do_test (0, 0, 2 << i, MIDCHAR, -1);
379 do_test (0, 0, 2 << i, LARGECHAR, -1);
380 do_test (0, CHARBYTES * i, 2 << i, MIDCHAR, 1);
381 do_test (CHARBYTES * i, CHARBYTES * (i + 1), 2 << i, LARGECHAR, 1);
384 for (i = 1; i < 8; ++i)
386 do_test (CHARBYTES * i, 2 * CHARBYTES * i, 8 << i, MIDCHAR, 0);
387 do_test (2 * CHARBYTES * i, CHARBYTES * i, 8 << i, LARGECHAR, 0);
388 do_test (CHARBYTES * i, 2 * CHARBYTES * i, 8 << i, MIDCHAR, 1);
389 do_test (2 * CHARBYTES * i, CHARBYTES * i, 8 << i, LARGECHAR, 1);
390 do_test (CHARBYTES * i, 2 * CHARBYTES * i, 8 << i, MIDCHAR, -1);
391 do_test (2 * CHARBYTES * i, CHARBYTES * i, 8 << i, LARGECHAR, -1);
398 #include "../test-skeleton.c"