Commit | Line | Data |
---|---|---|
ca4c9455 | 1 | /* Composite sequence support. |
73b0cd50 | 2 | Copyright (C) 2001-2011 Free Software Foundation, Inc. |
5df4f04c | 3 | Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 |
ce03bf76 KH |
4 | National Institute of Advanced Industrial Science and Technology (AIST) |
5 | Registration Number H14PRO021 | |
f30d8d94 | 6 | Copyright (C) 2003, 2006 |
1527c36e KH |
7 | National Institute of Advanced Industrial Science and Technology (AIST) |
8 | Registration Number H13PRO009 | |
ca4c9455 KH |
9 | |
10 | This file is part of GNU Emacs. | |
11 | ||
9ec0b715 | 12 | GNU Emacs is free software: you can redistribute it and/or modify |
ca4c9455 | 13 | it under the terms of the GNU General Public License as published by |
9ec0b715 GM |
14 | the Free Software Foundation, either version 3 of the License, or |
15 | (at your option) any later version. | |
ca4c9455 KH |
16 | |
17 | GNU Emacs is distributed in the hope that it will be useful, | |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
20 | GNU General Public License for more details. | |
21 | ||
22 | You should have received a copy of the GNU General Public License | |
9ec0b715 | 23 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
ca4c9455 KH |
24 | |
25 | #include <config.h> | |
d7306fe6 | 26 | #include <setjmp.h> |
ca4c9455 KH |
27 | #include "lisp.h" |
28 | #include "buffer.h" | |
1527c36e | 29 | #include "character.h" |
f5199465 | 30 | #include "coding.h" |
ca4c9455 | 31 | #include "intervals.h" |
58753d74 KH |
32 | #include "window.h" |
33 | #include "frame.h" | |
34 | #include "dispextern.h" | |
35 | #include "font.h" | |
f5199465 KH |
36 | #include "termhooks.h" |
37 | ||
ca4c9455 KH |
38 | |
39 | /* Emacs uses special text property `composition' to support character | |
40 | composition. A sequence of characters that have the same (i.e. eq) | |
41 | `composition' property value is treated as a single composite | |
42 | sequence (we call it just `composition' here after). Characters in | |
43 | a composition are all composed somehow on the screen. | |
44 | ||
45 | The property value has this form when the composition is made: | |
46 | ((LENGTH . COMPONENTS) . MODIFICATION-FUNC) | |
47 | then turns to this form: | |
48 | (COMPOSITION-ID . (LENGTH COMPONENTS-VEC . MODIFICATION-FUNC)) | |
49 | when the composition is registered in composition_hash_table and | |
50 | composition_table. These rather peculiar structures were designed | |
51 | to make it easy to distinguish them quickly (we can do that by | |
52 | checking only the first element) and to extract LENGTH (from the | |
53 | former form) and COMPOSITION-ID (from the latter form). | |
54 | ||
55 | We register a composition when it is displayed, or when the width | |
56 | is required (for instance, to calculate columns). | |
57 | ||
58 | LENGTH -- Length of the composition. This information is used to | |
59 | check the validity of the composition. | |
60 | ||
61 | COMPONENTS -- Character, string, vector, list, or nil. | |
62 | ||
63 | If it is nil, characters in the text are composed relatively | |
64 | according to their metrics in font glyphs. | |
65 | ||
66 | If it is a character or a string, the character or characters | |
67 | in the string are composed relatively. | |
68 | ||
69 | If it is a vector or list of integers, the element is a | |
70 | character or an encoded composition rule. The characters are | |
71 | composed according to the rules. (2N)th elements are | |
72 | characters to be composed and (2N+1)th elements are | |
73 | composition rules to tell how to compose (2N+2)th element with | |
74 | the previously composed 2N glyphs. | |
75 | ||
763d7377 EZ |
76 | COMPONENTS-VEC -- Vector of integers. In a relative composition, |
77 | the elements are the characters to be composed. In a rule-base | |
ca4c9455 KH |
78 | composition, the elements are characters or encoded |
79 | composition rules. | |
80 | ||
81 | MODIFICATION-FUNC -- If non nil, it is a function to call when the | |
82 | composition gets invalid after a modification in a buffer. If | |
83 | it is nil, a function in `composition-function-table' of the | |
84 | first character in the sequence is called. | |
85 | ||
86 | COMPOSITION-ID --Identification number of the composition. It is | |
87 | used as an index to composition_table for the composition. | |
88 | ||
89 | When Emacs has to display a composition or has to know its | |
90 | displaying width, the function get_composition_id is called. It | |
91 | returns COMPOSITION-ID so that the caller can access the | |
92 | information about the composition through composition_table. If a | |
93 | COMPOSITION-ID has not yet been assigned to the composition, | |
94 | get_composition_id checks the validity of `composition' property, | |
95 | and, if valid, assigns a new ID, registers the information in | |
96 | composition_hash_table and composition_table, and changes the form | |
763d7377 EZ |
97 | of the property value. If the property is invalid, |
98 | get_composition_id returns -1 without changing the property value. | |
ca4c9455 | 99 | |
763d7377 | 100 | We use two tables to keep the information about composition; |
ca4c9455 KH |
101 | composition_hash_table and composition_table. |
102 | ||
763d7377 | 103 | The former is a hash table whose keys are COMPONENTS-VECs and |
ca4c9455 | 104 | values are the corresponding COMPOSITION-IDs. This hash table is |
4abc7470 | 105 | weak, but as each key (COMPONENTS-VEC) is also kept as a value of the |
ca4c9455 | 106 | `composition' property, it won't be collected as garbage until all |
4abc7470 | 107 | bits of text that have the same COMPONENTS-VEC are deleted. |
ca4c9455 KH |
108 | |
109 | The latter is a table of pointers to `struct composition' indexed | |
4abc7470 | 110 | by COMPOSITION-ID. This structure keeps the other information (see |
ca4c9455 KH |
111 | composite.h). |
112 | ||
113 | In general, a text property holds information about individual | |
114 | characters. But, a `composition' property holds information about | |
4abc7470 | 115 | a sequence of characters (in this sense, it is like the `intangible' |
ca4c9455 | 116 | property). That means that we should not share the property value |
4abc7470 | 117 | in adjacent compositions -- we can't distinguish them if they have the |
ca4c9455 KH |
118 | same property. So, after any changes, we call |
119 | `update_compositions' and change a property of one of adjacent | |
120 | compositions to a copy of it. This function also runs a proper | |
121 | composition modification function to make a composition that gets | |
122 | invalid by the change valid again. | |
123 | ||
4abc7470 | 124 | As the value of the `composition' property holds information about a |
ca4c9455 | 125 | specific range of text, the value gets invalid if we change the |
4abc7470 | 126 | text in the range. We treat the `composition' property as always |
ca4c9455 KH |
127 | rear-nonsticky (currently by setting default-text-properties to |
128 | (rear-nonsticky (composition))) and we never make properties of | |
129 | adjacent compositions identical. Thus, any such changes make the | |
4abc7470 | 130 | range just shorter. So, we can check the validity of the `composition' |
ca4c9455 KH |
131 | property by comparing LENGTH information with the actual length of |
132 | the composition. | |
133 | ||
134 | */ | |
135 | ||
136 | ||
137 | Lisp_Object Qcomposition; | |
138 | ||
139 | /* Table of pointers to the structure `composition' indexed by | |
140 | COMPOSITION-ID. This structure is for storing information about | |
141 | each composition except for COMPONENTS-VEC. */ | |
142 | struct composition **composition_table; | |
143 | ||
144 | /* The current size of `composition_table'. */ | |
ebfa62c0 | 145 | static ptrdiff_t composition_table_size; |
ca4c9455 KH |
146 | |
147 | /* Number of compositions currently made. */ | |
ebfa62c0 | 148 | ptrdiff_t n_compositions; |
ca4c9455 KH |
149 | |
150 | /* Hash table for compositions. The key is COMPONENTS-VEC of | |
151 | `composition' property. The value is the corresponding | |
152 | COMPOSITION-ID. */ | |
153 | Lisp_Object composition_hash_table; | |
154 | ||
955cbe7b PE |
155 | static Lisp_Object Qauto_composed; |
156 | static Lisp_Object Qauto_composition_function; | |
763d7377 EZ |
157 | /* Maximum number of characters to look back for |
158 | auto-compositions. */ | |
895416e3 KH |
159 | #define MAX_AUTO_COMPOSITION_LOOKBACK 3 |
160 | ||
cd64ea1d PE |
161 | static Lisp_Object Fcomposition_get_gstring (Lisp_Object, Lisp_Object, |
162 | Lisp_Object, Lisp_Object); | |
ea058d2c | 163 | |
ca4c9455 KH |
164 | /* Temporary variable used in macros COMPOSITION_XXX. */ |
165 | Lisp_Object composition_temp; | |
f30d8d94 | 166 | |
ca4c9455 | 167 | \f |
ca4c9455 KH |
168 | /* Return COMPOSITION-ID of a composition at buffer position |
169 | CHARPOS/BYTEPOS and length NCHARS. The `composition' property of | |
170 | the sequence is PROP. STRING, if non-nil, is a string that | |
171 | contains the composition instead of the current buffer. | |
172 | ||
173 | If the composition is invalid, return -1. */ | |
174 | ||
ebfa62c0 | 175 | ptrdiff_t |
579c18d0 EZ |
176 | get_composition_id (EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT nchars, |
177 | Lisp_Object prop, Lisp_Object string) | |
ca4c9455 KH |
178 | { |
179 | Lisp_Object id, length, components, key, *key_contents; | |
d86d0d74 | 180 | ptrdiff_t glyph_len; |
ca4c9455 | 181 | struct Lisp_Hash_Table *hash_table = XHASH_TABLE (composition_hash_table); |
d3411f89 | 182 | ptrdiff_t hash_index; |
0de4bb68 | 183 | EMACS_UINT hash_code; |
d86d0d74 | 184 | enum composition_method method; |
ca4c9455 | 185 | struct composition *cmp; |
579c18d0 EZ |
186 | EMACS_INT i; |
187 | int ch; | |
ca4c9455 | 188 | |
0065d054 PE |
189 | /* Maximum length of a string of glyphs. XftGlyphExtents limits |
190 | this to INT_MAX, and Emacs limits it further. Divide INT_MAX - 1 | |
191 | by 2 because x_produce_glyphs computes glyph_len * 2 + 1. Divide | |
192 | the size by MAX_MULTIBYTE_LENGTH because encode_terminal_code | |
193 | multiplies glyph_len by MAX_MULTIBYTE_LENGTH. */ | |
d86d0d74 | 194 | enum { |
0065d054 PE |
195 | GLYPH_LEN_MAX = min ((INT_MAX - 1) / 2, |
196 | min (PTRDIFF_MAX, SIZE_MAX) / MAX_MULTIBYTE_LENGTH) | |
d86d0d74 PE |
197 | }; |
198 | ||
ca4c9455 KH |
199 | /* PROP should be |
200 | Form-A: ((LENGTH . COMPONENTS) . MODIFICATION-FUNC) | |
201 | or | |
202 | Form-B: (COMPOSITION-ID . (LENGTH COMPONENTS-VEC . MODIFICATION-FUNC)) | |
203 | */ | |
204 | if (nchars == 0 || !CONSP (prop)) | |
205 | goto invalid_composition; | |
206 | ||
207 | id = XCAR (prop); | |
208 | if (INTEGERP (id)) | |
209 | { | |
210 | /* PROP should be Form-B. */ | |
211 | if (XINT (id) < 0 || XINT (id) >= n_compositions) | |
212 | goto invalid_composition; | |
213 | return XINT (id); | |
214 | } | |
215 | ||
216 | /* PROP should be Form-A. | |
217 | Thus, ID should be (LENGTH . COMPONENTS). */ | |
218 | if (!CONSP (id)) | |
219 | goto invalid_composition; | |
220 | length = XCAR (id); | |
221 | if (!INTEGERP (length) || XINT (length) != nchars) | |
222 | goto invalid_composition; | |
223 | ||
224 | components = XCDR (id); | |
225 | ||
226 | /* Check if the same composition has already been registered or not | |
227 | by consulting composition_hash_table. The key for this table is | |
228 | COMPONENTS (converted to a vector COMPONENTS-VEC) or, if it is | |
229 | nil, vector of characters in the composition range. */ | |
230 | if (INTEGERP (components)) | |
231 | key = Fmake_vector (make_number (1), components); | |
232 | else if (STRINGP (components) || CONSP (components)) | |
233 | key = Fvconcat (1, &components); | |
234 | else if (VECTORP (components)) | |
235 | key = components; | |
236 | else if (NILP (components)) | |
237 | { | |
238 | key = Fmake_vector (make_number (nchars), Qnil); | |
239 | if (STRINGP (string)) | |
240 | for (i = 0; i < nchars; i++) | |
241 | { | |
242 | FETCH_STRING_CHAR_ADVANCE (ch, string, charpos, bytepos); | |
243 | XVECTOR (key)->contents[i] = make_number (ch); | |
244 | } | |
245 | else | |
246 | for (i = 0; i < nchars; i++) | |
247 | { | |
248 | FETCH_CHAR_ADVANCE (ch, charpos, bytepos); | |
249 | XVECTOR (key)->contents[i] = make_number (ch); | |
250 | } | |
251 | } | |
252 | else | |
253 | goto invalid_composition; | |
254 | ||
255 | hash_index = hash_lookup (hash_table, key, &hash_code); | |
256 | if (hash_index >= 0) | |
257 | { | |
258 | /* We have already registered the same composition. Change PROP | |
259 | from Form-A above to Form-B while replacing COMPONENTS with | |
260 | COMPONENTS-VEC stored in the hash table. We can directly | |
261 | modify the cons cell of PROP because it is not shared. */ | |
262 | key = HASH_KEY (hash_table, hash_index); | |
263 | id = HASH_VALUE (hash_table, hash_index); | |
f3fbd155 KR |
264 | XSETCAR (prop, id); |
265 | XSETCDR (prop, Fcons (make_number (nchars), Fcons (key, XCDR (prop)))); | |
ca4c9455 KH |
266 | return XINT (id); |
267 | } | |
268 | ||
269 | /* This composition is a new one. We must register it. */ | |
177c0ea7 | 270 | |
ca4c9455 | 271 | /* Check if we have sufficient memory to store this information. */ |
0065d054 PE |
272 | if (composition_table_size <= n_compositions) |
273 | composition_table = xpalloc (composition_table, &composition_table_size, | |
274 | 1, -1, sizeof *composition_table); | |
ca4c9455 KH |
275 | |
276 | key_contents = XVECTOR (key)->contents; | |
277 | ||
278 | /* Check if the contents of COMPONENTS are valid if COMPONENTS is a | |
279 | vector or a list. It should be a sequence of: | |
280 | char1 rule1 char2 rule2 char3 ... ruleN charN+1 */ | |
f30d8d94 | 281 | |
dd5e1ed4 | 282 | if (VECTORP (components) |
f30d8d94 KH |
283 | && ASIZE (components) >= 2 |
284 | && VECTORP (AREF (components, 0))) | |
285 | { | |
286 | /* COMPONENTS is a glyph-string. */ | |
7d100a81 | 287 | EMACS_INT len = ASIZE (key); |
f30d8d94 KH |
288 | |
289 | for (i = 1; i < len; i++) | |
290 | if (! VECTORP (AREF (key, i))) | |
291 | goto invalid_composition; | |
292 | } | |
dd5e1ed4 | 293 | else if (VECTORP (components) || CONSP (components)) |
ca4c9455 | 294 | { |
7d100a81 | 295 | EMACS_INT len = ASIZE (key); |
ca4c9455 KH |
296 | |
297 | /* The number of elements should be odd. */ | |
298 | if ((len % 2) == 0) | |
299 | goto invalid_composition; | |
300 | /* All elements should be integers (character or encoded | |
301 | composition rule). */ | |
302 | for (i = 0; i < len; i++) | |
303 | { | |
304 | if (!INTEGERP (key_contents[i])) | |
305 | goto invalid_composition; | |
306 | } | |
307 | } | |
308 | ||
309 | /* Change PROP from Form-A above to Form-B. We can directly modify | |
310 | the cons cell of PROP because it is not shared. */ | |
311 | XSETFASTINT (id, n_compositions); | |
f3fbd155 KR |
312 | XSETCAR (prop, id); |
313 | XSETCDR (prop, Fcons (make_number (nchars), Fcons (key, XCDR (prop)))); | |
ca4c9455 KH |
314 | |
315 | /* Register the composition in composition_hash_table. */ | |
316 | hash_index = hash_put (hash_table, key, id, hash_code); | |
317 | ||
d86d0d74 PE |
318 | method = (NILP (components) |
319 | ? COMPOSITION_RELATIVE | |
320 | : ((INTEGERP (components) || STRINGP (components)) | |
321 | ? COMPOSITION_WITH_ALTCHARS | |
322 | : COMPOSITION_WITH_RULE_ALTCHARS)); | |
323 | ||
324 | glyph_len = (method == COMPOSITION_WITH_RULE_ALTCHARS | |
325 | ? (ASIZE (key) + 1) / 2 | |
326 | : ASIZE (key)); | |
327 | ||
0065d054 | 328 | if (GLYPH_LEN_MAX < glyph_len) |
d86d0d74 PE |
329 | memory_full (SIZE_MAX); |
330 | ||
ca4c9455 KH |
331 | /* Register the composition in composition_table. */ |
332 | cmp = (struct composition *) xmalloc (sizeof (struct composition)); | |
333 | ||
d86d0d74 | 334 | cmp->method = method; |
ca4c9455 | 335 | cmp->hash_index = hash_index; |
ca4c9455 | 336 | cmp->glyph_len = glyph_len; |
0065d054 | 337 | cmp->offsets = xnmalloc (glyph_len, 2 * sizeof *cmp->offsets); |
ca4c9455 KH |
338 | cmp->font = NULL; |
339 | ||
58753d74 | 340 | if (cmp->method != COMPOSITION_WITH_RULE_ALTCHARS) |
ca4c9455 KH |
341 | { |
342 | /* Relative composition. */ | |
343 | cmp->width = 0; | |
344 | for (i = 0; i < glyph_len; i++) | |
345 | { | |
346 | int this_width; | |
347 | ch = XINT (key_contents[i]); | |
8e86803c | 348 | this_width = (ch == '\t' ? 1 : CHAR_WIDTH (ch)); |
ca4c9455 KH |
349 | if (cmp->width < this_width) |
350 | cmp->width = this_width; | |
351 | } | |
352 | } | |
353 | else | |
354 | { | |
355 | /* Rule-base composition. */ | |
356 | float leftmost = 0.0, rightmost; | |
357 | ||
358 | ch = XINT (key_contents[0]); | |
69df789a | 359 | rightmost = ch != '\t' ? CHAR_WIDTH (ch) : 1; |
ca4c9455 KH |
360 | |
361 | for (i = 1; i < glyph_len; i += 2) | |
362 | { | |
b13a45c6 | 363 | int rule, gref, nref; |
ca4c9455 KH |
364 | int this_width; |
365 | float this_left; | |
366 | ||
367 | rule = XINT (key_contents[i]); | |
368 | ch = XINT (key_contents[i + 1]); | |
69df789a | 369 | this_width = ch != '\t' ? CHAR_WIDTH (ch) : 1; |
ca4c9455 KH |
370 | |
371 | /* A composition rule is specified by an integer value | |
372 | that encodes global and new reference points (GREF and | |
373 | NREF). GREF and NREF are specified by numbers as | |
374 | below: | |
375 | 0---1---2 -- ascent | |
376 | | | | |
377 | | | | |
378 | | | | |
379 | 9--10--11 -- center | |
380 | | | | |
381 | ---3---4---5--- baseline | |
382 | | | | |
383 | 6---7---8 -- descent | |
384 | */ | |
b13a45c6 | 385 | COMPOSITION_DECODE_REFS (rule, gref, nref); |
ca4c9455 KH |
386 | this_left = (leftmost |
387 | + (gref % 3) * (rightmost - leftmost) / 2.0 | |
388 | - (nref % 3) * this_width / 2.0); | |
389 | ||
390 | if (this_left < leftmost) | |
391 | leftmost = this_left; | |
392 | if (this_left + this_width > rightmost) | |
393 | rightmost = this_left + this_width; | |
394 | } | |
395 | ||
396 | cmp->width = rightmost - leftmost; | |
397 | if (cmp->width < (rightmost - leftmost)) | |
398 | /* To get a ceiling integer value. */ | |
399 | cmp->width++; | |
400 | } | |
401 | ||
402 | composition_table[n_compositions] = cmp; | |
403 | ||
404 | return n_compositions++; | |
405 | ||
406 | invalid_composition: | |
407 | /* Would it be better to remove this `composition' property? */ | |
408 | return -1; | |
409 | } | |
410 | ||
411 | \f | |
90b3fe91 KH |
412 | /* Find a static composition at or nearest to position POS of OBJECT |
413 | (buffer or string). | |
ca4c9455 KH |
414 | |
415 | OBJECT defaults to the current buffer. If there's a composition at | |
416 | POS, set *START and *END to the start and end of the sequence, | |
417 | *PROP to the `composition' property, and return 1. | |
418 | ||
419 | If there's no composition at POS and LIMIT is negative, return 0. | |
420 | ||
421 | Otherwise, search for a composition forward (LIMIT > POS) or | |
422 | backward (LIMIT < POS). In this case, LIMIT bounds the search. | |
423 | ||
424 | If a composition is found, set *START, *END, and *PROP as above, | |
425 | and return 1, else return 0. | |
426 | ||
427 | This doesn't check the validity of composition. */ | |
428 | ||
429 | int | |
579c18d0 EZ |
430 | find_composition (EMACS_INT pos, EMACS_INT limit, |
431 | EMACS_INT *start, EMACS_INT *end, | |
432 | Lisp_Object *prop, Lisp_Object object) | |
ca4c9455 KH |
433 | { |
434 | Lisp_Object val; | |
435 | ||
436 | if (get_property_and_range (pos, Qcomposition, prop, start, end, object)) | |
437 | return 1; | |
438 | ||
439 | if (limit < 0 || limit == pos) | |
440 | return 0; | |
441 | ||
442 | if (limit > pos) /* search forward */ | |
d279f620 KH |
443 | { |
444 | val = Fnext_single_property_change (make_number (pos), Qcomposition, | |
445 | object, make_number (limit)); | |
446 | pos = XINT (val); | |
447 | if (pos == limit) | |
448 | return 0; | |
449 | } | |
ca4c9455 | 450 | else /* search backward */ |
d279f620 KH |
451 | { |
452 | if (get_property_and_range (pos - 1, Qcomposition, prop, start, end, | |
453 | object)) | |
454 | return 1; | |
455 | val = Fprevious_single_property_change (make_number (pos), Qcomposition, | |
456 | object, make_number (limit)); | |
457 | pos = XINT (val); | |
458 | if (pos == limit) | |
459 | return 0; | |
460 | pos--; | |
461 | } | |
ca4c9455 KH |
462 | get_property_and_range (pos, Qcomposition, prop, start, end, object); |
463 | return 1; | |
464 | } | |
465 | ||
466 | /* Run a proper function to adjust the composition sitting between | |
467 | FROM and TO with property PROP. */ | |
468 | ||
469 | static void | |
579c18d0 | 470 | run_composition_function (EMACS_INT from, EMACS_INT to, Lisp_Object prop) |
ca4c9455 | 471 | { |
7d019510 | 472 | Lisp_Object func; |
aaefca97 | 473 | EMACS_INT start, end; |
ca4c9455 KH |
474 | |
475 | func = COMPOSITION_MODIFICATION_FUNC (prop); | |
476 | /* If an invalid composition precedes or follows, try to make them | |
477 | valid too. */ | |
478 | if (from > BEGV | |
479 | && find_composition (from - 1, -1, &start, &end, &prop, Qnil) | |
480 | && !COMPOSITION_VALID_P (start, end, prop)) | |
481 | from = start; | |
482 | if (to < ZV | |
483 | && find_composition (to, -1, &start, &end, &prop, Qnil) | |
484 | && !COMPOSITION_VALID_P (start, end, prop)) | |
485 | to = end; | |
775b3d2d | 486 | if (!NILP (Ffboundp (func))) |
ca4c9455 | 487 | call2 (func, make_number (from), make_number (to)); |
ca4c9455 KH |
488 | } |
489 | ||
490 | /* Make invalid compositions adjacent to or inside FROM and TO valid. | |
491 | CHECK_MASK is bitwise `or' of mask bits defined by macros | |
492 | CHECK_XXX (see the comment in composite.h). | |
493 | ||
b418f8a6 | 494 | It also resets the text-property `auto-composed' to a proper region |
f96ba4c1 KH |
495 | so that automatic character composition works correctly later while |
496 | displaying the region. | |
8f924df7 | 497 | |
ca4c9455 KH |
498 | This function is called when a buffer text is changed. If the |
499 | change is deletion, FROM == TO. Otherwise, FROM < TO. */ | |
500 | ||
501 | void | |
971de7fb | 502 | update_compositions (EMACS_INT from, EMACS_INT to, int check_mask) |
ca4c9455 | 503 | { |
7d019510 | 504 | Lisp_Object prop; |
aaefca97 | 505 | EMACS_INT start, end; |
f96ba4c1 KH |
506 | /* The beginning and end of the region to set the property |
507 | `auto-composed' to nil. */ | |
aaefca97 | 508 | EMACS_INT min_pos = from, max_pos = to; |
ca4c9455 | 509 | |
6c1aa7f1 GM |
510 | if (inhibit_modification_hooks) |
511 | return; | |
177c0ea7 | 512 | |
d3f40cbd KH |
513 | /* If FROM and TO are not in a valid range, do nothing. */ |
514 | if (! (BEGV <= from && from <= to && to <= ZV)) | |
515 | return; | |
516 | ||
ca4c9455 KH |
517 | if (check_mask & CHECK_HEAD) |
518 | { | |
519 | /* FROM should be at composition boundary. But, insertion or | |
520 | deletion will make two compositions adjacent and | |
521 | indistinguishable when they have same (eq) property. To | |
522 | avoid it, in such a case, we change the property of the | |
523 | latter to the copy of it. */ | |
524 | if (from > BEGV | |
553d3164 KH |
525 | && find_composition (from - 1, -1, &start, &end, &prop, Qnil) |
526 | && COMPOSITION_VALID_P (start, end, prop)) | |
ca4c9455 | 527 | { |
f96ba4c1 KH |
528 | min_pos = start; |
529 | if (end > to) | |
530 | max_pos = end; | |
ca4c9455 KH |
531 | if (from < end) |
532 | Fput_text_property (make_number (from), make_number (end), | |
533 | Qcomposition, | |
534 | Fcons (XCAR (prop), XCDR (prop)), Qnil); | |
535 | run_composition_function (start, end, prop); | |
536 | from = end; | |
537 | } | |
dd33cc56 | 538 | else if (from < ZV |
553d3164 | 539 | && find_composition (from, -1, &start, &from, &prop, Qnil) |
9657d668 | 540 | && COMPOSITION_VALID_P (start, from, prop)) |
f96ba4c1 KH |
541 | { |
542 | if (from > to) | |
543 | max_pos = from; | |
544 | run_composition_function (start, from, prop); | |
545 | } | |
ca4c9455 KH |
546 | } |
547 | ||
548 | if (check_mask & CHECK_INSIDE) | |
549 | { | |
550 | /* In this case, we are sure that (check & CHECK_TAIL) is also | |
551 | nonzero. Thus, here we should check only compositions before | |
552 | (to - 1). */ | |
553 | while (from < to - 1 | |
554 | && find_composition (from, to, &start, &from, &prop, Qnil) | |
9657d668 | 555 | && COMPOSITION_VALID_P (start, from, prop) |
ca4c9455 KH |
556 | && from < to - 1) |
557 | run_composition_function (start, from, prop); | |
558 | } | |
559 | ||
560 | if (check_mask & CHECK_TAIL) | |
561 | { | |
562 | if (from < to | |
553d3164 KH |
563 | && find_composition (to - 1, -1, &start, &end, &prop, Qnil) |
564 | && COMPOSITION_VALID_P (start, end, prop)) | |
ca4c9455 KH |
565 | { |
566 | /* TO should be also at composition boundary. But, | |
567 | insertion or deletion will make two compositions adjacent | |
568 | and indistinguishable when they have same (eq) property. | |
569 | To avoid it, in such a case, we change the property of | |
570 | the former to the copy of it. */ | |
571 | if (to < end) | |
f96ba4c1 KH |
572 | { |
573 | Fput_text_property (make_number (start), make_number (to), | |
574 | Qcomposition, | |
575 | Fcons (XCAR (prop), XCDR (prop)), Qnil); | |
576 | max_pos = end; | |
577 | } | |
ca4c9455 KH |
578 | run_composition_function (start, end, prop); |
579 | } | |
580 | else if (to < ZV | |
553d3164 KH |
581 | && find_composition (to, -1, &start, &end, &prop, Qnil) |
582 | && COMPOSITION_VALID_P (start, end, prop)) | |
f96ba4c1 KH |
583 | { |
584 | run_composition_function (start, end, prop); | |
585 | max_pos = end; | |
586 | } | |
ca4c9455 | 587 | } |
f96ba4c1 | 588 | if (min_pos < max_pos) |
9d440521 KH |
589 | { |
590 | int count = SPECPDL_INDEX (); | |
591 | ||
592 | specbind (Qinhibit_read_only, Qt); | |
593 | specbind (Qinhibit_modification_hooks, Qt); | |
594 | specbind (Qinhibit_point_motion_hooks, Qt); | |
595 | Fremove_list_of_text_properties (make_number (min_pos), | |
596 | make_number (max_pos), | |
597 | Fcons (Qauto_composed, Qnil), Qnil); | |
598 | unbind_to (count, Qnil); | |
599 | } | |
ca4c9455 KH |
600 | } |
601 | ||
c1361885 KH |
602 | |
603 | /* Modify composition property values in LIST destructively. LIST is | |
604 | a list as returned from text_property_list. Change values to the | |
605 | top-level copies of them so that none of them are `eq'. */ | |
606 | ||
607 | void | |
971de7fb | 608 | make_composition_value_copy (Lisp_Object list) |
c1361885 KH |
609 | { |
610 | Lisp_Object plist, val; | |
611 | ||
612 | for (; CONSP (list); list = XCDR (list)) | |
613 | { | |
614 | plist = XCAR (XCDR (XCDR (XCAR (list)))); | |
615 | while (CONSP (plist) && CONSP (XCDR (plist))) | |
616 | { | |
617 | if (EQ (XCAR (plist), Qcomposition) | |
618 | && (val = XCAR (XCDR (plist)), CONSP (val))) | |
f3fbd155 | 619 | XSETCAR (XCDR (plist), Fcons (XCAR (val), XCDR (val))); |
c1361885 KH |
620 | plist = XCDR (XCDR (plist)); |
621 | } | |
622 | } | |
623 | } | |
624 | ||
625 | ||
ca4c9455 KH |
626 | /* Make text in the region between START and END a composition that |
627 | has COMPONENTS and MODIFICATION-FUNC. | |
628 | ||
629 | If STRING is non-nil, then operate on characters contained between | |
630 | indices START and END in STRING. */ | |
631 | ||
632 | void | |
579c18d0 EZ |
633 | compose_text (EMACS_INT start, EMACS_INT end, Lisp_Object components, |
634 | Lisp_Object modification_func, Lisp_Object string) | |
ca4c9455 KH |
635 | { |
636 | Lisp_Object prop; | |
637 | ||
638 | prop = Fcons (Fcons (make_number (end - start), components), | |
639 | modification_func); | |
640 | Fput_text_property (make_number (start), make_number (end), | |
641 | Qcomposition, prop, string); | |
642 | } | |
58753d74 KH |
643 | |
644 | ||
f57e2426 J |
645 | static Lisp_Object autocmp_chars (Lisp_Object, EMACS_INT, EMACS_INT, |
646 | EMACS_INT, struct window *, | |
647 | struct face *, Lisp_Object); | |
58753d74 KH |
648 | |
649 | \f | |
650 | /* Lisp glyph-string handlers */ | |
651 | ||
652 | /* Hash table for automatic composition. The key is a header of a | |
653 | lgstring (Lispy glyph-string), and the value is a body of a | |
654 | lgstring. */ | |
655 | ||
656 | static Lisp_Object gstring_hash_table; | |
657 | ||
f57e2426 | 658 | static Lisp_Object gstring_lookup_cache (Lisp_Object); |
58753d74 KH |
659 | |
660 | static Lisp_Object | |
971de7fb | 661 | gstring_lookup_cache (Lisp_Object header) |
58753d74 KH |
662 | { |
663 | struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table); | |
d3411f89 | 664 | ptrdiff_t i = hash_lookup (h, header, NULL); |
58753d74 KH |
665 | |
666 | return (i >= 0 ? HASH_VALUE (h, i) : Qnil); | |
667 | } | |
668 | ||
669 | Lisp_Object | |
dcd5c89a | 670 | composition_gstring_put_cache (Lisp_Object gstring, EMACS_INT len) |
58753d74 KH |
671 | { |
672 | struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table); | |
0de4bb68 | 673 | EMACS_UINT hash; |
58753d74 | 674 | Lisp_Object header, copy; |
dcd5c89a | 675 | EMACS_INT i; |
58753d74 KH |
676 | |
677 | header = LGSTRING_HEADER (gstring); | |
678 | hash = h->hashfn (h, header); | |
679 | if (len < 0) | |
680 | { | |
7d100a81 | 681 | EMACS_INT j, glyph_len = LGSTRING_GLYPH_LEN (gstring); |
27ccc379 PE |
682 | for (j = 0; j < glyph_len; j++) |
683 | if (NILP (LGSTRING_GLYPH (gstring, j))) | |
58753d74 | 684 | break; |
27ccc379 | 685 | len = j; |
58753d74 | 686 | } |
087e2ea9 | 687 | |
f2ed8a70 | 688 | lint_assume (len <= TYPE_MAXIMUM (EMACS_INT) - 2); |
58753d74 KH |
689 | copy = Fmake_vector (make_number (len + 2), Qnil); |
690 | LGSTRING_SET_HEADER (copy, Fcopy_sequence (header)); | |
691 | for (i = 0; i < len; i++) | |
692 | LGSTRING_SET_GLYPH (copy, i, Fcopy_sequence (LGSTRING_GLYPH (gstring, i))); | |
693 | i = hash_put (h, LGSTRING_HEADER (copy), copy, hash); | |
694 | LGSTRING_SET_ID (copy, make_number (i)); | |
695 | return copy; | |
696 | } | |
697 | ||
698 | Lisp_Object | |
ebfa62c0 | 699 | composition_gstring_from_id (ptrdiff_t id) |
58753d74 KH |
700 | { |
701 | struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table); | |
702 | ||
703 | return HASH_VALUE (h, id); | |
704 | } | |
705 | ||
f57e2426 J |
706 | static Lisp_Object fill_gstring_header (Lisp_Object, Lisp_Object, |
707 | Lisp_Object, Lisp_Object, | |
708 | Lisp_Object); | |
58753d74 KH |
709 | |
710 | int | |
971de7fb | 711 | composition_gstring_p (Lisp_Object gstring) |
58753d74 KH |
712 | { |
713 | Lisp_Object header; | |
5eb55db9 | 714 | EMACS_INT i; |
58753d74 KH |
715 | |
716 | if (! VECTORP (gstring) || ASIZE (gstring) < 2) | |
717 | return 0; | |
718 | header = LGSTRING_HEADER (gstring); | |
719 | if (! VECTORP (header) || ASIZE (header) < 2) | |
720 | return 0; | |
721 | if (! NILP (LGSTRING_FONT (gstring)) | |
f5199465 KH |
722 | && (! FONT_OBJECT_P (LGSTRING_FONT (gstring)) |
723 | && ! CODING_SYSTEM_P (LGSTRING_FONT (gstring)))) | |
58753d74 KH |
724 | return 0; |
725 | for (i = 1; i < ASIZE (LGSTRING_HEADER (gstring)); i++) | |
726 | if (! NATNUMP (AREF (LGSTRING_HEADER (gstring), i))) | |
727 | return 0; | |
728 | if (! NILP (LGSTRING_ID (gstring)) && ! NATNUMP (LGSTRING_ID (gstring))) | |
729 | return 0; | |
730 | for (i = 0; i < LGSTRING_GLYPH_LEN (gstring); i++) | |
731 | { | |
732 | Lisp_Object glyph = LGSTRING_GLYPH (gstring, i); | |
733 | if (NILP (glyph)) | |
734 | break; | |
735 | if (! VECTORP (glyph) || ASIZE (glyph) != LGLYPH_SIZE) | |
736 | return 0; | |
737 | } | |
738 | return 1; | |
739 | } | |
740 | ||
741 | int | |
579c18d0 EZ |
742 | composition_gstring_width (Lisp_Object gstring, EMACS_INT from, EMACS_INT to, |
743 | struct font_metrics *metrics) | |
58753d74 KH |
744 | { |
745 | Lisp_Object *glyph; | |
746 | int width = 0; | |
747 | ||
748 | if (metrics) | |
749 | { | |
750 | Lisp_Object font_object = LGSTRING_FONT (gstring); | |
58753d74 | 751 | |
f5199465 KH |
752 | if (FONT_OBJECT_P (font_object)) |
753 | { | |
754 | struct font *font = XFONT_OBJECT (font_object); | |
755 | ||
756 | metrics->ascent = font->ascent; | |
757 | metrics->descent = font->descent; | |
758 | } | |
759 | else | |
760 | { | |
761 | metrics->ascent = 1; | |
762 | metrics->descent = 0; | |
763 | } | |
58753d74 KH |
764 | metrics->width = metrics->lbearing = metrics->rbearing = 0; |
765 | } | |
766 | for (glyph = &LGSTRING_GLYPH (gstring, from); from < to; from++, glyph++) | |
767 | { | |
768 | int x; | |
769 | ||
770 | if (NILP (LGLYPH_ADJUSTMENT (*glyph))) | |
771 | width += LGLYPH_WIDTH (*glyph); | |
772 | else | |
773 | width += LGLYPH_WADJUST (*glyph); | |
774 | if (metrics) | |
775 | { | |
776 | x = metrics->width + LGLYPH_LBEARING (*glyph) + LGLYPH_XOFF (*glyph); | |
777 | if (metrics->lbearing > x) | |
778 | metrics->lbearing = x; | |
779 | x = metrics->width + LGLYPH_RBEARING (*glyph) + LGLYPH_XOFF (*glyph); | |
780 | if (metrics->rbearing < x) | |
781 | metrics->rbearing = x; | |
782 | metrics->width = width; | |
783 | x = LGLYPH_ASCENT (*glyph) - LGLYPH_YOFF (*glyph); | |
784 | if (metrics->ascent < x) | |
785 | metrics->ascent = x; | |
895416e3 | 786 | x = LGLYPH_DESCENT (*glyph) + LGLYPH_YOFF (*glyph); |
58753d74 KH |
787 | if (metrics->descent < x) |
788 | metrics->descent = x; | |
789 | } | |
790 | } | |
791 | return width; | |
792 | } | |
793 | ||
794 | ||
795 | static Lisp_Object gstring_work; | |
796 | static Lisp_Object gstring_work_headers; | |
797 | ||
798 | static Lisp_Object | |
971de7fb | 799 | fill_gstring_header (Lisp_Object header, Lisp_Object start, Lisp_Object end, Lisp_Object font_object, Lisp_Object string) |
58753d74 KH |
800 | { |
801 | EMACS_INT from, to, from_byte; | |
802 | EMACS_INT len, i; | |
803 | ||
804 | if (NILP (string)) | |
805 | { | |
4b4deea2 | 806 | if (NILP (BVAR (current_buffer, enable_multibyte_characters))) |
58753d74 KH |
807 | error ("Attempt to shape unibyte text"); |
808 | validate_region (&start, &end); | |
809 | from = XFASTINT (start); | |
810 | to = XFASTINT (end); | |
811 | from_byte = CHAR_TO_BYTE (from); | |
812 | } | |
813 | else | |
814 | { | |
815 | CHECK_STRING (string); | |
793ffee8 | 816 | if (! STRING_MULTIBYTE (string)) |
58753d74 | 817 | error ("Attempt to shape unibyte text"); |
ea8ba975 | 818 | /* FROM and TO are checked by the caller. */ |
58753d74 | 819 | from = XINT (start); |
58753d74 KH |
820 | to = XINT (end); |
821 | if (from < 0 || from > to || to > SCHARS (string)) | |
822 | args_out_of_range_3 (string, start, end); | |
823 | from_byte = string_char_to_byte (string, from); | |
824 | } | |
825 | ||
826 | len = to - from; | |
827 | if (len == 0) | |
828 | error ("Attempt to shape zero-length text"); | |
829 | if (VECTORP (header)) | |
830 | { | |
831 | if (ASIZE (header) != len + 1) | |
832 | args_out_of_range (header, make_number (len + 1)); | |
833 | } | |
834 | else | |
835 | { | |
836 | if (len <= 8) | |
837 | header = AREF (gstring_work_headers, len - 1); | |
838 | else | |
839 | header = Fmake_vector (make_number (len + 1), Qnil); | |
840 | } | |
841 | ||
842 | ASET (header, 0, font_object); | |
843 | for (i = 0; i < len; i++) | |
844 | { | |
845 | int c; | |
846 | ||
847 | if (NILP (string)) | |
848 | FETCH_CHAR_ADVANCE_NO_CHECK (c, from, from_byte); | |
849 | else | |
850 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, string, from, from_byte); | |
851 | ASET (header, i + 1, make_number (c)); | |
852 | } | |
853 | return header; | |
854 | } | |
855 | ||
58753d74 | 856 | static void |
971de7fb | 857 | fill_gstring_body (Lisp_Object gstring) |
58753d74 KH |
858 | { |
859 | Lisp_Object font_object = LGSTRING_FONT (gstring); | |
860 | Lisp_Object header = AREF (gstring, 0); | |
861 | EMACS_INT len = LGSTRING_CHAR_LEN (gstring); | |
862 | EMACS_INT i; | |
863 | ||
864 | for (i = 0; i < len; i++) | |
865 | { | |
866 | Lisp_Object g = LGSTRING_GLYPH (gstring, i); | |
f8c86b69 | 867 | int c = XFASTINT (AREF (header, i + 1)); |
58753d74 KH |
868 | |
869 | if (NILP (g)) | |
870 | { | |
871 | g = LGLYPH_NEW (); | |
872 | LGSTRING_SET_GLYPH (gstring, i, g); | |
873 | } | |
874 | LGLYPH_SET_FROM (g, i); | |
875 | LGLYPH_SET_TO (g, i); | |
876 | LGLYPH_SET_CHAR (g, c); | |
f5199465 | 877 | if (FONT_OBJECT_P (font_object)) |
58753d74 KH |
878 | { |
879 | font_fill_lglyph_metrics (g, font_object); | |
880 | } | |
881 | else | |
882 | { | |
883 | int width = XFASTINT (CHAR_TABLE_REF (Vchar_width_table, c)); | |
884 | ||
885 | LGLYPH_SET_CODE (g, c); | |
886 | LGLYPH_SET_LBEARING (g, 0); | |
887 | LGLYPH_SET_RBEARING (g, width); | |
888 | LGLYPH_SET_WIDTH (g, width); | |
889 | LGLYPH_SET_ASCENT (g, 1); | |
890 | LGLYPH_SET_DESCENT (g, 0); | |
891 | } | |
892 | LGLYPH_SET_ADJUSTMENT (g, Qnil); | |
893 | } | |
894 | if (i < LGSTRING_GLYPH_LEN (gstring)) | |
895 | LGSTRING_SET_GLYPH (gstring, i, Qnil); | |
896 | } | |
897 | ||
58753d74 | 898 | |
10f72a37 KH |
899 | /* Try to compose the characters at CHARPOS according to composition |
900 | rule RULE ([PATTERN PREV-CHARS FUNC]). LIMIT limits the characters | |
901 | to compose. STRING, if not nil, is a target string. WIN is a | |
902 | window where the characters are being displayed. If characters are | |
903 | successfully composed, return the composition as a glyph-string | |
904 | object. Otherwise return nil. */ | |
58753d74 KH |
905 | |
906 | static Lisp_Object | |
971de7fb | 907 | autocmp_chars (Lisp_Object rule, EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT limit, struct window *win, struct face *face, Lisp_Object string) |
58753d74 KH |
908 | { |
909 | int count = SPECPDL_INDEX (); | |
910 | FRAME_PTR f = XFRAME (win->frame); | |
911 | Lisp_Object pos = make_number (charpos); | |
10f72a37 | 912 | EMACS_INT to; |
58753d74 | 913 | EMACS_INT pt = PT, pt_byte = PT_BYTE; |
10f72a37 | 914 | Lisp_Object re, font_object, lgstring; |
579c18d0 | 915 | EMACS_INT len; |
087e2ea9 | 916 | |
58753d74 | 917 | record_unwind_save_match_data (); |
10f72a37 KH |
918 | re = AREF (rule, 0); |
919 | if (NILP (re)) | |
920 | len = 1; | |
921 | else if (! STRINGP (re)) | |
922 | return unbind_to (count, Qnil); | |
923 | else if ((len = fast_looking_at (re, charpos, bytepos, limit, -1, string)) | |
924 | > 0) | |
58753d74 | 925 | { |
10f72a37 KH |
926 | if (NILP (string)) |
927 | len = BYTE_TO_CHAR (bytepos + len) - charpos; | |
928 | else | |
929 | len = string_byte_to_char (string, bytepos + len) - charpos; | |
930 | } | |
931 | if (len <= 0) | |
932 | return unbind_to (count, Qnil); | |
933 | to = limit = charpos + len; | |
58753d74 | 934 | #ifdef HAVE_WINDOW_SYSTEM |
10f72a37 KH |
935 | if (FRAME_WINDOW_P (f)) |
936 | { | |
937 | font_object = font_range (charpos, &to, win, face, string); | |
938 | if (! FONT_OBJECT_P (font_object) | |
939 | || (! NILP (re) | |
940 | && to < limit | |
941 | && (fast_looking_at (re, charpos, bytepos, to, -1, string) <= 0))) | |
942 | return unbind_to (count, Qnil); | |
943 | } | |
944 | else | |
58753d74 | 945 | #endif /* not HAVE_WINDOW_SYSTEM */ |
10f72a37 KH |
946 | font_object = win->frame; |
947 | lgstring = Fcomposition_get_gstring (pos, make_number (to), font_object, | |
948 | string); | |
949 | if (NILP (LGSTRING_ID (lgstring))) | |
950 | { | |
951 | Lisp_Object args[6]; | |
5dcde606 | 952 | |
10f72a37 KH |
953 | /* Save point as marker before calling out to lisp. */ |
954 | if (NILP (string)) | |
955 | { | |
956 | Lisp_Object m = Fmake_marker (); | |
957 | set_marker_both (m, Qnil, pt, pt_byte); | |
958 | record_unwind_protect (restore_point_unwind, m); | |
58753d74 | 959 | } |
10f72a37 KH |
960 | |
961 | args[0] = Vauto_composition_function; | |
962 | args[1] = AREF (rule, 2); | |
963 | args[2] = pos; | |
964 | args[3] = make_number (to); | |
965 | args[4] = font_object; | |
966 | args[5] = string; | |
967 | lgstring = safe_call (6, args); | |
968 | if (NILP (string)) | |
969 | TEMP_SET_PT_BOTH (pt, pt_byte); | |
58753d74 | 970 | } |
10f72a37 | 971 | return unbind_to (count, lgstring); |
58753d74 KH |
972 | } |
973 | ||
82ebc97b | 974 | static Lisp_Object _work_val; |
82ebc97b | 975 | |
f6aa6ec6 KH |
976 | /* 1 iff the character C is composable. Characters of general |
977 | category Z? or C? are not composable except for ZWNJ and ZWJ. */ | |
978 | ||
82ebc97b | 979 | #define CHAR_COMPOSABLE_P(C) \ |
a28d4396 KH |
980 | ((C) > ' ' \ |
981 | && ((C) == 0x200C || (C) == 0x200D \ | |
982 | || (_work_val = CHAR_TABLE_REF (Vunicode_category_table, (C)), \ | |
c805dec0 KH |
983 | (INTEGERP (_work_val) \ |
984 | && (XINT (_work_val) <= UNICODE_CATEGORY_So))))) | |
58753d74 KH |
985 | |
986 | /* Update cmp_it->stop_pos to the next position after CHARPOS (and | |
987 | BYTEPOS) where character composition may happen. If BYTEPOS is | |
82ebc97b KH |
988 | negative, compute it. ENDPOS is a limit of searching. If it is |
989 | less than CHARPOS, search backward to ENDPOS+1 assuming that | |
990 | set_iterator_to_next works in reverse order. In this case, if a | |
991 | composition closest to CHARPOS is found, set cmp_it->stop_pos to | |
992 | the last character of the composition. | |
993 | ||
994 | If no composition is found, set cmp_it->ch to -2. If a static | |
995 | composition is found, set cmp_it->ch to -1. Otherwise, set | |
996 | cmp_it->ch to the character that triggers the automatic | |
997 | composition. */ | |
58753d74 KH |
998 | |
999 | void | |
971de7fb | 1000 | composition_compute_stop_pos (struct composition_it *cmp_it, EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT endpos, Lisp_Object string) |
58753d74 | 1001 | { |
f8c86b69 PE |
1002 | EMACS_INT start, end; |
1003 | int c; | |
58753d74 | 1004 | Lisp_Object prop, val; |
3ffdafce KH |
1005 | /* This is from forward_to_next_line_start in xdisp.c. */ |
1006 | const int MAX_NEWLINE_DISTANCE = 500; | |
58753d74 | 1007 | |
82ebc97b KH |
1008 | if (charpos < endpos) |
1009 | { | |
1010 | if (endpos > charpos + MAX_NEWLINE_DISTANCE) | |
1011 | endpos = charpos + MAX_NEWLINE_DISTANCE; | |
1012 | } | |
1013 | else if (endpos < charpos) | |
1014 | { | |
1015 | /* We search backward for a position to check composition. */ | |
1016 | if (endpos < 0) | |
1017 | { | |
1018 | /* But we don't know where to stop the searching. */ | |
1019 | endpos = NILP (string) ? BEGV - 1 : -1; | |
1020 | /* Usually we don't reach ENDPOS because we stop searching | |
1021 | at an uncomposable character (NL, LRE, etc). */ | |
1022 | } | |
1023 | } | |
053ca52b | 1024 | cmp_it->id = -1; |
44566dc7 | 1025 | cmp_it->ch = -2; |
82ebc97b KH |
1026 | cmp_it->reversed_p = 0; |
1027 | cmp_it->stop_pos = endpos; | |
1028 | if (charpos == endpos) | |
1029 | return; | |
1030 | /* FIXME: Bidi is not yet handled well in static composition. */ | |
1031 | if (charpos < endpos | |
1032 | && find_composition (charpos, endpos, &start, &end, &prop, string) | |
15fa4783 | 1033 | && start >= charpos |
58753d74 KH |
1034 | && COMPOSITION_VALID_P (start, end, prop)) |
1035 | { | |
1036 | cmp_it->stop_pos = endpos = start; | |
1037 | cmp_it->ch = -1; | |
1038 | } | |
4b4deea2 | 1039 | if (NILP (BVAR (current_buffer, enable_multibyte_characters)) |
d9a7c140 | 1040 | || NILP (Vauto_composition_mode)) |
58753d74 KH |
1041 | return; |
1042 | if (bytepos < 0) | |
1043 | { | |
82ebc97b | 1044 | if (NILP (string)) |
58753d74 | 1045 | bytepos = CHAR_TO_BYTE (charpos); |
82ebc97b KH |
1046 | else |
1047 | bytepos = string_char_to_byte (string, charpos); | |
58753d74 KH |
1048 | } |
1049 | ||
1050 | start = charpos; | |
82ebc97b | 1051 | if (charpos < endpos) |
58753d74 | 1052 | { |
82ebc97b KH |
1053 | /* Forward search. */ |
1054 | while (charpos < endpos) | |
ea8ba975 | 1055 | { |
82ebc97b KH |
1056 | if (STRINGP (string)) |
1057 | FETCH_STRING_CHAR_ADVANCE (c, string, charpos, bytepos); | |
1058 | else | |
1059 | FETCH_CHAR_ADVANCE (c, charpos, bytepos); | |
1060 | if (c == '\n') | |
1061 | { | |
1062 | cmp_it->ch = -2; | |
1063 | break; | |
1064 | } | |
1065 | val = CHAR_TABLE_REF (Vcomposition_function_table, c); | |
1066 | if (! NILP (val)) | |
1067 | { | |
1068 | Lisp_Object elt; | |
10f72a37 | 1069 | int ridx; |
82ebc97b | 1070 | |
10f72a37 | 1071 | for (ridx = 0; CONSP (val); val = XCDR (val), ridx++) |
82ebc97b KH |
1072 | { |
1073 | elt = XCAR (val); | |
1074 | if (VECTORP (elt) && ASIZE (elt) == 3 | |
1075 | && NATNUMP (AREF (elt, 1)) | |
1076 | && charpos - 1 - XFASTINT (AREF (elt, 1)) >= start) | |
1077 | break; | |
1078 | } | |
1079 | if (CONSP (val)) | |
1080 | { | |
10f72a37 | 1081 | cmp_it->rule_idx = ridx; |
82ebc97b KH |
1082 | cmp_it->lookback = XFASTINT (AREF (elt, 1)); |
1083 | cmp_it->stop_pos = charpos - 1 - cmp_it->lookback; | |
1084 | cmp_it->ch = c; | |
1085 | return; | |
1086 | } | |
1087 | } | |
ea8ba975 | 1088 | } |
ff94e32c KH |
1089 | if (charpos == endpos) |
1090 | { | |
1091 | /* We couldn't find a composition point before ENDPOS. But, | |
1092 | some character after ENDPOS may be composed with | |
1093 | characters before ENDPOS. So, we should stop at the safe | |
1094 | point. */ | |
1095 | charpos = endpos - MAX_AUTO_COMPOSITION_LOOKBACK; | |
1096 | if (charpos < start) | |
1097 | charpos = start; | |
1098 | } | |
82ebc97b | 1099 | } |
b7050583 | 1100 | else if (charpos > endpos) |
82ebc97b KH |
1101 | { |
1102 | /* Search backward for a pattern that may be composed and the | |
1103 | position of (possibly) the last character of the match is | |
1104 | closest to (but not after) START. The reason for the last | |
d07f018c EZ |
1105 | character is that set_iterator_to_next works in reverse order, |
1106 | and thus we must stop at the last character for composition | |
82ebc97b KH |
1107 | check. */ |
1108 | unsigned char *p; | |
1109 | int len; | |
d07f018c EZ |
1110 | /* Limit byte position used in fast_looking_at. This is the |
1111 | byte position of the character after START. */ | |
82ebc97b KH |
1112 | EMACS_INT limit; |
1113 | ||
1114 | if (NILP (string)) | |
1115 | p = BYTE_POS_ADDR (bytepos); | |
1116 | else | |
1117 | p = SDATA (string) + bytepos; | |
1118 | c = STRING_CHAR_AND_LENGTH (p, len); | |
1119 | limit = bytepos + len; | |
1120 | while (CHAR_COMPOSABLE_P (c)) | |
58753d74 | 1121 | { |
10f72a37 KH |
1122 | val = CHAR_TABLE_REF (Vcomposition_function_table, c); |
1123 | if (! NILP (val)) | |
82ebc97b | 1124 | { |
10f72a37 | 1125 | Lisp_Object elt; |
8f5201ae | 1126 | int ridx, back, blen; |
58753d74 | 1127 | |
10f72a37 | 1128 | for (ridx = 0; CONSP (val); val = XCDR (val), ridx++) |
82ebc97b | 1129 | { |
10f72a37 KH |
1130 | elt = XCAR (val); |
1131 | if (VECTORP (elt) && ASIZE (elt) == 3 | |
1132 | && NATNUMP (AREF (elt, 1)) | |
1133 | && charpos - (back = XFASTINT (AREF (elt, 1))) > endpos) | |
82ebc97b | 1134 | { |
10f72a37 KH |
1135 | EMACS_INT cpos = charpos - back, bpos; |
1136 | ||
1137 | if (back == 0) | |
1138 | bpos = bytepos; | |
82ebc97b | 1139 | else |
10f72a37 KH |
1140 | bpos = (NILP (string) ? CHAR_TO_BYTE (cpos) |
1141 | : string_char_to_byte (string, cpos)); | |
1142 | if (STRINGP (AREF (elt, 0))) | |
8f5201ae PE |
1143 | blen = fast_looking_at (AREF (elt, 0), cpos, bpos, |
1144 | start + 1, limit, string); | |
10f72a37 | 1145 | else |
8f5201ae PE |
1146 | blen = 1; |
1147 | if (blen > 0) | |
82ebc97b | 1148 | { |
10f72a37 | 1149 | /* Make CPOS point to the last character of |
8f5201ae PE |
1150 | match. Note that BLEN is byte-length. */ |
1151 | if (blen > 1) | |
10f72a37 | 1152 | { |
8f5201ae | 1153 | bpos += blen; |
10f72a37 KH |
1154 | if (NILP (string)) |
1155 | cpos = BYTE_TO_CHAR (bpos) - 1; | |
1156 | else | |
1157 | cpos = string_byte_to_char (string, bpos) - 1; | |
1158 | } | |
1159 | back = cpos - (charpos - back); | |
1160 | if (cmp_it->stop_pos < cpos | |
1161 | || (cmp_it->stop_pos == cpos | |
1162 | && cmp_it->lookback < back)) | |
1163 | { | |
1164 | cmp_it->rule_idx = ridx; | |
1165 | cmp_it->stop_pos = cpos; | |
1166 | cmp_it->ch = c; | |
1167 | cmp_it->lookback = back; | |
1168 | cmp_it->nchars = back + 1; | |
1169 | } | |
82ebc97b KH |
1170 | } |
1171 | } | |
1172 | } | |
1173 | } | |
1174 | if (charpos - 1 == endpos) | |
1175 | break; | |
1176 | if (STRINGP (string)) | |
58753d74 | 1177 | { |
82ebc97b KH |
1178 | p--, bytepos--; |
1179 | while (! CHAR_HEAD_P (*p)) | |
1180 | p--, bytepos--; | |
1181 | charpos--; | |
1182 | } | |
1183 | else | |
1184 | { | |
1185 | DEC_BOTH (charpos, bytepos); | |
1186 | p = BYTE_POS_ADDR (bytepos); | |
58753d74 | 1187 | } |
82ebc97b KH |
1188 | c = STRING_CHAR (p); |
1189 | } | |
1190 | if (cmp_it->ch >= 0) | |
1191 | /* We found a position to check. */ | |
1192 | return; | |
1193 | /* Skip all uncomposable characters. */ | |
1194 | if (NILP (string)) | |
1195 | { | |
1196 | while (charpos - 1 > endpos && ! CHAR_COMPOSABLE_P (c)) | |
58753d74 | 1197 | { |
82ebc97b KH |
1198 | DEC_BOTH (charpos, bytepos); |
1199 | c = FETCH_MULTIBYTE_CHAR (bytepos); | |
1200 | } | |
1201 | } | |
1202 | else | |
1203 | { | |
1204 | while (charpos - 1 > endpos && ! CHAR_COMPOSABLE_P (c)) | |
1205 | { | |
1206 | p--; | |
1207 | while (! CHAR_HEAD_P (*p)) | |
1208 | p--; | |
1209 | charpos--; | |
1210 | c = STRING_CHAR (p); | |
58753d74 KH |
1211 | } |
1212 | } | |
1213 | } | |
44566dc7 | 1214 | cmp_it->stop_pos = charpos; |
58753d74 KH |
1215 | } |
1216 | ||
1217 | /* Check if the character at CHARPOS (and BYTEPOS) is composed | |
22e33406 | 1218 | (possibly with the following characters) on window W. ENDPOS limits |
58753d74 KH |
1219 | characters to be composed. FACE, in non-NULL, is a base face of |
1220 | the character. If STRING is not nil, it is a string containing the | |
1221 | character to check, and CHARPOS and BYTEPOS are indices in the | |
1222 | string. In that case, FACE must not be NULL. | |
1223 | ||
1224 | If the character is composed, setup members of CMP_IT (id, nglyphs, | |
82ebc97b KH |
1225 | from, to, reversed_p), and return 1. Otherwise, update |
1226 | CMP_IT->stop_pos, and return 0. */ | |
58753d74 KH |
1227 | |
1228 | int | |
971de7fb | 1229 | composition_reseat_it (struct composition_it *cmp_it, EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT endpos, struct window *w, struct face *face, Lisp_Object string) |
58753d74 | 1230 | { |
f6aa6ec6 KH |
1231 | if (endpos < 0) |
1232 | endpos = NILP (string) ? BEGV : 0; | |
e614ea00 | 1233 | |
3ffdafce KH |
1234 | if (cmp_it->ch == -2) |
1235 | { | |
1236 | composition_compute_stop_pos (cmp_it, charpos, bytepos, endpos, string); | |
10f72a37 | 1237 | if (cmp_it->ch == -2 || cmp_it->stop_pos != charpos) |
82ebc97b | 1238 | /* The current position is not composed. */ |
3ffdafce KH |
1239 | return 0; |
1240 | } | |
1241 | ||
58753d74 KH |
1242 | if (cmp_it->ch < 0) |
1243 | { | |
1244 | /* We are looking at a static composition. */ | |
1245 | EMACS_INT start, end; | |
1246 | Lisp_Object prop; | |
1247 | ||
1248 | find_composition (charpos, -1, &start, &end, &prop, string); | |
1249 | cmp_it->id = get_composition_id (charpos, bytepos, end - start, | |
1250 | prop, string); | |
1251 | if (cmp_it->id < 0) | |
1252 | goto no_composition; | |
1253 | cmp_it->nchars = end - start; | |
1254 | cmp_it->nglyphs = composition_table[cmp_it->id]->glyph_len; | |
1255 | } | |
29fb7306 | 1256 | else if (w) |
58753d74 | 1257 | { |
10f72a37 | 1258 | Lisp_Object lgstring = Qnil; |
b246f932 | 1259 | Lisp_Object val, elt; |
5eb55db9 | 1260 | EMACS_INT i; |
58753d74 KH |
1261 | |
1262 | val = CHAR_TABLE_REF (Vcomposition_function_table, cmp_it->ch); | |
10f72a37 | 1263 | for (i = 0; i < cmp_it->rule_idx; i++, val = XCDR (val)); |
82ebc97b | 1264 | if (charpos < endpos) |
90b3fe91 | 1265 | { |
82ebc97b KH |
1266 | for (; CONSP (val); val = XCDR (val)) |
1267 | { | |
1268 | elt = XCAR (val); | |
10f72a37 KH |
1269 | if (! VECTORP (elt) || ASIZE (elt) != 3 |
1270 | || ! INTEGERP (AREF (elt, 1))) | |
1271 | continue; | |
1272 | if (XFASTINT (AREF (elt, 1)) != cmp_it->lookback) | |
aa3830c4 | 1273 | goto no_composition; |
10f72a37 KH |
1274 | lgstring = autocmp_chars (elt, charpos, bytepos, endpos, |
1275 | w, face, string); | |
1276 | if (composition_gstring_p (lgstring)) | |
82ebc97b | 1277 | break; |
10f72a37 KH |
1278 | lgstring = Qnil; |
1279 | /* Composition failed perhaps because the font doesn't | |
1280 | support sufficient range of characters. Try the | |
1281 | other composition rules if any. */ | |
82ebc97b | 1282 | } |
82ebc97b | 1283 | cmp_it->reversed_p = 0; |
90b3fe91 | 1284 | } |
82ebc97b KH |
1285 | else |
1286 | { | |
10f72a37 | 1287 | EMACS_INT cpos = charpos, bpos = bytepos; |
90b3fe91 | 1288 | |
10f72a37 | 1289 | while (1) |
82ebc97b | 1290 | { |
10f72a37 KH |
1291 | elt = XCAR (val); |
1292 | if (cmp_it->lookback > 0) | |
1293 | { | |
f6aa6ec6 | 1294 | cpos = charpos - cmp_it->lookback; |
10f72a37 KH |
1295 | if (STRINGP (string)) |
1296 | bpos = string_char_to_byte (string, cpos); | |
1297 | else | |
1298 | bpos = CHAR_TO_BYTE (cpos); | |
1299 | } | |
1300 | lgstring = autocmp_chars (elt, cpos, bpos, charpos + 1, w, face, | |
1301 | string); | |
1302 | if (composition_gstring_p (lgstring) | |
1303 | && cpos + LGSTRING_CHAR_LEN (lgstring) - 1 == charpos) | |
1304 | break; | |
1305 | /* Composition failed or didn't cover the current | |
1306 | character. */ | |
1307 | if (cmp_it->lookback == 0) | |
82ebc97b | 1308 | goto no_composition; |
10f72a37 KH |
1309 | lgstring = Qnil; |
1310 | /* Try to find a shorter compostion that starts after CPOS. */ | |
1311 | composition_compute_stop_pos (cmp_it, charpos, bytepos, cpos, | |
1312 | string); | |
1313 | if (cmp_it->ch == -2 || cmp_it->stop_pos < charpos) | |
1314 | goto no_composition; | |
1315 | val = CHAR_TABLE_REF (Vcomposition_function_table, cmp_it->ch); | |
1316 | for (i = 0; i < cmp_it->rule_idx; i++, val = XCDR (val)); | |
82ebc97b KH |
1317 | } |
1318 | cmp_it->reversed_p = 1; | |
1319 | } | |
10f72a37 KH |
1320 | if (NILP (lgstring)) |
1321 | goto no_composition; | |
1322 | if (NILP (LGSTRING_ID (lgstring))) | |
1323 | lgstring = composition_gstring_put_cache (lgstring, -1); | |
1324 | cmp_it->id = XINT (LGSTRING_ID (lgstring)); | |
1325 | for (i = 0; i < LGSTRING_GLYPH_LEN (lgstring); i++) | |
1326 | if (NILP (LGSTRING_GLYPH (lgstring, i))) | |
58753d74 KH |
1327 | break; |
1328 | cmp_it->nglyphs = i; | |
82ebc97b KH |
1329 | cmp_it->from = 0; |
1330 | cmp_it->to = i; | |
58753d74 | 1331 | } |
29fb7306 KH |
1332 | else |
1333 | goto no_composition; | |
58753d74 KH |
1334 | return 1; |
1335 | ||
1336 | no_composition: | |
82ebc97b KH |
1337 | if (charpos == endpos) |
1338 | return 0; | |
1339 | if (charpos < endpos) | |
1340 | { | |
1341 | charpos++; | |
10f72a37 | 1342 | if (NILP (string)) |
82ebc97b | 1343 | INC_POS (bytepos); |
10f72a37 | 1344 | else |
aa3830c4 | 1345 | bytepos += BYTES_BY_CHAR_HEAD (*(SDATA (string) + bytepos)); |
82ebc97b | 1346 | } |
58753d74 | 1347 | else |
82ebc97b KH |
1348 | { |
1349 | charpos--; | |
1350 | /* BYTEPOS is calculated in composition_compute_stop_pos */ | |
1351 | bytepos = -1; | |
1352 | } | |
58753d74 KH |
1353 | composition_compute_stop_pos (cmp_it, charpos, bytepos, endpos, string); |
1354 | return 0; | |
1355 | } | |
1356 | ||
10f72a37 KH |
1357 | /* Update charpos, nchars, nbytes, and width of the current grapheme |
1358 | cluster. | |
1359 | ||
1360 | If the composition is static or automatic in L2R context, the | |
1361 | cluster is identified by CMP_IT->from, and CHARPOS is the position | |
1362 | of the first character of the cluster. In this case, update | |
1363 | CMP_IT->to too. | |
1364 | ||
1365 | If the composition is automatic in R2L context, the cluster is | |
1366 | identified by CMP_IT->to, and CHARPOS is the position of the last | |
1367 | character of the cluster. In this case, update CMP_IT->from too. | |
1368 | ||
1369 | The return value is the character code of the first character of | |
1370 | the cluster, or -1 if the composition is somehow broken. */ | |
82ebc97b | 1371 | |
58753d74 | 1372 | int |
971de7fb | 1373 | composition_update_it (struct composition_it *cmp_it, EMACS_INT charpos, EMACS_INT bytepos, Lisp_Object string) |
58753d74 | 1374 | { |
80e079b2 | 1375 | int i, c IF_LINT (= 0); |
58753d74 KH |
1376 | |
1377 | if (cmp_it->ch < 0) | |
1378 | { | |
10f72a37 | 1379 | /* static composition */ |
58753d74 KH |
1380 | struct composition *cmp = composition_table[cmp_it->id]; |
1381 | ||
10f72a37 | 1382 | cmp_it->charpos = charpos; |
58753d74 KH |
1383 | cmp_it->to = cmp_it->nglyphs; |
1384 | if (cmp_it->nglyphs == 0) | |
1385 | c = -1; | |
1386 | else | |
1387 | { | |
1388 | for (i = 0; i < cmp->glyph_len; i++) | |
1389 | if ((c = COMPOSITION_GLYPH (cmp, i)) != '\t') | |
1390 | break; | |
1391 | if (c == '\t') | |
1392 | c = ' '; | |
1393 | } | |
1394 | cmp_it->width = cmp->width; | |
10f72a37 KH |
1395 | charpos += cmp_it->nchars; |
1396 | if (STRINGP (string)) | |
1397 | cmp_it->nbytes = string_char_to_byte (string, charpos) - bytepos; | |
1398 | else | |
1399 | cmp_it->nbytes = CHAR_TO_BYTE (charpos) - bytepos; | |
58753d74 KH |
1400 | } |
1401 | else | |
1402 | { | |
10f72a37 | 1403 | /* automatic composition */ |
58753d74 | 1404 | Lisp_Object gstring = composition_gstring_from_id (cmp_it->id); |
10f72a37 | 1405 | Lisp_Object glyph; |
579c18d0 | 1406 | EMACS_INT from; |
58753d74 KH |
1407 | |
1408 | if (cmp_it->nglyphs == 0) | |
1409 | { | |
58753d74 KH |
1410 | cmp_it->nchars = LGSTRING_CHAR_LEN (gstring); |
1411 | cmp_it->width = 0; | |
10f72a37 KH |
1412 | cmp_it->from = cmp_it->to = 0; |
1413 | return -1; | |
58753d74 | 1414 | } |
10f72a37 | 1415 | if (! cmp_it->reversed_p) |
58753d74 | 1416 | { |
10f72a37 KH |
1417 | glyph = LGSTRING_GLYPH (gstring, cmp_it->from); |
1418 | from = LGLYPH_FROM (glyph); | |
58753d74 KH |
1419 | for (cmp_it->to = cmp_it->from + 1; cmp_it->to < cmp_it->nglyphs; |
1420 | cmp_it->to++) | |
1421 | { | |
1422 | glyph = LGSTRING_GLYPH (gstring, cmp_it->to); | |
1423 | if (LGLYPH_FROM (glyph) != from) | |
1424 | break; | |
58753d74 | 1425 | } |
10f72a37 | 1426 | cmp_it->charpos = charpos; |
58753d74 | 1427 | } |
82ebc97b KH |
1428 | else |
1429 | { | |
10f72a37 KH |
1430 | glyph = LGSTRING_GLYPH (gstring, cmp_it->to - 1); |
1431 | from = LGLYPH_FROM (glyph); | |
1432 | cmp_it->charpos = charpos - (LGLYPH_TO (glyph) - from); | |
1433 | for (cmp_it->from = cmp_it->to - 1; cmp_it->from > 0; | |
1434 | cmp_it->from--) | |
82ebc97b | 1435 | { |
10f72a37 | 1436 | glyph = LGSTRING_GLYPH (gstring, cmp_it->from - 1); |
82ebc97b KH |
1437 | if (LGLYPH_FROM (glyph) != from) |
1438 | break; | |
82ebc97b | 1439 | } |
10f72a37 KH |
1440 | } |
1441 | glyph = LGSTRING_GLYPH (gstring, cmp_it->from); | |
1442 | cmp_it->nchars = LGLYPH_TO (glyph) + 1 - from; | |
1443 | cmp_it->nbytes = 0; | |
1444 | cmp_it->width = 0; | |
1445 | for (i = cmp_it->nchars - 1; i >= 0; i--) | |
1446 | { | |
1447 | c = XINT (LGSTRING_CHAR (gstring, i)); | |
1448 | cmp_it->nbytes += CHAR_BYTES (c); | |
63257f6c | 1449 | cmp_it->width += CHAR_WIDTH (c); |
82ebc97b | 1450 | } |
58753d74 | 1451 | } |
58753d74 KH |
1452 | return c; |
1453 | } | |
1454 | ||
1455 | ||
90b3fe91 KH |
1456 | struct position_record |
1457 | { | |
1458 | EMACS_INT pos, pos_byte; | |
1459 | unsigned char *p; | |
1460 | }; | |
1461 | ||
763d7377 | 1462 | /* Update the members of POSITION to the next character boundary. */ |
90b3fe91 KH |
1463 | #define FORWARD_CHAR(POSITION, STOP) \ |
1464 | do { \ | |
90b3fe91 | 1465 | (POSITION).pos++; \ |
900c4486 KH |
1466 | if ((POSITION).pos == (STOP)) \ |
1467 | { \ | |
1468 | (POSITION).p = GAP_END_ADDR; \ | |
1469 | (POSITION).pos_byte = GPT_BYTE; \ | |
1470 | } \ | |
1471 | else \ | |
1472 | { \ | |
900c4486 | 1473 | (POSITION).pos_byte += BYTES_BY_CHAR_HEAD (*((POSITION).p)); \ |
d45a49e3 | 1474 | (POSITION).p += BYTES_BY_CHAR_HEAD (*((POSITION).p)); \ |
900c4486 | 1475 | } \ |
90b3fe91 KH |
1476 | } while (0) |
1477 | ||
763d7377 | 1478 | /* Update the members of POSITION to the previous character boundary. */ |
90b3fe91 KH |
1479 | #define BACKWARD_CHAR(POSITION, STOP) \ |
1480 | do { \ | |
a28d4396 | 1481 | if ((POSITION).pos == (STOP)) \ |
90b3fe91 KH |
1482 | (POSITION).p = GPT_ADDR; \ |
1483 | do { \ | |
1484 | (POSITION).pos_byte--; \ | |
1485 | (POSITION).p--; \ | |
1486 | } while (! CHAR_HEAD_P (*((POSITION).p))); \ | |
1487 | (POSITION).pos--; \ | |
1488 | } while (0) | |
1489 | ||
90b3fe91 | 1490 | /* This is like find_composition, but find an automatic composition |
a28d4396 KH |
1491 | instead. It is assured that POS is not within a static |
1492 | composition. If found, set *GSTRING to the glyph-string | |
1493 | representing the composition, and return 1. Otherwise, *GSTRING to | |
1494 | Qnil, and return 0. */ | |
90b3fe91 KH |
1495 | |
1496 | static int | |
a28d4396 KH |
1497 | find_automatic_composition (EMACS_INT pos, EMACS_INT limit, |
1498 | EMACS_INT *start, EMACS_INT *end, | |
1499 | Lisp_Object *gstring, Lisp_Object string) | |
90b3fe91 KH |
1500 | { |
1501 | EMACS_INT head, tail, stop; | |
a28d4396 KH |
1502 | /* Forward limit position of checking a composition taking a |
1503 | looking-back count into account. */ | |
895416e3 | 1504 | EMACS_INT fore_check_limit; |
a28d4396 | 1505 | struct position_record cur, prev; |
90b3fe91 | 1506 | int c; |
29fb7306 | 1507 | Lisp_Object window; |
90b3fe91 | 1508 | struct window *w; |
a28d4396 | 1509 | int need_adjustment = 0; |
90b3fe91 | 1510 | |
3eda4b19 | 1511 | window = Fget_buffer_window (Fcurrent_buffer (), Qnil); |
29fb7306 KH |
1512 | if (NILP (window)) |
1513 | return 0; | |
1514 | w = XWINDOW (window); | |
1515 | ||
a28d4396 | 1516 | cur.pos = pos; |
90b3fe91 KH |
1517 | if (NILP (string)) |
1518 | { | |
1519 | head = BEGV, tail = ZV, stop = GPT; | |
a28d4396 KH |
1520 | cur.pos_byte = CHAR_TO_BYTE (cur.pos); |
1521 | cur.p = BYTE_POS_ADDR (cur.pos_byte); | |
90b3fe91 KH |
1522 | } |
1523 | else | |
1524 | { | |
1525 | head = 0, tail = SCHARS (string), stop = -1; | |
a28d4396 KH |
1526 | cur.pos_byte = string_char_to_byte (string, cur.pos); |
1527 | cur.p = SDATA (string) + cur.pos_byte; | |
90b3fe91 | 1528 | } |
a28d4396 KH |
1529 | if (limit < 0) |
1530 | /* Finding a composition covering the character after POS is the | |
1531 | same as setting LIMIT to POS. */ | |
1532 | limit = pos; | |
1533 | if (limit <= pos) | |
1534 | fore_check_limit = min (tail, pos + 1 + MAX_AUTO_COMPOSITION_LOOKBACK); | |
90b3fe91 | 1535 | else |
895416e3 | 1536 | fore_check_limit = min (tail, limit + MAX_AUTO_COMPOSITION_LOOKBACK); |
90b3fe91 | 1537 | |
a28d4396 | 1538 | /* Provided that we have these possible compositions now: |
895416e3 | 1539 | |
a28d4396 KH |
1540 | POS: 1 2 3 4 5 6 7 8 9 |
1541 | |-A-| | |
1542 | |-B-|-C-|--D--| | |
895416e3 | 1543 | |
a28d4396 KH |
1544 | Here, it is known that characters after positions 1 and 9 can |
1545 | never be composed (i.e. ! CHAR_COMPOSABLE_P (CH)), and | |
1546 | composition A is an invalid one because it's partially covered by | |
1547 | the valid composition C. And to know whether a composition is | |
1548 | valid or not, the only way is to start searching forward from a | |
1549 | position that can not be a tail part of composition (it's 2 in | |
1550 | the above case). | |
1551 | ||
1552 | Now we have these cases (1 through 4): | |
1553 | ||
1554 | -- character after POS is ... -- | |
1555 | not composable composable | |
1556 | LIMIT <= POS (1) (3) | |
1557 | POS < LIMIT (2) (4) | |
1558 | ||
1559 | Among them, in case (2), we simply search forward from POS. | |
1560 | ||
1561 | In the other cases, we at first rewind back to the position where | |
1562 | the previous character is not composable or the beginning of | |
1563 | buffer (string), then search compositions forward. In case (1) | |
1564 | and (3) we repeat this process until a composition is found. */ | |
1565 | ||
1566 | while (1) | |
1567 | { | |
62a6e103 | 1568 | c = STRING_CHAR (cur.p); |
90b3fe91 | 1569 | if (! CHAR_COMPOSABLE_P (c)) |
90b3fe91 | 1570 | { |
a28d4396 KH |
1571 | if (limit <= pos) /* case (1) */ |
1572 | { | |
1573 | do { | |
31bfc35c | 1574 | if (cur.pos <= limit) |
a28d4396 KH |
1575 | return 0; |
1576 | BACKWARD_CHAR (cur, stop); | |
1577 | c = STRING_CHAR (cur.p); | |
1578 | } while (! CHAR_COMPOSABLE_P (c)); | |
1579 | fore_check_limit = cur.pos + 1; | |
1580 | } | |
1581 | else /* case (2) */ | |
1582 | /* No need of rewinding back. */ | |
1583 | goto search_forward; | |
1584 | } | |
90b3fe91 | 1585 | |
a28d4396 KH |
1586 | /* Rewind back to the position where we can safely search |
1587 | forward for compositions. It is assured that the character | |
1588 | at cur.pos is composable. */ | |
1589 | while (head < cur.pos) | |
1590 | { | |
1591 | prev = cur; | |
1592 | BACKWARD_CHAR (cur, stop); | |
1593 | c = STRING_CHAR (cur.p); | |
1594 | if (! CHAR_COMPOSABLE_P (c)) | |
90b3fe91 | 1595 | { |
a28d4396 KH |
1596 | cur = prev; |
1597 | break; | |
90b3fe91 | 1598 | } |
a28d4396 KH |
1599 | } |
1600 | ||
1601 | search_forward: | |
1602 | /* Now search forward. */ | |
1603 | *gstring = Qnil; | |
1604 | prev = cur; /* remember the start of searching position. */ | |
1605 | while (cur.pos < fore_check_limit) | |
1606 | { | |
1607 | Lisp_Object val; | |
1608 | ||
1609 | c = STRING_CHAR (cur.p); | |
1610 | for (val = CHAR_TABLE_REF (Vcomposition_function_table, c); | |
1611 | CONSP (val); val = XCDR (val)) | |
90b3fe91 | 1612 | { |
a28d4396 KH |
1613 | Lisp_Object elt = XCAR (val); |
1614 | ||
1615 | if (VECTORP (elt) && ASIZE (elt) == 3 && NATNUMP (AREF (elt, 1))) | |
90b3fe91 | 1616 | { |
a28d4396 KH |
1617 | EMACS_INT check_pos = cur.pos - XFASTINT (AREF (elt, 1)); |
1618 | struct position_record check; | |
1619 | ||
1620 | if (check_pos < head | |
1621 | || (limit <= pos ? pos < check_pos | |
1622 | : limit <= check_pos)) | |
1623 | continue; | |
1624 | for (check = cur; check_pos < check.pos; ) | |
1625 | BACKWARD_CHAR (check, stop); | |
1626 | *gstring = autocmp_chars (elt, check.pos, check.pos_byte, | |
1627 | tail, w, NULL, string); | |
90b3fe91 | 1628 | need_adjustment = 1; |
a28d4396 | 1629 | if (NILP (*gstring)) |
90b3fe91 | 1630 | { |
a28d4396 KH |
1631 | /* As we have called Lisp, there's a possibility |
1632 | that buffer/string is relocated. */ | |
1633 | if (NILP (string)) | |
1634 | cur.p = BYTE_POS_ADDR (cur.pos_byte); | |
1635 | else | |
1636 | cur.p = SDATA (string) + cur.pos_byte; | |
1637 | } | |
1638 | else | |
1639 | { | |
1640 | /* We found a candidate of a target composition. */ | |
90b3fe91 KH |
1641 | *start = check.pos; |
1642 | *end = check.pos + LGSTRING_CHAR_LEN (*gstring); | |
a28d4396 KH |
1643 | if (pos < limit |
1644 | ? pos < *end | |
1645 | : *start <= pos && pos < *end) | |
1646 | /* This is the target composition. */ | |
90b3fe91 KH |
1647 | return 1; |
1648 | cur.pos = *end; | |
a28d4396 KH |
1649 | if (NILP (string)) |
1650 | { | |
1651 | cur.pos_byte = CHAR_TO_BYTE (cur.pos); | |
1652 | cur.p = BYTE_POS_ADDR (cur.pos_byte); | |
1653 | } | |
1654 | else | |
1655 | { | |
1656 | cur.pos_byte = string_char_to_byte (string, cur.pos); | |
1657 | cur.p = SDATA (string) + cur.pos_byte; | |
1658 | } | |
90b3fe91 KH |
1659 | break; |
1660 | } | |
1661 | } | |
1662 | } | |
a28d4396 KH |
1663 | if (! CONSP (val)) |
1664 | /* We found no composition here. */ | |
90b3fe91 | 1665 | FORWARD_CHAR (cur, stop); |
90b3fe91 | 1666 | } |
a28d4396 KH |
1667 | |
1668 | if (pos < limit) /* case (2) and (4)*/ | |
1669 | return 0; | |
1670 | if (! NILP (*gstring)) | |
1671 | return 1; | |
1672 | if (prev.pos == head) | |
1673 | return 0; | |
90b3fe91 | 1674 | cur = prev; |
a28d4396 KH |
1675 | if (need_adjustment) |
1676 | { | |
1677 | if (NILP (string)) | |
1678 | cur.p = BYTE_POS_ADDR (cur.pos_byte); | |
1679 | else | |
1680 | cur.p = SDATA (string) + cur.pos_byte; | |
1681 | } | |
90b3fe91 | 1682 | BACKWARD_CHAR (cur, stop); |
90b3fe91 | 1683 | } |
90b3fe91 KH |
1684 | } |
1685 | ||
e614ea00 KH |
1686 | /* Return the adjusted point provided that point is moved from LAST_PT |
1687 | to NEW_PT. */ | |
1688 | ||
41118bd3 | 1689 | EMACS_INT |
971de7fb | 1690 | composition_adjust_point (EMACS_INT last_pt, EMACS_INT new_pt) |
58753d74 | 1691 | { |
5eb55db9 | 1692 | EMACS_INT i, beg, end; |
90b3fe91 | 1693 | Lisp_Object val; |
58753d74 | 1694 | |
e614ea00 KH |
1695 | if (new_pt == BEGV || new_pt == ZV) |
1696 | return new_pt; | |
58753d74 | 1697 | |
90b3fe91 | 1698 | /* At first check the static composition. */ |
e614ea00 | 1699 | if (get_property_and_range (new_pt, Qcomposition, &val, &beg, &end, Qnil) |
895416e3 KH |
1700 | && COMPOSITION_VALID_P (beg, end, val)) |
1701 | { | |
e614ea00 | 1702 | if (beg < new_pt /* && end > new_pt <- It's always the case. */ |
895416e3 | 1703 | && (last_pt <= beg || last_pt >= end)) |
e614ea00 KH |
1704 | return (new_pt < last_pt ? beg : end); |
1705 | return new_pt; | |
895416e3 | 1706 | } |
58753d74 | 1707 | |
4b4deea2 | 1708 | if (NILP (BVAR (current_buffer, enable_multibyte_characters)) |
d9a7c140 | 1709 | || NILP (Vauto_composition_mode)) |
e614ea00 | 1710 | return new_pt; |
58753d74 | 1711 | |
90b3fe91 | 1712 | /* Next check the automatic composition. */ |
e614ea00 KH |
1713 | if (! find_automatic_composition (new_pt, (EMACS_INT) -1, &beg, &end, &val, |
1714 | Qnil) | |
1715 | || beg == new_pt) | |
1716 | return new_pt; | |
90b3fe91 | 1717 | for (i = 0; i < LGSTRING_GLYPH_LEN (val); i++) |
58753d74 | 1718 | { |
90b3fe91 | 1719 | Lisp_Object glyph = LGSTRING_GLYPH (val, i); |
58753d74 | 1720 | |
90b3fe91 KH |
1721 | if (NILP (glyph)) |
1722 | break; | |
e614ea00 KH |
1723 | if (beg + LGLYPH_FROM (glyph) == new_pt) |
1724 | return new_pt; | |
1725 | if (beg + LGLYPH_TO (glyph) >= new_pt) | |
1726 | return (new_pt < last_pt | |
90b3fe91 KH |
1727 | ? beg + LGLYPH_FROM (glyph) |
1728 | : beg + LGLYPH_TO (glyph) + 1); | |
58753d74 | 1729 | } |
e614ea00 | 1730 | return new_pt; |
58753d74 KH |
1731 | } |
1732 | ||
1733 | DEFUN ("composition-get-gstring", Fcomposition_get_gstring, | |
1734 | Scomposition_get_gstring, 4, 4, 0, | |
1735 | doc: /* Return a glyph-string for characters between FROM and TO. | |
9d751859 | 1736 | If the glyph string is for graphic display, FONT-OBJECT must be |
58753d74 | 1737 | a font-object to use for those characters. |
f5199465 KH |
1738 | Otherwise (for terminal display), FONT-OBJECT must be a terminal ID, a |
1739 | frame, or nil for the selected frame's terminal device. | |
58753d74 KH |
1740 | |
1741 | If the optional 4th argument STRING is not nil, it is a string | |
1742 | containing the target characters between indices FROM and TO. | |
1743 | ||
9d751859 EZ |
1744 | A glyph-string is a vector containing information about how to display |
1745 | a specific character sequence. The format is: | |
58753d74 KH |
1746 | [HEADER ID GLYPH ...] |
1747 | ||
1748 | HEADER is a vector of this form: | |
1749 | [FONT-OBJECT CHAR ...] | |
1750 | where | |
1751 | FONT-OBJECT is a font-object for all glyphs in the glyph-string, | |
f5199465 | 1752 | or the terminal coding system of the specified terminal. |
58753d74 KH |
1753 | CHARs are characters to be composed by GLYPHs. |
1754 | ||
1755 | ID is an identification number of the glyph-string. It may be nil if | |
1756 | not yet shaped. | |
1757 | ||
9d751859 | 1758 | GLYPH is a vector whose elements have this form: |
58753d74 KH |
1759 | [ FROM-IDX TO-IDX C CODE WIDTH LBEARING RBEARING ASCENT DESCENT |
1760 | [ [X-OFF Y-OFF WADJUST] | nil] ] | |
1761 | where | |
1762 | FROM-IDX and TO-IDX are used internally and should not be touched. | |
1763 | C is the character of the glyph. | |
1764 | CODE is the glyph-code of C in FONT-OBJECT. | |
1765 | WIDTH thru DESCENT are the metrics (in pixels) of the glyph. | |
9d751859 | 1766 | X-OFF and Y-OFF are offsets to the base position for the glyph. |
58753d74 KH |
1767 | WADJUST is the adjustment to the normal width of the glyph. |
1768 | ||
9d751859 EZ |
1769 | If GLYPH is nil, the remaining elements of the glyph-string vector |
1770 | should be ignored. */) | |
5842a27b | 1771 | (Lisp_Object from, Lisp_Object to, Lisp_Object font_object, Lisp_Object string) |
58753d74 KH |
1772 | { |
1773 | Lisp_Object gstring, header; | |
46f905e1 | 1774 | EMACS_INT frompos, topos; |
58753d74 | 1775 | |
ea8ba975 KH |
1776 | CHECK_NATNUM (from); |
1777 | CHECK_NATNUM (to); | |
f5199465 KH |
1778 | if (! FONT_OBJECT_P (font_object)) |
1779 | { | |
1780 | struct coding_system *coding; | |
1781 | struct terminal *terminal = get_terminal (font_object, 1); | |
1782 | ||
1783 | coding = ((TERMINAL_TERMINAL_CODING (terminal)->common_flags | |
1784 | & CODING_REQUIRE_ENCODING_MASK) | |
1785 | ? TERMINAL_TERMINAL_CODING (terminal) : &safe_terminal_coding); | |
1786 | font_object = CODING_ID_NAME (coding->id); | |
1787 | } | |
1788 | ||
58753d74 KH |
1789 | header = fill_gstring_header (Qnil, from, to, font_object, string); |
1790 | gstring = gstring_lookup_cache (header); | |
1791 | if (! NILP (gstring)) | |
1792 | return gstring; | |
46f905e1 | 1793 | |
ea8ba975 KH |
1794 | frompos = XINT (from); |
1795 | topos = XINT (to); | |
46f905e1 SM |
1796 | if (LGSTRING_GLYPH_LEN (gstring_work) < topos - frompos) |
1797 | gstring_work = Fmake_vector (make_number (topos - frompos + 2), Qnil); | |
58753d74 KH |
1798 | LGSTRING_SET_HEADER (gstring_work, header); |
1799 | LGSTRING_SET_ID (gstring_work, Qnil); | |
1800 | fill_gstring_body (gstring_work); | |
1801 | return gstring_work; | |
1802 | } | |
1803 | ||
ca4c9455 KH |
1804 | \f |
1805 | /* Emacs Lisp APIs. */ | |
1806 | ||
1807 | DEFUN ("compose-region-internal", Fcompose_region_internal, | |
1808 | Scompose_region_internal, 2, 4, 0, | |
335c5470 PJ |
1809 | doc: /* Internal use only. |
1810 | ||
1811 | Compose text in the region between START and END. | |
1812 | Optional 3rd and 4th arguments are COMPONENTS and MODIFICATION-FUNC | |
9d751859 | 1813 | for the composition. See `compose-region' for more details. */) |
5842a27b | 1814 | (Lisp_Object start, Lisp_Object end, Lisp_Object components, Lisp_Object modification_func) |
ca4c9455 KH |
1815 | { |
1816 | validate_region (&start, &end); | |
1817 | if (!NILP (components) | |
1818 | && !INTEGERP (components) | |
1819 | && !CONSP (components) | |
1820 | && !STRINGP (components)) | |
b7826503 | 1821 | CHECK_VECTOR (components); |
ca4c9455 | 1822 | |
d562f8ab | 1823 | compose_text (XINT (start), XINT (end), components, modification_func, Qnil); |
ca4c9455 KH |
1824 | return Qnil; |
1825 | } | |
1826 | ||
1827 | DEFUN ("compose-string-internal", Fcompose_string_internal, | |
1828 | Scompose_string_internal, 3, 5, 0, | |
335c5470 PJ |
1829 | doc: /* Internal use only. |
1830 | ||
1831 | Compose text between indices START and END of STRING. | |
1832 | Optional 4th and 5th arguments are COMPONENTS and MODIFICATION-FUNC | |
9d751859 | 1833 | for the composition. See `compose-string' for more details. */) |
5842a27b | 1834 | (Lisp_Object string, Lisp_Object start, Lisp_Object end, Lisp_Object components, Lisp_Object modification_func) |
ca4c9455 | 1835 | { |
b7826503 PJ |
1836 | CHECK_STRING (string); |
1837 | CHECK_NUMBER (start); | |
1838 | CHECK_NUMBER (end); | |
ca4c9455 KH |
1839 | |
1840 | if (XINT (start) < 0 || | |
1841 | XINT (start) > XINT (end) | |
d5db4077 | 1842 | || XINT (end) > SCHARS (string)) |
ca4c9455 KH |
1843 | args_out_of_range (start, end); |
1844 | ||
d562f8ab | 1845 | compose_text (XINT (start), XINT (end), components, modification_func, string); |
ca4c9455 KH |
1846 | return string; |
1847 | } | |
1848 | ||
1849 | DEFUN ("find-composition-internal", Ffind_composition_internal, | |
177c0ea7 | 1850 | Sfind_composition_internal, 4, 4, 0, |
335c5470 PJ |
1851 | doc: /* Internal use only. |
1852 | ||
1853 | Return information about composition at or nearest to position POS. | |
9d751859 | 1854 | See `find-composition' for more details. */) |
5842a27b | 1855 | (Lisp_Object pos, Lisp_Object limit, Lisp_Object string, Lisp_Object detail_p) |
ca4c9455 | 1856 | { |
90b3fe91 KH |
1857 | Lisp_Object prop, tail, gstring; |
1858 | EMACS_INT start, end, from, to; | |
ca4c9455 KH |
1859 | int id; |
1860 | ||
b7826503 | 1861 | CHECK_NUMBER_COERCE_MARKER (pos); |
90b3fe91 | 1862 | from = XINT (pos); |
ca4c9455 KH |
1863 | if (!NILP (limit)) |
1864 | { | |
b7826503 | 1865 | CHECK_NUMBER_COERCE_MARKER (limit); |
90b3fe91 | 1866 | to = XINT (limit); |
ca4c9455 KH |
1867 | } |
1868 | else | |
90b3fe91 | 1869 | to = -1; |
177c0ea7 | 1870 | |
ca4c9455 | 1871 | if (!NILP (string)) |
e3b3e327 | 1872 | { |
b7826503 | 1873 | CHECK_STRING (string); |
d5db4077 | 1874 | if (XINT (pos) < 0 || XINT (pos) > SCHARS (string)) |
e3b3e327 GM |
1875 | args_out_of_range (string, pos); |
1876 | } | |
1877 | else | |
1878 | { | |
fa9090b8 | 1879 | if (XINT (pos) < BEGV || XINT (pos) > ZV) |
e3b3e327 GM |
1880 | args_out_of_range (Fcurrent_buffer (), pos); |
1881 | } | |
ca4c9455 | 1882 | |
90b3fe91 KH |
1883 | if (!find_composition (from, to, &start, &end, &prop, string)) |
1884 | { | |
4b4deea2 | 1885 | if (!NILP (BVAR (current_buffer, enable_multibyte_characters)) |
d9a7c140 | 1886 | && ! NILP (Vauto_composition_mode) |
90b3fe91 KH |
1887 | && find_automatic_composition (from, to, &start, &end, &gstring, |
1888 | string)) | |
1889 | return list3 (make_number (start), make_number (end), gstring); | |
1890 | return Qnil; | |
1891 | } | |
1892 | if ((end <= XINT (pos) || start > XINT (pos))) | |
1893 | { | |
1894 | EMACS_INT s, e; | |
1895 | ||
1896 | if (find_automatic_composition (from, to, &s, &e, &gstring, string) | |
1897 | && (e <= XINT (pos) ? e > end : s < start)) | |
fcebfc6a | 1898 | return list3 (make_number (s), make_number (e), gstring); |
90b3fe91 | 1899 | } |
ca4c9455 KH |
1900 | if (!COMPOSITION_VALID_P (start, end, prop)) |
1901 | return Fcons (make_number (start), Fcons (make_number (end), | |
1902 | Fcons (Qnil, Qnil))); | |
1903 | if (NILP (detail_p)) | |
1904 | return Fcons (make_number (start), Fcons (make_number (end), | |
1905 | Fcons (Qt, Qnil))); | |
1906 | ||
1907 | if (COMPOSITION_REGISTERD_P (prop)) | |
1908 | id = COMPOSITION_ID (prop); | |
1909 | else | |
1910 | { | |
579c18d0 EZ |
1911 | EMACS_INT start_byte = (NILP (string) |
1912 | ? CHAR_TO_BYTE (start) | |
1913 | : string_char_to_byte (string, start)); | |
ca4c9455 KH |
1914 | id = get_composition_id (start, start_byte, end - start, prop, string); |
1915 | } | |
1916 | ||
1917 | if (id >= 0) | |
1918 | { | |
1919 | Lisp_Object components, relative_p, mod_func; | |
1920 | enum composition_method method = COMPOSITION_METHOD (prop); | |
1921 | int width = composition_table[id]->width; | |
1922 | ||
1923 | components = Fcopy_sequence (COMPOSITION_COMPONENTS (prop)); | |
1924 | relative_p = (method == COMPOSITION_WITH_RULE_ALTCHARS | |
1925 | ? Qnil : Qt); | |
1926 | mod_func = COMPOSITION_MODIFICATION_FUNC (prop); | |
1927 | tail = Fcons (components, | |
1928 | Fcons (relative_p, | |
1929 | Fcons (mod_func, | |
1930 | Fcons (make_number (width), Qnil)))); | |
1931 | } | |
1932 | else | |
1933 | tail = Qnil; | |
1934 | ||
1935 | return Fcons (make_number (start), Fcons (make_number (end), tail)); | |
1936 | } | |
1937 | ||
1938 | \f | |
1939 | void | |
971de7fb | 1940 | syms_of_composite (void) |
ca4c9455 | 1941 | { |
58753d74 KH |
1942 | int i; |
1943 | ||
cd3520a4 | 1944 | DEFSYM (Qcomposition, "composition"); |
ca4c9455 | 1945 | |
58753d74 | 1946 | /* Make a hash table for static composition. */ |
ca4c9455 | 1947 | { |
09654086 | 1948 | Lisp_Object args[6]; |
177c0ea7 | 1949 | |
ca4c9455 KH |
1950 | args[0] = QCtest; |
1951 | args[1] = Qequal; | |
1952 | args[2] = QCweakness; | |
dc47eccc | 1953 | /* We used to make the hash table weak so that unreferenced |
ca101cff | 1954 | compositions can be garbage-collected. But, usually once |
dc47eccc KH |
1955 | created compositions are repeatedly used in an Emacs session, |
1956 | and thus it's not worth to save memory in such a way. So, we | |
1957 | make the table not weak. */ | |
6a83ee8a | 1958 | args[3] = Qnil; |
ca4c9455 KH |
1959 | args[4] = QCsize; |
1960 | args[5] = make_number (311); | |
09654086 | 1961 | composition_hash_table = Fmake_hash_table (6, args); |
ca4c9455 KH |
1962 | staticpro (&composition_hash_table); |
1963 | } | |
1964 | ||
58753d74 KH |
1965 | /* Make a hash table for glyph-string. */ |
1966 | { | |
1967 | Lisp_Object args[6]; | |
58753d74 KH |
1968 | args[0] = QCtest; |
1969 | args[1] = Qequal; | |
1970 | args[2] = QCweakness; | |
1971 | args[3] = Qnil; | |
1972 | args[4] = QCsize; | |
1973 | args[5] = make_number (311); | |
1974 | gstring_hash_table = Fmake_hash_table (6, args); | |
1975 | staticpro (&gstring_hash_table); | |
1976 | } | |
1977 | ||
1978 | staticpro (&gstring_work_headers); | |
1979 | gstring_work_headers = Fmake_vector (make_number (8), Qnil); | |
1980 | for (i = 0; i < 8; i++) | |
1981 | ASET (gstring_work_headers, i, Fmake_vector (make_number (i + 2), Qnil)); | |
1982 | staticpro (&gstring_work); | |
1983 | gstring_work = Fmake_vector (make_number (10), Qnil); | |
1984 | ||
ca4c9455 KH |
1985 | /* Text property `composition' should be nonsticky by default. */ |
1986 | Vtext_property_default_nonsticky | |
1987 | = Fcons (Fcons (Qcomposition, Qt), Vtext_property_default_nonsticky); | |
1988 | ||
29208e82 | 1989 | DEFVAR_LISP ("compose-chars-after-function", Vcompose_chars_after_function, |
335c5470 PJ |
1990 | doc: /* Function to adjust composition of buffer text. |
1991 | ||
9d751859 EZ |
1992 | This function is called with three arguments: FROM, TO, and OBJECT. |
1993 | FROM and TO specify the range of text whose composition should be | |
335c5470 PJ |
1994 | adjusted. OBJECT, if non-nil, is a string that contains the text. |
1995 | ||
1996 | This function is called after a text with `composition' property is | |
1997 | inserted or deleted to keep `composition' property of buffer text | |
1998 | valid. | |
1999 | ||
2000 | The default value is the function `compose-chars-after'. */); | |
d67b4f80 | 2001 | Vcompose_chars_after_function = intern_c_string ("compose-chars-after"); |
ca4c9455 | 2002 | |
cd3520a4 JB |
2003 | DEFSYM (Qauto_composed, "auto-composed"); |
2004 | DEFSYM (Qauto_composition_function, "auto-composition-function"); | |
40add26d | 2005 | |
29208e82 | 2006 | DEFVAR_LISP ("auto-composition-mode", Vauto_composition_mode, |
d9a7c140 KH |
2007 | doc: /* Non-nil if Auto-Composition mode is enabled. |
2008 | Use the command `auto-composition-mode' to change this variable. */); | |
2009 | Vauto_composition_mode = Qt; | |
2010 | ||
29208e82 | 2011 | DEFVAR_LISP ("auto-composition-function", Vauto_composition_function, |
f96ba4c1 | 2012 | doc: /* Function to call to compose characters automatically. |
9d751859 | 2013 | This function is called from the display routine with four arguments: |
ddc872ba | 2014 | FROM, TO, WINDOW, and STRING. |
335c5470 | 2015 | |
ddc872ba KH |
2016 | If STRING is nil, the function must compose characters in the region |
2017 | between FROM and TO in the current buffer. | |
335c5470 | 2018 | |
ddc872ba KH |
2019 | Otherwise, STRING is a string, and FROM and TO are indices into the |
2020 | string. In this case, the function must compose characters in the | |
2021 | string. */); | |
f96ba4c1 | 2022 | Vauto_composition_function = Qnil; |
40add26d | 2023 | |
29208e82 | 2024 | DEFVAR_LISP ("composition-function-table", Vcomposition_function_table, |
9d751859 | 2025 | doc: /* Char-table of functions for automatic character composition. |
58753d74 KH |
2026 | For each character that has to be composed automatically with |
2027 | preceding and/or following characters, this char-table contains | |
2028 | a function to call to compose that character. | |
2029 | ||
2030 | The element at index C in the table, if non-nil, is a list of | |
10f72a37 | 2031 | composition rules of this form: ([PATTERN PREV-CHARS FUNC] ...) |
58753d74 | 2032 | |
9d751859 | 2033 | PATTERN is a regular expression which C and the surrounding |
58753d74 KH |
2034 | characters must match. |
2035 | ||
895416e3 KH |
2036 | PREV-CHARS is a non-negative integer (less than 4) specifying how many |
2037 | characters before C to check the matching with PATTERN. If it is 0, | |
2038 | PATTERN must match C and the following characters. If it is 1, | |
2039 | PATTERN must match a character before C and the following characters. | |
58753d74 KH |
2040 | |
2041 | If PREV-CHARS is 0, PATTERN can be nil, which means that the | |
2042 | single character C should be composed. | |
2043 | ||
2044 | FUNC is a function to return a glyph-string representing a | |
9d751859 | 2045 | composition of the characters that match PATTERN. It is |
58753d74 KH |
2046 | called with one argument GSTRING. |
2047 | ||
2048 | GSTRING is a template of a glyph-string to return. It is already | |
2049 | filled with a proper header for the characters to compose, and | |
2050 | glyphs corresponding to those characters one by one. The | |
9d751859 | 2051 | function must return a new glyph-string with the same header as |
58753d74 KH |
2052 | GSTRING, or modify GSTRING itself and return it. |
2053 | ||
2054 | See also the documentation of `auto-composition-mode'. */); | |
2055 | Vcomposition_function_table = Fmake_char_table (Qnil, Qnil); | |
2056 | ||
ca4c9455 KH |
2057 | defsubr (&Scompose_region_internal); |
2058 | defsubr (&Scompose_string_internal); | |
2059 | defsubr (&Sfind_composition_internal); | |
58753d74 | 2060 | defsubr (&Scomposition_get_gstring); |
ca4c9455 | 2061 | } |