2 * Copyright (C) 2004, 2007, 2008 Free Software Foundation
3 * Written by Bruno Haible and Eric Blake
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>. */
27 #define ASSERT(expr) \
32 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
40 main (int argc, char *argv[])
43 /* Declare failure if test takes too long, by using default abort
44 caused by SIGALRM. All known platforms that lack alarm also lack
45 memmem, and the replacement memmem is known to not take too
47 signal (SIGALRM, SIG_DFL);
52 const char input[] = "foo";
53 const char *result = memmem (input, strlen (input), "", 0);
54 ASSERT (result == input);
58 const char input[] = "foo";
59 const char *result = memmem (input, strlen (input), "o", 1);
60 ASSERT (result == input + 1);
64 const char input[] = "ABC ABCDAB ABCDABCDABDE";
65 const char *result = memmem (input, strlen (input), "ABCDABD", 7);
66 ASSERT (result == input + 15);
70 const char input[] = "ABC ABCDAB ABCDABCDABDE";
71 const char *result = memmem (input, strlen (input), "ABCDABE", 7);
72 ASSERT (result == NULL);
76 const char input[] = "ABC ABCDAB ABCDABCDABDE";
77 const char *result = memmem (input, strlen (input), "ABCDABCD", 8);
78 ASSERT (result == input + 11);
81 /* Check that length 0 does not dereference NULL. */
83 const char *result = memmem (NULL, 0, "foo", 3);
84 ASSERT (result == NULL);
88 const char input[] = "foo";
89 const char *result = memmem (input, strlen (input), NULL, 0);
90 ASSERT (result == input);
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 size_t n = strlen (needle);
102 char *haystack = (char *) malloc (m + 1);
103 if (haystack != NULL)
105 memset (haystack, 'A', m);
108 for (; repeat > 0; repeat--)
110 ASSERT (memmem (haystack, m, needle, n) == haystack + 1);
117 /* Check that a very long needle is discarded quickly if the haystack is
120 size_t repeat = 10000;
123 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
124 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
125 size_t n = strlen (haystack);
126 char *needle = (char *) malloc (m + 1);
129 memset (needle, 'A', m);
131 for (; repeat > 0; repeat--)
133 ASSERT (memmem (haystack, n, needle, m) == NULL);
140 /* Check that the asymptotic worst-case complexity is not quadratic. */
143 char *haystack = (char *) malloc (2 * m + 1);
144 char *needle = (char *) malloc (m + 1);
145 if (haystack != NULL && needle != NULL)
149 memset (haystack, 'A', 2 * m);
150 haystack[2 * m] = 'B';
152 memset (needle, 'A', m);
155 result = memmem (haystack, 2 * m + 1, needle, m + 1);
156 ASSERT (result == haystack + m);
162 /* Check that long needles not present in a haystack can be handled
163 with sublinear speed. */
165 size_t repeat = 10000;
168 char *haystack = (char *) malloc (m);
169 char *needle = (char *) malloc (n);
170 if (haystack != NULL && needle != NULL)
174 memset (haystack, 'A', m);
175 memset (needle, 'B', n);
177 for (; repeat > 0; repeat--)
179 result = memmem (haystack, m, needle, n);
180 ASSERT (result == NULL);