|
|
1.1 root 1: /*
2: * Copyright (c) 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #include <sys/stdc.h>
21: #include <string.h>
22:
23: #if defined(LIBC_SCCS) && !defined(lint)
24: static const char sccsid[] = "@(#)strcasecmp.c 5.9 (Berkeley) 6/1/90";
25: #endif /* LIBC_SCCS and not lint */
26:
27: typedef unsigned char u_char;
28:
29: /*
30: * This array is designed for mapping upper and lower case letter
31: * together for a case independent comparison. The mappings are
32: * based upon ascii character sequences.
33: */
34: static const u_char charmap[] = {
35: '\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007',
36: '\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017',
37: '\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027',
38: '\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037',
39: '\040', '\041', '\042', '\043', '\044', '\045', '\046', '\047',
40: '\050', '\051', '\052', '\053', '\054', '\055', '\056', '\057',
41: '\060', '\061', '\062', '\063', '\064', '\065', '\066', '\067',
42: '\070', '\071', '\072', '\073', '\074', '\075', '\076', '\077',
43: '\100', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
44: '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
45: '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
46: '\170', '\171', '\172', '\133', '\134', '\135', '\136', '\137',
47: '\140', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
48: '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
49: '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
50: '\170', '\171', '\172', '\173', '\174', '\175', '\176', '\177',
51: '\200', '\201', '\202', '\203', '\204', '\205', '\206', '\207',
52: '\210', '\211', '\212', '\213', '\214', '\215', '\216', '\217',
53: '\220', '\221', '\222', '\223', '\224', '\225', '\226', '\227',
54: '\230', '\231', '\232', '\233', '\234', '\235', '\236', '\237',
55: '\240', '\241', '\242', '\243', '\244', '\245', '\246', '\247',
56: '\250', '\251', '\252', '\253', '\254', '\255', '\256', '\257',
57: '\260', '\261', '\262', '\263', '\264', '\265', '\266', '\267',
58: '\270', '\271', '\272', '\273', '\274', '\275', '\276', '\277',
59: '\300', '\301', '\302', '\303', '\304', '\305', '\306', '\307',
60: '\310', '\311', '\312', '\313', '\314', '\315', '\316', '\317',
61: '\320', '\321', '\322', '\323', '\324', '\325', '\326', '\327',
62: '\330', '\331', '\332', '\333', '\334', '\335', '\336', '\337',
63: '\340', '\341', '\342', '\343', '\344', '\345', '\346', '\347',
64: '\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357',
65: '\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367',
66: '\370', '\371', '\372', '\373', '\374', '\375', '\376', '\377',
67: };
68:
69: int
70: strcasecmp(s1, s2)
71: const char *s1, *s2;
72: {
73: register const u_char *cm = charmap,
74: *us1 = (const u_char *)s1,
75: *us2 = (const u_char *)s2;
76:
77: while (cm[*us1] == cm[*us2++])
78: if (*us1++ == '\0')
79: return (0);
80: return (cm[*us1] - cm[*--us2]);
81: }
82:
83: int
84: strncasecmp(s1, s2, n)
85: const char *s1, *s2;
86: register size_t n;
87: {
88: if (n != 0) {
89: register const u_char *cm = charmap,
90: *us1 = (const u_char *)s1,
91: *us2 = (const u_char *)s2;
92:
93: do {
94: if (cm[*us1] != cm[*us2++])
95: return (cm[*us1] - cm[*--us2]);
96: if (*us1++ == '\0')
97: break;
98: } while (--n != 0);
99: }
100: return (0);
101: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.