2 * Copyright (C) 2007,2008,2009 Red Hat, Inc.
4 * This is part of HarfBuzz, an OpenType Layout engine 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
40 #define TRACE_APPLY_ARG_DEF , unsigned int apply_depth
41 #define TRACE_APPLY_ARG , apply_depth + 1
42 #define TRACE_APPLY_ARG_INIT , 1
43 #define TRACE_APPLY() \
45 if (apply_depth < HB_DEBUG_APPLY) \
46 fprintf (stderr, "APPLY(%p) %-*d-> %s\n", \
47 (CONST_CHARP (this) == NullPool) ? 0 : this, \
48 apply_depth, apply_depth, \
49 __PRETTY_FUNCTION__); \
52 #define TRACE_APPLY_ARG_DEF
53 #define TRACE_APPLY_ARG
54 #define TRACE_APPLY_ARG_INIT
55 #define TRACE_APPLY() HB_STMT_START {} HB_STMT_END
58 #define APPLY_ARG_DEF \
59 hb_ot_layout_context_t *context, \
60 hb_buffer_t *buffer, \
61 unsigned int context_length HB_GNUC_UNUSED, \
62 unsigned int nesting_level_left HB_GNUC_UNUSED, \
63 unsigned int lookup_flag, \
64 unsigned int property HB_GNUC_UNUSED /* propety of first glyph */ \
74 #define APPLY_ARG_INIT \
84 typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, char *data);
85 typedef bool (*apply_lookup_func_t) (APPLY_ARG_DEF, unsigned int lookup_index);
90 apply_lookup_func_t apply;
94 static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, char *data)
96 return glyph_id == value;
99 static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, char *data)
101 const ClassDef &class_def = *reinterpret_cast<const ClassDef *>(data);
102 return class_def.get_class (glyph_id) == value;
105 static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, char *data)
107 const OffsetTo<Coverage> &coverage = (const OffsetTo<Coverage>&)value;
108 return (data+coverage) (glyph_id) != NOT_COVERED;
112 static inline bool match_input (APPLY_ARG_DEF,
113 unsigned int count, /* Including the first glyph (not matched) */
114 const USHORT input[], /* Array of input values--start with second glyph */
115 match_func_t match_func,
117 unsigned int *context_length_out)
120 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
121 if (HB_UNLIKELY (buffer->in_pos + count > end))
124 for (i = 1, j = buffer->in_pos + 1; i < count; i++, j++)
126 while (_hb_ot_layout_skip_mark (context->face, IN_INFO (j), lookup_flag, NULL))
128 if (HB_UNLIKELY (j + count - i == end))
133 if (HB_LIKELY (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
137 *context_length_out = j - buffer->in_pos;
142 static inline bool match_backtrack (APPLY_ARG_DEF,
144 const USHORT backtrack[],
145 match_func_t match_func,
148 if (HB_UNLIKELY (buffer->out_pos < count))
151 for (unsigned int i = 0, j = buffer->out_pos - 1; i < count; i++, j--)
153 while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
155 if (HB_UNLIKELY (j + 1 == count - i))
160 if (HB_LIKELY (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
167 static inline bool match_lookahead (APPLY_ARG_DEF,
169 const USHORT lookahead[],
170 match_func_t match_func,
175 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
176 if (HB_UNLIKELY (buffer->in_pos + offset + count > end))
179 for (i = 0, j = buffer->in_pos + offset; i < count; i++, j++)
181 while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
183 if (HB_UNLIKELY (j + count - i == end))
188 if (HB_LIKELY (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
199 inline bool sanitize (SANITIZE_ARG_DEF) {
201 return SANITIZE_SELF ();
204 USHORT sequenceIndex; /* Index into current glyph
205 * sequence--first glyph = 0 */
206 USHORT lookupListIndex; /* Lookup to apply to that
207 * position--zero--based */
209 ASSERT_SIZE (LookupRecord, 4);
211 static inline bool apply_lookup (APPLY_ARG_DEF,
212 unsigned int count, /* Including the first glyph */
213 unsigned int lookupCount,
214 const LookupRecord lookupRecord[], /* Array of LookupRecords--in design order */
215 apply_lookup_func_t apply_func)
217 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
218 if (HB_UNLIKELY (buffer->in_pos + count > end))
221 /* TODO We don't support lookupRecord arrays that are not increasing:
222 * Should be easy for in_place ones at least. */
224 /* Note: If sublookup is reverse, i will underflow after the first loop
225 * and we jump out of it. Not entirely disastrous. So we don't check
226 * for reverse lookup here.
228 for (unsigned int i = 0; i < count; /* NOP */)
230 while (_hb_ot_layout_skip_mark (context->face, IN_CURINFO (), lookup_flag, NULL))
232 if (HB_UNLIKELY (buffer->in_pos == end))
234 /* No lookup applied for this index */
235 _hb_buffer_next_glyph (buffer);
238 if (lookupCount && i == lookupRecord->sequenceIndex)
240 unsigned int old_pos = buffer->in_pos;
243 bool done = apply_func (APPLY_ARG, lookupRecord->lookupListIndex);
247 /* Err, this is wrong if the lookup jumped over some glyphs */
248 i += buffer->in_pos - old_pos;
249 if (HB_UNLIKELY (buffer->in_pos == end))
258 /* No lookup applied for this index */
259 _hb_buffer_next_glyph (buffer);
268 /* Contextual lookups */
270 struct ContextLookupContext
276 static inline bool context_lookup (APPLY_ARG_DEF,
277 unsigned int inputCount, /* Including the first glyph (not matched) */
278 const USHORT input[], /* Array of input values--start with second glyph */
279 unsigned int lookupCount,
280 const LookupRecord lookupRecord[],
281 ContextLookupContext &lookup_context)
283 return match_input (APPLY_ARG,
285 lookup_context.funcs.match, lookup_context.match_data,
287 apply_lookup (APPLY_ARG,
289 lookupCount, lookupRecord,
290 lookup_context.funcs.apply);
295 friend struct RuleSet;
298 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
301 const LookupRecord *lookupRecord = &CONST_CAST (LookupRecord, input, sizeof (input[0]) * (inputCount ? inputCount - 1 : 0));
302 return context_lookup (APPLY_ARG,
304 lookupCount, lookupRecord,
309 inline bool sanitize (SANITIZE_ARG_DEF) {
311 if (!(SANITIZE (inputCount) && SANITIZE (lookupCount))) return false;
312 return SANITIZE_MEM (input,
313 sizeof (input[0]) * inputCount +
314 sizeof (lookupRecordX[0]) * lookupCount);
318 USHORT inputCount; /* Total number of glyphs in input
319 * glyph sequence--includes the first
321 USHORT lookupCount; /* Number of LookupRecords */
322 USHORT input[VAR]; /* Array of match inputs--start with
324 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
327 ASSERT_SIZE_VAR2 (Rule, 4, USHORT, LookupRecord);
331 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
334 unsigned int num_rules = rule.len;
335 for (unsigned int i = 0; i < num_rules; i++)
337 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
344 inline bool sanitize (SANITIZE_ARG_DEF) {
346 return SANITIZE_THIS (rule);
351 rule; /* Array of Rule tables
352 * ordered by preference */
356 struct ContextFormat1
358 friend struct Context;
361 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
364 unsigned int index = (this+coverage) (IN_CURGLYPH ());
365 if (HB_LIKELY (index == NOT_COVERED))
368 const RuleSet &rule_set = this+ruleSet[index];
369 struct ContextLookupContext lookup_context = {
370 {match_glyph, apply_func},
373 return rule_set.apply (APPLY_ARG, lookup_context);
376 inline bool sanitize (SANITIZE_ARG_DEF) {
378 return SANITIZE_THIS2 (coverage, ruleSet);
382 USHORT format; /* Format identifier--format = 1 */
384 coverage; /* Offset to Coverage table--from
385 * beginning of table */
386 OffsetArrayOf<RuleSet>
387 ruleSet; /* Array of RuleSet tables
388 * ordered by Coverage Index */
390 ASSERT_SIZE (ContextFormat1, 6);
393 struct ContextFormat2
395 friend struct Context;
398 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
401 unsigned int index = (this+coverage) (IN_CURGLYPH ());
402 if (HB_LIKELY (index == NOT_COVERED))
405 const ClassDef &class_def = this+classDef;
406 index = class_def (IN_CURGLYPH ());
407 const RuleSet &rule_set = this+ruleSet[index];
408 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
409 * them across subrule lookups. Not sure it's worth it.
411 struct ContextLookupContext lookup_context = {
412 {match_class, apply_func},
413 DECONST_CHARP(&class_def)
415 return rule_set.apply (APPLY_ARG, lookup_context);
418 inline bool sanitize (SANITIZE_ARG_DEF) {
420 return SANITIZE_THIS3 (coverage, classDef, ruleSet);
424 USHORT format; /* Format identifier--format = 2 */
426 coverage; /* Offset to Coverage table--from
427 * beginning of table */
429 classDef; /* Offset to glyph ClassDef table--from
430 * beginning of table */
431 OffsetArrayOf<RuleSet>
432 ruleSet; /* Array of RuleSet tables
433 * ordered by class */
435 ASSERT_SIZE (ContextFormat2, 8);
438 struct ContextFormat3
440 friend struct Context;
443 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
446 unsigned int index = (this+coverage[0]) (IN_CURGLYPH ());
447 if (HB_LIKELY (index == NOT_COVERED))
450 const LookupRecord *lookupRecord = &CONST_CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
451 struct ContextLookupContext lookup_context = {
452 {match_coverage, apply_func},
455 return context_lookup (APPLY_ARG,
456 glyphCount, (const USHORT *) (coverage + 1),
457 lookupCount, lookupRecord,
461 inline bool sanitize (SANITIZE_ARG_DEF) {
463 if (!SANITIZE_SELF ()) return false;
464 unsigned int count = glyphCount;
465 for (unsigned int i = 0; i < count; i++)
466 if (!SANITIZE_THIS (coverage[i])) return false;
467 LookupRecord *lookupRecord = &CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
468 return SANITIZE_MEM (lookupRecord, sizeof (lookupRecord[0]) * lookupCount);
472 USHORT format; /* Format identifier--format = 3 */
473 USHORT glyphCount; /* Number of glyphs in the input glyph
475 USHORT lookupCount; /* Number of LookupRecords */
477 coverage[VAR]; /* Array of offsets to Coverage
478 * table in glyph sequence order */
479 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
482 ASSERT_SIZE_VAR2 (ContextFormat3, 6, OffsetTo<Coverage>, LookupRecord);
487 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
491 case 1: return u.format1->apply (APPLY_ARG, apply_func);
492 case 2: return u.format2->apply (APPLY_ARG, apply_func);
493 case 3: return u.format3->apply (APPLY_ARG, apply_func);
494 default:return false;
498 inline bool sanitize (SANITIZE_ARG_DEF) {
500 if (!SANITIZE (u.format)) return false;
502 case 1: return u.format1->sanitize (SANITIZE_ARG);
503 case 2: return u.format2->sanitize (SANITIZE_ARG);
504 case 3: return u.format3->sanitize (SANITIZE_ARG);
511 USHORT format; /* Format identifier */
512 ContextFormat1 format1[VAR];
513 ContextFormat2 format2[VAR];
514 ContextFormat3 format3[VAR];
519 /* Chaining Contextual lookups */
521 struct ChainContextLookupContext
527 static inline bool chain_context_lookup (APPLY_ARG_DEF,
528 unsigned int backtrackCount,
529 const USHORT backtrack[],
530 unsigned int inputCount, /* Including the first glyph (not matched) */
531 const USHORT input[], /* Array of input values--start with second glyph */
532 unsigned int lookaheadCount,
533 const USHORT lookahead[],
534 unsigned int lookupCount,
535 const LookupRecord lookupRecord[],
536 ChainContextLookupContext &lookup_context)
539 if (HB_UNLIKELY (buffer->out_pos < backtrackCount ||
540 buffer->in_pos + inputCount + lookaheadCount > buffer->in_length ||
541 inputCount + lookaheadCount > context_length))
545 return match_backtrack (APPLY_ARG,
546 backtrackCount, backtrack,
547 lookup_context.funcs.match, lookup_context.match_data[0]) &&
548 match_input (APPLY_ARG,
550 lookup_context.funcs.match, lookup_context.match_data[1],
552 match_lookahead (APPLY_ARG,
553 lookaheadCount, lookahead,
554 lookup_context.funcs.match, lookup_context.match_data[2],
556 (context_length = offset, true) &&
557 apply_lookup (APPLY_ARG,
559 lookupCount, lookupRecord,
560 lookup_context.funcs.apply);
565 friend struct ChainRuleSet;
568 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
571 const HeadlessArrayOf<USHORT> &input = CONST_NEXT (HeadlessArrayOf<USHORT>, backtrack);
572 const ArrayOf<USHORT> &lookahead = CONST_NEXT (ArrayOf<USHORT>, input);
573 const ArrayOf<LookupRecord> &lookup = CONST_NEXT (ArrayOf<LookupRecord>, lookahead);
574 return chain_context_lookup (APPLY_ARG,
575 backtrack.len, backtrack.const_array(),
576 input.len, input.const_array(),
577 lookahead.len, lookahead.const_array(),
578 lookup.len, lookup.const_array(),
584 inline bool sanitize (SANITIZE_ARG_DEF) {
586 if (!SANITIZE (backtrack)) return false;
587 HeadlessArrayOf<USHORT> &input = NEXT (HeadlessArrayOf<USHORT>, backtrack);
588 if (!SANITIZE (input)) return false;
589 ArrayOf<USHORT> &lookahead = NEXT (ArrayOf<USHORT>, input);
590 if (!SANITIZE (lookahead)) return false;
591 ArrayOf<LookupRecord> &lookup = NEXT (ArrayOf<LookupRecord>, lookahead);
592 return SANITIZE (lookup);
597 backtrack; /* Array of backtracking values
598 * (to be matched before the input
600 HeadlessArrayOf<USHORT>
601 inputX; /* Array of input values (start with
604 lookaheadX; /* Array of lookahead values's (to be
605 * matched after the input sequence) */
606 ArrayOf<LookupRecord>
607 lookupX; /* Array of LookupRecords--in
610 ASSERT_SIZE (ChainRule, 8);
614 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
617 unsigned int num_rules = rule.len;
618 for (unsigned int i = 0; i < num_rules; i++)
620 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
627 inline bool sanitize (SANITIZE_ARG_DEF) {
629 return SANITIZE_THIS (rule);
633 OffsetArrayOf<ChainRule>
634 rule; /* Array of ChainRule tables
635 * ordered by preference */
637 ASSERT_SIZE (ChainRuleSet, 2);
639 struct ChainContextFormat1
641 friend struct ChainContext;
644 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
647 unsigned int index = (this+coverage) (IN_CURGLYPH ());
648 if (HB_LIKELY (index == NOT_COVERED))
651 const ChainRuleSet &rule_set = this+ruleSet[index];
652 struct ChainContextLookupContext lookup_context = {
653 {match_glyph, apply_func},
656 return rule_set.apply (APPLY_ARG, lookup_context);
659 inline bool sanitize (SANITIZE_ARG_DEF) {
661 return SANITIZE_THIS2 (coverage, ruleSet);
665 USHORT format; /* Format identifier--format = 1 */
667 coverage; /* Offset to Coverage table--from
668 * beginning of table */
669 OffsetArrayOf<ChainRuleSet>
670 ruleSet; /* Array of ChainRuleSet tables
671 * ordered by Coverage Index */
673 ASSERT_SIZE (ChainContextFormat1, 6);
675 struct ChainContextFormat2
677 friend struct ChainContext;
680 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
683 unsigned int index = (this+coverage) (IN_CURGLYPH ());
684 if (HB_LIKELY (index == NOT_COVERED))
687 const ClassDef &backtrack_class_def = this+backtrackClassDef;
688 const ClassDef &input_class_def = this+inputClassDef;
689 const ClassDef &lookahead_class_def = this+lookaheadClassDef;
691 index = input_class_def (IN_CURGLYPH ());
692 const ChainRuleSet &rule_set = this+ruleSet[index];
693 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
694 * them across subrule lookups. Not sure it's worth it.
696 struct ChainContextLookupContext lookup_context = {
697 {match_class, apply_func},
698 {DECONST_CHARP(&backtrack_class_def),
699 DECONST_CHARP(&input_class_def),
700 DECONST_CHARP(&lookahead_class_def)}
702 return rule_set.apply (APPLY_ARG, lookup_context);
705 inline bool sanitize (SANITIZE_ARG_DEF) {
707 return SANITIZE_THIS2 (coverage, backtrackClassDef) &&
708 SANITIZE_THIS2 (inputClassDef, lookaheadClassDef) &&
709 SANITIZE_THIS (ruleSet);
713 USHORT format; /* Format identifier--format = 2 */
715 coverage; /* Offset to Coverage table--from
716 * beginning of table */
718 backtrackClassDef; /* Offset to glyph ClassDef table
719 * containing backtrack sequence
720 * data--from beginning of table */
722 inputClassDef; /* Offset to glyph ClassDef
723 * table containing input sequence
724 * data--from beginning of table */
726 lookaheadClassDef; /* Offset to glyph ClassDef table
727 * containing lookahead sequence
728 * data--from beginning of table */
729 OffsetArrayOf<ChainRuleSet>
730 ruleSet; /* Array of ChainRuleSet tables
731 * ordered by class */
733 ASSERT_SIZE (ChainContextFormat2, 12);
735 struct ChainContextFormat3
737 friend struct ChainContext;
741 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
744 const OffsetArrayOf<Coverage> &input = CONST_NEXT (OffsetArrayOf<Coverage>, backtrack);
746 unsigned int index = (this+input[0]) (IN_CURGLYPH ());
747 if (HB_LIKELY (index == NOT_COVERED))
750 const OffsetArrayOf<Coverage> &lookahead = CONST_NEXT (OffsetArrayOf<Coverage>, input);
751 const ArrayOf<LookupRecord> &lookup = CONST_NEXT (ArrayOf<LookupRecord>, lookahead);
752 struct ChainContextLookupContext lookup_context = {
753 {match_coverage, apply_func},
754 {DECONST_CHARP(this), DECONST_CHARP(this), DECONST_CHARP(this)}
756 return chain_context_lookup (APPLY_ARG,
757 backtrack.len, (const USHORT *) backtrack.const_array(),
758 input.len, (const USHORT *) input.const_array() + 1,
759 lookahead.len, (const USHORT *) lookahead.const_array(),
760 lookup.len, lookup.const_array(),
765 inline bool sanitize (SANITIZE_ARG_DEF) {
767 if (!SANITIZE_THIS (backtrack)) return false;
768 OffsetArrayOf<Coverage> &input = NEXT (OffsetArrayOf<Coverage>, backtrack);
769 if (!SANITIZE_THIS (input)) return false;
770 OffsetArrayOf<Coverage> &lookahead = NEXT (OffsetArrayOf<Coverage>, input);
771 if (!SANITIZE_THIS (lookahead)) return false;
772 ArrayOf<LookupRecord> &lookup = NEXT (ArrayOf<LookupRecord>, lookahead);
773 return SANITIZE (lookup);
777 USHORT format; /* Format identifier--format = 3 */
778 OffsetArrayOf<Coverage>
779 backtrack; /* Array of coverage tables
780 * in backtracking sequence, in glyph
782 OffsetArrayOf<Coverage>
783 inputX ; /* Array of coverage
784 * tables in input sequence, in glyph
786 OffsetArrayOf<Coverage>
787 lookaheadX; /* Array of coverage tables
788 * in lookahead sequence, in glyph
790 ArrayOf<LookupRecord>
791 lookupX; /* Array of LookupRecords--in
794 ASSERT_SIZE (ChainContextFormat3, 10);
799 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
803 case 1: return u.format1->apply (APPLY_ARG, apply_func);
804 case 2: return u.format2->apply (APPLY_ARG, apply_func);
805 case 3: return u.format3->apply (APPLY_ARG, apply_func);
806 default:return false;
810 inline bool sanitize (SANITIZE_ARG_DEF) {
812 if (!SANITIZE (u.format)) return false;
814 case 1: return u.format1->sanitize (SANITIZE_ARG);
815 case 2: return u.format2->sanitize (SANITIZE_ARG);
816 case 3: return u.format3->sanitize (SANITIZE_ARG);
823 USHORT format; /* Format identifier */
824 ChainContextFormat1 format1[VAR];
825 ChainContextFormat2 format2[VAR];
826 ChainContextFormat3 format3[VAR];
831 struct ExtensionFormat1
833 friend struct Extension;
836 inline unsigned int get_type (void) const { return extensionLookupType; }
837 inline unsigned int get_offset (void) const { return (extensionOffset[0] << 16) + extensionOffset[1]; }
838 inline const LookupSubTable& get_subtable (void) const
840 unsigned int offset = get_offset ();
841 if (HB_UNLIKELY (!offset)) return Null(LookupSubTable);
842 return CONST_CAST (LookupSubTable, *this, offset);
845 inline bool sanitize (SANITIZE_ARG_DEF) {
847 return SANITIZE_SELF ();
851 USHORT format; /* Format identifier. Set to 1. */
852 USHORT extensionLookupType; /* Lookup type of subtable referenced
853 * by ExtensionOffset (i.e. the
854 * extension subtable). */
855 USHORT extensionOffset[2]; /* Offset to the extension subtable,
856 * of lookup type subtable.
857 * Defined as two shorts to avoid
858 * alignment requirements. */
860 ASSERT_SIZE (ExtensionFormat1, 8);
864 inline unsigned int get_type (void) const
867 case 1: return u.format1->get_type ();
871 inline const LookupSubTable& get_subtable (void) const
874 case 1: return u.format1->get_subtable ();
875 default:return Null(LookupSubTable);
879 inline bool sanitize (SANITIZE_ARG_DEF) {
881 if (!SANITIZE (u.format)) return false;
883 case 1: return u.format1->sanitize (SANITIZE_ARG);
890 USHORT format; /* Format identifier */
891 ExtensionFormat1 format1[VAR];
902 static const hb_tag_t GSUBTag = HB_OT_TAG_GSUB;
903 static const hb_tag_t GPOSTag = HB_OT_TAG_GPOS;
905 STATIC_DEFINE_GET_FOR_DATA_CHECK_MAJOR_VERSION (GSUBGPOS, 1, 1);
907 inline unsigned int get_script_count (void) const
908 { return (this+scriptList).len; }
909 inline const Tag& get_script_tag (unsigned int i) const
910 { return (this+scriptList).get_tag (i); }
911 inline unsigned int get_script_tags (unsigned int start_offset,
912 unsigned int *script_count /* IN/OUT */,
913 hb_tag_t *script_tags /* OUT */) const
914 { return (this+scriptList).get_tags (start_offset, script_count, script_tags); }
915 inline const Script& get_script (unsigned int i) const
916 { return (this+scriptList)[i]; }
917 inline bool find_script_index (hb_tag_t tag, unsigned int *index) const
918 { return (this+scriptList).find_index (tag, index); }
920 inline unsigned int get_feature_count (void) const
921 { return (this+featureList).len; }
922 inline const Tag& get_feature_tag (unsigned int i) const
923 { return (this+featureList).get_tag (i); }
924 inline unsigned int get_feature_tags (unsigned int start_offset,
925 unsigned int *feature_count /* IN/OUT */,
926 hb_tag_t *feature_tags /* OUT */) const
927 { return (this+featureList).get_tags (start_offset, feature_count, feature_tags); }
928 inline const Feature& get_feature (unsigned int i) const
929 { return (this+featureList)[i]; }
930 inline bool find_feature_index (hb_tag_t tag, unsigned int *index) const
931 { return (this+featureList).find_index (tag, index); }
933 inline unsigned int get_lookup_count (void) const
934 { return (this+lookupList).len; }
935 inline const Lookup& get_lookup (unsigned int i) const
936 { return (this+lookupList)[i]; }
938 inline bool sanitize (SANITIZE_ARG_DEF) {
940 if (!SANITIZE (version)) return false;
941 if (version.major != 1) return true;
942 return SANITIZE_THIS3 (scriptList, featureList, lookupList);
946 FixedVersion version; /* Version of the GSUB/GPOS table--initially set
949 scriptList; /* ScriptList table */
950 OffsetTo<FeatureList>
951 featureList; /* FeatureList table */
953 lookupList; /* LookupList table */
955 ASSERT_SIZE (GSUBGPOS, 10);
958 #endif /* HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH */