1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007-2011 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 long periodic needle does not cause false positives. */
76 const char input[] = ("F_BD_CE_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD"
77 "_C3_88_20_EF_BF_BD_EF_BF_BD_EF_BF_BD"
78 "_C3_A7_20_EF_BF_BD");
79 const char need[] = "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD";
80 const char *result = strcasestr (input, need);
81 ASSERT (result == NULL);
84 const char input[] = ("F_BD_CE_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD"
85 "_C3_88_20_EF_BF_BD_EF_BF_BD_EF_BF_BD"
86 "_C3_A7_20_EF_BF_BD_DA_B5_C2_A6_20"
87 "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD");
88 const char need[] = "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD";
89 const char *result = strcasestr (input, need);
90 ASSERT (result == input + 115);
93 /* Check that a very long haystack is handled quickly if the needle is
94 short and occurs near the beginning. */
96 size_t repeat = 10000;
99 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
100 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
101 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
102 char *haystack = (char *) malloc (m + 1);
103 if (haystack != NULL)
105 memset (haystack, 'A', m);
109 for (; repeat > 0; repeat--)
111 ASSERT (strcasestr (haystack, needle) == haystack + 1);
118 /* Check that a very long needle is discarded quickly if the haystack is
121 size_t repeat = 10000;
123 const char *haystack =
124 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
125 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
126 char *needle = (char *) malloc (m + 1);
129 memset (needle, 'A', m);
132 for (; repeat > 0; repeat--)
134 ASSERT (strcasestr (haystack, needle) == NULL);
141 /* Check that the asymptotic worst-case complexity is not quadratic. */
144 char *haystack = (char *) malloc (2 * m + 2);
145 char *needle = (char *) malloc (m + 2);
146 if (haystack != NULL && needle != NULL)
150 memset (haystack, 'A', 2 * m);
151 haystack[2 * m] = 'B';
152 haystack[2 * m + 1] = '\0';
154 memset (needle, 'a', m);
156 needle[m + 1] = '\0';
158 result = strcasestr (haystack, needle);
159 ASSERT (result == haystack + m);