Back to index

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

Go to the source code of this file.

Defines

#define TEST_MAIN

Typedefs

typedef size_t(* proto_t )(const char *)

Functions

size_t simple_strlen (const char *)
size_t builtin_strlen (const char *)
static void do_one_test (impl_t *impl, const char *s, size_t exp_len)
static void do_test (size_t align, size_t len, int max_char)
static void do_random_tests (void)
int test_main (void)

Define Documentation

#define TEST_MAIN

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


Typedef Documentation

typedef size_t(* proto_t)(const char *)

Definition at line 24 of file test-strlen.c.


Function Documentation

size_t builtin_strlen ( const char *  p)

Definition at line 42 of file test-strlen.c.

{
  return __builtin_strlen (p);
}
static void do_one_test ( impl_t impl,
const char *  s,
size_t  exp_len 
) [static]

Definition at line 48 of file test-strlen.c.

{
  size_t len = CALL (impl, s);
  if (len != exp_len)
    {
      error (0, 0, "Wrong result in function %s %zd %zd", impl->name,
            len, exp_len);
      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, s);
         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 102 of file test-strlen.c.

{
  size_t i, j, n, align, len;
  unsigned char *p = buf1 + page_size - 512;

  for (n = 0; n < ITERATIONS; n++)
    {
      align = random () & 15;
      len = random () & 511;
      if (len + align > 510)
       len = 511 - align - (random () & 7);
      j = len + align + 64;
      if (j > 512)
       j = 512;

      for (i = 0; i < j; i++)
       {
         if (i == len + align)
           p[i] = 0;
         else
           {
             p[i] = random () & 255;
             if (i >= align && i < len + align && !p[i])
              p[i] = (random () & 127) + 1;
           }
       }

      FOR_EACH_IMPL (impl, 1)
       if (CALL (impl, (char *) (p + align)) != len)
         {
           error (0, 0, "Iteration %zd - wrong result in function %s (%zd) %zd != %zd, p %p",
                 n, impl->name, align, CALL (impl, (char *) (p + align)),
                 len, p);
           ret = 1;
         }
    }
}

Here is the caller graph for this function:

static void do_test ( size_t  align,
size_t  len,
int  max_char 
) [static]

Definition at line 79 of file test-strlen.c.

{
  size_t i;

  align &= 7;
  if (align + len >= page_size)
    return;

  for (i = 0; i < len; ++i)
    buf1[align + i] = 1 + 7 * i % max_char;
  buf1[align + len] = 0;

  if (HP_TIMING_AVAIL)
    printf ("Length %4zd, alignment %2zd:", len, align);

  FOR_EACH_IMPL (impl, 0)
    do_one_test (impl, (char *) (buf1 + align), len);

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

Here is the call graph for this function:

size_t simple_strlen ( const char *  s)

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

{
  const char *p;

  for (p = s; *p; ++p);
  return p - s;
}
int test_main ( void  )

Definition at line 141 of file test-strlen.c.

{
  size_t i;

  test_init ();

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

  for (i = 1; i < 8; ++i)
    do_test (0, i, 127);

  for (i = 1; i < 8; ++i)
    do_test (i, i, 127);

  for (i = 2; i <= 10; ++i)
    {
      do_test (0, 1 << i, 127);
      do_test (1, 1 << i, 127);
    }

  for (i = 1; i < 8; ++i)
    do_test (0, i, 255);

  for (i = 1; i < 8; ++i)
    do_test (i, i, 255);

  for (i = 2; i <= 10; ++i)
    {
      do_test (0, 1 << i, 255);
      do_test (1, 1 << i, 255);
    }

  do_random_tests ();
  return ret;
}

Here is the call graph for this function: