From 5a000062d2c3521f34793f9e987c68e0b5591c21 Mon Sep 17 00:00:00 2001 From: Bruno Haible Date: Sun, 11 Feb 2007 13:27:54 +0000 Subject: [PATCH] Tests for module 'c-strstr'. --- ChangeLog | 5 ++ modules/c-strstr-tests | 11 ++++ tests/test-c-strstr.c | 131 +++++++++++++++++++++++++++++++++++++++++ 3 files changed, 147 insertions(+) create mode 100644 modules/c-strstr-tests create mode 100644 tests/test-c-strstr.c diff --git a/ChangeLog b/ChangeLog index 6aeb77b64b..79fe342007 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,8 @@ +2007-02-11 Bruno Haible + + * modules/c-strstr-tests: New file. + * tests/test-c-strstr.c: New file. + 2007-02-11 Bruno Haible * m4/javacomp.m4 (gt_JAVACOMP): Work around a 'tr' bug in coreutils. diff --git a/modules/c-strstr-tests b/modules/c-strstr-tests new file mode 100644 index 0000000000..381d7a3bd2 --- /dev/null +++ b/modules/c-strstr-tests @@ -0,0 +1,11 @@ +Files: +tests/test-c-strstr.c + +Depends-on: + +configure.ac: + +Makefile.am: +TESTS += test-c-strstr +check_PROGRAMS += test-c-strstr + diff --git a/tests/test-c-strstr.c b/tests/test-c-strstr.c new file mode 100644 index 0000000000..dff500bda4 --- /dev/null +++ b/tests/test-c-strstr.c @@ -0,0 +1,131 @@ +/* Test of searching in a string. + Copyright (C) 2007 Free Software Foundation, Inc. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software Foundation, + Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ + +/* Written by Bruno Haible , 2007. */ + +#ifdef HAVE_CONFIG_H +# include +#endif + +#include "c-strstr.h" + +#include + +#define ASSERT(expr) if (!(expr)) abort (); + +int +main () +{ + { + const char input[] = "foo"; + const char *result = c_strstr (input, ""); + ASSERT (result == input); + } + + { + const char input[] = "foo"; + const char *result = c_strstr (input, "o"); + ASSERT (result == input + 1); + } + + { + const char input[] = "ABC ABCDAB ABCDABCDABDE"; + const char *result = c_strstr (input, "ABCDABD"); + ASSERT (result == input + 15); + } + + { + const char input[] = "ABC ABCDAB ABCDABCDABDE"; + const char *result = c_strstr (input, "ABCDABE"); + ASSERT (result == NULL); + } + + /* Check that a very long haystack is handled quickly if the needle is + short and occurs near the beginning. */ + { + size_t repeat = 10000; + size_t m = 1000000; + char *needle = + "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA" + "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"; + char *haystack = (char *) malloc (m + 1); + if (haystack != NULL) + { + memset (haystack, 'A', m); + haystack[0] = 'B'; + haystack[m] = '\0'; + + for (; repeat > 0; repeat--) + { + ASSERT (c_strstr (haystack, needle) == haystack + 1); + } + + free (haystack); + } + } + + /* Check that a very long needle is discarded quickly if the haystack is + short. */ + { + size_t repeat = 10000; + size_t m = 1000000; + char *haystack = + "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA" + "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"; + char *needle = (char *) malloc (m + 1); + if (needle != NULL) + { + memset (needle, 'A', m); + needle[m] = '\0'; + + for (; repeat > 0; repeat--) + { + ASSERT (c_strstr (haystack, needle) == NULL); + } + + free (needle); + } + } + + /* Check that the asymptotic worst-case complexity is not quadratic. */ + { + size_t m = 1000000; + char *haystack = (char *) malloc (2 * m + 2); + char *needle = (char *) malloc (m + 2); + if (haystack != NULL && needle != NULL) + { + const char *result; + + memset (haystack, 'A', 2 * m); + haystack[2 * m] = 'B'; + haystack[2 * m + 1] = '\0'; + + memset (needle, 'A', m); + needle[m] = 'B'; + needle[m + 1] = '\0'; + + result = c_strstr (haystack, needle); + ASSERT (result == haystack + m); + } + if (needle != NULL) + free (needle); + if (haystack != NULL) + free (haystack); + } + + return 0; +} -- 2.30.2