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