hb-ot-layout-gsub-private.h 28.6 KB
Newer Older
B
Behdad Esfahbod 已提交
1
/*
2
 * Copyright (C) 2007,2008,2009  Red Hat, Inc.
B
Behdad Esfahbod 已提交
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
 *
 *  This is part of HarfBuzz, an OpenType Layout engine library.
 *
 * Permission is hereby granted, without written agreement and without
 * license or royalty fees, to use, copy, modify, and distribute this
 * software and its documentation for any purpose, provided that the
 * above copyright notice and the following two paragraphs appear in
 * all copies of this software.
 *
 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 *
 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS
 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
 *
 * Red Hat Author(s): Behdad Esfahbod
 */

#ifndef HB_OT_LAYOUT_GSUB_PRIVATE_H
#define HB_OT_LAYOUT_GSUB_PRIVATE_H

B
Behdad Esfahbod 已提交
30
#include "hb-ot-layout-private.h"
B
Behdad Esfahbod 已提交
31 32 33 34

#include "hb-ot-layout-open-private.h"
#include "hb-ot-layout-gdef-private.h"

B
Behdad Esfahbod 已提交
35 36 37
#include "harfbuzz-buffer-private.h" /* XXX */

#define DEFINE_GET_GLYPH_COVERAGE(name) \
38
  inline unsigned int get_##name (hb_codepoint_t glyph) const { \
B
Behdad Esfahbod 已提交
39 40 41 42
    const Coverage &c = get_coverage (); \
    return c.get_coverage (glyph); \
  }

43 44 45 46 47 48 49 50 51 52 53 54
#define SUBTABLE_SUBSTITUTE_ARGS_DEF \
	hb_ot_layout_t *layout, \
	hb_buffer_t    *buffer, \
	unsigned int    context_length, \
	unsigned int    nesting_level_left, \
	unsigned int    lookup_flag
#define SUBTABLE_SUBSTITUTE_ARGS \
	layout, \
	buffer, \
	context_length, \
	nesting_level_left, \
	lookup_flag
B
Behdad Esfahbod 已提交
55 56

struct SingleSubstFormat1 {
B
Behdad Esfahbod 已提交
57 58 59 60

  friend struct SingleSubst;

  private:
B
Behdad Esfahbod 已提交
61 62 63
  DEFINE_GET_ACCESSOR (Coverage, coverage, coverage);
  DEFINE_GET_GLYPH_COVERAGE (glyph_coverage);

64
  inline bool single_substitute (hb_codepoint_t &glyph_id) const {
B
Behdad Esfahbod 已提交
65

66
    unsigned int index = get_glyph_coverage (glyph_id);
67
    if (NOT_COVERED == index)
B
Behdad Esfahbod 已提交
68 69 70 71 72
      return false;

    glyph_id += deltaGlyphID;

    return true;
73
  }
B
Behdad Esfahbod 已提交
74

B
Behdad Esfahbod 已提交
75 76 77 78 79 80 81 82 83 84
  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  SHORT		deltaGlyphID;		/* Add to original GlyphID to get
					 * substitute GlyphID */
};
ASSERT_SIZE (SingleSubstFormat1, 6);

struct SingleSubstFormat2 {
85 86 87 88 89 90 91 92 93

  friend struct SingleSubst;

  private:
  DEFINE_GET_ACCESSOR (Coverage, coverage, coverage);
  DEFINE_GET_GLYPH_COVERAGE (glyph_coverage);

  inline bool single_substitute (hb_codepoint_t &glyph_id) const {

94
    unsigned int index = get_glyph_coverage (glyph_id);
95 96 97 98 99 100 101

    if (index >= glyphCount)
      return false;

    glyph_id = substitute[index];
    return true;
  }
B
Behdad Esfahbod 已提交
102 103 104 105 106 107 108 109 110 111 112 113

  private:
  USHORT	substFormat;		/* Format identifier--format = 2 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  USHORT	glyphCount;		/* Number of GlyphIDs in the Substitute
					 * array */
  GlyphID	substitute[];		/* Array of substitute
					 * GlyphIDs--ordered by Coverage  Index */
};
ASSERT_SIZE (SingleSubstFormat2, 6);

114 115 116 117
struct SingleSubst {

  friend struct SubstLookupSubTable;

118 119
  private:

120 121 122 123 124 125 126
  unsigned int get_size (void) const {
    switch (u.substFormat) {
    case 1: return sizeof (u.format1);
    case 2: return sizeof (u.format2);
    default:return sizeof (u.substFormat);
    }
  }
B
Behdad Esfahbod 已提交
127

B
Behdad Esfahbod 已提交
128 129 130 131 132 133 134 135
  inline bool single_substitute (hb_codepoint_t &glyph_id) const {
    switch (u.substFormat) {
    case 1: return u.format1.single_substitute (glyph_id);
    case 2: return u.format2.single_substitute (glyph_id);
    default:return false;
    }
  }

136
  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
137 138 139 140 141 142

    HB_UNUSED (nesting_level_left);

    if (HB_UNLIKELY (context_length < 1))
      return false;

143
    unsigned int property;
144 145 146
    if (!_hb_ot_layout_check_glyph_property (layout, IN_CURITEM (), lookup_flag, &property))
      return false;

147
    hb_codepoint_t glyph_id = IN_CURGLYPH ();
148

B
Behdad Esfahbod 已提交
149 150
    if (!single_substitute (glyph_id))
      return false;
151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168

    _hb_buffer_replace_output_glyph (buffer, glyph_id, context_length == NO_CONTEXT);

    if ( _hb_ot_layout_has_new_glyph_classes (layout) )
    {
      /* we inherit the old glyph class to the substituted glyph */
      _hb_ot_layout_set_glyph_property (layout, glyph_id, property);
    }

    return true;
  }

  private:
  union {
  USHORT	substFormat;	/* Format identifier */
  SingleSubstFormat1	format1;
  SingleSubstFormat2	format2;
  } u;
B
Behdad Esfahbod 已提交
169
};
170 171
DEFINE_NULL (SingleSubst, 2);

B
Behdad Esfahbod 已提交
172 173

struct Sequence {
174 175 176 177 178 179 180 181 182

  friend struct MultipleSubstFormat1;

  private:
  /* GlyphID tables, in Coverage Index order */
  DEFINE_OFFSET_ARRAY_TYPE (GlyphID, substitute, glyphCount);

  inline void set_glyph_class (hb_ot_layout_t *layout, unsigned int property) const {

183 184
    unsigned int count = glyphCount;
    for (unsigned int n = 0; n < count; n++)
185 186
      _hb_ot_layout_set_glyph_property (layout, substitute[n], property);
  }
B
Behdad Esfahbod 已提交
187 188 189 190 191 192 193 194 195

  private:
  USHORT	glyphCount;		/* Number of GlyphIDs in the Substitute
					 * array. This should always  be
					 * greater than 0. */
  GlyphID	substitute[];		/* String of GlyphIDs to substitute */
};
DEFINE_NULL_ASSERT_SIZE (Sequence, 2);

196 197 198 199 200 201 202 203 204 205
struct MultipleSubstFormat1 {

  friend struct MultipleSubst;

  private:
  /* Sequence tables, in Coverage Index order */
  DEFINE_OFFSET_ARRAY_TYPE (Sequence, sequence, sequenceCount);
  DEFINE_GET_ACCESSOR (Coverage, coverage, coverage);
  DEFINE_GET_GLYPH_COVERAGE (glyph_coverage);

206
  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
207 208 209 210 211 212

    HB_UNUSED (nesting_level_left);

    if (HB_UNLIKELY (context_length < 1))
      return false;

213
    unsigned int property;
214 215 216
    if (!_hb_ot_layout_check_glyph_property (layout, IN_CURITEM (), lookup_flag, &property))
      return false;

217
    hb_codepoint_t glyph_id = IN_CURGLYPH ();
218

219
    unsigned int index = get_glyph_coverage (glyph_id);
220 221

    const Sequence &seq = (*this)[index];
222 223 224 225

    if (HB_UNLIKELY (!seq.get_len ()))
      return false;

226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
    _hb_buffer_add_output_glyph_ids (buffer, 1,
				     seq.glyphCount, seq.substitute,
				     0xFFFF, 0xFFFF);

    if ( _hb_ot_layout_has_new_glyph_classes (layout) )
    {
      /* this is a guess only ... */

      if ( property == HB_OT_LAYOUT_GLYPH_CLASS_LIGATURE )
        property = HB_OT_LAYOUT_GLYPH_CLASS_BASE_GLYPH;

      seq.set_glyph_class (layout, property);
    }

    return true;
  }
B
Behdad Esfahbod 已提交
242 243 244 245 246

  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
247 248 249
  USHORT	sequenceCount;		/* Number of Sequence table offsets in
					 * the Sequence array */
  Offset	sequence[];		/* Array of offsets to Sequence
B
Behdad Esfahbod 已提交
250 251 252 253
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * Coverage Index */
};
254 255 256 257
ASSERT_SIZE (MultipleSubstFormat1, 6);

struct MultipleSubst {

258 259 260 261
  friend struct SubstLookupSubTable;

  private:

262 263 264 265 266 267 268
  unsigned int get_size (void) const {
    switch (u.substFormat) {
    case 1: return sizeof (u.format1);
    default:return sizeof (u.substFormat);
    }
  }

269
  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
270
    switch (u.substFormat) {
271
    case 1: return u.format1.substitute (SUBTABLE_SUBSTITUTE_ARGS);
272 273 274 275 276 277 278 279 280 281 282 283
    default:return false;
    }
  }

  private:
  union {
  USHORT	substFormat;	/* Format identifier */
  MultipleSubstFormat1	format1;
  } u;
};
DEFINE_NULL (MultipleSubst, 2);

B
Behdad Esfahbod 已提交
284 285

struct AlternateSet {
286 287 288

  /* GlyphIDs, in no particular order */
  DEFINE_ARRAY_TYPE (GlyphID, alternate, glyphCount);
B
Behdad Esfahbod 已提交
289 290 291 292 293 294 295 296 297

  private:
  USHORT	glyphCount;		/* Number of GlyphIDs in the Alternate
					 * array */
  GlyphID	alternate[];		/* Array of alternate GlyphIDs--in
					 * arbitrary order */
};
DEFINE_NULL_ASSERT_SIZE (AlternateSet, 2);

298
struct AlternateSubstFormat1 {
299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314

  friend struct AlternateSubst;

  private:
  /* AlternateSet tables, in Coverage Index order */
  DEFINE_OFFSET_ARRAY_TYPE (AlternateSet, alternateSet, alternateSetCount);
  DEFINE_GET_ACCESSOR (Coverage, coverage, coverage);
  DEFINE_GET_GLYPH_COVERAGE (glyph_coverage);

  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {

    HB_UNUSED (nesting_level_left);

    if (HB_UNLIKELY (context_length < 1))
      return false;

315
    unsigned int property;
316 317 318
    if (!_hb_ot_layout_check_glyph_property (layout, IN_CURITEM (), lookup_flag, &property))
      return false;

319
    hb_codepoint_t glyph_id = IN_CURGLYPH ();
320

321
    unsigned int index = get_glyph_coverage (glyph_id);
322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351

    const AlternateSet &alt_set = (*this)[index];

    if (HB_UNLIKELY (!alt_set.get_len ()))
      return false;

    unsigned int alt_index = 0;

    /* XXX callback to user to choose alternate
    if ( gsub->altfunc )
      alt_index = (gsub->altfunc)( buffer->out_pos, glyph_id,
				   aset.GlyphCount, aset.Alternate,
				   gsub->data );
				   */

    if (HB_UNLIKELY (alt_index >= alt_set.get_len ()))
      return false;

    glyph_id = alt_set[alt_index];

    _hb_buffer_replace_output_glyph (buffer, glyph_id, context_length == NO_CONTEXT);

    if ( _hb_ot_layout_has_new_glyph_classes (layout) )
    {
      /* we inherit the old glyph class to the substituted glyph */
      _hb_ot_layout_set_glyph_property (layout, glyph_id, property);
    }

    return true;
  }
B
Behdad Esfahbod 已提交
352 353 354 355 356

  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
357 358
  USHORT	alternateSetCount;	/* Number of AlternateSet tables */
  Offset	alternateSet[];		/* Array of offsets to AlternateSet
B
Behdad Esfahbod 已提交
359 360 361 362
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * Coverage Index */
};
363 364
ASSERT_SIZE (AlternateSubstFormat1, 6);

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392
struct AlternateSubst {

  friend struct SubstLookupSubTable;

  private:

  unsigned int get_size (void) const {
    switch (u.substFormat) {
    case 1: return sizeof (u.format1);
    default:return sizeof (u.substFormat);
    }
  }

  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
    switch (u.substFormat) {
    case 1: return u.format1.substitute (SUBTABLE_SUBSTITUTE_ARGS);
    default:return false;
    }
  }

  private:
  union {
  USHORT	substFormat;	/* Format identifier */
  AlternateSubstFormat1	format1;
  } u;
};
DEFINE_NULL (AlternateSubst, 2);

393 394 395 396 397 398 399 400 401 402 403 404

struct Ligature {
  /* TODO */

  private:
  GlyphID	ligGlyph;		/* GlyphID of ligature to substitute */
  USHORT	compCount;		/* Number of components in the ligature */
  GlyphID	component[];		/* Array of component GlyphIDs--start
					 * with the second  component--ordered
					 * in writing direction */
};
DEFINE_NULL_ASSERT_SIZE (Ligature, 4);
B
Behdad Esfahbod 已提交
405 406 407 408 409 410 411 412 413 414 415 416 417

struct LigatureSet {
  /* TODO */

  private:
  USHORT	ligatureCount;		/* Number of Ligature tables */
  Offset	ligature[];		/* Array of offsets to Ligature
					 * tables--from beginning of
					 * LigatureSet table--ordered by
					 * preference */
};
DEFINE_NULL_ASSERT_SIZE (LigatureSet, 2);

418
struct LigatureSubstFormat1 {
419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454

  friend struct LigatureSubst;

  private:
  /* LigatureSet tables, in Coverage Index order */
  DEFINE_OFFSET_ARRAY_TYPE (LigatureSet, ligatureSet, ligSetCount);
  DEFINE_GET_ACCESSOR (Coverage, coverage, coverage);
  DEFINE_GET_GLYPH_COVERAGE (glyph_coverage);

  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {

    HB_UNUSED (nesting_level_left);

    unsigned int property;
    if (!_hb_ot_layout_check_glyph_property (layout, IN_CURITEM (), lookup_flag, &property))
      return false;

    hb_codepoint_t glyph_id = IN_CURGLYPH ();

    unsigned int index = get_glyph_coverage (glyph_id);

    const LigatureSet &lig_set = (*this)[index];

    bool first_is_mark = (property == HB_OT_LAYOUT_GLYPH_CLASS_MARK ||
			  property &  LookupFlag::MarkAttachmentType);

    unsigned int num_sets = get_len ();
    for (unsigned int i = 0; i < num_sets; i++) {

      const LigatureSet &lig_set = (*this)[i];


    }

    return false;
  }
B
Behdad Esfahbod 已提交
455 456

  private:
457 458 459 460 461 462 463 464
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  USHORT	ligSetCount;		/* Number of LigatureSet tables */
  Offset	ligatureSet[];		/* Array of offsets to LigatureSet
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * Coverage Index */
B
Behdad Esfahbod 已提交
465
};
466 467
ASSERT_SIZE (LigatureSubstFormat1, 6);

468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
struct LigatureSubst {

  friend struct SubstLookupSubTable;

  private:

  unsigned int get_size (void) const {
    switch (u.substFormat) {
    case 1: return sizeof (u.format1);
    default:return sizeof (u.substFormat);
    }
  }

  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
    switch (u.substFormat) {
    case 1: return u.format1.substitute (SUBTABLE_SUBSTITUTE_ARGS);
    default:return false;
    }
  }

  private:
  union {
  USHORT	substFormat;	/* Format identifier */
  LigatureSubstFormat1	format1;
  } u;
};
DEFINE_NULL (LigatureSubst, 2);

B
Behdad Esfahbod 已提交
496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757

struct SubstLookupRecord {
  /* TODO */

  private:
  USHORT	sequenceIndex;		/* Index into current glyph
					 * sequence--first glyph = 0 */
  USHORT	lookupListIndex;	/* Lookup to apply to that
					 * position--zero--based */
};
DEFINE_NULL_ASSERT_SIZE (SubstLookupRecord, 4);

struct ContextSubstFormat1 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  USHORT	subRuleSetCount;	/* Number of SubRuleSet tables--must
					 * equal GlyphCount in Coverage  table */
  Offset	subRuleSet[];		/* Array of offsets to SubRuleSet
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * Coverage Index */
};
ASSERT_SIZE (ContextSubstFormat1, 6);

struct SubRuleSet {
  /* TODO */

  private:
  USHORT	subRuleCount;		/* Number of SubRule tables */
  Offset	subRule[];		/* Array of offsets to SubRule
					 * tables--from beginning of SubRuleSet
					 * table--ordered by preference */
};
DEFINE_NULL_ASSERT_SIZE (SubRuleSet, 2);

struct SubRule {
  /* TODO */

  private:
  USHORT	glyphCount;		/* Total number of glyphs in input
					 * glyph sequence--includes the  first
					 * glyph */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  GlyphID	input[];		/* Array of input GlyphIDs--start with
					 * second glyph */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order */
};
DEFINE_NULL_ASSERT_SIZE (SubRule, 4);

struct ContextSubstFormat2 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 2 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  Offset	classDef;		/* Offset to glyph ClassDef table--from
					 * beginning of Substitution  table */
  USHORT	subClassSetCnt;		/* Number of SubClassSet tables */
  Offset	subClassSet[];		/* Array of offsets to SubClassSet
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * class--may be NULL */
};
ASSERT_SIZE (ContextSubstFormat2, 8);

struct SubClassSet {
  /* TODO */

  private:
  USHORT	subClassRuleCnt;	/* Number of SubClassRule tables */
  Offset	subClassRule[];		/* Array of offsets to SubClassRule
					 * tables--from beginning of
					 * SubClassSet--ordered by preference */
};
DEFINE_NULL_ASSERT_SIZE (SubClassSet, 2);

struct SubClassRule {
  /* TODO */

  private:
  USHORT	glyphCount;		/* Total number of classes
					 * specified for the context in the
					 * rule--includes the first class */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  USHORT	klass[];		/* Array of classes--beginning with the
					 * second class--to be matched  to the
					 * input glyph class sequence */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order */
};
DEFINE_NULL_ASSERT_SIZE (SubClassRule, 4);

struct ContextSubstFormat3 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 3 */
  USHORT	glyphCount;		/* Number of glyphs in the input glyph
					 * sequence */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  Offset	coverage[];		/* Array of offsets to Coverage
					 * table--from beginning of
					 * Substitution table--in glyph
					 * sequence order */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order */
};
ASSERT_SIZE (ContextSubstFormat3, 6);

struct ChainContextSubstFormat1 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  USHORT	chainSubRuleSetCount;	/* Number of ChainSubRuleSet
					 * tables--must equal GlyphCount in
					 * Coverage table */
  Offset	chainSubRuleSet[];	/* Array of offsets to ChainSubRuleSet
					 * tables--from beginning of
					 * Substitution table--ordered by
					 * Coverage Index */
};
ASSERT_SIZE (ChainContextSubstFormat1, 6);

struct ChainSubRuleSet {
  /* TODO */

  private:
  USHORT	chainSubRuleCount;	/* Number of ChainSubRule tables */
  Offset	chainSubRule[];		/* Array of offsets to ChainSubRule
					 * tables--from beginning of
					 * ChainSubRuleSet table--ordered
					 * by preference */
};
DEFINE_NULL_ASSERT_SIZE (ChainSubRuleSet, 2);

struct ChainSubRule {
  /* TODO */

  private:
  USHORT	backtrackGlyphCount;	/* Total number of glyphs in the
					 * backtrack sequence (number of
					 * glyphs to be matched before the
					 * first glyph) */
  GlyphID	backtrack[];		/* Array of backtracking GlyphID's
					 * (to be matched before the input
					 * sequence) */
  USHORT	inputGlyphCount;	/* Total number of glyphs in the input
					 * sequence (includes the first  glyph) */
  GlyphID	input[];		/* Array of input GlyphIDs (start with
					 * second glyph) */
  USHORT	lookaheadGlyphCount;	/* Total number of glyphs in the look
					 * ahead sequence (number of  glyphs to
					 * be matched after the input sequence) */
  GlyphID	lookAhead[];		/* Array of lookahead GlyphID's (to be
					 * matched after  the input sequence) */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order) */
};
DEFINE_NULL_ASSERT_SIZE (ChainSubRule, 8);

struct ChainContextSubstFormat2 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 2 */
  Offset	coverage;		/* Offset to Coverage table--from
					 * beginning of Substitution table */
  Offset	backtrackClassDef;	/* Offset to glyph ClassDef table
					 * containing backtrack sequence
					 * data--from beginning of Substitution
					 * table */
  Offset	inputClassDef;		/* Offset to glyph ClassDef
					 * table containing input sequence
					 * data--from beginning of Substitution
					 * table */
  Offset	lookaheadClassDef;	/* Offset to glyph ClassDef table
					 * containing lookahead sequence
					 * data--from beginning of Substitution
					 * table */
  USHORT	chainSubClassSetCnt;	/* Number of ChainSubClassSet tables */
  Offset	chainSubClassSet[];	/* Array of offsets to ChainSubClassSet
					 * tables--from beginning of
					 * Substitution table--ordered by input
					 * class--may be NULL */
};
ASSERT_SIZE (ChainContextSubstFormat2, 12);

struct ChainSubClassSet {
  /* TODO */

  private:
  USHORT	chainSubClassRuleCnt;	/* Number of ChainSubClassRule tables */
  Offset	chainSubClassRule[];	/* Array of offsets
					 * to ChainSubClassRule
					 * tables--from beginning of
					 * ChainSubClassSet--ordered by
					 * preference */
};
DEFINE_NULL_ASSERT_SIZE (ChainSubClassSet, 2);

struct ChainSubClassRule {
  /* TODO */

  private:
  USHORT	backtrackGlyphCount;	/* Total number of glyphs in the
					 * backtrack sequence (number of
					 * glyphs to be matched before the
					 * first glyph) */
  USHORT	backtrack[];		/* Array of backtracking classes(to be
					 * matched before the input  sequence) */
  USHORT	inputGlyphCount;	/* Total number of classes in the input
					 * sequence (includes the  first class) */
  USHORT	input[];		/* Array of input classes(start with
					 * second class; to  be matched with
					 * the input glyph sequence) */
  USHORT	lookaheadGlyphCount;	/* Total number of classes in the
					 * look ahead sequence (number of
					 * classes to be matched after the
					 * input sequence) */
  USHORT	lookAhead[];		/* Array of lookahead classes(to be
					 * matched after the  input sequence) */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order) */
};
DEFINE_NULL_ASSERT_SIZE (ChainSubClassRule, 8);

struct ChainContextSubstFormat3 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 3 */
  USHORT	backtrackGlyphCount;	/* Number of glyphs in the backtracking
					 * sequence */
  Offset	backtrackCoverage[];	/* Array of offsets to coverage tables
					 * in backtracking sequence, in  glyph
					 * sequence order */
  USHORT	inputGlyphCount;	/* Number of glyphs in input sequence */
  Offset	inputCoverage[];	/* Array of offsets to coverage
					 * tables in input sequence, in glyph
					 * sequence order */
  USHORT	lookaheadGlyphCount;	/* Number of glyphs in lookahead
					 * sequence */
  Offset	lookaheadCoverage[];	/* Array of offsets to coverage tables
					 * in lookahead sequence, in  glyph
					 * sequence order */
  USHORT	substCount;		/* Number of SubstLookupRecords */
  SubstLookupRecord substLookupRecord[];/* Array of SubstLookupRecords--in
					 * design order */
};
ASSERT_SIZE (ChainContextSubstFormat3, 10);

758

B
Behdad Esfahbod 已提交
759
struct ExtensionSubstFormat1 {
760 761 762 763 764 765

  friend struct ExtensionSubst;

  private:
  inline unsigned int get_type (void) const { return extensionLookupType; }
  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const;
B
Behdad Esfahbod 已提交
766 767 768 769 770 771 772 773 774 775 776

  private:
  USHORT	substFormat;		/* Format identifier. Set to 1. */
  USHORT	extensionLookupType;	/* Lookup type of subtable referenced
					 * by ExtensionOffset (i.e. the
					 * extension subtable). */
  ULONG		extensionOffset;	/* Offset to the extension subtable,
					 * of lookup type  subtable. */
};
ASSERT_SIZE (ExtensionSubstFormat1, 8);

777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814
struct ExtensionSubst {

  friend struct SubstLookup;
  friend struct SubstLookupSubTable;

  private:

  unsigned int get_size (void) const {
    switch (u.substFormat) {
    case 1: return sizeof (u.format1);
    default:return sizeof (u.substFormat);
    }
  }

  inline unsigned int get_type (void) const {
    switch (u.substFormat) {
    case 1: return u.format1.get_type ();
    default:return 0;
    }
  }

  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
    switch (u.substFormat) {
    case 1: return u.format1.substitute (SUBTABLE_SUBSTITUTE_ARGS);
    default:return false;
    }
  }

  private:
  union {
  USHORT	substFormat;	/* Format identifier */
  ExtensionSubstFormat1	format1;
  } u;
};
DEFINE_NULL (ExtensionSubst, 2);



B
Behdad Esfahbod 已提交
815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838
struct ReverseChainSingleSubstFormat1 {
  /* TODO */

  private:
  USHORT	substFormat;		/* Format identifier--format = 1 */
  Offset	coverage;		/* Offset to Coverage table -- from
					 * beginning of Substitution table */
  USHORT	backtrackGlyphCount;	/* Number of glyphs in the backtracking
					 * sequence */
  Offset	backtrackCoverage[];	/* Array of offsets to coverage tables
					 * in backtracking sequence, in  glyph
					 * sequence order */
  USHORT	lookaheadGlyphCount;	/* Number of glyphs in lookahead
					 * sequence */
  Offset	lookaheadCoverage[];	/* Array of offsets to coverage tables
					 * in lookahead sequence, in  glyph
					 * sequence order */
  USHORT	glyphCount;		/* Number of GlyphIDs in the Substitute
					 * array */
  GlyphID	substitute[];		/* Array of substitute
					 * GlyphIDs--ordered by Coverage  Index */
};
ASSERT_SIZE (ReverseChainSingleSubstFormat1, 10);

B
Behdad Esfahbod 已提交
839 840 841 842
/*
 * SubstLookup
 */

843 844 845
enum {
  GSUB_Single				= 1,
  GSUB_Multiple				= 2,
846
  GSUB_Alternate			= 3,
847 848 849
  GSUB_Ligature				= 4,
  GSUB_Context				= 5,
  GSUB_ChainingContext			= 6,
850 851
  GSUB_Extension			= 7,
  GSUB_ReverseChainingContextSingle	= 8,
852 853
};

B
Behdad Esfahbod 已提交
854 855 856 857 858 859 860
struct SubstLookupSubTable {
  DEFINE_NON_INSTANTIABLE(SubstLookupSubTable);

  friend struct SubstLookup;

  unsigned int get_size (unsigned int lookup_type) const {
    switch (lookup_type) {
861
    case GSUB_Single:				return u.single.get_size ();
862 863
    case GSUB_Multiple:				return u.multiple.get_size ();
    case GSUB_Alternate:			return u.alternate.get_size ();
864
    case GSUB_Ligature:				return u.ligature.get_size ();
865
   /*
866 867
    case GSUB_Context:
    case GSUB_ChainingContext:
868 869 870
   */
    case GSUB_Extension:			return u.extension.get_size ();
 /*
871
    case GSUB_ReverseChainingContextSingle:
872
  */
B
Behdad Esfahbod 已提交
873 874 875 876
    default:return sizeof (LookupSubTable);
    }
  }

877 878
  inline bool substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF,
			  unsigned int    lookup_type) const {
879
    switch (lookup_type) {
880 881
    case GSUB_Single:				return u.single.substitute (SUBTABLE_SUBSTITUTE_ARGS);
    case GSUB_Multiple:				return u.multiple.substitute (SUBTABLE_SUBSTITUTE_ARGS);
882
    case GSUB_Alternate:			return u.alternate.substitute (SUBTABLE_SUBSTITUTE_ARGS);
883
    case GSUB_Ligature:				return u.ligature.substitute (SUBTABLE_SUBSTITUTE_ARGS);
884
    /*
885 886
    case GSUB_Context:				return u.context.substitute (SUBTABLE_SUBSTITUTE_ARGS);
    case GSUB_ChainingContext:			return u.chainingContext.substitute (SUBTABLE_SUBSTITUTE_ARGS);
887 888 889
    */
    case GSUB_Extension:			return u.extension.substitute (SUBTABLE_SUBSTITUTE_ARGS);
			/*
890
    case GSUB_ReverseChainingContextSingle:	return u.reverseChainingContextSingle.substitute (SUBTABLE_SUBSTITUTE_ARGS);
891 892 893
    */
    default:return false;
    }
B
Behdad Esfahbod 已提交
894 895 896 897
  }

  private:
  union {
898 899 900 901 902 903 904 905 906 907 908 909 910
  USHORT				substFormat;
  SingleSubst				single;
  MultipleSubst				multiple;
  AlternateSubst			alternate;
  LigatureSubst				ligature;
  /*
  ContextSubst				context;
  ChainingContextSubst			chainingContext;
  */
  ExtensionSubst			extension;
  /*
  ReverseChainingContextSingleSubst	reverseChainingContextSingle;
  */
B
Behdad Esfahbod 已提交
911 912 913
  } u;
};

914 915 916 917 918 919 920 921 922 923

/* Out-of-class implementation for methods chaining */

inline bool ExtensionSubstFormat1::substitute (SUBTABLE_SUBSTITUTE_ARGS_DEF) const {
  return (*(SubstLookupSubTable *)(((char *) this) + extensionOffset)).substitute (SUBTABLE_SUBSTITUTE_ARGS,
										   get_type ());
}



B
Behdad Esfahbod 已提交
924 925 926 927 928 929 930 931 932
struct SubstLookup : Lookup {

  DEFINE_NON_INSTANTIABLE(SubstLookup);

  inline const SubstLookupSubTable& get_subtable (unsigned int i) const {
    return *(SubstLookupSubTable*)&(((Lookup *)this)->get_subtable (i));
  }

  /* Like get_type(), but looks through extension lookups.
933
   * Never returns Extension */
B
Behdad Esfahbod 已提交
934 935 936
  inline unsigned int get_effective_type (void) const {
    unsigned int type = get_type ();

937
    if (HB_UNLIKELY (type == GSUB_Extension)) {
B
Behdad Esfahbod 已提交
938 939 940
      /* Return lookup type of first extension subtable.
       * The spec says all of them should have the same type.
       * XXX check for that somehow */
941
      type = get_subtable(0).u.extension.get_type ();
B
Behdad Esfahbod 已提交
942 943 944 945 946 947 948
    }

    return type;
  }

  inline bool is_reverse (void) const {
    switch (get_effective_type ()) {
949 950
    case GSUB_ReverseChainingContextSingle:	return true;
    default:					return false;
B
Behdad Esfahbod 已提交
951 952 953
    }
  }

954 955 956 957
  bool substitute_once (hb_ot_layout_t *layout,
			hb_buffer_t    *buffer,
			unsigned int    context_length,
			unsigned int    nesting_level_left) const {
958

B
Behdad Esfahbod 已提交
959
    unsigned int lookup_type = get_type ();
B
Behdad Esfahbod 已提交
960
    unsigned int lookup_flag = get_flag ();
B
Behdad Esfahbod 已提交
961 962 963 964

    if (HB_UNLIKELY (nesting_level_left == 0))
      return false;
    nesting_level_left--;
B
Behdad Esfahbod 已提交
965

B
Behdad Esfahbod 已提交
966
    for (unsigned int i = 0; i < get_subtable_count (); i++)
967 968
      if (get_subtable (i).substitute (SUBTABLE_SUBSTITUTE_ARGS,
				       lookup_type))
B
Behdad Esfahbod 已提交
969
	return true;
B
Behdad Esfahbod 已提交
970

B
Behdad Esfahbod 已提交
971 972
    return false;
  }
973

974 975 976
  bool substitute_string (hb_ot_layout_t *layout,
			  hb_buffer_t    *buffer,
			  hb_ot_layout_feature_mask_t mask) const {
977 978 979

    bool ret = false;

980
    if (HB_LIKELY (!is_reverse ())) {
981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008

	/* in/out forward substitution */
	_hb_buffer_clear_output (buffer);
	buffer->in_pos = 0;
	while (buffer->in_pos < buffer->in_length) {

	  if ((~IN_PROPERTIES (buffer->in_pos) & mask) &&
	      substitute_once (layout, buffer, NO_CONTEXT, MAX_NESTING_LEVEL))
	    ret = true;
	  else
	    _hb_buffer_copy_output_glyph (buffer);

	}
	if (ret)
	  _hb_buffer_swap (buffer);

    } else {

	/* in-place backward substitution */
	buffer->in_pos = buffer->in_length - 1;
	do {

	  if ((~IN_PROPERTIES (buffer->in_pos) & mask) &&
	      substitute_once (layout, buffer, NO_CONTEXT, MAX_NESTING_LEVEL))
	    ret = true;
	  else
	    buffer->in_pos--;

1009
	} while ((int) buffer->in_pos >= 0);
1010 1011 1012 1013
    }

    return ret;
  }
B
Behdad Esfahbod 已提交
1014 1015 1016
};
DEFINE_NULL_ALIAS (SubstLookup, Lookup);

B
Minor  
Behdad Esfahbod 已提交
1017 1018 1019 1020 1021 1022 1023 1024 1025
/*
 * GSUB
 */

struct GSUB : GSUBGPOS {
  static const hb_tag_t Tag		= HB_TAG ('G','S','U','B');

  STATIC_DEFINE_GET_FOR_DATA (GSUB);
  /* XXX check version here? */
B
Behdad Esfahbod 已提交
1026 1027 1028 1029 1030 1031

  inline const SubstLookup& get_lookup (unsigned int i) const {
    return *(SubstLookup*)&(((GSUBGPOS *)this)->get_lookup (i));
  }


B
Minor  
Behdad Esfahbod 已提交
1032 1033 1034 1035
};
DEFINE_NULL_ALIAS (GSUB, GSUBGPOS);


B
Behdad Esfahbod 已提交
1036
#endif /* HB_OT_LAYOUT_GSUB_PRIVATE_H */