1 /* 2 * Copyright 2015 Mozilla Foundation. 3 * Copyright 2015 Google, Inc. 4 * 5 * This is part of HarfBuzz, a text shaping library. 6 * 7 * Permission is hereby granted, without written agreement and without 8 * license or royalty fees, to use, copy, modify, and distribute this 9 * software and its documentation for any purpose, provided that the 10 * above copyright notice and the following two paragraphs appear in 11 * all copies of this software. 12 * 13 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR 14 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES 15 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN 16 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH 17 * DAMAGE. 18 * 19 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, 20 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND 21 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS 22 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO 23 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. 24 * 25 * Mozilla Author(s): Jonathan Kew 26 * Google Author(s): Behdad Esfahbod 27 */ 28 29 #ifndef HB_OT_SHAPE_COMPLEX_USE_MACHINE_HH 30 #define HB_OT_SHAPE_COMPLEX_USE_MACHINE_HH 31 32 #include "hb-private.hh" 33 34 %%{ 35 machine use_syllable_machine; 36 alphtype unsigned char; 37 write data; 38 }%% 39 40 %%{ 41 42 # Same order as enum use_category_t. Not sure how to avoid duplication. 43 44 O = 0; # OTHER 45 46 B = 1; # BASE 47 IND = 3; # BASE_IND 48 N = 4; # BASE_NUM 49 GB = 5; # BASE_OTHER 50 CGJ = 6; # CGJ 51 #F = 7; # CONS_FINAL 52 FM = 8; # CONS_FINAL_MOD 53 #M = 9; # CONS_MED 54 #CM = 10; # CONS_MOD 55 SUB = 11; # CONS_SUB 56 H = 12; # HALANT 57 58 HN = 13; # HALANT_NUM 59 ZWNJ = 14; # Zero width non-joiner 60 ZWJ = 15; # Zero width joiner 61 WJ = 16; # Word joiner 62 Rsv = 17; # Reserved characters 63 R = 18; # REPHA 64 S = 19; # SYM 65 #SM = 20; # SYM_MOD 66 VS = 21; # VARIATION_SELECTOR 67 #V = 36; # VOWEL 68 #VM = 40; # VOWEL_MOD 69 70 FAbv = 24; # CONS_FINAL_ABOVE 71 FBlw = 25; # CONS_FINAL_BELOW 72 FPst = 26; # CONS_FINAL_POST 73 MAbv = 27; # CONS_MED_ABOVE 74 MBlw = 28; # CONS_MED_BELOW 75 MPst = 29; # CONS_MED_POST 76 MPre = 30; # CONS_MED_PRE 77 CMAbv = 31; # CONS_MOD_ABOVE 78 CMBlw = 32; # CONS_MOD_BELOW 79 VAbv = 33; # VOWEL_ABOVE / VOWEL_ABOVE_BELOW / VOWEL_ABOVE_BELOW_POST / VOWEL_ABOVE_POST 80 VBlw = 34; # VOWEL_BELOW / VOWEL_BELOW_POST 81 VPst = 35; # VOWEL_POST UIPC = Right 82 VPre = 22; # VOWEL_PRE / VOWEL_PRE_ABOVE / VOWEL_PRE_ABOVE_POST / VOWEL_PRE_POST 83 VMAbv = 37; # VOWEL_MOD_ABOVE 84 VMBlw = 38; # VOWEL_MOD_BELOW 85 VMPst = 39; # VOWEL_MOD_POST 86 VMPre = 23; # VOWEL_MOD_PRE 87 SMAbv = 41; # SYM_MOD_ABOVE 88 SMBlw = 42; # SYM_MOD_BELOW 89 90 91 consonant_modifiers = CMAbv* CMBlw* ((H B | SUB) VS? CMAbv? CMBlw*)*; 92 medial_consonants = MPre? MAbv? MBlw? MPst?; 93 dependent_vowels = VPre* VAbv* VBlw* VPst*; 94 vowel_modifiers = VMPre* VMAbv* VMBlw* VMPst*; 95 final_consonants = FAbv* FBlw* FPst* FM?; 96 97 virama_terminated_cluster = 98 R? (B | GB) VS? 99 consonant_modifiers 100 H 101 ; 102 standard_cluster = 103 R? (B | GB) VS? 104 consonant_modifiers 105 medial_consonants 106 dependent_vowels 107 vowel_modifiers 108 final_consonants 109 ; 110 111 broken_cluster = 112 R? 113 consonant_modifiers 114 medial_consonants 115 dependent_vowels 116 vowel_modifiers 117 final_consonants 118 ; 119 120 number_joiner_terminated_cluster = N VS? (HN N VS?)* HN; 121 numeral_cluster = N VS? (HN N VS?)*; 122 symbol_cluster = S VS? SMAbv* SMBlw*; 123 independent_cluster = (IND | O | Rsv | WJ) VS?; 124 other = any; 125 126 main := |* 127 independent_cluster => { found_syllable (independent_cluster); }; 128 virama_terminated_cluster => { found_syllable (virama_terminated_cluster); }; 129 standard_cluster => { found_syllable (standard_cluster); }; 130 number_joiner_terminated_cluster => { found_syllable (number_joiner_terminated_cluster); }; 131 numeral_cluster => { found_syllable (numeral_cluster); }; 132 symbol_cluster => { found_syllable (symbol_cluster); }; 133 broken_cluster => { found_syllable (broken_cluster); }; 134 other => { found_syllable (non_cluster); }; 135 *|; 136 137 138 }%% 139 140 #define found_syllable(syllable_type) \ 141 HB_STMT_START { \ 142 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \ 143 for (unsigned int i = last; i < p+1; i++) \ 144 info[i].syllable() = (syllable_serial << 4) | syllable_type; \ 145 last = p+1; \ 146 syllable_serial++; \ 147 if (unlikely (syllable_serial == 16)) syllable_serial = 1; \ 148 } HB_STMT_END 149 150 static void 151 find_syllables (hb_buffer_t *buffer) 152 { 153 unsigned int p, pe, eof, ts HB_UNUSED, te HB_UNUSED, act HB_UNUSED; 154 int cs; 155 hb_glyph_info_t *info = buffer->info; 156 %%{ 157 write init; 158 getkey info[p].use_category(); 159 }%% 160 161 p = 0; 162 pe = eof = buffer->len; 163 164 unsigned int last = 0; 165 unsigned int syllable_serial = 1; 166 %%{ 167 write exec; 168 }%% 169 } 170 171 #undef found_syllable 172 173 #endif /* HB_OT_SHAPE_COMPLEX_USE_MACHINE_HH */ 174
