|
1.1.20
by Timo Aaltonen
Import upstream version 1.5.99.3 |
1 |
/*
|
2 |
* Copyright (c) 1987, 1993
|
|
3 |
* The Regents of the University of California. All rights reserved.
|
|
4 |
*
|
|
5 |
* Redistribution and use in source and binary forms, with or without
|
|
6 |
* modification, are permitted provided that the following conditions
|
|
7 |
* are met:
|
|
8 |
* 1. Redistributions of source code must retain the above copyright
|
|
9 |
* notice, this list of conditions and the following disclaimer.
|
|
10 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
11 |
* notice, this list of conditions and the following disclaimer in the
|
|
12 |
* documentation and/or other materials provided with the distribution.
|
|
13 |
* 4. Neither the name of the University nor the names of its contributors
|
|
14 |
* may be used to endorse or promote products derived from this software
|
|
15 |
* without specific prior written permission.
|
|
16 |
*
|
|
17 |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
18 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
19 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
20 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
21 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
22 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
23 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
24 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
25 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
26 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
27 |
* SUCH DAMAGE.
|
|
28 |
*/
|
|
29 |
||
30 |
#ifdef HAVE_DIX_CONFIG_H
|
|
31 |
#include <dix-config.h> |
|
32 |
#endif
|
|
33 |
||
34 |
#include <ctype.h> |
|
35 |
#include "dix.h" |
|
36 |
||
37 |
#ifdef NEED_STRCASECMP
|
|
38 |
int
|
|
39 |
xstrcasecmp(const char *str1, const char *str2) |
|
40 |
{
|
|
41 |
const u_char *us1 = (const u_char *)str1, *us2 = (const u_char *)str2; |
|
42 |
||
43 |
while (tolower(*us1) == tolower(*us2)) { |
|
44 |
if (*us1++ == '\0') |
|
45 |
return (0); |
|
46 |
us2++; |
|
47 |
}
|
|
48 |
||
49 |
return (tolower(*us1) - tolower(*us2)); |
|
50 |
}
|
|
51 |
#endif
|
|
52 |
||
53 |
#ifdef NEED_STRNCASECMP
|
|
54 |
int
|
|
55 |
xstrncasecmp(const char *s1, const char *s2, size_t n) |
|
56 |
{
|
|
57 |
if (n != 0) { |
|
58 |
const u_char *us1 = (const u_char *)s1, *us2 = (const u_char *)s2; |
|
59 |
||
60 |
do { |
|
61 |
if (tolower(*us1) != tolower(*us2++)) |
|
62 |
return (tolower(*us1) - tolower(*--us2)); |
|
63 |
if (*us1++ == '\0') |
|
64 |
break; |
|
65 |
} while (--n != 0); |
|
66 |
}
|
|
67 |
||
68 |
return 0; |
|
69 |
}
|
|
70 |
#endif
|