1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007, 2008 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__); \
43 /* Declare failure if test takes too long, by using default abort
44 caused by SIGALRM. All known platforms that lack alarm also lack
45 memmem, and the replacement memmem is known to not take too
51 const char input[] = "foo";
52 const char *result = strcasestr (input, "");
53 ASSERT (result == input);
57 const char input[] = "foo";
58 const char *result = strcasestr (input, "O");
59 ASSERT (result == input + 1);
63 const char input[] = "ABC ABCDAB ABCDABCDABDE";
64 const char *result = strcasestr (input, "ABCDaBD");
65 ASSERT (result == input + 15);
69 const char input[] = "ABC ABCDAB ABCDABCDABDE";
70 const char *result = strcasestr (input, "ABCDaBE");
71 ASSERT (result == NULL);
75 const char input[] = "ABC ABCDAB ABCDABCDABDE";
76 const char *result = strcasestr (input, "ABCDaBCD");
77 ASSERT (result == input + 11);
80 /* Check that a very long haystack is handled quickly if the needle is
81 short and occurs near the beginning. */
83 size_t repeat = 10000;
86 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
87 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
88 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
89 char *haystack = (char *) malloc (m + 1);
92 memset (haystack, 'A', m);
96 for (; repeat > 0; repeat--)
98 ASSERT (strcasestr (haystack, needle) == haystack + 1);
105 /* Check that a very long needle is discarded quickly if the haystack is
108 size_t repeat = 10000;
111 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
112 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
113 char *needle = (char *) malloc (m + 1);
116 memset (needle, 'A', m);
119 for (; repeat > 0; repeat--)
121 ASSERT (strcasestr (haystack, needle) == NULL);
128 /* Check that the asymptotic worst-case complexity is not quadratic. */
131 char *haystack = (char *) malloc (2 * m + 2);
132 char *needle = (char *) malloc (m + 2);
133 if (haystack != NULL && needle != NULL)
137 memset (haystack, 'A', 2 * m);
138 haystack[2 * m] = 'B';
139 haystack[2 * m + 1] = '\0';
141 memset (needle, 'a', m);
143 needle[m + 1] = '\0';
145 result = strcasestr (haystack, needle);
146 ASSERT (result == haystack + m);