/*
- * Copyright (C) 2007,2008,2009 Red Hat, Inc.
+ * Copyright (C) 2007,2008,2009,2010 Red Hat, Inc.
*
- * This is part of HarfBuzz, an OpenType Layout engine library.
+ * This is part of HarfBuzz, a text shaping library.
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
#include "hb-ot-layout-gdef-private.hh"
-#define APPLY_ARG_DEF \
- 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 */
-#define APPLY_ARG \
- context, \
- buffer, \
- context_length, \
- nesting_level_left, \
- lookup_flag, \
- property
+#ifndef HB_DEBUG_APPLY
+#define HB_DEBUG_APPLY HB_DEBUG+0
+#endif
+#define TRACE_APPLY() \
+ hb_trace_t<HB_DEBUG_APPLY> trace (&context->debug_depth); \
+ trace.log ("APPLY", HB_FUNC, this);
-typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, char *data);
-typedef bool (*apply_lookup_func_t) (APPLY_ARG_DEF, unsigned int lookup_index);
+
+struct hb_apply_context_t
+{
+ unsigned int debug_depth;
+ hb_ot_layout_context_t *layout;
+ hb_buffer_t *buffer;
+ unsigned int context_length;
+ unsigned int nesting_level_left;
+ unsigned int lookup_flag;
+ unsigned int property; /* propety of first glyph (TODO remove) */
+};
+
+
+
+
+#undef BUFFER
+#define BUFFER context->buffer
+
+
+typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, const char *data);
+typedef bool (*apply_lookup_func_t) (hb_apply_context_t *context, unsigned int lookup_index);
struct ContextFuncs
{
};
-static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, char *data)
+static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, const char *data HB_UNUSED)
{
return glyph_id == value;
}
-static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, char *data)
+static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, const char *data)
{
const ClassDef &class_def = *reinterpret_cast<const ClassDef *>(data);
return class_def.get_class (glyph_id) == value;
}
-static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, char *data)
+static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, const char *data)
{
const OffsetTo<Coverage> &coverage = (const OffsetTo<Coverage>&)value;
return (data+coverage) (glyph_id) != NOT_COVERED;
}
-static inline bool match_input (APPLY_ARG_DEF,
+static inline bool match_input (hb_apply_context_t *context,
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,
+ const char *match_data,
unsigned int *context_length_out)
{
unsigned int i, j;
- unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
- if (HB_UNLIKELY (buffer->in_pos + count > end))
+ unsigned int end = MIN (context->buffer->in_length, context->buffer->in_pos + context->context_length);
+ if (unlikely (context->buffer->in_pos + count > end))
return false;
- for (i = 1, j = buffer->in_pos + 1; i < count; i++, j++)
+ for (i = 1, j = context->buffer->in_pos + 1; i < count; i++, j++)
{
- while (_hb_ot_layout_skip_mark (context->face, IN_INFO (j), lookup_flag, NULL))
+ while (_hb_ot_layout_skip_mark (context->layout->face, IN_INFO (j), context->lookup_flag, NULL))
{
- if (HB_UNLIKELY (j + count - i == end))
+ if (unlikely (j + count - i == end))
return false;
j++;
}
- if (HB_LIKELY (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
+ if (likely (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
return false;
}
- *context_length_out = j - buffer->in_pos;
+ *context_length_out = j - context->buffer->in_pos;
return true;
}
-static inline bool match_backtrack (APPLY_ARG_DEF,
+static inline bool match_backtrack (hb_apply_context_t *context,
unsigned int count,
const USHORT backtrack[],
match_func_t match_func,
- char *match_data)
+ const char *match_data)
{
- if (HB_UNLIKELY (buffer->out_pos < count))
+ if (unlikely (context->buffer->out_pos < count))
return false;
- for (unsigned int i = 0, j = buffer->out_pos - 1; i < count; i++, j--)
+ for (unsigned int i = 0, j = context->buffer->out_pos - 1; i < count; i++, j--)
{
- while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
+ while (_hb_ot_layout_skip_mark (context->layout->face, OUT_INFO (j), context->lookup_flag, NULL))
{
- if (HB_UNLIKELY (j + 1 == count - i))
+ if (unlikely (j + 1 == count - i))
return false;
j--;
}
- if (HB_LIKELY (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
+ if (likely (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
return false;
}
return true;
}
-static inline bool match_lookahead (APPLY_ARG_DEF,
+static inline bool match_lookahead (hb_apply_context_t *context,
unsigned int count,
const USHORT lookahead[],
match_func_t match_func,
- char *match_data,
+ const char *match_data,
unsigned int offset)
{
unsigned int i, j;
- unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
- if (HB_UNLIKELY (buffer->in_pos + offset + count > end))
+ unsigned int end = MIN (context->buffer->in_length, context->buffer->in_pos + context->context_length);
+ if (unlikely (context->buffer->in_pos + offset + count > end))
return false;
- for (i = 0, j = buffer->in_pos + offset; i < count; i++, j++)
+ for (i = 0, j = context->buffer->in_pos + offset; i < count; i++, j++)
{
- while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
+ while (_hb_ot_layout_skip_mark (context->layout->face, OUT_INFO (j), context->lookup_flag, NULL))
{
- if (HB_UNLIKELY (j + count - i == end))
+ if (unlikely (j + count - i == end))
return false;
j++;
}
- if (HB_LIKELY (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
+ if (likely (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
return false;
}
struct LookupRecord
{
- public:
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_SELF ();
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return context->check_struct (this);
}
USHORT sequenceIndex; /* Index into current glyph
* sequence--first glyph = 0 */
USHORT lookupListIndex; /* Lookup to apply to that
* position--zero--based */
+ public:
+ DEFINE_SIZE_STATIC (4);
};
-ASSERT_SIZE (LookupRecord, 4);
-static inline bool apply_lookup (APPLY_ARG_DEF,
+static inline bool apply_lookup (hb_apply_context_t *context,
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))
+ unsigned int end = MIN (context->buffer->in_length, context->buffer->in_pos + context->context_length);
+ if (unlikely (context->buffer->in_pos + count > end))
return false;
/* TODO We don't support lookupRecord arrays that are not increasing:
* Should be easy for in_place ones at least. */
- for (unsigned int i = 0; i < count; i++)
+
+ /* Note: If sublookup is reverse, i will underflow after the first loop
+ * and we jump out of it. Not entirely disastrous. So we don't check
+ * for reverse lookup here.
+ */
+ for (unsigned int i = 0; i < count; /* NOP */)
{
- while (_hb_ot_layout_skip_mark (context->face, IN_CURINFO (), lookup_flag, NULL))
+ while (_hb_ot_layout_skip_mark (context->layout->face, IN_CURINFO (), context->lookup_flag, NULL))
{
- if (HB_UNLIKELY (buffer->in_pos == end))
+ if (unlikely (context->buffer->in_pos == end))
return true;
/* No lookup applied for this index */
- _hb_buffer_next_glyph (buffer);
+ _hb_buffer_next_glyph (context->buffer);
}
if (lookupCount && i == lookupRecord->sequenceIndex)
{
- unsigned int old_pos = buffer->in_pos;
+ unsigned int old_pos = context->buffer->in_pos;
/* Apply a lookup */
- bool done = apply_func (APPLY_ARG, lookupRecord->lookupListIndex);
+ bool done = apply_func (context, lookupRecord->lookupListIndex);
lookupRecord++;
lookupCount--;
- i += buffer->in_pos - old_pos;
- if (HB_UNLIKELY (buffer->in_pos == end))
+ /* Err, this is wrong if the lookup jumped over some glyphs */
+ i += context->buffer->in_pos - old_pos;
+ if (unlikely (context->buffer->in_pos == end))
return true;
if (!done)
{
not_applied:
/* No lookup applied for this index */
- _hb_buffer_next_glyph (buffer);
+ _hb_buffer_next_glyph (context->buffer);
i++;
}
}
struct ContextLookupContext
{
ContextFuncs funcs;
- char *match_data;
+ const char *match_data;
};
-static inline bool context_lookup (APPLY_ARG_DEF,
+static inline bool context_lookup (hb_apply_context_t *context,
unsigned int inputCount, /* Including the first glyph (not matched) */
const USHORT input[], /* Array of input values--start with second glyph */
unsigned int lookupCount,
const LookupRecord lookupRecord[],
ContextLookupContext &lookup_context)
{
- return match_input (APPLY_ARG,
+ hb_apply_context_t new_context = *context;
+ return match_input (context,
inputCount, input,
lookup_context.funcs.match, lookup_context.match_data,
- &context_length) &&
- apply_lookup (APPLY_ARG,
+ &new_context.context_length)
+ && apply_lookup (&new_context,
inputCount,
lookupCount, lookupRecord,
lookup_context.funcs.apply);
friend struct RuleSet;
private:
- inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
+ inline bool apply (hb_apply_context_t *context, ContextLookupContext &lookup_context) const
{
- const LookupRecord *lookupRecord = &CONST_CAST (LookupRecord, input, sizeof (input[0]) * (inputCount ? inputCount - 1 : 0));
- return context_lookup (APPLY_ARG,
+ TRACE_APPLY ();
+ const LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (input, input[0].static_size * (inputCount ? inputCount - 1 : 0));
+ return context_lookup (context,
inputCount, input,
lookupCount, lookupRecord,
lookup_context);
}
public:
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE_SELF ()) return false;
- return SANITIZE_MEM (input,
- sizeof (input[0]) * inputCount +
- sizeof (lookupRecordX[0]) * lookupCount);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return inputCount.sanitize (context)
+ && lookupCount.sanitize (context)
+ && context->check_range (input,
+ input[0].static_size * inputCount
+ + lookupRecordX[0].static_size * lookupCount);
}
private:
* glyph sequence--includes the first
* glyph */
USHORT lookupCount; /* Number of LookupRecords */
- USHORT input[]; /* Array of match inputs--start with
+ USHORT input[VAR]; /* Array of match inputs--start with
* second glyph */
- LookupRecord lookupRecordX[]; /* Array of LookupRecords--in
+ LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
* design order */
+ public:
+ DEFINE_SIZE_VAR2 (4, USHORT, LookupRecord);
};
-ASSERT_SIZE (Rule, 4);
struct RuleSet
{
- inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
+ inline bool apply (hb_apply_context_t *context, ContextLookupContext &lookup_context) const
{
+ TRACE_APPLY ();
unsigned int num_rules = rule.len;
for (unsigned int i = 0; i < num_rules; i++)
{
- if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
+ if ((this+rule[i]).apply (context, lookup_context))
return true;
}
return false;
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS (rule);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return rule.sanitize (context, this);
}
private:
friend struct Context;
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
unsigned int index = (this+coverage) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
const RuleSet &rule_set = this+ruleSet[index];
{match_glyph, apply_func},
NULL
};
- return rule_set.apply (APPLY_ARG, lookup_context);
+ return rule_set.apply (context, lookup_context);
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS2 (coverage, ruleSet);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return coverage.sanitize (context, this)
+ && ruleSet.sanitize (context, this);
}
private:
OffsetArrayOf<RuleSet>
ruleSet; /* Array of RuleSet tables
* ordered by Coverage Index */
+ public:
+ DEFINE_SIZE_STATIC (6);
};
-ASSERT_SIZE (ContextFormat1, 6);
struct ContextFormat2
friend struct Context;
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
unsigned int index = (this+coverage) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
const ClassDef &class_def = this+classDef;
*/
struct ContextLookupContext lookup_context = {
{match_class, apply_func},
- DECONST_CHARP(&class_def)
+ CharP(&class_def)
};
- return rule_set.apply (APPLY_ARG, lookup_context);
+ return rule_set.apply (context, lookup_context);
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS3 (coverage, classDef, ruleSet);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return coverage.sanitize (context, this)
+ && classDef.sanitize (context, this)
+ && ruleSet.sanitize (context, this);
}
private:
OffsetArrayOf<RuleSet>
ruleSet; /* Array of RuleSet tables
* ordered by class */
+ public:
+ DEFINE_SIZE_STATIC (8);
};
-ASSERT_SIZE (ContextFormat2, 8);
struct ContextFormat3
friend struct Context;
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
unsigned int index = (this+coverage[0]) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
- const LookupRecord *lookupRecord = &CONST_CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
+ const LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (coverage, coverage[0].static_size * glyphCount);
struct ContextLookupContext lookup_context = {
{match_coverage, apply_func},
- DECONST_CHARP(this)
+ CharP(this)
};
- return context_lookup (APPLY_ARG,
+ return context_lookup (context,
glyphCount, (const USHORT *) (coverage + 1),
lookupCount, lookupRecord,
lookup_context);
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE_SELF ()) return false;
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!context->check_struct (this)) return false;
unsigned int count = glyphCount;
+ if (!context->check_array (coverage, coverage[0].static_size, count)) return false;
for (unsigned int i = 0; i < count; i++)
- if (!SANITIZE_THIS (coverage[i])) return false;
- LookupRecord *lookupRecord = &CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
- return SANITIZE_MEM (lookupRecord, sizeof (lookupRecord[0]) * lookupCount);
+ if (!coverage[i].sanitize (context, this)) return false;
+ LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (coverage, coverage[0].static_size * count);
+ return context->check_array (lookupRecord, lookupRecord[0].static_size, lookupCount);
}
private:
* sequence */
USHORT lookupCount; /* Number of LookupRecords */
OffsetTo<Coverage>
- coverage[]; /* Array of offsets to Coverage
+ coverage[VAR]; /* Array of offsets to Coverage
* table in glyph sequence order */
- LookupRecord lookupRecordX[]; /* Array of LookupRecords--in
+ LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
* design order */
+ public:
+ DEFINE_SIZE_VAR2 (6, OffsetTo<Coverage>, LookupRecord);
};
-ASSERT_SIZE (ContextFormat3, 6);
struct Context
{
protected:
- bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
switch (u.format) {
- 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);
+ case 1: return u.format1->apply (context, apply_func);
+ case 2: return u.format2->apply (context, apply_func);
+ case 3: return u.format3->apply (context, apply_func);
default:return false;
}
}
- bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE (u.format)) return false;
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!u.format.sanitize (context)) 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);
+ case 1: return u.format1->sanitize (context);
+ case 2: return u.format2->sanitize (context);
+ case 3: return u.format3->sanitize (context);
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
- ContextFormat1 format1[];
- ContextFormat2 format2[];
- ContextFormat3 format3[];
+ ContextFormat1 format1[VAR];
+ ContextFormat2 format2[VAR];
+ ContextFormat3 format3[VAR];
} u;
};
-ASSERT_SIZE (Context, 2);
/* Chaining Contextual lookups */
struct ChainContextLookupContext
{
ContextFuncs funcs;
- char *match_data[3];
+ const char *match_data[3];
};
-static inline bool chain_context_lookup (APPLY_ARG_DEF,
+static inline bool chain_context_lookup (hb_apply_context_t *context,
unsigned int backtrackCount,
const USHORT backtrack[],
unsigned int inputCount, /* Including the first glyph (not matched) */
ChainContextLookupContext &lookup_context)
{
/* First guess */
- if (HB_UNLIKELY (buffer->out_pos < backtrackCount ||
- buffer->in_pos + inputCount + lookaheadCount > buffer->in_length ||
- inputCount + lookaheadCount > context_length))
+ if (unlikely (context->buffer->out_pos < backtrackCount ||
+ context->buffer->in_pos + inputCount + lookaheadCount > context->buffer->in_length ||
+ inputCount + lookaheadCount > context->context_length))
return false;
- unsigned int offset;
- return match_backtrack (APPLY_ARG,
+ hb_apply_context_t new_context = *context;
+ return match_backtrack (context,
backtrackCount, backtrack,
- lookup_context.funcs.match, lookup_context.match_data[0]) &&
- match_input (APPLY_ARG,
+ lookup_context.funcs.match, lookup_context.match_data[0])
+ && match_input (context,
inputCount, input,
lookup_context.funcs.match, lookup_context.match_data[1],
- &offset) &&
- match_lookahead (APPLY_ARG,
+ &new_context.context_length)
+ && match_lookahead (context,
lookaheadCount, lookahead,
lookup_context.funcs.match, lookup_context.match_data[2],
- offset) &&
- (context_length = offset, true) &&
- apply_lookup (APPLY_ARG,
+ new_context.context_length)
+ && apply_lookup (&new_context,
inputCount,
lookupCount, lookupRecord,
lookup_context.funcs.apply);
friend struct ChainRuleSet;
private:
- inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
+ inline bool apply (hb_apply_context_t *context, ChainContextLookupContext &lookup_context) const
{
- 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 ());
- return chain_context_lookup (APPLY_ARG,
- backtrack.len, backtrack.array,
- input.len, input.array + 1,
- lookahead.len, lookahead.array,
- lookup.len, lookup.array,
+ TRACE_APPLY ();
+ const HeadlessArrayOf<USHORT> &input = StructAfter<HeadlessArrayOf<USHORT> > (backtrack);
+ const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input);
+ const ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
+ return chain_context_lookup (context,
+ backtrack.len, backtrack.array(),
+ input.len, input.array(),
+ lookahead.len, lookahead.array(),
+ lookup.len, lookup.array(),
lookup_context);
return false;
}
public:
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE (backtrack)) return false;
- HeadlessArrayOf<USHORT> &input = CAST (HeadlessArrayOf<USHORT>, backtrack, backtrack.get_size ());
- if (!SANITIZE (input)) return false;
- ArrayOf<USHORT> &lookahead = CAST (ArrayOf<USHORT>, input, input.get_size ());
- if (!SANITIZE (lookahead)) return false;
- ArrayOf<LookupRecord> &lookup = CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
- return SANITIZE (lookup);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!backtrack.sanitize (context)) return false;
+ HeadlessArrayOf<USHORT> &input = StructAfter<HeadlessArrayOf<USHORT> > (backtrack);
+ if (!input.sanitize (context)) return false;
+ ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input);
+ if (!lookahead.sanitize (context)) return false;
+ ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
+ return lookup.sanitize (context);
}
private:
ArrayOf<LookupRecord>
lookupX; /* Array of LookupRecords--in
* design order) */
+ public:
+ DEFINE_SIZE_STATIC (8);
};
-ASSERT_SIZE (ChainRule, 8);
struct ChainRuleSet
{
- inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
+ inline bool apply (hb_apply_context_t *context, ChainContextLookupContext &lookup_context) const
{
+ TRACE_APPLY ();
unsigned int num_rules = rule.len;
for (unsigned int i = 0; i < num_rules; i++)
{
- if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
+ if ((this+rule[i]).apply (context, lookup_context))
return true;
}
return false;
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS (rule);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return rule.sanitize (context, this);
}
private:
OffsetArrayOf<ChainRule>
rule; /* Array of ChainRule tables
* ordered by preference */
+ public:
+ DEFINE_SIZE_STATIC (2);
};
-ASSERT_SIZE (ChainRuleSet, 2);
struct ChainContextFormat1
{
friend struct ChainContext;
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
unsigned int index = (this+coverage) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
const ChainRuleSet &rule_set = this+ruleSet[index];
{match_glyph, apply_func},
{NULL, NULL, NULL}
};
- return rule_set.apply (APPLY_ARG, lookup_context);
+ return rule_set.apply (context, lookup_context);
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS2 (coverage, ruleSet);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return coverage.sanitize (context, this)
+ && ruleSet.sanitize (context, this);
}
private:
OffsetArrayOf<ChainRuleSet>
ruleSet; /* Array of ChainRuleSet tables
* ordered by Coverage Index */
+ public:
+ DEFINE_SIZE_STATIC (6);
};
-ASSERT_SIZE (ChainContextFormat1, 6);
struct ChainContextFormat2
{
friend struct ChainContext;
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
unsigned int index = (this+coverage) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
const ClassDef &backtrack_class_def = this+backtrackClassDef;
*/
struct ChainContextLookupContext lookup_context = {
{match_class, apply_func},
- {DECONST_CHARP(&backtrack_class_def),
- DECONST_CHARP(&input_class_def),
- DECONST_CHARP(&lookahead_class_def)}
+ {CharP(&backtrack_class_def),
+ CharP(&input_class_def),
+ CharP(&lookahead_class_def)}
};
- return rule_set.apply (APPLY_ARG, lookup_context);
+ return rule_set.apply (context, lookup_context);
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_THIS2 (coverage, backtrackClassDef) &&
- SANITIZE_THIS2 (inputClassDef, lookaheadClassDef) &&
- SANITIZE_THIS (ruleSet);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return coverage.sanitize (context, this)
+ && backtrackClassDef.sanitize (context, this)
+ && inputClassDef.sanitize (context, this)
+ && lookaheadClassDef.sanitize (context, this)
+ && ruleSet.sanitize (context, this);
}
private:
OffsetArrayOf<ChainRuleSet>
ruleSet; /* Array of ChainRuleSet tables
* ordered by class */
+ public:
+ DEFINE_SIZE_STATIC (12);
};
-ASSERT_SIZE (ChainContextFormat2, 12);
struct ChainContextFormat3
{
private:
- inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
- const OffsetArrayOf<Coverage> &input = CONST_CAST (OffsetArrayOf<Coverage>, backtrack, backtrack.get_size ());
+ TRACE_APPLY ();
+ const OffsetArrayOf<Coverage> &input = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
unsigned int index = (this+input[0]) (IN_CURGLYPH ());
- if (HB_LIKELY (index == NOT_COVERED))
+ if (likely (index == NOT_COVERED))
return false;
- const OffsetArrayOf<Coverage> &lookahead = CONST_CAST (OffsetArrayOf<Coverage>, input, input.get_size ());
- const ArrayOf<LookupRecord> &lookup = CONST_CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
+ const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input);
+ const ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
struct ChainContextLookupContext lookup_context = {
{match_coverage, apply_func},
- {DECONST_CHARP(this), DECONST_CHARP(this), DECONST_CHARP(this)}
+ {CharP(this), CharP(this), CharP(this)}
};
- 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,
+ return chain_context_lookup (context,
+ backtrack.len, (const USHORT *) backtrack.array(),
+ input.len, (const USHORT *) input.array() + 1,
+ lookahead.len, (const USHORT *) lookahead.array(),
+ lookup.len, lookup.array(),
lookup_context);
return false;
}
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE_THIS (backtrack)) return false;
- OffsetArrayOf<Coverage> &input = CAST (OffsetArrayOf<Coverage>, backtrack, backtrack.get_size ());
- if (!SANITIZE_THIS (input)) return false;
- OffsetArrayOf<Coverage> &lookahead = CAST (OffsetArrayOf<Coverage>, input, input.get_size ());
- if (!SANITIZE_THIS (lookahead)) return false;
- ArrayOf<LookupRecord> &lookup = CAST (ArrayOf<LookupRecord>, lookahead, lookahead.get_size ());
- return SANITIZE (lookup);
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!backtrack.sanitize (context, this)) return false;
+ OffsetArrayOf<Coverage> &input = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
+ if (!input.sanitize (context, this)) return false;
+ OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input);
+ if (!lookahead.sanitize (context, this)) return false;
+ ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
+ return lookup.sanitize (context);
}
private:
ArrayOf<LookupRecord>
lookupX; /* Array of LookupRecords--in
* design order) */
+ public:
+ DEFINE_SIZE_STATIC (10);
};
-ASSERT_SIZE (ChainContextFormat3, 10);
struct ChainContext
{
protected:
- bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
+ inline bool apply (hb_apply_context_t *context, apply_lookup_func_t apply_func) const
{
+ TRACE_APPLY ();
switch (u.format) {
- 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);
+ case 1: return u.format1->apply (context, apply_func);
+ case 2: return u.format2->apply (context, apply_func);
+ case 3: return u.format3->apply (context, apply_func);
default:return false;
}
}
- bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE (u.format)) return false;
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!u.format.sanitize (context)) 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);
+ case 1: return u.format1->sanitize (context);
+ case 2: return u.format2->sanitize (context);
+ case 3: return u.format3->sanitize (context);
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
- ChainContextFormat1 format1[];
- ChainContextFormat2 format2[];
- ChainContextFormat3 format3[];
+ ChainContextFormat1 format1[VAR];
+ ChainContextFormat2 format2[VAR];
+ ChainContextFormat3 format3[VAR];
} u;
};
-ASSERT_SIZE (ChainContext, 2);
struct ExtensionFormat1
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);
- return CONST_CAST (LookupSubTable, *this, offset);
- }
+ inline unsigned int get_offset (void) const { return extensionOffset; }
- inline bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- return SANITIZE_SELF ();
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return context->check_struct (this);
}
private:
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. */
+ ULONG extensionOffset; /* Offset to the extension subtable,
+ * of lookup type subtable. */
+ public:
+ DEFINE_SIZE_STATIC (8);
};
-ASSERT_SIZE (ExtensionFormat1, 8);
struct Extension
{
default:return 0;
}
}
- inline const LookupSubTable& get_subtable (void) const
+ inline unsigned int get_offset (void) const
{
switch (u.format) {
- case 1: return u.format1->get_subtable ();
- default:return Null(LookupSubTable);
+ case 1: return u.format1->get_offset ();
+ default:return 0;
}
}
- bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE (u.format)) return false;
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ if (!u.format.sanitize (context)) return false;
switch (u.format) {
- case 1: return u.format1->sanitize (SANITIZE_ARG);
+ case 1: return u.format1->sanitize (context);
default:return true;
}
}
private:
union {
USHORT format; /* Format identifier */
- ExtensionFormat1 format1[];
+ ExtensionFormat1 format1[VAR];
} u;
};
-ASSERT_SIZE (Extension, 2);
/*
static const hb_tag_t GSUBTag = HB_OT_TAG_GSUB;
static const hb_tag_t GPOSTag = HB_OT_TAG_GPOS;
- STATIC_DEFINE_GET_FOR_DATA_CHECK_MAJOR_VERSION (GSUBGPOS, 1, 1);
-
- DEFINE_TAG_LIST_INTERFACE (Script, script ); /* get_script_count (), get_script (i), get_script_tag (i) */
- DEFINE_TAG_LIST_INTERFACE (Feature, feature); /* get_feature_count(), get_feature(i), get_feature_tag(i) */
- DEFINE_LIST_INTERFACE (Lookup, lookup ); /* get_lookup_count (), get_lookup (i) */
-
- // LONGTERMTODO bsearch
- DEFINE_TAG_FIND_INTERFACE (Script, script ); /* find_script_index (), get_script_by_tag (tag) */
- DEFINE_TAG_FIND_INTERFACE (Feature, feature); /* find_feature_index(), get_feature_by_tag(tag) */
-
- bool sanitize (SANITIZE_ARG_DEF) {
- SANITIZE_DEBUG ();
- if (!SANITIZE (version)) return false;
- if (version.major != 1) return true;
- return SANITIZE_THIS3 (scriptList, featureList, lookupList);
+ 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 unsigned int get_script_tags (unsigned int start_offset,
+ unsigned int *script_count /* IN/OUT */,
+ hb_tag_t *script_tags /* OUT */) const
+ { return (this+scriptList).get_tags (start_offset, 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 unsigned int get_feature_tags (unsigned int start_offset,
+ unsigned int *feature_count /* IN/OUT */,
+ hb_tag_t *feature_tags /* OUT */) const
+ { return (this+featureList).get_tags (start_offset, 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]; }
+
+ inline bool sanitize (hb_sanitize_context_t *context) {
+ TRACE_SANITIZE ();
+ return version.sanitize (context) && likely (version.major == 1)
+ && scriptList.sanitize (context, this)
+ && featureList.sanitize (context, this)
+ && lookupList.sanitize (context, this);
}
protected:
featureList; /* FeatureList table */
OffsetTo<LookupList>
lookupList; /* LookupList table */
+ public:
+ DEFINE_SIZE_STATIC (10);
};
-ASSERT_SIZE (GSUBGPOS, 10);
#endif /* HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH */
projects / framework / uifw / harfbuzz.git / blobdiff