Subversion Repositories or1k

_DEFUN (strncmp, (s1, s2, n),

_DEFUN (strncmp, (s1, s2, n),

        _CONST char *s1 _AND

        _CONST char *s1 _AND

        _CONST char *s2 _AND

        _CONST char *s2 _AND

        size_t n)

        size_t n)

{

{

  if (n == 0)

  if (n == 0)

    return 0;

    return 0;

  while (n-- != 0 && *s1 == *s2)

  while (n-- != 0 && *s1 == *s2)

    {

    {

        break;

        break;

      s1++;

      s1++;

      s2++;

      s2++;

    }

    }

  if (n == 0)

  if (n == 0)

    return 0;

    return 0;

  /* If s1 or s2 are unaligned, then compare bytes. */

  /* If s1 or s2 are unaligned, then compare bytes. */

        {

        {

  /* If s1 and s2 are word-aligned, compare them a word at a time. */

  /* If s1 and s2 are word-aligned, compare them a word at a time. */

  a1 = (unsigned long*)s1;

  a1 = (unsigned long*)s1;

  a2 = (unsigned long*)s2;

  a2 = (unsigned long*)s2;

  while (n >= sizeof (long) && *a1 == *a2)

  while (n >= sizeof (long) && *a1 == *a2)

    {

    {

    }

    }

  /* A difference was detected in last few bytes of s1, so search bytewise */

  /* A difference was detected in last few bytes of s1, so search bytewise */

  s1 = (char*)a1;

  s1 = (char*)a1;

  s2 = (char*)a2;

  s2 = (char*)a2;

  while (n-- > 0 && *s1 == *s2)

  while (n-- > 0 && *s1 == *s2)

    {

    {

      /* If we've run out of bytes or hit a null, return zero

      /* If we've run out of bytes or hit a null, return zero

         since we already know *s1 == *s2.  */

         since we already know *s1 == *s2.  */