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?.
542 But, when VALm is mapped to VALn and VALn is not a number, the
543 mapping proceed as below:
545 If VALn is nil, the lastest map is ignored and the mapping of VALm
546 proceed to the next map.
548 In VALn is t, VALm is reverted to reg[rrr] and the mapping of VALm
549 proceed to the next map.
551 If VALn is lambda, the whole mapping process terminates, and VALm
552 is the result of this mapping.
554 Each map is a Lisp vector of the following format (a) or (b):
555 (a)......[STARTPOINT VAL1 VAL2 ...]
556 (b)......[t VAL STARTPOINT ENDPOINT],
558 STARTPOINT is an offset to be used for indexing a map,
559 ENDPOINT is a maximum index number of a map,
560 VAL and VALn is a number, nil, t, or lambda.
562 Valid index range of a map of type (a) is:
563 STARTPOINT <= index < STARTPOINT + map_size - 1
564 Valid index range of a map of type (b) is:
565 STARTPOINT <= index < ENDPOINT */
567 #define CCL_MapMultiple 0x11 /* Mapping by multiple code conversion maps
568 1:ExtendedCOMMNDXXXRRRrrrXXXXX
580 #define MAX_MAP_SET_LEVEL 20
588 static tr_stack mapping_stack
[MAX_MAP_SET_LEVEL
];
589 static tr_stack
*mapping_stack_pointer
;
591 #define PUSH_MAPPING_STACK(restlen, orig) \
593 mapping_stack_pointer->rest_length = (restlen); \
594 mapping_stack_pointer->orig_val = (orig); \
595 mapping_stack_pointer++; \
598 #define POP_MAPPING_STACK(restlen, orig) \
600 mapping_stack_pointer--; \
601 (restlen) = mapping_stack_pointer->rest_length; \
602 (orig) = mapping_stack_pointer->orig_val; \
605 #define CCL_MapSingle 0x12 /* Map by single code conversion map
606 1:ExtendedCOMMNDXXXRRRrrrXXXXX
608 ------------------------------
609 Map reg[rrr] by MAP-ID.
610 If some valid mapping is found,
611 set reg[rrr] to the result,
616 /* CCL arithmetic/logical operators. */
617 #define CCL_PLUS 0x00 /* X = Y + Z */
618 #define CCL_MINUS 0x01 /* X = Y - Z */
619 #define CCL_MUL 0x02 /* X = Y * Z */
620 #define CCL_DIV 0x03 /* X = Y / Z */
621 #define CCL_MOD 0x04 /* X = Y % Z */
622 #define CCL_AND 0x05 /* X = Y & Z */
623 #define CCL_OR 0x06 /* X = Y | Z */
624 #define CCL_XOR 0x07 /* X = Y ^ Z */
625 #define CCL_LSH 0x08 /* X = Y << Z */
626 #define CCL_RSH 0x09 /* X = Y >> Z */
627 #define CCL_LSH8 0x0A /* X = (Y << 8) | Z */
628 #define CCL_RSH8 0x0B /* X = Y >> 8, r[7] = Y & 0xFF */
629 #define CCL_DIVMOD 0x0C /* X = Y / Z, r[7] = Y % Z */
630 #define CCL_LS 0x10 /* X = (X < Y) */
631 #define CCL_GT 0x11 /* X = (X > Y) */
632 #define CCL_EQ 0x12 /* X = (X == Y) */
633 #define CCL_LE 0x13 /* X = (X <= Y) */
634 #define CCL_GE 0x14 /* X = (X >= Y) */
635 #define CCL_NE 0x15 /* X = (X != Y) */
637 #define CCL_DECODE_SJIS 0x16 /* X = HIGHER_BYTE (DE-SJIS (Y, Z))
638 r[7] = LOWER_BYTE (DE-SJIS (Y, Z)) */
639 #define CCL_ENCODE_SJIS 0x17 /* X = HIGHER_BYTE (SJIS (Y, Z))
640 r[7] = LOWER_BYTE (SJIS (Y, Z) */
642 /* Terminate CCL program successfully. */
643 #define CCL_SUCCESS \
645 ccl->status = CCL_STAT_SUCCESS; \
649 /* Suspend CCL program because of reading from empty input buffer or
650 writing to full output buffer. When this program is resumed, the
651 same I/O command is executed. */
652 #define CCL_SUSPEND(stat) \
655 ccl->status = stat; \
659 /* Terminate CCL program because of invalid command. Should not occur
660 in the normal case. */
661 #define CCL_INVALID_CMD \
663 ccl->status = CCL_STAT_INVALID_CMD; \
664 goto ccl_error_handler; \
667 /* Encode one character CH to multibyte form and write to the current
668 output buffer. If CH is less than 256, CH is written as is. */
669 #define CCL_WRITE_CHAR(ch) \
671 int bytes = SINGLE_BYTE_CHAR_P (ch) ? 1: CHAR_BYTES (ch); \
672 if (ch == '\n' && ccl->eol_type == CODING_EOL_CRLF) \
676 else if (dst + bytes <= (dst_bytes ? dst_end : src)) \
680 if (ccl->eol_type == CODING_EOL_CRLF) \
681 *dst++ = '\r', *dst++ = '\n'; \
682 else if (ccl->eol_type == CODING_EOL_CR) \
687 else if (bytes == 1) \
690 dst += CHAR_STRING (ch, dst); \
693 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
696 /* Write a string at ccl_prog[IC] of length LEN to the current output
698 #define CCL_WRITE_STRING(len) \
702 else if (dst + len <= (dst_bytes ? dst_end : src)) \
703 for (i = 0; i < len; i++) \
704 *dst++ = ((XFASTINT (ccl_prog[ic + (i / 3)])) \
705 >> ((2 - (i % 3)) * 8)) & 0xFF; \
707 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
710 /* Read one byte from the current input buffer into Rth register. */
711 #define CCL_READ_CHAR(r) \
715 else if (src < src_end) \
717 else if (ccl->last_block) \
723 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC); \
727 /* Set C to the character code made from CHARSET and CODE. This is
728 like MAKE_CHAR but check the validity of CHARSET and CODE. If they
729 are not valid, set C to (CODE & 0xFF) because that is usually the
730 case that CCL_ReadMultibyteChar2 read an invalid code and it set
731 CODE to that invalid byte. */
733 #define CCL_MAKE_CHAR(charset, code, c) \
735 if (charset == CHARSET_ASCII) \
737 else if (CHARSET_DEFINED_P (charset) \
738 && (code & 0x7F) >= 32 \
739 && (code < 256 || ((code >> 7) & 0x7F) >= 32)) \
741 int c1 = code & 0x7F, c2 = 0; \
744 c2 = c1, c1 = (code >> 7) & 0x7F; \
745 c = MAKE_CHAR (charset, c1, c2); \
752 /* Execute CCL code on SRC_BYTES length text at SOURCE. The resulting
753 text goes to a place pointed by DESTINATION, the length of which
754 should not exceed DST_BYTES. The bytes actually processed is
755 returned as *CONSUMED. The return value is the length of the
756 resulting text. As a side effect, the contents of CCL registers
757 are updated. If SOURCE or DESTINATION is NULL, only operations on
758 registers are permitted. */
761 #define CCL_DEBUG_BACKTRACE_LEN 256
762 int ccl_backtrace_table
[CCL_BACKTRACE_TABLE
];
763 int ccl_backtrace_idx
;
766 struct ccl_prog_stack
768 Lisp_Object
*ccl_prog
; /* Pointer to an array of CCL code. */
769 int ic
; /* Instruction Counter. */
772 /* For the moment, we only support depth 256 of stack. */
773 static struct ccl_prog_stack ccl_prog_stack_struct
[256];
776 ccl_driver (ccl
, source
, destination
, src_bytes
, dst_bytes
, consumed
)
777 struct ccl_program
*ccl
;
778 unsigned char *source
, *destination
;
779 int src_bytes
, dst_bytes
;
782 register int *reg
= ccl
->reg
;
783 register int ic
= ccl
->ic
;
784 register int code
, field1
, field2
;
785 register Lisp_Object
*ccl_prog
= ccl
->prog
;
786 unsigned char *src
= source
, *src_end
= src
+ src_bytes
;
787 unsigned char *dst
= destination
, *dst_end
= dst
+ dst_bytes
;
790 int stack_idx
= ccl
->stack_idx
;
791 /* Instruction counter of the current CCL code. */
794 if (ic
>= ccl
->eof_ic
)
795 ic
= CCL_HEADER_MAIN
;
797 if (ccl
->buf_magnification
==0) /* We can't produce any bytes. */
801 ccl_backtrace_idx
= 0;
808 ccl_backtrace_table
[ccl_backtrace_idx
++] = ic
;
809 if (ccl_backtrace_idx
>= CCL_DEBUG_BACKTRACE_LEN
)
810 ccl_backtrace_idx
= 0;
811 ccl_backtrace_table
[ccl_backtrace_idx
] = 0;
814 if (!NILP (Vquit_flag
) && NILP (Vinhibit_quit
))
816 /* We can't just signal Qquit, instead break the loop as if
817 the whole data is processed. Don't reset Vquit_flag, it
818 must be handled later at a safer place. */
820 src
= source
+ src_bytes
;
821 ccl
->status
= CCL_STAT_QUIT
;
826 code
= XINT (ccl_prog
[ic
]); ic
++;
828 field2
= (code
& 0xFF) >> 5;
831 #define RRR (field1 & 7)
832 #define Rrr ((field1 >> 3) & 7)
834 #define EXCMD (field1 >> 6)
838 case CCL_SetRegister
: /* 00000000000000000RRRrrrXXXXX */
842 case CCL_SetShortConst
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
846 case CCL_SetConst
: /* 00000000000000000000rrrXXXXX */
847 reg
[rrr
] = XINT (ccl_prog
[ic
]);
851 case CCL_SetArray
: /* CCCCCCCCCCCCCCCCCCCCRRRrrrXXXXX */
854 if ((unsigned int) i
< j
)
855 reg
[rrr
] = XINT (ccl_prog
[ic
+ i
]);
859 case CCL_Jump
: /* A--D--D--R--E--S--S-000XXXXX */
863 case CCL_JumpCond
: /* A--D--D--R--E--S--S-rrrXXXXX */
868 case CCL_WriteRegisterJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
874 case CCL_WriteRegisterReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
878 CCL_READ_CHAR (reg
[rrr
]);
882 case CCL_WriteConstJump
: /* A--D--D--R--E--S--S-000XXXXX */
883 i
= XINT (ccl_prog
[ic
]);
888 case CCL_WriteConstReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
889 i
= XINT (ccl_prog
[ic
]);
892 CCL_READ_CHAR (reg
[rrr
]);
896 case CCL_WriteStringJump
: /* A--D--D--R--E--S--S-000XXXXX */
897 j
= XINT (ccl_prog
[ic
]);
899 CCL_WRITE_STRING (j
);
903 case CCL_WriteArrayReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
905 j
= XINT (ccl_prog
[ic
]);
906 if ((unsigned int) i
< j
)
908 i
= XINT (ccl_prog
[ic
+ 1 + i
]);
912 CCL_READ_CHAR (reg
[rrr
]);
913 ic
+= ADDR
- (j
+ 2);
916 case CCL_ReadJump
: /* A--D--D--R--E--S--S-rrrYYYYY */
917 CCL_READ_CHAR (reg
[rrr
]);
921 case CCL_ReadBranch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
922 CCL_READ_CHAR (reg
[rrr
]);
923 /* fall through ... */
924 case CCL_Branch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
925 if ((unsigned int) reg
[rrr
] < field1
)
926 ic
+= XINT (ccl_prog
[ic
+ reg
[rrr
]]);
928 ic
+= XINT (ccl_prog
[ic
+ field1
]);
931 case CCL_ReadRegister
: /* CCCCCCCCCCCCCCCCCCCCrrXXXXX */
934 CCL_READ_CHAR (reg
[rrr
]);
936 code
= XINT (ccl_prog
[ic
]); ic
++;
938 field2
= (code
& 0xFF) >> 5;
942 case CCL_WriteExprConst
: /* 1:00000OPERATION000RRR000XXXXX */
945 j
= XINT (ccl_prog
[ic
]);
947 jump_address
= ic
+ 1;
950 case CCL_WriteRegister
: /* CCCCCCCCCCCCCCCCCCCrrrXXXXX */
956 code
= XINT (ccl_prog
[ic
]); ic
++;
958 field2
= (code
& 0xFF) >> 5;
962 case CCL_WriteExprRegister
: /* 1:00000OPERATIONRrrRRR000XXXXX */
970 case CCL_Call
: /* 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX */
975 /* If FFF is nonzero, the CCL program ID is in the
979 prog_id
= XINT (ccl_prog
[ic
]);
987 || prog_id
>= XVECTOR (Vccl_program_table
)->size
988 || (slot
= XVECTOR (Vccl_program_table
)->contents
[prog_id
],
990 || !VECTORP (XVECTOR (slot
)->contents
[1]))
994 ccl_prog
= ccl_prog_stack_struct
[0].ccl_prog
;
995 ic
= ccl_prog_stack_struct
[0].ic
;
1000 ccl_prog_stack_struct
[stack_idx
].ccl_prog
= ccl_prog
;
1001 ccl_prog_stack_struct
[stack_idx
].ic
= ic
;
1003 ccl_prog
= XVECTOR (XVECTOR (slot
)->contents
[1])->contents
;
1004 ic
= CCL_HEADER_MAIN
;
1008 case CCL_WriteConstString
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
1010 CCL_WRITE_CHAR (field1
);
1013 CCL_WRITE_STRING (field1
);
1014 ic
+= (field1
+ 2) / 3;
1018 case CCL_WriteArray
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
1020 if ((unsigned int) i
< field1
)
1022 j
= XINT (ccl_prog
[ic
+ i
]);
1028 case CCL_End
: /* 0000000000000000000000XXXXX */
1032 ccl_prog
= ccl_prog_stack_struct
[stack_idx
].ccl_prog
;
1033 ic
= ccl_prog_stack_struct
[stack_idx
].ic
;
1038 /* ccl->ic should points to this command code again to
1039 suppress further processing. */
1043 case CCL_ExprSelfConst
: /* 00000OPERATION000000rrrXXXXX */
1044 i
= XINT (ccl_prog
[ic
]);
1049 case CCL_ExprSelfReg
: /* 00000OPERATION000RRRrrrXXXXX */
1056 case CCL_PLUS
: reg
[rrr
] += i
; break;
1057 case CCL_MINUS
: reg
[rrr
] -= i
; break;
1058 case CCL_MUL
: reg
[rrr
] *= i
; break;
1059 case CCL_DIV
: reg
[rrr
] /= i
; break;
1060 case CCL_MOD
: reg
[rrr
] %= i
; break;
1061 case CCL_AND
: reg
[rrr
] &= i
; break;
1062 case CCL_OR
: reg
[rrr
] |= i
; break;
1063 case CCL_XOR
: reg
[rrr
] ^= i
; break;
1064 case CCL_LSH
: reg
[rrr
] <<= i
; break;
1065 case CCL_RSH
: reg
[rrr
] >>= i
; break;
1066 case CCL_LSH8
: reg
[rrr
] <<= 8; reg
[rrr
] |= i
; break;
1067 case CCL_RSH8
: reg
[7] = reg
[rrr
] & 0xFF; reg
[rrr
] >>= 8; break;
1068 case CCL_DIVMOD
: reg
[7] = reg
[rrr
] % i
; reg
[rrr
] /= i
; break;
1069 case CCL_LS
: reg
[rrr
] = reg
[rrr
] < i
; break;
1070 case CCL_GT
: reg
[rrr
] = reg
[rrr
] > i
; break;
1071 case CCL_EQ
: reg
[rrr
] = reg
[rrr
] == i
; break;
1072 case CCL_LE
: reg
[rrr
] = reg
[rrr
] <= i
; break;
1073 case CCL_GE
: reg
[rrr
] = reg
[rrr
] >= i
; break;
1074 case CCL_NE
: reg
[rrr
] = reg
[rrr
] != i
; break;
1075 default: CCL_INVALID_CMD
;
1079 case CCL_SetExprConst
: /* 00000OPERATION000RRRrrrXXXXX */
1081 j
= XINT (ccl_prog
[ic
]);
1083 jump_address
= ++ic
;
1086 case CCL_SetExprReg
: /* 00000OPERATIONRrrRRRrrrXXXXX */
1093 case CCL_ReadJumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1094 CCL_READ_CHAR (reg
[rrr
]);
1095 case CCL_JumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1097 op
= XINT (ccl_prog
[ic
]);
1098 jump_address
= ic
++ + ADDR
;
1099 j
= XINT (ccl_prog
[ic
]);
1104 case CCL_ReadJumpCondExprReg
: /* A--D--D--R--E--S--S-rrrXXXXX */
1105 CCL_READ_CHAR (reg
[rrr
]);
1106 case CCL_JumpCondExprReg
:
1108 op
= XINT (ccl_prog
[ic
]);
1109 jump_address
= ic
++ + ADDR
;
1110 j
= reg
[XINT (ccl_prog
[ic
])];
1117 case CCL_PLUS
: reg
[rrr
] = i
+ j
; break;
1118 case CCL_MINUS
: reg
[rrr
] = i
- j
; break;
1119 case CCL_MUL
: reg
[rrr
] = i
* j
; break;
1120 case CCL_DIV
: reg
[rrr
] = i
/ j
; break;
1121 case CCL_MOD
: reg
[rrr
] = i
% j
; break;
1122 case CCL_AND
: reg
[rrr
] = i
& j
; break;
1123 case CCL_OR
: reg
[rrr
] = i
| j
; break;
1124 case CCL_XOR
: reg
[rrr
] = i
^ j
;; break;
1125 case CCL_LSH
: reg
[rrr
] = i
<< j
; break;
1126 case CCL_RSH
: reg
[rrr
] = i
>> j
; break;
1127 case CCL_LSH8
: reg
[rrr
] = (i
<< 8) | j
; break;
1128 case CCL_RSH8
: reg
[rrr
] = i
>> 8; reg
[7] = i
& 0xFF; break;
1129 case CCL_DIVMOD
: reg
[rrr
] = i
/ j
; reg
[7] = i
% j
; break;
1130 case CCL_LS
: reg
[rrr
] = i
< j
; break;
1131 case CCL_GT
: reg
[rrr
] = i
> j
; break;
1132 case CCL_EQ
: reg
[rrr
] = i
== j
; break;
1133 case CCL_LE
: reg
[rrr
] = i
<= j
; break;
1134 case CCL_GE
: reg
[rrr
] = i
>= j
; break;
1135 case CCL_NE
: reg
[rrr
] = i
!= j
; break;
1136 case CCL_DECODE_SJIS
: DECODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1137 case CCL_ENCODE_SJIS
: ENCODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1138 default: CCL_INVALID_CMD
;
1141 if (code
== CCL_WriteExprConst
|| code
== CCL_WriteExprRegister
)
1154 case CCL_ReadMultibyteChar2
:
1162 goto ccl_read_multibyte_character_suspend
;
1170 reg
[RRR
] = CHARSET_ASCII
;
1172 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION1
)
1175 goto ccl_read_multibyte_character_suspend
;
1177 reg
[rrr
] = (*src
++ & 0x7F);
1179 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION2
)
1181 if ((src
+ 1) >= src_end
)
1182 goto ccl_read_multibyte_character_suspend
;
1184 i
= (*src
++ & 0x7F);
1185 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1188 else if ((i
== LEADING_CODE_PRIVATE_11
)
1189 || (i
== LEADING_CODE_PRIVATE_12
))
1191 if ((src
+ 1) >= src_end
)
1192 goto ccl_read_multibyte_character_suspend
;
1194 reg
[rrr
] = (*src
++ & 0x7F);
1196 else if ((i
== LEADING_CODE_PRIVATE_21
)
1197 || (i
== LEADING_CODE_PRIVATE_22
))
1199 if ((src
+ 2) >= src_end
)
1200 goto ccl_read_multibyte_character_suspend
;
1202 i
= (*src
++ & 0x7F);
1203 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1206 else if (i
== LEADING_CODE_8_BIT_CONTROL
)
1209 goto ccl_read_multibyte_character_suspend
;
1210 reg
[RRR
] = CHARSET_8_BIT_CONTROL
;
1211 reg
[rrr
] = (*src
++ - 0x20);
1215 reg
[RRR
] = CHARSET_8_BIT_GRAPHIC
;
1220 /* INVALID CODE. Return a single byte character. */
1221 reg
[RRR
] = CHARSET_ASCII
;
1228 ccl_read_multibyte_character_suspend
:
1230 if (ccl
->last_block
)
1236 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC
);
1240 case CCL_WriteMultibyteChar2
:
1241 i
= reg
[RRR
]; /* charset */
1242 if (i
== CHARSET_ASCII
1243 || i
== CHARSET_8_BIT_CONTROL
1244 || i
== CHARSET_8_BIT_GRAPHIC
)
1245 i
= reg
[rrr
] & 0xFF;
1246 else if (CHARSET_DIMENSION (i
) == 1)
1247 i
= ((i
- 0x70) << 7) | (reg
[rrr
] & 0x7F);
1248 else if (i
< MIN_CHARSET_PRIVATE_DIMENSION2
)
1249 i
= ((i
- 0x8F) << 14) | reg
[rrr
];
1251 i
= ((i
- 0xE0) << 14) | reg
[rrr
];
1257 case CCL_TranslateCharacter
:
1258 CCL_MAKE_CHAR (reg
[RRR
], reg
[rrr
], i
);
1259 op
= translate_char (GET_TRANSLATION_TABLE (reg
[Rrr
]),
1261 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1268 case CCL_TranslateCharacterConstTbl
:
1269 op
= XINT (ccl_prog
[ic
]); /* table */
1271 CCL_MAKE_CHAR (reg
[RRR
], reg
[rrr
], i
);
1272 op
= translate_char (GET_TRANSLATION_TABLE (op
), i
, -1, 0, 0);
1273 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1280 case CCL_IterateMultipleMap
:
1282 Lisp_Object map
, content
, attrib
, value
;
1283 int point
, size
, fin_ic
;
1285 j
= XINT (ccl_prog
[ic
++]); /* number of maps. */
1288 if ((j
> reg
[RRR
]) && (j
>= 0))
1303 size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1304 point
= XINT (ccl_prog
[ic
++]);
1305 if (point
>= size
) continue;
1307 XVECTOR (Vcode_conversion_map_vector
)->contents
[point
];
1309 /* Check map varidity. */
1310 if (!CONSP (map
)) continue;
1312 if (!VECTORP (map
)) continue;
1313 size
= XVECTOR (map
)->size
;
1314 if (size
<= 1) continue;
1316 content
= XVECTOR (map
)->contents
[0];
1319 [STARTPOINT VAL1 VAL2 ...] or
1320 [t ELELMENT STARTPOINT ENDPOINT] */
1321 if (NUMBERP (content
))
1323 point
= XUINT (content
);
1324 point
= op
- point
+ 1;
1325 if (!((point
>= 1) && (point
< size
))) continue;
1326 content
= XVECTOR (map
)->contents
[point
];
1328 else if (EQ (content
, Qt
))
1330 if (size
!= 4) continue;
1331 if ((op
>= XUINT (XVECTOR (map
)->contents
[2]))
1332 && (op
< XUINT (XVECTOR (map
)->contents
[3])))
1333 content
= XVECTOR (map
)->contents
[1];
1342 else if (NUMBERP (content
))
1345 reg
[rrr
] = XINT(content
);
1348 else if (EQ (content
, Qt
) || EQ (content
, Qlambda
))
1353 else if (CONSP (content
))
1355 attrib
= XCAR (content
);
1356 value
= XCDR (content
);
1357 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1360 reg
[rrr
] = XUINT (value
);
1370 case CCL_MapMultiple
:
1372 Lisp_Object map
, content
, attrib
, value
;
1373 int point
, size
, map_vector_size
;
1374 int map_set_rest_length
, fin_ic
;
1376 map_set_rest_length
=
1377 XINT (ccl_prog
[ic
++]); /* number of maps and separators. */
1378 fin_ic
= ic
+ map_set_rest_length
;
1379 if ((map_set_rest_length
> reg
[RRR
]) && (reg
[RRR
] >= 0))
1383 map_set_rest_length
-= i
;
1391 mapping_stack_pointer
= mapping_stack
;
1393 PUSH_MAPPING_STACK (0, op
);
1395 map_vector_size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1396 for (;map_set_rest_length
> 0;i
++, map_set_rest_length
--)
1398 point
= XINT(ccl_prog
[ic
++]);
1402 if (mapping_stack_pointer
1403 >= &mapping_stack
[MAX_MAP_SET_LEVEL
])
1407 PUSH_MAPPING_STACK (map_set_rest_length
- point
,
1409 map_set_rest_length
= point
+ 1;
1414 if (point
>= map_vector_size
) continue;
1415 map
= (XVECTOR (Vcode_conversion_map_vector
)
1418 /* Check map varidity. */
1419 if (!CONSP (map
)) continue;
1421 if (!VECTORP (map
)) continue;
1422 size
= XVECTOR (map
)->size
;
1423 if (size
<= 1) continue;
1425 content
= XVECTOR (map
)->contents
[0];
1428 [STARTPOINT VAL1 VAL2 ...] or
1429 [t ELEMENT STARTPOINT ENDPOINT] */
1430 if (NUMBERP (content
))
1432 point
= XUINT (content
);
1433 point
= op
- point
+ 1;
1434 if (!((point
>= 1) && (point
< size
))) continue;
1435 content
= XVECTOR (map
)->contents
[point
];
1437 else if (EQ (content
, Qt
))
1439 if (size
!= 4) continue;
1440 if ((op
>= XUINT (XVECTOR (map
)->contents
[2])) &&
1441 (op
< XUINT (XVECTOR (map
)->contents
[3])))
1442 content
= XVECTOR (map
)->contents
[1];
1451 else if (NUMBERP (content
))
1453 op
= XINT (content
);
1455 i
+= map_set_rest_length
;
1456 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1458 else if (CONSP (content
))
1460 attrib
= XCAR (content
);
1461 value
= XCDR (content
);
1462 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1466 i
+= map_set_rest_length
;
1467 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1469 else if (EQ (content
, Qt
))
1473 i
+= map_set_rest_length
;
1474 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1476 else if (EQ (content
, Qlambda
))
1491 Lisp_Object map
, attrib
, value
, content
;
1493 j
= XINT (ccl_prog
[ic
++]); /* map_id */
1495 if (j
>= XVECTOR (Vcode_conversion_map_vector
)->size
)
1500 map
= XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
1512 size
= XVECTOR (map
)->size
;
1513 point
= XUINT (XVECTOR (map
)->contents
[0]);
1514 point
= op
- point
+ 1;
1517 (!((point
>= 1) && (point
< size
))))
1522 content
= XVECTOR (map
)->contents
[point
];
1525 else if (NUMBERP (content
))
1526 reg
[rrr
] = XINT (content
);
1527 else if (EQ (content
, Qt
));
1528 else if (CONSP (content
))
1530 attrib
= XCAR (content
);
1531 value
= XCDR (content
);
1532 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1534 reg
[rrr
] = XUINT(value
);
1556 /* We can insert an error message only if DESTINATION is
1557 specified and we still have a room to store the message
1565 switch (ccl
->status
)
1567 case CCL_STAT_INVALID_CMD
:
1568 sprintf(msg
, "\nCCL: Invalid command %x (ccl_code = %x) at %d.",
1569 code
& 0x1F, code
, this_ic
);
1572 int i
= ccl_backtrace_idx
- 1;
1575 msglen
= strlen (msg
);
1576 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1578 bcopy (msg
, dst
, msglen
);
1582 for (j
= 0; j
< CCL_DEBUG_BACKTRACE_LEN
; j
++, i
--)
1584 if (i
< 0) i
= CCL_DEBUG_BACKTRACE_LEN
- 1;
1585 if (ccl_backtrace_table
[i
] == 0)
1587 sprintf(msg
, " %d", ccl_backtrace_table
[i
]);
1588 msglen
= strlen (msg
);
1589 if (dst
+ msglen
> (dst_bytes
? dst_end
: src
))
1591 bcopy (msg
, dst
, msglen
);
1600 sprintf(msg
, "\nCCL: Quited.");
1604 sprintf(msg
, "\nCCL: Unknown error type (%d).", ccl
->status
);
1607 msglen
= strlen (msg
);
1608 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1610 bcopy (msg
, dst
, msglen
);
1617 ccl
->stack_idx
= stack_idx
;
1618 ccl
->prog
= ccl_prog
;
1619 if (consumed
) *consumed
= src
- source
;
1620 return (dst
? dst
- destination
: 0);
1623 /* Resolve symbols in the specified CCL code (Lisp vector). This
1624 function converts symbols of code conversion maps and character
1625 translation tables embeded in the CCL code into their ID numbers.
1627 The return value is a vector (CCL itself or a new vector in which
1628 all symbols are resolved), Qt if resolving of some symbol failed,
1629 or nil if CCL contains invalid data. */
1632 resolve_symbol_ccl_program (ccl
)
1635 int i
, veclen
, unresolved
= 0;
1636 Lisp_Object result
, contents
, val
;
1639 veclen
= XVECTOR (result
)->size
;
1641 for (i
= 0; i
< veclen
; i
++)
1643 contents
= XVECTOR (result
)->contents
[i
];
1644 if (INTEGERP (contents
))
1646 else if (CONSP (contents
)
1647 && SYMBOLP (XCAR (contents
))
1648 && SYMBOLP (XCDR (contents
)))
1650 /* This is the new style for embedding symbols. The form is
1651 (SYMBOL . PROPERTY). (get SYMBOL PROPERTY) should give
1654 if (EQ (result
, ccl
))
1655 result
= Fcopy_sequence (ccl
);
1657 val
= Fget (XCAR (contents
), XCDR (contents
));
1659 XVECTOR (result
)->contents
[i
] = val
;
1664 else if (SYMBOLP (contents
))
1666 /* This is the old style for embedding symbols. This style
1667 may lead to a bug if, for instance, a translation table
1668 and a code conversion map have the same name. */
1669 if (EQ (result
, ccl
))
1670 result
= Fcopy_sequence (ccl
);
1672 val
= Fget (contents
, Qtranslation_table_id
);
1674 XVECTOR (result
)->contents
[i
] = val
;
1677 val
= Fget (contents
, Qcode_conversion_map_id
);
1679 XVECTOR (result
)->contents
[i
] = val
;
1682 val
= Fget (contents
, Qccl_program_idx
);
1684 XVECTOR (result
)->contents
[i
] = val
;
1694 return (unresolved
? Qt
: result
);
1697 /* Return the compiled code (vector) of CCL program CCL_PROG.
1698 CCL_PROG is a name (symbol) of the program or already compiled
1699 code. If necessary, resolve symbols in the compiled code to index
1700 numbers. If we failed to get the compiled code or to resolve
1701 symbols, return Qnil. */
1704 ccl_get_compiled_code (ccl_prog
)
1705 Lisp_Object ccl_prog
;
1707 Lisp_Object val
, slot
;
1709 if (VECTORP (ccl_prog
))
1711 val
= resolve_symbol_ccl_program (ccl_prog
);
1712 return (VECTORP (val
) ? val
: Qnil
);
1714 if (!SYMBOLP (ccl_prog
))
1717 val
= Fget (ccl_prog
, Qccl_program_idx
);
1719 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1721 slot
= XVECTOR (Vccl_program_table
)->contents
[XINT (val
)];
1722 if (! VECTORP (slot
)
1723 || XVECTOR (slot
)->size
!= 3
1724 || ! VECTORP (XVECTOR (slot
)->contents
[1]))
1726 if (NILP (XVECTOR (slot
)->contents
[2]))
1728 val
= resolve_symbol_ccl_program (XVECTOR (slot
)->contents
[1]);
1729 if (! VECTORP (val
))
1731 XVECTOR (slot
)->contents
[1] = val
;
1732 XVECTOR (slot
)->contents
[2] = Qt
;
1734 return XVECTOR (slot
)->contents
[1];
1737 /* Setup fields of the structure pointed by CCL appropriately for the
1738 execution of CCL program CCL_PROG. CCL_PROG is the name (symbol)
1739 of the CCL program or the already compiled code (vector).
1740 Return 0 if we succeed this setup, else return -1.
1742 If CCL_PROG is nil, we just reset the structure pointed by CCL. */
1744 setup_ccl_program (ccl
, ccl_prog
)
1745 struct ccl_program
*ccl
;
1746 Lisp_Object ccl_prog
;
1750 if (! NILP (ccl_prog
))
1752 struct Lisp_Vector
*vp
;
1754 ccl_prog
= ccl_get_compiled_code (ccl_prog
);
1755 if (! VECTORP (ccl_prog
))
1757 vp
= XVECTOR (ccl_prog
);
1758 ccl
->size
= vp
->size
;
1759 ccl
->prog
= vp
->contents
;
1760 ccl
->eof_ic
= XINT (vp
->contents
[CCL_HEADER_EOF
]);
1761 ccl
->buf_magnification
= XINT (vp
->contents
[CCL_HEADER_BUF_MAG
]);
1763 ccl
->ic
= CCL_HEADER_MAIN
;
1764 for (i
= 0; i
< 8; i
++)
1766 ccl
->last_block
= 0;
1767 ccl
->private_state
= 0;
1770 ccl
->eol_type
= CODING_EOL_LF
;
1776 DEFUN ("ccl-program-p", Fccl_program_p
, Sccl_program_p
, 1, 1, 0,
1777 "Return t if OBJECT is a CCL program name or a compiled CCL program code.")
1783 if (VECTORP (object
))
1785 val
= resolve_symbol_ccl_program (object
);
1786 return (VECTORP (val
) ? Qt
: Qnil
);
1788 if (!SYMBOLP (object
))
1791 val
= Fget (object
, Qccl_program_idx
);
1792 return ((! NATNUMP (val
)
1793 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1797 DEFUN ("ccl-execute", Fccl_execute
, Sccl_execute
, 2, 2, 0,
1798 "Execute CCL-PROGRAM with registers initialized by REGISTERS.\n\
1800 CCL-PROGRAM is a CCL program name (symbol)\n\
1801 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
1802 in this case, the overhead of the execution is bigger than the former case).\n\
1803 No I/O commands should appear in CCL-PROGRAM.\n\
1805 REGISTERS is a vector of [R0 R1 ... R7] where RN is an initial value\n\
1808 As side effect, each element of REGISTERS holds the value of\n\
1809 corresponding register after the execution.")
1811 Lisp_Object ccl_prog
, reg
;
1813 struct ccl_program ccl
;
1816 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
1817 error ("Invalid CCL program");
1819 CHECK_VECTOR (reg
, 1);
1820 if (XVECTOR (reg
)->size
!= 8)
1821 error ("Length of vector REGISTERS is not 8");
1823 for (i
= 0; i
< 8; i
++)
1824 ccl
.reg
[i
] = (INTEGERP (XVECTOR (reg
)->contents
[i
])
1825 ? XINT (XVECTOR (reg
)->contents
[i
])
1828 ccl_driver (&ccl
, (char *)0, (char *)0, 0, 0, (int *)0);
1830 if (ccl
.status
!= CCL_STAT_SUCCESS
)
1831 error ("Error in CCL program at %dth code", ccl
.ic
);
1833 for (i
= 0; i
< 8; i
++)
1834 XSETINT (XVECTOR (reg
)->contents
[i
], ccl
.reg
[i
]);
1838 DEFUN ("ccl-execute-on-string", Fccl_execute_on_string
, Sccl_execute_on_string
,
1840 "Execute CCL-PROGRAM with initial STATUS on STRING.\n\
1842 CCL-PROGRAM is a symbol registered by register-ccl-program,\n\
1843 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
1844 in this case, the execution is slower).\n\
1846 Read buffer is set to STRING, and write buffer is allocated automatically.\n\
1848 STATUS is a vector of [R0 R1 ... R7 IC], where\n\
1849 R0..R7 are initial values of corresponding registers,\n\
1850 IC is the instruction counter specifying from where to start the program.\n\
1851 If R0..R7 are nil, they are initialized to 0.\n\
1852 If IC is nil, it is initialized to head of the CCL program.\n\
1854 If optional 4th arg CONTINUE is non-nil, keep IC on read operation\n\
1855 when read buffer is exausted, else, IC is always set to the end of\n\
1856 CCL-PROGRAM on exit.\n\
1858 It returns the contents of write buffer as a string,\n\
1859 and as side effect, STATUS is updated.\n\
1860 If the optional 5th arg UNIBYTE-P is non-nil, the returned string\n\
1861 is a unibyte string. By default it is a multibyte string.")
1862 (ccl_prog
, status
, str
, contin
, unibyte_p
)
1863 Lisp_Object ccl_prog
, status
, str
, contin
, unibyte_p
;
1866 struct ccl_program ccl
;
1870 struct gcpro gcpro1
, gcpro2
;
1872 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
1873 error ("Invalid CCL program");
1875 CHECK_VECTOR (status
, 1);
1876 if (XVECTOR (status
)->size
!= 9)
1877 error ("Length of vector STATUS is not 9");
1878 CHECK_STRING (str
, 2);
1880 GCPRO2 (status
, str
);
1882 for (i
= 0; i
< 8; i
++)
1884 if (NILP (XVECTOR (status
)->contents
[i
]))
1885 XSETINT (XVECTOR (status
)->contents
[i
], 0);
1886 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
1887 ccl
.reg
[i
] = XINT (XVECTOR (status
)->contents
[i
]);
1889 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
1891 i
= XFASTINT (XVECTOR (status
)->contents
[8]);
1892 if (ccl
.ic
< i
&& i
< ccl
.size
)
1895 outbufsize
= STRING_BYTES (XSTRING (str
)) * ccl
.buf_magnification
+ 256;
1896 outbuf
= (char *) xmalloc (outbufsize
);
1897 ccl
.last_block
= NILP (contin
);
1898 produced
= ccl_driver (&ccl
, XSTRING (str
)->data
, outbuf
,
1899 STRING_BYTES (XSTRING (str
)), outbufsize
, (int *)0);
1900 for (i
= 0; i
< 8; i
++)
1901 XSET (XVECTOR (status
)->contents
[i
], Lisp_Int
, ccl
.reg
[i
]);
1902 XSETINT (XVECTOR (status
)->contents
[8], ccl
.ic
);
1905 if (NILP (unibyte_p
))
1906 val
= make_string (outbuf
, produced
);
1908 val
= make_unibyte_string (outbuf
, produced
);
1911 if (ccl
.status
!= CCL_STAT_SUCCESS
1912 && ccl
.status
!= CCL_STAT_SUSPEND_BY_SRC
1913 && ccl
.status
!= CCL_STAT_SUSPEND_BY_DST
)
1914 error ("Error in CCL program at %dth code", ccl
.ic
);
1919 DEFUN ("register-ccl-program", Fregister_ccl_program
, Sregister_ccl_program
,
1921 "Register CCL program CCL_PROG as NAME in `ccl-program-table'.\n\
1922 CCL_PROG should be a compiled CCL program (vector), or nil.\n\
1923 If it is nil, just reserve NAME as a CCL program name.\n\
1924 Return index number of the registered CCL program.")
1926 Lisp_Object name
, ccl_prog
;
1928 int len
= XVECTOR (Vccl_program_table
)->size
;
1930 Lisp_Object resolved
;
1932 CHECK_SYMBOL (name
, 0);
1934 if (!NILP (ccl_prog
))
1936 CHECK_VECTOR (ccl_prog
, 1);
1937 resolved
= resolve_symbol_ccl_program (ccl_prog
);
1938 if (! NILP (resolved
))
1940 ccl_prog
= resolved
;
1945 for (idx
= 0; idx
< len
; idx
++)
1949 slot
= XVECTOR (Vccl_program_table
)->contents
[idx
];
1950 if (!VECTORP (slot
))
1951 /* This is the first unsed slot. Register NAME here. */
1954 if (EQ (name
, XVECTOR (slot
)->contents
[0]))
1956 /* Update this slot. */
1957 XVECTOR (slot
)->contents
[1] = ccl_prog
;
1958 XVECTOR (slot
)->contents
[2] = resolved
;
1959 return make_number (idx
);
1965 /* Extend the table. */
1966 Lisp_Object new_table
;
1969 new_table
= Fmake_vector (make_number (len
* 2), Qnil
);
1970 for (j
= 0; j
< len
; j
++)
1971 XVECTOR (new_table
)->contents
[j
]
1972 = XVECTOR (Vccl_program_table
)->contents
[j
];
1973 Vccl_program_table
= new_table
;
1979 elt
= Fmake_vector (make_number (3), Qnil
);
1980 XVECTOR (elt
)->contents
[0] = name
;
1981 XVECTOR (elt
)->contents
[1] = ccl_prog
;
1982 XVECTOR (elt
)->contents
[2] = resolved
;
1983 XVECTOR (Vccl_program_table
)->contents
[idx
] = elt
;
1986 Fput (name
, Qccl_program_idx
, make_number (idx
));
1987 return make_number (idx
);
1990 /* Register code conversion map.
1991 A code conversion map consists of numbers, Qt, Qnil, and Qlambda.
1992 The first element is start code point.
1993 The rest elements are mapped numbers.
1994 Symbol t means to map to an original number before mapping.
1995 Symbol nil means that the corresponding element is empty.
1996 Symbol lambda menas to terminate mapping here.
1999 DEFUN ("register-code-conversion-map", Fregister_code_conversion_map
,
2000 Sregister_code_conversion_map
,
2002 "Register SYMBOL as code conversion map MAP.\n\
2003 Return index number of the registered map.")
2005 Lisp_Object symbol
, map
;
2007 int len
= XVECTOR (Vcode_conversion_map_vector
)->size
;
2011 CHECK_SYMBOL (symbol
, 0);
2012 CHECK_VECTOR (map
, 1);
2014 for (i
= 0; i
< len
; i
++)
2016 Lisp_Object slot
= XVECTOR (Vcode_conversion_map_vector
)->contents
[i
];
2021 if (EQ (symbol
, XCAR (slot
)))
2023 index
= make_number (i
);
2025 Fput (symbol
, Qcode_conversion_map
, map
);
2026 Fput (symbol
, Qcode_conversion_map_id
, index
);
2033 Lisp_Object new_vector
= Fmake_vector (make_number (len
* 2), Qnil
);
2036 for (j
= 0; j
< len
; j
++)
2037 XVECTOR (new_vector
)->contents
[j
]
2038 = XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
2039 Vcode_conversion_map_vector
= new_vector
;
2042 index
= make_number (i
);
2043 Fput (symbol
, Qcode_conversion_map
, map
);
2044 Fput (symbol
, Qcode_conversion_map_id
, index
);
2045 XVECTOR (Vcode_conversion_map_vector
)->contents
[i
] = Fcons (symbol
, map
);
2053 staticpro (&Vccl_program_table
);
2054 Vccl_program_table
= Fmake_vector (make_number (32), Qnil
);
2056 Qccl_program
= intern ("ccl-program");
2057 staticpro (&Qccl_program
);
2059 Qccl_program_idx
= intern ("ccl-program-idx");
2060 staticpro (&Qccl_program_idx
);
2062 Qcode_conversion_map
= intern ("code-conversion-map");
2063 staticpro (&Qcode_conversion_map
);
2065 Qcode_conversion_map_id
= intern ("code-conversion-map-id");
2066 staticpro (&Qcode_conversion_map_id
);
2068 DEFVAR_LISP ("code-conversion-map-vector", &Vcode_conversion_map_vector
,
2069 "Vector of code conversion maps.");
2070 Vcode_conversion_map_vector
= Fmake_vector (make_number (16), Qnil
);
2072 DEFVAR_LISP ("font-ccl-encoder-alist", &Vfont_ccl_encoder_alist
,
2073 "Alist of fontname patterns vs corresponding CCL program.\n\
2074 Each element looks like (REGEXP . CCL-CODE),\n\
2075 where CCL-CODE is a compiled CCL program.\n\
2076 When a font whose name matches REGEXP is used for displaying a character,\n\
2077 CCL-CODE is executed to calculate the code point in the font\n\
2078 from the charset number and position code(s) of the character which are set\n\
2079 in CCL registers R0, R1, and R2 before the execution.\n\
2080 The code point in the font is set in CCL registers R1 and R2\n\
2081 when the execution terminated.\n\
2082 If the font is single-byte font, the register R2 is not used.");
2083 Vfont_ccl_encoder_alist
= Qnil
;
2085 defsubr (&Sccl_program_p
);
2086 defsubr (&Sccl_execute
);
2087 defsubr (&Sccl_execute_on_string
);
2088 defsubr (&Sregister_ccl_program
);
2089 defsubr (&Sregister_code_conversion_map
);