2 * Copyright (C) 2007,2008,2009 Red Hat, Inc.
4 * This is part of HarfBuzz, a text shaping library.
6 * Permission is hereby granted, without written agreement and without
7 * license or royalty fees, to use, copy, modify, and distribute this
8 * software and its documentation for any purpose, provided that the
9 * above copyright notice and the following two paragraphs appear in
10 * all copies of this software.
12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
24 * Red Hat Author(s): Behdad Esfahbod
27 #ifndef HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH
28 #define HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH
30 #include "hb-buffer-private.h"
31 #include "hb-ot-layout-gdef-private.hh"
34 #ifndef HB_DEBUG_APPLY
35 #define HB_DEBUG_APPLY HB_DEBUG+0
38 #define TRACE_APPLY() \
41 _hb_trace ("APPLY", HB_FUNC, this, apply_depth, HB_DEBUG_APPLY); \
45 #define APPLY_ARG_DEF \
46 hb_apply_context_t *context, \
47 hb_ot_layout_context_t *layout_context, \
48 hb_buffer_t *buffer, \
49 unsigned int context_length HB_UNUSED, \
50 unsigned int apply_depth HB_UNUSED
56 (HB_DEBUG_APPLY ? apply_depth + 1 : 0)
58 struct hb_apply_context_t
60 unsigned int nesting_level_left;
61 unsigned int lookup_flag;
62 unsigned int property; /* propety of first glyph (TODO remove) */
66 typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, const char *data);
67 typedef bool (*apply_lookup_func_t) (APPLY_ARG_DEF, unsigned int lookup_index);
72 apply_lookup_func_t apply;
76 static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, const char *data HB_UNUSED)
78 return glyph_id == value;
81 static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, const char *data)
83 const ClassDef &class_def = *reinterpret_cast<const ClassDef *>(data);
84 return class_def.get_class (glyph_id) == value;
87 static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, const char *data)
89 const OffsetTo<Coverage> &coverage = (const OffsetTo<Coverage>&)value;
90 return (data+coverage) (glyph_id) != NOT_COVERED;
94 static inline bool match_input (APPLY_ARG_DEF,
95 unsigned int count, /* Including the first glyph (not matched) */
96 const USHORT input[], /* Array of input values--start with second glyph */
97 match_func_t match_func,
98 const char *match_data,
99 unsigned int *context_length_out)
102 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
103 if (unlikely (buffer->in_pos + count > end))
106 for (i = 1, j = buffer->in_pos + 1; i < count; i++, j++)
108 while (_hb_ot_layout_skip_mark (layout_context->face, IN_INFO (j), context->lookup_flag, NULL))
110 if (unlikely (j + count - i == end))
115 if (likely (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
119 *context_length_out = j - buffer->in_pos;
124 static inline bool match_backtrack (APPLY_ARG_DEF,
126 const USHORT backtrack[],
127 match_func_t match_func,
128 const char *match_data)
130 if (unlikely (buffer->out_pos < count))
133 for (unsigned int i = 0, j = buffer->out_pos - 1; i < count; i++, j--)
135 while (_hb_ot_layout_skip_mark (layout_context->face, OUT_INFO (j), context->lookup_flag, NULL))
137 if (unlikely (j + 1 == count - i))
142 if (likely (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
149 static inline bool match_lookahead (APPLY_ARG_DEF,
151 const USHORT lookahead[],
152 match_func_t match_func,
153 const char *match_data,
157 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
158 if (unlikely (buffer->in_pos + offset + count > end))
161 for (i = 0, j = buffer->in_pos + offset; i < count; i++, j++)
163 while (_hb_ot_layout_skip_mark (layout_context->face, OUT_INFO (j), context->lookup_flag, NULL))
165 if (unlikely (j + count - i == end))
170 if (likely (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
180 static inline unsigned int get_size () { return sizeof (LookupRecord); }
182 inline bool sanitize (hb_sanitize_context_t *context) {
184 return SANITIZE_SELF ();
187 USHORT sequenceIndex; /* Index into current glyph
188 * sequence--first glyph = 0 */
189 USHORT lookupListIndex; /* Lookup to apply to that
190 * position--zero--based */
192 ASSERT_SIZE (LookupRecord, 4);
194 static inline bool apply_lookup (APPLY_ARG_DEF,
195 unsigned int count, /* Including the first glyph */
196 unsigned int lookupCount,
197 const LookupRecord lookupRecord[], /* Array of LookupRecords--in design order */
198 apply_lookup_func_t apply_func)
200 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
201 if (unlikely (buffer->in_pos + count > end))
204 /* TODO We don't support lookupRecord arrays that are not increasing:
205 * Should be easy for in_place ones at least. */
207 /* Note: If sublookup is reverse, i will underflow after the first loop
208 * and we jump out of it. Not entirely disastrous. So we don't check
209 * for reverse lookup here.
211 for (unsigned int i = 0; i < count; /* NOP */)
213 while (_hb_ot_layout_skip_mark (layout_context->face, IN_CURINFO (), context->lookup_flag, NULL))
215 if (unlikely (buffer->in_pos == end))
217 /* No lookup applied for this index */
218 _hb_buffer_next_glyph (buffer);
221 if (lookupCount && i == lookupRecord->sequenceIndex)
223 unsigned int old_pos = buffer->in_pos;
226 bool done = apply_func (APPLY_ARG, lookupRecord->lookupListIndex);
230 /* Err, this is wrong if the lookup jumped over some glyphs */
231 i += buffer->in_pos - old_pos;
232 if (unlikely (buffer->in_pos == end))
241 /* No lookup applied for this index */
242 _hb_buffer_next_glyph (buffer);
251 /* Contextual lookups */
253 struct ContextLookupContext
256 const char *match_data;
259 static inline bool context_lookup (APPLY_ARG_DEF,
260 unsigned int inputCount, /* Including the first glyph (not matched) */
261 const USHORT input[], /* Array of input values--start with second glyph */
262 unsigned int lookupCount,
263 const LookupRecord lookupRecord[],
264 ContextLookupContext &lookup_context)
266 return match_input (APPLY_ARG,
268 lookup_context.funcs.match, lookup_context.match_data,
270 apply_lookup (APPLY_ARG,
272 lookupCount, lookupRecord,
273 lookup_context.funcs.apply);
278 friend struct RuleSet;
281 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
284 const LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (input, input[0].get_size () * (inputCount ? inputCount - 1 : 0));
285 return context_lookup (APPLY_ARG,
287 lookupCount, lookupRecord,
292 inline bool sanitize (hb_sanitize_context_t *context) {
294 if (!(SANITIZE (inputCount) && SANITIZE (lookupCount))) return false;
295 return SANITIZE_MEM (input,
296 input[0].get_size () * inputCount +
297 lookupRecordX[0].get_size () * lookupCount);
301 USHORT inputCount; /* Total number of glyphs in input
302 * glyph sequence--includes the first
304 USHORT lookupCount; /* Number of LookupRecords */
305 USHORT input[VAR]; /* Array of match inputs--start with
307 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
310 ASSERT_SIZE_VAR2 (Rule, 4, USHORT, LookupRecord);
314 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
317 unsigned int num_rules = rule.len;
318 for (unsigned int i = 0; i < num_rules; i++)
320 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
327 inline bool sanitize (hb_sanitize_context_t *context) {
329 return SANITIZE_WITH_BASE (this, rule);
334 rule; /* Array of Rule tables
335 * ordered by preference */
339 struct ContextFormat1
341 friend struct Context;
344 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
347 unsigned int index = (this+coverage) (IN_CURGLYPH ());
348 if (likely (index == NOT_COVERED))
351 const RuleSet &rule_set = this+ruleSet[index];
352 struct ContextLookupContext lookup_context = {
353 {match_glyph, apply_func},
356 return rule_set.apply (APPLY_ARG, lookup_context);
359 inline bool sanitize (hb_sanitize_context_t *context) {
361 return SANITIZE_WITH_BASE (this, coverage)
362 && SANITIZE_WITH_BASE (this, ruleSet);
366 USHORT format; /* Format identifier--format = 1 */
368 coverage; /* Offset to Coverage table--from
369 * beginning of table */
370 OffsetArrayOf<RuleSet>
371 ruleSet; /* Array of RuleSet tables
372 * ordered by Coverage Index */
374 ASSERT_SIZE (ContextFormat1, 6);
377 struct ContextFormat2
379 friend struct Context;
382 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
385 unsigned int index = (this+coverage) (IN_CURGLYPH ());
386 if (likely (index == NOT_COVERED))
389 const ClassDef &class_def = this+classDef;
390 index = class_def (IN_CURGLYPH ());
391 const RuleSet &rule_set = this+ruleSet[index];
392 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
393 * them across subrule lookups. Not sure it's worth it.
395 struct ContextLookupContext lookup_context = {
396 {match_class, apply_func},
399 return rule_set.apply (APPLY_ARG, lookup_context);
402 inline bool sanitize (hb_sanitize_context_t *context) {
404 return SANITIZE_WITH_BASE (this, coverage)
405 && SANITIZE_WITH_BASE (this, classDef)
406 && SANITIZE_WITH_BASE (this, ruleSet);
410 USHORT format; /* Format identifier--format = 2 */
412 coverage; /* Offset to Coverage table--from
413 * beginning of table */
415 classDef; /* Offset to glyph ClassDef table--from
416 * beginning of table */
417 OffsetArrayOf<RuleSet>
418 ruleSet; /* Array of RuleSet tables
419 * ordered by class */
421 ASSERT_SIZE (ContextFormat2, 8);
424 struct ContextFormat3
426 friend struct Context;
429 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
432 unsigned int index = (this+coverage[0]) (IN_CURGLYPH ());
433 if (likely (index == NOT_COVERED))
436 const LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (coverage, coverage[0].get_size () * glyphCount);
437 struct ContextLookupContext lookup_context = {
438 {match_coverage, apply_func},
441 return context_lookup (APPLY_ARG,
442 glyphCount, (const USHORT *) (coverage + 1),
443 lookupCount, lookupRecord,
447 inline bool sanitize (hb_sanitize_context_t *context) {
449 if (!SANITIZE_SELF ()) return false;
450 unsigned int count = glyphCount;
451 if (!SANITIZE_ARRAY (coverage, OffsetTo<Coverage>::get_size (), glyphCount)) return false;
452 for (unsigned int i = 0; i < count; i++)
453 if (!SANITIZE_WITH_BASE (this, coverage[i])) return false;
454 LookupRecord *lookupRecord = &StructAtOffset<LookupRecord> (coverage, OffsetTo<Coverage>::get_size () * glyphCount);
455 return SANITIZE_ARRAY (lookupRecord, LookupRecord::get_size (), lookupCount);
459 USHORT format; /* Format identifier--format = 3 */
460 USHORT glyphCount; /* Number of glyphs in the input glyph
462 USHORT lookupCount; /* Number of LookupRecords */
464 coverage[VAR]; /* Array of offsets to Coverage
465 * table in glyph sequence order */
466 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
469 ASSERT_SIZE_VAR2 (ContextFormat3, 6, OffsetTo<Coverage>, LookupRecord);
474 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
478 case 1: return u.format1->apply (APPLY_ARG, apply_func);
479 case 2: return u.format2->apply (APPLY_ARG, apply_func);
480 case 3: return u.format3->apply (APPLY_ARG, apply_func);
481 default:return false;
485 inline bool sanitize (hb_sanitize_context_t *context) {
487 if (!SANITIZE (u.format)) return false;
489 case 1: return u.format1->sanitize (context);
490 case 2: return u.format2->sanitize (context);
491 case 3: return u.format3->sanitize (context);
498 USHORT format; /* Format identifier */
499 ContextFormat1 format1[VAR];
500 ContextFormat2 format2[VAR];
501 ContextFormat3 format3[VAR];
506 /* Chaining Contextual lookups */
508 struct ChainContextLookupContext
511 const char *match_data[3];
514 static inline bool chain_context_lookup (APPLY_ARG_DEF,
515 unsigned int backtrackCount,
516 const USHORT backtrack[],
517 unsigned int inputCount, /* Including the first glyph (not matched) */
518 const USHORT input[], /* Array of input values--start with second glyph */
519 unsigned int lookaheadCount,
520 const USHORT lookahead[],
521 unsigned int lookupCount,
522 const LookupRecord lookupRecord[],
523 ChainContextLookupContext &lookup_context)
526 if (unlikely (buffer->out_pos < backtrackCount ||
527 buffer->in_pos + inputCount + lookaheadCount > buffer->in_length ||
528 inputCount + lookaheadCount > context_length))
532 return match_backtrack (APPLY_ARG,
533 backtrackCount, backtrack,
534 lookup_context.funcs.match, lookup_context.match_data[0]) &&
535 match_input (APPLY_ARG,
537 lookup_context.funcs.match, lookup_context.match_data[1],
539 match_lookahead (APPLY_ARG,
540 lookaheadCount, lookahead,
541 lookup_context.funcs.match, lookup_context.match_data[2],
543 (context_length = offset, true) &&
544 apply_lookup (APPLY_ARG,
546 lookupCount, lookupRecord,
547 lookup_context.funcs.apply);
552 friend struct ChainRuleSet;
555 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
558 const HeadlessArrayOf<USHORT> &input = StructAfter<HeadlessArrayOf<USHORT> > (backtrack);
559 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input);
560 const ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
561 return chain_context_lookup (APPLY_ARG,
562 backtrack.len, backtrack.array(),
563 input.len, input.array(),
564 lookahead.len, lookahead.array(),
565 lookup.len, lookup.array(),
571 inline bool sanitize (hb_sanitize_context_t *context) {
573 if (!SANITIZE (backtrack)) return false;
574 HeadlessArrayOf<USHORT> &input = StructAfter<HeadlessArrayOf<USHORT> > (backtrack);
575 if (!SANITIZE (input)) return false;
576 ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input);
577 if (!SANITIZE (lookahead)) return false;
578 ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
579 return SANITIZE (lookup);
584 backtrack; /* Array of backtracking values
585 * (to be matched before the input
587 HeadlessArrayOf<USHORT>
588 inputX; /* Array of input values (start with
591 lookaheadX; /* Array of lookahead values's (to be
592 * matched after the input sequence) */
593 ArrayOf<LookupRecord>
594 lookupX; /* Array of LookupRecords--in
597 ASSERT_SIZE (ChainRule, 8);
601 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
604 unsigned int num_rules = rule.len;
605 for (unsigned int i = 0; i < num_rules; i++)
607 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
614 inline bool sanitize (hb_sanitize_context_t *context) {
616 return SANITIZE_WITH_BASE (this, rule);
620 OffsetArrayOf<ChainRule>
621 rule; /* Array of ChainRule tables
622 * ordered by preference */
624 ASSERT_SIZE (ChainRuleSet, 2);
626 struct ChainContextFormat1
628 friend struct ChainContext;
631 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
634 unsigned int index = (this+coverage) (IN_CURGLYPH ());
635 if (likely (index == NOT_COVERED))
638 const ChainRuleSet &rule_set = this+ruleSet[index];
639 struct ChainContextLookupContext lookup_context = {
640 {match_glyph, apply_func},
643 return rule_set.apply (APPLY_ARG, lookup_context);
646 inline bool sanitize (hb_sanitize_context_t *context) {
648 return SANITIZE_WITH_BASE (this, coverage)
649 && SANITIZE_WITH_BASE (this, ruleSet);
653 USHORT format; /* Format identifier--format = 1 */
655 coverage; /* Offset to Coverage table--from
656 * beginning of table */
657 OffsetArrayOf<ChainRuleSet>
658 ruleSet; /* Array of ChainRuleSet tables
659 * ordered by Coverage Index */
661 ASSERT_SIZE (ChainContextFormat1, 6);
663 struct ChainContextFormat2
665 friend struct ChainContext;
668 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
671 unsigned int index = (this+coverage) (IN_CURGLYPH ());
672 if (likely (index == NOT_COVERED))
675 const ClassDef &backtrack_class_def = this+backtrackClassDef;
676 const ClassDef &input_class_def = this+inputClassDef;
677 const ClassDef &lookahead_class_def = this+lookaheadClassDef;
679 index = input_class_def (IN_CURGLYPH ());
680 const ChainRuleSet &rule_set = this+ruleSet[index];
681 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
682 * them across subrule lookups. Not sure it's worth it.
684 struct ChainContextLookupContext lookup_context = {
685 {match_class, apply_func},
686 {CharP(&backtrack_class_def),
687 CharP(&input_class_def),
688 CharP(&lookahead_class_def)}
690 return rule_set.apply (APPLY_ARG, lookup_context);
693 inline bool sanitize (hb_sanitize_context_t *context) {
695 return SANITIZE_WITH_BASE (this, coverage)
696 && SANITIZE_WITH_BASE (this, backtrackClassDef)
697 && SANITIZE_WITH_BASE (this, inputClassDef)
698 && SANITIZE_WITH_BASE (this, lookaheadClassDef)
699 && SANITIZE_WITH_BASE (this, ruleSet);
703 USHORT format; /* Format identifier--format = 2 */
705 coverage; /* Offset to Coverage table--from
706 * beginning of table */
708 backtrackClassDef; /* Offset to glyph ClassDef table
709 * containing backtrack sequence
710 * data--from beginning of table */
712 inputClassDef; /* Offset to glyph ClassDef
713 * table containing input sequence
714 * data--from beginning of table */
716 lookaheadClassDef; /* Offset to glyph ClassDef table
717 * containing lookahead sequence
718 * data--from beginning of table */
719 OffsetArrayOf<ChainRuleSet>
720 ruleSet; /* Array of ChainRuleSet tables
721 * ordered by class */
723 ASSERT_SIZE (ChainContextFormat2, 12);
725 struct ChainContextFormat3
727 friend struct ChainContext;
731 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
734 const OffsetArrayOf<Coverage> &input = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
736 unsigned int index = (this+input[0]) (IN_CURGLYPH ());
737 if (likely (index == NOT_COVERED))
740 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input);
741 const ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
742 struct ChainContextLookupContext lookup_context = {
743 {match_coverage, apply_func},
744 {CharP(this), CharP(this), CharP(this)}
746 return chain_context_lookup (APPLY_ARG,
747 backtrack.len, (const USHORT *) backtrack.array(),
748 input.len, (const USHORT *) input.array() + 1,
749 lookahead.len, (const USHORT *) lookahead.array(),
750 lookup.len, lookup.array(),
755 inline bool sanitize (hb_sanitize_context_t *context) {
757 if (!SANITIZE_WITH_BASE (this, backtrack)) return false;
758 OffsetArrayOf<Coverage> &input = StructAfter<OffsetArrayOf<Coverage> > (backtrack);
759 if (!SANITIZE_WITH_BASE (this, input)) return false;
760 OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input);
761 if (!SANITIZE_WITH_BASE (this, lookahead)) return false;
762 ArrayOf<LookupRecord> &lookup = StructAfter<ArrayOf<LookupRecord> > (lookahead);
763 return SANITIZE (lookup);
767 USHORT format; /* Format identifier--format = 3 */
768 OffsetArrayOf<Coverage>
769 backtrack; /* Array of coverage tables
770 * in backtracking sequence, in glyph
772 OffsetArrayOf<Coverage>
773 inputX ; /* Array of coverage
774 * tables in input sequence, in glyph
776 OffsetArrayOf<Coverage>
777 lookaheadX; /* Array of coverage tables
778 * in lookahead sequence, in glyph
780 ArrayOf<LookupRecord>
781 lookupX; /* Array of LookupRecords--in
784 ASSERT_SIZE (ChainContextFormat3, 10);
789 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
793 case 1: return u.format1->apply (APPLY_ARG, apply_func);
794 case 2: return u.format2->apply (APPLY_ARG, apply_func);
795 case 3: return u.format3->apply (APPLY_ARG, apply_func);
796 default:return false;
800 inline bool sanitize (hb_sanitize_context_t *context) {
802 if (!SANITIZE (u.format)) return false;
804 case 1: return u.format1->sanitize (context);
805 case 2: return u.format2->sanitize (context);
806 case 3: return u.format3->sanitize (context);
813 USHORT format; /* Format identifier */
814 ChainContextFormat1 format1[VAR];
815 ChainContextFormat2 format2[VAR];
816 ChainContextFormat3 format3[VAR];
821 struct ExtensionFormat1
823 friend struct Extension;
826 inline unsigned int get_type (void) const { return extensionLookupType; }
827 inline unsigned int get_offset (void) const { return extensionOffset; }
829 inline bool sanitize (hb_sanitize_context_t *context) {
831 return SANITIZE_SELF ();
835 USHORT format; /* Format identifier. Set to 1. */
836 USHORT extensionLookupType; /* Lookup type of subtable referenced
837 * by ExtensionOffset (i.e. the
838 * extension subtable). */
839 ULONG extensionOffset; /* Offset to the extension subtable,
840 * of lookup type subtable. */
842 ASSERT_SIZE (ExtensionFormat1, 8);
846 inline unsigned int get_type (void) const
849 case 1: return u.format1->get_type ();
853 inline unsigned int get_offset (void) const
856 case 1: return u.format1->get_offset ();
861 inline bool sanitize (hb_sanitize_context_t *context) {
863 if (!SANITIZE (u.format)) return false;
865 case 1: return u.format1->sanitize (context);
872 USHORT format; /* Format identifier */
873 ExtensionFormat1 format1[VAR];
884 static const hb_tag_t GSUBTag = HB_OT_TAG_GSUB;
885 static const hb_tag_t GPOSTag = HB_OT_TAG_GPOS;
887 inline unsigned int get_script_count (void) const
888 { return (this+scriptList).len; }
889 inline const Tag& get_script_tag (unsigned int i) const
890 { return (this+scriptList).get_tag (i); }
891 inline unsigned int get_script_tags (unsigned int start_offset,
892 unsigned int *script_count /* IN/OUT */,
893 hb_tag_t *script_tags /* OUT */) const
894 { return (this+scriptList).get_tags (start_offset, script_count, script_tags); }
895 inline const Script& get_script (unsigned int i) const
896 { return (this+scriptList)[i]; }
897 inline bool find_script_index (hb_tag_t tag, unsigned int *index) const
898 { return (this+scriptList).find_index (tag, index); }
900 inline unsigned int get_feature_count (void) const
901 { return (this+featureList).len; }
902 inline const Tag& get_feature_tag (unsigned int i) const
903 { return (this+featureList).get_tag (i); }
904 inline unsigned int get_feature_tags (unsigned int start_offset,
905 unsigned int *feature_count /* IN/OUT */,
906 hb_tag_t *feature_tags /* OUT */) const
907 { return (this+featureList).get_tags (start_offset, feature_count, feature_tags); }
908 inline const Feature& get_feature (unsigned int i) const
909 { return (this+featureList)[i]; }
910 inline bool find_feature_index (hb_tag_t tag, unsigned int *index) const
911 { return (this+featureList).find_index (tag, index); }
913 inline unsigned int get_lookup_count (void) const
914 { return (this+lookupList).len; }
915 inline const Lookup& get_lookup (unsigned int i) const
916 { return (this+lookupList)[i]; }
918 inline bool sanitize (hb_sanitize_context_t *context) {
920 return SANITIZE (version) && likely (version.major == 1)
921 && SANITIZE_WITH_BASE (this, scriptList)
922 && SANITIZE_WITH_BASE (this, featureList)
923 && SANITIZE_WITH_BASE (this, lookupList);
927 FixedVersion version; /* Version of the GSUB/GPOS table--initially set
930 scriptList; /* ScriptList table */
931 OffsetTo<FeatureList>
932 featureList; /* FeatureList table */
934 lookupList; /* LookupList table */
936 ASSERT_SIZE (GSUBGPOS, 10);
939 #endif /* HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH */