1 /* CCL (Code Conversion Language) interpreter.
2 Copyright (C) 1995, 1997, 1998, 1999 Electrotechnical Laboratory, JAPAN.
3 Licensed to the Free Software Foundation.
5 This file is part of XEmacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* Synched up with : FSF Emacs 20.3.10 without ExCCL
23 * (including {Read|Write}MultibyteChar) */
37 #include "mule-charset.h"
39 #include "file-coding.h"
46 #endif /* not emacs */
48 /* This contains all code conversion map available to CCL. */
50 Lisp_Object Vcode_conversion_map_vector;
53 /* Alist of fontname patterns vs corresponding CCL program. */
54 Lisp_Object Vfont_ccl_encoder_alist;
56 /* This symbol is a property which assocates with ccl program vector.
57 Ex: (get 'ccl-big5-encoder 'ccl-program) returns ccl program vector. */
58 Lisp_Object Qccl_program;
60 /* These symbols are properties which associate with code conversion
61 map and their ID respectively. */
63 Lisp_Object Qcode_conversion_map;
64 Lisp_Object Qcode_conversion_map_id;
67 /* Symbols of ccl program have this property, a value of the property
68 is an index for Vccl_protram_table. */
69 Lisp_Object Qccl_program_idx;
71 /* Vector of CCL program names vs corresponding program data. */
72 Lisp_Object Vccl_program_table;
74 /* CCL (Code Conversion Language) is a simple language which has
75 operations on one input buffer, one output buffer, and 7 registers.
76 The syntax of CCL is described in `ccl.el'. Emacs Lisp function
77 `ccl-compile' compiles a CCL program and produces a CCL code which
78 is a vector of integers. The structure of this vector is as
79 follows: The 1st element: buffer-magnification, a factor for the
80 size of output buffer compared with the size of input buffer. The
81 2nd element: address of CCL code to be executed when encountered
82 with end of input stream. The 3rd and the remaining elements: CCL
85 /* Header of CCL compiled code */
86 #define CCL_HEADER_BUF_MAG 0
87 #define CCL_HEADER_EOF 1
88 #define CCL_HEADER_MAIN 2
90 /* CCL code is a sequence of 28-bit non-negative integers (i.e. the
91 MSB is always 0), each contains CCL command and/or arguments in the
94 |----------------- integer (28-bit) ------------------|
95 |------- 17-bit ------|- 3-bit --|- 3-bit --|- 5-bit -|
96 |--constant argument--|-register-|-register-|-command-|
97 ccccccccccccccccc RRR rrr XXXXX
99 |------- relative address -------|-register-|-command-|
100 cccccccccccccccccccc rrr XXXXX
102 |------------- constant or other args ----------------|
103 cccccccccccccccccccccccccccc
105 where, `cc...c' is a non-negative integer indicating constant value
106 (the left most `c' is always 0) or an absolute jump address, `RRR'
107 and `rrr' are CCL register number, `XXXXX' is one of the following
112 Each comment fields shows one or more lines for command syntax and
113 the following lines for semantics of the command. In semantics, IC
114 stands for Instruction Counter. */
116 #define CCL_SetRegister 0x00 /* Set register a register value:
117 1:00000000000000000RRRrrrXXXXX
118 ------------------------------
122 #define CCL_SetShortConst 0x01 /* Set register a short constant value:
123 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
124 ------------------------------
125 reg[rrr] = CCCCCCCCCCCCCCCCCCC;
128 #define CCL_SetConst 0x02 /* Set register a constant value:
129 1:00000000000000000000rrrXXXXX
131 ------------------------------
136 #define CCL_SetArray 0x03 /* Set register an element of array:
137 1:CCCCCCCCCCCCCCCCCRRRrrrXXXXX
141 ------------------------------
142 if (0 <= reg[RRR] < CC..C)
143 reg[rrr] = ELEMENT[reg[RRR]];
147 #define CCL_Jump 0x04 /* Jump:
148 1:A--D--D--R--E--S--S-000XXXXX
149 ------------------------------
153 /* Note: If CC..C is greater than 0, the second code is omitted. */
155 #define CCL_JumpCond 0x05 /* Jump conditional:
156 1:A--D--D--R--E--S--S-rrrXXXXX
157 ------------------------------
163 #define CCL_WriteRegisterJump 0x06 /* Write register and jump:
164 1:A--D--D--R--E--S--S-rrrXXXXX
165 ------------------------------
170 #define CCL_WriteRegisterReadJump 0x07 /* Write register, read, and jump:
171 1:A--D--D--R--E--S--S-rrrXXXXX
172 2:A--D--D--R--E--S--S-rrrYYYYY
173 -----------------------------
179 /* Note: If read is suspended, the resumed execution starts from the
180 second code (YYYYY == CCL_ReadJump). */
182 #define CCL_WriteConstJump 0x08 /* Write constant and jump:
183 1:A--D--D--R--E--S--S-000XXXXX
185 ------------------------------
190 #define CCL_WriteConstReadJump 0x09 /* Write constant, read, and jump:
191 1:A--D--D--R--E--S--S-rrrXXXXX
193 3:A--D--D--R--E--S--S-rrrYYYYY
194 -----------------------------
200 /* Note: If read is suspended, the resumed execution starts from the
201 second code (YYYYY == CCL_ReadJump). */
203 #define CCL_WriteStringJump 0x0A /* Write string and jump:
204 1:A--D--D--R--E--S--S-000XXXXX
206 3:0000STRIN[0]STRIN[1]STRIN[2]
208 ------------------------------
209 write_string (STRING, LENGTH);
213 #define CCL_WriteArrayReadJump 0x0B /* Write an array element, read, and jump:
214 1:A--D--D--R--E--S--S-rrrXXXXX
219 N:A--D--D--R--E--S--S-rrrYYYYY
220 ------------------------------
221 if (0 <= reg[rrr] < LENGTH)
222 write (ELEMENT[reg[rrr]]);
223 IC += LENGTH + 2; (... pointing at N+1)
227 /* Note: If read is suspended, the resumed execution starts from the
228 Nth code (YYYYY == CCL_ReadJump). */
230 #define CCL_ReadJump 0x0C /* Read and jump:
231 1:A--D--D--R--E--S--S-rrrYYYYY
232 -----------------------------
237 #define CCL_Branch 0x0D /* Jump by branch table:
238 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
239 2:A--D--D--R--E-S-S[0]000XXXXX
240 3:A--D--D--R--E-S-S[1]000XXXXX
242 ------------------------------
243 if (0 <= reg[rrr] < CC..C)
244 IC += ADDRESS[reg[rrr]];
246 IC += ADDRESS[CC..C];
249 #define CCL_ReadRegister 0x0E /* Read bytes into registers:
250 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
251 2:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
253 ------------------------------
258 #define CCL_WriteExprConst 0x0F /* write result of expression:
259 1:00000OPERATION000RRR000XXXXX
261 ------------------------------
262 write (reg[RRR] OPERATION CONSTANT);
266 /* Note: If the Nth read is suspended, the resumed execution starts
267 from the Nth code. */
269 #define CCL_ReadBranch 0x10 /* Read one byte into a register,
270 and jump by branch table:
271 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
272 2:A--D--D--R--E-S-S[0]000XXXXX
273 3:A--D--D--R--E-S-S[1]000XXXXX
275 ------------------------------
277 if (0 <= reg[rrr] < CC..C)
278 IC += ADDRESS[reg[rrr]];
280 IC += ADDRESS[CC..C];
283 #define CCL_WriteRegister 0x11 /* Write registers:
284 1:CCCCCCCCCCCCCCCCCCCrrrXXXXX
285 2:CCCCCCCCCCCCCCCCCCCrrrXXXXX
287 ------------------------------
293 /* Note: If the Nth write is suspended, the resumed execution
294 starts from the Nth code. */
296 #define CCL_WriteExprRegister 0x12 /* Write result of expression
297 1:00000OPERATIONRrrRRR000XXXXX
298 ------------------------------
299 write (reg[RRR] OPERATION reg[Rrr]);
302 #define CCL_Call 0x13 /* Call the CCL program whose ID is
304 1:CCCCCCCCCCCCCCCCCCCC000XXXXX
305 ------------------------------
309 #define CCL_WriteConstString 0x14 /* Write a constant or a string:
310 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
311 [2:0000STRIN[0]STRIN[1]STRIN[2]]
313 -----------------------------
317 write_string (STRING, CC..C);
318 IC += (CC..C + 2) / 3;
321 #define CCL_WriteArray 0x15 /* Write an element of array:
322 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
326 ------------------------------
327 if (0 <= reg[rrr] < CC..C)
328 write (ELEMENT[reg[rrr]]);
332 #define CCL_End 0x16 /* Terminate:
333 1:00000000000000000000000XXXXX
334 ------------------------------
338 /* The following two codes execute an assignment arithmetic/logical
339 operation. The form of the operation is like REG OP= OPERAND. */
341 #define CCL_ExprSelfConst 0x17 /* REG OP= constant:
342 1:00000OPERATION000000rrrXXXXX
344 ------------------------------
345 reg[rrr] OPERATION= CONSTANT;
348 #define CCL_ExprSelfReg 0x18 /* REG1 OP= REG2:
349 1:00000OPERATION000RRRrrrXXXXX
350 ------------------------------
351 reg[rrr] OPERATION= reg[RRR];
354 /* The following codes execute an arithmetic/logical operation. The
355 form of the operation is like REG_X = REG_Y OP OPERAND2. */
357 #define CCL_SetExprConst 0x19 /* REG_X = REG_Y OP constant:
358 1:00000OPERATION000RRRrrrXXXXX
360 ------------------------------
361 reg[rrr] = reg[RRR] OPERATION CONSTANT;
365 #define CCL_SetExprReg 0x1A /* REG1 = REG2 OP REG3:
366 1:00000OPERATIONRrrRRRrrrXXXXX
367 ------------------------------
368 reg[rrr] = reg[RRR] OPERATION reg[Rrr];
371 #define CCL_JumpCondExprConst 0x1B /* Jump conditional according to
372 an operation on constant:
373 1:A--D--D--R--E--S--S-rrrXXXXX
376 -----------------------------
377 reg[7] = reg[rrr] OPERATION CONSTANT;
384 #define CCL_JumpCondExprReg 0x1C /* Jump conditional according to
385 an operation on register:
386 1:A--D--D--R--E--S--S-rrrXXXXX
389 -----------------------------
390 reg[7] = reg[rrr] OPERATION reg[RRR];
397 #define CCL_ReadJumpCondExprConst 0x1D /* Read and jump conditional according
398 to an operation on constant:
399 1:A--D--D--R--E--S--S-rrrXXXXX
402 -----------------------------
404 reg[7] = reg[rrr] OPERATION CONSTANT;
411 #define CCL_ReadJumpCondExprReg 0x1E /* Read and jump conditional according
412 to an operation on register:
413 1:A--D--D--R--E--S--S-rrrXXXXX
416 -----------------------------
418 reg[7] = reg[rrr] OPERATION reg[RRR];
425 #define CCL_Extention 0x1F /* Extended CCL code
426 1:ExtendedCOMMNDRrrRRRrrrXXXXX
429 ------------------------------
430 extended_command (rrr,RRR,Rrr,ARGS)
434 Here after, Extended CCL Instructions.
435 Bit length of extended command is 14.
436 Therefore, the instruction code range is 0..16384(0x3fff).
439 /* Read a multibyte characeter.
440 A code point is stored into reg[rrr]. A charset ID is stored into
443 #define CCL_ReadMultibyteChar2 0x00 /* Read Multibyte Character
444 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
446 /* Write a multibyte character.
447 Write a character whose code point is reg[rrr] and the charset ID
450 #define CCL_WriteMultibyteChar2 0x01 /* Write Multibyte Character
451 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
454 /* Translate a character whose code point is reg[rrr] and the charset
455 ID is reg[RRR] by a translation table whose ID is reg[Rrr].
457 A translated character is set in reg[rrr] (code point) and reg[RRR]
460 #define CCL_TranslateCharacter 0x02 /* Translate a multibyte character
461 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
463 /* Translate a character whose code point is reg[rrr] and the charset
464 ID is reg[RRR] by a translation table whose ID is ARGUMENT.
466 A translated character is set in reg[rrr] (code point) and reg[RRR]
469 #define CCL_TranslateCharacterConstTbl 0x03 /* Translate a multibyte character
470 1:ExtendedCOMMNDRrrRRRrrrXXXXX
471 2:ARGUMENT(Translation Table ID)
474 /* Iterate looking up MAPs for reg[rrr] starting from the Nth (N =
475 reg[RRR]) MAP until some value is found.
477 Each MAP is a Lisp vector whose element is number, nil, t, or
479 If the element is nil, ignore the map and proceed to the next map.
480 If the element is t or lambda, finish without changing reg[rrr].
481 If the element is a number, set reg[rrr] to the number and finish.
483 Detail of the map structure is descibed in the comment for
484 CCL_MapMultiple below. */
486 #define CCL_IterateMultipleMap 0x10 /* Iterate multiple maps
487 1:ExtendedCOMMNDXXXRRRrrrXXXXX
494 /* Map the code in reg[rrr] by MAPs starting from the Nth (N =
497 MAPs are supplied in the succeeding CCL codes as follows:
499 When CCL program gives this nested structure of map to this command:
502 (MAP-ID121 MAP-ID122 MAP-ID123)
505 (MAP-ID211 (MAP-ID2111) MAP-ID212)
507 the compiled CCL codes has this sequence:
508 CCL_MapMultiple (CCL code of this command)
509 16 (total number of MAPs and SEPARATORs)
527 A value of each SEPARATOR follows this rule:
528 MAP-SET := SEPARATOR [(MAP-ID | MAP-SET)]+
529 SEPARATOR := -(number of MAP-IDs and SEPARATORs in the MAP-SET)
531 (*)....Nest level of MAP-SET must not be over than MAX_MAP_SET_LEVEL.
533 When some map fails to map (i.e. it doesn't have a value for
534 reg[rrr]), the mapping is treated as identity.
536 The mapping is iterated for all maps in each map set (set of maps
537 separated by SEPARATOR) except in the case that lambda is
538 encountered. More precisely, the mapping proceeds as below:
540 At first, VAL0 is set to reg[rrr], and it is translated by the
541 first map to VAL1. Then, VAL1 is translated by the next map to
542 VAL2. This mapping is iterated until the last map is used. The
543 result of the mapping is the last value of VAL?.
545 But, when VALm is mapped to VALn and VALn is not a number, the
546 mapping proceed as below:
548 If VALn is nil, the lastest map is ignored and the mapping of VALm
549 proceed to the next map.
551 In VALn is t, VALm is reverted to reg[rrr] and the mapping of VALm
552 proceed to the next map.
554 If VALn is lambda, the whole mapping process terminates, and VALm
555 is the result of this mapping.
557 Each map is a Lisp vector of the following format (a) or (b):
558 (a)......[STARTPOINT VAL1 VAL2 ...]
559 (b)......[t VAL STARTPOINT ENDPOINT],
561 STARTPOINT is an offset to be used for indexing a map,
562 ENDPOINT is a maximum index number of a map,
563 VAL and VALn is a number, nil, t, or lambda.
565 Valid index range of a map of type (a) is:
566 STARTPOINT <= index < STARTPOINT + map_size - 1
567 Valid index range of a map of type (b) is:
568 STARTPOINT <= index < ENDPOINT */
570 #define CCL_MapMultiple 0x11 /* Mapping by multiple code conversion maps
571 1:ExtendedCOMMNDXXXRRRrrrXXXXX
583 #define MAX_MAP_SET_LEVEL 20
591 static tr_stack mapping_stack[MAX_MAP_SET_LEVEL];
592 static tr_stack *mapping_stack_pointer;
595 #define PUSH_MAPPING_STACK(restlen, orig) \
597 mapping_stack_pointer->rest_length = (restlen); \
598 mapping_stack_pointer->orig_val = (orig); \
599 mapping_stack_pointer++; \
602 #define POP_MAPPING_STACK(restlen, orig) \
604 mapping_stack_pointer--; \
605 (restlen) = mapping_stack_pointer->rest_length; \
606 (orig) = mapping_stack_pointer->orig_val; \
609 #define CCL_MapSingle 0x12 /* Map by single code conversion map
610 1:ExtendedCOMMNDXXXRRRrrrXXXXX
612 ------------------------------
613 Map reg[rrr] by MAP-ID.
614 If some valid mapping is found,
615 set reg[rrr] to the result,
620 /* CCL arithmetic/logical operators. */
621 #define CCL_PLUS 0x00 /* X = Y + Z */
622 #define CCL_MINUS 0x01 /* X = Y - Z */
623 #define CCL_MUL 0x02 /* X = Y * Z */
624 #define CCL_DIV 0x03 /* X = Y / Z */
625 #define CCL_MOD 0x04 /* X = Y % Z */
626 #define CCL_AND 0x05 /* X = Y & Z */
627 #define CCL_OR 0x06 /* X = Y | Z */
628 #define CCL_XOR 0x07 /* X = Y ^ Z */
629 #define CCL_LSH 0x08 /* X = Y << Z */
630 #define CCL_RSH 0x09 /* X = Y >> Z */
631 #define CCL_LSH8 0x0A /* X = (Y << 8) | Z */
632 #define CCL_RSH8 0x0B /* X = Y >> 8, r[7] = Y & 0xFF */
633 #define CCL_DIVMOD 0x0C /* X = Y / Z, r[7] = Y % Z */
634 #define CCL_LS 0x10 /* X = (X < Y) */
635 #define CCL_GT 0x11 /* X = (X > Y) */
636 #define CCL_EQ 0x12 /* X = (X == Y) */
637 #define CCL_LE 0x13 /* X = (X <= Y) */
638 #define CCL_GE 0x14 /* X = (X >= Y) */
639 #define CCL_NE 0x15 /* X = (X != Y) */
641 #define CCL_DECODE_SJIS 0x16 /* X = HIGHER_BYTE (DE-SJIS (Y, Z))
642 r[7] = LOWER_BYTE (DE-SJIS (Y, Z)) */
643 #define CCL_ENCODE_SJIS 0x17 /* X = HIGHER_BYTE (SJIS (Y, Z))
644 r[7] = LOWER_BYTE (SJIS (Y, Z) */
646 /* Suspend CCL program because of reading from empty input buffer or
647 writing to full output buffer. When this program is resumed, the
648 same I/O command is executed. */
649 #define CCL_SUSPEND(stat) \
652 ccl->status = stat; \
656 /* Terminate CCL program because of invalid command. Should not occur
657 in the normal case. */
658 #define CCL_INVALID_CMD \
660 ccl->status = CCL_STAT_INVALID_CMD; \
661 goto ccl_error_handler; \
664 /* Encode one character CH to multibyte form and write to the current
665 output buffer. If CH is less than 256, CH is written as is. */
666 #define CCL_WRITE_CHAR(ch) do { \
669 ccl->status = CCL_STAT_INVALID_CMD; \
670 goto ccl_error_handler; \
674 Bufbyte work[MAX_EMCHAR_LEN]; \
675 int len = ( ch < ( conversion_mode == CCL_MODE_ENCODING ? \
677 simple_set_charptr_emchar (work, ch) : \
678 non_ascii_set_charptr_emchar (work, ch); \
679 Dynarr_add_many (destination, work, len); \
683 /* Write a string at ccl_prog[IC] of length LEN to the current output
685 #define CCL_WRITE_STRING(len) do { \
688 ccl->status = CCL_STAT_INVALID_CMD; \
689 goto ccl_error_handler; \
692 for (i = 0; i < len; i++) \
693 Dynarr_add(destination, \
694 (XINT (ccl_prog[ic + (i / 3)]) \
695 >> ((2 - (i % 3)) * 8)) & 0xFF); \
698 /* Read one byte from the current input buffer into Rth register. */
699 #define CCL_READ_CHAR(r) do { \
700 if (!src && !ccl->last_block) \
702 ccl->status = CCL_STAT_INVALID_CMD; \
703 goto ccl_error_handler; \
705 else if (src < src_end) \
707 else if (ccl->last_block) \
713 /* Suspend CCL program because of \
714 reading from empty input buffer or \
715 writing to full output buffer. \
716 When this program is resumed, the \
717 same I/O command is executed. */ \
720 ccl->status = CCL_STAT_SUSPEND_BY_SRC; \
726 /* Execute CCL code on SRC_BYTES length text at SOURCE. The resulting
727 text goes to a place pointed by DESTINATION. The bytes actually
728 processed is returned as *CONSUMED. The return value is the length
729 of the resulting text. As a side effect, the contents of CCL registers
730 are updated. If SOURCE or DESTINATION is NULL, only operations on
731 registers are permitted. */
734 #define CCL_DEBUG_BACKTRACE_LEN 256
735 int ccl_backtrace_table[CCL_BACKTRACE_TABLE];
736 int ccl_backtrace_idx;
739 struct ccl_prog_stack
741 Lisp_Object *ccl_prog; /* Pointer to an array of CCL code. */
742 int ic; /* Instruction Counter. */
745 /* For the moment, we only support depth 256 of stack. */
746 static struct ccl_prog_stack ccl_prog_stack_struct[256];
749 ccl_driver (struct ccl_program *ccl, CONST unsigned char *source,
750 unsigned_char_dynarr *destination, int src_bytes,
751 int *consumed, int conversion_mode)
755 int code = -1; /* init to illegal value, */
757 Lisp_Object *ccl_prog = ccl->prog;
758 CONST unsigned char *src = source, *src_end = src + src_bytes;
759 int jump_address = 0; /* shut up the compiler */
761 int stack_idx = ccl->stack_idx;
762 /* Instruction counter of the current CCL code. */
765 if (ic >= ccl->eof_ic)
766 ic = CCL_HEADER_MAIN;
768 #if 0 /* not for XEmacs ? */
769 if (ccl->buf_magnification ==0) /* We can't produce any bytes. */
774 ccl_backtrace_idx = 0;
781 ccl_backtrace_table[ccl_backtrace_idx++] = ic;
782 if (ccl_backtrace_idx >= CCL_DEBUG_BACKTRACE_LEN)
783 ccl_backtrace_idx = 0;
784 ccl_backtrace_table[ccl_backtrace_idx] = 0;
787 if (!NILP (Vquit_flag) && NILP (Vinhibit_quit))
789 /* We can't just signal Qquit, instead break the loop as if
790 the whole data is processed. Don't reset Vquit_flag, it
791 must be handled later at a safer place. */
793 src = source + src_bytes;
794 ccl->status = CCL_STAT_QUIT;
799 code = XINT (ccl_prog[ic]); ic++;
801 field2 = (code & 0xFF) >> 5;
804 #define RRR (field1 & 7)
805 #define Rrr ((field1 >> 3) & 7)
807 #define EXCMD (field1 >> 6)
811 case CCL_SetRegister: /* 00000000000000000RRRrrrXXXXX */
815 case CCL_SetShortConst: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
819 case CCL_SetConst: /* 00000000000000000000rrrXXXXX */
820 reg[rrr] = XINT (ccl_prog[ic]);
824 case CCL_SetArray: /* CCCCCCCCCCCCCCCCCCCCRRRrrrXXXXX */
827 if ((unsigned int) i < j)
828 reg[rrr] = XINT (ccl_prog[ic + i]);
832 case CCL_Jump: /* A--D--D--R--E--S--S-000XXXXX */
836 case CCL_JumpCond: /* A--D--D--R--E--S--S-rrrXXXXX */
841 case CCL_WriteRegisterJump: /* A--D--D--R--E--S--S-rrrXXXXX */
847 case CCL_WriteRegisterReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */
851 CCL_READ_CHAR (reg[rrr]);
855 case CCL_WriteConstJump: /* A--D--D--R--E--S--S-000XXXXX */
856 i = XINT (ccl_prog[ic]);
861 case CCL_WriteConstReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */
862 i = XINT (ccl_prog[ic]);
865 CCL_READ_CHAR (reg[rrr]);
869 case CCL_WriteStringJump: /* A--D--D--R--E--S--S-000XXXXX */
870 j = XINT (ccl_prog[ic]);
872 CCL_WRITE_STRING (j);
876 case CCL_WriteArrayReadJump: /* A--D--D--R--E--S--S-rrrXXXXX */
878 j = XINT (ccl_prog[ic]);
879 if ((unsigned int) i < j)
881 i = XINT (ccl_prog[ic + 1 + i]);
885 CCL_READ_CHAR (reg[rrr]);
886 ic += ADDR - (j + 2);
889 case CCL_ReadJump: /* A--D--D--R--E--S--S-rrrYYYYY */
890 CCL_READ_CHAR (reg[rrr]);
894 case CCL_ReadBranch: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
895 CCL_READ_CHAR (reg[rrr]);
896 /* fall through ... */
897 case CCL_Branch: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
898 if ((unsigned int) reg[rrr] < field1)
899 ic += XINT (ccl_prog[ic + reg[rrr]]);
901 ic += XINT (ccl_prog[ic + field1]);
904 case CCL_ReadRegister: /* CCCCCCCCCCCCCCCCCCCCrrXXXXX */
907 CCL_READ_CHAR (reg[rrr]);
909 code = XINT (ccl_prog[ic]); ic++;
911 field2 = (code & 0xFF) >> 5;
915 case CCL_WriteExprConst: /* 1:00000OPERATION000RRR000XXXXX */
918 j = XINT (ccl_prog[ic]);
923 case CCL_WriteRegister: /* CCCCCCCCCCCCCCCCCCCrrrXXXXX */
929 code = XINT (ccl_prog[ic]); ic++;
931 field2 = (code & 0xFF) >> 5;
935 case CCL_WriteExprRegister: /* 1:00000OPERATIONRrrRRR000XXXXX */
942 case CCL_Call: /* CCCCCCCCCCCCCCCCCCCC000XXXXX */
948 || field1 >= XVECTOR_LENGTH (Vccl_program_table)
949 || (slot = XVECTOR_DATA (Vccl_program_table)[field1],
951 || !VECTORP (XCDR (slot)))
955 ccl_prog = ccl_prog_stack_struct[0].ccl_prog;
956 ic = ccl_prog_stack_struct[0].ic;
958 ccl->status = CCL_STAT_INVALID_CMD;
959 goto ccl_error_handler;
962 ccl_prog_stack_struct[stack_idx].ccl_prog = ccl_prog;
963 ccl_prog_stack_struct[stack_idx].ic = ic;
965 ccl_prog = XVECTOR_DATA (XCDR (slot));
966 ic = CCL_HEADER_MAIN;
970 case CCL_WriteConstString: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
972 CCL_WRITE_CHAR (field1);
975 CCL_WRITE_STRING (field1);
976 ic += (field1 + 2) / 3;
980 case CCL_WriteArray: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
982 if ((unsigned int) i < field1)
984 j = XINT (ccl_prog[ic + i]);
990 case CCL_End: /* 0000000000000000000000XXXXX */
993 ccl_prog = ccl_prog_stack_struct[stack_idx].ccl_prog;
994 ic = ccl_prog_stack_struct[stack_idx].ic;
999 /* ccl->ic should points to this command code again to
1000 suppress further processing. */
1002 /* Terminate CCL program successfully. */
1003 ccl->status = CCL_STAT_SUCCESS;
1006 case CCL_ExprSelfConst: /* 00000OPERATION000000rrrXXXXX */
1007 i = XINT (ccl_prog[ic]);
1012 case CCL_ExprSelfReg: /* 00000OPERATION000RRRrrrXXXXX */
1019 case CCL_PLUS: reg[rrr] += i; break;
1020 case CCL_MINUS: reg[rrr] -= i; break;
1021 case CCL_MUL: reg[rrr] *= i; break;
1022 case CCL_DIV: reg[rrr] /= i; break;
1023 case CCL_MOD: reg[rrr] %= i; break;
1024 case CCL_AND: reg[rrr] &= i; break;
1025 case CCL_OR: reg[rrr] |= i; break;
1026 case CCL_XOR: reg[rrr] ^= i; break;
1027 case CCL_LSH: reg[rrr] <<= i; break;
1028 case CCL_RSH: reg[rrr] >>= i; break;
1029 case CCL_LSH8: reg[rrr] <<= 8; reg[rrr] |= i; break;
1030 case CCL_RSH8: reg[7] = reg[rrr] & 0xFF; reg[rrr] >>= 8; break;
1031 case CCL_DIVMOD: reg[7] = reg[rrr] % i; reg[rrr] /= i; break;
1032 case CCL_LS: reg[rrr] = reg[rrr] < i; break;
1033 case CCL_GT: reg[rrr] = reg[rrr] > i; break;
1034 case CCL_EQ: reg[rrr] = reg[rrr] == i; break;
1035 case CCL_LE: reg[rrr] = reg[rrr] <= i; break;
1036 case CCL_GE: reg[rrr] = reg[rrr] >= i; break;
1037 case CCL_NE: reg[rrr] = reg[rrr] != i; break;
1039 ccl->status = CCL_STAT_INVALID_CMD;
1040 goto ccl_error_handler;
1044 case CCL_SetExprConst: /* 00000OPERATION000RRRrrrXXXXX */
1046 j = XINT (ccl_prog[ic]);
1048 jump_address = ++ic;
1051 case CCL_SetExprReg: /* 00000OPERATIONRrrRRRrrrXXXXX */
1058 case CCL_ReadJumpCondExprConst: /* A--D--D--R--E--S--S-rrrXXXXX */
1059 CCL_READ_CHAR (reg[rrr]);
1060 case CCL_JumpCondExprConst: /* A--D--D--R--E--S--S-rrrXXXXX */
1062 op = XINT (ccl_prog[ic]);
1063 jump_address = ic++ + ADDR;
1064 j = XINT (ccl_prog[ic]);
1069 case CCL_ReadJumpCondExprReg: /* A--D--D--R--E--S--S-rrrXXXXX */
1070 CCL_READ_CHAR (reg[rrr]);
1071 case CCL_JumpCondExprReg:
1073 op = XINT (ccl_prog[ic]);
1074 jump_address = ic++ + ADDR;
1075 j = reg[XINT (ccl_prog[ic])];
1082 case CCL_PLUS: reg[rrr] = i + j; break;
1083 case CCL_MINUS: reg[rrr] = i - j; break;
1084 case CCL_MUL: reg[rrr] = i * j; break;
1085 case CCL_DIV: reg[rrr] = i / j; break;
1086 case CCL_MOD: reg[rrr] = i % j; break;
1087 case CCL_AND: reg[rrr] = i & j; break;
1088 case CCL_OR: reg[rrr] = i | j; break;
1089 case CCL_XOR: reg[rrr] = i ^ j; break;
1090 case CCL_LSH: reg[rrr] = i << j; break;
1091 case CCL_RSH: reg[rrr] = i >> j; break;
1092 case CCL_LSH8: reg[rrr] = (i << 8) | j; break;
1093 case CCL_RSH8: reg[rrr] = i >> 8; reg[7] = i & 0xFF; break;
1094 case CCL_DIVMOD: reg[rrr] = i / j; reg[7] = i % j; break;
1095 case CCL_LS: reg[rrr] = i < j; break;
1096 case CCL_GT: reg[rrr] = i > j; break;
1097 case CCL_EQ: reg[rrr] = i == j; break;
1098 case CCL_LE: reg[rrr] = i <= j; break;
1099 case CCL_GE: reg[rrr] = i >= j; break;
1100 case CCL_NE: reg[rrr] = i != j; break;
1101 case CCL_DECODE_SJIS: DECODE_SJIS (i, j, reg[rrr], reg[7]); break;
1102 case CCL_ENCODE_SJIS: ENCODE_SJIS (i, j, reg[rrr], reg[7]); break;
1104 ccl->status = CCL_STAT_INVALID_CMD;
1105 goto ccl_error_handler;
1108 if (code == CCL_WriteExprConst || code == CCL_WriteExprRegister)
1120 case CCL_ReadMultibyteChar2:
1128 goto ccl_read_multibyte_character_suspend;
1133 if (i == LEADING_CODE_COMPOSITION)
1136 goto ccl_read_multibyte_character_suspend;
1139 ccl->private_state = COMPOSING_WITH_RULE_HEAD;
1143 ccl->private_state = COMPOSING_NO_RULE_HEAD;
1147 if (ccl->private_state != COMPOSING_NO)
1149 /* composite character */
1151 ccl->private_state = COMPOSING_NO;
1154 if (COMPOSING_WITH_RULE_RULE == ccl->private_state)
1156 ccl->private_state = COMPOSING_WITH_RULE_HEAD;
1159 else if (COMPOSING_WITH_RULE_HEAD == ccl->private_state)
1160 ccl->private_state = COMPOSING_WITH_RULE_RULE;
1165 goto ccl_read_multibyte_character_suspend;
1178 reg[RRR] = LEADING_BYTE_ASCII;
1180 else if (i <= MAX_LEADING_BYTE_OFFICIAL_1)
1183 goto ccl_read_multibyte_character_suspend;
1185 reg[rrr] = (*src++ & 0x7F);
1187 else if (i <= MAX_LEADING_BYTE_OFFICIAL_2)
1189 if ((src + 1) >= src_end)
1190 goto ccl_read_multibyte_character_suspend;
1192 i = (*src++ & 0x7F);
1193 reg[rrr] = ((i << 7) | (*src & 0x7F));
1196 else if (i == PRE_LEADING_BYTE_PRIVATE_1)
1198 if ((src + 1) >= src_end)
1199 goto ccl_read_multibyte_character_suspend;
1201 reg[rrr] = (*src++ & 0x7F);
1203 else if (i == PRE_LEADING_BYTE_PRIVATE_2)
1205 if ((src + 2) >= src_end)
1206 goto ccl_read_multibyte_character_suspend;
1208 i = (*src++ & 0x7F);
1209 reg[rrr] = ((i << 7) | (*src & 0x7F));
1214 /* INVALID CODE. Return a single byte character. */
1215 reg[RRR] = LEADING_BYTE_ASCII;
1222 ccl_read_multibyte_character_suspend:
1224 if (ccl->last_block)
1230 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC);
1234 case CCL_WriteMultibyteChar2:
1235 i = reg[RRR]; /* charset */
1236 if (i == LEADING_BYTE_ASCII)
1237 i = reg[rrr] & 0xFF;
1239 else if (i == CHARSET_COMPOSITION)
1240 i = MAKE_COMPOSITE_CHAR (reg[rrr]);
1242 else if (XCHARSET_DIMENSION (CHARSET_BY_LEADING_BYTE (i)) == 1)
1243 i = ((i - FIELD2_TO_OFFICIAL_LEADING_BYTE) << 7)
1244 | (reg[rrr] & 0x7F);
1245 else if (i < MIN_LEADING_BYTE_OFFICIAL_2)
1246 i = ((i - FIELD1_TO_OFFICIAL_LEADING_BYTE) << 14) | reg[rrr];
1248 i = ((i - FIELD1_TO_PRIVATE_LEADING_BYTE) << 14) | reg[rrr];
1255 case CCL_TranslateCharacter:
1256 i = reg[RRR]; /* charset */
1257 if (i == LEADING_BYTE_ASCII)
1259 else if (i == CHARSET_COMPOSITION)
1264 else if (CHARSET_DIMENSION (i) == 1)
1265 i = ((i - 0x70) << 7) | (reg[rrr] & 0x7F);
1266 else if (i < MIN_LEADING_BYTE_OFFICIAL_2)
1267 i = ((i - 0x8F) << 14) | (reg[rrr] & 0x3FFF);
1269 i = ((i - 0xE0) << 14) | (reg[rrr] & 0x3FFF);
1271 op = translate_char (GET_TRANSLATION_TABLE (reg[Rrr]),
1273 SPLIT_CHAR (op, reg[RRR], i, j);
1280 case CCL_TranslateCharacterConstTbl:
1281 op = XINT (ccl_prog[ic]); /* table */
1283 i = reg[RRR]; /* charset */
1284 if (i == LEADING_BYTE_ASCII)
1286 else if (i == CHARSET_COMPOSITION)
1291 else if (CHARSET_DIMENSION (i) == 1)
1292 i = ((i - 0x70) << 7) | (reg[rrr] & 0x7F);
1293 else if (i < MIN_LEADING_BYTE_OFFICIAL_2)
1294 i = ((i - 0x8F) << 14) | (reg[rrr] & 0x3FFF);
1296 i = ((i - 0xE0) << 14) | (reg[rrr] & 0x3FFF);
1298 op = translate_char (GET_TRANSLATION_TABLE (op), i, -1, 0, 0);
1299 SPLIT_CHAR (op, reg[RRR], i, j);
1306 case CCL_IterateMultipleMap:
1308 Lisp_Object map, content, attrib, value;
1309 int point, size, fin_ic;
1311 j = XINT (ccl_prog[ic++]); /* number of maps. */
1314 if ((j > reg[RRR]) && (j >= 0))
1329 size = XVECTOR (Vcode_conversion_map_vector)->size;
1330 point = XINT (ccl_prog[ic++]);
1331 if (point >= size) continue;
1333 XVECTOR (Vcode_conversion_map_vector)->contents[point];
1335 /* Check map varidity. */
1336 if (!CONSP (map)) continue;
1337 map = XCONS(map)->cdr;
1338 if (!VECTORP (map)) continue;
1339 size = XVECTOR (map)->size;
1340 if (size <= 1) continue;
1342 content = XVECTOR (map)->contents[0];
1345 [STARTPOINT VAL1 VAL2 ...] or
1346 [t ELELMENT STARTPOINT ENDPOINT] */
1347 if (NUMBERP (content))
1349 point = XUINT (content);
1350 point = op - point + 1;
1351 if (!((point >= 1) && (point < size))) continue;
1352 content = XVECTOR (map)->contents[point];
1354 else if (EQ (content, Qt))
1356 if (size != 4) continue;
1357 if ((op >= XUINT (XVECTOR (map)->contents[2]))
1358 && (op < XUINT (XVECTOR (map)->contents[3])))
1359 content = XVECTOR (map)->contents[1];
1368 else if (NUMBERP (content))
1371 reg[rrr] = XINT(content);
1374 else if (EQ (content, Qt) || EQ (content, Qlambda))
1379 else if (CONSP (content))
1381 attrib = XCONS (content)->car;
1382 value = XCONS (content)->cdr;
1383 if (!NUMBERP (attrib) || !NUMBERP (value))
1386 reg[rrr] = XUINT (value);
1396 case CCL_MapMultiple:
1398 Lisp_Object map, content, attrib, value;
1399 int point, size, map_vector_size;
1400 int map_set_rest_length, fin_ic;
1402 map_set_rest_length =
1403 XINT (ccl_prog[ic++]); /* number of maps and separators. */
1404 fin_ic = ic + map_set_rest_length;
1405 if ((map_set_rest_length > reg[RRR]) && (reg[RRR] >= 0))
1409 map_set_rest_length -= i;
1417 mapping_stack_pointer = mapping_stack;
1419 PUSH_MAPPING_STACK (0, op);
1421 map_vector_size = XVECTOR (Vcode_conversion_map_vector)->size;
1422 for (;map_set_rest_length > 0;i++, map_set_rest_length--)
1424 point = XINT(ccl_prog[ic++]);
1428 if (mapping_stack_pointer
1429 >= &mapping_stack[MAX_MAP_SET_LEVEL])
1433 PUSH_MAPPING_STACK (map_set_rest_length - point,
1435 map_set_rest_length = point + 1;
1440 if (point >= map_vector_size) continue;
1441 map = (XVECTOR (Vcode_conversion_map_vector)
1444 /* Check map varidity. */
1445 if (!CONSP (map)) continue;
1446 map = XCONS (map)->cdr;
1447 if (!VECTORP (map)) continue;
1448 size = XVECTOR (map)->size;
1449 if (size <= 1) continue;
1451 content = XVECTOR (map)->contents[0];
1454 [STARTPOINT VAL1 VAL2 ...] or
1455 [t ELEMENT STARTPOINT ENDPOINT] */
1456 if (NUMBERP (content))
1458 point = XUINT (content);
1459 point = op - point + 1;
1460 if (!((point >= 1) && (point < size))) continue;
1461 content = XVECTOR (map)->contents[point];
1463 else if (EQ (content, Qt))
1465 if (size != 4) continue;
1466 if ((op >= XUINT (XVECTOR (map)->contents[2])) &&
1467 (op < XUINT (XVECTOR (map)->contents[3])))
1468 content = XVECTOR (map)->contents[1];
1477 else if (NUMBERP (content))
1479 op = XINT (content);
1481 i += map_set_rest_length;
1482 POP_MAPPING_STACK (map_set_rest_length, reg[rrr]);
1484 else if (CONSP (content))
1486 attrib = XCONS (content)->car;
1487 value = XCONS (content)->cdr;
1488 if (!NUMBERP (attrib) || !NUMBERP (value))
1492 i += map_set_rest_length;
1493 POP_MAPPING_STACK (map_set_rest_length, reg[rrr]);
1495 else if (EQ (content, Qt))
1499 i += map_set_rest_length;
1500 POP_MAPPING_STACK (map_set_rest_length, reg[rrr]);
1502 else if (EQ (content, Qlambda))
1516 Lisp_Object map, attrib, value, content;
1518 j = XINT (ccl_prog[ic++]); /* map_id */
1520 if (j >= XVECTOR (Vcode_conversion_map_vector)->size)
1525 map = XVECTOR (Vcode_conversion_map_vector)->contents[j];
1531 map = XCONS(map)->cdr;
1537 size = XVECTOR (map)->size;
1538 point = XUINT (XVECTOR (map)->contents[0]);
1539 point = op - point + 1;
1542 (!((point >= 1) && (point < size))))
1546 content = XVECTOR (map)->contents[point];
1549 else if (NUMBERP (content))
1550 reg[rrr] = XINT (content);
1551 else if (EQ (content, Qt))
1553 else if (CONSP (content))
1555 attrib = XCONS (content)->car;
1556 value = XCONS (content)->cdr;
1557 if (!NUMBERP (attrib) || !NUMBERP (value))
1559 reg[rrr] = XUINT(value);
1575 ccl->status = CCL_STAT_INVALID_CMD;
1576 goto ccl_error_handler;
1583 /* We can insert an error message only if DESTINATION is
1584 specified and we still have a room to store the message
1588 #if 0 /* not for XEmacs ? */
1593 switch (ccl->status)
1595 /* Terminate CCL program because of invalid command.
1596 Should not occur in the normal case. */
1597 case CCL_STAT_INVALID_CMD:
1598 sprintf(msg, "\nCCL: Invalid command %x (ccl_code = %x) at %d.",
1599 code & 0x1F, code, this_ic);
1602 int i = ccl_backtrace_idx - 1;
1605 Dynarr_add_many (destination, (unsigned char *) msg, strlen (msg));
1607 for (j = 0; j < CCL_DEBUG_BACKTRACE_LEN; j++, i--)
1609 if (i < 0) i = CCL_DEBUG_BACKTRACE_LEN - 1;
1610 if (ccl_backtrace_table[i] == 0)
1612 sprintf(msg, " %d", ccl_backtrace_table[i]);
1613 Dynarr_add_many (destination, (unsigned char *) msg, strlen (msg));
1621 sprintf(msg, "\nCCL: Quited.");
1625 sprintf(msg, "\nCCL: Unknown error type (%d).", ccl->status);
1628 Dynarr_add_many (destination, (unsigned char *) msg, strlen (msg));
1633 ccl->stack_idx = stack_idx;
1634 ccl->prog = ccl_prog;
1635 if (consumed) *consumed = src - source;
1637 return Dynarr_length (destination);
1642 /* Setup fields of the structure pointed by CCL appropriately for the
1643 execution of compiled CCL code in VEC (vector of integer).
1644 If VEC is nil, we skip setting ups based on VEC. */
1646 setup_ccl_program (struct ccl_program *ccl, Lisp_Object vec)
1652 ccl->size = XVECTOR_LENGTH (vec);
1653 ccl->prog = XVECTOR_DATA (vec);
1654 ccl->eof_ic = XINT (XVECTOR_DATA (vec)[CCL_HEADER_EOF]);
1655 ccl->buf_magnification = XINT (XVECTOR_DATA (vec)[CCL_HEADER_BUF_MAG]);
1657 ccl->ic = CCL_HEADER_MAIN;
1658 for (i = 0; i < 8; i++)
1660 ccl->last_block = 0;
1661 ccl->private_state = 0;
1666 /* Resolve symbols in the specified CCL code (Lisp vector). This
1667 function converts symbols of code conversion maps and character
1668 translation tables embeded in the CCL code into their ID numbers. */
1671 resolve_symbol_ccl_program (Lisp_Object ccl)
1674 Lisp_Object result, contents /*, prop */;
1677 veclen = XVECTOR_LENGTH (result);
1679 /* Set CCL program's table ID */
1680 for (i = 0; i < veclen; i++)
1682 contents = XVECTOR_DATA (result)[i];
1683 if (SYMBOLP (contents))
1685 if (EQ(result, ccl))
1686 result = Fcopy_sequence (ccl);
1689 prop = Fget (contents, Qtranslation_table_id);
1692 XVECTOR_DATA (result)[i] = prop;
1695 prop = Fget (contents, Qcode_conversion_map_id);
1698 XVECTOR_DATA (result)[i] = prop;
1701 prop = Fget (contents, Qccl_program_idx);
1704 XVECTOR_DATA (result)[i] = prop;
1717 DEFUN ("ccl-execute", Fccl_execute, 2, 2, 0, /*
1718 Execute CCL-PROGRAM with registers initialized by REGISTERS.
1720 CCL-PROGRAM is a symbol registered by register-ccl-program,
1721 or a compiled code generated by `ccl-compile' (for backward compatibility,
1722 in this case, the execution is slower).
1723 No I/O commands should appear in CCL-PROGRAM.
1725 REGISTERS is a vector of [R0 R1 ... R7] where RN is an initial value
1728 As side effect, each element of REGISTER holds the value of
1729 corresponding register after the execution.
1733 struct ccl_program ccl;
1737 if (SYMBOLP (ccl_prog) &&
1738 !NILP (ccl_id = Fget (ccl_prog, Qccl_program_idx, Qnil)))
1740 ccl_prog = XVECTOR_DATA (Vccl_program_table)[XUINT (ccl_id)];
1741 CHECK_LIST (ccl_prog);
1742 ccl_prog = XCDR (ccl_prog);
1743 CHECK_VECTOR (ccl_prog);
1747 CHECK_VECTOR (ccl_prog);
1748 ccl_prog = resolve_symbol_ccl_program (ccl_prog);
1752 if (XVECTOR_LENGTH (reg) != 8)
1753 error ("Invalid length of vector REGISTERS");
1755 setup_ccl_program (&ccl, ccl_prog);
1756 for (i = 0; i < 8; i++)
1757 ccl.reg[i] = (INTP (XVECTOR_DATA (reg)[i])
1758 ? XINT (XVECTOR_DATA (reg)[i])
1761 ccl_driver (&ccl, (CONST unsigned char *)0, (unsigned_char_dynarr *)0,
1762 0, (int *)0, CCL_MODE_ENCODING);
1764 if (ccl.status != CCL_STAT_SUCCESS)
1765 error ("Error in CCL program at %dth code", ccl.ic);
1767 for (i = 0; i < 8; i++)
1768 XSETINT (XVECTOR_DATA (reg)[i], ccl.reg[i]);
1772 DEFUN ("ccl-execute-on-string", Fccl_execute_on_string, 3, 4, 0, /*
1773 Execute CCL-PROGRAM with initial STATUS on STRING.
1775 CCL-PROGRAM is a symbol registered by register-ccl-program,
1776 or a compiled code generated by `ccl-compile' (for backward compatibility,
1777 in this case, the execution is slower).
1779 Read buffer is set to STRING, and write buffer is allocated automatically.
1781 If IC is nil, it is initialized to head of the CCL program.\n\
1782 STATUS is a vector of [R0 R1 ... R7 IC], where
1783 R0..R7 are initial values of corresponding registers,
1784 IC is the instruction counter specifying from where to start the program.
1785 If R0..R7 are nil, they are initialized to 0.
1786 If IC is nil, it is initialized to head of the CCL program.
1788 If optional 4th arg CONTINUE is non-nil, keep IC on read operation
1789 when read buffer is exausted, else, IC is always set to the end of
1790 CCL-PROGRAM on exit.
1792 It returns the contents of write buffer as a string,
1793 and as side effect, STATUS is updated.
1795 (ccl_prog, status, str, contin))
1798 struct ccl_program ccl;
1800 unsigned_char_dynarr *outbuf;
1801 struct gcpro gcpro1, gcpro2, gcpro3;
1804 if (SYMBOLP (ccl_prog) &&
1805 !NILP (ccl_id = Fget (ccl_prog, Qccl_program_idx, Qnil)))
1807 ccl_prog = XVECTOR (Vccl_program_table)->contents[XUINT (ccl_id)];
1808 CHECK_LIST (ccl_prog);
1809 ccl_prog = XCDR (ccl_prog);
1810 CHECK_VECTOR (ccl_prog);
1814 CHECK_VECTOR (ccl_prog);
1815 ccl_prog = resolve_symbol_ccl_program (ccl_prog);
1818 CHECK_VECTOR (status);
1819 if (XVECTOR_LENGTH (status) != 9)
1820 signal_simple_error ("Vector should be of length 9", status);
1822 GCPRO3 (ccl_prog, status, str);
1824 setup_ccl_program (&ccl, ccl_prog);
1825 for (i = 0; i < 8; i++)
1827 if (NILP (XVECTOR_DATA (status)[i]))
1828 XSETINT (XVECTOR_DATA (status)[i], 0);
1829 if (INTP (XVECTOR_DATA (status)[i]))
1830 ccl.reg[i] = XINT (XVECTOR_DATA (status)[i]);
1832 if (INTP (XVECTOR_DATA (status)[8]))
1834 i = XINT (XVECTOR_DATA (status)[8]);
1835 if (ccl.ic < i && i < ccl.size)
1838 outbuf = Dynarr_new (unsigned_char);
1839 ccl.last_block = NILP (contin);
1840 produced = ccl_driver (&ccl, XSTRING_DATA (str), outbuf,
1841 XSTRING_LENGTH (str), (int *)0, CCL_MODE_ENCODING);
1842 for (i = 0; i < 8; i++)
1843 XVECTOR_DATA (status)[i] = make_int(ccl.reg[i]);
1844 XSETINT (XVECTOR_DATA (status)[8], ccl.ic);
1847 val = make_string (Dynarr_atp (outbuf, 0), produced);
1848 Dynarr_free (outbuf);
1850 if (ccl.status != CCL_STAT_SUCCESS
1851 && ccl.status != CCL_STAT_SUSPEND_BY_SRC
1852 && ccl.status != CCL_STAT_SUSPEND_BY_DST)
1853 error ("Error in CCL program at %dth code", ccl.ic);
1858 DEFUN ("register-ccl-program", Fregister_ccl_program, 2, 2, 0, /*
1859 Register CCL program PROGRAM of NAME in `ccl-program-table'.
1860 PROGRAM should be a compiled code of CCL program, or nil.
1861 Return index number of the registered CCL program.
1865 int len = XVECTOR_LENGTH (Vccl_program_table);
1868 CHECK_SYMBOL (name);
1869 if (!NILP (ccl_prog))
1871 CHECK_VECTOR (ccl_prog);
1872 ccl_prog = resolve_symbol_ccl_program (ccl_prog);
1875 for (i = 0; i < len; i++)
1877 Lisp_Object slot = XVECTOR_DATA (Vccl_program_table)[i];
1882 if (EQ (name, XCAR (slot)))
1884 XCDR (slot) = ccl_prog;
1885 return make_int (i);
1891 Lisp_Object new_table = Fmake_vector (make_int (len * 2), Qnil);
1894 for (j = 0; j < len; j++)
1895 XVECTOR_DATA (new_table)[j]
1896 = XVECTOR_DATA (Vccl_program_table)[j];
1897 Vccl_program_table = new_table;
1900 XVECTOR_DATA (Vccl_program_table)[i] = Fcons (name, ccl_prog);
1901 Fput (name, Qccl_program_idx, make_int (i));
1902 return make_int (i);
1906 /* Register code conversion map.
1907 A code conversion map consists of numbers, Qt, Qnil, and Qlambda.
1908 The first element is start code point.
1909 The rest elements are mapped numbers.
1910 Symbol t means to map to an original number before mapping.
1911 Symbol nil means that the corresponding element is empty.
1912 Symbol lambda menas to terminate mapping here.
1915 DEFUN ("register-code-conversion-map", Fregister_code_conversion_map,
1916 Sregister_code_conversion_map,
1918 "Register SYMBOL as code conversion map MAP.\n\
1919 Return index number of the registered map.")
1921 Lisp_Object symbol, map;
1923 int len = XVECTOR (Vcode_conversion_map_vector)->size;
1927 CHECK_SYMBOL (symbol, 0);
1928 CHECK_VECTOR (map, 1);
1930 for (i = 0; i < len; i++)
1932 Lisp_Object slot = XVECTOR (Vcode_conversion_map_vector)->contents[i];
1937 if (EQ (symbol, XCONS (slot)->car))
1939 index = make_int (i);
1940 XCONS (slot)->cdr = map;
1941 Fput (symbol, Qcode_conversion_map, map);
1942 Fput (symbol, Qcode_conversion_map_id, index);
1949 Lisp_Object new_vector = Fmake_vector (make_int (len * 2), Qnil);
1952 for (j = 0; j < len; j++)
1953 XVECTOR (new_vector)->contents[j]
1954 = XVECTOR (Vcode_conversion_map_vector)->contents[j];
1955 Vcode_conversion_map_vector = new_vector;
1958 index = make_int (i);
1959 Fput (symbol, Qcode_conversion_map, map);
1960 Fput (symbol, Qcode_conversion_map_id, index);
1961 XVECTOR (Vcode_conversion_map_vector)->contents[i] = Fcons (symbol, map);
1968 syms_of_mule_ccl (void)
1970 DEFSUBR (Fccl_execute);
1971 DEFSUBR (Fccl_execute_on_string);
1972 DEFSUBR (Fregister_ccl_program);
1974 DEFSUBR (&Fregister_code_conversion_map);
1979 vars_of_mule_ccl (void)
1981 staticpro (&Vccl_program_table);
1982 Vccl_program_table = Fmake_vector (make_int (32), Qnil);
1984 Qccl_program = intern ("ccl-program");
1985 staticpro (&Qccl_program);
1987 Qccl_program_idx = intern ("ccl-program-idx");
1988 staticpro (&Qccl_program_idx);
1991 Qcode_conversion_map = intern ("code-conversion-map");
1992 staticpro (&Qcode_conversion_map);
1994 Qcode_conversion_map_id = intern ("code-conversion-map-id");
1995 staticpro (&Qcode_conversion_map_id);
1997 DEFVAR_LISP ("code-conversion-map-vector", &Vcode_conversion_map_vector /*
1998 Vector of code conversion maps.*/ );
1999 Vcode_conversion_map_vector = Fmake_vector (make_int (16), Qnil);
2002 DEFVAR_LISP ("font-ccl-encoder-alist", &Vfont_ccl_encoder_alist /*
2003 Alist of fontname patterns vs corresponding CCL program.
2004 Each element looks like (REGEXP . CCL-CODE),
2005 where CCL-CODE is a compiled CCL program.
2006 When a font whose name matches REGEXP is used for displaying a character,
2007 CCL-CODE is executed to calculate the code point in the font
2008 from the charset number and position code(s) of the character which are set
2009 in CCL registers R0, R1, and R2 before the execution.
2010 The code point in the font is set in CCL registers R1 and R2
2011 when the execution terminated.
2012 If the font is single-byte font, the register R2 is not used.
2014 Vfont_ccl_encoder_alist = Qnil;