X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=tests%2Ftest-memmem.c;h=7f0f9257a3ee863ae472d43828178b3562793520;hb=c26924950a3a546112e35c99aad85c0855f4664a;hp=df3baef897fb5c1f31b83c114e77a03bbc5b2324;hpb=64181a34277230d9743b679cdc6c18a8b7b0d48c;p=gnulib.git diff --git a/tests/test-memmem.c b/tests/test-memmem.c index df3baef89..7f0f9257a 100644 --- a/tests/test-memmem.c +++ b/tests/test-memmem.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 2004, 2007, 2008 Free Software Foundation + * Copyright (C) 2004, 2007-2009 Free Software Foundation * Written by Bruno Haible and Eric Blake * * This program is free software: you can redistribute it and/or modify @@ -19,16 +19,20 @@ #include +#include #include #include #include +#include "zerosize-ptr.h" + #define ASSERT(expr) \ do \ { \ if (!(expr)) \ { \ fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \ + fflush (stderr); \ abort (); \ } \ } \ @@ -37,9 +41,15 @@ int main (int argc, char *argv[]) { +#if HAVE_DECL_ALARM /* Declare failure if test takes too long, by using default abort - caused by SIGALRM. */ - alarm (10); + caused by SIGALRM. All known platforms that lack alarm also lack + memmem, and the replacement memmem is known to not take too + long. */ + signal (SIGALRM, SIG_DFL); + alarm (100); +#endif + { const char input[] = "foo"; const char *result = memmem (input, strlen (input), "", 0); @@ -64,9 +74,15 @@ main (int argc, char *argv[]) ASSERT (result == NULL); } - /* Check that length 0 does not dereference NULL. */ { - const char *result = memmem (NULL, 0, "foo", 3); + const char input[] = "ABC ABCDAB ABCDABCDABDE"; + const char *result = memmem (input, strlen (input), "ABCDABCD", 8); + ASSERT (result == input + 11); + } + + /* Check that length 0 does not dereference the pointer. */ + { + const char *result = memmem (zerosize_ptr (), 0, "foo", 3); ASSERT (result == NULL); } @@ -141,10 +157,33 @@ main (int argc, char *argv[]) result = memmem (haystack, 2 * m + 1, needle, m + 1); ASSERT (result == haystack + m); } - if (needle != NULL) - free (needle); - if (haystack != NULL) - free (haystack); + free (needle); + free (haystack); + } + + /* Check that long needles not present in a haystack can be handled + with sublinear speed. */ + { + size_t repeat = 10000; + size_t m = 1000000; + size_t n = 1000; + char *haystack = (char *) malloc (m); + char *needle = (char *) malloc (n); + if (haystack != NULL && needle != NULL) + { + const char *result; + + memset (haystack, 'A', m); + memset (needle, 'B', n); + + for (; repeat > 0; repeat--) + { + result = memmem (haystack, m, needle, n); + ASSERT (result == NULL); + } + } + free (haystack); + free (needle); } return 0;