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
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
|
/* utf8.c
*
* Copyright (c) 1998, Larry Wall
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*
*/
/*
* 'What a fix!' said Sam. 'That's the one place in all the lands we've ever
* heard of that we don't want to see any closer; and that's the one place
* we're trying to get to! And that's just where we can't get, nohow.'
*
* 'Well do I understand your speech,' he answered in the same language;
* 'yet few strangers do so. Why then do you not speak in the Common Tongue,
* as is the custom in the West, if you wish to be answered?'
*
* ...the travellers perceived that the floor was paved with stones of many
* hues; branching runes and strange devices intertwined beneath their feet.
*/
#include "EXTERN.h"
#include "perl.h"
/* Unicode support */
U8 *
uv_to_utf8(U8 *d, UV uv)
{
if (uv < 0x80) {
*d++ = uv;
return d;
}
if (uv < 0x800) {
*d++ = (( uv >> 6) | 0xc0);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
if (uv < 0x10000) {
*d++ = (( uv >> 12) | 0xe0);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
if (uv < 0x200000) {
*d++ = (( uv >> 18) | 0xf0);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
if (uv < 0x4000000) {
*d++ = (( uv >> 24) | 0xf8);
*d++ = (((uv >> 18) & 0x3f) | 0x80);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
if (uv < 0x80000000) {
*d++ = (( uv >> 30) | 0xfc);
*d++ = (((uv >> 24) & 0x3f) | 0x80);
*d++ = (((uv >> 18) & 0x3f) | 0x80);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
#ifdef Quad_t
if (uv < 0x2000000000)
#endif
{
*d++ = 0xfe; /* Can't match U+FEFF! */
*d++ = (((uv >> 30) & 0x3f) | 0x80);
*d++ = (((uv >> 24) & 0x3f) | 0x80);
*d++ = (((uv >> 18) & 0x3f) | 0x80);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
#ifdef Quad_t
{
*d++ = 0xff; /* Can't match U+FFFE! */
*d++ = (((uv >> 36) & 0x3f) | 0x80);
*d++ = (((uv >> 30) & 0x3f) | 0x80);
*d++ = (((uv >> 24) & 0x3f) | 0x80);
*d++ = (((uv >> 18) & 0x3f) | 0x80);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
return d;
}
#endif
}
UV
utf8_to_uv(U8* s, I32* retlen)
{
UV uv = *s;
int len;
if (!(uv & 0x80)) {
if (retlen)
*retlen = 1;
return *s;
}
if (!(uv & 0x40)) {
warn("Malformed UTF-8 character");
if (retlen)
*retlen = 1;
return *s;
}
if (!(uv & 0x20)) { len = 2; uv &= 0x1f; }
else if (!(uv & 0x10)) { len = 3; uv &= 0x0f; }
else if (!(uv & 0x08)) { len = 4; uv &= 0x07; }
else if (!(uv & 0x04)) { len = 5; uv &= 0x03; }
else if (!(uv & 0x02)) { len = 6; uv &= 0x01; }
else if (!(uv & 0x01)) { len = 7; uv &= 0x00; }
else len = 8; /* whoa! */
if (retlen)
*retlen = len;
--len;
s++;
while (len--) {
if ((*s & 0xc0) != 0x80) {
warn("Malformed UTF-8 character");
if (retlen)
*retlen -= len + 1;
return 0xfffd;
}
else
uv = (uv << 6) | (*s++ & 0x3f);
}
return uv;
}
/* utf8_distance(a,b) is intended to be a - b in pointer arithmetic */
I32
utf8_distance(U8 *a, U8 *b)
{
I32 off = 0;
if (a < b) {
while (a < b) {
a += UTF8SKIP(a);
off--;
}
}
else {
while (b < a) {
b += UTF8SKIP(b);
off++;
}
}
return off;
}
/* WARNING: do not use the following unless you *know* off is within bounds */
U8 *
utf8_hop(U8 *s, I32 off)
{
if (off >= 0) {
while (off--)
s += UTF8SKIP(s);
}
else {
while (off++) {
s--;
if (*s & 0x80) {
while ((*s & 0xc0) == 0x80)
s--;
}
}
}
return s;
}
/* XXX NOTHING CALLS THE FOLLOWING TWO ROUTINES YET!!! */
/*
* Convert native or reversed UTF-16 to UTF-8.
*
* Destination must be pre-extended to 3/2 source. Do not use in-place.
* We optimize for native, for obvious reasons. */
U8*
utf16_to_utf8(U16* p, U8* d, I32 bytelen)
{
U16* pend = p + bytelen / 2;
while (p < pend) {
UV uv = *p++;
if (uv < 0x80) {
*d++ = uv;
continue;
}
if (uv < 0x800) {
*d++ = (( uv >> 6) | 0xc0);
*d++ = (( uv & 0x3f) | 0x80);
continue;
}
if (uv >= 0xd800 && uv < 0xdbff) { /* surrogates */
int low = *p++;
if (low < 0xdc00 || low >= 0xdfff) {
warn("Malformed UTF-16 surrogate");
p--;
uv = 0xfffd;
}
uv = ((uv - 0xd800) << 10) + (low - 0xdc00) + 0x10000;
}
if (uv < 0x10000) {
*d++ = (( uv >> 12) | 0xe0);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
continue;
}
else {
*d++ = (( uv >> 18) | 0xf0);
*d++ = (((uv >> 12) & 0x3f) | 0x80);
*d++ = (((uv >> 6) & 0x3f) | 0x80);
*d++ = (( uv & 0x3f) | 0x80);
continue;
}
}
return d;
}
/* Note: this one is slightly destructive of the source. */
U8*
utf16_to_utf8_reversed(U16* p, U8* d, I32 bytelen)
{
U8* s = (U8*)p;
U8* send = s + bytelen;
while (s < send) {
U8 tmp = s[0];
s[0] = s[1];
s[1] = tmp;
s += 2;
}
return utf16_to_utf8(p, d, bytelen);
}
/* for now these are all defined (inefficiently) in terms of the utf8 versions */
bool
is_uni_alnum(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_alnum(tmpbuf);
}
bool
is_uni_idfirst(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_idfirst(tmpbuf);
}
bool
is_uni_alpha(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_alpha(tmpbuf);
}
bool
is_uni_space(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_space(tmpbuf);
}
bool
is_uni_digit(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_digit(tmpbuf);
}
bool
is_uni_upper(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_upper(tmpbuf);
}
bool
is_uni_lower(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_lower(tmpbuf);
}
bool
is_uni_print(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return is_utf8_print(tmpbuf);
}
U32
to_uni_upper(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return to_utf8_upper(tmpbuf);
}
U32
to_uni_title(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return to_utf8_title(tmpbuf);
}
U32
to_uni_lower(U32 c)
{
U8 tmpbuf[10];
uv_to_utf8(tmpbuf, (UV)c);
return to_utf8_lower(tmpbuf);
}
/* for now these all assume no locale info available for Unicode > 255 */
bool
is_uni_alnum_lc(U32 c)
{
return is_uni_alnum(c); /* XXX no locale support yet */
}
bool
is_uni_idfirst_lc(U32 c)
{
return is_uni_idfirst(c); /* XXX no locale support yet */
}
bool
is_uni_alpha_lc(U32 c)
{
return is_uni_alpha(c); /* XXX no locale support yet */
}
bool
is_uni_space_lc(U32 c)
{
return is_uni_space(c); /* XXX no locale support yet */
}
bool
is_uni_digit_lc(U32 c)
{
return is_uni_digit(c); /* XXX no locale support yet */
}
bool
is_uni_upper_lc(U32 c)
{
return is_uni_upper(c); /* XXX no locale support yet */
}
bool
is_uni_lower_lc(U32 c)
{
return is_uni_lower(c); /* XXX no locale support yet */
}
bool
is_uni_print_lc(U32 c)
{
return is_uni_print(c); /* XXX no locale support yet */
}
U32
to_uni_upper_lc(U32 c)
{
return to_uni_upper(c); /* XXX no locale support yet */
}
U32
to_uni_title_lc(U32 c)
{
return to_uni_title(c); /* XXX no locale support yet */
}
U32
to_uni_lower_lc(U32 c)
{
return to_uni_lower(c); /* XXX no locale support yet */
}
bool
is_utf8_alnum(U8 *p)
{
if (!PL_utf8_alnum)
PL_utf8_alnum = swash_init("utf8", "IsAlnum", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_alnum, p);
/* return *p == '_' || is_utf8_alpha(p) || is_utf8_digit(p); */
#ifdef SURPRISINGLY_SLOWER /* probably because alpha is usually true */
if (!PL_utf8_alnum)
PL_utf8_alnum = swash_init("utf8", "",
sv_2mortal(newSVpv("+utf8::IsAlpha\n+utf8::IsDigit\n005F\n",0)), 0, 0);
return swash_fetch(PL_utf8_alnum, p);
#endif
}
bool
is_utf8_idfirst(U8 *p)
{
return *p == '_' || is_utf8_alpha(p);
}
bool
is_utf8_alpha(U8 *p)
{
if (!PL_utf8_alpha)
PL_utf8_alpha = swash_init("utf8", "IsAlpha", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_alpha, p);
}
bool
is_utf8_space(U8 *p)
{
if (!PL_utf8_space)
PL_utf8_space = swash_init("utf8", "IsSpace", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_space, p);
}
bool
is_utf8_digit(U8 *p)
{
if (!PL_utf8_digit)
PL_utf8_digit = swash_init("utf8", "IsDigit", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_digit, p);
}
bool
is_utf8_upper(U8 *p)
{
if (!PL_utf8_upper)
PL_utf8_upper = swash_init("utf8", "IsUpper", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_upper, p);
}
bool
is_utf8_lower(U8 *p)
{
if (!PL_utf8_lower)
PL_utf8_lower = swash_init("utf8", "IsLower", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_lower, p);
}
bool
is_utf8_print(U8 *p)
{
if (!PL_utf8_print)
PL_utf8_print = swash_init("utf8", "IsPrint", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_print, p);
}
bool
is_utf8_mark(U8 *p)
{
if (!PL_utf8_mark)
PL_utf8_mark = swash_init("utf8", "IsM", &sv_undef, 0, 0);
return swash_fetch(PL_utf8_mark, p);
}
U32
to_utf8_upper(U8 *p)
{
UV uv;
if (!PL_utf8_toupper)
PL_utf8_toupper = swash_init("utf8", "ToUpper", &sv_undef, 4, 0);
uv = swash_fetch(PL_utf8_toupper, p);
return uv ? uv : utf8_to_uv(p,0);
}
U32
to_utf8_title(U8 *p)
{
UV uv;
if (!PL_utf8_totitle)
PL_utf8_totitle = swash_init("utf8", "ToTitle", &sv_undef, 4, 0);
uv = swash_fetch(PL_utf8_totitle, p);
return uv ? uv : utf8_to_uv(p,0);
}
U32
to_utf8_lower(U8 *p)
{
UV uv;
if (!PL_utf8_tolower)
PL_utf8_tolower = swash_init("utf8", "ToLower", &sv_undef, 4, 0);
uv = swash_fetch(PL_utf8_tolower, p);
return uv ? uv : utf8_to_uv(p,0);
}
/* a "swash" is a swatch hash */
SV*
swash_init(char* pkg, char* name, SV *listsv, I32 minbits, I32 none)
{
SV* retval;
char tmpbuf[256];
dSP;
PUSHSTACKi(PERLSI_MAGIC);
PUSHMARK(SP);
EXTEND(SP,5);
PUSHs(sv_2mortal(newSVpvn(pkg, strlen(pkg))));
PUSHs(sv_2mortal(newSVpvn(name, strlen(name))));
PUSHs(listsv);
PUSHs(sv_2mortal(newSViv(minbits)));
PUSHs(sv_2mortal(newSViv(none)));
PUTBACK;
ENTER;
SAVEI32(PL_hints);
PL_hints = 0;
save_re_context();
if (curcop == &compiling) /* XXX ought to be handled by lex_start */
strncpy(tmpbuf, PL_tokenbuf, sizeof tmpbuf);
if (perl_call_method("SWASHNEW", G_SCALAR))
retval = newSVsv(*stack_sp--);
else
retval = &sv_undef;
LEAVE;
POPSTACK;
if (curcop == &compiling) {
strncpy(PL_tokenbuf, tmpbuf, sizeof tmpbuf);
curcop->op_private = PL_hints;
}
if (!SvROK(retval) || SvTYPE(SvRV(retval)) != SVt_PVHV)
croak("SWASHNEW didn't return an HV ref");
return retval;
}
UV
swash_fetch(SV *sv, U8 *ptr)
{
HV* hv = (HV*)SvRV(sv);
U32 klen = UTF8SKIP(ptr) - 1;
U32 off = ptr[klen] & 127; /* NB: 64 bit always 0 when len > 1 */
STRLEN slen;
STRLEN needents = (klen ? 64 : 128);
U8 *tmps;
U32 bit;
SV *retval;
/*
* This single-entry cache saves about 1/3 of the utf8 overhead in test
* suite. (That is, only 7-8% overall over just a hash cache. Still,
* it's nothing to sniff at.) Pity we usually come through at least
* two function calls to get here...
*
* NB: this code assumes that swatches are never modified, once generated!
*/
if (hv == PL_last_swash_hv &&
klen == PL_last_swash_klen &&
(!klen || memEQ(ptr,PL_last_swash_key,klen)) )
{
tmps = PL_last_swash_tmps;
slen = PL_last_swash_slen;
}
else {
/* Try our second-level swatch cache, kept in a hash. */
SV** svp = hv_fetch(hv, (char*)ptr, klen, FALSE);
/* If not cached, generate it via utf8::SWASHGET */
if (!svp || !SvPOK(*svp) || !(tmps = (U8*)SvPV(*svp, slen))) {
dSP;
ENTER;
SAVETMPS;
save_re_context();
PUSHSTACKi(PERLSI_MAGIC);
PUSHMARK(SP);
EXTEND(SP,3);
PUSHs((SV*)sv);
PUSHs(sv_2mortal(newSViv(utf8_to_uv(ptr, 0) & ~(needents - 1))));
PUSHs(sv_2mortal(newSViv(needents)));
PUTBACK;
if (perl_call_method("SWASHGET", G_SCALAR))
retval = newSVsv(*stack_sp--);
else
retval = &sv_undef;
POPSTACK;
FREETMPS;
LEAVE;
if (curcop == &compiling)
curcop->op_private = PL_hints;
svp = hv_store(hv, (char*)ptr, klen, retval, 0);
if (!svp || !(tmps = (U8*)SvPV(*svp, slen)) || slen < 8)
croak("SWASHGET didn't return result of proper length");
}
PL_last_swash_hv = hv;
PL_last_swash_klen = klen;
PL_last_swash_tmps = tmps;
PL_last_swash_slen = slen;
if (klen)
Copy(ptr, PL_last_swash_key, klen, U8);
}
switch ((slen << 3) / needents) {
case 1:
bit = 1 << (off & 7);
off >>= 3;
return (tmps[off] & bit) != 0;
case 8:
return tmps[off];
case 16:
off <<= 1;
return (tmps[off] << 8) + tmps[off + 1] ;
case 32:
off <<= 2;
return (tmps[off] << 24) + (tmps[off+1] << 16) + (tmps[off+2] << 8) + tmps[off + 3] ;
}
croak("panic: swash_fetch");
return 0;
}
|