hb-ot-post-table.hh 6.9 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 31
/*
 * 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"

32 33 34 35 36
#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
37

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

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);
55
    return_trace (glyphNameIndex.sanitize (c));
56 57
  }

58
  ArrayOf<USHORT>glyphNameIndex;	/* This is not an offset, but is the
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
					 * ordinal number of the glyph in 'post'
					 * string tables. */
  BYTE		namesX[VAR];		/* Glyph names with length bytes [variable]
					 * (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 已提交
78
      const postV2Tail &v2 = StructAfter<postV2Tail> (*this);
79 80 81 82 83
      return_trace (v2.sanitize (c));
    }
    return_trace (true);
  }

84
  inline bool get_glyph_name (hb_codepoint_t glyph,
B
Behdad Esfahbod 已提交
85 86
			      char *buffer, unsigned int buffer_length,
			      unsigned int blob_len) const
87 88 89 90
  {
    if (version.to_int () == 0x00010000)
    {
      if (glyph >= NUM_FORMAT1_NAMES)
B
Behdad Esfahbod 已提交
91
	return false;
92

B
Behdad Esfahbod 已提交
93 94
      if (!buffer_length)
	return true;
95
      strncpy (buffer, format1_names (glyph), buffer_length);
B
Behdad Esfahbod 已提交
96
      buffer[buffer_length - 1] = '\0';
97 98 99 100 101
      return true;
    }

    if (version.to_int () == 0x00020000)
    {
B
Behdad Esfahbod 已提交
102
      const postV2Tail &v2 = StructAfter<postV2Tail> (*this);
103

104
      if (glyph >= v2.glyphNameIndex.len)
B
Behdad Esfahbod 已提交
105 106 107 108
	return false;

      if (!buffer_length)
	return true;
109 110

      unsigned int index = v2.glyphNameIndex[glyph];
B
Behdad Esfahbod 已提交
111
      if (index < NUM_FORMAT1_NAMES)
112
      {
B
Behdad Esfahbod 已提交
113 114
	if (!buffer_length)
	  return true;
115
	strncpy (buffer, format1_names (index), buffer_length);
B
Behdad Esfahbod 已提交
116 117
	buffer[buffer_length - 1] = '\0';
	return true;
118
      }
B
Behdad Esfahbod 已提交
119 120
      index -= NUM_FORMAT1_NAMES;

121 122
      const uint8_t *data = &StructAfter<uint8_t> (v2.glyphNameIndex);
      const uint8_t *end = (uint8_t *) this + blob_len;
B
Behdad Esfahbod 已提交
123
      for (unsigned int i = 0; data < end; i++)
124
      {
B
Behdad Esfahbod 已提交
125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
	unsigned int name_length = data[0];
	data++;
	if (i == index)
	{
	  if (unlikely (!name_length))
	    return false;

	  unsigned int remaining = end - data;
	  name_length = MIN (name_length, buffer_length - 1);
	  name_length = MIN (name_length, remaining);
	  memcpy (buffer, data, name_length);
	  buffer[name_length] = '\0';
	  return true;
	}
	data += name_length;
140
      }
B
Behdad Esfahbod 已提交
141 142

      return false;
143 144 145 146 147
    }

    return false;
  }

148
  inline bool get_glyph_from_name (const char *name, int len,
B
Behdad Esfahbod 已提交
149 150
				   hb_codepoint_t *glyph,
				   unsigned int blob_len) const
151 152 153 154 155 156 157 158
  {
    if (len < 0)
      len = strlen (name);

    if (version.to_int () == 0x00010000)
    {
      for (int i = 0; i < NUM_FORMAT1_NAMES; i++)
      {
159
	if (strncmp (name, format1_names (i), len) == 0 && format1_names (i)[len] == '\0')
B
Behdad Esfahbod 已提交
160 161 162 163
	{
	  *glyph = i;
	  return true;
	}
164 165 166 167 168 169
      }
      return false;
    }

    if (version.to_int () == 0x00020000)
    {
B
Behdad Esfahbod 已提交
170
      const postV2Tail &v2 = StructAfter<postV2Tail> (*this);
171
      const uint8_t *data = &StructAfter<uint8_t> (v2.glyphNameIndex);
172

B
Behdad Esfahbod 已提交
173 174 175

      /* XXX The following code is wrong. */
      return false;
176
      for (hb_codepoint_t gid = 0; gid < v2.glyphNameIndex.len; gid++)
177
      {
B
Behdad Esfahbod 已提交
178 179 180
	unsigned int index = v2.glyphNameIndex[gid];
	if (index < NUM_FORMAT1_NAMES)
	{
181
	  if (strncmp (name, format1_names (index), len) == 0 && format1_names (index)[len] == '\0')
B
Behdad Esfahbod 已提交
182 183 184 185 186 187 188 189
	  {
	    *glyph = gid;
	    return true;
	  }
	  continue;
	}
	index -= NUM_FORMAT1_NAMES;

190
	for (unsigned int i = 0; data < (uint8_t *) this + blob_len; i++)
B
Behdad Esfahbod 已提交
191 192
	{
	  unsigned int name_length = data[0];
193
	  unsigned int remaining = CastP<uint8_t> (this) + blob_len - data - 1;
B
Behdad Esfahbod 已提交
194
	  name_length = MIN (name_length, remaining);
195
	  if (name_length == (unsigned int) len && strncmp (name, (const char *) data + 1, len) == 0)
B
Behdad Esfahbod 已提交
196 197 198 199 200 201 202
	  {
	    *glyph = gid;
	    return true;
	  }
	  data += name_length + 1;
	}
	return false;
203 204 205 206 207 208 209 210
      }

      return false;
    }

    return false;
  }

211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
  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. */
  ULONG		isFixedPitch;		/* Set to 0 if the font is proportionally
					 * spaced, non-zero if the font is not
					 * proportionally spaced (i.e. monospaced). */
  ULONG		minMemType42;		/* Minimum memory usage when an OpenType font
					 * is downloaded. */
  ULONG		maxMemType42;		/* Maximum memory usage when an OpenType font
					 * is downloaded. */
  ULONG		minMemType1;		/* Minimum memory usage when an OpenType font
					 * is downloaded as a Type 1 font. */
  ULONG		maxMemType1;		/* Maximum memory usage when an OpenType font
					 * is downloaded as a Type 1 font. */
/*postV2Tail	v2[VAR];*/
  DEFINE_SIZE_STATIC (32);
};

} /* namespace OT */


#endif /* HB_OT_POST_TABLE_HH */