1 /* CCL (Code Conversion Language) interpreter.
2 Copyright (C) 1995, 1997 Electrotechnical Laboratory, JAPAN.
3 Licensed to the Free Software Foundation.
5 This file is part of GNU Emacs.
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. */
39 #endif /* not emacs */
41 /* This contains all code conversion map available to CCL. */
42 Lisp_Object Vcode_conversion_map_vector
;
44 /* Alist of fontname patterns vs corresponding CCL program. */
45 Lisp_Object Vfont_ccl_encoder_alist
;
47 /* This symbol is a property which assocates with ccl program vector.
48 Ex: (get 'ccl-big5-encoder 'ccl-program) returns ccl program vector. */
49 Lisp_Object Qccl_program
;
51 /* These symbols are properties which associate with code conversion
52 map and their ID respectively. */
53 Lisp_Object Qcode_conversion_map
;
54 Lisp_Object Qcode_conversion_map_id
;
56 /* Symbols of ccl program have this property, a value of the property
57 is an index for Vccl_protram_table. */
58 Lisp_Object Qccl_program_idx
;
60 /* Table of registered CCL programs. Each element is a vector of
61 NAME, CCL_PROG, and RESOLVEDP where NAME (symbol) is the name of
62 the program, CCL_PROG (vector) is the compiled code of the program,
63 RESOLVEDP (t or nil) is the flag to tell if symbols in CCL_PROG is
64 already resolved to index numbers or not. */
65 Lisp_Object Vccl_program_table
;
67 /* CCL (Code Conversion Language) is a simple language which has
68 operations on one input buffer, one output buffer, and 7 registers.
69 The syntax of CCL is described in `ccl.el'. Emacs Lisp function
70 `ccl-compile' compiles a CCL program and produces a CCL code which
71 is a vector of integers. The structure of this vector is as
72 follows: The 1st element: buffer-magnification, a factor for the
73 size of output buffer compared with the size of input buffer. The
74 2nd element: address of CCL code to be executed when encountered
75 with end of input stream. The 3rd and the remaining elements: CCL
78 /* Header of CCL compiled code */
79 #define CCL_HEADER_BUF_MAG 0
80 #define CCL_HEADER_EOF 1
81 #define CCL_HEADER_MAIN 2
83 /* CCL code is a sequence of 28-bit non-negative integers (i.e. the
84 MSB is always 0), each contains CCL command and/or arguments in the
87 |----------------- integer (28-bit) ------------------|
88 |------- 17-bit ------|- 3-bit --|- 3-bit --|- 5-bit -|
89 |--constant argument--|-register-|-register-|-command-|
90 ccccccccccccccccc RRR rrr XXXXX
92 |------- relative address -------|-register-|-command-|
93 cccccccccccccccccccc rrr XXXXX
95 |------------- constant or other args ----------------|
96 cccccccccccccccccccccccccccc
98 where, `cc...c' is a non-negative integer indicating constant value
99 (the left most `c' is always 0) or an absolute jump address, `RRR'
100 and `rrr' are CCL register number, `XXXXX' is one of the following
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. */
109 #define CCL_SetRegister 0x00 /* Set register a register value:
110 1:00000000000000000RRRrrrXXXXX
111 ------------------------------
115 #define CCL_SetShortConst 0x01 /* Set register a short constant value:
116 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
117 ------------------------------
118 reg[rrr] = CCCCCCCCCCCCCCCCCCC;
121 #define CCL_SetConst 0x02 /* Set register a constant value:
122 1:00000000000000000000rrrXXXXX
124 ------------------------------
129 #define CCL_SetArray 0x03 /* Set register an element of array:
130 1:CCCCCCCCCCCCCCCCCRRRrrrXXXXX
134 ------------------------------
135 if (0 <= reg[RRR] < CC..C)
136 reg[rrr] = ELEMENT[reg[RRR]];
140 #define CCL_Jump 0x04 /* Jump:
141 1:A--D--D--R--E--S--S-000XXXXX
142 ------------------------------
146 /* Note: If CC..C is greater than 0, the second code is omitted. */
148 #define CCL_JumpCond 0x05 /* Jump conditional:
149 1:A--D--D--R--E--S--S-rrrXXXXX
150 ------------------------------
156 #define CCL_WriteRegisterJump 0x06 /* Write register and jump:
157 1:A--D--D--R--E--S--S-rrrXXXXX
158 ------------------------------
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 -----------------------------
172 /* Note: If read is suspended, the resumed execution starts from the
173 second code (YYYYY == CCL_ReadJump). */
175 #define CCL_WriteConstJump 0x08 /* Write constant and jump:
176 1:A--D--D--R--E--S--S-000XXXXX
178 ------------------------------
183 #define CCL_WriteConstReadJump 0x09 /* Write constant, read, and jump:
184 1:A--D--D--R--E--S--S-rrrXXXXX
186 3:A--D--D--R--E--S--S-rrrYYYYY
187 -----------------------------
193 /* Note: If read is suspended, the resumed execution starts from the
194 second code (YYYYY == CCL_ReadJump). */
196 #define CCL_WriteStringJump 0x0A /* Write string and jump:
197 1:A--D--D--R--E--S--S-000XXXXX
199 3:0000STRIN[0]STRIN[1]STRIN[2]
201 ------------------------------
202 write_string (STRING, LENGTH);
206 #define CCL_WriteArrayReadJump 0x0B /* Write an array element, read, and jump:
207 1:A--D--D--R--E--S--S-rrrXXXXX
212 N:A--D--D--R--E--S--S-rrrYYYYY
213 ------------------------------
214 if (0 <= reg[rrr] < LENGTH)
215 write (ELEMENT[reg[rrr]]);
216 IC += LENGTH + 2; (... pointing at N+1)
220 /* Note: If read is suspended, the resumed execution starts from the
221 Nth code (YYYYY == CCL_ReadJump). */
223 #define CCL_ReadJump 0x0C /* Read and jump:
224 1:A--D--D--R--E--S--S-rrrYYYYY
225 -----------------------------
230 #define CCL_Branch 0x0D /* Jump by branch table:
231 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
232 2:A--D--D--R--E-S-S[0]000XXXXX
233 3:A--D--D--R--E-S-S[1]000XXXXX
235 ------------------------------
236 if (0 <= reg[rrr] < CC..C)
237 IC += ADDRESS[reg[rrr]];
239 IC += ADDRESS[CC..C];
242 #define CCL_ReadRegister 0x0E /* Read bytes into registers:
243 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
244 2:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
246 ------------------------------
251 #define CCL_WriteExprConst 0x0F /* write result of expression:
252 1:00000OPERATION000RRR000XXXXX
254 ------------------------------
255 write (reg[RRR] OPERATION CONSTANT);
259 /* Note: If the Nth read is suspended, the resumed execution starts
260 from the Nth code. */
262 #define CCL_ReadBranch 0x10 /* Read one byte into a register,
263 and jump by branch table:
264 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
265 2:A--D--D--R--E-S-S[0]000XXXXX
266 3:A--D--D--R--E-S-S[1]000XXXXX
268 ------------------------------
270 if (0 <= reg[rrr] < CC..C)
271 IC += ADDRESS[reg[rrr]];
273 IC += ADDRESS[CC..C];
276 #define CCL_WriteRegister 0x11 /* Write registers:
277 1:CCCCCCCCCCCCCCCCCCCrrrXXXXX
278 2:CCCCCCCCCCCCCCCCCCCrrrXXXXX
280 ------------------------------
286 /* Note: If the Nth write is suspended, the resumed execution
287 starts from the Nth code. */
289 #define CCL_WriteExprRegister 0x12 /* Write result of expression
290 1:00000OPERATIONRrrRRR000XXXXX
291 ------------------------------
292 write (reg[RRR] OPERATION reg[Rrr]);
295 #define CCL_Call 0x13 /* Call the CCL program whose ID is
297 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX
298 [2:00000000cccccccccccccccccccc]
299 ------------------------------
307 #define CCL_WriteConstString 0x14 /* Write a constant or a string:
308 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
309 [2:0000STRIN[0]STRIN[1]STRIN[2]]
311 -----------------------------
315 write_string (STRING, CC..C);
316 IC += (CC..C + 2) / 3;
319 #define CCL_WriteArray 0x15 /* Write an element of array:
320 1:CCCCCCCCCCCCCCCCCCCCrrrXXXXX
324 ------------------------------
325 if (0 <= reg[rrr] < CC..C)
326 write (ELEMENT[reg[rrr]]);
330 #define CCL_End 0x16 /* Terminate:
331 1:00000000000000000000000XXXXX
332 ------------------------------
336 /* The following two codes execute an assignment arithmetic/logical
337 operation. The form of the operation is like REG OP= OPERAND. */
339 #define CCL_ExprSelfConst 0x17 /* REG OP= constant:
340 1:00000OPERATION000000rrrXXXXX
342 ------------------------------
343 reg[rrr] OPERATION= CONSTANT;
346 #define CCL_ExprSelfReg 0x18 /* REG1 OP= REG2:
347 1:00000OPERATION000RRRrrrXXXXX
348 ------------------------------
349 reg[rrr] OPERATION= reg[RRR];
352 /* The following codes execute an arithmetic/logical operation. The
353 form of the operation is like REG_X = REG_Y OP OPERAND2. */
355 #define CCL_SetExprConst 0x19 /* REG_X = REG_Y OP constant:
356 1:00000OPERATION000RRRrrrXXXXX
358 ------------------------------
359 reg[rrr] = reg[RRR] OPERATION CONSTANT;
363 #define CCL_SetExprReg 0x1A /* REG1 = REG2 OP REG3:
364 1:00000OPERATIONRrrRRRrrrXXXXX
365 ------------------------------
366 reg[rrr] = reg[RRR] OPERATION reg[Rrr];
369 #define CCL_JumpCondExprConst 0x1B /* Jump conditional according to
370 an operation on constant:
371 1:A--D--D--R--E--S--S-rrrXXXXX
374 -----------------------------
375 reg[7] = reg[rrr] OPERATION CONSTANT;
382 #define CCL_JumpCondExprReg 0x1C /* Jump conditional according to
383 an operation on register:
384 1:A--D--D--R--E--S--S-rrrXXXXX
387 -----------------------------
388 reg[7] = reg[rrr] OPERATION reg[RRR];
395 #define CCL_ReadJumpCondExprConst 0x1D /* Read and jump conditional according
396 to an operation on constant:
397 1:A--D--D--R--E--S--S-rrrXXXXX
400 -----------------------------
402 reg[7] = reg[rrr] OPERATION CONSTANT;
409 #define CCL_ReadJumpCondExprReg 0x1E /* Read and jump conditional according
410 to an operation on register:
411 1:A--D--D--R--E--S--S-rrrXXXXX
414 -----------------------------
416 reg[7] = reg[rrr] OPERATION reg[RRR];
423 #define CCL_Extention 0x1F /* Extended CCL code
424 1:ExtendedCOMMNDRrrRRRrrrXXXXX
427 ------------------------------
428 extended_command (rrr,RRR,Rrr,ARGS)
432 Here after, Extended CCL Instructions.
433 Bit length of extended command is 14.
434 Therefore, the instruction code range is 0..16384(0x3fff).
437 /* Read a multibyte characeter.
438 A code point is stored into reg[rrr]. A charset ID is stored into
441 #define CCL_ReadMultibyteChar2 0x00 /* Read Multibyte Character
442 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
444 /* Write a multibyte character.
445 Write a character whose code point is reg[rrr] and the charset ID
448 #define CCL_WriteMultibyteChar2 0x01 /* Write Multibyte Character
449 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
451 /* Translate a character whose code point is reg[rrr] and the charset
452 ID is reg[RRR] by a translation table whose ID is reg[Rrr].
454 A translated character is set in reg[rrr] (code point) and reg[RRR]
457 #define CCL_TranslateCharacter 0x02 /* Translate a multibyte character
458 1:ExtendedCOMMNDRrrRRRrrrXXXXX */
460 /* Translate a character whose code point is reg[rrr] and the charset
461 ID is reg[RRR] by a translation table whose ID is ARGUMENT.
463 A translated character is set in reg[rrr] (code point) and reg[RRR]
466 #define CCL_TranslateCharacterConstTbl 0x03 /* Translate a multibyte character
467 1:ExtendedCOMMNDRrrRRRrrrXXXXX
468 2:ARGUMENT(Translation Table ID)
471 /* Iterate looking up MAPs for reg[rrr] starting from the Nth (N =
472 reg[RRR]) MAP until some value is found.
474 Each MAP is a Lisp vector whose element is number, nil, t, or
476 If the element is nil, ignore the map and proceed to the next map.
477 If the element is t or lambda, finish without changing reg[rrr].
478 If the element is a number, set reg[rrr] to the number and finish.
480 Detail of the map structure is descibed in the comment for
481 CCL_MapMultiple below. */
483 #define CCL_IterateMultipleMap 0x10 /* Iterate multiple maps
484 1:ExtendedCOMMNDXXXRRRrrrXXXXX
491 /* Map the code in reg[rrr] by MAPs starting from the Nth (N =
494 MAPs are supplied in the succeeding CCL codes as follows:
496 When CCL program gives this nested structure of map to this command:
499 (MAP-ID121 MAP-ID122 MAP-ID123)
502 (MAP-ID211 (MAP-ID2111) MAP-ID212)
504 the compiled CCL codes has this sequence:
505 CCL_MapMultiple (CCL code of this command)
506 16 (total number of MAPs and SEPARATORs)
524 A value of each SEPARATOR follows this rule:
525 MAP-SET := SEPARATOR [(MAP-ID | MAP-SET)]+
526 SEPARATOR := -(number of MAP-IDs and SEPARATORs in the MAP-SET)
528 (*)....Nest level of MAP-SET must not be over than MAX_MAP_SET_LEVEL.
530 When some map fails to map (i.e. it doesn't have a value for
531 reg[rrr]), the mapping is treated as identity.
533 The mapping is iterated for all maps in each map set (set of maps
534 separated by SEPARATOR) except in the case that lambda is
535 encountered. More precisely, the mapping proceeds as below:
537 At first, VAL0 is set to reg[rrr], and it is translated by the
538 first map to VAL1. Then, VAL1 is translated by the next map to
539 VAL2. This mapping is iterated until the last map is used. The
540 result of the mapping is the last value of VAL?. When the mapping
541 process reached to the end of the map set, it moves to the next
542 map set. If the next does not exit, the mapping process terminates,
543 and regard the last value as a result.
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, move to the next map set like reaching to the
555 end of the current map set.
557 If VALn is a symbol, call the CCL program refered by it.
558 Then, use reg[rrr] as a mapped value except for -1, -2 and -3.
559 Such special values are regarded as nil, t, and lambda respectively.
561 Each map is a Lisp vector of the following format (a) or (b):
562 (a)......[STARTPOINT VAL1 VAL2 ...]
563 (b)......[t VAL STARTPOINT ENDPOINT],
565 STARTPOINT is an offset to be used for indexing a map,
566 ENDPOINT is a maximum index number of a map,
567 VAL and VALn is a number, nil, t, or lambda.
569 Valid index range of a map of type (a) is:
570 STARTPOINT <= index < STARTPOINT + map_size - 1
571 Valid index range of a map of type (b) is:
572 STARTPOINT <= index < ENDPOINT */
574 #define CCL_MapMultiple 0x11 /* Mapping by multiple code conversion maps
575 1:ExtendedCOMMNDXXXRRRrrrXXXXX
587 #define MAX_MAP_SET_LEVEL 30
595 static tr_stack mapping_stack
[MAX_MAP_SET_LEVEL
];
596 static tr_stack
*mapping_stack_pointer
;
598 /* If this variable is non-zero, it indicates the stack_idx
599 of immediately called by CCL_MapMultiple. */
600 static int stack_idx_of_map_multiple
;
602 #define PUSH_MAPPING_STACK(restlen, orig) \
604 mapping_stack_pointer->rest_length = (restlen); \
605 mapping_stack_pointer->orig_val = (orig); \
606 mapping_stack_pointer++; \
609 #define POP_MAPPING_STACK(restlen, orig) \
611 mapping_stack_pointer--; \
612 (restlen) = mapping_stack_pointer->rest_length; \
613 (orig) = mapping_stack_pointer->orig_val; \
616 #define CCL_CALL_FOR_MAP_INSTRUCTION(symbol, ret_ic) \
618 struct ccl_program called_ccl; \
619 if (stack_idx >= 256 \
620 || (setup_ccl_program (&called_ccl, (symbol)) != 0)) \
624 ccl_prog = ccl_prog_stack_struct[0].ccl_prog; \
625 ic = ccl_prog_stack_struct[0].ic; \
629 ccl_prog_stack_struct[stack_idx].ccl_prog = ccl_prog; \
630 ccl_prog_stack_struct[stack_idx].ic = (ret_ic); \
632 ccl_prog = called_ccl.prog; \
633 ic = CCL_HEADER_MAIN; \
637 #define CCL_MapSingle 0x12 /* Map by single code conversion map
638 1:ExtendedCOMMNDXXXRRRrrrXXXXX
640 ------------------------------
641 Map reg[rrr] by MAP-ID.
642 If some valid mapping is found,
643 set reg[rrr] to the result,
648 /* CCL arithmetic/logical operators. */
649 #define CCL_PLUS 0x00 /* X = Y + Z */
650 #define CCL_MINUS 0x01 /* X = Y - Z */
651 #define CCL_MUL 0x02 /* X = Y * Z */
652 #define CCL_DIV 0x03 /* X = Y / Z */
653 #define CCL_MOD 0x04 /* X = Y % Z */
654 #define CCL_AND 0x05 /* X = Y & Z */
655 #define CCL_OR 0x06 /* X = Y | Z */
656 #define CCL_XOR 0x07 /* X = Y ^ Z */
657 #define CCL_LSH 0x08 /* X = Y << Z */
658 #define CCL_RSH 0x09 /* X = Y >> Z */
659 #define CCL_LSH8 0x0A /* X = (Y << 8) | Z */
660 #define CCL_RSH8 0x0B /* X = Y >> 8, r[7] = Y & 0xFF */
661 #define CCL_DIVMOD 0x0C /* X = Y / Z, r[7] = Y % Z */
662 #define CCL_LS 0x10 /* X = (X < Y) */
663 #define CCL_GT 0x11 /* X = (X > Y) */
664 #define CCL_EQ 0x12 /* X = (X == Y) */
665 #define CCL_LE 0x13 /* X = (X <= Y) */
666 #define CCL_GE 0x14 /* X = (X >= Y) */
667 #define CCL_NE 0x15 /* X = (X != Y) */
669 #define CCL_DECODE_SJIS 0x16 /* X = HIGHER_BYTE (DE-SJIS (Y, Z))
670 r[7] = LOWER_BYTE (DE-SJIS (Y, Z)) */
671 #define CCL_ENCODE_SJIS 0x17 /* X = HIGHER_BYTE (SJIS (Y, Z))
672 r[7] = LOWER_BYTE (SJIS (Y, Z) */
674 /* Terminate CCL program successfully. */
675 #define CCL_SUCCESS \
677 ccl->status = CCL_STAT_SUCCESS; \
681 /* Suspend CCL program because of reading from empty input buffer or
682 writing to full output buffer. When this program is resumed, the
683 same I/O command is executed. */
684 #define CCL_SUSPEND(stat) \
687 ccl->status = stat; \
691 /* Terminate CCL program because of invalid command. Should not occur
692 in the normal case. */
693 #define CCL_INVALID_CMD \
695 ccl->status = CCL_STAT_INVALID_CMD; \
696 goto ccl_error_handler; \
699 /* Encode one character CH to multibyte form and write to the current
700 output buffer. If CH is less than 256, CH is written as is. */
701 #define CCL_WRITE_CHAR(ch) \
703 int bytes = SINGLE_BYTE_CHAR_P (ch) ? 1: CHAR_BYTES (ch); \
706 else if (dst + bytes + extra_bytes < (dst_bytes ? dst_end : src)) \
711 if ((ch) >= 0x80 && (ch) < 0xA0) \
712 /* We may have to convert this eight-bit char to \
713 multibyte form later. */ \
717 dst += CHAR_STRING (ch, dst); \
720 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
723 /* Write a string at ccl_prog[IC] of length LEN to the current output
725 #define CCL_WRITE_STRING(len) \
729 else if (dst + len <= (dst_bytes ? dst_end : src)) \
730 for (i = 0; i < len; i++) \
731 *dst++ = ((XFASTINT (ccl_prog[ic + (i / 3)])) \
732 >> ((2 - (i % 3)) * 8)) & 0xFF; \
734 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
737 /* Read one byte from the current input buffer into Rth register. */
738 #define CCL_READ_CHAR(r) \
742 else if (src < src_end) \
746 && ccl->eol_type != CODING_EOL_LF) \
748 /* We are encoding. */ \
749 if (ccl->eol_type == CODING_EOL_CRLF) \
751 if (ccl->cr_consumed) \
752 ccl->cr_consumed = 0; \
755 ccl->cr_consumed = 1; \
763 if (r == LEADING_CODE_8_BIT_CONTROL \
767 else if (ccl->last_block) \
773 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC); \
777 /* Set C to the character code made from CHARSET and CODE. This is
778 like MAKE_CHAR but check the validity of CHARSET and CODE. If they
779 are not valid, set C to (CODE & 0xFF) because that is usually the
780 case that CCL_ReadMultibyteChar2 read an invalid code and it set
781 CODE to that invalid byte. */
783 #define CCL_MAKE_CHAR(charset, code, c) \
785 if (charset == CHARSET_ASCII) \
787 else if (CHARSET_DEFINED_P (charset) \
788 && (code & 0x7F) >= 32 \
789 && (code < 256 || ((code >> 7) & 0x7F) >= 32)) \
791 int c1 = code & 0x7F, c2 = 0; \
794 c2 = c1, c1 = (code >> 7) & 0x7F; \
795 c = MAKE_CHAR (charset, c1, c2); \
802 /* Execute CCL code on SRC_BYTES length text at SOURCE. The resulting
803 text goes to a place pointed by DESTINATION, the length of which
804 should not exceed DST_BYTES. The bytes actually processed is
805 returned as *CONSUMED. The return value is the length of the
806 resulting text. As a side effect, the contents of CCL registers
807 are updated. If SOURCE or DESTINATION is NULL, only operations on
808 registers are permitted. */
811 #define CCL_DEBUG_BACKTRACE_LEN 256
812 int ccl_backtrace_table
[CCL_BACKTRACE_TABLE
];
813 int ccl_backtrace_idx
;
816 struct ccl_prog_stack
818 Lisp_Object
*ccl_prog
; /* Pointer to an array of CCL code. */
819 int ic
; /* Instruction Counter. */
822 /* For the moment, we only support depth 256 of stack. */
823 static struct ccl_prog_stack ccl_prog_stack_struct
[256];
826 ccl_driver (ccl
, source
, destination
, src_bytes
, dst_bytes
, consumed
)
827 struct ccl_program
*ccl
;
828 unsigned char *source
, *destination
;
829 int src_bytes
, dst_bytes
;
832 register int *reg
= ccl
->reg
;
833 register int ic
= ccl
->ic
;
834 register int code
, field1
, field2
;
835 register Lisp_Object
*ccl_prog
= ccl
->prog
;
836 unsigned char *src
= source
, *src_end
= src
+ src_bytes
;
837 unsigned char *dst
= destination
, *dst_end
= dst
+ dst_bytes
;
840 int stack_idx
= ccl
->stack_idx
;
841 /* Instruction counter of the current CCL code. */
843 /* CCL_WRITE_CHAR will produce 8-bit code of range 0x80..0x9F. But,
844 each of them will be converted to multibyte form of 2-byte
845 sequence. For that conversion, we remember how many more bytes
846 we must keep in DESTINATION in this variable. */
849 if (ic
>= ccl
->eof_ic
)
850 ic
= CCL_HEADER_MAIN
;
852 if (ccl
->buf_magnification
==0) /* We can't produce any bytes. */
855 /* Set mapping stack pointer. */
856 mapping_stack_pointer
= mapping_stack
;
859 ccl_backtrace_idx
= 0;
866 ccl_backtrace_table
[ccl_backtrace_idx
++] = ic
;
867 if (ccl_backtrace_idx
>= CCL_DEBUG_BACKTRACE_LEN
)
868 ccl_backtrace_idx
= 0;
869 ccl_backtrace_table
[ccl_backtrace_idx
] = 0;
872 if (!NILP (Vquit_flag
) && NILP (Vinhibit_quit
))
874 /* We can't just signal Qquit, instead break the loop as if
875 the whole data is processed. Don't reset Vquit_flag, it
876 must be handled later at a safer place. */
878 src
= source
+ src_bytes
;
879 ccl
->status
= CCL_STAT_QUIT
;
884 code
= XINT (ccl_prog
[ic
]); ic
++;
886 field2
= (code
& 0xFF) >> 5;
889 #define RRR (field1 & 7)
890 #define Rrr ((field1 >> 3) & 7)
892 #define EXCMD (field1 >> 6)
896 case CCL_SetRegister
: /* 00000000000000000RRRrrrXXXXX */
900 case CCL_SetShortConst
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
904 case CCL_SetConst
: /* 00000000000000000000rrrXXXXX */
905 reg
[rrr
] = XINT (ccl_prog
[ic
]);
909 case CCL_SetArray
: /* CCCCCCCCCCCCCCCCCCCCRRRrrrXXXXX */
912 if ((unsigned int) i
< j
)
913 reg
[rrr
] = XINT (ccl_prog
[ic
+ i
]);
917 case CCL_Jump
: /* A--D--D--R--E--S--S-000XXXXX */
921 case CCL_JumpCond
: /* A--D--D--R--E--S--S-rrrXXXXX */
926 case CCL_WriteRegisterJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
932 case CCL_WriteRegisterReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
936 CCL_READ_CHAR (reg
[rrr
]);
940 case CCL_WriteConstJump
: /* A--D--D--R--E--S--S-000XXXXX */
941 i
= XINT (ccl_prog
[ic
]);
946 case CCL_WriteConstReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
947 i
= XINT (ccl_prog
[ic
]);
950 CCL_READ_CHAR (reg
[rrr
]);
954 case CCL_WriteStringJump
: /* A--D--D--R--E--S--S-000XXXXX */
955 j
= XINT (ccl_prog
[ic
]);
957 CCL_WRITE_STRING (j
);
961 case CCL_WriteArrayReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
963 j
= XINT (ccl_prog
[ic
]);
964 if ((unsigned int) i
< j
)
966 i
= XINT (ccl_prog
[ic
+ 1 + i
]);
970 CCL_READ_CHAR (reg
[rrr
]);
971 ic
+= ADDR
- (j
+ 2);
974 case CCL_ReadJump
: /* A--D--D--R--E--S--S-rrrYYYYY */
975 CCL_READ_CHAR (reg
[rrr
]);
979 case CCL_ReadBranch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
980 CCL_READ_CHAR (reg
[rrr
]);
981 /* fall through ... */
982 case CCL_Branch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
983 if ((unsigned int) reg
[rrr
] < field1
)
984 ic
+= XINT (ccl_prog
[ic
+ reg
[rrr
]]);
986 ic
+= XINT (ccl_prog
[ic
+ field1
]);
989 case CCL_ReadRegister
: /* CCCCCCCCCCCCCCCCCCCCrrXXXXX */
992 CCL_READ_CHAR (reg
[rrr
]);
994 code
= XINT (ccl_prog
[ic
]); ic
++;
996 field2
= (code
& 0xFF) >> 5;
1000 case CCL_WriteExprConst
: /* 1:00000OPERATION000RRR000XXXXX */
1003 j
= XINT (ccl_prog
[ic
]);
1005 jump_address
= ic
+ 1;
1008 case CCL_WriteRegister
: /* CCCCCCCCCCCCCCCCCCCrrrXXXXX */
1014 code
= XINT (ccl_prog
[ic
]); ic
++;
1016 field2
= (code
& 0xFF) >> 5;
1020 case CCL_WriteExprRegister
: /* 1:00000OPERATIONRrrRRR000XXXXX */
1028 case CCL_Call
: /* 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX */
1033 /* If FFF is nonzero, the CCL program ID is in the
1037 prog_id
= XINT (ccl_prog
[ic
]);
1043 if (stack_idx
>= 256
1045 || prog_id
>= XVECTOR (Vccl_program_table
)->size
1046 || (slot
= XVECTOR (Vccl_program_table
)->contents
[prog_id
],
1048 || !VECTORP (XVECTOR (slot
)->contents
[1]))
1052 ccl_prog
= ccl_prog_stack_struct
[0].ccl_prog
;
1053 ic
= ccl_prog_stack_struct
[0].ic
;
1058 ccl_prog_stack_struct
[stack_idx
].ccl_prog
= ccl_prog
;
1059 ccl_prog_stack_struct
[stack_idx
].ic
= ic
;
1061 ccl_prog
= XVECTOR (XVECTOR (slot
)->contents
[1])->contents
;
1062 ic
= CCL_HEADER_MAIN
;
1066 case CCL_WriteConstString
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
1068 CCL_WRITE_CHAR (field1
);
1071 CCL_WRITE_STRING (field1
);
1072 ic
+= (field1
+ 2) / 3;
1076 case CCL_WriteArray
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
1078 if ((unsigned int) i
< field1
)
1080 j
= XINT (ccl_prog
[ic
+ i
]);
1086 case CCL_End
: /* 0000000000000000000000XXXXX */
1090 ccl_prog
= ccl_prog_stack_struct
[stack_idx
].ccl_prog
;
1091 ic
= ccl_prog_stack_struct
[stack_idx
].ic
;
1096 /* ccl->ic should points to this command code again to
1097 suppress further processing. */
1101 case CCL_ExprSelfConst
: /* 00000OPERATION000000rrrXXXXX */
1102 i
= XINT (ccl_prog
[ic
]);
1107 case CCL_ExprSelfReg
: /* 00000OPERATION000RRRrrrXXXXX */
1114 case CCL_PLUS
: reg
[rrr
] += i
; break;
1115 case CCL_MINUS
: reg
[rrr
] -= i
; break;
1116 case CCL_MUL
: reg
[rrr
] *= i
; break;
1117 case CCL_DIV
: reg
[rrr
] /= i
; break;
1118 case CCL_MOD
: reg
[rrr
] %= i
; break;
1119 case CCL_AND
: reg
[rrr
] &= i
; break;
1120 case CCL_OR
: reg
[rrr
] |= i
; break;
1121 case CCL_XOR
: reg
[rrr
] ^= i
; break;
1122 case CCL_LSH
: reg
[rrr
] <<= i
; break;
1123 case CCL_RSH
: reg
[rrr
] >>= i
; break;
1124 case CCL_LSH8
: reg
[rrr
] <<= 8; reg
[rrr
] |= i
; break;
1125 case CCL_RSH8
: reg
[7] = reg
[rrr
] & 0xFF; reg
[rrr
] >>= 8; break;
1126 case CCL_DIVMOD
: reg
[7] = reg
[rrr
] % i
; reg
[rrr
] /= i
; break;
1127 case CCL_LS
: reg
[rrr
] = reg
[rrr
] < i
; break;
1128 case CCL_GT
: reg
[rrr
] = reg
[rrr
] > i
; break;
1129 case CCL_EQ
: reg
[rrr
] = reg
[rrr
] == i
; break;
1130 case CCL_LE
: reg
[rrr
] = reg
[rrr
] <= i
; break;
1131 case CCL_GE
: reg
[rrr
] = reg
[rrr
] >= i
; break;
1132 case CCL_NE
: reg
[rrr
] = reg
[rrr
] != i
; break;
1133 default: CCL_INVALID_CMD
;
1137 case CCL_SetExprConst
: /* 00000OPERATION000RRRrrrXXXXX */
1139 j
= XINT (ccl_prog
[ic
]);
1141 jump_address
= ++ic
;
1144 case CCL_SetExprReg
: /* 00000OPERATIONRrrRRRrrrXXXXX */
1151 case CCL_ReadJumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1152 CCL_READ_CHAR (reg
[rrr
]);
1153 case CCL_JumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1155 op
= XINT (ccl_prog
[ic
]);
1156 jump_address
= ic
++ + ADDR
;
1157 j
= XINT (ccl_prog
[ic
]);
1162 case CCL_ReadJumpCondExprReg
: /* A--D--D--R--E--S--S-rrrXXXXX */
1163 CCL_READ_CHAR (reg
[rrr
]);
1164 case CCL_JumpCondExprReg
:
1166 op
= XINT (ccl_prog
[ic
]);
1167 jump_address
= ic
++ + ADDR
;
1168 j
= reg
[XINT (ccl_prog
[ic
])];
1175 case CCL_PLUS
: reg
[rrr
] = i
+ j
; break;
1176 case CCL_MINUS
: reg
[rrr
] = i
- j
; break;
1177 case CCL_MUL
: reg
[rrr
] = i
* j
; break;
1178 case CCL_DIV
: reg
[rrr
] = i
/ j
; break;
1179 case CCL_MOD
: reg
[rrr
] = i
% j
; break;
1180 case CCL_AND
: reg
[rrr
] = i
& j
; break;
1181 case CCL_OR
: reg
[rrr
] = i
| j
; break;
1182 case CCL_XOR
: reg
[rrr
] = i
^ j
;; break;
1183 case CCL_LSH
: reg
[rrr
] = i
<< j
; break;
1184 case CCL_RSH
: reg
[rrr
] = i
>> j
; break;
1185 case CCL_LSH8
: reg
[rrr
] = (i
<< 8) | j
; break;
1186 case CCL_RSH8
: reg
[rrr
] = i
>> 8; reg
[7] = i
& 0xFF; break;
1187 case CCL_DIVMOD
: reg
[rrr
] = i
/ j
; reg
[7] = i
% j
; break;
1188 case CCL_LS
: reg
[rrr
] = i
< j
; break;
1189 case CCL_GT
: reg
[rrr
] = i
> j
; break;
1190 case CCL_EQ
: reg
[rrr
] = i
== j
; break;
1191 case CCL_LE
: reg
[rrr
] = i
<= j
; break;
1192 case CCL_GE
: reg
[rrr
] = i
>= j
; break;
1193 case CCL_NE
: reg
[rrr
] = i
!= j
; break;
1194 case CCL_DECODE_SJIS
: DECODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1195 case CCL_ENCODE_SJIS
: ENCODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1196 default: CCL_INVALID_CMD
;
1199 if (code
== CCL_WriteExprConst
|| code
== CCL_WriteExprRegister
)
1212 case CCL_ReadMultibyteChar2
:
1220 goto ccl_read_multibyte_character_suspend
;
1224 if (i
== '\n' && ccl
->eol_type
!= CODING_EOL_LF
)
1226 /* We are encoding. */
1227 if (ccl
->eol_type
== CODING_EOL_CRLF
)
1229 if (ccl
->cr_consumed
)
1230 ccl
->cr_consumed
= 0;
1233 ccl
->cr_consumed
= 1;
1241 reg
[RRR
] = CHARSET_ASCII
;
1247 reg
[RRR
] = CHARSET_ASCII
;
1249 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION1
)
1252 goto ccl_read_multibyte_character_suspend
;
1254 reg
[rrr
] = (*src
++ & 0x7F);
1256 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION2
)
1258 if ((src
+ 1) >= src_end
)
1259 goto ccl_read_multibyte_character_suspend
;
1261 i
= (*src
++ & 0x7F);
1262 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1265 else if ((i
== LEADING_CODE_PRIVATE_11
)
1266 || (i
== LEADING_CODE_PRIVATE_12
))
1268 if ((src
+ 1) >= src_end
)
1269 goto ccl_read_multibyte_character_suspend
;
1271 reg
[rrr
] = (*src
++ & 0x7F);
1273 else if ((i
== LEADING_CODE_PRIVATE_21
)
1274 || (i
== LEADING_CODE_PRIVATE_22
))
1276 if ((src
+ 2) >= src_end
)
1277 goto ccl_read_multibyte_character_suspend
;
1279 i
= (*src
++ & 0x7F);
1280 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1283 else if (i
== LEADING_CODE_8_BIT_CONTROL
)
1286 goto ccl_read_multibyte_character_suspend
;
1287 reg
[RRR
] = CHARSET_8_BIT_CONTROL
;
1288 reg
[rrr
] = (*src
++ - 0x20);
1292 reg
[RRR
] = CHARSET_8_BIT_GRAPHIC
;
1297 /* INVALID CODE. Return a single byte character. */
1298 reg
[RRR
] = CHARSET_ASCII
;
1305 ccl_read_multibyte_character_suspend
:
1307 if (ccl
->last_block
)
1313 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC
);
1317 case CCL_WriteMultibyteChar2
:
1318 i
= reg
[RRR
]; /* charset */
1319 if (i
== CHARSET_ASCII
1320 || i
== CHARSET_8_BIT_CONTROL
1321 || i
== CHARSET_8_BIT_GRAPHIC
)
1322 i
= reg
[rrr
] & 0xFF;
1323 else if (CHARSET_DIMENSION (i
) == 1)
1324 i
= ((i
- 0x70) << 7) | (reg
[rrr
] & 0x7F);
1325 else if (i
< MIN_CHARSET_PRIVATE_DIMENSION2
)
1326 i
= ((i
- 0x8F) << 14) | reg
[rrr
];
1328 i
= ((i
- 0xE0) << 14) | reg
[rrr
];
1334 case CCL_TranslateCharacter
:
1335 CCL_MAKE_CHAR (reg
[RRR
], reg
[rrr
], i
);
1336 op
= translate_char (GET_TRANSLATION_TABLE (reg
[Rrr
]),
1338 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1345 case CCL_TranslateCharacterConstTbl
:
1346 op
= XINT (ccl_prog
[ic
]); /* table */
1348 CCL_MAKE_CHAR (reg
[RRR
], reg
[rrr
], i
);
1349 op
= translate_char (GET_TRANSLATION_TABLE (op
), i
, -1, 0, 0);
1350 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1357 case CCL_IterateMultipleMap
:
1359 Lisp_Object map
, content
, attrib
, value
;
1360 int point
, size
, fin_ic
;
1362 j
= XINT (ccl_prog
[ic
++]); /* number of maps. */
1365 if ((j
> reg
[RRR
]) && (j
>= 0))
1380 size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1381 point
= XINT (ccl_prog
[ic
++]);
1382 if (point
>= size
) continue;
1384 XVECTOR (Vcode_conversion_map_vector
)->contents
[point
];
1386 /* Check map varidity. */
1387 if (!CONSP (map
)) continue;
1389 if (!VECTORP (map
)) continue;
1390 size
= XVECTOR (map
)->size
;
1391 if (size
<= 1) continue;
1393 content
= XVECTOR (map
)->contents
[0];
1396 [STARTPOINT VAL1 VAL2 ...] or
1397 [t ELELMENT STARTPOINT ENDPOINT] */
1398 if (NUMBERP (content
))
1400 point
= XUINT (content
);
1401 point
= op
- point
+ 1;
1402 if (!((point
>= 1) && (point
< size
))) continue;
1403 content
= XVECTOR (map
)->contents
[point
];
1405 else if (EQ (content
, Qt
))
1407 if (size
!= 4) continue;
1408 if ((op
>= XUINT (XVECTOR (map
)->contents
[2]))
1409 && (op
< XUINT (XVECTOR (map
)->contents
[3])))
1410 content
= XVECTOR (map
)->contents
[1];
1419 else if (NUMBERP (content
))
1422 reg
[rrr
] = XINT(content
);
1425 else if (EQ (content
, Qt
) || EQ (content
, Qlambda
))
1430 else if (CONSP (content
))
1432 attrib
= XCAR (content
);
1433 value
= XCDR (content
);
1434 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1437 reg
[rrr
] = XUINT (value
);
1440 else if (SYMBOLP (content
))
1441 CCL_CALL_FOR_MAP_INSTRUCTION (content
, fin_ic
);
1451 case CCL_MapMultiple
:
1453 Lisp_Object map
, content
, attrib
, value
;
1454 int point
, size
, map_vector_size
;
1455 int map_set_rest_length
, fin_ic
;
1456 int current_ic
= this_ic
;
1458 /* inhibit recursive call on MapMultiple. */
1459 if (stack_idx_of_map_multiple
> 0)
1461 if (stack_idx_of_map_multiple
<= stack_idx
)
1463 stack_idx_of_map_multiple
= 0;
1464 mapping_stack_pointer
= mapping_stack
;
1469 mapping_stack_pointer
= mapping_stack
;
1470 stack_idx_of_map_multiple
= 0;
1472 map_set_rest_length
=
1473 XINT (ccl_prog
[ic
++]); /* number of maps and separators. */
1474 fin_ic
= ic
+ map_set_rest_length
;
1477 if ((map_set_rest_length
> reg
[RRR
]) && (reg
[RRR
] >= 0))
1481 map_set_rest_length
-= i
;
1487 mapping_stack_pointer
= mapping_stack
;
1491 if (mapping_stack_pointer
<= (mapping_stack
+ 1))
1493 /* Set up initial state. */
1494 mapping_stack_pointer
= mapping_stack
;
1495 PUSH_MAPPING_STACK (0, op
);
1500 /* Recover after calling other ccl program. */
1503 POP_MAPPING_STACK (map_set_rest_length
, orig_op
);
1504 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1508 /* Regard it as Qnil. */
1512 map_set_rest_length
--;
1515 /* Regard it as Qt. */
1519 map_set_rest_length
--;
1522 /* Regard it as Qlambda. */
1524 i
+= map_set_rest_length
;
1525 ic
+= map_set_rest_length
;
1526 map_set_rest_length
= 0;
1529 /* Regard it as normal mapping. */
1530 i
+= map_set_rest_length
;
1531 ic
+= map_set_rest_length
;
1532 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1536 map_vector_size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1539 for (;map_set_rest_length
> 0;i
++, ic
++, map_set_rest_length
--)
1541 point
= XINT(ccl_prog
[ic
]);
1544 /* +1 is for including separator. */
1546 if (mapping_stack_pointer
1547 >= &mapping_stack
[MAX_MAP_SET_LEVEL
])
1549 PUSH_MAPPING_STACK (map_set_rest_length
- point
,
1551 map_set_rest_length
= point
;
1556 if (point
>= map_vector_size
) continue;
1557 map
= (XVECTOR (Vcode_conversion_map_vector
)
1560 /* Check map varidity. */
1561 if (!CONSP (map
)) continue;
1563 if (!VECTORP (map
)) continue;
1564 size
= XVECTOR (map
)->size
;
1565 if (size
<= 1) continue;
1567 content
= XVECTOR (map
)->contents
[0];
1570 [STARTPOINT VAL1 VAL2 ...] or
1571 [t ELEMENT STARTPOINT ENDPOINT] */
1572 if (NUMBERP (content
))
1574 point
= XUINT (content
);
1575 point
= op
- point
+ 1;
1576 if (!((point
>= 1) && (point
< size
))) continue;
1577 content
= XVECTOR (map
)->contents
[point
];
1579 else if (EQ (content
, Qt
))
1581 if (size
!= 4) continue;
1582 if ((op
>= XUINT (XVECTOR (map
)->contents
[2])) &&
1583 (op
< XUINT (XVECTOR (map
)->contents
[3])))
1584 content
= XVECTOR (map
)->contents
[1];
1595 if (NUMBERP (content
))
1597 op
= XINT (content
);
1598 i
+= map_set_rest_length
- 1;
1599 ic
+= map_set_rest_length
- 1;
1600 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1601 map_set_rest_length
++;
1603 else if (CONSP (content
))
1605 attrib
= XCAR (content
);
1606 value
= XCDR (content
);
1607 if (!NUMBERP (attrib
) || !NUMBERP (value
))
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
++;
1615 else if (EQ (content
, Qt
))
1619 else if (EQ (content
, Qlambda
))
1621 i
+= map_set_rest_length
;
1622 ic
+= map_set_rest_length
;
1625 else if (SYMBOLP (content
))
1627 if (mapping_stack_pointer
1628 >= &mapping_stack
[MAX_MAP_SET_LEVEL
])
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
);
1638 if (mapping_stack_pointer
<= (mapping_stack
+ 1))
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
]);
1653 Lisp_Object map
, attrib
, value
, content
;
1655 j
= XINT (ccl_prog
[ic
++]); /* map_id */
1657 if (j
>= XVECTOR (Vcode_conversion_map_vector
)->size
)
1662 map
= XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
1674 size
= XVECTOR (map
)->size
;
1675 point
= XUINT (XVECTOR (map
)->contents
[0]);
1676 point
= op
- point
+ 1;
1679 (!((point
>= 1) && (point
< size
))))
1684 content
= XVECTOR (map
)->contents
[point
];
1687 else if (NUMBERP (content
))
1688 reg
[rrr
] = XINT (content
);
1689 else if (EQ (content
, Qt
));
1690 else if (CONSP (content
))
1692 attrib
= XCAR (content
);
1693 value
= XCDR (content
);
1694 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1696 reg
[rrr
] = XUINT(value
);
1699 else if (SYMBOLP (content
))
1700 CCL_CALL_FOR_MAP_INSTRUCTION (content
, ic
);
1720 /* We can insert an error message only if DESTINATION is
1721 specified and we still have a room to store the message
1729 switch (ccl
->status
)
1731 case CCL_STAT_INVALID_CMD
:
1732 sprintf(msg
, "\nCCL: Invalid command %x (ccl_code = %x) at %d.",
1733 code
& 0x1F, code
, this_ic
);
1736 int i
= ccl_backtrace_idx
- 1;
1739 msglen
= strlen (msg
);
1740 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1742 bcopy (msg
, dst
, msglen
);
1746 for (j
= 0; j
< CCL_DEBUG_BACKTRACE_LEN
; j
++, i
--)
1748 if (i
< 0) i
= CCL_DEBUG_BACKTRACE_LEN
- 1;
1749 if (ccl_backtrace_table
[i
] == 0)
1751 sprintf(msg
, " %d", ccl_backtrace_table
[i
]);
1752 msglen
= strlen (msg
);
1753 if (dst
+ msglen
> (dst_bytes
? dst_end
: src
))
1755 bcopy (msg
, dst
, msglen
);
1764 sprintf(msg
, "\nCCL: Quited.");
1768 sprintf(msg
, "\nCCL: Unknown error type (%d).", ccl
->status
);
1771 msglen
= strlen (msg
);
1772 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1774 bcopy (msg
, dst
, msglen
);
1781 ccl
->stack_idx
= stack_idx
;
1782 ccl
->prog
= ccl_prog
;
1783 if (consumed
) *consumed
= src
- source
;
1784 return (dst
? dst
- destination
: 0);
1787 /* Resolve symbols in the specified CCL code (Lisp vector). This
1788 function converts symbols of code conversion maps and character
1789 translation tables embeded in the CCL code into their ID numbers.
1791 The return value is a vector (CCL itself or a new vector in which
1792 all symbols are resolved), Qt if resolving of some symbol failed,
1793 or nil if CCL contains invalid data. */
1796 resolve_symbol_ccl_program (ccl
)
1799 int i
, veclen
, unresolved
= 0;
1800 Lisp_Object result
, contents
, val
;
1803 veclen
= XVECTOR (result
)->size
;
1805 for (i
= 0; i
< veclen
; i
++)
1807 contents
= XVECTOR (result
)->contents
[i
];
1808 if (INTEGERP (contents
))
1810 else if (CONSP (contents
)
1811 && SYMBOLP (XCAR (contents
))
1812 && SYMBOLP (XCDR (contents
)))
1814 /* This is the new style for embedding symbols. The form is
1815 (SYMBOL . PROPERTY). (get SYMBOL PROPERTY) should give
1818 if (EQ (result
, ccl
))
1819 result
= Fcopy_sequence (ccl
);
1821 val
= Fget (XCAR (contents
), XCDR (contents
));
1823 XVECTOR (result
)->contents
[i
] = val
;
1828 else if (SYMBOLP (contents
))
1830 /* This is the old style for embedding symbols. This style
1831 may lead to a bug if, for instance, a translation table
1832 and a code conversion map have the same name. */
1833 if (EQ (result
, ccl
))
1834 result
= Fcopy_sequence (ccl
);
1836 val
= Fget (contents
, Qtranslation_table_id
);
1838 XVECTOR (result
)->contents
[i
] = val
;
1841 val
= Fget (contents
, Qcode_conversion_map_id
);
1843 XVECTOR (result
)->contents
[i
] = val
;
1846 val
= Fget (contents
, Qccl_program_idx
);
1848 XVECTOR (result
)->contents
[i
] = val
;
1858 return (unresolved
? Qt
: result
);
1861 /* Return the compiled code (vector) of CCL program CCL_PROG.
1862 CCL_PROG is a name (symbol) of the program or already compiled
1863 code. If necessary, resolve symbols in the compiled code to index
1864 numbers. If we failed to get the compiled code or to resolve
1865 symbols, return Qnil. */
1868 ccl_get_compiled_code (ccl_prog
)
1869 Lisp_Object ccl_prog
;
1871 Lisp_Object val
, slot
;
1873 if (VECTORP (ccl_prog
))
1875 val
= resolve_symbol_ccl_program (ccl_prog
);
1876 return (VECTORP (val
) ? val
: Qnil
);
1878 if (!SYMBOLP (ccl_prog
))
1881 val
= Fget (ccl_prog
, Qccl_program_idx
);
1883 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1885 slot
= XVECTOR (Vccl_program_table
)->contents
[XINT (val
)];
1886 if (! VECTORP (slot
)
1887 || XVECTOR (slot
)->size
!= 3
1888 || ! VECTORP (XVECTOR (slot
)->contents
[1]))
1890 if (NILP (XVECTOR (slot
)->contents
[2]))
1892 val
= resolve_symbol_ccl_program (XVECTOR (slot
)->contents
[1]);
1893 if (! VECTORP (val
))
1895 XVECTOR (slot
)->contents
[1] = val
;
1896 XVECTOR (slot
)->contents
[2] = Qt
;
1898 return XVECTOR (slot
)->contents
[1];
1901 /* Setup fields of the structure pointed by CCL appropriately for the
1902 execution of CCL program CCL_PROG. CCL_PROG is the name (symbol)
1903 of the CCL program or the already compiled code (vector).
1904 Return 0 if we succeed this setup, else return -1.
1906 If CCL_PROG is nil, we just reset the structure pointed by CCL. */
1908 setup_ccl_program (ccl
, ccl_prog
)
1909 struct ccl_program
*ccl
;
1910 Lisp_Object ccl_prog
;
1914 if (! NILP (ccl_prog
))
1916 struct Lisp_Vector
*vp
;
1918 ccl_prog
= ccl_get_compiled_code (ccl_prog
);
1919 if (! VECTORP (ccl_prog
))
1921 vp
= XVECTOR (ccl_prog
);
1922 ccl
->size
= vp
->size
;
1923 ccl
->prog
= vp
->contents
;
1924 ccl
->eof_ic
= XINT (vp
->contents
[CCL_HEADER_EOF
]);
1925 ccl
->buf_magnification
= XINT (vp
->contents
[CCL_HEADER_BUF_MAG
]);
1927 ccl
->ic
= CCL_HEADER_MAIN
;
1928 for (i
= 0; i
< 8; i
++)
1930 ccl
->last_block
= 0;
1931 ccl
->private_state
= 0;
1934 ccl
->eol_type
= CODING_EOL_LF
;
1940 DEFUN ("ccl-program-p", Fccl_program_p
, Sccl_program_p
, 1, 1, 0,
1941 "Return t if OBJECT is a CCL program name or a compiled CCL program code.\n\
1942 See the documentation of `define-ccl-program' for the detail of CCL program.")
1948 if (VECTORP (object
))
1950 val
= resolve_symbol_ccl_program (object
);
1951 return (VECTORP (val
) ? Qt
: Qnil
);
1953 if (!SYMBOLP (object
))
1956 val
= Fget (object
, Qccl_program_idx
);
1957 return ((! NATNUMP (val
)
1958 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1962 DEFUN ("ccl-execute", Fccl_execute
, Sccl_execute
, 2, 2, 0,
1963 "Execute CCL-PROGRAM with registers initialized by REGISTERS.\n\
1965 CCL-PROGRAM is a CCL program name (symbol)\n\
1966 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
1967 in this case, the overhead of the execution is bigger than the former case).\n\
1968 No I/O commands should appear in CCL-PROGRAM.\n\
1970 REGISTERS is a vector of [R0 R1 ... R7] where RN is an initial value\n\
1973 As side effect, each element of REGISTERS holds the value of\n\
1974 corresponding register after the execution.\n\
1976 See the documentation of `define-ccl-program' for the detail of CCL program.")
1978 Lisp_Object ccl_prog
, reg
;
1980 struct ccl_program ccl
;
1983 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
1984 error ("Invalid CCL program");
1986 CHECK_VECTOR (reg
, 1);
1987 if (XVECTOR (reg
)->size
!= 8)
1988 error ("Length of vector REGISTERS is not 8");
1990 for (i
= 0; i
< 8; i
++)
1991 ccl
.reg
[i
] = (INTEGERP (XVECTOR (reg
)->contents
[i
])
1992 ? XINT (XVECTOR (reg
)->contents
[i
])
1995 ccl_driver (&ccl
, (char *)0, (char *)0, 0, 0, (int *)0);
1997 if (ccl
.status
!= CCL_STAT_SUCCESS
)
1998 error ("Error in CCL program at %dth code", ccl
.ic
);
2000 for (i
= 0; i
< 8; i
++)
2001 XSETINT (XVECTOR (reg
)->contents
[i
], ccl
.reg
[i
]);
2005 DEFUN ("ccl-execute-on-string", Fccl_execute_on_string
, Sccl_execute_on_string
,
2007 "Execute CCL-PROGRAM with initial STATUS on STRING.\n\
2009 CCL-PROGRAM is a symbol registered by register-ccl-program,\n\
2010 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
2011 in this case, the execution is slower).\n\
2013 Read buffer is set to STRING, and write buffer is allocated automatically.\n\
2015 STATUS is a vector of [R0 R1 ... R7 IC], where\n\
2016 R0..R7 are initial values of corresponding registers,\n\
2017 IC is the instruction counter specifying from where to start the program.\n\
2018 If R0..R7 are nil, they are initialized to 0.\n\
2019 If IC is nil, it is initialized to head of the CCL program.\n\
2021 If optional 4th arg CONTINUE is non-nil, keep IC on read operation\n\
2022 when read buffer is exausted, else, IC is always set to the end of\n\
2023 CCL-PROGRAM on exit.\n\
2025 It returns the contents of write buffer as a string,\n\
2026 and as side effect, STATUS is updated.\n\
2027 If the optional 5th arg UNIBYTE-P is non-nil, the returned string\n\
2028 is a unibyte string. By default it is a multibyte string.\n\
2030 See the documentation of `define-ccl-program' for the detail of CCL program.")
2031 (ccl_prog
, status
, str
, contin
, unibyte_p
)
2032 Lisp_Object ccl_prog
, status
, str
, contin
, unibyte_p
;
2035 struct ccl_program ccl
;
2039 struct gcpro gcpro1
, gcpro2
;
2041 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
2042 error ("Invalid CCL program");
2044 CHECK_VECTOR (status
, 1);
2045 if (XVECTOR (status
)->size
!= 9)
2046 error ("Length of vector STATUS is not 9");
2047 CHECK_STRING (str
, 2);
2049 GCPRO2 (status
, str
);
2051 for (i
= 0; i
< 8; i
++)
2053 if (NILP (XVECTOR (status
)->contents
[i
]))
2054 XSETINT (XVECTOR (status
)->contents
[i
], 0);
2055 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
2056 ccl
.reg
[i
] = XINT (XVECTOR (status
)->contents
[i
]);
2058 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
2060 i
= XFASTINT (XVECTOR (status
)->contents
[8]);
2061 if (ccl
.ic
< i
&& i
< ccl
.size
)
2064 outbufsize
= STRING_BYTES (XSTRING (str
)) * ccl
.buf_magnification
+ 256;
2065 outbuf
= (char *) xmalloc (outbufsize
);
2066 ccl
.last_block
= NILP (contin
);
2067 ccl
.multibyte
= STRING_MULTIBYTE (str
);
2068 produced
= ccl_driver (&ccl
, XSTRING (str
)->data
, outbuf
,
2069 STRING_BYTES (XSTRING (str
)), outbufsize
, (int *) 0);
2070 for (i
= 0; i
< 8; i
++)
2071 XSET (XVECTOR (status
)->contents
[i
], Lisp_Int
, ccl
.reg
[i
]);
2072 XSETINT (XVECTOR (status
)->contents
[8], ccl
.ic
);
2075 if (NILP (unibyte_p
))
2079 produced
= str_as_multibyte (outbuf
, outbufsize
, produced
, &nchars
);
2080 val
= make_multibyte_string (outbuf
, nchars
, produced
);
2083 val
= make_unibyte_string (outbuf
, produced
);
2086 if (ccl
.status
== CCL_STAT_SUSPEND_BY_DST
)
2087 error ("Output buffer for the CCL programs overflow");
2088 if (ccl
.status
!= CCL_STAT_SUCCESS
2089 && ccl
.status
!= CCL_STAT_SUSPEND_BY_SRC
)
2090 error ("Error in CCL program at %dth code", ccl
.ic
);
2095 DEFUN ("register-ccl-program", Fregister_ccl_program
, Sregister_ccl_program
,
2097 "Register CCL program CCL_PROG as NAME in `ccl-program-table'.\n\
2098 CCL_PROG should be a compiled CCL program (vector), or nil.\n\
2099 If it is nil, just reserve NAME as a CCL program name.\n\
2100 Return index number of the registered CCL program.")
2102 Lisp_Object name
, ccl_prog
;
2104 int len
= XVECTOR (Vccl_program_table
)->size
;
2106 Lisp_Object resolved
;
2108 CHECK_SYMBOL (name
, 0);
2110 if (!NILP (ccl_prog
))
2112 CHECK_VECTOR (ccl_prog
, 1);
2113 resolved
= resolve_symbol_ccl_program (ccl_prog
);
2114 if (! NILP (resolved
))
2116 ccl_prog
= resolved
;
2121 for (idx
= 0; idx
< len
; idx
++)
2125 slot
= XVECTOR (Vccl_program_table
)->contents
[idx
];
2126 if (!VECTORP (slot
))
2127 /* This is the first unsed slot. Register NAME here. */
2130 if (EQ (name
, XVECTOR (slot
)->contents
[0]))
2132 /* Update this slot. */
2133 XVECTOR (slot
)->contents
[1] = ccl_prog
;
2134 XVECTOR (slot
)->contents
[2] = resolved
;
2135 return make_number (idx
);
2141 /* Extend the table. */
2142 Lisp_Object new_table
;
2145 new_table
= Fmake_vector (make_number (len
* 2), Qnil
);
2146 for (j
= 0; j
< len
; j
++)
2147 XVECTOR (new_table
)->contents
[j
]
2148 = XVECTOR (Vccl_program_table
)->contents
[j
];
2149 Vccl_program_table
= new_table
;
2155 elt
= Fmake_vector (make_number (3), Qnil
);
2156 XVECTOR (elt
)->contents
[0] = name
;
2157 XVECTOR (elt
)->contents
[1] = ccl_prog
;
2158 XVECTOR (elt
)->contents
[2] = resolved
;
2159 XVECTOR (Vccl_program_table
)->contents
[idx
] = elt
;
2162 Fput (name
, Qccl_program_idx
, make_number (idx
));
2163 return make_number (idx
);
2166 /* Register code conversion map.
2167 A code conversion map consists of numbers, Qt, Qnil, and Qlambda.
2168 The first element is start code point.
2169 The rest elements are mapped numbers.
2170 Symbol t means to map to an original number before mapping.
2171 Symbol nil means that the corresponding element is empty.
2172 Symbol lambda menas to terminate mapping here.
2175 DEFUN ("register-code-conversion-map", Fregister_code_conversion_map
,
2176 Sregister_code_conversion_map
,
2178 "Register SYMBOL as code conversion map MAP.\n\
2179 Return index number of the registered map.")
2181 Lisp_Object symbol
, map
;
2183 int len
= XVECTOR (Vcode_conversion_map_vector
)->size
;
2187 CHECK_SYMBOL (symbol
, 0);
2188 CHECK_VECTOR (map
, 1);
2190 for (i
= 0; i
< len
; i
++)
2192 Lisp_Object slot
= XVECTOR (Vcode_conversion_map_vector
)->contents
[i
];
2197 if (EQ (symbol
, XCAR (slot
)))
2199 index
= make_number (i
);
2201 Fput (symbol
, Qcode_conversion_map
, map
);
2202 Fput (symbol
, Qcode_conversion_map_id
, index
);
2209 Lisp_Object new_vector
= Fmake_vector (make_number (len
* 2), Qnil
);
2212 for (j
= 0; j
< len
; j
++)
2213 XVECTOR (new_vector
)->contents
[j
]
2214 = XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
2215 Vcode_conversion_map_vector
= new_vector
;
2218 index
= make_number (i
);
2219 Fput (symbol
, Qcode_conversion_map
, map
);
2220 Fput (symbol
, Qcode_conversion_map_id
, index
);
2221 XVECTOR (Vcode_conversion_map_vector
)->contents
[i
] = Fcons (symbol
, map
);
2229 staticpro (&Vccl_program_table
);
2230 Vccl_program_table
= Fmake_vector (make_number (32), Qnil
);
2232 Qccl_program
= intern ("ccl-program");
2233 staticpro (&Qccl_program
);
2235 Qccl_program_idx
= intern ("ccl-program-idx");
2236 staticpro (&Qccl_program_idx
);
2238 Qcode_conversion_map
= intern ("code-conversion-map");
2239 staticpro (&Qcode_conversion_map
);
2241 Qcode_conversion_map_id
= intern ("code-conversion-map-id");
2242 staticpro (&Qcode_conversion_map_id
);
2244 DEFVAR_LISP ("code-conversion-map-vector", &Vcode_conversion_map_vector
,
2245 "Vector of code conversion maps.");
2246 Vcode_conversion_map_vector
= Fmake_vector (make_number (16), Qnil
);
2248 DEFVAR_LISP ("font-ccl-encoder-alist", &Vfont_ccl_encoder_alist
,
2249 "Alist of fontname patterns vs corresponding CCL program.\n\
2250 Each element looks like (REGEXP . CCL-CODE),\n\
2251 where CCL-CODE is a compiled CCL program.\n\
2252 When a font whose name matches REGEXP is used for displaying a character,\n\
2253 CCL-CODE is executed to calculate the code point in the font\n\
2254 from the charset number and position code(s) of the character which are set\n\
2255 in CCL registers R0, R1, and R2 before the execution.\n\
2256 The code point in the font is set in CCL registers R1 and R2\n\
2257 when the execution terminated.\n\
2258 If the font is single-byte font, the register R2 is not used.");
2259 Vfont_ccl_encoder_alist
= Qnil
;
2261 defsubr (&Sccl_program_p
);
2262 defsubr (&Sccl_execute
);
2263 defsubr (&Sccl_execute_on_string
);
2264 defsubr (&Sregister_ccl_program
);
2265 defsubr (&Sregister_code_conversion_map
);