1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007, 2008, 2009, 2010 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. */
23 #include "signature.h"
24 SIGNATURE_CHECK (strcasestr, char *, (char const *, char const *));
36 /* Declare failure if test takes too long, by using default abort
37 caused by SIGALRM. All known platforms that lack alarm also lack
38 strcasestr, and the replacement strcasestr is known to not take too
40 signal (SIGALRM, SIG_DFL);
45 const char input[] = "foo";
46 const char *result = strcasestr (input, "");
47 ASSERT (result == input);
51 const char input[] = "foo";
52 const char *result = strcasestr (input, "O");
53 ASSERT (result == input + 1);
57 const char input[] = "ABC ABCDAB ABCDABCDABDE";
58 const char *result = strcasestr (input, "ABCDaBD");
59 ASSERT (result == input + 15);
63 const char input[] = "ABC ABCDAB ABCDABCDABDE";
64 const char *result = strcasestr (input, "ABCDaBE");
65 ASSERT (result == NULL);
69 const char input[] = "ABC ABCDAB ABCDABCDABDE";
70 const char *result = strcasestr (input, "ABCDaBCD");
71 ASSERT (result == input + 11);
74 /* Check that a very long haystack is handled quickly if the needle is
75 short and occurs near the beginning. */
77 size_t repeat = 10000;
80 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
81 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
82 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
83 char *haystack = (char *) malloc (m + 1);
86 memset (haystack, 'A', m);
90 for (; repeat > 0; repeat--)
92 ASSERT (strcasestr (haystack, needle) == haystack + 1);
99 /* Check that a very long needle is discarded quickly if the haystack is
102 size_t repeat = 10000;
105 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
106 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
107 char *needle = (char *) malloc (m + 1);
110 memset (needle, 'A', m);
113 for (; repeat > 0; repeat--)
115 ASSERT (strcasestr (haystack, needle) == NULL);
122 /* Check that the asymptotic worst-case complexity is not quadratic. */
125 char *haystack = (char *) malloc (2 * m + 2);
126 char *needle = (char *) malloc (m + 2);
127 if (haystack != NULL && needle != NULL)
131 memset (haystack, 'A', 2 * m);
132 haystack[2 * m] = 'B';
133 haystack[2 * m + 1] = '\0';
135 memset (needle, 'a', m);
137 needle[m + 1] = '\0';
139 result = strcasestr (haystack, needle);
140 ASSERT (result == haystack + m);