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/>. */
26 #define ASSERT(expr) \
31 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
38 main (int argc, char *argv[])
40 /* Declare failure if test takes too long, by using default abort
44 const char input[] = "foo";
45 const char *result = memmem (input, strlen (input), "", 0);
46 ASSERT (result == input);
50 const char input[] = "foo";
51 const char *result = memmem (input, strlen (input), "o", 1);
52 ASSERT (result == input + 1);
56 const char input[] = "ABC ABCDAB ABCDABCDABDE";
57 const char *result = memmem (input, strlen (input), "ABCDABD", 7);
58 ASSERT (result == input + 15);
62 const char input[] = "ABC ABCDAB ABCDABCDABDE";
63 const char *result = memmem (input, strlen (input), "ABCDABE", 7);
64 ASSERT (result == NULL);
67 /* Check that length 0 does not dereference NULL. */
69 const char *result = memmem (NULL, 0, "foo", 3);
70 ASSERT (result == NULL);
74 const char input[] = "foo";
75 const char *result = memmem (input, strlen (input), NULL, 0);
76 ASSERT (result == input);
79 /* Check that a very long haystack is handled quickly if the needle is
80 short and occurs near the beginning. */
82 size_t repeat = 10000;
85 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
86 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
87 size_t n = strlen (needle);
88 char *haystack = (char *) malloc (m + 1);
91 memset (haystack, 'A', m);
94 for (; repeat > 0; repeat--)
96 ASSERT (memmem (haystack, m, needle, n) == haystack + 1);
103 /* Check that a very long needle is discarded quickly if the haystack is
106 size_t repeat = 10000;
109 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
110 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
111 size_t n = strlen (haystack);
112 char *needle = (char *) malloc (m + 1);
115 memset (needle, 'A', m);
117 for (; repeat > 0; repeat--)
119 ASSERT (memmem (haystack, n, needle, m) == NULL);
126 /* Check that the asymptotic worst-case complexity is not quadratic. */
129 char *haystack = (char *) malloc (2 * m + 1);
130 char *needle = (char *) malloc (m + 1);
131 if (haystack != NULL && needle != NULL)
135 memset (haystack, 'A', 2 * m);
136 haystack[2 * m] = 'B';
138 memset (needle, 'A', m);
141 result = memmem (haystack, 2 * m + 1, needle, m + 1);
142 ASSERT (result == haystack + m);
146 if (haystack != NULL)