Back to index

glibc  2.9
Defines | Typedefs | Functions
test-strncpy.c File Reference
#include "../test-skeleton.c"
#include "test-string.h"
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines

#define STRNCPY_RESULT(dst, len, n)   dst
#define TEST_MAIN

Typedefs

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

Functions

char * simple_strncpy (char *, const char *, size_t)
char * stupid_strncpy (char *, const char *, size_t)
static void do_one_test (impl_t *impl, char *dst, const char *src, size_t len, size_t n)
static void do_test (size_t align1, size_t align2, size_t len, size_t n, int max_char)
static void do_random_tests (void)
int test_main (void)

Define Documentation

#define STRNCPY_RESULT (   dst,
  len,
  n 
)    dst

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

#define TEST_MAIN

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


Typedef Documentation

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

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


Function Documentation

static void do_one_test ( impl_t impl,
char *  dst,
const char *  src,
size_t  len,
size_t  n 
) [static]

Definition at line 64 of file test-strncpy.c.

{
  if (CALL (impl, dst, src, n) != STRNCPY_RESULT (dst, len, n))
    {
      error (0, 0, "Wrong result in function %s %p %p", impl->name,
            CALL (impl, dst, src, n), dst);
      ret = 1;
      return;
    }

  if (memcmp (dst, src, len > n ? n : len) != 0)
    {
      error (0, 0, "Wrong result in function %s", impl->name);
      ret = 1;
      return;
    }

  if (n > len)
    {
      size_t i;

      for (i = len; i < n; ++i)
       if (dst [i] != '\0')
         {
           error (0, 0, "Wrong result in function %s", impl->name);
           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, dst, src, n);
         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 147 of file test-strncpy.c.

{
  size_t i, j, n, align1, align2, len, size, mode;
  unsigned char *p1 = buf1 + page_size - 512;
  unsigned char *p2 = buf2 + page_size - 512;
  unsigned char *res;

  for (n = 0; n < ITERATIONS; n++)
    {
      mode = random ();
      if (mode & 1)
       {
         size = random () & 255;
         align1 = 512 - size - (random () & 15);
         if (mode & 2)
           align2 = align1 - (random () & 24);
         else
           align2 = align1 - (random () & 31);
         if (mode & 4)
           {
             j = align1;
             align1 = align2;
             align2 = j;
           }
         if (mode & 8)
           len = size - (random () & 31);
         else
           len = 512;
         if (len >= 512)
           len = random () & 511;
       }
      else
       {
         align1 = random () & 31;
         if (mode & 2)
           align2 = random () & 31;
         else
           align2 = align1 + (random () & 24);
         len = random () & 511;
         j = align1;
         if (align2 > j)
           j = align2;
         if (mode & 4)
           {
             size = random () & 511;
             if (size + j > 512)
              size = 512 - j - (random() & 31);
           }
         else
           size = 512 - j;
         if ((mode & 8) && len + j >= 512)
           len = 512 - j - (random () & 7);
       }
      j = len + align1 + 64;
      if (j > 512)
       j = 512;
      for (i = 0; i < j; i++)
       {
         if (i == len + align1)
           p1[i] = 0;
         else
           {
             p1[i] = random () & 255;
             if (i >= align1 && i < len + align1 && !p1[i])
              p1[i] = (random () & 127) + 3;
           }
       }

      FOR_EACH_IMPL (impl, 1)
       {
         memset (p2 - 64, '\1', 512 + 64);
         res = (unsigned char *) CALL (impl,
                                   (char *) (p2 + align2),
                                   (char *) (p1 + align1), size);
         if (res != STRNCPY_RESULT (p2 + align2, len, size))
           {
             error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd) %p != %p",
                   n, impl->name, align1, align2, len, res,
                   STRNCPY_RESULT (p2 + align2, len, size));
             ret = 1;
           }
         for (j = 0; j < align2 + 64; ++j)
           {
             if (p2[j - 64] != '\1')
              {
                error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd)",
                      n, impl->name, align1, align2, len);
                ret = 1;
                break;
              }
           }
         j = align2 + len + 1;
         if (size + align2 > j)
           j = size + align2;
         for (; j < 512; ++j)
           {
             if (p2[j] != '\1')
              {
                error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd)",
                      n, impl->name, align1, align2, len);
                ret = 1;
                break;
              }
           }
         for (j = align2 + len + 1; j < align2 + size; ++j)
           if (p2[j])
             {
              error (0, 0, "Iteration %zd - garbage after size, %s (%zd, %zd, %zd)",
                     n, impl->name, align1, align2, len);
              ret = 1;
              break;
             }
         j = len + 1;
         if (size < j)
           j = size;
         if (memcmp (p1 + align1, p2 + align2, j))
           {
             error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
                   n, impl->name, align1, align2, len);
             ret = 1;
           }
       }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void do_test ( size_t  align1,
size_t  align2,
size_t  len,
size_t  n,
int  max_char 
) [static]

Definition at line 114 of file test-strncpy.c.

{
  size_t i;
  char *s1, *s2;

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

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

  s1 = (char *) (buf1 + align1);
  s2 = (char *) (buf2 + align2);

  for (i = 0; i < len; ++i)
    s1[i] = 32 + 23 * i % (max_char - 32);
  s1[len] = 0;
  for (i = len + 1; i + align1 < page_size && i < len + 64; ++i)
    s1[i] = 32 + 32 * i % (max_char - 32);

  if (HP_TIMING_AVAIL)
    printf ("Length %4zd, n %4zd, alignment %2zd/%2zd:", len, n, align1, align2);

  FOR_EACH_IMPL (impl, 0)
    do_one_test (impl, s2, s1, len, n);

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

Here is the call graph for this function:

char * simple_strncpy ( char *  dst,
const char *  src,
size_t  n 
)

Definition at line 34 of file test-strncpy.c.

{
  char *ret = dst;
  while (n--)
    if ((*dst++ = *src++) == '\0')
      {
       while (n--)
         *dst++ = '\0';
       return ret;
      }
  return ret;
}
char * stupid_strncpy ( char *  dst,
const char *  src,
size_t  n 
)

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

{
  size_t nc = strnlen (src, n);
  size_t i;

  for (i = 0; i < nc; ++i)
    dst[i] = src[i];
  for (; i < n; ++i)
    dst[i] = '\0';
  return dst;
}
int test_main ( void  )

Definition at line 273 of file test-strncpy.c.

{
  size_t i;

  test_init ();

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

  for (i = 1; i < 8; ++i)
    {
      do_test (i, i, 16, 16, 127);
      do_test (i, i, 16, 16, 255);
      do_test (i, 2 * i, 16, 16, 127);
      do_test (2 * i, i, 16, 16, 255);
      do_test (8 - i, 2 * i, 1 << i, 2 << i, 127);
      do_test (2 * i, 8 - i, 2 << i, 1 << i, 127);
      do_test (8 - i, 2 * i, 1 << i, 2 << i, 255);
      do_test (2 * i, 8 - i, 2 << i, 1 << i, 255);
    }

  for (i = 1; i < 8; ++i)
    {
      do_test (0, 0, 4 << i, 8 << i, 127);
      do_test (0, 0, 16 << i, 8 << i, 127);
      do_test (8 - i, 2 * i, 4 << i, 8 << i, 127);
      do_test (8 - i, 2 * i, 16 << i, 8 << i, 127);
    }

  do_random_tests ();
  return ret;
}

Here is the call graph for this function: