* xdisp.c: Integer overflow fix.
[emacs.git] / src / category.c
bloba822bb654b0485f228b881a46f74eab726f5b04f
1 /* GNU Emacs routines to deal with category tables.
3 Copyright (C) 1998, 2001-2011 Free Software Foundation, Inc.
4 Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
5 2005, 2006, 2007, 2008, 2009, 2010, 2011
6 National Institute of Advanced Industrial Science and Technology (AIST)
7 Registration Number H14PRO021
8 Copyright (C) 2003
9 National Institute of Advanced Industrial Science and Technology (AIST)
10 Registration Number H13PRO009
12 This file is part of GNU Emacs.
14 GNU Emacs is free software: you can redistribute it and/or modify
15 it under the terms of the GNU General Public License as published by
16 the Free Software Foundation, either version 3 of the License, or
17 (at your option) any later version.
19 GNU Emacs is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 GNU General Public License for more details.
24 You should have received a copy of the GNU General Public License
25 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
28 /* Here we handle three objects: category, category set, and category
29 table. Read comments in the file category.h to understand them. */
31 #include <config.h>
32 #include <ctype.h>
33 #include <setjmp.h>
34 #include "lisp.h"
35 #include "buffer.h"
36 #include "character.h"
37 #include "charset.h"
38 #include "category.h"
39 #include "keymap.h"
41 /* The version number of the latest category table. Each category
42 table has a unique version number. It is assigned a new number
43 also when it is modified. When a regular expression is compiled
44 into the struct re_pattern_buffer, the version number of the
45 category table (of the current buffer) at that moment is also
46 embedded in the structure.
48 For the moment, we are not using this feature. */
49 static int category_table_version;
51 static Lisp_Object Qcategory_table, Qcategoryp, Qcategorysetp, Qcategory_table_p;
53 /* Temporary internal variable used in macro CHAR_HAS_CATEGORY. */
54 Lisp_Object _temp_category_set;
56 /* Make CATEGORY_SET includes (if VAL is t) or excludes (if VAL is
57 nil) CATEGORY. */
58 #define SET_CATEGORY_SET(category_set, category, val) \
59 set_category_set (category_set, category, val)
60 static void set_category_set (Lisp_Object, Lisp_Object, Lisp_Object);
62 /* Category set staff. */
64 static Lisp_Object hash_get_category_set (Lisp_Object, Lisp_Object);
66 static Lisp_Object
67 hash_get_category_set (Lisp_Object table, Lisp_Object category_set)
69 struct Lisp_Hash_Table *h;
70 ptrdiff_t i;
71 EMACS_UINT hash;
73 if (NILP (XCHAR_TABLE (table)->extras[1]))
74 XCHAR_TABLE (table)->extras[1]
75 = make_hash_table (Qequal, make_number (DEFAULT_HASH_SIZE),
76 make_float (DEFAULT_REHASH_SIZE),
77 make_float (DEFAULT_REHASH_THRESHOLD),
78 Qnil, Qnil, Qnil);
79 h = XHASH_TABLE (XCHAR_TABLE (table)->extras[1]);
80 i = hash_lookup (h, category_set, &hash);
81 if (i >= 0)
82 return HASH_KEY (h, i);
83 hash_put (h, category_set, Qnil, hash);
84 return category_set;
88 DEFUN ("make-category-set", Fmake_category_set, Smake_category_set, 1, 1, 0,
89 doc: /* Return a newly created category-set which contains CATEGORIES.
90 CATEGORIES is a string of category mnemonics.
91 The value is a bool-vector which has t at the indices corresponding to
92 those categories. */)
93 (Lisp_Object categories)
95 Lisp_Object val;
96 int len;
98 CHECK_STRING (categories);
99 val = MAKE_CATEGORY_SET;
101 if (STRING_MULTIBYTE (categories))
102 error ("Multibyte string in `make-category-set'");
104 len = SCHARS (categories);
105 while (--len >= 0)
107 Lisp_Object category;
109 XSETFASTINT (category, SREF (categories, len));
110 CHECK_CATEGORY (category);
111 SET_CATEGORY_SET (val, category, Qt);
113 return val;
117 /* Category staff. */
119 static Lisp_Object check_category_table (Lisp_Object table);
121 DEFUN ("define-category", Fdefine_category, Sdefine_category, 2, 3, 0,
122 doc: /* Define CATEGORY as a category which is described by DOCSTRING.
123 CATEGORY should be an ASCII printing character in the range ` ' to `~'.
124 DOCSTRING is the documentation string of the category. The first line
125 should be a terse text (preferably less than 16 characters),
126 and the rest lines should be the full description.
127 The category is defined only in category table TABLE, which defaults to
128 the current buffer's category table. */)
129 (Lisp_Object category, Lisp_Object docstring, Lisp_Object table)
131 CHECK_CATEGORY (category);
132 CHECK_STRING (docstring);
133 table = check_category_table (table);
135 if (!NILP (CATEGORY_DOCSTRING (table, XFASTINT (category))))
136 error ("Category `%c' is already defined", (int) XFASTINT (category));
137 if (!NILP (Vpurify_flag))
138 docstring = Fpurecopy (docstring);
139 CATEGORY_DOCSTRING (table, XFASTINT (category)) = docstring;
141 return Qnil;
144 DEFUN ("category-docstring", Fcategory_docstring, Scategory_docstring, 1, 2, 0,
145 doc: /* Return the documentation string of CATEGORY, as defined in TABLE.
146 TABLE should be a category table and defaults to the current buffer's
147 category table. */)
148 (Lisp_Object category, Lisp_Object table)
150 CHECK_CATEGORY (category);
151 table = check_category_table (table);
153 return CATEGORY_DOCSTRING (table, XFASTINT (category));
156 DEFUN ("get-unused-category", Fget_unused_category, Sget_unused_category,
157 0, 1, 0,
158 doc: /* Return a category which is not yet defined in TABLE.
159 If no category remains available, return nil.
160 The optional argument TABLE specifies which category table to modify;
161 it defaults to the current buffer's category table. */)
162 (Lisp_Object table)
164 int i;
166 table = check_category_table (table);
168 for (i = ' '; i <= '~'; i++)
169 if (NILP (CATEGORY_DOCSTRING (table, i)))
170 return make_number (i);
172 return Qnil;
176 /* Category-table staff. */
178 DEFUN ("category-table-p", Fcategory_table_p, Scategory_table_p, 1, 1, 0,
179 doc: /* Return t if ARG is a category table. */)
180 (Lisp_Object arg)
182 if (CHAR_TABLE_P (arg)
183 && EQ (XCHAR_TABLE (arg)->purpose, Qcategory_table))
184 return Qt;
185 return Qnil;
188 /* If TABLE is nil, return the current category table. If TABLE is
189 not nil, check the validity of TABLE as a category table. If
190 valid, return TABLE itself, but if not valid, signal an error of
191 wrong-type-argument. */
193 static Lisp_Object
194 check_category_table (Lisp_Object table)
196 if (NILP (table))
197 return BVAR (current_buffer, category_table);
198 CHECK_TYPE (!NILP (Fcategory_table_p (table)), Qcategory_table_p, table);
199 return table;
202 DEFUN ("category-table", Fcategory_table, Scategory_table, 0, 0, 0,
203 doc: /* Return the current category table.
204 This is the one specified by the current buffer. */)
205 (void)
207 return BVAR (current_buffer, category_table);
210 DEFUN ("standard-category-table", Fstandard_category_table,
211 Sstandard_category_table, 0, 0, 0,
212 doc: /* Return the standard category table.
213 This is the one used for new buffers. */)
214 (void)
216 return Vstandard_category_table;
220 static void
221 copy_category_entry (Lisp_Object table, Lisp_Object c, Lisp_Object val)
223 val = Fcopy_sequence (val);
224 if (CONSP (c))
225 char_table_set_range (table, XINT (XCAR (c)), XINT (XCDR (c)), val);
226 else
227 char_table_set (table, XINT (c), val);
230 /* Return a copy of category table TABLE. We can't simply use the
231 function copy-sequence because no contents should be shared between
232 the original and the copy. This function is called recursively by
233 binding TABLE to a sub char table. */
235 static Lisp_Object
236 copy_category_table (Lisp_Object table)
238 table = copy_char_table (table);
240 if (! NILP (XCHAR_TABLE (table)->defalt))
241 XCHAR_TABLE (table)->defalt
242 = Fcopy_sequence (XCHAR_TABLE (table)->defalt);
243 XCHAR_TABLE (table)->extras[0]
244 = Fcopy_sequence (XCHAR_TABLE (table)->extras[0]);
245 map_char_table (copy_category_entry, Qnil, table, table);
247 return table;
250 DEFUN ("copy-category-table", Fcopy_category_table, Scopy_category_table,
251 0, 1, 0,
252 doc: /* Construct a new category table and return it.
253 It is a copy of the TABLE, which defaults to the standard category table. */)
254 (Lisp_Object table)
256 if (!NILP (table))
257 check_category_table (table);
258 else
259 table = Vstandard_category_table;
261 return copy_category_table (table);
264 DEFUN ("make-category-table", Fmake_category_table, Smake_category_table,
265 0, 0, 0,
266 doc: /* Construct a new and empty category table and return it. */)
267 (void)
269 Lisp_Object val;
270 int i;
272 val = Fmake_char_table (Qcategory_table, Qnil);
273 XCHAR_TABLE (val)->defalt = MAKE_CATEGORY_SET;
274 for (i = 0; i < (1 << CHARTAB_SIZE_BITS_0); i++)
275 XCHAR_TABLE (val)->contents[i] = MAKE_CATEGORY_SET;
276 Fset_char_table_extra_slot (val, make_number (0),
277 Fmake_vector (make_number (95), Qnil));
278 return val;
281 DEFUN ("set-category-table", Fset_category_table, Sset_category_table, 1, 1, 0,
282 doc: /* Specify TABLE as the category table for the current buffer.
283 Return TABLE. */)
284 (Lisp_Object table)
286 int idx;
287 table = check_category_table (table);
288 BVAR (current_buffer, category_table) = table;
289 /* Indicate that this buffer now has a specified category table. */
290 idx = PER_BUFFER_VAR_IDX (category_table);
291 SET_PER_BUFFER_VALUE_P (current_buffer, idx, 1);
292 return table;
296 Lisp_Object
297 char_category_set (int c)
299 return CHAR_TABLE_REF (BVAR (current_buffer, category_table), c);
302 DEFUN ("char-category-set", Fchar_category_set, Schar_category_set, 1, 1, 0,
303 doc: /* Return the category set of CHAR.
304 usage: (char-category-set CHAR) */)
305 (Lisp_Object ch)
307 CHECK_NUMBER (ch);
308 return CATEGORY_SET (XFASTINT (ch));
311 DEFUN ("category-set-mnemonics", Fcategory_set_mnemonics,
312 Scategory_set_mnemonics, 1, 1, 0,
313 doc: /* Return a string containing mnemonics of the categories in CATEGORY-SET.
314 CATEGORY-SET is a bool-vector, and the categories \"in\" it are those
315 that are indexes where t occurs in the bool-vector.
316 The return value is a string containing those same categories. */)
317 (Lisp_Object category_set)
319 int i, j;
320 char str[96];
322 CHECK_CATEGORY_SET (category_set);
324 j = 0;
325 for (i = 32; i < 127; i++)
326 if (CATEGORY_MEMBER (i, category_set))
327 str[j++] = i;
328 str[j] = '\0';
330 return build_string (str);
333 static void
334 set_category_set (Lisp_Object category_set, Lisp_Object category, Lisp_Object val)
336 do {
337 int idx = XINT (category) / 8;
338 unsigned char bits = 1 << (XINT (category) % 8);
340 if (NILP (val))
341 XCATEGORY_SET (category_set)->data[idx] &= ~bits;
342 else
343 XCATEGORY_SET (category_set)->data[idx] |= bits;
344 } while (0);
347 DEFUN ("modify-category-entry", Fmodify_category_entry,
348 Smodify_category_entry, 2, 4, 0,
349 doc: /* Modify the category set of CHARACTER by adding CATEGORY to it.
350 The category is changed only for table TABLE, which defaults to
351 the current buffer's category table.
352 CHARACTER can be either a single character or a cons representing the
353 lower and upper ends of an inclusive character range to modify.
354 If optional fourth argument RESET is non-nil,
355 then delete CATEGORY from the category set instead of adding it. */)
356 (Lisp_Object character, Lisp_Object category, Lisp_Object table, Lisp_Object reset)
358 Lisp_Object set_value; /* Actual value to be set in category sets. */
359 Lisp_Object category_set;
360 int start, end;
361 int from, to;
363 if (INTEGERP (character))
365 CHECK_CHARACTER (character);
366 start = end = XFASTINT (character);
368 else
370 CHECK_CONS (character);
371 CHECK_CHARACTER_CAR (character);
372 CHECK_CHARACTER_CDR (character);
373 start = XFASTINT (XCAR (character));
374 end = XFASTINT (XCDR (character));
377 CHECK_CATEGORY (category);
378 table = check_category_table (table);
380 if (NILP (CATEGORY_DOCSTRING (table, XFASTINT (category))))
381 error ("Undefined category: %c", (int) XFASTINT (category));
383 set_value = NILP (reset) ? Qt : Qnil;
385 while (start <= end)
387 from = start, to = end;
388 category_set = char_table_ref_and_range (table, start, &from, &to);
389 if (CATEGORY_MEMBER (XFASTINT (category), category_set) != NILP (reset))
391 category_set = Fcopy_sequence (category_set);
392 SET_CATEGORY_SET (category_set, category, set_value);
393 category_set = hash_get_category_set (table, category_set);
394 char_table_set_range (table, start, to, category_set);
396 start = to + 1;
399 return Qnil;
402 /* Return 1 if there is a word boundary between two word-constituent
403 characters C1 and C2 if they appear in this order, else return 0.
404 Use the macro WORD_BOUNDARY_P instead of calling this function
405 directly. */
408 word_boundary_p (int c1, int c2)
410 Lisp_Object category_set1, category_set2;
411 Lisp_Object tail;
412 int default_result;
414 if (EQ (CHAR_TABLE_REF (Vchar_script_table, c1),
415 CHAR_TABLE_REF (Vchar_script_table, c2)))
417 tail = Vword_separating_categories;
418 default_result = 0;
420 else
422 tail = Vword_combining_categories;
423 default_result = 1;
426 category_set1 = CATEGORY_SET (c1);
427 if (NILP (category_set1))
428 return default_result;
429 category_set2 = CATEGORY_SET (c2);
430 if (NILP (category_set2))
431 return default_result;
433 for (; CONSP (tail); tail = XCDR (tail))
435 Lisp_Object elt = XCAR (tail);
437 if (CONSP (elt)
438 && (NILP (XCAR (elt))
439 || (CATEGORYP (XCAR (elt))
440 && CATEGORY_MEMBER (XFASTINT (XCAR (elt)), category_set1)
441 && ! CATEGORY_MEMBER (XFASTINT (XCAR (elt)), category_set2)))
442 && (NILP (XCDR (elt))
443 || (CATEGORYP (XCDR (elt))
444 && ! CATEGORY_MEMBER (XFASTINT (XCDR (elt)), category_set1)
445 && CATEGORY_MEMBER (XFASTINT (XCDR (elt)), category_set2))))
446 return !default_result;
448 return default_result;
452 void
453 init_category_once (void)
455 /* This has to be done here, before we call Fmake_char_table. */
456 DEFSYM (Qcategory_table, "category-table");
458 /* Intern this now in case it isn't already done.
459 Setting this variable twice is harmless.
460 But don't staticpro it here--that is done in alloc.c. */
461 Qchar_table_extra_slots = intern_c_string ("char-table-extra-slots");
463 /* Now we are ready to set up this property, so we can
464 create category tables. */
465 Fput (Qcategory_table, Qchar_table_extra_slots, make_number (2));
467 Vstandard_category_table = Fmake_char_table (Qcategory_table, Qnil);
468 /* Set a category set which contains nothing to the default. */
469 XCHAR_TABLE (Vstandard_category_table)->defalt = MAKE_CATEGORY_SET;
470 Fset_char_table_extra_slot (Vstandard_category_table, make_number (0),
471 Fmake_vector (make_number (95), Qnil));
474 void
475 syms_of_category (void)
477 DEFSYM (Qcategoryp, "categoryp");
478 DEFSYM (Qcategorysetp, "categorysetp");
479 DEFSYM (Qcategory_table_p, "category-table-p");
481 DEFVAR_LISP ("word-combining-categories", Vword_combining_categories,
482 doc: /* List of pair (cons) of categories to determine word boundary.
484 Emacs treats a sequence of word constituent characters as a single
485 word (i.e. finds no word boundary between them) only if they belong to
486 the same script. But, exceptions are allowed in the following cases.
488 \(1) The case that characters are in different scripts is controlled
489 by the variable `word-combining-categories'.
491 Emacs finds no word boundary between characters of different scripts
492 if they have categories matching some element of this list.
494 More precisely, if an element of this list is a cons of category CAT1
495 and CAT2, and a multibyte character C1 which has CAT1 is followed by
496 C2 which has CAT2, there's no word boundary between C1 and C2.
498 For instance, to tell that Han characters followed by Hiragana
499 characters can form a single word, the element `(?C . ?H)' should be
500 in this list.
502 \(2) The case that character are in the same script is controlled by
503 the variable `word-separating-categories'.
505 Emacs finds a word boundary between characters of the same script
506 if they have categories matching some element of this list.
508 More precisely, if an element of this list is a cons of category CAT1
509 and CAT2, and a multibyte character C1 which has CAT1 but not CAT2 is
510 followed by C2 which has CAT2 but not CAT1, there's a word boundary
511 between C1 and C2.
513 For instance, to tell that there's a word boundary between Hiragana
514 and Katakana (both are in the same script `kana'),
515 the element `(?H . ?K) should be in this list. */);
517 Vword_combining_categories = Qnil;
519 DEFVAR_LISP ("word-separating-categories", Vword_separating_categories,
520 doc: /* List of pair (cons) of categories to determine word boundary.
521 See the documentation of the variable `word-combining-categories'. */);
523 Vword_separating_categories = Qnil;
525 defsubr (&Smake_category_set);
526 defsubr (&Sdefine_category);
527 defsubr (&Scategory_docstring);
528 defsubr (&Sget_unused_category);
529 defsubr (&Scategory_table_p);
530 defsubr (&Scategory_table);
531 defsubr (&Sstandard_category_table);
532 defsubr (&Scopy_category_table);
533 defsubr (&Smake_category_table);
534 defsubr (&Sset_category_table);
535 defsubr (&Schar_category_set);
536 defsubr (&Scategory_set_mnemonics);
537 defsubr (&Smodify_category_entry);
539 category_table_version = 0;