The Tor Browser / file comparison
comparison: gfx/harfbuzz/src/hb-ot-shape-complex-indic-machine.rl
gfx/harfbuzz/src/hb-ot-shape-complex-indic-machine.rl
- branch
- TOR_BUG_9701
- changeset 14
- 925c144e1f1f
equal
deleted
inserted
replaced
| -1:000000000000 | 0:28d54364cc5f |
|---|---|
| 1 /* | |
| 2 * Copyright © 2011,2012 Google, Inc. | |
| 3 * | |
| 4 * This is part of HarfBuzz, a text shaping library. | |
| 5 * | |
| 6 * Permission is hereby granted, without written agreement and without | |
| 7 * license or royalty fees, to use, copy, modify, and distribute this | |
| 8 * software and its documentation for any purpose, provided that the | |
| 9 * above copyright notice and the following two paragraphs appear in | |
| 10 * all copies of this software. | |
| 11 * | |
| 12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR | |
| 13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES | |
| 14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN | |
| 15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH | |
| 16 * DAMAGE. | |
| 17 * | |
| 18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, | |
| 19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND | |
| 20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS | |
| 21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO | |
| 22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. | |
| 23 * | |
| 24 * Google Author(s): Behdad Esfahbod | |
| 25 */ | |
| 26 | |
| 27 #ifndef HB_OT_SHAPE_COMPLEX_INDIC_MACHINE_HH | |
| 28 #define HB_OT_SHAPE_COMPLEX_INDIC_MACHINE_HH | |
| 29 | |
| 30 #include "hb-private.hh" | |
| 31 | |
| 32 %%{ | |
| 33 machine indic_syllable_machine; | |
| 34 alphtype unsigned char; | |
| 35 write data; | |
| 36 }%% | |
| 37 | |
| 38 %%{ | |
| 39 | |
| 40 # Same order as enum indic_category_t. Not sure how to avoid duplication. | |
| 41 X = 0; | |
| 42 C = 1; | |
| 43 V = 2; | |
| 44 N = 3; | |
| 45 H = 4; | |
| 46 ZWNJ = 5; | |
| 47 ZWJ = 6; | |
| 48 M = 7; | |
| 49 SM = 8; | |
| 50 VD = 9; | |
| 51 A = 10; | |
| 52 NBSP = 11; | |
| 53 DOTTEDCIRCLE = 12; | |
| 54 RS = 13; | |
| 55 Coeng = 14; | |
| 56 Repha = 15; | |
| 57 Ra = 16; | |
| 58 CM = 17; | |
| 59 Avag = 18; | |
| 60 CM2 = 31; | |
| 61 | |
| 62 c = (C | Ra); # is_consonant | |
| 63 n = ((ZWNJ?.RS)? (N.N?)?); # is_consonant_modifier | |
| 64 z = ZWJ|ZWNJ; # is_joiner | |
| 65 h = H | Coeng; # is_halant_or_coeng | |
| 66 reph = (Ra H | Repha); # possible reph | |
| 67 | |
| 68 cn = c.ZWJ?.n?; | |
| 69 forced_rakar = ZWJ H ZWJ Ra; | |
| 70 avagraha = Avag.N?; | |
| 71 matra_group = z{0,3}.M.N?.(H | forced_rakar)?; | |
| 72 syllable_tail2 = (SM.SM?.ZWNJ?)? (A.A?)? VD?; | |
| 73 syllable_tail = (Coeng (cn|V))? avagraha? syllable_tail2; | |
| 74 place_holder = NBSP | DOTTEDCIRCLE; | |
| 75 halant_group = (z?.h.(ZWJ.N?)?); | |
| 76 final_halant_group = halant_group | h.ZWNJ; | |
| 77 medial_group = CM?.CM2?; | |
| 78 halant_or_matra_group = (final_halant_group | (h.ZWJ)? matra_group{0,4}); | |
| 79 | |
| 80 | |
| 81 consonant_syllable = Repha? (cn.halant_group){0,4} cn medial_group halant_or_matra_group syllable_tail; | |
| 82 vowel_syllable = reph? V.n? (ZWJ | (halant_group.cn){0,4} medial_group halant_or_matra_group syllable_tail); | |
| 83 standalone_cluster = reph? place_holder.n? (halant_group.cn){0,4} medial_group halant_or_matra_group syllable_tail; | |
| 84 avagraha_cluster = avagraha syllable_tail2; | |
| 85 broken_cluster = reph? n? (halant_group.cn){0,4} medial_group halant_or_matra_group syllable_tail; | |
| 86 other = any; | |
| 87 | |
| 88 main := |* | |
| 89 consonant_syllable => { found_syllable (consonant_syllable); }; | |
| 90 vowel_syllable => { found_syllable (vowel_syllable); }; | |
| 91 standalone_cluster => { found_syllable (standalone_cluster); }; | |
| 92 avagraha_cluster => { found_syllable (avagraha_cluster); }; | |
| 93 broken_cluster => { found_syllable (broken_cluster); }; | |
| 94 other => { found_syllable (non_indic_cluster); }; | |
| 95 *|; | |
| 96 | |
| 97 | |
| 98 }%% | |
| 99 | |
| 100 #define found_syllable(syllable_type) \ | |
| 101 HB_STMT_START { \ | |
| 102 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \ | |
| 103 for (unsigned int i = last; i < p+1; i++) \ | |
| 104 info[i].syllable() = (syllable_serial << 4) | syllable_type; \ | |
| 105 last = p+1; \ | |
| 106 syllable_serial++; \ | |
| 107 if (unlikely (syllable_serial == 16)) syllable_serial = 1; \ | |
| 108 } HB_STMT_END | |
| 109 | |
| 110 static void | |
| 111 find_syllables (hb_buffer_t *buffer) | |
| 112 { | |
| 113 unsigned int p, pe, eof, ts HB_UNUSED, te HB_UNUSED, act HB_UNUSED; | |
| 114 int cs; | |
| 115 hb_glyph_info_t *info = buffer->info; | |
| 116 %%{ | |
| 117 write init; | |
| 118 getkey info[p].indic_category(); | |
| 119 }%% | |
| 120 | |
| 121 p = 0; | |
| 122 pe = eof = buffer->len; | |
| 123 | |
| 124 unsigned int last = 0; | |
| 125 unsigned int syllable_serial = 1; | |
| 126 %%{ | |
| 127 write exec; | |
| 128 }%% | |
| 129 } | |
| 130 | |
| 131 #endif /* HB_OT_SHAPE_COMPLEX_INDIC_MACHINE_HH */ |
