string/test-memmem.c

   1 /* Test and measure memmem functions.
   2    Copyright (C) 2008 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Written by Ulrich Drepper <drepper@redhat.com>, 2008.
   5
   6    The GNU C Library is free software; you can redistribute it and/or
   7    modify it under the terms of the GNU Lesser General Public
   8    License as published by the Free Software Foundation; either
   9    version 2.1 of the License, or (at your option) any later version.
  10
  11    The GNU C Library is distributed in the hope that it will be useful,
  12    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14    Lesser General Public License for more details.
  15
  16    You should have received a copy of the GNU Lesser General Public
  17    License along with the GNU C Library; if not, see
  18    <http://www.gnu.org/licenses/>.  */
  19
  20 #define TEST_MAIN
  21 #define BUF1PAGES 20
  22 #define ITERATIONS 500
  23 #include "test-string.h"
  24
  25 typedef char *(*proto_t) (const void *, size_t, const void *, size_t);
  26 void *simple_memmem (const void *, size_t, const void *, size_t);
  27
  28 IMPL (simple_memmem, 0)
  29 IMPL (memmem, 1)
  30
  31 void *
  32 simple_memmem (const void *haystack, size_t haystack_len, const void *needle,
  33                size_t needle_len)
  34 {
  35   const char *begin;
  36   const char *const last_possible
  37     = (const char *) haystack + haystack_len - needle_len;
  38
  39   if (needle_len == 0)
  40     /* The first occurrence of the empty string is deemed to occur at
  41        the beginning of the string.  */
  42     return (void *) haystack;
  43
  44   /* Sanity check, otherwise the loop might search through the whole
  45      memory.  */
  46   if (__builtin_expect (haystack_len < needle_len, 0))
  47     return NULL;
  48
  49   for (begin = (const char *) haystack; begin <= last_possible; ++begin)
  50     if (begin[0] == ((const char *) needle)[0] &&
  51         !memcmp ((const void *) &begin[1],
  52                  (const void *) ((const char *) needle + 1),
  53                  needle_len - 1))
  54       return (void *) begin;
  55
  56   return NULL;
  57 }
  58
  59 static void
  60 do_one_test (impl_t *impl, const void *haystack, size_t haystack_len,
  61              const void *needle, size_t needle_len, const void *expected)
  62 {
  63   void *res;
  64
  65   res = CALL (impl, haystack, haystack_len, needle, needle_len);
  66   if (res != expected)
  67     {
  68       error (0, 0, "Wrong result in function %s %p %p", impl->name,
  69              res, expected);
  70       ret = 1;
  71       return;
  72     }
  73
  74   if (HP_TIMING_AVAIL)
  75     {
  76       hp_timing_t start __attribute ((unused));
  77       hp_timing_t stop __attribute ((unused));
  78       hp_timing_t best_time = ~ (hp_timing_t) 0;
  79       size_t i;
  80
  81       for (i = 0; i < 32; ++i)
  82         {
  83           HP_TIMING_NOW (start);
  84           CALL (impl, haystack, haystack_len, needle, needle_len);
  85           HP_TIMING_NOW (stop);
  86           HP_TIMING_BEST (best_time, start, stop);
  87         }
  88
  89       printf ("\t%zd", (size_t) best_time);
  90     }
  91 }
  92
  93 static void
  94 do_test (const char *str, size_t len, size_t idx)
  95 {
  96   char tmpbuf[len];
  97
  98   memcpy (tmpbuf, buf1 + idx, len);
  99   memcpy (buf1 + idx, str, len);
 100
 101   if (HP_TIMING_AVAIL)
 102     printf ("String %s, offset %zd:", str, idx);
 103
 104   FOR_EACH_IMPL (impl, 0)
 105     do_one_test (impl, buf1, BUF1PAGES * page_size, str, len, buf1 + idx);
 106
 107   memcpy (buf1 + idx, tmpbuf, len);
 108
 109   if (HP_TIMING_AVAIL)
 110     putchar ('\n');
 111 }
 112
 113 static void
 114 do_random_tests (void)
 115 {
 116   for (size_t n = 0; n < ITERATIONS; ++n)
 117     {
 118       char tmpbuf[32];
 119
 120       size_t shift = random () % 11;
 121       size_t rel = random () % ((2 << (shift + 1)) * 64);
 122       size_t idx = MIN ((2 << shift) * 64 + rel, BUF1PAGES * page_size - 2);
 123       size_t len = random () % (sizeof (tmpbuf) - 1) + 1;
 124       len = MIN (len, BUF1PAGES * page_size - idx - 1);
 125       memcpy (tmpbuf, buf1 + idx, len);
 126       for (size_t i = random () % len / 2 + 1; i > 0; --i)
 127         {
 128           size_t off = random () % len;
 129           char ch = '0' + random () % 10;
 130
 131           buf1[idx + off] = ch;
 132         }
 133
 134       if (HP_TIMING_AVAIL)
 135         printf ("String %.*s, offset %zd:", (int) len, buf1 + idx, idx);
 136
 137       FOR_EACH_IMPL (impl, 0)
 138         do_one_test (impl, buf1, BUF1PAGES * page_size, buf1 + idx, len,
 139                      buf1 + idx);
 140
 141       if (HP_TIMING_AVAIL)
 142         putchar ('\n');
 143
 144       memcpy (buf1 + idx, tmpbuf, len);
 145     }
 146 }
 147
 148
 149 static const char *const strs[] =
 150   {
 151     "00000", "00112233", "0123456789", "0000111100001111",
 152     "00000111110000022222", "012345678901234567890",
 153     "abc0", "aaaa0", "abcabc0"
 154   };
 155
 156
 157 int
 158 test_main (void)
 159 {
 160   size_t i;
 161
 162   test_init ();
 163
 164   printf ("%23s", "");
 165   FOR_EACH_IMPL (impl, 0)
 166     printf ("\t%s", impl->name);
 167   putchar ('\n');
 168
 169   for (i = 0; i < BUF1PAGES * page_size; ++i)
 170     buf1[i] = 60 + random () % 32;
 171
 172   for (i = 0; i < sizeof (strs) / sizeof (strs[0]); ++i)
 173     for (size_t j = 0; j < 120; j += 7)
 174       {
 175         size_t len = strlen (strs[i]);
 176
 177         do_test (strs[i], len, j);
 178       }
 179
 180   do_random_tests ();
 181   return ret;
 182 }
 183
 184 #include "../test-skeleton.c"