2013-02-11 19:36:23 +01:00
|
|
|
/*
|
|
|
|
* Copyright © 2011,2012,2013 Google, Inc.
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
2018-08-26 07:36:36 +02:00
|
|
|
#include "hb-ot-shape-complex-myanmar.hh"
|
2013-02-11 19:36:23 +01:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Myanmar shaper.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static const hb_tag_t
|
2013-02-15 12:22:26 +01:00
|
|
|
basic_features[] =
|
2013-02-11 19:36:23 +01:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Basic features.
|
|
|
|
* These features are applied in order, one at a time, after initial_reordering.
|
|
|
|
*/
|
|
|
|
HB_TAG('r','p','h','f'),
|
|
|
|
HB_TAG('p','r','e','f'),
|
|
|
|
HB_TAG('b','l','w','f'),
|
|
|
|
HB_TAG('p','s','t','f'),
|
2013-02-15 12:22:26 +01:00
|
|
|
};
|
|
|
|
static const hb_tag_t
|
|
|
|
other_features[] =
|
|
|
|
{
|
2013-02-11 19:36:23 +01:00
|
|
|
/*
|
|
|
|
* Other features.
|
|
|
|
* These features are applied all at once, after final_reordering.
|
|
|
|
*/
|
|
|
|
HB_TAG('p','r','e','s'),
|
|
|
|
HB_TAG('a','b','v','s'),
|
|
|
|
HB_TAG('b','l','w','s'),
|
|
|
|
HB_TAG('p','s','t','s'),
|
2018-09-24 04:33:38 +02:00
|
|
|
};
|
|
|
|
static const hb_tag_t
|
|
|
|
positioning_features[] =
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Positioning features.
|
|
|
|
* We don't care about the types.
|
|
|
|
*/
|
2013-02-11 19:36:23 +01:00
|
|
|
HB_TAG('d','i','s','t'),
|
2013-10-15 12:28:23 +02:00
|
|
|
/* Pre-release version of Windows 8 Myanmar font had abvm,blwm
|
|
|
|
* features. The released Windows 8 version of the font (as well
|
|
|
|
* as the released spec) used 'mark' instead. The Windows 8
|
|
|
|
* shaper however didn't apply 'mark' but did apply 'mkmk'.
|
|
|
|
* Perhaps it applied abvm/blwm. This was fixed in a Windows 8
|
|
|
|
* update, so now it applies mark/mkmk. We are guessing that
|
|
|
|
* it still applies abvm/blwm too.
|
|
|
|
*/
|
|
|
|
HB_TAG('a','b','v','m'),
|
|
|
|
HB_TAG('b','l','w','m'),
|
2013-02-11 19:36:23 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
|
|
|
setup_syllables (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer);
|
|
|
|
static void
|
|
|
|
initial_reordering (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer);
|
|
|
|
static void
|
|
|
|
final_reordering (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer);
|
|
|
|
|
|
|
|
static void
|
|
|
|
collect_features_myanmar (hb_ot_shape_planner_t *plan)
|
|
|
|
{
|
|
|
|
hb_ot_map_builder_t *map = &plan->map;
|
|
|
|
|
|
|
|
/* Do this before any lookups have been applied. */
|
|
|
|
map->add_gsub_pause (setup_syllables);
|
|
|
|
|
2018-09-25 00:01:53 +02:00
|
|
|
map->enable_feature (HB_TAG('l','o','c','l'));
|
2013-02-11 19:36:23 +01:00
|
|
|
/* 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. */
|
2018-09-25 00:01:53 +02:00
|
|
|
map->enable_feature (HB_TAG('c','c','m','p'));
|
2013-02-11 19:36:23 +01:00
|
|
|
|
|
|
|
|
|
|
|
map->add_gsub_pause (initial_reordering);
|
2018-09-24 04:33:38 +02:00
|
|
|
|
2013-02-15 12:22:26 +01:00
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (basic_features); i++)
|
|
|
|
{
|
2018-09-25 00:01:53 +02:00
|
|
|
map->add_feature (basic_features[i], F_GLOBAL | F_MANUAL_ZWJ);
|
2017-10-15 12:11:08 +02:00
|
|
|
map->add_gsub_pause (nullptr);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
2018-09-24 04:33:38 +02:00
|
|
|
|
2013-02-11 19:36:23 +01:00
|
|
|
map->add_gsub_pause (final_reordering);
|
2018-09-24 04:33:38 +02:00
|
|
|
|
2013-02-15 12:22:26 +01:00
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (other_features); i++)
|
2018-09-25 00:01:53 +02:00
|
|
|
map->add_feature (other_features[i], F_GLOBAL | F_MANUAL_ZWJ);
|
2018-09-24 04:33:38 +02:00
|
|
|
|
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (positioning_features); i++)
|
2018-09-25 00:01:53 +02:00
|
|
|
map->enable_feature (positioning_features[i]);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
override_features_myanmar (hb_ot_shape_planner_t *plan)
|
|
|
|
{
|
2018-09-24 23:55:03 +02:00
|
|
|
plan->map.disable_feature (HB_TAG('l','i','g','a'));
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
enum syllable_type_t {
|
|
|
|
consonant_syllable,
|
2013-11-26 00:10:38 +01:00
|
|
|
punctuation_cluster,
|
2013-02-11 19:36:23 +01:00
|
|
|
broken_cluster,
|
|
|
|
non_myanmar_cluster,
|
|
|
|
};
|
|
|
|
|
|
|
|
#include "hb-ot-shape-complex-myanmar-machine.hh"
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
setup_masks_myanmar (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
hb_font_t *font HB_UNUSED)
|
|
|
|
{
|
|
|
|
HB_BUFFER_ALLOCATE_VAR (buffer, myanmar_category);
|
|
|
|
HB_BUFFER_ALLOCATE_VAR (buffer, myanmar_position);
|
|
|
|
|
|
|
|
/* We cannot setup masks here. We save information about characters
|
|
|
|
* and setup masks later on in a pause-callback. */
|
|
|
|
|
|
|
|
unsigned int count = buffer->len;
|
2014-07-17 20:22:11 +02:00
|
|
|
hb_glyph_info_t *info = buffer->info;
|
2013-02-11 19:36:23 +01:00
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2014-07-17 20:22:11 +02:00
|
|
|
set_myanmar_properties (info[i]);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
setup_syllables (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
|
|
|
hb_font_t *font HB_UNUSED,
|
|
|
|
hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
find_syllables (buffer);
|
2017-08-11 03:45:33 +02:00
|
|
|
foreach_syllable (buffer, start, end)
|
|
|
|
buffer->unsafe_to_break (start, end);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
compare_myanmar_order (const hb_glyph_info_t *pa, const hb_glyph_info_t *pb)
|
|
|
|
{
|
|
|
|
int a = pa->myanmar_position();
|
|
|
|
int b = pb->myanmar_position();
|
|
|
|
|
|
|
|
return a < b ? -1 : a == b ? 0 : +1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Rules from:
|
2018-04-12 11:10:45 +02:00
|
|
|
* https://docs.microsoft.com/en-us/typography/script-development/myanmar */
|
2013-02-11 19:36:23 +01:00
|
|
|
|
|
|
|
static void
|
2015-07-22 12:58:11 +02:00
|
|
|
initial_reordering_consonant_syllable (hb_buffer_t *buffer,
|
2013-02-11 19:36:23 +01:00
|
|
|
unsigned int start, unsigned int end)
|
|
|
|
{
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
|
|
|
|
|
|
|
unsigned int base = end;
|
|
|
|
bool has_reph = false;
|
|
|
|
|
|
|
|
{
|
|
|
|
unsigned int limit = start;
|
|
|
|
if (start + 3 <= end &&
|
|
|
|
info[start ].myanmar_category() == OT_Ra &&
|
|
|
|
info[start+1].myanmar_category() == OT_As &&
|
|
|
|
info[start+2].myanmar_category() == OT_H)
|
|
|
|
{
|
|
|
|
limit += 3;
|
|
|
|
base = start;
|
|
|
|
has_reph = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
if (!has_reph)
|
|
|
|
base = limit;
|
|
|
|
|
|
|
|
for (unsigned int i = limit; i < end; i++)
|
|
|
|
if (is_consonant (info[i]))
|
|
|
|
{
|
|
|
|
base = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Reorder! */
|
|
|
|
{
|
|
|
|
unsigned int i = start;
|
|
|
|
for (; i < start + (has_reph ? 3 : 0); i++)
|
|
|
|
info[i].myanmar_position() = POS_AFTER_MAIN;
|
|
|
|
for (; i < base; i++)
|
|
|
|
info[i].myanmar_position() = POS_PRE_C;
|
|
|
|
if (i < end)
|
|
|
|
{
|
|
|
|
info[i].myanmar_position() = POS_BASE_C;
|
|
|
|
i++;
|
|
|
|
}
|
2013-02-12 22:13:56 +01:00
|
|
|
indic_position_t pos = POS_AFTER_MAIN;
|
2013-02-11 19:36:23 +01:00
|
|
|
/* The following loop may be ugly, but it implements all of
|
|
|
|
* Myanmar reordering! */
|
|
|
|
for (; i < end; i++)
|
|
|
|
{
|
|
|
|
if (info[i].myanmar_category() == OT_MR) /* Pre-base reordering */
|
|
|
|
{
|
|
|
|
info[i].myanmar_position() = POS_PRE_C;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (info[i].myanmar_position() < POS_BASE_C) /* Left matra */
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
2018-02-02 18:04:04 +01:00
|
|
|
if (info[i].myanmar_category() == OT_VS)
|
|
|
|
{
|
|
|
|
info[i].myanmar_position() = info[i - 1].myanmar_position();
|
|
|
|
continue;
|
|
|
|
}
|
2013-02-11 19:36:23 +01:00
|
|
|
|
|
|
|
if (pos == POS_AFTER_MAIN && info[i].myanmar_category() == OT_VBlw)
|
|
|
|
{
|
|
|
|
pos = POS_BELOW_C;
|
|
|
|
info[i].myanmar_position() = pos;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pos == POS_BELOW_C && info[i].myanmar_category() == OT_A)
|
|
|
|
{
|
|
|
|
info[i].myanmar_position() = POS_BEFORE_SUB;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (pos == POS_BELOW_C && info[i].myanmar_category() == OT_VBlw)
|
|
|
|
{
|
|
|
|
info[i].myanmar_position() = pos;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (pos == POS_BELOW_C && info[i].myanmar_category() != OT_A)
|
|
|
|
{
|
|
|
|
pos = POS_AFTER_SUB;
|
|
|
|
info[i].myanmar_position() = pos;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
info[i].myanmar_position() = pos;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Sit tight, rock 'n roll! */
|
2015-09-01 17:15:25 +02:00
|
|
|
buffer->sort (start, end, compare_myanmar_order);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
initial_reordering_syllable (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_face_t *face,
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
unsigned int start, unsigned int end)
|
|
|
|
{
|
|
|
|
syllable_type_t syllable_type = (syllable_type_t) (buffer->info[start].syllable() & 0x0F);
|
|
|
|
switch (syllable_type) {
|
2015-07-22 12:58:11 +02:00
|
|
|
|
|
|
|
case broken_cluster: /* We already inserted dotted-circles, so just call the consonant_syllable. */
|
|
|
|
case consonant_syllable:
|
|
|
|
initial_reordering_consonant_syllable (buffer, start, end);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case punctuation_cluster:
|
|
|
|
case non_myanmar_cluster:
|
|
|
|
break;
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
insert_dotted_circles (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
|
|
|
hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
/* Note: This loop is extra overhead, but should not be measurable. */
|
|
|
|
bool has_broken_syllables = false;
|
|
|
|
unsigned int count = buffer->len;
|
2014-07-17 20:22:11 +02:00
|
|
|
hb_glyph_info_t *info = buffer->info;
|
2013-02-11 19:36:23 +01:00
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2014-07-17 20:22:11 +02:00
|
|
|
if ((info[i].syllable() & 0x0F) == broken_cluster)
|
|
|
|
{
|
2013-02-11 19:36:23 +01:00
|
|
|
has_broken_syllables = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (likely (!has_broken_syllables))
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
|
|
hb_codepoint_t dottedcircle_glyph;
|
2016-02-24 11:05:23 +01:00
|
|
|
if (!font->get_nominal_glyph (0x25CCu, &dottedcircle_glyph))
|
2013-02-11 19:36:23 +01:00
|
|
|
return;
|
|
|
|
|
|
|
|
hb_glyph_info_t dottedcircle = {0};
|
2014-07-11 20:54:42 +02:00
|
|
|
dottedcircle.codepoint = 0x25CCu;
|
2013-02-11 19:36:23 +01:00
|
|
|
set_myanmar_properties (dottedcircle);
|
|
|
|
dottedcircle.codepoint = dottedcircle_glyph;
|
|
|
|
|
|
|
|
buffer->clear_output ();
|
|
|
|
|
|
|
|
buffer->idx = 0;
|
|
|
|
unsigned int last_syllable = 0;
|
2018-06-01 05:03:00 +02:00
|
|
|
while (buffer->idx < buffer->len && buffer->successful)
|
2013-02-11 19:36:23 +01:00
|
|
|
{
|
|
|
|
unsigned int syllable = buffer->cur().syllable();
|
|
|
|
syllable_type_t syllable_type = (syllable_type_t) (syllable & 0x0F);
|
|
|
|
if (unlikely (last_syllable != syllable && syllable_type == broken_cluster))
|
|
|
|
{
|
|
|
|
last_syllable = syllable;
|
|
|
|
|
2015-10-21 15:16:49 +02:00
|
|
|
hb_glyph_info_t ginfo = dottedcircle;
|
|
|
|
ginfo.cluster = buffer->cur().cluster;
|
|
|
|
ginfo.mask = buffer->cur().mask;
|
|
|
|
ginfo.syllable() = buffer->cur().syllable();
|
2013-02-11 19:36:23 +01:00
|
|
|
|
2015-10-21 15:16:49 +02:00
|
|
|
buffer->output_info (ginfo);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
buffer->next_glyph ();
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer->swap_buffers ();
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
initial_reordering (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
insert_dotted_circles (plan, font, buffer);
|
|
|
|
|
2015-07-22 12:58:11 +02:00
|
|
|
foreach_syllable (buffer, start, end)
|
|
|
|
initial_reordering_syllable (plan, font->face, buffer, start, end);
|
2013-02-11 19:36:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
final_reordering (const hb_ot_shape_plan_t *plan,
|
|
|
|
hb_font_t *font HB_UNUSED,
|
|
|
|
hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
|
|
|
unsigned int count = buffer->len;
|
|
|
|
|
|
|
|
/* Zero syllables now... */
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
info[i].syllable() = 0;
|
|
|
|
|
|
|
|
HB_BUFFER_DEALLOCATE_VAR (buffer, myanmar_category);
|
|
|
|
HB_BUFFER_DEALLOCATE_VAR (buffer, myanmar_position);
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:20:59 +01:00
|
|
|
|
2014-07-27 01:17:44 +02:00
|
|
|
/* Uniscribe seems to have a shaper for 'mymr' that is like the
|
|
|
|
* generic shaper, except that it zeros mark advances GDEF_LATE. */
|
|
|
|
const hb_ot_complex_shaper_t _hb_ot_complex_shaper_myanmar_old =
|
|
|
|
{
|
2017-10-15 12:11:08 +02:00
|
|
|
nullptr, /* collect_features */
|
|
|
|
nullptr, /* override_features */
|
|
|
|
nullptr, /* data_create */
|
|
|
|
nullptr, /* data_destroy */
|
|
|
|
nullptr, /* preprocess_text */
|
|
|
|
nullptr, /* postprocess_glyphs */
|
2014-07-27 01:17:44 +02:00
|
|
|
HB_OT_SHAPE_NORMALIZATION_MODE_DEFAULT,
|
2017-10-15 12:11:08 +02:00
|
|
|
nullptr, /* decompose */
|
|
|
|
nullptr, /* compose */
|
|
|
|
nullptr, /* setup_masks */
|
|
|
|
nullptr, /* disable_otl */
|
|
|
|
nullptr, /* reorder_marks */
|
2014-07-27 01:17:44 +02:00
|
|
|
HB_OT_SHAPE_ZERO_WIDTH_MARKS_BY_GDEF_LATE,
|
|
|
|
true, /* fallback_position */
|
|
|
|
};
|
|
|
|
|
2013-02-11 19:36:23 +01:00
|
|
|
const hb_ot_complex_shaper_t _hb_ot_complex_shaper_myanmar =
|
|
|
|
{
|
|
|
|
collect_features_myanmar,
|
|
|
|
override_features_myanmar,
|
2017-10-15 12:11:08 +02:00
|
|
|
nullptr, /* data_create */
|
|
|
|
nullptr, /* data_destroy */
|
|
|
|
nullptr, /* preprocess_text */
|
|
|
|
nullptr, /* postprocess_glyphs */
|
2013-12-31 09:04:35 +01:00
|
|
|
HB_OT_SHAPE_NORMALIZATION_MODE_COMPOSED_DIACRITICS_NO_SHORT_CIRCUIT,
|
2017-10-15 12:11:08 +02:00
|
|
|
nullptr, /* decompose */
|
|
|
|
nullptr, /* compose */
|
2013-02-11 19:36:23 +01:00
|
|
|
setup_masks_myanmar,
|
2017-10-15 12:11:08 +02:00
|
|
|
nullptr, /* disable_otl */
|
|
|
|
nullptr, /* reorder_marks */
|
2013-10-28 00:20:59 +01:00
|
|
|
HB_OT_SHAPE_ZERO_WIDTH_MARKS_BY_GDEF_EARLY,
|
2013-02-11 19:36:23 +01:00
|
|
|
false, /* fallback_position */
|
|
|
|
};
|