Aren
/
NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Make this at least work for ASCII strings (there are way more users 

than libcurses in various crunched environments, so the original assumption
of a very limited set of inputs was wrong).
This commit is contained in:
martin 2019-08-12 09:34:53 +00:00
parent 95a0c42074
commit 92d9c20449
1 changed files with 14 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
distrib/utils/libhack/strcasecmp.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: strcasecmp.c,v 1.1 2019/07/28 10:21:18 martin Exp $ */ /* $NetBSD: strcasecmp.c,v 1.2 2019/08/12 09:34:53 martin Exp $ */
/* /*
* Written by Martin Husemann <martin@NetBSD.org> * Written by Martin Husemann <martin@NetBSD.org>
@ -8,13 +8,21 @@
#include <strings.h> #include <strings.h>
/* /*
* Cheap and dirty strcasecmp() - implements just enough * Simple strcasecmp, try to avoid pulling in real locales
* for our libcurses in crunched environments: since we
* know all compared strings are fixed, uppercase, and plain ASCII,
* just use strcmp()
*/ */
int int
strcasecmp(const char *s1, const char *s2) strcasecmp(const char *s1, const char *s2)
{ {
return strcmp(s1, s2); unsigned int c1, c2;
do {
c1 = *s1++;
c2 = *s2++;
if (c1 >= 'A' && c1 <= 'Z')
c1 += 'a' - 'A';
if (c2 >= 'A' && c2 <= 'Z')
c2 += 'a' - 'A';
} while (c1 == c2 && c1 != 0 && c2 != 0);
return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1));
} }