1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2007 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Case conversion functions for strings. Originally this module only
* dealt with ASCII strings. It has been updated to support European
* character set characters. The current implementation is based on
* code page table lookup rather than simple character range checks.
*/
#ifdef _KERNEL
#include <sys/types.h>
#include <sys/sunddi.h>
#else
#include <stdio.h>
#include <string.h>
#endif
#include <smbsrv/ctype.h>
#include <smbsrv/codepage.h>
#include <smbsrv/cp_cyrillic.h>
#include <smbsrv/cp_latin1.h>
#include <smbsrv/cp_latin2.h>
#include <smbsrv/cp_latin3.h>
#include <smbsrv/cp_latin4.h>
#include <smbsrv/cp_latin5.h>
#include <smbsrv/cp_latin6.h>
#include <smbsrv/cp_usascii.h>
/*
* Global pointer to the current code page. This is
* defaulted to a standard ASCII table.
*/
static codepage_t *current_codepage = usascii_codepage;
/*
* A flag indicating whether the codepage being used is ASCII
* When this flag is set, string opeartions can go faster.
*/
static int is_unicode = 0;
/*
* codepage_isupper
*
* Determine whether or not a character is an uppercase character.
* This function operates on the current codepage table. Returns
* non-zero if the character is uppercase. Otherwise returns zero.
*/
int
codepage_isupper(int c)
{
unsigned short mask = is_unicode ? 0xffff : 0xff;
return (current_codepage[c & mask].ctype & CODEPAGE_ISUPPER);
}
/*
* codepage_islower
*
* Determine whether or not a character is an lowercase character.
* This function operates on the current codepage table. Returns
* non-zero if the character is lowercase. Otherwise returns zero.
*/
int
codepage_islower(int c)
{
unsigned short mask = is_unicode ? 0xffff : 0xff;
return (current_codepage[c & mask].ctype & CODEPAGE_ISLOWER);
}
/*
* codepage_toupper
*
* Convert individual characters to their uppercase equivalent value.
* If the specified character is lowercase, the uppercase value will
* be returned. Otherwise the original value will be returned.
*/
int
codepage_toupper(int c)
{
unsigned short mask = is_unicode ? 0xffff : 0xff;
return (current_codepage[c & mask].upper);
}
/*
* codepage_tolower
*
* Convert individual characters to their lowercase equivalent value.
* If the specified character is uppercase, the lowercase value will
* be returned. Otherwise the original value will be returned.
*/
int
codepage_tolower(int c)
{
unsigned short mask = is_unicode ? 0xffff : 0xff;
return (current_codepage[c & mask].lower);
}
/*
* strupr
*
* Convert a string to uppercase using the appropriate codepage. The
* string is converted in place. A pointer to the string is returned.
* There is an assumption here that uppercase and lowercase values
* always result encode to the same length.
*/
char *
utf8_strupr(char *s)
{
mts_wchar_t c;
char *p = s;
while (*p) {
if (mts_isascii(*p)) {
*p = codepage_toupper(*p);
p++;
} else {
if (mts_mbtowc(&c, p, MTS_MB_CHAR_MAX) < 0)
return (0);
if (c == 0)
break;
c = codepage_toupper(c);
p += mts_wctomb(p, c);
}
}
return (s);
}
/*
* strlwr
*
* Convert a string to lowercase using the appropriate codepage. The
* string is converted in place. A pointer to the string is returned.
* There is an assumption here that uppercase and lowercase values
* always result encode to the same length.
*/
char *
utf8_strlwr(char *s)
{
mts_wchar_t c;
char *p = s;
while (*p) {
if (mts_isascii(*p)) {
*p = codepage_tolower(*p);
p++;
} else {
if (mts_mbtowc(&c, p, MTS_MB_CHAR_MAX) < 0)
return (0);
if (c == 0)
break;
c = codepage_tolower(c);
p += mts_wctomb(p, c);
}
}
return (s);
}
/*
* isstrlwr
*
* Returns 1 if string contains NO uppercase chars 0 otherwise. However,
* -1 is returned if "s" is not a valid multi-byte string.
*/
int
utf8_isstrlwr(const char *s)
{
mts_wchar_t c;
int n;
const char *p = s;
while (*p) {
if (mts_isascii(*p) && codepage_isupper(*p))
return (0);
else {
if ((n = mts_mbtowc(&c, p, MTS_MB_CHAR_MAX)) < 0)
return (-1);
if (c == 0)
break;
if (codepage_isupper(c))
return (0);
p += n;
}
}
return (1);
}
/*
* isstrupr
*
* Returns 1 if string contains NO lowercase chars 0 otherwise. However,
* -1 is returned if "s" is not a valid multi-byte string.
*/
int
utf8_isstrupr(const char *s)
{
mts_wchar_t c;
int n;
const char *p = s;
while (*p) {
if (mts_isascii(*p) && codepage_islower(*p))
return (0);
else {
if ((n = mts_mbtowc(&c, p, MTS_MB_CHAR_MAX)) < 0)
return (-1);
if (c == 0)
break;
if (codepage_islower(c))
return (0);
p += n;
}
}
return (1);
}
/*
* strcasecmp
*
* Compare the null-terminated strings s1 and s2 and return an integer
* greater than, equal to, or less than 0, according as s1 is lexico
* graphically greater than, equal to, or less than s2 after translation
* of each corresponding character to lowercase. The strings themselves
* are not modified.
*
* Out: 0 if strings are equal
* < 0 if first string < second string
* > 0 if first string > second string
*/
int
utf8_strcasecmp(const char *s1, const char *s2)
{
mts_wchar_t c1, c2;
int n1, n2;
const char *p1 = s1;
const char *p2 = s2;
for (;;) {
if (mts_isascii(*p1))
c1 = *p1++;
else {
if ((n1 = mts_mbtowc(&c1, p1, MTS_MB_CHAR_MAX)) < 0)
return (-1);
p1 += n1;
}
if (mts_isascii(*p2))
c2 = *p2++;
else {
if ((n2 = mts_mbtowc(&c2, p2, MTS_MB_CHAR_MAX)) < 0)
return (1);
p2 += n2;
}
if (c1 == 0 || c2 == 0)
break;
if (c1 == c2)
continue;
c1 = codepage_tolower(c1);
c2 = codepage_tolower(c2);
if (c1 != c2)
break;
}
return ((int)c1 - (int)c2);
}
/*
* strncasecmp
*
* Compare two null-terminated strings, s1 and s2, of at most len
* characters and return an int greater than, equal to, or less than 0,
* dependent on whether s1 is lexicographically greater than, equal to,
* or less than s2 after translation of each corresponding character to
* lowercase. The original strings are not modified.
*
* Out: 0 if strings are equal
* < 0 if first string < second string
* > 0 if first string > second string
*/
int
utf8_strncasecmp(const char *s1, const char *s2, int len)
{
mts_wchar_t c1, c2;
int n1, n2;
const char *p1 = s1;
const char *p2 = s2;
if (len <= 0)
return (0);
while (len--) {
if (mts_isascii(*p1))
c1 = *p1++;
else {
if ((n1 = mts_mbtowc(&c1, p1, MTS_MB_CHAR_MAX)) < 0)
return (-1);
p1 += n1;
}
if (mts_isascii(*p2))
c2 = *p2++;
else {
if ((n2 = mts_mbtowc(&c2, p2, MTS_MB_CHAR_MAX)) < 0)
return (1);
p2 += n2;
}
if (c1 == 0 || c2 == 0)
break;
if (c1 == c2)
continue;
c1 = codepage_tolower(c1);
c2 = codepage_tolower(c2);
if (c1 != c2)
break;
}
return ((int)c1 - (int)c2);
}
int
utf8_isstrascii(const char *s)
{
while (*s) {
if (mts_isascii(*s) == 0)
return (0);
s++;
}
return (1);
}
|