| 1 |
/* Canonical composition of Unicode characters. |
| 2 |
Copyright (C) 2002, 2006, 2009, 2011-2026 Free Software Foundation, Inc. |
| 3 |
Written by Bruno Haible <[email protected]>, 2009. |
| 4 |
|
| 5 |
This file is free software: you can redistribute it and/or modify |
| 6 |
it under the terms of the GNU Lesser General Public License as |
| 7 |
published by the Free Software Foundation; either version 2.1 of the |
| 8 |
License, or (at your option) any later version. |
| 9 |
|
| 10 |
This file 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 Lesser General Public License for more details. |
| 14 |
|
| 15 |
You should have received a copy of the GNU Lesser General Public License |
| 16 |
along with this program. If not, see <https://www.gnu.org/licenses/>. */ |
| 17 |
|
| 18 |
#include <config.h> |
| 19 |
|
| 20 |
/* Specification. */ |
| 21 |
#include "uninorm.h" |
| 22 |
|
| 23 |
#include <string.h> |
| 24 |
|
| 25 |
struct composition_rule { char codes[6] _GL_ATTRIBUTE_NONSTRING; unsigned int combined; }; |
| 26 |
|
| 27 |
#include "composition-table.h" |
| 28 |
#include "composition-table-bounds.h" |
| 29 |
|
| 30 |
ucs4_t |
| 31 |
uc_composition (ucs4_t uc1, ucs4_t uc2) |
| 32 |
{ |
| 33 |
if (uc1 <= UNINORM_COMPOSE_MAX_ARG1 && uc2 <= UNINORM_COMPOSE_MAX_ARG2) |
| 34 |
{ |
| 35 |
if (uc2 >= 0x1161 && uc2 < 0x1161 + 21 |
| 36 |
&& uc1 >= 0x1100 && uc1 < 0x1100 + 19) |
| 37 |
{ |
| 38 |
/* Hangul: Combine single letter L and single letter V to form |
| 39 |
two-letter syllable LV. */ |
| 40 |
return 0xAC00 + ((uc1 - 0x1100) * 21 + (uc2 - 0x1161)) * 28; |
| 41 |
} |
| 42 |
else if (uc2 > 0x11A7 && uc2 < 0x11A7 + 28 |
| 43 |
&& uc1 >= 0xAC00 && uc1 < 0xD7A4 && ((uc1 - 0xAC00) % 28) == 0) |
| 44 |
{ |
| 45 |
/* Hangul: Combine two-letter syllable LV with single-letter T |
| 46 |
to form three-letter syllable LVT. */ |
| 47 |
return uc1 + (uc2 - 0x11A7); |
| 48 |
} |
| 49 |
else |
| 50 |
{ |
| 51 |
#if 0 |
| 52 |
unsigned int uc = MUL1 * uc1 * MUL2 * uc2; |
| 53 |
unsigned int index1 = uc >> composition_header_0; |
| 54 |
if (index1 < composition_header_1) |
| 55 |
{ |
| 56 |
int lookup1 = u_composition.level1[index1]; |
| 57 |
if (lookup1 >= 0) |
| 58 |
{ |
| 59 |
unsigned int index2 = (uc >> composition_header_2) & composition_header_3; |
| 60 |
int lookup2 = u_composition.level2[lookup1 + index2]; |
| 61 |
if (lookup2 >= 0) |
| 62 |
{ |
| 63 |
unsigned int index3 = (uc & composition_header_4); |
| 64 |
unsigned int lookup3 = u_composition.level3[lookup2 + index3]; |
| 65 |
if ((lookup3 >> 16) == uc2) |
| 66 |
return lookup3 & ((1U << 16) - 1); |
| 67 |
} |
| 68 |
} |
| 69 |
} |
| 70 |
#else |
| 71 |
char codes[6]; |
| 72 |
codes[0] = (uc1 >> 16) & 0xff; |
| 73 |
codes[1] = (uc1 >> 8) & 0xff; |
| 74 |
codes[2] = uc1 & 0xff; |
| 75 |
codes[3] = (uc2 >> 16) & 0xff; |
| 76 |
codes[4] = (uc2 >> 8) & 0xff; |
| 77 |
codes[5] = uc2 & 0xff; |
| 78 |
|
| 79 |
const struct composition_rule *rule = gl_uninorm_compose_lookup (codes, 6); |
| 80 |
if (rule != NULL) |
| 81 |
return rule->combined; |
| 82 |
#endif |
| 83 |
} |
| 84 |
} |
| 85 |
return 0; |
| 86 |
} |