]>
Commit | Line | Data |
---|---|---|
5b2abdfb | 1 | /*- |
1f2f436a | 2 | * Copyright (c) 2009 David Schultz <das@FreeBSD.org> |
5b2abdfb A |
3 | * 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 | * | |
14 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND | |
15 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
16 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
17 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
18 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
19 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
20 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
21 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
22 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
23 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
24 | * SUCH DAMAGE. | |
5b2abdfb | 25 | */ |
5b2abdfb | 26 | |
9385eb3d | 27 | #include <sys/cdefs.h> |
1f2f436a | 28 | __FBSDID("$FreeBSD: src/lib/libc/string/wcsncasecmp.c,v 1.1 2009/02/28 06:00:58 das Exp $"); |
5b2abdfb | 29 | |
1f2f436a A |
30 | #include <wchar.h> |
31 | #include <wctype.h> | |
32 | ||
33 | int | |
34 | wcsncasecmp(const wchar_t *s1, const wchar_t *s2, size_t n) | |
35 | { | |
36 | wchar_t c1, c2; | |
37 | ||
38 | if (n == 0) | |
39 | return (0); | |
40 | for (; *s1; s1++, s2++) { | |
41 | c1 = towlower(*s1); | |
42 | c2 = towlower(*s2); | |
43 | if (c1 != c2) | |
44 | return ((int)c1 - c2); | |
45 | if (--n == 0) | |
46 | return (0); | |
47 | } | |
48 | return (-*s2); | |
49 | } |