Back to index

glibc  2.9
Defines | Typedefs | Functions
test-strcmp.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 int(* proto_t )(const char *, const char *)

Functions

int simple_strcmp (const char *, const char *)
int stupid_strcmp (const char *, const char *)
static void do_one_test (impl_t *impl, const char *s1, const char *s2, int exp_result)
static void do_test (size_t align1, size_t align2, size_t len, int max_char, int exp_result)
static void do_random_tests (void)
int test_main (void)

Define Documentation

#define TEST_MAIN

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


Typedef Documentation

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

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


Function Documentation

static void do_one_test ( impl_t impl,
const char *  s1,
const char *  s2,
int  exp_result 
) [static]

Definition at line 56 of file test-strcmp.c.

{
  int result = CALL (impl, s1, s2);
  if ((exp_result == 0 && result != 0)
      || (exp_result < 0 && result >= 0)
      || (exp_result > 0 && result <= 0))
    {
      error (0, 0, "Wrong result in function %s %d %d", impl->name,
            result, exp_result);
      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, s1, s2);
         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 128 of file test-strcmp.c.

{
  size_t i, j, n, align1, align2, pos, len1, len2;
  int result;
  long r;
  unsigned char *p1 = buf1 + page_size - 512;
  unsigned char *p2 = buf2 + page_size - 512;

  for (n = 0; n < ITERATIONS; n++)
    {
      align1 = random () & 31;
      if (random () & 1)
       align2 = random () & 31;
      else
       align2 = align1 + (random () & 24);
      pos = random () & 511;
      j = align1 > align2 ? align1 : align2;
      if (pos + j >= 511)
       pos = 510 - j - (random () & 7);
      len1 = random () & 511;
      if (pos >= len1 && (random () & 1))
        len1 = pos + (random () & 7);
      if (len1 + j >= 512)
        len1 = 511 - j - (random () & 7);
      if (pos >= len1)
       len2 = len1;
      else
       len2 = len1 + (len1 != 511 - j ? random () % (511 - j - len1) : 0);
      j = (pos > len2 ? pos : len2) + align1 + 64;
      if (j > 512)
       j = 512;
      for (i = 0; i < j; ++i)
       {
         p1[i] = random () & 255;
         if (i < len1 + align1 && !p1[i])
           {
             p1[i] = random () & 255;
             if (!p1[i])
              p1[i] = 1 + (random () & 127);
           }
       }
      for (i = 0; i < j; ++i)
       {
         p2[i] = random () & 255;
         if (i < len2 + align2 && !p2[i])
           {
             p2[i] = random () & 255;
             if (!p2[i])
              p2[i] = 1 + (random () & 127);
           }
       }

      result = 0;
      memcpy (p2 + align2, p1 + align1, pos);
      if (pos < len1)
       {
         if (p2[align2 + pos] == p1[align1 + pos])
           {
             p2[align2 + pos] = random () & 255;
             if (p2[align2 + pos] == p1[align1 + pos])
              p2[align2 + pos] = p1[align1 + pos] + 3 + (random () & 127);
           }

         if (p1[align1 + pos] < p2[align2 + pos])
           result = -1;
         else
           result = 1;
       }
      p1[len1 + align1] = 0;
      p2[len2 + align2] = 0;

      FOR_EACH_IMPL (impl, 1)
       {
         r = CALL (impl, (char *) (p1 + align1), (char *) (p2 + align2));
         /* Test whether on 64-bit architectures where ABI requires
            callee to promote has the promotion been done.  */
         asm ("" : "=g" (r) : "0" (r));
         if ((r == 0 && result)
             || (r < 0 && result >= 0)
             || (r > 0 && result <= 0))
           {
             error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %zd) %ld != %d, p1 %p p2 %p",
                   n, impl->name, align1, align2, len1, len2, pos, r, result, p1, p2);
             ret = 1;
           }
       }
    }
}

Here is the caller graph for this function:

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

Definition at line 89 of file test-strcmp.c.

{
  size_t i;
  char *s1, *s2;

  if (len == 0)
    return;

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

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

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

  for (i = 0; i < len; i++)
    s1[i] = s2[i] = 1 + 23 * i % max_char;

  s1[len] = s2[len] = 0;
  s1[len + 1] = 23;
  s2[len + 1] = 24 + exp_result;
  s2[len - 1] -= exp_result;

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

  FOR_EACH_IMPL (impl, 0)
    do_one_test (impl, s1, s2, exp_result);

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

Here is the call graph for this function:

int simple_strcmp ( const char *  s1,
const char *  s2 
)

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

{
  int ret;

  while ((ret = *(unsigned char *) s1 - *(unsigned char *) s2++) == 0
        && *s1++);
  return ret;
}
int stupid_strcmp ( const char *  s1,
const char *  s2 
)

Definition at line 43 of file test-strcmp.c.

{
  size_t ns1 = strlen (s1) + 1, ns2 = strlen (s2) + 1;
  size_t n = ns1 < ns2 ? ns1 : ns2;
  int ret = 0;

  while (n--)
    if ((ret = *(unsigned char *) s1++ - *(unsigned char *) s2++) != 0)
      break;
  return ret;
}

Here is the call graph for this function:

int test_main ( void  )

Definition at line 218 of file test-strcmp.c.

{
  size_t i;

  test_init ();

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

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

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

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

  do_random_tests ();
  return ret;
}

Here is the call graph for this function: