harfbuzz/src/hb-ot-layout-gsub-private.hh

941 lines
24 KiB
C++
Raw Normal View History

2008-01-23 23:01:55 +01:00
/*
2010-05-06 18:55:14 +02:00
* Copyright (C) 2007,2008,2009,2010 Red Hat, Inc.
2008-01-23 23:01:55 +01:00
*
2010-04-22 06:11:43 +02:00
* This is part of HarfBuzz, a text shaping library.
2008-01-23 23:01:55 +01:00
*
* 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.
*
* Red Hat Author(s): Behdad Esfahbod
*/
#ifndef HB_OT_LAYOUT_GSUB_PRIVATE_HH
#define HB_OT_LAYOUT_GSUB_PRIVATE_HH
2008-01-23 23:01:55 +01:00
#include "hb-ot-layout-gsubgpos-private.hh"
2008-01-23 23:01:55 +01:00
2009-05-20 05:42:30 +02:00
struct SingleSubstFormat1
{
2009-04-16 01:50:16 +02:00
friend struct SingleSubst;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
hb_codepoint_t glyph_id = c->buffer->info[c->buffer->in_pos].codepoint;
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
if (likely (index == NOT_COVERED))
2009-04-16 04:56:15 +02:00
return false;
glyph_id += deltaGlyphID;
2010-05-13 20:18:49 +02:00
c->buffer->replace_glyph (glyph_id);
2009-05-20 05:42:30 +02:00
/* We inherit the old glyph class to the substituted glyph */
2010-05-13 20:18:49 +02:00
if (_hb_ot_layout_has_new_glyph_classes (c->layout->face))
_hb_ot_layout_set_glyph_property (c->layout->face, glyph_id, c->property);
2009-04-16 04:56:15 +02:00
return true;
}
2009-04-16 04:56:15 +02:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return coverage.sanitize (c, this)
&& deltaGlyphID.sanitize (c);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 1 */
2009-05-17 06:22:37 +02:00
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
2008-01-23 23:01:55 +01:00
* beginning of Substitution table */
SHORT deltaGlyphID; /* Add to original GlyphID to get
* substitute GlyphID */
public:
DEFINE_SIZE_STATIC (6);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct SingleSubstFormat2
{
friend struct SingleSubst;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
hb_codepoint_t glyph_id = c->buffer->info[c->buffer->in_pos].codepoint;
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
if (likely (index == NOT_COVERED))
return false;
if (unlikely (index >= substitute.len))
return false;
glyph_id = substitute[index];
2010-05-13 20:18:49 +02:00
c->buffer->replace_glyph (glyph_id);
2009-05-20 05:42:30 +02:00
/* We inherit the old glyph class to the substituted glyph */
2010-05-13 20:18:49 +02:00
if (_hb_ot_layout_has_new_glyph_classes (c->layout->face))
_hb_ot_layout_set_glyph_property (c->layout->face, glyph_id, c->property);
2009-05-20 05:42:30 +02:00
return true;
}
2008-01-23 23:01:55 +01:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return coverage.sanitize (c, this)
&& substitute.sanitize (c);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 2 */
2009-05-17 06:22:37 +02:00
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
2008-01-23 23:01:55 +01:00
* beginning of Substitution table */
2009-05-17 07:22:51 +02:00
ArrayOf<GlyphID>
substitute; /* Array of substitute
* GlyphIDs--ordered by Coverage Index */
public:
DEFINE_SIZE_ARRAY (6, substitute);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct SingleSubst
{
friend struct SubstLookupSubTable;
2009-04-16 19:40:13 +02:00
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.apply (c);
case 2: return u.format2.apply (c);
2009-05-05 02:21:57 +02:00
default:return false;
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!u.format.sanitize (c)) return false;
2009-08-04 06:58:28 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.sanitize (c);
case 2: return u.format2.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
2010-05-11 01:45:41 +02:00
SingleSubstFormat1 format1;
SingleSubstFormat2 format2;
} u;
2008-01-23 23:01:55 +01:00
};
2008-01-23 23:01:55 +01:00
2009-05-20 05:42:30 +02:00
struct Sequence
{
friend struct MultipleSubstFormat1;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
if (unlikely (!substitute.len))
2009-05-05 22:22:02 +02:00
return false;
2010-05-13 20:18:49 +02:00
c->buffer->add_output_glyphs_be16 (1,
substitute.len, (const uint16_t *) substitute.array,
0xFFFF, 0xFFFF);
2009-05-05 22:22:02 +02:00
/* This is a guess only ... */
2010-05-13 20:18:49 +02:00
if (_hb_ot_layout_has_new_glyph_classes (c->layout->face))
2009-05-05 22:22:02 +02:00
{
2010-05-13 20:18:49 +02:00
unsigned int property = c->property;
if (property == HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE)
2009-05-05 22:22:02 +02:00
property = HB_OT_LAYOUT_GLYPH_CLASS_BASE_GLYPH;
unsigned int count = substitute.len;
for (unsigned int n = 0; n < count; n++)
2010-05-13 20:18:49 +02:00
_hb_ot_layout_set_glyph_property (c->layout->face, substitute[n], property);
2009-05-05 22:22:02 +02:00
}
return true;
}
2009-08-04 06:58:28 +02:00
public:
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return substitute.sanitize (c);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-17 07:22:51 +02:00
ArrayOf<GlyphID>
substitute; /* String of GlyphIDs to substitute */
public:
DEFINE_SIZE_ARRAY (2, substitute);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct MultipleSubstFormat1
{
friend struct MultipleSubst;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
unsigned int index = (this+coverage) (c->buffer->info[c->buffer->in_pos].codepoint);
if (likely (index == NOT_COVERED))
return false;
2010-05-13 20:18:49 +02:00
return (this+sequence[index]).apply (c);
}
2008-01-23 23:01:55 +01:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return coverage.sanitize (c, this)
&& sequence.sanitize (c, this);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 1 */
2009-05-17 06:22:37 +02:00
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
2008-01-23 23:01:55 +01:00
* beginning of Substitution table */
2009-05-17 07:22:51 +02:00
OffsetArrayOf<Sequence>
sequence; /* Array of Sequence tables
* ordered by Coverage Index */
public:
DEFINE_SIZE_ARRAY (6, sequence);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct MultipleSubst
{
2009-04-16 19:40:13 +02:00
friend struct SubstLookupSubTable;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.apply (c);
default:return false;
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!u.format.sanitize (c)) return false;
2009-08-04 06:58:28 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
2010-05-11 01:45:41 +02:00
MultipleSubstFormat1 format1;
} u;
};
2008-01-23 23:01:55 +01:00
2009-05-17 07:22:51 +02:00
typedef ArrayOf<GlyphID> AlternateSet; /* Array of alternate GlyphIDs--in
2008-01-23 23:01:55 +01:00
* arbitrary order */
2009-05-20 05:42:30 +02:00
struct AlternateSubstFormat1
{
2009-04-16 20:19:42 +02:00
friend struct AlternateSubst;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
hb_codepoint_t glyph_id = c->buffer->info[c->buffer->in_pos].codepoint;
2009-04-16 20:19:42 +02:00
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
if (likely (index == NOT_COVERED))
return false;
2009-05-17 07:22:51 +02:00
const AlternateSet &alt_set = this+alternateSet[index];
2009-04-16 20:19:42 +02:00
if (unlikely (!alt_set.len))
2009-04-16 20:19:42 +02:00
return false;
unsigned int alt_index = 0;
/* XXX callback to user to choose alternate
2010-05-13 20:18:49 +02:00
if (c->layout->face->altfunc)
alt_index = (c->layout->face->altfunc)(c->layout->layout, c->buffer,
c->buffer->out_length, glyph_id,
2009-05-18 10:25:22 +02:00
alt_set.len, alt_set.array);
2009-04-16 20:19:42 +02:00
*/
if (unlikely (alt_index >= alt_set.len))
2009-04-16 20:19:42 +02:00
return false;
glyph_id = alt_set[alt_index];
2010-05-13 20:18:49 +02:00
c->buffer->replace_glyph (glyph_id);
2009-04-16 20:19:42 +02:00
/* We inherit the old glyph class to the substituted glyph */
2010-05-13 20:18:49 +02:00
if (_hb_ot_layout_has_new_glyph_classes (c->layout->face))
_hb_ot_layout_set_glyph_property (c->layout->face, glyph_id, c->property);
2009-04-16 20:19:42 +02:00
return true;
}
2008-01-23 23:01:55 +01:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return coverage.sanitize (c, this)
&& alternateSet.sanitize (c, this);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 1 */
2009-05-17 06:22:37 +02:00
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
2008-01-23 23:01:55 +01:00
* beginning of Substitution table */
2009-05-17 07:22:51 +02:00
OffsetArrayOf<AlternateSet>
alternateSet; /* Array of AlternateSet tables
* ordered by Coverage Index */
public:
DEFINE_SIZE_ARRAY (6, alternateSet);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct AlternateSubst
{
2009-04-16 20:19:42 +02:00
friend struct SubstLookupSubTable;
private:
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.apply (c);
2009-04-16 20:19:42 +02:00
default:return false;
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!u.format.sanitize (c)) return false;
2009-08-04 06:58:28 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
2009-04-16 20:19:42 +02:00
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
2010-05-11 01:45:41 +02:00
AlternateSubstFormat1 format1;
2009-04-16 20:19:42 +02:00
} u;
};
2009-05-20 05:42:30 +02:00
struct Ligature
{
friend struct LigatureSet;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c, bool is_mark) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
unsigned int i, j;
2009-05-18 08:03:58 +02:00
unsigned int count = component.len;
2010-05-13 20:18:49 +02:00
unsigned int end = MIN (c->buffer->in_length, c->buffer->in_pos + c->context_length);
if (unlikely (c->buffer->in_pos + count > end))
return false;
2010-05-13 20:18:49 +02:00
for (i = 1, j = c->buffer->in_pos + 1; i < count; i++, j++)
2009-05-20 05:42:30 +02:00
{
unsigned int property;
while (_hb_ot_layout_skip_mark (c->layout->face, &c->buffer->info[j], c->lookup_flag, &property))
2009-05-20 05:42:30 +02:00
{
if (unlikely (j + count - i == end))
return false;
j++;
}
if (!(property & HB_OT_LAYOUT_GLYPH_CLASS_MARK))
2009-11-04 02:27:05 +01:00
is_mark = false;
if (likely (c->buffer->info[j].codepoint != component[i]))
return false;
}
/* This is just a guess ... */
2010-05-13 20:18:49 +02:00
if (_hb_ot_layout_has_new_glyph_classes (c->layout->face))
_hb_ot_layout_set_glyph_class (c->layout->face, ligGlyph,
2009-08-02 23:41:36 +02:00
is_mark ? HB_OT_LAYOUT_GLYPH_CLASS_MARK
: HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE);
2010-05-13 20:18:49 +02:00
if (j == c->buffer->in_pos + i) /* No input glyphs skipped */
/* We don't use a new ligature ID if there are no skipped
glyphs and the ligature already has an ID. */
2010-05-13 20:18:49 +02:00
c->buffer->add_output_glyphs_be16 (i,
1, (const uint16_t *) &ligGlyph,
0,
c->buffer->info[c->buffer->in_pos].lig_id && !c->buffer->info[c->buffer->in_pos].component ?
2010-05-13 20:18:49 +02:00
0xFFFF : c->buffer->allocate_lig_id ());
else
{
2010-05-13 20:18:49 +02:00
unsigned int lig_id = c->buffer->allocate_lig_id ();
c->buffer->add_output_glyph (ligGlyph, 0xFFFF, lig_id);
/* Now we must do a second loop to copy the skipped glyphs to
`out' and assign component values to it. We start with the
glyph after the first component. Glyphs between component
i and i+1 belong to component i. Together with the lig_id
value it is later possible to check whether a specific
component value really belongs to a given ligature. */
2009-05-17 15:45:32 +02:00
for ( i = 1; i < count; i++ )
{
while (_hb_ot_layout_skip_mark (c->layout->face, &c->buffer->info[c->buffer->in_pos], c->lookup_flag, NULL))
c->buffer->add_output_glyph (c->buffer->info[c->buffer->in_pos].codepoint, i, lig_id);
2010-05-13 20:18:49 +02:00
(c->buffer->in_pos)++;
}
}
return true;
}
2009-08-04 06:58:28 +02:00
public:
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return ligGlyph.sanitize (c)
&& component.sanitize (c);
2009-08-04 06:58:28 +02:00
}
private:
GlyphID ligGlyph; /* GlyphID of ligature to substitute */
2009-05-18 08:03:58 +02:00
HeadlessArrayOf<GlyphID>
component; /* Array of component GlyphIDs--start
* with the second component--ordered
* in writing direction */
public:
DEFINE_SIZE_ARRAY (4, component);
};
2008-01-23 23:01:55 +01:00
2009-05-20 05:42:30 +02:00
struct LigatureSet
{
friend struct LigatureSubstFormat1;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c, bool is_mark) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-17 07:22:51 +02:00
unsigned int num_ligs = ligature.len;
2009-05-20 05:42:30 +02:00
for (unsigned int i = 0; i < num_ligs; i++)
{
2009-05-17 07:22:51 +02:00
const Ligature &lig = this+ligature[i];
2010-05-13 20:18:49 +02:00
if (lig.apply (c, is_mark))
return true;
}
return false;
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
public:
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return ligature.sanitize (c, this);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-17 07:22:51 +02:00
OffsetArrayOf<Ligature>
ligature; /* Array LigatureSet tables
* ordered by preference */
public:
DEFINE_SIZE_ARRAY (2, ligature);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct LigatureSubstFormat1
{
2009-04-16 22:53:40 +02:00
friend struct LigatureSubst;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
hb_codepoint_t glyph_id = c->buffer->info[c->buffer->in_pos].codepoint;
2009-04-16 22:53:40 +02:00
2010-05-13 20:18:49 +02:00
bool first_is_mark = !!(c->property & HB_OT_LAYOUT_GLYPH_CLASS_MARK);
2009-04-16 22:53:40 +02:00
2009-05-17 07:22:51 +02:00
unsigned int index = (this+coverage) (glyph_id);
if (likely (index == NOT_COVERED))
return false;
2009-05-17 07:22:51 +02:00
const LigatureSet &lig_set = this+ligatureSet[index];
2010-05-13 20:18:49 +02:00
return lig_set.apply (c, first_is_mark);
2009-04-16 22:53:40 +02:00
}
2008-01-23 23:01:55 +01:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
return coverage.sanitize (c, this)
&& ligatureSet.sanitize (c, this);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 1 */
2009-05-17 06:22:37 +02:00
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of Substitution table */
2009-05-18 19:50:15 +02:00
OffsetArrayOf<LigatureSet>
2009-05-17 07:22:51 +02:00
ligatureSet; /* Array LigatureSet tables
* ordered by Coverage Index */
public:
DEFINE_SIZE_ARRAY (6, ligatureSet);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct LigatureSubst
{
2009-04-16 22:53:40 +02:00
friend struct SubstLookupSubTable;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.apply (c);
2009-04-16 22:53:40 +02:00
default:return false;
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!u.format.sanitize (c)) return false;
2009-08-04 06:58:28 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
2009-04-16 22:53:40 +02:00
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
2010-05-11 01:45:41 +02:00
LigatureSubstFormat1 format1;
2009-04-16 22:53:40 +02:00
} u;
};
2008-01-23 23:01:55 +01:00
2009-05-16 00:54:53 +02:00
2010-05-13 20:18:49 +02:00
static inline bool substitute_lookup (hb_apply_context_t *c, unsigned int lookup_index);
2009-05-09 01:09:17 +02:00
2009-05-20 05:42:30 +02:00
struct ContextSubst : Context
{
friend struct SubstLookupSubTable;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-08-28 23:14:33 +02:00
{
TRACE_APPLY ();
2010-05-13 20:18:49 +02:00
return Context::apply (c, substitute_lookup);
2009-08-28 23:14:33 +02:00
}
2009-05-17 13:52:11 +02:00
};
2009-05-06 06:12:29 +02:00
2009-05-20 05:42:30 +02:00
struct ChainContextSubst : ChainContext
{
friend struct SubstLookupSubTable;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-08-28 23:14:33 +02:00
{
TRACE_APPLY ();
2010-05-13 20:18:49 +02:00
return ChainContext::apply (c, substitute_lookup);
2009-08-28 23:14:33 +02:00
}
2009-05-17 01:59:15 +02:00
};
2009-04-16 19:40:13 +02:00
struct ExtensionSubst : Extension
2009-05-20 05:42:30 +02:00
{
2009-04-16 19:40:13 +02:00
friend struct SubstLookupSubTable;
friend struct SubstLookup;
2009-04-16 19:40:13 +02:00
private:
2009-08-04 06:58:28 +02:00
inline const struct SubstLookupSubTable& get_subtable (void) const
2010-04-22 22:51:42 +02:00
{
unsigned int offset = get_offset ();
if (unlikely (!offset)) return Null(SubstLookupSubTable);
return StructAtOffset<SubstLookupSubTable> (this, offset);
2010-04-22 22:51:42 +02:00
}
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const;
2009-08-04 06:58:28 +02:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c);
inline bool is_reverse (void) const;
2009-04-16 19:40:13 +02:00
};
2009-05-20 05:42:30 +02:00
struct ReverseChainSingleSubstFormat1
{
friend struct ReverseChainSingleSubst;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2010-05-13 20:18:49 +02:00
if (unlikely (c->context_length != NO_CONTEXT))
return false; /* No chaining to this type */
unsigned int index = (this+coverage) (c->buffer->info[c->buffer->in_pos].codepoint);
if (likely (index == NOT_COVERED))
return false;
const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
const ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
2010-05-13 20:18:49 +02:00
if (match_backtrack (c,
2010-05-11 00:20:54 +02:00
backtrack.len, (USHORT *) backtrack.array,
2010-05-10 23:47:22 +02:00
match_coverage, this) &&
2010-05-13 20:18:49 +02:00
match_lookahead (c,
2010-05-11 00:20:54 +02:00
lookahead.len, (USHORT *) lookahead.array,
2010-05-10 23:47:22 +02:00
match_coverage, this,
1))
{
c->buffer->info[c->buffer->in_pos].codepoint = substitute[index];
2010-05-13 20:18:49 +02:00
c->buffer->in_pos--; /* Reverse! */
return true;
}
return false;
}
2008-01-23 23:01:55 +01:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!(coverage.sanitize (c, this)
&& backtrack.sanitize (c, this)))
2009-08-04 06:58:28 +02:00
return false;
OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
2010-05-13 20:18:49 +02:00
if (!lookahead.sanitize (c, this))
2009-08-04 06:58:28 +02:00
return false;
ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
2010-05-13 20:18:49 +02:00
return substitute.sanitize (c);
2009-08-04 06:58:28 +02:00
}
2008-01-23 23:01:55 +01:00
private:
2009-05-18 02:13:02 +02:00
USHORT format; /* Format identifier--format = 1 */
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of table */
OffsetArrayOf<Coverage>
backtrack; /* Array of coverage tables
2008-01-23 23:01:55 +01:00
* in backtracking sequence, in glyph
* sequence order */
OffsetArrayOf<Coverage>
lookaheadX; /* Array of coverage tables
* in lookahead sequence, in glyph
2008-01-23 23:01:55 +01:00
* sequence order */
ArrayOf<GlyphID>
substituteX; /* Array of substitute
* GlyphIDs--ordered by Coverage Index */
public:
2010-05-10 23:28:16 +02:00
DEFINE_SIZE_MIN (10);
2008-01-23 23:01:55 +01:00
};
2009-05-20 05:42:30 +02:00
struct ReverseChainSingleSubst
{
friend struct SubstLookupSubTable;
private:
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.apply (c);
default:return false;
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (!u.format.sanitize (c)) return false;
2009-08-04 06:58:28 +02:00
switch (u.format) {
2010-05-13 20:18:49 +02:00
case 1: return u.format1.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
2010-05-11 01:45:41 +02:00
ReverseChainSingleSubstFormat1 format1;
} u;
};
2009-04-16 01:50:16 +02:00
/*
* SubstLookup
*/
2009-05-20 05:42:30 +02:00
struct SubstLookupSubTable
{
2009-04-16 01:50:16 +02:00
friend struct SubstLookup;
enum {
Single = 1,
Multiple = 2,
Alternate = 3,
Ligature = 4,
Context = 5,
ChainContext = 6,
Extension = 7,
2009-08-18 22:41:59 +02:00
ReverseChainSingle = 8
};
2010-05-13 20:18:49 +02:00
inline bool apply (hb_apply_context_t *c, unsigned int lookup_type) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
switch (lookup_type) {
2010-05-13 20:18:49 +02:00
case Single: return u.single.apply (c);
case Multiple: return u.multiple.apply (c);
case Alternate: return u.alternate.apply (c);
case Ligature: return u.ligature.apply (c);
case Context: return u.c.apply (c);
case ChainContext: return u.chainContext.apply (c);
case Extension: return u.extension.apply (c);
case ReverseChainSingle: return u.reverseChainContextSingle.apply (c);
default:return false;
}
2009-04-16 01:50:16 +02:00
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c, unsigned int lookup_type) {
TRACE_SANITIZE ();
switch (lookup_type) {
2010-05-13 20:18:49 +02:00
case Single: return u.single.sanitize (c);
case Multiple: return u.multiple.sanitize (c);
case Alternate: return u.alternate.sanitize (c);
case Ligature: return u.ligature.sanitize (c);
case Context: return u.c.sanitize (c);
case ChainContext: return u.chainContext.sanitize (c);
case Extension: return u.extension.sanitize (c);
case ReverseChainSingle: return u.reverseChainContextSingle.sanitize (c);
2009-08-04 06:58:28 +02:00
default:return true;
}
}
2009-04-16 01:50:16 +02:00
private:
union {
USHORT sub_format;
2010-05-11 01:45:41 +02:00
SingleSubst single;
MultipleSubst multiple;
AlternateSubst alternate;
LigatureSubst ligature;
2010-05-13 20:18:49 +02:00
ContextSubst c;
2010-05-11 01:45:41 +02:00
ChainContextSubst chainContext;
ExtensionSubst extension;
ReverseChainSingleSubst reverseChainContextSingle;
2009-04-16 01:50:16 +02:00
} u;
2010-05-11 00:08:46 +02:00
public:
DEFINE_SIZE_UNION (2, sub_format);
2009-04-16 01:50:16 +02:00
};
2009-04-16 19:40:13 +02:00
2009-05-20 05:42:30 +02:00
struct SubstLookup : Lookup
{
inline const SubstLookupSubTable& get_subtable (unsigned int i) const
{ return this+CastR<OffsetArrayOf<SubstLookupSubTable> > (subTable)[i]; }
2009-04-16 01:50:16 +02:00
inline static bool lookup_type_is_reverse (unsigned int lookup_type)
{ return lookup_type == SubstLookupSubTable::ReverseChainSingle; }
inline bool is_reverse (void) const
2009-05-20 05:42:30 +02:00
{
2009-04-16 01:50:16 +02:00
unsigned int type = get_type ();
if (unlikely (type == SubstLookupSubTable::Extension))
return CastR<ExtensionSubst> (get_subtable(0)).is_reverse ();
return lookup_type_is_reverse (type);
2009-04-16 01:50:16 +02:00
}
2010-05-05 07:01:05 +02:00
inline bool apply_once (hb_ot_layout_context_t *layout,
hb_buffer_t *buffer,
unsigned int context_length,
2010-05-05 07:30:48 +02:00
unsigned int nesting_level_left) const
2009-05-20 05:42:30 +02:00
{
2009-04-16 01:50:16 +02:00
unsigned int lookup_type = get_type ();
2010-05-13 20:18:49 +02:00
hb_apply_context_t c[1] = {{0}};
2009-05-22 23:58:09 +02:00
2010-05-13 20:18:49 +02:00
c->layout = layout;
c->buffer = buffer;
c->context_length = context_length;
c->nesting_level_left = nesting_level_left;
c->lookup_flag = get_flag ();
if (!_hb_ot_layout_check_glyph_property (c->layout->face, &c->buffer->info[c->buffer->in_pos], c->lookup_flag, &c->property))
2009-05-22 23:58:09 +02:00
return false;
2009-04-16 01:50:16 +02:00
if (unlikely (lookup_type == SubstLookupSubTable::Extension))
{
/* The spec says all subtables should have the same type.
* This is specially important if one has a reverse type!
*
* This is rather slow to do this here for every glyph,
* but it's easiest, and who uses extension lookups anyway?!*/
unsigned int count = get_subtable_count ();
2010-05-11 01:45:41 +02:00
unsigned int type = get_subtable(0).u.extension.get_type ();
for (unsigned int i = 1; i < count; i++)
2010-05-11 01:45:41 +02:00
if (get_subtable(i).u.extension.get_type () != type)
return false;
}
2009-08-04 08:27:37 +02:00
unsigned int count = get_subtable_count ();
for (unsigned int i = 0; i < count; i++)
2010-05-13 20:18:49 +02:00
if (get_subtable (i).apply (c, lookup_type))
2009-04-16 01:50:16 +02:00
return true;
2009-11-02 20:35:51 +01:00
2009-04-16 01:50:16 +02:00
return false;
}
2010-05-05 07:01:05 +02:00
inline bool apply_string (hb_ot_layout_context_t *layout,
hb_buffer_t *buffer,
hb_mask_t mask) const
2009-05-20 05:42:30 +02:00
{
bool ret = false;
if (unlikely (!buffer->in_length))
2009-05-17 15:45:32 +02:00
return false;
if (likely (!is_reverse ()))
2009-05-20 05:42:30 +02:00
{
/* in/out forward substitution */
2010-05-13 05:43:00 +02:00
buffer->clear_output ();
buffer->in_pos = 0;
2009-05-20 05:42:30 +02:00
while (buffer->in_pos < buffer->in_length)
{
if ((~buffer->info[buffer->in_pos].mask & mask) &&
2010-05-05 07:30:48 +02:00
apply_once (layout, buffer, NO_CONTEXT, MAX_NESTING_LEVEL))
ret = true;
else
2010-05-13 05:43:00 +02:00
buffer->next_glyph ();
}
if (ret)
2010-05-13 05:34:52 +02:00
buffer->swap ();
2009-05-20 05:42:30 +02:00
}
else
{
/* in-place backward substitution */
buffer->in_pos = buffer->in_length - 1;
2009-05-20 05:42:30 +02:00
do
{
if ((~buffer->info[buffer->in_pos].mask & mask) &&
2010-05-05 07:30:48 +02:00
apply_once (layout, buffer, NO_CONTEXT, MAX_NESTING_LEVEL))
ret = true;
else
buffer->in_pos--;
2009-05-20 05:42:30 +02:00
}
while ((int) buffer->in_pos >= 0);
}
return ret;
}
2009-08-04 08:27:37 +02:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (unlikely (!Lookup::sanitize (c))) return false;
OffsetArrayOf<SubstLookupSubTable> &list = CastR<OffsetArrayOf<SubstLookupSubTable> > (subTable);
2010-05-13 20:18:49 +02:00
return list.sanitize (c, this, get_type ());
2009-08-04 08:27:37 +02:00
}
2009-04-16 01:50:16 +02:00
};
2009-08-04 08:27:37 +02:00
typedef OffsetListOf<SubstLookup> SubstLookupList;
2009-05-16 00:54:53 +02:00
2008-01-24 00:02:28 +01:00
/*
* GSUB
*/
2009-05-20 05:42:30 +02:00
struct GSUB : GSUBGPOS
{
2009-08-05 02:27:05 +02:00
static const hb_tag_t Tag = HB_OT_TAG_GSUB;
2008-01-24 00:02:28 +01:00
2009-05-20 05:42:30 +02:00
inline const SubstLookup& get_lookup (unsigned int i) const
{ return CastR<SubstLookup> (GSUBGPOS::get_lookup (i)); }
2009-04-16 01:50:16 +02:00
2010-05-05 07:01:05 +02:00
inline bool substitute_lookup (hb_ot_layout_context_t *layout,
hb_buffer_t *buffer,
unsigned int lookup_index,
hb_mask_t mask) const
2010-05-05 07:01:05 +02:00
{ return get_lookup (lookup_index).apply_string (layout, buffer, mask); }
2009-04-16 01:50:16 +02:00
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (unlikely (!GSUBGPOS::sanitize (c))) return false;
OffsetTo<SubstLookupList> &list = CastR<OffsetTo<SubstLookupList> > (lookupList);
2010-05-13 20:18:49 +02:00
return list.sanitize (c, this);
2009-08-04 08:27:37 +02:00
}
public:
DEFINE_SIZE_STATIC (10);
2008-01-24 00:02:28 +01:00
};
2009-05-16 00:54:53 +02:00
2009-05-18 03:06:08 +02:00
/* Out-of-class implementation for methods recursing */
2009-05-16 00:54:53 +02:00
2010-05-13 20:18:49 +02:00
inline bool ExtensionSubst::apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2010-05-13 20:18:49 +02:00
return get_subtable ().apply (c, get_type ());
2009-08-04 06:58:28 +02:00
}
2010-05-13 20:18:49 +02:00
inline bool ExtensionSubst::sanitize (hb_sanitize_context_t *c)
2009-08-04 06:58:28 +02:00
{
TRACE_SANITIZE ();
2010-05-13 20:18:49 +02:00
if (unlikely (!Extension::sanitize (c))) return false;
2010-04-22 22:51:42 +02:00
unsigned int offset = get_offset ();
if (unlikely (!offset)) return true;
2010-05-13 20:18:49 +02:00
return StructAtOffset<SubstLookupSubTable> (this, offset).sanitize (c, get_type ());
2009-05-16 00:54:53 +02:00
}
inline bool ExtensionSubst::is_reverse (void) const
{
unsigned int type = get_type ();
if (unlikely (type == SubstLookupSubTable::Extension))
return CastR<ExtensionSubst> (get_subtable()).is_reverse ();
return SubstLookup::lookup_type_is_reverse (type);
}
2010-05-13 20:18:49 +02:00
static inline bool substitute_lookup (hb_apply_context_t *c, unsigned int lookup_index)
2009-05-20 05:42:30 +02:00
{
2010-05-13 20:18:49 +02:00
const GSUB &gsub = *(c->layout->face->ot_layout.gsub);
2009-05-17 13:52:11 +02:00
const SubstLookup &l = gsub.get_lookup (lookup_index);
2009-05-16 00:54:53 +02:00
2010-05-13 20:18:49 +02:00
if (unlikely (c->nesting_level_left == 0))
return false;
2010-05-13 20:18:49 +02:00
if (unlikely (c->context_length < 1))
return false;
2010-05-13 20:18:49 +02:00
return l.apply_once (c->layout, c->buffer, c->context_length, c->nesting_level_left - 1);
2009-05-16 00:54:53 +02:00
}
#endif /* HB_OT_LAYOUT_GSUB_PRIVATE_HH */