/src/harfbuzz/src/hb-ot-shaper-indic.cc
Line | Count | Source |
1 | | /* |
2 | | * Copyright © 2011,2012 Google, Inc. |
3 | | * |
4 | | * This is part of HarfBuzz, a text shaping library. |
5 | | * |
6 | | * Permission is hereby granted, without written agreement and without |
7 | | * license or royalty fees, to use, copy, modify, and distribute this |
8 | | * software and its documentation for any purpose, provided that the |
9 | | * above copyright notice and the following two paragraphs appear in |
10 | | * all copies of this software. |
11 | | * |
12 | | * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
13 | | * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
14 | | * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
15 | | * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
16 | | * DAMAGE. |
17 | | * |
18 | | * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
19 | | * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
20 | | * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
21 | | * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
22 | | * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
23 | | * |
24 | | * Google Author(s): Behdad Esfahbod |
25 | | */ |
26 | | |
27 | | #include "hb.hh" |
28 | | |
29 | | #ifndef HB_NO_OT_SHAPE |
30 | | |
31 | | #include "hb-ot-shaper-indic.hh" |
32 | | #include "hb-ot-shaper-indic-machine.hh" |
33 | | #include "hb-ot-shaper-vowel-constraints.hh" |
34 | | #include "hb-ot-layout.hh" |
35 | | |
36 | | |
37 | | /* |
38 | | * Indic shaper. |
39 | | */ |
40 | | |
41 | | |
42 | | static inline void |
43 | | set_indic_properties (hb_glyph_info_t &info) |
44 | 0 | { |
45 | 0 | hb_codepoint_t u = info.codepoint; |
46 | 0 | unsigned int type = hb_indic_get_categories (u); |
47 | |
|
48 | 0 | info.indic_category() = (indic_category_t) (type & 0xFFu); |
49 | 0 | info.indic_position() = (indic_position_t) (type >> 8); |
50 | 0 | } |
51 | | |
52 | | |
53 | | static inline bool |
54 | | is_one_of (const hb_glyph_info_t &info, unsigned int flags) |
55 | 0 | { |
56 | | /* If it ligated, all bets are off. */ |
57 | 0 | if (_hb_glyph_info_ligated (&info)) return false; |
58 | 0 | return !!(FLAG_UNSAFE (info.indic_category()) & flags); |
59 | 0 | } |
60 | | |
61 | | /* Note: |
62 | | * |
63 | | * We treat Vowels and placeholders as if they were consonants. This is safe because Vowels |
64 | | * cannot happen in a consonant syllable. The plus side however is, we can call the |
65 | | * consonant syllable logic from the vowel syllable function and get it all right! |
66 | | * |
67 | | * Keep in sync with consonant_categories in the generator. */ |
68 | 0 | #define CONSONANT_FLAGS_INDIC (FLAG (I_Cat(C)) | FLAG (I_Cat(CS)) | FLAG (I_Cat(Ra)) | FLAG (I_Cat(CM)) | FLAG (I_Cat(V)) | FLAG (I_Cat(PLACEHOLDER)) | FLAG (I_Cat(DOTTEDCIRCLE))) |
69 | | |
70 | | static inline bool |
71 | | is_consonant (const hb_glyph_info_t &info) |
72 | 0 | { |
73 | 0 | return is_one_of (info, CONSONANT_FLAGS_INDIC); |
74 | 0 | } |
75 | | |
76 | 0 | #define JOINER_FLAGS (FLAG (I_Cat(ZWJ)) | FLAG (I_Cat(ZWNJ))) |
77 | | |
78 | | static inline bool |
79 | | is_joiner (const hb_glyph_info_t &info) |
80 | 0 | { |
81 | 0 | return is_one_of (info, JOINER_FLAGS); |
82 | 0 | } |
83 | | |
84 | | static inline bool |
85 | | is_halant (const hb_glyph_info_t &info) |
86 | 0 | { |
87 | 0 | return is_one_of (info, FLAG (I_Cat(H))); |
88 | 0 | } |
89 | | |
90 | | struct hb_indic_would_substitute_feature_t |
91 | | { |
92 | | void init (const hb_ot_map_t *map, hb_tag_t feature_tag, bool zero_context_) |
93 | 0 | { |
94 | 0 | zero_context = zero_context_; |
95 | 0 | lookups = map->get_stage_lookups (0/*GSUB*/, |
96 | 0 | map->get_feature_stage (0/*GSUB*/, feature_tag)); |
97 | 0 | } |
98 | | |
99 | | bool would_substitute (const hb_codepoint_t *glyphs, |
100 | | unsigned int glyphs_count, |
101 | | hb_face_t *face) const |
102 | 0 | { |
103 | 0 | for (const auto &lookup : lookups) |
104 | 0 | if (hb_ot_layout_lookup_would_substitute (face, lookup.index, glyphs, glyphs_count, zero_context)) |
105 | 0 | return true; |
106 | 0 | return false; |
107 | 0 | } |
108 | | |
109 | | private: |
110 | | hb_array_t<const hb_ot_map_t::lookup_map_t> lookups; |
111 | | bool zero_context; |
112 | | }; |
113 | | |
114 | | |
115 | | /* |
116 | | * Indic configurations. Note that we do not want to keep every single script-specific |
117 | | * behavior in these tables necessarily. This should mainly be used for per-script |
118 | | * properties that are cheaper keeping here, than in the code. Ie. if, say, one and |
119 | | * only one script has an exception, that one script can be if'ed directly in the code, |
120 | | * instead of adding a new flag in these structs. |
121 | | */ |
122 | | |
123 | | enum reph_position_t { |
124 | | REPH_POS_AFTER_MAIN = POS_AFTER_MAIN, |
125 | | REPH_POS_BEFORE_SUB = POS_BEFORE_SUB, |
126 | | REPH_POS_AFTER_SUB = POS_AFTER_SUB, |
127 | | REPH_POS_BEFORE_POST = POS_BEFORE_POST, |
128 | | REPH_POS_AFTER_POST = POS_AFTER_POST |
129 | | }; |
130 | | enum reph_mode_t { |
131 | | REPH_MODE_IMPLICIT, /* Reph formed out of initial Ra,H sequence. */ |
132 | | REPH_MODE_EXPLICIT, /* Reph formed out of initial Ra,H,ZWJ sequence. */ |
133 | | REPH_MODE_LOG_REPHA /* Encoded Repha character, needs reordering. */ |
134 | | }; |
135 | | enum blwf_mode_t { |
136 | | BLWF_MODE_PRE_AND_POST, /* Below-forms feature applied to pre-base and post-base. */ |
137 | | BLWF_MODE_POST_ONLY /* Below-forms feature applied to post-base only. */ |
138 | | }; |
139 | | struct indic_config_t |
140 | | { |
141 | | hb_script_t script; |
142 | | bool has_old_spec; |
143 | | hb_codepoint_t virama; |
144 | | reph_position_t reph_pos; |
145 | | reph_mode_t reph_mode; |
146 | | blwf_mode_t blwf_mode; |
147 | | }; |
148 | | |
149 | | static const indic_config_t indic_configs[] = |
150 | | { |
151 | | /* Default. Should be first. */ |
152 | | {HB_SCRIPT_INVALID, false, 0,REPH_POS_BEFORE_POST,REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
153 | | {HB_SCRIPT_DEVANAGARI,true, 0x094Du,REPH_POS_BEFORE_POST,REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
154 | | {HB_SCRIPT_BENGALI, true, 0x09CDu,REPH_POS_AFTER_SUB, REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
155 | | {HB_SCRIPT_GURMUKHI, true, 0x0A4Du,REPH_POS_BEFORE_SUB, REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
156 | | {HB_SCRIPT_GUJARATI, true, 0x0ACDu,REPH_POS_BEFORE_POST,REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
157 | | {HB_SCRIPT_ORIYA, true, 0x0B4Du,REPH_POS_AFTER_MAIN, REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
158 | | {HB_SCRIPT_TAMIL, true, 0x0BCDu,REPH_POS_AFTER_POST, REPH_MODE_IMPLICIT, BLWF_MODE_PRE_AND_POST}, |
159 | | {HB_SCRIPT_TELUGU, true, 0x0C4Du,REPH_POS_AFTER_POST, REPH_MODE_EXPLICIT, BLWF_MODE_POST_ONLY}, |
160 | | {HB_SCRIPT_KANNADA, true, 0x0CCDu,REPH_POS_AFTER_POST, REPH_MODE_IMPLICIT, BLWF_MODE_POST_ONLY}, |
161 | | {HB_SCRIPT_MALAYALAM, true, 0x0D4Du,REPH_POS_AFTER_MAIN, REPH_MODE_LOG_REPHA,BLWF_MODE_PRE_AND_POST}, |
162 | | }; |
163 | | |
164 | | |
165 | | static const hb_ot_map_feature_t |
166 | | indic_features[] = |
167 | | { |
168 | | /* |
169 | | * Basic features. |
170 | | * These features are applied in order, one at a time, after initial_reordering, |
171 | | * constrained to the syllable. |
172 | | */ |
173 | | {HB_TAG('n','u','k','t'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
174 | | {HB_TAG('a','k','h','n'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
175 | | {HB_TAG('r','p','h','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
176 | | {HB_TAG('r','k','r','f'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
177 | | {HB_TAG('p','r','e','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
178 | | {HB_TAG('b','l','w','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
179 | | {HB_TAG('a','b','v','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
180 | | {HB_TAG('h','a','l','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
181 | | {HB_TAG('p','s','t','f'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
182 | | {HB_TAG('v','a','t','u'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
183 | | {HB_TAG('c','j','c','t'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
184 | | /* |
185 | | * Other features. |
186 | | * These features are applied all at once, after final_reordering, constrained |
187 | | * to the syllable. |
188 | | * Default Bengali font in Windows for example has intermixed |
189 | | * lookups for init,pres,abvs,blws features. |
190 | | */ |
191 | | {HB_TAG('i','n','i','t'), F_MANUAL_JOINERS | F_PER_SYLLABLE}, |
192 | | {HB_TAG('p','r','e','s'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
193 | | {HB_TAG('a','b','v','s'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
194 | | {HB_TAG('b','l','w','s'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
195 | | {HB_TAG('p','s','t','s'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
196 | | {HB_TAG('h','a','l','n'), F_GLOBAL_MANUAL_JOINERS | F_PER_SYLLABLE}, |
197 | | }; |
198 | | |
199 | | /* |
200 | | * Must be in the same order as the indic_features array. |
201 | | */ |
202 | | enum { |
203 | | _INDIC_NUKT, |
204 | | _INDIC_AKHN, |
205 | | INDIC_RPHF, |
206 | | _INDIC_RKRF, |
207 | | INDIC_PREF, |
208 | | INDIC_BLWF, |
209 | | INDIC_ABVF, |
210 | | INDIC_HALF, |
211 | | INDIC_PSTF, |
212 | | _INDIC_VATU, |
213 | | _INDIC_CJCT, |
214 | | |
215 | | INDIC_INIT, |
216 | | _INDIC_PRES, |
217 | | _INDIC_ABVS, |
218 | | _INDIC_BLWS, |
219 | | _INDIC_PSTS, |
220 | | _INDIC_HALN, |
221 | | |
222 | | INDIC_NUM_FEATURES, |
223 | | INDIC_BASIC_FEATURES = INDIC_INIT, /* Don't forget to update this! */ |
224 | | }; |
225 | | |
226 | | static bool |
227 | | setup_syllables_indic (const hb_ot_shape_plan_t *plan, |
228 | | hb_font_t *font, |
229 | | hb_buffer_t *buffer); |
230 | | static bool |
231 | | initial_reordering_indic (const hb_ot_shape_plan_t *plan, |
232 | | hb_font_t *font, |
233 | | hb_buffer_t *buffer); |
234 | | static bool |
235 | | final_reordering_indic (const hb_ot_shape_plan_t *plan, |
236 | | hb_font_t *font, |
237 | | hb_buffer_t *buffer); |
238 | | |
239 | | static void |
240 | | collect_features_indic (hb_ot_shape_planner_t *plan) |
241 | 0 | { |
242 | 0 | hb_ot_map_builder_t *map = &plan->map; |
243 | | |
244 | | /* Do this before any lookups have been applied. */ |
245 | 0 | map->add_gsub_pause (setup_syllables_indic); |
246 | |
|
247 | 0 | map->enable_feature (HB_TAG('l','o','c','l'), F_PER_SYLLABLE); |
248 | | /* The Indic specs do not require ccmp, but we apply it here since if |
249 | | * there is a use of it, it's typically at the beginning. */ |
250 | 0 | map->enable_feature (HB_TAG('c','c','m','p'), F_PER_SYLLABLE); |
251 | | |
252 | |
|
253 | 0 | unsigned int i = 0; |
254 | 0 | map->add_gsub_pause (initial_reordering_indic); |
255 | |
|
256 | 0 | for (; i < INDIC_BASIC_FEATURES; i++) { |
257 | 0 | map->add_feature (indic_features[i]); |
258 | 0 | map->add_gsub_pause (nullptr); |
259 | 0 | } |
260 | |
|
261 | 0 | map->add_gsub_pause (final_reordering_indic); |
262 | |
|
263 | 0 | for (; i < INDIC_NUM_FEATURES; i++) |
264 | 0 | map->add_feature (indic_features[i]); |
265 | 0 | } |
266 | | |
267 | | static void |
268 | | override_features_indic (hb_ot_shape_planner_t *plan) |
269 | 0 | { |
270 | 0 | plan->map.disable_feature (HB_TAG('l','i','g','a')); |
271 | 0 | plan->map.add_gsub_pause (hb_syllabic_clear_var); // Don't need syllables anymore, use stop to free buffer var |
272 | 0 | } |
273 | | |
274 | | |
275 | | struct indic_shape_plan_t |
276 | | { |
277 | | bool load_virama_glyph (hb_font_t *font, hb_codepoint_t *pglyph) const |
278 | 0 | { |
279 | 0 | hb_codepoint_t glyph = virama_glyph; |
280 | 0 | if (unlikely (glyph == (hb_codepoint_t) -1)) |
281 | 0 | { |
282 | 0 | if (!config->virama || !font->get_nominal_glyph (config->virama, &glyph)) |
283 | 0 | glyph = 0; |
284 | | /* Technically speaking, the spec says we should apply 'locl' to virama too. |
285 | | * Maybe one day... */ |
286 | | |
287 | | /* Our get_nominal_glyph() function needs a font, so we can't get the virama glyph |
288 | | * during shape planning... Instead, overwrite it here. */ |
289 | 0 | virama_glyph = (int) glyph; |
290 | 0 | } |
291 | |
|
292 | 0 | *pglyph = glyph; |
293 | 0 | return glyph != 0; |
294 | 0 | } |
295 | | |
296 | | const indic_config_t *config; |
297 | | |
298 | | bool is_old_spec; |
299 | | mutable hb_atomic_t<hb_codepoint_t> virama_glyph; |
300 | | |
301 | | hb_indic_would_substitute_feature_t rphf; |
302 | | hb_indic_would_substitute_feature_t pref; |
303 | | hb_indic_would_substitute_feature_t blwf; |
304 | | hb_indic_would_substitute_feature_t pstf; |
305 | | hb_indic_would_substitute_feature_t vatu; |
306 | | |
307 | | hb_mask_t mask_array[INDIC_NUM_FEATURES]; |
308 | | }; |
309 | | |
310 | | static void * |
311 | | data_create_indic (const hb_ot_shape_plan_t *plan) |
312 | 0 | { |
313 | 0 | indic_shape_plan_t *indic_plan = (indic_shape_plan_t *) hb_calloc (1, sizeof (indic_shape_plan_t)); |
314 | 0 | if (unlikely (!indic_plan)) |
315 | 0 | return nullptr; |
316 | | |
317 | 0 | indic_plan->config = &indic_configs[0]; |
318 | 0 | for (unsigned int i = 1; i < ARRAY_LENGTH (indic_configs); i++) |
319 | 0 | if (plan->props.script == indic_configs[i].script) { |
320 | 0 | indic_plan->config = &indic_configs[i]; |
321 | 0 | break; |
322 | 0 | } |
323 | |
|
324 | 0 | indic_plan->is_old_spec = indic_plan->config->has_old_spec && ((plan->map.chosen_script[0] & 0x000000FFu) != '2'); |
325 | 0 | indic_plan->virama_glyph = -1; |
326 | | |
327 | | /* Use zero-context would_substitute() matching for new-spec of the main |
328 | | * Indic scripts, and scripts with one spec only, but not for old-specs. |
329 | | * The new-spec for all dual-spec scripts says zero-context matching happens. |
330 | | * |
331 | | * However, testing with Malayalam shows that old and new spec both allow |
332 | | * context. Testing with Bengali new-spec however shows that it doesn't. |
333 | | * So, the heuristic here is the way it is. It should *only* be changed, |
334 | | * as we discover more cases of what Windows does. DON'T TOUCH OTHERWISE. |
335 | | */ |
336 | 0 | bool zero_context = !indic_plan->is_old_spec && plan->props.script != HB_SCRIPT_MALAYALAM; |
337 | 0 | indic_plan->rphf.init (&plan->map, HB_TAG('r','p','h','f'), zero_context); |
338 | 0 | indic_plan->pref.init (&plan->map, HB_TAG('p','r','e','f'), zero_context); |
339 | 0 | indic_plan->blwf.init (&plan->map, HB_TAG('b','l','w','f'), zero_context); |
340 | 0 | indic_plan->pstf.init (&plan->map, HB_TAG('p','s','t','f'), zero_context); |
341 | 0 | indic_plan->vatu.init (&plan->map, HB_TAG('v','a','t','u'), zero_context); |
342 | |
|
343 | 0 | for (unsigned int i = 0; i < ARRAY_LENGTH (indic_plan->mask_array); i++) |
344 | 0 | indic_plan->mask_array[i] = (indic_features[i].flags & F_GLOBAL) ? |
345 | 0 | 0 : plan->map.get_1_mask (indic_features[i].tag); |
346 | |
|
347 | 0 | return indic_plan; |
348 | 0 | } |
349 | | |
350 | | static void |
351 | | data_destroy_indic (void *data) |
352 | 0 | { |
353 | 0 | hb_free (data); |
354 | 0 | } |
355 | | |
356 | | static indic_position_t |
357 | | consonant_position_from_face (const indic_shape_plan_t *indic_plan, |
358 | | const hb_codepoint_t consonant, |
359 | | const hb_codepoint_t virama, |
360 | | hb_face_t *face) |
361 | 0 | { |
362 | | /* For old-spec, the order of glyphs is Consonant,Virama, |
363 | | * whereas for new-spec, it's Virama,Consonant. However, |
364 | | * some broken fonts (like Free Sans) simply copied lookups |
365 | | * from old-spec to new-spec without modification. |
366 | | * And oddly enough, Uniscribe seems to respect those lookups. |
367 | | * Eg. in the sequence U+0924,U+094D,U+0930, Uniscribe finds |
368 | | * base at 0. The font however, only has lookups matching |
369 | | * 930,94D in 'blwf', not the expected 94D,930 (with new-spec |
370 | | * table). As such, we simply match both sequences. Seems |
371 | | * to work. |
372 | | * |
373 | | * Vatu is done as well, for: |
374 | | * https://github.com/harfbuzz/harfbuzz/issues/1587 |
375 | | */ |
376 | 0 | hb_codepoint_t glyphs[3] = {virama, consonant, virama}; |
377 | 0 | if (indic_plan->blwf.would_substitute (glyphs , 2, face) || |
378 | 0 | indic_plan->blwf.would_substitute (glyphs+1, 2, face) || |
379 | 0 | indic_plan->vatu.would_substitute (glyphs , 2, face) || |
380 | 0 | indic_plan->vatu.would_substitute (glyphs+1, 2, face)) |
381 | 0 | return POS_BELOW_C; |
382 | 0 | if (indic_plan->pstf.would_substitute (glyphs , 2, face) || |
383 | 0 | indic_plan->pstf.would_substitute (glyphs+1, 2, face)) |
384 | 0 | return POS_POST_C; |
385 | 0 | if (indic_plan->pref.would_substitute (glyphs , 2, face) || |
386 | 0 | indic_plan->pref.would_substitute (glyphs+1, 2, face)) |
387 | 0 | return POS_POST_C; |
388 | 0 | return POS_BASE_C; |
389 | 0 | } |
390 | | |
391 | | static void |
392 | | setup_masks_indic (const hb_ot_shape_plan_t *plan HB_UNUSED, |
393 | | hb_buffer_t *buffer, |
394 | | hb_font_t *font HB_UNUSED) |
395 | 0 | { |
396 | 0 | HB_BUFFER_ALLOCATE_VAR (buffer, indic_category); |
397 | 0 | HB_BUFFER_ALLOCATE_VAR (buffer, indic_position); |
398 | | |
399 | | /* We cannot setup masks here. We save information about characters |
400 | | * and setup masks later on in a pause-callback. */ |
401 | |
|
402 | 0 | unsigned int count = buffer->len; |
403 | 0 | hb_glyph_info_t *info = buffer->info; |
404 | 0 | for (unsigned int i = 0; i < count; i++) |
405 | 0 | set_indic_properties (info[i]); |
406 | 0 | } |
407 | | |
408 | | static bool |
409 | | setup_syllables_indic (const hb_ot_shape_plan_t *plan HB_UNUSED, |
410 | | hb_font_t *font HB_UNUSED, |
411 | | hb_buffer_t *buffer) |
412 | 0 | { |
413 | 0 | HB_BUFFER_ALLOCATE_VAR (buffer, syllable); |
414 | 0 | find_syllables_indic (buffer); |
415 | 0 | foreach_syllable (buffer, start, end) |
416 | 0 | buffer->unsafe_to_break (start, end); |
417 | 0 | return false; |
418 | 0 | } |
419 | | |
420 | | static int |
421 | | compare_indic_order (const hb_glyph_info_t *pa, const hb_glyph_info_t *pb) |
422 | 0 | { |
423 | 0 | int a = pa->indic_position(); |
424 | 0 | int b = pb->indic_position(); |
425 | |
|
426 | 0 | return (int) a - (int) b; |
427 | 0 | } |
428 | | |
429 | | |
430 | | |
431 | | static void |
432 | | update_consonant_positions_indic (const hb_ot_shape_plan_t *plan, |
433 | | hb_font_t *font, |
434 | | hb_buffer_t *buffer) |
435 | 0 | { |
436 | 0 | const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data; |
437 | |
|
438 | 0 | hb_codepoint_t virama; |
439 | 0 | if (indic_plan->load_virama_glyph (font, &virama)) |
440 | 0 | { |
441 | 0 | hb_face_t *face = font->face; |
442 | 0 | unsigned int count = buffer->len; |
443 | 0 | hb_glyph_info_t *info = buffer->info; |
444 | 0 | for (unsigned int i = 0; i < count; i++) |
445 | 0 | if (info[i].indic_position() == POS_BASE_C) |
446 | 0 | { |
447 | 0 | hb_codepoint_t consonant = info[i].codepoint; |
448 | 0 | info[i].indic_position() = consonant_position_from_face (indic_plan, consonant, virama, face); |
449 | 0 | } |
450 | 0 | } |
451 | 0 | } |
452 | | |
453 | | |
454 | | /* Rules from: |
455 | | * https://docs.microsqoft.com/en-us/typography/script-development/devanagari */ |
456 | | |
457 | | static void |
458 | | initial_reordering_consonant_syllable (const hb_ot_shape_plan_t *plan, |
459 | | hb_face_t *face, |
460 | | hb_buffer_t *buffer, |
461 | | unsigned int start, unsigned int end) |
462 | 0 | { |
463 | 0 | const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data; |
464 | 0 | hb_glyph_info_t *info = buffer->info; |
465 | | |
466 | | /* https://github.com/harfbuzz/harfbuzz/issues/435#issuecomment-335560167 |
467 | | * // For compatibility with legacy usage in Kannada, |
468 | | * // Ra+h+ZWJ must behave like Ra+ZWJ+h... |
469 | | */ |
470 | 0 | if (buffer->props.script == HB_SCRIPT_KANNADA && |
471 | 0 | start + 3 <= end && |
472 | 0 | is_one_of (info[start ], FLAG (I_Cat(Ra))) && |
473 | 0 | is_one_of (info[start+1], FLAG (I_Cat(H))) && |
474 | 0 | is_one_of (info[start+2], FLAG (I_Cat(ZWJ)))) |
475 | 0 | { |
476 | 0 | buffer->merge_clusters (start+1, start+3); |
477 | 0 | hb_swap (info[start+1], info[start+2]); |
478 | 0 | } |
479 | | |
480 | | /* 1. Find base consonant: |
481 | | * |
482 | | * The shaping engine finds the base consonant of the syllable, using the |
483 | | * following algorithm: starting from the end of the syllable, move backwards |
484 | | * until a consonant is found that does not have a below-base or post-base |
485 | | * form (post-base forms have to follow below-base forms), or that is not a |
486 | | * pre-base-reordering Ra, or arrive at the first consonant. The consonant |
487 | | * stopped at will be the base. |
488 | | * |
489 | | * o If the syllable starts with Ra + Halant (in a script that has Reph) |
490 | | * and has more than one consonant, Ra is excluded from candidates for |
491 | | * base consonants. |
492 | | */ |
493 | |
|
494 | 0 | unsigned int base = end; |
495 | 0 | bool has_reph = false; |
496 | |
|
497 | 0 | { |
498 | | /* -> If the syllable starts with Ra + Halant (in a script that has Reph) |
499 | | * and has more than one consonant, Ra is excluded from candidates for |
500 | | * base consonants. */ |
501 | 0 | unsigned int limit = start; |
502 | 0 | if (indic_plan->mask_array[INDIC_RPHF] && |
503 | 0 | start + 3 <= end && |
504 | 0 | ( |
505 | 0 | (indic_plan->config->reph_mode == REPH_MODE_IMPLICIT && !is_joiner (info[start + 2])) || |
506 | 0 | (indic_plan->config->reph_mode == REPH_MODE_EXPLICIT && info[start + 2].indic_category() == I_Cat(ZWJ)) |
507 | 0 | )) |
508 | 0 | { |
509 | | /* See if it matches the 'rphf' feature. */ |
510 | 0 | hb_codepoint_t glyphs[3] = {info[start].codepoint, |
511 | 0 | info[start + 1].codepoint, |
512 | 0 | indic_plan->config->reph_mode == REPH_MODE_EXPLICIT ? |
513 | 0 | info[start + 2].codepoint : 0}; |
514 | 0 | if (indic_plan->rphf.would_substitute (glyphs, 2, face) || |
515 | 0 | (indic_plan->config->reph_mode == REPH_MODE_EXPLICIT && |
516 | 0 | indic_plan->rphf.would_substitute (glyphs, 3, face))) |
517 | 0 | { |
518 | 0 | limit += 2; |
519 | 0 | while (limit < end && is_joiner (info[limit])) |
520 | 0 | limit++; |
521 | 0 | base = start; |
522 | 0 | has_reph = true; |
523 | 0 | } |
524 | 0 | } else if (indic_plan->config->reph_mode == REPH_MODE_LOG_REPHA && info[start].indic_category() == I_Cat(Repha)) |
525 | 0 | { |
526 | 0 | limit += 1; |
527 | 0 | while (limit < end && is_joiner (info[limit])) |
528 | 0 | limit++; |
529 | 0 | base = start; |
530 | 0 | has_reph = true; |
531 | 0 | } |
532 | |
|
533 | 0 | { |
534 | | /* -> starting from the end of the syllable, move backwards */ |
535 | 0 | unsigned int i = end; |
536 | 0 | bool seen_below = false; |
537 | 0 | do { |
538 | 0 | i--; |
539 | | /* -> until a consonant is found */ |
540 | 0 | if (is_consonant (info[i])) |
541 | 0 | { |
542 | | /* -> that does not have a below-base or post-base form |
543 | | * (post-base forms have to follow below-base forms), */ |
544 | 0 | if (info[i].indic_position() != POS_BELOW_C && |
545 | 0 | (info[i].indic_position() != POS_POST_C || seen_below)) |
546 | 0 | { |
547 | 0 | base = i; |
548 | 0 | break; |
549 | 0 | } |
550 | 0 | if (info[i].indic_position() == POS_BELOW_C) |
551 | 0 | seen_below = true; |
552 | | |
553 | | /* -> or that is not a pre-base-reordering Ra, |
554 | | * |
555 | | * IMPLEMENTATION NOTES: |
556 | | * |
557 | | * Our pre-base-reordering Ra's are marked POS_POST_C, so will be skipped |
558 | | * by the logic above already. |
559 | | */ |
560 | | |
561 | | /* -> or arrive at the first consonant. The consonant stopped at will |
562 | | * be the base. */ |
563 | 0 | base = i; |
564 | 0 | } |
565 | 0 | else |
566 | 0 | { |
567 | | /* A ZWJ after a Halant stops the base search, and requests an explicit |
568 | | * half form. |
569 | | * A ZWJ before a Halant, requests a subjoined form instead, and hence |
570 | | * search continues. This is particularly important for Bengali |
571 | | * sequence Ra,H,Ya that should form Ya-Phalaa by subjoining Ya. */ |
572 | 0 | if (start < i && |
573 | 0 | info[i].indic_category() == I_Cat(ZWJ) && |
574 | 0 | info[i - 1].indic_category() == I_Cat(H)) |
575 | 0 | break; |
576 | 0 | } |
577 | 0 | } while (i > limit); |
578 | 0 | } |
579 | | |
580 | | /* -> If the syllable starts with Ra + Halant (in a script that has Reph) |
581 | | * and has more than one consonant, Ra is excluded from candidates for |
582 | | * base consonants. |
583 | | * |
584 | | * Only do this for unforced Reph. (ie. not for Ra,H,ZWJ. */ |
585 | 0 | if (has_reph && base == start && limit - base <= 2) { |
586 | | /* Have no other consonant, so Reph is not formed and Ra becomes base. */ |
587 | 0 | has_reph = false; |
588 | 0 | } |
589 | 0 | } |
590 | | |
591 | | |
592 | | /* 2. Decompose and reorder Matras: |
593 | | * |
594 | | * Each matra and any syllable modifier sign in the syllable are moved to the |
595 | | * appropriate position relative to the consonant(s) in the syllable. The |
596 | | * shaping engine decomposes two- or three-part matras into their constituent |
597 | | * parts before any repositioning. Matra characters are classified by which |
598 | | * consonant in a conjunct they have affinity for and are reordered to the |
599 | | * following positions: |
600 | | * |
601 | | * o Before first half form in the syllable |
602 | | * o After subjoined consonants |
603 | | * o After post-form consonant |
604 | | * o After main consonant (for above marks) |
605 | | * |
606 | | * IMPLEMENTATION NOTES: |
607 | | * |
608 | | * The normalize() routine has already decomposed matras for us, so we don't |
609 | | * need to worry about that. |
610 | | */ |
611 | | |
612 | | |
613 | | /* 3. Reorder marks to canonical order: |
614 | | * |
615 | | * Adjacent nukta and halant or nukta and vedic sign are always repositioned |
616 | | * if necessary, so that the nukta is first. |
617 | | * |
618 | | * IMPLEMENTATION NOTES: |
619 | | * |
620 | | * We don't need to do this: the normalize() routine already did this for us. |
621 | | */ |
622 | | |
623 | | |
624 | | /* Reorder characters */ |
625 | |
|
626 | 0 | for (unsigned int i = start; i < base; i++) |
627 | 0 | info[i].indic_position() = hb_min (POS_PRE_C, (indic_position_t) info[i].indic_position()); |
628 | |
|
629 | 0 | if (base < end) |
630 | 0 | info[base].indic_position() = POS_BASE_C; |
631 | | |
632 | | /* Handle beginning Ra */ |
633 | 0 | if (has_reph) |
634 | 0 | info[start].indic_position() = POS_RA_TO_BECOME_REPH; |
635 | | |
636 | | /* For old-style Indic script tags, move the first post-base Halant after |
637 | | * last consonant. |
638 | | * |
639 | | * Reports suggest that in some scripts Uniscribe does this only if there |
640 | | * is *not* a Halant after last consonant already. We know that is the |
641 | | * case for Kannada, while it reorders unconditionally in other scripts, |
642 | | * eg. Malayalam, Bengali, and Devanagari. We don't currently know about |
643 | | * other scripts, so we block Kannada. |
644 | | * |
645 | | * Kannada test case: |
646 | | * U+0C9A,U+0CCD,U+0C9A,U+0CCD |
647 | | * With some versions of Lohit Kannada. |
648 | | * https://bugs.freedesktop.org/show_bug.cgi?id=59118 |
649 | | * |
650 | | * Malayalam test case: |
651 | | * U+0D38,U+0D4D,U+0D31,U+0D4D,U+0D31,U+0D4D |
652 | | * With lohit-ttf-20121122/Lohit-Malayalam.ttf |
653 | | * |
654 | | * Bengali test case: |
655 | | * U+0998,U+09CD,U+09AF,U+09CD |
656 | | * With Windows XP vrinda.ttf |
657 | | * https://github.com/harfbuzz/harfbuzz/issues/1073 |
658 | | * |
659 | | * Devanagari test case: |
660 | | * U+091F,U+094D,U+0930,U+094D |
661 | | * With chandas.ttf |
662 | | * https://github.com/harfbuzz/harfbuzz/issues/1071 |
663 | | */ |
664 | 0 | if (indic_plan->is_old_spec) |
665 | 0 | { |
666 | 0 | bool disallow_double_halants = buffer->props.script == HB_SCRIPT_KANNADA; |
667 | 0 | for (unsigned int i = base + 1; i < end; i++) |
668 | 0 | if (info[i].indic_category() == I_Cat(H)) |
669 | 0 | { |
670 | 0 | unsigned int j; |
671 | 0 | for (j = end - 1; j > i; j--) |
672 | 0 | if (is_consonant (info[j]) || |
673 | 0 | (disallow_double_halants && info[j].indic_category() == I_Cat(H))) |
674 | 0 | break; |
675 | 0 | if (info[j].indic_category() != I_Cat(H) && j > i) { |
676 | | /* Move Halant to after last consonant. */ |
677 | 0 | hb_glyph_info_t t = info[i]; |
678 | 0 | memmove (&info[i], &info[i + 1], (j - i) * sizeof (info[0])); |
679 | 0 | info[j] = t; |
680 | 0 | } |
681 | 0 | break; |
682 | 0 | } |
683 | 0 | } |
684 | | |
685 | | /* Attach misc marks to previous char to move with them. */ |
686 | 0 | { |
687 | 0 | indic_position_t last_pos = POS_START; |
688 | 0 | for (unsigned int i = start; i < end; i++) |
689 | 0 | { |
690 | 0 | if ((FLAG_UNSAFE (info[i].indic_category()) & (JOINER_FLAGS | FLAG (I_Cat(N)) | FLAG (I_Cat(RS)) | FLAG (I_Cat(CM)) | FLAG (I_Cat(H))))) |
691 | 0 | { |
692 | 0 | info[i].indic_position() = last_pos; |
693 | 0 | if (unlikely (info[i].indic_category() == I_Cat(H) && |
694 | 0 | info[i].indic_position() == POS_PRE_M)) |
695 | 0 | { |
696 | | /* |
697 | | * Uniscribe doesn't move the Halant with Left Matra. |
698 | | * TEST: U+092B,U+093F,U+094D |
699 | | * We follow. |
700 | | */ |
701 | 0 | for (unsigned int j = i; j > start; j--) |
702 | 0 | if (info[j - 1].indic_position() != POS_PRE_M) { |
703 | 0 | info[i].indic_position() = info[j - 1].indic_position(); |
704 | 0 | break; |
705 | 0 | } |
706 | 0 | } |
707 | 0 | } else if (info[i].indic_position() != POS_SMVD) { |
708 | 0 | if (info[i].indic_category() == I_Cat(MPst) && |
709 | 0 | i > start && info[i - 1].indic_category() == I_Cat(SM)) |
710 | 0 | info[i - 1].indic_position() = info[i].indic_position(); |
711 | 0 | last_pos = (indic_position_t) info[i].indic_position(); |
712 | 0 | } |
713 | 0 | } |
714 | 0 | } |
715 | | /* For post-base consonants let them own anything before them |
716 | | * since the last consonant or matra. */ |
717 | 0 | { |
718 | 0 | unsigned int last = base; |
719 | 0 | for (unsigned int i = base + 1; i < end; i++) |
720 | 0 | if (is_consonant (info[i])) |
721 | 0 | { |
722 | 0 | for (unsigned int j = last + 1; j < i; j++) |
723 | 0 | if (info[j].indic_position() < POS_SMVD) |
724 | 0 | info[j].indic_position() = info[i].indic_position(); |
725 | 0 | last = i; |
726 | 0 | } else if (FLAG_UNSAFE (info[i].indic_category()) & (FLAG (I_Cat(M)) | FLAG (I_Cat(MPst)))) |
727 | 0 | last = i; |
728 | 0 | } |
729 | | |
730 | |
|
731 | 0 | { |
732 | | /* Use syllable() for sort accounting temporarily. */ |
733 | 0 | unsigned int syllable = info[start].syllable(); |
734 | 0 | for (unsigned int i = start; i < end; i++) |
735 | 0 | info[i].syllable() = i - start; |
736 | | |
737 | | /* Sit tight, rock 'n roll! */ |
738 | 0 | hb_stable_sort (info + start, end - start, compare_indic_order); |
739 | | |
740 | | /* Find base again; also flip left-matra sequence. */ |
741 | 0 | unsigned first_left_matra = end; |
742 | 0 | unsigned last_left_matra = end; |
743 | 0 | base = end; |
744 | 0 | for (unsigned int i = start; i < end; i++) |
745 | 0 | { |
746 | 0 | if (info[i].indic_position() == POS_BASE_C) |
747 | 0 | { |
748 | 0 | base = i; |
749 | 0 | break; |
750 | 0 | } |
751 | 0 | else if (info[i].indic_position() == POS_PRE_M) |
752 | 0 | { |
753 | 0 | if (first_left_matra == end) |
754 | 0 | first_left_matra = i; |
755 | 0 | last_left_matra = i; |
756 | 0 | } |
757 | 0 | } |
758 | | /* https://github.com/harfbuzz/harfbuzz/issues/3863 */ |
759 | 0 | if (first_left_matra < last_left_matra) |
760 | 0 | { |
761 | | /* No need to merge clusters, handled later. */ |
762 | 0 | buffer->reverse_range (first_left_matra, last_left_matra + 1); |
763 | | /* Reverse back nuktas, etc. */ |
764 | 0 | unsigned i = first_left_matra; |
765 | 0 | for (unsigned j = i; j <= last_left_matra; j++) |
766 | 0 | if (FLAG_UNSAFE (info[j].indic_category()) & (FLAG (I_Cat(M)) | FLAG (I_Cat(MPst)))) |
767 | 0 | { |
768 | 0 | buffer->reverse_range (i, j + 1); |
769 | 0 | i = j + 1; |
770 | 0 | } |
771 | 0 | } |
772 | | |
773 | | /* Things are out-of-control for post base positions, they may shuffle |
774 | | * around like crazy. In old-spec mode, we move halants around, so in |
775 | | * that case merge all clusters after base. Otherwise, check the sort |
776 | | * order and merge as needed. |
777 | | * For pre-base stuff, we handle cluster issues in final reordering. |
778 | | * |
779 | | * We could use buffer->sort() for this, if there was no special |
780 | | * reordering of pre-base stuff happening later... |
781 | | * We don't want to merge_clusters all of that, which buffer->sort() |
782 | | * would. Here's a concrete example: |
783 | | * |
784 | | * Assume there's a pre-base consonant and explicit Halant before base, |
785 | | * followed by a prebase-reordering (left) Matra: |
786 | | * |
787 | | * C,H,ZWNJ,B,M |
788 | | * |
789 | | * At this point in reordering we would have: |
790 | | * |
791 | | * M,C,H,ZWNJ,B |
792 | | * |
793 | | * whereas in final reordering we will bring the Matra closer to Base: |
794 | | * |
795 | | * C,H,ZWNJ,M,B |
796 | | * |
797 | | * That's why we don't want to merge-clusters anything before the Base |
798 | | * at this point. But if something moved from after Base to before it, |
799 | | * we should merge clusters from base to them. In final-reordering, we |
800 | | * only move things around before base, and merge-clusters up to base. |
801 | | * These two merge-clusters from the two sides of base will interlock |
802 | | * to merge things correctly. See: |
803 | | * https://github.com/harfbuzz/harfbuzz/issues/2272 |
804 | | */ |
805 | 0 | if (indic_plan->is_old_spec || end - start > 127) |
806 | 0 | buffer->merge_clusters (base, end); |
807 | 0 | else |
808 | 0 | { |
809 | | /* Note! syllable() is a one-byte field. */ |
810 | 0 | for (unsigned int i = base; i < end; i++) |
811 | 0 | if (info[i].syllable() != 255) |
812 | 0 | { |
813 | 0 | unsigned int min = i; |
814 | 0 | unsigned int max = i; |
815 | 0 | unsigned int j = start + info[i].syllable(); |
816 | 0 | while (j != i) |
817 | 0 | { |
818 | 0 | min = hb_min (min, j); |
819 | 0 | max = hb_max (max, j); |
820 | 0 | unsigned int next = start + info[j].syllable(); |
821 | 0 | info[j].syllable() = 255; /* So we don't process j later again. */ |
822 | 0 | j = next; |
823 | 0 | } |
824 | 0 | buffer->merge_clusters (hb_max (base, min), max + 1); |
825 | 0 | } |
826 | 0 | } |
827 | | |
828 | | /* Put syllable back in. */ |
829 | 0 | for (unsigned int i = start; i < end; i++) |
830 | 0 | info[i].syllable() = syllable; |
831 | 0 | } |
832 | | |
833 | | /* Setup masks now */ |
834 | |
|
835 | 0 | { |
836 | 0 | hb_mask_t mask; |
837 | | |
838 | | /* Reph */ |
839 | 0 | for (unsigned int i = start; i < end && info[i].indic_position() == POS_RA_TO_BECOME_REPH; i++) |
840 | 0 | info[i].mask |= indic_plan->mask_array[INDIC_RPHF]; |
841 | | |
842 | | /* Pre-base */ |
843 | 0 | mask = indic_plan->mask_array[INDIC_HALF]; |
844 | 0 | if (!indic_plan->is_old_spec && |
845 | 0 | indic_plan->config->blwf_mode == BLWF_MODE_PRE_AND_POST) |
846 | 0 | mask |= indic_plan->mask_array[INDIC_BLWF]; |
847 | 0 | for (unsigned int i = start; i < base; i++) |
848 | 0 | info[i].mask |= mask; |
849 | | /* Base */ |
850 | 0 | mask = 0; |
851 | 0 | if (base < end) |
852 | 0 | info[base].mask |= mask; |
853 | | /* Post-base */ |
854 | 0 | mask = indic_plan->mask_array[INDIC_BLWF] | |
855 | 0 | indic_plan->mask_array[INDIC_ABVF] | |
856 | 0 | indic_plan->mask_array[INDIC_PSTF]; |
857 | 0 | for (unsigned int i = base + 1; i < end; i++) |
858 | 0 | info[i].mask |= mask; |
859 | 0 | } |
860 | |
|
861 | 0 | if (indic_plan->is_old_spec && |
862 | 0 | buffer->props.script == HB_SCRIPT_DEVANAGARI) |
863 | 0 | { |
864 | | /* Old-spec eye-lash Ra needs special handling. From the |
865 | | * spec: |
866 | | * |
867 | | * "The feature 'below-base form' is applied to consonants |
868 | | * having below-base forms and following the base consonant. |
869 | | * The exception is vattu, which may appear below half forms |
870 | | * as well as below the base glyph. The feature 'below-base |
871 | | * form' will be applied to all such occurrences of Ra as well." |
872 | | * |
873 | | * Test case: U+0924,U+094D,U+0930,U+094d,U+0915 |
874 | | * with Sanskrit 2003 font. |
875 | | * |
876 | | * However, note that Ra,Halant,ZWJ is the correct way to |
877 | | * request eyelash form of Ra, so we wouldbn't inhibit it |
878 | | * in that sequence. |
879 | | * |
880 | | * Test case: U+0924,U+094D,U+0930,U+094d,U+200D,U+0915 |
881 | | */ |
882 | 0 | for (unsigned int i = start; i + 1 < base; i++) |
883 | 0 | if (info[i ].indic_category() == I_Cat(Ra) && |
884 | 0 | info[i+1].indic_category() == I_Cat(H) && |
885 | 0 | (i + 2 == base || |
886 | 0 | info[i+2].indic_category() != I_Cat(ZWJ))) |
887 | 0 | { |
888 | 0 | info[i ].mask |= indic_plan->mask_array[INDIC_BLWF]; |
889 | 0 | info[i+1].mask |= indic_plan->mask_array[INDIC_BLWF]; |
890 | 0 | } |
891 | 0 | } |
892 | |
|
893 | 0 | unsigned int pref_len = 2; |
894 | 0 | if (indic_plan->mask_array[INDIC_PREF] && base + pref_len < end) |
895 | 0 | { |
896 | | /* Find a Halant,Ra sequence and mark it for pre-base-reordering processing. */ |
897 | 0 | for (unsigned int i = base + 1; i + pref_len - 1 < end; i++) { |
898 | 0 | hb_codepoint_t glyphs[2]; |
899 | 0 | for (unsigned int j = 0; j < pref_len; j++) |
900 | 0 | glyphs[j] = info[i + j].codepoint; |
901 | 0 | if (indic_plan->pref.would_substitute (glyphs, pref_len, face)) |
902 | 0 | { |
903 | 0 | for (unsigned int j = 0; j < pref_len; j++) |
904 | 0 | info[i++].mask |= indic_plan->mask_array[INDIC_PREF]; |
905 | 0 | break; |
906 | 0 | } |
907 | 0 | } |
908 | 0 | } |
909 | | |
910 | | /* Apply ZWJ/ZWNJ effects */ |
911 | 0 | for (unsigned int i = start + 1; i < end; i++) |
912 | 0 | if (is_joiner (info[i])) { |
913 | 0 | bool non_joiner = info[i].indic_category() == I_Cat(ZWNJ); |
914 | 0 | unsigned int j = i; |
915 | |
|
916 | 0 | do { |
917 | 0 | j--; |
918 | | |
919 | | /* ZWJ/ZWNJ should disable CJCT. They do that by simply |
920 | | * being there, since we don't skip them for the CJCT |
921 | | * feature (ie. F_MANUAL_ZWJ) */ |
922 | | |
923 | | /* A ZWNJ disables HALF. */ |
924 | 0 | if (non_joiner) |
925 | 0 | info[j].mask &= ~indic_plan->mask_array[INDIC_HALF]; |
926 | |
|
927 | 0 | } while (j > start && !is_consonant (info[j])); |
928 | 0 | } |
929 | 0 | } |
930 | | |
931 | | static void |
932 | | initial_reordering_standalone_cluster (const hb_ot_shape_plan_t *plan, |
933 | | hb_face_t *face, |
934 | | hb_buffer_t *buffer, |
935 | | unsigned int start, unsigned int end) |
936 | 0 | { |
937 | | /* We treat placeholder/dotted-circle as if they are consonants, so we |
938 | | * should just chain... */ |
939 | |
|
940 | 0 | initial_reordering_consonant_syllable (plan, face, buffer, start, end); |
941 | 0 | } |
942 | | |
943 | | static void |
944 | | initial_reordering_syllable_indic (const hb_ot_shape_plan_t *plan, |
945 | | hb_face_t *face, |
946 | | hb_buffer_t *buffer, |
947 | | unsigned int start, unsigned int end) |
948 | 0 | { |
949 | 0 | indic_syllable_type_t syllable_type = (indic_syllable_type_t) (buffer->info[start].syllable() & 0x0F); |
950 | 0 | switch (syllable_type) |
951 | 0 | { |
952 | 0 | case indic_vowel_syllable: /* We made the vowels look like consonants. So let's call the consonant logic! */ |
953 | 0 | case indic_consonant_syllable: |
954 | 0 | initial_reordering_consonant_syllable (plan, face, buffer, start, end); |
955 | 0 | break; |
956 | | |
957 | 0 | case indic_broken_cluster: /* We already inserted dotted-circles, so just call the standalone_cluster. */ |
958 | 0 | case indic_standalone_cluster: |
959 | 0 | initial_reordering_standalone_cluster (plan, face, buffer, start, end); |
960 | 0 | break; |
961 | | |
962 | 0 | case indic_symbol_cluster: |
963 | 0 | case indic_non_indic_cluster: |
964 | 0 | break; |
965 | 0 | } |
966 | 0 | } |
967 | | |
968 | | static bool |
969 | | initial_reordering_indic (const hb_ot_shape_plan_t *plan, |
970 | | hb_font_t *font, |
971 | | hb_buffer_t *buffer) |
972 | 0 | { |
973 | 0 | bool ret = false; |
974 | 0 | if (!buffer->message (font, "start reordering indic initial")) |
975 | 0 | return ret; |
976 | | |
977 | 0 | update_consonant_positions_indic (plan, font, buffer); |
978 | 0 | if (hb_syllabic_insert_dotted_circles (font, buffer, |
979 | 0 | indic_broken_cluster, |
980 | 0 | I_Cat(DOTTEDCIRCLE), |
981 | 0 | I_Cat(Repha), |
982 | 0 | POS_END)) |
983 | 0 | ret = true; |
984 | |
|
985 | 0 | foreach_syllable (buffer, start, end) |
986 | 0 | initial_reordering_syllable_indic (plan, font->face, buffer, start, end); |
987 | |
|
988 | 0 | (void) buffer->message (font, "end reordering indic initial"); |
989 | |
|
990 | 0 | return ret; |
991 | 0 | } |
992 | | |
993 | | static void |
994 | | final_reordering_syllable_indic (const hb_ot_shape_plan_t *plan, |
995 | | hb_buffer_t *buffer, |
996 | | unsigned int start, unsigned int end) |
997 | 0 | { |
998 | 0 | const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data; |
999 | 0 | hb_glyph_info_t *info = buffer->info; |
1000 | | |
1001 | | |
1002 | | /* This function relies heavily on halant glyphs. Lots of ligation |
1003 | | * and possibly multiple substitutions happened prior to this |
1004 | | * phase, and that might have messed up our properties. Recover |
1005 | | * from a particular case of that where we're fairly sure that a |
1006 | | * class of I_Cat(H) is desired but has been lost. */ |
1007 | | /* We don't call load_virama_glyph(), since we know it's already |
1008 | | * loaded. */ |
1009 | 0 | hb_codepoint_t virama_glyph = indic_plan->virama_glyph; |
1010 | 0 | if (virama_glyph) |
1011 | 0 | { |
1012 | 0 | for (unsigned int i = start; i < end; i++) |
1013 | 0 | if (info[i].codepoint == virama_glyph && |
1014 | 0 | _hb_glyph_info_ligated (&info[i]) && |
1015 | 0 | _hb_glyph_info_multiplied (&info[i])) |
1016 | 0 | { |
1017 | | /* This will make sure that this glyph passes is_halant() test. */ |
1018 | 0 | info[i].indic_category() = I_Cat(H); |
1019 | 0 | _hb_glyph_info_clear_ligated_and_multiplied (&info[i]); |
1020 | 0 | } |
1021 | 0 | } |
1022 | | |
1023 | | |
1024 | | /* 4. Final reordering: |
1025 | | * |
1026 | | * After the localized forms and basic shaping forms GSUB features have been |
1027 | | * applied (see below), the shaping engine performs some final glyph |
1028 | | * reordering before applying all the remaining font features to the entire |
1029 | | * syllable. |
1030 | | */ |
1031 | |
|
1032 | 0 | bool try_pref = !!indic_plan->mask_array[INDIC_PREF]; |
1033 | | |
1034 | | /* Find base again */ |
1035 | 0 | unsigned int base; |
1036 | 0 | for (base = start; base < end; base++) |
1037 | 0 | if (info[base].indic_position() >= POS_BASE_C) |
1038 | 0 | { |
1039 | 0 | if (try_pref && base + 1 < end) |
1040 | 0 | { |
1041 | 0 | for (unsigned int i = base + 1; i < end; i++) |
1042 | 0 | if ((info[i].mask & indic_plan->mask_array[INDIC_PREF]) != 0) |
1043 | 0 | { |
1044 | 0 | if (!(_hb_glyph_info_substituted (&info[i]) && |
1045 | 0 | _hb_glyph_info_ligated_and_didnt_multiply (&info[i]))) |
1046 | 0 | { |
1047 | | /* Ok, this was a 'pref' candidate but didn't form any. |
1048 | | * Base is around here... */ |
1049 | 0 | base = i; |
1050 | 0 | while (base < end && is_halant (info[base])) |
1051 | 0 | base++; |
1052 | 0 | if (base < end) |
1053 | 0 | info[base].indic_position() = POS_BASE_C; |
1054 | |
|
1055 | 0 | try_pref = false; |
1056 | 0 | } |
1057 | 0 | break; |
1058 | 0 | } |
1059 | 0 | if (base == end) |
1060 | 0 | break; |
1061 | 0 | } |
1062 | | /* For Malayalam, skip over unformed below- (but NOT post-) forms. */ |
1063 | 0 | if (buffer->props.script == HB_SCRIPT_MALAYALAM) |
1064 | 0 | { |
1065 | 0 | for (unsigned int i = base + 1; i < end; i++) |
1066 | 0 | { |
1067 | 0 | while (i < end && is_joiner (info[i])) |
1068 | 0 | i++; |
1069 | 0 | if (i == end || !is_halant (info[i])) |
1070 | 0 | break; |
1071 | 0 | i++; /* Skip halant. */ |
1072 | 0 | while (i < end && is_joiner (info[i])) |
1073 | 0 | i++; |
1074 | 0 | if (i < end && is_consonant (info[i]) && info[i].indic_position() == POS_BELOW_C) |
1075 | 0 | { |
1076 | 0 | base = i; |
1077 | 0 | info[base].indic_position() = POS_BASE_C; |
1078 | 0 | } |
1079 | 0 | } |
1080 | 0 | } |
1081 | |
|
1082 | 0 | if (start < base && info[base].indic_position() > POS_BASE_C) |
1083 | 0 | base--; |
1084 | 0 | break; |
1085 | 0 | } |
1086 | 0 | if (base == end && start < base && |
1087 | 0 | is_one_of (info[base - 1], FLAG (I_Cat(ZWJ)))) |
1088 | 0 | base--; |
1089 | 0 | if (base < end) |
1090 | 0 | while (start < base && |
1091 | 0 | is_one_of (info[base], (FLAG (I_Cat(N)) | FLAG (I_Cat(H))))) |
1092 | 0 | base--; |
1093 | | |
1094 | | |
1095 | | /* o Reorder matras: |
1096 | | * |
1097 | | * If a pre-base matra character had been reordered before applying basic |
1098 | | * features, the glyph can be moved closer to the main consonant based on |
1099 | | * whether half-forms had been formed. Actual position for the matra is |
1100 | | * defined as “after last standalone halant glyph, after initial matra |
1101 | | * position and before the main consonant”. If ZWJ or ZWNJ follow this |
1102 | | * halant, position is moved after it. |
1103 | | * |
1104 | | * IMPLEMENTATION NOTES: |
1105 | | * |
1106 | | * It looks like the last sentence is wrong. Testing, with Windows 7 Uniscribe |
1107 | | * and Devanagari shows that the behavior is best described as: |
1108 | | * |
1109 | | * "If ZWJ follows this halant, matra is NOT repositioned after this halant. |
1110 | | * If ZWNJ follows this halant, position is moved after it." |
1111 | | * |
1112 | | * Test case, with Adobe Devanagari or Nirmala UI: |
1113 | | * |
1114 | | * U+091F,U+094D,U+200C,U+092F,U+093F |
1115 | | * (Matra moves to the middle, after ZWNJ.) |
1116 | | * |
1117 | | * U+091F,U+094D,U+200D,U+092F,U+093F |
1118 | | * (Matra does NOT move, stays to the left.) |
1119 | | * |
1120 | | * https://github.com/harfbuzz/harfbuzz/issues/1070 |
1121 | | */ |
1122 | |
|
1123 | 0 | if (start + 1 < end && start < base) /* Otherwise there can't be any pre-base matra characters. */ |
1124 | 0 | { |
1125 | | /* If we lost track of base, alas, position before last thingy. */ |
1126 | 0 | unsigned int new_pos = base == end ? base - 2 : base - 1; |
1127 | | |
1128 | | /* Malayalam / Tamil do not have "half" forms or explicit virama forms. |
1129 | | * The glyphs formed by 'half' are Chillus or ligated explicit viramas. |
1130 | | * We want to position matra after them. |
1131 | | */ |
1132 | 0 | if (buffer->props.script != HB_SCRIPT_MALAYALAM && buffer->props.script != HB_SCRIPT_TAMIL) |
1133 | 0 | { |
1134 | 0 | search: |
1135 | 0 | while (new_pos > start && |
1136 | 0 | !(is_one_of (info[new_pos], (FLAG (I_Cat(M)) | FLAG (I_Cat(MPst)) | FLAG (I_Cat(H)))))) |
1137 | 0 | new_pos--; |
1138 | | |
1139 | | /* If we found no Halant we are done. |
1140 | | * Otherwise only proceed if the Halant does |
1141 | | * not belong to the Matra itself! */ |
1142 | 0 | if (is_halant (info[new_pos]) && |
1143 | 0 | info[new_pos].indic_position() != POS_PRE_M) |
1144 | 0 | { |
1145 | | #if 0 // See comment above |
1146 | | /* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */ |
1147 | | if (new_pos + 1 < end && is_joiner (info[new_pos + 1])) |
1148 | | new_pos++; |
1149 | | #endif |
1150 | 0 | if (new_pos + 1 < end) |
1151 | 0 | { |
1152 | | /* -> If ZWJ follows this halant, matra is NOT repositioned after this halant. */ |
1153 | 0 | if (info[new_pos + 1].indic_category() == I_Cat(ZWJ)) |
1154 | 0 | { |
1155 | | /* Keep searching. */ |
1156 | 0 | if (new_pos > start) |
1157 | 0 | { |
1158 | 0 | new_pos--; |
1159 | 0 | goto search; |
1160 | 0 | } |
1161 | 0 | } |
1162 | | /* -> If ZWNJ follows this halant, position is moved after it. |
1163 | | * |
1164 | | * IMPLEMENTATION NOTES: |
1165 | | * |
1166 | | * This is taken care of by the state-machine. A Halant,ZWNJ is a terminating |
1167 | | * sequence for a consonant syllable; any pre-base matras occurring after it |
1168 | | * will belong to the subsequent syllable. |
1169 | | */ |
1170 | 0 | } |
1171 | 0 | } |
1172 | 0 | else |
1173 | 0 | new_pos = start; /* No move. */ |
1174 | 0 | } |
1175 | | |
1176 | 0 | if (start < new_pos && info[new_pos].indic_position () != POS_PRE_M) |
1177 | 0 | { |
1178 | | /* Now go see if there's actually any matras... */ |
1179 | 0 | for (unsigned int i = new_pos; i > start; i--) |
1180 | 0 | if (info[i - 1].indic_position () == POS_PRE_M) |
1181 | 0 | { |
1182 | 0 | unsigned int old_pos = i - 1; |
1183 | 0 | if (old_pos < base && base <= new_pos) /* Shouldn't actually happen. */ |
1184 | 0 | base--; |
1185 | |
|
1186 | 0 | hb_glyph_info_t tmp = info[old_pos]; |
1187 | 0 | memmove (&info[old_pos], &info[old_pos + 1], (new_pos - old_pos) * sizeof (info[0])); |
1188 | 0 | info[new_pos] = tmp; |
1189 | | |
1190 | | /* Note: this merge_clusters() is intentionally *after* the reordering. |
1191 | | * Indic matra reordering is special and tricky... */ |
1192 | 0 | buffer->merge_clusters (new_pos, hb_min (end, base + 1)); |
1193 | |
|
1194 | 0 | new_pos--; |
1195 | 0 | } |
1196 | 0 | } else { |
1197 | 0 | for (unsigned int i = start; i < base; i++) |
1198 | 0 | if (info[i].indic_position () == POS_PRE_M) { |
1199 | 0 | buffer->merge_clusters (i, hb_min (end, base + 1)); |
1200 | 0 | break; |
1201 | 0 | } |
1202 | 0 | } |
1203 | 0 | } |
1204 | | |
1205 | | |
1206 | | /* o Reorder reph: |
1207 | | * |
1208 | | * Reph’s original position is always at the beginning of the syllable, |
1209 | | * (i.e. it is not reordered at the character reordering stage). However, |
1210 | | * it will be reordered according to the basic-forms shaping results. |
1211 | | * Possible positions for reph, depending on the script, are; after main, |
1212 | | * before post-base consonant forms, and after post-base consonant forms. |
1213 | | */ |
1214 | | |
1215 | | /* Two cases: |
1216 | | * |
1217 | | * - If repha is encoded as a sequence of characters (Ra,H or Ra,H,ZWJ), then |
1218 | | * we should only move it if the sequence ligated to the repha form. |
1219 | | * |
1220 | | * - If repha is encoded separately and in the logical position, we should only |
1221 | | * move it if it did NOT ligate. If it ligated, it's probably the font trying |
1222 | | * to make it work without the reordering. |
1223 | | */ |
1224 | 0 | if (start + 1 < end && |
1225 | 0 | info[start].indic_position() == POS_RA_TO_BECOME_REPH && |
1226 | 0 | ((info[start].indic_category() == I_Cat(Repha)) ^ |
1227 | 0 | _hb_glyph_info_ligated_and_didnt_multiply (&info[start]))) |
1228 | 0 | { |
1229 | 0 | unsigned int new_reph_pos; |
1230 | 0 | reph_position_t reph_pos = indic_plan->config->reph_pos; |
1231 | | |
1232 | | /* 1. If reph should be positioned after post-base consonant forms, |
1233 | | * proceed to step 5. |
1234 | | */ |
1235 | 0 | if (reph_pos == REPH_POS_AFTER_POST) |
1236 | 0 | { |
1237 | 0 | goto reph_step_5; |
1238 | 0 | } |
1239 | | |
1240 | | /* 2. If the reph repositioning class is not after post-base: target |
1241 | | * position is after the first explicit halant glyph between the |
1242 | | * first post-reph consonant and last main consonant. If ZWJ or ZWNJ |
1243 | | * are following this halant, position is moved after it. If such |
1244 | | * position is found, this is the target position. Otherwise, |
1245 | | * proceed to the next step. |
1246 | | * |
1247 | | * Note: in old-implementation fonts, where classifications were |
1248 | | * fixed in shaping engine, there was no case where reph position |
1249 | | * will be found on this step. |
1250 | | */ |
1251 | 0 | { |
1252 | 0 | new_reph_pos = start + 1; |
1253 | 0 | while (new_reph_pos < base && !is_halant (info[new_reph_pos])) |
1254 | 0 | new_reph_pos++; |
1255 | |
|
1256 | 0 | if (new_reph_pos < base && is_halant (info[new_reph_pos])) |
1257 | 0 | { |
1258 | | /* ->If ZWJ or ZWNJ are following this halant, position is moved after it. */ |
1259 | 0 | if (new_reph_pos + 1 < base && is_joiner (info[new_reph_pos + 1])) |
1260 | 0 | new_reph_pos++; |
1261 | 0 | goto reph_move; |
1262 | 0 | } |
1263 | 0 | } |
1264 | | |
1265 | | /* 3. If reph should be repositioned after the main consonant: find the |
1266 | | * first consonant not ligated with main, or find the first |
1267 | | * consonant that is not a potential pre-base-reordering Ra. |
1268 | | */ |
1269 | 0 | if (reph_pos == REPH_POS_AFTER_MAIN) |
1270 | 0 | { |
1271 | 0 | new_reph_pos = base; |
1272 | 0 | while (new_reph_pos + 1 < end && info[new_reph_pos + 1].indic_position() <= POS_AFTER_MAIN) |
1273 | 0 | new_reph_pos++; |
1274 | 0 | if (new_reph_pos < end) |
1275 | 0 | goto reph_move; |
1276 | 0 | } |
1277 | | |
1278 | | /* 4. If reph should be positioned before post-base consonant, find |
1279 | | * first post-base classified consonant not ligated with main. If no |
1280 | | * consonant is found, the target position should be before the |
1281 | | * first matra, syllable modifier sign or vedic sign. |
1282 | | */ |
1283 | | /* This is our take on what step 4 is trying to say (and failing, BADLY). */ |
1284 | 0 | if (reph_pos == REPH_POS_AFTER_SUB) |
1285 | 0 | { |
1286 | 0 | new_reph_pos = base; |
1287 | 0 | while (new_reph_pos + 1 < end && |
1288 | 0 | !( FLAG_UNSAFE (info[new_reph_pos + 1].indic_position()) & (FLAG (POS_POST_C) | FLAG (POS_AFTER_POST) | FLAG (POS_SMVD)))) |
1289 | 0 | new_reph_pos++; |
1290 | 0 | if (new_reph_pos < end) |
1291 | 0 | goto reph_move; |
1292 | 0 | } |
1293 | | |
1294 | | /* 5. If no consonant is found in steps 3 or 4, move reph to a position |
1295 | | * immediately before the first post-base matra, syllable modifier |
1296 | | * sign or vedic sign that has a reordering class after the intended |
1297 | | * reph position. For example, if the reordering position for reph |
1298 | | * is post-main, it will skip above-base matras that also have a |
1299 | | * post-main position. |
1300 | | */ |
1301 | 0 | reph_step_5: |
1302 | 0 | { |
1303 | | /* Copied from step 2. */ |
1304 | 0 | new_reph_pos = start + 1; |
1305 | 0 | while (new_reph_pos < base && !is_halant (info[new_reph_pos])) |
1306 | 0 | new_reph_pos++; |
1307 | |
|
1308 | 0 | if (new_reph_pos < base && is_halant (info[new_reph_pos])) |
1309 | 0 | { |
1310 | | /* ->If ZWJ or ZWNJ are following this halant, position is moved after it. */ |
1311 | 0 | if (new_reph_pos + 1 < base && is_joiner (info[new_reph_pos + 1])) |
1312 | 0 | new_reph_pos++; |
1313 | 0 | goto reph_move; |
1314 | 0 | } |
1315 | 0 | } |
1316 | | /* See https://github.com/harfbuzz/harfbuzz/issues/2298#issuecomment-615318654 */ |
1317 | | |
1318 | | /* 6. Otherwise, reorder reph to the end of the syllable. |
1319 | | */ |
1320 | 0 | { |
1321 | 0 | new_reph_pos = end - 1; |
1322 | 0 | while (new_reph_pos > start && info[new_reph_pos].indic_position() == POS_SMVD) |
1323 | 0 | new_reph_pos--; |
1324 | | |
1325 | | /* |
1326 | | * If the Reph is to be ending up after a Matra,Halant sequence, |
1327 | | * position it before that Halant so it can interact with the Matra. |
1328 | | * However, if it's a plain Consonant,Halant we shouldn't do that. |
1329 | | * Uniscribe doesn't do this. |
1330 | | * TEST: U+0930,U+094D,U+0915,U+094B,U+094D |
1331 | | */ |
1332 | 0 | if (unlikely (is_halant (info[new_reph_pos]))) |
1333 | 0 | { |
1334 | 0 | for (unsigned int i = base + 1; i < new_reph_pos; i++) |
1335 | 0 | if (FLAG_UNSAFE (info[i].indic_category()) & (FLAG (I_Cat(M)) | FLAG (I_Cat(MPst)))) |
1336 | 0 | { |
1337 | | /* Ok, got it. */ |
1338 | 0 | new_reph_pos--; |
1339 | 0 | } |
1340 | 0 | } |
1341 | |
|
1342 | 0 | goto reph_move; |
1343 | 0 | } |
1344 | | |
1345 | 0 | reph_move: |
1346 | 0 | { |
1347 | | /* Move */ |
1348 | 0 | buffer->merge_clusters (start, new_reph_pos + 1); |
1349 | 0 | hb_glyph_info_t reph = info[start]; |
1350 | 0 | memmove (&info[start], &info[start + 1], (new_reph_pos - start) * sizeof (info[0])); |
1351 | 0 | info[new_reph_pos] = reph; |
1352 | |
|
1353 | 0 | if (start < base && base <= new_reph_pos) |
1354 | 0 | base--; |
1355 | 0 | } |
1356 | 0 | } |
1357 | | |
1358 | | |
1359 | | /* o Reorder pre-base-reordering consonants: |
1360 | | * |
1361 | | * If a pre-base-reordering consonant is found, reorder it according to |
1362 | | * the following rules: |
1363 | | */ |
1364 | | |
1365 | 0 | if (try_pref && base + 1 < end) /* Otherwise there can't be any pre-base-reordering Ra. */ |
1366 | 0 | { |
1367 | 0 | for (unsigned int i = base + 1; i < end; i++) |
1368 | 0 | if ((info[i].mask & indic_plan->mask_array[INDIC_PREF]) != 0) |
1369 | 0 | { |
1370 | | /* 1. Only reorder a glyph produced by substitution during application |
1371 | | * of the <pref> feature. (Note that a font may shape a Ra consonant with |
1372 | | * the feature generally but block it in certain contexts.) |
1373 | | */ |
1374 | | /* Note: We just check that something got substituted. We don't check that |
1375 | | * the <pref> feature actually did it... |
1376 | | * |
1377 | | * Reorder pref only if it ligated. */ |
1378 | 0 | if (_hb_glyph_info_ligated_and_didnt_multiply (&info[i])) |
1379 | 0 | { |
1380 | | /* |
1381 | | * 2. Try to find a target position the same way as for pre-base matra. |
1382 | | * If it is found, reorder pre-base consonant glyph. |
1383 | | * |
1384 | | * 3. If position is not found, reorder immediately before main |
1385 | | * consonant. |
1386 | | */ |
1387 | |
|
1388 | 0 | unsigned int new_pos = base; |
1389 | | /* Malayalam / Tamil do not have "half" forms or explicit virama forms. |
1390 | | * The glyphs formed by 'half' are Chillus or ligated explicit viramas. |
1391 | | * We want to position matra after them. |
1392 | | */ |
1393 | 0 | if (buffer->props.script != HB_SCRIPT_MALAYALAM && buffer->props.script != HB_SCRIPT_TAMIL) |
1394 | 0 | { |
1395 | 0 | while (new_pos > start && |
1396 | 0 | !(is_one_of (info[new_pos - 1], FLAG (I_Cat(M)) | FLAG (I_Cat(MPst)) | FLAG (I_Cat(H))))) |
1397 | 0 | new_pos--; |
1398 | 0 | } |
1399 | |
|
1400 | 0 | if (new_pos > start && is_halant (info[new_pos - 1])) |
1401 | 0 | { |
1402 | | /* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */ |
1403 | 0 | if (new_pos < end && is_joiner (info[new_pos])) |
1404 | 0 | new_pos++; |
1405 | 0 | } |
1406 | |
|
1407 | 0 | { |
1408 | 0 | unsigned int old_pos = i; |
1409 | |
|
1410 | 0 | buffer->merge_clusters (new_pos, old_pos + 1); |
1411 | 0 | hb_glyph_info_t tmp = info[old_pos]; |
1412 | 0 | memmove (&info[new_pos + 1], &info[new_pos], (old_pos - new_pos) * sizeof (info[0])); |
1413 | 0 | info[new_pos] = tmp; |
1414 | |
|
1415 | 0 | if (new_pos <= base && base < old_pos) |
1416 | 0 | base++; |
1417 | 0 | } |
1418 | 0 | } |
1419 | |
|
1420 | 0 | break; |
1421 | 0 | } |
1422 | 0 | } |
1423 | | |
1424 | | |
1425 | | /* Apply 'init' to the Left Matra if it's a word start. */ |
1426 | 0 | if (info[start].indic_position () == POS_PRE_M) |
1427 | 0 | { |
1428 | 0 | if (!start || |
1429 | 0 | !(FLAG_UNSAFE (_hb_glyph_info_get_general_category (&info[start - 1])) & |
1430 | 0 | FLAG_RANGE (HB_UNICODE_GENERAL_CATEGORY_FORMAT, HB_UNICODE_GENERAL_CATEGORY_NON_SPACING_MARK))) |
1431 | 0 | info[start].mask |= indic_plan->mask_array[INDIC_INIT]; |
1432 | 0 | else |
1433 | 0 | buffer->unsafe_to_break (start - 1, start + 1); |
1434 | 0 | } |
1435 | 0 | } |
1436 | | |
1437 | | |
1438 | | static bool |
1439 | | final_reordering_indic (const hb_ot_shape_plan_t *plan, |
1440 | | hb_font_t *font HB_UNUSED, |
1441 | | hb_buffer_t *buffer) |
1442 | 0 | { |
1443 | 0 | unsigned int count = buffer->len; |
1444 | 0 | if (unlikely (!count)) return false; |
1445 | | |
1446 | 0 | if (buffer->message (font, "start reordering indic final")) { |
1447 | 0 | foreach_syllable (buffer, start, end) |
1448 | 0 | final_reordering_syllable_indic (plan, buffer, start, end); |
1449 | 0 | (void) buffer->message (font, "end reordering indic final"); |
1450 | 0 | } |
1451 | |
|
1452 | 0 | HB_BUFFER_DEALLOCATE_VAR (buffer, indic_category); |
1453 | 0 | HB_BUFFER_DEALLOCATE_VAR (buffer, indic_position); |
1454 | |
|
1455 | 0 | return false; |
1456 | 0 | } |
1457 | | |
1458 | | |
1459 | | static void |
1460 | | preprocess_text_indic (const hb_ot_shape_plan_t *plan, |
1461 | | hb_buffer_t *buffer, |
1462 | | hb_font_t *font) |
1463 | 0 | { |
1464 | 0 | _hb_preprocess_text_vowel_constraints (plan, buffer, font); |
1465 | 0 | } |
1466 | | |
1467 | | static bool |
1468 | | decompose_indic (const hb_ot_shape_normalize_context_t *c, |
1469 | | hb_codepoint_t ab, |
1470 | | hb_codepoint_t *a, |
1471 | | hb_codepoint_t *b) |
1472 | 0 | { |
1473 | 0 | switch (ab) |
1474 | 0 | { |
1475 | | /* Don't decompose these. */ |
1476 | 0 | case 0x0931u : return false; /* DEVANAGARI LETTER RRA */ |
1477 | | // https://github.com/harfbuzz/harfbuzz/issues/779 |
1478 | 0 | case 0x09DCu : return false; /* BENGALI LETTER RRA */ |
1479 | 0 | case 0x09DDu : return false; /* BENGALI LETTER RHA */ |
1480 | 0 | case 0x0B94u : return false; /* TAMIL LETTER AU */ |
1481 | | |
1482 | | |
1483 | | /* |
1484 | | * Decompose split matras that don't have Unicode decompositions. |
1485 | | */ |
1486 | |
|
1487 | | #if 0 |
1488 | | /* Gujarati */ |
1489 | | /* This one has no decomposition in Unicode, but needs no decomposition either. */ |
1490 | | /* case 0x0AC9u : return false; */ |
1491 | | |
1492 | | /* Oriya */ |
1493 | | case 0x0B57u : *a = no decomp, -> RIGHT; return true; |
1494 | | #endif |
1495 | 0 | } |
1496 | | |
1497 | 0 | return (bool) c->unicode->decompose (ab, a, b); |
1498 | 0 | } |
1499 | | |
1500 | | static bool |
1501 | | compose_indic (const hb_ot_shape_normalize_context_t *c, |
1502 | | hb_codepoint_t a, |
1503 | | hb_codepoint_t b, |
1504 | | hb_codepoint_t *ab) |
1505 | 0 | { |
1506 | | /* Avoid recomposing split matras. */ |
1507 | 0 | if (HB_UNICODE_GENERAL_CATEGORY_IS_MARK (c->unicode->general_category (a))) |
1508 | 0 | return false; |
1509 | | |
1510 | | /* Composition-exclusion exceptions that we want to recompose. */ |
1511 | 0 | if (a == 0x09AFu && b == 0x09BCu) { *ab = 0x09DFu; return true; } |
1512 | | |
1513 | 0 | return (bool) c->unicode->compose (a, b, ab); |
1514 | 0 | } |
1515 | | |
1516 | | |
1517 | | const hb_ot_shaper_t _hb_ot_shaper_indic = |
1518 | | { |
1519 | | collect_features_indic, |
1520 | | override_features_indic, |
1521 | | data_create_indic, |
1522 | | data_destroy_indic, |
1523 | | preprocess_text_indic, |
1524 | | nullptr, /* postprocess_glyphs */ |
1525 | | decompose_indic, |
1526 | | compose_indic, |
1527 | | setup_masks_indic, |
1528 | | nullptr, /* reorder_marks */ |
1529 | | HB_TAG_NONE, /* gpos_tag */ |
1530 | | HB_OT_SHAPE_NORMALIZATION_MODE_COMPOSED_DIACRITICS_NO_SHORT_CIRCUIT, |
1531 | | HB_OT_SHAPE_ZERO_WIDTH_MARKS_NONE, |
1532 | | false, /* fallback_position */ |
1533 | | }; |
1534 | | |
1535 | | |
1536 | | #endif |