2 * Copyright © 2009,2010 Red Hat, Inc.
3 * Copyright © 2010 Google, Inc.
5 * This is part of HarfBuzz, a text shaping library.
7 * Permission is hereby granted, without written agreement and without
8 * license or royalty fees, to use, copy, modify, and distribute this
9 * software and its documentation for any purpose, provided that the
10 * above copyright notice and the following two paragraphs appear in
11 * all copies of this software.
13 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
14 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
15 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
16 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
19 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
20 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
21 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
22 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
23 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
25 * Red Hat Author(s): Behdad Esfahbod
26 * Google Author(s): Behdad Esfahbod
29 #ifndef HB_OT_MAP_PRIVATE_HH
30 #define HB_OT_MAP_PRIVATE_HH
32 #include "hb-buffer-private.hh"
34 #include "hb-ot-layout.h"
39 static const hb_tag_t table_tags[2] = {HB_OT_TAG_GSUB, HB_OT_TAG_GPOS};
43 friend struct hb_ot_map_builder_t;
47 inline hb_mask_t get_global_mask (void) const { return global_mask; }
49 inline hb_mask_t get_mask (hb_tag_t tag, unsigned int *shift = NULL) const {
50 const feature_map_t *map = features.bsearch (&tag);
51 if (shift) *shift = map ? map->shift : 0;
52 return map ? map->mask : 0;
55 inline hb_mask_t get_1_mask (hb_tag_t tag) const {
56 const feature_map_t *map = features.bsearch (&tag);
57 return map ? map->_1_mask : 0;
60 inline void substitute (hb_face_t *face, hb_buffer_t *buffer) const {
61 for (unsigned int i = 0; i < lookups[0].len; i++)
62 hb_ot_layout_substitute_lookup (face, buffer, lookups[0][i].index, lookups[0][i].mask);
65 inline void position (hb_font_t *font, hb_buffer_t *buffer) const {
66 for (unsigned int i = 0; i < lookups[1].len; i++)
67 hb_ot_layout_position_lookup (font, buffer, lookups[1][i].index, lookups[1][i].mask);
70 inline void finish (void) {
78 struct feature_map_t {
79 hb_tag_t tag; /* should be first for our bsearch to work */
80 unsigned int index[2]; /* GSUB, GPOS */
83 hb_mask_t _1_mask; /* mask for value=1, for quick access */
85 static int cmp (const feature_map_t *a, const feature_map_t *b)
86 { return a->tag < b->tag ? -1 : a->tag > b->tag ? 1 : 0; }
93 static int cmp (const lookup_map_t *a, const lookup_map_t *b)
94 { return a->index < b->index ? -1 : a->index > b->index ? 1 : 0; }
97 HB_INTERNAL void add_lookups (hb_face_t *face,
98 unsigned int table_index,
99 unsigned int feature_index,
103 hb_mask_t global_mask;
105 hb_prealloced_array_t<feature_map_t, 8> features;
106 hb_prealloced_array_t<lookup_map_t, 32> lookups[2]; /* GSUB/GPOS */
110 struct hb_ot_map_builder_t
114 HB_INTERNAL void add_feature (hb_tag_t tag, unsigned int value, bool global);
116 inline void add_bool_feature (hb_tag_t tag, bool global = true)
117 { add_feature (tag, 1, global); }
119 HB_INTERNAL void compile (hb_face_t *face,
120 const hb_segment_properties_t *props,
121 struct hb_ot_map_t &m);
123 inline void finish (void) {
124 feature_infos.finish ();
129 struct feature_info_t {
131 unsigned int seq; /* sequence#, used for stable sorting only */
132 unsigned int max_value;
133 bool global; /* whether the feature applies value to every glyph in the buffer */
134 unsigned int default_value; /* for non-global features, what should the unset glyphs take */
136 static int cmp (const feature_info_t *a, const feature_info_t *b)
137 { return (a->tag != b->tag) ? (a->tag < b->tag ? -1 : 1) : (a->seq < b->seq ? -1 : 1); }
140 hb_prealloced_array_t<feature_info_t,16> feature_infos; /* used before compile() only */
146 #endif /* HB_OT_MAP_PRIVATE_HH */