]>
Commit | Line | Data |
---|---|---|
97020474 | 1 | /* Measure strcasestr functions. |
688903eb | 2 | Copyright (C) 2013-2018 Free Software Foundation, Inc. |
97020474 SP |
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 | <http://www.gnu.org/licenses/>. */ | |
18 | ||
19 | #define TEST_MAIN | |
20 | #define TEST_NAME "strcasestr" | |
21 | #include "bench-string.h" | |
22 | ||
23 | ||
24 | #define STRCASESTR simple_strcasestr | |
25 | #define NO_ALIAS | |
26 | #define __strncasecmp strncasecmp | |
3ae725df | 27 | #define __strnlen strnlen |
97020474 SP |
28 | #include "../string/strcasestr.c" |
29 | ||
30 | ||
31 | static char * | |
32 | stupid_strcasestr (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 (tolower (s1[i + j]) != tolower (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_strcasestr, 0) | |
57 | IMPL (simple_strcasestr, 0) | |
58 | IMPL (strcasestr, 1) | |
59 | ||
60 | ||
61 | static void | |
62 | do_one_test (impl_t *impl, const char *s1, const char *s2, char *exp_result) | |
63 | { | |
44558701 WN |
64 | size_t i, iters = INNER_LOOP_ITERS; |
65 | timing_t start, stop, cur; | |
66 | ||
67 | TIMING_NOW (start); | |
68 | for (i = 0; i < iters; ++i) | |
97020474 | 69 | { |
44558701 WN |
70 | CALL (impl, s1, s2); |
71 | } | |
72 | TIMING_NOW (stop); | |
97020474 | 73 | |
44558701 | 74 | TIMING_DIFF (cur, start, stop); |
97020474 | 75 | |
44558701 | 76 | TIMING_PRINT_MEAN ((double) cur, (double) iters); |
97020474 SP |
77 | } |
78 | ||
79 | ||
80 | static void | |
81 | do_test (size_t align1, size_t align2, size_t len1, size_t len2, | |
82 | int fail) | |
83 | { | |
84 | char *s1 = (char *) (buf1 + align1); | |
85 | char *s2 = (char *) (buf2 + align2); | |
86 | ||
87 | static const char d[] = "1234567890abcxyz"; | |
88 | #define dl (sizeof (d) - 1) | |
89 | char *ss2 = s2; | |
90 | for (size_t l = len2; l > 0; l = l > dl ? l - dl : 0) | |
91 | { | |
92 | size_t t = l > dl ? dl : l; | |
93 | ss2 = mempcpy (ss2, d, t); | |
94 | } | |
95 | s2[len2] = '\0'; | |
96 | ||
97 | if (fail) | |
98 | { | |
99 | char *ss1 = s1; | |
100 | for (size_t l = len1; l > 0; l = l > dl ? l - dl : 0) | |
101 | { | |
102 | size_t t = l > dl ? dl : l; | |
103 | memcpy (ss1, d, t); | |
104 | ++ss1[len2 > 7 ? 7 : len2 - 1]; | |
105 | ss1 += t; | |
106 | } | |
107 | } | |
108 | else | |
109 | { | |
110 | memset (s1, '0', len1); | |
111 | for (size_t i = 0; i < len2; ++i) | |
112 | s1[len1 - len2 + i] = toupper (s2[i]); | |
113 | } | |
114 | s1[len1] = '\0'; | |
115 | ||
44558701 WN |
116 | printf ("Length %4zd/%zd, alignment %2zd/%2zd, %s:", |
117 | len1, len2, align1, align2, fail ? "fail" : "found"); | |
97020474 SP |
118 | |
119 | FOR_EACH_IMPL (impl, 0) | |
120 | do_one_test (impl, s1, s2, fail ? NULL : s1 + len1 - len2); | |
121 | ||
44558701 | 122 | putchar ('\n'); |
97020474 SP |
123 | } |
124 | ||
125 | static int | |
126 | test_main (void) | |
127 | { | |
128 | test_init (); | |
129 | ||
130 | printf ("%23s", ""); | |
131 | FOR_EACH_IMPL (impl, 0) | |
132 | printf ("\t%s", impl->name); | |
133 | putchar ('\n'); | |
134 | ||
135 | for (size_t klen = 2; klen < 32; ++klen) | |
136 | for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen) | |
137 | { | |
138 | do_test (0, 0, hlen, klen, 0); | |
139 | do_test (0, 0, hlen, klen, 1); | |
140 | do_test (0, 3, hlen, klen, 0); | |
141 | do_test (0, 3, hlen, klen, 1); | |
142 | do_test (0, 9, hlen, klen, 0); | |
143 | do_test (0, 9, hlen, klen, 1); | |
144 | do_test (0, 15, hlen, klen, 0); | |
145 | do_test (0, 15, hlen, klen, 1); | |
146 | ||
147 | do_test (3, 0, hlen, klen, 0); | |
148 | do_test (3, 0, hlen, klen, 1); | |
149 | do_test (3, 3, hlen, klen, 0); | |
150 | do_test (3, 3, hlen, klen, 1); | |
151 | do_test (3, 9, hlen, klen, 0); | |
152 | do_test (3, 9, hlen, klen, 1); | |
153 | do_test (3, 15, hlen, klen, 0); | |
154 | do_test (3, 15, hlen, klen, 1); | |
155 | ||
156 | do_test (9, 0, hlen, klen, 0); | |
157 | do_test (9, 0, hlen, klen, 1); | |
158 | do_test (9, 3, hlen, klen, 0); | |
159 | do_test (9, 3, hlen, klen, 1); | |
160 | do_test (9, 9, hlen, klen, 0); | |
161 | do_test (9, 9, hlen, klen, 1); | |
162 | do_test (9, 15, hlen, klen, 0); | |
163 | do_test (9, 15, hlen, klen, 1); | |
164 | ||
165 | do_test (15, 0, hlen, klen, 0); | |
166 | do_test (15, 0, hlen, klen, 1); | |
167 | do_test (15, 3, hlen, klen, 0); | |
168 | do_test (15, 3, hlen, klen, 1); | |
169 | do_test (15, 9, hlen, klen, 0); | |
170 | do_test (15, 9, hlen, klen, 1); | |
171 | do_test (15, 15, hlen, klen, 0); | |
172 | do_test (15, 15, hlen, klen, 1); | |
173 | } | |
174 | ||
175 | do_test (0, 0, page_size - 1, 16, 0); | |
176 | do_test (0, 0, page_size - 1, 16, 1); | |
177 | ||
178 | return ret; | |
179 | } | |
180 | ||
b598e134 | 181 | #include <support/test-driver.c> |