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 #include "hb-ot-map-private.hh"
31 #include "hb-ot-shape-private.hh"
37 hb_ot_map_t::add_lookups (hb_face_t *face,
38 unsigned int table_index,
39 unsigned int feature_index,
42 unsigned int lookup_indices[32];
43 unsigned int offset, len;
47 len = ARRAY_LENGTH (lookup_indices);
48 hb_ot_layout_feature_get_lookup_indexes (face,
49 table_tags[table_index],
54 for (unsigned int i = 0; i < len; i++) {
55 lookup_map_t *lookup = lookup_maps[table_index].push ();
56 if (unlikely (!lookup))
59 lookup->index = lookup_indices[i];
63 } while (len == ARRAY_LENGTH (lookup_indices));
68 hb_ot_map_t::compile (hb_face_t *face,
69 const hb_segment_properties_t *props)
73 if (!feature_infos.len)
77 /* Fetch script/language indices for GSUB/GPOS. We need these later to skip
78 * features not available in either table and not waste precious bits for them. */
80 hb_tag_t script_tags[3] = {HB_TAG_NONE};
81 hb_tag_t language_tag;
83 hb_ot_tags_from_script (props->script, &script_tags[0], &script_tags[1]);
84 language_tag = hb_ot_tag_from_language (props->language);
86 unsigned int script_index[2], language_index[2];
87 for (unsigned int table_index = 0; table_index < 2; table_index++) {
88 hb_tag_t table_tag = table_tags[table_index];
89 hb_ot_layout_table_choose_script (face, table_tag, script_tags, &script_index[table_index]);
90 hb_ot_layout_script_find_language (face, table_tag, script_index[table_index], language_tag, &language_index[table_index]);
94 /* Sort features and merge duplicates */
95 feature_infos.sort ();
97 for (unsigned int i = 1; i < feature_infos.len; i++)
98 if (feature_infos[i].tag != feature_infos[j].tag)
99 feature_infos[++j] = feature_infos[i];
101 if (feature_infos[i].global)
102 feature_infos[j] = feature_infos[i];
104 feature_infos[j].global = false;
105 feature_infos[j].max_value = MAX (feature_infos[j].max_value, feature_infos[i].max_value);
106 /* Inherit default_value from j */
109 feature_infos.shrink (j + 1);
112 /* Allocate bits now */
113 unsigned int next_bit = 1;
114 for (unsigned int i = 0; i < feature_infos.len; i++) {
115 const feature_info_t *info = &feature_infos[i];
117 unsigned int bits_needed;
119 if (info->global && info->max_value == 1)
120 /* Uses the global bit */
123 bits_needed = _hb_bit_storage (info->max_value);
125 if (!info->max_value || next_bit + bits_needed > 8 * sizeof (hb_mask_t))
126 continue; /* Feature disabled, or not enough bits. */
130 unsigned int feature_index[2];
131 for (unsigned int table_index = 0; table_index < 2; table_index++)
132 found |= hb_ot_layout_language_find_feature (face,
133 table_tags[table_index],
134 script_index[table_index],
135 language_index[table_index],
137 &feature_index[table_index]);
142 feature_map_t *map = feature_maps.push ();
146 map->tag = info->tag;
147 map->index[0] = feature_index[0];
148 map->index[1] = feature_index[1];
149 if (info->global && info->max_value == 1) {
150 /* Uses the global bit */
154 map->shift = next_bit;
155 map->mask = (1 << (next_bit + bits_needed)) - (1 << next_bit);
156 next_bit += bits_needed;
158 global_mask |= (info->default_value << map->shift) & map->mask;
160 map->_1_mask = (1 << map->shift) & map->mask;
163 feature_infos.shrink (0); /* Done with these */
166 for (unsigned int table_index = 0; table_index < 2; table_index++) {
167 hb_tag_t table_tag = table_tags[table_index];
169 /* Collect lookup indices for features */
171 unsigned int required_feature_index;
172 if (hb_ot_layout_language_get_required_feature_index (face,
174 script_index[table_index],
175 language_index[table_index],
176 &required_feature_index))
177 add_lookups (face, table_index, required_feature_index, 1);
179 for (unsigned i = 0; i < feature_maps.len; i++)
180 add_lookups (face, table_index, feature_maps[i].index[table_index], feature_maps[i].mask);
182 /* Sort lookups and merge duplicates */
183 lookup_maps[table_index].sort ();
184 if (lookup_maps[table_index].len)
187 for (unsigned int i = 1; i < lookup_maps[table_index].len; i++)
188 if (lookup_maps[table_index][i].index != lookup_maps[table_index][j].index)
189 lookup_maps[table_index][++j] = lookup_maps[table_index][i];
191 lookup_maps[table_index][j].mask |= lookup_maps[table_index][i].mask;
192 lookup_maps[table_index].shrink (j + 1);