-
Notifications
You must be signed in to change notification settings - Fork 4.5k
/
pal_collation.c
1362 lines (1164 loc) · 52.7 KB
/
pal_collation.c
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
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
#include <assert.h>
#include <stdbool.h>
#include <stdlib.h>
#include <stdint.h>
#include <search.h>
#include <string.h>
#include "pal_errors_internal.h"
#include "pal_collation.h"
#include "pal_atomic.h"
c_static_assert_msg(UCOL_EQUAL == 0, "managed side requires 0 for equal strings");
c_static_assert_msg(UCOL_LESS < 0, "managed side requires less than zero for a < b");
c_static_assert_msg(UCOL_GREATER > 0, "managed side requires greater than zero for a > b");
c_static_assert_msg(USEARCH_DONE == -1, "managed side requires -1 for not found");
#define UCOL_IGNORABLE 0
#define UCOL_PRIMARYORDERMASK ((int32_t)0xFFFF0000)
#define UCOL_SECONDARYORDERMASK 0x0000FF00
#define UCOL_TERTIARYORDERMASK 0x000000FF
#define CompareOptionsIgnoreCase 0x1
#define CompareOptionsIgnoreNonSpace 0x2
#define CompareOptionsIgnoreSymbols 0x4
#define CompareOptionsIgnoreKanaType 0x8
#define CompareOptionsIgnoreWidth 0x10
#define CompareOptionsMask 0x1f
// #define CompareOptionsStringSort 0x20000000
// ICU's default is to use "StringSort", i.e. nonalphanumeric symbols come before alphanumeric.
// When StringSort is not specified (.NET's default), the sort order will be different between
// Windows and Unix platforms. The nonalphanumeric symbols will come after alphanumeric
// characters on Windows, but before on Unix.
// Since locale - specific string sort order can change from one version of Windows to the next,
// there is no reason to guarantee string sort order between Windows and ICU. Thus trying to
// change ICU's default behavior here isn't really justified unless someone has a strong reason
// for !StringSort to behave differently.
#define USED_STRING_SEARCH ((UStringSearch*) (-1))
typedef struct { int32_t key; UCollator* UCollator; } TCollatorMap;
typedef struct SearchIteratorNode
{
UStringSearch* searchIterator;
struct SearchIteratorNode* next;
} SearchIteratorNode;
/*
* For increased performance, we cache the UCollator objects for a locale and
* share them across threads. This is safe (and supported in ICU) if we ensure
* multiple threads are only ever dealing with const UCollators.
*/
struct SortHandle
{
UCollator* collatorsPerOption[CompareOptionsMask + 1];
SearchIteratorNode searchIteratorList[CompareOptionsMask + 1];
};
// Hiragana character range
static const UChar hiraganaStart = 0x3041;
static const UChar hiraganaEnd = 0x309e;
static const UChar hiraganaToKatakanaOffset = 0x30a1 - 0x3041;
// Length of the fullwidth characters from 'A' to 'Z'
// We'll use it to map the casing of the full width 'A' to 'Z' characters
static const int32_t FullWidthAlphabetRangeLength = 0xFF3A - 0xFF21 + 1;
// Mapping between half- and fullwidth characters.
// LowerChars are the characters that should sort lower than HigherChars
static const UChar g_HalfFullLowerChars[] = {
// halfwidth characters
0x0021, 0x0022, 0x0023, 0x0024, 0x0025, 0x0026, 0x0027, 0x0028, 0x0029, 0x002a, 0x002b, 0x002c, 0x002d, 0x002e, 0x002f,
0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037, 0x0038, 0x0039, 0x003a, 0x003b, 0x003c, 0x003d, 0x003e,
0x003f, 0x0040, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047, 0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d,
0x004e, 0x004f, 0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057, 0x0058, 0x0059, 0x005a, 0x005b, 0x005d,
0x005e, 0x005f, 0x0060, 0x0061, 0x0062, 0x0063, 0x0064, 0x0065, 0x0066, 0x0067, 0x0068, 0x0069, 0x006a, 0x006b, 0x006c,
0x006d, 0x006e, 0x006f, 0x0070, 0x0071, 0x0072, 0x0073, 0x0074, 0x0075, 0x0076, 0x0077, 0x0078, 0x0079, 0x007a, 0x007b,
0x007c, 0x007d, 0x007e, 0x00a2, 0x00a3, 0x00ac, 0x00af, 0x00a6, 0x00a5, 0x20a9,
// fullwidth characters
0x3002, 0x300c, 0x300d, 0x3001, 0x30fb, 0x30f2, 0x30a1, 0x30a3, 0x30a5, 0x30a7, 0x30a9, 0x30e3, 0x30e5, 0x30e7, 0x30c3,
0x30a2, 0x30a4, 0x30a6, 0x30a8, 0x30aa, 0x30ab, 0x30ad, 0x30af, 0x30b1, 0x30b3, 0x30b5, 0x30b7, 0x30b9, 0x30bb, 0x30bd,
0x30bf, 0x30c1, 0x30c4, 0x30c6, 0x30c8, 0x30ca, 0x30cb, 0x30cc, 0x30cd, 0x30ce, 0x30cf, 0x30d2, 0x30d5, 0x30d8, 0x30db,
0x30de, 0x30df, 0x30e0, 0x30e1, 0x30e2, 0x30e4, 0x30e6, 0x30e8, 0x30e9, 0x30ea, 0x30eb, 0x30ec, 0x30ed, 0x30ef, 0x30f3,
0x3164, 0x3131, 0x3132, 0x3133, 0x3134, 0x3135, 0x3136, 0x3137, 0x3138, 0x3139, 0x313a, 0x313b, 0x313c, 0x313d, 0x313e,
0x313f, 0x3140, 0x3141, 0x3142, 0x3143, 0x3144, 0x3145, 0x3146, 0x3147, 0x3148, 0x3149, 0x314a, 0x314b, 0x314c, 0x314d,
0x314e, 0x314f, 0x3150, 0x3151, 0x3152, 0x3153, 0x3154, 0x3155, 0x3156, 0x3157, 0x3158, 0x3159, 0x315a, 0x315b, 0x315c,
0x315d, 0x315e, 0x315f, 0x3160, 0x3161, 0x3162, 0x3163
};
static const UChar g_HalfFullHigherChars[] = {
// fullwidth characters
0xff01, 0xff02, 0xff03, 0xff04, 0xff05, 0xff06, 0xff07, 0xff08, 0xff09, 0xff0a, 0xff0b, 0xff0c, 0xff0d, 0xff0e, 0xff0f,
0xff10, 0xff11, 0xff12, 0xff13, 0xff14, 0xff15, 0xff16, 0xff17, 0xff18, 0xff19, 0xff1a, 0xff1b, 0xff1c, 0xff1d, 0xff1e,
0xff1f, 0xff20, 0xff21, 0xff22, 0xff23, 0xff24, 0xff25, 0xff26, 0xff27, 0xff28, 0xff29, 0xff2a, 0xff2b, 0xff2c, 0xff2d,
0xff2e, 0xff2f, 0xff30, 0xff31, 0xff32, 0xff33, 0xff34, 0xff35, 0xff36, 0xff37, 0xff38, 0xff39, 0xff3a, 0xff3b, 0xff3d,
0xff3e, 0xff3f, 0xff40, 0xff41, 0xff42, 0xff43, 0xff44, 0xff45, 0xff46, 0xff47, 0xff48, 0xff49, 0xff4a, 0xff4b, 0xff4c,
0xff4d, 0xff4e, 0xff4f, 0xff50, 0xff51, 0xff52, 0xff53, 0xff54, 0xff55, 0xff56, 0xff57, 0xff58, 0xff59, 0xff5a, 0xff5b,
0xff5c, 0xff5d, 0xff5e, 0xffe0, 0xffe1, 0xffe2, 0xffe3, 0xffe4, 0xffe5, 0xffe6,
// halfwidth characters
0xff61, 0xff62, 0xff63, 0xff64, 0xff65, 0xff66, 0xff67, 0xff68, 0xff69, 0xff6a, 0xff6b, 0xff6c, 0xff6d, 0xff6e, 0xff6f,
0xff71, 0xff72, 0xff73, 0xff74, 0xff75, 0xff76, 0xff77, 0xff78, 0xff79, 0xff7a, 0xff7b, 0xff7c, 0xff7d, 0xff7e, 0xff7f,
0xff80, 0xff81, 0xff82, 0xff83, 0xff84, 0xff85, 0xff86, 0xff87, 0xff88, 0xff89, 0xff8a, 0xff8b, 0xff8c, 0xff8d, 0xff8e,
0xff8f, 0xff90, 0xff91, 0xff92, 0xff93, 0xff94, 0xff95, 0xff96, 0xff97, 0xff98, 0xff99, 0xff9a, 0xff9b, 0xff9c, 0xff9d,
0xffa0, 0xffa1, 0xffa2, 0xffa3, 0xffa4, 0xffa5, 0xffa6, 0xffa7, 0xffa8, 0xffa9, 0xffaa, 0xffab, 0xffac, 0xffad, 0xffae,
0xffaf, 0xffb0, 0xffb1, 0xffb2, 0xffb3, 0xffb4, 0xffb5, 0xffb6, 0xffb7, 0xffb8, 0xffb9, 0xffba, 0xffbb, 0xffbc, 0xffbd,
0xffbe, 0xffc2, 0xffc3, 0xffc4, 0xffc5, 0xffc6, 0xffc7, 0xffca, 0xffcb, 0xffcc, 0xffcd, 0xffce, 0xffcf, 0xffd2, 0xffd3,
0xffd4, 0xffd5, 0xffd6, 0xffd7, 0xffda, 0xffdb, 0xffdc
};
static const int32_t g_HalfFullCharsLength = (sizeof(g_HalfFullHigherChars) / sizeof(UChar));
// Hiragana without [semi-]voiced sound mark for custom collation rules
// If Hiragana with [semi-]voiced sound mark is added to custom collation rules, there is a conflict
// between the custom rule and some default rule.
static const UChar g_HiraganaWithoutVoicedSoundMarkChars[] = {
0x3041, 0x3042, 0x3043, 0x3044, 0x3045, 0x3046, 0x3047, 0x3048, 0x3049, 0x304A, 0x304B, 0x304D, 0x304F, 0x3051, 0x3053,
0x3055, 0x3057, 0x3059, 0x305B, 0x305D, 0x305F, 0x3061, 0x3063, 0x3064, 0x3066, 0x3068, 0x306A, 0x306B, 0x306C, 0x306D,
0x306E, 0x306F, 0x3072, 0x3075, 0x3078, 0x307B, 0x307E, 0x307F, 0x3080, 0x3081, 0x3082, 0x3083, 0x3084, 0x3085, 0x3086,
0x3087, 0x3088, 0x3089, 0x308A, 0x308B, 0x308C, 0x308D, 0x308E, 0x308F, 0x3090, 0x3091, 0x3092, 0x3093, 0x3095, 0x3096, 0x309D,
};
static const int32_t g_HiraganaWithoutVoicedSoundMarkCharsLength = (sizeof(g_HiraganaWithoutVoicedSoundMarkChars) / sizeof(UChar));
/*
ICU collation rules reserve any punctuation and whitespace characters for use in the syntax.
Thus, to use these characters in a rule, they need to be escaped.
This rule was taken from http://www.unicode.org/reports/tr35/tr35-collation.html#Rules.
*/
static int NeedsEscape(UChar character)
{
return ((0x21 <= character && character <= 0x2f)
|| (0x3a <= character && character <= 0x40)
|| (0x5b <= character && character <= 0x60)
|| (0x7b <= character && character <= 0x7e));
}
/*
Gets a value indicating whether the HalfFullHigher character is considered a symbol character.
The ranges specified here are only checking for characters in the g_HalfFullHigherChars list and needs
to be combined with NeedsEscape above with the g_HalfFullLowerChars for all the IgnoreSymbols characters.
This is done so we can use range checks instead of comparing individual characters.
These ranges were obtained by running the above characters through .NET CompareInfo.Compare
with CompareOptions.IgnoreSymbols on Windows.
*/
static int IsHalfFullHigherSymbol(UChar character)
{
return (0xffe0 <= character && character <= 0xffe6)
|| (0xff61 <= character && character <= 0xff65);
}
/*
Fill custom collation rules for ignoreKana cases.
Since the CompareOptions flags don't map 1:1 with ICU default functionality, we need to fall back to using
custom rules in order to support IgnoreKanaType and IgnoreWidth CompareOptions correctly.
*/
static void FillIgnoreKanaRules(UChar* completeRules, int32_t* fillIndex, int32_t completeRulesLength, int32_t isIgnoreKanaType)
{
assert((*fillIndex) + (4 * (hiraganaEnd - hiraganaStart + 1)) <= completeRulesLength);
if ((*fillIndex) + (4 * (hiraganaEnd - hiraganaStart + 1)) > completeRulesLength) // check the allocated the size
{
return;
}
if (isIgnoreKanaType)
{
for (UChar hiraganaChar = hiraganaStart; hiraganaChar <= hiraganaEnd; hiraganaChar++)
{
// Hiragana is the range 3041 to 3096 & 309D & 309E
if (hiraganaChar <= 0x3096 || hiraganaChar >= 0x309D) // characters between 3096 and 309D are not mapped to katakana
{
completeRules[*fillIndex] = '&';
completeRules[(*fillIndex) + 1] = hiraganaChar;
completeRules[(*fillIndex) + 2] = '=';
completeRules[(*fillIndex) + 3] = hiraganaChar + hiraganaToKatakanaOffset;
(*fillIndex) += 4;
}
}
}
else
{
// Avoid conflicts between default [semi-]voiced sound mark rules and custom rules
for (int i = 0; i < g_HiraganaWithoutVoicedSoundMarkCharsLength; i++)
{
UChar hiraganaChar = g_HiraganaWithoutVoicedSoundMarkChars[i];
completeRules[*fillIndex] = '&';
completeRules[(*fillIndex) + 1] = hiraganaChar;
completeRules[(*fillIndex) + 2] = '<';
completeRules[(*fillIndex) + 3] = hiraganaChar + hiraganaToKatakanaOffset;
(*fillIndex) += 4;
}
}
}
/*
Fill custom collation rules for ignoreWidth cases.
Since the CompareOptions flags don't map 1:1 with ICU default functionality, we need to fall back to using
custom rules in order to support IgnoreKanaType and IgnoreWidth CompareOptions correctly.
*/
static void FillIgnoreWidthRules(UChar* completeRules, int32_t* fillIndex, int32_t completeRulesLength, int32_t isIgnoreWidth, int32_t isIgnoreCase, int32_t isIgnoreSymbols)
{
UChar compareChar = isIgnoreWidth ? '=' : '<';
UChar lowerChar;
UChar higherChar;
int needsEscape;
assert((*fillIndex) + (5 * g_HalfFullCharsLength) <= completeRulesLength);
if ((*fillIndex) + (5 * g_HalfFullCharsLength) > completeRulesLength)
{
return;
}
for (int i = 0; i < g_HalfFullCharsLength; i++)
{
lowerChar = g_HalfFullLowerChars[i];
higherChar = g_HalfFullHigherChars[i];
// the lower chars need to be checked for escaping since they contain ASCII punctuation
needsEscape = NeedsEscape(lowerChar);
// when isIgnoreSymbols is true and we are not ignoring width, check to see if
// this character is a symbol, and if so skip it
if (!(isIgnoreSymbols && (!isIgnoreWidth) && (needsEscape || IsHalfFullHigherSymbol(higherChar))))
{
completeRules[*fillIndex] = '&';
(*fillIndex)++;
if (needsEscape)
{
completeRules[*fillIndex] = '\\';
(*fillIndex)++;
}
completeRules[*fillIndex] = lowerChar;
completeRules[(*fillIndex) + 1] = compareChar;
completeRules[(*fillIndex) + 2] = higherChar;
(*fillIndex) += 3;
}
}
// When we have isIgnoreWidth is false, we sort the normal width latin alphabet characters before the full width latin alphabet characters
// e.g. `a` < `ａ` (\uFF41)
// This break the casing of the full width latin alphabet characters.
// e.g. `ａ` (\uFF41) == `Ａ` (\uFF21).
// we are fixing back this case mapping here.
if (isIgnoreCase && (!isIgnoreWidth))
{
assert((*fillIndex) + (FullWidthAlphabetRangeLength * 4) <= completeRulesLength);
const int UpperCaseToLowerCaseOffset = 0xFF41 - 0xFF21;
for (UChar ch = 0xFF21; ch <= 0xFF3A; ch++)
{
completeRules[*fillIndex] = '&';
completeRules[(*fillIndex) + 1] = ch + UpperCaseToLowerCaseOffset;
completeRules[(*fillIndex) + 2] = '=';
completeRules[(*fillIndex) + 3] = ch;
(*fillIndex) += 4;
}
}
}
/*
* The collator returned by this function is owned by the callee and must be
* closed when this method returns with a U_SUCCESS UErrorCode.
*
* On error, the return value is undefined.
*/
static UCollator* CloneCollatorWithOptions(const UCollator* pCollator, int32_t options, UErrorCode* pErr)
{
UColAttributeValue strength = ucol_getStrength(pCollator);
int32_t isIgnoreCase = (options & CompareOptionsIgnoreCase) == CompareOptionsIgnoreCase;
int32_t isIgnoreNonSpace = (options & CompareOptionsIgnoreNonSpace) == CompareOptionsIgnoreNonSpace;
int32_t isIgnoreSymbols = (options & CompareOptionsIgnoreSymbols) == CompareOptionsIgnoreSymbols;
int32_t isIgnoreKanaType = (options & CompareOptionsIgnoreKanaType) == CompareOptionsIgnoreKanaType;
int32_t isIgnoreWidth = (options & CompareOptionsIgnoreWidth) == CompareOptionsIgnoreWidth;
if (isIgnoreCase)
{
strength = UCOL_SECONDARY;
}
if (isIgnoreNonSpace)
{
strength = UCOL_PRIMARY;
}
UCollator* pClonedCollator;
// IgnoreWidth - it would be easy to IgnoreWidth by just setting Strength <= Secondary.
// For any strength under that, the width of the characters will be ignored.
// For strength above that, the width of the characters will be used in differentiation.
// a. However, this doesn’t play nice with IgnoreCase, since these Strength levels are overloaded.
// b. So the plan to support IgnoreWidth is to use customized rules.
// i. Since the character width is differentiated at “Tertiary” strength, we only need to use custom rules in specific cases.
// ii. If (IgnoreWidth == true && Strength > “Secondary”)
// 1. Build up a custom rule set for each half-width character and say that it is equal to the corresponding full-width character.
// a. ex: “0x30F2 = 0xFF66 & 0x30F3 = 0xFF9D & …”
// iii. If (IgnoreWidth == false && Strength <= “Secondary”)
// 1. Build up a custom rule set saying that the half-width and full-width characters have a primary level difference (which will cause it always to be unequal)
// a. Ex. “0x30F2 < 0xFF66 & 0x30F3 < 0xFF9D & …”
// IgnoreKanaType – this works the same way as IgnoreWidth, it uses the set of Hiragana and Katakana characters instead of half-width vs full-width characters to build the rules.
int32_t applyIgnoreKanaTypeCustomRule = isIgnoreKanaType ^ (strength < UCOL_TERTIARY); // kana differs at the tertiary level
int32_t applyIgnoreWidthTypeCustomRule = isIgnoreWidth ^ (strength < UCOL_TERTIARY); // character width differs at the tertiary level
int32_t customRuleLength = 0;
if (applyIgnoreKanaTypeCustomRule || applyIgnoreWidthTypeCustomRule)
{
// If we need to create customRules, the KanaType custom rule will be 88 kana characters * 4 = 352 chars long
// and the Width custom rule will be at most 212 halfwidth characters * 5 = 1060 chars long.
customRuleLength = (applyIgnoreKanaTypeCustomRule ? 4 * (hiraganaEnd - hiraganaStart + 1) : 0) +
(applyIgnoreWidthTypeCustomRule ? ((5 * g_HalfFullCharsLength) + (isIgnoreCase ? 4 * FullWidthAlphabetRangeLength : 0)) : 0) +
1; // Adding extra terminator rule at the end to force ICU apply last actual entered rule, otherwise last actual rule get ignored.
}
if (customRuleLength == 0)
{
#if !defined(STATIC_ICU)
if (ucol_clone_ptr != NULL)
{
pClonedCollator = ucol_clone(pCollator, pErr);
}
else
{
pClonedCollator = ucol_safeClone_ptr(pCollator, NULL, NULL, pErr);
}
#else // !defined(STATIC_ICU)
#if HAVE_UCOL_CLONE
pClonedCollator = ucol_clone(pCollator, pErr);
#else
pClonedCollator = ucol_safeClone(pCollator, NULL, NULL, pErr);
#endif // HAVE_UCOL_CLONE
#endif // !defined(STATIC_ICU)
}
else
{
int32_t rulesLength;
const UChar* localeRules = ucol_getRules(pCollator, &rulesLength);
int32_t completeRulesLength = rulesLength + customRuleLength + 1;
UChar* completeRules = (UChar*)calloc((size_t)completeRulesLength, sizeof(UChar));
for (int i = 0; i < rulesLength; i++)
{
completeRules[i] = localeRules[i];
}
if (applyIgnoreKanaTypeCustomRule)
{
FillIgnoreKanaRules(completeRules, &rulesLength, completeRulesLength, isIgnoreKanaType);
}
assert(rulesLength <= completeRulesLength);
if (applyIgnoreWidthTypeCustomRule)
{
FillIgnoreWidthRules(completeRules, &rulesLength, completeRulesLength, isIgnoreWidth, isIgnoreCase, isIgnoreSymbols);
}
assert(rulesLength + 4 <= completeRulesLength);
// Adding extra terminator rule at the end to force ICU apply last actual entered rule, otherwise last actual rule get ignored.
completeRules[rulesLength] = '&';
completeRules[rulesLength + 1] = 'a';
completeRules[rulesLength + 2] = '=';
completeRules[rulesLength + 3] = 'a';
rulesLength += 4;
pClonedCollator = ucol_openRules(completeRules, rulesLength, UCOL_DEFAULT, strength, NULL, pErr);
free(completeRules);
}
if (isIgnoreSymbols)
{
ucol_setAttribute(pClonedCollator, UCOL_ALTERNATE_HANDLING, UCOL_SHIFTED, pErr);
#if !defined(STATIC_ICU)
if (ucol_setMaxVariable_ptr != NULL)
{
// by default, ICU alternate shifted handling only ignores punctuation, but
// IgnoreSymbols needs symbols and currency as well, so change the "variable top"
// to include all symbols and currency
ucol_setMaxVariable(pClonedCollator, UCOL_REORDER_CODE_CURRENCY, pErr);
}
else
{
assert(ucol_setVariableTop_ptr != NULL);
// 0xfdfc is the last currency character before the first digit character
// in http://source.icu-project.org/repos/icu/icu/tags/release-52-1/source/data/unidata/FractionalUCA.txt
const UChar ignoreSymbolsVariableTop[] = { 0xfdfc };
ucol_setVariableTop_ptr(pClonedCollator, ignoreSymbolsVariableTop, 1, pErr);
}
#else // !defined(STATIC_ICU)
// by default, ICU alternate shifted handling only ignores punctuation, but
// IgnoreSymbols needs symbols and currency as well, so change the "variable top"
// to include all symbols and currency
#if HAVE_SET_MAX_VARIABLE
ucol_setMaxVariable(pClonedCollator, UCOL_REORDER_CODE_CURRENCY, pErr);
#else
// 0xfdfc is the last currency character before the first digit character
// in http://source.icu-project.org/repos/icu/icu/tags/release-52-1/source/data/unidata/FractionalUCA.txt
const UChar ignoreSymbolsVariableTop[] = { 0xfdfc };
ucol_setVariableTop(pClonedCollator, ignoreSymbolsVariableTop, 1, pErr);
#endif
#endif //!defined(STATIC_ICU)
}
ucol_setAttribute(pClonedCollator, UCOL_STRENGTH, strength, pErr);
// casing differs at the tertiary level.
// if strength is less than tertiary, but we are not ignoring case, then we need to flip CASE_LEVEL On
if (strength < UCOL_TERTIARY && !isIgnoreCase)
{
ucol_setAttribute(pClonedCollator, UCOL_CASE_LEVEL, UCOL_ON, pErr);
}
return pClonedCollator;
}
// Returns TRUE if all the collation elements in str are completely ignorable
static int CanIgnoreAllCollationElements(const UCollator* pColl, const UChar* lpStr, int32_t length)
{
int result = true;
UErrorCode err = U_ZERO_ERROR;
UCollationElements* pCollElem = ucol_openElements(pColl, lpStr, length, &err);
if (U_SUCCESS(err))
{
int32_t curCollElem = UCOL_NULLORDER;
while ((curCollElem = ucol_next(pCollElem, &err)) != UCOL_NULLORDER)
{
if (curCollElem != UCOL_IGNORABLE)
{
result = false;
break;
}
}
ucol_closeElements(pCollElem);
}
return U_SUCCESS(err) ? result : false;
}
static void CreateSortHandle(SortHandle** ppSortHandle)
{
*ppSortHandle = (SortHandle*)calloc(1, sizeof(SortHandle));
if ((*ppSortHandle) == NULL)
{
return;
}
memset(*ppSortHandle, 0, sizeof(SortHandle));
}
ResultCode GlobalizationNative_GetSortHandle(const char* lpLocaleName, SortHandle** ppSortHandle)
{
assert(ppSortHandle != NULL);
CreateSortHandle(ppSortHandle);
if ((*ppSortHandle) == NULL)
{
return GetResultCode(U_MEMORY_ALLOCATION_ERROR);
}
UErrorCode err = U_ZERO_ERROR;
(*ppSortHandle)->collatorsPerOption[0] = ucol_open(lpLocaleName, &err);
if (U_FAILURE(err))
{
free(*ppSortHandle);
(*ppSortHandle) = NULL;
}
return GetResultCode(err);
}
static const char* BreakIteratorRuleOld = // supported on ICU like versions 52
"$CR = [\\p{Grapheme_Cluster_Break = CR}]; \n" \
"$LF = [\\p{Grapheme_Cluster_Break = LF}]; \n" \
"$Control = [\\p{Grapheme_Cluster_Break = Control}]; \n" \
"$Extend = [\\p{Grapheme_Cluster_Break = Extend}]; \n" \
"$SpacingMark = [\\p{Grapheme_Cluster_Break = SpacingMark}]; \n" \
"$Regional_Indicator = [\\p{Grapheme_Cluster_Break = Regional_Indicator}]; \n" \
"$L = [\\p{Grapheme_Cluster_Break = L}]; \n" \
"$V = [\\p{Grapheme_Cluster_Break = V}]; \n" \
"$T = [\\p{Grapheme_Cluster_Break = T}]; \n" \
"$LV = [\\p{Grapheme_Cluster_Break = LV}]; \n" \
"$LVT = [\\p{Grapheme_Cluster_Break = LVT}]; \n" \
"!!chain; \n" \
"!!forward; \n" \
"$L ($L | $V | $LV | $LVT); \n" \
"($LV | $V) ($V | $T); \n" \
"($LVT | $T) $T; \n" \
"$Regional_Indicator $Regional_Indicator; \n" \
"[^$Control $CR $LF] $Extend; \n" \
"[^$Control $CR $LF] $SpacingMark; \n" \
"!!reverse; \n" \
"($L | $V | $LV | $LVT) $L; \n" \
"($V | $T) ($LV | $V); \n" \
"$T ($LVT | $T); \n" \
"$Regional_Indicator $Regional_Indicator; \n" \
"$Extend [^$Control $CR $LF]; \n" \
"$SpacingMark [^$Control $CR $LF]; \n" \
"!!safe_reverse; \n" \
"!!safe_forward; \n";
static const char* BreakIteratorRuleNew = // supported on newer ICU versions like 62 and up
"!!quoted_literals_only; \n" \
"$CR = [\\p{Grapheme_Cluster_Break = CR}]; \n" \
"$LF = [\\p{Grapheme_Cluster_Break = LF}]; \n" \
"$Control = [[\\p{Grapheme_Cluster_Break = Control}]]; \n" \
"$Extend = [[\\p{Grapheme_Cluster_Break = Extend}]]; \n" \
"$ZWJ = [\\p{Grapheme_Cluster_Break = ZWJ}]; \n" \
"$Regional_Indicator = [\\p{Grapheme_Cluster_Break = Regional_Indicator}]; \n" \
"$Prepend = [\\p{Grapheme_Cluster_Break = Prepend}]; \n" \
"$SpacingMark = [\\p{Grapheme_Cluster_Break = SpacingMark}]; \n" \
"$Virama = [\\p{Gujr}\\p{sc=Telu}\\p{sc=Mlym}\\p{sc=Orya}\\p{sc=Beng}\\p{sc=Deva}&\\p{Indic_Syllabic_Category=Virama}]; \n" \
"$LinkingConsonant = [\\p{Gujr}\\p{sc=Telu}\\p{sc=Mlym}\\p{sc=Orya}\\p{sc=Beng}\\p{sc=Deva}&\\p{Indic_Syllabic_Category=Consonant}]; \n" \
"$ExtCccZwj = [[\\p{gcb=Extend}-\\p{ccc=0}] \\p{gcb=ZWJ}]; \n" \
"$L = [\\p{Grapheme_Cluster_Break = L}]; \n" \
"$V = [\\p{Grapheme_Cluster_Break = V}]; \n" \
"$T = [\\p{Grapheme_Cluster_Break = T}]; \n" \
"$LV = [\\p{Grapheme_Cluster_Break = LV}]; \n" \
"$LVT = [\\p{Grapheme_Cluster_Break = LVT}]; \n" \
"$Extended_Pict = [:ExtPict:]; \n" \
"!!chain; \n" \
"!!lookAheadHardBreak; \n" \
"$L ($L | $V | $LV | $LVT); \n" \
"($LV | $V) ($V | $T); \n" \
"($LVT | $T) $T; \n" \
"[^$Control $CR $LF] ($Extend | $ZWJ); \n" \
"[^$Control $CR $LF] $SpacingMark; \n" \
"$Prepend [^$Control $CR $LF]; \n" \
"$LinkingConsonant $ExtCccZwj* $Virama $ExtCccZwj* $LinkingConsonant; \n" \
"$Extended_Pict $Extend* $ZWJ $Extended_Pict; \n" \
"^$Prepend* $Regional_Indicator $Regional_Indicator / $Regional_Indicator; \n" \
"^$Prepend* $Regional_Indicator $Regional_Indicator; \n" \
".;";
static UChar* s_breakIteratorRules = NULL;
// When doing string search operations using ICU, it is internally using a break iterator which doesn't allow breaking between some characters according to
// the Grapheme Cluster Boundary Rules specified in http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules.
// Unfortunately, not all rules will have the desired behavior we need to get in .NET. For example, the rules don't allow breaking between CR '\r' and LF '\n' characters.
// When searching for "\n" in a string like "\r\n", will get not found result.
// We are customizing the break iterator to exclude the CRxLF rule which don't allow breaking between CR and LF.
// The general rules syntax explained in the doc https://unicode-org.github.io/icu/userguide/boundaryanalysis/break-rules.html.
// The ICU latest rules definition exist here https://github.com/unicode-org/icu/blob/main/icu4c/source/data/brkitr/rules/char.txt.
static UBreakIterator* CreateCustomizedBreakIterator(void)
{
static UChar emptyString[1];
UBreakIterator* breaker;
UErrorCode status = U_ZERO_ERROR;
if (s_breakIteratorRules != NULL)
{
breaker = ubrk_openRules(s_breakIteratorRules, -1, emptyString, 0, NULL, &status);
return U_FAILURE(status) ? NULL : breaker;
}
int32_t oldRulesLength = (int32_t)strlen(BreakIteratorRuleOld);
int32_t newRulesLength = (int32_t)strlen(BreakIteratorRuleNew);
int32_t breakIteratorRulesLength = newRulesLength > oldRulesLength ? newRulesLength : oldRulesLength;
UChar* rules = (UChar*)calloc((size_t)breakIteratorRulesLength + 1, sizeof(UChar));
if (rules == NULL)
{
return NULL;
}
u_uastrncpy(rules, BreakIteratorRuleNew, newRulesLength);
rules[newRulesLength] = '\0';
breaker = ubrk_openRules(rules, newRulesLength, emptyString, 0, NULL, &status);
if (U_FAILURE(status))
{
status = U_ZERO_ERROR;
u_uastrncpy(rules, BreakIteratorRuleOld, oldRulesLength);
rules[oldRulesLength] = '\0';
breaker = ubrk_openRules(rules, oldRulesLength, emptyString, 0, NULL, &status);
}
if (U_FAILURE(status))
{
free(rules);
return NULL;
}
UChar* pNull = NULL;
if (!pal_atomic_cas_ptr((void* volatile*)&s_breakIteratorRules, rules, pNull))
{
free(rules);
assert(s_breakIteratorRules != NULL);
}
return breaker;
}
static void CloseSearchIterator(UStringSearch* pSearch)
{
assert(pSearch != NULL);
#if !defined(TARGET_WINDOWS)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wcast-qual"
#endif
UBreakIterator* breakIterator = (UBreakIterator*)usearch_getBreakIterator(pSearch);
#if !defined(TARGET_WINDOWS)
#pragma GCC diagnostic pop
#endif
usearch_close(pSearch);
if (breakIterator != NULL)
{
ubrk_close(breakIterator);
}
}
void GlobalizationNative_CloseSortHandle(SortHandle* pSortHandle)
{
for (int i = 0; i <= CompareOptionsMask; i++)
{
if (pSortHandle->collatorsPerOption[i] != NULL)
{
UStringSearch* pSearch = pSortHandle->searchIteratorList[i].searchIterator;
if (pSearch != NULL)
{
if (pSearch != USED_STRING_SEARCH)
{
CloseSearchIterator(pSearch);
}
pSortHandle->searchIteratorList[i].searchIterator = NULL;
SearchIteratorNode* pNext = pSortHandle->searchIteratorList[i].next;
pSortHandle->searchIteratorList[i].next = NULL;
while (pNext != NULL)
{
if (pNext->searchIterator != NULL && pNext->searchIterator != USED_STRING_SEARCH)
{
CloseSearchIterator(pNext->searchIterator);
}
SearchIteratorNode* pCurrent = pNext;
pNext = pCurrent->next;
free(pCurrent);
}
}
ucol_close(pSortHandle->collatorsPerOption[i]);
pSortHandle->collatorsPerOption[i] = NULL;
}
}
free(pSortHandle);
}
static const UCollator* GetCollatorFromSortHandle(SortHandle* pSortHandle, int32_t options, UErrorCode* pErr)
{
if (options == 0)
{
return pSortHandle->collatorsPerOption[0];
}
else
{
options &= CompareOptionsMask;
UCollator* pCollator = pSortHandle->collatorsPerOption[options];
if (pCollator != NULL)
{
return pCollator;
}
pCollator = CloneCollatorWithOptions(pSortHandle->collatorsPerOption[0], options, pErr);
UCollator* pNull = NULL;
if (!pal_atomic_cas_ptr((void* volatile*)&pSortHandle->collatorsPerOption[options], pCollator, pNull))
{
ucol_close(pCollator);
pCollator = pSortHandle->collatorsPerOption[options];
assert(pCollator != NULL && "pCollator not expected to be null here.");
}
return pCollator;
}
}
// CreateNewSearchNode will create a new node in the linked list and mark this node search handle as borrowed handle.
static inline int32_t CreateNewSearchNode(SortHandle* pSortHandle, int32_t options)
{
SearchIteratorNode* node = (SearchIteratorNode*)calloc(1, sizeof(SearchIteratorNode));
if (node == NULL)
{
return false;
}
node->searchIterator = USED_STRING_SEARCH; // Mark the new node search handle as borrowed.
node->next = NULL;
SearchIteratorNode* pCurrent = &pSortHandle->searchIteratorList[options];
assert(pCurrent->searchIterator != NULL && "Search iterator not expected to be NULL at this stage.");
SearchIteratorNode* pNull = NULL;
do
{
if (pCurrent->next == NULL && pal_atomic_cas_ptr((void* volatile*)&(pCurrent->next), node, pNull))
{
break;
}
assert(pCurrent->next != NULL && "next pointer shouldn't be null.");
pCurrent = pCurrent->next;
} while (true);
return true;
}
// Restore previously borrowed search handle to the linked list.
static inline int32_t RestoreSearchHandle(SortHandle* pSortHandle, UStringSearch* pSearchIterator, int32_t options)
{
SearchIteratorNode* pCurrent = &pSortHandle->searchIteratorList[options];
while (pCurrent != NULL)
{
if (pCurrent->searchIterator == USED_STRING_SEARCH && pal_atomic_cas_ptr((void* volatile*)&(pCurrent->searchIterator), pSearchIterator, USED_STRING_SEARCH))
{
return true;
}
pCurrent = pCurrent->next;
}
return false;
}
// return -1 if couldn't borrow search handle from the SortHandle cache, otherwise, it return the slot number of the cache.
static int32_t GetSearchIteratorUsingCollator(
SortHandle* pSortHandle,
const UCollator* pColl,
const UChar* lpTarget,
int32_t cwTargetLength,
const UChar* lpSource,
int32_t cwSourceLength,
int32_t options,
UStringSearch** pSearchIterator)
{
options &= CompareOptionsMask;
*pSearchIterator = pSortHandle->searchIteratorList[options].searchIterator;
UErrorCode err = U_ZERO_ERROR;
if (*pSearchIterator == NULL)
{
UBreakIterator* breakIterator = CreateCustomizedBreakIterator();
*pSearchIterator = usearch_openFromCollator(lpTarget, cwTargetLength, lpSource, cwSourceLength, pColl, breakIterator, &err);
if (!U_SUCCESS(err))
{
if (breakIterator != NULL)
{
ubrk_close(breakIterator);
}
assert(false && "Couldn't open the search iterator.");
return -1;
}
UStringSearch* pNull = NULL;
if (!pal_atomic_cas_ptr((void* volatile*)&(pSortHandle->searchIteratorList[options].searchIterator), USED_STRING_SEARCH, pNull))
{
if (!CreateNewSearchNode(pSortHandle, options))
{
CloseSearchIterator(*pSearchIterator);
return -1;
}
}
return options;
}
assert(*pSearchIterator != NULL && "Should having a valid search handle at this stage.");
SearchIteratorNode* pCurrent = &pSortHandle->searchIteratorList[options];
while (*pSearchIterator == USED_STRING_SEARCH || !pal_atomic_cas_ptr((void* volatile*)&(pCurrent->searchIterator), USED_STRING_SEARCH, *pSearchIterator))
{
pCurrent = pCurrent->next;
if (pCurrent == NULL)
{
*pSearchIterator = NULL;
break;
}
*pSearchIterator = pCurrent->searchIterator;
}
if (*pSearchIterator == NULL) // Couldn't find any available handle to borrow then create a new one.
{
UBreakIterator* breakIterator = CreateCustomizedBreakIterator();
*pSearchIterator = usearch_openFromCollator(lpTarget, cwTargetLength, lpSource, cwSourceLength, pColl, breakIterator, &err);
if (!U_SUCCESS(err))
{
if (breakIterator != NULL)
{
ubrk_close(breakIterator);
}
assert(false && "Couldn't open a new search iterator.");
return -1;
}
if (!CreateNewSearchNode(pSortHandle, options))
{
CloseSearchIterator(*pSearchIterator);
return -1;
}
return options;
}
usearch_setText(*pSearchIterator, lpSource, cwSourceLength, &err);
if (!U_SUCCESS(err))
{
int32_t r;
(void)r;
r = RestoreSearchHandle(pSortHandle, *pSearchIterator, options);
assert(r && "restoring search handle shouldn't fail.");
return -1;
}
usearch_setPattern(*pSearchIterator, lpTarget, cwTargetLength, &err);
if (!U_SUCCESS(err))
{
int32_t r;
(void)r;
r = RestoreSearchHandle(pSortHandle, *pSearchIterator, options);
assert(r && "restoring search handle shouldn't fail.");
return -1;
}
return options;
}
// return -1 if couldn't borrow search handle from the SortHandle cache, otherwise, it return the slot number of the cache.
static inline int32_t GetSearchIterator(
SortHandle* pSortHandle,
const UChar* lpTarget,
int32_t cwTargetLength,
const UChar* lpSource,
int32_t cwSourceLength,
int32_t options,
UStringSearch** pSearchIterator)
{
UErrorCode err = U_ZERO_ERROR;
const UCollator* pColl = GetCollatorFromSortHandle(pSortHandle, options, &err);
if (!U_SUCCESS(err))
{
assert(false && "Couldn't get the collator.");
return -1;
}
return GetSearchIteratorUsingCollator(
pSortHandle,
pColl,
lpTarget,
cwTargetLength,
lpSource,
cwSourceLength,
options,
pSearchIterator);
}
int32_t GlobalizationNative_GetSortVersion(SortHandle* pSortHandle)
{
UErrorCode err = U_ZERO_ERROR;
const UCollator* pColl = GetCollatorFromSortHandle(pSortHandle, 0, &err);
int32_t result = -1;
if (U_SUCCESS(err))
{
ucol_getVersion(pColl, (uint8_t *) &result);
}
else
{
assert(false && "Unexpected ucol_getVersion to fail.");
}
return result;
}
/*
Function:
CompareString
*/
int32_t GlobalizationNative_CompareString(
SortHandle* pSortHandle, const UChar* lpStr1, int32_t cwStr1Length, const UChar* lpStr2, int32_t cwStr2Length, int32_t options)
{
UCollationResult result = UCOL_EQUAL;
UErrorCode err = U_ZERO_ERROR;
const UCollator* pColl = GetCollatorFromSortHandle(pSortHandle, options, &err);
if (U_SUCCESS(err))
{
// Workaround for https://unicode-org.atlassian.net/projects/ICU/issues/ICU-9396
// The ucol_strcoll routine on some older versions of ICU doesn't correctly
// handle nullptr inputs. We'll play defensively and always flow a non-nullptr.
UChar dummyChar = 0;
if (lpStr1 == NULL)
{
lpStr1 = &dummyChar;
}
if (lpStr2 == NULL)
{
lpStr2 = &dummyChar;
}
result = ucol_strcoll(pColl, lpStr1, cwStr1Length, lpStr2, cwStr2Length);
}
return result;
}
/*
Function:
IndexOf
*/
int32_t GlobalizationNative_IndexOf(
SortHandle* pSortHandle,
const UChar* lpTarget,
int32_t cwTargetLength,
const UChar* lpSource,
int32_t cwSourceLength,
int32_t options,
int32_t* pMatchedLength)
{
assert(cwTargetLength > 0);
int32_t result = USEARCH_DONE;
// It's possible somebody passed us (source = <empty>, target = <non-empty>).
// ICU's usearch_* APIs don't handle empty source inputs properly. However,
// if this occurs the user really just wanted us to perform an equality check.
// We can't short-circuit the operation because depending on the collation in
// use, certain code points may have zero weight, which means that empty
// strings may compare as equal to non-empty strings.
if (cwSourceLength == 0)
{
result = GlobalizationNative_CompareString(pSortHandle, lpTarget, cwTargetLength, lpSource, cwSourceLength, options);
if (result == UCOL_EQUAL && pMatchedLength != NULL)
{
*pMatchedLength = cwSourceLength;
}
return (result == UCOL_EQUAL) ? 0 : -1;
}
UErrorCode err = U_ZERO_ERROR;
UStringSearch* pSearch;
int32_t searchCacheSlot = GetSearchIterator(pSortHandle, lpTarget, cwTargetLength, lpSource, cwSourceLength, options, &pSearch);
if (searchCacheSlot < 0)
{
return result;
}
result = usearch_first(pSearch, &err);
// if the search was successful,
// we'll try to get the matched string length.
if (result != USEARCH_DONE && pMatchedLength != NULL)
{
*pMatchedLength = usearch_getMatchedLength(pSearch);
}
RestoreSearchHandle(pSortHandle, pSearch, searchCacheSlot);
return result;
}
/*
Function:
LastIndexOf
*/
int32_t GlobalizationNative_LastIndexOf(
SortHandle* pSortHandle,
const UChar* lpTarget,
int32_t cwTargetLength,
const UChar* lpSource,
int32_t cwSourceLength,