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__); \
42 /* Declare failure if test takes too long, by using default abort
43 caused by SIGALRM. All known platforms that lack alarm also lack
44 memmem, and the replacement memmem is known to not take too
50 const char input[] = "foo";
51 const char *result = strcasestr (input, "");
52 ASSERT (result == input);
56 const char input[] = "foo";
57 const char *result = strcasestr (input, "O");
58 ASSERT (result == input + 1);
62 const char input[] = "ABC ABCDAB ABCDABCDABDE";
63 const char *result = strcasestr (input, "ABCDaBD");
64 ASSERT (result == input + 15);
68 const char input[] = "ABC ABCDAB ABCDABCDABDE";
69 const char *result = strcasestr (input, "ABCDaBE");
70 ASSERT (result == NULL);
74 const char input[] = "ABC ABCDAB ABCDABCDABDE";
75 const char *result = strcasestr (input, "ABCDaBCD");
76 ASSERT (result == input + 11);
79 /* Check that a very long haystack is handled quickly if the needle is
80 short and occurs near the beginning. */
82 size_t repeat = 10000;
85 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
86 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
87 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
88 char *haystack = (char *) malloc (m + 1);
91 memset (haystack, 'A', m);
95 for (; repeat > 0; repeat--)
97 ASSERT (strcasestr (haystack, needle) == haystack + 1);
104 /* Check that a very long needle is discarded quickly if the haystack is
107 size_t repeat = 10000;
110 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
111 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
112 char *needle = (char *) malloc (m + 1);
115 memset (needle, 'A', m);
118 for (; repeat > 0; repeat--)
120 ASSERT (strcasestr (haystack, needle) == NULL);
127 /* Check that the asymptotic worst-case complexity is not quadratic. */
130 char *haystack = (char *) malloc (2 * m + 2);
131 char *needle = (char *) malloc (m + 2);
132 if (haystack != NULL && needle != NULL)
136 memset (haystack, 'A', 2 * m);
137 haystack[2 * m] = 'B';
138 haystack[2 * m + 1] = '\0';
140 memset (needle, 'a', m);
142 needle[m + 1] = '\0';
144 result = strcasestr (haystack, needle);
145 ASSERT (result == haystack + m);