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) \
675 unsigned char work[4], *str; \
676 int len = CHAR_STRING (ch, work, str); \
677 if (dst + len <= (dst_bytes ? dst_end : src)) \
679 while (len--) *dst++ = *str++; \
682 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
686 /* Write a string at ccl_prog[IC] of length LEN to the current output
688 #define CCL_WRITE_STRING(len) \
692 else if (dst + len <= (dst_bytes ? dst_end : src)) \
693 for (i = 0; i < len; i++) \
694 *dst++ = ((XFASTINT (ccl_prog[ic + (i / 3)])) \
695 >> ((2 - (i % 3)) * 8)) & 0xFF; \
697 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_DST); \
700 /* Read one byte from the current input buffer into Rth register. */
701 #define CCL_READ_CHAR(r) \
705 else if (src < src_end) \
707 else if (ccl->last_block) \
713 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC); \
717 /* Execute CCL code on SRC_BYTES length text at SOURCE. The resulting
718 text goes to a place pointed by DESTINATION, the length of which
719 should not exceed DST_BYTES. The bytes actually processed is
720 returned as *CONSUMED. The return value is the length of the
721 resulting text. As a side effect, the contents of CCL registers
722 are updated. If SOURCE or DESTINATION is NULL, only operations on
723 registers are permitted. */
726 #define CCL_DEBUG_BACKTRACE_LEN 256
727 int ccl_backtrace_table
[CCL_BACKTRACE_TABLE
];
728 int ccl_backtrace_idx
;
731 struct ccl_prog_stack
733 Lisp_Object
*ccl_prog
; /* Pointer to an array of CCL code. */
734 int ic
; /* Instruction Counter. */
737 /* For the moment, we only support depth 256 of stack. */
738 static struct ccl_prog_stack ccl_prog_stack_struct
[256];
741 ccl_driver (ccl
, source
, destination
, src_bytes
, dst_bytes
, consumed
)
742 struct ccl_program
*ccl
;
743 unsigned char *source
, *destination
;
744 int src_bytes
, dst_bytes
;
747 register int *reg
= ccl
->reg
;
748 register int ic
= ccl
->ic
;
749 register int code
, field1
, field2
;
750 register Lisp_Object
*ccl_prog
= ccl
->prog
;
751 unsigned char *src
= source
, *src_end
= src
+ src_bytes
;
752 unsigned char *dst
= destination
, *dst_end
= dst
+ dst_bytes
;
755 int stack_idx
= ccl
->stack_idx
;
756 /* Instruction counter of the current CCL code. */
759 if (ic
>= ccl
->eof_ic
)
760 ic
= CCL_HEADER_MAIN
;
762 if (ccl
->buf_magnification
==0) /* We can't produce any bytes. */
766 ccl_backtrace_idx
= 0;
773 ccl_backtrace_table
[ccl_backtrace_idx
++] = ic
;
774 if (ccl_backtrace_idx
>= CCL_DEBUG_BACKTRACE_LEN
)
775 ccl_backtrace_idx
= 0;
776 ccl_backtrace_table
[ccl_backtrace_idx
] = 0;
779 if (!NILP (Vquit_flag
) && NILP (Vinhibit_quit
))
781 /* We can't just signal Qquit, instead break the loop as if
782 the whole data is processed. Don't reset Vquit_flag, it
783 must be handled later at a safer place. */
785 src
= source
+ src_bytes
;
786 ccl
->status
= CCL_STAT_QUIT
;
791 code
= XINT (ccl_prog
[ic
]); ic
++;
793 field2
= (code
& 0xFF) >> 5;
796 #define RRR (field1 & 7)
797 #define Rrr ((field1 >> 3) & 7)
799 #define EXCMD (field1 >> 6)
803 case CCL_SetRegister
: /* 00000000000000000RRRrrrXXXXX */
807 case CCL_SetShortConst
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
811 case CCL_SetConst
: /* 00000000000000000000rrrXXXXX */
812 reg
[rrr
] = XINT (ccl_prog
[ic
]);
816 case CCL_SetArray
: /* CCCCCCCCCCCCCCCCCCCCRRRrrrXXXXX */
819 if ((unsigned int) i
< j
)
820 reg
[rrr
] = XINT (ccl_prog
[ic
+ i
]);
824 case CCL_Jump
: /* A--D--D--R--E--S--S-000XXXXX */
828 case CCL_JumpCond
: /* A--D--D--R--E--S--S-rrrXXXXX */
833 case CCL_WriteRegisterJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
839 case CCL_WriteRegisterReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
843 CCL_READ_CHAR (reg
[rrr
]);
847 case CCL_WriteConstJump
: /* A--D--D--R--E--S--S-000XXXXX */
848 i
= XINT (ccl_prog
[ic
]);
853 case CCL_WriteConstReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
854 i
= XINT (ccl_prog
[ic
]);
857 CCL_READ_CHAR (reg
[rrr
]);
861 case CCL_WriteStringJump
: /* A--D--D--R--E--S--S-000XXXXX */
862 j
= XINT (ccl_prog
[ic
]);
864 CCL_WRITE_STRING (j
);
868 case CCL_WriteArrayReadJump
: /* A--D--D--R--E--S--S-rrrXXXXX */
870 j
= XINT (ccl_prog
[ic
]);
871 if ((unsigned int) i
< j
)
873 i
= XINT (ccl_prog
[ic
+ 1 + i
]);
877 CCL_READ_CHAR (reg
[rrr
]);
878 ic
+= ADDR
- (j
+ 2);
881 case CCL_ReadJump
: /* A--D--D--R--E--S--S-rrrYYYYY */
882 CCL_READ_CHAR (reg
[rrr
]);
886 case CCL_ReadBranch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
887 CCL_READ_CHAR (reg
[rrr
]);
888 /* fall through ... */
889 case CCL_Branch
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
890 if ((unsigned int) reg
[rrr
] < field1
)
891 ic
+= XINT (ccl_prog
[ic
+ reg
[rrr
]]);
893 ic
+= XINT (ccl_prog
[ic
+ field1
]);
896 case CCL_ReadRegister
: /* CCCCCCCCCCCCCCCCCCCCrrXXXXX */
899 CCL_READ_CHAR (reg
[rrr
]);
901 code
= XINT (ccl_prog
[ic
]); ic
++;
903 field2
= (code
& 0xFF) >> 5;
907 case CCL_WriteExprConst
: /* 1:00000OPERATION000RRR000XXXXX */
910 j
= XINT (ccl_prog
[ic
]);
915 case CCL_WriteRegister
: /* CCCCCCCCCCCCCCCCCCCrrrXXXXX */
921 code
= XINT (ccl_prog
[ic
]); ic
++;
923 field2
= (code
& 0xFF) >> 5;
927 case CCL_WriteExprRegister
: /* 1:00000OPERATIONRrrRRR000XXXXX */
934 case CCL_Call
: /* 1:CCCCCCCCCCCCCCCCCCCCFFFXXXXX */
939 /* If FFF is nonzero, the CCL program ID is in the
943 prog_id
= XINT (ccl_prog
[ic
]);
951 || prog_id
>= XVECTOR (Vccl_program_table
)->size
952 || (slot
= XVECTOR (Vccl_program_table
)->contents
[prog_id
],
954 || !VECTORP (XVECTOR (slot
)->contents
[1]))
958 ccl_prog
= ccl_prog_stack_struct
[0].ccl_prog
;
959 ic
= ccl_prog_stack_struct
[0].ic
;
964 ccl_prog_stack_struct
[stack_idx
].ccl_prog
= ccl_prog
;
965 ccl_prog_stack_struct
[stack_idx
].ic
= ic
;
967 ccl_prog
= XVECTOR (XVECTOR (slot
)->contents
[1])->contents
;
968 ic
= CCL_HEADER_MAIN
;
972 case CCL_WriteConstString
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
974 CCL_WRITE_CHAR (field1
);
977 CCL_WRITE_STRING (field1
);
978 ic
+= (field1
+ 2) / 3;
982 case CCL_WriteArray
: /* CCCCCCCCCCCCCCCCCCCCrrrXXXXX */
984 if ((unsigned int) i
< field1
)
986 j
= XINT (ccl_prog
[ic
+ i
]);
992 case CCL_End
: /* 0000000000000000000000XXXXX */
995 ccl_prog
= ccl_prog_stack_struct
[stack_idx
].ccl_prog
;
996 ic
= ccl_prog_stack_struct
[stack_idx
].ic
;
1001 /* ccl->ic should points to this command code again to
1002 suppress further processing. */
1006 case CCL_ExprSelfConst
: /* 00000OPERATION000000rrrXXXXX */
1007 i
= XINT (ccl_prog
[ic
]);
1012 case CCL_ExprSelfReg
: /* 00000OPERATION000RRRrrrXXXXX */
1019 case CCL_PLUS
: reg
[rrr
] += i
; break;
1020 case CCL_MINUS
: reg
[rrr
] -= i
; break;
1021 case CCL_MUL
: reg
[rrr
] *= i
; break;
1022 case CCL_DIV
: reg
[rrr
] /= i
; break;
1023 case CCL_MOD
: reg
[rrr
] %= i
; break;
1024 case CCL_AND
: reg
[rrr
] &= i
; break;
1025 case CCL_OR
: reg
[rrr
] |= i
; break;
1026 case CCL_XOR
: reg
[rrr
] ^= i
; break;
1027 case CCL_LSH
: reg
[rrr
] <<= i
; break;
1028 case CCL_RSH
: reg
[rrr
] >>= i
; break;
1029 case CCL_LSH8
: reg
[rrr
] <<= 8; reg
[rrr
] |= i
; break;
1030 case CCL_RSH8
: reg
[7] = reg
[rrr
] & 0xFF; reg
[rrr
] >>= 8; break;
1031 case CCL_DIVMOD
: reg
[7] = reg
[rrr
] % i
; reg
[rrr
] /= i
; break;
1032 case CCL_LS
: reg
[rrr
] = reg
[rrr
] < i
; break;
1033 case CCL_GT
: reg
[rrr
] = reg
[rrr
] > i
; break;
1034 case CCL_EQ
: reg
[rrr
] = reg
[rrr
] == i
; break;
1035 case CCL_LE
: reg
[rrr
] = reg
[rrr
] <= i
; break;
1036 case CCL_GE
: reg
[rrr
] = reg
[rrr
] >= i
; break;
1037 case CCL_NE
: reg
[rrr
] = reg
[rrr
] != i
; break;
1038 default: CCL_INVALID_CMD
;
1042 case CCL_SetExprConst
: /* 00000OPERATION000RRRrrrXXXXX */
1044 j
= XINT (ccl_prog
[ic
]);
1046 jump_address
= ++ic
;
1049 case CCL_SetExprReg
: /* 00000OPERATIONRrrRRRrrrXXXXX */
1056 case CCL_ReadJumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1057 CCL_READ_CHAR (reg
[rrr
]);
1058 case CCL_JumpCondExprConst
: /* A--D--D--R--E--S--S-rrrXXXXX */
1060 op
= XINT (ccl_prog
[ic
]);
1061 jump_address
= ic
++ + ADDR
;
1062 j
= XINT (ccl_prog
[ic
]);
1067 case CCL_ReadJumpCondExprReg
: /* A--D--D--R--E--S--S-rrrXXXXX */
1068 CCL_READ_CHAR (reg
[rrr
]);
1069 case CCL_JumpCondExprReg
:
1071 op
= XINT (ccl_prog
[ic
]);
1072 jump_address
= ic
++ + ADDR
;
1073 j
= reg
[XINT (ccl_prog
[ic
])];
1080 case CCL_PLUS
: reg
[rrr
] = i
+ j
; break;
1081 case CCL_MINUS
: reg
[rrr
] = i
- j
; break;
1082 case CCL_MUL
: reg
[rrr
] = i
* j
; break;
1083 case CCL_DIV
: reg
[rrr
] = i
/ j
; break;
1084 case CCL_MOD
: reg
[rrr
] = i
% j
; break;
1085 case CCL_AND
: reg
[rrr
] = i
& j
; break;
1086 case CCL_OR
: reg
[rrr
] = i
| j
; break;
1087 case CCL_XOR
: reg
[rrr
] = i
^ j
;; break;
1088 case CCL_LSH
: reg
[rrr
] = i
<< j
; break;
1089 case CCL_RSH
: reg
[rrr
] = i
>> j
; break;
1090 case CCL_LSH8
: reg
[rrr
] = (i
<< 8) | j
; break;
1091 case CCL_RSH8
: reg
[rrr
] = i
>> 8; reg
[7] = i
& 0xFF; break;
1092 case CCL_DIVMOD
: reg
[rrr
] = i
/ j
; reg
[7] = i
% j
; break;
1093 case CCL_LS
: reg
[rrr
] = i
< j
; break;
1094 case CCL_GT
: reg
[rrr
] = i
> j
; break;
1095 case CCL_EQ
: reg
[rrr
] = i
== j
; break;
1096 case CCL_LE
: reg
[rrr
] = i
<= j
; break;
1097 case CCL_GE
: reg
[rrr
] = i
>= j
; break;
1098 case CCL_NE
: reg
[rrr
] = i
!= j
; break;
1099 case CCL_DECODE_SJIS
: DECODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1100 case CCL_ENCODE_SJIS
: ENCODE_SJIS (i
, j
, reg
[rrr
], reg
[7]); break;
1101 default: CCL_INVALID_CMD
;
1104 if (code
== CCL_WriteExprConst
|| code
== CCL_WriteExprRegister
)
1116 case CCL_ReadMultibyteChar2
:
1124 goto ccl_read_multibyte_character_suspend
;
1128 if (i
== LEADING_CODE_COMPOSITION
)
1131 goto ccl_read_multibyte_character_suspend
;
1134 ccl
->private_state
= COMPOSING_WITH_RULE_HEAD
;
1138 ccl
->private_state
= COMPOSING_NO_RULE_HEAD
;
1142 if (ccl
->private_state
!= COMPOSING_NO
)
1144 /* composite character */
1146 ccl
->private_state
= COMPOSING_NO
;
1149 if (COMPOSING_WITH_RULE_RULE
== ccl
->private_state
)
1151 ccl
->private_state
= COMPOSING_WITH_RULE_HEAD
;
1154 else if (COMPOSING_WITH_RULE_HEAD
== ccl
->private_state
)
1155 ccl
->private_state
= COMPOSING_WITH_RULE_RULE
;
1160 goto ccl_read_multibyte_character_suspend
;
1172 reg
[RRR
] = CHARSET_ASCII
;
1174 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION1
)
1177 goto ccl_read_multibyte_character_suspend
;
1179 reg
[rrr
] = (*src
++ & 0x7F);
1181 else if (i
<= MAX_CHARSET_OFFICIAL_DIMENSION2
)
1183 if ((src
+ 1) >= src_end
)
1184 goto ccl_read_multibyte_character_suspend
;
1186 i
= (*src
++ & 0x7F);
1187 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1190 else if ((i
== LEADING_CODE_PRIVATE_11
)
1191 || (i
== LEADING_CODE_PRIVATE_12
))
1193 if ((src
+ 1) >= src_end
)
1194 goto ccl_read_multibyte_character_suspend
;
1196 reg
[rrr
] = (*src
++ & 0x7F);
1198 else if ((i
== LEADING_CODE_PRIVATE_21
)
1199 || (i
== LEADING_CODE_PRIVATE_22
))
1201 if ((src
+ 2) >= src_end
)
1202 goto ccl_read_multibyte_character_suspend
;
1204 i
= (*src
++ & 0x7F);
1205 reg
[rrr
] = ((i
<< 7) | (*src
& 0x7F));
1210 /* INVALID CODE. Return a single byte character. */
1211 reg
[RRR
] = CHARSET_ASCII
;
1218 ccl_read_multibyte_character_suspend
:
1220 if (ccl
->last_block
)
1226 CCL_SUSPEND (CCL_STAT_SUSPEND_BY_SRC
);
1230 case CCL_WriteMultibyteChar2
:
1231 i
= reg
[RRR
]; /* charset */
1232 if (i
== CHARSET_ASCII
)
1233 i
= reg
[rrr
] & 0xFF;
1234 else if (i
== CHARSET_COMPOSITION
)
1235 i
= MAKE_COMPOSITE_CHAR (reg
[rrr
]);
1236 else if (CHARSET_DIMENSION (i
) == 1)
1237 i
= ((i
- 0x70) << 7) | (reg
[rrr
] & 0x7F);
1238 else if (i
< MIN_CHARSET_PRIVATE_DIMENSION2
)
1239 i
= ((i
- 0x8F) << 14) | reg
[rrr
];
1241 i
= ((i
- 0xE0) << 14) | reg
[rrr
];
1247 case CCL_TranslateCharacter
:
1248 i
= reg
[RRR
]; /* charset */
1249 if (i
== CHARSET_ASCII
)
1251 else if (i
== CHARSET_COMPOSITION
)
1256 else if (CHARSET_DIMENSION (i
) == 1)
1257 i
= ((i
- 0x70) << 7) | (reg
[rrr
] & 0x7F);
1258 else if (i
< MIN_CHARSET_PRIVATE_DIMENSION2
)
1259 i
= ((i
- 0x8F) << 14) | (reg
[rrr
] & 0x3FFF);
1261 i
= ((i
- 0xE0) << 14) | (reg
[rrr
] & 0x3FFF);
1263 op
= translate_char (GET_TRANSLATION_TABLE (reg
[Rrr
]),
1265 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1272 case CCL_TranslateCharacterConstTbl
:
1273 op
= XINT (ccl_prog
[ic
]); /* table */
1275 i
= reg
[RRR
]; /* charset */
1276 if (i
== CHARSET_ASCII
)
1278 else if (i
== CHARSET_COMPOSITION
)
1283 else if (CHARSET_DIMENSION (i
) == 1)
1284 i
= ((i
- 0x70) << 7) | (reg
[rrr
] & 0x7F);
1285 else if (i
< MIN_CHARSET_PRIVATE_DIMENSION2
)
1286 i
= ((i
- 0x8F) << 14) | (reg
[rrr
] & 0x3FFF);
1288 i
= ((i
- 0xE0) << 14) | (reg
[rrr
] & 0x3FFF);
1290 op
= translate_char (GET_TRANSLATION_TABLE (op
), i
, -1, 0, 0);
1291 SPLIT_CHAR (op
, reg
[RRR
], i
, j
);
1298 case CCL_IterateMultipleMap
:
1300 Lisp_Object map
, content
, attrib
, value
;
1301 int point
, size
, fin_ic
;
1303 j
= XINT (ccl_prog
[ic
++]); /* number of maps. */
1306 if ((j
> reg
[RRR
]) && (j
>= 0))
1321 size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1322 point
= XINT (ccl_prog
[ic
++]);
1323 if (point
>= size
) continue;
1325 XVECTOR (Vcode_conversion_map_vector
)->contents
[point
];
1327 /* Check map varidity. */
1328 if (!CONSP (map
)) continue;
1330 if (!VECTORP (map
)) continue;
1331 size
= XVECTOR (map
)->size
;
1332 if (size
<= 1) continue;
1334 content
= XVECTOR (map
)->contents
[0];
1337 [STARTPOINT VAL1 VAL2 ...] or
1338 [t ELELMENT STARTPOINT ENDPOINT] */
1339 if (NUMBERP (content
))
1341 point
= XUINT (content
);
1342 point
= op
- point
+ 1;
1343 if (!((point
>= 1) && (point
< size
))) continue;
1344 content
= XVECTOR (map
)->contents
[point
];
1346 else if (EQ (content
, Qt
))
1348 if (size
!= 4) continue;
1349 if ((op
>= XUINT (XVECTOR (map
)->contents
[2]))
1350 && (op
< XUINT (XVECTOR (map
)->contents
[3])))
1351 content
= XVECTOR (map
)->contents
[1];
1360 else if (NUMBERP (content
))
1363 reg
[rrr
] = XINT(content
);
1366 else if (EQ (content
, Qt
) || EQ (content
, Qlambda
))
1371 else if (CONSP (content
))
1373 attrib
= XCAR (content
);
1374 value
= XCDR (content
);
1375 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1378 reg
[rrr
] = XUINT (value
);
1388 case CCL_MapMultiple
:
1390 Lisp_Object map
, content
, attrib
, value
;
1391 int point
, size
, map_vector_size
;
1392 int map_set_rest_length
, fin_ic
;
1394 map_set_rest_length
=
1395 XINT (ccl_prog
[ic
++]); /* number of maps and separators. */
1396 fin_ic
= ic
+ map_set_rest_length
;
1397 if ((map_set_rest_length
> reg
[RRR
]) && (reg
[RRR
] >= 0))
1401 map_set_rest_length
-= i
;
1409 mapping_stack_pointer
= mapping_stack
;
1411 PUSH_MAPPING_STACK (0, op
);
1413 map_vector_size
= XVECTOR (Vcode_conversion_map_vector
)->size
;
1414 for (;map_set_rest_length
> 0;i
++, map_set_rest_length
--)
1416 point
= XINT(ccl_prog
[ic
++]);
1420 if (mapping_stack_pointer
1421 >= &mapping_stack
[MAX_MAP_SET_LEVEL
])
1425 PUSH_MAPPING_STACK (map_set_rest_length
- point
,
1427 map_set_rest_length
= point
+ 1;
1432 if (point
>= map_vector_size
) continue;
1433 map
= (XVECTOR (Vcode_conversion_map_vector
)
1436 /* Check map varidity. */
1437 if (!CONSP (map
)) continue;
1439 if (!VECTORP (map
)) continue;
1440 size
= XVECTOR (map
)->size
;
1441 if (size
<= 1) continue;
1443 content
= XVECTOR (map
)->contents
[0];
1446 [STARTPOINT VAL1 VAL2 ...] or
1447 [t ELEMENT STARTPOINT ENDPOINT] */
1448 if (NUMBERP (content
))
1450 point
= XUINT (content
);
1451 point
= op
- point
+ 1;
1452 if (!((point
>= 1) && (point
< size
))) continue;
1453 content
= XVECTOR (map
)->contents
[point
];
1455 else if (EQ (content
, Qt
))
1457 if (size
!= 4) continue;
1458 if ((op
>= XUINT (XVECTOR (map
)->contents
[2])) &&
1459 (op
< XUINT (XVECTOR (map
)->contents
[3])))
1460 content
= XVECTOR (map
)->contents
[1];
1469 else if (NUMBERP (content
))
1471 op
= XINT (content
);
1473 i
+= map_set_rest_length
;
1474 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1476 else if (CONSP (content
))
1478 attrib
= XCAR (content
);
1479 value
= XCDR (content
);
1480 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1484 i
+= map_set_rest_length
;
1485 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1487 else if (EQ (content
, Qt
))
1491 i
+= map_set_rest_length
;
1492 POP_MAPPING_STACK (map_set_rest_length
, reg
[rrr
]);
1494 else if (EQ (content
, Qlambda
))
1508 Lisp_Object map
, attrib
, value
, content
;
1510 j
= XINT (ccl_prog
[ic
++]); /* map_id */
1512 if (j
>= XVECTOR (Vcode_conversion_map_vector
)->size
)
1517 map
= XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
1529 size
= XVECTOR (map
)->size
;
1530 point
= XUINT (XVECTOR (map
)->contents
[0]);
1531 point
= op
- point
+ 1;
1534 (!((point
>= 1) && (point
< size
))))
1538 content
= XVECTOR (map
)->contents
[point
];
1541 else if (NUMBERP (content
))
1542 reg
[rrr
] = XINT (content
);
1543 else if (EQ (content
, Qt
))
1545 else if (CONSP (content
))
1547 attrib
= XCAR (content
);
1548 value
= XCDR (content
);
1549 if (!NUMBERP (attrib
) || !NUMBERP (value
))
1551 reg
[rrr
] = XUINT(value
);
1573 /* We can insert an error message only if DESTINATION is
1574 specified and we still have a room to store the message
1582 switch (ccl
->status
)
1584 case CCL_STAT_INVALID_CMD
:
1585 sprintf(msg
, "\nCCL: Invalid command %x (ccl_code = %x) at %d.",
1586 code
& 0x1F, code
, this_ic
);
1589 int i
= ccl_backtrace_idx
- 1;
1592 msglen
= strlen (msg
);
1593 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1595 bcopy (msg
, dst
, msglen
);
1599 for (j
= 0; j
< CCL_DEBUG_BACKTRACE_LEN
; j
++, i
--)
1601 if (i
< 0) i
= CCL_DEBUG_BACKTRACE_LEN
- 1;
1602 if (ccl_backtrace_table
[i
] == 0)
1604 sprintf(msg
, " %d", ccl_backtrace_table
[i
]);
1605 msglen
= strlen (msg
);
1606 if (dst
+ msglen
> (dst_bytes
? dst_end
: src
))
1608 bcopy (msg
, dst
, msglen
);
1617 sprintf(msg
, "\nCCL: Quited.");
1621 sprintf(msg
, "\nCCL: Unknown error type (%d).", ccl
->status
);
1624 msglen
= strlen (msg
);
1625 if (dst
+ msglen
<= (dst_bytes
? dst_end
: src
))
1627 bcopy (msg
, dst
, msglen
);
1634 ccl
->stack_idx
= stack_idx
;
1635 ccl
->prog
= ccl_prog
;
1636 if (consumed
) *consumed
= src
- source
;
1637 return (dst
? dst
- destination
: 0);
1640 /* Resolve symbols in the specified CCL code (Lisp vector). This
1641 function converts symbols of code conversion maps and character
1642 translation tables embeded in the CCL code into their ID numbers.
1644 The return value is a vector (CCL itself or a new vector in which
1645 all symbols are resolved), Qt if resolving of some symbol failed,
1646 or nil if CCL contains invalid data. */
1649 resolve_symbol_ccl_program (ccl
)
1652 int i
, veclen
, unresolved
= 0;
1653 Lisp_Object result
, contents
, val
;
1656 veclen
= XVECTOR (result
)->size
;
1658 for (i
= 0; i
< veclen
; i
++)
1660 contents
= XVECTOR (result
)->contents
[i
];
1661 if (INTEGERP (contents
))
1663 else if (CONSP (contents
)
1664 && SYMBOLP (XCAR (contents
))
1665 && SYMBOLP (XCDR (contents
)))
1667 /* This is the new style for embedding symbols. The form is
1668 (SYMBOL . PROPERTY). (get SYMBOL PROPERTY) should give
1671 if (EQ (result
, ccl
))
1672 result
= Fcopy_sequence (ccl
);
1674 val
= Fget (XCAR (contents
), XCDR (contents
));
1676 XVECTOR (result
)->contents
[i
] = val
;
1681 else if (SYMBOLP (contents
))
1683 /* This is the old style for embedding symbols. This style
1684 may lead to a bug if, for instance, a translation table
1685 and a code conversion map have the same name. */
1686 if (EQ (result
, ccl
))
1687 result
= Fcopy_sequence (ccl
);
1689 val
= Fget (contents
, Qtranslation_table_id
);
1691 XVECTOR (result
)->contents
[i
] = val
;
1694 val
= Fget (contents
, Qcode_conversion_map_id
);
1696 XVECTOR (result
)->contents
[i
] = val
;
1699 val
= Fget (contents
, Qccl_program_idx
);
1701 XVECTOR (result
)->contents
[i
] = val
;
1711 return (unresolved
? Qt
: result
);
1714 /* Return the compiled code (vector) of CCL program CCL_PROG.
1715 CCL_PROG is a name (symbol) of the program or already compiled
1716 code. If necessary, resolve symbols in the compiled code to index
1717 numbers. If we failed to get the compiled code or to resolve
1718 symbols, return Qnil. */
1721 ccl_get_compiled_code (ccl_prog
)
1722 Lisp_Object ccl_prog
;
1724 Lisp_Object val
, slot
;
1726 if (VECTORP (ccl_prog
))
1728 val
= resolve_symbol_ccl_program (ccl_prog
);
1729 return (VECTORP (val
) ? val
: Qnil
);
1731 if (!SYMBOLP (ccl_prog
))
1734 val
= Fget (ccl_prog
, Qccl_program_idx
);
1736 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1738 slot
= XVECTOR (Vccl_program_table
)->contents
[XINT (val
)];
1739 if (! VECTORP (slot
)
1740 || XVECTOR (slot
)->size
!= 3
1741 || ! VECTORP (XVECTOR (slot
)->contents
[1]))
1743 if (NILP (XVECTOR (slot
)->contents
[2]))
1745 val
= resolve_symbol_ccl_program (XVECTOR (slot
)->contents
[1]);
1746 if (! VECTORP (val
))
1748 XVECTOR (slot
)->contents
[1] = val
;
1749 XVECTOR (slot
)->contents
[2] = Qt
;
1751 return XVECTOR (slot
)->contents
[1];
1754 /* Setup fields of the structure pointed by CCL appropriately for the
1755 execution of CCL program CCL_PROG. CCL_PROG is the name (symbol)
1756 of the CCL program or the already compiled code (vector).
1757 Return 0 if we succeed this setup, else return -1.
1759 If CCL_PROG is nil, we just reset the structure pointed by CCL. */
1761 setup_ccl_program (ccl
, ccl_prog
)
1762 struct ccl_program
*ccl
;
1763 Lisp_Object ccl_prog
;
1767 if (! NILP (ccl_prog
))
1769 struct Lisp_Vector
*vp
;
1771 ccl_prog
= ccl_get_compiled_code (ccl_prog
);
1772 if (! VECTORP (ccl_prog
))
1774 vp
= XVECTOR (ccl_prog
);
1775 ccl
->size
= vp
->size
;
1776 ccl
->prog
= vp
->contents
;
1777 ccl
->eof_ic
= XINT (vp
->contents
[CCL_HEADER_EOF
]);
1778 ccl
->buf_magnification
= XINT (vp
->contents
[CCL_HEADER_BUF_MAG
]);
1780 ccl
->ic
= CCL_HEADER_MAIN
;
1781 for (i
= 0; i
< 8; i
++)
1783 ccl
->last_block
= 0;
1784 ccl
->private_state
= 0;
1792 DEFUN ("ccl-program-p", Fccl_program_p
, Sccl_program_p
, 1, 1, 0,
1793 "Return t if OBJECT is a CCL program name or a compiled CCL program code.")
1799 if (VECTORP (object
))
1801 val
= resolve_symbol_ccl_program (object
);
1802 return (VECTORP (val
) ? Qt
: Qnil
);
1804 if (!SYMBOLP (object
))
1807 val
= Fget (object
, Qccl_program_idx
);
1808 return ((! NATNUMP (val
)
1809 || XINT (val
) >= XVECTOR (Vccl_program_table
)->size
)
1813 DEFUN ("ccl-execute", Fccl_execute
, Sccl_execute
, 2, 2, 0,
1814 "Execute CCL-PROGRAM with registers initialized by REGISTERS.\n\
1816 CCL-PROGRAM is a CCL program name (symbol)\n\
1817 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
1818 in this case, the overhead of the execution is bigger than the former case).\n\
1819 No I/O commands should appear in CCL-PROGRAM.\n\
1821 REGISTERS is a vector of [R0 R1 ... R7] where RN is an initial value\n\
1824 As side effect, each element of REGISTERS holds the value of\n\
1825 corresponding register after the execution.")
1827 Lisp_Object ccl_prog
, reg
;
1829 struct ccl_program ccl
;
1832 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
1833 error ("Invalid CCL program");
1835 CHECK_VECTOR (reg
, 1);
1836 if (XVECTOR (reg
)->size
!= 8)
1837 error ("Length of vector REGISTERS is not 9");
1839 for (i
= 0; i
< 8; i
++)
1840 ccl
.reg
[i
] = (INTEGERP (XVECTOR (reg
)->contents
[i
])
1841 ? XINT (XVECTOR (reg
)->contents
[i
])
1844 ccl_driver (&ccl
, (char *)0, (char *)0, 0, 0, (int *)0);
1846 if (ccl
.status
!= CCL_STAT_SUCCESS
)
1847 error ("Error in CCL program at %dth code", ccl
.ic
);
1849 for (i
= 0; i
< 8; i
++)
1850 XSETINT (XVECTOR (reg
)->contents
[i
], ccl
.reg
[i
]);
1854 DEFUN ("ccl-execute-on-string", Fccl_execute_on_string
, Sccl_execute_on_string
,
1856 "Execute CCL-PROGRAM with initial STATUS on STRING.\n\
1858 CCL-PROGRAM is a symbol registered by register-ccl-program,\n\
1859 or a compiled code generated by `ccl-compile' (for backward compatibility,\n\
1860 in this case, the execution is slower).\n\
1862 Read buffer is set to STRING, and write buffer is allocated automatically.\n\
1864 STATUS is a vector of [R0 R1 ... R7 IC], where\n\
1865 R0..R7 are initial values of corresponding registers,\n\
1866 IC is the instruction counter specifying from where to start the program.\n\
1867 If R0..R7 are nil, they are initialized to 0.\n\
1868 If IC is nil, it is initialized to head of the CCL program.\n\
1870 If optional 4th arg CONTINUE is non-nil, keep IC on read operation\n\
1871 when read buffer is exausted, else, IC is always set to the end of\n\
1872 CCL-PROGRAM on exit.\n\
1874 It returns the contents of write buffer as a string,\n\
1875 and as side effect, STATUS is updated.\n\
1876 If the optional 5th arg UNIBYTE-P is non-nil, the returned string\n\
1877 is a unibyte string. By default it is a multibyte string.")
1878 (ccl_prog
, status
, str
, contin
, unibyte_p
)
1879 Lisp_Object ccl_prog
, status
, str
, contin
, unibyte_p
;
1882 struct ccl_program ccl
;
1886 struct gcpro gcpro1
, gcpro2
;
1888 if (setup_ccl_program (&ccl
, ccl_prog
) < 0)
1889 error ("Invalid CCL program");
1891 CHECK_VECTOR (status
, 1);
1892 if (XVECTOR (status
)->size
!= 9)
1893 error ("Length of vector STATUS is not 9");
1894 CHECK_STRING (str
, 2);
1896 GCPRO2 (status
, str
);
1898 for (i
= 0; i
< 8; i
++)
1900 if (NILP (XVECTOR (status
)->contents
[i
]))
1901 XSETINT (XVECTOR (status
)->contents
[i
], 0);
1902 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
1903 ccl
.reg
[i
] = XINT (XVECTOR (status
)->contents
[i
]);
1905 if (INTEGERP (XVECTOR (status
)->contents
[i
]))
1907 i
= XFASTINT (XVECTOR (status
)->contents
[8]);
1908 if (ccl
.ic
< i
&& i
< ccl
.size
)
1911 outbufsize
= STRING_BYTES (XSTRING (str
)) * ccl
.buf_magnification
+ 256;
1912 outbuf
= (char *) xmalloc (outbufsize
);
1914 error ("Not enough memory");
1915 ccl
.last_block
= NILP (contin
);
1916 produced
= ccl_driver (&ccl
, XSTRING (str
)->data
, outbuf
,
1917 STRING_BYTES (XSTRING (str
)), outbufsize
, (int *)0);
1918 for (i
= 0; i
< 8; i
++)
1919 XSET (XVECTOR (status
)->contents
[i
], Lisp_Int
, ccl
.reg
[i
]);
1920 XSETINT (XVECTOR (status
)->contents
[8], ccl
.ic
);
1923 if (NILP (unibyte_p
))
1924 val
= make_string (outbuf
, produced
);
1926 val
= make_unibyte_string (outbuf
, produced
);
1929 if (ccl
.status
!= CCL_STAT_SUCCESS
1930 && ccl
.status
!= CCL_STAT_SUSPEND_BY_SRC
1931 && ccl
.status
!= CCL_STAT_SUSPEND_BY_DST
)
1932 error ("Error in CCL program at %dth code", ccl
.ic
);
1937 DEFUN ("register-ccl-program", Fregister_ccl_program
, Sregister_ccl_program
,
1939 "Register CCL program CCL_PROG as NAME in `ccl-program-table'.\n\
1940 CCL_PROG should be a compiled CCL program (vector), or nil.\n\
1941 If it is nil, just reserve NAME as a CCL program name.\n\
1942 Return index number of the registered CCL program.")
1944 Lisp_Object name
, ccl_prog
;
1946 int len
= XVECTOR (Vccl_program_table
)->size
;
1948 Lisp_Object resolved
;
1950 CHECK_SYMBOL (name
, 0);
1952 if (!NILP (ccl_prog
))
1954 CHECK_VECTOR (ccl_prog
, 1);
1955 resolved
= resolve_symbol_ccl_program (ccl_prog
);
1956 if (! NILP (resolved
))
1958 ccl_prog
= resolved
;
1963 for (idx
= 0; idx
< len
; idx
++)
1967 slot
= XVECTOR (Vccl_program_table
)->contents
[idx
];
1968 if (!VECTORP (slot
))
1969 /* This is the first unsed slot. Register NAME here. */
1972 if (EQ (name
, XVECTOR (slot
)->contents
[0]))
1974 /* Update this slot. */
1975 XVECTOR (slot
)->contents
[1] = ccl_prog
;
1976 XVECTOR (slot
)->contents
[2] = resolved
;
1977 return make_number (idx
);
1983 /* Extend the table. */
1984 Lisp_Object new_table
;
1987 new_table
= Fmake_vector (make_number (len
* 2), Qnil
);
1988 for (j
= 0; j
< len
; j
++)
1989 XVECTOR (new_table
)->contents
[j
]
1990 = XVECTOR (Vccl_program_table
)->contents
[j
];
1991 Vccl_program_table
= new_table
;
1997 elt
= Fmake_vector (make_number (3), Qnil
);
1998 XVECTOR (elt
)->contents
[0] = name
;
1999 XVECTOR (elt
)->contents
[1] = ccl_prog
;
2000 XVECTOR (elt
)->contents
[2] = resolved
;
2001 XVECTOR (Vccl_program_table
)->contents
[idx
] = elt
;
2004 Fput (name
, Qccl_program_idx
, make_number (idx
));
2005 return make_number (idx
);
2008 /* Register code conversion map.
2009 A code conversion map consists of numbers, Qt, Qnil, and Qlambda.
2010 The first element is start code point.
2011 The rest elements are mapped numbers.
2012 Symbol t means to map to an original number before mapping.
2013 Symbol nil means that the corresponding element is empty.
2014 Symbol lambda menas to terminate mapping here.
2017 DEFUN ("register-code-conversion-map", Fregister_code_conversion_map
,
2018 Sregister_code_conversion_map
,
2020 "Register SYMBOL as code conversion map MAP.\n\
2021 Return index number of the registered map.")
2023 Lisp_Object symbol
, map
;
2025 int len
= XVECTOR (Vcode_conversion_map_vector
)->size
;
2029 CHECK_SYMBOL (symbol
, 0);
2030 CHECK_VECTOR (map
, 1);
2032 for (i
= 0; i
< len
; i
++)
2034 Lisp_Object slot
= XVECTOR (Vcode_conversion_map_vector
)->contents
[i
];
2039 if (EQ (symbol
, XCAR (slot
)))
2041 index
= make_number (i
);
2043 Fput (symbol
, Qcode_conversion_map
, map
);
2044 Fput (symbol
, Qcode_conversion_map_id
, index
);
2051 Lisp_Object new_vector
= Fmake_vector (make_number (len
* 2), Qnil
);
2054 for (j
= 0; j
< len
; j
++)
2055 XVECTOR (new_vector
)->contents
[j
]
2056 = XVECTOR (Vcode_conversion_map_vector
)->contents
[j
];
2057 Vcode_conversion_map_vector
= new_vector
;
2060 index
= make_number (i
);
2061 Fput (symbol
, Qcode_conversion_map
, map
);
2062 Fput (symbol
, Qcode_conversion_map_id
, index
);
2063 XVECTOR (Vcode_conversion_map_vector
)->contents
[i
] = Fcons (symbol
, map
);
2071 staticpro (&Vccl_program_table
);
2072 Vccl_program_table
= Fmake_vector (make_number (32), Qnil
);
2074 Qccl_program
= intern ("ccl-program");
2075 staticpro (&Qccl_program
);
2077 Qccl_program_idx
= intern ("ccl-program-idx");
2078 staticpro (&Qccl_program_idx
);
2080 Qcode_conversion_map
= intern ("code-conversion-map");
2081 staticpro (&Qcode_conversion_map
);
2083 Qcode_conversion_map_id
= intern ("code-conversion-map-id");
2084 staticpro (&Qcode_conversion_map_id
);
2086 DEFVAR_LISP ("code-conversion-map-vector", &Vcode_conversion_map_vector
,
2087 "Vector of code conversion maps.");
2088 Vcode_conversion_map_vector
= Fmake_vector (make_number (16), Qnil
);
2090 DEFVAR_LISP ("font-ccl-encoder-alist", &Vfont_ccl_encoder_alist
,
2091 "Alist of fontname patterns vs corresponding CCL program.\n\
2092 Each element looks like (REGEXP . CCL-CODE),\n\
2093 where CCL-CODE is a compiled CCL program.\n\
2094 When a font whose name matches REGEXP is used for displaying a character,\n\
2095 CCL-CODE is executed to calculate the code point in the font\n\
2096 from the charset number and position code(s) of the character which are set\n\
2097 in CCL registers R0, R1, and R2 before the execution.\n\
2098 The code point in the font is set in CCL registers R1 and R2\n\
2099 when the execution terminated.\n\
2100 If the font is single-byte font, the register R2 is not used.");
2101 Vfont_ccl_encoder_alist
= Qnil
;
2103 defsubr (&Sccl_program_p
);
2104 defsubr (&Sccl_execute
);
2105 defsubr (&Sccl_execute_on_string
);
2106 defsubr (&Sregister_ccl_program
);
2107 defsubr (&Sregister_code_conversion_map
);