harfbuzz/src/hb-ot-layout-gsubgpos-priva...

908 lines
26 KiB
C++
Raw Normal View History

/*
* Copyright (C) 2007,2008,2009 Red Hat, Inc.
*
* 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_GSUBGPOS_PRIVATE_HH
#define HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH
2009-05-25 09:39:11 +02:00
#include "hb-buffer-private.h"
#include "hb-ot-layout-gdef-private.hh"
2009-05-19 00:22:44 +02:00
#define APPLY_ARG_DEF \
2009-08-02 23:41:36 +02:00
hb_ot_layout_context_t *context, \
hb_buffer_t *buffer, \
unsigned int context_length HB_GNUC_UNUSED, \
unsigned int nesting_level_left HB_GNUC_UNUSED, \
unsigned int lookup_flag, \
unsigned int property HB_GNUC_UNUSED /* propety of first glyph */
2009-05-19 00:22:44 +02:00
#define APPLY_ARG \
2009-08-02 23:41:36 +02:00
context, \
buffer, \
context_length, \
nesting_level_left, \
lookup_flag, \
property
typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, char *data);
2009-05-19 00:22:44 +02:00
typedef bool (*apply_lookup_func_t) (APPLY_ARG_DEF, unsigned int lookup_index);
2009-05-20 05:58:54 +02:00
struct ContextFuncs
{
match_func_t match;
apply_lookup_func_t apply;
};
2009-05-20 05:58:54 +02:00
static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, char *data)
{
return glyph_id == value;
}
2009-05-20 05:58:54 +02:00
static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, char *data)
{
2009-08-04 17:38:50 +02:00
const ClassDef &class_def = *reinterpret_cast<const ClassDef *>(data);
return class_def.get_class (glyph_id) == value;
}
2009-05-20 05:58:54 +02:00
static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, char *data)
{
const OffsetTo<Coverage> &coverage = (const OffsetTo<Coverage>&)value;
return (data+coverage) (glyph_id) != NOT_COVERED;
}
2009-05-19 00:22:44 +02:00
static inline bool match_input (APPLY_ARG_DEF,
unsigned int count, /* Including the first glyph (not matched) */
const USHORT input[], /* Array of input values--start with second glyph */
match_func_t match_func,
char *match_data,
unsigned int *context_length_out)
{
unsigned int i, j;
2009-05-18 10:09:05 +02:00
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:58:54 +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, NULL))
2009-05-20 05:58:54 +02:00
{
2009-05-18 10:09:05 +02:00
if (HB_UNLIKELY (j + count - i == end))
return false;
j++;
}
if (HB_LIKELY (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
return false;
}
*context_length_out = j - buffer->in_pos;
return true;
}
2009-05-19 00:22:44 +02:00
static inline bool match_backtrack (APPLY_ARG_DEF,
2009-05-18 09:47:31 +02:00
unsigned int count,
const USHORT backtrack[],
match_func_t match_func,
char *match_data)
{
2009-05-18 10:09:05 +02:00
if (HB_UNLIKELY (buffer->out_pos < count))
return false;
2009-05-18 09:47:31 +02:00
2009-05-20 05:58:54 +02:00
for (unsigned int i = 0, j = buffer->out_pos - 1; i < count; i++, j--)
{
while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
2009-05-20 05:58:54 +02:00
{
2009-05-18 09:47:31 +02:00
if (HB_UNLIKELY (j + 1 == count - i))
return false;
j--;
}
if (HB_LIKELY (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
2009-05-18 09:47:31 +02:00
return false;
}
return true;
}
2009-05-19 00:22:44 +02:00
static inline bool match_lookahead (APPLY_ARG_DEF,
unsigned int count,
const USHORT lookahead[],
match_func_t match_func,
char *match_data,
unsigned int offset)
{
unsigned int i, j;
2009-05-18 10:09:05 +02:00
unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
if (HB_UNLIKELY (buffer->in_pos + offset + count > end))
return false;
2009-05-20 05:58:54 +02:00
for (i = 0, j = buffer->in_pos + offset; i < count; i++, j++)
{
while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
2009-05-20 05:58:54 +02:00
{
2009-05-18 10:09:05 +02:00
if (HB_UNLIKELY (j + count - i == end))
return false;
j++;
}
if (HB_LIKELY (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
return false;
}
return true;
}
2009-05-20 05:58:54 +02:00
struct LookupRecord
{
2009-08-04 08:09:34 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 08:09:34 +02:00
return SANITIZE_SELF ();
}
USHORT sequenceIndex; /* Index into current glyph
* sequence--first glyph = 0 */
USHORT lookupListIndex; /* Lookup to apply to that
* position--zero--based */
};
ASSERT_SIZE (LookupRecord, 4);
2009-05-19 00:22:44 +02:00
static inline bool apply_lookup (APPLY_ARG_DEF,
2009-05-18 09:47:31 +02:00
unsigned int count, /* Including the first glyph */
unsigned int lookupCount,
const LookupRecord lookupRecord[], /* Array of LookupRecords--in design order */
apply_lookup_func_t apply_func)
{
unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
if (HB_UNLIKELY (buffer->in_pos + count > end))
return false;
2009-05-18 10:09:05 +02:00
/* TODO We don't support lookupRecord arrays that are not increasing:
* Should be easy for in_place ones at least. */
2009-05-20 05:58:54 +02:00
for (unsigned int i = 0; i < count; i++)
{
while (_hb_ot_layout_skip_mark (context->face, IN_CURINFO (), lookup_flag, NULL))
2009-05-20 05:58:54 +02:00
{
if (HB_UNLIKELY (buffer->in_pos == end))
return true;
/* No lookup applied for this index */
_hb_buffer_next_glyph (buffer);
}
2009-05-18 10:17:47 +02:00
if (lookupCount && i == lookupRecord->sequenceIndex)
{
unsigned int old_pos = buffer->in_pos;
/* Apply a lookup */
2009-05-19 00:22:44 +02:00
bool done = apply_func (APPLY_ARG, lookupRecord->lookupListIndex);
2009-05-18 10:17:47 +02:00
lookupRecord++;
lookupCount--;
i += buffer->in_pos - old_pos;
if (HB_UNLIKELY (buffer->in_pos == end))
return true;
if (!done)
goto not_applied;
}
else
{
not_applied:
/* No lookup applied for this index */
_hb_buffer_next_glyph (buffer);
i++;
}
}
return true;
}
/* Contextual lookups */
2009-05-20 05:58:54 +02:00
struct ContextLookupContext
{
ContextFuncs funcs;
char *match_data;
};
2009-05-19 00:22:44 +02:00
static inline bool context_lookup (APPLY_ARG_DEF,
2009-05-18 09:47:31 +02:00
unsigned int inputCount, /* Including the first glyph (not matched) */
const USHORT input[], /* Array of input values--start with second glyph */
2009-05-18 09:47:31 +02:00
unsigned int lookupCount,
const LookupRecord lookupRecord[],
2009-07-30 00:37:57 +02:00
ContextLookupContext &lookup_context)
{
2009-05-19 00:22:44 +02:00
return match_input (APPLY_ARG,
inputCount, input,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.match, lookup_context.match_data,
&context_length) &&
2009-05-19 00:22:44 +02:00
apply_lookup (APPLY_ARG,
inputCount,
lookupCount, lookupRecord,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.apply);
}
2009-05-20 05:58:54 +02:00
struct Rule
{
friend struct RuleSet;
private:
2009-07-30 00:37:57 +02:00
inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
2009-05-20 05:58:54 +02:00
{
2009-08-04 17:38:50 +02:00
const LookupRecord *lookupRecord = &CONST_CAST (LookupRecord, input, sizeof (input[0]) * (inputCount ? inputCount - 1 : 0));
2009-05-19 00:22:44 +02:00
return context_lookup (APPLY_ARG,
inputCount, input,
lookupCount, lookupRecord,
2009-07-30 00:37:57 +02:00
lookup_context);
}
2009-08-04 06:58:28 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE_SELF ()) return false;
return SANITIZE_MEM (input,
sizeof (input[0]) * inputCount +
sizeof (lookupRecordX[0]) * lookupCount);
}
private:
USHORT inputCount; /* Total number of glyphs in input
* glyph sequence--includes the first
* glyph */
USHORT lookupCount; /* Number of LookupRecords */
USHORT input[]; /* Array of match inputs--start with
* second glyph */
LookupRecord lookupRecordX[]; /* Array of LookupRecords--in
* design order */
};
ASSERT_SIZE (Rule, 4);
2009-05-20 05:58:54 +02:00
struct RuleSet
{
2009-07-30 00:37:57 +02:00
inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
2009-05-20 05:58:54 +02:00
{
unsigned int num_rules = rule.len;
2009-05-20 05:58:54 +02:00
for (unsigned int i = 0; i < num_rules; i++)
{
2009-07-30 00:37:57 +02:00
if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
return true;
}
return false;
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS (rule);
}
private:
OffsetArrayOf<Rule>
rule; /* Array of Rule tables
* ordered by preference */
};
2009-05-20 05:58:54 +02:00
struct ContextFormat1
{
friend struct Context;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
unsigned int index = (this+coverage) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
const RuleSet &rule_set = this+ruleSet[index];
2009-07-30 00:37:57 +02:00
struct ContextLookupContext lookup_context = {
{match_glyph, apply_func},
NULL
};
2009-07-30 00:37:57 +02:00
return rule_set.apply (APPLY_ARG, lookup_context);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, ruleSet);
}
private:
USHORT format; /* Format identifier--format = 1 */
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of table */
OffsetArrayOf<RuleSet>
ruleSet; /* Array of RuleSet tables
* ordered by Coverage Index */
};
ASSERT_SIZE (ContextFormat1, 6);
2009-05-20 05:58:54 +02:00
struct ContextFormat2
{
friend struct Context;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
unsigned int index = (this+coverage) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
const ClassDef &class_def = this+classDef;
index = class_def (IN_CURGLYPH ());
const RuleSet &rule_set = this+ruleSet[index];
/* LONGTERMTODO: Old code fetches glyph classes at most once and caches
* them across subrule lookups. Not sure it's worth it.
*/
2009-07-30 00:37:57 +02:00
struct ContextLookupContext lookup_context = {
{match_class, apply_func},
2009-08-04 17:38:50 +02:00
DECONST_CHARP(&class_def)
};
2009-07-30 00:37:57 +02:00
return rule_set.apply (APPLY_ARG, lookup_context);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 08:09:34 +02:00
return SANITIZE_THIS3 (coverage, classDef, ruleSet);
2009-08-04 06:58:28 +02:00
}
private:
USHORT format; /* Format identifier--format = 2 */
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of table */
OffsetTo<ClassDef>
classDef; /* Offset to glyph ClassDef table--from
* beginning of table */
OffsetArrayOf<RuleSet>
ruleSet; /* Array of RuleSet tables
* ordered by class */
};
ASSERT_SIZE (ContextFormat2, 8);
2009-05-20 05:58:54 +02:00
struct ContextFormat3
{
friend struct Context;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
unsigned int index = (this+coverage[0]) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-08-04 17:38:50 +02:00
const LookupRecord *lookupRecord = &CONST_CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
2009-07-30 00:37:57 +02:00
struct ContextLookupContext lookup_context = {
{match_coverage, apply_func},
2009-08-04 17:38:50 +02:00
DECONST_CHARP(this)
};
2009-05-19 00:22:44 +02:00
return context_lookup (APPLY_ARG,
glyphCount, (const USHORT *) (coverage + 1),
lookupCount, lookupRecord,
2009-07-30 00:37:57 +02:00
lookup_context);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE_SELF ()) return false;
unsigned int count = glyphCount;
for (unsigned int i = 0; i < count; i++)
if (!SANITIZE_THIS (coverage[i])) return false;
2009-08-04 17:38:50 +02:00
LookupRecord *lookupRecord = &CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
2009-08-04 06:58:28 +02:00
return SANITIZE_MEM (lookupRecord, sizeof (lookupRecord[0]) * lookupCount);
}
private:
USHORT format; /* Format identifier--format = 3 */
USHORT glyphCount; /* Number of glyphs in the input glyph
* sequence */
USHORT lookupCount; /* Number of LookupRecords */
OffsetTo<Coverage>
coverage[]; /* Array of offsets to Coverage
* table in glyph sequence order */
LookupRecord lookupRecordX[]; /* Array of LookupRecords--in
* design order */
};
ASSERT_SIZE (ContextFormat3, 6);
2009-05-20 05:58:54 +02:00
struct Context
{
protected:
2009-05-20 05:58:54 +02:00
bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG, apply_func);
case 2: return u.format2->apply (APPLY_ARG, apply_func);
case 3: return u.format3->apply (APPLY_ARG, apply_func);
default:return false;
}
}
bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
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);
case 3: return u.format3->sanitize (SANITIZE_ARG);
default:return true;
}
}
private:
union {
2009-05-18 01:47:54 +02:00
USHORT format; /* Format identifier */
ContextFormat1 format1[];
ContextFormat2 format2[];
ContextFormat3 format3[];
} u;
};
2009-05-18 01:47:54 +02:00
ASSERT_SIZE (Context, 2);
/* Chaining Contextual lookups */
2009-05-20 05:58:54 +02:00
struct ChainContextLookupContext
{
ContextFuncs funcs;
char *match_data[3];
};
2009-05-19 00:22:44 +02:00
static inline bool chain_context_lookup (APPLY_ARG_DEF,
2009-05-18 09:47:31 +02:00
unsigned int backtrackCount,
const USHORT backtrack[],
2009-05-18 09:47:31 +02:00
unsigned int inputCount, /* Including the first glyph (not matched) */
const USHORT input[], /* Array of input values--start with second glyph */
2009-05-18 09:47:31 +02:00
unsigned int lookaheadCount,
const USHORT lookahead[],
2009-05-18 09:47:31 +02:00
unsigned int lookupCount,
const LookupRecord lookupRecord[],
2009-07-30 00:37:57 +02:00
ChainContextLookupContext &lookup_context)
{
2009-05-18 09:47:31 +02:00
/* First guess */
if (HB_UNLIKELY (buffer->out_pos < backtrackCount ||
buffer->in_pos + inputCount + lookaheadCount > buffer->in_length ||
inputCount + lookaheadCount > context_length))
2009-05-18 09:47:31 +02:00
return false;
unsigned int offset;
2009-05-19 00:22:44 +02:00
return match_backtrack (APPLY_ARG,
2009-05-18 09:47:31 +02:00
backtrackCount, backtrack,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.match, lookup_context.match_data[0]) &&
2009-05-19 00:22:44 +02:00
match_input (APPLY_ARG,
inputCount, input,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.match, lookup_context.match_data[1],
&offset) &&
2009-05-19 00:22:44 +02:00
match_lookahead (APPLY_ARG,
lookaheadCount, lookahead,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.match, lookup_context.match_data[2],
offset) &&
(context_length = offset, true) &&
2009-05-19 00:22:44 +02:00
apply_lookup (APPLY_ARG,
inputCount,
lookupCount, lookupRecord,
2009-07-30 00:37:57 +02:00
lookup_context.funcs.apply);
}
2009-05-20 05:58:54 +02:00
struct ChainRule
{
friend struct ChainRuleSet;
private:
2009-07-30 00:37:57 +02:00
inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
2009-05-20 05:58:54 +02:00
{
2009-08-04 17:38:50 +02:00
const HeadlessArrayOf<USHORT> &input = CONST_CAST (HeadlessArrayOf<USHORT>, backtrack, backtrack.get_size ());
const ArrayOf<USHORT> &lookahead = CONST_CAST (ArrayOf<USHORT>, input, input.get_size ());
const ArrayOf<LookupRecord> &lookup = CONST_CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
2009-05-19 00:22:44 +02:00
return chain_context_lookup (APPLY_ARG,
backtrack.len, backtrack.array,
input.len, input.array + 1,
lookahead.len, lookahead.array,
lookup.len, lookup.array,
2009-07-30 00:37:57 +02:00
lookup_context);
return false;
}
2009-08-04 06:58:28 +02:00
public:
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE (backtrack)) return false;
2009-08-04 17:38:50 +02:00
HeadlessArrayOf<USHORT> &input = CAST (HeadlessArrayOf<USHORT>, backtrack, backtrack.get_size ());
2009-08-04 06:58:28 +02:00
if (!SANITIZE (input)) return false;
2009-08-04 17:38:50 +02:00
ArrayOf<USHORT> &lookahead = CAST (ArrayOf<USHORT>, input, input.get_size ());
2009-08-04 06:58:28 +02:00
if (!SANITIZE (lookahead)) return false;
2009-08-04 17:38:50 +02:00
ArrayOf<LookupRecord> &lookup = CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
2009-08-04 06:58:28 +02:00
return SANITIZE (lookup);
}
private:
2009-05-18 07:49:57 +02:00
ArrayOf<USHORT>
backtrack; /* Array of backtracking values
* (to be matched before the input
* sequence) */
2009-05-18 08:03:58 +02:00
HeadlessArrayOf<USHORT>
inputX; /* Array of input values (start with
* second glyph) */
2009-05-18 07:49:57 +02:00
ArrayOf<USHORT>
lookaheadX; /* Array of lookahead values's (to be
* matched after the input sequence) */
2009-05-18 07:49:57 +02:00
ArrayOf<LookupRecord>
lookupX; /* Array of LookupRecords--in
* design order) */
};
ASSERT_SIZE (ChainRule, 8);
2009-05-20 05:58:54 +02:00
struct ChainRuleSet
{
2009-07-30 00:37:57 +02:00
inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
2009-05-20 05:58:54 +02:00
{
unsigned int num_rules = rule.len;
2009-05-20 05:58:54 +02:00
for (unsigned int i = 0; i < num_rules; i++)
{
2009-07-30 00:37:57 +02:00
if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
return true;
}
return false;
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS (rule);
}
private:
OffsetArrayOf<ChainRule>
rule; /* Array of ChainRule tables
* ordered by preference */
};
ASSERT_SIZE (ChainRuleSet, 2);
2009-05-20 05:58:54 +02:00
struct ChainContextFormat1
{
friend struct ChainContext;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
unsigned int index = (this+coverage) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
const ChainRuleSet &rule_set = this+ruleSet[index];
2009-07-30 00:37:57 +02:00
struct ChainContextLookupContext lookup_context = {
{match_glyph, apply_func},
{NULL, NULL, NULL}
};
2009-07-30 00:37:57 +02:00
return rule_set.apply (APPLY_ARG, lookup_context);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, ruleSet);
}
private:
USHORT format; /* Format identifier--format = 1 */
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of table */
OffsetArrayOf<ChainRuleSet>
ruleSet; /* Array of ChainRuleSet tables
* ordered by Coverage Index */
};
ASSERT_SIZE (ChainContextFormat1, 6);
2009-05-20 05:58:54 +02:00
struct ChainContextFormat2
{
friend struct ChainContext;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
unsigned int index = (this+coverage) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
const ClassDef &backtrack_class_def = this+backtrackClassDef;
const ClassDef &input_class_def = this+inputClassDef;
const ClassDef &lookahead_class_def = this+lookaheadClassDef;
index = input_class_def (IN_CURGLYPH ());
const ChainRuleSet &rule_set = this+ruleSet[index];
/* LONGTERMTODO: Old code fetches glyph classes at most once and caches
* them across subrule lookups. Not sure it's worth it.
*/
2009-07-30 00:37:57 +02:00
struct ChainContextLookupContext lookup_context = {
{match_class, apply_func},
2009-08-04 17:38:50 +02:00
{DECONST_CHARP(&backtrack_class_def),
DECONST_CHARP(&input_class_def),
DECONST_CHARP(&lookahead_class_def)}
};
2009-07-30 00:37:57 +02:00
return rule_set.apply (APPLY_ARG, lookup_context);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_THIS2 (coverage, backtrackClassDef) &&
SANITIZE_THIS2 (inputClassDef, lookaheadClassDef) &&
SANITIZE_THIS (ruleSet);
}
private:
USHORT format; /* Format identifier--format = 2 */
OffsetTo<Coverage>
coverage; /* Offset to Coverage table--from
* beginning of table */
OffsetTo<ClassDef>
backtrackClassDef; /* Offset to glyph ClassDef table
* containing backtrack sequence
* data--from beginning of table */
OffsetTo<ClassDef>
inputClassDef; /* Offset to glyph ClassDef
* table containing input sequence
* data--from beginning of table */
OffsetTo<ClassDef>
lookaheadClassDef; /* Offset to glyph ClassDef table
* containing lookahead sequence
* data--from beginning of table */
OffsetArrayOf<ChainRuleSet>
ruleSet; /* Array of ChainRuleSet tables
* ordered by class */
};
ASSERT_SIZE (ChainContextFormat2, 12);
2009-05-20 05:58:54 +02:00
struct ChainContextFormat3
{
friend struct ChainContext;
private:
2009-05-20 05:58:54 +02:00
inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
2009-08-04 17:38:50 +02:00
const OffsetArrayOf<Coverage> &input = CONST_CAST (OffsetArrayOf<Coverage>, backtrack, backtrack.get_size ());
unsigned int index = (this+input[0]) (IN_CURGLYPH ());
2009-05-18 11:29:29 +02:00
if (HB_LIKELY (index == NOT_COVERED))
return false;
2009-08-04 17:38:50 +02:00
const OffsetArrayOf<Coverage> &lookahead = CONST_CAST (OffsetArrayOf<Coverage>, input, input.get_size ());
const ArrayOf<LookupRecord> &lookup = CONST_CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
2009-07-30 00:37:57 +02:00
struct ChainContextLookupContext lookup_context = {
{match_coverage, apply_func},
2009-08-04 17:38:50 +02:00
{DECONST_CHARP(this), DECONST_CHARP(this), DECONST_CHARP(this)}
};
2009-05-19 00:22:44 +02:00
return chain_context_lookup (APPLY_ARG,
backtrack.len, (USHORT *) backtrack.array,
input.len, (USHORT *) input.array,
lookahead.len, (USHORT *) lookahead.array,
lookup.len, lookup.array,
2009-07-30 00:37:57 +02:00
lookup_context);
return false;
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
if (!SANITIZE_THIS (backtrack)) return false;
2009-08-04 17:38:50 +02:00
OffsetArrayOf<Coverage> &input = CAST (OffsetArrayOf<Coverage>, backtrack, backtrack.get_size ());
2009-08-04 06:58:28 +02:00
if (!SANITIZE_THIS (input)) return false;
2009-08-04 17:38:50 +02:00
OffsetArrayOf<Coverage> &lookahead = CAST (OffsetArrayOf<Coverage>, input, input.get_size ());
2009-08-04 06:58:28 +02:00
if (!SANITIZE_THIS (lookahead)) return false;
2009-08-04 17:38:50 +02:00
ArrayOf<LookupRecord> &lookup = CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
2009-08-04 06:58:28 +02:00
return SANITIZE (lookup);
}
private:
USHORT format; /* Format identifier--format = 3 */
2009-05-18 07:49:57 +02:00
OffsetArrayOf<Coverage>
backtrack; /* Array of coverage tables
* in backtracking sequence, in glyph
* sequence order */
2009-05-18 07:49:57 +02:00
OffsetArrayOf<Coverage>
inputX ; /* Array of coverage
* tables in input sequence, in glyph
* sequence order */
2009-05-18 07:49:57 +02:00
OffsetArrayOf<Coverage>
lookaheadX; /* Array of coverage tables
* in lookahead sequence, in glyph
* sequence order */
2009-05-18 07:49:57 +02:00
ArrayOf<LookupRecord>
lookupX; /* Array of LookupRecords--in
2009-05-18 07:49:57 +02:00
* design order) */
};
ASSERT_SIZE (ChainContextFormat3, 10);
2009-05-20 05:58:54 +02:00
struct ChainContext
{
protected:
2009-05-20 05:58:54 +02:00
bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
{
switch (u.format) {
2009-05-19 00:22:44 +02:00
case 1: return u.format1->apply (APPLY_ARG, apply_func);
case 2: return u.format2->apply (APPLY_ARG, apply_func);
case 3: return u.format3->apply (APPLY_ARG, apply_func);
default:return false;
}
}
bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
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);
case 3: return u.format3->sanitize (SANITIZE_ARG);
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
ChainContextFormat1 format1[];
ChainContextFormat2 format2[];
ChainContextFormat3 format3[];
} u;
};
ASSERT_SIZE (ChainContext, 2);
struct ExtensionFormat1
{
friend struct Extension;
2009-08-04 20:27:56 +02:00
protected:
inline unsigned int get_type (void) const { return extensionLookupType; }
inline unsigned int get_offset (void) const { return (extensionOffset[0] << 16) + extensionOffset[1]; }
inline const LookupSubTable& get_subtable (void) const
{
unsigned int offset = get_offset ();
if (HB_UNLIKELY (!offset)) return Null(LookupSubTable);
2009-08-04 17:38:50 +02:00
return CONST_CAST (LookupSubTable, *this, offset);
}
2009-08-04 06:58:28 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 06:58:28 +02:00
return SANITIZE_SELF ();
}
private:
USHORT format; /* Format identifier. Set to 1. */
USHORT extensionLookupType; /* Lookup type of subtable referenced
* by ExtensionOffset (i.e. the
* extension subtable). */
USHORT extensionOffset[2]; /* Offset to the extension subtable,
* of lookup type subtable.
* Defined as two shorts to avoid
* alignment requirements. */
};
ASSERT_SIZE (ExtensionFormat1, 8);
struct Extension
{
inline unsigned int get_type (void) const
{
switch (u.format) {
case 1: return u.format1->get_type ();
default:return 0;
}
}
inline const LookupSubTable& get_subtable (void) const
{
switch (u.format) {
case 1: return u.format1->get_subtable ();
default:return Null(LookupSubTable);
}
}
bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
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 */
ExtensionFormat1 format1[];
} u;
};
ASSERT_SIZE (Extension, 2);
2009-05-18 02:13:02 +02:00
/*
* GSUB/GPOS Common
*/
2009-05-20 05:58:54 +02:00
struct GSUBGPOS
{
2009-08-05 02:27:05 +02:00
static const hb_tag_t GSUBTag = HB_OT_TAG_GSUB;
static const hb_tag_t GPOSTag = HB_OT_TAG_GPOS;
2009-05-18 02:13:02 +02:00
2009-08-04 08:09:34 +02:00
STATIC_DEFINE_GET_FOR_DATA_CHECK_MAJOR_VERSION (GSUBGPOS, 1, 1);
2009-05-18 02:13:02 +02:00
inline unsigned int get_script_count (void) const
{ return (this+scriptList).len; }
inline const Tag& get_script_tag (unsigned int i) const
{ return (this+scriptList).get_tag (i); }
inline bool get_script_tags (unsigned int *script_count /* IN/OUT */,
hb_tag_t *script_tags /* OUT */) const
{ return (this+scriptList).get_tags (script_count, script_tags); }
inline const Script& get_script (unsigned int i) const
{ return (this+scriptList)[i]; }
inline bool find_script_index (hb_tag_t tag, unsigned int *index) const
{ return (this+scriptList).find_index (tag, index); }
inline unsigned int get_feature_count (void) const
{ return (this+featureList).len; }
inline const Tag& get_feature_tag (unsigned int i) const
{ return (this+featureList).get_tag (i); }
inline bool get_feature_tags (unsigned int *feature_count /* IN/OUT */,
hb_tag_t *feature_tags /* OUT */) const
{ return (this+featureList).get_tags (feature_count, feature_tags); }
inline const Feature& get_feature (unsigned int i) const
{ return (this+featureList)[i]; }
inline bool find_feature_index (hb_tag_t tag, unsigned int *index) const
{ return (this+featureList).find_index (tag, index); }
inline unsigned int get_lookup_count (void) const
{ return (this+lookupList).len; }
inline const Lookup& get_lookup (unsigned int i) const
{ return (this+lookupList)[i]; }
2009-05-18 02:13:02 +02:00
2009-08-04 20:33:23 +02:00
bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 08:09:34 +02:00
if (!SANITIZE (version)) return false;
if (version.major != 1) return true;
return SANITIZE_THIS3 (scriptList, featureList, lookupList);
}
2009-05-24 06:50:27 +02:00
protected:
2009-05-24 07:03:24 +02:00
FixedVersion version; /* Version of the GSUB/GPOS table--initially set
2009-05-18 02:13:02 +02:00
* to 0x00010000 */
OffsetTo<ScriptList>
scriptList; /* ScriptList table */
OffsetTo<FeatureList>
featureList; /* FeatureList table */
OffsetTo<LookupList>
lookupList; /* LookupList table */
};
ASSERT_SIZE (GSUBGPOS, 10);
#endif /* HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH */