2 * Copyright (C) 2009,2010 Red Hat, Inc.
3 * Copyright (C) 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::compile (hb_ot_shape_context_t *c)
40 lookup_count[0] = lookup_count[1] = 0;
46 /* Fetch script/language indices for GSUB/GPOS. We need these later to skip
47 * features not available in either table and not waste precious bits for them. */
49 const hb_tag_t *script_tags;
50 hb_tag_t language_tag;
52 script_tags = hb_ot_tags_from_script (c->buffer->props.script);
53 language_tag = hb_ot_tag_from_language (c->buffer->props.language);
55 unsigned int script_index[2], language_index[2];
56 for (unsigned int table_index = 0; table_index < 2; table_index++) {
57 hb_tag_t table_tag = table_tags[table_index];
58 hb_ot_layout_table_choose_script (c->face, table_tag, script_tags, &script_index[table_index]);
59 hb_ot_layout_script_find_language (c->face, table_tag, script_index[table_index], language_tag, &language_index[table_index]);
63 /* Sort features and merge duplicates */
64 qsort (feature_infos, feature_count, sizeof (feature_infos[0]), (hb_compare_func_t) feature_info_t::cmp);
66 for (unsigned int i = 1; i < feature_count; i++)
67 if (feature_infos[i].tag != feature_infos[j].tag)
68 feature_infos[++j] = feature_infos[i];
70 if (feature_infos[i].global)
71 feature_infos[j] = feature_infos[i];
73 feature_infos[j].global = false;
74 feature_infos[j].value = MAX (feature_infos[j].value, feature_infos[i].value);
77 feature_count = j + 1;
80 /* Allocate bits now */
81 unsigned int next_bit = 1;
83 for (unsigned int i = 0; i < feature_count; i++) {
84 const feature_info_t *info = &feature_infos[i];
86 unsigned int bits_needed;
88 if (info->global && info->value == 1)
89 /* Uses the global bit */
92 bits_needed = _hb_bit_storage (info->value);
94 if (!info->value || next_bit + bits_needed > 8 * sizeof (hb_mask_t))
95 continue; /* Feature disabled, or not enough bits. */
99 unsigned int feature_index[2];
100 for (unsigned int table_index = 0; table_index < 2; table_index++)
101 found |= hb_ot_layout_language_find_feature (c->face,
102 table_tags[table_index],
103 script_index[table_index],
104 language_index[table_index],
106 &feature_index[table_index]);
111 feature_map_t *map = &feature_maps[j++];
113 map->tag = info->tag;
114 map->index[0] = feature_index[0];
115 map->index[1] = feature_index[1];
116 if (info->global && info->value == 1) {
117 /* Uses the global bit */
121 map->shift = next_bit;
122 map->mask = (1 << (next_bit + bits_needed)) - (1 << next_bit);
123 next_bit += bits_needed;
125 global_mask |= map->mask;
132 for (unsigned int table_index = 0; table_index < 2; table_index++) {
133 hb_tag_t table_tag = table_tags[table_index];
135 /* Collect lookup indices for features */
137 unsigned int required_feature_index;
138 if (hb_ot_layout_language_get_required_feature_index (c->face,
140 script_index[table_index],
141 language_index[table_index],
142 &required_feature_index))
143 add_lookups (c, table_index, required_feature_index, 1);
145 for (unsigned i = 0; i < feature_count; i++)
146 add_lookups (c, table_index, feature_maps[i].index[table_index], feature_maps[i].mask);
148 /* Sort lookups and merge duplicates */
149 qsort (lookup_maps[table_index], lookup_count[table_index], sizeof (lookup_maps[table_index][0]), (hb_compare_func_t) lookup_map_t::cmp);
150 if (lookup_count[table_index])
153 for (unsigned int i = 1; i < lookup_count[table_index]; i++)
154 if (lookup_maps[table_index][i].index != lookup_maps[table_index][j].index)
155 lookup_maps[table_index][++j] = lookup_maps[table_index][i];
157 lookup_maps[table_index][j].mask |= lookup_maps[table_index][i].mask;
159 lookup_count[table_index] = j;