hb-ot-shape-complex-indic.cc 23.3 KB
Newer Older
B
Behdad Esfahbod 已提交
1
/*
B
Behdad Esfahbod 已提交
2
 * Copyright © 2011  Google, 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
 *
 *  This is part of HarfBuzz, a text shaping library.
 *
 * Permission is hereby granted, without written agreement and without
 * license or royalty fees, to use, copy, modify, and distribute this
 * 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.
 *
 * Google Author(s): Behdad Esfahbod
 */

B
Behdad Esfahbod 已提交
27
#include "hb-ot-shape-complex-indic-private.hh"
28

29 30 31 32 33 34 35 36 37 38 39
static const struct indic_options_t
{
  indic_options_t (void)
  {
    char *c = getenv ("HB_OT_INDIC_OPTIONS");
    uniscribe_bug_compatible = c && strstr (c, "uniscribe-bug-compatible");
  }

  bool uniscribe_bug_compatible;
} options;

B
Behdad Esfahbod 已提交
40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
static int
compare_codepoint (const void *pa, const void *pb)
{
  hb_codepoint_t a = * (hb_codepoint_t *) pa;
  hb_codepoint_t b = * (hb_codepoint_t *) pb;

  return a < b ? -1 : a == b ? 0 : +1;
}

static indic_position_t
consonant_position (hb_codepoint_t u)
{
  consonant_position_t *record;

  record = (consonant_position_t *) bsearch (&u, consonant_positions,
					     ARRAY_LENGTH (consonant_positions),
					     sizeof (consonant_positions[0]),
					     compare_codepoint);

59
  return record ? record->position : POS_BASE_C;
B
Behdad Esfahbod 已提交
60 61
}

62 63 64 65 66 67 68 69 70
static bool
is_ra (hb_codepoint_t u)
{
  return !!bsearch (&u, ra_chars,
		    ARRAY_LENGTH (ra_chars),
		    sizeof (ra_chars[0]),
		    compare_codepoint);
}

71
static bool
B
Behdad Esfahbod 已提交
72
is_joiner (const hb_glyph_info_t &info)
73
{
B
Behdad Esfahbod 已提交
74 75 76 77 78 79
  return !!(FLAG (info.indic_category()) & (FLAG (OT_ZWJ) | FLAG (OT_ZWNJ)));
}

static bool
is_consonant (const hb_glyph_info_t &info)
{
80 81 82
  /* Note:
   *
   * We treat Vowels and NBSP as if they were consonants.  This is safe because Vowels
B
Behdad Esfahbod 已提交
83 84
   * cannot happen in a consonant syllable.  The plus side however is, we can call the
   * consonant syllable logic from the vowel syllable function and get it all right! */
85
  return !!(FLAG (info.indic_category()) & (FLAG (OT_C) | FLAG (OT_Ra) | FLAG (OT_V) | FLAG (OT_NBSP)));
86
}
87 88 89 90 91

static const struct {
  hb_tag_t tag;
  hb_bool_t is_global;
} indic_basic_features[] =
B
Behdad Esfahbod 已提交
92
{
93 94 95
  {HB_TAG('n','u','k','t'), true},
  {HB_TAG('a','k','h','n'), false},
  {HB_TAG('r','p','h','f'), false},
B
Behdad Esfahbod 已提交
96
  {HB_TAG('r','k','r','f'), true},
97 98 99 100 101
  {HB_TAG('p','r','e','f'), false},
  {HB_TAG('b','l','w','f'), false},
  {HB_TAG('h','a','l','f'), false},
  {HB_TAG('v','a','t','u'), true},
  {HB_TAG('p','s','t','f'), false},
B
Behdad Esfahbod 已提交
102
  {HB_TAG('c','j','c','t'), false},
103 104 105 106 107 108 109
};

/* Same order as the indic_basic_features array */
enum {
  _NUKT,
  AKHN,
  RPHF,
B
Minor  
Behdad Esfahbod 已提交
110
  _RKRF,
111 112 113 114 115
  PREF,
  BLWF,
  HALF,
  _VATU,
  PSTF,
B
Behdad Esfahbod 已提交
116
  CJCT
B
Behdad Esfahbod 已提交
117 118 119 120 121 122 123 124 125 126 127 128 129 130 131
};

static const hb_tag_t indic_other_features[] =
{
  HB_TAG('p','r','e','s'),
  HB_TAG('a','b','v','s'),
  HB_TAG('b','l','w','s'),
  HB_TAG('p','s','t','s'),
  HB_TAG('h','a','l','n'),

  HB_TAG('d','i','s','t'),
  HB_TAG('a','b','v','m'),
  HB_TAG('b','l','w','m'),
};

B
Behdad Esfahbod 已提交
132 133 134 135 136 137

static void
initial_reordering (const hb_ot_map_t *map,
		    hb_face_t *face,
		    hb_buffer_t *buffer,
		    void *user_data HB_UNUSED);
138 139 140 141
static void
final_reordering (const hb_ot_map_t *map,
		  hb_face_t *face,
		  hb_buffer_t *buffer,
B
Behdad Esfahbod 已提交
142
		  void *user_data HB_UNUSED);
B
Behdad Esfahbod 已提交
143 144

void
145
_hb_ot_shape_complex_collect_features_indic (hb_ot_map_builder_t *map, const hb_segment_properties_t  *props)
B
Behdad Esfahbod 已提交
146
{
147
  map->add_bool_feature (HB_TAG('l','o','c','l'));
B
Minor  
Behdad Esfahbod 已提交
148 149
  /* The Indic specs do not require ccmp, but we apply it here since if
   * there is a use of it, it's typically at the beginning. */
150 151
  map->add_bool_feature (HB_TAG('c','c','m','p'));

B
Behdad Esfahbod 已提交
152
  map->add_gsub_pause (initial_reordering, NULL);
153

154
  for (unsigned int i = 0; i < ARRAY_LENGTH (indic_basic_features); i++) {
155
    map->add_bool_feature (indic_basic_features[i].tag, indic_basic_features[i].is_global);
156 157
    map->add_gsub_pause (NULL, NULL);
  }
B
Behdad Esfahbod 已提交
158

159 160
  map->add_gsub_pause (final_reordering, NULL);

161
  for (unsigned int i = 0; i < ARRAY_LENGTH (indic_other_features); i++) {
162
    map->add_bool_feature (indic_other_features[i], true);
163 164
    map->add_gsub_pause (NULL, NULL);
  }
B
Behdad Esfahbod 已提交
165 166
}

167

B
Behdad Esfahbod 已提交
168 169
hb_ot_shape_normalization_mode_t
_hb_ot_shape_complex_normalization_preference_indic (void)
170 171
{
  /* We want split matras decomposed by the common shaping logic. */
B
Behdad Esfahbod 已提交
172
  return HB_OT_SHAPE_NORMALIZATION_MODE_DECOMPOSED;
173 174
}

175

B
Behdad Esfahbod 已提交
176
void
177
_hb_ot_shape_complex_setup_masks_indic (hb_ot_map_t *map, hb_buffer_t *buffer, hb_font_t *font)
B
Behdad Esfahbod 已提交
178
{
179 180 181
  HB_BUFFER_ALLOCATE_VAR (buffer, indic_category);
  HB_BUFFER_ALLOCATE_VAR (buffer, indic_position);

B
Behdad Esfahbod 已提交
182 183 184 185
  /* We cannot setup masks here.  We save information about characters
   * and setup masks later on in a pause-callback. */

  unsigned int count = buffer->len;
B
Behdad Esfahbod 已提交
186 187
  for (unsigned int i = 0; i < count; i++)
  {
B
Minor  
Behdad Esfahbod 已提交
188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208
    hb_glyph_info_t &info = buffer->info[i];
    unsigned int type = get_indic_categories (info.codepoint);

    info.indic_category() = type & 0x0F;
    info.indic_position() = type >> 4;

    if (info.indic_category() == OT_C) {
      info.indic_position() = consonant_position (info.codepoint);
      if (is_ra (info.codepoint))
	info.indic_category() = OT_Ra;
    } else if (info.indic_category() == OT_SM ||
	       info.indic_category() == OT_VD) {
      info.indic_position() = POS_SMVD;
    } else if (unlikely (info.codepoint == 0x200C))
      info.indic_category() = OT_ZWNJ;
    else if (unlikely (info.codepoint == 0x200D))
      info.indic_category() = OT_ZWJ;

    if (unlikely (info.codepoint == 0x0952)) {
      info.indic_category() = OT_A;
      info.indic_position() = POS_SMVD;
B
Behdad Esfahbod 已提交
209
    }
B
Behdad Esfahbod 已提交
210
  }
B
Behdad Esfahbod 已提交
211
}
B
Behdad Esfahbod 已提交
212

B
Behdad Esfahbod 已提交
213 214 215 216 217 218 219 220
static int
compare_indic_order (const hb_glyph_info_t *pa, const hb_glyph_info_t *pb)
{
  int a = pa->indic_position();
  int b = pb->indic_position();

  return a < b ? -1 : a == b ? 0 : +1;
}
221

B
Behdad Esfahbod 已提交
222
static void
223 224
initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buffer, hb_mask_t *mask_array,
				       unsigned int start, unsigned int end)
B
Behdad Esfahbod 已提交
225
{
B
Minor  
Behdad Esfahbod 已提交
226
  hb_glyph_info_t *info = buffer->info;
B
Behdad Esfahbod 已提交
227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244

  /* Comments from:
   * https://www.microsoft.com/typography/otfntdev/devanot/shaping.aspx */

  /* 1. Find base consonant:
   *
   * The shaping engine finds the base consonant of the syllable, using the
   * following algorithm: starting from the end of the syllable, move backwards
   * until a consonant is found that does not have a below-base or post-base
   * form (post-base forms have to follow below-base forms), or that is not a
   * pre-base reordering Ra, or arrive at the first consonant. The consonant
   * stopped at will be the base.
   *
   *   o If the syllable starts with Ra + Halant (in a script that has Reph)
   *     and has more than one consonant, Ra is excluded from candidates for
   *     base consonants.
   */

245
  unsigned int base = end;
B
Behdad Esfahbod 已提交
246
  bool has_reph = false;
B
Behdad Esfahbod 已提交
247

B
Behdad Esfahbod 已提交
248 249 250
  /* -> If the syllable starts with Ra + Halant (in a script that has Reph)
   *    and has more than one consonant, Ra is excluded from candidates for
   *    base consonants. */
251
  unsigned int limit = start;
B
Behdad Esfahbod 已提交
252
  if (mask_array[RPHF] &&
B
Behdad Esfahbod 已提交
253
      start + 3 <= end &&
B
Behdad Esfahbod 已提交
254
      info[start].indic_category() == OT_Ra &&
B
Behdad Esfahbod 已提交
255 256
      info[start + 1].indic_category() == OT_H &&
      !is_joiner (info[start + 2]))
B
Behdad Esfahbod 已提交
257
  {
258 259
    limit += 2;
    base = start;
B
Behdad Esfahbod 已提交
260
    has_reph = true;
261
  };
B
Behdad Esfahbod 已提交
262

B
Minor  
Behdad Esfahbod 已提交
263 264 265 266 267 268 269
  {
    /* -> starting from the end of the syllable, move backwards */
    unsigned int i = end;
    do {
      i--;
      /* -> until a consonant is found */
      if (is_consonant (info[i]))
B
Behdad Esfahbod 已提交
270
      {
B
Minor  
Behdad Esfahbod 已提交
271 272 273 274 275 276 277 278
	/* -> that does not have a below-base or post-base form
	 * (post-base forms have to follow below-base forms), */
	if (info[i].indic_position() != POS_BELOW_C &&
	    info[i].indic_position() != POS_POST_C)
	{
	  base = i;
	  break;
	}
B
Behdad Esfahbod 已提交
279

B
Minor  
Behdad Esfahbod 已提交
280 281 282 283
	/* -> or that is not a pre-base reordering Ra,
	 *
	 * TODO
	 */
284

B
Minor  
Behdad Esfahbod 已提交
285 286 287 288 289 290 291 292 293 294 295
	/* -> or arrive at the first consonant. The consonant stopped at will
	 * be the base. */
	base = i;
      }
      else
	if (is_joiner (info[i]))
	  break;
    } while (i > limit);
    if (base < start)
      base = start; /* Just in case... */
  }
B
Behdad Esfahbod 已提交
296

297 298 299 300 301 302 303 304 305
  /* -> If the syllable starts with Ra + Halant (in a script that has Reph)
   *    and has more than one consonant, Ra is excluded from candidates for
   *    base consonants. */
  if (has_reph && base == start) {
    /* Have no other consonant, so Reph is not formed and Ra becomes base. */
    has_reph = false;
  }


B
Behdad Esfahbod 已提交
306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
  /* 2. Decompose and reorder Matras:
   *
   * Each matra and any syllable modifier sign in the cluster are moved to the
   * appropriate position relative to the consonant(s) in the cluster. The
   * shaping engine decomposes two- or three-part matras into their constituent
   * parts before any repositioning. Matra characters are classified by which
   * consonant in a conjunct they have affinity for and are reordered to the
   * following positions:
   *
   *   o Before first half form in the syllable
   *   o After subjoined consonants
   *   o After post-form consonant
   *   o After main consonant (for above marks)
   *
   * IMPLEMENTATION NOTES:
   *
   * The normalize() routine has already decomposed matras for us, so we don't
   * need to worry about that.
   */


  /* 3.  Reorder marks to canonical order:
   *
   * Adjacent nukta and halant or nukta and vedic sign are always repositioned
   * if necessary, so that the nukta is first.
   *
   * IMPLEMENTATION NOTES:
   *
   * We don't need to do this: the normalize() routine already did this for us.
   */


B
Behdad Esfahbod 已提交
338 339
  /* Reorder characters */

B
Minor  
Behdad Esfahbod 已提交
340
  for (unsigned int i = start; i < base; i++)
341 342
    info[i].indic_position() = POS_PRE_C;
  info[base].indic_position() = POS_BASE_C;
B
Behdad Esfahbod 已提交
343

344
  /* Handle beginning Ra */
345 346
  if (has_reph)
    info[start].indic_position() = POS_RA_TO_BECOME_REPH;
347

348 349 350 351
  /* For old-style Indic script tags, move the first post-base Halant after
   * last consonant. */
  if ((map->get_chosen_script (0) & 0x000000FF) != '2') {
    /* We should only do this for Indic scripts which have a version two I guess. */
B
Minor  
Behdad Esfahbod 已提交
352
    for (unsigned int i = base + 1; i < end; i++)
353 354 355
      if (info[i].indic_category() == OT_H) {
        unsigned int j;
        for (j = end - 1; j > i; j--)
B
Behdad Esfahbod 已提交
356
	  if (is_consonant (info[j]))
357 358 359 360 361 362 363 364 365 366 367
	    break;
	if (j > i) {
	  /* Move Halant to after last consonant. */
	  hb_glyph_info_t t = info[i];
	  memmove (&info[i], &info[i + 1], (j - i) * sizeof (info[0]));
	  info[j] = t;
	}
        break;
      }
  }

B
Behdad Esfahbod 已提交
368
  /* Attach ZWJ, ZWNJ, nukta, and halant to previous char to move with them. */
369 370 371 372 373 374 375
  if (!options.uniscribe_bug_compatible)
  {
    /* Please update the Uniscribe branch when touching this! */
    for (unsigned int i = start + 1; i < end; i++)
      if ((FLAG (info[i].indic_category()) & (FLAG (OT_ZWNJ) | FLAG (OT_ZWJ) | FLAG (OT_N) | FLAG (OT_H))))
	info[i].indic_position() = info[i - 1].indic_position();
  } else {
376 377 378 379
    /*
     * Uniscribe doesn't move the Halant with Left Matra.
     * TEST: U+092B,U+093F,U+094DE
     */
380 381 382 383 384 385 386 387 388 389 390 391
    /* Please update the non-Uniscribe branch when touching this! */
    for (unsigned int i = start + 1; i < end; i++)
      if ((FLAG (info[i].indic_category()) & (FLAG (OT_ZWNJ) | FLAG (OT_ZWJ) | FLAG (OT_N) | FLAG (OT_H)))) {
	info[i].indic_position() = info[i - 1].indic_position();
	if (info[i].indic_category() == OT_H && info[i].indic_position() == POS_LEFT_MATRA)
	  for (unsigned int j = i; j > start; j--)
	    if (info[j - 1].indic_position() != POS_LEFT_MATRA) {
	      info[i].indic_position() = info[j - 1].indic_position();
	      break;
	    }
      }
  }
B
Behdad Esfahbod 已提交
392 393

  /* We do bubble-sort, skip malicious clusters attempts */
394
  if (end - start < 64)
395 396
  {
    /* Sit tight, rock 'n roll! */
397
    hb_bubble_sort (info + start, end - start, compare_indic_order);
398 399
    /* Find base again */
    base = end;
B
Minor  
Behdad Esfahbod 已提交
400
    for (unsigned int i = start; i < end; i++)
401 402 403 404 405
      if (info[i].indic_position() == POS_BASE_C) {
        base = i;
	break;
      }
  }
B
Behdad Esfahbod 已提交
406

B
Behdad Esfahbod 已提交
407 408
  /* Setup masks now */

B
Behdad Esfahbod 已提交
409 410 411
  {
    hb_mask_t mask;

412
    /* Reph */
413 414
    for (unsigned int i = start; i < end && info[i].indic_position() == POS_RA_TO_BECOME_REPH; i++)
      info[i].mask |= mask_array[RPHF];
415

B
Behdad Esfahbod 已提交
416 417
    /* Pre-base */
    mask = mask_array[HALF] | mask_array[AKHN] | mask_array[CJCT];
B
Minor  
Behdad Esfahbod 已提交
418
    for (unsigned int i = start; i < base; i++)
B
Behdad Esfahbod 已提交
419 420 421 422 423 424
      info[i].mask  |= mask;
    /* Base */
    mask = mask_array[AKHN] | mask_array[CJCT];
    info[base].mask |= mask;
    /* Post-base */
    mask = mask_array[BLWF] | mask_array[PSTF] | mask_array[CJCT];
B
Minor  
Behdad Esfahbod 已提交
425
    for (unsigned int i = base + 1; i < end; i++)
B
Behdad Esfahbod 已提交
426 427
      info[i].mask  |= mask;
  }
B
Behdad Esfahbod 已提交
428 429

  /* Apply ZWJ/ZWNJ effects */
B
Minor  
Behdad Esfahbod 已提交
430
  for (unsigned int i = start + 1; i < end; i++)
B
Behdad Esfahbod 已提交
431 432
    if (is_joiner (info[i])) {
      bool non_joiner = info[i].indic_category() == OT_ZWNJ;
433
      unsigned int j = i;
B
Behdad Esfahbod 已提交
434 435 436

      do {
	j--;
437

438
	info[j].mask &= ~mask_array[CJCT];
439
	if (non_joiner)
B
Behdad Esfahbod 已提交
440
	  info[j].mask &= ~mask_array[HALF];
441

B
Behdad Esfahbod 已提交
442 443
      } while (j > start && !is_consonant (info[j]));
    }
B
Behdad Esfahbod 已提交
444 445 446 447
}


static void
448 449
initial_reordering_vowel_syllable (const hb_ot_map_t *map, hb_buffer_t *buffer, hb_mask_t *mask_array,
				   unsigned int start, unsigned int end)
B
Behdad Esfahbod 已提交
450
{
B
Behdad Esfahbod 已提交
451 452
  /* We made the vowels look like consonants.  So let's call the consonant logic! */
  initial_reordering_consonant_syllable (map, buffer, mask_array, start, end);
B
Behdad Esfahbod 已提交
453 454 455
}

static void
456 457
initial_reordering_standalone_cluster (const hb_ot_map_t *map, hb_buffer_t *buffer, hb_mask_t *mask_array,
				       unsigned int start, unsigned int end)
B
Behdad Esfahbod 已提交
458
{
459 460
  /* We made the vowels look like consonants.  So let's call the consonant logic! */
  initial_reordering_consonant_syllable (map, buffer, mask_array, start, end);
B
Behdad Esfahbod 已提交
461 462 463
}

static void
464
initial_reordering_non_indic (const hb_ot_map_t *map, hb_buffer_t *buffer, hb_mask_t *mask_array,
B
Behdad Esfahbod 已提交
465 466 467 468 469 470 471 472 473 474 475 476 477 478
		 unsigned int start, unsigned int end)
{
  /* Nothing to do right now.  If we ever switch to using the output
   * buffer in the reordering process, we'd need to next_glyph() here. */
}

#include "hb-ot-shape-complex-indic-machine.hh"

static void
initial_reordering (const hb_ot_map_t *map,
		    hb_face_t *face,
		    hb_buffer_t *buffer,
		    void *user_data HB_UNUSED)
{
B
Behdad Esfahbod 已提交
479 480 481
  hb_mask_t mask_array[ARRAY_LENGTH (indic_basic_features)] = {0};
  unsigned int num_masks = ARRAY_LENGTH (indic_basic_features);
  for (unsigned int i = 0; i < num_masks; i++)
482
    mask_array[i] = map->get_1_mask (indic_basic_features[i].tag);
B
Behdad Esfahbod 已提交
483 484

  find_syllables (map, buffer, mask_array);
B
Behdad Esfahbod 已提交
485 486
}

B
Behdad Esfahbod 已提交
487
static void
488 489
final_reordering_syllable (hb_buffer_t *buffer,
			   unsigned int start, unsigned int end)
B
Behdad Esfahbod 已提交
490
{
491 492
  hb_glyph_info_t *info = buffer->info;

493 494 495 496 497 498
  /* 4. Final reordering:
   *
   * After the localized forms and basic shaping forms GSUB features have been
   * applied (see below), the shaping engine performs some final glyph
   * reordering before applying all the remaining font features to the entire
   * cluster.
499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
   */

  /* Find base again */
  unsigned int base = end;
  for (unsigned int i = start; i < end; i++)
    if (info[i].indic_position() == POS_BASE_C) {
      base = i;
      break;
    }

  if (base == start) {
    /* There's no Reph, and no left Matra to reposition.  Just merge the cluster
     * and go home. */
    buffer->merge_clusters (start, end);
    return;
  }

B
Minor  
Behdad Esfahbod 已提交
516 517
  unsigned int start_of_last_cluster = base;

518
  /*   o Reorder matras:
519 520 521 522 523 524 525
   *
   *     If a pre-base matra character had been reordered before applying basic
   *     features, the glyph can be moved closer to the main consonant based on
   *     whether half-forms had been formed. Actual position for the matra is
   *     defined as “after last standalone halant glyph, after initial matra
   *     position and before the main consonant”. If ZWJ or ZWNJ follow this
   *     halant, position is moved after it.
526 527 528 529 530 531
   */

  unsigned int new_matra_pos = base - 1;
  while (new_matra_pos > start &&
	 !(FLAG (info[new_matra_pos].indic_category()) & (FLAG (OT_M) | FLAG (OT_H))))
    new_matra_pos--;
532 533 534 535
  /* If we found no Halant we are done.  Otherwise only proceed if the Halant does
   * not belong to the Matra itself! */
  if (info[new_matra_pos].indic_category() == OT_H &&
      info[new_matra_pos].indic_position() != POS_LEFT_MATRA) {
536 537 538 539 540 541
    /* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */
    if (new_matra_pos + 1 < end && is_joiner (info[new_matra_pos + 1]))
      new_matra_pos++;

    /* Now go see if there's actually any matras... */
    for (unsigned int i = new_matra_pos; i > start; i--)
542
      if (info[i - 1].indic_position () == POS_LEFT_MATRA)
543 544 545 546 547
      {
	unsigned int old_matra_pos = i - 1;
	hb_glyph_info_t matra = info[old_matra_pos];
	memmove (&info[old_matra_pos], &info[old_matra_pos + 1], (new_matra_pos - old_matra_pos) * sizeof (info[0]));
	info[new_matra_pos] = matra;
B
Minor  
Behdad Esfahbod 已提交
548
	start_of_last_cluster = MIN (new_matra_pos, start_of_last_cluster);
549 550 551 552 553 554
	new_matra_pos--;
      }
  }


  /*   o Reorder reph:
555 556 557 558 559 560
   *
   *     Reph’s original position is always at the beginning of the syllable,
   *     (i.e. it is not reordered at the character reordering stage). However,
   *     it will be reordered according to the basic-forms shaping results.
   *     Possible positions for reph, depending on the script, are; after main,
   *     before post-base consonant forms, and after post-base consonant forms.
561 562 563 564 565 566 567 568 569
   */

  /* If there's anything after the Ra that has the REPH pos, it ought to be halant.
   * Which means that the font has failed to ligate the Reph.  In which case, we
   * shouldn't move. */
  if (start + 1 < end &&
      info[start].indic_position() == POS_RA_TO_BECOME_REPH &&
      info[start + 1].indic_position() != POS_RA_TO_BECOME_REPH)
  {
570 571 572 573 574 575 576 577 578 579
      unsigned int new_reph_pos;

     enum reph_position_t {
       REPH_AFTER_MAIN, /* Malayalam, Oriya */
       REPH_BEFORE_SUBSCRIPT, /* Gurmukhi  */
       REPH_AFTER_SUBSCRIPT, /* Bengali */
       REPH_BEFORE_POSTSCRIPT, /* Devanagari, Gujarati  */
       REPH_AFTER_POSTSCRIPT, /* Kannada, Tamil, Telugu  */
     } reph_pos = REPH_BEFORE_POSTSCRIPT; /* XXX */ /* XXX Figure out old behavior too */

580 581
    /*       1. If reph should be positioned after post-base consonant forms,
     *          proceed to step 5.
582 583 584 585 586 587 588 589
     */
    reph_step_1:
    {
      if (reph_pos == REPH_AFTER_POSTSCRIPT)
	goto reph_step_5;
    }

    /*       2. If the reph repositioning class is not after post-base: target
590 591 592 593 594 595 596 597 598
     *          position is after the first explicit halant glyph between the
     *          first post-reph consonant and last main consonant. If ZWJ or ZWNJ
     *          are following this halant, position is moved after it. If such
     *          position is found, this is the target position. Otherwise,
     *          proceed to the next step.
     *
     *          Note: in old-implementation fonts, where classifications were
     *          fixed in shaping engine, there was no case where reph position
     *          will be found on this step.
599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614
     */
    reph_step_2:
    {
      new_reph_pos = start + 1;
      while (new_reph_pos < base && info[new_reph_pos].indic_category() != OT_H)
	new_reph_pos++;

      if (new_reph_pos < base && info[new_reph_pos].indic_category() == OT_H) {
	/* ->If ZWJ or ZWNJ are following this halant, position is moved after it. */
	if (new_reph_pos + 1 < base && is_joiner (info[new_reph_pos + 1]))
	  new_reph_pos++;
	goto reph_move;
      }
    }

    /*       3. If reph should be repositioned after the main consonant: find the
615 616
     *          first consonant not ligated with main, or find the first
     *          consonant that is not a potential pre-base reordering Ra.
617 618 619 620 621 622 623
     */
    reph_step_3:
    {
      /* XXX */
    }

    /*       4. If reph should be positioned before post-base consonant, find
624 625 626
     *          first post-base classified consonant not ligated with main. If no
     *          consonant is found, the target position should be before the
     *          first matra, syllable modifier sign or vedic sign.
627 628 629 630 631 632 633
     */
    reph_step_4:
    {
      /* XXX */
    }

    /*       5. If no consonant is found in steps 3 or 4, move reph to a position
634 635 636 637 638 639
     *          immediately before the first post-base matra, syllable modifier
     *          sign or vedic sign that has a reordering class after the intended
     *          reph position. For example, if the reordering position for reph
     *          is post-main, it will skip above-base matras that also have a
     *          post-main position.
     */
640 641 642 643
    reph_step_5:
    {
      /* XXX */
    }
644

645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
    /*       6. Otherwise, reorder reph to the end of the syllable.
     */
    reph_step_6:
    {
      new_reph_pos = end - 1;
      while (new_reph_pos > start && info[new_reph_pos].indic_position() == POS_SMVD)
	new_reph_pos--;

      if (unlikely (info[new_reph_pos].indic_category() == OT_H)) {
	/* *If* the Reph is to be ending up after a Matra,Halant sequence,
	 * position it before that Halant so it can interact with the Matra.
	 * However, if it's a plain Consonant,Halant we shouldn't do that.
	 */
	for (unsigned int i = base + 1; i < new_reph_pos; i++)
	  if (info[i].indic_category() == OT_M) {
	    /* Ok, got it. */
	    new_reph_pos--;
	  }
      }
      goto reph_move;
665 666
    }

667 668 669 670 671 672 673 674
    reph_move:
    {
      /* Move */
      hb_glyph_info_t reph = info[start];
      memmove (&info[start], &info[start + 1], (new_reph_pos - start) * sizeof (info[0]));
      info[new_reph_pos] = reph;
      start_of_last_cluster = start; /* Yay, one big cluster! */
    }
675 676 677 678
  }


  /*   o Reorder pre-base reordering consonants:
679 680 681 682 683 684 685 686 687 688 689 690 691 692 693
   *
   *     If a pre-base reordering consonant is found, reorder it according to
   *     the following rules:
   *
   *       1. Only reorder a glyph produced by substitution during application
   *          of the feature. (Note that a font may shape a Ra consonant with
   *          the feature generally but block it in certain contexts.)
   *
   *       2. Try to find a target position the same way as for pre-base matra.
   *          If it is found, reorder pre-base consonant glyph.
   *
   *       3. If position is not found, reorder immediately before main
   *          consonant.
   */

694 695 696

  /* Finish off the clusters and go home! */

697 698
  if (!options.uniscribe_bug_compatible)
  {
699 700 701 702 703 704 705 706 707 708 709 710 711 712 713
    /* This is what Uniscribe does.  Ie. add cluster boundaries after Halant,ZWNJ.
     * This means, half forms are submerged into the main consonants cluster.
     * This is unnecessary, and makes cursor positioning harder, but that's what
     * Uniscribe does. */
    unsigned int cluster_start = start;
    for (unsigned int i = start + 1; i < start_of_last_cluster; i++)
      if (info[i - 1].indic_category() == OT_H && info[i].indic_category() == OT_ZWNJ) {
        i++;
	buffer->merge_clusters (cluster_start, i);
	cluster_start = i;
      }
    start_of_last_cluster = cluster_start;
  }

  buffer->merge_clusters (start_of_last_cluster, end);
714
}
715 716


717 718 719 720 721 722 723 724 725 726 727
static void
final_reordering (const hb_ot_map_t *map,
		  hb_face_t *face,
		  hb_buffer_t *buffer,
		  void *user_data HB_UNUSED)
{
  unsigned int count = buffer->len;
  if (!count) return;

  hb_glyph_info_t *info = buffer->info;
  unsigned int last = 0;
728
  unsigned int last_syllable = info[0].syllable();
729
  for (unsigned int i = 1; i < count; i++)
730
    if (last_syllable != info[i].syllable()) {
731 732
      final_reordering_syllable (buffer, last, i);
      last = i;
733
      last_syllable = info[last].syllable();
734 735
    }
  final_reordering_syllable (buffer, last, count);
736

B
Behdad Esfahbod 已提交
737 738 739 740 741
  HB_BUFFER_DEALLOCATE_VAR (buffer, indic_category);
  HB_BUFFER_DEALLOCATE_VAR (buffer, indic_position);
}


B
Behdad Esfahbod 已提交
742