2 * Copyright © 2011 Martin Hosken
3 * Copyright © 2011 SIL International
4 * Copyright © 2011,2012 Google, Inc.
6 * This is part of HarfBuzz, a text shaping library.
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.
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
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.
26 * Google Author(s): Behdad Esfahbod
33 #include "hb-shaper-impl.hh"
35 #include "hb-graphite2.h"
37 #include <graphite2/Segment.h>
39 #include "hb-ot-layout.h"
43 * SECTION:hb-graphite2
44 * @title: hb-graphite2
45 * @short_description: Graphite2 integration
46 * @include: hb-graphite2.h
48 * Functions for using HarfBuzz with fonts that include Graphite features.
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.
60 typedef struct hb_graphite2_tablelist_t
62 struct hb_graphite2_tablelist_t *next;
65 } hb_graphite2_tablelist_t;
67 struct hb_graphite2_face_data_t
71 hb_atomic_ptr_t<hb_graphite2_tablelist_t> tlist;
74 static const void *hb_graphite2_get_table (const void *data, unsigned int tag, size_t *len)
76 hb_graphite2_face_data_t *face_data = (hb_graphite2_face_data_t *) data;
77 hb_graphite2_tablelist_t *tlist = face_data->tlist;
79 hb_blob_t *blob = nullptr;
81 for (hb_graphite2_tablelist_t *p = tlist; p; p = p->next)
89 blob = face_data->face->reference_table (tag);
91 hb_graphite2_tablelist_t *p = (hb_graphite2_tablelist_t *) hb_calloc (1, sizeof (hb_graphite2_tablelist_t));
93 hb_blob_destroy (blob);
100 hb_graphite2_tablelist_t *tlist = face_data->tlist;
103 if (unlikely (!face_data->tlist.cmpexch (tlist, p)))
108 const char *d = hb_blob_get_data (blob, &tlen);
113 hb_graphite2_face_data_t *
114 _hb_graphite2_shaper_face_data_create (hb_face_t *face)
116 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 if (!hb_blob_get_length (silf_blob))
121 hb_blob_destroy (silf_blob);
124 hb_blob_destroy (silf_blob);
126 hb_graphite2_face_data_t *data = (hb_graphite2_face_data_t *) hb_calloc (1, sizeof (hb_graphite2_face_data_t));
127 if (unlikely (!data))
131 const gr_face_ops ops = {sizeof(gr_face_ops), &hb_graphite2_get_table, NULL};
132 data->grface = gr_make_face_with_ops (data, &ops, gr_face_preloadAll);
134 if (unlikely (!data->grface)) {
143 _hb_graphite2_shaper_face_data_destroy (hb_graphite2_face_data_t *data)
145 hb_graphite2_tablelist_t *tlist = data->tlist;
149 hb_graphite2_tablelist_t *old = tlist;
150 hb_blob_destroy (tlist->blob);
155 gr_face_destroy (data->grface);
161 * hb_graphite2_face_get_gr_face: (skip)
162 * @face: @hb_face_t to query
164 * Fetches the Graphite2 gr_face corresponding to the specified
165 * #hb_face_t face object.
167 * Return value: the gr_face found
172 hb_graphite2_face_get_gr_face (hb_face_t *face)
174 const hb_graphite2_face_data_t *data = face->data.graphite2;
175 return data ? data->grface : nullptr;
183 struct hb_graphite2_font_data_t {};
185 hb_graphite2_font_data_t *
186 _hb_graphite2_shaper_font_data_create (hb_font_t *font HB_UNUSED)
188 return (hb_graphite2_font_data_t *) HB_SHAPER_DATA_SUCCEEDED;
192 _hb_graphite2_shaper_font_data_destroy (hb_graphite2_font_data_t *data HB_UNUSED)
196 #ifndef HB_DISABLE_DEPRECATED
198 * hb_graphite2_font_get_gr_font: (skip)
199 * @font: An #hb_font_t
201 * Always returns `NULL`. Use hb_graphite2_face_get_gr_face() instead.
203 * Return value: (nullable): Graphite2 font associated with @font.
209 hb_graphite2_font_get_gr_font (hb_font_t *font HB_UNUSED)
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;
230 _hb_graphite2_shape (hb_shape_plan_t *shape_plan HB_UNUSED,
233 const hb_feature_t *features,
234 unsigned int num_features)
236 hb_face_t *face = font->face;
237 gr_face *grface = face->data.graphite2->grface;
239 const char *lang = hb_language_to_string (hb_buffer_get_language (buffer));
240 const char *lang_end = lang ? strchr (lang, '-') : nullptr;
241 int lang_len = lang_end ? lang_end - lang : -1;
242 gr_feature_val *feats = gr_face_featureval_for_lang (grface, lang ? hb_tag_from_string (lang, lang_len) : 0);
244 for (unsigned int i = 0; i < num_features; i++)
246 const gr_feature_ref *fref = gr_face_find_fref (grface, features[i].tag);
248 gr_fref_set_feature_value (fref, features[i].value, feats);
251 hb_direction_t direction = buffer->props.direction;
252 hb_direction_t horiz_dir = hb_script_get_horizontal_direction (buffer->props.script);
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
257 if ((HB_DIRECTION_IS_HORIZONTAL (direction) &&
258 direction != horiz_dir && horiz_dir != HB_DIRECTION_INVALID) ||
259 (HB_DIRECTION_IS_VERTICAL (direction) &&
260 direction != HB_DIRECTION_TTB))
262 hb_buffer_reverse_clusters (buffer);
263 direction = HB_DIRECTION_REVERSE (direction);
266 gr_segment *seg = nullptr;
268 unsigned int ci = 0, ic = 0;
269 unsigned int curradvx = 0, curradvy = 0;
271 unsigned int scratch_size;
272 hb_buffer_t::scratch_buffer_t *scratch = buffer->get_scratch_buffer (&scratch_size);
274 uint32_t *chars = (uint32_t *) scratch;
276 for (unsigned int i = 0; i < buffer->len; ++i)
277 chars[i] = buffer->info[i].codepoint;
279 seg = gr_make_seg (nullptr, grface,
280 HB_TAG_NONE, // https://github.com/harfbuzz/harfbuzz/issues/3439#issuecomment-1442650148
282 gr_utf32, chars, buffer->len,
283 2 | (direction == HB_DIRECTION_RTL ? 1 : 0));
285 if (unlikely (!seg)) {
286 if (feats) gr_featureval_destroy (feats);
290 unsigned int glyph_count = gr_seg_n_slots (seg);
291 if (unlikely (!glyph_count)) {
292 if (feats) gr_featureval_destroy (feats);
293 gr_seg_destroy (seg);
298 (void) buffer->ensure (glyph_count);
299 scratch = buffer->get_scratch_buffer (&scratch_size);
300 while ((DIV_CEIL (sizeof (hb_graphite2_cluster_t) * buffer->len, sizeof (*scratch)) +
301 DIV_CEIL (sizeof (hb_codepoint_t) * glyph_count, sizeof (*scratch))) > scratch_size)
303 if (unlikely (!buffer->ensure (buffer->allocated * 2)))
305 if (feats) gr_featureval_destroy (feats);
306 gr_seg_destroy (seg);
309 scratch = buffer->get_scratch_buffer (&scratch_size);
312 #define ALLOCATE_ARRAY(Type, name, len) \
313 Type *name = (Type *) scratch; \
315 unsigned int _consumed = DIV_CEIL ((len) * sizeof (Type), sizeof (*scratch)); \
316 assert (_consumed <= scratch_size); \
317 scratch += _consumed; \
318 scratch_size -= _consumed; \
321 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len);
322 ALLOCATE_ARRAY (hb_codepoint_t, gids, glyph_count);
324 #undef ALLOCATE_ARRAY
326 hb_memset (clusters, 0, sizeof (clusters[0]) * buffer->len);
328 hb_codepoint_t *pg = gids;
329 clusters[0].cluster = buffer->info[0].cluster;
330 unsigned int upem = hb_face_get_upem (face);
331 float xscale = (float) font->x_scale / upem;
332 float yscale = (float) font->y_scale / upem;
333 yscale *= yscale / xscale;
334 unsigned int curradv = 0;
335 if (HB_DIRECTION_IS_BACKWARD (direction))
337 curradv = gr_slot_origin_X(gr_seg_first_slot(seg)) * xscale;
338 clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv;
341 clusters[0].advance = 0;
342 for (is = gr_seg_first_slot (seg), ic = 0; is; is = gr_slot_next_in_segment (is), ic++)
344 unsigned int before = gr_slot_before (is);
345 unsigned int after = gr_slot_after (is);
346 *pg = gr_slot_gid (is);
348 while (clusters[ci].base_char > before && ci)
350 clusters[ci-1].num_chars += clusters[ci].num_chars;
351 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs;
352 clusters[ci-1].advance += clusters[ci].advance;
356 if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char + clusters[ci].num_chars)
358 hb_graphite2_cluster_t *c = clusters + ci + 1;
359 c->base_char = clusters[ci].base_char + clusters[ci].num_chars;
360 c->cluster = buffer->info[c->base_char].cluster;
361 c->num_chars = before - c->base_char;
364 if (HB_DIRECTION_IS_BACKWARD (direction))
366 c->advance = curradv - gr_slot_origin_X(is) * xscale;
367 curradv -= c->advance;
371 auto origin_X = gr_slot_origin_X (is) * xscale;
373 clusters[ci].advance += origin_X - curradv;
378 clusters[ci].num_glyphs++;
380 if (clusters[ci].base_char + clusters[ci].num_chars < after + 1)
381 clusters[ci].num_chars = after + 1 - clusters[ci].base_char;
384 if (HB_DIRECTION_IS_BACKWARD (direction))
385 clusters[ci].advance += curradv;
387 clusters[ci].advance += gr_seg_advance_X(seg) * xscale - curradv;
390 for (unsigned int i = 0; i < ci; ++i)
392 for (unsigned int j = 0; j < clusters[i].num_glyphs; ++j)
394 hb_glyph_info_t *info = &buffer->info[clusters[i].base_glyph + j];
395 info->codepoint = gids[clusters[i].base_glyph + j];
396 info->cluster = clusters[i].cluster;
397 info->var1.i32 = clusters[i].advance; // all glyphs in the cluster get the same advance
400 buffer->len = glyph_count;
403 unsigned int currclus = UINT_MAX;
404 const hb_glyph_info_t *info = buffer->info;
405 hb_glyph_position_t *pPos = hb_buffer_get_glyph_positions (buffer, nullptr);
406 if (!HB_DIRECTION_IS_BACKWARD (direction))
409 for (is = gr_seg_first_slot (seg); is; pPos++, ++info, is = gr_slot_next_in_segment (is))
411 pPos->x_offset = gr_slot_origin_X (is) * xscale - curradvx;
412 pPos->y_offset = gr_slot_origin_Y (is) * yscale - curradvy;
413 if (info->cluster != currclus) {
414 pPos->x_advance = info->var1.i32;
415 curradvx += pPos->x_advance;
416 currclus = info->cluster;
418 pPos->x_advance = 0.;
420 pPos->y_advance = gr_slot_advance_Y (is, grface, nullptr) * yscale;
421 curradvy += pPos->y_advance;
426 curradvx = gr_seg_advance_X(seg) * xscale;
427 for (is = gr_seg_first_slot (seg); is; pPos++, info++, is = gr_slot_next_in_segment (is))
429 if (info->cluster != currclus)
431 pPos->x_advance = info->var1.i32;
432 curradvx -= pPos->x_advance;
433 currclus = info->cluster;
435 pPos->x_advance = 0.;
437 pPos->y_advance = gr_slot_advance_Y (is, grface, nullptr) * yscale;
438 curradvy -= pPos->y_advance;
439 pPos->x_offset = gr_slot_origin_X (is) * xscale - info->var1.i32 - curradvx + pPos->x_advance;
440 pPos->y_offset = gr_slot_origin_Y (is) * yscale - curradvy;
442 hb_buffer_reverse_clusters (buffer);
445 if (feats) gr_featureval_destroy (feats);
446 gr_seg_destroy (seg);
448 buffer->clear_glyph_flags ();
449 buffer->unsafe_to_break ();