2 * Copyright (C) 2012 Grigori Goronzy <greg@kinoho.net>
4 * Permission to use, copy, modify, and/or distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18 #include "hb-unicode.hh"
19 #include "hb-machinery.hh"
21 #include "hb-ucd-table.hh"
23 static hb_unicode_combining_class_t
24 hb_ucd_combining_class (hb_unicode_funcs_t *ufuncs HB_UNUSED,
25 hb_codepoint_t unicode,
26 void *user_data HB_UNUSED)
28 return (hb_unicode_combining_class_t) _hb_ucd_ccc (unicode);
31 static hb_unicode_general_category_t
32 hb_ucd_general_category (hb_unicode_funcs_t *ufuncs HB_UNUSED,
33 hb_codepoint_t unicode,
34 void *user_data HB_UNUSED)
36 return (hb_unicode_general_category_t) _hb_ucd_gc (unicode);
40 hb_ucd_mirroring (hb_unicode_funcs_t *ufuncs HB_UNUSED,
41 hb_codepoint_t unicode,
42 void *user_data HB_UNUSED)
44 return unicode + _hb_ucd_bmg (unicode);
48 hb_ucd_script (hb_unicode_funcs_t *ufuncs HB_UNUSED,
49 hb_codepoint_t unicode,
50 void *user_data HB_UNUSED)
52 return _hb_ucd_sc_map[_hb_ucd_sc (unicode)];
64 #define NCOUNT (VCOUNT * TCOUNT)
67 _hb_ucd_decompose_hangul (hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b)
69 unsigned si = ab - SBASE;
77 *a = SBASE + (si / TCOUNT) * TCOUNT;
78 *b = TBASE + (si % TCOUNT);
82 *a = LBASE + (si / NCOUNT);
83 *b = VBASE + (si % NCOUNT) / TCOUNT;
89 _hb_ucd_compose_hangul (hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab)
91 if (a >= SBASE && a < (SBASE + SCOUNT) && b > TBASE && b < (TBASE + TCOUNT) &&
92 !((a - SBASE) % TCOUNT))
95 *ab = a + (b - TBASE);
98 else if (a >= LBASE && a < (LBASE + LCOUNT) && b >= VBASE && b < (VBASE + VCOUNT))
103 *ab = SBASE + li * NCOUNT + vi * TCOUNT;
111 _cmp_pair (const void *_key, const void *_item)
113 uint64_t& a = * (uint64_t*) _key;
114 uint64_t b = (* (uint64_t*) _item) & HB_CODEPOINT_ENCODE3(0x1FFFFFu, 0x1FFFFFu, 0);
116 return a < b ? -1 : a > b ? +1 : 0;
119 _cmp_pair_11_7_14 (const void *_key, const void *_item)
121 uint32_t& a = * (uint32_t*) _key;
122 uint32_t b = (* (uint32_t*) _item) & HB_CODEPOINT_ENCODE3_11_7_14(0x1FFFFFu, 0x1FFFFFu, 0);
124 return a < b ? -1 : a > b ? +1 : 0;
128 hb_ucd_compose (hb_unicode_funcs_t *ufuncs HB_UNUSED,
129 hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab,
130 void *user_data HB_UNUSED)
132 if (_hb_ucd_compose_hangul (a, b, ab)) return true;
134 hb_codepoint_t u = 0;
136 if ((a & 0xFFFFF800u) == 0x0000u && (b & 0xFFFFFF80) == 0x0300u)
138 uint32_t k = HB_CODEPOINT_ENCODE3_11_7_14 (a, b, 0);
139 const uint32_t *v = hb_bsearch (k,
141 ARRAY_LENGTH (_hb_ucd_dm2_u32_map),
142 sizeof (*_hb_ucd_dm2_u32_map),
144 if (likely (!v)) return false;
145 u = HB_CODEPOINT_DECODE3_11_7_14_3 (*v);
149 uint64_t k = HB_CODEPOINT_ENCODE3 (a, b, 0);
150 const uint64_t *v = hb_bsearch (k,
152 ARRAY_LENGTH (_hb_ucd_dm2_u64_map),
153 sizeof (*_hb_ucd_dm2_u64_map),
155 if (likely (!v)) return false;
156 u = HB_CODEPOINT_DECODE3_3 (*v);
159 if (unlikely (!u)) return false;
165 hb_ucd_decompose (hb_unicode_funcs_t *ufuncs HB_UNUSED,
166 hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b,
167 void *user_data HB_UNUSED)
169 if (_hb_ucd_decompose_hangul (ab, a, b)) return true;
171 unsigned i = _hb_ucd_dm (ab);
173 if (likely (!i)) return false;
176 if (i < ARRAY_LENGTH (_hb_ucd_dm1_p0_map) + ARRAY_LENGTH (_hb_ucd_dm1_p2_map))
178 if (i < ARRAY_LENGTH (_hb_ucd_dm1_p0_map))
179 *a = _hb_ucd_dm1_p0_map[i];
182 i -= ARRAY_LENGTH (_hb_ucd_dm1_p0_map);
183 *a = 0x20000 | _hb_ucd_dm1_p2_map[i];
188 i -= ARRAY_LENGTH (_hb_ucd_dm1_p0_map) + ARRAY_LENGTH (_hb_ucd_dm1_p2_map);
190 if (i < ARRAY_LENGTH (_hb_ucd_dm2_u32_map))
192 uint32_t v = _hb_ucd_dm2_u32_map[i];
193 *a = HB_CODEPOINT_DECODE3_11_7_14_1 (v);
194 *b = HB_CODEPOINT_DECODE3_11_7_14_2 (v);
197 i -= ARRAY_LENGTH (_hb_ucd_dm2_u32_map);
199 uint64_t v = _hb_ucd_dm2_u64_map[i];
200 *a = HB_CODEPOINT_DECODE3_1 (v);
201 *b = HB_CODEPOINT_DECODE3_2 (v);
206 static void free_static_ucd_funcs ();
208 static struct hb_ucd_unicode_funcs_lazy_loader_t : hb_unicode_funcs_lazy_loader_t<hb_ucd_unicode_funcs_lazy_loader_t>
210 static hb_unicode_funcs_t *create ()
212 hb_unicode_funcs_t *funcs = hb_unicode_funcs_create (nullptr);
214 hb_unicode_funcs_set_combining_class_func (funcs, hb_ucd_combining_class, nullptr, nullptr);
215 hb_unicode_funcs_set_general_category_func (funcs, hb_ucd_general_category, nullptr, nullptr);
216 hb_unicode_funcs_set_mirroring_func (funcs, hb_ucd_mirroring, nullptr, nullptr);
217 hb_unicode_funcs_set_script_func (funcs, hb_ucd_script, nullptr, nullptr);
218 hb_unicode_funcs_set_compose_func (funcs, hb_ucd_compose, nullptr, nullptr);
219 hb_unicode_funcs_set_decompose_func (funcs, hb_ucd_decompose, nullptr, nullptr);
221 hb_unicode_funcs_make_immutable (funcs);
223 hb_atexit (free_static_ucd_funcs);
230 void free_static_ucd_funcs ()
232 static_ucd_funcs.free_instance ();
236 hb_ucd_get_unicode_funcs ()
239 return hb_unicode_funcs_get_empty ();
241 return static_ucd_funcs.get_unconst ();