1
/* Test of searching in a string.
2
Copyright (C) 2007 Free Software Foundation, Inc.
4
This program is free software: you can redistribute it and/or modify
5
it under the terms of the GNU General Public License as published by
6
the Free Software Foundation; either version 3 of the License, or
7
(at your option) any later version.
9
This program is distributed in the hope that it will be useful,
10
but WITHOUT ANY WARRANTY; without even the implied warranty of
11
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
GNU General Public License for more details.
14
You should have received a copy of the GNU General Public License
15
along with this program. If not, see <http://www.gnu.org/licenses/>. */
17
/* Written by Bruno Haible <bruno@clisp.org>, 2007. */
27
#define ASSERT(expr) \
32
fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
41
/* configure should already have checked that the locale is supported. */
42
if (setlocale (LC_ALL, "") == NULL)
46
const char input[] = "f\303\266\303\266";
47
const char *result = mbsstr (input, "");
48
ASSERT (result == input);
52
const char input[] = "f\303\266\303\266";
53
const char *result = mbsstr (input, "\303\266");
54
ASSERT (result == input + 1);
58
const char input[] = "f\303\266\303\266";
59
const char *result = mbsstr (input, "\266\303");
60
ASSERT (result == NULL);
64
const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
65
const char *result = mbsstr (input, "\303\204BCD\303\204BD"); /* "ÄBCDÄBD" */
66
ASSERT (result == input + 19);
70
const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
71
const char *result = mbsstr (input, "\303\204BCD\303\204BE"); /* "ÄBCDÄBE" */
72
ASSERT (result == NULL);
75
/* Check that a very long haystack is handled quickly if the needle is
76
short and occurs near the beginning. */
78
size_t repeat = 10000;
81
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
82
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
83
char *haystack = (char *) malloc (m + 1);
86
memset (haystack, 'A', m);
87
haystack[0] = '\303'; haystack[1] = '\204';
90
for (; repeat > 0; repeat--)
92
ASSERT (mbsstr (haystack, needle) == haystack + 2);
99
/* Check that a very long needle is discarded quickly if the haystack is
102
size_t repeat = 10000;
105
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
106
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
107
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
108
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
109
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
110
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207";
111
char *needle = (char *) malloc (m + 1);
114
memset (needle, 'A', m);
117
for (; repeat > 0; repeat--)
119
ASSERT (mbsstr (haystack, needle) == NULL);
126
/* Check that the asymptotic worst-case complexity is not quadratic. */
129
char *haystack = (char *) malloc (2 * m + 3);
130
char *needle = (char *) malloc (m + 3);
131
if (haystack != NULL && needle != NULL)
135
memset (haystack, 'A', 2 * m);
136
haystack[2 * m] = '\303'; haystack[2 * m + 1] = '\207';
137
haystack[2 * m + 2] = '\0';
139
memset (needle, 'A', m);
140
needle[m] = '\303'; needle[m + 1] = '\207';
141
needle[m + 2] = '\0';
143
result = mbsstr (haystack, needle);
144
ASSERT (result == haystack + m);
148
if (haystack != NULL)