X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=tests%2Ftest-memmem.c;h=babf6810cb8cbeb6ca7e4770a595f447472cddc8;hb=41d7de2bc881ddb3ce8a8a40552724ebb893108a;hp=935edbbc6d577841d4f1199d8a6b2a63b72caac3;hpb=fc068cf4eb6814e848e4dc54e1c5cf4c30a79a6f;p=gnulib.git

diff --git a/tests/test-memmem.c b/tests/test-memmem.c
index 935edbbc6..babf6810c 100644
--- a/tests/test-memmem.c
+++ b/tests/test-memmem.c
@@ -1,6 +1,6 @@
 /*
- * Copyright (C) 2004, 2007 Free Software Foundation
- * Written by Simon Josefsson
+ * 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
  * it under the terms of the GNU General Public License as published by
@@ -17,24 +17,36 @@
 
 #include <config.h>
 
-#include <stdio.h>
 #include <string.h>
+
+#include "signature.h"
+SIGNATURE_CHECK (memmem, void *, (void const *, size_t, void const *, size_t));
+
+#include <signal.h>
 #include <stdlib.h>
+#include <unistd.h>
+
+#include "zerosize-ptr.h"
+#include "macros.h"
 
-#define ASSERT(expr) \
-  do									     \
-    {									     \
-      if (!(expr))							     \
-        {								     \
-          fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
-          abort ();							     \
-        }								     \
-    }									     \
-  while (0)
+static void *
+null_ptr (void)
+{
+  return NULL;
+}
 
 int
 main (int argc, char *argv[])
 {
+#if HAVE_DECL_ALARM
+  /* Declare failure if test takes too long, by using default abort
+     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);
@@ -59,15 +71,21 @@ 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);
   }
 
   {
     const char input[] = "foo";
-    const char *result = memmem (input, strlen (input), NULL, 0);
+    const char *result = memmem (input, strlen (input), null_ptr (), 0);
     ASSERT (result == input);
   }
 
@@ -83,15 +101,15 @@ main (int argc, char *argv[])
     char *haystack = (char *) malloc (m + 1);
     if (haystack != NULL)
       {
-	memset (haystack, 'A', m);
-	haystack[0] = 'B';
+        memset (haystack, 'A', m);
+        haystack[0] = 'B';
 
-	for (; repeat > 0; repeat--)
-	  {
-	    ASSERT (memmem (haystack, m, needle, n) == haystack + 1);
-	  }
+        for (; repeat > 0; repeat--)
+          {
+            ASSERT (memmem (haystack, m, needle, n) == haystack + 1);
+          }
 
-	free (haystack);
+        free (haystack);
       }
   }
 
@@ -107,14 +125,14 @@ main (int argc, char *argv[])
     char *needle = (char *) malloc (m + 1);
     if (needle != NULL)
       {
-	memset (needle, 'A', m);
+        memset (needle, 'A', m);
 
-	for (; repeat > 0; repeat--)
-	  {
-	    ASSERT (memmem (haystack, n, needle, m) == NULL);
-	  }
+        for (; repeat > 0; repeat--)
+          {
+            ASSERT (memmem (haystack, n, needle, m) == NULL);
+          }
 
-	free (needle);
+        free (needle);
       }
   }
 
@@ -125,21 +143,44 @@ main (int argc, char *argv[])
     char *needle = (char *) malloc (m + 1);
     if (haystack != NULL && needle != NULL)
       {
-	const char *result;
+        const char *result;
 
-	memset (haystack, 'A', 2 * m);
-	haystack[2 * m] = 'B';
+        memset (haystack, 'A', 2 * m);
+        haystack[2 * m] = 'B';
 
-	memset (needle, 'A', m);
-	needle[m] = 'B';
+        memset (needle, 'A', m);
+        needle[m] = 'B';
 
-	result = memmem (haystack, 2 * m + 1, needle, m + 1);
-	ASSERT (result == haystack + m);
+        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;