Fix regression: surrogate half followed by extra tail bytes
[lhc/web/wiklou.git] / includes / normal / UtfNormal.php
1 <?php
2 # Copyright (C) 2004 Brion Vibber <brion@pobox.com>
3 # http://www.mediawiki.org/
4 #
5 # This program is free software; you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation; either version 2 of the License, or
8 # (at your option) any later version.
9 #
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
14 #
15 # You should have received a copy of the GNU General Public License along
16 # with this program; if not, write to the Free Software Foundation, Inc.,
17 # 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 # http://www.gnu.org/copyleft/gpl.html
19
20 /**
21 * Unicode normalization routines for working with UTF-8 strings.
22 * Currently assumes that input strings are valid UTF-8!
23 *
24 * Not as fast as I'd like, but should be usable for most purposes.
25 * UtfNormal::toNFC() will bail early if given ASCII text or text
26 * it can quickly deterimine is already normalized.
27 *
28 * All functions can be called static.
29 *
30 * See description of forms at http://www.unicode.org/reports/tr15/
31 *
32 * @package UtfNormal
33 */
34
35 /** */
36 require_once 'UtfNormalUtil.php';
37
38 global $utfCombiningClass, $utfCanonicalComp, $utfCanonicalDecomp;
39 $utfCombiningClass = NULL;
40 $utfCanonicalComp = NULL;
41 $utfCanonicalDecomp = NULL;
42
43 # Load compatibility decompositions on demand if they are needed.
44 global $utfCompatibilityDecomp;
45 $utfCompatibilityDecomp = NULL;
46
47 define( 'UNICODE_HANGUL_FIRST', 0xac00 );
48 define( 'UNICODE_HANGUL_LAST', 0xd7a3 );
49
50 define( 'UNICODE_HANGUL_LBASE', 0x1100 );
51 define( 'UNICODE_HANGUL_VBASE', 0x1161 );
52 define( 'UNICODE_HANGUL_TBASE', 0x11a7 );
53
54 define( 'UNICODE_HANGUL_LCOUNT', 19 );
55 define( 'UNICODE_HANGUL_VCOUNT', 21 );
56 define( 'UNICODE_HANGUL_TCOUNT', 28 );
57 define( 'UNICODE_HANGUL_NCOUNT', UNICODE_HANGUL_VCOUNT * UNICODE_HANGUL_TCOUNT );
58
59 define( 'UNICODE_HANGUL_LEND', UNICODE_HANGUL_LBASE + UNICODE_HANGUL_LCOUNT - 1 );
60 define( 'UNICODE_HANGUL_VEND', UNICODE_HANGUL_VBASE + UNICODE_HANGUL_VCOUNT - 1 );
61 define( 'UNICODE_HANGUL_TEND', UNICODE_HANGUL_TBASE + UNICODE_HANGUL_TCOUNT - 1 );
62
63 define( 'UNICODE_SURROGATE_FIRST', 0xd800 );
64 define( 'UNICODE_SURROGATE_LAST', 0xdfff );
65 define( 'UNICODE_MAX', 0x10ffff );
66 define( 'UNICODE_REPLACEMENT', 0xfffd );
67
68
69 define( 'UTF8_HANGUL_FIRST', codepointToUtf8( UNICODE_HANGUL_FIRST ) );
70 define( 'UTF8_HANGUL_LAST', codepointToUtf8( UNICODE_HANGUL_LAST ) );
71
72 define( 'UTF8_HANGUL_LBASE', codepointToUtf8( UNICODE_HANGUL_LBASE ) );
73 define( 'UTF8_HANGUL_VBASE', codepointToUtf8( UNICODE_HANGUL_VBASE ) );
74 define( 'UTF8_HANGUL_TBASE', codepointToUtf8( UNICODE_HANGUL_TBASE ) );
75
76 define( 'UTF8_HANGUL_LEND', codepointToUtf8( UNICODE_HANGUL_LEND ) );
77 define( 'UTF8_HANGUL_VEND', codepointToUtf8( UNICODE_HANGUL_VEND ) );
78 define( 'UTF8_HANGUL_TEND', codepointToUtf8( UNICODE_HANGUL_TEND ) );
79
80 define( 'UTF8_SURROGATE_FIRST', codepointToUtf8( UNICODE_SURROGATE_FIRST ) );
81 define( 'UTF8_SURROGATE_LAST', codepointToUtf8( UNICODE_SURROGATE_LAST ) );
82 define( 'UTF8_MAX', codepointToUtf8( UNICODE_MAX ) );
83 define( 'UTF8_REPLACEMENT', codepointToUtf8( UNICODE_REPLACEMENT ) );
84 #define( 'UTF8_REPLACEMENT', '!' );
85
86 define( 'UTF8_OVERLONG_A', "\xc1\xbf" );
87 define( 'UTF8_OVERLONG_B', "\xe0\x9f\xbf" );
88 define( 'UTF8_OVERLONG_C', "\xf0\x8f\xbf\xbf" );
89
90 # These two ranges are illegal
91 define( 'UTF8_FDD0', codepointToUtf8( 0xfdd0 ) );
92 define( 'UTF8_FDEF', codepointToUtf8( 0xfdef ) );
93 define( 'UTF8_FFFE', codepointToUtf8( 0xfffe ) );
94 define( 'UTF8_FFFF', codepointToUtf8( 0xffff ) );
95
96 define( 'UTF8_HEAD', false );
97 define( 'UTF8_TAIL', true );
98
99
100 /**
101 * For using the ICU wrapper
102 */
103 define( 'UNORM_NONE', 1 );
104 define( 'UNORM_NFD', 2 );
105 define( 'UNORM_NFKD', 3 );
106 define( 'UNORM_NFC', 4 );
107 define( 'UNORM_DEFAULT', UNORM_NFC );
108 define( 'UNORM_NFKC', 5 );
109 define( 'UNORM_FCD', 6 );
110
111 define( 'NORMALIZE_ICU', function_exists( 'utf8_normalize' ) );
112
113 /**
114 *
115 * @package MediaWiki
116 */
117 class UtfNormal {
118 /**
119 * The ultimate convenience function! Clean up invalid UTF-8 sequences,
120 * and convert to normal form C, canonical composition.
121 *
122 * Fast return for pure ASCII strings; some lesser optimizations for
123 * strings containing only known-good characters. Not as fast as toNFC().
124 *
125 * @param string $string a UTF-8 string
126 * @return string a clean, shiny, normalized UTF-8 string
127 */
128 function cleanUp( $string ) {
129 if( UtfNormal::quickIsNFCVerify( $string ) )
130 return $string;
131 else
132 return UtfNormal::NFC( $string );
133 }
134
135 /**
136 * Convert a UTF-8 string to normal form C, canonical composition.
137 * Fast return for pure ASCII strings; some lesser optimizations for
138 * strings containing only known-good characters.
139 *
140 * @param string $string a valid UTF-8 string. Input is not validated.
141 * @return string a UTF-8 string in normal form C
142 */
143 function toNFC( $string ) {
144 if( NORMALIZE_ICU )
145 return utf8_normalize( $string, UNORM_NFC );
146 elseif( UtfNormal::quickIsNFC( $string ) )
147 return $string;
148 else
149 return UtfNormal::NFC( $string );
150 }
151
152 /**
153 * Convert a UTF-8 string to normal form D, canonical decomposition.
154 * Fast return for pure ASCII strings.
155 *
156 * @param string $string a valid UTF-8 string. Input is not validated.
157 * @return string a UTF-8 string in normal form D
158 */
159 function toNFD( $string ) {
160 if( NORMALIZE_ICU )
161 return utf8_normalize( $string, UNORM_NFD );
162 elseif( preg_match( '/[\x80-\xff]/', $string ) )
163 return UtfNormal::NFD( $string );
164 else
165 return $string;
166 }
167
168 /**
169 * Convert a UTF-8 string to normal form KC, compatibility composition.
170 * This may cause irreversible information loss, use judiciously.
171 * Fast return for pure ASCII strings.
172 *
173 * @param string $string a valid UTF-8 string. Input is not validated.
174 * @return string a UTF-8 string in normal form KC
175 */
176 function toNFKC( $string ) {
177 if( NORMALIZE_ICU )
178 return utf8_normalize( $string, UNORM_NFKC );
179 elseif( preg_match( '/[\x80-\xff]/', $string ) )
180 return UtfNormal::NFKC( $string );
181 else
182 return $string;
183 }
184
185 /**
186 * Convert a UTF-8 string to normal form KD, compatibility decomposition.
187 * This may cause irreversible information loss, use judiciously.
188 * Fast return for pure ASCII strings.
189 *
190 * @param string $string a valid UTF-8 string. Input is not validated.
191 * @return string a UTF-8 string in normal form KD
192 */
193 function toNFKD( $string ) {
194 if( NORMALIZE_ICU )
195 return utf8_normalize( $string, UNORM_NFKD );
196 elseif( preg_match( '/[\x80-\xff]/', $string ) )
197 return UtfNormal::NFKD( $string );
198 else
199 return $string;
200 }
201
202 /**
203 * Load the basic composition data if necessary
204 * @access private
205 */
206 function loadData() {
207 global $utfCombiningClass, $utfCanonicalComp, $utfCanonicalDecomp;
208 if( !isset( $utfCombiningClass ) ) {
209 require_once( 'UtfNormalData.inc' );
210 }
211 }
212
213 /**
214 * Returns true if the string is _definitely_ in NFC.
215 * Returns false if not or uncertain.
216 * @param string $string a valid UTF-8 string. Input is not validated.
217 * @return bool
218 */
219 function quickIsNFC( $string ) {
220 # ASCII is always valid NFC!
221 # If it's pure ASCII, let it through.
222 if( !preg_match( '/[\x80-\xff]/', $string ) ) return true;
223
224 UtfNormal::loadData();
225 global $utfCheckNFC, $utfCombiningClass;
226 $len = strlen( $string );
227 for( $i = 0; $i < $len; $i++ ) {
228 $c = $string{$i};
229 $n = ord( $c );
230 if( $n < 0x80 ) {
231 continue;
232 } elseif( $n >= 0xf0 ) {
233 $c = substr( $string, $i, 4 );
234 $i += 3;
235 } elseif( $n >= 0xe0 ) {
236 $c = substr( $string, $i, 3 );
237 $i += 2;
238 } elseif( $n >= 0xc0 ) {
239 $c = substr( $string, $i, 2 );
240 $i++;
241 }
242 if( isset( $utfCheckNFC[$c] ) ) {
243 # If it's NO or MAYBE, bail and do the slow check.
244 return false;
245 }
246 if( isset( $utfCombiningClass[$c] ) ) {
247 # Combining character? We might have to do sorting, at least.
248 return false;
249 }
250 }
251 return true;
252 }
253
254 /**
255 * Returns true if the string is _definitely_ in NFC.
256 * Returns false if not or uncertain.
257 * @param string $string a UTF-8 string, altered on output to be valid UTF-8 safe for XML.
258 */
259 function quickIsNFCVerify( &$string ) {
260 # Screen out some characters that eg won't be allowed in XML
261 $string = preg_replace( '/[\x00-\x08\x0b\x0c\x0e-\x1f]/', UTF8_REPLACEMENT, $string );
262
263 # ASCII is always valid NFC!
264 # If we're only ever given plain ASCII, we can avoid the overhead
265 # of initializing the decomposition tables by skipping out early.
266 if( !preg_match( '/[\x80-\xff]/', $string ) ) return true;
267
268 static $checkit = null, $tailBytes = null, $utfCheckOrCombining = null;
269 if( !isset( $checkit ) ) {
270 # Load/build some scary lookup tables...
271 UtfNormal::loadData();
272 global $utfCheckNFC, $utfCombiningClass;
273
274 $utfCheckOrCombining = array_merge( $utfCheckNFC, $utfCombiningClass );
275
276 # Head bytes for sequences which we should do further validity checks
277 $checkit = array_flip( array_map( 'chr',
278 array( 0xc0, 0xc1, 0xe0, 0xed, 0xef,
279 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7,
280 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff ) ) );
281
282 # Each UTF-8 head byte is followed by a certain
283 # number of tail bytes.
284 $tailBytes = array();
285 for( $n = 0; $n < 256; $n++ ) {
286 if( $n < 0xc0 ) {
287 $remaining = 0;
288 } elseif( $n < 0xe0 ) {
289 $remaining = 1;
290 } elseif( $n < 0xf0 ) {
291 $remaining = 2;
292 } elseif( $n < 0xf8 ) {
293 $remaining = 3;
294 } elseif( $n < 0xfc ) {
295 $remaining = 4;
296 } elseif( $n < 0xfe ) {
297 $remaining = 5;
298 } else {
299 $remaining = 0;
300 }
301 $tailBytes[chr($n)] = $remaining;
302 }
303 }
304
305 # Chop the text into pure-ASCII and non-ASCII areas;
306 # large ASCII parts can be handled much more quickly.
307 # Don't chop up Unicode areas for punctuation, though,
308 # that wastes energy.
309 preg_match_all(
310 '/([\x00-\x7f]+|[\x80-\xff][\x00-\x40\x5b-\x5f\x7b-\xff]*)/',
311 $string, $matches );
312
313 $looksNormal = true;
314 $base = 0;
315 $replace = array();
316 foreach( $matches[1] as $str ) {
317 $chunk = strlen( $str );
318
319 if( $str{0} < "\x80" ) {
320 # ASCII chunk: guaranteed to be valid UTF-8
321 # and in normal form C, so skip over it.
322 $base += $chunk;
323 continue;
324 }
325
326 # We'll have to examine the chunk byte by byte to ensure
327 # that it consists of valid UTF-8 sequences, and to see
328 # if any of them might not be normalized.
329 #
330 # Since PHP is not the fastest language on earth, some of
331 # this code is a little ugly with inner loop optimizations.
332
333 $head = '';
334 $len = $chunk + 1; # Counting down is faster. I'm *so* sorry.
335
336 for( $i = -1; --$len; ) {
337 if( $remaining = $tailBytes[$c = $str{++$i}] ) {
338 # UTF-8 head byte!
339 $sequence = $head = $c;
340 do {
341 # Look for the defined number of tail bytes...
342 if( --$len && ( $c = $str{++$i} ) >= "\x80" && $c < "\xc0" ) {
343 # Legal tail bytes are nice.
344 $sequence .= $c;
345 } else {
346 if( 0 == $len ) {
347 # Premature end of string!
348 # Drop a replacement character into output to
349 # represent the invalid UTF-8 sequence.
350 $replace[] = array( UTF8_REPLACEMENT,
351 $base + $i + 1 - strlen( $sequence ),
352 strlen( $sequence ) );
353 break 2;
354 } else {
355 # Illegal tail byte; abandon the sequence.
356 $replace[] = array( UTF8_REPLACEMENT,
357 $base + $i - strlen( $sequence ),
358 strlen( $sequence ) );
359 # Back up and reprocess this byte; it may itself
360 # be a legal ASCII or UTF-8 sequence head.
361 --$i;
362 ++$len;
363 continue 2;
364 }
365 }
366 } while( --$remaining );
367
368 if( isset( $checkit[$head] ) ) {
369 # Do some more detailed validity checks, for
370 # invalid characters and illegal sequences.
371 if( $head == "\xed" ) {
372 # 0xed is relatively frequent in Korean, which
373 # abuts the surrogate area, so we're doing
374 # this check separately to speed things up.
375
376 if( $sequence >= UTF8_SURROGATE_FIRST ) {
377 # Surrogates are legal only in UTF-16 code.
378 # They are totally forbidden here in UTF-8
379 # utopia.
380 $replace[] = array( UTF8_REPLACEMENT,
381 $base + $i + 1 - strlen( $sequence ),
382 strlen( $sequence ) );
383 $head = '';
384 continue;
385 }
386 } else {
387 # Slower, but rarer checks...
388 $n = ord( $head );
389 if(
390 # "Overlong sequences" are those that are syntactically
391 # correct but use more UTF-8 bytes than are necessary to
392 # encode a character. Naïve string comparisons can be
393 # tricked into failing to see a match for an ASCII
394 # character, for instance, which can be a security hole
395 # if blacklist checks are being used.
396 ($n < 0xc2 && $sequence <= UTF8_OVERLONG_A)
397 || ($n == 0xe0 && $sequence <= UTF8_OVERLONG_B)
398 || ($n == 0xf0 && $sequence <= UTF8_OVERLONG_C)
399
400 # U+FFFE and U+FFFF are explicitly forbidden in Unicode.
401 || ($n == 0xef &&
402 ($sequence == UTF8_FFFE)
403 || ($sequence == UTF8_FFFF) )
404
405 # Unicode has been limited to 21 bits; longer
406 # sequences are not allowed.
407 || ($n >= 0xf0 && $sequence > UTF8_MAX) ) {
408
409 $replace[] = array( UTF8_REPLACEMENT,
410 $base + $i + 1 - strlen( $sequence ),
411 strlen( $sequence ) );
412 $head = '';
413 continue;
414 }
415 }
416 }
417
418 if( isset( $utfCheckOrCombining[$sequence] ) ) {
419 # If it's NO or MAYBE, we'll have to rip
420 # the string apart and put it back together.
421 # That's going to be mighty slow.
422 $looksNormal = false;
423 }
424
425 # The sequence is legal!
426 $head = '';
427 } elseif( $c < "\x80" ) {
428 # ASCII byte.
429 $head = '';
430 } elseif( $c < "\xc0" ) {
431 # Illegal tail bytes
432 if( $head == '' ) {
433 # Out of the blue!
434 $replace[] = array( UTF8_REPLACEMENT, $base + $i, 1 );
435 } else {
436 # Don't add if we're continuing a broken sequence;
437 # we already put a replacement character when we looked
438 # at the broken sequence.
439 $replace[] = array( '', $base + $i, 1 );
440 }
441 } else {
442 # Miscellaneous freaks.
443 $replace[] = array( UTF8_REPLACEMENT, $base + $i, 1 );
444 $head = '';
445 }
446 }
447 $base += $chunk;
448 }
449 if( count( $replace ) ) {
450 # There were illegal UTF-8 sequences we need to fix up.
451 $out = '';
452 $last = 0;
453 foreach( $replace as $rep ) {
454 list( $replacement, $start, $length ) = $rep;
455 if( $last < $start ) {
456 $out .= substr( $string, $last, $start - $last );
457 }
458 $out .= $replacement;
459 $last = $start + $length;
460 }
461 if( $last < strlen( $string ) ) {
462 $out .= substr( $string, $last );
463 }
464 $string = $out;
465 }
466 return $looksNormal;
467 }
468
469 # These take a string and run the normalization on them, without
470 # checking for validity or any optimization etc. Input must be
471 # VALID UTF-8!
472 /**
473 * @param string $string
474 * @return string
475 * @access private
476 */
477 function NFC( $string ) {
478 return UtfNormal::fastCompose( UtfNormal::NFD( $string ) );
479 }
480
481 /**
482 * @param string $string
483 * @return string
484 * @access private
485 */
486 function NFD( $string ) {
487 UtfNormal::loadData();
488 global $utfCanonicalDecomp;
489 return UtfNormal::fastCombiningSort(
490 UtfNormal::fastDecompose( $string, $utfCanonicalDecomp ) );
491 }
492
493 /**
494 * @param string $string
495 * @return string
496 * @access private
497 */
498 function NFKC( $string ) {
499 return UtfNormal::fastCompose( UtfNormal::NFKD( $string ) );
500 }
501
502 /**
503 * @param string $string
504 * @return string
505 * @access private
506 */
507 function NFKD( $string ) {
508 global $utfCompatibilityDecomp;
509 if( !isset( $utfCompatibilityDecomp ) ) {
510 require_once( 'UtfNormalDataK.inc' );
511 }
512 return UtfNormal::fastCombiningSort(
513 UtfNormal::fastDecompose( $string, $utfCompatibilityDecomp ) );
514 }
515
516
517 /**
518 * Perform decomposition of a UTF-8 string into either D or KD form
519 * (depending on which decomposition map is passed to us).
520 * Input is assumed to be *valid* UTF-8. Invalid code will break.
521 * @access private
522 * @param string $string Valid UTF-8 string
523 * @param array $map hash of expanded decomposition map
524 * @return string a UTF-8 string decomposed, not yet normalized (needs sorting)
525 */
526 function fastDecompose( $string, &$map ) {
527 UtfNormal::loadData();
528 $len = strlen( $string );
529 $out = '';
530 for( $i = 0; $i < $len; $i++ ) {
531 $c = $string{$i};
532 $n = ord( $c );
533 if( $n < 0x80 ) {
534 # ASCII chars never decompose
535 # THEY ARE IMMORTAL
536 $out .= $c;
537 continue;
538 } elseif( $n >= 0xf0 ) {
539 $c = substr( $string, $i, 4 );
540 $i += 3;
541 } elseif( $n >= 0xe0 ) {
542 $c = substr( $string, $i, 3 );
543 $i += 2;
544 } elseif( $n >= 0xc0 ) {
545 $c = substr( $string, $i, 2 );
546 $i++;
547 }
548 if( isset( $map[$c] ) ) {
549 $out .= $map[$c];
550 continue;
551 } else {
552 if( $c >= UTF8_HANGUL_FIRST && $c <= UTF8_HANGUL_LAST ) {
553 # Decompose a hangul syllable into jamo;
554 # hardcoded for three-byte UTF-8 sequence.
555 # A lookup table would be slightly faster,
556 # but adds a lot of memory & disk needs.
557 #
558 $index = ( (ord( $c{0} ) & 0x0f) << 12
559 | (ord( $c{1} ) & 0x3f) << 6
560 | (ord( $c{2} ) & 0x3f) )
561 - UNICODE_HANGUL_FIRST;
562 $l = IntVal( $index / UNICODE_HANGUL_NCOUNT );
563 $v = IntVal( ($index % UNICODE_HANGUL_NCOUNT) / UNICODE_HANGUL_TCOUNT);
564 $t = $index % UNICODE_HANGUL_TCOUNT;
565 $out .= "\xe1\x84" . chr( 0x80 + $l ) . "\xe1\x85" . chr( 0xa1 + $v );
566 if( $t >= 25 ) {
567 $out .= "\xe1\x87" . chr( 0x80 + $t - 25 );
568 } elseif( $t ) {
569 $out .= "\xe1\x86" . chr( 0xa7 + $t );
570 }
571 continue;
572 }
573 }
574 $out .= $c;
575 }
576 return $out;
577 }
578
579 /**
580 * Sorts combining characters into canonical order. This is the
581 * final step in creating decomposed normal forms D and KD.
582 * @access private
583 * @param string $string a valid, decomposed UTF-8 string. Input is not validated.
584 * @return string a UTF-8 string with combining characters sorted in canonical order
585 */
586 function fastCombiningSort( $string ) {
587 UtfNormal::loadData();
588 global $utfCombiningClass;
589 $len = strlen( $string );
590 $out = '';
591 $combiners = array();
592 $lastClass = -1;
593 for( $i = 0; $i < $len; $i++ ) {
594 $c = $string{$i};
595 $n = ord( $c );
596 if( $n >= 0x80 ) {
597 if( $n >= 0xf0 ) {
598 $c = substr( $string, $i, 4 );
599 $i += 3;
600 } elseif( $n >= 0xe0 ) {
601 $c = substr( $string, $i, 3 );
602 $i += 2;
603 } elseif( $n >= 0xc0 ) {
604 $c = substr( $string, $i, 2 );
605 $i++;
606 }
607 if( isset( $utfCombiningClass[$c] ) ) {
608 $lastClass = $utfCombiningClass[$c];
609 @$combiners[$lastClass] .= $c;
610 continue;
611 }
612 }
613 if( $lastClass ) {
614 ksort( $combiners );
615 $out .= implode( '', $combiners );
616 $combiners = array();
617 }
618 $out .= $c;
619 $lastClass = 0;
620 }
621 if( $lastClass ) {
622 ksort( $combiners );
623 $out .= implode( '', $combiners );
624 }
625 return $out;
626 }
627
628 /**
629 * Produces canonically composed sequences, i.e. normal form C or KC.
630 *
631 * @access private
632 * @param string $string a valid UTF-8 string in sorted normal form D or KD. Input is not validated.
633 * @return string a UTF-8 string with canonical precomposed characters used where possible
634 */
635 function fastCompose( $string ) {
636 UtfNormal::loadData();
637 global $utfCanonicalComp, $utfCombiningClass;
638 $len = strlen( $string );
639 $out = '';
640 $lastClass = -1;
641 $startChar = '';
642 $combining = '';
643 $x1 = ord(substr(UTF8_HANGUL_VBASE,0,1));
644 $x2 = ord(substr(UTF8_HANGUL_TEND,0,1));
645 for( $i = 0; $i < $len; $i++ ) {
646 $c = $string{$i};
647 $n = ord( $c );
648 if( $n < 0x80 ) {
649 # No combining characters here...
650 $out .= $startChar;
651 $out .= $combining;
652 $startChar = $c;
653 $combining = '';
654 $lastClass = 0;
655 continue;
656 } elseif( $n >= 0xf0 ) {
657 $c = substr( $string, $i, 4 );
658 $i += 3;
659 } elseif( $n >= 0xe0 ) {
660 $c = substr( $string, $i, 3 );
661 $i += 2;
662 } elseif( $n >= 0xc0 ) {
663 $c = substr( $string, $i, 2 );
664 $i++;
665 }
666 $pair = $startChar . $c;
667 if( $n > 0x80 ) {
668 if( isset( $utfCombiningClass[$c] ) ) {
669 # A combining char; see what we can do with it
670 $class = $utfCombiningClass[$c];
671 if( !empty( $startChar ) &&
672 $lastClass < $class &&
673 $class > 0 &&
674 isset( $utfCanonicalComp[$pair] ) ) {
675 $startChar = $utfCanonicalComp[$pair];
676 $class = 0;
677 } else {
678 $combining .= $c;
679 }
680 $lastClass = $class;
681 continue;
682 }
683 }
684 # New start char
685 if( $lastClass == 0 ) {
686 if( isset( $utfCanonicalComp[$pair] ) ) {
687 $startChar = $utfCanonicalComp[$pair];
688 continue;
689 }
690 if( $n >= $x1 && $n <= $x2 ) {
691 # WARNING: Hangul code is painfully slow.
692 # I apologize for this ugly, ugly code; however
693 # performance is even more teh suck if we call
694 # out to nice clean functions. Lookup tables are
695 # marginally faster, but require a lot of space.
696 #
697 if( $c >= UTF8_HANGUL_VBASE &&
698 $c <= UTF8_HANGUL_VEND &&
699 $startChar >= UTF8_HANGUL_LBASE &&
700 $startChar <= UTF8_HANGUL_LEND ) {
701 #
702 #$lIndex = utf8ToCodepoint( $startChar ) - UNICODE_HANGUL_LBASE;
703 #$vIndex = utf8ToCodepoint( $c ) - UNICODE_HANGUL_VBASE;
704 $lIndex = ord( $startChar{2} ) - 0x80;
705 $vIndex = ord( $c{2} ) - 0xa1;
706
707 $hangulPoint = UNICODE_HANGUL_FIRST +
708 UNICODE_HANGUL_TCOUNT *
709 (UNICODE_HANGUL_VCOUNT * $lIndex + $vIndex);
710
711 # Hardcode the limited-range UTF-8 conversion:
712 $startChar = chr( $hangulPoint >> 12 & 0x0f | 0xe0 ) .
713 chr( $hangulPoint >> 6 & 0x3f | 0x80 ) .
714 chr( $hangulPoint & 0x3f | 0x80 );
715 continue;
716 } elseif( $c >= UTF8_HANGUL_TBASE &&
717 $c <= UTF8_HANGUL_TEND &&
718 $startChar >= UTF8_HANGUL_FIRST &&
719 $startChar <= UTF8_HANGUL_LAST ) {
720 # $tIndex = utf8ToCodepoint( $c ) - UNICODE_HANGUL_TBASE;
721 $tIndex = ord( $c{2} ) - 0xa7;
722 if( $tIndex < 0 ) $tIndex = ord( $c{2} ) - 0x80 + (0x11c0 - 0x11a7);
723
724 # Increment the code point by $tIndex, without
725 # the function overhead of decoding and recoding UTF-8
726 #
727 $tail = ord( $startChar{2} ) + $tIndex;
728 if( $tail > 0xbf ) {
729 $tail -= 0x40;
730 $mid = ord( $startChar{1} ) + 1;
731 if( $mid > 0xbf ) {
732 $startChar{0} = chr( ord( $startChar{0} ) + 1 );
733 $mid -= 0x40;
734 }
735 $startChar{1} = chr( $mid );
736 }
737 $startChar{2} = chr( $tail );
738 continue;
739 }
740 }
741 }
742 $out .= $startChar;
743 $out .= $combining;
744 $startChar = $c;
745 $combining = '';
746 $lastClass = 0;
747 }
748 $out .= $startChar . $combining;
749 return $out;
750 }
751
752 /**
753 * This is just used for the benchmark, comparing how long it takes to
754 * interate through a string without really doing anything of substance.
755 * @param string $string
756 * @return string
757 */
758 function placebo( $string ) {
759 $len = strlen( $string );
760 $out = '';
761 for( $i = 0; $i < $len; $i++ ) {
762 $out .= $string{$i};
763 }
764 return $out;
765 }
766 }
767
768 ?>