blob: 3828164e48e898eb1b02a73a7e8cce409b540401 [file] [log] [blame]
Chet Ramey495aee42011-11-22 19:11:26 -05001/* mbscasecmp - case-insensitive multibyte string comparison. */
2
3/* Copyright (C) 2009 Free Software Foundation, Inc.
4
5 This file is part of GNU Bash, the Bourne Again SHell.
6
7 Bash is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
11
12 Bash is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with Bash. If not, see <http://www.gnu.org/licenses/>.
19*/
20
21#include <config.h>
22
23#if !defined (HAVE_MBSCASECMP) && defined (HANDLE_MULTIBYTE)
24
25#include <stdlib.h>
26#include <stddef.h>
27#include <string.h>
28
29#include <wchar.h>
30#include <wctype.h>
31
32/* Compare MBS1 and MBS2 without regard to case. */
33int
34mbscasecmp (mbs1, mbs2)
35 const char *mbs1;
36 const char *mbs2;
37{
38 int len1, len2;
39 wchar_t c1, c2, l1, l2;
40
41 len1 = len2 = 0;
42 /* Reset multibyte characters to their initial state. */
43 (void) mblen ((char *) NULL, 0);
44
45 do
46 {
47 len1 = mbtowc (&c1, mbs1, MB_CUR_MAX);
48 len2 = mbtowc (&c2, mbs2, MB_CUR_MAX);
49
50 if (len1 == 0)
51 return len2 == 0 ? 0 : -1;
52 else if (len2 == 0)
53 return 1;
54 else if (len1 > 0 && len2 < 0)
55 return -1;
56 else if (len1 < 0 && len2 > 0)
57 return 1;
58 else if (len1 < 0 && len2 < 0)
59 {
60 len1 = strlen (mbs1);
61 len2 = strlen (mbs2);
62 return (len1 == len2 ? memcmp (mbs1, mbs2, len1)
63 : ((len1 < len2) ? (memcmp (mbs1, mbs2, len1) > 0 ? 1 : -1)
64 : (memcmp (mbs1, mbs2, len2) >= 0 ? 1 : -1)));
65 }
66
67 l1 = towlower (c1);
68 l2 = towlower (c2);
69
70 mbs1 += len1;
71 mbs2 += len2;
72 }
73 while (l1 == l2);
74
75 return l1 - l2;
76}
77
78#endif