Back to index

glibc  2.9
Defines | Typedefs | Functions | Variables
test-memmem.c File Reference
#include "test-string.h"
#include "../test-skeleton.c"

Go to the source code of this file.

Defines

#define TEST_MAIN
#define BUF1PAGES   20
#define ITERATIONS   500

Typedefs

typedef char *(* proto_t )(const void *, size_t, const void *, size_t)

Functions

void * simple_memmem (const void *, size_t, const void *, size_t)
static void do_one_test (impl_t *impl, const void *haystack, size_t haystack_len, const void *needle, size_t needle_len, const void *expected)
static void do_test (const char *str, size_t len, size_t idx)
static void do_random_tests (void)
int test_main (void)

Variables

static const char *const strs []

Define Documentation

#define BUF1PAGES   20

Definition at line 22 of file test-memmem.c.

#define ITERATIONS   500

Definition at line 23 of file test-memmem.c.

#define TEST_MAIN

Definition at line 21 of file test-memmem.c.


Typedef Documentation

typedef char*(* proto_t)(const void *, size_t, const void *, size_t)

Definition at line 26 of file test-memmem.c.


Function Documentation

static void do_one_test ( impl_t impl,
const void *  haystack,
size_t  haystack_len,
const void *  needle,
size_t  needle_len,
const void *  expected 
) [static]

Definition at line 61 of file test-memmem.c.

{
  void *res;

  res = CALL (impl, haystack, haystack_len, needle, needle_len);
  if (res != expected)
    {
      error (0, 0, "Wrong result in function %s %p %p", impl->name,
            res, expected);
      ret = 1;
      return;
    }

  if (HP_TIMING_AVAIL)
    {
      hp_timing_t start __attribute ((unused));
      hp_timing_t stop __attribute ((unused));
      hp_timing_t best_time = ~ (hp_timing_t) 0;
      size_t i;

      for (i = 0; i < 32; ++i)
       {
         HP_TIMING_NOW (start);
         CALL (impl, haystack, haystack_len, needle, needle_len);
         HP_TIMING_NOW (stop);
         HP_TIMING_BEST (best_time, start, stop);
       }

      printf ("\t%zd", (size_t) best_time);
    }
}

Here is the call graph for this function:

static void do_random_tests ( void  ) [static]

Definition at line 115 of file test-memmem.c.

{
  for (size_t n = 0; n < ITERATIONS; ++n)
    {
      char tmpbuf[32];

      size_t shift = random () % 11;
      size_t rel = random () % ((2 << (shift + 1)) * 64);
      size_t idx = MIN ((2 << shift) * 64 + rel, BUF1PAGES * page_size - 2);
      size_t len = random () % (sizeof (tmpbuf) - 1) + 1;
      len = MIN (len, BUF1PAGES * page_size - idx - 1);
      memcpy (tmpbuf, buf1 + idx, len);
      for (size_t i = random () % len / 2 + 1; i > 0; --i)
       {
         size_t off = random () % len;
         char ch = '0' + random () % 10;

         buf1[idx + off] = ch;
       }

      if (HP_TIMING_AVAIL)
       printf ("String %.*s, offset %zd:", (int) len, buf1 + idx, idx);

      FOR_EACH_IMPL (impl, 0)
       do_one_test (impl, buf1, BUF1PAGES * page_size, buf1 + idx, len,
                   buf1 + idx);

      if (HP_TIMING_AVAIL)
       putchar ('\n');

      memcpy (buf1 + idx, tmpbuf, len);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void do_test ( const char *  str,
size_t  len,
size_t  idx 
) [static]

Definition at line 95 of file test-memmem.c.

{
  char tmpbuf[len];

  memcpy (tmpbuf, buf1 + idx, len);
  memcpy (buf1 + idx, str, len);

  if (HP_TIMING_AVAIL)
    printf ("String %s, offset %zd:", str, idx);

  FOR_EACH_IMPL (impl, 0)
    do_one_test (impl, buf1, BUF1PAGES * page_size, str, len, buf1 + idx);

  memcpy (buf1 + idx, tmpbuf, len);

  if (HP_TIMING_AVAIL)
    putchar ('\n');
}

Here is the call graph for this function:

void * simple_memmem ( const void *  haystack,
size_t  haystack_len,
const void *  needle,
size_t  needle_len 
)

Definition at line 33 of file test-memmem.c.

{
  const char *begin;
  const char *const last_possible
    = (const char *) haystack + haystack_len - needle_len;

  if (needle_len == 0)
    /* The first occurrence of the empty string is deemed to occur at
       the beginning of the string.  */
    return (void *) haystack;

  /* Sanity check, otherwise the loop might search through the whole
     memory.  */
  if (__builtin_expect (haystack_len < needle_len, 0))
    return NULL;

  for (begin = (const char *) haystack; begin <= last_possible; ++begin)
    if (begin[0] == ((const char *) needle)[0] &&
        !memcmp ((const void *) &begin[1],
                 (const void *) ((const char *) needle + 1),
                 needle_len - 1))
      return (void *) begin;

  return NULL;
}

Here is the call graph for this function:

int test_main ( void  )

Definition at line 159 of file test-memmem.c.

{
  size_t i;

  test_init ();

  printf ("%23s", "");
  FOR_EACH_IMPL (impl, 0)
    printf ("\t%s", impl->name);
  putchar ('\n');

  for (i = 0; i < BUF1PAGES * page_size; ++i)
    buf1[i] = 60 + random () % 32;

  for (i = 0; i < sizeof (strs) / sizeof (strs[0]); ++i)
    for (size_t j = 0; j < 120; j += 7)
      {
       size_t len = strlen (strs[i]);

       do_test (strs[i], len, j);
      }

  do_random_tests ();
  return ret;
}

Here is the call graph for this function:


Variable Documentation

const char* const strs[] [static]
Initial value:
  {
    "00000", "00112233", "0123456789", "0000111100001111",
    "00000111110000022222", "012345678901234567890",
    "abc0", "aaaa0", "abcabc0"
  }

Definition at line 150 of file test-memmem.c.