/work/workdir/UnpackedTarball/harfbuzz/src/hb-graphite2.cc
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright © 2011 Martin Hosken |
3 | | * Copyright © 2011 SIL International |
4 | | * Copyright © 2011,2012 Google, Inc. |
5 | | * |
6 | | * This is part of HarfBuzz, a text shaping library. |
7 | | * |
8 | | * Permission is hereby granted, without written agreement and without |
9 | | * license or royalty fees, to use, copy, modify, and distribute this |
10 | | * software and its documentation for any purpose, provided that the |
11 | | * above copyright notice and the following two paragraphs appear in |
12 | | * all copies of this software. |
13 | | * |
14 | | * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
15 | | * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
16 | | * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
17 | | * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
18 | | * DAMAGE. |
19 | | * |
20 | | * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
21 | | * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
22 | | * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
23 | | * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
24 | | * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
25 | | * |
26 | | * Google Author(s): Behdad Esfahbod |
27 | | */ |
28 | | |
29 | | #include "hb.hh" |
30 | | |
31 | | #ifdef HAVE_GRAPHITE2 |
32 | | |
33 | | #include "hb-shaper-impl.hh" |
34 | | |
35 | | #include "hb-graphite2.h" |
36 | | |
37 | | #include <graphite2/Segment.h> |
38 | | |
39 | | #include "hb-ot-layout.h" |
40 | | |
41 | | |
42 | | /** |
43 | | * SECTION:hb-graphite2 |
44 | | * @title: hb-graphite2 |
45 | | * @short_description: Graphite2 integration |
46 | | * @include: hb-graphite2.h |
47 | | * |
48 | | * Functions for using HarfBuzz with fonts that include Graphite features. |
49 | | * |
50 | | * For Graphite features to work, you must be sure that HarfBuzz was compiled |
51 | | * with the `graphite2` shaping engine enabled. Currently, the default is to |
52 | | * not enable `graphite2` shaping. |
53 | | **/ |
54 | | |
55 | | |
56 | | /* |
57 | | * shaper face data |
58 | | */ |
59 | | |
60 | | typedef struct hb_graphite2_tablelist_t |
61 | | { |
62 | | struct hb_graphite2_tablelist_t *next; |
63 | | hb_blob_t *blob; |
64 | | unsigned int tag; |
65 | | } hb_graphite2_tablelist_t; |
66 | | |
67 | | struct hb_graphite2_face_data_t |
68 | | { |
69 | | hb_face_t *face; |
70 | | gr_face *grface; |
71 | | hb_atomic_t<hb_graphite2_tablelist_t *> tlist; |
72 | | }; |
73 | | |
74 | | static const void *hb_graphite2_get_table (const void *data, unsigned int tag, size_t *len) |
75 | 0 | { |
76 | 0 | hb_graphite2_face_data_t *face_data = (hb_graphite2_face_data_t *) data; |
77 | 0 | hb_graphite2_tablelist_t *tlist = face_data->tlist; |
78 | |
|
79 | 0 | hb_blob_t *blob = nullptr; |
80 | |
|
81 | 0 | for (hb_graphite2_tablelist_t *p = tlist; p; p = p->next) |
82 | 0 | if (p->tag == tag) { |
83 | 0 | blob = p->blob; |
84 | 0 | break; |
85 | 0 | } |
86 | |
|
87 | 0 | if (unlikely (!blob)) |
88 | 0 | { |
89 | 0 | blob = face_data->face->reference_table (tag); |
90 | |
|
91 | 0 | hb_graphite2_tablelist_t *p = (hb_graphite2_tablelist_t *) hb_calloc (1, sizeof (hb_graphite2_tablelist_t)); |
92 | 0 | if (unlikely (!p)) { |
93 | 0 | hb_blob_destroy (blob); |
94 | 0 | return nullptr; |
95 | 0 | } |
96 | 0 | p->blob = blob; |
97 | 0 | p->tag = tag; |
98 | |
|
99 | 0 | retry: |
100 | 0 | hb_graphite2_tablelist_t *tlist = face_data->tlist; |
101 | 0 | p->next = tlist; |
102 | |
|
103 | 0 | if (unlikely (!face_data->tlist.cmpexch (tlist, p))) |
104 | 0 | goto retry; |
105 | 0 | } |
106 | | |
107 | 0 | unsigned int tlen; |
108 | 0 | const char *d = hb_blob_get_data (blob, &tlen); |
109 | 0 | *len = tlen; |
110 | 0 | return d; |
111 | 0 | } |
112 | | |
113 | | hb_graphite2_face_data_t * |
114 | | _hb_graphite2_shaper_face_data_create (hb_face_t *face) |
115 | 33.1M | { |
116 | 33.1M | hb_blob_t *silf_blob = face->reference_table (HB_GRAPHITE2_TAG_SILF); |
117 | | /* Umm, we just reference the table to check whether it exists. |
118 | | * Maybe add better API for this? */ |
119 | 33.1M | if (!hb_blob_get_length (silf_blob)) |
120 | 33.1M | { |
121 | 33.1M | hb_blob_destroy (silf_blob); |
122 | 33.1M | return nullptr; |
123 | 33.1M | } |
124 | 0 | hb_blob_destroy (silf_blob); |
125 | |
|
126 | 0 | hb_graphite2_face_data_t *data = (hb_graphite2_face_data_t *) hb_calloc (1, sizeof (hb_graphite2_face_data_t)); |
127 | 0 | if (unlikely (!data)) |
128 | 0 | return nullptr; |
129 | | |
130 | 0 | data->face = face; |
131 | 0 | const gr_face_ops ops = {sizeof(gr_face_ops), &hb_graphite2_get_table, NULL}; |
132 | 0 | data->grface = gr_make_face_with_ops (data, &ops, gr_face_preloadAll); |
133 | |
|
134 | 0 | if (unlikely (!data->grface)) { |
135 | 0 | hb_free (data); |
136 | 0 | return nullptr; |
137 | 0 | } |
138 | | |
139 | 0 | return data; |
140 | 0 | } |
141 | | |
142 | | void |
143 | | _hb_graphite2_shaper_face_data_destroy (hb_graphite2_face_data_t *data) |
144 | 0 | { |
145 | 0 | hb_graphite2_tablelist_t *tlist = data->tlist; |
146 | |
|
147 | 0 | while (tlist) |
148 | 0 | { |
149 | 0 | hb_graphite2_tablelist_t *old = tlist; |
150 | 0 | hb_blob_destroy (tlist->blob); |
151 | 0 | tlist = tlist->next; |
152 | 0 | hb_free (old); |
153 | 0 | } |
154 | |
|
155 | 0 | gr_face_destroy (data->grface); |
156 | |
|
157 | 0 | hb_free (data); |
158 | 0 | } |
159 | | |
160 | | /** |
161 | | * hb_graphite2_face_get_gr_face: (skip) |
162 | | * @face: @hb_face_t to query |
163 | | * |
164 | | * Fetches the Graphite2 gr_face corresponding to the specified |
165 | | * #hb_face_t face object. |
166 | | * |
167 | | * Return value: the gr_face found |
168 | | * |
169 | | * Since: 0.9.10 |
170 | | */ |
171 | | gr_face * |
172 | | hb_graphite2_face_get_gr_face (hb_face_t *face) |
173 | 234k | { |
174 | 234k | const hb_graphite2_face_data_t *data = face->data.graphite2; |
175 | 234k | return data ? data->grface : nullptr; |
176 | 234k | } |
177 | | |
178 | | |
179 | | /* |
180 | | * shaper font data |
181 | | */ |
182 | | |
183 | | struct hb_graphite2_font_data_t {}; |
184 | | |
185 | | hb_graphite2_font_data_t * |
186 | | _hb_graphite2_shaper_font_data_create (hb_font_t *font HB_UNUSED) |
187 | 0 | { |
188 | 0 | return (hb_graphite2_font_data_t *) HB_SHAPER_DATA_SUCCEEDED; |
189 | 0 | } |
190 | | |
191 | | void |
192 | | _hb_graphite2_shaper_font_data_destroy (hb_graphite2_font_data_t *data HB_UNUSED) |
193 | 0 | { |
194 | 0 | } |
195 | | |
196 | | #ifndef HB_DISABLE_DEPRECATED |
197 | | /** |
198 | | * hb_graphite2_font_get_gr_font: (skip) |
199 | | * @font: An #hb_font_t |
200 | | * |
201 | | * Always returns `NULL`. Use hb_graphite2_face_get_gr_face() instead. |
202 | | * |
203 | | * Return value: (nullable): Graphite2 font associated with @font. |
204 | | * |
205 | | * Since: 0.9.10 |
206 | | * Deprecated: 1.4.2 |
207 | | */ |
208 | | gr_font * |
209 | | hb_graphite2_font_get_gr_font (hb_font_t *font HB_UNUSED) |
210 | 0 | { |
211 | 0 | return nullptr; |
212 | 0 | } |
213 | | #endif |
214 | | |
215 | | |
216 | | /* |
217 | | * shaper |
218 | | */ |
219 | | |
220 | | struct hb_graphite2_cluster_t { |
221 | | unsigned int base_char; |
222 | | unsigned int num_chars; |
223 | | unsigned int base_glyph; |
224 | | unsigned int num_glyphs; |
225 | | unsigned int cluster; |
226 | | int advance; |
227 | | }; |
228 | | |
229 | | hb_bool_t |
230 | | _hb_graphite2_shape (hb_shape_plan_t *shape_plan HB_UNUSED, |
231 | | hb_font_t *font, |
232 | | hb_buffer_t *buffer, |
233 | | const hb_feature_t *features, |
234 | | unsigned int num_features) |
235 | 0 | { |
236 | 0 | hb_face_t *face = font->face; |
237 | 0 | gr_face *grface = face->data.graphite2->grface; |
238 | |
|
239 | 0 | const char *lang = hb_language_to_string (hb_buffer_get_language (buffer)); |
240 | 0 | const char *lang_end = lang ? strchr (lang, '-') : nullptr; |
241 | 0 | int lang_len = lang_end ? lang_end - lang : -1; |
242 | 0 | gr_feature_val *feats = gr_face_featureval_for_lang (grface, lang ? hb_tag_from_string (lang, lang_len) : 0); |
243 | |
|
244 | 0 | for (unsigned int i = 0; i < num_features; i++) |
245 | 0 | { |
246 | 0 | const gr_feature_ref *fref = gr_face_find_fref (grface, features[i].tag); |
247 | 0 | if (fref) |
248 | 0 | gr_fref_set_feature_value (fref, features[i].value, feats); |
249 | 0 | } |
250 | |
|
251 | 0 | hb_direction_t direction = buffer->props.direction; |
252 | 0 | hb_direction_t horiz_dir = hb_script_get_horizontal_direction (buffer->props.script); |
253 | | /* TODO vertical: |
254 | | * The only BTT vertical script is Ogham, but it's not clear to me whether OpenType |
255 | | * Ogham fonts are supposed to be implemented BTT or not. Need to research that |
256 | | * first. */ |
257 | 0 | if ((HB_DIRECTION_IS_HORIZONTAL (direction) && |
258 | 0 | direction != horiz_dir && horiz_dir != HB_DIRECTION_INVALID) || |
259 | 0 | (HB_DIRECTION_IS_VERTICAL (direction) && |
260 | 0 | direction != HB_DIRECTION_TTB)) |
261 | 0 | { |
262 | 0 | hb_buffer_reverse_clusters (buffer); |
263 | 0 | direction = HB_DIRECTION_REVERSE (direction); |
264 | 0 | } |
265 | |
|
266 | 0 | gr_segment *seg = nullptr; |
267 | 0 | const gr_slot *is; |
268 | 0 | unsigned int ci = 0, ic = 0; |
269 | 0 | unsigned int curradvx = 0, curradvy = 0; |
270 | |
|
271 | 0 | unsigned int scratch_size; |
272 | 0 | hb_buffer_t::scratch_buffer_t *scratch = buffer->get_scratch_buffer (&scratch_size); |
273 | |
|
274 | 0 | uint32_t *chars = (uint32_t *) scratch; |
275 | |
|
276 | 0 | for (unsigned int i = 0; i < buffer->len; ++i) |
277 | 0 | chars[i] = buffer->info[i].codepoint; |
278 | |
|
279 | 0 | seg = gr_make_seg (nullptr, grface, |
280 | 0 | HB_TAG_NONE, // https://github.com/harfbuzz/harfbuzz/issues/3439#issuecomment-1442650148 |
281 | 0 | feats, |
282 | 0 | gr_utf32, chars, buffer->len, |
283 | 0 | 2 | (direction == HB_DIRECTION_RTL ? 1 : 0)); |
284 | |
|
285 | 0 | if (unlikely (!seg)) { |
286 | 0 | if (feats) gr_featureval_destroy (feats); |
287 | 0 | return false; |
288 | 0 | } |
289 | | |
290 | 0 | unsigned int glyph_count = gr_seg_n_slots (seg); |
291 | 0 | if (unlikely (!glyph_count)) { |
292 | 0 | if (feats) gr_featureval_destroy (feats); |
293 | 0 | gr_seg_destroy (seg); |
294 | 0 | buffer->len = 0; |
295 | 0 | return true; |
296 | 0 | } |
297 | | |
298 | 0 | (void) buffer->ensure (glyph_count); |
299 | 0 | scratch = buffer->get_scratch_buffer (&scratch_size); |
300 | 0 | while ((DIV_CEIL (sizeof (hb_graphite2_cluster_t) * buffer->len, sizeof (*scratch)) + |
301 | 0 | DIV_CEIL (sizeof (hb_codepoint_t) * glyph_count, sizeof (*scratch))) > scratch_size) |
302 | 0 | { |
303 | 0 | if (unlikely (!buffer->ensure (buffer->allocated * 2))) |
304 | 0 | { |
305 | 0 | if (feats) gr_featureval_destroy (feats); |
306 | 0 | gr_seg_destroy (seg); |
307 | 0 | return false; |
308 | 0 | } |
309 | 0 | scratch = buffer->get_scratch_buffer (&scratch_size); |
310 | 0 | } |
311 | | |
312 | 0 | #define ALLOCATE_ARRAY(Type, name, len) \ |
313 | 0 | Type *name = (Type *) scratch; \ |
314 | 0 | do { \ |
315 | 0 | unsigned int _consumed = DIV_CEIL ((len) * sizeof (Type), sizeof (*scratch)); \ |
316 | 0 | assert (_consumed <= scratch_size); \ |
317 | 0 | scratch += _consumed; \ |
318 | 0 | scratch_size -= _consumed; \ |
319 | 0 | } while (0) |
320 | | |
321 | 0 | ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); |
322 | 0 | ALLOCATE_ARRAY (hb_codepoint_t, gids, glyph_count); |
323 | | |
324 | 0 | #undef ALLOCATE_ARRAY |
325 | | |
326 | 0 | hb_memset (clusters, 0, sizeof (clusters[0]) * buffer->len); |
327 | |
|
328 | 0 | hb_codepoint_t *pg = gids; |
329 | 0 | clusters[0].cluster = buffer->info[0].cluster; |
330 | 0 | unsigned int upem = hb_face_get_upem (face); |
331 | 0 | float xscale = (float) font->x_scale / upem; |
332 | 0 | float yscale = (float) font->y_scale / upem; |
333 | 0 | yscale *= yscale / xscale; |
334 | 0 | unsigned int curradv = 0; |
335 | 0 | if (HB_DIRECTION_IS_BACKWARD (direction)) |
336 | 0 | { |
337 | 0 | curradv = gr_slot_origin_X(gr_seg_first_slot(seg)) * xscale; |
338 | 0 | clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv; |
339 | 0 | } |
340 | 0 | else |
341 | 0 | clusters[0].advance = 0; |
342 | 0 | for (is = gr_seg_first_slot (seg), ic = 0; is; is = gr_slot_next_in_segment (is), ic++) |
343 | 0 | { |
344 | 0 | unsigned int before = gr_slot_before (is); |
345 | 0 | unsigned int after = gr_slot_after (is); |
346 | 0 | *pg = gr_slot_gid (is); |
347 | 0 | pg++; |
348 | 0 | while (clusters[ci].base_char > before && ci) |
349 | 0 | { |
350 | 0 | clusters[ci-1].num_chars += clusters[ci].num_chars; |
351 | 0 | clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; |
352 | 0 | clusters[ci-1].advance += clusters[ci].advance; |
353 | 0 | ci--; |
354 | 0 | } |
355 | |
|
356 | 0 | if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char + clusters[ci].num_chars) |
357 | 0 | { |
358 | 0 | hb_graphite2_cluster_t *c = clusters + ci + 1; |
359 | 0 | c->base_char = clusters[ci].base_char + clusters[ci].num_chars; |
360 | 0 | c->cluster = buffer->info[c->base_char].cluster; |
361 | 0 | c->num_chars = before - c->base_char; |
362 | 0 | c->base_glyph = ic; |
363 | 0 | c->num_glyphs = 0; |
364 | 0 | if (HB_DIRECTION_IS_BACKWARD (direction)) |
365 | 0 | { |
366 | 0 | c->advance = curradv - gr_slot_origin_X(is) * xscale; |
367 | 0 | curradv -= c->advance; |
368 | 0 | } |
369 | 0 | else |
370 | 0 | { |
371 | 0 | auto origin_X = gr_slot_origin_X (is) * xscale; |
372 | 0 | c->advance = 0; |
373 | 0 | clusters[ci].advance += origin_X - curradv; |
374 | 0 | curradv = origin_X; |
375 | 0 | } |
376 | 0 | ci++; |
377 | 0 | } |
378 | 0 | clusters[ci].num_glyphs++; |
379 | |
|
380 | 0 | if (clusters[ci].base_char + clusters[ci].num_chars < after + 1) |
381 | 0 | clusters[ci].num_chars = after + 1 - clusters[ci].base_char; |
382 | 0 | } |
383 | |
|
384 | 0 | if (HB_DIRECTION_IS_BACKWARD (direction)) |
385 | 0 | clusters[ci].advance += curradv; |
386 | 0 | else |
387 | 0 | clusters[ci].advance += gr_seg_advance_X(seg) * xscale - curradv; |
388 | 0 | ci++; |
389 | |
|
390 | 0 | for (unsigned int i = 0; i < ci; ++i) |
391 | 0 | { |
392 | 0 | for (unsigned int j = 0; j < clusters[i].num_glyphs; ++j) |
393 | 0 | { |
394 | 0 | hb_glyph_info_t *info = &buffer->info[clusters[i].base_glyph + j]; |
395 | 0 | info->codepoint = gids[clusters[i].base_glyph + j]; |
396 | 0 | info->cluster = clusters[i].cluster; |
397 | 0 | info->var1.i32 = clusters[i].advance; // all glyphs in the cluster get the same advance |
398 | 0 | } |
399 | 0 | } |
400 | 0 | buffer->len = glyph_count; |
401 | | |
402 | | /* Positioning. */ |
403 | 0 | unsigned int currclus = UINT_MAX; |
404 | 0 | const hb_glyph_info_t *info = buffer->info; |
405 | 0 | hb_glyph_position_t *pPos = hb_buffer_get_glyph_positions (buffer, nullptr); |
406 | 0 | if (!HB_DIRECTION_IS_BACKWARD (direction)) |
407 | 0 | { |
408 | 0 | curradvx = 0; |
409 | 0 | for (is = gr_seg_first_slot (seg); is; pPos++, ++info, is = gr_slot_next_in_segment (is)) |
410 | 0 | { |
411 | 0 | pPos->x_offset = gr_slot_origin_X (is) * xscale - curradvx; |
412 | 0 | pPos->y_offset = gr_slot_origin_Y (is) * yscale - curradvy; |
413 | 0 | if (info->cluster != currclus) { |
414 | 0 | pPos->x_advance = info->var1.i32; |
415 | 0 | curradvx += pPos->x_advance; |
416 | 0 | currclus = info->cluster; |
417 | 0 | } else |
418 | 0 | pPos->x_advance = 0.; |
419 | |
|
420 | 0 | pPos->y_advance = gr_slot_advance_Y (is, grface, nullptr) * yscale; |
421 | 0 | curradvy += pPos->y_advance; |
422 | 0 | } |
423 | 0 | } |
424 | 0 | else |
425 | 0 | { |
426 | 0 | curradvx = gr_seg_advance_X(seg) * xscale; |
427 | 0 | for (is = gr_seg_first_slot (seg); is; pPos++, info++, is = gr_slot_next_in_segment (is)) |
428 | 0 | { |
429 | 0 | if (info->cluster != currclus) |
430 | 0 | { |
431 | 0 | pPos->x_advance = info->var1.i32; |
432 | 0 | curradvx -= pPos->x_advance; |
433 | 0 | currclus = info->cluster; |
434 | 0 | } else |
435 | 0 | pPos->x_advance = 0.; |
436 | |
|
437 | 0 | pPos->y_advance = gr_slot_advance_Y (is, grface, nullptr) * yscale; |
438 | 0 | curradvy -= pPos->y_advance; |
439 | 0 | pPos->x_offset = gr_slot_origin_X (is) * xscale - info->var1.i32 - curradvx + pPos->x_advance; |
440 | 0 | pPos->y_offset = gr_slot_origin_Y (is) * yscale - curradvy; |
441 | 0 | } |
442 | 0 | hb_buffer_reverse_clusters (buffer); |
443 | 0 | } |
444 | |
|
445 | 0 | if (feats) gr_featureval_destroy (feats); |
446 | 0 | gr_seg_destroy (seg); |
447 | |
|
448 | 0 | buffer->clear_glyph_flags (); |
449 | 0 | buffer->unsafe_to_break (); |
450 | |
|
451 | 0 | return true; |
452 | 0 | } |
453 | | |
454 | | |
455 | | #endif |