2 * Copyright © 2016 Google, Inc.
4 * This is part of HarfBuzz, a text shaping library.
6 * Permission is hereby granted, without written agreement and without
7 * license or royalty fees, to use, copy, modify, and distribute this
8 * software and its documentation for any purpose, provided that the
9 * above copyright notice and the following two paragraphs appear in
10 * all copies of this software.
12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
24 * Google Author(s): Behdad Esfahbod
27 #ifndef HB_OT_POST_TABLE_HH
28 #define HB_OT_POST_TABLE_HH
30 #include "hb-open-type-private.hh"
31 #include "hb-dsalgs.hh"
32 #include "hb-subset-plan.hh"
34 #define HB_STRING_ARRAY_NAME format1_names
35 #define HB_STRING_ARRAY_LIST "hb-ot-post-macroman.hh"
36 #include "hb-string-array.hh"
37 #undef HB_STRING_ARRAY_LIST
38 #undef HB_STRING_ARRAY_NAME
40 #define NUM_FORMAT1_NAMES 258
44 * https://docs.microsoft.com/en-us/typography/opentype/spec/post
46 #define HB_OT_TAG_post HB_TAG('p','o','s','t')
54 inline bool sanitize (hb_sanitize_context_t *c) const
56 TRACE_SANITIZE (this);
57 return_trace (glyphNameIndex.sanitize (c));
60 ArrayOf<HBUINT16>glyphNameIndex; /* This is not an offset, but is the
61 * ordinal number of the glyph in 'post'
63 HBUINT8 namesX[VAR]; /* Glyph names with length bytes [variable]
64 * (a Pascal string). */
66 DEFINE_SIZE_ARRAY2 (2, glyphNameIndex, namesX);
71 static const hb_tag_t tableTag = HB_OT_TAG_post;
73 inline bool sanitize (hb_sanitize_context_t *c) const
75 TRACE_SANITIZE (this);
76 if (unlikely (!c->check_struct (this)))
78 if (version.to_int () == 0x00020000)
80 const postV2Tail &v2 = StructAfter<postV2Tail> (*this);
81 return_trace (v2.sanitize (c));
86 inline bool subset (hb_subset_plan_t *plan) const
88 unsigned int post_prime_length;
89 hb_blob_t *post_blob = OT::Sanitizer<post>().sanitize (hb_face_reference_table (plan->source, HB_OT_TAG_post));
90 hb_blob_t *post_prime_blob = hb_blob_create_sub_blob (post_blob, 0, post::static_size);
91 post *post_prime = (post *) hb_blob_get_data_writable (post_prime_blob, &post_prime_length);
92 hb_blob_destroy (post_blob);
94 if (unlikely (!post_prime || post_prime_length != post::static_size))
96 hb_blob_destroy (post_prime_blob);
97 DEBUG_MSG(SUBSET, nullptr, "Invalid source post table with length %d.", post_prime_length);
101 post_prime->version.major.set (3); // Version 3 does not have any glyph names.
102 bool result = plan->add_table (HB_OT_TAG_post, post_prime_blob);
103 hb_blob_destroy (post_prime_blob);
110 inline void init (hb_face_t *face)
112 index_to_offset.init ();
114 blob = Sanitizer<post>().sanitize (face->reference_table (HB_OT_TAG_post));
115 const post *table = blob->as<post> ();
116 unsigned int table_length = blob->length;
118 version = table->version.to_int ();
119 if (version != 0x00020000)
122 const postV2Tail &v2 = StructAfter<postV2Tail> (*table);
124 glyphNameIndex = &v2.glyphNameIndex;
125 pool = &StructAfter<uint8_t> (v2.glyphNameIndex);
127 const uint8_t *end = (uint8_t *) table + table_length;
128 for (const uint8_t *data = pool; data < end && data + *data <= end; data += 1 + *data)
129 index_to_offset.push (data - pool);
131 inline void fini (void)
133 index_to_offset.fini ();
134 free (gids_sorted_by_name);
137 inline bool get_glyph_name (hb_codepoint_t glyph,
138 char *buf, unsigned int buf_len) const
140 hb_bytes_t s = find_glyph_name (glyph);
145 if (buf_len <= s.len) /* What to do with truncation? Returning false for now. */
147 strncpy (buf, s.bytes, s.len);
152 inline bool get_glyph_from_name (const char *name, int len,
153 hb_codepoint_t *glyph) const
155 unsigned int count = get_glyph_count ();
156 if (unlikely (!count))
166 uint16_t *gids = (uint16_t *) hb_atomic_ptr_get (&gids_sorted_by_name);
168 if (unlikely (!gids))
170 gids = (uint16_t *) malloc (count * sizeof (gids[0]));
171 if (unlikely (!gids))
172 return false; /* Anything better?! */
174 for (unsigned int i = 0; i < count; i++)
176 hb_sort_r (gids, count, sizeof (gids[0]), cmp_gids, (void *) this);
178 if (!hb_atomic_ptr_cmpexch (&gids_sorted_by_name, nullptr, gids)) {
184 hb_bytes_t st (name, len);
185 const uint16_t *gid = (const uint16_t *) hb_bsearch_r (&st, gids, count, sizeof (gids[0]), cmp_key, (void *) this);
197 inline unsigned int get_glyph_count (void) const
199 if (version == 0x00010000)
200 return NUM_FORMAT1_NAMES;
202 if (version == 0x00020000)
203 return glyphNameIndex->len;
208 static inline int cmp_gids (const void *pa, const void *pb, void *arg)
210 const accelerator_t *thiz = (const accelerator_t *) arg;
211 uint16_t a = * (const uint16_t *) pa;
212 uint16_t b = * (const uint16_t *) pb;
213 return thiz->find_glyph_name (b).cmp (thiz->find_glyph_name (a));
216 static inline int cmp_key (const void *pk, const void *po, void *arg)
218 const accelerator_t *thiz = (const accelerator_t *) arg;
219 const hb_bytes_t *key = (const hb_bytes_t *) pk;
220 uint16_t o = * (const uint16_t *) po;
221 return thiz->find_glyph_name (o).cmp (*key);
224 inline hb_bytes_t find_glyph_name (hb_codepoint_t glyph) const
226 if (version == 0x00010000)
228 if (glyph >= NUM_FORMAT1_NAMES)
229 return hb_bytes_t ();
231 return format1_names (glyph);
234 if (version != 0x00020000 || glyph >= glyphNameIndex->len)
235 return hb_bytes_t ();
237 unsigned int index = glyphNameIndex->arrayZ[glyph];
238 if (index < NUM_FORMAT1_NAMES)
239 return format1_names (index);
240 index -= NUM_FORMAT1_NAMES;
242 if (index >= index_to_offset.len)
243 return hb_bytes_t ();
244 unsigned int offset = index_to_offset.arrayZ[index];
246 const uint8_t *data = pool + offset;
247 unsigned int name_length = *data;
250 return hb_bytes_t ((const char *) data, name_length);
256 const ArrayOf<HBUINT16> *glyphNameIndex;
257 hb_vector_t<uint32_t, 1> index_to_offset;
259 mutable uint16_t *gids_sorted_by_name;
263 FixedVersion<>version; /* 0x00010000 for version 1.0
264 * 0x00020000 for version 2.0
265 * 0x00025000 for version 2.5 (deprecated)
266 * 0x00030000 for version 3.0 */
267 Fixed italicAngle; /* Italic angle in counter-clockwise degrees
268 * from the vertical. Zero for upright text,
269 * negative for text that leans to the right
271 FWORD underlinePosition; /* This is the suggested distance of the top
272 * of the underline from the baseline
273 * (negative values indicate below baseline).
274 * The PostScript definition of this FontInfo
275 * dictionary key (the y coordinate of the
276 * center of the stroke) is not used for
277 * historical reasons. The value of the
278 * PostScript key may be calculated by
279 * subtracting half the underlineThickness
280 * from the value of this field. */
281 FWORD underlineThickness; /* Suggested values for the underline
283 HBUINT32 isFixedPitch; /* Set to 0 if the font is proportionally
284 * spaced, non-zero if the font is not
285 * proportionally spaced (i.e. monospaced). */
286 HBUINT32 minMemType42; /* Minimum memory usage when an OpenType font
288 HBUINT32 maxMemType42; /* Maximum memory usage when an OpenType font
290 HBUINT32 minMemType1; /* Minimum memory usage when an OpenType font
291 * is downloaded as a Type 1 font. */
292 HBUINT32 maxMemType1; /* Maximum memory usage when an OpenType font
293 * is downloaded as a Type 1 font. */
294 /*postV2Tail v2[VAR];*/
295 DEFINE_SIZE_STATIC (32);
301 #endif /* HB_OT_POST_TABLE_HH */