Commit | Line | Data |
---|---|---|
0168c3d8 KH |
1 | /* Header for multibyte character handler. |
2 | Copyright (C) 1995, 1997, 1998 Electrotechnical Laboratory, JAPAN. | |
8f924df7 | 3 | Licensed to the Free Software Foundation. |
ec62e0ac | 4 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 |
0168c3d8 KH |
5 | National Institute of Advanced Industrial Science and Technology (AIST) |
6 | Registration Number H13PRO009 | |
7 | ||
8 | This file is part of GNU Emacs. | |
9 | ||
10 | GNU Emacs is free software; you can redistribute it and/or modify | |
11 | it under the terms of the GNU General Public License as published by | |
ec62e0ac | 12 | the Free Software Foundation; either version 3, or (at your option) |
0168c3d8 KH |
13 | any later version. |
14 | ||
15 | GNU Emacs is distributed in the hope that it will be useful, | |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
19 | ||
20 | You should have received a copy of the GNU General Public License | |
ec62e0ac GM |
21 | along with GNU Emacs; see the file COPYING. If not, write to the |
22 | Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | |
23 | Boston, MA 02110-1301, USA. */ | |
0168c3d8 KH |
24 | |
25 | #ifndef EMACS_CHARACTER_H | |
26 | #define EMACS_CHARACTER_H | |
27 | ||
885317d8 KH |
28 | /* character code 1st byte byte sequence |
29 | -------------- -------- ------------- | |
30 | 0-7F 00..7F 0xxxxxxx | |
31 | 80-7FF C2..DF 110xxxxx 10xxxxxx | |
32 | 800-FFFF E0..EF 1110xxxx 10xxxxxx 10xxxxxx | |
33 | 10000-1FFFFF F0..F7 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx | |
34 | 200000-3FFF7F F8 11111000 1000xxxx 10xxxxxx 10xxxxxx 10xxxxxx | |
c43e85a9 KH |
35 | 3FFF80-3FFFFF C0..C1 1100000x 10xxxxxx (for eight-bit-char) |
36 | 400000-... invalid | |
0168c3d8 | 37 | |
c43e85a9 KH |
38 | invalid 1st byte 80..BF 10xxxxxx |
39 | F9..FF 11111xxx (xxx != 000) | |
0168c3d8 KH |
40 | */ |
41 | ||
885317d8 | 42 | /* Maximum character code ((1 << CHARACTERBITS) - 1). */ |
0168c3d8 KH |
43 | #define MAX_CHAR 0x3FFFFF |
44 | ||
885317d8 | 45 | /* Maximum Unicode character code. */ |
0168c3d8 KH |
46 | #define MAX_UNICODE_CHAR 0x10FFFF |
47 | ||
885317d8 | 48 | /* Maximum N-byte character codes. */ |
0168c3d8 KH |
49 | #define MAX_1_BYTE_CHAR 0x7F |
50 | #define MAX_2_BYTE_CHAR 0x7FF | |
51 | #define MAX_3_BYTE_CHAR 0xFFFF | |
52 | #define MAX_4_BYTE_CHAR 0x1FFFFF | |
53 | #define MAX_5_BYTE_CHAR 0x3FFF7F | |
54 | ||
3a0a38de KH |
55 | /* Minimum leading code of multibyte characters. */ |
56 | #define MIN_MULTIBYTE_LEADING_CODE 0xC0 | |
57 | /* Maximum leading code of multibyte characters. */ | |
58 | #define MAX_MULTIBYTE_LEADING_CODE 0xF8 | |
59 | ||
8bc28f69 KH |
60 | /* Nonzero iff C is a character that corresponds to a raw 8-bit |
61 | byte. */ | |
62 | #define CHAR_BYTE8_P(c) ((c) > MAX_5_BYTE_CHAR) | |
63 | ||
885317d8 | 64 | /* Return the character code for raw 8-bit byte BYTE. */ |
0168c3d8 | 65 | #define BYTE8_TO_CHAR(byte) ((byte) + 0x3FFF00) |
885317d8 KH |
66 | |
67 | /* Return the raw 8-bit byte for character C. */ | |
8bc28f69 KH |
68 | #define CHAR_TO_BYTE8(c) \ |
69 | (CHAR_BYTE8_P (c) \ | |
70 | ? (c) - 0x3FFF00 \ | |
71 | : multibyte_char_to_unibyte (c, Qnil)) | |
885317d8 KH |
72 | |
73 | /* Nonzero iff BYTE is the 1st byte of a multibyte form of a character | |
74 | that corresponds to a raw 8-bit byte. */ | |
0168c3d8 KH |
75 | #define CHAR_BYTE8_HEAD_P(byte) ((byte) == 0xC0 || (byte) == 0xC1) |
76 | ||
43c47483 KH |
77 | /* Mapping table from unibyte chars to multibyte chars. */ |
78 | extern int unibyte_to_multibyte_table[256]; | |
3e411074 | 79 | |
43c47483 KH |
80 | /* Convert the unibyte character C to the corresponding multibyte |
81 | character. If C can't be converted, return C. */ | |
82 | #define unibyte_char_to_multibyte(c) \ | |
83 | ((c) < 256 ? unibyte_to_multibyte_table[(c)] : (c)) | |
3e411074 | 84 | |
1acbd067 KH |
85 | /* Nth element is 1 iff unibyte char N can be mapped to a multibyte |
86 | char. */ | |
87 | extern char unibyte_has_multibyte_table[256]; | |
88 | ||
89 | #define UNIBYTE_CHAR_HAS_MULTIBYTE_P(c) (unibyte_has_multibyte_table[(c)]) | |
90 | ||
43c47483 KH |
91 | /* If C is not ASCII, make it unibyte. */ |
92 | #define MAKE_CHAR_UNIBYTE(c) \ | |
93 | do { \ | |
94 | if (! ASCII_CHAR_P (c)) \ | |
95 | c = CHAR_TO_BYTE8 (c); \ | |
96 | } while (0) | |
3e411074 | 97 | |
3e411074 | 98 | |
43c47483 KH |
99 | /* If C is not ASCII, make it multibyte. It assumes C < 256. */ |
100 | #define MAKE_CHAR_MULTIBYTE(c) ((c) = unibyte_to_multibyte_table[(c)]) | |
3e411074 | 101 | |
885317d8 | 102 | /* This is the maximum byte length of multibyte form. */ |
0168c3d8 KH |
103 | #define MAX_MULTIBYTE_LENGTH 5 |
104 | ||
b583cead KH |
105 | /* Return a Lisp character whose character code is C. It assumes C is |
106 | a valid character code. */ | |
0168c3d8 KH |
107 | #define make_char(c) make_number (c) |
108 | ||
109 | /* Nonzero iff C is an ASCII byte. */ | |
110 | #define ASCII_BYTE_P(c) ((unsigned) (c) < 0x80) | |
111 | ||
112 | /* Nonzero iff X is a character. */ | |
113 | #define CHARACTERP(x) (NATNUMP (x) && XFASTINT (x) <= MAX_CHAR) | |
114 | ||
f65c6d94 | 115 | /* Nonzero iff C is valid as a character code. GENERICP is not used |
885317d8 KH |
116 | now. */ |
117 | #define CHAR_VALID_P(c, genericp) ((unsigned) (c) <= MAX_CHAR) | |
0168c3d8 KH |
118 | |
119 | /* Check if Lisp object X is a character or not. */ | |
63db3c1b MB |
120 | #define CHECK_CHARACTER(x) \ |
121 | CHECK_TYPE (CHARACTERP (x), Qcharacterp, x) | |
0168c3d8 | 122 | |
8f924df7 KH |
123 | #define CHECK_CHARACTER_CAR(x) \ |
124 | do { \ | |
125 | Lisp_Object tmp = XCAR (x); \ | |
126 | CHECK_CHARACTER (tmp); \ | |
127 | XSETCAR ((x), tmp); \ | |
128 | } while (0) | |
129 | ||
130 | #define CHECK_CHARACTER_CDR(x) \ | |
131 | do { \ | |
132 | Lisp_Object tmp = XCDR (x); \ | |
133 | CHECK_CHARACTER (tmp); \ | |
134 | XSETCDR ((x), tmp); \ | |
135 | } while (0) | |
136 | ||
0168c3d8 KH |
137 | /* Nonzero iff C is an ASCII character. */ |
138 | #define ASCII_CHAR_P(c) ((unsigned) (c) < 0x80) | |
139 | ||
140 | /* Nonzero iff C is a character of code less than 0x100. */ | |
141 | #define SINGLE_BYTE_CHAR_P(c) ((unsigned) (c) < 0x100) | |
142 | ||
143 | /* Nonzero if character C has a printable glyph. */ | |
144 | #define CHAR_PRINTABLE_P(c) \ | |
145 | (((c) >= 32 && ((c) < 127) \ | |
146 | || ! NILP (CHAR_TABLE_REF (Vprintable_chars, (c))))) | |
147 | ||
885317d8 | 148 | /* Return byte length of multibyte form for character C. */ |
0168c3d8 KH |
149 | #define CHAR_BYTES(c) \ |
150 | ( (c) <= MAX_1_BYTE_CHAR ? 1 \ | |
151 | : (c) <= MAX_2_BYTE_CHAR ? 2 \ | |
152 | : (c) <= MAX_3_BYTE_CHAR ? 3 \ | |
153 | : (c) <= MAX_4_BYTE_CHAR ? 4 \ | |
154 | : (c) <= MAX_5_BYTE_CHAR ? 5 \ | |
155 | : 2) | |
156 | ||
43c47483 KH |
157 | |
158 | /* Return the leading code of multibyte form of C. */ | |
159 | #define CHAR_LEADING_CODE(c) \ | |
160 | ((c) <= MAX_1_BYTE_CHAR ? c \ | |
161 | : (c) <= MAX_2_BYTE_CHAR ? (0xC0 | ((c) >> 6)) \ | |
162 | : (c) <= MAX_3_BYTE_CHAR ? (0xE0 | ((c) >> 12)) \ | |
163 | : (c) <= MAX_4_BYTE_CHAR ? (0xF0 | ((c) >> 18)) \ | |
164 | : (c) <= MAX_5_BYTE_CHAR ? 0xF8 \ | |
165 | : (0xC0 | (((c) >> 6) & 0x01))) | |
166 | ||
167 | ||
885317d8 KH |
168 | /* Store multibyte form of the character C in P. The caller should |
169 | allocate at least MAX_MULTIBYTE_LENGTH bytes area at P in advance. | |
170 | Returns the length of the multibyte form. */ | |
0168c3d8 KH |
171 | |
172 | #define CHAR_STRING(c, p) \ | |
173 | ((unsigned) (c) <= MAX_1_BYTE_CHAR \ | |
174 | ? ((p)[0] = (c), \ | |
175 | 1) \ | |
176 | : (unsigned) (c) <= MAX_2_BYTE_CHAR \ | |
177 | ? ((p)[0] = (0xC0 | ((c) >> 6)), \ | |
178 | (p)[1] = (0x80 | ((c) & 0x3F)), \ | |
179 | 2) \ | |
180 | : (unsigned) (c) <= MAX_3_BYTE_CHAR \ | |
181 | ? ((p)[0] = (0xE0 | ((c) >> 12)), \ | |
182 | (p)[1] = (0x80 | (((c) >> 6) & 0x3F)), \ | |
183 | (p)[2] = (0x80 | ((c) & 0x3F)), \ | |
184 | 3) \ | |
f958a2fa | 185 | : char_string ((unsigned) c, p)) |
0168c3d8 | 186 | |
eb41da4c KH |
187 | /* Store multibyte form of byte B in P. The caller should allocate at |
188 | least MAX_MULTIBYTE_LENGTH bytes area at P in advance. Returns the | |
189 | length of the multibyte form. */ | |
1106ea2b KH |
190 | |
191 | #define BYTE8_STRING(b, p) \ | |
192 | ((p)[0] = (0xC0 | (((b) >> 6) & 0x01)), \ | |
7f464917 | 193 | (p)[1] = (0x80 | ((b) & 0x3F)), \ |
1106ea2b KH |
194 | 2) |
195 | ||
0168c3d8 | 196 | |
885317d8 KH |
197 | /* Store multibyte form of the character C in P. The caller should |
198 | allocate at least MAX_MULTIBYTE_LENGTH bytes area at P in advance. | |
199 | And, advance P to the end of the multibyte form. */ | |
0168c3d8 | 200 | |
eb41da4c KH |
201 | #define CHAR_STRING_ADVANCE(c, p) \ |
202 | do { \ | |
203 | if ((c) <= MAX_1_BYTE_CHAR) \ | |
204 | *(p)++ = (c); \ | |
205 | else if ((c) <= MAX_2_BYTE_CHAR) \ | |
206 | *(p)++ = (0xC0 | ((c) >> 6)), \ | |
207 | *(p)++ = (0x80 | ((c) & 0x3F)); \ | |
208 | else if ((c) <= MAX_3_BYTE_CHAR) \ | |
209 | *(p)++ = (0xE0 | ((c) >> 12)), \ | |
210 | *(p)++ = (0x80 | (((c) >> 6) & 0x3F)), \ | |
211 | *(p)++ = (0x80 | ((c) & 0x3F)); \ | |
212 | else \ | |
213 | (p) += char_string ((c), (p)); \ | |
885317d8 | 214 | } while (0) |
0168c3d8 | 215 | |
eb41da4c | 216 | |
0168c3d8 KH |
217 | /* Nonzero iff BYTE starts a non-ASCII character in a multibyte |
218 | form. */ | |
219 | #define LEADING_CODE_P(byte) (((byte) & 0xC0) == 0xC0) | |
220 | ||
b5c7dbe6 KH |
221 | /* Nonzero iff BYTE is a trailing code of a non-ASCII character in a |
222 | multibyte form. */ | |
223 | #define TRAILING_CODE_P(byte) (((byte) & 0xC0) == 0x80) | |
224 | ||
885317d8 KH |
225 | /* Nonzero iff BYTE starts a character in a multibyte form. |
226 | This is equivalent to: | |
227 | (ASCII_BYTE_P (byte) || LEADING_CODE_P (byte)) */ | |
228 | #define CHAR_HEAD_P(byte) (((byte) & 0xC0) != 0x80) | |
229 | ||
0168c3d8 KH |
230 | /* Just kept for backward compatibility. This macro will be removed |
231 | in the future. */ | |
232 | #define BASE_LEADING_CODE_P LEADING_CODE_P | |
233 | ||
234 | /* How many bytes a character that starts with BYTE occupies in a | |
235 | multibyte form. */ | |
236 | #define BYTES_BY_CHAR_HEAD(byte) \ | |
237 | (!((byte) & 0x80) ? 1 \ | |
238 | : !((byte) & 0x20) ? 2 \ | |
239 | : !((byte) & 0x10) ? 3 \ | |
240 | : !((byte) & 0x08) ? 4 \ | |
241 | : 5) | |
242 | ||
243 | ||
244 | /* Return the length of the multi-byte form at string STR of length | |
245 | LEN while assuming that STR points a valid multi-byte form. As | |
246 | this macro isn't necessary anymore, all callers will be changed to | |
247 | use BYTES_BY_CHAR_HEAD directly in the future. */ | |
248 | ||
249 | #define MULTIBYTE_FORM_LENGTH(str, len) \ | |
250 | BYTES_BY_CHAR_HEAD (*(str)) | |
251 | ||
252 | /* Parse multibyte string STR of length LENGTH and set BYTES to the | |
253 | byte length of a character at STR while assuming that STR points a | |
254 | valid multibyte form. As this macro isn't necessary anymore, all | |
255 | callers will be changed to use BYTES_BY_CHAR_HEAD directly in the | |
256 | future. */ | |
257 | ||
258 | #define PARSE_MULTIBYTE_SEQ(str, length, bytes) \ | |
259 | (bytes) = BYTES_BY_CHAR_HEAD (*(str)) | |
260 | ||
261 | /* The byte length of multibyte form at unibyte string P ending at | |
262 | PEND. If STR doesn't point a valid multibyte form, return 0. */ | |
263 | ||
264 | #define MULTIBYTE_LENGTH(p, pend) \ | |
265 | (p >= pend ? 0 \ | |
266 | : !((p)[0] & 0x80) ? 1 \ | |
267 | : ((p + 1 >= pend) || (((p)[1] & 0xC0) != 0x80)) ? 0 \ | |
268 | : ((p)[0] & 0xE0) == 0xC0 ? 2 \ | |
269 | : ((p + 2 >= pend) || (((p)[2] & 0xC0) != 0x80)) ? 0 \ | |
270 | : ((p)[0] & 0xF0) == 0xE0 ? 3 \ | |
271 | : ((p + 3 >= pend) || (((p)[3] & 0xC0) != 0x80)) ? 0 \ | |
272 | : ((p)[0] & 0xF8) == 0xF0 ? 4 \ | |
273 | : ((p + 4 >= pend) || (((p)[4] & 0xC0) != 0x80)) ? 0 \ | |
274 | : (p)[0] == 0xF8 && ((p)[1] & 0xF0) == 0x80 ? 5 \ | |
275 | : 0) | |
276 | ||
277 | ||
278 | /* Like MULTIBYTE_LENGTH but don't check the ending address. */ | |
279 | ||
280 | #define MULTIBYTE_LENGTH_NO_CHECK(p) \ | |
281 | (!((p)[0] & 0x80) ? 1 \ | |
282 | : ((p)[1] & 0xC0) != 0x80 ? 0 \ | |
283 | : ((p)[0] & 0xE0) == 0xC0 ? 2 \ | |
284 | : ((p)[2] & 0xC0) != 0x80 ? 0 \ | |
285 | : ((p)[0] & 0xF0) == 0xE0 ? 3 \ | |
286 | : ((p)[3] & 0xC0) != 0x80 ? 0 \ | |
287 | : ((p)[0] & 0xF8) == 0xF0 ? 4 \ | |
288 | : ((p)[4] & 0xC0) != 0x80 ? 0 \ | |
289 | : (p)[0] == 0xF8 && ((p)[1] & 0xF0) == 0x80 ? 5 \ | |
290 | : 0) | |
291 | ||
8f924df7 KH |
292 | /* If P is before LIMIT, advance P to the next character boundary. It |
293 | assumes that P is already at a character boundary of the sane | |
294 | mulitbyte form whose end address is LIMIT. */ | |
295 | ||
296 | #define NEXT_CHAR_BOUNDARY(p, limit) \ | |
297 | do { \ | |
298 | if ((p) < (limit)) \ | |
299 | (p) += BYTES_BY_CHAR_HEAD (*(p)); \ | |
300 | } while (0) | |
301 | ||
302 | ||
303 | /* If P is after LIMIT, advance P to the previous character boundary. | |
304 | It assumes that P is already at a character boundary of the sane | |
305 | mulitbyte form whose beginning address is LIMIT. */ | |
306 | ||
307 | #define PREV_CHAR_BOUNDARY(p, limit) \ | |
308 | do { \ | |
309 | if ((p) > (limit)) \ | |
310 | { \ | |
311 | const unsigned char *p0 = (p); \ | |
312 | do { \ | |
313 | p0--; \ | |
314 | } while (p0 >= limit && ! CHAR_HEAD_P (*p0)); \ | |
315 | (p) = (BYTES_BY_CHAR_HEAD (*p0) == (p) - p0) ? p0 : (p) - 1; \ | |
316 | } \ | |
317 | } while (0) | |
0168c3d8 KH |
318 | |
319 | /* Return the character code of character whose multibyte form is at | |
320 | P. The argument LEN is ignored. It will be removed in the | |
321 | future. */ | |
322 | ||
323 | #define STRING_CHAR(p, len) \ | |
324 | (!((p)[0] & 0x80) \ | |
325 | ? (p)[0] \ | |
326 | : ! ((p)[0] & 0x20) \ | |
327 | ? (((((p)[0] & 0x1F) << 6) \ | |
328 | | ((p)[1] & 0x3F)) \ | |
329 | + (((unsigned char) (p)[0]) < 0xC2 ? 0x3FFF80 : 0)) \ | |
330 | : ! ((p)[0] & 0x10) \ | |
331 | ? ((((p)[0] & 0x0F) << 12) \ | |
332 | | (((p)[1] & 0x3F) << 6) \ | |
333 | | ((p)[2] & 0x3F)) \ | |
eb41da4c | 334 | : string_char ((p), NULL, NULL)) |
0168c3d8 KH |
335 | |
336 | ||
337 | /* Like STRING_CHAR but set ACTUAL_LEN to the length of multibyte | |
338 | form. The argument LEN is ignored. It will be removed in the | |
339 | future. */ | |
340 | ||
341 | #define STRING_CHAR_AND_LENGTH(p, len, actual_len) \ | |
342 | (!((p)[0] & 0x80) \ | |
343 | ? ((actual_len) = 1, (p)[0]) \ | |
344 | : ! ((p)[0] & 0x20) \ | |
345 | ? ((actual_len) = 2, \ | |
346 | (((((p)[0] & 0x1F) << 6) \ | |
347 | | ((p)[1] & 0x3F)) \ | |
348 | + (((unsigned char) (p)[0]) < 0xC2 ? 0x3FFF80 : 0))) \ | |
349 | : ! ((p)[0] & 0x10) \ | |
350 | ? ((actual_len) = 3, \ | |
351 | ((((p)[0] & 0x0F) << 12) \ | |
352 | | (((p)[1] & 0x3F) << 6) \ | |
353 | | ((p)[2] & 0x3F))) \ | |
eb41da4c | 354 | : string_char ((p), NULL, &actual_len)) |
0168c3d8 KH |
355 | |
356 | ||
b583cead | 357 | /* Like STRING_CHAR but advance P to the end of multibyte form. */ |
0168c3d8 KH |
358 | |
359 | #define STRING_CHAR_ADVANCE(p) \ | |
360 | (!((p)[0] & 0x80) \ | |
361 | ? *(p)++ \ | |
362 | : ! ((p)[0] & 0x20) \ | |
363 | ? ((p) += 2, \ | |
364 | ((((p)[-2] & 0x1F) << 6) \ | |
365 | | ((p)[-1] & 0x3F) \ | |
8f924df7 | 366 | | ((unsigned char) ((p)[-2]) < 0xC2 ? 0x3FFF80 : 0))) \ |
0168c3d8 KH |
367 | : ! ((p)[0] & 0x10) \ |
368 | ? ((p) += 3, \ | |
369 | ((((p)[-3] & 0x0F) << 12) \ | |
370 | | (((p)[-2] & 0x3F) << 6) \ | |
371 | | ((p)[-1] & 0x3F))) \ | |
eb41da4c | 372 | : string_char ((p), &(p), NULL)) |
0168c3d8 KH |
373 | |
374 | ||
375 | /* Fetch the "next" character from Lisp string STRING at byte position | |
376 | BYTEIDX, character position CHARIDX. Store it into OUTPUT. | |
377 | ||
378 | All the args must be side-effect-free. | |
379 | BYTEIDX and CHARIDX must be lvalues; | |
380 | we increment them past the character fetched. */ | |
381 | ||
382 | #define FETCH_STRING_CHAR_ADVANCE(OUTPUT, STRING, CHARIDX, BYTEIDX) \ | |
383 | if (1) \ | |
384 | { \ | |
385 | CHARIDX++; \ | |
386 | if (STRING_MULTIBYTE (STRING)) \ | |
387 | { \ | |
388 | unsigned char *ptr = &XSTRING (STRING)->data[BYTEIDX]; \ | |
389 | int len; \ | |
390 | \ | |
391 | OUTPUT = STRING_CHAR_AND_LENGTH (ptr, 0, len); \ | |
392 | BYTEIDX += len; \ | |
393 | } \ | |
394 | else \ | |
395 | OUTPUT = XSTRING (STRING)->data[BYTEIDX++]; \ | |
396 | } \ | |
397 | else | |
398 | ||
b583cead KH |
399 | /* Like FETCH_STRING_CHAR_ADVANCE but return a multibyte character eve |
400 | if STRING is unibyte. */ | |
43c47483 KH |
401 | |
402 | #define FETCH_STRING_CHAR_AS_MULTIBYTE_ADVANCE(OUTPUT, STRING, CHARIDX, BYTEIDX) \ | |
403 | if (1) \ | |
404 | { \ | |
405 | CHARIDX++; \ | |
406 | if (STRING_MULTIBYTE (STRING)) \ | |
407 | { \ | |
408 | unsigned char *ptr = &XSTRING (STRING)->data[BYTEIDX]; \ | |
409 | int len; \ | |
410 | \ | |
411 | OUTPUT = STRING_CHAR_AND_LENGTH (ptr, 0, len); \ | |
412 | BYTEIDX += len; \ | |
413 | } \ | |
414 | else \ | |
415 | { \ | |
416 | OUTPUT = XSTRING (STRING)->data[BYTEIDX++]; \ | |
417 | MAKE_CHAR_MULTIBYTE (OUTPUT); \ | |
418 | } \ | |
419 | } \ | |
420 | else | |
421 | ||
0168c3d8 KH |
422 | |
423 | /* Like FETCH_STRING_CHAR_ADVANCE but assumes STRING is multibyte. */ | |
424 | ||
425 | #define FETCH_STRING_CHAR_ADVANCE_NO_CHECK(OUTPUT, STRING, CHARIDX, BYTEIDX) \ | |
426 | if (1) \ | |
427 | { \ | |
428 | unsigned char *ptr = &XSTRING (STRING)->data[BYTEIDX]; \ | |
429 | int len; \ | |
430 | \ | |
431 | OUTPUT = STRING_CHAR_AND_LENGTH (ptr, 0, len); \ | |
432 | BYTEIDX += len; \ | |
433 | CHARIDX++; \ | |
434 | } \ | |
435 | else | |
436 | ||
437 | ||
438 | /* Like FETCH_STRING_CHAR_ADVANCE but fetch character from the current | |
439 | buffer. */ | |
440 | ||
441 | #define FETCH_CHAR_ADVANCE(OUTPUT, CHARIDX, BYTEIDX) \ | |
442 | if (1) \ | |
443 | { \ | |
444 | CHARIDX++; \ | |
445 | if (!NILP (current_buffer->enable_multibyte_characters)) \ | |
446 | { \ | |
447 | unsigned char *ptr = BYTE_POS_ADDR (BYTEIDX); \ | |
448 | int len; \ | |
449 | \ | |
450 | OUTPUT= STRING_CHAR_AND_LENGTH (ptr, 0, len); \ | |
451 | BYTEIDX += len; \ | |
452 | } \ | |
453 | else \ | |
454 | { \ | |
455 | OUTPUT = *(BYTE_POS_ADDR (BYTEIDX)); \ | |
456 | BYTEIDX++; \ | |
457 | } \ | |
458 | } \ | |
459 | else | |
460 | ||
461 | ||
b583cead | 462 | /* Like FETCH_CHAR_ADVANCE but assumes the current buffer is multibyte. */ |
0168c3d8 KH |
463 | |
464 | #define FETCH_CHAR_ADVANCE_NO_CHECK(OUTPUT, CHARIDX, BYTEIDX) \ | |
465 | if (1) \ | |
466 | { \ | |
467 | unsigned char *ptr = BYTE_POS_ADDR (BYTEIDX); \ | |
468 | int len; \ | |
469 | \ | |
470 | OUTPUT= STRING_CHAR_AND_LENGTH (ptr, 0, len); \ | |
471 | BYTEIDX += len; \ | |
472 | CHARIDX++; \ | |
473 | } \ | |
474 | else | |
475 | ||
476 | ||
477 | /* Increase the buffer byte position POS_BYTE of the current buffer to | |
478 | the next character boundary. No range checking of POS. */ | |
479 | ||
480 | #define INC_POS(pos_byte) \ | |
481 | do { \ | |
482 | unsigned char *p = BYTE_POS_ADDR (pos_byte); \ | |
483 | pos_byte += BYTES_BY_CHAR_HEAD (*p); \ | |
484 | } while (0) | |
485 | ||
486 | ||
487 | /* Decrease the buffer byte position POS_BYTE of the current buffer to | |
488 | the previous character boundary. No range checking of POS. */ | |
489 | ||
490 | #define DEC_POS(pos_byte) \ | |
491 | do { \ | |
492 | unsigned char *p; \ | |
493 | \ | |
494 | pos_byte--; \ | |
495 | if (pos_byte < GPT_BYTE) \ | |
496 | p = BEG_ADDR + pos_byte - 1; \ | |
497 | else \ | |
498 | p = BEG_ADDR + GAP_SIZE + pos_byte - 1; \ | |
499 | while (!CHAR_HEAD_P (*p)) \ | |
500 | { \ | |
501 | p--; \ | |
502 | pos_byte--; \ | |
503 | } \ | |
504 | } while (0) | |
505 | ||
506 | /* Increment both CHARPOS and BYTEPOS, each in the appropriate way. */ | |
507 | ||
508 | #define INC_BOTH(charpos, bytepos) \ | |
509 | do \ | |
510 | { \ | |
511 | (charpos)++; \ | |
512 | if (NILP (current_buffer->enable_multibyte_characters)) \ | |
513 | (bytepos)++; \ | |
514 | else \ | |
515 | INC_POS ((bytepos)); \ | |
516 | } \ | |
517 | while (0) | |
518 | ||
519 | ||
520 | /* Decrement both CHARPOS and BYTEPOS, each in the appropriate way. */ | |
521 | ||
522 | #define DEC_BOTH(charpos, bytepos) \ | |
523 | do \ | |
524 | { \ | |
525 | (charpos)--; \ | |
526 | if (NILP (current_buffer->enable_multibyte_characters)) \ | |
527 | (bytepos)--; \ | |
528 | else \ | |
529 | DEC_POS ((bytepos)); \ | |
530 | } \ | |
531 | while (0) | |
532 | ||
533 | ||
534 | /* Increase the buffer byte position POS_BYTE of the current buffer to | |
535 | the next character boundary. This macro relies on the fact that | |
536 | *GPT_ADDR and *Z_ADDR are always accessible and the values are | |
537 | '\0'. No range checking of POS_BYTE. */ | |
538 | ||
539 | #define BUF_INC_POS(buf, pos_byte) \ | |
540 | do { \ | |
541 | unsigned char *p = BUF_BYTE_ADDRESS (buf, pos_byte); \ | |
542 | pos_byte += BYTES_BY_CHAR_HEAD (*p); \ | |
543 | } while (0) | |
544 | ||
545 | ||
546 | /* Decrease the buffer byte position POS_BYTE of the current buffer to | |
547 | the previous character boundary. No range checking of POS_BYTE. */ | |
548 | ||
549 | #define BUF_DEC_POS(buf, pos_byte) \ | |
550 | do { \ | |
551 | unsigned char *p; \ | |
552 | pos_byte--; \ | |
553 | if (pos_byte < BUF_GPT_BYTE (buf)) \ | |
554 | p = BUF_BEG_ADDR (buf) + pos_byte - 1; \ | |
555 | else \ | |
556 | p = BUF_BEG_ADDR (buf) + BUF_GAP_SIZE (buf) + pos_byte - 1; \ | |
557 | while (!CHAR_HEAD_P (*p)) \ | |
558 | { \ | |
559 | p--; \ | |
560 | pos_byte--; \ | |
561 | } \ | |
562 | } while (0) | |
563 | ||
564 | ||
b583cead KH |
565 | /* If C is a character to be unified with a Unicode character, return |
566 | the unified Unicode character. */ | |
567 | ||
fc9d9d2a | 568 | #define MAYBE_UNIFY_CHAR(c) \ |
eb41da4c KH |
569 | if (c > MAX_UNICODE_CHAR \ |
570 | && CHAR_TABLE_P (Vchar_unify_table)) \ | |
fc9d9d2a KH |
571 | { \ |
572 | Lisp_Object val; \ | |
573 | int unified; \ | |
574 | \ | |
575 | val = CHAR_TABLE_REF (Vchar_unify_table, c); \ | |
576 | if (! NILP (val)) \ | |
577 | { \ | |
578 | if (SYMBOLP (val)) \ | |
579 | { \ | |
b5c7dbe6 | 580 | Funify_charset (val, Qnil, Qnil); \ |
fc9d9d2a KH |
581 | val = CHAR_TABLE_REF (Vchar_unify_table, c); \ |
582 | } \ | |
583 | if ((unified = XINT (val)) >= 0) \ | |
584 | c = unified; \ | |
585 | } \ | |
586 | } \ | |
0168c3d8 KH |
587 | else |
588 | ||
fc9d9d2a | 589 | |
0168c3d8 KH |
590 | /* Return the width of ASCII character C. The width is measured by |
591 | how many columns occupied on the screen when displayed in the | |
592 | current buffer. */ | |
593 | ||
594 | #define ASCII_CHAR_WIDTH(c) \ | |
595 | (c < 0x20 \ | |
596 | ? (c == '\t' \ | |
597 | ? XFASTINT (current_buffer->tab_width) \ | |
598 | : (c == '\n' ? 0 : (NILP (current_buffer->ctl_arrow) ? 4 : 2))) \ | |
599 | : (c < 0x7f \ | |
600 | ? 1 \ | |
601 | : ((NILP (current_buffer->ctl_arrow) ? 4 : 2)))) | |
602 | ||
603 | /* Return the width of character C. The width is measured by how many | |
604 | columns occupied on the screen when displayed in the current | |
605 | buffer. */ | |
606 | ||
607 | #define CHAR_WIDTH(c) \ | |
608 | (ASCII_CHAR_P (c) \ | |
609 | ? ASCII_CHAR_WIDTH (c) \ | |
610 | : XINT (CHAR_TABLE_REF (Vchar_width_table, c))) | |
611 | ||
eb41da4c | 612 | extern int char_resolve_modifier_mask P_ ((int)); |
f958a2fa | 613 | extern int char_string P_ ((unsigned, unsigned char *)); |
eb41da4c KH |
614 | extern int string_char P_ ((const unsigned char *, |
615 | const unsigned char **, int *)); | |
0168c3d8 KH |
616 | |
617 | extern int translate_char P_ ((Lisp_Object, int c)); | |
618 | extern int char_printable_p P_ ((int c)); | |
8f924df7 KH |
619 | extern void parse_str_as_multibyte P_ ((const unsigned char *, int, int *, |
620 | int *)); | |
0168c3d8 KH |
621 | extern int parse_str_to_multibyte P_ ((unsigned char *, int)); |
622 | extern int str_as_multibyte P_ ((unsigned char *, int, int, int *)); | |
623 | extern int str_to_multibyte P_ ((unsigned char *, int, int)); | |
624 | extern int str_as_unibyte P_ ((unsigned char *, int)); | |
625 | extern int strwidth P_ ((unsigned char *, int)); | |
8f924df7 | 626 | extern int c_string_width P_ ((const unsigned char *, int, int, int *, int *)); |
0168c3d8 KH |
627 | extern int lisp_string_width P_ ((Lisp_Object, int, int *, int *)); |
628 | ||
629 | extern Lisp_Object Vprintable_chars; | |
630 | ||
631 | extern Lisp_Object Qcharacterp, Qauto_fill_chars; | |
632 | extern Lisp_Object Vtranslation_table_vector; | |
633 | extern Lisp_Object Vchar_width_table; | |
634 | extern Lisp_Object Vchar_direction_table; | |
635 | extern Lisp_Object Vchar_unify_table; | |
636 | ||
fac2bdc4 DL |
637 | extern Lisp_Object string_escape_byte8 P_ ((Lisp_Object)); |
638 | ||
0168c3d8 KH |
639 | /* Return a translation table of id number ID. */ |
640 | #define GET_TRANSLATION_TABLE(id) \ | |
641 | (XCDR(XVECTOR(Vtranslation_table_vector)->contents[(id)])) | |
642 | ||
643 | /* A char-table for characters which may invoke auto-filling. */ | |
644 | extern Lisp_Object Vauto_fill_chars; | |
645 | ||
e18ef64a | 646 | extern Lisp_Object Vchar_script_table; |
e0d6e5a5 | 647 | extern Lisp_Object Vscript_representative_chars; |
b5c7dbe6 | 648 | |
0168c3d8 KH |
649 | /* Copy LEN bytes from FROM to TO. This macro should be used only |
650 | when a caller knows that LEN is short and the obvious copy loop is | |
651 | faster than calling bcopy which has some overhead. Copying a | |
652 | multibyte sequence of a character is the typical case. */ | |
653 | ||
654 | #define BCOPY_SHORT(from, to, len) \ | |
655 | do { \ | |
656 | int i = len; \ | |
657 | unsigned char *from_p = from, *to_p = to; \ | |
658 | while (i--) *to_p++ = *from_p++; \ | |
659 | } while (0) | |
660 | ||
661 | #define DEFSYM(sym, name) \ | |
662 | do { (sym) = intern ((name)); staticpro (&(sym)); } while (0) | |
663 | ||
664 | #endif /* EMACS_CHARACTER_H */ | |
fbaf0946 MB |
665 | |
666 | /* arch-tag: 4ef86004-2eff-4073-8cea-cfcbcf7188ac | |
667 | (do not change this comment) */ |