hb-ot-shape-complex-indic-machine.rl revision 5791f329159c9863317e2b507514c29321be31a7 
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.
41X    = 0;
42C    = 1;
43V    = 2;
44N    = 3;
45H    = 4;
46ZWNJ = 5;
47ZWJ  = 6;
48M    = 7;
49SM   = 8;
50VD   = 9;
51A    = 10;
52NBSP = 11;
53DOTTEDCIRCLE = 12;
54RS   = 13;
55Coeng = 14;
56Repha = 15;
57Ra    = 16;
58
59c = (C | Ra);			# is_consonant
60n = ((ZWNJ?.RS)? (N.N?)?);	# is_consonant_modifier
61z = ZWJ|ZWNJ;			# is_joiner
62h = H | Coeng;			# is_halant_or_coeng
63reph = (Ra H | Repha);		# possible reph
64
65cn = c.n?;
66forced_rakar = ZWJ H ZWJ Ra;
67matra_group = z*.M.N?.(H | forced_rakar)?;
68syllable_tail = (SM.ZWNJ?)? (Coeng (cn|V))? (VD VD?)?;
69place_holder = NBSP | DOTTEDCIRCLE;
70halant_group = (z?.h.ZWJ?);
71final_halant_group = halant_group | h.ZWNJ;
72halant_or_matra_group = (final_halant_group | matra_group*);
73
74
75consonant_syllable =	Repha? (cn.halant_group)* cn A? halant_or_matra_group? syllable_tail;
76vowel_syllable =	reph? V.n? (halant_group.cn | ZWJ.cn)* halant_or_matra_group? syllable_tail;
77standalone_cluster =	reph? place_holder.n? (halant_group.cn)* halant_or_matra_group? syllable_tail;
78other =			any;
79
80main := |*
81	consonant_syllable	=> { process_syllable (consonant_syllable); };
82	vowel_syllable		=> { process_syllable (vowel_syllable); };
83	standalone_cluster	=> { process_syllable (standalone_cluster); };
84	other			=> { process_syllable (non_indic); };
85*|;
86
87
88}%%
89
90#define process_syllable(func) \
91  HB_STMT_START { \
92    if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #func); \
93    for (unsigned int i = last; i < p+1; i++) \
94      info[i].syllable() = syllable_serial; \
95    PASTE (initial_reordering_, func) (map, buffer, mask_array, last, p+1); \
96    last = p+1; \
97    syllable_serial++; \
98    if (unlikely (!syllable_serial)) syllable_serial++; \
99  } HB_STMT_END
100
101static void
102find_syllables (const hb_ot_map_t *map, hb_buffer_t *buffer, hb_mask_t *mask_array)
103{
104  unsigned int p, pe, eof, ts, te, act;
105  int cs;
106  hb_glyph_info_t *info = buffer->info;
107  %%{
108    write init;
109    getkey info[p].indic_category();
110  }%%
111
112  p = 0;
113  pe = eof = buffer->len;
114
115  unsigned int last = 0;
116  uint8_t syllable_serial = 1;
117  %%{
118    write exec;
119  }%%
120}
121
122#endif /* HB_OT_SHAPE_COMPLEX_INDIC_MACHINE_HH */
123