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

910 lines
23 KiB
C++
Raw Normal View History

2008-01-23 23:01:55 +01:00
/*
* Copyright (C) 2007,2008,2009 Red Hat, Inc.
2008-01-23 23:01:55 +01:00
*
* This is part of HarfBuzz, an OpenType Layout engine 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.
*
* 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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-20 05:42:30 +02:00
hb_codepoint_t glyph_id = IN_CURGLYPH ();
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
2009-04-16 04:56:15 +02:00
return false;
glyph_id += deltaGlyphID;
2009-05-20 05:42:30 +02:00
_hb_buffer_replace_glyph (buffer, glyph_id);
/* We inherit the old glyph class to the substituted glyph */
if (_hb_ot_layout_has_new_glyph_classes (context->face))
_hb_ot_layout_set_glyph_property (context->face, glyph_id, property);
2009-04-16 04:56:15 +02:00
return true;
}
2009-04-16 04:56:15 +02:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS (coverage) && SANITIZE (deltaGlyphID);
}
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 */
};
ASSERT_SIZE (SingleSubstFormat1, 6);
2009-05-20 05:42:30 +02:00
struct SingleSubstFormat2
{
friend struct SingleSubst;
private:
2009-08-04 06:58:28 +02:00
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-20 05:42:30 +02:00
hb_codepoint_t glyph_id = IN_CURGLYPH ();
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-05-18 11:29:29 +02:00
if (HB_UNLIKELY (index >= substitute.len))
return false;
glyph_id = substitute[index];
2009-05-20 05:42:30 +02:00
_hb_buffer_replace_glyph (buffer, glyph_id);
/* We inherit the old glyph class to the substituted glyph */
if (_hb_ot_layout_has_new_glyph_classes (context->face))
_hb_ot_layout_set_glyph_property (context->face, glyph_id, property);
2009-05-20 05:42:30 +02:00
return true;
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS (coverage) && SANITIZE (substitute);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (SingleSubstFormat2, 6);
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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2009-05-20 05:42:30 +02:00
case 1: return u.format1->apply (APPLY_ARG);
case 2: return u.format2->apply (APPLY_ARG);
2009-05-05 02:21:57 +02:00
default:return false;
}
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case 1: return u.format1->sanitize (SANITIZE_ARG);
case 2: return u.format2->sanitize (SANITIZE_ARG);
default:return true;
}
}
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
SingleSubstFormat1 format1[VAR];
SingleSubstFormat2 format2[VAR];
} 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:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-17 07:22:51 +02:00
if (HB_UNLIKELY (!substitute.len))
2009-05-05 22:22:02 +02:00
return false;
_hb_buffer_add_output_glyphs_be16 (buffer, 1,
substitute.len, (const uint16_t *) substitute.const_array(),
0xFFFF, 0xFFFF);
2009-05-05 22:22:02 +02:00
/* This is a guess only ... */
if (_hb_ot_layout_has_new_glyph_classes (context->face))
2009-05-05 22:22:02 +02:00
{
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++)
_hb_ot_layout_set_glyph_property (context->face, substitute[n], property);
2009-05-05 22:22:02 +02:00
}
return true;
}
2009-08-04 06:58:28 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE (substitute);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (Sequence, 2);
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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-17 07:22:51 +02:00
unsigned int index = (this+coverage) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-05-19 00:22:44 +02:00
return (this+sequence[index]).apply (APPLY_ARG);
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, sequence);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (MultipleSubstFormat1, 6);
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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG);
default:return false;
}
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case 1: return u.format1->sanitize (SANITIZE_ARG);
default:return true;
}
}
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
MultipleSubstFormat1 format1[VAR];
} 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 */
ASSERT_SIZE (AlternateSet, 2);
2008-01-23 23:01:55 +01:00
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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-04-16 22:53:40 +02:00
hb_codepoint_t glyph_id = IN_CURGLYPH ();
2009-04-16 20:19:42 +02:00
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2009-05-18 11:29:29 +02:00
if (HB_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
2009-05-17 07:22:51 +02:00
if (HB_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
if (context->face->altfunc)
alt_index = (context->face->altfunc)(context->layout, buffer,
2009-05-18 10:25:22 +02:00
buffer->out_pos, glyph_id,
alt_set.len, alt_set.array);
2009-04-16 20:19:42 +02:00
*/
2009-05-17 07:22:51 +02:00
if (HB_UNLIKELY (alt_index >= alt_set.len))
2009-04-16 20:19:42 +02:00
return false;
glyph_id = alt_set[alt_index];
2009-05-17 12:03:42 +02:00
_hb_buffer_replace_glyph (buffer, glyph_id);
2009-04-16 20:19:42 +02:00
/* We inherit the old glyph class to the substituted glyph */
if (_hb_ot_layout_has_new_glyph_classes (context->face))
_hb_ot_layout_set_glyph_property (context->face, glyph_id, property);
2009-04-16 20:19:42 +02:00
return true;
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, alternateSet);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (AlternateSubstFormat1, 6);
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
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG);
2009-04-16 20:19:42 +02:00
default:return false;
}
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case 1: return u.format1->sanitize (SANITIZE_ARG);
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 */
AlternateSubstFormat1 format1[VAR];
2009-04-16 20:19:42 +02:00
} u;
};
2009-05-20 05:42:30 +02:00
struct Ligature
{
friend struct LigatureSet;
private:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF, bool is_mark) const
{
TRACE_APPLY ();
unsigned int i, j;
2009-05-18 08:03:58 +02:00
unsigned int count = component.len;
unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
if (HB_UNLIKELY (buffer->in_pos + count > end))
return false;
2009-05-20 05:42:30 +02:00
for (i = 1, j = buffer->in_pos + 1; i < count; i++, j++)
{
while (_hb_ot_layout_skip_mark (context->face, IN_INFO (j), lookup_flag, &property))
2009-05-20 05:42:30 +02:00
{
if (HB_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 (HB_LIKELY (IN_GLYPH (j) != component[i]))
return false;
}
/* This is just a guess ... */
if (_hb_ot_layout_has_new_glyph_classes (context->face))
_hb_ot_layout_set_glyph_class (context->face, ligGlyph,
2009-08-02 23:41:36 +02:00
is_mark ? HB_OT_LAYOUT_GLYPH_CLASS_MARK
: HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE);
if (j == 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. */
_hb_buffer_add_output_glyphs_be16 (buffer, i,
1, (const uint16_t *) &ligGlyph,
0,
IN_LIGID (buffer->in_pos) && !IN_COMPONENT (buffer->in_pos) ?
0xFFFF : _hb_buffer_allocate_lig_id (buffer));
else
{
2009-05-25 10:04:24 +02:00
unsigned int lig_id = _hb_buffer_allocate_lig_id (buffer);
_hb_buffer_add_output_glyph (buffer, 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 (context->face, IN_CURINFO (), lookup_flag, NULL))
_hb_buffer_add_output_glyph (buffer, IN_CURGLYPH (), i, lig_id);
(buffer->in_pos)++;
}
}
return true;
}
2009-08-04 06:58:28 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE2 (ligGlyph, component);
}
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 */
};
ASSERT_SIZE (Ligature, 4);
2008-01-23 23:01:55 +01:00
2009-05-20 05:42:30 +02:00
struct LigatureSet
{
friend struct LigatureSubstFormat1;
private:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF, bool is_mark) const
{
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];
2009-05-19 00:22:44 +02:00
if (lig.apply (APPLY_ARG, is_mark))
return true;
}
return false;
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS (ligature);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (LigatureSet, 2);
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:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-04-16 22:53:40 +02:00
hb_codepoint_t glyph_id = IN_CURGLYPH ();
bool first_is_mark = !!(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);
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-05-17 07:22:51 +02:00
const LigatureSet &lig_set = this+ligatureSet[index];
2009-05-19 00:22:44 +02:00
return lig_set.apply (APPLY_ARG, first_is_mark);
2009-04-16 22:53:40 +02:00
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, ligatureSet);
}
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (LigatureSubstFormat1, 6);
2009-05-20 05:42:30 +02:00
struct LigatureSubst
{
2009-04-16 22:53:40 +02:00
friend struct SubstLookupSubTable;
private:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
2009-05-18 01:47:54 +02:00
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG);
2009-04-16 22:53:40 +02:00
default:return false;
}
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case 1: return u.format1->sanitize (SANITIZE_ARG);
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 */
LigatureSubstFormat1 format1[VAR];
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
2009-05-19 00:22:44 +02:00
static inline bool substitute_lookup (APPLY_ARG_DEF, 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:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
2009-08-28 23:14:33 +02:00
{
TRACE_APPLY ();
2009-08-28 23:14:33 +02:00
return Context::apply (APPLY_ARG, substitute_lookup);
}
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:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
2009-08-28 23:14:33 +02:00
{
TRACE_APPLY ();
2009-08-28 23:14:33 +02:00
return ChainContext::apply (APPLY_ARG, substitute_lookup);
}
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;
private:
2009-08-04 06:58:28 +02:00
inline const struct SubstLookupSubTable& get_subtable (void) const
2009-08-04 17:38:50 +02:00
{ return CONST_CAST (SubstLookupSubTable, Extension::get_subtable (), 0); }
2009-08-04 06:58:28 +02:00
inline bool apply (APPLY_ARG_DEF) const;
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF);
2009-04-16 19:40:13 +02:00
};
2009-05-20 05:42:30 +02:00
struct ReverseChainSingleSubstFormat1
{
friend struct ReverseChainSingleSubst;
private:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
if (HB_UNLIKELY (context_length != NO_CONTEXT))
return false; /* No chaining to this type */
unsigned int index = (this+coverage) (IN_CURGLYPH ());
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-08-10 04:10:39 +02:00
const OffsetArrayOf<Coverage> &lookahead = CONST_NEXT (OffsetArrayOf<Coverage>, backtrack);
const ArrayOf<GlyphID> &substitute = CONST_NEXT (ArrayOf<GlyphID>, lookahead);
2009-05-19 00:22:44 +02:00
if (match_backtrack (APPLY_ARG,
backtrack.len, (USHORT *) backtrack.const_array(),
2010-04-21 19:35:36 +02:00
match_coverage, ConstCharP(this)) &&
2009-05-19 00:22:44 +02:00
match_lookahead (APPLY_ARG,
lookahead.len, (USHORT *) lookahead.const_array(),
2010-04-21 19:35:36 +02:00
match_coverage, ConstCharP(this),
1))
{
IN_CURGLYPH () = substitute[index];
buffer->in_pos--; /* Reverse! */
return true;
}
return false;
}
2008-01-23 23:01:55 +01:00
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE_THIS2 (coverage, backtrack))
return false;
2009-08-10 04:10:39 +02:00
OffsetArrayOf<Coverage> &lookahead = NEXT (OffsetArrayOf<Coverage>, backtrack);
2009-08-04 06:58:28 +02:00
if (!SANITIZE_THIS (lookahead))
return false;
2009-08-10 04:10:39 +02:00
ArrayOf<GlyphID> &substitute = NEXT (ArrayOf<GlyphID>, lookahead);
2009-08-05 03:42:23 +02:00
return SANITIZE (substitute);
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 */
2008-01-23 23:01:55 +01:00
};
ASSERT_SIZE (ReverseChainSingleSubstFormat1, 10);
2009-05-20 05:42:30 +02:00
struct ReverseChainSingleSubst
{
friend struct SubstLookupSubTable;
private:
2009-05-20 05:42:30 +02:00
inline bool apply (APPLY_ARG_DEF) const
{
TRACE_APPLY ();
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG);
default:return false;
}
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case 1: return u.format1->sanitize (SANITIZE_ARG);
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
ReverseChainSingleSubstFormat1 format1[VAR];
} 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
};
inline bool apply (APPLY_ARG_DEF, unsigned int lookup_type) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
switch (lookup_type) {
case Single: return u.single->apply (APPLY_ARG);
case Multiple: return u.multiple->apply (APPLY_ARG);
case Alternate: return u.alternate->apply (APPLY_ARG);
case Ligature: return u.ligature->apply (APPLY_ARG);
case Context: return u.context->apply (APPLY_ARG);
case ChainContext: return u.chainContext->apply (APPLY_ARG);
case Extension: return u.extension->apply (APPLY_ARG);
case ReverseChainSingle: return u.reverseChainContextSingle->apply (APPLY_ARG);
default:return false;
}
2009-04-16 01:50:16 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (u.format)) return false;
switch (u.format) {
case Single: return u.single->sanitize (SANITIZE_ARG);
case Multiple: return u.multiple->sanitize (SANITIZE_ARG);
case Alternate: return u.alternate->sanitize (SANITIZE_ARG);
case Ligature: return u.ligature->sanitize (SANITIZE_ARG);
case Context: return u.context->sanitize (SANITIZE_ARG);
case ChainContext: return u.chainContext->sanitize (SANITIZE_ARG);
case Extension: return u.extension->sanitize (SANITIZE_ARG);
case ReverseChainSingle: return u.reverseChainContextSingle->sanitize (SANITIZE_ARG);
default:return true;
}
}
2009-04-16 01:50:16 +02:00
private:
union {
USHORT format;
SingleSubst single[VAR];
MultipleSubst multiple[VAR];
AlternateSubst alternate[VAR];
LigatureSubst ligature[VAR];
ContextSubst context[VAR];
ChainContextSubst chainContext[VAR];
ExtensionSubst extension[VAR];
ReverseChainSingleSubst reverseChainContextSingle[VAR];
2009-04-16 01:50:16 +02:00
} u;
};
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
2009-08-04 17:38:50 +02:00
{ return CONST_CAST (SubstLookupSubTable, Lookup::get_subtable (i), 0); }
2009-04-16 01:50:16 +02:00
/* Like get_type(), but looks through extension lookups.
* Never returns Extension */
2009-05-20 05:42:30 +02:00
inline unsigned int get_effective_type (void) const
{
2009-04-16 01:50:16 +02:00
unsigned int type = get_type ();
if (HB_UNLIKELY (type == SubstLookupSubTable::Extension))
2009-05-20 05:42:30 +02:00
{
unsigned int count = get_subtable_count ();
2009-05-18 02:13:02 +02:00
type = get_subtable(0).u.extension->get_type ();
/* The spec says all subtables should have the same type.
* This is specially important if one has a reverse type! */
for (unsigned int i = 1; i < count; i++)
if (get_subtable(i).u.extension->get_type () != type)
return 0;
2009-04-16 01:50:16 +02:00
}
return type;
}
2009-05-20 05:42:30 +02:00
inline bool is_reverse (void) const
2009-05-26 18:24:16 +02:00
{ return HB_UNLIKELY (get_effective_type () == SubstLookupSubTable::ReverseChainSingle); }
2009-04-16 01:50:16 +02:00
2009-08-02 23:41:36 +02:00
inline bool apply_once (hb_ot_layout_context_t *context,
2009-05-22 23:58:09 +02:00
hb_buffer_t *buffer,
unsigned int context_length,
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 ();
2009-04-16 04:56:15 +02:00
unsigned int lookup_flag = get_flag ();
2009-05-22 23:58:09 +02:00
unsigned int property;
if (!_hb_ot_layout_check_glyph_property (context->face, IN_CURINFO (), lookup_flag, &property))
2009-05-22 23:58:09 +02:00
return false;
2009-04-16 01:50:16 +02:00
2009-08-04 08:27:37 +02:00
unsigned int count = get_subtable_count ();
for (unsigned int i = 0; i < count; i++)
2009-08-28 23:14:33 +02:00
if (get_subtable (i).apply (APPLY_ARG_INIT, 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;
}
inline bool apply_string (hb_ot_layout_context_t *context,
hb_buffer_t *buffer,
hb_mask_t mask) const
2009-05-20 05:42:30 +02:00
{
bool ret = false;
2009-05-17 15:45:32 +02:00
if (HB_UNLIKELY (!buffer->in_length))
return false;
2009-05-20 05:42:30 +02:00
if (HB_LIKELY (!is_reverse ()))
{
/* in/out forward substitution */
_hb_buffer_clear_output (buffer);
buffer->in_pos = 0;
2009-05-20 05:42:30 +02:00
while (buffer->in_pos < buffer->in_length)
{
if ((~IN_MASK (buffer->in_pos) & mask) &&
2009-08-02 23:41:36 +02:00
apply_once (context, buffer, NO_CONTEXT, MAX_NESTING_LEVEL))
ret = true;
else
2009-05-17 12:03:42 +02:00
_hb_buffer_next_glyph (buffer);
}
if (ret)
_hb_buffer_swap (buffer);
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 ((~IN_MASK (buffer->in_pos) & mask) &&
2009-08-02 23:41:36 +02:00
apply_once (context, 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
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
if (!Lookup::sanitize (SANITIZE_ARG)) return false;
2009-08-04 08:27:37 +02:00
OffsetArrayOf<SubstLookupSubTable> &list = (OffsetArrayOf<SubstLookupSubTable> &) subTable;
return SANITIZE_THIS (list);
}
2009-04-16 01:50:16 +02:00
};
2009-08-04 08:27:37 +02:00
typedef OffsetListOf<SubstLookup> SubstLookupList;
ASSERT_SIZE (SubstLookupList, 2);
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
static inline const GSUB& get_for_data (const char *data)
2009-05-26 18:24:16 +02:00
{ return (const GSUB&) GSUBGPOS::get_for_data (data); }
2009-04-16 01:50:16 +02:00
2009-05-20 05:42:30 +02:00
inline const SubstLookup& get_lookup (unsigned int i) const
2009-05-26 18:24:16 +02:00
{ return (const SubstLookup&) GSUBGPOS::get_lookup (i); }
2009-04-16 01:50:16 +02:00
2009-08-02 23:41:36 +02:00
inline bool substitute_lookup (hb_ot_layout_context_t *context,
hb_buffer_t *buffer,
unsigned int lookup_index,
hb_mask_t mask) const
2009-08-02 23:41:36 +02:00
{ return get_lookup (lookup_index).apply_string (context, buffer, mask); }
2009-04-16 01:50:16 +02:00
2009-08-04 08:27:37 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
TRACE_SANITIZE ();
if (!GSUBGPOS::sanitize (SANITIZE_ARG)) return false;
2009-08-04 18:13:52 +02:00
OffsetTo<SubstLookupList> &list = CAST(OffsetTo<SubstLookupList>, lookupList, 0);
2009-08-04 08:27:37 +02:00
return SANITIZE_THIS (list);
}
2008-01-24 00:02:28 +01:00
};
2009-05-18 02:13:02 +02:00
ASSERT_SIZE (GSUB, 10);
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
inline bool ExtensionSubst::apply (APPLY_ARG_DEF) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
unsigned int lookup_type = get_type ();
if (HB_UNLIKELY (lookup_type == SubstLookupSubTable::Extension))
return false;
2009-08-04 06:58:28 +02:00
return get_subtable ().apply (APPLY_ARG, lookup_type);
}
inline bool ExtensionSubst::sanitize (SANITIZE_ARG_DEF)
{
TRACE_SANITIZE ();
2009-08-04 17:38:50 +02:00
return Extension::sanitize (SANITIZE_ARG) &&
2009-08-04 20:27:56 +02:00
(&(Extension::get_subtable ()) == &Null(LookupSubTable) ||
get_type () == SubstLookupSubTable::Extension ||
2009-08-04 20:27:56 +02:00
DECONST_CAST (SubstLookupSubTable, get_subtable (), 0).sanitize (SANITIZE_ARG));
2009-05-16 00:54:53 +02:00
}
2009-05-20 05:42:30 +02:00
static inline bool substitute_lookup (APPLY_ARG_DEF, unsigned int lookup_index)
{
const GSUB &gsub = *(context->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
if (HB_UNLIKELY (nesting_level_left == 0))
return false;
nesting_level_left--;
if (HB_UNLIKELY (context_length < 1))
return false;
2009-08-02 23:41:36 +02:00
return l.apply_once (context, buffer, context_length, nesting_level_left);
2009-05-16 00:54:53 +02:00
}
#endif /* HB_OT_LAYOUT_GSUB_PRIVATE_HH */