1 /* Test of case-insensitive 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 2, or (at your option)
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, write to the Free Software Foundation,
16 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
18 /* Written by Bruno Haible <bruno@clisp.org>, 2007. */
29 #define ASSERT(expr) \
34 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
44 const char input[] = "foo";
45 const char *result = strcasestr (input, "");
46 ASSERT (result == input);
50 const char input[] = "foo";
51 const char *result = strcasestr (input, "O");
52 ASSERT (result == input + 1);
56 const char input[] = "ABC ABCDAB ABCDABCDABDE";
57 const char *result = strcasestr (input, "ABCDaBD");
58 ASSERT (result == input + 15);
62 const char input[] = "ABC ABCDAB ABCDABCDABDE";
63 const char *result = strcasestr (input, "ABCDaBE");
64 ASSERT (result == NULL);
67 /* Check that a very long haystack is handled quickly if the needle is
68 short and occurs near the beginning. */
70 size_t repeat = 10000;
73 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
74 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
75 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
76 char *haystack = (char *) malloc (m + 1);
79 memset (haystack, 'A', m);
83 for (; repeat > 0; repeat--)
85 ASSERT (strcasestr (haystack, needle) == haystack + 1);
92 /* Check that a very long needle is discarded quickly if the haystack is
95 size_t repeat = 10000;
98 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
99 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
100 char *needle = (char *) malloc (m + 1);
103 memset (needle, 'A', m);
106 for (; repeat > 0; repeat--)
108 ASSERT (strcasestr (haystack, needle) == NULL);
115 /* Check that the asymptotic worst-case complexity is not quadratic. */
116 #if !HAVE_STRCASESTR /* The system's strcasestr() function fails this test. */
119 char *haystack = (char *) malloc (2 * m + 2);
120 char *needle = (char *) malloc (m + 2);
121 if (haystack != NULL && needle != NULL)
125 memset (haystack, 'A', 2 * m);
126 haystack[2 * m] = 'B';
127 haystack[2 * m + 1] = '\0';
129 memset (needle, 'a', m);
131 needle[m + 1] = '\0';
133 result = strcasestr (haystack, needle);
134 ASSERT (result == haystack + m);
138 if (haystack != NULL)