hb-ot-post-table.hh 8.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
/*
 * Copyright © 2016  Google, Inc.
 *
 *  This is part of HarfBuzz, a text shaping library.
 *
 * Permission is hereby granted, without written agreement and without
 * license or royalty fees, to use, copy, modify, and distribute this
 * software and its documentation for any purpose, provided that the
 * above copyright notice and the following two paragraphs appear in
 * all copies of this software.
 *
 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 *
 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS
 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
 *
 * Google Author(s): Behdad Esfahbod
 */

#ifndef HB_OT_POST_TABLE_HH
#define HB_OT_POST_TABLE_HH

#include "hb-open-type-private.hh"
31
#include "hb-dsalgs.hh"
32

33 34 35 36 37
#define HB_STRING_ARRAY_NAME format1_names
#define HB_STRING_ARRAY_LIST "hb-ot-post-macroman.hh"
#include "hb-string-array.hh"
#undef HB_STRING_ARRAY_LIST
#undef HB_STRING_ARRAY_NAME
38

39
#define NUM_FORMAT1_NAMES 258
40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55

namespace OT {


/*
 * post -- PostScript
 */

#define HB_OT_TAG_post HB_TAG('p','o','s','t')


struct postV2Tail
{
  inline bool sanitize (hb_sanitize_context_t *c) const
  {
    TRACE_SANITIZE (this);
56
    return_trace (glyphNameIndex.sanitize (c));
57 58
  }

B
Behdad Esfahbod 已提交
59
  ArrayOf<HBUINT16>glyphNameIndex;	/* This is not an offset, but is the
60 61
					 * ordinal number of the glyph in 'post'
					 * string tables. */
B
Behdad Esfahbod 已提交
62
  HBUINT8		namesX[VAR];		/* Glyph names with length bytes [variable]
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
					 * (a Pascal string). */

  DEFINE_SIZE_ARRAY2 (2, glyphNameIndex, namesX);
};

struct post
{
  static const hb_tag_t tableTag = HB_OT_TAG_post;

  inline bool sanitize (hb_sanitize_context_t *c) const
  {
    TRACE_SANITIZE (this);
    if (unlikely (!c->check_struct (this)))
      return_trace (false);
    if (version.to_int () == 0x00020000)
    {
B
Behdad Esfahbod 已提交
79
      const postV2Tail &v2 = StructAfter<postV2Tail> (*this);
80 81 82 83 84
      return_trace (v2.sanitize (c));
    }
    return_trace (true);
  }

B
Behdad Esfahbod 已提交
85
  struct accelerator_t
86
  {
87
    inline void init (hb_face_t *face)
88
    {
B
Behdad Esfahbod 已提交
89
      blob = Sanitizer<post>().sanitize (face->reference_table (HB_OT_TAG_post));
90 91 92
      const post *table = Sanitizer<post>::lock_instance (blob);
      unsigned int table_length = hb_blob_get_length (blob);

B
Behdad Esfahbod 已提交
93 94 95 96
      version = table->version.to_int ();
      index_to_offset.init ();
      if (version != 0x00020000)
        return;
97

B
Behdad Esfahbod 已提交
98 99 100 101 102
      const postV2Tail &v2 = StructAfter<postV2Tail> (*table);

      glyphNameIndex = &v2.glyphNameIndex;
      pool = &StructAfter<uint8_t> (v2.glyphNameIndex);

103
      const uint8_t *end = (uint8_t *) table + table_length;
104
      for (const uint8_t *data = pool; data < end && data + *data <= end; data += 1 + *data)
B
Behdad Esfahbod 已提交
105 106 107 108 109 110 111 112 113 114
      {
	uint32_t *offset = index_to_offset.push ();
	if (unlikely (!offset))
	  break;
	*offset = data - pool;
      }
    }
    inline void fini (void)
    {
      index_to_offset.finish ();
115
      free (gids_sorted_by_name);
116 117
    }

118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
    inline bool get_glyph_name (hb_codepoint_t glyph,
				char *buf, unsigned int buf_len) const
    {
      hb_string_t s = find_glyph_name (glyph);
      if (!s.len)
        return false;
      if (!buf_len)
	return true;
      if (buf_len <= s.len) /* What to do with truncation? Returning false for now. */
        return false;
      strncpy (buf, s.bytes, s.len);
      buf[s.len] = '\0';
      return true;
    }

    inline bool get_glyph_from_name (const char *name, int len,
				     hb_codepoint_t *glyph) const
    {
      unsigned int count = get_glyph_count ();
      if (unlikely (!count))
        return false;

      if (len < 0)
	len = strlen (name);

      if (unlikely (!len))
	return false;

    retry:
      uint16_t *gids = (uint16_t *) hb_atomic_ptr_get (&gids_sorted_by_name);

      if (unlikely (!gids))
      {
	gids = (uint16_t *) malloc (count * sizeof (gids[0]));
	if (unlikely (!gids))
	  return false; /* Anything better?! */

	for (unsigned int i = 0; i < count; i++)
	  gids[i] = i;
	hb_sort_r (gids, count, sizeof (gids[0]), cmp_gids, (void *) this);

	if (!hb_atomic_ptr_cmpexch (&gids_sorted_by_name, nullptr, gids)) {
	  free (gids);
	  goto retry;
	}
      }

      hb_string_t st (name, len);
      const uint16_t *gid = (const uint16_t *) hb_bsearch_r (&st, gids, count, sizeof (gids[0]), cmp_key, (void *) this);
      if (gid)
      {
	*glyph = *gid;
	return true;
      }

      return false;
    }

    protected:

    inline unsigned int get_glyph_count (void) const
    {
      if (version == 0x00010000)
        return NUM_FORMAT1_NAMES;

      if (version == 0x00020000)
        return glyphNameIndex->len;

      return 0;
    }

    static inline int cmp_gids (const void *pa, const void *pb, void *arg)
    {
      const accelerator_t *thiz = (const accelerator_t *) arg;
      uint16_t a = * (const uint16_t *) pa;
      uint16_t b = * (const uint16_t *) pb;
      return thiz->find_glyph_name (b).cmp (thiz->find_glyph_name (a));
    }

    static inline int cmp_key (const void *pk, const void *po, void *arg)
    {
      const accelerator_t *thiz = (const accelerator_t *) arg;
      const hb_string_t *key = (const hb_string_t *) pk;
      uint16_t o = * (const uint16_t *) po;
      return thiz->find_glyph_name (o).cmp (*key);
    }

    inline hb_string_t find_glyph_name (hb_codepoint_t glyph) const
206
    {
B
Behdad Esfahbod 已提交
207 208 209
      if (version == 0x00010000)
      {
	if (glyph >= NUM_FORMAT1_NAMES)
B
Behdad Esfahbod 已提交
210
	  return hb_string_t ();
211

212
	return format1_names (glyph);
B
Behdad Esfahbod 已提交
213 214
      }

215
      if (version != 0x00020000 || glyph >= glyphNameIndex->len)
B
Behdad Esfahbod 已提交
216
	return hb_string_t ();
B
Behdad Esfahbod 已提交
217

B
Behdad Esfahbod 已提交
218
      unsigned int index = glyphNameIndex->array[glyph];
B
Behdad Esfahbod 已提交
219
      if (index < NUM_FORMAT1_NAMES)
220
	return format1_names (index);
B
Behdad Esfahbod 已提交
221 222
      index -= NUM_FORMAT1_NAMES;

B
Behdad Esfahbod 已提交
223
      if (index >= index_to_offset.len)
B
Behdad Esfahbod 已提交
224
	return hb_string_t ();
B
Behdad Esfahbod 已提交
225
      unsigned int offset = index_to_offset.array[index];
226

B
Behdad Esfahbod 已提交
227 228 229
      const uint8_t *data = pool + offset;
      unsigned int name_length = *data;
      data++;
230

B
Behdad Esfahbod 已提交
231
      return hb_string_t ((const char *) data, name_length);
232 233
    }

234
    private:
235
    hb_blob_t *blob;
B
Behdad Esfahbod 已提交
236
    uint32_t version;
B
Behdad Esfahbod 已提交
237
    const ArrayOf<HBUINT16> *glyphNameIndex;
B
Behdad Esfahbod 已提交
238 239
    hb_prealloced_array_t<uint32_t, 1> index_to_offset;
    const uint8_t *pool;
240
    mutable uint16_t *gids_sorted_by_name;
B
Behdad Esfahbod 已提交
241
  };
242

243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
  public:
  FixedVersion<>version;		/* 0x00010000 for version 1.0
					 * 0x00020000 for version 2.0
					 * 0x00025000 for version 2.5 (deprecated)
					 * 0x00030000 for version 3.0 */
  Fixed		italicAngle;		/* Italic angle in counter-clockwise degrees
					 * from the vertical. Zero for upright text,
					 * negative for text that leans to the right
					 * (forward). */
  FWORD		underlinePosition;	/* This is the suggested distance of the top
					 * of the underline from the baseline
					 * (negative values indicate below baseline).
					 * The PostScript definition of this FontInfo
					 * dictionary key (the y coordinate of the
					 * center of the stroke) is not used for
					 * historical reasons. The value of the
					 * PostScript key may be calculated by
					 * subtracting half the underlineThickness
					 * from the value of this field. */
  FWORD		underlineThickness;	/* Suggested values for the underline
					   thickness. */
B
Behdad Esfahbod 已提交
264
  HBUINT32		isFixedPitch;		/* Set to 0 if the font is proportionally
265 266
					 * spaced, non-zero if the font is not
					 * proportionally spaced (i.e. monospaced). */
B
Behdad Esfahbod 已提交
267
  HBUINT32		minMemType42;		/* Minimum memory usage when an OpenType font
268
					 * is downloaded. */
B
Behdad Esfahbod 已提交
269
  HBUINT32		maxMemType42;		/* Maximum memory usage when an OpenType font
270
					 * is downloaded. */
B
Behdad Esfahbod 已提交
271
  HBUINT32		minMemType1;		/* Minimum memory usage when an OpenType font
272
					 * is downloaded as a Type 1 font. */
B
Behdad Esfahbod 已提交
273
  HBUINT32		maxMemType1;		/* Maximum memory usage when an OpenType font
274 275 276 277 278 279 280 281 282
					 * is downloaded as a Type 1 font. */
/*postV2Tail	v2[VAR];*/
  DEFINE_SIZE_STATIC (32);
};

} /* namespace OT */


#endif /* HB_OT_POST_TABLE_HH */