benchtests/bench-strcasestr.c

   1 /* Measure strcasestr functions.
   2    Copyright (C) 2013 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4
   5    The GNU C Library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Lesser General Public
   7    License as published by the Free Software Foundation; either
   8    version 2.1 of the License, or (at your option) any later version.
   9
  10    The GNU C Library 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 GNU
  13    Lesser General Public License for more details.
  14
  15    You should have received a copy of the GNU Lesser General Public
  16    License along with the GNU C Library; if not, see
  17    <http://www.gnu.org/licenses/>.  */
  18
  19 #define TEST_MAIN
  20 #define TEST_NAME "strcasestr"
  21 #include "bench-string.h"
  22
  23
  24 #define STRCASESTR simple_strcasestr
  25 #define NO_ALIAS
  26 #define __strncasecmp strncasecmp
  27 #include "../string/strcasestr.c"
  28
  29
  30 static char *
  31 stupid_strcasestr (const char *s1, const char *s2)
  32 {
  33   ssize_t s1len = strlen (s1);
  34   ssize_t s2len = strlen (s2);
  35
  36   if (s2len > s1len)
  37     return NULL;
  38
  39   for (ssize_t i = 0; i <= s1len - s2len; ++i)
  40     {
  41       size_t j;
  42       for (j = 0; j < s2len; ++j)
  43         if (tolower (s1[i + j]) != tolower (s2[j]))
  44           break;
  45       if (j == s2len)
  46         return (char *) s1 + i;
  47     }
  48
  49   return NULL;
  50 }
  51
  52
  53 typedef char *(*proto_t) (const char *, const char *);
  54
  55 IMPL (stupid_strcasestr, 0)
  56 IMPL (simple_strcasestr, 0)
  57 IMPL (strcasestr, 1)
  58
  59
  60 static void
  61 do_one_test (impl_t *impl, const char *s1, const char *s2, char *exp_result)
  62 {
  63   if (HP_TIMING_AVAIL)
  64     {
  65       hp_timing_t start __attribute ((unused));
  66       hp_timing_t stop __attribute ((unused));
  67       hp_timing_t best_time = ~(hp_timing_t) 0;
  68       size_t i;
  69
  70       for (i = 0; i < 32; ++i)
  71         {
  72           HP_TIMING_NOW (start);
  73           CALL (impl, s1, s2);
  74           HP_TIMING_NOW (stop);
  75           HP_TIMING_BEST (best_time, start, stop);
  76         }
  77
  78       printf ("\t%zd", (size_t) best_time);
  79     }
  80 }
  81
  82
  83 static void
  84 do_test (size_t align1, size_t align2, size_t len1, size_t len2,
  85          int fail)
  86 {
  87   char *s1 = (char *) (buf1 + align1);
  88   char *s2 = (char *) (buf2 + align2);
  89
  90   static const char d[] = "1234567890abcxyz";
  91 #define dl (sizeof (d) - 1)
  92   char *ss2 = s2;
  93   for (size_t l = len2; l > 0; l = l > dl ? l - dl : 0)
  94     {
  95       size_t t = l > dl ? dl : l;
  96       ss2 = mempcpy (ss2, d, t);
  97     }
  98   s2[len2] = '\0';
  99
 100   if (fail)
 101     {
 102       char *ss1 = s1;
 103       for (size_t l = len1; l > 0; l = l > dl ? l - dl : 0)
 104         {
 105           size_t t = l > dl ? dl : l;
 106           memcpy (ss1, d, t);
 107           ++ss1[len2 > 7 ? 7 : len2 - 1];
 108           ss1 += t;
 109         }
 110     }
 111   else
 112     {
 113       memset (s1, '0', len1);
 114       for (size_t i = 0; i < len2; ++i)
 115         s1[len1 - len2 + i] = toupper (s2[i]);
 116     }
 117   s1[len1] = '\0';
 118
 119   if (HP_TIMING_AVAIL)
 120     printf ("Length %4zd/%zd, alignment %2zd/%2zd, %s:",
 121             len1, len2, align1, align2, fail ? "fail" : "found");
 122
 123   FOR_EACH_IMPL (impl, 0)
 124     do_one_test (impl, s1, s2, fail ? NULL : s1 + len1 - len2);
 125
 126   if (HP_TIMING_AVAIL)
 127     putchar ('\n');
 128 }
 129
 130 static int
 131 test_main (void)
 132 {
 133   test_init ();
 134
 135   printf ("%23s", "");
 136   FOR_EACH_IMPL (impl, 0)
 137     printf ("\t%s", impl->name);
 138   putchar ('\n');
 139
 140   for (size_t klen = 2; klen < 32; ++klen)
 141     for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen)
 142       {
 143         do_test (0, 0, hlen, klen, 0);
 144         do_test (0, 0, hlen, klen, 1);
 145         do_test (0, 3, hlen, klen, 0);
 146         do_test (0, 3, hlen, klen, 1);
 147         do_test (0, 9, hlen, klen, 0);
 148         do_test (0, 9, hlen, klen, 1);
 149         do_test (0, 15, hlen, klen, 0);
 150         do_test (0, 15, hlen, klen, 1);
 151
 152         do_test (3, 0, hlen, klen, 0);
 153         do_test (3, 0, hlen, klen, 1);
 154         do_test (3, 3, hlen, klen, 0);
 155         do_test (3, 3, hlen, klen, 1);
 156         do_test (3, 9, hlen, klen, 0);
 157         do_test (3, 9, hlen, klen, 1);
 158         do_test (3, 15, hlen, klen, 0);
 159         do_test (3, 15, hlen, klen, 1);
 160
 161         do_test (9, 0, hlen, klen, 0);
 162         do_test (9, 0, hlen, klen, 1);
 163         do_test (9, 3, hlen, klen, 0);
 164         do_test (9, 3, hlen, klen, 1);
 165         do_test (9, 9, hlen, klen, 0);
 166         do_test (9, 9, hlen, klen, 1);
 167         do_test (9, 15, hlen, klen, 0);
 168         do_test (9, 15, hlen, klen, 1);
 169
 170         do_test (15, 0, hlen, klen, 0);
 171         do_test (15, 0, hlen, klen, 1);
 172         do_test (15, 3, hlen, klen, 0);
 173         do_test (15, 3, hlen, klen, 1);
 174         do_test (15, 9, hlen, klen, 0);
 175         do_test (15, 9, hlen, klen, 1);
 176         do_test (15, 15, hlen, klen, 0);
 177         do_test (15, 15, hlen, klen, 1);
 178       }
 179
 180   do_test (0, 0, page_size - 1, 16, 0);
 181   do_test (0, 0, page_size - 1, 16, 1);
 182
 183   return ret;
 184 }
 185
 186 #include "../test-skeleton.c"