?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Merge from origin/emacs-25
[emacs.git] / src / character.h
blob0d0e31c4c92f1ad4d35c70d03a49ff041503e9bd
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, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
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 3 of the License, or (at
13 your option) 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. If not, see <http://www.gnu.org/licenses/>. */
22
23 #ifndef EMACS_CHARACTER_H
24 #define EMACS_CHARACTER_H
25
26 #include <verify.h>
27 #include "lisp.h"
28
29 INLINE_HEADER_BEGIN
30
31 /* character code 1st byte byte sequence
32 -------------- -------- -------------
33 0-7F 00..7F 0xxxxxxx
34 80-7FF C2..DF 110xxxxx 10xxxxxx
35 800-FFFF E0..EF 1110xxxx 10xxxxxx 10xxxxxx
36 10000-1FFFFF F0..F7 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
37 200000-3FFF7F F8 11111000 1000xxxx 10xxxxxx 10xxxxxx 10xxxxxx
38 3FFF80-3FFFFF C0..C1 1100000x 10xxxxxx (for eight-bit-char)
39 400000-... invalid
40
41 invalid 1st byte 80..BF 10xxxxxx
42 F9..FF 11111xxx (xxx != 000)
43 */
44
45 /* Maximum character code ((1 << CHARACTERBITS) - 1). */
46 #define MAX_CHAR 0x3FFFFF
47
48 /* Maximum Unicode character code. */
49 #define MAX_UNICODE_CHAR 0x10FFFF
50
51 /* Maximum N-byte character codes. */
52 #define MAX_1_BYTE_CHAR 0x7F
53 #define MAX_2_BYTE_CHAR 0x7FF
54 #define MAX_3_BYTE_CHAR 0xFFFF
55 #define MAX_4_BYTE_CHAR 0x1FFFFF
56 #define MAX_5_BYTE_CHAR 0x3FFF7F
57
58 /* Minimum leading code of multibyte characters. */
59 #define MIN_MULTIBYTE_LEADING_CODE 0xC0
60 /* Maximum leading code of multibyte characters. */
61 #define MAX_MULTIBYTE_LEADING_CODE 0xF8
62
63 /* Unicode character values. */
64 enum
65 {
66 NO_BREAK_SPACE = 0x00A0,
67 SOFT_HYPHEN = 0x00AD,
68 ZERO_WIDTH_NON_JOINER = 0x200C,
69 ZERO_WIDTH_JOINER = 0x200D,
70 HYPHEN = 0x2010,
71 NON_BREAKING_HYPHEN = 0x2011,
72 LEFT_SINGLE_QUOTATION_MARK = 0x2018,
73 RIGHT_SINGLE_QUOTATION_MARK = 0x2019,
74 PARAGRAPH_SEPARATOR = 0x2029,
75 LEFT_POINTING_ANGLE_BRACKET = 0x2329,
76 RIGHT_POINTING_ANGLE_BRACKET = 0x232A,
77 LEFT_ANGLE_BRACKET = 0x3008,
78 RIGHT_ANGLE_BRACKET = 0x3009,
79 OBJECT_REPLACEMENT_CHARACTER = 0xFFFC,
80 };
81
82 /* UTF-8 encodings. Use \x escapes, so they are portable to pre-C11
83 compilers and can be concatenated with ordinary string literals. */
84 #define uLSQM "\xE2\x80\x98" /* U+2018 LEFT SINGLE QUOTATION MARK */
85 #define uRSQM "\xE2\x80\x99" /* U+2019 RIGHT SINGLE QUOTATION MARK */
86
87 /* Nonzero iff C is a character that corresponds to a raw 8-bit
88 byte. */
89 #define CHAR_BYTE8_P(c) ((c) > MAX_5_BYTE_CHAR)
90
91 /* Return the character code for raw 8-bit byte BYTE. */
92 #define BYTE8_TO_CHAR(byte) ((byte) + 0x3FFF00)
93
94 #define UNIBYTE_TO_CHAR(byte) \
95 (ASCII_CHAR_P (byte) ? (byte) : BYTE8_TO_CHAR (byte))
96
97 /* Return the raw 8-bit byte for character C. */
98 #define CHAR_TO_BYTE8(c) (CHAR_BYTE8_P (c) ? (c) - 0x3FFF00 : (c & 0xFF))
99
100 /* Return the raw 8-bit byte for character C,
101 or -1 if C doesn't correspond to a byte. */
102 #define CHAR_TO_BYTE_SAFE(c) \
103 (ASCII_CHAR_P (c) ? c : (CHAR_BYTE8_P (c) ? (c) - 0x3FFF00 : -1))
104
105 /* Nonzero iff BYTE is the 1st byte of a multibyte form of a character
106 that corresponds to a raw 8-bit byte. */
107 #define CHAR_BYTE8_HEAD_P(byte) ((byte) == 0xC0 || (byte) == 0xC1)
108
109 /* If C is not ASCII, make it unibyte. */
110 #define MAKE_CHAR_UNIBYTE(c) \
111 do { \
112 if (! ASCII_CHAR_P (c)) \
113 c = CHAR_TO_BYTE8 (c); \
114 } while (false)
115
116
117 /* If C is not ASCII, make it multibyte. Assumes C < 256. */
118 #define MAKE_CHAR_MULTIBYTE(c) \
119 (eassert ((c) >= 0 && (c) < 256), (c) = UNIBYTE_TO_CHAR (c))
120
121 /* This is the maximum byte length of multibyte form. */
122 #define MAX_MULTIBYTE_LENGTH 5
123
124 /* Nonzero iff X is a character. */
125 #define CHARACTERP(x) (NATNUMP (x) && XFASTINT (x) <= MAX_CHAR)
126
127 /* Nonzero iff C is valid as a character code. */
128 #define CHAR_VALID_P(c) UNSIGNED_CMP (c, <=, MAX_CHAR)
129
130 /* Check if Lisp object X is a character or not. */
131 #define CHECK_CHARACTER(x) \
132 CHECK_TYPE (CHARACTERP (x), Qcharacterp, x)
133
134 #define CHECK_CHARACTER_CAR(x) \
135 do { \
136 Lisp_Object tmp = XCAR (x); \
137 CHECK_CHARACTER (tmp); \
138 } while (false)
139
140 #define CHECK_CHARACTER_CDR(x) \
141 do { \
142 Lisp_Object tmp = XCDR (x); \
143 CHECK_CHARACTER (tmp); \
144 } while (false)
145
146 /* Nonzero iff C is a character of code less than 0x100. */
147 #define SINGLE_BYTE_CHAR_P(c) UNSIGNED_CMP (c, <, 0x100)
148
149 /* Nonzero if character C has a printable glyph. */
150 #define CHAR_PRINTABLE_P(c) \
151 (((c) >= 32 && (c) < 127) \
152 || ! NILP (CHAR_TABLE_REF (Vprintable_chars, (c))))
153
154 /* Return byte length of multibyte form for character C. */
155 #define CHAR_BYTES(c) \
156 ( (c) <= MAX_1_BYTE_CHAR ? 1 \
157 : (c) <= MAX_2_BYTE_CHAR ? 2 \
158 : (c) <= MAX_3_BYTE_CHAR ? 3 \
159 : (c) <= MAX_4_BYTE_CHAR ? 4 \
160 : (c) <= MAX_5_BYTE_CHAR ? 5 \
161 : 2)
162
163
164 /* Return the leading code of multibyte form of C. */
165 #define CHAR_LEADING_CODE(c) \
166 ((c) <= MAX_1_BYTE_CHAR ? c \
167 : (c) <= MAX_2_BYTE_CHAR ? (0xC0 | ((c) >> 6)) \
168 : (c) <= MAX_3_BYTE_CHAR ? (0xE0 | ((c) >> 12)) \
169 : (c) <= MAX_4_BYTE_CHAR ? (0xF0 | ((c) >> 18)) \
170 : (c) <= MAX_5_BYTE_CHAR ? 0xF8 \
171 : (0xC0 | (((c) >> 6) & 0x01)))
172
173
174 /* Store multibyte form of the character C in P. The caller should
175 allocate at least MAX_MULTIBYTE_LENGTH bytes area at P in advance.
176 Returns the length of the multibyte form. */
177
178 #define CHAR_STRING(c, p) \
179 (UNSIGNED_CMP (c, <=, MAX_1_BYTE_CHAR) \
180 ? ((p)[0] = (c), \
181 1) \
182 : UNSIGNED_CMP (c, <=, MAX_2_BYTE_CHAR) \
183 ? ((p)[0] = (0xC0 | ((c) >> 6)), \
184 (p)[1] = (0x80 | ((c) & 0x3F)), \
185 2) \
186 : UNSIGNED_CMP (c, <=, MAX_3_BYTE_CHAR) \
187 ? ((p)[0] = (0xE0 | ((c) >> 12)), \
188 (p)[1] = (0x80 | (((c) >> 6) & 0x3F)), \
189 (p)[2] = (0x80 | ((c) & 0x3F)), \
190 3) \
191 : verify_expr (sizeof (c) <= sizeof (unsigned), char_string (c, p)))
192
193 /* Store multibyte form of byte B in P. The caller should allocate at
194 least MAX_MULTIBYTE_LENGTH bytes area at P in advance. Returns the
195 length of the multibyte form. */
196
197 #define BYTE8_STRING(b, p) \
198 ((p)[0] = (0xC0 | (((b) >> 6) & 0x01)), \
199 (p)[1] = (0x80 | ((b) & 0x3F)), \
200 2)
201
202
203 /* Store multibyte form of the character C in P and advance P to the
204 end of the multibyte form. The caller should allocate at least
205 MAX_MULTIBYTE_LENGTH bytes area at P in advance. */
206
207 #define CHAR_STRING_ADVANCE(c, p) \
208 do { \
209 if ((c) <= MAX_1_BYTE_CHAR) \
210 *(p)++ = (c); \
211 else if ((c) <= MAX_2_BYTE_CHAR) \
212 *(p)++ = (0xC0 | ((c) >> 6)), \
213 *(p)++ = (0x80 | ((c) & 0x3F)); \
214 else if ((c) <= MAX_3_BYTE_CHAR) \
215 *(p)++ = (0xE0 | ((c) >> 12)), \
216 *(p)++ = (0x80 | (((c) >> 6) & 0x3F)), \
217 *(p)++ = (0x80 | ((c) & 0x3F)); \
218 else \
219 { \
220 verify (sizeof (c) <= sizeof (unsigned)); \
221 (p) += char_string (c, p); \
222 } \
223 } while (false)
224
225
226 /* Nonzero iff BYTE starts a non-ASCII character in a multibyte
227 form. */
228 #define LEADING_CODE_P(byte) (((byte) & 0xC0) == 0xC0)
229
230 /* Nonzero iff BYTE is a trailing code of a non-ASCII character in a
231 multibyte form. */
232 #define TRAILING_CODE_P(byte) (((byte) & 0xC0) == 0x80)
233
234 /* Nonzero iff BYTE starts a character in a multibyte form.
235 This is equivalent to:
236 (ASCII_CHAR_P (byte) || LEADING_CODE_P (byte)) */
237 #define CHAR_HEAD_P(byte) (((byte) & 0xC0) != 0x80)
238
239 /* How many bytes a character that starts with BYTE occupies in a
240 multibyte form. Unlike MULTIBYTE_LENGTH below, this macro does not
241 validate the multibyte form, but looks only at its first byte. */
242 #define BYTES_BY_CHAR_HEAD(byte) \
243 (!((byte) & 0x80) ? 1 \
244 : !((byte) & 0x20) ? 2 \
245 : !((byte) & 0x10) ? 3 \
246 : !((byte) & 0x08) ? 4 \
247 : 5)
248
249
250 /* The byte length of multibyte form at unibyte string P ending at
251 PEND. If the string doesn't point to a valid multibyte form,
252 return 0. Unlike BYTES_BY_CHAR_HEAD, this macro validates the
253 multibyte form. */
254
255 #define MULTIBYTE_LENGTH(p, pend) \
256 (p >= pend ? 0 \
257 : !((p)[0] & 0x80) ? 1 \
258 : ((p + 1 >= pend) || (((p)[1] & 0xC0) != 0x80)) ? 0 \
259 : ((p)[0] & 0xE0) == 0xC0 ? 2 \
260 : ((p + 2 >= pend) || (((p)[2] & 0xC0) != 0x80)) ? 0 \
261 : ((p)[0] & 0xF0) == 0xE0 ? 3 \
262 : ((p + 3 >= pend) || (((p)[3] & 0xC0) != 0x80)) ? 0 \
263 : ((p)[0] & 0xF8) == 0xF0 ? 4 \
264 : ((p + 4 >= pend) || (((p)[4] & 0xC0) != 0x80)) ? 0 \
265 : (p)[0] == 0xF8 && ((p)[1] & 0xF0) == 0x80 ? 5 \
266 : 0)
267
268
269 /* Like MULTIBYTE_LENGTH, but don't check the ending address. The
270 multibyte form is still validated, unlike BYTES_BY_CHAR_HEAD. */
271
272 #define MULTIBYTE_LENGTH_NO_CHECK(p) \
273 (!((p)[0] & 0x80) ? 1 \
274 : ((p)[1] & 0xC0) != 0x80 ? 0 \
275 : ((p)[0] & 0xE0) == 0xC0 ? 2 \
276 : ((p)[2] & 0xC0) != 0x80 ? 0 \
277 : ((p)[0] & 0xF0) == 0xE0 ? 3 \
278 : ((p)[3] & 0xC0) != 0x80 ? 0 \
279 : ((p)[0] & 0xF8) == 0xF0 ? 4 \
280 : ((p)[4] & 0xC0) != 0x80 ? 0 \
281 : (p)[0] == 0xF8 && ((p)[1] & 0xF0) == 0x80 ? 5 \
282 : 0)
283
284 /* If P is before LIMIT, advance P to the next character boundary.
285 Assumes that P is already at a character boundary of the same
286 multibyte form whose end address is LIMIT. */
287
288 #define NEXT_CHAR_BOUNDARY(p, limit) \
289 do { \
290 if ((p) < (limit)) \
291 (p) += BYTES_BY_CHAR_HEAD (*(p)); \
292 } while (false)
293
294
295 /* If P is after LIMIT, advance P to the previous character boundary.
296 Assumes that P is already at a character boundary of the same
297 multibyte form whose beginning address is LIMIT. */
298
299 #define PREV_CHAR_BOUNDARY(p, limit) \
300 do { \
301 if ((p) > (limit)) \
302 { \
303 const unsigned char *chp = (p); \
304 do { \
305 chp--; \
306 } while (chp >= limit && ! CHAR_HEAD_P (*chp)); \
307 (p) = (BYTES_BY_CHAR_HEAD (*chp) == (p) - chp) ? chp : (p) - 1; \
308 } \
309 } while (false)
310
311 /* Return the character code of character whose multibyte form is at
312 P. Note that this macro unifies CJK characters whose codepoints
313 are in the Private Use Areas (PUAs), so it might return a different
314 codepoint from the one actually stored at P. */
315
316 #define STRING_CHAR(p) \
317 (!((p)[0] & 0x80) \
318 ? (p)[0] \
319 : ! ((p)[0] & 0x20) \
320 ? (((((p)[0] & 0x1F) << 6) \
321 | ((p)[1] & 0x3F)) \
322 + (((unsigned char) (p)[0]) < 0xC2 ? 0x3FFF80 : 0)) \
323 : ! ((p)[0] & 0x10) \
324 ? ((((p)[0] & 0x0F) << 12) \
325 | (((p)[1] & 0x3F) << 6) \
326 | ((p)[2] & 0x3F)) \
327 : string_char ((p), NULL, NULL))
328
329
330 /* Like STRING_CHAR, but set ACTUAL_LEN to the length of multibyte
331 form. */
332
333 #define STRING_CHAR_AND_LENGTH(p, actual_len) \
334 (!((p)[0] & 0x80) \
335 ? ((actual_len) = 1, (p)[0]) \
336 : ! ((p)[0] & 0x20) \
337 ? ((actual_len) = 2, \
338 (((((p)[0] & 0x1F) << 6) \
339 | ((p)[1] & 0x3F)) \
340 + (((unsigned char) (p)[0]) < 0xC2 ? 0x3FFF80 : 0))) \
341 : ! ((p)[0] & 0x10) \
342 ? ((actual_len) = 3, \
343 ((((p)[0] & 0x0F) << 12) \
344 | (((p)[1] & 0x3F) << 6) \
345 | ((p)[2] & 0x3F))) \
346 : string_char ((p), NULL, &actual_len))
347
348
349 /* Like STRING_CHAR, but advance P to the end of multibyte form. */
350
351 #define STRING_CHAR_ADVANCE(p) \
352 (!((p)[0] & 0x80) \
353 ? *(p)++ \
354 : ! ((p)[0] & 0x20) \
355 ? ((p) += 2, \
356 ((((p)[-2] & 0x1F) << 6) \
357 | ((p)[-1] & 0x3F) \
358 | ((unsigned char) ((p)[-2]) < 0xC2 ? 0x3FFF80 : 0))) \
359 : ! ((p)[0] & 0x10) \
360 ? ((p) += 3, \
361 ((((p)[-3] & 0x0F) << 12) \
362 | (((p)[-2] & 0x3F) << 6) \
363 | ((p)[-1] & 0x3F))) \
364 : string_char ((p), &(p), NULL))
365
366
367 /* Fetch the "next" character from Lisp string STRING at byte position
368 BYTEIDX, character position CHARIDX. Store it into OUTPUT.
369
370 All the args must be side-effect-free.
371 BYTEIDX and CHARIDX must be lvalues;
372 we increment them past the character fetched. */
373
374 #define FETCH_STRING_CHAR_ADVANCE(OUTPUT, STRING, CHARIDX, BYTEIDX) \
375 do \
376 { \
377 CHARIDX++; \
378 if (STRING_MULTIBYTE (STRING)) \
379 { \
380 unsigned char *chp = &SDATA (STRING)[BYTEIDX]; \
381 int chlen; \
382 \
383 OUTPUT = STRING_CHAR_AND_LENGTH (chp, chlen); \
384 BYTEIDX += chlen; \
385 } \
386 else \
387 { \
388 OUTPUT = SREF (STRING, BYTEIDX); \
389 BYTEIDX++; \
390 } \
391 } \
392 while (false)
393
394 /* Like FETCH_STRING_CHAR_ADVANCE, but return a multibyte character
395 even if STRING is unibyte. */
396
397 #define FETCH_STRING_CHAR_AS_MULTIBYTE_ADVANCE(OUTPUT, STRING, CHARIDX, BYTEIDX) \
398 do \
399 { \
400 CHARIDX++; \
401 if (STRING_MULTIBYTE (STRING)) \
402 { \
403 unsigned char *chp = &SDATA (STRING)[BYTEIDX]; \
404 int chlen; \
405 \
406 OUTPUT = STRING_CHAR_AND_LENGTH (chp, chlen); \
407 BYTEIDX += chlen; \
408 } \
409 else \
410 { \
411 OUTPUT = SREF (STRING, BYTEIDX); \
412 BYTEIDX++; \
413 MAKE_CHAR_MULTIBYTE (OUTPUT); \
414 } \
415 } \
416 while (false)
417
418
419 /* Like FETCH_STRING_CHAR_ADVANCE, but assumes STRING is multibyte. */
420
421 #define FETCH_STRING_CHAR_ADVANCE_NO_CHECK(OUTPUT, STRING, CHARIDX, BYTEIDX) \
422 do \
423 { \
424 unsigned char *fetch_ptr = &SDATA (STRING)[BYTEIDX]; \
425 int fetch_len; \
426 \
427 OUTPUT = STRING_CHAR_AND_LENGTH (fetch_ptr, fetch_len); \
428 BYTEIDX += fetch_len; \
429 CHARIDX++; \
430 } \
431 while (false)
432
433
434 /* Like FETCH_STRING_CHAR_ADVANCE, but fetch character from the current
435 buffer. */
436
437 #define FETCH_CHAR_ADVANCE(OUTPUT, CHARIDX, BYTEIDX) \
438 do \
439 { \
440 CHARIDX++; \
441 if (!NILP (BVAR (current_buffer, enable_multibyte_characters))) \
442 { \
443 unsigned char *chp = BYTE_POS_ADDR (BYTEIDX); \
444 int chlen; \
445 \
446 OUTPUT = STRING_CHAR_AND_LENGTH (chp, chlen); \
447 BYTEIDX += chlen; \
448 } \
449 else \
450 { \
451 OUTPUT = *(BYTE_POS_ADDR (BYTEIDX)); \
452 BYTEIDX++; \
453 } \
454 } \
455 while (false)
456
457
458 /* Like FETCH_CHAR_ADVANCE, but assumes the current buffer is multibyte. */
459
460 #define FETCH_CHAR_ADVANCE_NO_CHECK(OUTPUT, CHARIDX, BYTEIDX) \
461 do \
462 { \
463 unsigned char *chp = BYTE_POS_ADDR (BYTEIDX); \
464 int chlen; \
465 \
466 OUTPUT = STRING_CHAR_AND_LENGTH (chp, chlen); \
467 BYTEIDX += chlen; \
468 CHARIDX++; \
469 } \
470 while (false)
471
472
473 /* Increment the buffer byte position POS_BYTE of the current buffer to
474 the next character boundary. No range checking of POS. */
475
476 #define INC_POS(pos_byte) \
477 do { \
478 unsigned char *chp = BYTE_POS_ADDR (pos_byte); \
479 pos_byte += BYTES_BY_CHAR_HEAD (*chp); \
480 } while (false)
481
482
483 /* Decrement the buffer byte position POS_BYTE of the current buffer to
484 the previous character boundary. No range checking of POS. */
485
486 #define DEC_POS(pos_byte) \
487 do { \
488 unsigned char *chp; \
489 \
490 pos_byte--; \
491 if (pos_byte < GPT_BYTE) \
492 chp = BEG_ADDR + pos_byte - BEG_BYTE; \
493 else \
494 chp = BEG_ADDR + GAP_SIZE + pos_byte - BEG_BYTE; \
495 while (!CHAR_HEAD_P (*chp)) \
496 { \
497 chp--; \
498 pos_byte--; \
499 } \
500 } while (false)
501
502 /* Increment both CHARPOS and BYTEPOS, each in the appropriate way. */
503
504 #define INC_BOTH(charpos, bytepos) \
505 do \
506 { \
507 (charpos)++; \
508 if (NILP (BVAR (current_buffer, enable_multibyte_characters))) \
509 (bytepos)++; \
510 else \
511 INC_POS ((bytepos)); \
512 } \
513 while (false)
514
515
516 /* Decrement both CHARPOS and BYTEPOS, each in the appropriate way. */
517
518 #define DEC_BOTH(charpos, bytepos) \
519 do \
520 { \
521 (charpos)--; \
522 if (NILP (BVAR (current_buffer, enable_multibyte_characters))) \
523 (bytepos)--; \
524 else \
525 DEC_POS ((bytepos)); \
526 } \
527 while (false)
528
529
530 /* Increment the buffer byte position POS_BYTE of the current buffer to
531 the next character boundary. This macro relies on the fact that
532 *GPT_ADDR and *Z_ADDR are always accessible and the values are
533 '\0'. No range checking of POS_BYTE. */
534
535 #define BUF_INC_POS(buf, pos_byte) \
536 do { \
537 unsigned char *chp = BUF_BYTE_ADDRESS (buf, pos_byte); \
538 pos_byte += BYTES_BY_CHAR_HEAD (*chp); \
539 } while (false)
540
541
542 /* Decrement the buffer byte position POS_BYTE of the current buffer to
543 the previous character boundary. No range checking of POS_BYTE. */
544
545 #define BUF_DEC_POS(buf, pos_byte) \
546 do { \
547 unsigned char *chp; \
548 pos_byte--; \
549 if (pos_byte < BUF_GPT_BYTE (buf)) \
550 chp = BUF_BEG_ADDR (buf) + pos_byte - BEG_BYTE; \
551 else \
552 chp = BUF_BEG_ADDR (buf) + BUF_GAP_SIZE (buf) + pos_byte - BEG_BYTE;\
553 while (!CHAR_HEAD_P (*chp)) \
554 { \
555 chp--; \
556 pos_byte--; \
557 } \
558 } while (false)
559
560
561 /* Return a non-outlandish value for the tab width. */
562
563 #define SANE_TAB_WIDTH(buf) \
564 sanitize_tab_width (XFASTINT (BVAR (buf, tab_width)))
565 INLINE int
566 sanitize_tab_width (EMACS_INT width)
567 {
568 return 0 < width && width <= 1000 ? width : 8;
569 }
570
571 /* Return the width of ASCII character C. The width is measured by
572 how many columns C will occupy on the screen when displayed in the
573 current buffer. */
574
575 #define ASCII_CHAR_WIDTH(c) \
576 (c < 0x20 \
577 ? (c == '\t' \
578 ? SANE_TAB_WIDTH (current_buffer) \
579 : (c == '\n' ? 0 : (NILP (BVAR (current_buffer, ctl_arrow)) ? 4 : 2))) \
580 : (c < 0x7f \
581 ? 1 \
582 : ((NILP (BVAR (current_buffer, ctl_arrow)) ? 4 : 2))))
583
584 /* Return a non-outlandish value for a character width. */
585
586 INLINE int
587 sanitize_char_width (EMACS_INT width)
588 {
589 return 0 <= width && width <= 1000 ? width : 1000;
590 }
591
592 /* Return the width of character C. The width is measured by how many
593 columns C will occupy on the screen when displayed in the current
594 buffer. */
595
596 #define CHAR_WIDTH(c) \
597 (ASCII_CHAR_P (c) \
598 ? ASCII_CHAR_WIDTH (c) \
599 : sanitize_char_width (XINT (CHAR_TABLE_REF (Vchar_width_table, c))))
600
601 /* If C is a variation selector, return the index of the
602 variation selector (1..256). Otherwise, return 0. */
603
604 #define CHAR_VARIATION_SELECTOR_P(c) \
605 ((c) < 0xFE00 ? 0 \
606 : (c) <= 0xFE0F ? (c) - 0xFE00 + 1 \
607 : (c) < 0xE0100 ? 0 \
608 : (c) <= 0xE01EF ? (c) - 0xE0100 + 17 \
609 : 0)
610
611 /* Return true if C is a surrogate. */
612
613 INLINE bool
614 char_surrogate_p (int c)
615 {
616 return 0xD800 <= c && c <= 0xDFFF;
617 }
618
619 /* Data type for Unicode general category.
620
621 The order of members must be in sync with the 8th element of the
622 member of unidata-prop-alist (in admin/unidata/unidata-gen.el) for
623 Unicode character property `general-category'. */
624
625 typedef enum {
626 UNICODE_CATEGORY_UNKNOWN = 0,
627 UNICODE_CATEGORY_Lu,
628 UNICODE_CATEGORY_Ll,
629 UNICODE_CATEGORY_Lt,
630 UNICODE_CATEGORY_Lm,
631 UNICODE_CATEGORY_Lo,
632 UNICODE_CATEGORY_Mn,
633 UNICODE_CATEGORY_Mc,
634 UNICODE_CATEGORY_Me,
635 UNICODE_CATEGORY_Nd,
636 UNICODE_CATEGORY_Nl,
637 UNICODE_CATEGORY_No,
638 UNICODE_CATEGORY_Pc,
639 UNICODE_CATEGORY_Pd,
640 UNICODE_CATEGORY_Ps,
641 UNICODE_CATEGORY_Pe,
642 UNICODE_CATEGORY_Pi,
643 UNICODE_CATEGORY_Pf,
644 UNICODE_CATEGORY_Po,
645 UNICODE_CATEGORY_Sm,
646 UNICODE_CATEGORY_Sc,
647 UNICODE_CATEGORY_Sk,
648 UNICODE_CATEGORY_So,
649 UNICODE_CATEGORY_Zs,
650 UNICODE_CATEGORY_Zl,
651 UNICODE_CATEGORY_Zp,
652 UNICODE_CATEGORY_Cc,
653 UNICODE_CATEGORY_Cf,
654 UNICODE_CATEGORY_Cs,
655 UNICODE_CATEGORY_Co,
656 UNICODE_CATEGORY_Cn
657 } unicode_category_t;
658
659 extern EMACS_INT char_resolve_modifier_mask (EMACS_INT) ATTRIBUTE_CONST;
660 extern int char_string (unsigned, unsigned char *);
661 extern int string_char (const unsigned char *,
662 const unsigned char **, int *);
663
664 extern int translate_char (Lisp_Object, int c);
665 extern ptrdiff_t count_size_as_multibyte (const unsigned char *, ptrdiff_t);
666 extern ptrdiff_t str_as_multibyte (unsigned char *, ptrdiff_t, ptrdiff_t,
667 ptrdiff_t *);
668 extern ptrdiff_t str_to_multibyte (unsigned char *, ptrdiff_t, ptrdiff_t);
669 extern ptrdiff_t str_as_unibyte (unsigned char *, ptrdiff_t);
670 extern ptrdiff_t str_to_unibyte (const unsigned char *, unsigned char *,
671 ptrdiff_t);
672 extern ptrdiff_t strwidth (const char *, ptrdiff_t);
673 extern ptrdiff_t c_string_width (const unsigned char *, ptrdiff_t, int,
674 ptrdiff_t *, ptrdiff_t *);
675 extern ptrdiff_t lisp_string_width (Lisp_Object, ptrdiff_t,
676 ptrdiff_t *, ptrdiff_t *);
677
678 extern Lisp_Object Vchar_unify_table;
679 extern Lisp_Object string_escape_byte8 (Lisp_Object);
680
681 extern bool alphabeticp (int);
682 extern bool decimalnump (int);
683 extern bool graphicp (int);
684 extern bool printablep (int);
685
686 /* Return a translation table of id number ID. */
687 #define GET_TRANSLATION_TABLE(id) \
688 (XCDR (XVECTOR (Vtranslation_table_vector)->contents[(id)]))
689
690 /* Look up the element in char table OBJ at index CH, and return it as
691 an integer. If the element is not a character, return CH itself. */
692
693 INLINE int
694 char_table_translate (Lisp_Object obj, int ch)
695 {
696 /* This internal function is expected to be called with valid arguments,
697 so there is a eassert instead of CHECK_xxx for the sake of speed. */
698 eassert (CHAR_VALID_P (ch));
699 eassert (CHAR_TABLE_P (obj));
700 obj = CHAR_TABLE_REF (obj, ch);
701 return CHARACTERP (obj) ? XINT (obj) : ch;
702 }
703
704 INLINE_HEADER_END
705
706 #endif /* EMACS_CHARACTER_H */
Emacs repository mirror