Commit | Line | Data |
---|---|---|
4ed46869 | 1 | /* CCL (Code Conversion Language) interpreter. |
ba318903 | 2 | Copyright (C) 2001-2014 Free Software Foundation, Inc. |
7976eda0 | 3 | Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, |
5df4f04c | 4 | 2005, 2006, 2007, 2008, 2009, 2010, 2011 |
ce03bf76 KH |
5 | National Institute of Advanced Industrial Science and Technology (AIST) |
6 | Registration Number H14PRO021 | |
8f924df7 | 7 | Copyright (C) 2003 |
c10842ea KH |
8 | National Institute of Advanced Industrial Science and Technology (AIST) |
9 | Registration Number H13PRO009 | |
4ed46869 | 10 | |
369314dc KH |
11 | This file is part of GNU Emacs. |
12 | ||
9ec0b715 | 13 | GNU Emacs is free software: you can redistribute it and/or modify |
369314dc | 14 | it under the terms of the GNU General Public License as published by |
9ec0b715 GM |
15 | the Free Software Foundation, either version 3 of the License, or |
16 | (at your option) any later version. | |
4ed46869 | 17 | |
369314dc KH |
18 | GNU Emacs is distributed in the hope that it will be useful, |
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
21 | GNU General Public License for more details. | |
4ed46869 | 22 | |
369314dc | 23 | You should have received a copy of the GNU General Public License |
9ec0b715 | 24 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
4ed46869 | 25 | |
4ed46869 | 26 | #include <config.h> |
dfcf069d | 27 | |
68c45bf0 | 28 | #include <stdio.h> |
61838453 | 29 | #include <limits.h> |
68c45bf0 | 30 | |
4ed46869 | 31 | #include "lisp.h" |
c10842ea | 32 | #include "character.h" |
4ed46869 KH |
33 | #include "charset.h" |
34 | #include "ccl.h" | |
35 | #include "coding.h" | |
36 | ||
c10842ea KH |
37 | Lisp_Object Qccl, Qcclp; |
38 | ||
737b5223 | 39 | /* This symbol is a property which associates with ccl program vector. |
6ae21908 | 40 | Ex: (get 'ccl-big5-encoder 'ccl-program) returns ccl program vector. */ |
955cbe7b | 41 | static Lisp_Object Qccl_program; |
e34b1164 | 42 | |
8146262a KH |
43 | /* These symbols are properties which associate with code conversion |
44 | map and their ID respectively. */ | |
955cbe7b PE |
45 | static Lisp_Object Qcode_conversion_map; |
46 | static Lisp_Object Qcode_conversion_map_id; | |
e34b1164 | 47 | |
6ae21908 | 48 | /* Symbols of ccl program have this property, a value of the property |
e1dbe924 | 49 | is an index for Vccl_program_table. */ |
955cbe7b | 50 | static Lisp_Object Qccl_program_idx; |
6ae21908 | 51 | |
5232fa7b | 52 | /* Table of registered CCL programs. Each element is a vector of |
2a69c66e KH |
53 | NAME, CCL_PROG, RESOLVEDP, and UPDATEDP, where NAME (symbol) is the |
54 | name of the program, CCL_PROG (vector) is the compiled code of the | |
55 | program, RESOLVEDP (t or nil) is the flag to tell if symbols in | |
56 | CCL_PROG is already resolved to index numbers or not, UPDATEDP (t | |
57 | or nil) is the flat to tell if the CCL program is updated after it | |
58 | was once used. */ | |
127198fd | 59 | static Lisp_Object Vccl_program_table; |
4ed46869 | 60 | |
d80dc57e DL |
61 | /* Return a hash table of id number ID. */ |
62 | #define GET_HASH_TABLE(id) \ | |
28be1ada | 63 | (XHASH_TABLE (XCDR (AREF (Vtranslation_hash_table_vector, (id))))) |
d80dc57e | 64 | |
4ed46869 KH |
65 | /* CCL (Code Conversion Language) is a simple language which has |
66 | operations on one input buffer, one output buffer, and 7 registers. | |
67 | The syntax of CCL is described in `ccl.el'. Emacs Lisp function | |
68 | `ccl-compile' compiles a CCL program and produces a CCL code which | |
69 | is a vector of integers. The structure of this vector is as | |
70 | follows: The 1st element: buffer-magnification, a factor for the | |
71 | size of output buffer compared with the size of input buffer. The | |
72 | 2nd element: address of CCL code to be executed when encountered | |
73 | with end of input stream. The 3rd and the remaining elements: CCL | |
74 | codes. */ | |
75 | ||
76 | /* Header of CCL compiled code */ | |
77 | #define CCL_HEADER_BUF_MAG 0 | |
78 | #define CCL_HEADER_EOF 1 | |
79 | #define CCL_HEADER_MAIN 2 | |
80 | ||
e003a292 PE |
81 | /* CCL code is a sequence of 28-bit integers. Each contains a CCL |
82 | command and/or arguments in the following format: | |
4ed46869 KH |
83 | |
84 | |----------------- integer (28-bit) ------------------| | |
85 | |------- 17-bit ------|- 3-bit --|- 3-bit --|- 5-bit -| | |
86 | |--constant argument--|-register-|-register-|-command-| | |
87 | ccccccccccccccccc RRR rrr XXXXX | |
88 | or | |
89 | |------- relative address -------|-register-|-command-| | |
90 | cccccccccccccccccccc rrr XXXXX | |
91 | or | |
92 | |------------- constant or other args ----------------| | |
93 | cccccccccccccccccccccccccccc | |
94 | ||
b9627cfb PE |
95 | where `cc...c' is a 17-bit, 20-bit, or 28-bit integer indicating a |
96 | constant value or a relative/absolute jump address, `RRR' | |
4ed46869 KH |
97 | and `rrr' are CCL register number, `XXXXX' is one of the following |
98 | CCL commands. */ | |
99 | ||
30569699 | 100 | #define CCL_CODE_MAX ((1 << (28 - 1)) - 1) |
e003a292 | 101 | #define CCL_CODE_MIN (-1 - CCL_CODE_MAX) |
30569699 | 102 | |
4ed46869 KH |
103 | /* CCL commands |
104 | ||
105 | Each comment fields shows one or more lines for command syntax and | |
106 | the following lines for semantics of the command. In semantics, IC | |
107 | stands for Instruction Counter. */ | |
108 | ||
109 | #define CCL_SetRegister 0x00 /* Set register a register value: | |
110 | 1:00000000000000000RRRrrrXXXXX | |
111 | ------------------------------ | |
112 | reg[rrr] = reg[RRR]; | |
113 | */ | |
114 | ||
115 | #define CCL_SetShortConst 0x01 /* Set register a short constant value: | |
116 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
117 | ------------------------------ | |
118 | reg[rrr] = CCCCCCCCCCCCCCCCCCC; | |
119 | */ | |
120 | ||
121 | #define CCL_SetConst 0x02 /* Set register a constant value: | |
122 | 1:00000000000000000000rrrXXXXX | |
123 | 2:CONSTANT | |
124 | ------------------------------ | |
125 | reg[rrr] = CONSTANT; | |
126 | IC++; | |
127 | */ | |
128 | ||
129 | #define CCL_SetArray 0x03 /* Set register an element of array: | |
130 | 1:CCCCCCCCCCCCCCCCCRRRrrrXXXXX | |
131 | 2:ELEMENT[0] | |
132 | 3:ELEMENT[1] | |
133 | ... | |
134 | ------------------------------ | |
135 | if (0 <= reg[RRR] < CC..C) | |
136 | reg[rrr] = ELEMENT[reg[RRR]]; | |
137 | IC += CC..C; | |
138 | */ | |
139 | ||
140 | #define CCL_Jump 0x04 /* Jump: | |
141 | 1:A--D--D--R--E--S--S-000XXXXX | |
142 | ------------------------------ | |
143 | IC += ADDRESS; | |
144 | */ | |
145 | ||
146 | /* Note: If CC..C is greater than 0, the second code is omitted. */ | |
147 | ||
148 | #define CCL_JumpCond 0x05 /* Jump conditional: | |
149 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
150 | ------------------------------ | |
151 | if (!reg[rrr]) | |
152 | IC += ADDRESS; | |
153 | */ | |
154 | ||
155 | ||
156 | #define CCL_WriteRegisterJump 0x06 /* Write register and jump: | |
157 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
158 | ------------------------------ | |
159 | write (reg[rrr]); | |
160 | IC += ADDRESS; | |
161 | */ | |
162 | ||
163 | #define CCL_WriteRegisterReadJump 0x07 /* Write register, read, and jump: | |
164 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
165 | 2:A--D--D--R--E--S--S-rrrYYYYY | |
166 | ----------------------------- | |
167 | write (reg[rrr]); | |
168 | IC++; | |
169 | read (reg[rrr]); | |
170 | IC += ADDRESS; | |
171 | */ | |
172 | /* Note: If read is suspended, the resumed execution starts from the | |
173 | second code (YYYYY == CCL_ReadJump). */ | |
174 | ||
175 | #define CCL_WriteConstJump 0x08 /* Write constant and jump: | |
176 | 1:A--D--D--R--E--S--S-000XXXXX | |
177 | 2:CONST | |
178 | ------------------------------ | |
179 | write (CONST); | |
180 | IC += ADDRESS; | |
181 | */ | |
182 | ||
183 | #define CCL_WriteConstReadJump 0x09 /* Write constant, read, and jump: | |
184 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
185 | 2:CONST | |
186 | 3:A--D--D--R--E--S--S-rrrYYYYY | |
187 | ----------------------------- | |
188 | write (CONST); | |
189 | IC += 2; | |
190 | read (reg[rrr]); | |
191 | IC += ADDRESS; | |
192 | */ | |
193 | /* Note: If read is suspended, the resumed execution starts from the | |
194 | second code (YYYYY == CCL_ReadJump). */ | |
195 | ||
196 | #define CCL_WriteStringJump 0x0A /* Write string and jump: | |
197 | 1:A--D--D--R--E--S--S-000XXXXX | |
198 | 2:LENGTH | |
c6589bbd | 199 | 3:000MSTRIN[0]STRIN[1]STRIN[2] |
4ed46869 KH |
200 | ... |
201 | ------------------------------ | |
c6589bbd KH |
202 | if (M) |
203 | write_multibyte_string (STRING, LENGTH); | |
204 | else | |
205 | write_string (STRING, LENGTH); | |
4ed46869 KH |
206 | IC += ADDRESS; |
207 | */ | |
208 | ||
209 | #define CCL_WriteArrayReadJump 0x0B /* Write an array element, read, and jump: | |
210 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
211 | 2:LENGTH | |
99d99081 PE |
212 | 3:ELEMENT[0] |
213 | 4:ELEMENT[1] | |
4ed46869 KH |
214 | ... |
215 | N:A--D--D--R--E--S--S-rrrYYYYY | |
216 | ------------------------------ | |
217 | if (0 <= reg[rrr] < LENGTH) | |
218 | write (ELEMENT[reg[rrr]]); | |
219 | IC += LENGTH + 2; (... pointing at N+1) | |
220 | read (reg[rrr]); | |
221 | IC += ADDRESS; | |
222 | */ | |
223 | /* Note: If read is suspended, the resumed execution starts from the | |
887bfbd7 | 224 | Nth code (YYYYY == CCL_ReadJump). */ |
4ed46869 KH |
225 | |
226 | #define CCL_ReadJump 0x0C /* Read and jump: | |
227 | 1:A--D--D--R--E--S--S-rrrYYYYY | |
228 | ----------------------------- | |
229 | read (reg[rrr]); | |
230 | IC += ADDRESS; | |
231 | */ | |
232 | ||
233 | #define CCL_Branch 0x0D /* Jump by branch table: | |
234 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
235 | 2:A--D--D--R--E-S-S[0]000XXXXX | |
236 | 3:A--D--D--R--E-S-S[1]000XXXXX | |
237 | ... | |
238 | ------------------------------ | |
239 | if (0 <= reg[rrr] < CC..C) | |
240 | IC += ADDRESS[reg[rrr]]; | |
241 | else | |
242 | IC += ADDRESS[CC..C]; | |
243 | */ | |
244 | ||
245 | #define CCL_ReadRegister 0x0E /* Read bytes into registers: | |
246 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
247 | 2:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
248 | ... | |
249 | ------------------------------ | |
250 | while (CCC--) | |
251 | read (reg[rrr]); | |
252 | */ | |
253 | ||
254 | #define CCL_WriteExprConst 0x0F /* write result of expression: | |
255 | 1:00000OPERATION000RRR000XXXXX | |
256 | 2:CONSTANT | |
257 | ------------------------------ | |
258 | write (reg[RRR] OPERATION CONSTANT); | |
259 | IC++; | |
260 | */ | |
261 | ||
262 | /* Note: If the Nth read is suspended, the resumed execution starts | |
263 | from the Nth code. */ | |
264 | ||
265 | #define CCL_ReadBranch 0x10 /* Read one byte into a register, | |
266 | and jump by branch table: | |
267 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
268 | 2:A--D--D--R--E-S-S[0]000XXXXX | |
269 | 3:A--D--D--R--E-S-S[1]000XXXXX | |
270 | ... | |
271 | ------------------------------ | |
272 | read (read[rrr]); | |
273 | if (0 <= reg[rrr] < CC..C) | |
274 | IC += ADDRESS[reg[rrr]]; | |
275 | else | |
276 | IC += ADDRESS[CC..C]; | |
277 | */ | |
278 | ||
279 | #define CCL_WriteRegister 0x11 /* Write registers: | |
280 | 1:CCCCCCCCCCCCCCCCCCCrrrXXXXX | |
281 | 2:CCCCCCCCCCCCCCCCCCCrrrXXXXX | |
282 | ... | |
283 | ------------------------------ | |
284 | while (CCC--) | |
285 | write (reg[rrr]); | |
286 | ... | |
287 | */ | |
288 | ||
289 | /* Note: If the Nth write is suspended, the resumed execution | |
290 | starts from the Nth code. */ | |
291 | ||
292 | #define CCL_WriteExprRegister 0x12 /* Write result of expression | |
293 | 1:00000OPERATIONRrrRRR000XXXXX | |
294 | ------------------------------ | |
295 | write (reg[RRR] OPERATION reg[Rrr]); | |
296 | */ | |
297 | ||
e34b1164 | 298 | #define CCL_Call 0x13 /* Call the CCL program whose ID is |
5232fa7b KH |
299 | CC..C or cc..c. |
300 | 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX | |
301 | [2:00000000cccccccccccccccccccc] | |
4ed46869 | 302 | ------------------------------ |
5232fa7b KH |
303 | if (FFF) |
304 | call (cc..c) | |
305 | IC++; | |
306 | else | |
307 | call (CC..C) | |
4ed46869 KH |
308 | */ |
309 | ||
310 | #define CCL_WriteConstString 0x14 /* Write a constant or a string: | |
311 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
c6589bbd | 312 | [2:000MSTRIN[0]STRIN[1]STRIN[2]] |
4ed46869 KH |
313 | [...] |
314 | ----------------------------- | |
315 | if (!rrr) | |
316 | write (CC..C) | |
317 | else | |
c6589bbd KH |
318 | if (M) |
319 | write_multibyte_string (STRING, CC..C); | |
320 | else | |
321 | write_string (STRING, CC..C); | |
4ed46869 KH |
322 | IC += (CC..C + 2) / 3; |
323 | */ | |
324 | ||
325 | #define CCL_WriteArray 0x15 /* Write an element of array: | |
326 | 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX | |
327 | 2:ELEMENT[0] | |
328 | 3:ELEMENT[1] | |
329 | ... | |
330 | ------------------------------ | |
331 | if (0 <= reg[rrr] < CC..C) | |
332 | write (ELEMENT[reg[rrr]]); | |
333 | IC += CC..C; | |
334 | */ | |
335 | ||
336 | #define CCL_End 0x16 /* Terminate: | |
337 | 1:00000000000000000000000XXXXX | |
338 | ------------------------------ | |
339 | terminate (); | |
340 | */ | |
341 | ||
342 | /* The following two codes execute an assignment arithmetic/logical | |
343 | operation. The form of the operation is like REG OP= OPERAND. */ | |
344 | ||
345 | #define CCL_ExprSelfConst 0x17 /* REG OP= constant: | |
346 | 1:00000OPERATION000000rrrXXXXX | |
347 | 2:CONSTANT | |
348 | ------------------------------ | |
349 | reg[rrr] OPERATION= CONSTANT; | |
350 | */ | |
351 | ||
352 | #define CCL_ExprSelfReg 0x18 /* REG1 OP= REG2: | |
353 | 1:00000OPERATION000RRRrrrXXXXX | |
354 | ------------------------------ | |
355 | reg[rrr] OPERATION= reg[RRR]; | |
356 | */ | |
357 | ||
358 | /* The following codes execute an arithmetic/logical operation. The | |
359 | form of the operation is like REG_X = REG_Y OP OPERAND2. */ | |
360 | ||
361 | #define CCL_SetExprConst 0x19 /* REG_X = REG_Y OP constant: | |
362 | 1:00000OPERATION000RRRrrrXXXXX | |
363 | 2:CONSTANT | |
364 | ------------------------------ | |
365 | reg[rrr] = reg[RRR] OPERATION CONSTANT; | |
366 | IC++; | |
367 | */ | |
368 | ||
369 | #define CCL_SetExprReg 0x1A /* REG1 = REG2 OP REG3: | |
370 | 1:00000OPERATIONRrrRRRrrrXXXXX | |
371 | ------------------------------ | |
372 | reg[rrr] = reg[RRR] OPERATION reg[Rrr]; | |
373 | */ | |
374 | ||
375 | #define CCL_JumpCondExprConst 0x1B /* Jump conditional according to | |
376 | an operation on constant: | |
377 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
378 | 2:OPERATION | |
379 | 3:CONSTANT | |
380 | ----------------------------- | |
381 | reg[7] = reg[rrr] OPERATION CONSTANT; | |
382 | if (!(reg[7])) | |
383 | IC += ADDRESS; | |
384 | else | |
385 | IC += 2 | |
386 | */ | |
387 | ||
388 | #define CCL_JumpCondExprReg 0x1C /* Jump conditional according to | |
389 | an operation on register: | |
390 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
391 | 2:OPERATION | |
392 | 3:RRR | |
393 | ----------------------------- | |
394 | reg[7] = reg[rrr] OPERATION reg[RRR]; | |
395 | if (!reg[7]) | |
396 | IC += ADDRESS; | |
397 | else | |
398 | IC += 2; | |
399 | */ | |
400 | ||
401 | #define CCL_ReadJumpCondExprConst 0x1D /* Read and jump conditional according | |
402 | to an operation on constant: | |
403 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
404 | 2:OPERATION | |
405 | 3:CONSTANT | |
406 | ----------------------------- | |
407 | read (reg[rrr]); | |
408 | reg[7] = reg[rrr] OPERATION CONSTANT; | |
409 | if (!reg[7]) | |
410 | IC += ADDRESS; | |
411 | else | |
412 | IC += 2; | |
413 | */ | |
414 | ||
415 | #define CCL_ReadJumpCondExprReg 0x1E /* Read and jump conditional according | |
416 | to an operation on register: | |
417 | 1:A--D--D--R--E--S--S-rrrXXXXX | |
418 | 2:OPERATION | |
419 | 3:RRR | |
420 | ----------------------------- | |
421 | read (reg[rrr]); | |
422 | reg[7] = reg[rrr] OPERATION reg[RRR]; | |
423 | if (!reg[7]) | |
424 | IC += ADDRESS; | |
425 | else | |
426 | IC += 2; | |
427 | */ | |
428 | ||
450ed226 | 429 | #define CCL_Extension 0x1F /* Extended CCL code |
4ed46869 | 430 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX |
fe3c5669 | 431 | 2:ARGUMENT |
4ed46869 KH |
432 | 3:... |
433 | ------------------------------ | |
434 | extended_command (rrr,RRR,Rrr,ARGS) | |
435 | */ | |
436 | ||
177c0ea7 | 437 | /* |
6ae21908 | 438 | Here after, Extended CCL Instructions. |
e34b1164 | 439 | Bit length of extended command is 14. |
6ae21908 | 440 | Therefore, the instruction code range is 0..16384(0x3fff). |
e34b1164 KH |
441 | */ |
442 | ||
51e4f4a8 | 443 | /* Read a multibyte character. |
6ae21908 KH |
444 | A code point is stored into reg[rrr]. A charset ID is stored into |
445 | reg[RRR]. */ | |
446 | ||
447 | #define CCL_ReadMultibyteChar2 0x00 /* Read Multibyte Character | |
448 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX */ | |
449 | ||
450 | /* Write a multibyte character. | |
451 | Write a character whose code point is reg[rrr] and the charset ID | |
452 | is reg[RRR]. */ | |
453 | ||
454 | #define CCL_WriteMultibyteChar2 0x01 /* Write Multibyte Character | |
455 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX */ | |
456 | ||
8146262a | 457 | /* Translate a character whose code point is reg[rrr] and the charset |
f967223b | 458 | ID is reg[RRR] by a translation table whose ID is reg[Rrr]. |
6ae21908 | 459 | |
8146262a | 460 | A translated character is set in reg[rrr] (code point) and reg[RRR] |
6ae21908 KH |
461 | (charset ID). */ |
462 | ||
8146262a | 463 | #define CCL_TranslateCharacter 0x02 /* Translate a multibyte character |
6ae21908 KH |
464 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX */ |
465 | ||
8146262a | 466 | /* Translate a character whose code point is reg[rrr] and the charset |
f967223b | 467 | ID is reg[RRR] by a translation table whose ID is ARGUMENT. |
6ae21908 | 468 | |
8146262a | 469 | A translated character is set in reg[rrr] (code point) and reg[RRR] |
6ae21908 KH |
470 | (charset ID). */ |
471 | ||
8146262a KH |
472 | #define CCL_TranslateCharacterConstTbl 0x03 /* Translate a multibyte character |
473 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX | |
474 | 2:ARGUMENT(Translation Table ID) | |
475 | */ | |
6ae21908 | 476 | |
8146262a KH |
477 | /* Iterate looking up MAPs for reg[rrr] starting from the Nth (N = |
478 | reg[RRR]) MAP until some value is found. | |
6ae21908 | 479 | |
8146262a | 480 | Each MAP is a Lisp vector whose element is number, nil, t, or |
6ae21908 | 481 | lambda. |
8146262a | 482 | If the element is nil, ignore the map and proceed to the next map. |
6ae21908 KH |
483 | If the element is t or lambda, finish without changing reg[rrr]. |
484 | If the element is a number, set reg[rrr] to the number and finish. | |
485 | ||
4c36be58 | 486 | Detail of the map structure is described in the comment for |
8146262a | 487 | CCL_MapMultiple below. */ |
6ae21908 | 488 | |
8146262a | 489 | #define CCL_IterateMultipleMap 0x10 /* Iterate multiple maps |
6ae21908 | 490 | 1:ExtendedCOMMNDXXXRRRrrrXXXXX |
8146262a KH |
491 | 2:NUMBER of MAPs |
492 | 3:MAP-ID1 | |
493 | 4:MAP-ID2 | |
6ae21908 | 494 | ... |
177c0ea7 | 495 | */ |
6ae21908 | 496 | |
8146262a KH |
497 | /* Map the code in reg[rrr] by MAPs starting from the Nth (N = |
498 | reg[RRR]) map. | |
6ae21908 | 499 | |
9b27b20d | 500 | MAPs are supplied in the succeeding CCL codes as follows: |
6ae21908 | 501 | |
8146262a KH |
502 | When CCL program gives this nested structure of map to this command: |
503 | ((MAP-ID11 | |
504 | MAP-ID12 | |
505 | (MAP-ID121 MAP-ID122 MAP-ID123) | |
506 | MAP-ID13) | |
507 | (MAP-ID21 | |
508 | (MAP-ID211 (MAP-ID2111) MAP-ID212) | |
509 | MAP-ID22)), | |
6ae21908 | 510 | the compiled CCL codes has this sequence: |
8146262a | 511 | CCL_MapMultiple (CCL code of this command) |
9b27b20d KH |
512 | 16 (total number of MAPs and SEPARATORs) |
513 | -7 (1st SEPARATOR) | |
8146262a KH |
514 | MAP-ID11 |
515 | MAP-ID12 | |
9b27b20d | 516 | -3 (2nd SEPARATOR) |
8146262a KH |
517 | MAP-ID121 |
518 | MAP-ID122 | |
519 | MAP-ID123 | |
520 | MAP-ID13 | |
9b27b20d | 521 | -7 (3rd SEPARATOR) |
8146262a | 522 | MAP-ID21 |
9b27b20d | 523 | -4 (4th SEPARATOR) |
8146262a | 524 | MAP-ID211 |
9b27b20d | 525 | -1 (5th SEPARATOR) |
8146262a KH |
526 | MAP_ID2111 |
527 | MAP-ID212 | |
528 | MAP-ID22 | |
6ae21908 | 529 | |
9b27b20d | 530 | A value of each SEPARATOR follows this rule: |
8146262a KH |
531 | MAP-SET := SEPARATOR [(MAP-ID | MAP-SET)]+ |
532 | SEPARATOR := -(number of MAP-IDs and SEPARATORs in the MAP-SET) | |
6ae21908 | 533 | |
8146262a | 534 | (*)....Nest level of MAP-SET must not be over than MAX_MAP_SET_LEVEL. |
6ae21908 | 535 | |
8146262a KH |
536 | When some map fails to map (i.e. it doesn't have a value for |
537 | reg[rrr]), the mapping is treated as identity. | |
6ae21908 | 538 | |
8146262a | 539 | The mapping is iterated for all maps in each map set (set of maps |
9b27b20d KH |
540 | separated by SEPARATOR) except in the case that lambda is |
541 | encountered. More precisely, the mapping proceeds as below: | |
542 | ||
543 | At first, VAL0 is set to reg[rrr], and it is translated by the | |
544 | first map to VAL1. Then, VAL1 is translated by the next map to | |
545 | VAL2. This mapping is iterated until the last map is used. The | |
54fa5bc1 KH |
546 | result of the mapping is the last value of VAL?. When the mapping |
547 | process reached to the end of the map set, it moves to the next | |
548 | map set. If the next does not exit, the mapping process terminates, | |
549 | and regard the last value as a result. | |
9b27b20d KH |
550 | |
551 | But, when VALm is mapped to VALn and VALn is not a number, the | |
552 | mapping proceed as below: | |
553 | ||
c80e3b4a | 554 | If VALn is nil, the last map is ignored and the mapping of VALm |
9b27b20d KH |
555 | proceed to the next map. |
556 | ||
557 | In VALn is t, VALm is reverted to reg[rrr] and the mapping of VALm | |
558 | proceed to the next map. | |
559 | ||
54fa5bc1 KH |
560 | If VALn is lambda, move to the next map set like reaching to the |
561 | end of the current map set. | |
562 | ||
e4920bc9 | 563 | If VALn is a symbol, call the CCL program referred by it. |
54fa5bc1 KH |
564 | Then, use reg[rrr] as a mapped value except for -1, -2 and -3. |
565 | Such special values are regarded as nil, t, and lambda respectively. | |
6ae21908 | 566 | |
8146262a | 567 | Each map is a Lisp vector of the following format (a) or (b): |
6ae21908 KH |
568 | (a)......[STARTPOINT VAL1 VAL2 ...] |
569 | (b)......[t VAL STARTPOINT ENDPOINT], | |
570 | where | |
8146262a | 571 | STARTPOINT is an offset to be used for indexing a map, |
9b27b20d | 572 | ENDPOINT is a maximum index number of a map, |
177c0ea7 | 573 | VAL and VALn is a number, nil, t, or lambda. |
6ae21908 | 574 | |
8146262a KH |
575 | Valid index range of a map of type (a) is: |
576 | STARTPOINT <= index < STARTPOINT + map_size - 1 | |
577 | Valid index range of a map of type (b) is: | |
9b27b20d | 578 | STARTPOINT <= index < ENDPOINT */ |
6ae21908 | 579 | |
8146262a | 580 | #define CCL_MapMultiple 0x11 /* Mapping by multiple code conversion maps |
6ae21908 KH |
581 | 1:ExtendedCOMMNDXXXRRRrrrXXXXX |
582 | 2:N-2 | |
583 | 3:SEPARATOR_1 (< 0) | |
8146262a KH |
584 | 4:MAP-ID_1 |
585 | 5:MAP-ID_2 | |
6ae21908 KH |
586 | ... |
587 | M:SEPARATOR_x (< 0) | |
8146262a | 588 | M+1:MAP-ID_y |
6ae21908 KH |
589 | ... |
590 | N:SEPARATOR_z (< 0) | |
591 | */ | |
592 | ||
54fa5bc1 | 593 | #define MAX_MAP_SET_LEVEL 30 |
6ae21908 KH |
594 | |
595 | typedef struct | |
596 | { | |
597 | int rest_length; | |
598 | int orig_val; | |
599 | } tr_stack; | |
600 | ||
8146262a KH |
601 | static tr_stack mapping_stack[MAX_MAP_SET_LEVEL]; |
602 | static tr_stack *mapping_stack_pointer; | |
6ae21908 | 603 | |
54fa5bc1 KH |
604 | /* If this variable is non-zero, it indicates the stack_idx |
605 | of immediately called by CCL_MapMultiple. */ | |
be57900b | 606 | static int stack_idx_of_map_multiple; |
54fa5bc1 KH |
607 | |
608 | #define PUSH_MAPPING_STACK(restlen, orig) \ | |
a89f435d PJ |
609 | do \ |
610 | { \ | |
54fa5bc1 KH |
611 | mapping_stack_pointer->rest_length = (restlen); \ |
612 | mapping_stack_pointer->orig_val = (orig); \ | |
613 | mapping_stack_pointer++; \ | |
a89f435d PJ |
614 | } \ |
615 | while (0) | |
54fa5bc1 KH |
616 | |
617 | #define POP_MAPPING_STACK(restlen, orig) \ | |
a89f435d PJ |
618 | do \ |
619 | { \ | |
54fa5bc1 KH |
620 | mapping_stack_pointer--; \ |
621 | (restlen) = mapping_stack_pointer->rest_length; \ | |
622 | (orig) = mapping_stack_pointer->orig_val; \ | |
a89f435d PJ |
623 | } \ |
624 | while (0) | |
6ae21908 | 625 | |
54fa5bc1 | 626 | #define CCL_CALL_FOR_MAP_INSTRUCTION(symbol, ret_ic) \ |
a89f435d | 627 | do \ |
0ee1088b | 628 | { \ |
54fa5bc1 KH |
629 | struct ccl_program called_ccl; \ |
630 | if (stack_idx >= 256 \ | |
96c06863 | 631 | || ! setup_ccl_program (&called_ccl, (symbol))) \ |
54fa5bc1 KH |
632 | { \ |
633 | if (stack_idx > 0) \ | |
634 | { \ | |
635 | ccl_prog = ccl_prog_stack_struct[0].ccl_prog; \ | |
636 | ic = ccl_prog_stack_struct[0].ic; \ | |
9eaa8e65 | 637 | eof_ic = ccl_prog_stack_struct[0].eof_ic; \ |
54fa5bc1 KH |
638 | } \ |
639 | CCL_INVALID_CMD; \ | |
640 | } \ | |
641 | ccl_prog_stack_struct[stack_idx].ccl_prog = ccl_prog; \ | |
642 | ccl_prog_stack_struct[stack_idx].ic = (ret_ic); \ | |
9eaa8e65 | 643 | ccl_prog_stack_struct[stack_idx].eof_ic = eof_ic; \ |
54fa5bc1 KH |
644 | stack_idx++; \ |
645 | ccl_prog = called_ccl.prog; \ | |
646 | ic = CCL_HEADER_MAIN; \ | |
9eaa8e65 | 647 | eof_ic = XFASTINT (ccl_prog[CCL_HEADER_EOF]); \ |
54fa5bc1 | 648 | goto ccl_repeat; \ |
0ee1088b | 649 | } \ |
a89f435d | 650 | while (0) |
6ae21908 | 651 | |
8146262a | 652 | #define CCL_MapSingle 0x12 /* Map by single code conversion map |
6ae21908 | 653 | 1:ExtendedCOMMNDXXXRRRrrrXXXXX |
8146262a | 654 | 2:MAP-ID |
6ae21908 | 655 | ------------------------------ |
8146262a KH |
656 | Map reg[rrr] by MAP-ID. |
657 | If some valid mapping is found, | |
6ae21908 KH |
658 | set reg[rrr] to the result, |
659 | else | |
660 | set reg[RRR] to -1. | |
661 | */ | |
4ed46869 | 662 | |
d80dc57e DL |
663 | #define CCL_LookupIntConstTbl 0x13 /* Lookup multibyte character by |
664 | integer key. Afterwards R7 set | |
e0f24100 | 665 | to 1 if lookup succeeded. |
d80dc57e DL |
666 | 1:ExtendedCOMMNDRrrRRRXXXXXXXX |
667 | 2:ARGUMENT(Hash table ID) */ | |
668 | ||
669 | #define CCL_LookupCharConstTbl 0x14 /* Lookup integer by multibyte | |
670 | character key. Afterwards R7 set | |
e0f24100 | 671 | to 1 if lookup succeeded. |
d80dc57e DL |
672 | 1:ExtendedCOMMNDRrrRRRrrrXXXXX |
673 | 2:ARGUMENT(Hash table ID) */ | |
674 | ||
4ed46869 KH |
675 | /* CCL arithmetic/logical operators. */ |
676 | #define CCL_PLUS 0x00 /* X = Y + Z */ | |
677 | #define CCL_MINUS 0x01 /* X = Y - Z */ | |
678 | #define CCL_MUL 0x02 /* X = Y * Z */ | |
679 | #define CCL_DIV 0x03 /* X = Y / Z */ | |
680 | #define CCL_MOD 0x04 /* X = Y % Z */ | |
681 | #define CCL_AND 0x05 /* X = Y & Z */ | |
682 | #define CCL_OR 0x06 /* X = Y | Z */ | |
683 | #define CCL_XOR 0x07 /* X = Y ^ Z */ | |
684 | #define CCL_LSH 0x08 /* X = Y << Z */ | |
685 | #define CCL_RSH 0x09 /* X = Y >> Z */ | |
686 | #define CCL_LSH8 0x0A /* X = (Y << 8) | Z */ | |
687 | #define CCL_RSH8 0x0B /* X = Y >> 8, r[7] = Y & 0xFF */ | |
688 | #define CCL_DIVMOD 0x0C /* X = Y / Z, r[7] = Y % Z */ | |
689 | #define CCL_LS 0x10 /* X = (X < Y) */ | |
690 | #define CCL_GT 0x11 /* X = (X > Y) */ | |
691 | #define CCL_EQ 0x12 /* X = (X == Y) */ | |
692 | #define CCL_LE 0x13 /* X = (X <= Y) */ | |
693 | #define CCL_GE 0x14 /* X = (X >= Y) */ | |
694 | #define CCL_NE 0x15 /* X = (X != Y) */ | |
695 | ||
51520e8a | 696 | #define CCL_DECODE_SJIS 0x16 /* X = HIGHER_BYTE (DE-SJIS (Y, Z)) |
4ed46869 | 697 | r[7] = LOWER_BYTE (DE-SJIS (Y, Z)) */ |
51520e8a KH |
698 | #define CCL_ENCODE_SJIS 0x17 /* X = HIGHER_BYTE (SJIS (Y, Z)) |
699 | r[7] = LOWER_BYTE (SJIS (Y, Z) */ | |
4ed46869 | 700 | |
4ed46869 | 701 | /* Terminate CCL program successfully. */ |
0ee1088b | 702 | #define CCL_SUCCESS \ |
a89f435d | 703 | do \ |
0ee1088b | 704 | { \ |
4ed46869 | 705 | ccl->status = CCL_STAT_SUCCESS; \ |
0ee1088b KH |
706 | goto ccl_finish; \ |
707 | } \ | |
5e617bc2 | 708 | while (0) |
4ed46869 KH |
709 | |
710 | /* Suspend CCL program because of reading from empty input buffer or | |
711 | writing to full output buffer. When this program is resumed, the | |
712 | same I/O command is executed. */ | |
e34b1164 | 713 | #define CCL_SUSPEND(stat) \ |
a89f435d | 714 | do \ |
0ee1088b | 715 | { \ |
e34b1164 KH |
716 | ic--; \ |
717 | ccl->status = stat; \ | |
718 | goto ccl_finish; \ | |
0ee1088b | 719 | } \ |
a89f435d | 720 | while (0) |
4ed46869 KH |
721 | |
722 | /* Terminate CCL program because of invalid command. Should not occur | |
723 | in the normal case. */ | |
9eaa8e65 KH |
724 | #ifndef CCL_DEBUG |
725 | ||
4ed46869 | 726 | #define CCL_INVALID_CMD \ |
a89f435d | 727 | do \ |
0ee1088b | 728 | { \ |
4ed46869 KH |
729 | ccl->status = CCL_STAT_INVALID_CMD; \ |
730 | goto ccl_error_handler; \ | |
0ee1088b | 731 | } \ |
5e617bc2 | 732 | while (0) |
4ed46869 | 733 | |
9eaa8e65 KH |
734 | #else |
735 | ||
4ed46869 | 736 | #define CCL_INVALID_CMD \ |
a89f435d | 737 | do \ |
0ee1088b | 738 | { \ |
9eaa8e65 | 739 | ccl_debug_hook (this_ic); \ |
4ed46869 KH |
740 | ccl->status = CCL_STAT_INVALID_CMD; \ |
741 | goto ccl_error_handler; \ | |
0ee1088b | 742 | } \ |
5e617bc2 | 743 | while (0) |
4ed46869 | 744 | |
9eaa8e65 KH |
745 | #endif |
746 | ||
b1c46f02 PE |
747 | /* Use "&" rather than "&&" to suppress a bogus GCC warning; see |
748 | <http://gcc.gnu.org/bugzilla/show_bug.cgi?id=43772>. */ | |
749 | #define ASCENDING_ORDER(lo, med, hi) (((lo) <= (med)) & ((med) <= (hi))) | |
750 | ||
30569699 PE |
751 | #define GET_CCL_RANGE(var, ccl_prog, ic, lo, hi) \ |
752 | do \ | |
753 | { \ | |
754 | EMACS_INT prog_word = XINT ((ccl_prog)[ic]); \ | |
b1c46f02 | 755 | if (! ASCENDING_ORDER (lo, prog_word, hi)) \ |
30569699 PE |
756 | CCL_INVALID_CMD; \ |
757 | (var) = prog_word; \ | |
758 | } \ | |
759 | while (0) | |
760 | ||
761 | #define GET_CCL_CODE(code, ccl_prog, ic) \ | |
e003a292 | 762 | GET_CCL_RANGE (code, ccl_prog, ic, CCL_CODE_MIN, CCL_CODE_MAX) |
30569699 | 763 | |
b1c46f02 | 764 | #define IN_INT_RANGE(val) ASCENDING_ORDER (INT_MIN, val, INT_MAX) |
30569699 | 765 | |
4ed46869 | 766 | /* Encode one character CH to multibyte form and write to the current |
887bfbd7 | 767 | output buffer. If CH is less than 256, CH is written as is. */ |
c10842ea KH |
768 | #define CCL_WRITE_CHAR(ch) \ |
769 | do { \ | |
770 | if (! dst) \ | |
771 | CCL_INVALID_CMD; \ | |
772 | else if (dst < dst_end) \ | |
773 | *dst++ = (ch); \ | |
774 | else \ | |
775 | CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \ | |
a8302ba3 KH |
776 | } while (0) |
777 | ||
4ed46869 KH |
778 | /* Write a string at ccl_prog[IC] of length LEN to the current output |
779 | buffer. */ | |
c6589bbd KH |
780 | #define CCL_WRITE_STRING(len) \ |
781 | do { \ | |
fb90da1b | 782 | int ccli; \ |
c6589bbd KH |
783 | if (!dst) \ |
784 | CCL_INVALID_CMD; \ | |
785 | else if (dst + len <= dst_end) \ | |
786 | { \ | |
787 | if (XFASTINT (ccl_prog[ic]) & 0x1000000) \ | |
fb90da1b PE |
788 | for (ccli = 0; ccli < len; ccli++) \ |
789 | *dst++ = XFASTINT (ccl_prog[ic + ccli]) & 0xFFFFFF; \ | |
c6589bbd | 790 | else \ |
fb90da1b PE |
791 | for (ccli = 0; ccli < len; ccli++) \ |
792 | *dst++ = ((XFASTINT (ccl_prog[ic + (ccli / 3)])) \ | |
793 | >> ((2 - (ccli % 3)) * 8)) & 0xFF; \ | |
c6589bbd KH |
794 | } \ |
795 | else \ | |
796 | CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \ | |
4ed46869 KH |
797 | } while (0) |
798 | ||
c10842ea KH |
799 | /* Read one byte from the current input buffer into Rth register. */ |
800 | #define CCL_READ_CHAR(r) \ | |
801 | do { \ | |
802 | if (! src) \ | |
803 | CCL_INVALID_CMD; \ | |
804 | else if (src < src_end) \ | |
805 | r = *src++; \ | |
806 | else if (ccl->last_block) \ | |
807 | { \ | |
327719ee | 808 | r = -1; \ |
c10842ea KH |
809 | ic = ccl->eof_ic; \ |
810 | goto ccl_repeat; \ | |
811 | } \ | |
812 | else \ | |
813 | CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC); \ | |
814 | } while (0) | |
815 | ||
bda731af KH |
816 | /* Decode CODE by a charset whose id is ID. If ID is 0, return CODE |
817 | as is for backward compatibility. Assume that we can use the | |
818 | variable `charset'. */ | |
819 | ||
820 | #define CCL_DECODE_CHAR(id, code) \ | |
821 | ((id) == 0 ? (code) \ | |
822 | : (charset = CHARSET_FROM_ID ((id)), DECODE_CHAR (charset, (code)))) | |
823 | ||
bda731af | 824 | /* Encode character C by some of charsets in CHARSET_LIST. Set ID to |
40ba43b4 | 825 | the id of the used charset, ENCODED to the result of encoding. |
bda731af KH |
826 | Assume that we can use the variable `charset'. */ |
827 | ||
8f924df7 | 828 | #define CCL_ENCODE_CHAR(c, charset_list, id, encoded) \ |
4ffd4870 | 829 | do { \ |
fb90da1b | 830 | unsigned ncode; \ |
4ffd4870 | 831 | \ |
fb90da1b | 832 | charset = char_charset ((c), (charset_list), &ncode); \ |
8f924df7 | 833 | if (! charset && ! NILP (charset_list)) \ |
fb90da1b | 834 | charset = char_charset ((c), Qnil, &ncode); \ |
8f924df7 KH |
835 | if (charset) \ |
836 | { \ | |
837 | (id) = CHARSET_ID (charset); \ | |
fb90da1b | 838 | (encoded) = ncode; \ |
4ffd4870 | 839 | } \ |
8f924df7 | 840 | } while (0) |
4ffd4870 | 841 | |
c10842ea KH |
842 | /* Execute CCL code on characters at SOURCE (length SRC_SIZE). The |
843 | resulting text goes to a place pointed by DESTINATION, the length | |
844 | of which should not exceed DST_SIZE. As a side effect, how many | |
845 | characters are consumed and produced are recorded in CCL->consumed | |
846 | and CCL->produced, and the contents of CCL registers are updated. | |
847 | If SOURCE or DESTINATION is NULL, only operations on registers are | |
848 | permitted. */ | |
4ed46869 KH |
849 | |
850 | #ifdef CCL_DEBUG | |
851 | #define CCL_DEBUG_BACKTRACE_LEN 256 | |
f9bd23fd | 852 | int ccl_backtrace_table[CCL_DEBUG_BACKTRACE_LEN]; |
4ed46869 | 853 | int ccl_backtrace_idx; |
9eaa8e65 KH |
854 | |
855 | int | |
856 | ccl_debug_hook (int ic) | |
857 | { | |
858 | return ic; | |
859 | } | |
860 | ||
4ed46869 KH |
861 | #endif |
862 | ||
863 | struct ccl_prog_stack | |
864 | { | |
a9f1cc19 | 865 | Lisp_Object *ccl_prog; /* Pointer to an array of CCL code. */ |
4ed46869 | 866 | int ic; /* Instruction Counter. */ |
9eaa8e65 | 867 | int eof_ic; /* Instruction Counter to jump on EOF. */ |
4ed46869 KH |
868 | }; |
869 | ||
177c0ea7 | 870 | /* For the moment, we only support depth 256 of stack. */ |
c13362d8 KH |
871 | static struct ccl_prog_stack ccl_prog_stack_struct[256]; |
872 | ||
c10842ea | 873 | void |
971de7fb | 874 | ccl_driver (struct ccl_program *ccl, int *source, int *destination, int src_size, int dst_size, Lisp_Object charset_list) |
4ed46869 KH |
875 | { |
876 | register int *reg = ccl->reg; | |
877 | register int ic = ccl->ic; | |
8a1ae4dd | 878 | register int code = 0, field1, field2; |
e995085f | 879 | register Lisp_Object *ccl_prog = ccl->prog; |
c10842ea KH |
880 | int *src = source, *src_end = src + src_size; |
881 | int *dst = destination, *dst_end = dst + dst_size; | |
4ed46869 | 882 | int jump_address; |
8a1ae4dd | 883 | int i = 0, j, op; |
c13362d8 | 884 | int stack_idx = ccl->stack_idx; |
519bf146 | 885 | /* Instruction counter of the current CCL code. */ |
8a1ae4dd | 886 | int this_ic = 0; |
c10842ea | 887 | struct charset *charset; |
9eaa8e65 KH |
888 | int eof_ic = ccl->eof_ic; |
889 | int eof_hit = 0; | |
4ed46869 | 890 | |
c10842ea | 891 | if (ccl->buf_magnification == 0) /* We can't read/produce any bytes. */ |
12abd7d1 KH |
892 | dst = NULL; |
893 | ||
54fa5bc1 KH |
894 | /* Set mapping stack pointer. */ |
895 | mapping_stack_pointer = mapping_stack; | |
896 | ||
4ed46869 KH |
897 | #ifdef CCL_DEBUG |
898 | ccl_backtrace_idx = 0; | |
899 | #endif | |
900 | ||
901 | for (;;) | |
902 | { | |
4ccd0d4a | 903 | ccl_repeat: |
4ed46869 KH |
904 | #ifdef CCL_DEBUG |
905 | ccl_backtrace_table[ccl_backtrace_idx++] = ic; | |
906 | if (ccl_backtrace_idx >= CCL_DEBUG_BACKTRACE_LEN) | |
907 | ccl_backtrace_idx = 0; | |
908 | ccl_backtrace_table[ccl_backtrace_idx] = 0; | |
909 | #endif | |
910 | ||
911 | if (!NILP (Vquit_flag) && NILP (Vinhibit_quit)) | |
912 | { | |
913 | /* We can't just signal Qquit, instead break the loop as if | |
914 | the whole data is processed. Don't reset Vquit_flag, it | |
915 | must be handled later at a safer place. */ | |
c10842ea KH |
916 | if (src) |
917 | src = source + src_size; | |
4ed46869 KH |
918 | ccl->status = CCL_STAT_QUIT; |
919 | break; | |
920 | } | |
921 | ||
519bf146 | 922 | this_ic = ic; |
30569699 | 923 | GET_CCL_CODE (code, ccl_prog, ic++); |
4ed46869 KH |
924 | field1 = code >> 8; |
925 | field2 = (code & 0xFF) >> 5; | |
926 | ||
927 | #define rrr field2 | |
928 | #define RRR (field1 & 7) | |
929 | #define Rrr ((field1 >> 3) & 7) | |
930 | #define ADDR field1 | |
e34b1164 | 931 | #define EXCMD (field1 >> 6) |
4ed46869 KH |
932 | |
933 | switch (code & 0x1F) | |
934 | { | |
935 | case CCL_SetRegister: /* 00000000000000000RRRrrrXXXXX */ | |
936 | reg[rrr] = reg[RRR]; | |
937 | break; | |
938 | ||
939 | case CCL_SetShortConst: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
940 | reg[rrr] = field1; | |
941 | break; | |
942 | ||
943 | case CCL_SetConst: /* 00000000000000000000rrrXXXXX */ | |
d311d28c | 944 | reg[rrr] = XINT (ccl_prog[ic++]); |
4ed46869 KH |
945 | break; |
946 | ||
947 | case CCL_SetArray: /* CCCCCCCCCCCCCCCCCCCCRRRrrrXXXXX */ | |
948 | i = reg[RRR]; | |
949 | j = field1 >> 3; | |
519e1d69 | 950 | if (0 <= i && i < j) |
d311d28c | 951 | reg[rrr] = XINT (ccl_prog[ic + i]); |
4ed46869 KH |
952 | ic += j; |
953 | break; | |
954 | ||
955 | case CCL_Jump: /* A--D--D--R--E--S--S-000XXXXX */ | |
956 | ic += ADDR; | |
957 | break; | |
958 | ||
959 | case CCL_JumpCond: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
960 | if (!reg[rrr]) | |
961 | ic += ADDR; | |
962 | break; | |
963 | ||
964 | case CCL_WriteRegisterJump: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
965 | i = reg[rrr]; | |
966 | CCL_WRITE_CHAR (i); | |
967 | ic += ADDR; | |
968 | break; | |
969 | ||
970 | case CCL_WriteRegisterReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
971 | i = reg[rrr]; | |
972 | CCL_WRITE_CHAR (i); | |
973 | ic++; | |
974 | CCL_READ_CHAR (reg[rrr]); | |
975 | ic += ADDR - 1; | |
976 | break; | |
977 | ||
978 | case CCL_WriteConstJump: /* A--D--D--R--E--S--S-000XXXXX */ | |
d311d28c | 979 | i = XINT (ccl_prog[ic]); |
4ed46869 KH |
980 | CCL_WRITE_CHAR (i); |
981 | ic += ADDR; | |
982 | break; | |
983 | ||
984 | case CCL_WriteConstReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
d311d28c | 985 | i = XINT (ccl_prog[ic]); |
4ed46869 KH |
986 | CCL_WRITE_CHAR (i); |
987 | ic++; | |
988 | CCL_READ_CHAR (reg[rrr]); | |
989 | ic += ADDR - 1; | |
990 | break; | |
991 | ||
992 | case CCL_WriteStringJump: /* A--D--D--R--E--S--S-000XXXXX */ | |
d311d28c | 993 | j = XINT (ccl_prog[ic++]); |
4ed46869 KH |
994 | CCL_WRITE_STRING (j); |
995 | ic += ADDR - 1; | |
996 | break; | |
997 | ||
998 | case CCL_WriteArrayReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
999 | i = reg[rrr]; | |
d311d28c | 1000 | j = XINT (ccl_prog[ic]); |
519e1d69 | 1001 | if (0 <= i && i < j) |
4ed46869 | 1002 | { |
d311d28c | 1003 | i = XINT (ccl_prog[ic + 1 + i]); |
4ed46869 KH |
1004 | CCL_WRITE_CHAR (i); |
1005 | } | |
887bfbd7 | 1006 | ic += j + 2; |
4ed46869 KH |
1007 | CCL_READ_CHAR (reg[rrr]); |
1008 | ic += ADDR - (j + 2); | |
1009 | break; | |
1010 | ||
1011 | case CCL_ReadJump: /* A--D--D--R--E--S--S-rrrYYYYY */ | |
1012 | CCL_READ_CHAR (reg[rrr]); | |
1013 | ic += ADDR; | |
1014 | break; | |
1015 | ||
1016 | case CCL_ReadBranch: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
1017 | CCL_READ_CHAR (reg[rrr]); | |
1018 | /* fall through ... */ | |
1019 | case CCL_Branch: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
30569699 | 1020 | { |
d311d28c PE |
1021 | int ioff = 0 <= reg[rrr] && reg[rrr] < field1 ? reg[rrr] : field1; |
1022 | int incr = XINT (ccl_prog[ic + ioff]); | |
30569699 PE |
1023 | ic += incr; |
1024 | } | |
4ed46869 KH |
1025 | break; |
1026 | ||
1027 | case CCL_ReadRegister: /* CCCCCCCCCCCCCCCCCCCCrrXXXXX */ | |
1028 | while (1) | |
1029 | { | |
1030 | CCL_READ_CHAR (reg[rrr]); | |
1031 | if (!field1) break; | |
30569699 | 1032 | GET_CCL_CODE (code, ccl_prog, ic++); |
4ed46869 KH |
1033 | field1 = code >> 8; |
1034 | field2 = (code & 0xFF) >> 5; | |
1035 | } | |
1036 | break; | |
1037 | ||
1038 | case CCL_WriteExprConst: /* 1:00000OPERATION000RRR000XXXXX */ | |
1039 | rrr = 7; | |
1040 | i = reg[RRR]; | |
d311d28c | 1041 | j = XINT (ccl_prog[ic]); |
4ed46869 | 1042 | op = field1 >> 6; |
25660570 | 1043 | jump_address = ic + 1; |
4ed46869 KH |
1044 | goto ccl_set_expr; |
1045 | ||
1046 | case CCL_WriteRegister: /* CCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
1047 | while (1) | |
1048 | { | |
1049 | i = reg[rrr]; | |
1050 | CCL_WRITE_CHAR (i); | |
1051 | if (!field1) break; | |
30569699 | 1052 | GET_CCL_CODE (code, ccl_prog, ic++); |
4ed46869 KH |
1053 | field1 = code >> 8; |
1054 | field2 = (code & 0xFF) >> 5; | |
1055 | } | |
1056 | break; | |
1057 | ||
1058 | case CCL_WriteExprRegister: /* 1:00000OPERATIONRrrRRR000XXXXX */ | |
1059 | rrr = 7; | |
1060 | i = reg[RRR]; | |
1061 | j = reg[Rrr]; | |
1062 | op = field1 >> 6; | |
25660570 | 1063 | jump_address = ic; |
4ed46869 KH |
1064 | goto ccl_set_expr; |
1065 | ||
5232fa7b | 1066 | case CCL_Call: /* 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX */ |
4ed46869 KH |
1067 | { |
1068 | Lisp_Object slot; | |
5232fa7b KH |
1069 | int prog_id; |
1070 | ||
1071 | /* If FFF is nonzero, the CCL program ID is in the | |
1072 | following code. */ | |
1073 | if (rrr) | |
d311d28c | 1074 | prog_id = XINT (ccl_prog[ic++]); |
5232fa7b KH |
1075 | else |
1076 | prog_id = field1; | |
4ed46869 KH |
1077 | |
1078 | if (stack_idx >= 256 | |
5232fa7b | 1079 | || prog_id < 0 |
64ef2921 SM |
1080 | || prog_id >= ASIZE (Vccl_program_table) |
1081 | || (slot = AREF (Vccl_program_table, prog_id), !VECTORP (slot)) | |
1082 | || !VECTORP (AREF (slot, 1))) | |
4ed46869 KH |
1083 | { |
1084 | if (stack_idx > 0) | |
1085 | { | |
1086 | ccl_prog = ccl_prog_stack_struct[0].ccl_prog; | |
1087 | ic = ccl_prog_stack_struct[0].ic; | |
9eaa8e65 | 1088 | eof_ic = ccl_prog_stack_struct[0].eof_ic; |
4ed46869 KH |
1089 | } |
1090 | CCL_INVALID_CMD; | |
1091 | } | |
177c0ea7 | 1092 | |
4ed46869 KH |
1093 | ccl_prog_stack_struct[stack_idx].ccl_prog = ccl_prog; |
1094 | ccl_prog_stack_struct[stack_idx].ic = ic; | |
9eaa8e65 | 1095 | ccl_prog_stack_struct[stack_idx].eof_ic = eof_ic; |
4ed46869 | 1096 | stack_idx++; |
91f2d272 | 1097 | ccl_prog = XVECTOR (AREF (slot, 1))->contents; |
4ed46869 | 1098 | ic = CCL_HEADER_MAIN; |
9eaa8e65 | 1099 | eof_ic = XFASTINT (ccl_prog[CCL_HEADER_EOF]); |
4ed46869 KH |
1100 | } |
1101 | break; | |
1102 | ||
1103 | case CCL_WriteConstString: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
1104 | if (!rrr) | |
1105 | CCL_WRITE_CHAR (field1); | |
1106 | else | |
1107 | { | |
1108 | CCL_WRITE_STRING (field1); | |
1109 | ic += (field1 + 2) / 3; | |
1110 | } | |
1111 | break; | |
1112 | ||
1113 | case CCL_WriteArray: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */ | |
1114 | i = reg[rrr]; | |
519e1d69 | 1115 | if (0 <= i && i < field1) |
4ed46869 | 1116 | { |
d311d28c | 1117 | j = XINT (ccl_prog[ic + i]); |
4ed46869 KH |
1118 | CCL_WRITE_CHAR (j); |
1119 | } | |
1120 | ic += field1; | |
1121 | break; | |
1122 | ||
1123 | case CCL_End: /* 0000000000000000000000XXXXX */ | |
d3a478e2 | 1124 | if (stack_idx > 0) |
4ed46869 | 1125 | { |
d3a478e2 | 1126 | stack_idx--; |
4ed46869 KH |
1127 | ccl_prog = ccl_prog_stack_struct[stack_idx].ccl_prog; |
1128 | ic = ccl_prog_stack_struct[stack_idx].ic; | |
9eaa8e65 KH |
1129 | eof_ic = ccl_prog_stack_struct[stack_idx].eof_ic; |
1130 | if (eof_hit) | |
1131 | ic = eof_ic; | |
4ed46869 KH |
1132 | break; |
1133 | } | |
ad3d1b1d KH |
1134 | if (src) |
1135 | src = src_end; | |
1136 | /* ccl->ic should points to this command code again to | |
1137 | suppress further processing. */ | |
1138 | ic--; | |
4ed46869 KH |
1139 | CCL_SUCCESS; |
1140 | ||
1141 | case CCL_ExprSelfConst: /* 00000OPERATION000000rrrXXXXX */ | |
d311d28c | 1142 | i = XINT (ccl_prog[ic++]); |
4ed46869 KH |
1143 | op = field1 >> 6; |
1144 | goto ccl_expr_self; | |
1145 | ||
1146 | case CCL_ExprSelfReg: /* 00000OPERATION000RRRrrrXXXXX */ | |
1147 | i = reg[RRR]; | |
1148 | op = field1 >> 6; | |
1149 | ||
1150 | ccl_expr_self: | |
1151 | switch (op) | |
1152 | { | |
1153 | case CCL_PLUS: reg[rrr] += i; break; | |
1154 | case CCL_MINUS: reg[rrr] -= i; break; | |
1155 | case CCL_MUL: reg[rrr] *= i; break; | |
1156 | case CCL_DIV: reg[rrr] /= i; break; | |
1157 | case CCL_MOD: reg[rrr] %= i; break; | |
1158 | case CCL_AND: reg[rrr] &= i; break; | |
1159 | case CCL_OR: reg[rrr] |= i; break; | |
1160 | case CCL_XOR: reg[rrr] ^= i; break; | |
1161 | case CCL_LSH: reg[rrr] <<= i; break; | |
1162 | case CCL_RSH: reg[rrr] >>= i; break; | |
1163 | case CCL_LSH8: reg[rrr] <<= 8; reg[rrr] |= i; break; | |
1164 | case CCL_RSH8: reg[7] = reg[rrr] & 0xFF; reg[rrr] >>= 8; break; | |
1165 | case CCL_DIVMOD: reg[7] = reg[rrr] % i; reg[rrr] /= i; break; | |
1166 | case CCL_LS: reg[rrr] = reg[rrr] < i; break; | |
1167 | case CCL_GT: reg[rrr] = reg[rrr] > i; break; | |
1168 | case CCL_EQ: reg[rrr] = reg[rrr] == i; break; | |
1169 | case CCL_LE: reg[rrr] = reg[rrr] <= i; break; | |
1170 | case CCL_GE: reg[rrr] = reg[rrr] >= i; break; | |
1171 | case CCL_NE: reg[rrr] = reg[rrr] != i; break; | |
1172 | default: CCL_INVALID_CMD; | |
1173 | } | |
1174 | break; | |
1175 | ||
1176 | case CCL_SetExprConst: /* 00000OPERATION000RRRrrrXXXXX */ | |
1177 | i = reg[RRR]; | |
d311d28c | 1178 | j = XINT (ccl_prog[ic++]); |
4ed46869 | 1179 | op = field1 >> 6; |
30569699 | 1180 | jump_address = ic; |
4ed46869 KH |
1181 | goto ccl_set_expr; |
1182 | ||
1183 | case CCL_SetExprReg: /* 00000OPERATIONRrrRRRrrrXXXXX */ | |
1184 | i = reg[RRR]; | |
1185 | j = reg[Rrr]; | |
1186 | op = field1 >> 6; | |
1187 | jump_address = ic; | |
1188 | goto ccl_set_expr; | |
1189 | ||
1190 | case CCL_ReadJumpCondExprConst: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
1191 | CCL_READ_CHAR (reg[rrr]); | |
1192 | case CCL_JumpCondExprConst: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
1193 | i = reg[rrr]; | |
30569699 | 1194 | jump_address = ic + ADDR; |
d311d28c PE |
1195 | op = XINT (ccl_prog[ic++]); |
1196 | j = XINT (ccl_prog[ic++]); | |
4ed46869 KH |
1197 | rrr = 7; |
1198 | goto ccl_set_expr; | |
1199 | ||
1200 | case CCL_ReadJumpCondExprReg: /* A--D--D--R--E--S--S-rrrXXXXX */ | |
1201 | CCL_READ_CHAR (reg[rrr]); | |
1202 | case CCL_JumpCondExprReg: | |
1203 | i = reg[rrr]; | |
30569699 | 1204 | jump_address = ic + ADDR; |
d311d28c | 1205 | op = XINT (ccl_prog[ic++]); |
30569699 PE |
1206 | GET_CCL_RANGE (j, ccl_prog, ic++, 0, 7); |
1207 | j = reg[j]; | |
4ed46869 KH |
1208 | rrr = 7; |
1209 | ||
1210 | ccl_set_expr: | |
1211 | switch (op) | |
1212 | { | |
1213 | case CCL_PLUS: reg[rrr] = i + j; break; | |
1214 | case CCL_MINUS: reg[rrr] = i - j; break; | |
1215 | case CCL_MUL: reg[rrr] = i * j; break; | |
1216 | case CCL_DIV: reg[rrr] = i / j; break; | |
1217 | case CCL_MOD: reg[rrr] = i % j; break; | |
1218 | case CCL_AND: reg[rrr] = i & j; break; | |
1219 | case CCL_OR: reg[rrr] = i | j; break; | |
3b8c0c70 | 1220 | case CCL_XOR: reg[rrr] = i ^ j; break; |
4ed46869 KH |
1221 | case CCL_LSH: reg[rrr] = i << j; break; |
1222 | case CCL_RSH: reg[rrr] = i >> j; break; | |
1223 | case CCL_LSH8: reg[rrr] = (i << 8) | j; break; | |
1224 | case CCL_RSH8: reg[rrr] = i >> 8; reg[7] = i & 0xFF; break; | |
1225 | case CCL_DIVMOD: reg[rrr] = i / j; reg[7] = i % j; break; | |
1226 | case CCL_LS: reg[rrr] = i < j; break; | |
1227 | case CCL_GT: reg[rrr] = i > j; break; | |
1228 | case CCL_EQ: reg[rrr] = i == j; break; | |
1229 | case CCL_LE: reg[rrr] = i <= j; break; | |
1230 | case CCL_GE: reg[rrr] = i >= j; break; | |
1231 | case CCL_NE: reg[rrr] = i != j; break; | |
c10842ea KH |
1232 | case CCL_DECODE_SJIS: |
1233 | { | |
1234 | i = (i << 8) | j; | |
1235 | SJIS_TO_JIS (i); | |
1236 | reg[rrr] = i >> 8; | |
1237 | reg[7] = i & 0xFF; | |
1238 | break; | |
1239 | } | |
1240 | case CCL_ENCODE_SJIS: | |
1241 | { | |
1242 | i = (i << 8) | j; | |
1243 | JIS_TO_SJIS (i); | |
1244 | reg[rrr] = i >> 8; | |
1245 | reg[7] = i & 0xFF; | |
1246 | break; | |
1247 | } | |
4ed46869 KH |
1248 | default: CCL_INVALID_CMD; |
1249 | } | |
1250 | code &= 0x1F; | |
1251 | if (code == CCL_WriteExprConst || code == CCL_WriteExprRegister) | |
1252 | { | |
1253 | i = reg[rrr]; | |
1254 | CCL_WRITE_CHAR (i); | |
25660570 | 1255 | ic = jump_address; |
4ed46869 KH |
1256 | } |
1257 | else if (!reg[rrr]) | |
1258 | ic = jump_address; | |
1259 | break; | |
1260 | ||
450ed226 | 1261 | case CCL_Extension: |
e34b1164 KH |
1262 | switch (EXCMD) |
1263 | { | |
6ae21908 | 1264 | case CCL_ReadMultibyteChar2: |
e34b1164 KH |
1265 | if (!src) |
1266 | CCL_INVALID_CMD; | |
c10842ea | 1267 | CCL_READ_CHAR (i); |
bda731af | 1268 | CCL_ENCODE_CHAR (i, charset_list, reg[RRR], reg[rrr]); |
e34b1164 KH |
1269 | break; |
1270 | ||
6ae21908 | 1271 | case CCL_WriteMultibyteChar2: |
c10842ea KH |
1272 | if (! dst) |
1273 | CCL_INVALID_CMD; | |
bda731af | 1274 | i = CCL_DECODE_CHAR (reg[RRR], reg[rrr]); |
c10842ea | 1275 | CCL_WRITE_CHAR (i); |
e34b1164 KH |
1276 | break; |
1277 | ||
8146262a | 1278 | case CCL_TranslateCharacter: |
bda731af | 1279 | i = CCL_DECODE_CHAR (reg[RRR], reg[rrr]); |
c10842ea | 1280 | op = translate_char (GET_TRANSLATION_TABLE (reg[Rrr]), i); |
bda731af | 1281 | CCL_ENCODE_CHAR (op, charset_list, reg[RRR], reg[rrr]); |
e34b1164 KH |
1282 | break; |
1283 | ||
8146262a | 1284 | case CCL_TranslateCharacterConstTbl: |
30569699 | 1285 | { |
d311d28c | 1286 | ptrdiff_t eop; |
30569699 PE |
1287 | GET_CCL_RANGE (eop, ccl_prog, ic++, 0, |
1288 | (VECTORP (Vtranslation_table_vector) | |
1289 | ? ASIZE (Vtranslation_table_vector) | |
1290 | : -1)); | |
1291 | i = CCL_DECODE_CHAR (reg[RRR], reg[rrr]); | |
1292 | op = translate_char (GET_TRANSLATION_TABLE (eop), i); | |
1293 | CCL_ENCODE_CHAR (op, charset_list, reg[RRR], reg[rrr]); | |
1294 | } | |
e34b1164 KH |
1295 | break; |
1296 | ||
d80dc57e | 1297 | case CCL_LookupIntConstTbl: |
177c0ea7 | 1298 | { |
d3411f89 | 1299 | ptrdiff_t eop; |
30569699 PE |
1300 | struct Lisp_Hash_Table *h; |
1301 | GET_CCL_RANGE (eop, ccl_prog, ic++, 0, | |
1302 | (VECTORP (Vtranslation_hash_table_vector) | |
1303 | ? ASIZE (Vtranslation_hash_table_vector) | |
1304 | : -1)); | |
1305 | h = GET_HASH_TABLE (eop); | |
d80dc57e | 1306 | |
0de4bb68 PE |
1307 | eop = hash_lookup (h, make_number (reg[RRR]), NULL); |
1308 | if (eop >= 0) | |
d80dc57e | 1309 | { |
f9bd23fd | 1310 | Lisp_Object opl; |
0de4bb68 PE |
1311 | opl = HASH_VALUE (h, eop); |
1312 | if (! (IN_INT_RANGE (eop) && CHARACTERP (opl))) | |
d80dc57e | 1313 | CCL_INVALID_CMD; |
bda731af | 1314 | reg[RRR] = charset_unicode; |
0de4bb68 | 1315 | reg[rrr] = eop; |
d80dc57e DL |
1316 | reg[7] = 1; /* r7 true for success */ |
1317 | } | |
1318 | else | |
1319 | reg[7] = 0; | |
1320 | } | |
1321 | break; | |
1322 | ||
1323 | case CCL_LookupCharConstTbl: | |
177c0ea7 | 1324 | { |
d3411f89 | 1325 | ptrdiff_t eop; |
30569699 PE |
1326 | struct Lisp_Hash_Table *h; |
1327 | GET_CCL_RANGE (eop, ccl_prog, ic++, 0, | |
1328 | (VECTORP (Vtranslation_hash_table_vector) | |
1329 | ? ASIZE (Vtranslation_hash_table_vector) | |
1330 | : -1)); | |
1331 | i = CCL_DECODE_CHAR (reg[RRR], reg[rrr]); | |
1332 | h = GET_HASH_TABLE (eop); | |
d80dc57e | 1333 | |
0de4bb68 PE |
1334 | eop = hash_lookup (h, make_number (i), NULL); |
1335 | if (eop >= 0) | |
d80dc57e | 1336 | { |
f9bd23fd | 1337 | Lisp_Object opl; |
0de4bb68 | 1338 | opl = HASH_VALUE (h, eop); |
30569699 | 1339 | if (! (INTEGERP (opl) && IN_INT_RANGE (XINT (opl)))) |
d80dc57e | 1340 | CCL_INVALID_CMD; |
f9bd23fd | 1341 | reg[RRR] = XINT (opl); |
d80dc57e DL |
1342 | reg[7] = 1; /* r7 true for success */ |
1343 | } | |
1344 | else | |
1345 | reg[7] = 0; | |
1346 | } | |
1347 | break; | |
1348 | ||
e34b1164 KH |
1349 | case CCL_IterateMultipleMap: |
1350 | { | |
8146262a | 1351 | Lisp_Object map, content, attrib, value; |
d311d28c PE |
1352 | EMACS_INT point; |
1353 | ptrdiff_t size; | |
30569699 | 1354 | int fin_ic; |
e34b1164 | 1355 | |
d311d28c | 1356 | j = XINT (ccl_prog[ic++]); /* number of maps. */ |
e34b1164 KH |
1357 | fin_ic = ic + j; |
1358 | op = reg[rrr]; | |
1359 | if ((j > reg[RRR]) && (j >= 0)) | |
1360 | { | |
1361 | ic += reg[RRR]; | |
1362 | i = reg[RRR]; | |
1363 | } | |
1364 | else | |
1365 | { | |
1366 | reg[RRR] = -1; | |
1367 | ic = fin_ic; | |
1368 | break; | |
1369 | } | |
1370 | ||
1371 | for (;i < j;i++) | |
1372 | { | |
c801946a | 1373 | if (!VECTORP (Vcode_conversion_map_vector)) continue; |
64ef2921 | 1374 | size = ASIZE (Vcode_conversion_map_vector); |
d387866a | 1375 | point = XINT (ccl_prog[ic++]); |
30569699 | 1376 | if (! (0 <= point && point < size)) continue; |
64ef2921 | 1377 | map = AREF (Vcode_conversion_map_vector, point); |
8146262a | 1378 | |
78edd3b7 | 1379 | /* Check map validity. */ |
8146262a | 1380 | if (!CONSP (map)) continue; |
03699b14 | 1381 | map = XCDR (map); |
8146262a | 1382 | if (!VECTORP (map)) continue; |
64ef2921 | 1383 | size = ASIZE (map); |
e34b1164 | 1384 | if (size <= 1) continue; |
6ae21908 | 1385 | |
64ef2921 | 1386 | content = AREF (map, 0); |
6ae21908 | 1387 | |
8146262a | 1388 | /* check map type, |
6ae21908 | 1389 | [STARTPOINT VAL1 VAL2 ...] or |
78edd3b7 | 1390 | [t ELEMENT STARTPOINT ENDPOINT] */ |
30569699 | 1391 | if (INTEGERP (content)) |
6ae21908 | 1392 | { |
30569699 PE |
1393 | point = XINT (content); |
1394 | if (!(point <= op && op - point + 1 < size)) continue; | |
1395 | content = AREF (map, op - point + 1); | |
6ae21908 KH |
1396 | } |
1397 | else if (EQ (content, Qt)) | |
1398 | { | |
1399 | if (size != 4) continue; | |
30569699 PE |
1400 | if (INTEGERP (AREF (map, 2)) |
1401 | && XINT (AREF (map, 2)) <= op | |
1402 | && INTEGERP (AREF (map, 3)) | |
1403 | && op < XINT (AREF (map, 3))) | |
64ef2921 | 1404 | content = AREF (map, 1); |
6ae21908 KH |
1405 | else |
1406 | continue; | |
1407 | } | |
177c0ea7 | 1408 | else |
6ae21908 | 1409 | continue; |
e34b1164 KH |
1410 | |
1411 | if (NILP (content)) | |
1412 | continue; | |
30569699 | 1413 | else if (INTEGERP (content) && IN_INT_RANGE (XINT (content))) |
e34b1164 KH |
1414 | { |
1415 | reg[RRR] = i; | |
5e617bc2 | 1416 | reg[rrr] = XINT (content); |
e34b1164 KH |
1417 | break; |
1418 | } | |
1419 | else if (EQ (content, Qt) || EQ (content, Qlambda)) | |
1420 | { | |
1421 | reg[RRR] = i; | |
1422 | break; | |
1423 | } | |
1424 | else if (CONSP (content)) | |
1425 | { | |
03699b14 KR |
1426 | attrib = XCAR (content); |
1427 | value = XCDR (content); | |
30569699 PE |
1428 | if (! (INTEGERP (attrib) && INTEGERP (value) |
1429 | && IN_INT_RANGE (XINT (value)))) | |
e34b1164 KH |
1430 | continue; |
1431 | reg[RRR] = i; | |
30569699 | 1432 | reg[rrr] = XINT (value); |
e34b1164 KH |
1433 | break; |
1434 | } | |
54fa5bc1 KH |
1435 | else if (SYMBOLP (content)) |
1436 | CCL_CALL_FOR_MAP_INSTRUCTION (content, fin_ic); | |
1437 | else | |
1438 | CCL_INVALID_CMD; | |
e34b1164 KH |
1439 | } |
1440 | if (i == j) | |
1441 | reg[RRR] = -1; | |
1442 | ic = fin_ic; | |
1443 | } | |
1444 | break; | |
177c0ea7 | 1445 | |
8146262a | 1446 | case CCL_MapMultiple: |
e34b1164 | 1447 | { |
8146262a | 1448 | Lisp_Object map, content, attrib, value; |
c801946a PE |
1449 | EMACS_INT point; |
1450 | ptrdiff_t size, map_vector_size; | |
8146262a | 1451 | int map_set_rest_length, fin_ic; |
54fa5bc1 KH |
1452 | int current_ic = this_ic; |
1453 | ||
1454 | /* inhibit recursive call on MapMultiple. */ | |
1455 | if (stack_idx_of_map_multiple > 0) | |
1456 | { | |
1457 | if (stack_idx_of_map_multiple <= stack_idx) | |
1458 | { | |
1459 | stack_idx_of_map_multiple = 0; | |
1460 | mapping_stack_pointer = mapping_stack; | |
1461 | CCL_INVALID_CMD; | |
1462 | } | |
1463 | } | |
1464 | else | |
1465 | mapping_stack_pointer = mapping_stack; | |
1466 | stack_idx_of_map_multiple = 0; | |
8146262a | 1467 | |
30569699 | 1468 | /* Get number of maps and separators. */ |
d311d28c | 1469 | map_set_rest_length = XINT (ccl_prog[ic++]); |
30569699 | 1470 | |
8146262a | 1471 | fin_ic = ic + map_set_rest_length; |
54fa5bc1 KH |
1472 | op = reg[rrr]; |
1473 | ||
8146262a | 1474 | if ((map_set_rest_length > reg[RRR]) && (reg[RRR] >= 0)) |
e34b1164 KH |
1475 | { |
1476 | ic += reg[RRR]; | |
1477 | i = reg[RRR]; | |
8146262a | 1478 | map_set_rest_length -= i; |
e34b1164 KH |
1479 | } |
1480 | else | |
1481 | { | |
1482 | ic = fin_ic; | |
1483 | reg[RRR] = -1; | |
54fa5bc1 | 1484 | mapping_stack_pointer = mapping_stack; |
e34b1164 KH |
1485 | break; |
1486 | } | |
6ae21908 | 1487 | |
54fa5bc1 KH |
1488 | if (mapping_stack_pointer <= (mapping_stack + 1)) |
1489 | { | |
1490 | /* Set up initial state. */ | |
1491 | mapping_stack_pointer = mapping_stack; | |
1492 | PUSH_MAPPING_STACK (0, op); | |
1493 | reg[RRR] = -1; | |
1494 | } | |
1495 | else | |
1496 | { | |
1497 | /* Recover after calling other ccl program. */ | |
1498 | int orig_op; | |
e34b1164 | 1499 | |
54fa5bc1 KH |
1500 | POP_MAPPING_STACK (map_set_rest_length, orig_op); |
1501 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1502 | switch (op) | |
e34b1164 | 1503 | { |
54fa5bc1 KH |
1504 | case -1: |
1505 | /* Regard it as Qnil. */ | |
1506 | op = orig_op; | |
1507 | i++; | |
1508 | ic++; | |
1509 | map_set_rest_length--; | |
1510 | break; | |
1511 | case -2: | |
1512 | /* Regard it as Qt. */ | |
e34b1164 | 1513 | op = reg[rrr]; |
54fa5bc1 KH |
1514 | i++; |
1515 | ic++; | |
1516 | map_set_rest_length--; | |
1517 | break; | |
1518 | case -3: | |
1519 | /* Regard it as Qlambda. */ | |
1520 | op = orig_op; | |
1521 | i += map_set_rest_length; | |
1522 | ic += map_set_rest_length; | |
1523 | map_set_rest_length = 0; | |
1524 | break; | |
1525 | default: | |
1526 | /* Regard it as normal mapping. */ | |
8146262a | 1527 | i += map_set_rest_length; |
54fa5bc1 | 1528 | ic += map_set_rest_length; |
8146262a | 1529 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); |
6ae21908 KH |
1530 | break; |
1531 | } | |
e34b1164 | 1532 | } |
c801946a PE |
1533 | if (!VECTORP (Vcode_conversion_map_vector)) |
1534 | CCL_INVALID_CMD; | |
64ef2921 | 1535 | map_vector_size = ASIZE (Vcode_conversion_map_vector); |
177c0ea7 | 1536 | |
54fa5bc1 KH |
1537 | do { |
1538 | for (;map_set_rest_length > 0;i++, ic++, map_set_rest_length--) | |
1539 | { | |
d311d28c | 1540 | point = XINT (ccl_prog[ic]); |
54fa5bc1 KH |
1541 | if (point < 0) |
1542 | { | |
1543 | /* +1 is for including separator. */ | |
1544 | point = -point + 1; | |
1545 | if (mapping_stack_pointer | |
1546 | >= &mapping_stack[MAX_MAP_SET_LEVEL]) | |
1547 | CCL_INVALID_CMD; | |
1548 | PUSH_MAPPING_STACK (map_set_rest_length - point, | |
1549 | reg[rrr]); | |
1550 | map_set_rest_length = point; | |
1551 | reg[rrr] = op; | |
1552 | continue; | |
1553 | } | |
1554 | ||
1555 | if (point >= map_vector_size) continue; | |
64ef2921 | 1556 | map = AREF (Vcode_conversion_map_vector, point); |
54fa5bc1 | 1557 | |
78edd3b7 | 1558 | /* Check map validity. */ |
54fa5bc1 KH |
1559 | if (!CONSP (map)) continue; |
1560 | map = XCDR (map); | |
1561 | if (!VECTORP (map)) continue; | |
64ef2921 | 1562 | size = ASIZE (map); |
54fa5bc1 KH |
1563 | if (size <= 1) continue; |
1564 | ||
64ef2921 | 1565 | content = AREF (map, 0); |
54fa5bc1 KH |
1566 | |
1567 | /* check map type, | |
1568 | [STARTPOINT VAL1 VAL2 ...] or | |
1569 | [t ELEMENT STARTPOINT ENDPOINT] */ | |
30569699 | 1570 | if (INTEGERP (content)) |
54fa5bc1 | 1571 | { |
30569699 PE |
1572 | point = XINT (content); |
1573 | if (!(point <= op && op - point + 1 < size)) continue; | |
1574 | content = AREF (map, op - point + 1); | |
54fa5bc1 KH |
1575 | } |
1576 | else if (EQ (content, Qt)) | |
1577 | { | |
1578 | if (size != 4) continue; | |
30569699 PE |
1579 | if (INTEGERP (AREF (map, 2)) |
1580 | && XINT (AREF (map, 2)) <= op | |
1581 | && INTEGERP (AREF (map, 3)) | |
1582 | && op < XINT (AREF (map, 3))) | |
64ef2921 | 1583 | content = AREF (map, 1); |
54fa5bc1 KH |
1584 | else |
1585 | continue; | |
1586 | } | |
177c0ea7 | 1587 | else |
54fa5bc1 KH |
1588 | continue; |
1589 | ||
1590 | if (NILP (content)) | |
1591 | continue; | |
1592 | ||
1593 | reg[RRR] = i; | |
30569699 | 1594 | if (INTEGERP (content) && IN_INT_RANGE (XINT (content))) |
54fa5bc1 KH |
1595 | { |
1596 | op = XINT (content); | |
1597 | i += map_set_rest_length - 1; | |
1598 | ic += map_set_rest_length - 1; | |
1599 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1600 | map_set_rest_length++; | |
1601 | } | |
1602 | else if (CONSP (content)) | |
1603 | { | |
1604 | attrib = XCAR (content); | |
1605 | value = XCDR (content); | |
30569699 PE |
1606 | if (! (INTEGERP (attrib) && INTEGERP (value) |
1607 | && IN_INT_RANGE (XINT (value)))) | |
54fa5bc1 | 1608 | continue; |
30569699 | 1609 | op = XINT (value); |
54fa5bc1 KH |
1610 | i += map_set_rest_length - 1; |
1611 | ic += map_set_rest_length - 1; | |
1612 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1613 | map_set_rest_length++; | |
1614 | } | |
1615 | else if (EQ (content, Qt)) | |
1616 | { | |
1617 | op = reg[rrr]; | |
1618 | } | |
1619 | else if (EQ (content, Qlambda)) | |
1620 | { | |
1621 | i += map_set_rest_length; | |
1622 | ic += map_set_rest_length; | |
1623 | break; | |
1624 | } | |
1625 | else if (SYMBOLP (content)) | |
1626 | { | |
1627 | if (mapping_stack_pointer | |
1628 | >= &mapping_stack[MAX_MAP_SET_LEVEL]) | |
1629 | CCL_INVALID_CMD; | |
1630 | PUSH_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1631 | PUSH_MAPPING_STACK (map_set_rest_length, op); | |
1632 | stack_idx_of_map_multiple = stack_idx + 1; | |
1633 | CCL_CALL_FOR_MAP_INSTRUCTION (content, current_ic); | |
1634 | } | |
1635 | else | |
1636 | CCL_INVALID_CMD; | |
1637 | } | |
1638 | if (mapping_stack_pointer <= (mapping_stack + 1)) | |
1639 | break; | |
1640 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1641 | i += map_set_rest_length; | |
1642 | ic += map_set_rest_length; | |
1643 | POP_MAPPING_STACK (map_set_rest_length, reg[rrr]); | |
1644 | } while (1); | |
1645 | ||
e34b1164 KH |
1646 | ic = fin_ic; |
1647 | } | |
1648 | reg[rrr] = op; | |
1649 | break; | |
1650 | ||
8146262a | 1651 | case CCL_MapSingle: |
e34b1164 | 1652 | { |
8146262a | 1653 | Lisp_Object map, attrib, value, content; |
30569699 | 1654 | int point; |
8146262a | 1655 | j = XINT (ccl_prog[ic++]); /* map_id */ |
e34b1164 | 1656 | op = reg[rrr]; |
c801946a PE |
1657 | if (! (VECTORP (Vcode_conversion_map_vector) |
1658 | && j < ASIZE (Vcode_conversion_map_vector))) | |
e34b1164 KH |
1659 | { |
1660 | reg[RRR] = -1; | |
1661 | break; | |
1662 | } | |
64ef2921 | 1663 | map = AREF (Vcode_conversion_map_vector, j); |
8146262a | 1664 | if (!CONSP (map)) |
e34b1164 KH |
1665 | { |
1666 | reg[RRR] = -1; | |
1667 | break; | |
1668 | } | |
03699b14 | 1669 | map = XCDR (map); |
30569699 | 1670 | if (! (VECTORP (map) |
7216e43b | 1671 | && 0 < ASIZE (map) |
30569699 PE |
1672 | && INTEGERP (AREF (map, 0)) |
1673 | && XINT (AREF (map, 0)) <= op | |
1674 | && op - XINT (AREF (map, 0)) + 1 < ASIZE (map))) | |
e34b1164 KH |
1675 | { |
1676 | reg[RRR] = -1; | |
1677 | break; | |
1678 | } | |
d311d28c | 1679 | point = op - XINT (AREF (map, 0)) + 1; |
e34b1164 | 1680 | reg[RRR] = 0; |
30569699 PE |
1681 | content = AREF (map, point); |
1682 | if (NILP (content)) | |
e34b1164 | 1683 | reg[RRR] = -1; |
d311d28c | 1684 | else if (TYPE_RANGED_INTEGERP (int, content)) |
30569699 PE |
1685 | reg[rrr] = XINT (content); |
1686 | else if (EQ (content, Qt)); | |
1687 | else if (CONSP (content)) | |
e34b1164 | 1688 | { |
30569699 PE |
1689 | attrib = XCAR (content); |
1690 | value = XCDR (content); | |
d311d28c PE |
1691 | if (!INTEGERP (attrib) |
1692 | || !TYPE_RANGED_INTEGERP (int, value)) | |
30569699 | 1693 | continue; |
5e617bc2 | 1694 | reg[rrr] = XINT (value); |
30569699 | 1695 | break; |
e34b1164 | 1696 | } |
30569699 PE |
1697 | else if (SYMBOLP (content)) |
1698 | CCL_CALL_FOR_MAP_INSTRUCTION (content, ic); | |
1699 | else | |
1700 | reg[RRR] = -1; | |
e34b1164 KH |
1701 | } |
1702 | break; | |
177c0ea7 | 1703 | |
e34b1164 KH |
1704 | default: |
1705 | CCL_INVALID_CMD; | |
1706 | } | |
1707 | break; | |
1708 | ||
4ed46869 KH |
1709 | default: |
1710 | CCL_INVALID_CMD; | |
1711 | } | |
1712 | } | |
1713 | ||
1714 | ccl_error_handler: | |
96c06863 | 1715 | if (destination) |
4ed46869 KH |
1716 | { |
1717 | /* We can insert an error message only if DESTINATION is | |
1718 | specified and we still have a room to store the message | |
1719 | there. */ | |
1720 | char msg[256]; | |
1721 | int msglen; | |
1722 | ||
12abd7d1 KH |
1723 | if (!dst) |
1724 | dst = destination; | |
1725 | ||
4ed46869 KH |
1726 | switch (ccl->status) |
1727 | { | |
1728 | case CCL_STAT_INVALID_CMD: | |
99027bdd PE |
1729 | msglen = sprintf (msg, |
1730 | "\nCCL: Invalid command %x (ccl_code = %x) at %d.", | |
1731 | code & 0x1F, code, this_ic); | |
4ed46869 KH |
1732 | #ifdef CCL_DEBUG |
1733 | { | |
1734 | int i = ccl_backtrace_idx - 1; | |
1735 | int j; | |
1736 | ||
12abd7d1 | 1737 | if (dst + msglen <= (dst_bytes ? dst_end : src)) |
4ed46869 | 1738 | { |
72af86bd | 1739 | memcpy (dst, msg, msglen); |
4ed46869 KH |
1740 | dst += msglen; |
1741 | } | |
1742 | ||
1743 | for (j = 0; j < CCL_DEBUG_BACKTRACE_LEN; j++, i--) | |
1744 | { | |
1745 | if (i < 0) i = CCL_DEBUG_BACKTRACE_LEN - 1; | |
1746 | if (ccl_backtrace_table[i] == 0) | |
1747 | break; | |
99027bdd | 1748 | msglen = sprintf (msg, " %d", ccl_backtrace_table[i]); |
12abd7d1 | 1749 | if (dst + msglen > (dst_bytes ? dst_end : src)) |
4ed46869 | 1750 | break; |
72af86bd | 1751 | memcpy (dst, msg, msglen); |
4ed46869 KH |
1752 | dst += msglen; |
1753 | } | |
12abd7d1 | 1754 | goto ccl_finish; |
4ed46869 | 1755 | } |
4ed46869 | 1756 | #endif |
12abd7d1 | 1757 | break; |
4ed46869 KH |
1758 | |
1759 | case CCL_STAT_QUIT: | |
99027bdd | 1760 | msglen = ccl->quit_silently ? 0 : sprintf (msg, "\nCCL: Quitted."); |
4ed46869 KH |
1761 | break; |
1762 | ||
1763 | default: | |
99027bdd | 1764 | msglen = sprintf (msg, "\nCCL: Unknown error type (%d)", ccl->status); |
4ed46869 KH |
1765 | } |
1766 | ||
f2cad773 | 1767 | if (msglen <= dst_end - dst) |
4ed46869 | 1768 | { |
c10842ea KH |
1769 | for (i = 0; i < msglen; i++) |
1770 | *dst++ = msg[i]; | |
4ed46869 | 1771 | } |
177c0ea7 | 1772 | |
31165028 KH |
1773 | if (ccl->status == CCL_STAT_INVALID_CMD) |
1774 | { | |
8a1ae4dd GM |
1775 | #if 0 /* If the remaining bytes contain 0x80..0x9F, copying them |
1776 | results in an invalid multibyte sequence. */ | |
1777 | ||
31165028 KH |
1778 | /* Copy the remaining source data. */ |
1779 | int i = src_end - src; | |
1780 | if (dst_bytes && (dst_end - dst) < i) | |
1781 | i = dst_end - dst; | |
72af86bd | 1782 | memcpy (dst, src, i); |
31165028 KH |
1783 | src += i; |
1784 | dst += i; | |
8a1ae4dd GM |
1785 | #else |
1786 | /* Signal that we've consumed everything. */ | |
1787 | src = src_end; | |
1788 | #endif | |
31165028 | 1789 | } |
4ed46869 KH |
1790 | } |
1791 | ||
1792 | ccl_finish: | |
1793 | ccl->ic = ic; | |
c13362d8 KH |
1794 | ccl->stack_idx = stack_idx; |
1795 | ccl->prog = ccl_prog; | |
c10842ea | 1796 | ccl->consumed = src - source; |
4e3bb4f3 KH |
1797 | if (dst != NULL) |
1798 | ccl->produced = dst - destination; | |
1799 | else | |
1800 | ccl->produced = 0; | |
4ed46869 KH |
1801 | } |
1802 | ||
5232fa7b KH |
1803 | /* Resolve symbols in the specified CCL code (Lisp vector). This |
1804 | function converts symbols of code conversion maps and character | |
4c36be58 | 1805 | translation tables embedded in the CCL code into their ID numbers. |
5232fa7b | 1806 | |
d311d28c PE |
1807 | The return value is a new vector in which all symbols are resolved, |
1808 | Qt if resolving of some symbol failed, | |
5232fa7b KH |
1809 | or nil if CCL contains invalid data. */ |
1810 | ||
1811 | static Lisp_Object | |
971de7fb | 1812 | resolve_symbol_ccl_program (Lisp_Object ccl) |
5232fa7b KH |
1813 | { |
1814 | int i, veclen, unresolved = 0; | |
1815 | Lisp_Object result, contents, val; | |
1816 | ||
d311d28c PE |
1817 | if (! (CCL_HEADER_MAIN < ASIZE (ccl) && ASIZE (ccl) <= INT_MAX)) |
1818 | return Qnil; | |
1819 | result = Fcopy_sequence (ccl); | |
64ef2921 | 1820 | veclen = ASIZE (result); |
5232fa7b KH |
1821 | |
1822 | for (i = 0; i < veclen; i++) | |
1823 | { | |
64ef2921 | 1824 | contents = AREF (result, i); |
d311d28c | 1825 | if (TYPE_RANGED_INTEGERP (int, contents)) |
5232fa7b KH |
1826 | continue; |
1827 | else if (CONSP (contents) | |
03699b14 KR |
1828 | && SYMBOLP (XCAR (contents)) |
1829 | && SYMBOLP (XCDR (contents))) | |
5232fa7b KH |
1830 | { |
1831 | /* This is the new style for embedding symbols. The form is | |
1832 | (SYMBOL . PROPERTY). (get SYMBOL PROPERTY) should give | |
1833 | an index number. */ | |
03699b14 | 1834 | val = Fget (XCAR (contents), XCDR (contents)); |
d311d28c | 1835 | if (RANGED_INTEGERP (0, val, INT_MAX)) |
3ae565b3 | 1836 | ASET (result, i, val); |
5232fa7b KH |
1837 | else |
1838 | unresolved = 1; | |
1839 | continue; | |
1840 | } | |
1841 | else if (SYMBOLP (contents)) | |
1842 | { | |
1843 | /* This is the old style for embedding symbols. This style | |
1844 | may lead to a bug if, for instance, a translation table | |
1845 | and a code conversion map have the same name. */ | |
5232fa7b | 1846 | val = Fget (contents, Qtranslation_table_id); |
d311d28c | 1847 | if (RANGED_INTEGERP (0, val, INT_MAX)) |
3ae565b3 | 1848 | ASET (result, i, val); |
5232fa7b KH |
1849 | else |
1850 | { | |
1851 | val = Fget (contents, Qcode_conversion_map_id); | |
d311d28c | 1852 | if (RANGED_INTEGERP (0, val, INT_MAX)) |
3ae565b3 | 1853 | ASET (result, i, val); |
5232fa7b KH |
1854 | else |
1855 | { | |
1856 | val = Fget (contents, Qccl_program_idx); | |
d311d28c | 1857 | if (RANGED_INTEGERP (0, val, INT_MAX)) |
3ae565b3 | 1858 | ASET (result, i, val); |
5232fa7b KH |
1859 | else |
1860 | unresolved = 1; | |
1861 | } | |
1862 | } | |
1863 | continue; | |
1864 | } | |
1865 | return Qnil; | |
1866 | } | |
1867 | ||
7216e43b | 1868 | if (! (0 <= XINT (AREF (result, CCL_HEADER_BUF_MAG)) |
d311d28c PE |
1869 | && ASCENDING_ORDER (0, XINT (AREF (result, CCL_HEADER_EOF)), |
1870 | ASIZE (ccl)))) | |
1871 | return Qnil; | |
1872 | ||
5232fa7b KH |
1873 | return (unresolved ? Qt : result); |
1874 | } | |
1875 | ||
1876 | /* Return the compiled code (vector) of CCL program CCL_PROG. | |
1877 | CCL_PROG is a name (symbol) of the program or already compiled | |
1878 | code. If necessary, resolve symbols in the compiled code to index | |
1879 | numbers. If we failed to get the compiled code or to resolve | |
1880 | symbols, return Qnil. */ | |
1881 | ||
1882 | static Lisp_Object | |
d311d28c | 1883 | ccl_get_compiled_code (Lisp_Object ccl_prog, ptrdiff_t *idx) |
5232fa7b KH |
1884 | { |
1885 | Lisp_Object val, slot; | |
1886 | ||
1887 | if (VECTORP (ccl_prog)) | |
1888 | { | |
1889 | val = resolve_symbol_ccl_program (ccl_prog); | |
2a69c66e | 1890 | *idx = -1; |
5232fa7b KH |
1891 | return (VECTORP (val) ? val : Qnil); |
1892 | } | |
1893 | if (!SYMBOLP (ccl_prog)) | |
1894 | return Qnil; | |
1895 | ||
1896 | val = Fget (ccl_prog, Qccl_program_idx); | |
1897 | if (! NATNUMP (val) | |
64ef2921 | 1898 | || XINT (val) >= ASIZE (Vccl_program_table)) |
5232fa7b | 1899 | return Qnil; |
64ef2921 | 1900 | slot = AREF (Vccl_program_table, XINT (val)); |
5232fa7b | 1901 | if (! VECTORP (slot) |
2a69c66e | 1902 | || ASIZE (slot) != 4 |
64ef2921 | 1903 | || ! VECTORP (AREF (slot, 1))) |
5232fa7b | 1904 | return Qnil; |
2a69c66e | 1905 | *idx = XINT (val); |
64ef2921 | 1906 | if (NILP (AREF (slot, 2))) |
5232fa7b | 1907 | { |
64ef2921 | 1908 | val = resolve_symbol_ccl_program (AREF (slot, 1)); |
5232fa7b KH |
1909 | if (! VECTORP (val)) |
1910 | return Qnil; | |
3ae565b3 SM |
1911 | ASET (slot, 1, val); |
1912 | ASET (slot, 2, Qt); | |
5232fa7b | 1913 | } |
64ef2921 | 1914 | return AREF (slot, 1); |
5232fa7b KH |
1915 | } |
1916 | ||
4ed46869 | 1917 | /* Setup fields of the structure pointed by CCL appropriately for the |
5232fa7b KH |
1918 | execution of CCL program CCL_PROG. CCL_PROG is the name (symbol) |
1919 | of the CCL program or the already compiled code (vector). | |
96c06863 | 1920 | Return true iff successful. |
5232fa7b | 1921 | |
96c06863 PE |
1922 | If CCL_PROG is nil, just reset the structure pointed by CCL. */ |
1923 | bool | |
971de7fb | 1924 | setup_ccl_program (struct ccl_program *ccl, Lisp_Object ccl_prog) |
4ed46869 KH |
1925 | { |
1926 | int i; | |
1927 | ||
5232fa7b | 1928 | if (! NILP (ccl_prog)) |
ad3d1b1d | 1929 | { |
5232fa7b | 1930 | struct Lisp_Vector *vp; |
ad3d1b1d | 1931 | |
2a69c66e | 1932 | ccl_prog = ccl_get_compiled_code (ccl_prog, &ccl->idx); |
5232fa7b | 1933 | if (! VECTORP (ccl_prog)) |
96c06863 | 1934 | return false; |
5232fa7b | 1935 | vp = XVECTOR (ccl_prog); |
eab3844f | 1936 | ccl->size = vp->header.size; |
91f2d272 PE |
1937 | ccl->prog = vp->contents; |
1938 | ccl->eof_ic = XINT (vp->contents[CCL_HEADER_EOF]); | |
1939 | ccl->buf_magnification = XINT (vp->contents[CCL_HEADER_BUF_MAG]); | |
2a69c66e KH |
1940 | if (ccl->idx >= 0) |
1941 | { | |
1942 | Lisp_Object slot; | |
1943 | ||
1944 | slot = AREF (Vccl_program_table, ccl->idx); | |
1945 | ASET (slot, 3, Qnil); | |
1946 | } | |
ad3d1b1d | 1947 | } |
4ed46869 | 1948 | ccl->ic = CCL_HEADER_MAIN; |
4ed46869 KH |
1949 | for (i = 0; i < 8; i++) |
1950 | ccl->reg[i] = 0; | |
96c06863 | 1951 | ccl->last_block = false; |
4ed46869 | 1952 | ccl->status = 0; |
c13362d8 | 1953 | ccl->stack_idx = 0; |
96c06863 PE |
1954 | ccl->quit_silently = false; |
1955 | return true; | |
4ed46869 KH |
1956 | } |
1957 | ||
2a69c66e | 1958 | |
a7ca3326 | 1959 | DEFUN ("ccl-program-p", Fccl_program_p, Sccl_program_p, 1, 1, 0, |
fdb82f93 | 1960 | doc: /* Return t if OBJECT is a CCL program name or a compiled CCL program code. |
78edd3b7 | 1961 | See the documentation of `define-ccl-program' for the detail of CCL program. */) |
6f704c76 | 1962 | (Lisp_Object object) |
6ae21908 | 1963 | { |
5232fa7b | 1964 | Lisp_Object val; |
6ae21908 | 1965 | |
5232fa7b | 1966 | if (VECTORP (object)) |
6ae21908 | 1967 | { |
5232fa7b KH |
1968 | val = resolve_symbol_ccl_program (object); |
1969 | return (VECTORP (val) ? Qt : Qnil); | |
6ae21908 | 1970 | } |
5232fa7b KH |
1971 | if (!SYMBOLP (object)) |
1972 | return Qnil; | |
6ae21908 | 1973 | |
5232fa7b KH |
1974 | val = Fget (object, Qccl_program_idx); |
1975 | return ((! NATNUMP (val) | |
64ef2921 | 1976 | || XINT (val) >= ASIZE (Vccl_program_table)) |
5232fa7b | 1977 | ? Qnil : Qt); |
6ae21908 KH |
1978 | } |
1979 | ||
4ed46869 | 1980 | DEFUN ("ccl-execute", Fccl_execute, Sccl_execute, 2, 2, 0, |
fdb82f93 PJ |
1981 | doc: /* Execute CCL-PROGRAM with registers initialized by REGISTERS. |
1982 | ||
1983 | CCL-PROGRAM is a CCL program name (symbol) | |
1984 | or compiled code generated by `ccl-compile' (for backward compatibility. | |
1985 | In the latter case, the execution overhead is bigger than in the former). | |
1986 | No I/O commands should appear in CCL-PROGRAM. | |
1987 | ||
1988 | REGISTERS is a vector of [R0 R1 ... R7] where RN is an initial value | |
1989 | for the Nth register. | |
1990 | ||
1991 | As side effect, each element of REGISTERS holds the value of | |
1992 | the corresponding register after the execution. | |
1993 | ||
1994 | See the documentation of `define-ccl-program' for a definition of CCL | |
1995 | programs. */) | |
6f704c76 | 1996 | (Lisp_Object ccl_prog, Lisp_Object reg) |
4ed46869 KH |
1997 | { |
1998 | struct ccl_program ccl; | |
1999 | int i; | |
2000 | ||
96c06863 | 2001 | if (! setup_ccl_program (&ccl, ccl_prog)) |
5232fa7b | 2002 | error ("Invalid CCL program"); |
6ae21908 | 2003 | |
b7826503 | 2004 | CHECK_VECTOR (reg); |
64ef2921 | 2005 | if (ASIZE (reg) != 8) |
d7e1fe1f | 2006 | error ("Length of vector REGISTERS is not 8"); |
4ed46869 | 2007 | |
4ed46869 | 2008 | for (i = 0; i < 8; i++) |
d311d28c | 2009 | ccl.reg[i] = (TYPE_RANGED_INTEGERP (int, AREF (reg, i)) |
64ef2921 | 2010 | ? XINT (AREF (reg, i)) |
4ed46869 KH |
2011 | : 0); |
2012 | ||
bda731af | 2013 | ccl_driver (&ccl, NULL, NULL, 0, 0, Qnil); |
4ed46869 KH |
2014 | QUIT; |
2015 | if (ccl.status != CCL_STAT_SUCCESS) | |
2016 | error ("Error in CCL program at %dth code", ccl.ic); | |
2017 | ||
2018 | for (i = 0; i < 8; i++) | |
3ae565b3 | 2019 | ASET (reg, i, make_number (ccl.reg[i])); |
4ed46869 KH |
2020 | return Qnil; |
2021 | } | |
2022 | ||
2023 | DEFUN ("ccl-execute-on-string", Fccl_execute_on_string, Sccl_execute_on_string, | |
39a68837 | 2024 | 3, 5, 0, |
fdb82f93 PJ |
2025 | doc: /* Execute CCL-PROGRAM with initial STATUS on STRING. |
2026 | ||
2a0bd758 | 2027 | CCL-PROGRAM is a symbol registered by `register-ccl-program', |
fdb82f93 PJ |
2028 | or a compiled code generated by `ccl-compile' (for backward compatibility, |
2029 | in this case, the execution is slower). | |
2030 | ||
2031 | Read buffer is set to STRING, and write buffer is allocated automatically. | |
2032 | ||
2033 | STATUS is a vector of [R0 R1 ... R7 IC], where | |
2034 | R0..R7 are initial values of corresponding registers, | |
2035 | IC is the instruction counter specifying from where to start the program. | |
2036 | If R0..R7 are nil, they are initialized to 0. | |
2037 | If IC is nil, it is initialized to head of the CCL program. | |
2038 | ||
2039 | If optional 4th arg CONTINUE is non-nil, keep IC on read operation | |
51e4f4a8 | 2040 | when read buffer is exhausted, else, IC is always set to the end of |
fdb82f93 PJ |
2041 | CCL-PROGRAM on exit. |
2042 | ||
2043 | It returns the contents of write buffer as a string, | |
2044 | and as side effect, STATUS is updated. | |
2045 | If the optional 5th arg UNIBYTE-P is non-nil, the returned string | |
2046 | is a unibyte string. By default it is a multibyte string. | |
2047 | ||
2a0bd758 JB |
2048 | See the documentation of `define-ccl-program' for the detail of CCL program. |
2049 | usage: (ccl-execute-on-string CCL-PROGRAM STATUS STRING &optional CONTINUE UNIBYTE-P) */) | |
6f704c76 | 2050 | (Lisp_Object ccl_prog, Lisp_Object status, Lisp_Object str, Lisp_Object contin, Lisp_Object unibyte_p) |
4ed46869 KH |
2051 | { |
2052 | Lisp_Object val; | |
2053 | struct ccl_program ccl; | |
c10842ea | 2054 | int i; |
69e8622f | 2055 | ptrdiff_t outbufsize; |
c10842ea | 2056 | unsigned char *outbuf, *outp; |
69e8622f | 2057 | ptrdiff_t str_chars, str_bytes; |
c10842ea KH |
2058 | #define CCL_EXECUTE_BUF_SIZE 1024 |
2059 | int source[CCL_EXECUTE_BUF_SIZE], destination[CCL_EXECUTE_BUF_SIZE]; | |
69e8622f | 2060 | ptrdiff_t consumed_chars, consumed_bytes, produced_chars; |
0065d054 | 2061 | int buf_magnification; |
6ae21908 | 2062 | |
96c06863 | 2063 | if (! setup_ccl_program (&ccl, ccl_prog)) |
5232fa7b | 2064 | error ("Invalid CCL program"); |
4ed46869 | 2065 | |
b7826503 | 2066 | CHECK_VECTOR (status); |
64ef2921 | 2067 | if (ASIZE (status) != 9) |
5232fa7b | 2068 | error ("Length of vector STATUS is not 9"); |
b7826503 | 2069 | CHECK_STRING (str); |
4ed46869 | 2070 | |
8f924df7 KH |
2071 | str_chars = SCHARS (str); |
2072 | str_bytes = SBYTES (str); | |
5232fa7b | 2073 | |
4ed46869 KH |
2074 | for (i = 0; i < 8; i++) |
2075 | { | |
64ef2921 | 2076 | if (NILP (AREF (status, i))) |
3ae565b3 | 2077 | ASET (status, i, make_number (0)); |
d311d28c | 2078 | if (TYPE_RANGED_INTEGERP (int, AREF (status, i))) |
64ef2921 | 2079 | ccl.reg[i] = XINT (AREF (status, i)); |
4ed46869 | 2080 | } |
64ef2921 | 2081 | if (INTEGERP (AREF (status, i))) |
4ed46869 | 2082 | { |
64ef2921 | 2083 | i = XFASTINT (AREF (status, 8)); |
4ed46869 KH |
2084 | if (ccl.ic < i && i < ccl.size) |
2085 | ccl.ic = i; | |
2086 | } | |
4ed46869 | 2087 | |
0065d054 PE |
2088 | buf_magnification = ccl.buf_magnification ? ccl.buf_magnification : 1; |
2089 | ||
2090 | if ((min (PTRDIFF_MAX, SIZE_MAX) - 256) / buf_magnification < str_bytes) | |
69e8622f | 2091 | memory_full (SIZE_MAX); |
c10842ea KH |
2092 | outbufsize = (ccl.buf_magnification |
2093 | ? str_bytes * ccl.buf_magnification + 256 | |
2094 | : str_bytes + 256); | |
23f86fce | 2095 | outp = outbuf = xmalloc (outbufsize); |
c10842ea KH |
2096 | |
2097 | consumed_chars = consumed_bytes = 0; | |
2098 | produced_chars = 0; | |
99e293b5 | 2099 | while (1) |
a3d8fcf2 | 2100 | { |
8f924df7 KH |
2101 | const unsigned char *p = SDATA (str) + consumed_bytes; |
2102 | const unsigned char *endp = SDATA (str) + str_bytes; | |
fb90da1b | 2103 | int j = 0; |
c10842ea KH |
2104 | int *src, src_size; |
2105 | ||
2106 | if (endp - p == str_chars - consumed_chars) | |
fb90da1b PE |
2107 | while (j < CCL_EXECUTE_BUF_SIZE && p < endp) |
2108 | source[j++] = *p++; | |
c10842ea | 2109 | else |
fb90da1b PE |
2110 | while (j < CCL_EXECUTE_BUF_SIZE && p < endp) |
2111 | source[j++] = STRING_CHAR_ADVANCE (p); | |
2112 | consumed_chars += j; | |
8f924df7 | 2113 | consumed_bytes = p - SDATA (str); |
c10842ea KH |
2114 | |
2115 | if (consumed_bytes == str_bytes) | |
2116 | ccl.last_block = NILP (contin); | |
2117 | src = source; | |
fb90da1b | 2118 | src_size = j; |
c10842ea KH |
2119 | while (1) |
2120 | { | |
f2cad773 PE |
2121 | int max_expansion = NILP (unibyte_p) ? MAX_MULTIBYTE_LENGTH : 1; |
2122 | ptrdiff_t offset, shortfall; | |
bda731af KH |
2123 | ccl_driver (&ccl, src, destination, src_size, CCL_EXECUTE_BUF_SIZE, |
2124 | Qnil); | |
c10842ea | 2125 | produced_chars += ccl.produced; |
f2cad773 PE |
2126 | offset = outp - outbuf; |
2127 | shortfall = ccl.produced * max_expansion - (outbufsize - offset); | |
908589fd | 2128 | if (shortfall > 0) |
f2cad773 PE |
2129 | { |
2130 | outbuf = xpalloc (outbuf, &outbufsize, shortfall, -1, 1); | |
2131 | outp = outbuf + offset; | |
2132 | } | |
c10842ea KH |
2133 | if (NILP (unibyte_p)) |
2134 | { | |
fb90da1b PE |
2135 | for (j = 0; j < ccl.produced; j++) |
2136 | CHAR_STRING_ADVANCE (destination[j], outp); | |
c10842ea KH |
2137 | } |
2138 | else | |
2139 | { | |
fb90da1b PE |
2140 | for (j = 0; j < ccl.produced; j++) |
2141 | *outp++ = destination[j]; | |
c10842ea KH |
2142 | } |
2143 | src += ccl.consumed; | |
2144 | src_size -= ccl.consumed; | |
99e293b5 KH |
2145 | if (ccl.status != CCL_STAT_SUSPEND_BY_DST) |
2146 | break; | |
c10842ea | 2147 | } |
a3d8fcf2 | 2148 | |
edeef421 KH |
2149 | if (ccl.status != CCL_STAT_SUSPEND_BY_SRC |
2150 | || str_chars == consumed_chars) | |
c10842ea | 2151 | break; |
a3d8fcf2 | 2152 | } |
a3d8fcf2 | 2153 | |
edeef421 | 2154 | if (ccl.status == CCL_STAT_INVALID_CMD) |
4ed46869 | 2155 | error ("Error in CCL program at %dth code", ccl.ic); |
edeef421 KH |
2156 | if (ccl.status == CCL_STAT_QUIT) |
2157 | error ("CCL program interrupted at %dth code", ccl.ic); | |
4ed46869 | 2158 | |
c10842ea | 2159 | for (i = 0; i < 8; i++) |
c6589bbd KH |
2160 | ASET (status, i, make_number (ccl.reg[i])); |
2161 | ASET (status, 8, make_number (ccl.ic)); | |
c10842ea KH |
2162 | |
2163 | if (NILP (unibyte_p)) | |
2164 | val = make_multibyte_string ((char *) outbuf, produced_chars, | |
2165 | outp - outbuf); | |
2166 | else | |
2167 | val = make_unibyte_string ((char *) outbuf, produced_chars); | |
2168 | xfree (outbuf); | |
4ed46869 KH |
2169 | |
2170 | return val; | |
2171 | } | |
2172 | ||
2173 | DEFUN ("register-ccl-program", Fregister_ccl_program, Sregister_ccl_program, | |
2174 | 2, 2, 0, | |
2a0bd758 JB |
2175 | doc: /* Register CCL program CCL-PROG as NAME in `ccl-program-table'. |
2176 | CCL-PROG should be a compiled CCL program (vector), or nil. | |
fdb82f93 PJ |
2177 | If it is nil, just reserve NAME as a CCL program name. |
2178 | Return index number of the registered CCL program. */) | |
6f704c76 | 2179 | (Lisp_Object name, Lisp_Object ccl_prog) |
4ed46869 | 2180 | { |
d311d28c PE |
2181 | ptrdiff_t len = ASIZE (Vccl_program_table); |
2182 | ptrdiff_t idx; | |
5232fa7b | 2183 | Lisp_Object resolved; |
4ed46869 | 2184 | |
b7826503 | 2185 | CHECK_SYMBOL (name); |
5232fa7b | 2186 | resolved = Qnil; |
4ed46869 | 2187 | if (!NILP (ccl_prog)) |
6ae21908 | 2188 | { |
b7826503 | 2189 | CHECK_VECTOR (ccl_prog); |
5232fa7b | 2190 | resolved = resolve_symbol_ccl_program (ccl_prog); |
4d247a1f KH |
2191 | if (NILP (resolved)) |
2192 | error ("Error in CCL program"); | |
2193 | if (VECTORP (resolved)) | |
5232fa7b KH |
2194 | { |
2195 | ccl_prog = resolved; | |
2196 | resolved = Qt; | |
2197 | } | |
4d247a1f KH |
2198 | else |
2199 | resolved = Qnil; | |
6ae21908 | 2200 | } |
5232fa7b KH |
2201 | |
2202 | for (idx = 0; idx < len; idx++) | |
4ed46869 | 2203 | { |
5232fa7b | 2204 | Lisp_Object slot; |
4ed46869 | 2205 | |
64ef2921 | 2206 | slot = AREF (Vccl_program_table, idx); |
5232fa7b | 2207 | if (!VECTORP (slot)) |
78edd3b7 | 2208 | /* This is the first unused slot. Register NAME here. */ |
4ed46869 KH |
2209 | break; |
2210 | ||
64ef2921 | 2211 | if (EQ (name, AREF (slot, 0))) |
4ed46869 | 2212 | { |
5232fa7b | 2213 | /* Update this slot. */ |
2a69c66e KH |
2214 | ASET (slot, 1, ccl_prog); |
2215 | ASET (slot, 2, resolved); | |
2216 | ASET (slot, 3, Qt); | |
5232fa7b | 2217 | return make_number (idx); |
4ed46869 KH |
2218 | } |
2219 | } | |
2220 | ||
5232fa7b | 2221 | if (idx == len) |
1d153206 | 2222 | /* Extend the table. */ |
d311d28c | 2223 | Vccl_program_table = larger_vector (Vccl_program_table, 1, -1); |
4ed46869 | 2224 | |
5232fa7b | 2225 | { |
25721f5b | 2226 | Lisp_Object elt = make_uninit_vector (4); |
5232fa7b | 2227 | |
2a69c66e KH |
2228 | ASET (elt, 0, name); |
2229 | ASET (elt, 1, ccl_prog); | |
2230 | ASET (elt, 2, resolved); | |
2231 | ASET (elt, 3, Qt); | |
2232 | ASET (Vccl_program_table, idx, elt); | |
5232fa7b KH |
2233 | } |
2234 | ||
2235 | Fput (name, Qccl_program_idx, make_number (idx)); | |
2236 | return make_number (idx); | |
4ed46869 KH |
2237 | } |
2238 | ||
8146262a KH |
2239 | /* Register code conversion map. |
2240 | A code conversion map consists of numbers, Qt, Qnil, and Qlambda. | |
d617f6df DL |
2241 | The first element is the start code point. |
2242 | The other elements are mapped numbers. | |
8146262a KH |
2243 | Symbol t means to map to an original number before mapping. |
2244 | Symbol nil means that the corresponding element is empty. | |
d617f6df | 2245 | Symbol lambda means to terminate mapping here. |
e34b1164 KH |
2246 | */ |
2247 | ||
8146262a KH |
2248 | DEFUN ("register-code-conversion-map", Fregister_code_conversion_map, |
2249 | Sregister_code_conversion_map, | |
e34b1164 | 2250 | 2, 2, 0, |
fdb82f93 PJ |
2251 | doc: /* Register SYMBOL as code conversion map MAP. |
2252 | Return index number of the registered map. */) | |
6f704c76 | 2253 | (Lisp_Object symbol, Lisp_Object map) |
e34b1164 | 2254 | { |
c801946a | 2255 | ptrdiff_t len; |
d311d28c | 2256 | ptrdiff_t i; |
fb90da1b | 2257 | Lisp_Object idx; |
e34b1164 | 2258 | |
b7826503 PJ |
2259 | CHECK_SYMBOL (symbol); |
2260 | CHECK_VECTOR (map); | |
c801946a PE |
2261 | if (! VECTORP (Vcode_conversion_map_vector)) |
2262 | error ("Invalid code-conversion-map-vector"); | |
2263 | ||
2264 | len = ASIZE (Vcode_conversion_map_vector); | |
177c0ea7 | 2265 | |
e34b1164 KH |
2266 | for (i = 0; i < len; i++) |
2267 | { | |
64ef2921 | 2268 | Lisp_Object slot = AREF (Vcode_conversion_map_vector, i); |
e34b1164 KH |
2269 | |
2270 | if (!CONSP (slot)) | |
2271 | break; | |
2272 | ||
03699b14 | 2273 | if (EQ (symbol, XCAR (slot))) |
e34b1164 | 2274 | { |
fb90da1b | 2275 | idx = make_number (i); |
f3fbd155 | 2276 | XSETCDR (slot, map); |
8146262a | 2277 | Fput (symbol, Qcode_conversion_map, map); |
fb90da1b PE |
2278 | Fput (symbol, Qcode_conversion_map_id, idx); |
2279 | return idx; | |
e34b1164 KH |
2280 | } |
2281 | } | |
2282 | ||
2283 | if (i == len) | |
2a1aad57 | 2284 | Vcode_conversion_map_vector = larger_vector (Vcode_conversion_map_vector, |
d311d28c | 2285 | 1, -1); |
e34b1164 | 2286 | |
fb90da1b | 2287 | idx = make_number (i); |
8146262a | 2288 | Fput (symbol, Qcode_conversion_map, map); |
fb90da1b | 2289 | Fput (symbol, Qcode_conversion_map_id, idx); |
3ae565b3 | 2290 | ASET (Vcode_conversion_map_vector, i, Fcons (symbol, map)); |
fb90da1b | 2291 | return idx; |
e34b1164 KH |
2292 | } |
2293 | ||
2294 | ||
dfcf069d | 2295 | void |
971de7fb | 2296 | syms_of_ccl (void) |
4ed46869 KH |
2297 | { |
2298 | staticpro (&Vccl_program_table); | |
6703ac4f | 2299 | Vccl_program_table = Fmake_vector (make_number (32), Qnil); |
4ed46869 | 2300 | |
cd3520a4 JB |
2301 | DEFSYM (Qccl, "ccl"); |
2302 | DEFSYM (Qcclp, "cclp"); | |
2303 | DEFSYM (Qccl_program, "ccl-program"); | |
2304 | DEFSYM (Qccl_program_idx, "ccl-program-idx"); | |
2305 | DEFSYM (Qcode_conversion_map, "code-conversion-map"); | |
2306 | DEFSYM (Qcode_conversion_map_id, "code-conversion-map-id"); | |
6ae21908 | 2307 | |
29208e82 | 2308 | DEFVAR_LISP ("code-conversion-map-vector", Vcode_conversion_map_vector, |
fdb82f93 | 2309 | doc: /* Vector of code conversion maps. */); |
8146262a | 2310 | Vcode_conversion_map_vector = Fmake_vector (make_number (16), Qnil); |
e34b1164 | 2311 | |
29208e82 | 2312 | DEFVAR_LISP ("font-ccl-encoder-alist", Vfont_ccl_encoder_alist, |
fdb82f93 PJ |
2313 | doc: /* Alist of fontname patterns vs corresponding CCL program. |
2314 | Each element looks like (REGEXP . CCL-CODE), | |
2315 | where CCL-CODE is a compiled CCL program. | |
2316 | When a font whose name matches REGEXP is used for displaying a character, | |
2317 | CCL-CODE is executed to calculate the code point in the font | |
2318 | from the charset number and position code(s) of the character which are set | |
2319 | in CCL registers R0, R1, and R2 before the execution. | |
2320 | The code point in the font is set in CCL registers R1 and R2 | |
2321 | when the execution terminated. | |
2322 | If the font is single-byte font, the register R2 is not used. */); | |
4ed46869 KH |
2323 | Vfont_ccl_encoder_alist = Qnil; |
2324 | ||
29208e82 | 2325 | DEFVAR_LISP ("translation-hash-table-vector", Vtranslation_hash_table_vector, |
d80dc57e DL |
2326 | doc: /* Vector containing all translation hash tables ever defined. |
2327 | Comprises pairs (SYMBOL . TABLE) where SYMBOL and TABLE were set up by calls | |
2328 | to `define-translation-hash-table'. The vector is indexed by the table id | |
2329 | used by CCL. */); | |
2330 | Vtranslation_hash_table_vector = Qnil; | |
2331 | ||
5232fa7b | 2332 | defsubr (&Sccl_program_p); |
4ed46869 KH |
2333 | defsubr (&Sccl_execute); |
2334 | defsubr (&Sccl_execute_on_string); | |
2335 | defsubr (&Sregister_ccl_program); | |
8146262a | 2336 | defsubr (&Sregister_code_conversion_map); |
4ed46869 | 2337 | } |