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
39 #define TRACE_APPLY_ARG_DEF , unsigned int apply_depth
40 #define TRACE_APPLY_ARG , apply_depth + 1
41 #define TRACE_APPLY_ARG_INIT , 1
42 #define TRACE_APPLY() \
44 if (apply_depth < HB_DEBUG_APPLY) \
45 fprintf (stderr, "APPLY(%p) %-*d-> %s\n", \
46 (CONST_CHARP (this) == NullPool) ? 0 : this, \
47 apply_depth, apply_depth, \
48 __PRETTY_FUNCTION__); \
51 #define TRACE_APPLY_ARG_DEF
52 #define TRACE_APPLY_ARG
53 #define TRACE_APPLY_ARG_INIT
54 #define TRACE_APPLY() HB_STMT_START {} HB_STMT_END
57 #define APPLY_ARG_DEF \
58 hb_ot_layout_context_t *context, \
59 hb_buffer_t *buffer, \
60 unsigned int context_length HB_GNUC_UNUSED, \
61 unsigned int nesting_level_left HB_GNUC_UNUSED, \
62 unsigned int lookup_flag, \
63 unsigned int property HB_GNUC_UNUSED /* propety of first glyph */ \
73 #define APPLY_ARG_INIT \
83 typedef bool (*match_func_t) (hb_codepoint_t glyph_id, const USHORT &value, char *data);
84 typedef bool (*apply_lookup_func_t) (APPLY_ARG_DEF, unsigned int lookup_index);
89 apply_lookup_func_t apply;
93 static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, char *data)
95 return glyph_id == value;
98 static inline bool match_class (hb_codepoint_t glyph_id, const USHORT &value, char *data)
100 const ClassDef &class_def = *reinterpret_cast<const ClassDef *>(data);
101 return class_def.get_class (glyph_id) == value;
104 static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value, char *data)
106 const OffsetTo<Coverage> &coverage = (const OffsetTo<Coverage>&)value;
107 return (data+coverage) (glyph_id) != NOT_COVERED;
111 static inline bool match_input (APPLY_ARG_DEF,
112 unsigned int count, /* Including the first glyph (not matched) */
113 const USHORT input[], /* Array of input values--start with second glyph */
114 match_func_t match_func,
116 unsigned int *context_length_out)
119 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
120 if (HB_UNLIKELY (buffer->in_pos + count > end))
123 for (i = 1, j = buffer->in_pos + 1; i < count; i++, j++)
125 while (_hb_ot_layout_skip_mark (context->face, IN_INFO (j), lookup_flag, NULL))
127 if (HB_UNLIKELY (j + count - i == end))
132 if (HB_LIKELY (!match_func (IN_GLYPH (j), input[i - 1], match_data)))
136 *context_length_out = j - buffer->in_pos;
141 static inline bool match_backtrack (APPLY_ARG_DEF,
143 const USHORT backtrack[],
144 match_func_t match_func,
147 if (HB_UNLIKELY (buffer->out_pos < count))
150 for (unsigned int i = 0, j = buffer->out_pos - 1; i < count; i++, j--)
152 while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
154 if (HB_UNLIKELY (j + 1 == count - i))
159 if (HB_LIKELY (!match_func (OUT_GLYPH (j), backtrack[i], match_data)))
166 static inline bool match_lookahead (APPLY_ARG_DEF,
168 const USHORT lookahead[],
169 match_func_t match_func,
174 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
175 if (HB_UNLIKELY (buffer->in_pos + offset + count > end))
178 for (i = 0, j = buffer->in_pos + offset; i < count; i++, j++)
180 while (_hb_ot_layout_skip_mark (context->face, OUT_INFO (j), lookup_flag, NULL))
182 if (HB_UNLIKELY (j + count - i == end))
187 if (HB_LIKELY (!match_func (IN_GLYPH (j), lookahead[i], match_data)))
198 inline bool sanitize (SANITIZE_ARG_DEF) {
200 return SANITIZE_SELF ();
203 USHORT sequenceIndex; /* Index into current glyph
204 * sequence--first glyph = 0 */
205 USHORT lookupListIndex; /* Lookup to apply to that
206 * position--zero--based */
208 ASSERT_SIZE (LookupRecord, 4);
210 static inline bool apply_lookup (APPLY_ARG_DEF,
211 unsigned int count, /* Including the first glyph */
212 unsigned int lookupCount,
213 const LookupRecord lookupRecord[], /* Array of LookupRecords--in design order */
214 apply_lookup_func_t apply_func)
216 unsigned int end = MIN (buffer->in_length, buffer->in_pos + context_length);
217 if (HB_UNLIKELY (buffer->in_pos + count > end))
220 /* TODO We don't support lookupRecord arrays that are not increasing:
221 * Should be easy for in_place ones at least. */
223 /* Note: If sublookup is reverse, i will underflow after the first loop
224 * and we jump out of it. Not entirely disastrous. So we don't check
225 * for reverse lookup here.
227 for (unsigned int i = 0; i < count; /* NOP */)
229 while (_hb_ot_layout_skip_mark (context->face, IN_CURINFO (), lookup_flag, NULL))
231 if (HB_UNLIKELY (buffer->in_pos == end))
233 /* No lookup applied for this index */
234 _hb_buffer_next_glyph (buffer);
237 if (lookupCount && i == lookupRecord->sequenceIndex)
239 unsigned int old_pos = buffer->in_pos;
242 bool done = apply_func (APPLY_ARG, lookupRecord->lookupListIndex);
246 /* Err, this is wrong if the lookup jumped over some glyphs */
247 i += buffer->in_pos - old_pos;
248 if (HB_UNLIKELY (buffer->in_pos == end))
257 /* No lookup applied for this index */
258 _hb_buffer_next_glyph (buffer);
267 /* Contextual lookups */
269 struct ContextLookupContext
275 static inline bool context_lookup (APPLY_ARG_DEF,
276 unsigned int inputCount, /* Including the first glyph (not matched) */
277 const USHORT input[], /* Array of input values--start with second glyph */
278 unsigned int lookupCount,
279 const LookupRecord lookupRecord[],
280 ContextLookupContext &lookup_context)
282 return match_input (APPLY_ARG,
284 lookup_context.funcs.match, lookup_context.match_data,
286 apply_lookup (APPLY_ARG,
288 lookupCount, lookupRecord,
289 lookup_context.funcs.apply);
294 friend struct RuleSet;
297 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
300 const LookupRecord *lookupRecord = &CONST_CAST (LookupRecord, input, sizeof (input[0]) * (inputCount ? inputCount - 1 : 0));
301 return context_lookup (APPLY_ARG,
303 lookupCount, lookupRecord,
308 inline bool sanitize (SANITIZE_ARG_DEF) {
310 if (!(SANITIZE (inputCount) && SANITIZE (lookupCount))) return false;
311 return SANITIZE_MEM (input,
312 sizeof (input[0]) * inputCount +
313 sizeof (lookupRecordX[0]) * lookupCount);
317 USHORT inputCount; /* Total number of glyphs in input
318 * glyph sequence--includes the first
320 USHORT lookupCount; /* Number of LookupRecords */
321 USHORT input[VAR]; /* Array of match inputs--start with
323 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
326 ASSERT_SIZE_VAR2 (Rule, 4, USHORT, LookupRecord);
330 inline bool apply (APPLY_ARG_DEF, ContextLookupContext &lookup_context) const
333 unsigned int num_rules = rule.len;
334 for (unsigned int i = 0; i < num_rules; i++)
336 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
343 inline bool sanitize (SANITIZE_ARG_DEF) {
345 return SANITIZE_THIS (rule);
350 rule; /* Array of Rule tables
351 * ordered by preference */
355 struct ContextFormat1
357 friend struct Context;
360 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
363 unsigned int index = (this+coverage) (IN_CURGLYPH ());
364 if (HB_LIKELY (index == NOT_COVERED))
367 const RuleSet &rule_set = this+ruleSet[index];
368 struct ContextLookupContext lookup_context = {
369 {match_glyph, apply_func},
372 return rule_set.apply (APPLY_ARG, lookup_context);
375 inline bool sanitize (SANITIZE_ARG_DEF) {
377 return SANITIZE_THIS2 (coverage, ruleSet);
381 USHORT format; /* Format identifier--format = 1 */
383 coverage; /* Offset to Coverage table--from
384 * beginning of table */
385 OffsetArrayOf<RuleSet>
386 ruleSet; /* Array of RuleSet tables
387 * ordered by Coverage Index */
389 ASSERT_SIZE (ContextFormat1, 6);
392 struct ContextFormat2
394 friend struct Context;
397 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
400 unsigned int index = (this+coverage) (IN_CURGLYPH ());
401 if (HB_LIKELY (index == NOT_COVERED))
404 const ClassDef &class_def = this+classDef;
405 index = class_def (IN_CURGLYPH ());
406 const RuleSet &rule_set = this+ruleSet[index];
407 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
408 * them across subrule lookups. Not sure it's worth it.
410 struct ContextLookupContext lookup_context = {
411 {match_class, apply_func},
412 DECONST_CHARP(&class_def)
414 return rule_set.apply (APPLY_ARG, lookup_context);
417 inline bool sanitize (SANITIZE_ARG_DEF) {
419 return SANITIZE_THIS3 (coverage, classDef, ruleSet);
423 USHORT format; /* Format identifier--format = 2 */
425 coverage; /* Offset to Coverage table--from
426 * beginning of table */
428 classDef; /* Offset to glyph ClassDef table--from
429 * beginning of table */
430 OffsetArrayOf<RuleSet>
431 ruleSet; /* Array of RuleSet tables
432 * ordered by class */
434 ASSERT_SIZE (ContextFormat2, 8);
437 struct ContextFormat3
439 friend struct Context;
442 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
445 unsigned int index = (this+coverage[0]) (IN_CURGLYPH ());
446 if (HB_LIKELY (index == NOT_COVERED))
449 const LookupRecord *lookupRecord = &CONST_CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
450 struct ContextLookupContext lookup_context = {
451 {match_coverage, apply_func},
454 return context_lookup (APPLY_ARG,
455 glyphCount, (const USHORT *) (coverage + 1),
456 lookupCount, lookupRecord,
460 inline bool sanitize (SANITIZE_ARG_DEF) {
462 if (!SANITIZE_SELF ()) return false;
463 unsigned int count = glyphCount;
464 for (unsigned int i = 0; i < count; i++)
465 if (!SANITIZE_THIS (coverage[i])) return false;
466 LookupRecord *lookupRecord = &CAST(LookupRecord, coverage, sizeof (coverage[0]) * glyphCount);
467 return SANITIZE_MEM (lookupRecord, sizeof (lookupRecord[0]) * lookupCount);
471 USHORT format; /* Format identifier--format = 3 */
472 USHORT glyphCount; /* Number of glyphs in the input glyph
474 USHORT lookupCount; /* Number of LookupRecords */
476 coverage[VAR]; /* Array of offsets to Coverage
477 * table in glyph sequence order */
478 LookupRecord lookupRecordX[VAR]; /* Array of LookupRecords--in
481 ASSERT_SIZE_VAR2 (ContextFormat3, 6, OffsetTo<Coverage>, LookupRecord);
486 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
490 case 1: return u.format1->apply (APPLY_ARG, apply_func);
491 case 2: return u.format2->apply (APPLY_ARG, apply_func);
492 case 3: return u.format3->apply (APPLY_ARG, apply_func);
493 default:return false;
497 inline bool sanitize (SANITIZE_ARG_DEF) {
499 if (!SANITIZE (u.format)) return false;
501 case 1: return u.format1->sanitize (SANITIZE_ARG);
502 case 2: return u.format2->sanitize (SANITIZE_ARG);
503 case 3: return u.format3->sanitize (SANITIZE_ARG);
510 USHORT format; /* Format identifier */
511 ContextFormat1 format1[VAR];
512 ContextFormat2 format2[VAR];
513 ContextFormat3 format3[VAR];
518 /* Chaining Contextual lookups */
520 struct ChainContextLookupContext
526 static inline bool chain_context_lookup (APPLY_ARG_DEF,
527 unsigned int backtrackCount,
528 const USHORT backtrack[],
529 unsigned int inputCount, /* Including the first glyph (not matched) */
530 const USHORT input[], /* Array of input values--start with second glyph */
531 unsigned int lookaheadCount,
532 const USHORT lookahead[],
533 unsigned int lookupCount,
534 const LookupRecord lookupRecord[],
535 ChainContextLookupContext &lookup_context)
538 if (HB_UNLIKELY (buffer->out_pos < backtrackCount ||
539 buffer->in_pos + inputCount + lookaheadCount > buffer->in_length ||
540 inputCount + lookaheadCount > context_length))
544 return match_backtrack (APPLY_ARG,
545 backtrackCount, backtrack,
546 lookup_context.funcs.match, lookup_context.match_data[0]) &&
547 match_input (APPLY_ARG,
549 lookup_context.funcs.match, lookup_context.match_data[1],
551 match_lookahead (APPLY_ARG,
552 lookaheadCount, lookahead,
553 lookup_context.funcs.match, lookup_context.match_data[2],
555 (context_length = offset, true) &&
556 apply_lookup (APPLY_ARG,
558 lookupCount, lookupRecord,
559 lookup_context.funcs.apply);
564 friend struct ChainRuleSet;
567 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
570 const HeadlessArrayOf<USHORT> &input = CONST_NEXT (HeadlessArrayOf<USHORT>, backtrack);
571 const ArrayOf<USHORT> &lookahead = CONST_NEXT (ArrayOf<USHORT>, input);
572 const ArrayOf<LookupRecord> &lookup = CONST_NEXT (ArrayOf<LookupRecord>, lookahead);
573 return chain_context_lookup (APPLY_ARG,
574 backtrack.len, backtrack.const_array(),
575 input.len, input.const_array(),
576 lookahead.len, lookahead.const_array(),
577 lookup.len, lookup.const_array(),
583 inline bool sanitize (SANITIZE_ARG_DEF) {
585 if (!SANITIZE (backtrack)) return false;
586 HeadlessArrayOf<USHORT> &input = NEXT (HeadlessArrayOf<USHORT>, backtrack);
587 if (!SANITIZE (input)) return false;
588 ArrayOf<USHORT> &lookahead = NEXT (ArrayOf<USHORT>, input);
589 if (!SANITIZE (lookahead)) return false;
590 ArrayOf<LookupRecord> &lookup = NEXT (ArrayOf<LookupRecord>, lookahead);
591 return SANITIZE (lookup);
596 backtrack; /* Array of backtracking values
597 * (to be matched before the input
599 HeadlessArrayOf<USHORT>
600 inputX; /* Array of input values (start with
603 lookaheadX; /* Array of lookahead values's (to be
604 * matched after the input sequence) */
605 ArrayOf<LookupRecord>
606 lookupX; /* Array of LookupRecords--in
609 ASSERT_SIZE (ChainRule, 8);
613 inline bool apply (APPLY_ARG_DEF, ChainContextLookupContext &lookup_context) const
616 unsigned int num_rules = rule.len;
617 for (unsigned int i = 0; i < num_rules; i++)
619 if ((this+rule[i]).apply (APPLY_ARG, lookup_context))
626 inline bool sanitize (SANITIZE_ARG_DEF) {
628 return SANITIZE_THIS (rule);
632 OffsetArrayOf<ChainRule>
633 rule; /* Array of ChainRule tables
634 * ordered by preference */
636 ASSERT_SIZE (ChainRuleSet, 2);
638 struct ChainContextFormat1
640 friend struct ChainContext;
643 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
646 unsigned int index = (this+coverage) (IN_CURGLYPH ());
647 if (HB_LIKELY (index == NOT_COVERED))
650 const ChainRuleSet &rule_set = this+ruleSet[index];
651 struct ChainContextLookupContext lookup_context = {
652 {match_glyph, apply_func},
655 return rule_set.apply (APPLY_ARG, lookup_context);
658 inline bool sanitize (SANITIZE_ARG_DEF) {
660 return SANITIZE_THIS2 (coverage, ruleSet);
664 USHORT format; /* Format identifier--format = 1 */
666 coverage; /* Offset to Coverage table--from
667 * beginning of table */
668 OffsetArrayOf<ChainRuleSet>
669 ruleSet; /* Array of ChainRuleSet tables
670 * ordered by Coverage Index */
672 ASSERT_SIZE (ChainContextFormat1, 6);
674 struct ChainContextFormat2
676 friend struct ChainContext;
679 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
682 unsigned int index = (this+coverage) (IN_CURGLYPH ());
683 if (HB_LIKELY (index == NOT_COVERED))
686 const ClassDef &backtrack_class_def = this+backtrackClassDef;
687 const ClassDef &input_class_def = this+inputClassDef;
688 const ClassDef &lookahead_class_def = this+lookaheadClassDef;
690 index = input_class_def (IN_CURGLYPH ());
691 const ChainRuleSet &rule_set = this+ruleSet[index];
692 /* LONGTERMTODO: Old code fetches glyph classes at most once and caches
693 * them across subrule lookups. Not sure it's worth it.
695 struct ChainContextLookupContext lookup_context = {
696 {match_class, apply_func},
697 {DECONST_CHARP(&backtrack_class_def),
698 DECONST_CHARP(&input_class_def),
699 DECONST_CHARP(&lookahead_class_def)}
701 return rule_set.apply (APPLY_ARG, lookup_context);
704 inline bool sanitize (SANITIZE_ARG_DEF) {
706 return SANITIZE_THIS2 (coverage, backtrackClassDef) &&
707 SANITIZE_THIS2 (inputClassDef, lookaheadClassDef) &&
708 SANITIZE_THIS (ruleSet);
712 USHORT format; /* Format identifier--format = 2 */
714 coverage; /* Offset to Coverage table--from
715 * beginning of table */
717 backtrackClassDef; /* Offset to glyph ClassDef table
718 * containing backtrack sequence
719 * data--from beginning of table */
721 inputClassDef; /* Offset to glyph ClassDef
722 * table containing input sequence
723 * data--from beginning of table */
725 lookaheadClassDef; /* Offset to glyph ClassDef table
726 * containing lookahead sequence
727 * data--from beginning of table */
728 OffsetArrayOf<ChainRuleSet>
729 ruleSet; /* Array of ChainRuleSet tables
730 * ordered by class */
732 ASSERT_SIZE (ChainContextFormat2, 12);
734 struct ChainContextFormat3
736 friend struct ChainContext;
740 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
743 const OffsetArrayOf<Coverage> &input = CONST_NEXT (OffsetArrayOf<Coverage>, backtrack);
745 unsigned int index = (this+input[0]) (IN_CURGLYPH ());
746 if (HB_LIKELY (index == NOT_COVERED))
749 const OffsetArrayOf<Coverage> &lookahead = CONST_NEXT (OffsetArrayOf<Coverage>, input);
750 const ArrayOf<LookupRecord> &lookup = CONST_NEXT (ArrayOf<LookupRecord>, lookahead);
751 struct ChainContextLookupContext lookup_context = {
752 {match_coverage, apply_func},
753 {DECONST_CHARP(this), DECONST_CHARP(this), DECONST_CHARP(this)}
755 return chain_context_lookup (APPLY_ARG,
756 backtrack.len, (const USHORT *) backtrack.const_array(),
757 input.len, (const USHORT *) input.const_array() + 1,
758 lookahead.len, (const USHORT *) lookahead.const_array(),
759 lookup.len, lookup.const_array(),
764 inline bool sanitize (SANITIZE_ARG_DEF) {
766 if (!SANITIZE_THIS (backtrack)) return false;
767 OffsetArrayOf<Coverage> &input = NEXT (OffsetArrayOf<Coverage>, backtrack);
768 if (!SANITIZE_THIS (input)) return false;
769 OffsetArrayOf<Coverage> &lookahead = NEXT (OffsetArrayOf<Coverage>, input);
770 if (!SANITIZE_THIS (lookahead)) return false;
771 ArrayOf<LookupRecord> &lookup = NEXT (ArrayOf<LookupRecord>, lookahead);
772 return SANITIZE (lookup);
776 USHORT format; /* Format identifier--format = 3 */
777 OffsetArrayOf<Coverage>
778 backtrack; /* Array of coverage tables
779 * in backtracking sequence, in glyph
781 OffsetArrayOf<Coverage>
782 inputX ; /* Array of coverage
783 * tables in input sequence, in glyph
785 OffsetArrayOf<Coverage>
786 lookaheadX; /* Array of coverage tables
787 * in lookahead sequence, in glyph
789 ArrayOf<LookupRecord>
790 lookupX; /* Array of LookupRecords--in
793 ASSERT_SIZE (ChainContextFormat3, 10);
798 inline bool apply (APPLY_ARG_DEF, apply_lookup_func_t apply_func) const
802 case 1: return u.format1->apply (APPLY_ARG, apply_func);
803 case 2: return u.format2->apply (APPLY_ARG, apply_func);
804 case 3: return u.format3->apply (APPLY_ARG, apply_func);
805 default:return false;
809 inline bool sanitize (SANITIZE_ARG_DEF) {
811 if (!SANITIZE (u.format)) return false;
813 case 1: return u.format1->sanitize (SANITIZE_ARG);
814 case 2: return u.format2->sanitize (SANITIZE_ARG);
815 case 3: return u.format3->sanitize (SANITIZE_ARG);
822 USHORT format; /* Format identifier */
823 ChainContextFormat1 format1[VAR];
824 ChainContextFormat2 format2[VAR];
825 ChainContextFormat3 format3[VAR];
830 struct ExtensionFormat1
832 friend struct Extension;
835 inline unsigned int get_type (void) const { return extensionLookupType; }
836 inline unsigned int get_offset (void) const { return (extensionOffset[0] << 16) + extensionOffset[1]; }
837 inline const LookupSubTable& get_subtable (void) const
839 unsigned int offset = get_offset ();
840 if (HB_UNLIKELY (!offset)) return Null(LookupSubTable);
841 return CONST_CAST (LookupSubTable, *this, offset);
844 inline bool sanitize (SANITIZE_ARG_DEF) {
846 return SANITIZE_SELF ();
850 USHORT format; /* Format identifier. Set to 1. */
851 USHORT extensionLookupType; /* Lookup type of subtable referenced
852 * by ExtensionOffset (i.e. the
853 * extension subtable). */
854 USHORT extensionOffset[2]; /* Offset to the extension subtable,
855 * of lookup type subtable.
856 * Defined as two shorts to avoid
857 * alignment requirements. */
859 ASSERT_SIZE (ExtensionFormat1, 8);
863 inline unsigned int get_type (void) const
866 case 1: return u.format1->get_type ();
870 inline const LookupSubTable& get_subtable (void) const
873 case 1: return u.format1->get_subtable ();
874 default:return Null(LookupSubTable);
878 inline bool sanitize (SANITIZE_ARG_DEF) {
880 if (!SANITIZE (u.format)) return false;
882 case 1: return u.format1->sanitize (SANITIZE_ARG);
889 USHORT format; /* Format identifier */
890 ExtensionFormat1 format1[VAR];
901 static const hb_tag_t GSUBTag = HB_OT_TAG_GSUB;
902 static const hb_tag_t GPOSTag = HB_OT_TAG_GPOS;
904 STATIC_DEFINE_GET_FOR_DATA_CHECK_MAJOR_VERSION (GSUBGPOS, 1, 1);
906 inline unsigned int get_script_count (void) const
907 { return (this+scriptList).len; }
908 inline const Tag& get_script_tag (unsigned int i) const
909 { return (this+scriptList).get_tag (i); }
910 inline bool get_script_tags (unsigned int *script_count /* IN/OUT */,
911 hb_tag_t *script_tags /* OUT */) const
912 { return (this+scriptList).get_tags (script_count, script_tags); }
913 inline const Script& get_script (unsigned int i) const
914 { return (this+scriptList)[i]; }
915 inline bool find_script_index (hb_tag_t tag, unsigned int *index) const
916 { return (this+scriptList).find_index (tag, index); }
918 inline unsigned int get_feature_count (void) const
919 { return (this+featureList).len; }
920 inline const Tag& get_feature_tag (unsigned int i) const
921 { return (this+featureList).get_tag (i); }
922 inline bool get_feature_tags (unsigned int *feature_count /* IN/OUT */,
923 hb_tag_t *feature_tags /* OUT */) const
924 { return (this+featureList).get_tags (feature_count, feature_tags); }
925 inline const Feature& get_feature (unsigned int i) const
926 { return (this+featureList)[i]; }
927 inline bool find_feature_index (hb_tag_t tag, unsigned int *index) const
928 { return (this+featureList).find_index (tag, index); }
930 inline unsigned int get_lookup_count (void) const
931 { return (this+lookupList).len; }
932 inline const Lookup& get_lookup (unsigned int i) const
933 { return (this+lookupList)[i]; }
935 inline bool sanitize (SANITIZE_ARG_DEF) {
937 if (!SANITIZE (version)) return false;
938 if (version.major != 1) return true;
939 return SANITIZE_THIS3 (scriptList, featureList, lookupList);
943 FixedVersion version; /* Version of the GSUB/GPOS table--initially set
946 scriptList; /* ScriptList table */
947 OffsetTo<FeatureList>
948 featureList; /* FeatureList table */
950 lookupList; /* LookupList table */
952 ASSERT_SIZE (GSUBGPOS, 10);
955 #endif /* HB_OT_LAYOUT_GSUBGPOS_PRIVATE_HH */