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

1393 lines
39 KiB
C++
Raw Normal View History

2008-01-23 23:01:55 +01:00
/*
2011-04-21 23:14:28 +02:00
* Copyright © 2007,2008,2009,2010 Red Hat, Inc.
2012-04-24 04:26:13 +02:00
* Copyright © 2010,2012 Google, 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
* Google Author(s): Behdad Esfahbod
2008-01-23 23:01:55 +01:00
*/
#ifndef HB_OT_LAYOUT_GSUB_TABLE_HH
#define HB_OT_LAYOUT_GSUB_TABLE_HH
2008-01-23 23:01:55 +01:00
#include "hb-ot-layout-gsubgpos-private.hh"
2008-01-23 23:01:55 +01:00
2010-07-23 21:11:18 +02: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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
hb_codepoint_t glyph_id = iter.get_glyph ();
if (c->glyphs->has (glyph_id))
2012-04-24 05:03:12 +02:00
c->glyphs->add ((glyph_id + deltaGlyphID) & 0xFFFF);
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
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->cur().codepoint;
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_RETURN (false);
2009-04-16 04:56:15 +02:00
/* According to the Adobe Annotated OpenType Suite, result is always
* limited to 16bit. */
glyph_id = (glyph_id + deltaGlyphID) & 0xFFFF;
c->replace_glyph (glyph_id);
2009-04-16 04:56:15 +02:00
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
return TRACE_RETURN (coverage.sanitize (c, this) && deltaGlyphID.sanitize (c));
2009-08-04 06:58:28 +02:00
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
if (c->glyphs->has (iter.get_glyph ()))
2012-04-24 05:03:12 +02:00
c->glyphs->add (substitute[iter.get_coverage ()]);
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
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->cur().codepoint;
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_RETURN (false);
2012-05-11 02:33:11 +02:00
if (unlikely (index >= substitute.len)) return TRACE_RETURN (false);
glyph_id = substitute[index];
c->replace_glyph (glyph_id);
2009-05-20 05:42:30 +02:00
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
return TRACE_RETURN (coverage.sanitize (c, this) && substitute.sanitize (c));
2009-08-04 06:58:28 +02:00
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
switch (u.format) {
2012-04-24 05:03:12 +02:00
case 1: u.format1.closure (c); break;
case 2: u.format2.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (void) const
{
switch (u.format) {
case 1: return u.format1.get_coverage ();
case 2: return u.format2.get_coverage ();
default:return Null(Coverage);
}
}
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) {
2012-05-11 02:33:11 +02:00
case 1: return TRACE_RETURN (u.format1.apply (c));
case 2: return TRACE_RETURN (u.format2.apply (c));
default:return TRACE_RETURN (false);
2009-05-05 02:21:57 +02:00
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (!u.format.sanitize (c)) return TRACE_RETURN (false);
2009-08-04 06:58:28 +02:00
switch (u.format) {
case 1: return TRACE_RETURN (u.format1.sanitize (c));
case 2: return TRACE_RETURN (u.format2.sanitize (c));
default:return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
unsigned int count = substitute.len;
for (unsigned int i = 0; i < count; i++)
2012-04-24 05:03:12 +02:00
c->glyphs->add (substitute[i]);
}
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 ();
2012-05-11 02:33:11 +02:00
if (unlikely (!substitute.len)) return TRACE_RETURN (false);
2009-05-05 22:22:02 +02:00
unsigned int klass = c->property & HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE ? HB_OT_LAYOUT_GLYPH_CLASS_BASE_GLYPH : 0;
unsigned int count = substitute.len;
for (unsigned int i = 0; i < count; i++) {
set_lig_props_for_component (c->buffer->cur(), i);
c->output_glyph (substitute.array[i], klass);
}
c->buffer->skip_glyph ();
2009-05-05 22:22:02 +02:00
2012-05-11 02:33:11 +02:00
return TRACE_RETURN (true);
2009-05-05 22:22:02 +02: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 ();
return TRACE_RETURN (substitute.sanitize (c));
2009-08-04 06:58:28 +02:00
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
if (c->glyphs->has (iter.get_glyph ()))
2012-04-24 05:03:12 +02:00
(this+sequence[iter.get_coverage ()]).closure (c);
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
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->cur().codepoint);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_RETURN (false);
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
return TRACE_RETURN (coverage.sanitize (c, this) && sequence.sanitize (c, this));
2009-08-04 06:58:28 +02:00
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
switch (u.format) {
2012-04-24 05:03:12 +02:00
case 1: u.format1.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (void) const
{
switch (u.format) {
case 1: return u.format1.get_coverage ();
default:return Null(Coverage);
}
}
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) {
2012-05-11 02:33:11 +02:00
case 1: return TRACE_RETURN (u.format1.apply (c));
default:return TRACE_RETURN (false);
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (!u.format.sanitize (c)) return TRACE_RETURN (false);
2009-08-04 06:58:28 +02:00
switch (u.format) {
case 1: return TRACE_RETURN (u.format1.sanitize (c));
default:return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
if (c->glyphs->has (iter.get_glyph ())) {
const AlternateSet &alt_set = this+alternateSet[iter.get_coverage ()];
unsigned int count = alt_set.len;
for (unsigned int i = 0; i < count; i++)
2012-04-24 05:03:12 +02:00
c->glyphs->add (alt_set[i]);
}
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
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->cur().codepoint;
2009-04-16 20:19:42 +02:00
2009-05-17 06:22:37 +02:00
unsigned int index = (this+coverage) (glyph_id);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_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
2012-05-11 02:33:11 +02:00
if (unlikely (!alt_set.len)) return TRACE_RETURN (false);
2009-04-16 20:19:42 +02:00
hb_mask_t glyph_mask = c->buffer->cur().mask;
hb_mask_t lookup_mask = c->lookup_mask;
2010-05-21 17:43:17 +02:00
/* Note: This breaks badly if two features enabled this lookup together. */
unsigned int shift = _hb_ctz (lookup_mask);
2010-05-20 18:47:28 +02:00
unsigned int alt_index = ((lookup_mask & glyph_mask) >> shift);
2009-04-16 20:19:42 +02:00
2012-05-11 02:33:11 +02:00
if (unlikely (alt_index > alt_set.len || alt_index == 0)) return TRACE_RETURN (false);
2009-04-16 20:19:42 +02:00
2010-05-20 18:47:28 +02:00
glyph_id = alt_set[alt_index - 1];
2009-04-16 20:19:42 +02:00
c->replace_glyph (glyph_id);
2009-04-16 20:19:42 +02:00
2012-05-11 02:33:11 +02:00
return TRACE_RETURN (true);
2009-04-16 20:19:42 +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 ();
return TRACE_RETURN (coverage.sanitize (c, this) && alternateSet.sanitize (c, this));
2009-08-04 06:58:28 +02:00
}
protected:
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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
switch (u.format) {
2012-04-24 05:03:12 +02:00
case 1: u.format1.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (void) const
{
switch (u.format) {
case 1: return u.format1.get_coverage ();
default:return Null(Coverage);
}
}
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) {
2012-05-11 02:33:11 +02:00
case 1: return TRACE_RETURN (u.format1.apply (c));
default:return TRACE_RETURN (false);
2009-04-16 20:19:42 +02:00
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (!u.format.sanitize (c)) return TRACE_RETURN (false);
2009-08-04 06:58:28 +02:00
switch (u.format) {
case 1: return TRACE_RETURN (u.format1.sanitize (c));
default:return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
2009-04-16 20:19:42 +02:00
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
unsigned int count = component.len;
for (unsigned int i = 1; i < count; i++)
if (!c->glyphs->has (component[i]))
2012-04-24 05:03:12 +02:00
return;
c->glyphs->add (ligGlyph);
}
inline bool would_apply (hb_would_apply_context_t *c) const
{
return c->len == 1 || (c->len == 2 && component.len == 2 && component[1] == c->second);
}
inline bool apply (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
TRACE_APPLY ();
2009-05-18 08:03:58 +02:00
unsigned int count = component.len;
if (unlikely (count < 1)) return TRACE_RETURN (false);
2012-01-17 04:05:08 +01:00
hb_apply_context_t::mark_skipping_forward_iterator_t skippy_iter (c, c->buffer->idx, count - 1);
2012-05-11 02:33:11 +02:00
if (skippy_iter.has_no_chance ()) return TRACE_RETURN (false);
/*
* This is perhaps the trickiest part of GSUB... Remarks:
*
* - If all components of the ligature were marks, we call this a mark ligature.
*
* - If there is no GDEF, and the ligature is NOT a mark ligature, we categorize
* it as a ligature glyph. Though, really, this will not really be used...
*
* - If it *is* a mark ligature, we don't allocate a new ligature id, and leave
* the ligature to keep its old ligature id. This will allow it to attach to
* a base ligature in GPOS. Eg. if the sequence is: LAM,LAM,SHADDA,FATHA,HEH,
* and LAM,LAM,HEH for a ligature, they will leave SHADDA and FATHA wit a
* ligature id and component value of 2. Then if SHADDA,FATHA form a ligature
* later, we don't want them to lose their ligature id/component, otherwise
* GPOS will fail to correctly position the mark ligature on top of the
* LAM,LAM,HEH ligature. See:
* https://bugzilla.gnome.org/show_bug.cgi?id=676343
*
* - If a ligature is formed of components that some of which are also ligatures
* themselves, and those ligature components had marks attached to *their*
* components, we have to attach the marks to the new ligature component
* positions! Now *that*'s tricky! And these marks may be following the
* last component of the whole sequence, so we should loop forward looking
* for them and update them.
*
* Eg. the sequence is LAM,LAM,SHADDA,FATHA,HEH, and the font first forms a
2012-07-30 06:39:00 +02:00
* 'calt' ligature of LAM,HEH, leaving the SHADDA and FATHA with a ligature
* id and component == 1. Now, during 'liga', the LAM and the LAM-HEH ligature
* form a LAM-LAM-HEH ligature. We need to reassign the SHADDA and FATHA to
* the new ligature with a component value of 2.
*
* This in fact happened to a font... See:
* https://bugzilla.gnome.org/show_bug.cgi?id=437633
*
* - Ligatures cannot be formed across glyphs attached to different components
* of previous ligatures. Eg. the sequence is LAM,SHADDA,LAM,FATHA,HEH, and
* LAM,LAM,HEH form a ligature, leaving SHADDA,FATHA next to eachother.
* However, it would be wrong to ligate that SHADDA,FATHA sequence.
*/
bool is_mark_ligature = !!(c->property & HB_OT_LAYOUT_GLYPH_CLASS_MARK);
unsigned int total_component_count = 0;
total_component_count += get_lig_num_comps (c->buffer->cur());
unsigned int first_lig_id = get_lig_id (c->buffer->cur());
unsigned int first_lig_comp = get_lig_comp (c->buffer->cur());
2012-01-16 23:03:55 +01:00
for (unsigned int i = 1; i < count; i++)
2009-05-20 05:42:30 +02:00
{
unsigned int property;
2012-01-17 04:05:08 +01:00
2012-05-11 02:33:11 +02:00
if (!skippy_iter.next (&property)) return TRACE_RETURN (false);
2012-05-11 02:33:11 +02:00
if (likely (c->buffer->info[skippy_iter.idx].codepoint != component[i])) return TRACE_RETURN (false);
unsigned int this_lig_id = get_lig_id (c->buffer->info[skippy_iter.idx]);
unsigned int this_lig_comp = get_lig_comp (c->buffer->info[skippy_iter.idx]);
if (first_lig_id && first_lig_comp) {
/* If first component was attached to a previous ligature component,
* all subsequent components should be attached to the same ligature
* component, otherwise we shouldn't ligate them. */
if (first_lig_id != this_lig_id || first_lig_comp != this_lig_comp)
return TRACE_RETURN (false);
} else {
/* If first component was NOT attached to a previous ligature component,
* all subsequent components should also NOT be attached to any ligature
* component, otherwise we shouldn't ligate them. */
if (this_lig_id && this_lig_comp)
return TRACE_RETURN (false);
}
is_mark_ligature = is_mark_ligature && (property & HB_OT_LAYOUT_GLYPH_CLASS_MARK);
total_component_count += get_lig_num_comps (c->buffer->info[skippy_iter.idx]);
}
/* Deal, we are forming the ligature. */
c->buffer->merge_clusters (c->buffer->idx, skippy_iter.idx + 1);
unsigned int klass = is_mark_ligature ? 0 : HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE;
unsigned int lig_id = is_mark_ligature ? 0 : allocate_lig_id (c->buffer);
unsigned int last_lig_id = get_lig_id (c->buffer->cur());
unsigned int last_num_components = get_lig_num_comps (c->buffer->cur());
unsigned int components_so_far = last_num_components;
if (!is_mark_ligature)
set_lig_props_for_ligature (c->buffer->cur(), lig_id, total_component_count);
c->replace_glyph (ligGlyph, klass);
for (unsigned int i = 1; i < count; i++)
{
while (c->should_mark_skip_current_glyph ())
{
if (!is_mark_ligature) {
unsigned int new_lig_comp = components_so_far - last_num_components +
MIN (MAX (get_lig_comp (c->buffer->cur()), 1), last_num_components);
set_lig_props_for_mark (c->buffer->cur(), lig_id, new_lig_comp);
}
c->buffer->next_glyph ();
}
last_lig_id = get_lig_id (c->buffer->cur());
last_num_components = get_lig_num_comps (c->buffer->cur());
components_so_far += last_num_components;
/* Skip the base glyph */
c->buffer->idx++;
}
if (!is_mark_ligature && last_lig_id) {
/* Re-adjust components for any marks following. */
for (unsigned int i = c->buffer->idx; i < c->buffer->len; i++) {
if (last_lig_id == get_lig_id (c->buffer->info[i])) {
unsigned int new_lig_comp = components_so_far - last_num_components +
MIN (MAX (get_lig_comp (c->buffer->info[i]), 1), last_num_components);
set_lig_props_for_mark (c->buffer->info[i], lig_id, new_lig_comp);
} else
break;
}
}
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
return TRACE_RETURN (ligGlyph.sanitize (c) && component.sanitize (c));
2009-08-04 06:58:28 +02:00
}
protected:
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
unsigned int num_ligs = ligature.len;
for (unsigned int i = 0; i < num_ligs; i++)
2012-04-24 05:03:12 +02:00
(this+ligature[i]).closure (c);
}
inline bool would_apply (hb_would_apply_context_t *c) const
{
unsigned int num_ligs = ligature.len;
for (unsigned int i = 0; i < num_ligs; i++)
{
const Ligature &lig = this+ligature[i];
if (lig.would_apply (c))
return true;
}
return false;
}
inline bool apply (hb_apply_context_t *c) 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];
2012-05-11 02:33:11 +02:00
if (lig.apply (c)) return TRACE_RETURN (true);
}
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
return TRACE_RETURN (ligature.sanitize (c, this));
2009-08-04 06:58:28 +02:00
}
protected:
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
if (c->glyphs->has (iter.get_glyph ()))
2012-04-24 05:03:12 +02:00
(this+ligatureSet[iter.get_coverage ()]).closure (c);
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
inline bool would_apply (hb_would_apply_context_t *c) const
{
2012-07-29 00:34:58 +02:00
return (this+ligatureSet[(this+coverage) (c->first)]).would_apply (c);
}
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->cur().codepoint;
2009-04-16 22:53:40 +02:00
2009-05-17 07:22:51 +02:00
unsigned int index = (this+coverage) (glyph_id);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_RETURN (false);
2009-05-17 07:22:51 +02:00
const LigatureSet &lig_set = this+ligatureSet[index];
2012-05-11 02:33:11 +02:00
return TRACE_RETURN (lig_set.apply (c));
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 ();
return TRACE_RETURN (coverage.sanitize (c, this) && ligatureSet.sanitize (c, this));
2009-08-04 06:58:28 +02:00
}
protected:
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
switch (u.format) {
2012-04-24 05:03:12 +02:00
case 1: u.format1.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (void) const
{
switch (u.format) {
case 1: return u.format1.get_coverage ();
default:return Null(Coverage);
}
}
inline bool would_apply (hb_would_apply_context_t *c) const
{
switch (u.format) {
case 1: return u.format1.would_apply (c);
default:return false;
}
}
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) {
2012-05-11 02:33:11 +02:00
case 1: return TRACE_RETURN (u.format1.apply (c));
default:return TRACE_RETURN (false);
2009-04-16 22:53:40 +02:00
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (!u.format.sanitize (c)) return TRACE_RETURN (false);
2009-08-04 06:58:28 +02:00
switch (u.format) {
case 1: return TRACE_RETURN (u.format1.sanitize (c));
default:return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
2009-04-16 22:53:40 +02:00
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
2010-05-13 20:18:49 +02:00
static inline bool substitute_lookup (hb_apply_context_t *c, unsigned int lookup_index);
2012-04-24 05:03:12 +02:00
static inline void closure_lookup (hb_closure_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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
return Context::closure (c, closure_lookup);
}
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 ();
2012-05-11 02:33:11 +02:00
return TRACE_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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
return ChainContext::closure (c, closure_lookup);
}
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 ();
2012-05-11 02:33:11 +02:00
return TRACE_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
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const;
inline const Coverage &get_coverage (void) const;
inline bool would_apply (hb_would_apply_context_t *c) const;
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
unsigned int count;
count = backtrack.len;
for (unsigned int i = 0; i < count; i++)
if (!(this+backtrack[i]).intersects (c->glyphs))
2012-04-24 05:03:12 +02:00
return;
count = lookahead.len;
for (unsigned int i = 0; i < count; i++)
if (!(this+lookahead[i]).intersects (c->glyphs))
2012-04-24 05:03:12 +02:00
return;
const ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
Coverage::Iter iter;
for (iter.init (this+coverage); iter.more (); iter.next ()) {
if (c->glyphs->has (iter.get_glyph ()))
2012-04-24 05:03:12 +02:00
c->glyphs->add (substitute[iter.get_coverage ()]);
}
}
inline const Coverage &get_coverage (void) const
{
return this+coverage;
}
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 (c->nesting_level_left != MAX_NESTING_LEVEL))
return TRACE_RETURN (false); /* No chaining to this type */
unsigned int index = (this+coverage) (c->buffer->cur().codepoint);
2012-05-11 02:33:11 +02:00
if (likely (index == NOT_COVERED)) return TRACE_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->cur().codepoint = substitute[index];
2011-07-22 17:28:07 +02:00
c->buffer->idx--; /* Reverse! */
2012-05-11 02:33:11 +02:00
return TRACE_RETURN (true);
}
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
if (!(coverage.sanitize (c, this) && backtrack.sanitize (c, this)))
return TRACE_RETURN (false);
OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
2010-05-13 20:18:49 +02:00
if (!lookahead.sanitize (c, this))
return TRACE_RETURN (false);
ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
return TRACE_RETURN (substitute.sanitize (c));
2009-08-04 06:58:28 +02:00
}
protected:
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:
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
TRACE_CLOSURE ();
switch (u.format) {
2012-04-24 05:03:12 +02:00
case 1: u.format1.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (void) const
{
switch (u.format) {
case 1: return u.format1.get_coverage ();
default:return Null(Coverage);
}
}
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) {
2012-05-11 02:33:11 +02:00
case 1: return TRACE_RETURN (u.format1.apply (c));
default:return TRACE_RETURN (false);
}
}
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (!u.format.sanitize (c)) return TRACE_RETURN (false);
2009-08-04 06:58:28 +02:00
switch (u.format) {
case 1: return TRACE_RETURN (u.format1.sanitize (c));
default:return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
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 Type {
Single = 1,
Multiple = 2,
Alternate = 3,
Ligature = 4,
Context = 5,
ChainContext = 6,
Extension = 7,
2009-08-18 22:41:59 +02:00
ReverseChainSingle = 8
};
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c,
unsigned int lookup_type) const
{
TRACE_CLOSURE ();
switch (lookup_type) {
2012-04-24 05:03:12 +02:00
case Single: u.single.closure (c); break;
case Multiple: u.multiple.closure (c); break;
case Alternate: u.alternate.closure (c); break;
case Ligature: u.ligature.closure (c); break;
case Context: u.context.closure (c); break;
2012-04-24 05:03:12 +02:00
case ChainContext: u.chainContext.closure (c); break;
case Extension: u.extension.closure (c); break;
case ReverseChainSingle: u.reverseChainContextSingle.closure (c); break;
default: break;
}
}
inline const Coverage &get_coverage (unsigned int lookup_type) const
2012-06-09 09:02:36 +02:00
{
switch (lookup_type) {
case Single: return u.single.get_coverage ();
case Multiple: return u.multiple.get_coverage ();
case Alternate: return u.alternate.get_coverage ();
case Ligature: return u.ligature.get_coverage ();
case Context: return u.context.get_coverage ();
case ChainContext: return u.chainContext.get_coverage ();
case Extension: return u.extension.get_coverage ();
case ReverseChainSingle: return u.reverseChainContextSingle.get_coverage ();
default: return Null(Coverage);
}
2012-06-09 09:02:36 +02:00
}
inline bool would_apply (hb_would_apply_context_t *c,
unsigned int lookup_type) const
{
TRACE_WOULD_APPLY ();
2012-07-29 00:34:58 +02:00
if (get_coverage (lookup_type).get_coverage (c->first) == NOT_COVERED) return false;
if (c->len == 1) return true; /* Done! */
/* Only need to look further for lookups that support substitutions
* of input longer than 1. */
switch (lookup_type) {
case Ligature: return u.ligature.would_apply (c);
case Context: return u.context.would_apply (c);
case ChainContext: return u.chainContext.would_apply (c);
case Extension: return u.extension.would_apply (c);
default: return false;
}
}
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) {
2012-05-11 02:33:11 +02:00
case Single: return TRACE_RETURN (u.single.apply (c));
case Multiple: return TRACE_RETURN (u.multiple.apply (c));
case Alternate: return TRACE_RETURN (u.alternate.apply (c));
case Ligature: return TRACE_RETURN (u.ligature.apply (c));
case Context: return TRACE_RETURN (u.context.apply (c));
2012-05-11 02:33:11 +02:00
case ChainContext: return TRACE_RETURN (u.chainContext.apply (c));
case Extension: return TRACE_RETURN (u.extension.apply (c));
case ReverseChainSingle: return TRACE_RETURN (u.reverseChainContextSingle.apply (c));
default: return TRACE_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 ();
if (!u.header.sub_format.sanitize (c))
2012-06-09 09:02:36 +02:00
return TRACE_RETURN (false);
switch (lookup_type) {
case Single: return TRACE_RETURN (u.single.sanitize (c));
case Multiple: return TRACE_RETURN (u.multiple.sanitize (c));
case Alternate: return TRACE_RETURN (u.alternate.sanitize (c));
case Ligature: return TRACE_RETURN (u.ligature.sanitize (c));
case Context: return TRACE_RETURN (u.context.sanitize (c));
case ChainContext: return TRACE_RETURN (u.chainContext.sanitize (c));
case Extension: return TRACE_RETURN (u.extension.sanitize (c));
case ReverseChainSingle: return TRACE_RETURN (u.reverseChainContextSingle.sanitize (c));
default: return TRACE_RETURN (true);
2009-08-04 06:58:28 +02:00
}
}
protected:
2009-04-16 01:50:16 +02:00
union {
struct {
USHORT sub_format;
} header;
2010-05-11 01:45:41 +02:00
SingleSubst single;
MultipleSubst multiple;
AlternateSubst alternate;
LigatureSubst ligature;
ContextSubst context;
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, header.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
}
2012-04-24 05:03:12 +02:00
inline void closure (hb_closure_context_t *c) const
{
unsigned int lookup_type = get_type ();
unsigned int count = get_subtable_count ();
for (unsigned int i = 0; i < count; i++)
2012-04-24 05:03:12 +02:00
get_subtable (i).closure (c, lookup_type);
}
2009-04-16 01:50:16 +02:00
inline const Coverage *get_coverage (void) const
{
/* Only return non-NULL if there's just one Coverage table we care about. */
const Coverage *c = &get_subtable (0).get_coverage (get_type ());
unsigned int count = get_subtable_count ();
for (unsigned int i = 1; i < count; i++)
if (c != &get_subtable (i).get_coverage (get_type ()))
return NULL;
return c;
}
inline bool would_apply (hb_would_apply_context_t *c) const
{
unsigned int lookup_type = get_type ();
unsigned int count = get_subtable_count ();
for (unsigned int i = 0; i < count; i++)
if (get_subtable (i).would_apply (c, lookup_type))
return true;
return false;
}
inline bool apply_once (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
2009-04-16 01:50:16 +02:00
unsigned int lookup_type = get_type ();
if (!_hb_ot_layout_check_glyph_property (c->face, &c->buffer->cur(), c->lookup_props, &c->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++)
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;
}
2012-04-23 19:17:09 +02:00
inline bool apply_string (hb_apply_context_t *c) const
2009-05-20 05:42:30 +02:00
{
bool ret = false;
2012-04-23 19:17:09 +02:00
if (unlikely (!c->buffer->len))
2009-05-17 15:45:32 +02:00
return false;
2012-04-23 19:17:09 +02:00
c->set_lookup (*this);
if (likely (!is_reverse ()))
2009-05-20 05:42:30 +02:00
{
/* in/out forward substitution */
2012-04-23 19:17:09 +02:00
c->buffer->clear_output ();
c->buffer->idx = 0;
/* Fast path for lookups with one coverage only (which is most). */
const Coverage *coverage = get_coverage ();
if (coverage)
while (c->buffer->idx < c->buffer->len)
{
if ((c->buffer->cur().mask & c->lookup_mask) &&
2012-07-29 00:03:20 +02:00
coverage->get_coverage (c->buffer->cur().codepoint) != NOT_COVERED &&
apply_once (c))
ret = true;
else
c->buffer->next_glyph ();
}
else
while (c->buffer->idx < c->buffer->len)
{
if ((c->buffer->cur().mask & c->lookup_mask) && apply_once (c))
ret = true;
else
c->buffer->next_glyph ();
}
if (ret)
2012-04-23 19:17:09 +02:00
c->buffer->swap_buffers ();
2009-05-20 05:42:30 +02:00
}
else
{
/* in-place backward substitution */
2012-04-23 19:17:09 +02:00
c->buffer->idx = c->buffer->len - 1;
2009-05-20 05:42:30 +02:00
do
{
if ((c->buffer->cur().mask & c->lookup_mask) && apply_once (c))
ret = true;
else
2012-04-23 19:17:09 +02:00
c->buffer->idx--;
2009-05-20 05:42:30 +02:00
}
2012-04-23 19:17:09 +02:00
while ((int) c->buffer->idx >= 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 ();
if (unlikely (!Lookup::sanitize (c))) return TRACE_RETURN (false);
OffsetArrayOf<SubstLookupSubTable> &list = CastR<OffsetArrayOf<SubstLookupSubTable> > (subTable);
2012-07-29 00:53:01 +02:00
if (unlikely (!list.sanitize (c, this, get_type ()))) return TRACE_RETURN (false);
if (unlikely (get_type () == SubstLookupSubTable::Extension))
{
/* The spec says all subtables of an Extension lookup should
* have the same type. This is specially important if one has
* a reverse type!
*
* We just check that they are all either forward, or reverse. */
unsigned int type = get_subtable (0).u.extension.get_type ();
unsigned int count = get_subtable_count ();
for (unsigned int i = 1; i < count; i++)
if (get_subtable (i).u.extension.get_type () != type)
return TRACE_RETURN (false);
}
return TRACE_RETURN (true);
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
/*
2011-08-17 14:43:45 +02:00
* GSUB -- The Glyph Substitution Table
2008-01-24 00:02:28 +01:00
*/
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
inline bool would_substitute_lookup (hb_would_apply_context_t *c, unsigned int lookup_index) const
{ return get_lookup (lookup_index).would_apply (c); }
2012-04-23 19:17:09 +02:00
inline bool substitute_lookup (hb_apply_context_t *c, unsigned int lookup_index) const
{ return get_lookup (lookup_index).apply_string (c); }
2009-04-16 01:50:16 +02:00
static inline void substitute_start (hb_buffer_t *buffer);
static inline void substitute_finish (hb_buffer_t *buffer);
2012-04-24 05:03:12 +02:00
inline void closure_lookup (hb_closure_context_t *c,
unsigned int lookup_index) const
{ return get_lookup (lookup_index).closure (c); }
2010-05-13 20:18:49 +02:00
inline bool sanitize (hb_sanitize_context_t *c) {
TRACE_SANITIZE ();
if (unlikely (!GSUBGPOS::sanitize (c))) return TRACE_RETURN (false);
OffsetTo<SubstLookupList> &list = CastR<OffsetTo<SubstLookupList> > (lookupList);
return TRACE_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
void
GSUB::substitute_start (hb_buffer_t *buffer)
{
2011-07-28 22:48:43 +02:00
HB_BUFFER_ALLOCATE_VAR (buffer, props_cache);
HB_BUFFER_ALLOCATE_VAR (buffer, lig_props);
HB_BUFFER_ALLOCATE_VAR (buffer, syllable);
2011-07-28 22:48:43 +02:00
unsigned int count = buffer->len;
for (unsigned int i = 0; i < count; i++)
buffer->info[i].props_cache() = buffer->info[i].lig_props() = buffer->info[i].syllable() = 0;
}
void
2012-05-13 16:20:10 +02:00
GSUB::substitute_finish (hb_buffer_t *buffer HB_UNUSED)
{
}
2009-05-18 03:06:08 +02:00
/* Out-of-class implementation for methods recursing */
2009-05-16 00:54:53 +02:00
2012-04-24 05:03:12 +02:00
inline void ExtensionSubst::closure (hb_closure_context_t *c) const
{
2012-04-24 05:03:12 +02:00
get_subtable ().closure (c, get_type ());
}
inline const Coverage & ExtensionSubst::get_coverage (void) const
{
return get_subtable ().get_coverage (get_type ());
}
inline bool ExtensionSubst::would_apply (hb_would_apply_context_t *c) const
{
return get_subtable ().would_apply (c, get_type ());
}
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 ();
2012-05-11 02:33:11 +02:00
return TRACE_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 ();
if (unlikely (!Extension::sanitize (c))) return TRACE_RETURN (false);
2010-04-22 22:51:42 +02:00
unsigned int offset = get_offset ();
if (unlikely (!offset)) return TRACE_RETURN (true);
return TRACE_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);
}
2012-04-24 05:03:12 +02:00
static inline void closure_lookup (hb_closure_context_t *c, unsigned int lookup_index)
{
const GSUB &gsub = *(hb_ot_layout_from_face (c->face)->gsub);
const SubstLookup &l = gsub.get_lookup (lookup_index);
if (unlikely (c->nesting_level_left == 0))
2012-04-24 05:03:12 +02:00
return;
c->nesting_level_left--;
2012-04-24 05:03:12 +02:00
l.closure (c);
c->nesting_level_left++;
}
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
{
const GSUB &gsub = *(hb_ot_layout_from_face (c->face)->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;
2012-04-23 19:17:09 +02:00
hb_apply_context_t new_c (*c);
new_c.nesting_level_left--;
new_c.set_lookup (l);
return l.apply_once (&new_c);
2009-05-16 00:54:53 +02:00
}
2010-07-23 21:11:18 +02:00
#endif /* HB_OT_LAYOUT_GSUB_TABLE_HH */