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. */
28 #define ASSERT(expr) if (!(expr)) abort ();
34 const char input[] = "foo";
35 const char *result = strcasestr (input, "");
36 ASSERT (result == input);
40 const char input[] = "foo";
41 const char *result = strcasestr (input, "O");
42 ASSERT (result == input + 1);
46 const char input[] = "ABC ABCDAB ABCDABCDABDE";
47 const char *result = strcasestr (input, "ABCDaBD");
48 ASSERT (result == input + 15);
52 const char input[] = "ABC ABCDAB ABCDABCDABDE";
53 const char *result = strcasestr (input, "ABCDaBE");
54 ASSERT (result == NULL);
57 /* Check that a very long haystack is handled quickly if the needle is
58 short and occurs near the beginning. */
60 size_t repeat = 10000;
63 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
64 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
65 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
66 char *haystack = (char *) malloc (m + 1);
69 memset (haystack, 'A', m);
73 for (; repeat > 0; repeat--)
75 ASSERT (strcasestr (haystack, needle) == haystack + 1);
82 /* Check that a very long needle is discarded quickly if the haystack is
85 size_t repeat = 10000;
88 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
89 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
90 char *needle = (char *) malloc (m + 1);
93 memset (needle, 'A', m);
96 for (; repeat > 0; repeat--)
98 ASSERT (strcasestr (haystack, needle) == NULL);
105 /* Check that the asymptotic worst-case complexity is not quadratic. */
106 #if !HAVE_STRCASESTR /* The system's strcasestr() function fails this test. */
109 char *haystack = (char *) malloc (2 * m + 2);
110 char *needle = (char *) malloc (m + 2);
111 if (haystack != NULL && needle != NULL)
115 memset (haystack, 'A', 2 * m);
116 haystack[2 * m] = 'B';
117 haystack[2 * m + 1] = '\0';
119 memset (needle, 'a', m);
121 needle[m + 1] = '\0';
123 result = strcasestr (haystack, needle);
124 ASSERT (result == haystack + m);
128 if (haystack != NULL)