Commit | Line | Data |
---|---|---|
b7b65b15 EZ |
1 | /* Low-level bidirectional buffer-scanning functions for GNU Emacs. |
2 | Copyright (C) 2000, 2001, 2004, 2005 Free Software Foundation, Inc. | |
3 | ||
4 | This file is part of GNU Emacs. | |
5 | ||
6 | GNU Emacs is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GNU Emacs is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU Emacs; see the file COPYING. If not, write to | |
19 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | |
20 | Boston, MA 02110-1301, USA. */ | |
21 | ||
2d6e4628 EZ |
22 | /* Written by Eli Zaretskii <eliz@gnu.org>. |
23 | ||
24 | A sequential implementation of the Unicode Bidirectional algorithm, | |
b7b65b15 EZ |
25 | as per UAX#9, a part of the Unicode Standard. |
26 | ||
27 | Unlike the reference and most other implementations, this one is | |
28 | designed to be called once for every character in the buffer. | |
29 | ||
30 | The main entry point is bidi_get_next_char_visually. Each time it | |
31 | is called, it finds the next character in the visual order, and | |
32 | returns its information in a special structure. The caller is then | |
33 | expected to process this character for display or any other | |
34 | purposes, and call bidi_get_next_char_visually for the next | |
35 | character. See the comments in bidi_get_next_char_visually for | |
36 | more details about its algorithm that finds the next visual-order | |
37 | character by resolving their levels on the fly. | |
38 | ||
89d3374a EZ |
39 | If you want to understand the code, you will have to read it |
40 | together with the relevant portions of UAX#9. The comments include | |
41 | references to UAX#9 rules, for that very reason. | |
42 | ||
b7b65b15 EZ |
43 | A note about references to UAX#9 rules: if the reference says |
44 | something like "X9/Retaining", it means that you need to refer to | |
45 | rule X9 and to its modifications decribed in the "Implementation | |
46 | Notes" section of UAX#9, under "Retaining Format Codes". */ | |
47 | ||
48 | #ifdef HAVE_CONFIG_H | |
49 | #include <config.h> | |
50 | #endif | |
51 | ||
52 | #include <stdio.h> | |
53 | ||
54 | #ifdef HAVE_STRING_H | |
55 | #include <string.h> | |
56 | #endif | |
57 | ||
58 | #include "lisp.h" | |
59 | #include "buffer.h" | |
60 | #include "character.h" | |
61 | #include "dispextern.h" | |
62 | ||
63 | static int bidi_initialized = 0; | |
64 | ||
65 | static Lisp_Object bidi_type_table; | |
66 | ||
e7402cb2 | 67 | /* FIXME: Remove these when bidi_explicit_dir_char uses a lookup table. */ |
b7b65b15 EZ |
68 | #define LRM_CHAR 0x200E |
69 | #define RLM_CHAR 0x200F | |
70 | #define LRE_CHAR 0x202A | |
71 | #define RLE_CHAR 0x202B | |
72 | #define PDF_CHAR 0x202C | |
73 | #define LRO_CHAR 0x202D | |
74 | #define RLO_CHAR 0x202E | |
75 | ||
b7b65b15 | 76 | #define BIDI_EOB -1 |
e7402cb2 | 77 | #define BIDI_BOB -2 /* FIXME: Is this needed? */ |
b7b65b15 | 78 | |
b7b65b15 EZ |
79 | /* Local data structures. (Look in dispextern.h for the rest.) */ |
80 | ||
81 | /* What we need to know about the current paragraph. */ | |
82 | struct bidi_paragraph_info { | |
83 | int start_bytepos; /* byte position where it begins */ | |
84 | int end_bytepos; /* byte position where it ends */ | |
85 | int embedding_level; /* its basic embedding level */ | |
86 | bidi_dir_t base_dir; /* its base direction */ | |
87 | }; | |
88 | ||
89 | /* Data type for describing the bidirectional character categories. */ | |
90 | typedef enum { | |
91 | UNKNOWN_BC, | |
92 | NEUTRAL, | |
93 | WEAK, | |
94 | STRONG | |
95 | } bidi_category_t; | |
96 | ||
97 | int bidi_ignore_explicit_marks_for_paragraph_level = 1; | |
98 | ||
a88bbf05 EZ |
99 | /* FIXME: Should be user-definable. */ |
100 | bidi_dir_t bidi_overriding_paragraph_direction = L2R; | |
b7b65b15 | 101 | |
b7b65b15 EZ |
102 | static void |
103 | bidi_initialize () | |
104 | { | |
105 | /* FIXME: This should come from the Unicode Database. */ | |
106 | struct { | |
107 | int from, to; | |
108 | bidi_type_t type; | |
109 | } bidi_type[] = | |
110 | { { 0x0000, 0x0008, WEAK_BN }, | |
111 | { 0x0009, 0x0000, NEUTRAL_S }, | |
112 | { 0x000A, 0x0000, NEUTRAL_B }, | |
113 | { 0x000B, 0x0000, NEUTRAL_S }, | |
114 | { 0x000C, 0x0000, NEUTRAL_WS }, | |
115 | { 0x000D, 0x0000, NEUTRAL_B }, | |
116 | { 0x000E, 0x001B, WEAK_BN }, | |
117 | { 0x001C, 0x001E, NEUTRAL_B }, | |
118 | { 0x001F, 0x0000, NEUTRAL_S }, | |
119 | { 0x0020, 0x0000, NEUTRAL_WS }, | |
120 | { 0x0021, 0x0022, NEUTRAL_ON }, | |
121 | { 0x0023, 0x0025, WEAK_ET }, | |
122 | { 0x0026, 0x002A, NEUTRAL_ON }, | |
e342a24d | 123 | { 0x002B, 0x0000, WEAK_ES }, |
b7b65b15 | 124 | { 0x002C, 0x0000, WEAK_CS }, |
e342a24d EZ |
125 | { 0x002D, 0x0000, WEAK_ES }, |
126 | { 0x002E, 0x002F, WEAK_CS }, | |
b7b65b15 EZ |
127 | { 0x0030, 0x0039, WEAK_EN }, |
128 | { 0x003A, 0x0000, WEAK_CS }, | |
129 | { 0x003B, 0x0040, NEUTRAL_ON }, | |
130 | { 0x005B, 0x0060, NEUTRAL_ON }, | |
131 | { 0x007B, 0x007E, NEUTRAL_ON }, | |
132 | { 0x007F, 0x0084, WEAK_BN }, | |
133 | { 0x0085, 0x0000, NEUTRAL_B }, | |
134 | { 0x0086, 0x009F, WEAK_BN }, | |
135 | { 0x00A0, 0x0000, WEAK_CS }, | |
136 | { 0x00A1, 0x0000, NEUTRAL_ON }, | |
137 | { 0x00A2, 0x00A5, WEAK_ET }, | |
138 | { 0x00A6, 0x00A9, NEUTRAL_ON }, | |
e342a24d EZ |
139 | { 0x00AB, 0x00AC, NEUTRAL_ON }, |
140 | { 0x00AD, 0x0000, WEAK_BN }, | |
141 | { 0x00AE, 0x00Af, NEUTRAL_ON }, | |
b7b65b15 EZ |
142 | { 0x00B0, 0x00B1, WEAK_ET }, |
143 | { 0x00B2, 0x00B3, WEAK_EN }, | |
144 | { 0x00B4, 0x0000, NEUTRAL_ON }, | |
145 | { 0x00B6, 0x00B8, NEUTRAL_ON }, | |
146 | { 0x00B9, 0x0000, WEAK_EN }, | |
147 | { 0x00BB, 0x00BF, NEUTRAL_ON }, | |
148 | { 0x00D7, 0x0000, NEUTRAL_ON }, | |
149 | { 0x00F7, 0x0000, NEUTRAL_ON }, | |
150 | { 0x02B9, 0x02BA, NEUTRAL_ON }, | |
151 | { 0x02C2, 0x02CF, NEUTRAL_ON }, | |
152 | { 0x02D2, 0x02DF, NEUTRAL_ON }, | |
153 | { 0x02E5, 0x02ED, NEUTRAL_ON }, | |
154 | { 0x0300, 0x036F, WEAK_NSM }, | |
155 | { 0x0374, 0x0375, NEUTRAL_ON }, | |
156 | { 0x037E, 0x0385, NEUTRAL_ON }, | |
157 | { 0x0387, 0x0000, NEUTRAL_ON }, | |
158 | { 0x03F6, 0x0000, NEUTRAL_ON }, | |
159 | { 0x0483, 0x0489, WEAK_NSM }, | |
160 | { 0x058A, 0x0000, NEUTRAL_ON }, | |
161 | { 0x0591, 0x05BD, WEAK_NSM }, | |
162 | { 0x05BE, 0x0000, STRONG_R }, | |
163 | { 0x05BF, 0x0000, WEAK_NSM }, | |
164 | { 0x05C0, 0x0000, STRONG_R }, | |
165 | { 0x05C1, 0x05C2, WEAK_NSM }, | |
166 | { 0x05C3, 0x0000, STRONG_R }, | |
e342a24d EZ |
167 | { 0x05C4, 0x05C5, WEAK_NSM }, |
168 | { 0x05C6, 0x0000, STRONG_R }, | |
169 | { 0x05C7, 0x0000, WEAK_NSM }, | |
b7b65b15 EZ |
170 | { 0x05D0, 0x05F4, STRONG_R }, |
171 | { 0x060C, 0x0000, WEAK_CS }, | |
172 | { 0x061B, 0x064A, STRONG_AL }, | |
173 | { 0x064B, 0x0655, WEAK_NSM }, | |
174 | { 0x0660, 0x0669, WEAK_AN }, | |
175 | { 0x066A, 0x0000, WEAK_ET }, | |
176 | { 0x066B, 0x066C, WEAK_AN }, | |
177 | { 0x066D, 0x066F, STRONG_AL }, | |
178 | { 0x0670, 0x0000, WEAK_NSM }, | |
179 | { 0x0671, 0x06D5, STRONG_AL }, | |
180 | { 0x06D6, 0x06DC, WEAK_NSM }, | |
181 | { 0x06DD, 0x0000, STRONG_AL }, | |
182 | { 0x06DE, 0x06E4, WEAK_NSM }, | |
183 | { 0x06E5, 0x06E6, STRONG_AL }, | |
184 | { 0x06E7, 0x06E8, WEAK_NSM }, | |
185 | { 0x06E9, 0x0000, NEUTRAL_ON }, | |
186 | { 0x06EA, 0x06ED, WEAK_NSM }, | |
187 | { 0x06F0, 0x06F9, WEAK_EN }, | |
188 | { 0x06FA, 0x070D, STRONG_AL }, | |
189 | { 0x070F, 0x0000, WEAK_BN }, | |
190 | { 0x0710, 0x0000, STRONG_AL }, | |
191 | { 0x0711, 0x0000, WEAK_NSM }, | |
192 | { 0x0712, 0x072C, STRONG_AL }, | |
193 | { 0x0730, 0x074A, WEAK_NSM }, | |
194 | { 0x0780, 0x07A5, STRONG_AL }, | |
195 | { 0x07A6, 0x07B0, WEAK_NSM }, | |
196 | { 0x07B1, 0x0000, STRONG_AL }, | |
197 | { 0x0901, 0x0902, WEAK_NSM }, | |
198 | { 0x093C, 0x0000, WEAK_NSM }, | |
199 | { 0x0941, 0x0948, WEAK_NSM }, | |
200 | { 0x094D, 0x0000, WEAK_NSM }, | |
201 | { 0x0951, 0x0954, WEAK_NSM }, | |
202 | { 0x0962, 0x0963, WEAK_NSM }, | |
203 | { 0x0981, 0x0000, WEAK_NSM }, | |
204 | { 0x09BC, 0x0000, WEAK_NSM }, | |
205 | { 0x09C1, 0x09C4, WEAK_NSM }, | |
206 | { 0x09CD, 0x0000, WEAK_NSM }, | |
207 | { 0x09E2, 0x09E3, WEAK_NSM }, | |
208 | { 0x09F2, 0x09F3, WEAK_ET }, | |
209 | { 0x0A02, 0x0000, WEAK_NSM }, | |
210 | { 0x0A3C, 0x0000, WEAK_NSM }, | |
211 | { 0x0A41, 0x0A4D, WEAK_NSM }, | |
212 | { 0x0A70, 0x0A71, WEAK_NSM }, | |
213 | { 0x0A81, 0x0A82, WEAK_NSM }, | |
214 | { 0x0ABC, 0x0000, WEAK_NSM }, | |
215 | { 0x0AC1, 0x0AC8, WEAK_NSM }, | |
216 | { 0x0ACD, 0x0000, WEAK_NSM }, | |
217 | { 0x0B01, 0x0000, WEAK_NSM }, | |
218 | { 0x0B3C, 0x0000, WEAK_NSM }, | |
219 | { 0x0B3F, 0x0000, WEAK_NSM }, | |
220 | { 0x0B41, 0x0B43, WEAK_NSM }, | |
221 | { 0x0B4D, 0x0B56, WEAK_NSM }, | |
222 | { 0x0B82, 0x0000, WEAK_NSM }, | |
223 | { 0x0BC0, 0x0000, WEAK_NSM }, | |
224 | { 0x0BCD, 0x0000, WEAK_NSM }, | |
225 | { 0x0C3E, 0x0C40, WEAK_NSM }, | |
226 | { 0x0C46, 0x0C56, WEAK_NSM }, | |
227 | { 0x0CBF, 0x0000, WEAK_NSM }, | |
228 | { 0x0CC6, 0x0000, WEAK_NSM }, | |
229 | { 0x0CCC, 0x0CCD, WEAK_NSM }, | |
230 | { 0x0D41, 0x0D43, WEAK_NSM }, | |
231 | { 0x0D4D, 0x0000, WEAK_NSM }, | |
232 | { 0x0DCA, 0x0000, WEAK_NSM }, | |
233 | { 0x0DD2, 0x0DD6, WEAK_NSM }, | |
234 | { 0x0E31, 0x0000, WEAK_NSM }, | |
235 | { 0x0E34, 0x0E3A, WEAK_NSM }, | |
236 | { 0x0E3F, 0x0000, WEAK_ET }, | |
237 | { 0x0E47, 0x0E4E, WEAK_NSM }, | |
238 | { 0x0EB1, 0x0000, WEAK_NSM }, | |
239 | { 0x0EB4, 0x0EBC, WEAK_NSM }, | |
240 | { 0x0EC8, 0x0ECD, WEAK_NSM }, | |
241 | { 0x0F18, 0x0F19, WEAK_NSM }, | |
242 | { 0x0F35, 0x0000, WEAK_NSM }, | |
243 | { 0x0F37, 0x0000, WEAK_NSM }, | |
244 | { 0x0F39, 0x0000, WEAK_NSM }, | |
245 | { 0x0F3A, 0x0F3D, NEUTRAL_ON }, | |
246 | { 0x0F71, 0x0F7E, WEAK_NSM }, | |
247 | { 0x0F80, 0x0F84, WEAK_NSM }, | |
248 | { 0x0F86, 0x0F87, WEAK_NSM }, | |
249 | { 0x0F90, 0x0FBC, WEAK_NSM }, | |
250 | { 0x0FC6, 0x0000, WEAK_NSM }, | |
251 | { 0x102D, 0x1030, WEAK_NSM }, | |
252 | { 0x1032, 0x1037, WEAK_NSM }, | |
253 | { 0x1039, 0x0000, WEAK_NSM }, | |
254 | { 0x1058, 0x1059, WEAK_NSM }, | |
255 | { 0x1680, 0x0000, NEUTRAL_WS }, | |
256 | { 0x169B, 0x169C, NEUTRAL_ON }, | |
257 | { 0x1712, 0x1714, WEAK_NSM }, | |
258 | { 0x1732, 0x1734, WEAK_NSM }, | |
259 | { 0x1752, 0x1753, WEAK_NSM }, | |
260 | { 0x1772, 0x1773, WEAK_NSM }, | |
261 | { 0x17B7, 0x17BD, WEAK_NSM }, | |
262 | { 0x17C6, 0x0000, WEAK_NSM }, | |
263 | { 0x17C9, 0x17D3, WEAK_NSM }, | |
264 | { 0x17DB, 0x0000, WEAK_ET }, | |
265 | { 0x1800, 0x180A, NEUTRAL_ON }, | |
266 | { 0x180B, 0x180D, WEAK_NSM }, | |
267 | { 0x180E, 0x0000, WEAK_BN }, | |
268 | { 0x18A9, 0x0000, WEAK_NSM }, | |
269 | { 0x1FBD, 0x0000, NEUTRAL_ON }, | |
270 | { 0x1FBF, 0x1FC1, NEUTRAL_ON }, | |
271 | { 0x1FCD, 0x1FCF, NEUTRAL_ON }, | |
272 | { 0x1FDD, 0x1FDF, NEUTRAL_ON }, | |
273 | { 0x1FED, 0x1FEF, NEUTRAL_ON }, | |
274 | { 0x1FFD, 0x1FFE, NEUTRAL_ON }, | |
275 | { 0x2000, 0x200A, NEUTRAL_WS }, | |
276 | { 0x200B, 0x200D, WEAK_BN }, | |
277 | { 0x200F, 0x0000, STRONG_R }, | |
278 | { 0x2010, 0x2027, NEUTRAL_ON }, | |
279 | { 0x2028, 0x0000, NEUTRAL_WS }, | |
280 | { 0x2029, 0x0000, NEUTRAL_B }, | |
281 | { 0x202A, 0x0000, LRE }, | |
282 | { 0x202B, 0x0000, RLE }, | |
283 | { 0x202C, 0x0000, PDF }, | |
284 | { 0x202D, 0x0000, LRO }, | |
285 | { 0x202E, 0x0000, RLO }, | |
286 | { 0x202F, 0x0000, NEUTRAL_WS }, | |
287 | { 0x2030, 0x2034, WEAK_ET }, | |
288 | { 0x2035, 0x2057, NEUTRAL_ON }, | |
289 | { 0x205F, 0x0000, NEUTRAL_WS }, | |
290 | { 0x2060, 0x206F, WEAK_BN }, | |
291 | { 0x2070, 0x0000, WEAK_EN }, | |
292 | { 0x2074, 0x2079, WEAK_EN }, | |
293 | { 0x207A, 0x207B, WEAK_ET }, | |
294 | { 0x207C, 0x207E, NEUTRAL_ON }, | |
295 | { 0x2080, 0x2089, WEAK_EN }, | |
296 | { 0x208A, 0x208B, WEAK_ET }, | |
297 | { 0x208C, 0x208E, NEUTRAL_ON }, | |
298 | { 0x20A0, 0x20B1, WEAK_ET }, | |
299 | { 0x20D0, 0x20EA, WEAK_NSM }, | |
300 | { 0x2100, 0x2101, NEUTRAL_ON }, | |
301 | { 0x2103, 0x2106, NEUTRAL_ON }, | |
302 | { 0x2108, 0x2109, NEUTRAL_ON }, | |
303 | { 0x2114, 0x0000, NEUTRAL_ON }, | |
304 | { 0x2116, 0x2118, NEUTRAL_ON }, | |
305 | { 0x211E, 0x2123, NEUTRAL_ON }, | |
306 | { 0x2125, 0x0000, NEUTRAL_ON }, | |
307 | { 0x2127, 0x0000, NEUTRAL_ON }, | |
308 | { 0x2129, 0x0000, NEUTRAL_ON }, | |
309 | { 0x212E, 0x0000, WEAK_ET }, | |
310 | { 0x2132, 0x0000, NEUTRAL_ON }, | |
311 | { 0x213A, 0x0000, NEUTRAL_ON }, | |
312 | { 0x2140, 0x2144, NEUTRAL_ON }, | |
313 | { 0x214A, 0x215F, NEUTRAL_ON }, | |
314 | { 0x2190, 0x2211, NEUTRAL_ON }, | |
315 | { 0x2212, 0x2213, WEAK_ET }, | |
316 | { 0x2214, 0x2335, NEUTRAL_ON }, | |
317 | { 0x237B, 0x2394, NEUTRAL_ON }, | |
318 | { 0x2396, 0x244A, NEUTRAL_ON }, | |
319 | { 0x2460, 0x249B, WEAK_EN }, | |
320 | { 0x24EA, 0x0000, WEAK_EN }, | |
321 | { 0x24EB, 0x2FFB, NEUTRAL_ON }, | |
322 | { 0x3000, 0x0000, NEUTRAL_WS }, | |
323 | { 0x3001, 0x3004, NEUTRAL_ON }, | |
324 | { 0x3008, 0x3020, NEUTRAL_ON }, | |
325 | { 0x302A, 0x302F, WEAK_NSM }, | |
326 | { 0x3030, 0x0000, NEUTRAL_ON }, | |
327 | { 0x3036, 0x3037, NEUTRAL_ON }, | |
328 | { 0x303D, 0x303F, NEUTRAL_ON }, | |
329 | { 0x3099, 0x309A, WEAK_NSM }, | |
330 | { 0x309B, 0x309C, NEUTRAL_ON }, | |
331 | { 0x30A0, 0x0000, NEUTRAL_ON }, | |
332 | { 0x30FB, 0x0000, NEUTRAL_ON }, | |
333 | { 0x3251, 0x325F, NEUTRAL_ON }, | |
334 | { 0x32B1, 0x32BF, NEUTRAL_ON }, | |
335 | { 0xA490, 0xA4C6, NEUTRAL_ON }, | |
336 | { 0xFB1D, 0x0000, STRONG_R }, | |
337 | { 0xFB1E, 0x0000, WEAK_NSM }, | |
338 | { 0xFB1F, 0xFB28, STRONG_R }, | |
339 | { 0xFB29, 0x0000, WEAK_ET }, | |
340 | { 0xFB2A, 0xFB4F, STRONG_R }, | |
341 | { 0xFB50, 0xFD3D, STRONG_AL }, | |
342 | { 0xFD3E, 0xFD3F, NEUTRAL_ON }, | |
343 | { 0xFD50, 0xFDFC, STRONG_AL }, | |
344 | { 0xFE00, 0xFE23, WEAK_NSM }, | |
345 | { 0xFE30, 0xFE4F, NEUTRAL_ON }, | |
346 | { 0xFE50, 0x0000, WEAK_CS }, | |
347 | { 0xFE51, 0x0000, NEUTRAL_ON }, | |
348 | { 0xFE52, 0x0000, WEAK_CS }, | |
349 | { 0xFE54, 0x0000, NEUTRAL_ON }, | |
350 | { 0xFE55, 0x0000, WEAK_CS }, | |
351 | { 0xFE56, 0xFE5E, NEUTRAL_ON }, | |
352 | { 0xFE5F, 0x0000, WEAK_ET }, | |
353 | { 0xFE60, 0xFE61, NEUTRAL_ON }, | |
354 | { 0xFE62, 0xFE63, WEAK_ET }, | |
355 | { 0xFE64, 0xFE68, NEUTRAL_ON }, | |
356 | { 0xFE69, 0xFE6A, WEAK_ET }, | |
357 | { 0xFE6B, 0x0000, NEUTRAL_ON }, | |
358 | { 0xFE70, 0xFEFC, STRONG_AL }, | |
359 | { 0xFEFF, 0x0000, WEAK_BN }, | |
360 | { 0xFF01, 0xFF02, NEUTRAL_ON }, | |
361 | { 0xFF03, 0xFF05, WEAK_ET }, | |
362 | { 0xFF06, 0xFF0A, NEUTRAL_ON }, | |
363 | { 0xFF0B, 0x0000, WEAK_ET }, | |
364 | { 0xFF0C, 0x0000, WEAK_CS }, | |
365 | { 0xFF0D, 0x0000, WEAK_ET }, | |
366 | { 0xFF0E, 0x0000, WEAK_CS }, | |
367 | { 0xFF0F, 0x0000, WEAK_ES }, | |
368 | { 0xFF10, 0xFF19, WEAK_EN }, | |
369 | { 0xFF1A, 0x0000, WEAK_CS }, | |
370 | { 0xFF1B, 0xFF20, NEUTRAL_ON }, | |
371 | { 0xFF3B, 0xFF40, NEUTRAL_ON }, | |
372 | { 0xFF5B, 0xFF65, NEUTRAL_ON }, | |
373 | { 0xFFE0, 0xFFE1, WEAK_ET }, | |
374 | { 0xFFE2, 0xFFE4, NEUTRAL_ON }, | |
375 | { 0xFFE5, 0xFFE6, WEAK_ET }, | |
376 | { 0xFFE8, 0xFFEE, NEUTRAL_ON }, | |
377 | { 0xFFF9, 0xFFFB, WEAK_BN }, | |
378 | { 0xFFFC, 0xFFFD, NEUTRAL_ON }, | |
379 | { 0x1D167, 0x1D169, WEAK_NSM }, | |
380 | { 0x1D173, 0x1D17A, WEAK_BN }, | |
381 | { 0x1D17B, 0x1D182, WEAK_NSM }, | |
382 | { 0x1D185, 0x1D18B, WEAK_NSM }, | |
383 | { 0x1D1AA, 0x1D1AD, WEAK_NSM }, | |
384 | { 0x1D7CE, 0x1D7FF, WEAK_EN }, | |
385 | { 0xE0001, 0xE007F, WEAK_BN } }; | |
386 | int i; | |
387 | ||
388 | bidi_type_table = Fmake_char_table (Qnil, make_number (STRONG_L)); | |
2d6e4628 | 389 | staticpro (&bidi_type_table); |
b7b65b15 EZ |
390 | |
391 | for (i = 0; i < sizeof bidi_type / sizeof bidi_type[0]; i++) | |
f44e260c EZ |
392 | char_table_set_range (bidi_type_table, bidi_type[i].from, |
393 | bidi_type[i].to ? bidi_type[i].to : bidi_type[i].from, | |
b7b65b15 EZ |
394 | make_number (bidi_type[i].type)); |
395 | bidi_initialized = 1; | |
396 | } | |
397 | ||
b7b65b15 EZ |
398 | /* Return the bidi type of a character CH. */ |
399 | bidi_type_t | |
400 | bidi_get_type (int ch) | |
401 | { | |
e7402cb2 EZ |
402 | if (ch == BIDI_EOB) |
403 | return NEUTRAL_B; | |
e342a24d EZ |
404 | if (ch < 0 || ch > MAX_CHAR) |
405 | abort (); | |
b7b65b15 EZ |
406 | return (bidi_type_t) XINT (CHAR_TABLE_REF (bidi_type_table, ch)); |
407 | } | |
408 | ||
2d6e4628 EZ |
409 | void |
410 | bidi_check_type (bidi_type_t type) | |
411 | { | |
412 | if (type < UNKNOWN_BT || type > NEUTRAL_ON) | |
413 | abort (); | |
414 | } | |
415 | ||
b7b65b15 EZ |
416 | /* Given a bidi TYPE of a character, return its category. */ |
417 | bidi_category_t | |
418 | bidi_get_category (bidi_type_t type) | |
419 | { | |
420 | switch (type) | |
421 | { | |
422 | case UNKNOWN_BT: | |
423 | return UNKNOWN_BC; | |
424 | case STRONG_L: | |
425 | case STRONG_R: | |
426 | case STRONG_AL: | |
427 | case LRE: | |
428 | case LRO: | |
429 | case RLE: | |
430 | case RLO: | |
431 | return STRONG; | |
432 | case PDF: /* ??? really?? */ | |
433 | case WEAK_EN: | |
434 | case WEAK_ES: | |
435 | case WEAK_ET: | |
436 | case WEAK_AN: | |
437 | case WEAK_CS: | |
438 | case WEAK_NSM: | |
439 | case WEAK_BN: | |
440 | return WEAK; | |
441 | case NEUTRAL_B: | |
442 | case NEUTRAL_S: | |
443 | case NEUTRAL_WS: | |
444 | case NEUTRAL_ON: | |
445 | return NEUTRAL; | |
446 | default: | |
447 | abort (); | |
448 | } | |
449 | } | |
450 | ||
e342a24d EZ |
451 | /* Return the mirrored character of C, if any. |
452 | ||
453 | Note: The conditions in UAX#9 clause L4 must be tested by the | |
454 | caller. */ | |
b7b65b15 EZ |
455 | /* FIXME: exceedingly temporary! Should consult the Unicode database |
456 | of character properties. */ | |
457 | int | |
458 | bidi_mirror_char (int c) | |
459 | { | |
460 | static const char mirrored_pairs[] = "()<>[]{}"; | |
461 | const char *p = strchr (mirrored_pairs, c); | |
462 | ||
463 | if (p) | |
464 | { | |
465 | size_t i = p - mirrored_pairs; | |
466 | ||
467 | if ((i & 1) == 0) | |
468 | return mirrored_pairs[i + 1]; | |
469 | else | |
470 | return mirrored_pairs[i - 1]; | |
471 | } | |
472 | return c; | |
473 | } | |
474 | ||
475 | /* Copy the bidi iterator from FROM to TO. To save cycles, this only | |
476 | copies the part of the level stack that is actually in use. */ | |
477 | static inline void | |
478 | bidi_copy_it (struct bidi_it *to, struct bidi_it *from) | |
479 | { | |
9c82e145 | 480 | int save_first_elt = to->first_elt; |
b7b65b15 EZ |
481 | int i; |
482 | ||
483 | /* Copy everything except the level stack. */ | |
484 | memcpy (to, from, ((int)&((struct bidi_it *)0)->level_stack[0])); | |
9c82e145 EZ |
485 | to->first_elt = save_first_elt; |
486 | if (to->first_elt != 0 && to->first_elt != 1) | |
487 | to->first_elt = 0; | |
b7b65b15 EZ |
488 | |
489 | /* Copy the active part of the level stack. */ | |
490 | to->level_stack[0] = from->level_stack[0]; /* level zero is always in use */ | |
491 | for (i = 1; i <= from->stack_idx; i++) | |
492 | to->level_stack[i] = from->level_stack[i]; | |
493 | } | |
494 | ||
495 | /* Caching the bidi iterator states. */ | |
496 | ||
497 | static struct bidi_it bidi_cache[1000]; /* FIXME: make this dynamically allocated! */ | |
498 | static int bidi_cache_idx; | |
499 | static int bidi_cache_last_idx; | |
500 | ||
501 | static inline void | |
502 | bidi_cache_reset (void) | |
503 | { | |
504 | bidi_cache_idx = 0; | |
505 | bidi_cache_last_idx = -1; | |
506 | } | |
507 | ||
508 | static inline void | |
509 | bidi_cache_fetch_state (int idx, struct bidi_it *bidi_it) | |
510 | { | |
511 | int current_scan_dir = bidi_it->scan_dir; | |
512 | ||
513 | if (idx < 0 || idx >= bidi_cache_idx) | |
514 | abort (); | |
515 | ||
516 | bidi_copy_it (bidi_it, &bidi_cache[idx]); | |
517 | bidi_it->scan_dir = current_scan_dir; | |
518 | bidi_cache_last_idx = idx; | |
519 | } | |
520 | ||
521 | /* Find a cached state with a given CHARPOS and resolved embedding | |
522 | level less or equal to LEVEL. if LEVEL is -1, disregard the | |
523 | resolved levels in cached states. DIR, if non-zero, means search | |
524 | in that direction from the last cache hit. */ | |
525 | static inline int | |
526 | bidi_cache_search (int charpos, int level, int dir) | |
527 | { | |
528 | int i, i_start; | |
529 | ||
530 | if (bidi_cache_idx) | |
531 | { | |
532 | if (charpos < bidi_cache[bidi_cache_last_idx].charpos) | |
533 | dir = -1; | |
534 | else if (charpos > bidi_cache[bidi_cache_last_idx].charpos) | |
535 | dir = 1; | |
536 | if (dir) | |
537 | i_start = bidi_cache_last_idx; | |
538 | else | |
539 | { | |
540 | dir = -1; | |
541 | i_start = bidi_cache_idx - 1; | |
542 | } | |
543 | ||
544 | if (dir < 0) | |
545 | { | |
546 | /* Linear search for now; FIXME! */ | |
547 | for (i = i_start; i >= 0; i--) | |
548 | if (bidi_cache[i].charpos == charpos | |
549 | && (level == -1 || bidi_cache[i].resolved_level <= level)) | |
550 | return i; | |
551 | } | |
552 | else | |
553 | { | |
554 | for (i = i_start; i < bidi_cache_idx; i++) | |
555 | if (bidi_cache[i].charpos == charpos | |
556 | && (level == -1 || bidi_cache[i].resolved_level <= level)) | |
557 | return i; | |
558 | } | |
559 | } | |
560 | ||
561 | return -1; | |
562 | } | |
563 | ||
564 | /* Find a cached state where the resolved level changes to a value | |
565 | that is lower than LEVEL, and return its cache slot index. DIR is | |
566 | the direction to search, starting with the last used cache slot. | |
567 | BEFORE, if non-zero, means return the index of the slot that is | |
568 | ``before'' the level change in the search direction. That is, | |
569 | given the cached levels like this: | |
570 | ||
571 | 1122333442211 | |
572 | AB C | |
573 | ||
574 | and assuming we are at the position cached at the slot marked with | |
575 | C, searching backwards (DIR = -1) for LEVEL = 2 will return the | |
576 | index of slot B or A, depending whether BEFORE is, respectively, | |
577 | non-zero or zero. */ | |
578 | static int | |
579 | bidi_cache_find_level_change (int level, int dir, int before) | |
580 | { | |
581 | if (bidi_cache_idx) | |
582 | { | |
583 | int i = dir ? bidi_cache_last_idx : bidi_cache_idx - 1; | |
584 | int incr = before ? 1 : 0; | |
585 | ||
586 | if (!dir) | |
587 | dir = -1; | |
588 | else if (!incr) | |
589 | i += dir; | |
590 | ||
591 | if (dir < 0) | |
592 | { | |
593 | while (i >= incr) | |
594 | { | |
595 | if (bidi_cache[i - incr].resolved_level >= 0 | |
596 | && bidi_cache[i - incr].resolved_level < level) | |
597 | return i; | |
598 | i--; | |
599 | } | |
600 | } | |
601 | else | |
602 | { | |
603 | while (i < bidi_cache_idx - incr) | |
604 | { | |
605 | if (bidi_cache[i + incr].resolved_level >= 0 | |
606 | && bidi_cache[i + incr].resolved_level < level) | |
607 | return i; | |
608 | i++; | |
609 | } | |
610 | } | |
611 | } | |
612 | ||
613 | return -1; | |
614 | } | |
615 | ||
616 | static inline void | |
617 | bidi_cache_iterator_state (struct bidi_it *bidi_it, int resolved) | |
618 | { | |
619 | int idx; | |
620 | ||
621 | /* We should never cache on backward scans. */ | |
622 | if (bidi_it->scan_dir == -1) | |
623 | abort (); | |
624 | idx = bidi_cache_search (bidi_it->charpos, -1, 1); | |
625 | ||
626 | if (idx < 0) | |
627 | { | |
628 | idx = bidi_cache_idx; | |
629 | if (idx > sizeof (bidi_cache) / sizeof (bidi_cache[0]) - 1) | |
630 | abort (); | |
631 | bidi_copy_it (&bidi_cache[idx], bidi_it); | |
632 | if (!resolved) | |
633 | bidi_cache[idx].resolved_level = -1; | |
634 | } | |
635 | else | |
636 | { | |
637 | /* Copy only the members which could have changed, to avoid | |
638 | costly copying of the entire struct. */ | |
639 | bidi_cache[idx].type = bidi_it->type; | |
2d6e4628 | 640 | bidi_check_type (bidi_it->type); |
89d3374a EZ |
641 | bidi_cache[idx].type_after_w1 = bidi_it->type_after_w1; |
642 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
643 | if (resolved) |
644 | bidi_cache[idx].resolved_level = bidi_it->resolved_level; | |
645 | else | |
646 | bidi_cache[idx].resolved_level = -1; | |
647 | bidi_cache[idx].invalid_levels = bidi_it->invalid_levels; | |
648 | bidi_cache[idx].invalid_rl_levels = bidi_it->invalid_rl_levels; | |
649 | bidi_cache[idx].next_for_neutral = bidi_it->next_for_neutral; | |
650 | bidi_cache[idx].next_for_ws = bidi_it->next_for_ws; | |
651 | bidi_cache[idx].ignore_bn_limit = bidi_it->ignore_bn_limit; | |
652 | } | |
653 | ||
654 | bidi_cache_last_idx = idx; | |
655 | if (idx >= bidi_cache_idx) | |
656 | bidi_cache_idx = idx + 1; | |
657 | } | |
658 | ||
659 | static inline bidi_type_t | |
660 | bidi_cache_find (int charpos, int level, struct bidi_it *bidi_it) | |
661 | { | |
662 | int i = bidi_cache_search (charpos, level, bidi_it->scan_dir); | |
663 | ||
664 | if (i >= 0) | |
665 | { | |
666 | bidi_dir_t current_scan_dir = bidi_it->scan_dir; | |
667 | ||
668 | *bidi_it = bidi_cache[i]; | |
669 | bidi_cache_last_idx = i; | |
670 | /* Don't let scan direction from from the cached state override | |
671 | the current scan direction. */ | |
672 | bidi_it->scan_dir = current_scan_dir; | |
673 | return bidi_it->type; | |
674 | } | |
675 | ||
676 | return UNKNOWN_BT; | |
677 | } | |
678 | ||
679 | static inline int | |
680 | bidi_peek_at_next_level (struct bidi_it *bidi_it) | |
681 | { | |
682 | if (bidi_cache_idx == 0 || bidi_cache_last_idx == -1) | |
683 | abort (); | |
684 | return bidi_cache[bidi_cache_last_idx + bidi_it->scan_dir].resolved_level; | |
685 | } | |
686 | ||
687 | /* Return non-zero if buffer's byte position POS is the last character | |
688 | of a paragraph. THIS_CH is the character preceding the one at POS in | |
689 | the buffer. */ | |
690 | int | |
691 | bidi_at_paragraph_end (int this_ch, int pos) | |
692 | { | |
e7402cb2 EZ |
693 | int next_ch; |
694 | ||
695 | if (pos >= ZV_BYTE) | |
696 | return 1; | |
b7b65b15 | 697 | |
e7402cb2 | 698 | next_ch = FETCH_CHAR (pos); |
b7b65b15 EZ |
699 | /* FIXME: This should support all Unicode characters that can end a |
700 | paragraph. */ | |
e7402cb2 | 701 | return (this_ch == '\n' && next_ch == '\n'); |
b7b65b15 EZ |
702 | } |
703 | ||
704 | /* Determine the start-of-run (sor) directional type given the two | |
705 | embedding levels on either side of the run boundary. Also, update | |
706 | the saved info about previously seen characters, since that info is | |
707 | generally valid for a single level run. */ | |
708 | static inline void | |
709 | bidi_set_sor_type (struct bidi_it *bidi_it, int level_before, int level_after) | |
710 | { | |
711 | int higher_level = level_before > level_after ? level_before : level_after; | |
712 | ||
713 | /* The prev_was_pdf gork is required for when we have several PDFs | |
714 | in a row. In that case, we want to compute the sor type for the | |
715 | next level run only once: when we see the first PDF. That's | |
716 | because the sor type depends only on the higher of the two levels | |
717 | that we find on the two sides of the level boundary (see UAX#9, | |
718 | clause X10), and so we don't need to know the final embedding | |
719 | level to which we descend after processing all the PDFs. */ | |
e342a24d | 720 | if (!bidi_it->prev_was_pdf || level_before < level_after) |
b7b65b15 EZ |
721 | /* FIXME: should the default sor direction be user selectable? */ |
722 | bidi_it->sor = (higher_level & 1) != 0 ? R2L : L2R; | |
723 | if (level_before > level_after) | |
724 | bidi_it->prev_was_pdf = 1; | |
725 | ||
726 | bidi_it->prev.type = UNKNOWN_BT; | |
89d3374a EZ |
727 | bidi_it->last_strong.type = bidi_it->last_strong.type_after_w1 = |
728 | bidi_it->last_strong.orig_type = UNKNOWN_BT; | |
b7b65b15 EZ |
729 | bidi_it->prev_for_neutral.type = bidi_it->sor == R2L ? STRONG_R : STRONG_L; |
730 | bidi_it->prev_for_neutral.charpos = bidi_it->charpos; | |
731 | bidi_it->prev_for_neutral.bytepos = bidi_it->bytepos; | |
89d3374a EZ |
732 | bidi_it->next_for_neutral.type = bidi_it->next_for_neutral.type_after_w1 = |
733 | bidi_it->next_for_neutral.orig_type = UNKNOWN_BT; | |
b7b65b15 EZ |
734 | bidi_it->ignore_bn_limit = 0; /* meaning it's unknown */ |
735 | } | |
736 | ||
737 | void | |
738 | bidi_paragraph_init (bidi_dir_t dir, struct bidi_it *bidi_it) | |
739 | { | |
e342a24d | 740 | int bytepos = bidi_it->bytepos; |
e7402cb2 | 741 | |
9c82e145 EZ |
742 | /* We should never be called at EOB or before BEGV. */ |
743 | if (bytepos >= ZV_BYTE || bytepos < BEGV_BYTE) | |
744 | abort (); | |
745 | ||
746 | /* We should always be called at the beginning of a new | |
747 | paragraph. */ | |
748 | if (!(bytepos == BEGV_BYTE | |
749 | || FETCH_CHAR (bytepos) == '\n' | |
750 | || FETCH_CHAR (bytepos - 1) == '\n')) | |
e7402cb2 EZ |
751 | abort (); |
752 | ||
e7402cb2 | 753 | bidi_it->level_stack[0].level = 0; /* default for L2R */ |
b7b65b15 EZ |
754 | if (dir == R2L) |
755 | bidi_it->level_stack[0].level = 1; | |
756 | else if (dir == NEUTRAL_DIR) /* P2 */ | |
757 | { | |
e342a24d EZ |
758 | int ch = FETCH_CHAR (bytepos), ch_len = CHAR_BYTES (ch); |
759 | int pos = bidi_it->charpos; | |
760 | bidi_type_t type = bidi_get_type (ch); | |
b7b65b15 | 761 | |
e342a24d | 762 | for (pos++, bytepos += ch_len; |
b7b65b15 EZ |
763 | /* NOTE: UAX#9 says to search only for L, AL, or R types of |
764 | characters, and ignore RLE, RLO, LRE, and LRO. However, | |
765 | I'm not sure it makes sense to omit those 4; should try | |
766 | with and without that to see the effect. */ | |
767 | (bidi_get_category (type) != STRONG) | |
768 | || (bidi_ignore_explicit_marks_for_paragraph_level | |
769 | && (type == RLE || type == RLO | |
770 | || type == LRE || type == LRO)); | |
771 | type = bidi_get_type (ch)) | |
772 | { | |
773 | if (type == NEUTRAL_B || bidi_at_paragraph_end (ch, bytepos)) | |
774 | break; | |
775 | FETCH_CHAR_ADVANCE (ch, pos, bytepos); | |
776 | } | |
777 | if (type == STRONG_R || type == STRONG_AL) /* P3 */ | |
778 | bidi_it->level_stack[0].level = 1; | |
779 | } | |
780 | bidi_it->scan_dir = 1; /* FIXME: do we need to have control on this? */ | |
781 | bidi_it->resolved_level = bidi_it->level_stack[0].level; | |
782 | bidi_it->level_stack[0].override = NEUTRAL_DIR; /* X1 */ | |
783 | bidi_it->invalid_levels = 0; | |
784 | bidi_it->invalid_rl_levels = -1; | |
785 | bidi_it->new_paragraph = 0; | |
786 | bidi_it->next_en_pos = -1; | |
787 | bidi_it->next_for_ws.type = UNKNOWN_BT; | |
e342a24d EZ |
788 | bidi_set_sor_type (bidi_it, bidi_overriding_paragraph_direction, |
789 | bidi_it->level_stack[0].level); /* X10 */ | |
b7b65b15 EZ |
790 | |
791 | bidi_cache_reset (); | |
792 | } | |
793 | ||
794 | /* Do whatever UAX#9 clause X8 says should be done at paragraph's end, | |
795 | and set the new paragraph flag in the iterator. */ | |
796 | static inline void | |
797 | bidi_set_paragraph_end (struct bidi_it *bidi_it) | |
798 | { | |
799 | bidi_it->invalid_levels = 0; | |
800 | bidi_it->invalid_rl_levels = -1; | |
801 | bidi_it->stack_idx = 0; | |
802 | bidi_it->resolved_level = bidi_it->level_stack[0].level; | |
803 | bidi_it->new_paragraph = 1; | |
804 | } | |
805 | ||
89d3374a | 806 | /* Initialize the bidi iterator from buffer position CHARPOS. */ |
b7b65b15 | 807 | void |
89d3374a | 808 | bidi_init_it (int charpos, int bytepos, struct bidi_it *bidi_it) |
b7b65b15 EZ |
809 | { |
810 | if (! bidi_initialized) | |
811 | bidi_initialize (); | |
812 | bidi_set_paragraph_end (bidi_it); | |
9c82e145 | 813 | bidi_it->first_elt = 1; |
89d3374a EZ |
814 | bidi_it->charpos = charpos; |
815 | bidi_it->bytepos = bytepos; | |
b7b65b15 | 816 | bidi_it->type = NEUTRAL_B; |
89d3374a | 817 | bidi_it->type_after_w1 = UNKNOWN_BT; |
b7b65b15 | 818 | bidi_it->orig_type = UNKNOWN_BT; |
b7b65b15 | 819 | bidi_it->prev_was_pdf = 0; |
89d3374a EZ |
820 | bidi_it->prev.type = bidi_it->prev.type_after_w1 = UNKNOWN_BT; |
821 | bidi_it->last_strong.type = bidi_it->last_strong.type_after_w1 = | |
822 | bidi_it->last_strong.orig_type = UNKNOWN_BT; | |
b7b65b15 EZ |
823 | bidi_it->next_for_neutral.charpos = -1; |
824 | bidi_it->next_for_neutral.type = | |
89d3374a EZ |
825 | bidi_it->next_for_neutral.type_after_w1 = |
826 | bidi_it->next_for_neutral.orig_type = UNKNOWN_BT; | |
b7b65b15 EZ |
827 | bidi_it->prev_for_neutral.charpos = -1; |
828 | bidi_it->prev_for_neutral.type = | |
89d3374a EZ |
829 | bidi_it->prev_for_neutral.type_after_w1 = |
830 | bidi_it->prev_for_neutral.orig_type = UNKNOWN_BT; | |
b7b65b15 | 831 | bidi_it->sor = L2R; /* FIXME: should it be user-selectable? */ |
b7b65b15 EZ |
832 | } |
833 | ||
834 | /* Push the current embedding level and override status; reset the | |
835 | current level to LEVEL and the current override status to OVERRIDE. */ | |
836 | static inline void | |
837 | bidi_push_embedding_level (struct bidi_it *bidi_it, | |
838 | int level, bidi_dir_t override) | |
839 | { | |
840 | bidi_it->stack_idx++; | |
841 | if (bidi_it->stack_idx >= BIDI_MAXLEVEL) | |
842 | abort (); | |
843 | bidi_it->level_stack[bidi_it->stack_idx].level = level; | |
844 | bidi_it->level_stack[bidi_it->stack_idx].override = override; | |
845 | } | |
846 | ||
847 | /* Pop the embedding level and directional override status from the | |
848 | stack, and return the new level. */ | |
849 | static inline int | |
850 | bidi_pop_embedding_level (struct bidi_it *bidi_it) | |
851 | { | |
852 | /* UAX#9 says to ignore invalid PDFs. */ | |
853 | if (bidi_it->stack_idx > 0) | |
854 | bidi_it->stack_idx--; | |
855 | return bidi_it->level_stack[bidi_it->stack_idx].level; | |
856 | } | |
857 | ||
858 | /* Record in SAVED_INFO the information about the current character. */ | |
859 | static inline void | |
860 | bidi_remember_char (struct bidi_saved_info *saved_info, | |
861 | struct bidi_it *bidi_it) | |
862 | { | |
863 | saved_info->charpos = bidi_it->charpos; | |
864 | saved_info->bytepos = bidi_it->bytepos; | |
865 | saved_info->type = bidi_it->type; | |
2d6e4628 | 866 | bidi_check_type (bidi_it->type); |
89d3374a EZ |
867 | saved_info->type_after_w1 = bidi_it->type_after_w1; |
868 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 | 869 | saved_info->orig_type = bidi_it->orig_type; |
2d6e4628 | 870 | bidi_check_type (bidi_it->orig_type); |
b7b65b15 EZ |
871 | } |
872 | ||
873 | /* Resolve the type of a neutral character according to the type of | |
874 | surrounding strong text and the current embedding level. */ | |
875 | static inline bidi_type_t | |
876 | bidi_resolve_neutral_1 (bidi_type_t prev_type, bidi_type_t next_type, int lev) | |
877 | { | |
878 | /* N1: European and Arabic numbers are treated as though they were R. */ | |
879 | if (next_type == WEAK_EN || next_type == WEAK_AN) | |
880 | next_type = STRONG_R; | |
881 | if (prev_type == WEAK_EN || prev_type == WEAK_AN) | |
882 | prev_type = STRONG_R; | |
883 | ||
884 | if (next_type == prev_type) /* N1 */ | |
885 | return next_type; | |
886 | else if ((lev & 1) == 0) /* N2 */ | |
887 | return STRONG_L; | |
888 | else | |
889 | return STRONG_R; | |
890 | } | |
891 | ||
892 | static inline int | |
893 | bidi_explicit_dir_char (int c) | |
894 | { | |
895 | /* FIXME: this should be replaced with a lookup table with suitable | |
896 | bits set, like standard C ctype macros do. */ | |
897 | return (c == LRE_CHAR || c == LRO_CHAR | |
898 | || c == RLE_CHAR || c == RLO_CHAR || c == PDF_CHAR); | |
899 | } | |
900 | ||
901 | /* A helper function for bidi_resolve_explicit. It advances to the | |
902 | next character in logical order and determines the new embedding | |
903 | level and directional override, but does not take into account | |
904 | empty embeddings. */ | |
905 | static int | |
906 | bidi_resolve_explicit_1 (struct bidi_it *bidi_it) | |
907 | { | |
908 | int curchar; | |
909 | bidi_type_t type; | |
910 | int current_level; | |
911 | int new_level; | |
912 | bidi_dir_t override; | |
913 | ||
9c82e145 EZ |
914 | if (bidi_it->bytepos < BEGV_BYTE /* after reseat to BEGV? */ |
915 | || bidi_it->first_elt) | |
e7402cb2 | 916 | { |
9c82e145 EZ |
917 | bidi_it->first_elt = 0; |
918 | if (bidi_it->charpos < BEGV) | |
919 | bidi_it->charpos = BEGV; | |
920 | bidi_it->bytepos = CHAR_TO_BYTE (bidi_it->charpos); | |
e7402cb2 | 921 | } |
9c82e145 | 922 | else if (bidi_it->bytepos < ZV_BYTE) /* don't move at ZV */ |
b7b65b15 EZ |
923 | { |
924 | bidi_it->charpos++; | |
e7402cb2 EZ |
925 | if (bidi_it->ch_len == 0) |
926 | abort (); | |
b7b65b15 EZ |
927 | bidi_it->bytepos += bidi_it->ch_len; |
928 | } | |
929 | ||
930 | current_level = bidi_it->level_stack[bidi_it->stack_idx].level; /* X1 */ | |
931 | override = bidi_it->level_stack[bidi_it->stack_idx].override; | |
932 | new_level = current_level; | |
933 | ||
934 | /* in case it is a unibyte character (not yet implemented) */ | |
935 | /* _fetch_multibyte_char_len = 1; */ | |
e7402cb2 EZ |
936 | if (bidi_it->bytepos >= ZV_BYTE) |
937 | { | |
938 | curchar = BIDI_EOB; | |
939 | bidi_it->ch_len = 1; | |
940 | } | |
941 | else | |
942 | { | |
943 | curchar = FETCH_CHAR (bidi_it->bytepos); | |
944 | bidi_it->ch_len = CHAR_BYTES (curchar); | |
945 | } | |
b7b65b15 | 946 | bidi_it->ch = curchar; |
b7b65b15 EZ |
947 | |
948 | type = bidi_get_type (curchar); | |
89d3374a EZ |
949 | bidi_it->orig_type = type; |
950 | bidi_check_type (bidi_it->orig_type); | |
b7b65b15 EZ |
951 | |
952 | if (type != PDF) | |
953 | bidi_it->prev_was_pdf = 0; | |
954 | ||
89d3374a | 955 | bidi_it->type_after_w1 = UNKNOWN_BT; |
b7b65b15 EZ |
956 | |
957 | switch (type) | |
958 | { | |
959 | case RLE: /* X2 */ | |
960 | case RLO: /* X4 */ | |
89d3374a EZ |
961 | bidi_it->type_after_w1 = type; |
962 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
963 | type = WEAK_BN; /* X9/Retaining */ |
964 | if (bidi_it->ignore_bn_limit <= 0) | |
965 | { | |
966 | if (current_level <= BIDI_MAXLEVEL - 4) | |
967 | { | |
968 | /* Compute the least odd embedding level greater than | |
969 | the current level. */ | |
970 | new_level = ((current_level + 1) & ~1) + 1; | |
89d3374a | 971 | if (bidi_it->type_after_w1 == RLE) |
b7b65b15 EZ |
972 | override = NEUTRAL_DIR; |
973 | else | |
974 | override = R2L; | |
975 | if (current_level == BIDI_MAXLEVEL - 4) | |
976 | bidi_it->invalid_rl_levels = 0; | |
977 | bidi_push_embedding_level (bidi_it, new_level, override); | |
978 | } | |
979 | else | |
980 | { | |
981 | bidi_it->invalid_levels++; | |
982 | /* See the commentary about invalid_rl_levels below. */ | |
983 | if (bidi_it->invalid_rl_levels < 0) | |
984 | bidi_it->invalid_rl_levels = 0; | |
985 | bidi_it->invalid_rl_levels++; | |
986 | } | |
987 | } | |
89d3374a | 988 | else if (bidi_it->prev.type_after_w1 == WEAK_EN /* W5/Retaining */ |
b7b65b15 EZ |
989 | || bidi_it->next_en_pos > bidi_it->charpos) |
990 | type = WEAK_EN; | |
991 | break; | |
992 | case LRE: /* X3 */ | |
993 | case LRO: /* X5 */ | |
89d3374a EZ |
994 | bidi_it->type_after_w1 = type; |
995 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
996 | type = WEAK_BN; /* X9/Retaining */ |
997 | if (bidi_it->ignore_bn_limit <= 0) | |
998 | { | |
999 | if (current_level <= BIDI_MAXLEVEL - 5) | |
1000 | { | |
1001 | /* Compute the least even embedding level greater than | |
1002 | the current level. */ | |
1003 | new_level = ((current_level + 2) & ~1); | |
89d3374a | 1004 | if (bidi_it->type_after_w1 == LRE) |
b7b65b15 EZ |
1005 | override = NEUTRAL_DIR; |
1006 | else | |
1007 | override = L2R; | |
1008 | bidi_push_embedding_level (bidi_it, new_level, override); | |
1009 | } | |
1010 | else | |
1011 | { | |
1012 | bidi_it->invalid_levels++; | |
1013 | /* invalid_rl_levels counts invalid levels encountered | |
1014 | while the embedding level was already too high for | |
1015 | LRE/LRO, but not for RLE/RLO. That is because | |
1016 | there may be exactly one PDF which we should not | |
1017 | ignore even though invalid_levels is non-zero. | |
1018 | invalid_rl_levels helps to know what PDF is | |
1019 | that. */ | |
1020 | if (bidi_it->invalid_rl_levels >= 0) | |
1021 | bidi_it->invalid_rl_levels++; | |
1022 | } | |
1023 | } | |
89d3374a | 1024 | else if (bidi_it->prev.type_after_w1 == WEAK_EN /* W5/Retaining */ |
b7b65b15 EZ |
1025 | || bidi_it->next_en_pos > bidi_it->charpos) |
1026 | type = WEAK_EN; | |
1027 | break; | |
1028 | case PDF: /* X7 */ | |
89d3374a EZ |
1029 | bidi_it->type_after_w1 = type; |
1030 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
1031 | type = WEAK_BN; /* X9/Retaining */ |
1032 | if (bidi_it->ignore_bn_limit <= 0) | |
1033 | { | |
1034 | if (!bidi_it->invalid_rl_levels) | |
1035 | { | |
1036 | new_level = bidi_pop_embedding_level (bidi_it); | |
1037 | bidi_it->invalid_rl_levels = -1; | |
1038 | if (bidi_it->invalid_levels) | |
1039 | bidi_it->invalid_levels--; | |
1040 | /* else nothing: UAX#9 says to ignore invalid PDFs */ | |
1041 | } | |
1042 | if (!bidi_it->invalid_levels) | |
1043 | new_level = bidi_pop_embedding_level (bidi_it); | |
1044 | else | |
1045 | { | |
1046 | bidi_it->invalid_levels--; | |
1047 | bidi_it->invalid_rl_levels--; | |
1048 | } | |
1049 | } | |
89d3374a | 1050 | else if (bidi_it->prev.type_after_w1 == WEAK_EN /* W5/Retaining */ |
b7b65b15 EZ |
1051 | || bidi_it->next_en_pos > bidi_it->charpos) |
1052 | type = WEAK_EN; | |
1053 | break; | |
1054 | default: | |
1055 | /* Nothing. */ | |
1056 | break; | |
1057 | } | |
1058 | ||
1059 | bidi_it->type = type; | |
2d6e4628 | 1060 | bidi_check_type (bidi_it->type); |
b7b65b15 EZ |
1061 | |
1062 | return new_level; | |
1063 | } | |
1064 | ||
1065 | /* Given an iterator state in BIDI_IT, advance one character position | |
1066 | in the buffer to the next character (in the logical order), resolve | |
1067 | any explicit embeddings and directional overrides, and return the | |
1068 | embedding level of the character after resolving explicit | |
1069 | directives and ignoring empty embeddings. */ | |
1070 | static int | |
1071 | bidi_resolve_explicit (struct bidi_it *bidi_it) | |
1072 | { | |
1073 | int prev_level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1074 | int new_level = bidi_resolve_explicit_1 (bidi_it); | |
1075 | ||
1076 | if (prev_level < new_level | |
1077 | && bidi_it->type == WEAK_BN | |
1078 | && bidi_it->ignore_bn_limit == 0 /* only if not already known */ | |
e7402cb2 | 1079 | && bidi_it->ch != BIDI_EOB /* not already at EOB */ |
b7b65b15 EZ |
1080 | && bidi_explicit_dir_char (FETCH_CHAR (bidi_it->bytepos |
1081 | + bidi_it->ch_len))) | |
1082 | { | |
1083 | /* Avoid pushing and popping embedding levels if the level run | |
1084 | is empty, as this breaks level runs where it shouldn't. | |
1085 | UAX#9 removes all the explicit embedding and override codes, | |
1086 | so empty embeddings disappear without a trace. We need to | |
1087 | behave as if we did the same. */ | |
1088 | struct bidi_it saved_it; | |
1089 | int level = prev_level; | |
1090 | ||
1091 | bidi_copy_it (&saved_it, bidi_it); | |
1092 | ||
1093 | while (bidi_explicit_dir_char (FETCH_CHAR (bidi_it->bytepos | |
1094 | + bidi_it->ch_len))) | |
1095 | { | |
1096 | level = bidi_resolve_explicit_1 (bidi_it); | |
1097 | } | |
1098 | ||
1099 | if (level == prev_level) /* empty embedding */ | |
1100 | saved_it.ignore_bn_limit = bidi_it->charpos + 1; | |
1101 | else /* this embedding is non-empty */ | |
1102 | saved_it.ignore_bn_limit = -1; | |
1103 | ||
1104 | bidi_copy_it (bidi_it, &saved_it); | |
1105 | if (bidi_it->ignore_bn_limit > 0) | |
1106 | { | |
1107 | /* We pushed a level, but we shouldn't have. Undo that. */ | |
1108 | if (!bidi_it->invalid_rl_levels) | |
1109 | { | |
1110 | new_level = bidi_pop_embedding_level (bidi_it); | |
1111 | bidi_it->invalid_rl_levels = -1; | |
1112 | if (bidi_it->invalid_levels) | |
1113 | bidi_it->invalid_levels--; | |
1114 | } | |
1115 | if (!bidi_it->invalid_levels) | |
1116 | new_level = bidi_pop_embedding_level (bidi_it); | |
1117 | else | |
1118 | { | |
1119 | bidi_it->invalid_levels--; | |
1120 | bidi_it->invalid_rl_levels--; | |
1121 | } | |
1122 | } | |
1123 | } | |
1124 | ||
1125 | /* For when the paragraph end is defined by anything other than a | |
1126 | special Unicode character (a.k.a. ``higher protocols''). */ | |
1127 | if (bidi_it->type != NEUTRAL_B) | |
1128 | if (bidi_at_paragraph_end (bidi_it->ch, | |
1129 | bidi_it->bytepos + bidi_it->ch_len)) | |
1130 | bidi_it->type = NEUTRAL_B; | |
1131 | ||
1132 | if (bidi_it->type == NEUTRAL_B) /* X8 */ | |
1133 | { | |
1134 | bidi_set_paragraph_end (bidi_it); | |
89d3374a EZ |
1135 | bidi_it->type_after_w1 = bidi_it->type; /* needed below and in L1 */ |
1136 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
1137 | } |
1138 | ||
1139 | return new_level; | |
1140 | } | |
1141 | ||
1142 | /* Advance in the buffer, resolve weak types and return the type of | |
1143 | the next character after weak type resolution. */ | |
1144 | bidi_type_t | |
1145 | bidi_resolve_weak (struct bidi_it *bidi_it) | |
1146 | { | |
1147 | bidi_type_t type; | |
1148 | bidi_dir_t override; | |
1149 | int prev_level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1150 | int new_level = bidi_resolve_explicit (bidi_it); | |
1151 | int next_char; | |
1152 | bidi_type_t type_of_next; | |
1153 | struct bidi_it saved_it; | |
1154 | ||
1155 | type = bidi_it->type; | |
1156 | override = bidi_it->level_stack[bidi_it->stack_idx].override; | |
1157 | ||
1158 | if (type == UNKNOWN_BT | |
1159 | || type == LRE | |
1160 | || type == LRO | |
1161 | || type == RLE | |
1162 | || type == RLO | |
1163 | || type == PDF) | |
1164 | abort (); | |
1165 | ||
1166 | if (new_level != prev_level | |
1167 | || bidi_it->type == NEUTRAL_B) | |
1168 | { | |
1169 | /* We've got a new embedding level run, compute the directional | |
1170 | type of sor and initialize per-run variables (UAX#9, clause | |
1171 | X10). */ | |
1172 | bidi_set_sor_type (bidi_it, prev_level, new_level); | |
1173 | } | |
1174 | else if (type == NEUTRAL_S || type == NEUTRAL_WS | |
1175 | || type == WEAK_BN || type == STRONG_AL) | |
89d3374a EZ |
1176 | bidi_it->type_after_w1 = type; /* needed in L1 */ |
1177 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
1178 | |
1179 | /* Level and directional override status are already recorded in | |
1180 | bidi_it, and do not need any change; see X6. */ | |
1181 | if (override == R2L) /* X6 */ | |
1182 | type = STRONG_R; | |
1183 | else if (override == L2R) | |
1184 | type = STRONG_L; | |
1185 | else if (type == STRONG_AL) | |
1186 | type = STRONG_R; /* W3 */ | |
1187 | else if (type == WEAK_NSM) /* W1 */ | |
1188 | { | |
1189 | /* Note that we don't need to consider the case where the prev | |
1190 | character has its type overridden by an RLO or LRO: such | |
1191 | characters are outside the current level run, and thus not | |
89d3374a EZ |
1192 | relevant to this NSM. Thus, NSM gets the orig_type of the |
1193 | previous character. */ | |
b7b65b15 | 1194 | if (bidi_it->prev.type != UNKNOWN_BT) |
89d3374a | 1195 | type = bidi_it->prev.orig_type; |
b7b65b15 EZ |
1196 | else if (bidi_it->sor == R2L) |
1197 | type = STRONG_R; | |
1198 | else if (bidi_it->sor == L2R) | |
1199 | type = STRONG_L; | |
1200 | else /* shouldn't happen! */ | |
1201 | abort (); | |
1202 | if (type == WEAK_EN /* W2 after W1 */ | |
89d3374a | 1203 | && bidi_it->last_strong.type_after_w1 == STRONG_AL) |
b7b65b15 EZ |
1204 | type = WEAK_AN; |
1205 | } | |
1206 | else if (type == WEAK_EN /* W2 */ | |
89d3374a | 1207 | && bidi_it->last_strong.type_after_w1 == STRONG_AL) |
b7b65b15 EZ |
1208 | type = WEAK_AN; |
1209 | else if ((type == WEAK_ES | |
89d3374a EZ |
1210 | && (bidi_it->prev.type_after_w1 == WEAK_EN /* W4 */ |
1211 | && (bidi_it->prev.orig_type == WEAK_EN | |
1212 | || bidi_it->prev.orig_type == WEAK_NSM))) /* aft W1 */ | |
b7b65b15 | 1213 | || (type == WEAK_CS |
89d3374a EZ |
1214 | && ((bidi_it->prev.type_after_w1 == WEAK_EN |
1215 | && (bidi_it->prev.orig_type == WEAK_EN /* W4 */ | |
1216 | || bidi_it->prev.orig_type == WEAK_NSM)) /* a/W1 */ | |
1217 | || bidi_it->prev.type_after_w1 == WEAK_AN))) /* W4 */ | |
b7b65b15 | 1218 | { |
e7402cb2 EZ |
1219 | next_char = |
1220 | bidi_it->bytepos + bidi_it->ch_len >= ZV_BYTE | |
1221 | ? BIDI_EOB : FETCH_CHAR (bidi_it->bytepos + bidi_it->ch_len); | |
b7b65b15 EZ |
1222 | type_of_next = bidi_get_type (next_char); |
1223 | ||
1224 | if (type_of_next == WEAK_BN | |
1225 | || bidi_explicit_dir_char (next_char)) | |
1226 | { | |
1227 | bidi_copy_it (&saved_it, bidi_it); | |
1228 | while (bidi_resolve_explicit (bidi_it) == new_level | |
1229 | && bidi_it->type == WEAK_BN) | |
1230 | ; | |
1231 | type_of_next = bidi_it->type; | |
1232 | bidi_copy_it (bidi_it, &saved_it); | |
1233 | } | |
1234 | ||
1235 | /* If the next character is EN, but the last strong-type | |
1236 | character is AL, that next EN will be changed to AN when we | |
1237 | process it in W2 above. So in that case, this ES should not | |
1238 | be changed into EN. */ | |
1239 | if (type == WEAK_ES | |
1240 | && type_of_next == WEAK_EN | |
89d3374a | 1241 | && bidi_it->last_strong.type_after_w1 != STRONG_AL) |
b7b65b15 EZ |
1242 | type = WEAK_EN; |
1243 | else if (type == WEAK_CS) | |
1244 | { | |
89d3374a | 1245 | if (bidi_it->prev.type_after_w1 == WEAK_AN |
b7b65b15 EZ |
1246 | && (type_of_next == WEAK_AN |
1247 | /* If the next character is EN, but the last | |
1248 | strong-type character is AL, EN will be later | |
1249 | changed to AN when we process it in W2 above. So | |
1250 | in that case, this ES should not be changed into | |
1251 | EN. */ | |
1252 | || (type_of_next == WEAK_EN | |
89d3374a | 1253 | && bidi_it->last_strong.type_after_w1 == STRONG_AL))) |
b7b65b15 | 1254 | type = WEAK_AN; |
89d3374a | 1255 | else if (bidi_it->prev.type_after_w1 == WEAK_EN |
b7b65b15 | 1256 | && type_of_next == WEAK_EN |
89d3374a | 1257 | && bidi_it->last_strong.type_after_w1 != STRONG_AL) |
b7b65b15 EZ |
1258 | type = WEAK_EN; |
1259 | } | |
1260 | } | |
1261 | else if (type == WEAK_ET /* W5: ET with EN before or after it */ | |
1262 | || type == WEAK_BN) /* W5/Retaining */ | |
1263 | { | |
89d3374a | 1264 | if (bidi_it->prev.type_after_w1 == WEAK_EN /* ET/BN with EN before it */ |
b7b65b15 EZ |
1265 | || bidi_it->next_en_pos > bidi_it->charpos) |
1266 | type = WEAK_EN; | |
1267 | /* W5: ET with EN after it. */ | |
1268 | else | |
1269 | { | |
1270 | int en_pos = bidi_it->charpos + 1; | |
1271 | ||
e7402cb2 EZ |
1272 | next_char = |
1273 | bidi_it->bytepos + bidi_it->ch_len >= ZV_BYTE | |
1274 | ? BIDI_EOB : FETCH_CHAR (bidi_it->bytepos + bidi_it->ch_len); | |
b7b65b15 EZ |
1275 | type_of_next = bidi_get_type (next_char); |
1276 | ||
1277 | if (type_of_next == WEAK_ET | |
1278 | || type_of_next == WEAK_BN | |
1279 | || bidi_explicit_dir_char (next_char)) | |
1280 | { | |
1281 | bidi_copy_it (&saved_it, bidi_it); | |
1282 | while (bidi_resolve_explicit (bidi_it) == new_level | |
1283 | && (bidi_it->type == WEAK_BN || bidi_it->type == WEAK_ET)) | |
1284 | ; | |
1285 | type_of_next = bidi_it->type; | |
1286 | en_pos = bidi_it->charpos; | |
1287 | bidi_copy_it (bidi_it, &saved_it); | |
1288 | } | |
1289 | if (type_of_next == WEAK_EN) | |
1290 | { | |
1291 | /* If the last strong character is AL, the EN we've | |
1292 | found will become AN when we get to it (W2). */ | |
89d3374a | 1293 | if (bidi_it->last_strong.type_after_w1 != STRONG_AL) |
b7b65b15 EZ |
1294 | { |
1295 | type = WEAK_EN; | |
1296 | /* Remember this EN position, to speed up processing | |
1297 | of the next ETs. */ | |
1298 | bidi_it->next_en_pos = en_pos; | |
1299 | } | |
1300 | else if (type == WEAK_BN) | |
1301 | type = NEUTRAL_ON; /* W6/Retaining */ | |
1302 | } | |
1303 | } | |
1304 | } | |
1305 | ||
1306 | if (type == WEAK_ES || type == WEAK_ET || type == WEAK_CS /* W6 */ | |
89d3374a EZ |
1307 | || (type == WEAK_BN |
1308 | && (bidi_it->prev.type_after_w1 == WEAK_CS /* W6/Retaining */ | |
1309 | || bidi_it->prev.type_after_w1 == WEAK_ES | |
1310 | || bidi_it->prev.type_after_w1 == WEAK_ET))) | |
b7b65b15 EZ |
1311 | type = NEUTRAL_ON; |
1312 | ||
1313 | /* Store the type we've got so far, before we clobber it with strong | |
1314 | types in W7 and while resolving neutral types. But leave alone | |
1315 | the original types that were recorded above, because we will need | |
1316 | them for the L1 clause. */ | |
89d3374a EZ |
1317 | if (bidi_it->type_after_w1 == UNKNOWN_BT) |
1318 | bidi_it->type_after_w1 = type; | |
1319 | bidi_check_type (bidi_it->type_after_w1); | |
b7b65b15 EZ |
1320 | |
1321 | if (type == WEAK_EN) /* W7 */ | |
1322 | { | |
89d3374a | 1323 | if ((bidi_it->last_strong.type_after_w1 == STRONG_L) |
b7b65b15 EZ |
1324 | || (bidi_it->last_strong.type == UNKNOWN_BT && bidi_it->sor == L2R)) |
1325 | type = STRONG_L; | |
1326 | } | |
1327 | ||
1328 | bidi_it->type = type; | |
2d6e4628 | 1329 | bidi_check_type (bidi_it->type); |
b7b65b15 EZ |
1330 | return type; |
1331 | } | |
1332 | ||
1333 | bidi_type_t | |
1334 | bidi_resolve_neutral (struct bidi_it *bidi_it) | |
1335 | { | |
1336 | int prev_level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1337 | bidi_type_t type = bidi_resolve_weak (bidi_it); | |
1338 | int current_level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1339 | ||
1340 | if (!(type == STRONG_R | |
1341 | || type == STRONG_L | |
1342 | || type == WEAK_BN | |
1343 | || type == WEAK_EN | |
1344 | || type == WEAK_AN | |
1345 | || type == NEUTRAL_B | |
1346 | || type == NEUTRAL_S | |
1347 | || type == NEUTRAL_WS | |
1348 | || type == NEUTRAL_ON)) | |
1349 | abort (); | |
1350 | ||
1351 | if (bidi_get_category (type) == NEUTRAL | |
1352 | || (type == WEAK_BN && prev_level == current_level)) | |
1353 | { | |
1354 | if (bidi_it->next_for_neutral.type != UNKNOWN_BT) | |
1355 | type = bidi_resolve_neutral_1 (bidi_it->prev_for_neutral.type, | |
1356 | bidi_it->next_for_neutral.type, | |
1357 | current_level); | |
1358 | else | |
1359 | { | |
1360 | /* Arrrgh!! The UAX#9 algorithm is too deeply entrenched in | |
1361 | the assumption of batch-style processing; see clauses W4, | |
1362 | W5, and especially N1, which require to look far forward | |
1363 | (as well as back) in the buffer. May the fleas of a | |
1364 | thousand camels infest the armpits of those who design | |
1365 | supposedly general-purpose algorithms by looking at their | |
1366 | own implementations, and fail to consider other possible | |
1367 | implementations! */ | |
1368 | struct bidi_it saved_it; | |
1369 | bidi_type_t next_type; | |
1370 | ||
1371 | if (bidi_it->scan_dir == -1) | |
1372 | abort (); | |
1373 | ||
1374 | bidi_copy_it (&saved_it, bidi_it); | |
1375 | /* Scan the text forward until we find the first non-neutral | |
1376 | character, and then use that to resolve the neutral we | |
1377 | are dealing with now. We also cache the scanned iterator | |
1378 | states, to salvage some of the effort later. */ | |
1379 | bidi_cache_iterator_state (bidi_it, 0); | |
1380 | do { | |
1381 | /* Record the info about the previous character, so that | |
1382 | it will be cached below with this state. */ | |
89d3374a | 1383 | if (bidi_it->type_after_w1 != WEAK_BN /* W1/Retaining */ |
b7b65b15 EZ |
1384 | && bidi_it->type != WEAK_BN) |
1385 | bidi_remember_char (&bidi_it->prev, bidi_it); | |
1386 | type = bidi_resolve_weak (bidi_it); | |
1387 | /* Paragraph separators have their levels fully resolved | |
1388 | at this point, so cache them as resolved. */ | |
1389 | bidi_cache_iterator_state (bidi_it, type == NEUTRAL_B); | |
1390 | /* FIXME: implement L1 here, by testing for a newline and | |
1391 | resetting the level for any sequence of whitespace | |
1392 | characters adjacent to it. */ | |
1393 | } while (!(type == NEUTRAL_B | |
1394 | || (type != WEAK_BN | |
1395 | && bidi_get_category (type) != NEUTRAL) | |
1396 | /* This is all per level run, so stop when we | |
1397 | reach the end of this level run. */ | |
1398 | || bidi_it->level_stack[bidi_it->stack_idx].level != | |
1399 | current_level)); | |
1400 | ||
1401 | bidi_remember_char (&saved_it.next_for_neutral, bidi_it); | |
1402 | ||
1403 | switch (type) | |
1404 | { | |
1405 | case STRONG_L: | |
1406 | case STRONG_R: | |
1407 | case STRONG_AL: | |
1408 | next_type = type; | |
1409 | break; | |
1410 | case WEAK_EN: | |
1411 | case WEAK_AN: | |
1412 | /* N1: ``European and Arabic numbers are treated as | |
1413 | though they were R.'' */ | |
1414 | next_type = STRONG_R; | |
1415 | saved_it.next_for_neutral.type = STRONG_R; | |
1416 | break; | |
1417 | case WEAK_BN: | |
1418 | if (!bidi_explicit_dir_char (bidi_it->ch)) | |
1419 | abort (); /* can't happen: BNs are skipped */ | |
1420 | /* FALLTHROUGH */ | |
1421 | case NEUTRAL_B: | |
1422 | /* Marched all the way to the end of this level run. | |
1423 | We need to use the eor type, whose information is | |
1424 | stored by bidi_set_sor_type in the prev_for_neutral | |
1425 | member. */ | |
1426 | if (saved_it.type != WEAK_BN | |
89d3374a | 1427 | || bidi_get_category (bidi_it->prev.type_after_w1) == NEUTRAL) |
b7b65b15 EZ |
1428 | { |
1429 | next_type = bidi_it->prev_for_neutral.type; | |
1430 | saved_it.next_for_neutral.type = next_type; | |
2d6e4628 | 1431 | bidi_check_type (next_type); |
b7b65b15 EZ |
1432 | } |
1433 | else | |
1434 | { | |
1435 | /* This is a BN which does not adjoin neutrals. | |
1436 | Leave its type alone. */ | |
1437 | bidi_copy_it (bidi_it, &saved_it); | |
1438 | return bidi_it->type; | |
1439 | } | |
1440 | break; | |
1441 | default: | |
1442 | abort (); | |
1443 | } | |
1444 | type = bidi_resolve_neutral_1 (saved_it.prev_for_neutral.type, | |
1445 | next_type, current_level); | |
1446 | saved_it.type = type; | |
2d6e4628 | 1447 | bidi_check_type (type); |
b7b65b15 EZ |
1448 | bidi_copy_it (bidi_it, &saved_it); |
1449 | } | |
1450 | } | |
1451 | return type; | |
1452 | } | |
1453 | ||
1454 | /* Given an iterator state in BIDI_IT, advance one character position | |
1455 | in the buffer to the next character (in the logical order), resolve | |
1456 | the bidi type of that next character, and return that type. */ | |
1457 | bidi_type_t | |
1458 | bidi_type_of_next_char (struct bidi_it *bidi_it) | |
1459 | { | |
1460 | bidi_type_t type; | |
1461 | ||
1462 | /* This should always be called during a forward scan. */ | |
1463 | if (bidi_it->scan_dir != 1) | |
1464 | abort (); | |
1465 | ||
1466 | /* Reset the limit until which to ignore BNs if we step out of the | |
1467 | area where we found only empty levels. */ | |
1468 | if ((bidi_it->ignore_bn_limit > 0 | |
1469 | && bidi_it->ignore_bn_limit <= bidi_it->charpos) | |
1470 | || (bidi_it->ignore_bn_limit == -1 | |
1471 | && !bidi_explicit_dir_char (bidi_it->ch))) | |
1472 | bidi_it->ignore_bn_limit = 0; | |
1473 | ||
1474 | type = bidi_resolve_neutral (bidi_it); | |
1475 | ||
1476 | return type; | |
1477 | } | |
1478 | ||
1479 | /* Given an iterator state BIDI_IT, advance one character position in | |
1480 | the buffer to the next character (in the logical order), resolve | |
1481 | the embedding and implicit levels of that next character, and | |
1482 | return the resulting level. */ | |
1483 | int | |
1484 | bidi_level_of_next_char (struct bidi_it *bidi_it) | |
1485 | { | |
1486 | bidi_type_t type; | |
1487 | int level, prev_level = -1; | |
1488 | struct bidi_saved_info next_for_neutral; | |
1489 | ||
1490 | if (bidi_it->scan_dir == 1) | |
1491 | { | |
1492 | /* There's no sense in trying to advance if we hit end of text. */ | |
1493 | if (bidi_it->ch == BIDI_EOB) | |
1494 | return bidi_it->resolved_level; | |
1495 | ||
1496 | /* Record the info about the previous character. */ | |
89d3374a | 1497 | if (bidi_it->type_after_w1 != WEAK_BN /* W1/Retaining */ |
b7b65b15 EZ |
1498 | && bidi_it->type != WEAK_BN) |
1499 | bidi_remember_char (&bidi_it->prev, bidi_it); | |
89d3374a EZ |
1500 | if (bidi_it->type_after_w1 == STRONG_R |
1501 | || bidi_it->type_after_w1 == STRONG_L | |
1502 | || bidi_it->type_after_w1 == STRONG_AL) | |
b7b65b15 EZ |
1503 | bidi_remember_char (&bidi_it->last_strong, bidi_it); |
1504 | /* FIXME: it sounds like we don't need both prev and | |
1505 | prev_for_neutral members, but I'm leaving them both for now. */ | |
1506 | if (bidi_it->type == STRONG_R || bidi_it->type == STRONG_L | |
1507 | || bidi_it->type == WEAK_EN || bidi_it->type == WEAK_AN) | |
1508 | bidi_remember_char (&bidi_it->prev_for_neutral, bidi_it); | |
1509 | ||
1510 | /* If we overstepped the characters used for resolving neutrals | |
1511 | and whitespace, invalidate their info in the iterator. */ | |
1512 | if (bidi_it->charpos >= bidi_it->next_for_neutral.charpos) | |
1513 | bidi_it->next_for_neutral.type = UNKNOWN_BT; | |
1514 | if (bidi_it->next_en_pos >= 0 | |
1515 | && bidi_it->charpos >= bidi_it->next_en_pos) | |
1516 | bidi_it->next_en_pos = -1; | |
1517 | if (bidi_it->next_for_ws.type != UNKNOWN_BT | |
1518 | && bidi_it->charpos >= bidi_it->next_for_ws.charpos) | |
1519 | bidi_it->next_for_ws.type = UNKNOWN_BT; | |
1520 | ||
1521 | /* This must be taken before we fill the iterator with the info | |
1522 | about the next char. If we scan backwards, the iterator | |
1523 | state must be already cached, so there's no need to know the | |
1524 | embedding level of the previous character, since we will be | |
1525 | returning to our caller shortly. */ | |
1526 | prev_level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1527 | } | |
1528 | next_for_neutral = bidi_it->next_for_neutral; | |
1529 | ||
1530 | /* Perhaps it is already cached. */ | |
1531 | type = bidi_cache_find (bidi_it->charpos + bidi_it->scan_dir, -1, bidi_it); | |
1532 | if (type != UNKNOWN_BT) | |
1533 | { | |
1534 | /* Don't lose the information for resolving neutrals! The | |
1535 | cached states could have been cached before their | |
1536 | next_for_neutral member was computed. If we are on our way | |
1537 | forward, we can simply take the info from the previous | |
1538 | state. */ | |
1539 | if (bidi_it->scan_dir == 1 | |
1540 | && bidi_it->next_for_neutral.type == UNKNOWN_BT) | |
1541 | bidi_it->next_for_neutral = next_for_neutral; | |
1542 | ||
1543 | /* If resolved_level is -1, it means this state was cached | |
1544 | before it was completely resolved, so we cannot return | |
1545 | it. */ | |
1546 | if (bidi_it->resolved_level != -1) | |
1547 | return bidi_it->resolved_level; | |
1548 | } | |
1549 | if (bidi_it->scan_dir == -1) | |
1550 | /* If we are going backwards, the iterator state is already cached | |
1551 | from previous scans, and should be fully resolved. */ | |
1552 | abort (); | |
1553 | ||
1554 | if (type == UNKNOWN_BT) | |
1555 | type = bidi_type_of_next_char (bidi_it); | |
1556 | ||
1557 | if (type == NEUTRAL_B) | |
1558 | return bidi_it->resolved_level; | |
1559 | ||
1560 | level = bidi_it->level_stack[bidi_it->stack_idx].level; | |
1561 | if ((bidi_get_category (type) == NEUTRAL /* && type != NEUTRAL_B */) | |
1562 | || (type == WEAK_BN && prev_level == level)) | |
1563 | { | |
1564 | if (bidi_it->next_for_neutral.type == UNKNOWN_BT) | |
1565 | abort (); | |
1566 | ||
1567 | /* If the cached state shows a neutral character, it was not | |
1568 | resolved by bidi_resolve_neutral, so do it now. */ | |
1569 | type = bidi_resolve_neutral_1 (bidi_it->prev_for_neutral.type, | |
1570 | bidi_it->next_for_neutral.type, | |
1571 | level); | |
1572 | } | |
1573 | ||
1574 | if (!(type == STRONG_R | |
1575 | || type == STRONG_L | |
1576 | || type == WEAK_BN | |
1577 | || type == WEAK_EN | |
1578 | || type == WEAK_AN)) | |
1579 | abort (); | |
1580 | bidi_it->type = type; | |
2d6e4628 | 1581 | bidi_check_type (bidi_it->type); |
b7b65b15 EZ |
1582 | |
1583 | /* For L1 below, we need to know, for each WS character, whether | |
1584 | it belongs to a sequence of WS characters preceeding a newline | |
1585 | or a TAB or a paragraph separator. */ | |
89d3374a | 1586 | if (bidi_it->orig_type == NEUTRAL_WS |
b7b65b15 EZ |
1587 | && bidi_it->next_for_ws.type == UNKNOWN_BT) |
1588 | { | |
1589 | int ch; | |
1590 | int clen = bidi_it->ch_len; | |
1591 | int bpos = bidi_it->bytepos; | |
1592 | int cpos = bidi_it->charpos; | |
1593 | bidi_type_t chtype; | |
1594 | ||
1595 | do { | |
1596 | /*_fetch_multibyte_char_len = 1;*/ | |
e7402cb2 | 1597 | ch = bpos + clen >= ZV_BYTE ? BIDI_EOB : FETCH_CHAR (bpos + clen); |
b7b65b15 EZ |
1598 | bpos += clen; |
1599 | cpos++; | |
e7402cb2 EZ |
1600 | clen = (ch == BIDI_EOB ? 1 : CHAR_BYTES (ch)); |
1601 | if (ch == '\n' || ch == BIDI_EOB /* || ch == LINESEP_CHAR */) | |
b7b65b15 EZ |
1602 | chtype = NEUTRAL_B; |
1603 | else | |
1604 | chtype = bidi_get_type (ch); | |
1605 | } while (chtype == NEUTRAL_WS || chtype == WEAK_BN | |
1606 | || bidi_explicit_dir_char (ch)); /* L1/Retaining */ | |
1607 | bidi_it->next_for_ws.type = chtype; | |
2d6e4628 | 1608 | bidi_check_type (bidi_it->next_for_ws.type); |
b7b65b15 EZ |
1609 | bidi_it->next_for_ws.charpos = cpos; |
1610 | bidi_it->next_for_ws.bytepos = bpos; | |
1611 | } | |
1612 | ||
1613 | /* Resolve implicit levels, with a twist: PDFs get the embedding | |
1614 | level of the enbedding they terminate. See below for the | |
1615 | reason. */ | |
89d3374a | 1616 | if (bidi_it->orig_type == PDF |
b7b65b15 EZ |
1617 | /* Don't do this if this formatting code didn't change the |
1618 | embedding level due to invalid or empty embeddings. */ | |
1619 | && prev_level != level) | |
1620 | { | |
1621 | /* Don't look in UAX#9 for the reason for this: it's our own | |
1622 | private quirk. The reason is that we want the formatting | |
1623 | codes to be delivered so that they bracket the text of their | |
1624 | embedding. For example, given the text | |
1625 | ||
1626 | {RLO}teST{PDF} | |
1627 | ||
1628 | we want it to be displayed as | |
1629 | ||
1630 | {RLO}STet{PDF} | |
1631 | ||
1632 | not as | |
1633 | ||
1634 | STet{RLO}{PDF} | |
1635 | ||
1636 | which will result because we bump up the embedding level as | |
1637 | soon as we see the RLO and pop it as soon as we see the PDF, | |
1638 | so RLO itself has the same embedding level as "teST", and | |
1639 | thus would be normally delivered last, just before the PDF. | |
1640 | The switch below fiddles with the level of PDF so that this | |
1641 | ugly side effect does not happen. | |
1642 | ||
1643 | (This is, of course, only important if the formatting codes | |
e7402cb2 EZ |
1644 | are actually displayed, but Emacs does need to display them |
1645 | if the user wants to.) */ | |
b7b65b15 EZ |
1646 | level = prev_level; |
1647 | } | |
89d3374a EZ |
1648 | else if (bidi_it->orig_type == NEUTRAL_B /* L1 */ |
1649 | || bidi_it->orig_type == NEUTRAL_S | |
e7402cb2 EZ |
1650 | || bidi_it->ch == '\n' || bidi_it->ch == BIDI_EOB |
1651 | /* || bidi_it->ch == LINESEP_CHAR */ | |
89d3374a | 1652 | || (bidi_it->orig_type == NEUTRAL_WS |
b7b65b15 EZ |
1653 | && (bidi_it->next_for_ws.type == NEUTRAL_B |
1654 | || bidi_it->next_for_ws.type == NEUTRAL_S))) | |
1655 | level = bidi_it->level_stack[0].level; | |
1656 | else if ((level & 1) == 0) /* I1 */ | |
1657 | { | |
1658 | if (type == STRONG_R) | |
1659 | level++; | |
1660 | else if (type == WEAK_EN || type == WEAK_AN) | |
1661 | level += 2; | |
1662 | } | |
1663 | else /* I2 */ | |
1664 | { | |
1665 | if (type == STRONG_L || type == WEAK_EN || type == WEAK_AN) | |
1666 | level++; | |
1667 | } | |
1668 | ||
1669 | bidi_it->resolved_level = level; | |
1670 | return level; | |
1671 | } | |
1672 | ||
1673 | /* Move to the other edge of a level given by LEVEL. If END_FLAG is | |
1674 | non-zero, we are at the end of a level, and we need to prepare to | |
1675 | resume the scan of the lower level. | |
1676 | ||
1677 | If this level's other edge is cached, we simply jump to it, filling | |
1678 | the iterator structure with the iterator state on the other edge. | |
1679 | Otherwise, we walk the buffer until we come back to the same level | |
1680 | as LEVEL. | |
1681 | ||
1682 | Note: we are not talking here about a ``level run'' in the UAX#9 | |
1683 | sense of the term, but rather about a ``level'' which includes | |
1684 | all the levels higher than it. In other words, given the levels | |
1685 | like this: | |
1686 | ||
1687 | 11111112222222333333334443343222222111111112223322111 | |
1688 | A B C | |
1689 | ||
1690 | and assuming we are at point A scanning left to right, this | |
1691 | function moves to point C, whereas the UAX#9 ``level 2 run'' ends | |
1692 | at point B. */ | |
1693 | static void | |
1694 | bidi_find_other_level_edge (struct bidi_it *bidi_it, int level, int end_flag) | |
1695 | { | |
1696 | int dir = end_flag ? -bidi_it->scan_dir : bidi_it->scan_dir; | |
1697 | int idx; | |
1698 | ||
1699 | /* Try the cache first. */ | |
1700 | if ((idx = bidi_cache_find_level_change (level, dir, end_flag)) >= 0) | |
1701 | bidi_cache_fetch_state (idx, bidi_it); | |
1702 | else | |
1703 | { | |
1704 | int new_level; | |
1705 | ||
1706 | if (end_flag) | |
1707 | abort (); /* if we are at end of level, its edges must be cached */ | |
1708 | ||
1709 | bidi_cache_iterator_state (bidi_it, 1); | |
1710 | do { | |
1711 | new_level = bidi_level_of_next_char (bidi_it); | |
1712 | bidi_cache_iterator_state (bidi_it, 1); | |
1713 | } while (new_level >= level); | |
1714 | } | |
1715 | } | |
1716 | ||
1717 | void | |
1718 | bidi_get_next_char_visually (struct bidi_it *bidi_it) | |
1719 | { | |
1720 | int old_level, new_level, next_level; | |
9c82e145 | 1721 | struct bidi_it sentinel; |
b7b65b15 EZ |
1722 | |
1723 | if (bidi_it->scan_dir == 0) | |
1724 | { | |
1725 | bidi_it->scan_dir = 1; /* default to logical order */ | |
1726 | } | |
1727 | ||
1728 | if (bidi_it->new_paragraph) | |
1729 | bidi_paragraph_init (bidi_overriding_paragraph_direction, bidi_it); | |
9c82e145 | 1730 | /* Prepare the sentinel iterator state. */ |
b7b65b15 | 1731 | if (bidi_cache_idx == 0) |
9c82e145 EZ |
1732 | { |
1733 | bidi_copy_it (&sentinel, bidi_it); | |
1734 | if (bidi_it->first_elt) | |
1735 | { | |
1736 | sentinel.charpos--; /* cached charpos needs to be monotonic */ | |
1737 | sentinel.bytepos--; | |
1738 | sentinel.ch = '\n'; /* doesn't matter, but why not? */ | |
1739 | sentinel.ch_len = 1; | |
1740 | } | |
1741 | } | |
b7b65b15 EZ |
1742 | |
1743 | old_level = bidi_it->resolved_level; | |
1744 | new_level = bidi_level_of_next_char (bidi_it); | |
1745 | if (bidi_it->ch == BIDI_EOB) | |
1746 | return; | |
1747 | ||
1748 | /* Reordering of resolved levels (clause L2) is implemented by | |
1749 | jumping to the other edge of the level and flipping direction of | |
1750 | scanning the buffer whenever we find a level change. */ | |
1751 | if (new_level != old_level) | |
1752 | { | |
1753 | int ascending = new_level > old_level; | |
1754 | int level_to_search = ascending ? old_level + 1 : old_level; | |
1755 | int incr = ascending ? 1 : -1; | |
1756 | int expected_next_level = old_level + incr; | |
1757 | ||
1758 | /* If we don't have anything cached yet, we need to cache the | |
9c82e145 EZ |
1759 | sentinel state, since we'll need it to record where to jump |
1760 | when the last non-base level is exhausted. */ | |
b7b65b15 | 1761 | if (bidi_cache_idx == 0) |
9c82e145 | 1762 | bidi_cache_iterator_state (&sentinel, 1); |
b7b65b15 EZ |
1763 | /* Jump (or walk) to the other edge of this level. */ |
1764 | bidi_find_other_level_edge (bidi_it, level_to_search, !ascending); | |
1765 | /* Switch scan direction and peek at the next character in the | |
1766 | new direction. */ | |
1767 | bidi_it->scan_dir = -bidi_it->scan_dir; | |
1768 | ||
1769 | /* The following loop handles the case where the resolved level | |
1770 | jumps by more than one. This is typical for numbers inside a | |
1771 | run of text with left-to-right embedding direction, but can | |
1772 | also happen in other situations. In those cases the decision | |
1773 | where to continue after a level change, and in what direction, | |
1774 | is tricky. For example, given a text like below: | |
1775 | ||
1776 | abcdefgh | |
1777 | 11336622 | |
1778 | ||
1779 | (where the numbers below the text show the resolved levels), | |
1780 | the result of reordering according to UAX#9 should be this: | |
1781 | ||
1782 | efdcghba | |
1783 | ||
1784 | This is implemented by the loop below which flips direction | |
1785 | and jumps to the other edge of the level each time it finds | |
1786 | the new level not to be the expected one. The expected level | |
1787 | is always one more or one less than the previous one. */ | |
1788 | next_level = bidi_peek_at_next_level (bidi_it); | |
1789 | while (next_level != expected_next_level) | |
1790 | { | |
1791 | expected_next_level += incr; | |
1792 | level_to_search += incr; | |
1793 | bidi_find_other_level_edge (bidi_it, level_to_search, !ascending); | |
1794 | bidi_it->scan_dir = -bidi_it->scan_dir; | |
1795 | next_level = bidi_peek_at_next_level (bidi_it); | |
1796 | } | |
1797 | ||
1798 | /* Finally, deliver the next character in the new direction. */ | |
1799 | next_level = bidi_level_of_next_char (bidi_it); | |
1800 | } | |
1801 | ||
1802 | if (bidi_it->scan_dir == 1 && bidi_cache_idx) | |
1803 | { | |
1804 | /* If we are at paragraph's base embedding level and beyond the | |
1805 | last cached position, the cache's job is done and we can | |
1806 | discard it. */ | |
1807 | if (bidi_it->resolved_level == bidi_it->level_stack[0].level | |
1808 | && bidi_it->charpos > bidi_cache[bidi_cache_idx - 1].charpos) | |
1809 | bidi_cache_reset (); | |
1810 | /* But as long as we are caching during forward scan, we must | |
1811 | cache each state, or else the cache integrity will be | |
1812 | compromised: it assumes cached states correspond to buffer | |
1813 | positions 1:1. */ | |
1814 | else | |
1815 | bidi_cache_iterator_state (bidi_it, 1); | |
1816 | } | |
1817 | } | |
1818 | ||
1819 | /* This is meant to be called from within the debugger, whenever you | |
1820 | wish to examine the cache contents. */ | |
1821 | void | |
1822 | bidi_dump_cached_states (void) | |
1823 | { | |
1824 | int i; | |
1825 | int ndigits = 1; | |
1826 | ||
1827 | if (bidi_cache_idx == 0) | |
1828 | { | |
1829 | fprintf (stderr, "The cache is empty.\n"); | |
1830 | return; | |
1831 | } | |
1832 | fprintf (stderr, "Total of %d state%s in cache:\n", | |
1833 | bidi_cache_idx, bidi_cache_idx == 1 ? "" : "s"); | |
1834 | ||
1835 | for (i = bidi_cache[bidi_cache_idx - 1].charpos; i > 0; i /= 10) | |
1836 | ndigits++; | |
1837 | fputs ("ch ", stderr); | |
1838 | for (i = 0; i < bidi_cache_idx; i++) | |
1839 | fprintf (stderr, "%*c", ndigits, bidi_cache[i].ch); | |
1840 | fputs ("\n", stderr); | |
1841 | fputs ("lvl ", stderr); | |
1842 | for (i = 0; i < bidi_cache_idx; i++) | |
1843 | fprintf (stderr, "%*d", ndigits, bidi_cache[i].resolved_level); | |
1844 | fputs ("\n", stderr); | |
1845 | fputs ("pos ", stderr); | |
1846 | for (i = 0; i < bidi_cache_idx; i++) | |
1847 | fprintf (stderr, "%*d", ndigits, bidi_cache[i].charpos); | |
1848 | fputs ("\n", stderr); | |
1849 | } |