2018-02-19 00:47:44 +01:00
|
|
|
/*
|
|
|
|
* Copyright © 2018 Ebrahim Byagowi
|
2018-03-01 21:37:26 +01:00
|
|
|
* Copyright © 2018 Google, Inc.
|
2018-02-19 00:47:44 +01:00
|
|
|
*
|
|
|
|
* 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_AAT_LAYOUT_KERX_TABLE_HH
|
|
|
|
#define HB_AAT_LAYOUT_KERX_TABLE_HH
|
|
|
|
|
2018-08-26 07:36:36 +02:00
|
|
|
#include "hb-open-type.hh"
|
|
|
|
#include "hb-aat-layout-common.hh"
|
2018-10-11 07:14:18 +02:00
|
|
|
#include "hb-ot-layout-gpos-table.hh"
|
2018-10-08 04:33:41 +02:00
|
|
|
#include "hb-ot-kern-table.hh"
|
2018-02-19 00:47:44 +01:00
|
|
|
|
2018-04-12 11:08:19 +02:00
|
|
|
/*
|
|
|
|
* kerx -- Extended Kerning
|
|
|
|
* https://developer.apple.com/fonts/TrueType-Reference-Manual/RM06/Chap6kerx.html
|
|
|
|
*/
|
2018-03-26 09:34:30 +02:00
|
|
|
#define HB_AAT_TAG_kerx HB_TAG('k','e','r','x')
|
2018-02-19 00:47:44 +01:00
|
|
|
|
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
namespace AAT {
|
2018-02-19 00:47:44 +01:00
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
using namespace OT;
|
2018-02-19 00:47:44 +01:00
|
|
|
|
|
|
|
|
2018-10-11 00:14:41 +02:00
|
|
|
struct KerxSubTableHeader
|
|
|
|
{
|
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
|
|
|
return_trace (likely (c->check_struct (this)));
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
HBUINT32 length;
|
|
|
|
HBUINT32 coverage;
|
|
|
|
HBUINT32 tupleCount;
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (12);
|
|
|
|
};
|
|
|
|
|
2018-10-08 04:33:41 +02:00
|
|
|
struct KerxSubTableFormat0
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-10-08 04:33:41 +02:00
|
|
|
inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right) const
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-10-08 04:33:41 +02:00
|
|
|
hb_glyph_pair_t pair = {left, right};
|
|
|
|
int i = pairs.bsearch (pair);
|
2018-10-11 01:11:30 +02:00
|
|
|
return i == -1 ? 0 : pairs[i].get_kerning ();
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool apply (hb_aat_apply_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_APPLY (this);
|
|
|
|
|
2018-10-11 00:10:05 +02:00
|
|
|
if (!c->plan->requested_kerning)
|
|
|
|
return false;
|
|
|
|
|
2018-10-10 04:35:22 +02:00
|
|
|
hb_kern_machine_t<KerxSubTableFormat0> machine (*this);
|
|
|
|
|
|
|
|
machine.kern (c->font, c->buffer, c->plan->kern_mask);
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
2018-02-19 00:47:44 +01:00
|
|
|
|
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
2018-10-08 04:33:41 +02:00
|
|
|
return_trace (likely (pairs.sanitize (c)));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-10-11 00:14:41 +02:00
|
|
|
KerxSubTableHeader header;
|
2018-10-08 04:33:41 +02:00
|
|
|
BinSearchArrayOf<KernPair, HBUINT32>
|
2018-10-11 00:14:41 +02:00
|
|
|
pairs; /* Sorted kern records. */
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-11 00:14:41 +02:00
|
|
|
DEFINE_SIZE_ARRAY (28, pairs);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct KerxSubTableFormat1
|
|
|
|
{
|
2018-10-11 02:37:22 +02:00
|
|
|
struct EntryData
|
|
|
|
{
|
2018-10-11 03:18:37 +02:00
|
|
|
HBUINT16 kernActionIndex;/* Index into the kerning value array. If
|
|
|
|
* this index is 0xFFFF, then no kerning
|
|
|
|
* is to be performed. */
|
2018-10-11 02:37:22 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (2);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct driver_context_t
|
|
|
|
{
|
|
|
|
static const bool in_place = true;
|
|
|
|
enum Flags
|
|
|
|
{
|
|
|
|
Push = 0x8000, /* If set, push this glyph on the kerning stack. */
|
|
|
|
DontAdvance = 0x4000, /* If set, don't advance to the next glyph
|
|
|
|
* before going to the new state. */
|
|
|
|
Reset = 0x2000, /* If set, reset the kerning data (clear the stack) */
|
|
|
|
Reserved = 0x1FFF, /* Not used; set to 0. */
|
|
|
|
};
|
|
|
|
|
2018-10-11 03:18:37 +02:00
|
|
|
inline driver_context_t (const KerxSubTableFormat1 *table,
|
|
|
|
hb_aat_apply_context_t *c_) :
|
|
|
|
c (c_),
|
2018-10-11 03:53:14 +02:00
|
|
|
/* Apparently the offset kernAction is from the beginning of the state-machine,
|
|
|
|
* similar to offsets in morx table, NOT from beginning of this table, like
|
|
|
|
* other subtables in kerx. Discovered via testing. */
|
2018-10-11 03:46:58 +02:00
|
|
|
kernAction (&table->machine + table->kernAction),
|
2018-10-11 03:18:37 +02:00
|
|
|
depth (0) {}
|
2018-10-11 02:37:22 +02:00
|
|
|
|
|
|
|
inline bool is_actionable (StateTableDriver<EntryData> *driver,
|
|
|
|
const Entry<EntryData> *entry)
|
|
|
|
{
|
2018-10-11 03:18:37 +02:00
|
|
|
return entry->data.kernActionIndex != 0xFFFF;
|
2018-10-11 02:37:22 +02:00
|
|
|
}
|
|
|
|
inline bool transition (StateTableDriver<EntryData> *driver,
|
|
|
|
const Entry<EntryData> *entry)
|
|
|
|
{
|
2018-10-11 03:18:37 +02:00
|
|
|
hb_buffer_t *buffer = driver->buffer;
|
|
|
|
unsigned int flags = entry->flags;
|
|
|
|
|
|
|
|
if (flags & Reset)
|
|
|
|
{
|
|
|
|
depth = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & Push)
|
|
|
|
{
|
|
|
|
if (likely (depth < ARRAY_LENGTH (stack)))
|
|
|
|
stack[depth++] = buffer->idx;
|
|
|
|
else
|
|
|
|
depth = 0; /* Probably not what CoreText does, but better? */
|
|
|
|
}
|
|
|
|
|
|
|
|
if (entry->data.kernActionIndex != 0xFFFF)
|
|
|
|
{
|
|
|
|
const FWORD *actions = &kernAction[entry->data.kernActionIndex];
|
|
|
|
if (!c->sanitizer.check_array (actions, depth))
|
|
|
|
{
|
|
|
|
depth = 0;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-10-11 04:15:13 +02:00
|
|
|
hb_mask_t kern_mask = c->plan->kern_mask;
|
2018-10-11 03:46:58 +02:00
|
|
|
for (unsigned int i = 0; i < depth; i++)
|
2018-10-11 03:18:37 +02:00
|
|
|
{
|
2018-10-11 03:46:58 +02:00
|
|
|
/* Apparently, when spec says "Each pops one glyph from the kerning stack
|
|
|
|
* and applies the kerning value to it.", it doesn't mean it in that order.
|
|
|
|
* The deepest item in the stack corresponds to the first item in the action
|
|
|
|
* list. Discovered by testing. */
|
|
|
|
unsigned int idx = stack[i];
|
2018-10-11 03:18:37 +02:00
|
|
|
int v = *actions++;
|
2018-10-11 04:15:13 +02:00
|
|
|
if (buffer->info[idx].mask & kern_mask)
|
|
|
|
{
|
|
|
|
/* XXX Non-forward direction... */
|
|
|
|
if (HB_DIRECTION_IS_HORIZONTAL (buffer->props.direction))
|
|
|
|
buffer->pos[idx].x_advance += c->font->em_scale_x (v);
|
|
|
|
else
|
|
|
|
buffer->pos[idx].y_advance += c->font->em_scale_y (v);
|
|
|
|
}
|
2018-10-11 03:18:37 +02:00
|
|
|
}
|
2018-10-11 03:46:58 +02:00
|
|
|
depth = 0;
|
2018-10-11 03:18:37 +02:00
|
|
|
}
|
2018-10-11 02:37:22 +02:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2018-10-11 03:18:37 +02:00
|
|
|
hb_aat_apply_context_t *c;
|
|
|
|
const UnsizedArrayOf<FWORD> &kernAction;
|
|
|
|
unsigned int stack[8];
|
|
|
|
unsigned int depth;
|
2018-10-11 02:37:22 +02:00
|
|
|
};
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool apply (hb_aat_apply_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_APPLY (this);
|
|
|
|
|
2018-10-11 00:10:05 +02:00
|
|
|
if (!c->plan->requested_kerning)
|
|
|
|
return false;
|
|
|
|
|
2018-10-11 03:18:37 +02:00
|
|
|
driver_context_t dc (this, c);
|
2018-10-11 02:37:22 +02:00
|
|
|
|
|
|
|
StateTableDriver<EntryData> driver (machine, c->buffer, c->font->face);
|
|
|
|
driver.drive (&dc);
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2018-03-01 21:37:26 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2018-10-11 02:37:22 +02:00
|
|
|
return_trace (likely (machine.sanitize (c)));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-10-11 02:37:22 +02:00
|
|
|
KerxSubTableHeader header;
|
|
|
|
StateTable<EntryData> machine;
|
2018-10-11 03:18:37 +02:00
|
|
|
LOffsetTo<UnsizedArrayOf<FWORD>, false> kernAction;
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-11 00:14:41 +02:00
|
|
|
DEFINE_SIZE_STATIC (32);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct KerxSubTableFormat2
|
|
|
|
{
|
2018-10-08 05:08:39 +02:00
|
|
|
inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right,
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c) const
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-10-13 18:16:12 +02:00
|
|
|
unsigned int num_glyphs = c->sanitizer.get_num_glyphs ();
|
2018-10-10 19:24:51 +02:00
|
|
|
unsigned int l = (this+leftClassTable).get_value_or_null (left, num_glyphs);
|
|
|
|
unsigned int r = (this+rightClassTable).get_value_or_null (right, num_glyphs);
|
2018-10-08 04:43:59 +02:00
|
|
|
unsigned int offset = l + r;
|
2018-10-13 19:36:27 +02:00
|
|
|
const FWORD *v = &StructAtOffset<FWORD> (&(this+array), offset);
|
|
|
|
if (unlikely (!v->sanitize (&c->sanitizer))) return 0;
|
|
|
|
return *v;
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool apply (hb_aat_apply_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_APPLY (this);
|
|
|
|
|
2018-10-11 00:10:05 +02:00
|
|
|
if (!c->plan->requested_kerning)
|
|
|
|
return false;
|
|
|
|
|
2018-10-13 18:16:12 +02:00
|
|
|
accelerator_t accel (*this, c);
|
2018-10-10 04:35:22 +02:00
|
|
|
hb_kern_machine_t<accelerator_t> machine (accel);
|
|
|
|
machine.kern (c->font, c->buffer, c->plan->kern_mask);
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
2018-10-11 02:37:22 +02:00
|
|
|
return_trace (likely (rowWidth.sanitize (c) &&
|
2018-04-20 18:42:58 +02:00
|
|
|
leftClassTable.sanitize (c, this) &&
|
2018-10-11 02:43:21 +02:00
|
|
|
rightClassTable.sanitize (c, this)));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-10-10 04:35:22 +02:00
|
|
|
struct accelerator_t
|
|
|
|
{
|
|
|
|
const KerxSubTableFormat2 &table;
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c;
|
2018-10-10 04:35:22 +02:00
|
|
|
|
|
|
|
inline accelerator_t (const KerxSubTableFormat2 &table_,
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c_) :
|
|
|
|
table (table_), c (c_) {}
|
2018-10-10 04:35:22 +02:00
|
|
|
|
|
|
|
inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right) const
|
2018-10-13 18:16:12 +02:00
|
|
|
{ return table.get_kerning (left, right, c); }
|
2018-10-10 04:35:22 +02:00
|
|
|
};
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
protected:
|
2018-10-11 00:14:41 +02:00
|
|
|
KerxSubTableHeader header;
|
|
|
|
HBUINT32 rowWidth; /* The width, in bytes, of a row in the table. */
|
2018-10-08 04:52:53 +02:00
|
|
|
LOffsetTo<Lookup<HBUINT16> >
|
2018-10-11 00:14:41 +02:00
|
|
|
leftClassTable; /* Offset from beginning of this subtable to
|
|
|
|
* left-hand class table. */
|
2018-10-08 04:52:53 +02:00
|
|
|
LOffsetTo<Lookup<HBUINT16> >
|
2018-10-11 00:14:41 +02:00
|
|
|
rightClassTable;/* Offset from beginning of this subtable to
|
|
|
|
* right-hand class table. */
|
2018-10-11 02:43:21 +02:00
|
|
|
LOffsetTo<UnsizedArrayOf<FWORD>, false>
|
|
|
|
array; /* Offset from beginning of this subtable to
|
2018-10-11 00:14:41 +02:00
|
|
|
* the start of the kerning array. */
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-11 00:14:41 +02:00
|
|
|
DEFINE_SIZE_STATIC (28);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct KerxSubTableFormat4
|
|
|
|
{
|
2018-10-11 06:12:49 +02:00
|
|
|
struct EntryData
|
|
|
|
{
|
|
|
|
HBUINT16 ankrActionIndex;/* Either 0xFFFF (for no action) or the index of
|
|
|
|
* the action to perform. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (2);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct driver_context_t
|
|
|
|
{
|
|
|
|
static const bool in_place = true;
|
|
|
|
enum Flags
|
|
|
|
{
|
|
|
|
Mark = 0x8000, /* If set, remember this glyph as the marked glyph. */
|
|
|
|
DontAdvance = 0x4000, /* If set, don't advance to the next glyph before
|
|
|
|
* going to the new state. */
|
|
|
|
Reserved = 0x3FFF, /* Not used; set to 0. */
|
|
|
|
};
|
|
|
|
|
|
|
|
enum SubTableFlags
|
|
|
|
{
|
|
|
|
ActionType = 0xC0000000, /* A two-bit field containing the action type. */
|
|
|
|
Unused = 0x3F000000, /* Unused - must be zero. */
|
|
|
|
Offset = 0x00FFFFFF, /* Masks the offset in bytes from the beginning
|
|
|
|
* of the subtable to the beginning of the control
|
|
|
|
* point table. */
|
|
|
|
};
|
|
|
|
|
|
|
|
inline driver_context_t (const KerxSubTableFormat4 *table,
|
|
|
|
hb_aat_apply_context_t *c_) :
|
|
|
|
c (c_),
|
|
|
|
action_type ((table->flags & ActionType) >> 30),
|
|
|
|
ankrData ((HBUINT16 *) ((const char *) &table->machine + (table->flags & Offset))),
|
|
|
|
mark_set (false),
|
|
|
|
mark (0) {}
|
|
|
|
|
|
|
|
inline bool is_actionable (StateTableDriver<EntryData> *driver,
|
|
|
|
const Entry<EntryData> *entry)
|
|
|
|
{
|
|
|
|
return entry->data.ankrActionIndex != 0xFFFF;
|
|
|
|
}
|
|
|
|
inline bool transition (StateTableDriver<EntryData> *driver,
|
|
|
|
const Entry<EntryData> *entry)
|
|
|
|
{
|
|
|
|
hb_buffer_t *buffer = driver->buffer;
|
|
|
|
unsigned int flags = entry->flags;
|
|
|
|
|
|
|
|
if (mark_set && entry->data.ankrActionIndex != 0xFFFF)
|
|
|
|
{
|
2018-10-11 07:17:57 +02:00
|
|
|
hb_glyph_position_t &o = buffer->cur_pos();
|
2018-10-11 06:12:49 +02:00
|
|
|
switch (action_type)
|
|
|
|
{
|
|
|
|
case 0: /* Control Point Actions.*/
|
|
|
|
{
|
|
|
|
/* indexed into glyph outline. */
|
|
|
|
const HBUINT16 *data = &ankrData[entry->data.ankrActionIndex];
|
|
|
|
if (!c->sanitizer.check_array (data, 2))
|
|
|
|
return false;
|
|
|
|
HB_UNUSED unsigned int markControlPoint = *data++;
|
|
|
|
HB_UNUSED unsigned int currControlPoint = *data++;
|
2018-10-11 07:22:29 +02:00
|
|
|
hb_position_t markX = 0;
|
|
|
|
hb_position_t markY = 0;
|
|
|
|
hb_position_t currX = 0;
|
|
|
|
hb_position_t currY = 0;
|
|
|
|
if (!c->font->get_glyph_contour_point_for_origin (c->buffer->info[mark].codepoint,
|
|
|
|
markControlPoint,
|
|
|
|
HB_DIRECTION_LTR /*XXX*/,
|
|
|
|
&markX, &markY) ||
|
|
|
|
!c->font->get_glyph_contour_point_for_origin (c->buffer->cur ().codepoint,
|
|
|
|
currControlPoint,
|
|
|
|
HB_DIRECTION_LTR /*XXX*/,
|
|
|
|
&currX, &currY))
|
|
|
|
return true; /* True, such that the machine continues. */
|
|
|
|
|
|
|
|
o.x_offset = markX - currX;
|
|
|
|
o.y_offset = markY - currY;
|
2018-10-11 06:12:49 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 1: /* Anchor Point Actions. */
|
|
|
|
{
|
|
|
|
/* Indexed into 'ankr' table. */
|
|
|
|
const HBUINT16 *data = &ankrData[entry->data.ankrActionIndex];
|
|
|
|
if (!c->sanitizer.check_array (data, 2))
|
|
|
|
return false;
|
2018-10-11 07:14:18 +02:00
|
|
|
unsigned int markAnchorPoint = *data++;
|
|
|
|
unsigned int currAnchorPoint = *data++;
|
|
|
|
const Anchor markAnchor = c->ankr_table.get_anchor (c->buffer->info[mark].codepoint,
|
|
|
|
markAnchorPoint,
|
2018-10-13 17:48:49 +02:00
|
|
|
c->sanitizer.get_num_glyphs (),
|
2018-10-11 07:14:18 +02:00
|
|
|
c->ankr_end);
|
|
|
|
const Anchor currAnchor = c->ankr_table.get_anchor (c->buffer->cur ().codepoint,
|
|
|
|
currAnchorPoint,
|
2018-10-13 17:48:49 +02:00
|
|
|
c->sanitizer.get_num_glyphs (),
|
2018-10-11 07:14:18 +02:00
|
|
|
c->ankr_end);
|
2018-10-11 07:17:57 +02:00
|
|
|
|
2018-10-11 07:14:18 +02:00
|
|
|
o.x_offset = c->font->em_scale_x (markAnchor.xCoordinate) - c->font->em_scale_x (currAnchor.xCoordinate);
|
|
|
|
o.y_offset = c->font->em_scale_y (markAnchor.yCoordinate) - c->font->em_scale_y (currAnchor.yCoordinate);
|
2018-10-11 06:12:49 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 2: /* Control Point Coordinate Actions. */
|
|
|
|
{
|
|
|
|
const FWORD *data = (const FWORD *) &ankrData[entry->data.ankrActionIndex];
|
|
|
|
if (!c->sanitizer.check_array (data, 4))
|
|
|
|
return false;
|
2018-10-11 07:17:57 +02:00
|
|
|
int markX = *data++;
|
|
|
|
int markY = *data++;
|
|
|
|
int currX = *data++;
|
|
|
|
int currY = *data++;
|
|
|
|
|
|
|
|
o.x_offset = c->font->em_scale_x (markX) - c->font->em_scale_x (currX);
|
|
|
|
o.y_offset = c->font->em_scale_y (markY) - c->font->em_scale_y (currY);
|
2018-10-11 06:12:49 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2018-10-11 07:17:57 +02:00
|
|
|
o.attach_type() = ATTACH_TYPE_MARK;
|
|
|
|
o.attach_chain() = (int) mark - (int) buffer->idx;
|
|
|
|
buffer->scratch_flags |= HB_BUFFER_SCRATCH_FLAG_HAS_GPOS_ATTACHMENT;
|
2018-10-11 06:12:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & Mark)
|
|
|
|
{
|
|
|
|
mark_set = true;
|
|
|
|
mark = buffer->idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
hb_aat_apply_context_t *c;
|
|
|
|
unsigned int action_type;
|
|
|
|
const HBUINT16 *ankrData;
|
|
|
|
bool mark_set;
|
|
|
|
unsigned int mark;
|
|
|
|
};
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool apply (hb_aat_apply_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_APPLY (this);
|
|
|
|
|
2018-10-11 06:12:49 +02:00
|
|
|
driver_context_t dc (this, c);
|
|
|
|
|
|
|
|
StateTableDriver<EntryData> driver (machine, c->buffer, c->font->face);
|
|
|
|
driver.drive (&dc);
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
2018-10-08 04:52:53 +02:00
|
|
|
|
2018-10-11 06:12:49 +02:00
|
|
|
/* The rest of array sanitizations are done at run-time. */
|
|
|
|
return_trace (c->check_struct (this) &&
|
|
|
|
machine.sanitize (c) &&
|
|
|
|
flags.sanitize (c));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-10-11 00:14:41 +02:00
|
|
|
KerxSubTableHeader header;
|
2018-10-11 06:12:49 +02:00
|
|
|
StateTable<EntryData> machine;
|
|
|
|
HBUINT32 flags;
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-11 06:12:49 +02:00
|
|
|
DEFINE_SIZE_STATIC (32);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct KerxSubTableFormat6
|
|
|
|
{
|
2018-10-11 01:58:20 +02:00
|
|
|
enum Flags
|
|
|
|
{
|
|
|
|
ValuesAreLong = 0x00000001,
|
|
|
|
};
|
|
|
|
|
|
|
|
inline bool is_long (void) const { return flags & ValuesAreLong; }
|
|
|
|
|
2018-10-11 02:10:20 +02:00
|
|
|
inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right,
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c) const
|
2018-10-11 02:10:20 +02:00
|
|
|
{
|
2018-10-13 18:16:12 +02:00
|
|
|
unsigned int num_glyphs = c->sanitizer.get_num_glyphs ();
|
2018-10-11 02:10:20 +02:00
|
|
|
if (is_long ())
|
|
|
|
{
|
|
|
|
const U::Long &t = u.l;
|
|
|
|
unsigned int l = (this+t.rowIndexTable).get_value_or_null (left, num_glyphs);
|
|
|
|
unsigned int r = (this+t.columnIndexTable).get_value_or_null (right, num_glyphs);
|
|
|
|
unsigned int offset = l + r;
|
2018-10-13 17:39:12 +02:00
|
|
|
if (unlikely (offset < l)) return 0; /* Addition overflow. */
|
|
|
|
if (unlikely (hb_unsigned_mul_overflows (offset, sizeof (FWORD32)))) return 0;
|
2018-10-13 19:36:27 +02:00
|
|
|
const FWORD32 *v = &StructAtOffset<FWORD32> (&(this+t.array), offset * sizeof (FWORD32));
|
|
|
|
if (unlikely (!v->sanitize (&c->sanitizer))) return 0;
|
|
|
|
return *v;
|
2018-10-11 02:10:20 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const U::Short &t = u.s;
|
|
|
|
unsigned int l = (this+t.rowIndexTable).get_value_or_null (left, num_glyphs);
|
|
|
|
unsigned int r = (this+t.columnIndexTable).get_value_or_null (right, num_glyphs);
|
|
|
|
unsigned int offset = l + r;
|
2018-10-13 19:36:27 +02:00
|
|
|
const FWORD *v = &StructAtOffset<FWORD> (&(this+t.array), offset * sizeof (FWORD));
|
|
|
|
if (unlikely (!v->sanitize (&c->sanitizer))) return 0;
|
|
|
|
return *v;
|
2018-10-11 02:10:20 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool apply (hb_aat_apply_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_APPLY (this);
|
|
|
|
|
2018-10-11 00:10:05 +02:00
|
|
|
if (!c->plan->requested_kerning)
|
|
|
|
return false;
|
|
|
|
|
2018-10-13 18:16:12 +02:00
|
|
|
accelerator_t accel (*this, c);
|
2018-10-11 02:10:20 +02:00
|
|
|
hb_kern_machine_t<accelerator_t> machine (accel);
|
|
|
|
machine.kern (c->font, c->buffer, c->plan->kern_mask);
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2018-03-01 21:37:26 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2018-04-20 18:42:58 +02:00
|
|
|
return_trace (likely (c->check_struct (this) &&
|
2018-10-11 01:58:20 +02:00
|
|
|
is_long () ?
|
|
|
|
(
|
|
|
|
u.l.rowIndexTable.sanitize (c, this) &&
|
2018-10-11 02:43:21 +02:00
|
|
|
u.l.columnIndexTable.sanitize (c, this)
|
2018-10-11 01:58:20 +02:00
|
|
|
) : (
|
|
|
|
u.s.rowIndexTable.sanitize (c, this) &&
|
2018-10-11 02:43:21 +02:00
|
|
|
u.s.columnIndexTable.sanitize (c, this)
|
2018-10-11 01:58:20 +02:00
|
|
|
)));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-10-11 02:10:20 +02:00
|
|
|
struct accelerator_t
|
|
|
|
{
|
|
|
|
const KerxSubTableFormat6 &table;
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c;
|
2018-10-11 02:10:20 +02:00
|
|
|
|
|
|
|
inline accelerator_t (const KerxSubTableFormat6 &table_,
|
2018-10-13 18:16:12 +02:00
|
|
|
hb_aat_apply_context_t *c_) :
|
|
|
|
table (table_), c (c_) {}
|
2018-10-11 02:10:20 +02:00
|
|
|
|
|
|
|
inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right) const
|
2018-10-13 18:16:12 +02:00
|
|
|
{ return table.get_kerning (left, right, c); }
|
2018-10-11 02:10:20 +02:00
|
|
|
};
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
protected:
|
2018-10-11 00:14:41 +02:00
|
|
|
KerxSubTableHeader header;
|
|
|
|
HBUINT32 flags;
|
|
|
|
HBUINT16 rowCount;
|
|
|
|
HBUINT16 columnCount;
|
2018-10-11 02:10:20 +02:00
|
|
|
union U
|
2018-10-11 01:58:20 +02:00
|
|
|
{
|
2018-10-11 02:10:20 +02:00
|
|
|
struct Long
|
2018-10-11 01:58:20 +02:00
|
|
|
{
|
|
|
|
LOffsetTo<Lookup<HBUINT32> > rowIndexTable;
|
|
|
|
LOffsetTo<Lookup<HBUINT32> > columnIndexTable;
|
2018-10-11 02:43:21 +02:00
|
|
|
LOffsetTo<UnsizedArrayOf<FWORD32>, false>
|
|
|
|
array;
|
2018-10-11 01:58:20 +02:00
|
|
|
} l;
|
2018-10-11 02:10:20 +02:00
|
|
|
struct Short
|
|
|
|
{
|
|
|
|
LOffsetTo<Lookup<HBUINT16> > rowIndexTable;
|
|
|
|
LOffsetTo<Lookup<HBUINT16> > columnIndexTable;
|
2018-10-11 02:43:21 +02:00
|
|
|
LOffsetTo<UnsizedArrayOf<FWORD>, false>
|
|
|
|
array;
|
2018-10-11 02:10:20 +02:00
|
|
|
} s;
|
2018-10-11 01:58:20 +02:00
|
|
|
} u;
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-11 01:58:20 +02:00
|
|
|
DEFINE_SIZE_STATIC (32);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
struct KerxTable
|
|
|
|
{
|
2018-10-09 14:28:07 +02:00
|
|
|
friend struct kerx;
|
2018-10-09 04:41:08 +02:00
|
|
|
|
2018-10-11 00:14:41 +02:00
|
|
|
inline unsigned int get_size (void) const { return u.header.length; }
|
|
|
|
inline unsigned int get_type (void) const { return u.header.coverage & SubtableType; }
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
enum Coverage
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-10-07 20:01:33 +02:00
|
|
|
Vertical = 0x80000000, /* Set if table has vertical kerning values. */
|
|
|
|
CrossStream = 0x40000000, /* Set if table has cross-stream kerning values. */
|
|
|
|
Variation = 0x20000000, /* Set if table has variation kerning values. */
|
2018-10-10 05:27:00 +02:00
|
|
|
Backwards = 0x10000000, /* If clear, process the glyphs forwards, that
|
2018-10-07 20:01:33 +02:00
|
|
|
* is, from first to last in the glyph stream.
|
|
|
|
* If we, process them from last to first.
|
|
|
|
* This flag only applies to state-table based
|
|
|
|
* 'kerx' subtables (types 1 and 4). */
|
|
|
|
Reserved = 0x0FFFFF00, /* Reserved, set to zero. */
|
|
|
|
SubtableType = 0x000000FF, /* Subtable type. */
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename context_t>
|
|
|
|
inline typename context_t::return_t dispatch (context_t *c) const
|
|
|
|
{
|
|
|
|
unsigned int subtable_type = get_type ();
|
|
|
|
TRACE_DISPATCH (this, subtable_type);
|
|
|
|
switch (subtable_type) {
|
|
|
|
case 0 : return_trace (c->dispatch (u.format0));
|
|
|
|
case 1 : return_trace (c->dispatch (u.format1));
|
|
|
|
case 2 : return_trace (c->dispatch (u.format2));
|
|
|
|
case 4 : return_trace (c->dispatch (u.format4));
|
|
|
|
case 6 : return_trace (c->dispatch (u.format6));
|
|
|
|
default: return_trace (c->default_return_value ());
|
|
|
|
}
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
2018-10-11 00:14:41 +02:00
|
|
|
if (!u.header.sanitize (c) ||
|
|
|
|
!c->check_range (this, u.header.length))
|
2018-03-01 21:37:26 +01:00
|
|
|
return_trace (false);
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
return_trace (dispatch (c));
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
protected:
|
2018-02-19 00:47:44 +01:00
|
|
|
union {
|
2018-10-11 00:14:41 +02:00
|
|
|
KerxSubTableHeader header;
|
2018-02-19 00:47:44 +01:00
|
|
|
KerxSubTableFormat0 format0;
|
2018-03-01 21:37:26 +01:00
|
|
|
KerxSubTableFormat1 format1;
|
2018-02-19 00:47:44 +01:00
|
|
|
KerxSubTableFormat2 format2;
|
|
|
|
KerxSubTableFormat4 format4;
|
|
|
|
KerxSubTableFormat6 format6;
|
|
|
|
} u;
|
2018-03-01 21:37:26 +01:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_MIN (12);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The 'kerx' Table
|
|
|
|
*/
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
struct kerx
|
|
|
|
{
|
2018-03-26 09:34:30 +02:00
|
|
|
static const hb_tag_t tableTag = HB_AAT_TAG_kerx;
|
2018-02-19 00:47:44 +01:00
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
inline bool has_data (void) const { return version != 0; }
|
|
|
|
|
|
|
|
inline void apply (hb_aat_apply_context_t *c) const
|
2018-02-24 10:19:42 +01:00
|
|
|
{
|
2018-10-07 20:01:33 +02:00
|
|
|
c->set_lookup_index (0);
|
|
|
|
const KerxTable *table = &firstTable;
|
|
|
|
unsigned int count = tableCount;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
{
|
2018-10-09 04:41:08 +02:00
|
|
|
bool reverse;
|
|
|
|
|
2018-10-11 01:20:06 +02:00
|
|
|
if (table->u.header.coverage & (KerxTable::CrossStream | KerxTable::Variation) ||
|
|
|
|
table->u.header.tupleCount)
|
2018-10-10 23:32:32 +02:00
|
|
|
goto skip; /* We do NOT handle cross-stream or variation kerning. */
|
|
|
|
|
2018-10-09 04:41:08 +02:00
|
|
|
if (HB_DIRECTION_IS_VERTICAL (c->buffer->props.direction) !=
|
2018-10-11 00:14:41 +02:00
|
|
|
bool (table->u.header.coverage & KerxTable::Vertical))
|
2018-10-10 23:32:32 +02:00
|
|
|
goto skip;
|
2018-10-09 04:41:08 +02:00
|
|
|
|
2018-10-11 00:14:41 +02:00
|
|
|
reverse = bool (table->u.header.coverage & KerxTable::Backwards) !=
|
2018-10-09 04:41:08 +02:00
|
|
|
HB_DIRECTION_IS_BACKWARD (c->buffer->props.direction);
|
|
|
|
|
|
|
|
if (!c->buffer->message (c->font, "start kerx subtable %d", c->lookup_index))
|
2018-10-10 23:32:32 +02:00
|
|
|
goto skip;
|
2018-10-09 04:41:08 +02:00
|
|
|
|
|
|
|
if (reverse)
|
2018-10-10 23:32:32 +02:00
|
|
|
c->buffer->reverse ();
|
2018-10-09 04:41:08 +02:00
|
|
|
|
2018-10-10 05:07:47 +02:00
|
|
|
c->sanitizer.set_object (*table);
|
|
|
|
|
2018-10-10 04:57:00 +02:00
|
|
|
/* XXX Reverse-kern is not working yet...
|
|
|
|
* hb_kern_machine_t would need to know that it's reverse-kerning.
|
|
|
|
* Or better yet, make it work in reverse as well, so we don't have
|
|
|
|
* to reverse and reverse back? */
|
2018-10-07 20:01:33 +02:00
|
|
|
table->dispatch (c);
|
2018-10-09 04:41:08 +02:00
|
|
|
|
|
|
|
if (reverse)
|
2018-10-10 23:32:32 +02:00
|
|
|
c->buffer->reverse ();
|
2018-10-09 04:41:08 +02:00
|
|
|
|
|
|
|
(void) c->buffer->message (c->font, "end kerx subtable %d", c->lookup_index);
|
|
|
|
|
|
|
|
skip:
|
2018-10-07 20:01:33 +02:00
|
|
|
table = &StructAfter<KerxTable> (*table);
|
|
|
|
}
|
2018-02-24 10:19:42 +01:00
|
|
|
}
|
|
|
|
|
2018-03-01 21:37:26 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-03-01 21:37:26 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2018-10-07 20:01:33 +02:00
|
|
|
if (!version.sanitize (c) || version < 2 ||
|
|
|
|
!tableCount.sanitize (c))
|
2018-03-01 21:37:26 +01:00
|
|
|
return_trace (false);
|
2018-02-19 00:47:44 +01:00
|
|
|
|
2018-10-07 20:01:33 +02:00
|
|
|
const KerxTable *table = &firstTable;
|
|
|
|
unsigned int count = tableCount;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2018-02-19 00:47:44 +01:00
|
|
|
{
|
2018-10-07 20:01:33 +02:00
|
|
|
if (!table->sanitize (c))
|
|
|
|
return_trace (false);
|
2018-03-01 21:37:26 +01:00
|
|
|
table = &StructAfter<KerxTable> (*table);
|
2018-02-19 00:47:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-10-07 20:01:33 +02:00
|
|
|
HBUINT16 version; /* The version number of the extended kerning table
|
|
|
|
* (currently 2, 3, or 4). */
|
|
|
|
HBUINT16 unused; /* Set to 0. */
|
|
|
|
HBUINT32 tableCount; /* The number of subtables included in the extended kerning
|
|
|
|
* table. */
|
|
|
|
KerxTable firstTable; /* Subtables. */
|
|
|
|
/*subtableGlyphCoverageArray*/ /* Only if version >= 3. We don't use. */
|
|
|
|
|
2018-02-19 00:47:44 +01:00
|
|
|
public:
|
2018-10-07 20:01:33 +02:00
|
|
|
DEFINE_SIZE_MIN (8);
|
2018-02-19 00:47:44 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
} /* namespace AAT */
|
|
|
|
|
|
|
|
|
|
|
|
#endif /* HB_AAT_LAYOUT_KERX_TABLE_HH */
|