2015-08-23 15:42:20 +02:00
|
|
|
/*
|
|
|
|
|
* Copyright © 2015 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_GLYF_TABLE_HH
|
|
|
|
|
#define HB_OT_GLYF_TABLE_HH
|
|
|
|
|
|
2018-08-26 07:36:36 +02:00
|
|
|
#include "hb-open-type.hh"
|
2017-11-15 04:52:09 +01:00
|
|
|
#include "hb-ot-head-table.hh"
|
2018-02-20 23:07:40 +01:00
|
|
|
#include "hb-subset-glyf.hh"
|
2015-08-23 15:42:20 +02:00
|
|
|
|
|
|
|
|
namespace OT {
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* loca -- Index to Location
|
2018-04-12 11:08:19 +02:00
|
|
|
* https://docs.microsoft.com/en-us/typography/opentype/spec/loca
|
2015-08-23 15:42:20 +02:00
|
|
|
*/
|
|
|
|
|
#define HB_OT_TAG_loca HB_TAG('l','o','c','a')
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
struct loca
|
|
|
|
|
{
|
2017-11-15 04:54:48 +01:00
|
|
|
friend struct glyf;
|
|
|
|
|
|
2018-11-29 21:04:34 +01:00
|
|
|
enum { tableTag = HB_OT_TAG_loca };
|
2015-08-23 15:42:20 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c HB_UNUSED) const
|
2015-08-23 15:42:20 +02:00
|
|
|
{
|
|
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2015-08-23 15:42:20 +02:00
|
|
|
}
|
|
|
|
|
|
2017-11-15 04:54:48 +01:00
|
|
|
protected:
|
2018-09-10 23:29:26 +02:00
|
|
|
UnsizedArrayOf<HBUINT8> dataZ; /* Location data. */
|
2018-10-31 21:19:42 +01:00
|
|
|
public:
|
2018-11-22 23:56:51 +01:00
|
|
|
DEFINE_SIZE_MIN (0); /* In reality, this is UNBOUNDED() type; but since we always
|
|
|
|
|
* check the size externally, allow Null() object of it by
|
|
|
|
|
* defining it MIN() instead. */
|
2015-08-23 15:42:20 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* glyf -- TrueType Glyph Data
|
2018-04-12 11:08:19 +02:00
|
|
|
* https://docs.microsoft.com/en-us/typography/opentype/spec/glyf
|
2015-08-23 15:42:20 +02:00
|
|
|
*/
|
|
|
|
|
#define HB_OT_TAG_glyf HB_TAG('g','l','y','f')
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
struct glyf
|
|
|
|
|
{
|
2018-11-29 21:04:34 +01:00
|
|
|
enum { tableTag = HB_OT_TAG_glyf };
|
2015-08-23 15:42:20 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c HB_UNUSED) const
|
2015-08-23 15:42:20 +02:00
|
|
|
{
|
|
|
|
|
TRACE_SANITIZE (this);
|
|
|
|
|
/* We don't check for anything specific here. The users of the
|
|
|
|
|
* struct do all the hard work... */
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2015-08-23 15:42:20 +02:00
|
|
|
}
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool subset (hb_subset_plan_t *plan) const
|
2018-02-20 23:07:40 +01:00
|
|
|
{
|
|
|
|
|
hb_blob_t *glyf_prime = nullptr;
|
|
|
|
|
hb_blob_t *loca_prime = nullptr;
|
|
|
|
|
|
|
|
|
|
bool success = true;
|
|
|
|
|
bool use_short_loca = false;
|
|
|
|
|
if (hb_subset_glyf_and_loca (plan, &use_short_loca, &glyf_prime, &loca_prime)) {
|
2018-05-30 21:23:51 +02:00
|
|
|
success = success && plan->add_table (HB_OT_TAG_glyf, glyf_prime);
|
|
|
|
|
success = success && plan->add_table (HB_OT_TAG_loca, loca_prime);
|
|
|
|
|
success = success && _add_head_and_set_loca_version (plan, use_short_loca);
|
2018-02-20 23:07:40 +01:00
|
|
|
} else {
|
|
|
|
|
success = false;
|
|
|
|
|
}
|
|
|
|
|
hb_blob_destroy (loca_prime);
|
|
|
|
|
hb_blob_destroy (glyf_prime);
|
|
|
|
|
|
|
|
|
|
return success;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool
|
2018-05-30 21:23:51 +02:00
|
|
|
_add_head_and_set_loca_version (hb_subset_plan_t *plan, bool use_short_loca)
|
2018-02-20 23:07:40 +01:00
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
hb_blob_t *head_blob = hb_sanitize_context_t ().reference_table<head> (plan->source);
|
2018-02-20 23:29:21 +01:00
|
|
|
hb_blob_t *head_prime_blob = hb_blob_copy_writable_or_fail (head_blob);
|
2018-02-20 23:07:40 +01:00
|
|
|
hb_blob_destroy (head_blob);
|
2018-02-20 23:29:21 +01:00
|
|
|
|
|
|
|
|
if (unlikely (!head_prime_blob))
|
|
|
|
|
return false;
|
|
|
|
|
|
2018-07-23 20:57:45 +02:00
|
|
|
head *head_prime = (head *) hb_blob_get_data_writable (head_prime_blob, nullptr);
|
2018-02-20 23:29:21 +01:00
|
|
|
head_prime->indexToLocFormat.set (use_short_loca ? 0 : 1);
|
2018-05-30 21:23:51 +02:00
|
|
|
bool success = plan->add_table (HB_OT_TAG_head, head_prime_blob);
|
2018-02-20 23:29:21 +01:00
|
|
|
|
|
|
|
|
hb_blob_destroy (head_prime_blob);
|
|
|
|
|
return success;
|
2018-02-20 23:07:40 +01:00
|
|
|
}
|
|
|
|
|
|
2017-11-15 04:52:09 +01:00
|
|
|
struct GlyphHeader
|
|
|
|
|
{
|
2018-01-10 03:07:30 +01:00
|
|
|
HBINT16 numberOfContours; /* If the number of contours is
|
2018-11-15 20:40:56 +01:00
|
|
|
* greater than or equal to zero,
|
|
|
|
|
* this is a simple glyph; if negative,
|
|
|
|
|
* this is a composite glyph. */
|
2017-11-15 04:52:09 +01:00
|
|
|
FWORD xMin; /* Minimum x for coordinate data. */
|
|
|
|
|
FWORD yMin; /* Minimum y for coordinate data. */
|
|
|
|
|
FWORD xMax; /* Maximum x for coordinate data. */
|
|
|
|
|
FWORD yMax; /* Maximum y for coordinate data. */
|
|
|
|
|
|
|
|
|
|
DEFINE_SIZE_STATIC (10);
|
|
|
|
|
};
|
|
|
|
|
|
2018-02-15 23:03:34 +01:00
|
|
|
struct CompositeGlyphHeader
|
|
|
|
|
{
|
2018-03-23 15:07:01 +01:00
|
|
|
enum composite_glyph_flag_t {
|
|
|
|
|
ARG_1_AND_2_ARE_WORDS = 0x0001,
|
|
|
|
|
ARGS_ARE_XY_VALUES = 0x0002,
|
|
|
|
|
ROUND_XY_TO_GRID = 0x0004,
|
|
|
|
|
WE_HAVE_A_SCALE = 0x0008,
|
|
|
|
|
MORE_COMPONENTS = 0x0020,
|
|
|
|
|
WE_HAVE_AN_X_AND_Y_SCALE = 0x0040,
|
|
|
|
|
WE_HAVE_A_TWO_BY_TWO = 0x0080,
|
|
|
|
|
WE_HAVE_INSTRUCTIONS = 0x0100,
|
|
|
|
|
USE_MY_METRICS = 0x0200,
|
|
|
|
|
OVERLAP_COMPOUND = 0x0400,
|
|
|
|
|
SCALED_COMPONENT_OFFSET = 0x0800,
|
|
|
|
|
UNSCALED_COMPONENT_OFFSET = 0x1000
|
|
|
|
|
};
|
2018-02-15 23:03:34 +01:00
|
|
|
|
|
|
|
|
HBUINT16 flags;
|
2018-11-10 00:12:08 +01:00
|
|
|
GlyphID glyphIndex;
|
2018-02-15 23:03:34 +01:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
unsigned int get_size () const
|
2018-02-15 23:03:34 +01:00
|
|
|
{
|
|
|
|
|
unsigned int size = min_size;
|
2018-11-15 20:40:56 +01:00
|
|
|
// arg1 and 2 are int16
|
|
|
|
|
if (flags & ARG_1_AND_2_ARE_WORDS) size += 4;
|
|
|
|
|
// arg1 and 2 are int8
|
|
|
|
|
else size += 2;
|
|
|
|
|
|
|
|
|
|
// One x 16 bit (scale)
|
|
|
|
|
if (flags & WE_HAVE_A_SCALE) size += 2;
|
|
|
|
|
// Two x 16 bit (xscale, yscale)
|
|
|
|
|
else if (flags & WE_HAVE_AN_X_AND_Y_SCALE) size += 4;
|
|
|
|
|
// Four x 16 bit (xscale, scale01, scale10, yscale)
|
|
|
|
|
else if (flags & WE_HAVE_A_TWO_BY_TWO) size += 8;
|
|
|
|
|
|
2018-02-15 23:03:34 +01:00
|
|
|
return size;
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-17 00:56:15 +01:00
|
|
|
struct Iterator
|
|
|
|
|
{
|
|
|
|
|
const char *glyph_start;
|
|
|
|
|
const char *glyph_end;
|
|
|
|
|
const CompositeGlyphHeader *current;
|
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
bool move_to_next ()
|
2018-02-17 00:56:15 +01:00
|
|
|
{
|
|
|
|
|
if (current->flags & CompositeGlyphHeader::MORE_COMPONENTS)
|
|
|
|
|
{
|
|
|
|
|
const CompositeGlyphHeader *possible =
|
|
|
|
|
&StructAfter<CompositeGlyphHeader, CompositeGlyphHeader> (*current);
|
|
|
|
|
if (!in_range (possible))
|
|
|
|
|
return false;
|
|
|
|
|
current = possible;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool in_range (const CompositeGlyphHeader *composite) const
|
2018-02-17 00:56:15 +01:00
|
|
|
{
|
|
|
|
|
return (const char *) composite >= glyph_start
|
|
|
|
|
&& ((const char *) composite + CompositeGlyphHeader::min_size) <= glyph_end
|
2018-11-15 20:40:56 +01:00
|
|
|
&& ((const char *) composite + composite->get_size ()) <= glyph_end;
|
2018-02-17 00:56:15 +01:00
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
static bool get_iterator (const char * glyph_data,
|
2018-02-17 00:56:15 +01:00
|
|
|
unsigned int length,
|
|
|
|
|
CompositeGlyphHeader::Iterator *iterator /* OUT */)
|
|
|
|
|
{
|
|
|
|
|
if (length < GlyphHeader::static_size)
|
|
|
|
|
return false; /* Empty glyph; zero extents. */
|
|
|
|
|
|
|
|
|
|
const GlyphHeader &glyph_header = StructAtOffset<GlyphHeader> (glyph_data, 0);
|
|
|
|
|
if (glyph_header.numberOfContours < 0)
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
const CompositeGlyphHeader *possible =
|
2018-02-17 00:56:15 +01:00
|
|
|
&StructAfter<CompositeGlyphHeader, GlyphHeader> (glyph_header);
|
|
|
|
|
|
|
|
|
|
iterator->glyph_start = glyph_data;
|
|
|
|
|
iterator->glyph_end = (const char *) glyph_data + length;
|
|
|
|
|
if (!iterator->in_range (possible))
|
2018-11-15 20:40:56 +01:00
|
|
|
return false;
|
|
|
|
|
iterator->current = possible;
|
|
|
|
|
return true;
|
2018-02-17 00:56:15 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-15 23:03:34 +01:00
|
|
|
DEFINE_SIZE_MIN (4);
|
|
|
|
|
};
|
|
|
|
|
|
2017-11-15 04:52:09 +01:00
|
|
|
struct accelerator_t
|
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
void init (hb_face_t *face)
|
2017-11-15 04:52:09 +01:00
|
|
|
{
|
2018-03-20 21:00:49 +01:00
|
|
|
memset (this, 0, sizeof (accelerator_t));
|
|
|
|
|
|
2018-11-13 17:41:29 +01:00
|
|
|
const OT::head &head = *face->table.head;
|
|
|
|
|
if (head.indexToLocFormat > 1 || head.glyphDataFormat != 0)
|
2018-08-06 15:30:12 +02:00
|
|
|
/* Unknown format. Leave num_glyphs=0, that takes care of disabling us. */
|
2017-11-15 04:52:09 +01:00
|
|
|
return;
|
2018-11-13 17:41:29 +01:00
|
|
|
short_offset = 0 == head.indexToLocFormat;
|
2017-11-15 04:52:09 +01:00
|
|
|
|
2018-11-15 20:40:56 +01:00
|
|
|
loca_table = hb_sanitize_context_t ().reference_table<loca> (face);
|
|
|
|
|
glyf_table = hb_sanitize_context_t ().reference_table<glyf> (face);
|
2017-11-15 04:52:09 +01:00
|
|
|
|
2018-11-11 06:26:55 +01:00
|
|
|
num_glyphs = MAX (1u, loca_table.get_length () / (short_offset ? 2 : 4)) - 1;
|
2017-11-15 04:52:09 +01:00
|
|
|
}
|
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini ()
|
2017-11-15 04:52:09 +01:00
|
|
|
{
|
2018-11-11 17:40:57 +01:00
|
|
|
loca_table.destroy ();
|
|
|
|
|
glyf_table.destroy ();
|
2017-11-15 04:52:09 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-15 23:03:34 +01:00
|
|
|
/*
|
|
|
|
|
* Returns true if the referenced glyph is a valid glyph and a composite glyph.
|
|
|
|
|
* If true is returned a pointer to the composite glyph will be written into
|
|
|
|
|
* composite.
|
|
|
|
|
*/
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_composite (hb_codepoint_t glyph,
|
|
|
|
|
CompositeGlyphHeader::Iterator *composite /* OUT */) const
|
2018-02-15 23:03:34 +01:00
|
|
|
{
|
2018-08-06 15:30:12 +02:00
|
|
|
if (unlikely (!num_glyphs))
|
2018-03-20 21:00:49 +01:00
|
|
|
return false;
|
|
|
|
|
|
2018-02-15 23:03:34 +01:00
|
|
|
unsigned int start_offset, end_offset;
|
2018-02-24 02:49:23 +01:00
|
|
|
if (!get_offsets (glyph, &start_offset, &end_offset))
|
2018-11-15 20:40:56 +01:00
|
|
|
return false; /* glyph not found */
|
2018-02-15 23:03:34 +01:00
|
|
|
|
2018-11-03 21:15:30 +01:00
|
|
|
return CompositeGlyphHeader::get_iterator ((const char *) this->glyf_table + start_offset,
|
2018-02-17 00:56:15 +01:00
|
|
|
end_offset - start_offset,
|
|
|
|
|
composite);
|
2018-02-15 23:03:34 +01:00
|
|
|
}
|
|
|
|
|
|
2018-03-23 15:07:01 +01:00
|
|
|
enum simple_glyph_flag_t {
|
2018-12-08 11:27:39 +01:00
|
|
|
FLAG_ON_CURVE = 0x01,
|
2018-03-23 15:07:01 +01:00
|
|
|
FLAG_X_SHORT = 0x02,
|
|
|
|
|
FLAG_Y_SHORT = 0x04,
|
|
|
|
|
FLAG_REPEAT = 0x08,
|
|
|
|
|
FLAG_X_SAME = 0x10,
|
2018-12-08 11:27:39 +01:00
|
|
|
FLAG_Y_SAME = 0x20,
|
|
|
|
|
FLAG_RESERVED1 = 0x40,
|
|
|
|
|
FLAG_RESERVED2 = 0x80
|
2018-03-23 15:07:01 +01:00
|
|
|
};
|
|
|
|
|
|
2018-02-23 22:05:58 +01:00
|
|
|
/* based on FontTools _g_l_y_f.py::trim */
|
2018-12-16 20:08:10 +01:00
|
|
|
bool remove_padding (unsigned int start_offset,
|
2018-11-15 20:40:56 +01:00
|
|
|
unsigned int *end_offset) const
|
2018-02-23 22:05:58 +01:00
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
if (*end_offset - start_offset < GlyphHeader::static_size) return true;
|
2018-02-23 22:05:58 +01:00
|
|
|
|
|
|
|
|
const char *glyph = ((const char *) glyf_table) + start_offset;
|
|
|
|
|
const char * const glyph_end = glyph + (*end_offset - start_offset);
|
|
|
|
|
const GlyphHeader &glyph_header = StructAtOffset<GlyphHeader> (glyph, 0);
|
|
|
|
|
int16_t num_contours = (int16_t) glyph_header.numberOfContours;
|
|
|
|
|
|
|
|
|
|
if (num_contours < 0)
|
2018-11-15 20:40:56 +01:00
|
|
|
/* Trimming for composites not implemented.
|
|
|
|
|
* If removing hints it falls out of that. */
|
|
|
|
|
return true;
|
2018-02-23 22:05:58 +01:00
|
|
|
else if (num_contours > 0)
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
/* simple glyph w/contours, possibly trimmable */
|
|
|
|
|
glyph += GlyphHeader::static_size + 2 * num_contours;
|
|
|
|
|
|
|
|
|
|
if (unlikely (glyph + 2 >= glyph_end)) return false;
|
|
|
|
|
uint16_t nCoordinates = (uint16_t) StructAtOffset<HBUINT16> (glyph - 2, 0) + 1;
|
|
|
|
|
uint16_t nInstructions = (uint16_t) StructAtOffset<HBUINT16> (glyph, 0);
|
|
|
|
|
|
|
|
|
|
glyph += 2 + nInstructions;
|
|
|
|
|
if (unlikely (glyph + 2 >= glyph_end)) return false;
|
|
|
|
|
|
|
|
|
|
unsigned int coordBytes = 0;
|
|
|
|
|
unsigned int coordsWithFlags = 0;
|
|
|
|
|
while (glyph < glyph_end)
|
|
|
|
|
{
|
|
|
|
|
uint8_t flag = (uint8_t) *glyph;
|
|
|
|
|
glyph++;
|
|
|
|
|
|
|
|
|
|
unsigned int repeat = 1;
|
|
|
|
|
if (flag & FLAG_REPEAT)
|
|
|
|
|
{
|
|
|
|
|
if (glyph >= glyph_end)
|
|
|
|
|
{
|
|
|
|
|
DEBUG_MSG(SUBSET, nullptr, "Bad flag");
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
repeat = ((uint8_t) *glyph) + 1;
|
|
|
|
|
glyph++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned int xBytes, yBytes;
|
|
|
|
|
xBytes = yBytes = 0;
|
|
|
|
|
if (flag & FLAG_X_SHORT) xBytes = 1;
|
|
|
|
|
else if ((flag & FLAG_X_SAME) == 0) xBytes = 2;
|
|
|
|
|
|
|
|
|
|
if (flag & FLAG_Y_SHORT) yBytes = 1;
|
|
|
|
|
else if ((flag & FLAG_Y_SAME) == 0) yBytes = 2;
|
|
|
|
|
|
|
|
|
|
coordBytes += (xBytes + yBytes) * repeat;
|
|
|
|
|
coordsWithFlags += repeat;
|
|
|
|
|
if (coordsWithFlags >= nCoordinates)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (coordsWithFlags != nCoordinates)
|
|
|
|
|
{
|
|
|
|
|
DEBUG_MSG(SUBSET, nullptr, "Expect %d coords to have flags, got flags for %d", nCoordinates, coordsWithFlags);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
glyph += coordBytes;
|
|
|
|
|
|
|
|
|
|
if (glyph < glyph_end)
|
|
|
|
|
*end_offset -= glyph_end - glyph;
|
2018-02-23 22:05:58 +01:00
|
|
|
}
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_offsets (hb_codepoint_t glyph,
|
2018-11-15 20:40:56 +01:00
|
|
|
unsigned int *start_offset /* OUT */,
|
|
|
|
|
unsigned int *end_offset /* OUT */) const
|
2017-11-15 04:52:09 +01:00
|
|
|
{
|
|
|
|
|
if (unlikely (glyph >= num_glyphs))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
if (short_offset)
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
const HBUINT16 *offsets = (const HBUINT16 *) loca_table->dataZ.arrayZ;
|
2018-02-07 19:55:30 +01:00
|
|
|
*start_offset = 2 * offsets[glyph];
|
|
|
|
|
*end_offset = 2 * offsets[glyph + 1];
|
2017-11-15 04:52:09 +01:00
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
const HBUINT32 *offsets = (const HBUINT32 *) loca_table->dataZ.arrayZ;
|
2018-02-23 22:05:58 +01:00
|
|
|
|
2018-02-07 19:55:30 +01:00
|
|
|
*start_offset = offsets[glyph];
|
|
|
|
|
*end_offset = offsets[glyph + 1];
|
2017-11-15 04:52:09 +01:00
|
|
|
}
|
|
|
|
|
|
2018-11-11 06:26:55 +01:00
|
|
|
if (*start_offset > *end_offset || *end_offset > glyf_table.get_length ())
|
2017-11-15 04:52:09 +01:00
|
|
|
return false;
|
|
|
|
|
|
2018-02-07 19:55:30 +01:00
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_instruction_offsets (unsigned int start_offset,
|
|
|
|
|
unsigned int end_offset,
|
|
|
|
|
unsigned int *instruction_start /* OUT */,
|
|
|
|
|
unsigned int *instruction_end /* OUT */) const
|
2018-02-22 07:23:05 +01:00
|
|
|
{
|
|
|
|
|
if (end_offset - start_offset < GlyphHeader::static_size)
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
*instruction_start = 0;
|
|
|
|
|
*instruction_end = 0;
|
|
|
|
|
return true; /* Empty glyph; no instructions. */
|
2018-02-22 07:23:05 +01:00
|
|
|
}
|
|
|
|
|
const GlyphHeader &glyph_header = StructAtOffset<GlyphHeader> (glyf_table, start_offset);
|
|
|
|
|
int16_t num_contours = (int16_t) glyph_header.numberOfContours;
|
|
|
|
|
if (num_contours < 0)
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
CompositeGlyphHeader::Iterator composite_it;
|
|
|
|
|
if (unlikely (!CompositeGlyphHeader::get_iterator (
|
|
|
|
|
(const char*) this->glyf_table + start_offset,
|
|
|
|
|
end_offset - start_offset, &composite_it))) return false;
|
|
|
|
|
const CompositeGlyphHeader *last;
|
|
|
|
|
do {
|
|
|
|
|
last = composite_it.current;
|
|
|
|
|
} while (composite_it.move_to_next ());
|
|
|
|
|
|
|
|
|
|
if ((uint16_t) last->flags & CompositeGlyphHeader::WE_HAVE_INSTRUCTIONS)
|
|
|
|
|
*instruction_start = ((char *) last - (char *) glyf_table->dataZ.arrayZ) + last->get_size ();
|
|
|
|
|
else
|
|
|
|
|
*instruction_start = end_offset;
|
|
|
|
|
*instruction_end = end_offset;
|
|
|
|
|
if (unlikely (*instruction_start > *instruction_end))
|
|
|
|
|
{
|
|
|
|
|
DEBUG_MSG(SUBSET, nullptr, "Invalid instruction offset, %d is outside [%d, %d]", *instruction_start, start_offset, end_offset);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2018-02-22 07:23:05 +01:00
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
unsigned int instruction_length_offset = start_offset + GlyphHeader::static_size + 2 * num_contours;
|
2018-04-20 00:30:35 +02:00
|
|
|
if (unlikely (instruction_length_offset + 2 > end_offset))
|
|
|
|
|
{
|
|
|
|
|
DEBUG_MSG(SUBSET, nullptr, "Glyph size is too short, missing field instructionLength.");
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2018-11-15 20:40:56 +01:00
|
|
|
const HBUINT16 &instruction_length = StructAtOffset<HBUINT16> (glyf_table, instruction_length_offset);
|
2018-04-20 00:30:35 +02:00
|
|
|
unsigned int start = instruction_length_offset + 2;
|
|
|
|
|
unsigned int end = start + (uint16_t) instruction_length;
|
|
|
|
|
if (unlikely (end > end_offset)) // Out of bounds of the current glyph
|
|
|
|
|
{
|
|
|
|
|
DEBUG_MSG(SUBSET, nullptr, "The instructions array overruns the glyph's boundaries.");
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*instruction_start = start;
|
2018-11-15 20:40:56 +01:00
|
|
|
*instruction_end = end;
|
2018-02-22 07:23:05 +01:00
|
|
|
}
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_extents (hb_codepoint_t glyph, hb_glyph_extents_t *extents) const
|
2018-02-07 19:55:30 +01:00
|
|
|
{
|
|
|
|
|
unsigned int start_offset, end_offset;
|
2018-02-24 02:49:23 +01:00
|
|
|
if (!get_offsets (glyph, &start_offset, &end_offset))
|
2018-11-15 20:40:56 +01:00
|
|
|
return false;
|
2018-02-07 19:55:30 +01:00
|
|
|
|
2017-11-15 04:52:09 +01:00
|
|
|
if (end_offset - start_offset < GlyphHeader::static_size)
|
|
|
|
|
return true; /* Empty glyph; zero extents. */
|
|
|
|
|
|
|
|
|
|
const GlyphHeader &glyph_header = StructAtOffset<GlyphHeader> (glyf_table, start_offset);
|
|
|
|
|
|
|
|
|
|
extents->x_bearing = MIN (glyph_header.xMin, glyph_header.xMax);
|
|
|
|
|
extents->y_bearing = MAX (glyph_header.yMin, glyph_header.yMax);
|
|
|
|
|
extents->width = MAX (glyph_header.xMin, glyph_header.xMax) - extents->x_bearing;
|
|
|
|
|
extents->height = MIN (glyph_header.yMin, glyph_header.yMax) - extents->y_bearing;
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
bool short_offset;
|
|
|
|
|
unsigned int num_glyphs;
|
2018-11-11 06:26:55 +01:00
|
|
|
hb_blob_ptr_t<loca> loca_table;
|
|
|
|
|
hb_blob_ptr_t<glyf> glyf_table;
|
2017-11-15 04:52:09 +01:00
|
|
|
};
|
|
|
|
|
|
2017-11-15 04:54:48 +01:00
|
|
|
protected:
|
2018-09-10 23:29:26 +02:00
|
|
|
UnsizedArrayOf<HBUINT8> dataZ; /* Glyphs data. */
|
2018-10-31 21:19:42 +01:00
|
|
|
public:
|
2018-11-22 23:56:51 +01:00
|
|
|
DEFINE_SIZE_MIN (0); /* In reality, this is UNBOUNDED() type; but since we always
|
|
|
|
|
* check the size externally, allow Null() object of it by
|
|
|
|
|
* defining it MIN() instead. */
|
2015-08-23 15:42:20 +02:00
|
|
|
};
|
|
|
|
|
|
2018-08-27 00:11:24 +02:00
|
|
|
struct glyf_accelerator_t : glyf::accelerator_t {};
|
|
|
|
|
|
2015-08-23 15:42:20 +02:00
|
|
|
} /* namespace OT */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif /* HB_OT_GLYF_TABLE_HH */
|
