]> git.ipfire.org Git - thirdparty/glibc.git/blame - benchtests/bench-strtok.c
Update copyright notices with scripts/update-copyrights
[thirdparty/glibc.git] / benchtests / bench-strtok.c
CommitLineData
9f6e964c 1/* Measure strtok functions.
d4697bc9 2 Copyright (C) 2013-2014 Free Software Foundation, Inc.
9f6e964c
RS
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 "strtok"
21#include "bench-string.h"
22
23char *
24simple_strtok (char *s1, char *s2)
25{
26 static char *saveptr;
27 char *token;
28 ssize_t i = 0, j = 0;
29 int found = 0;
30 size_t s2len = strlen (s2);
31
32 if (s1 == NULL)
33 s1 = saveptr;
34 if (s1 == NULL || *s1 == '\0')
35 return NULL;
36
37 while (!found)
38 {
39 if (s1[i] == '\0')
40 {
41 saveptr = NULL;
42 return NULL;
43 }
44 for (j = 0; j < s2len; j++)
45 {
46 if (s1[i] == s2[j])
47 {
48 i++;
49 found = 0;
50 break;
51 }
52 found = 1;
53 }
54 }
55 token = s1 + i;
56 i++;
57 found = 0;
58 while (!found)
59 {
60 if (s1[i] == '\0')
61 {
62 saveptr = NULL;
63 return token;
64 }
65 for (j = 0; j < s2len; j++)
66 {
67 if (s1[i] == s2[j])
68 {
69 found = 1;
70 break;
71 }
72 }
73 i++;
74 }
75 s1[i - 1] = '\0';
76 saveptr = s1 + i;
77 return token;
78}
79
80typedef char *(*proto_t) (const char *, const char *);
81
82IMPL (simple_strtok, 0)
83IMPL (strtok, 1)
84
85static void
86do_one_test (impl_t * impl, const char *s1, const char *s2)
87{
88 size_t i, iters = INNER_LOOP_ITERS;
89 timing_t start, stop, cur;
90 TIMING_NOW (start);
91 for (i = 0; i < iters; ++i)
92 {
93 CALL (impl, s1, s2);
94 CALL (impl, NULL, s2);
95 CALL (impl, NULL, s2);
96 }
97 TIMING_NOW (stop);
98
99 TIMING_DIFF (cur, start, stop);
100
101 TIMING_PRINT_MEAN ((double) cur, (double) iters);
102
103}
104
105
106static void
107do_test (size_t align1, size_t align2, size_t len1, size_t len2, int fail)
108{
109 char *s2 = (char *) (buf2 + align2);
110 static const char d[] = "1234567890abcdef";
111#define dl (sizeof (d) - 1)
112 char *ss2 = s2;
113 for (size_t l = len2; l > 0; l = l > dl ? l - dl : 0)
114 {
115 size_t t = l > dl ? dl : l;
116 ss2 = mempcpy (ss2, d, t);
117 }
118 s2[len2] = '\0';
119
120 printf ("Length %4zd/%zd, alignment %2zd/%2zd, %s:",
121 len1, len2, align1, align2, fail ? "fail" : "found");
122
123 FOR_EACH_IMPL (impl, 0)
124 {
125 char *s1 = (char *) (buf1 + align1);
126 if (fail)
127 {
128 char *ss1 = s1;
129 for (size_t l = len1; l > 0; l = l > dl ? l - dl : 0)
130 {
131 size_t t = l > dl ? dl : l;
132 memcpy (ss1, d, t);
133 ++ss1[len2 > 7 ? 7 : len2 - 1];
134 ss1 += t;
135 }
136 }
137 else
138 {
139 memset (s1, '0', len1);
140 memcpy (s1 + (len1 - len2) - 2, s2, len2);
141 if ((len1 / len2) > 4)
142 memcpy (s1 + (len1 - len2) - (3 * len2), s2, len2);
143 }
144 s1[len1] = '\0';
145 do_one_test (impl, s1, s2);
146 }
147 putchar ('\n');
148}
149
150static int
151test_main (void)
152{
153 test_init ();
154
155 printf ("%23s", "");
156 FOR_EACH_IMPL (impl, 0)
157 printf ("\t%s", impl->name);
158 putchar ('\n');
159
160 for (size_t klen = 2; klen < 32; ++klen)
161 for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen)
162 {
163 do_test (0, 0, hlen, klen, 0);
164 do_test (0, 0, hlen, klen, 1);
165 do_test (0, 3, hlen, klen, 0);
166 do_test (0, 3, hlen, klen, 1);
167 do_test (0, 9, hlen, klen, 0);
168 do_test (0, 9, hlen, klen, 1);
169 do_test (0, 15, hlen, klen, 0);
170 do_test (0, 15, hlen, klen, 1);
171
172 do_test (3, 0, hlen, klen, 0);
173 do_test (3, 0, hlen, klen, 1);
174 do_test (3, 3, hlen, klen, 0);
175 do_test (3, 3, hlen, klen, 1);
176 do_test (3, 9, hlen, klen, 0);
177 do_test (3, 9, hlen, klen, 1);
178 do_test (3, 15, hlen, klen, 0);
179 do_test (3, 15, hlen, klen, 1);
180
181 do_test (9, 0, hlen, klen, 0);
182 do_test (9, 0, hlen, klen, 1);
183 do_test (9, 3, hlen, klen, 0);
184 do_test (9, 3, hlen, klen, 1);
185 do_test (9, 9, hlen, klen, 0);
186 do_test (9, 9, hlen, klen, 1);
187 do_test (9, 15, hlen, klen, 0);
188 do_test (9, 15, hlen, klen, 1);
189
190 do_test (15, 0, hlen, klen, 0);
191 do_test (15, 0, hlen, klen, 1);
192 do_test (15, 3, hlen, klen, 0);
193 do_test (15, 3, hlen, klen, 1);
194 do_test (15, 9, hlen, klen, 0);
195 do_test (15, 9, hlen, klen, 1);
196 do_test (15, 15, hlen, klen, 0);
197 do_test (15, 15, hlen, klen, 1);
198 }
199 do_test (0, 0, page_size - 1, 16, 0);
200 do_test (0, 0, page_size - 1, 16, 1);
201
202 return ret;
203}
204
205#include "../test-skeleton.c"