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. */
28 #define ASSERT(expr) \
33 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
44 /* Declare failure if test takes too long, by using default abort
45 caused by SIGALRM. All known platforms that lack alarm also lack
46 strcasestr, and the replacement strcasestr is known to not take too
48 signal (SIGALRM, SIG_DFL);
53 const char input[] = "foo";
54 const char *result = strcasestr (input, "");
55 ASSERT (result == input);
59 const char input[] = "foo";
60 const char *result = strcasestr (input, "O");
61 ASSERT (result == input + 1);
65 const char input[] = "ABC ABCDAB ABCDABCDABDE";
66 const char *result = strcasestr (input, "ABCDaBD");
67 ASSERT (result == input + 15);
71 const char input[] = "ABC ABCDAB ABCDABCDABDE";
72 const char *result = strcasestr (input, "ABCDaBE");
73 ASSERT (result == NULL);
77 const char input[] = "ABC ABCDAB ABCDABCDABDE";
78 const char *result = strcasestr (input, "ABCDaBCD");
79 ASSERT (result == input + 11);
82 /* Check that a very long haystack is handled quickly if the needle is
83 short and occurs near the beginning. */
85 size_t repeat = 10000;
88 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
89 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
90 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
91 char *haystack = (char *) malloc (m + 1);
94 memset (haystack, 'A', m);
98 for (; repeat > 0; repeat--)
100 ASSERT (strcasestr (haystack, needle) == haystack + 1);
107 /* Check that a very long needle is discarded quickly if the haystack is
110 size_t repeat = 10000;
113 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
114 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
115 char *needle = (char *) malloc (m + 1);
118 memset (needle, 'A', m);
121 for (; repeat > 0; repeat--)
123 ASSERT (strcasestr (haystack, needle) == NULL);
130 /* Check that the asymptotic worst-case complexity is not quadratic. */
133 char *haystack = (char *) malloc (2 * m + 2);
134 char *needle = (char *) malloc (m + 2);
135 if (haystack != NULL && needle != NULL)
139 memset (haystack, 'A', 2 * m);
140 haystack[2 * m] = 'B';
141 haystack[2 * m + 1] = '\0';
143 memset (needle, 'a', m);
145 needle[m + 1] = '\0';
147 result = strcasestr (haystack, needle);
148 ASSERT (result == haystack + m);