2011-06-02 21:43:12 +00:00
|
|
|
|
/*
|
2012-05-24 19:00:01 +00:00
|
|
|
|
* Copyright © 2011,2012 Google, Inc.
|
2011-06-02 21:43:12 +00:00
|
|
|
|
*
|
|
|
|
|
* 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
|
|
|
|
|
*/
|
|
|
|
|
|
2012-04-20 02:34:06 +00:00
|
|
|
|
#include "hb-ot-shape-complex-indic-private.hh"
|
2012-07-24 00:14:13 +00:00
|
|
|
|
#include "hb-ot-layout-private.hh"
|
2011-07-30 23:04:02 +00:00
|
|
|
|
|
2013-02-12 17:14:10 +00:00
|
|
|
|
/* buffer var allocations */
|
|
|
|
|
#define indic_category() complex_var_u8_0() /* indic_category_t */
|
|
|
|
|
#define indic_position() complex_var_u8_1() /* indic_position_t */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Indic shaper.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define IN_HALF_BLOCK(u, Base) (((u) & ~0x7F) == (Base))
|
|
|
|
|
|
|
|
|
|
#define IS_DEVA(u) (IN_HALF_BLOCK (u, 0x0900))
|
|
|
|
|
#define IS_BENG(u) (IN_HALF_BLOCK (u, 0x0980))
|
|
|
|
|
#define IS_GURU(u) (IN_HALF_BLOCK (u, 0x0A00))
|
|
|
|
|
#define IS_GUJR(u) (IN_HALF_BLOCK (u, 0x0A80))
|
|
|
|
|
#define IS_ORYA(u) (IN_HALF_BLOCK (u, 0x0B00))
|
|
|
|
|
#define IS_TAML(u) (IN_HALF_BLOCK (u, 0x0B80))
|
|
|
|
|
#define IS_TELU(u) (IN_HALF_BLOCK (u, 0x0C00))
|
|
|
|
|
#define IS_KNDA(u) (IN_HALF_BLOCK (u, 0x0C80))
|
|
|
|
|
#define IS_MLYM(u) (IN_HALF_BLOCK (u, 0x0D00))
|
|
|
|
|
#define IS_SINH(u) (IN_HALF_BLOCK (u, 0x0D80))
|
|
|
|
|
#define IS_KHMR(u) (IN_HALF_BLOCK (u, 0x1780))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define MATRA_POS_LEFT(u) POS_PRE_M
|
|
|
|
|
#define MATRA_POS_RIGHT(u) ( \
|
|
|
|
|
IS_DEVA(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_BENG(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_GURU(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_GUJR(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_ORYA(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_TAML(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_TELU(u) ? (u <= 0x0C42 ? POS_BEFORE_SUB : POS_AFTER_SUB) : \
|
|
|
|
|
IS_KNDA(u) ? (u < 0x0CC3 || u > 0xCD6 ? POS_BEFORE_SUB : POS_AFTER_SUB) : \
|
|
|
|
|
IS_MLYM(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_SINH(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_KHMR(u) ? POS_AFTER_POST : \
|
|
|
|
|
/*default*/ POS_AFTER_SUB \
|
|
|
|
|
)
|
|
|
|
|
#define MATRA_POS_TOP(u) ( /* BENG and MLYM don't have top matras. */ \
|
|
|
|
|
IS_DEVA(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_GURU(u) ? POS_AFTER_POST : /* Deviate from spec */ \
|
|
|
|
|
IS_GUJR(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_ORYA(u) ? POS_AFTER_MAIN : \
|
|
|
|
|
IS_TAML(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_TELU(u) ? POS_BEFORE_SUB : \
|
|
|
|
|
IS_KNDA(u) ? POS_BEFORE_SUB : \
|
|
|
|
|
IS_SINH(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_KHMR(u) ? POS_AFTER_POST : \
|
|
|
|
|
/*default*/ POS_AFTER_SUB \
|
|
|
|
|
)
|
|
|
|
|
#define MATRA_POS_BOTTOM(u) ( \
|
|
|
|
|
IS_DEVA(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_BENG(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_GURU(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_GUJR(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_ORYA(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_TAML(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_TELU(u) ? POS_BEFORE_SUB : \
|
|
|
|
|
IS_KNDA(u) ? POS_BEFORE_SUB : \
|
|
|
|
|
IS_MLYM(u) ? POS_AFTER_POST : \
|
|
|
|
|
IS_SINH(u) ? POS_AFTER_SUB : \
|
|
|
|
|
IS_KHMR(u) ? POS_AFTER_POST : \
|
|
|
|
|
/*default*/ POS_AFTER_SUB \
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
static inline indic_position_t
|
|
|
|
|
matra_position (hb_codepoint_t u, indic_position_t side)
|
|
|
|
|
{
|
|
|
|
|
switch ((int) side)
|
|
|
|
|
{
|
|
|
|
|
case POS_PRE_C: return MATRA_POS_LEFT (u);
|
|
|
|
|
case POS_POST_C: return MATRA_POS_RIGHT (u);
|
|
|
|
|
case POS_ABOVE_C: return MATRA_POS_TOP (u);
|
|
|
|
|
case POS_BELOW_C: return MATRA_POS_BOTTOM (u);
|
|
|
|
|
};
|
|
|
|
|
return side;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* XXX
|
|
|
|
|
* This is a hack for now. We should move this data into the main Indic table.
|
|
|
|
|
* Or completely remove it and just check in the tables.
|
|
|
|
|
*/
|
|
|
|
|
static const hb_codepoint_t ra_chars[] = {
|
|
|
|
|
0x0930, /* Devanagari */
|
|
|
|
|
0x09B0, /* Bengali */
|
|
|
|
|
0x09F0, /* Bengali */
|
|
|
|
|
0x0A30, /* Gurmukhi */ /* No Reph */
|
|
|
|
|
0x0AB0, /* Gujarati */
|
|
|
|
|
0x0B30, /* Oriya */
|
|
|
|
|
0x0BB0, /* Tamil */ /* No Reph */
|
|
|
|
|
0x0C30, /* Telugu */ /* Reph formed only with ZWJ */
|
|
|
|
|
0x0CB0, /* Kannada */
|
|
|
|
|
0x0D30, /* Malayalam */ /* No Reph, Logical Repha */
|
|
|
|
|
|
|
|
|
|
0x0DBB, /* Sinhala */ /* Reph formed only with ZWJ */
|
|
|
|
|
|
|
|
|
|
0x179A, /* Khmer */ /* No Reph, Visual Repha */
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static inline indic_position_t
|
|
|
|
|
consonant_position (hb_codepoint_t u)
|
|
|
|
|
{
|
|
|
|
|
if ((u & ~0x007F) == 0x1780)
|
|
|
|
|
return POS_BELOW_C; /* In Khmer coeng model, post and below forms should not be reordered. */
|
|
|
|
|
return POS_BASE_C; /* Will recategorize later based on font lookups. */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline bool
|
|
|
|
|
is_ra (hb_codepoint_t u)
|
|
|
|
|
{
|
|
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (ra_chars); i++)
|
|
|
|
|
if (u == ra_chars[i])
|
|
|
|
|
return true;
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline bool
|
|
|
|
|
is_one_of (const hb_glyph_info_t &info, unsigned int flags)
|
|
|
|
|
{
|
|
|
|
|
/* If it ligated, all bets are off. */
|
|
|
|
|
if (is_a_ligature (info)) return false;
|
|
|
|
|
return !!(FLAG (info.indic_category()) & flags);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define JOINER_FLAGS (FLAG (OT_ZWJ) | FLAG (OT_ZWNJ))
|
|
|
|
|
static inline bool
|
|
|
|
|
is_joiner (const hb_glyph_info_t &info)
|
|
|
|
|
{
|
|
|
|
|
return is_one_of (info, JOINER_FLAGS);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Note:
|
|
|
|
|
*
|
|
|
|
|
* We treat Vowels and placeholders as if they were consonants. This is safe because Vowels
|
|
|
|
|
* 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! */
|
|
|
|
|
#define CONSONANT_FLAGS (FLAG (OT_C) | FLAG (OT_CM) | FLAG (OT_Ra) | FLAG (OT_V) | FLAG (OT_NBSP) | FLAG (OT_DOTTEDCIRCLE))
|
|
|
|
|
static inline bool
|
|
|
|
|
is_consonant (const hb_glyph_info_t &info)
|
|
|
|
|
{
|
|
|
|
|
return is_one_of (info, CONSONANT_FLAGS);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define HALANT_OR_COENG_FLAGS (FLAG (OT_H) | FLAG (OT_Coeng))
|
|
|
|
|
static inline bool
|
|
|
|
|
is_halant_or_coeng (const hb_glyph_info_t &info)
|
|
|
|
|
{
|
|
|
|
|
return is_one_of (info, HALANT_OR_COENG_FLAGS);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
|
set_indic_properties (hb_glyph_info_t &info)
|
|
|
|
|
{
|
|
|
|
|
hb_codepoint_t u = info.codepoint;
|
|
|
|
|
unsigned int type = hb_indic_get_categories (u);
|
|
|
|
|
indic_category_t cat = (indic_category_t) (type & 0x7F);
|
|
|
|
|
indic_position_t pos = (indic_position_t) (type >> 8);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Re-assign category
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* The spec says U+0952 is OT_A. However, testing shows that Uniscribe
|
|
|
|
|
* treats U+0951..U+0952 all as OT_VD.
|
|
|
|
|
* TESTS:
|
|
|
|
|
* U+092E,U+0947,U+0952
|
|
|
|
|
* U+092E,U+0952,U+0947
|
|
|
|
|
* U+092E,U+0947,U+0951
|
|
|
|
|
* U+092E,U+0951,U+0947
|
|
|
|
|
* */
|
|
|
|
|
if (unlikely (hb_in_range<hb_codepoint_t> (u, 0x0951, 0x0954)))
|
|
|
|
|
cat = OT_VD;
|
|
|
|
|
|
|
|
|
|
if (unlikely (u == 0x17D1))
|
|
|
|
|
cat = OT_X;
|
|
|
|
|
if (cat == OT_X &&
|
|
|
|
|
unlikely (hb_in_range<hb_codepoint_t> (u, 0x17CB, 0x17D3))) /* Khmer Various signs */
|
|
|
|
|
{
|
|
|
|
|
/* These are like Top Matras. */
|
|
|
|
|
cat = OT_M;
|
|
|
|
|
pos = POS_ABOVE_C;
|
|
|
|
|
}
|
|
|
|
|
if (u == 0x17C6) /* Khmer Bindu doesn't like to be repositioned. */
|
|
|
|
|
cat = OT_N;
|
|
|
|
|
|
|
|
|
|
if (unlikely (u == 0x17D2)) cat = OT_Coeng; /* Khmer coeng */
|
|
|
|
|
else if (unlikely (u == 0x200C)) cat = OT_ZWNJ;
|
|
|
|
|
else if (unlikely (u == 0x200D)) cat = OT_ZWJ;
|
|
|
|
|
else if (unlikely (u == 0x25CC)) cat = OT_DOTTEDCIRCLE;
|
|
|
|
|
else if (unlikely (u == 0x0A71)) cat = OT_SM; /* GURMUKHI ADDAK. More like consonant medial. like 0A75. */
|
|
|
|
|
|
|
|
|
|
if (cat == OT_Repha) {
|
|
|
|
|
/* There are two kinds of characters marked as Repha:
|
|
|
|
|
* - The ones that are GenCat=Mn are already positioned visually, ie. after base. (eg. Khmer)
|
|
|
|
|
* - The ones that are GenCat=Lo is encoded logically, ie. beginning of syllable. (eg. Malayalam)
|
|
|
|
|
*
|
|
|
|
|
* We recategorize the first kind to look like a Nukta and attached to the base directly.
|
|
|
|
|
*/
|
|
|
|
|
if (_hb_glyph_info_get_general_category (&info) == HB_UNICODE_GENERAL_CATEGORY_NON_SPACING_MARK)
|
|
|
|
|
cat = OT_N;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Re-assign position.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
if ((FLAG (cat) & CONSONANT_FLAGS))
|
|
|
|
|
{
|
|
|
|
|
pos = consonant_position (u);
|
|
|
|
|
if (is_ra (u))
|
|
|
|
|
cat = OT_Ra;
|
|
|
|
|
}
|
|
|
|
|
else if (cat == OT_M)
|
|
|
|
|
{
|
|
|
|
|
pos = matra_position (u, pos);
|
|
|
|
|
}
|
|
|
|
|
else if (cat == OT_SM || cat == OT_VD)
|
|
|
|
|
{
|
|
|
|
|
pos = POS_SMVD;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (unlikely (u == 0x0B01)) pos = POS_BEFORE_SUB; /* Oriya Bindu is BeforeSub in the spec. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
info.indic_category() = cat;
|
|
|
|
|
info.indic_position() = pos;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Things above this line should ideally be moved to the Indic table itself.
|
|
|
|
|
*/
|
|
|
|
|
|
2012-08-02 09:01:11 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
/*
|
|
|
|
|
* Indic configurations. Note that we do not want to keep every single script-specific
|
|
|
|
|
* behavior in these tables necessarily. This should mainly be used for per-script
|
|
|
|
|
* properties that are cheaper keeping here, than in the code. Ie. if, say, one and
|
|
|
|
|
* only one script has an exception, that one script can be if'ed directly in the code,
|
|
|
|
|
* instead of adding a new flag in these structs.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
enum base_position_t {
|
|
|
|
|
BASE_POS_FIRST,
|
|
|
|
|
BASE_POS_LAST
|
|
|
|
|
};
|
|
|
|
|
enum reph_position_t {
|
|
|
|
|
REPH_POS_DEFAULT = POS_BEFORE_POST,
|
|
|
|
|
|
|
|
|
|
REPH_POS_AFTER_MAIN = POS_AFTER_MAIN,
|
|
|
|
|
REPH_POS_BEFORE_SUB = POS_BEFORE_SUB,
|
|
|
|
|
REPH_POS_AFTER_SUB = POS_AFTER_SUB,
|
|
|
|
|
REPH_POS_BEFORE_POST = POS_BEFORE_POST,
|
|
|
|
|
REPH_POS_AFTER_POST = POS_AFTER_POST
|
|
|
|
|
};
|
|
|
|
|
enum reph_mode_t {
|
|
|
|
|
REPH_MODE_IMPLICIT, /* Reph formed out of initial Ra,H sequence. */
|
|
|
|
|
REPH_MODE_EXPLICIT, /* Reph formed out of initial Ra,H,ZWJ sequence. */
|
|
|
|
|
REPH_MODE_VIS_REPHA, /* Encoded Repha character, no reordering needed. */
|
|
|
|
|
REPH_MODE_LOG_REPHA /* Encoded Repha character, needs reordering. */
|
|
|
|
|
};
|
|
|
|
|
struct indic_config_t
|
|
|
|
|
{
|
|
|
|
|
hb_script_t script;
|
|
|
|
|
bool has_old_spec;
|
|
|
|
|
hb_codepoint_t virama;
|
|
|
|
|
base_position_t base_pos;
|
|
|
|
|
reph_position_t reph_pos;
|
|
|
|
|
reph_mode_t reph_mode;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const indic_config_t indic_configs[] =
|
|
|
|
|
{
|
|
|
|
|
/* Default. Should be first. */
|
|
|
|
|
{HB_SCRIPT_INVALID, false, 0,BASE_POS_LAST, REPH_POS_DEFAULT, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_DEVANAGARI,true, 0x094D,BASE_POS_LAST, REPH_POS_BEFORE_POST,REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_BENGALI, true, 0x09CD,BASE_POS_LAST, REPH_POS_AFTER_SUB, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_GURMUKHI, true, 0x0A4D,BASE_POS_LAST, REPH_POS_BEFORE_SUB, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_GUJARATI, true, 0x0ACD,BASE_POS_LAST, REPH_POS_BEFORE_POST,REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_ORIYA, true, 0x0B4D,BASE_POS_LAST, REPH_POS_AFTER_MAIN, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_TAMIL, true, 0x0BCD,BASE_POS_LAST, REPH_POS_AFTER_POST, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_TELUGU, true, 0x0C4D,BASE_POS_LAST, REPH_POS_AFTER_POST, REPH_MODE_EXPLICIT},
|
|
|
|
|
{HB_SCRIPT_KANNADA, true, 0x0CCD,BASE_POS_LAST, REPH_POS_AFTER_POST, REPH_MODE_IMPLICIT},
|
|
|
|
|
{HB_SCRIPT_MALAYALAM, true, 0x0D4D,BASE_POS_LAST, REPH_POS_AFTER_MAIN, REPH_MODE_LOG_REPHA},
|
|
|
|
|
{HB_SCRIPT_SINHALA, false,0x0DCA,BASE_POS_FIRST,REPH_POS_AFTER_MAIN, REPH_MODE_EXPLICIT},
|
|
|
|
|
{HB_SCRIPT_KHMER, false,0x17D2,BASE_POS_FIRST,REPH_POS_DEFAULT, REPH_MODE_VIS_REPHA},
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Indic shaper.
|
|
|
|
|
*/
|
2012-07-19 16:32:16 +00:00
|
|
|
|
|
2012-05-11 18:50:53 +00:00
|
|
|
|
struct feature_list_t {
|
2011-06-24 23:05:34 +00:00
|
|
|
|
hb_tag_t tag;
|
|
|
|
|
hb_bool_t is_global;
|
2012-05-11 18:50:53 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const feature_list_t
|
2012-08-02 16:21:44 +00:00
|
|
|
|
indic_features[] =
|
2011-06-02 21:43:12 +00:00
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
/*
|
|
|
|
|
* Basic features.
|
|
|
|
|
* These features are applied in order, one at a time, after initial_reordering.
|
|
|
|
|
*/
|
2011-06-24 23:05:34 +00:00
|
|
|
|
{HB_TAG('n','u','k','t'), true},
|
2012-07-20 00:24:14 +00:00
|
|
|
|
{HB_TAG('a','k','h','n'), true},
|
2011-06-24 23:05:34 +00:00
|
|
|
|
{HB_TAG('r','p','h','f'), false},
|
2012-05-09 09:06:47 +00:00
|
|
|
|
{HB_TAG('r','k','r','f'), true},
|
2011-06-24 23:05:34 +00:00
|
|
|
|
{HB_TAG('p','r','e','f'), false},
|
|
|
|
|
{HB_TAG('h','a','l','f'), false},
|
2012-08-06 04:16:26 +00:00
|
|
|
|
{HB_TAG('b','l','w','f'), false},
|
2012-07-16 16:05:35 +00:00
|
|
|
|
{HB_TAG('a','b','v','f'), false},
|
2011-06-24 23:05:34 +00:00
|
|
|
|
{HB_TAG('p','s','t','f'), false},
|
2012-07-17 17:55:10 +00:00
|
|
|
|
{HB_TAG('c','f','a','r'), false},
|
2012-05-13 16:09:29 +00:00
|
|
|
|
{HB_TAG('v','a','t','u'), true},
|
2013-02-12 23:01:21 +00:00
|
|
|
|
{HB_TAG('c','j','c','t'), true},
|
2012-08-02 16:21:44 +00:00
|
|
|
|
/*
|
|
|
|
|
* Other features.
|
|
|
|
|
* These features are applied all at once, after final_reordering.
|
|
|
|
|
*/
|
|
|
|
|
{HB_TAG('i','n','i','t'), false},
|
|
|
|
|
{HB_TAG('p','r','e','s'), true},
|
|
|
|
|
{HB_TAG('a','b','v','s'), true},
|
|
|
|
|
{HB_TAG('b','l','w','s'), true},
|
|
|
|
|
{HB_TAG('p','s','t','s'), true},
|
|
|
|
|
{HB_TAG('h','a','l','n'), true},
|
|
|
|
|
/* Positioning features, though we don't care about the types. */
|
|
|
|
|
{HB_TAG('d','i','s','t'), true},
|
|
|
|
|
{HB_TAG('a','b','v','m'), true},
|
|
|
|
|
{HB_TAG('b','l','w','m'), true},
|
2011-06-24 23:05:34 +00:00
|
|
|
|
};
|
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
/*
|
|
|
|
|
* Must be in the same order as the indic_features array.
|
|
|
|
|
*/
|
2011-06-24 23:05:34 +00:00
|
|
|
|
enum {
|
|
|
|
|
_NUKT,
|
2012-07-20 00:24:14 +00:00
|
|
|
|
_AKHN,
|
2011-06-24 23:05:34 +00:00
|
|
|
|
RPHF,
|
2012-05-09 09:38:31 +00:00
|
|
|
|
_RKRF,
|
2011-06-24 23:05:34 +00:00
|
|
|
|
PREF,
|
|
|
|
|
HALF,
|
2012-08-06 04:16:26 +00:00
|
|
|
|
BLWF,
|
2012-07-16 16:05:35 +00:00
|
|
|
|
ABVF,
|
2011-06-24 23:05:34 +00:00
|
|
|
|
PSTF,
|
2012-07-17 17:55:10 +00:00
|
|
|
|
CFAR,
|
2012-08-02 16:21:44 +00:00
|
|
|
|
_VATU,
|
2013-02-12 23:01:21 +00:00
|
|
|
|
_CJCT,
|
2012-08-02 16:21:44 +00:00
|
|
|
|
|
|
|
|
|
INIT,
|
|
|
|
|
_PRES,
|
|
|
|
|
_ABVS,
|
|
|
|
|
_BLWS,
|
|
|
|
|
_PSTS,
|
|
|
|
|
_HALN,
|
|
|
|
|
_DIST,
|
|
|
|
|
_ABVM,
|
|
|
|
|
_BLWM,
|
|
|
|
|
|
|
|
|
|
INDIC_NUM_FEATURES,
|
|
|
|
|
INDIC_BASIC_FEATURES = INIT /* Don't forget to update this! */
|
2011-06-02 21:43:12 +00:00
|
|
|
|
};
|
|
|
|
|
|
2012-09-07 18:55:07 +00:00
|
|
|
|
static void
|
|
|
|
|
setup_syllables (const hb_ot_shape_plan_t *plan,
|
|
|
|
|
hb_font_t *font,
|
|
|
|
|
hb_buffer_t *buffer);
|
2011-07-29 20:37:02 +00:00
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
initial_reordering (const hb_ot_shape_plan_t *plan,
|
2012-08-02 12:36:40 +00:00
|
|
|
|
hb_font_t *font,
|
2012-08-02 13:44:18 +00:00
|
|
|
|
hb_buffer_t *buffer);
|
2011-07-08 04:22:40 +00:00
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
final_reordering (const hb_ot_shape_plan_t *plan,
|
2012-08-02 12:36:40 +00:00
|
|
|
|
hb_font_t *font,
|
2012-08-02 13:44:18 +00:00
|
|
|
|
hb_buffer_t *buffer);
|
2011-06-02 21:43:12 +00:00
|
|
|
|
|
2012-07-31 01:08:51 +00:00
|
|
|
|
static void
|
2012-08-02 13:38:28 +00:00
|
|
|
|
collect_features_indic (hb_ot_shape_planner_t *plan)
|
2011-06-02 21:43:12 +00:00
|
|
|
|
{
|
2012-08-02 13:38:28 +00:00
|
|
|
|
hb_ot_map_builder_t *map = &plan->map;
|
|
|
|
|
|
2012-09-07 18:55:07 +00:00
|
|
|
|
/* Do this before any lookups have been applied. */
|
|
|
|
|
map->add_gsub_pause (setup_syllables);
|
|
|
|
|
|
2011-07-08 04:22:40 +00:00
|
|
|
|
map->add_bool_feature (HB_TAG('l','o','c','l'));
|
2011-07-20 20:42:10 +00: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. */
|
2011-07-08 04:22:40 +00:00
|
|
|
|
map->add_bool_feature (HB_TAG('c','c','m','p'));
|
|
|
|
|
|
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
unsigned int i = 0;
|
|
|
|
|
map->add_gsub_pause (initial_reordering);
|
|
|
|
|
for (; i < INDIC_BASIC_FEATURES; i++) {
|
|
|
|
|
map->add_bool_feature (indic_features[i].tag, indic_features[i].is_global);
|
2012-08-02 13:44:18 +00:00
|
|
|
|
map->add_gsub_pause (NULL);
|
2012-05-09 09:07:18 +00:00
|
|
|
|
}
|
2012-08-02 13:44:18 +00:00
|
|
|
|
map->add_gsub_pause (final_reordering);
|
2012-08-02 16:21:44 +00:00
|
|
|
|
for (; i < INDIC_NUM_FEATURES; i++) {
|
|
|
|
|
map->add_bool_feature (indic_features[i].tag, indic_features[i].is_global);
|
|
|
|
|
}
|
2011-06-02 21:43:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-07-31 01:08:51 +00:00
|
|
|
|
static void
|
2012-08-02 13:38:28 +00:00
|
|
|
|
override_features_indic (hb_ot_shape_planner_t *plan)
|
2012-07-17 00:26:57 +00:00
|
|
|
|
{
|
2012-07-17 00:31:24 +00:00
|
|
|
|
/* Uniscribe does not apply 'kern'. */
|
2013-02-12 20:26:45 +00:00
|
|
|
|
if (hb_options ().uniscribe_bug_compatible)
|
2012-08-02 13:38:28 +00:00
|
|
|
|
plan->map.add_feature (HB_TAG('k','e','r','n'), 0, true);
|
2012-11-12 19:02:56 +00:00
|
|
|
|
|
|
|
|
|
plan->map.add_feature (HB_TAG('l','i','g','a'), 0, true);
|
2012-07-17 00:26:57 +00:00
|
|
|
|
}
|
|
|
|
|
|
2011-06-17 22:35:46 +00:00
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
struct would_substitute_feature_t
|
2012-08-02 14:46:34 +00:00
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
inline void init (const hb_ot_map_t *map, hb_tag_t feature_tag)
|
2012-08-02 14:46:34 +00:00
|
|
|
|
{
|
|
|
|
|
map->get_stage_lookups (0/*GSUB*/,
|
|
|
|
|
map->get_feature_stage (0/*GSUB*/, feature_tag),
|
|
|
|
|
&lookups, &count);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inline bool would_substitute (hb_codepoint_t *glyphs,
|
|
|
|
|
unsigned int glyphs_count,
|
2012-08-23 20:26:07 +00:00
|
|
|
|
bool zero_context,
|
2012-08-02 14:46:34 +00:00
|
|
|
|
hb_face_t *face) const
|
|
|
|
|
{
|
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2012-11-15 22:57:31 +00:00
|
|
|
|
if (hb_ot_layout_lookup_would_substitute_fast (face, lookups[i].index, glyphs, glyphs_count, zero_context))
|
2012-08-02 14:46:34 +00:00
|
|
|
|
return true;
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
const hb_ot_map_t::lookup_map_t *lookups;
|
|
|
|
|
unsigned int count;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct indic_shape_plan_t
|
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
ASSERT_POD ();
|
2012-08-02 15:03:39 +00:00
|
|
|
|
|
|
|
|
|
inline bool get_virama_glyph (hb_font_t *font, hb_codepoint_t *pglyph) const
|
|
|
|
|
{
|
|
|
|
|
hb_codepoint_t glyph = virama_glyph;
|
|
|
|
|
if (unlikely (virama_glyph == (hb_codepoint_t) -1))
|
|
|
|
|
{
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (!config->virama || !font->get_glyph (config->virama, 0, &glyph))
|
2012-08-02 15:03:39 +00:00
|
|
|
|
glyph = 0;
|
|
|
|
|
/* Technically speaking, the spec says we should apply 'locl' to virama too.
|
|
|
|
|
* Maybe one day... */
|
|
|
|
|
|
|
|
|
|
/* Our get_glyph() function needs a font, so we can't get the virama glyph
|
|
|
|
|
* during shape planning... Instead, overwrite it here. It's safe. Don't worry! */
|
|
|
|
|
(const_cast<indic_shape_plan_t *> (this))->virama_glyph = glyph;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*pglyph = glyph;
|
|
|
|
|
return glyph != 0;
|
|
|
|
|
}
|
2012-08-02 16:21:44 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
const indic_config_t *config;
|
2012-08-02 16:21:44 +00:00
|
|
|
|
|
|
|
|
|
bool is_old_spec;
|
|
|
|
|
hb_codepoint_t virama_glyph;
|
|
|
|
|
|
2012-11-12 22:02:02 +00:00
|
|
|
|
would_substitute_feature_t rphf;
|
2012-08-02 16:21:44 +00:00
|
|
|
|
would_substitute_feature_t pref;
|
|
|
|
|
would_substitute_feature_t blwf;
|
|
|
|
|
would_substitute_feature_t pstf;
|
|
|
|
|
|
|
|
|
|
hb_mask_t mask_array[INDIC_NUM_FEATURES];
|
2012-08-02 14:46:34 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void *
|
|
|
|
|
data_create_indic (const hb_ot_shape_plan_t *plan)
|
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
indic_shape_plan_t *indic_plan = (indic_shape_plan_t *) calloc (1, sizeof (indic_shape_plan_t));
|
|
|
|
|
if (unlikely (!indic_plan))
|
2012-08-02 14:46:34 +00:00
|
|
|
|
return NULL;
|
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
indic_plan->config = &indic_configs[0];
|
|
|
|
|
for (unsigned int i = 1; i < ARRAY_LENGTH (indic_configs); i++)
|
|
|
|
|
if (plan->props.script == indic_configs[i].script) {
|
|
|
|
|
indic_plan->config = &indic_configs[i];
|
|
|
|
|
break;
|
2012-08-02 16:21:44 +00:00
|
|
|
|
}
|
2012-08-02 18:21:40 +00:00
|
|
|
|
|
2012-11-15 00:24:05 +00:00
|
|
|
|
indic_plan->is_old_spec = indic_plan->config->has_old_spec && ((plan->map.chosen_script[0] & 0x000000FF) != '2');
|
2012-08-02 18:21:40 +00:00
|
|
|
|
indic_plan->virama_glyph = (hb_codepoint_t) -1;
|
2012-08-02 16:21:44 +00:00
|
|
|
|
|
2012-11-12 22:02:02 +00:00
|
|
|
|
indic_plan->rphf.init (&plan->map, HB_TAG('r','p','h','f'));
|
2012-08-02 16:21:44 +00:00
|
|
|
|
indic_plan->pref.init (&plan->map, HB_TAG('p','r','e','f'));
|
|
|
|
|
indic_plan->blwf.init (&plan->map, HB_TAG('b','l','w','f'));
|
|
|
|
|
indic_plan->pstf.init (&plan->map, HB_TAG('p','s','t','f'));
|
|
|
|
|
|
|
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (indic_plan->mask_array); i++)
|
|
|
|
|
indic_plan->mask_array[i] = indic_features[i].is_global ? 0 : plan->map.get_1_mask (indic_features[i].tag);
|
2012-08-02 14:46:34 +00:00
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
return indic_plan;
|
2012-08-02 14:46:34 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
data_destroy_indic (void *data)
|
|
|
|
|
{
|
|
|
|
|
free (data);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static indic_position_t
|
|
|
|
|
consonant_position_from_face (const indic_shape_plan_t *indic_plan,
|
|
|
|
|
hb_codepoint_t *glyphs, unsigned int glyphs_len,
|
|
|
|
|
hb_face_t *face)
|
|
|
|
|
{
|
2012-08-23 20:26:07 +00:00
|
|
|
|
bool zero_context = indic_plan->is_old_spec ? false : true;
|
|
|
|
|
if (indic_plan->pref.would_substitute (glyphs, glyphs_len, zero_context, face)) return POS_BELOW_C;
|
|
|
|
|
if (indic_plan->blwf.would_substitute (glyphs, glyphs_len, zero_context, face)) return POS_BELOW_C;
|
|
|
|
|
if (indic_plan->pstf.would_substitute (glyphs, glyphs_len, zero_context, face)) return POS_POST_C;
|
2012-08-02 14:46:34 +00:00
|
|
|
|
return POS_BASE_C;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-09-07 18:55:07 +00:00
|
|
|
|
enum syllable_type_t {
|
|
|
|
|
consonant_syllable,
|
|
|
|
|
vowel_syllable,
|
|
|
|
|
standalone_cluster,
|
|
|
|
|
broken_cluster,
|
|
|
|
|
non_indic_cluster,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#include "hb-ot-shape-complex-indic-machine.hh"
|
|
|
|
|
|
|
|
|
|
|
2012-08-02 12:42:11 +00:00
|
|
|
|
static void
|
2012-08-02 13:38:28 +00:00
|
|
|
|
setup_masks_indic (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
|
hb_font_t *font HB_UNUSED)
|
2012-08-02 12:42:11 +00:00
|
|
|
|
{
|
|
|
|
|
HB_BUFFER_ALLOCATE_VAR (buffer, indic_category);
|
|
|
|
|
HB_BUFFER_ALLOCATE_VAR (buffer, indic_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;
|
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
|
set_indic_properties (buffer->info[i]);
|
|
|
|
|
}
|
|
|
|
|
|
2012-09-07 18:55:07 +00: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);
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-02 12:42:11 +00:00
|
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-08-02 11:53:18 +00:00
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
update_consonant_positions (const hb_ot_shape_plan_t *plan,
|
2012-08-02 16:21:44 +00:00
|
|
|
|
hb_font_t *font,
|
|
|
|
|
hb_buffer_t *buffer)
|
2012-08-02 11:53:18 +00:00
|
|
|
|
{
|
2012-08-02 14:46:34 +00:00
|
|
|
|
const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data;
|
2012-08-02 11:53:18 +00:00
|
|
|
|
|
2012-08-02 14:46:34 +00:00
|
|
|
|
unsigned int consonant_pos = indic_plan->is_old_spec ? 0 : 1;
|
2012-08-02 11:53:18 +00:00
|
|
|
|
hb_codepoint_t glyphs[2];
|
2012-08-02 15:03:39 +00:00
|
|
|
|
if (indic_plan->get_virama_glyph (font, &glyphs[1 - consonant_pos]))
|
2012-08-02 11:53:18 +00:00
|
|
|
|
{
|
|
|
|
|
hb_face_t *face = font->face;
|
|
|
|
|
unsigned int count = buffer->len;
|
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
|
if (buffer->info[i].indic_position() == POS_BASE_C) {
|
2012-08-02 12:42:11 +00:00
|
|
|
|
glyphs[consonant_pos] = buffer->info[i].codepoint;
|
2012-08-02 14:46:34 +00:00
|
|
|
|
buffer->info[i].indic_position() = consonant_position_from_face (indic_plan, glyphs, 2, face);
|
2012-08-02 11:53:18 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2011-06-17 22:35:46 +00:00
|
|
|
|
|
2012-05-11 16:58:57 +00:00
|
|
|
|
/* Rules from:
|
|
|
|
|
* https://www.microsoft.com/typography/otfntdev/devanot/shaping.aspx */
|
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
static void
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_consonant_syllable (const hb_ot_shape_plan_t *plan,
|
|
|
|
|
hb_face_t *face,
|
|
|
|
|
hb_buffer_t *buffer,
|
2012-05-09 15:56:03 +00:00
|
|
|
|
unsigned int start, unsigned int end)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
2012-08-02 15:03:39 +00:00
|
|
|
|
const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data;
|
2011-07-30 23:15:53 +00:00
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
2011-07-29 20:37:02 +00:00
|
|
|
|
|
2012-05-13 14:48:03 +00:00
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
/* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
2011-07-31 21:51:50 +00:00
|
|
|
|
unsigned int base = end;
|
2012-05-09 09:43:43 +00:00
|
|
|
|
bool has_reph = false;
|
2011-07-29 20:37:02 +00:00
|
|
|
|
|
2012-05-09 09:43:43 +00:00
|
|
|
|
{
|
2012-05-13 14:48:03 +00:00
|
|
|
|
/* -> 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. */
|
|
|
|
|
unsigned int limit = start;
|
2012-08-02 16:21:44 +00:00
|
|
|
|
if (indic_plan->mask_array[RPHF] &&
|
2012-05-13 14:48:03 +00:00
|
|
|
|
start + 3 <= end &&
|
2012-12-21 20:48:32 +00:00
|
|
|
|
(
|
2012-08-02 18:21:40 +00:00
|
|
|
|
(indic_plan->config->reph_mode == REPH_MODE_IMPLICIT && !is_joiner (info[start + 2])) ||
|
|
|
|
|
(indic_plan->config->reph_mode == REPH_MODE_EXPLICIT && info[start + 2].indic_category() == OT_ZWJ)
|
2012-07-18 21:22:14 +00:00
|
|
|
|
))
|
2012-05-13 14:48:03 +00:00
|
|
|
|
{
|
2012-11-12 22:02:02 +00:00
|
|
|
|
/* See if it matches the 'rphf' feature. */
|
|
|
|
|
hb_codepoint_t glyphs[2] = {info[start].codepoint, info[start + 1].codepoint};
|
|
|
|
|
if (indic_plan->rphf.would_substitute (glyphs, ARRAY_LENGTH (glyphs), true, face))
|
|
|
|
|
{
|
|
|
|
|
limit += 2;
|
|
|
|
|
while (limit < end && is_joiner (info[limit]))
|
|
|
|
|
limit++;
|
|
|
|
|
base = start;
|
|
|
|
|
has_reph = true;
|
|
|
|
|
}
|
2012-12-21 20:48:32 +00:00
|
|
|
|
} else if (indic_plan->config->reph_mode == REPH_MODE_LOG_REPHA && info[start].indic_category() == OT_Repha)
|
|
|
|
|
{
|
|
|
|
|
limit += 1;
|
|
|
|
|
while (limit < end && is_joiner (info[limit]))
|
|
|
|
|
limit++;
|
|
|
|
|
base = start;
|
|
|
|
|
has_reph = true;
|
|
|
|
|
}
|
2012-05-09 09:43:43 +00:00
|
|
|
|
|
2012-08-26 18:30:18 +00:00
|
|
|
|
switch (indic_plan->config->base_pos)
|
2012-07-17 18:23:28 +00:00
|
|
|
|
{
|
2012-11-14 23:07:36 +00:00
|
|
|
|
default:
|
|
|
|
|
assert (false);
|
|
|
|
|
/* fallthrough */
|
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
case BASE_POS_LAST:
|
|
|
|
|
{
|
|
|
|
|
/* -> starting from the end of the syllable, move backwards */
|
|
|
|
|
unsigned int i = end;
|
|
|
|
|
bool seen_below = false;
|
|
|
|
|
do {
|
|
|
|
|
i--;
|
|
|
|
|
/* -> until a consonant is found */
|
|
|
|
|
if (is_consonant (info[i]))
|
2012-07-17 18:23:28 +00:00
|
|
|
|
{
|
2012-08-02 18:21:40 +00:00
|
|
|
|
/* -> 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 || seen_below))
|
|
|
|
|
{
|
|
|
|
|
base = i;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (info[i].indic_position() == POS_BELOW_C)
|
|
|
|
|
seen_below = true;
|
|
|
|
|
|
|
|
|
|
/* -> or that is not a pre-base reordering Ra,
|
|
|
|
|
*
|
|
|
|
|
* IMPLEMENTATION NOTES:
|
|
|
|
|
*
|
|
|
|
|
* Our pre-base reordering Ra's are marked POS_BELOW, so will be skipped
|
|
|
|
|
* by the logic above already.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* -> or arrive at the first consonant. The consonant stopped at will
|
|
|
|
|
* be the base. */
|
2012-07-17 18:23:28 +00:00
|
|
|
|
base = i;
|
|
|
|
|
}
|
2012-08-02 18:21:40 +00:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* A ZWJ after a Halant stops the base search, and requests an explicit
|
|
|
|
|
* half form.
|
|
|
|
|
* A ZWJ before a Halant, requests a subjoined form instead, and hence
|
|
|
|
|
* search continues. This is particularly important for Bengali
|
2012-11-12 22:27:33 +00:00
|
|
|
|
* sequence Ra,H,Ya that should form Ya-Phalaa by subjoining Ya. */
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (start < i &&
|
|
|
|
|
info[i].indic_category() == OT_ZWJ &&
|
|
|
|
|
info[i - 1].indic_category() == OT_H)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
} while (i > limit);
|
|
|
|
|
}
|
|
|
|
|
break;
|
2012-07-17 18:23:28 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
case BASE_POS_FIRST:
|
|
|
|
|
{
|
|
|
|
|
/* In scripts without half forms (eg. Khmer), the first consonant is always the base. */
|
2012-07-17 18:23:28 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (!has_reph)
|
|
|
|
|
base = limit;
|
2012-07-24 03:51:29 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
/* Find the last base consonant that is not blocked by ZWJ. If there is
|
|
|
|
|
* a ZWJ right before a base consonant, that would request a subjoined form. */
|
|
|
|
|
for (unsigned int i = limit; i < end; i++)
|
|
|
|
|
if (is_consonant (info[i]) && info[i].indic_position() == POS_BASE_C)
|
|
|
|
|
{
|
|
|
|
|
if (limit < i && info[i - 1].indic_category() == OT_ZWJ)
|
|
|
|
|
break;
|
|
|
|
|
else
|
|
|
|
|
base = i;
|
|
|
|
|
}
|
2012-07-24 03:51:29 +00:00
|
|
|
|
|
2012-08-02 18:21:40 +00:00
|
|
|
|
/* Mark all subsequent consonants as below. */
|
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
|
|
|
|
if (is_consonant (info[i]) && info[i].indic_position() == POS_BASE_C)
|
|
|
|
|
info[i].indic_position() = POS_BELOW_C;
|
|
|
|
|
}
|
|
|
|
|
break;
|
2012-07-17 18:23:28 +00:00
|
|
|
|
}
|
2011-07-29 20:37:02 +00:00
|
|
|
|
|
2012-05-13 14:48:03 +00:00
|
|
|
|
/* -> 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
|
2012-07-24 04:26:43 +00:00
|
|
|
|
* base consonants.
|
|
|
|
|
*
|
|
|
|
|
* Only do this for unforced Reph. (ie. not for Ra,H,ZWJ. */
|
2013-02-11 11:58:27 +00:00
|
|
|
|
if (has_reph && base == start && limit - base <= 2) {
|
2012-05-13 14:48:03 +00:00
|
|
|
|
/* Have no other consonant, so Reph is not formed and Ra becomes base. */
|
|
|
|
|
has_reph = false;
|
|
|
|
|
}
|
2012-05-13 14:46:08 +00:00
|
|
|
|
}
|
2012-07-24 04:26:43 +00:00
|
|
|
|
|
2012-05-10 09:37:42 +00:00
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
/* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
2011-07-30 18:44:30 +00:00
|
|
|
|
/* Reorder characters */
|
|
|
|
|
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = start; i < base; i++)
|
2012-07-20 14:18:23 +00:00
|
|
|
|
info[i].indic_position() = MIN (POS_PRE_C, (indic_position_t) info[i].indic_position());
|
2012-07-17 16:50:13 +00:00
|
|
|
|
|
2012-07-18 19:41:53 +00:00
|
|
|
|
if (base < end)
|
|
|
|
|
info[base].indic_position() = POS_BASE_C;
|
2011-07-30 18:44:30 +00:00
|
|
|
|
|
2012-07-17 16:50:13 +00:00
|
|
|
|
/* Mark final consonants. A final consonant is one appearing after a matra,
|
|
|
|
|
* like in Khmer. */
|
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
|
|
|
|
if (info[i].indic_category() == OT_M) {
|
|
|
|
|
for (unsigned int j = i + 1; j < end; j++)
|
|
|
|
|
if (is_consonant (info[j])) {
|
|
|
|
|
info[j].indic_position() = POS_FINAL_C;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2011-07-31 00:14:44 +00:00
|
|
|
|
/* Handle beginning Ra */
|
2012-05-13 14:46:08 +00:00
|
|
|
|
if (has_reph)
|
2012-05-10 11:45:52 +00:00
|
|
|
|
info[start].indic_position() = POS_RA_TO_BECOME_REPH;
|
2011-07-31 00:14:44 +00:00
|
|
|
|
|
2011-07-31 01:08:10 +00:00
|
|
|
|
/* For old-style Indic script tags, move the first post-base Halant after
|
2013-01-09 00:09:46 +00:00
|
|
|
|
* last consonant. Only do this if there is *not* a Halant after last
|
|
|
|
|
* consonant. Otherwise it becomes messy. */
|
2012-08-02 15:03:39 +00:00
|
|
|
|
if (indic_plan->is_old_spec) {
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
2011-07-31 01:08:10 +00:00
|
|
|
|
if (info[i].indic_category() == OT_H) {
|
|
|
|
|
unsigned int j;
|
|
|
|
|
for (j = end - 1; j > i; j--)
|
2013-01-09 00:09:46 +00:00
|
|
|
|
if (is_consonant (info[j]) || info[j].indic_category() == OT_H)
|
2011-07-31 01:08:10 +00:00
|
|
|
|
break;
|
2013-01-09 00:09:46 +00:00
|
|
|
|
if (info[j].indic_category() != OT_H && j > i) {
|
2011-07-31 01:08:10 +00:00
|
|
|
|
/* 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;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-20 19:10:02 +00:00
|
|
|
|
/* Attach misc marks to previous char to move with them. */
|
2012-05-11 14:43:12 +00:00
|
|
|
|
{
|
2012-07-20 19:10:02 +00:00
|
|
|
|
indic_position_t last_pos = POS_START;
|
|
|
|
|
for (unsigned int i = start; i < end; i++)
|
|
|
|
|
{
|
|
|
|
|
if ((FLAG (info[i].indic_category()) & (JOINER_FLAGS | FLAG (OT_N) | FLAG (OT_RS) | HALANT_OR_COENG_FLAGS)))
|
|
|
|
|
{
|
|
|
|
|
info[i].indic_position() = last_pos;
|
2012-11-14 19:37:04 +00:00
|
|
|
|
if (unlikely (info[i].indic_category() == OT_H &&
|
2012-07-20 19:10:02 +00:00
|
|
|
|
info[i].indic_position() == POS_PRE_M))
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* Uniscribe doesn't move the Halant with Left Matra.
|
|
|
|
|
* TEST: U+092B,U+093F,U+094DE
|
2012-11-14 19:37:04 +00:00
|
|
|
|
* We follow. This is important for the Sinhala
|
|
|
|
|
* U+0DDA split matra since it decomposes to U+0DD9,U+0DCA
|
|
|
|
|
* where U+0DD9 is a left matra and U+0DCA is the virama.
|
|
|
|
|
* We don't want to move the virama with the left matra.
|
|
|
|
|
* TEST: U+0D9A,U+0DDA
|
2012-07-20 19:10:02 +00:00
|
|
|
|
*/
|
2012-05-11 14:43:12 +00:00
|
|
|
|
for (unsigned int j = i; j > start; j--)
|
2012-05-11 19:42:27 +00:00
|
|
|
|
if (info[j - 1].indic_position() != POS_PRE_M) {
|
2012-05-11 14:43:12 +00:00
|
|
|
|
info[i].indic_position() = info[j - 1].indic_position();
|
|
|
|
|
break;
|
|
|
|
|
}
|
2012-07-20 19:10:02 +00:00
|
|
|
|
}
|
|
|
|
|
} else if (info[i].indic_position() != POS_SMVD) {
|
|
|
|
|
last_pos = (indic_position_t) info[i].indic_position();
|
2012-05-11 14:43:12 +00:00
|
|
|
|
}
|
2012-07-20 19:10:02 +00:00
|
|
|
|
}
|
2012-05-11 14:43:12 +00:00
|
|
|
|
}
|
2012-07-17 15:16:19 +00:00
|
|
|
|
/* Re-attach ZWJ, ZWNJ, and halant to next char, for after-base consonants. */
|
|
|
|
|
{
|
|
|
|
|
unsigned int last_halant = end;
|
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
2012-07-17 15:37:32 +00:00
|
|
|
|
if (is_halant_or_coeng (info[i]))
|
2012-07-17 15:16:19 +00:00
|
|
|
|
last_halant = i;
|
|
|
|
|
else if (is_consonant (info[i])) {
|
|
|
|
|
for (unsigned int j = last_halant; j < i; j++)
|
2012-07-20 19:10:02 +00:00
|
|
|
|
if (info[j].indic_position() != POS_SMVD)
|
|
|
|
|
info[j].indic_position() = info[i].indic_position();
|
2012-07-17 15:16:19 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2011-07-30 18:44:30 +00:00
|
|
|
|
|
2012-05-10 09:31:20 +00:00
|
|
|
|
{
|
2012-07-23 03:58:55 +00:00
|
|
|
|
/* Things are out-of-control for post base positions, they may shuffle
|
|
|
|
|
* around like crazy, so merge clusters. For pre-base stuff, we handle
|
|
|
|
|
* cluster issues in final reordering. */
|
|
|
|
|
buffer->merge_clusters (base, end);
|
2012-05-10 09:31:20 +00:00
|
|
|
|
/* Sit tight, rock 'n roll! */
|
2012-05-10 08:51:38 +00:00
|
|
|
|
hb_bubble_sort (info + start, end - start, compare_indic_order);
|
2012-05-10 09:31:20 +00:00
|
|
|
|
/* Find base again */
|
|
|
|
|
base = end;
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = start; i < end; i++)
|
2012-05-10 09:31:20 +00:00
|
|
|
|
if (info[i].indic_position() == POS_BASE_C) {
|
|
|
|
|
base = i;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2011-07-30 18:44:30 +00:00
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
/* Setup masks now */
|
|
|
|
|
|
2011-07-31 20:00:35 +00:00
|
|
|
|
{
|
|
|
|
|
hb_mask_t mask;
|
|
|
|
|
|
2012-05-10 11:45:52 +00:00
|
|
|
|
/* Reph */
|
2012-05-11 13:34:13 +00:00
|
|
|
|
for (unsigned int i = start; i < end && info[i].indic_position() == POS_RA_TO_BECOME_REPH; i++)
|
2012-08-02 16:21:44 +00:00
|
|
|
|
info[i].mask |= indic_plan->mask_array[RPHF];
|
2012-05-10 11:45:52 +00:00
|
|
|
|
|
2011-07-31 20:00:35 +00:00
|
|
|
|
/* Pre-base */
|
2012-08-02 16:21:44 +00:00
|
|
|
|
mask = indic_plan->mask_array[HALF];
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = start; i < base; i++)
|
2011-07-31 20:00:35 +00:00
|
|
|
|
info[i].mask |= mask;
|
|
|
|
|
/* Base */
|
2012-07-20 14:47:46 +00:00
|
|
|
|
mask = 0;
|
2012-07-18 19:41:53 +00:00
|
|
|
|
if (base < end)
|
|
|
|
|
info[base].mask |= mask;
|
2011-07-31 20:00:35 +00:00
|
|
|
|
/* Post-base */
|
2012-08-02 16:21:44 +00:00
|
|
|
|
mask = indic_plan->mask_array[BLWF] | indic_plan->mask_array[ABVF] | indic_plan->mask_array[PSTF];
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
2011-07-31 20:00:35 +00:00
|
|
|
|
info[i].mask |= mask;
|
|
|
|
|
}
|
2011-07-31 17:46:44 +00:00
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
if (indic_plan->mask_array[PREF] && base + 2 < end)
|
2012-07-16 19:20:15 +00:00
|
|
|
|
{
|
2012-07-24 00:07:50 +00:00
|
|
|
|
/* Find a Halant,Ra sequence and mark it for pre-base reordering processing. */
|
2012-11-12 22:09:40 +00:00
|
|
|
|
for (unsigned int i = base + 1; i + 1 < end; i++) {
|
|
|
|
|
hb_codepoint_t glyphs[2] = {info[i].codepoint, info[i + 1].codepoint};
|
|
|
|
|
if (indic_plan->pref.would_substitute (glyphs, ARRAY_LENGTH (glyphs), true, face))
|
2012-07-16 21:04:46 +00:00
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
info[i++].mask |= indic_plan->mask_array[PREF];
|
|
|
|
|
info[i++].mask |= indic_plan->mask_array[PREF];
|
2012-07-17 17:55:10 +00:00
|
|
|
|
|
|
|
|
|
/* Mark the subsequent stuff with 'cfar'. Used in Khmer.
|
|
|
|
|
* Read the feature spec.
|
|
|
|
|
* This allows distinguishing the following cases with MS Khmer fonts:
|
|
|
|
|
* U+1784,U+17D2,U+179A,U+17D2,U+1782
|
|
|
|
|
* U+1784,U+17D2,U+1782,U+17D2,U+179A
|
|
|
|
|
*/
|
|
|
|
|
for (; i < end; i++)
|
2012-08-02 16:21:44 +00:00
|
|
|
|
info[i].mask |= indic_plan->mask_array[CFAR];
|
2012-07-17 17:55:10 +00:00
|
|
|
|
|
2012-07-16 21:04:46 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
2012-11-12 22:09:40 +00:00
|
|
|
|
}
|
2012-07-16 19:20:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
2011-07-31 17:46:44 +00:00
|
|
|
|
/* Apply ZWJ/ZWNJ effects */
|
2012-05-11 14:23:38 +00:00
|
|
|
|
for (unsigned int i = start + 1; i < end; i++)
|
2011-07-31 17:46:44 +00:00
|
|
|
|
if (is_joiner (info[i])) {
|
|
|
|
|
bool non_joiner = info[i].indic_category() == OT_ZWNJ;
|
2011-07-31 19:57:00 +00:00
|
|
|
|
unsigned int j = i;
|
2011-07-31 17:46:44 +00:00
|
|
|
|
|
|
|
|
|
do {
|
|
|
|
|
j--;
|
2011-07-31 19:57:00 +00:00
|
|
|
|
|
2012-07-20 14:47:46 +00:00
|
|
|
|
/* A ZWJ disables CJCT, however, it's mere presence is enough
|
|
|
|
|
* to disable ligation. No explicit action needed. */
|
|
|
|
|
|
|
|
|
|
/* A ZWNJ disables HALF. */
|
2011-07-31 19:57:00 +00:00
|
|
|
|
if (non_joiner)
|
2012-08-02 16:21:44 +00:00
|
|
|
|
info[j].mask &= ~indic_plan->mask_array[HALF];
|
2011-07-31 19:57:00 +00:00
|
|
|
|
|
2011-07-31 17:46:44 +00:00
|
|
|
|
} while (j > start && !is_consonant (info[j]));
|
|
|
|
|
}
|
2011-07-29 20:37:02 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
initial_reordering_vowel_syllable (const hb_ot_shape_plan_t *plan,
|
2012-11-12 22:02:02 +00:00
|
|
|
|
hb_face_t *face,
|
2012-05-13 14:13:44 +00:00
|
|
|
|
hb_buffer_t *buffer,
|
2012-05-09 15:56:03 +00:00
|
|
|
|
unsigned int start, unsigned int end)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
2012-05-10 10:07:33 +00:00
|
|
|
|
/* We made the vowels look like consonants. So let's call the consonant logic! */
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_consonant_syllable (plan, face, buffer, start, end);
|
2011-07-29 20:37:02 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
initial_reordering_standalone_cluster (const hb_ot_shape_plan_t *plan,
|
2012-11-12 22:02:02 +00:00
|
|
|
|
hb_face_t *face,
|
2012-05-13 14:13:44 +00:00
|
|
|
|
hb_buffer_t *buffer,
|
2012-05-09 15:56:03 +00:00
|
|
|
|
unsigned int start, unsigned int end)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
2012-05-11 18:02:14 +00:00
|
|
|
|
/* We treat NBSP/dotted-circle as if they are consonants, so we should just chain.
|
|
|
|
|
* Only if not in compatibility mode that is... */
|
|
|
|
|
|
2013-02-12 20:26:45 +00:00
|
|
|
|
if (hb_options ().uniscribe_bug_compatible)
|
2012-05-11 18:02:14 +00:00
|
|
|
|
{
|
|
|
|
|
/* For dotted-circle, this is what Uniscribe does:
|
|
|
|
|
* If dotted-circle is the last glyph, it just does nothing.
|
|
|
|
|
* Ie. It doesn't form Reph. */
|
|
|
|
|
if (buffer->info[end - 1].indic_category() == OT_DOTTEDCIRCLE)
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_consonant_syllable (plan, face, buffer, start, end);
|
2011-07-29 20:37:02 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-08-31 22:12:01 +00:00
|
|
|
|
static void
|
|
|
|
|
initial_reordering_broken_cluster (const hb_ot_shape_plan_t *plan,
|
2012-11-12 22:02:02 +00:00
|
|
|
|
hb_face_t *face,
|
2012-08-31 22:12:01 +00:00
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
|
unsigned int start, unsigned int end)
|
|
|
|
|
{
|
|
|
|
|
/* We already inserted dotted-circles, so just call the standalone_cluster. */
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_standalone_cluster (plan, face, buffer, start, end);
|
2012-08-31 22:12:01 +00:00
|
|
|
|
}
|
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
static void
|
2012-08-31 20:49:34 +00:00
|
|
|
|
initial_reordering_non_indic_cluster (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
2012-11-12 22:02:02 +00:00
|
|
|
|
hb_face_t *face HB_UNUSED,
|
2012-08-31 20:49:34 +00:00
|
|
|
|
hb_buffer_t *buffer HB_UNUSED,
|
|
|
|
|
unsigned int start HB_UNUSED, unsigned int end HB_UNUSED)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
|
|
|
|
/* 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. */
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-31 20:49:34 +00:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
initial_reordering_syllable (const hb_ot_shape_plan_t *plan,
|
2012-11-12 22:02:02 +00:00
|
|
|
|
hb_face_t *face,
|
2012-08-31 20:49:34 +00:00
|
|
|
|
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) {
|
2012-11-12 22:02:02 +00:00
|
|
|
|
case consonant_syllable: initial_reordering_consonant_syllable (plan, face, buffer, start, end); return;
|
|
|
|
|
case vowel_syllable: initial_reordering_vowel_syllable (plan, face, buffer, start, end); return;
|
|
|
|
|
case standalone_cluster: initial_reordering_standalone_cluster (plan, face, buffer, start, end); return;
|
|
|
|
|
case broken_cluster: initial_reordering_broken_cluster (plan, face, buffer, start, end); return;
|
|
|
|
|
case non_indic_cluster: initial_reordering_non_indic_cluster (plan, face, buffer, start, end); return;
|
2012-08-31 20:49:34 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-09-07 18:55:07 +00:00
|
|
|
|
static inline void
|
2012-12-05 23:46:04 +00:00
|
|
|
|
insert_dotted_circles (const hb_ot_shape_plan_t *plan HB_UNUSED,
|
2012-08-31 22:12:01 +00:00
|
|
|
|
hb_font_t *font,
|
|
|
|
|
hb_buffer_t *buffer)
|
|
|
|
|
{
|
2012-09-07 18:55:07 +00:00
|
|
|
|
/* Note: This loop is extra overhead, but should not be measurable. */
|
|
|
|
|
bool has_broken_syllables = false;
|
|
|
|
|
unsigned int count = buffer->len;
|
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
|
if ((buffer->info[i].syllable() & 0x0F) == broken_cluster) {
|
|
|
|
|
has_broken_syllables = true;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (likely (!has_broken_syllables))
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
|
2012-08-31 22:12:01 +00:00
|
|
|
|
hb_codepoint_t dottedcircle_glyph;
|
|
|
|
|
if (!font->get_glyph (0x25CC, 0, &dottedcircle_glyph))
|
|
|
|
|
return;
|
|
|
|
|
|
2012-11-15 18:36:43 +00:00
|
|
|
|
hb_glyph_info_t dottedcircle = {0};
|
2012-08-31 22:12:01 +00:00
|
|
|
|
dottedcircle.codepoint = 0x25CC;
|
|
|
|
|
set_indic_properties (dottedcircle);
|
|
|
|
|
dottedcircle.codepoint = dottedcircle_glyph;
|
|
|
|
|
|
|
|
|
|
buffer->clear_output ();
|
|
|
|
|
|
|
|
|
|
buffer->idx = 0;
|
|
|
|
|
unsigned int last_syllable = 0;
|
|
|
|
|
while (buffer->idx < buffer->len)
|
|
|
|
|
{
|
|
|
|
|
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))
|
|
|
|
|
{
|
2012-12-22 00:41:04 +00:00
|
|
|
|
last_syllable = syllable;
|
|
|
|
|
|
2012-08-31 22:12:01 +00:00
|
|
|
|
hb_glyph_info_t info = dottedcircle;
|
|
|
|
|
info.cluster = buffer->cur().cluster;
|
|
|
|
|
info.mask = buffer->cur().mask;
|
|
|
|
|
info.syllable() = buffer->cur().syllable();
|
2012-12-22 00:41:04 +00:00
|
|
|
|
|
|
|
|
|
/* Insert dottedcircle after possible Repha. */
|
|
|
|
|
while (buffer->idx < buffer->len &&
|
|
|
|
|
last_syllable == buffer->cur().syllable() &&
|
|
|
|
|
buffer->cur().indic_category() == OT_Repha)
|
|
|
|
|
buffer->next_glyph ();
|
|
|
|
|
|
2012-08-31 22:12:01 +00:00
|
|
|
|
buffer->output_info (info);
|
|
|
|
|
}
|
2012-12-22 00:41:04 +00:00
|
|
|
|
else
|
|
|
|
|
buffer->next_glyph ();
|
2012-08-31 22:12:01 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
buffer->swap_buffers ();
|
|
|
|
|
}
|
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
initial_reordering (const hb_ot_shape_plan_t *plan,
|
2012-08-02 12:42:11 +00:00
|
|
|
|
hb_font_t *font,
|
2012-08-02 13:44:18 +00:00
|
|
|
|
hb_buffer_t *buffer)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
update_consonant_positions (plan, font, buffer);
|
2012-09-07 18:55:07 +00:00
|
|
|
|
insert_dotted_circles (plan, font, buffer);
|
2012-08-31 20:49:34 +00:00
|
|
|
|
|
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
2012-08-31 22:12:01 +00:00
|
|
|
|
unsigned int count = buffer->len;
|
|
|
|
|
if (unlikely (!count)) return;
|
2012-08-31 20:49:34 +00:00
|
|
|
|
unsigned int last = 0;
|
|
|
|
|
unsigned int last_syllable = info[0].syllable();
|
|
|
|
|
for (unsigned int i = 1; i < count; i++)
|
|
|
|
|
if (last_syllable != info[i].syllable()) {
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_syllable (plan, font->face, buffer, last, i);
|
2012-08-31 20:49:34 +00:00
|
|
|
|
last = i;
|
|
|
|
|
last_syllable = info[last].syllable();
|
|
|
|
|
}
|
2012-11-12 22:02:02 +00:00
|
|
|
|
initial_reordering_syllable (plan, font->face, buffer, last, count);
|
2011-06-02 21:43:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
static void
|
2012-08-02 16:21:44 +00:00
|
|
|
|
final_reordering_syllable (const hb_ot_shape_plan_t *plan,
|
|
|
|
|
hb_buffer_t *buffer,
|
2012-05-09 15:56:03 +00:00
|
|
|
|
unsigned int start, unsigned int end)
|
2011-07-29 20:37:02 +00:00
|
|
|
|
{
|
2012-08-02 16:21:44 +00:00
|
|
|
|
const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) plan->data;
|
2012-05-10 10:53:53 +00:00
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
|
|
|
|
|
2011-07-31 19:18:57 +00:00
|
|
|
|
/* 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.
|
2012-05-10 10:53:53 +00:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* Find base again */
|
2012-07-20 19:47:24 +00:00
|
|
|
|
unsigned int base;
|
|
|
|
|
for (base = start; base < end; base++)
|
|
|
|
|
if (info[base].indic_position() >= POS_BASE_C) {
|
|
|
|
|
if (start < base && info[base].indic_position() > POS_BASE_C)
|
|
|
|
|
base--;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2012-05-10 10:53:53 +00:00
|
|
|
|
|
2012-05-10 11:09:08 +00:00
|
|
|
|
|
2012-05-10 10:53:53 +00:00
|
|
|
|
/* o Reorder matras:
|
2011-07-31 19:18:57 +00:00
|
|
|
|
*
|
|
|
|
|
* 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.
|
2012-05-10 10:53:53 +00:00
|
|
|
|
*/
|
|
|
|
|
|
2012-07-24 07:36:47 +00:00
|
|
|
|
if (start + 1 < end && start < base) /* Otherwise there can't be any pre-base matra characters. */
|
2012-05-11 19:36:32 +00:00
|
|
|
|
{
|
2012-07-24 07:36:47 +00:00
|
|
|
|
/* If we lost track of base, alas, position before last thingy. */
|
|
|
|
|
unsigned int new_pos = base == end ? base - 2 : base - 1;
|
|
|
|
|
|
2012-09-05 19:11:14 +00:00
|
|
|
|
/* Malayalam / Tamil do not have "half" forms or explicit virama forms.
|
|
|
|
|
* The glyphs formed by 'half' are Chillus or ligated explicit viramas.
|
|
|
|
|
* We want to position matra after them.
|
2012-07-24 07:36:47 +00:00
|
|
|
|
*/
|
2012-09-05 19:11:14 +00:00
|
|
|
|
if (buffer->props.script != HB_SCRIPT_MALAYALAM && buffer->props.script != HB_SCRIPT_TAMIL)
|
2012-07-23 04:11:26 +00:00
|
|
|
|
{
|
2012-07-24 07:36:47 +00:00
|
|
|
|
while (new_pos > start &&
|
|
|
|
|
!(is_one_of (info[new_pos], (FLAG (OT_M) | FLAG (OT_H) | FLAG (OT_Coeng)))))
|
|
|
|
|
new_pos--;
|
|
|
|
|
|
|
|
|
|
/* If we found no Halant we are done.
|
|
|
|
|
* Otherwise only proceed if the Halant does
|
|
|
|
|
* not belong to the Matra itself! */
|
|
|
|
|
if (is_halant_or_coeng (info[new_pos]) &&
|
|
|
|
|
info[new_pos].indic_position() != POS_PRE_M)
|
|
|
|
|
{
|
|
|
|
|
/* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */
|
|
|
|
|
if (new_pos + 1 < end && is_joiner (info[new_pos + 1]))
|
|
|
|
|
new_pos++;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
new_pos = start; /* No move. */
|
|
|
|
|
}
|
2012-05-11 19:36:32 +00:00
|
|
|
|
|
2012-09-05 19:11:14 +00:00
|
|
|
|
if (start < new_pos && info[new_pos].indic_position () != POS_PRE_M)
|
2012-07-24 07:36:47 +00:00
|
|
|
|
{
|
2012-05-11 19:36:32 +00:00
|
|
|
|
/* Now go see if there's actually any matras... */
|
2012-07-16 19:26:56 +00:00
|
|
|
|
for (unsigned int i = new_pos; i > start; i--)
|
2012-05-11 19:42:27 +00:00
|
|
|
|
if (info[i - 1].indic_position () == POS_PRE_M)
|
2012-05-11 19:36:32 +00:00
|
|
|
|
{
|
2012-07-16 19:40:33 +00:00
|
|
|
|
unsigned int old_pos = i - 1;
|
|
|
|
|
hb_glyph_info_t tmp = info[old_pos];
|
|
|
|
|
memmove (&info[old_pos], &info[old_pos + 1], (new_pos - old_pos) * sizeof (info[0]));
|
|
|
|
|
info[new_pos] = tmp;
|
2012-07-16 19:26:56 +00:00
|
|
|
|
new_pos--;
|
2012-05-11 19:36:32 +00:00
|
|
|
|
}
|
2012-07-23 12:22:55 +00:00
|
|
|
|
buffer->merge_clusters (new_pos, MIN (end, base + 1));
|
2012-07-23 03:55:19 +00:00
|
|
|
|
} else {
|
2012-07-23 04:11:26 +00:00
|
|
|
|
for (unsigned int i = start; i < base; i++)
|
2012-07-23 03:55:19 +00:00
|
|
|
|
if (info[i].indic_position () == POS_PRE_M) {
|
2012-07-23 12:22:55 +00:00
|
|
|
|
buffer->merge_clusters (i, MIN (end, base + 1));
|
2012-07-23 03:55:19 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
2012-05-11 19:36:32 +00:00
|
|
|
|
}
|
2012-05-10 10:53:53 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* o Reorder reph:
|
2011-07-31 19:18:57 +00:00
|
|
|
|
*
|
|
|
|
|
* 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.
|
2012-05-10 11:45:52 +00:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* 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)
|
|
|
|
|
{
|
2012-08-02 18:21:40 +00:00
|
|
|
|
unsigned int new_reph_pos;
|
|
|
|
|
reph_position_t reph_pos = indic_plan->config->reph_pos;
|
|
|
|
|
|
|
|
|
|
/* XXX Figure out old behavior too */
|
2012-05-10 19:44:50 +00:00
|
|
|
|
|
2012-05-10 11:45:52 +00:00
|
|
|
|
/* 1. If reph should be positioned after post-base consonant forms,
|
|
|
|
|
* proceed to step 5.
|
2012-05-10 19:44:50 +00:00
|
|
|
|
*/
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (reph_pos == REPH_POS_AFTER_POST)
|
2012-05-10 19:44:50 +00:00
|
|
|
|
{
|
2012-05-11 19:36:32 +00:00
|
|
|
|
goto reph_step_5;
|
2012-05-10 19:44:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 2. If the reph repositioning class is not after post-base: target
|
2012-05-10 11:45:52 +00:00
|
|
|
|
* 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.
|
2012-05-10 19:44:50 +00:00
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
new_reph_pos = start + 1;
|
2012-07-17 15:37:32 +00:00
|
|
|
|
while (new_reph_pos < base && !is_halant_or_coeng (info[new_reph_pos]))
|
2012-05-10 19:44:50 +00:00
|
|
|
|
new_reph_pos++;
|
|
|
|
|
|
2012-07-17 15:37:32 +00:00
|
|
|
|
if (new_reph_pos < base && is_halant_or_coeng (info[new_reph_pos])) {
|
2012-05-10 19:44:50 +00:00
|
|
|
|
/* ->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
|
2012-05-10 11:45:52 +00:00
|
|
|
|
* first consonant not ligated with main, or find the first
|
|
|
|
|
* consonant that is not a potential pre-base reordering Ra.
|
2012-05-10 19:44:50 +00:00
|
|
|
|
*/
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (reph_pos == REPH_POS_AFTER_MAIN)
|
2012-05-10 19:44:50 +00:00
|
|
|
|
{
|
2012-07-16 19:21:12 +00:00
|
|
|
|
new_reph_pos = base;
|
|
|
|
|
/* XXX Skip potential pre-base reordering Ra. */
|
2012-07-20 20:17:28 +00:00
|
|
|
|
while (new_reph_pos + 1 < end && info[new_reph_pos + 1].indic_position() <= POS_AFTER_MAIN)
|
2012-07-16 19:21:12 +00:00
|
|
|
|
new_reph_pos++;
|
|
|
|
|
if (new_reph_pos < end)
|
|
|
|
|
goto reph_move;
|
2012-05-10 19:44:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 4. If reph should be positioned before post-base consonant, find
|
2012-05-10 11:45:52 +00:00
|
|
|
|
* 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.
|
2012-05-10 19:44:50 +00:00
|
|
|
|
*/
|
2012-05-11 19:36:32 +00:00
|
|
|
|
/* This is our take on what step 4 is trying to say (and failing, BADLY). */
|
2012-08-02 18:21:40 +00:00
|
|
|
|
if (reph_pos == REPH_POS_AFTER_SUB)
|
2012-05-10 19:44:50 +00:00
|
|
|
|
{
|
2012-05-11 19:36:32 +00:00
|
|
|
|
new_reph_pos = base;
|
|
|
|
|
while (new_reph_pos < end &&
|
2012-07-19 16:11:12 +00:00
|
|
|
|
!( FLAG (info[new_reph_pos + 1].indic_position()) & (FLAG (POS_POST_C) | FLAG (POS_AFTER_POST) | FLAG (POS_SMVD))))
|
2012-05-11 19:36:32 +00:00
|
|
|
|
new_reph_pos++;
|
|
|
|
|
if (new_reph_pos < end)
|
|
|
|
|
goto reph_move;
|
2012-05-10 19:44:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 5. If no consonant is found in steps 3 or 4, move reph to a position
|
2012-05-10 11:45:52 +00:00
|
|
|
|
* 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.
|
|
|
|
|
*/
|
2012-05-10 19:44:50 +00:00
|
|
|
|
reph_step_5:
|
|
|
|
|
{
|
2012-07-20 15:25:41 +00:00
|
|
|
|
/* Copied from step 2. */
|
|
|
|
|
new_reph_pos = start + 1;
|
|
|
|
|
while (new_reph_pos < base && !is_halant_or_coeng (info[new_reph_pos]))
|
|
|
|
|
new_reph_pos++;
|
|
|
|
|
|
|
|
|
|
if (new_reph_pos < base && is_halant_or_coeng (info[new_reph_pos])) {
|
|
|
|
|
/* ->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;
|
|
|
|
|
}
|
2012-05-10 19:44:50 +00:00
|
|
|
|
}
|
2012-05-10 11:45:52 +00:00
|
|
|
|
|
2012-05-10 19:44:50 +00:00
|
|
|
|
/* 6. Otherwise, reorder reph to the end of the syllable.
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
new_reph_pos = end - 1;
|
|
|
|
|
while (new_reph_pos > start && info[new_reph_pos].indic_position() == POS_SMVD)
|
|
|
|
|
new_reph_pos--;
|
|
|
|
|
|
2012-05-11 14:54:40 +00:00
|
|
|
|
/*
|
|
|
|
|
* 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.
|
|
|
|
|
* Uniscribe doesn't do this.
|
|
|
|
|
* TEST: U+0930,U+094D,U+0915,U+094B,U+094D
|
|
|
|
|
*/
|
2013-02-12 20:26:45 +00:00
|
|
|
|
if (!hb_options ().uniscribe_bug_compatible &&
|
2012-07-17 15:37:32 +00:00
|
|
|
|
unlikely (is_halant_or_coeng (info[new_reph_pos]))) {
|
2012-05-10 19:44:50 +00:00
|
|
|
|
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;
|
2012-05-10 13:41:04 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-05-10 19:44:50 +00:00
|
|
|
|
reph_move:
|
|
|
|
|
{
|
2012-07-23 04:11:26 +00:00
|
|
|
|
/* Yay, one big cluster! Merge before moving. */
|
|
|
|
|
buffer->merge_clusters (start, end);
|
|
|
|
|
|
2012-05-10 19:44:50 +00:00
|
|
|
|
/* 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;
|
|
|
|
|
}
|
2012-05-10 11:45:52 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* o Reorder pre-base reordering consonants:
|
2011-07-31 19:18:57 +00:00
|
|
|
|
*
|
|
|
|
|
* If a pre-base reordering consonant is found, reorder it according to
|
|
|
|
|
* the following rules:
|
|
|
|
|
*/
|
|
|
|
|
|
2012-08-02 16:21:44 +00:00
|
|
|
|
if (indic_plan->mask_array[PREF] && base + 1 < end) /* Otherwise there can't be any pre-base reordering Ra. */
|
2012-07-16 19:30:05 +00:00
|
|
|
|
{
|
2012-07-16 21:04:46 +00:00
|
|
|
|
for (unsigned int i = base + 1; i < end; i++)
|
2012-08-02 16:21:44 +00:00
|
|
|
|
if ((info[i].mask & indic_plan->mask_array[PREF]) != 0)
|
2012-07-16 19:49:08 +00:00
|
|
|
|
{
|
2012-07-16 21:04:46 +00:00
|
|
|
|
/* 1. Only reorder a glyph produced by substitution during application
|
|
|
|
|
* of the <pref> feature. (Note that a font may shape a Ra consonant with
|
|
|
|
|
* the feature generally but block it in certain contexts.)
|
|
|
|
|
*/
|
2012-08-02 16:21:44 +00:00
|
|
|
|
if (i + 1 == end || (info[i + 1].mask & indic_plan->mask_array[PREF]) == 0)
|
2012-07-16 21:04:46 +00:00
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
unsigned int new_pos = base;
|
2012-10-29 23:27:02 +00:00
|
|
|
|
/* Malayalam / Tamil do not have "half" forms or explicit virama forms.
|
|
|
|
|
* The glyphs formed by 'half' are Chillus or ligated explicit viramas.
|
|
|
|
|
* We want to position matra after them.
|
|
|
|
|
*/
|
|
|
|
|
if (buffer->props.script != HB_SCRIPT_MALAYALAM && buffer->props.script != HB_SCRIPT_TAMIL)
|
2012-07-24 06:10:20 +00:00
|
|
|
|
{
|
2012-10-29 23:27:02 +00:00
|
|
|
|
while (new_pos > start &&
|
|
|
|
|
!(is_one_of (info[new_pos - 1], FLAG(OT_M) | HALANT_OR_COENG_FLAGS)))
|
|
|
|
|
new_pos--;
|
|
|
|
|
|
|
|
|
|
/* In Khmer coeng model, a V,Ra can go *after* matras. If it goes after a
|
|
|
|
|
* split matra, it should be reordered to *before* the left part of such matra. */
|
|
|
|
|
if (new_pos > start && info[new_pos - 1].indic_category() == OT_M)
|
|
|
|
|
{
|
|
|
|
|
unsigned int old_pos = i;
|
|
|
|
|
for (unsigned int i = base + 1; i < old_pos; i++)
|
|
|
|
|
if (info[i].indic_category() == OT_M)
|
|
|
|
|
{
|
|
|
|
|
new_pos--;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2012-07-24 06:10:20 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-07-17 15:37:32 +00:00
|
|
|
|
if (new_pos > start && is_halant_or_coeng (info[new_pos - 1]))
|
2012-07-16 21:04:46 +00:00
|
|
|
|
/* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */
|
|
|
|
|
if (new_pos < end && is_joiner (info[new_pos]))
|
|
|
|
|
new_pos++;
|
|
|
|
|
|
|
|
|
|
{
|
|
|
|
|
unsigned int old_pos = i;
|
2012-07-23 04:11:26 +00:00
|
|
|
|
buffer->merge_clusters (new_pos, old_pos + 1);
|
2012-07-16 21:04:46 +00:00
|
|
|
|
hb_glyph_info_t tmp = info[old_pos];
|
|
|
|
|
memmove (&info[new_pos + 1], &info[new_pos], (old_pos - new_pos) * sizeof (info[0]));
|
|
|
|
|
info[new_pos] = tmp;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
break;
|
2012-07-16 19:49:08 +00:00
|
|
|
|
}
|
2012-07-16 19:30:05 +00:00
|
|
|
|
}
|
2012-05-11 18:50:53 +00:00
|
|
|
|
|
|
|
|
|
|
2012-05-11 18:59:26 +00:00
|
|
|
|
/* Apply 'init' to the Left Matra if it's a word start. */
|
2012-05-11 19:42:27 +00:00
|
|
|
|
if (info[start].indic_position () == POS_PRE_M &&
|
2012-05-11 18:59:26 +00:00
|
|
|
|
(!start ||
|
2012-05-13 13:54:43 +00:00
|
|
|
|
!(FLAG (_hb_glyph_info_get_general_category (&info[start - 1])) &
|
2012-07-20 17:37:48 +00:00
|
|
|
|
FLAG_RANGE (HB_UNICODE_GENERAL_CATEGORY_FORMAT, HB_UNICODE_GENERAL_CATEGORY_NON_SPACING_MARK))))
|
2012-08-02 16:21:44 +00:00
|
|
|
|
info[start].mask |= indic_plan->mask_array[INIT];
|
2012-05-11 18:59:26 +00:00
|
|
|
|
|
2012-05-11 18:50:53 +00:00
|
|
|
|
|
2012-07-20 15:42:24 +00:00
|
|
|
|
/*
|
|
|
|
|
* Finish off the clusters and go home!
|
|
|
|
|
*/
|
2013-02-12 20:26:45 +00:00
|
|
|
|
if (hb_options ().uniscribe_bug_compatible)
|
2012-05-11 14:43:12 +00:00
|
|
|
|
{
|
2012-07-20 17:56:32 +00:00
|
|
|
|
/* Uniscribe merges the entire cluster.
|
2012-05-10 16:34:34 +00:00
|
|
|
|
* 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. */
|
2012-07-23 04:11:26 +00:00
|
|
|
|
buffer->merge_clusters (start, end);
|
2012-05-10 16:34:34 +00:00
|
|
|
|
}
|
2012-05-09 15:56:03 +00:00
|
|
|
|
}
|
2011-07-31 19:18:57 +00:00
|
|
|
|
|
|
|
|
|
|
2012-05-09 15:56:03 +00:00
|
|
|
|
static void
|
2012-08-02 14:07:58 +00:00
|
|
|
|
final_reordering (const hb_ot_shape_plan_t *plan,
|
2012-12-05 23:46:04 +00:00
|
|
|
|
hb_font_t *font HB_UNUSED,
|
2012-08-02 13:44:18 +00:00
|
|
|
|
hb_buffer_t *buffer)
|
2012-05-09 15:56:03 +00:00
|
|
|
|
{
|
|
|
|
|
unsigned int count = buffer->len;
|
2012-08-31 20:49:34 +00:00
|
|
|
|
if (unlikely (!count)) return;
|
2012-05-09 15:56:03 +00:00
|
|
|
|
|
|
|
|
|
hb_glyph_info_t *info = buffer->info;
|
|
|
|
|
unsigned int last = 0;
|
2012-05-11 09:41:39 +00:00
|
|
|
|
unsigned int last_syllable = info[0].syllable();
|
2012-05-09 15:56:03 +00:00
|
|
|
|
for (unsigned int i = 1; i < count; i++)
|
2012-05-11 09:41:39 +00:00
|
|
|
|
if (last_syllable != info[i].syllable()) {
|
2012-08-02 16:21:44 +00:00
|
|
|
|
final_reordering_syllable (plan, buffer, last, i);
|
2012-05-09 15:56:03 +00:00
|
|
|
|
last = i;
|
2012-05-11 09:41:39 +00:00
|
|
|
|
last_syllable = info[last].syllable();
|
2012-05-09 15:56:03 +00:00
|
|
|
|
}
|
2012-08-02 16:21:44 +00:00
|
|
|
|
final_reordering_syllable (plan, buffer, last, count);
|
2011-07-31 19:18:57 +00:00
|
|
|
|
|
2012-08-23 16:06:14 +00:00
|
|
|
|
/* Zero syllables now... */
|
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
|
info[i].syllable() = 0;
|
|
|
|
|
|
2011-07-29 20:37:02 +00:00
|
|
|
|
HB_BUFFER_DEALLOCATE_VAR (buffer, indic_category);
|
|
|
|
|
HB_BUFFER_DEALLOCATE_VAR (buffer, indic_position);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-08-31 22:12:01 +00:00
|
|
|
|
static hb_ot_shape_normalization_mode_t
|
2012-12-05 23:46:04 +00:00
|
|
|
|
normalization_preference_indic (const hb_segment_properties_t *props HB_UNUSED)
|
2012-08-31 22:12:01 +00:00
|
|
|
|
{
|
|
|
|
|
return HB_OT_SHAPE_NORMALIZATION_MODE_COMPOSED_DIACRITICS_NO_SHORT_CIRCUIT;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-16 20:39:23 +00:00
|
|
|
|
static bool
|
|
|
|
|
decompose_indic (const hb_ot_shape_normalize_context_t *c,
|
2012-11-13 20:35:35 +00:00
|
|
|
|
hb_codepoint_t ab,
|
|
|
|
|
hb_codepoint_t *a,
|
|
|
|
|
hb_codepoint_t *b)
|
|
|
|
|
{
|
|
|
|
|
switch (ab)
|
|
|
|
|
{
|
|
|
|
|
/* Don't decompose these. */
|
|
|
|
|
case 0x0931 : return false;
|
|
|
|
|
case 0x0B94 : return false;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Decompose split matras that don't have Unicode decompositions.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
case 0x0F77 : *a = 0x0FB2; *b= 0x0F81; return true;
|
|
|
|
|
case 0x0F79 : *a = 0x0FB3; *b= 0x0F81; return true;
|
|
|
|
|
case 0x17BE : *a = 0x17C1; *b= 0x17BE; return true;
|
|
|
|
|
case 0x17BF : *a = 0x17C1; *b= 0x17BF; return true;
|
|
|
|
|
case 0x17C0 : *a = 0x17C1; *b= 0x17C0; return true;
|
|
|
|
|
case 0x17C4 : *a = 0x17C1; *b= 0x17C4; return true;
|
|
|
|
|
case 0x17C5 : *a = 0x17C1; *b= 0x17C5; return true;
|
|
|
|
|
case 0x1925 : *a = 0x1920; *b= 0x1923; return true;
|
|
|
|
|
case 0x1926 : *a = 0x1920; *b= 0x1924; return true;
|
|
|
|
|
case 0x1B3C : *a = 0x1B42; *b= 0x1B3C; return true;
|
|
|
|
|
case 0x1112E : *a = 0x11127; *b= 0x11131; return true;
|
|
|
|
|
case 0x1112F : *a = 0x11127; *b= 0x11132; return true;
|
|
|
|
|
#if 0
|
|
|
|
|
/* This one has no decomposition in Unicode, but needs no decomposition either. */
|
|
|
|
|
/* case 0x0AC9 : return false; */
|
|
|
|
|
case 0x0B57 : *a = no decomp, -> RIGHT; return true;
|
|
|
|
|
case 0x1C29 : *a = no decomp, -> LEFT; return true;
|
|
|
|
|
case 0xA9C0 : *a = no decomp, -> RIGHT; return true;
|
|
|
|
|
case 0x111BF : *a = no decomp, -> ABOVE; return true;
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-16 21:12:35 +00:00
|
|
|
|
if ((ab == 0x0DDA || hb_in_range<hb_codepoint_t> (ab, 0x0DDC, 0x0DDE)))
|
2012-11-13 20:35:35 +00:00
|
|
|
|
{
|
2012-11-16 21:12:35 +00:00
|
|
|
|
/*
|
|
|
|
|
* Sinhala split matras... Let the fun begin.
|
|
|
|
|
*
|
|
|
|
|
* These four characters have Unicode decompositions. However, Uniscribe
|
|
|
|
|
* decomposes them "Khmer-style", that is, it uses the character itself to
|
|
|
|
|
* get the second half. The first half of all four decompositions is always
|
|
|
|
|
* U+0DD9.
|
|
|
|
|
*
|
|
|
|
|
* Now, there are buggy fonts, namely, the widely used lklug.ttf, that are
|
|
|
|
|
* broken with Uniscribe. But we need to support them. As such, we only
|
|
|
|
|
* do the Uniscribe-style decomposition if the character is transformed into
|
|
|
|
|
* its "sec.half" form by the 'pstf' feature. Otherwise, we fall back to
|
|
|
|
|
* Unicode decomposition.
|
|
|
|
|
*
|
|
|
|
|
* Note that we can't unconditionally use Unicode decomposition. That would
|
|
|
|
|
* break some other fonts, that are designed to work with Uniscribe, and
|
|
|
|
|
* don't have positioning features for the Unicode-style decomposition.
|
|
|
|
|
*
|
|
|
|
|
* Argh...
|
2012-12-06 00:20:31 +00:00
|
|
|
|
*
|
|
|
|
|
* The Uniscribe behavior is now documented in the newly published Sinhala
|
|
|
|
|
* spec in 2012:
|
|
|
|
|
*
|
|
|
|
|
* http://www.microsoft.com/typography/OpenTypeDev/sinhala/intro.htm#shaping
|
2012-11-16 21:12:35 +00:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
const indic_shape_plan_t *indic_plan = (const indic_shape_plan_t *) c->plan->data;
|
|
|
|
|
|
|
|
|
|
hb_codepoint_t glyph;
|
|
|
|
|
|
2013-02-12 20:26:45 +00:00
|
|
|
|
if (hb_options ().uniscribe_bug_compatible ||
|
2012-11-16 21:12:35 +00:00
|
|
|
|
(c->font->get_glyph (ab, 0, &glyph) &&
|
|
|
|
|
indic_plan->pstf.would_substitute (&glyph, 1, true, c->font->face)))
|
|
|
|
|
{
|
|
|
|
|
/* Ok, safe to use Uniscribe-style decomposition. */
|
|
|
|
|
*a = 0x0DD9;
|
|
|
|
|
*b = ab;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2012-11-13 20:35:35 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-11-16 20:39:23 +00:00
|
|
|
|
return c->unicode->decompose (ab, a, b);
|
2012-11-13 20:35:35 +00:00
|
|
|
|
}
|
|
|
|
|
|
2012-11-16 20:39:23 +00:00
|
|
|
|
static bool
|
|
|
|
|
compose_indic (const hb_ot_shape_normalize_context_t *c,
|
2012-11-13 20:35:35 +00:00
|
|
|
|
hb_codepoint_t a,
|
|
|
|
|
hb_codepoint_t b,
|
|
|
|
|
hb_codepoint_t *ab)
|
|
|
|
|
{
|
|
|
|
|
/* Avoid recomposing split matras. */
|
2012-11-16 20:39:23 +00:00
|
|
|
|
if (HB_UNICODE_GENERAL_CATEGORY_IS_MARK (c->unicode->general_category (a)))
|
2012-11-13 20:35:35 +00:00
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
/* Composition-exclusion exceptions that we want to recompose. */
|
|
|
|
|
if (a == 0x09AF && b == 0x09BC) { *ab = 0x09DF; return true; }
|
|
|
|
|
|
2012-11-16 20:39:23 +00:00
|
|
|
|
return c->unicode->compose (a, b, ab);
|
2012-11-13 20:35:35 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-07-31 01:08:51 +00:00
|
|
|
|
const hb_ot_complex_shaper_t _hb_ot_complex_shaper_indic =
|
|
|
|
|
{
|
|
|
|
|
"indic",
|
|
|
|
|
collect_features_indic,
|
|
|
|
|
override_features_indic,
|
2012-08-02 14:46:34 +00:00
|
|
|
|
data_create_indic,
|
|
|
|
|
data_destroy_indic,
|
2012-08-11 22:34:13 +00:00
|
|
|
|
NULL, /* preprocess_text */
|
2012-08-31 22:12:01 +00:00
|
|
|
|
normalization_preference_indic,
|
2012-11-13 20:35:35 +00:00
|
|
|
|
decompose_indic,
|
|
|
|
|
compose_indic,
|
2012-07-31 01:08:51 +00:00
|
|
|
|
setup_masks_indic,
|
Adjust mark advance-width zeroing logic for Myanmar
Before, we were zeroing advance width of attached marks for
non-Indic scripts, and not doing it for Indic.
We have now three different behaviors, which seem to better
reflect what Uniscribe is doing:
- For Indic, no explicit zeroing happens whatsoever, which
is the same as before,
- For Myanmar, zero advance width of glyphs marked as marks
*in GDEF*, and do that *before* applying GPOS. This seems
to be what the new Win8 Myanmar shaper does,
- For everything else, zero advance width of glyphs that are
from General_Category=Mn Unicode characters, and do so
before applying GPOS. This seems to be what Uniscribe does
for Latin at least.
With these changes, positioning of all tests matches for Myanmar,
except for the glitch in Uniscribe not applying 'mark'. See preivous
commit.
2013-02-12 14:44:57 +00:00
|
|
|
|
HB_OT_SHAPE_ZERO_WIDTH_MARKS_NONE,
|
2012-11-14 21:48:26 +00:00
|
|
|
|
false, /* fallback_position */
|
2012-07-31 01:08:51 +00:00
|
|
|
|
};
|