1/* strncasecmp.c -- case insensitive string comparator
2   Copyright (C) 1998, 1999, 2005, 2006, 2007, 2009 Free Software
3   Foundation, Inc.
4
5   This program is free software; you can redistribute it and/or modify
6   it under the terms of the GNU General Public License as published by
7   the Free Software Foundation; either version 3, or (at your option)
8   any later version.
9
10   This program is distributed in the hope that it will be useful,
11   but WITHOUT ANY WARRANTY; without even the implied warranty of
12   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13   GNU General Public License for more details.
14
15   You should have received a copy of the GNU General Public License
16   along with this program; if not, write to the Free Software Foundation,
17   Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.  */
18
19#include <config.h>
20
21/* Specification.  */
22#include <string.h>
23
24#include <ctype.h>
25#include <limits.h>
26
27#define TOLOWER(Ch) (isupper (Ch) ? tolower (Ch) : (Ch))
28
29/* Compare no more than N bytes of strings S1 and S2, ignoring case,
30   returning less than, equal to or greater than zero if S1 is
31   lexicographically less than, equal to or greater than S2.
32   Note: This function cannot work correctly in multibyte locales.  */
33
34int
35strncasecmp (const char *s1, const char *s2, size_t n)
36{
37  register const unsigned char *p1 = (const unsigned char *) s1;
38  register const unsigned char *p2 = (const unsigned char *) s2;
39  unsigned char c1, c2;
40
41  if (p1 == p2 || n == 0)
42    return 0;
43
44  do
45    {
46      c1 = TOLOWER (*p1);
47      c2 = TOLOWER (*p2);
48
49      if (--n == 0 || c1 == '\0')
50	break;
51
52      ++p1;
53      ++p2;
54    }
55  while (c1 == c2);
56
57  if (UCHAR_MAX <= INT_MAX)
58    return c1 - c2;
59  else
60    /* On machines where 'char' and 'int' are types of the same size, the
61       difference of two 'unsigned char' values - including the sign bit -
62       doesn't fit in an 'int'.  */
63    return (c1 > c2 ? 1 : c1 < c2 ? -1 : 0);
64}
65