1 /* Case-insensitive string comparison function. 2 Copyright (C) 1998-1999, 2005-2021 Free Software Foundation, Inc. 3 Written by Bruno Haible <bruno@clisp.org>, 2005, 4 based on earlier glibc code. 5 6 This file is free software: you can redistribute it and/or modify 7 it under the terms of the GNU Lesser General Public License as 8 published by the Free Software Foundation; either version 3 of the 9 License, or (at your option) any later version. 10 11 This file is distributed in the hope that it will be useful, 12 but WITHOUT ANY WARRANTY; without even the implied warranty of 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 GNU Lesser General Public License for more details. 15 16 You should have received a copy of the GNU Lesser General Public License 17 along with this program. If not, see <https://www.gnu.org/licenses/>. */ 18 19 #include <config.h> 20 21 /* Specification. */ 22 #include <string.h> 23 24 #include <ctype.h> 25 #include <limits.h> 26 27 #include "mbuiter.h" 28 29 #define TOLOWER(Ch) (isupper (Ch) ? tolower (Ch) : (Ch)) 30 31 /* Compare the initial segment of the character string S1 consisting of at most 32 N characters with the initial segment of the character string S2 consisting 33 of at most N characters, ignoring case, returning less than, equal to or 34 greater than zero if the initial segment of S1 is lexicographically less 35 than, equal to or greater than the initial segment of S2. 36 Note: This function may, in multibyte locales, return 0 for initial segments 37 of different lengths! */ 38 int 39 mbsncasecmp (const char *s1, const char *s2, size_t n) /* */ 40 { 41 if (s1 == s2 || n == 0) 42 return 0; 43 44 /* Be careful not to look at the entire extent of s1 or s2 until needed. 45 This is useful because when two strings differ, the difference is 46 most often already in the very few first characters. */ 47 if (MB_CUR_MAX > 1) 48 { 49 mbui_iterator_t iter1; 50 mbui_iterator_t iter2; 51 52 mbui_init (iter1, s1); 53 mbui_init (iter2, s2); 54 55 while (mbui_avail (iter1) && mbui_avail (iter2)) 56 { 57 int cmp = mb_casecmp (mbui_cur (iter1), mbui_cur (iter2)); 58 59 if (cmp != 0) 60 return cmp; 61 62 if (--n == 0) 63 return 0; 64 65 mbui_advance (iter1); 66 mbui_advance (iter2); 67 } 68 if (mbui_avail (iter1)) 69 /* s2 terminated before s1 and n. */ 70 return 1; 71 if (mbui_avail (iter2)) 72 /* s1 terminated before s2 and n. */ 73 return -1; 74 return 0; 75 } 76 else 77 { 78 const unsigned char *p1 = (const unsigned char *) s1; 79 const unsigned char *p2 = (const unsigned char *) s2; 80 unsigned char c1, c2; 81 82 for (; ; p1++, p2++) 83 { 84 c1 = TOLOWER (*p1); 85 c2 = TOLOWER (*p2); 86 87 if (--n == 0 || c1 == '\0' || c1 != c2) 88 break; 89 } 90 91 if (UCHAR_MAX <= INT_MAX) 92 return c1 - c2; 93 else 94 /* On machines where 'char' and 'int' are types of the same size, the 95 difference of two 'unsigned char' values - including the sign bit - 96 doesn't fit in an 'int'. */ 97 return _GL_CMP (c1, c2); 98 } 99 }