|
70
|
1 /* XEmacs routines to deal with char tables.
|
|
|
2 Copyright (C) 1992, 1995 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
|
4 Copyright (C) 1995, 1996 Ben Wing.
|
|
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: Mule 2.3. Not synched with FSF.
|
|
|
24
|
|
|
25 This file was written independently of the FSF implementation,
|
|
|
26 and is not compatible. */
|
|
|
27
|
|
|
28 /* Authorship:
|
|
|
29
|
|
|
30 Ben Wing: wrote, for 19.13 (Mule). Some category table stuff
|
|
|
31 loosely based on the original Mule.
|
|
104
|
32 Jareth Hein: fixed a couple of bugs in the implementation, and
|
|
|
33 added regex support for categories with check_category_at
|
|
70
|
34 */
|
|
|
35
|
|
|
36 #include <config.h>
|
|
|
37 #include "lisp.h"
|
|
|
38
|
|
|
39 #include "buffer.h"
|
|
|
40 #include "chartab.h"
|
|
|
41 #include "commands.h"
|
|
|
42 #include "syntax.h"
|
|
|
43
|
|
|
44 Lisp_Object Qchar_tablep, Qchar_table;
|
|
|
45
|
|
|
46 Lisp_Object Vall_syntax_tables;
|
|
|
47
|
|
|
48 #ifdef MULE
|
|
|
49 Lisp_Object Qcategory_table_p;
|
|
|
50 Lisp_Object Qcategory_designator_p;
|
|
|
51 Lisp_Object Qcategory_table_value_p;
|
|
|
52
|
|
|
53 Lisp_Object Vstandard_category_table;
|
|
183
|
54 #endif /* MULE */
|
|
70
|
55
|
|
|
56
|
|
|
57 /* A char table maps from ranges of characters to values.
|
|
|
58
|
|
|
59 Implementing a general data structure that maps from arbitrary
|
|
|
60 ranges of numbers to values is tricky to do efficiently. As it
|
|
183
|
61 happens, it should suffice (and is usually more convenient, anyway)
|
|
|
62 when dealing with characters to restrict the sorts of ranges that
|
|
|
63 can be assigned values, as follows:
|
|
70
|
64
|
|
|
65 1) All characters.
|
|
|
66 2) All characters in a charset.
|
|
|
67 3) All characters in a particular row of a charset, where a "row"
|
|
|
68 means all characters with the same first byte.
|
|
|
69 4) A particular character in a charset.
|
|
|
70
|
|
|
71 We use char tables to generalize the 256-element vectors now
|
|
|
72 littering the Emacs code.
|
|
|
73
|
|
|
74 Possible uses (all should be converted at some point):
|
|
|
75
|
|
|
76 1) category tables
|
|
|
77 2) syntax tables
|
|
|
78 3) display tables
|
|
|
79 4) case tables
|
|
|
80 5) keyboard-translate-table?
|
|
|
81
|
|
|
82 We do the very non-Stallman-esque thing of actually providing an
|
|
|
83 abstract type to generalize the Emacs vectors and Mule
|
|
|
84 vectors-of-vectors goo.
|
|
|
85 */
|
|
|
86
|
|
|
87 /************************************************************************/
|
|
183
|
88 /* Char Table object */
|
|
70
|
89 /************************************************************************/
|
|
|
90
|
|
|
91 #ifdef MULE
|
|
|
92
|
|
|
93 static Lisp_Object mark_char_table_entry (Lisp_Object, void (*) (Lisp_Object));
|
|
|
94 static int char_table_entry_equal (Lisp_Object, Lisp_Object, int depth);
|
|
|
95 static unsigned long char_table_entry_hash (Lisp_Object obj, int depth);
|
|
|
96 DEFINE_LRECORD_IMPLEMENTATION ("char-table-entry", char_table_entry,
|
|
|
97 mark_char_table_entry, internal_object_printer,
|
|
|
98 0, char_table_entry_equal,
|
|
|
99 char_table_entry_hash,
|
|
|
100 struct Lisp_Char_Table_Entry);
|
|
|
101
|
|
|
102 static Lisp_Object
|
|
|
103 mark_char_table_entry (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
104 {
|
|
|
105 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (obj);
|
|
|
106 int i;
|
|
|
107
|
|
|
108 for (i = 0; i < 96; i++)
|
|
|
109 {
|
|
|
110 (markobj) (cte->level2[i]);
|
|
|
111 }
|
|
|
112 return Qnil;
|
|
|
113 }
|
|
|
114
|
|
|
115 static int
|
|
|
116 char_table_entry_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
117 {
|
|
|
118 struct Lisp_Char_Table_Entry *cte1 = XCHAR_TABLE_ENTRY (obj1);
|
|
|
119 struct Lisp_Char_Table_Entry *cte2 = XCHAR_TABLE_ENTRY (obj2);
|
|
|
120 int i;
|
|
|
121
|
|
|
122 for (i = 0; i < 96; i++)
|
|
|
123 if (!internal_equal (cte1->level2[i], cte2->level2[i], depth + 1))
|
|
|
124 return 0;
|
|
|
125
|
|
|
126 return 1;
|
|
|
127 }
|
|
|
128
|
|
|
129 static unsigned long
|
|
|
130 char_table_entry_hash (Lisp_Object obj, int depth)
|
|
|
131 {
|
|
|
132 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (obj);
|
|
|
133
|
|
|
134 return internal_array_hash (cte->level2, 96, depth);
|
|
|
135 }
|
|
|
136
|
|
|
137 #endif /* MULE */
|
|
|
138
|
|
|
139 static Lisp_Object mark_char_table (Lisp_Object, void (*) (Lisp_Object));
|
|
|
140 static void print_char_table (Lisp_Object, Lisp_Object, int);
|
|
|
141 static int char_table_equal (Lisp_Object, Lisp_Object, int depth);
|
|
|
142 static unsigned long char_table_hash (Lisp_Object obj, int depth);
|
|
|
143 DEFINE_LRECORD_IMPLEMENTATION ("char-table", char_table,
|
|
|
144 mark_char_table, print_char_table, 0,
|
|
|
145 char_table_equal, char_table_hash,
|
|
|
146 struct Lisp_Char_Table);
|
|
|
147
|
|
|
148 static Lisp_Object
|
|
|
149 mark_char_table (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
150 {
|
|
|
151 struct Lisp_Char_Table *ct = XCHAR_TABLE (obj);
|
|
|
152 int i;
|
|
|
153
|
|
|
154 for (i = 0; i < NUM_ASCII_CHARS; i++)
|
|
|
155 (markobj) (ct->ascii[i]);
|
|
|
156 #ifdef MULE
|
|
|
157 for (i = 0; i < NUM_LEADING_BYTES; i++)
|
|
|
158 (markobj) (ct->level1[i]);
|
|
|
159 #endif
|
|
|
160 return ct->mirror_table;
|
|
|
161 }
|
|
|
162
|
|
|
163 /* WARNING: All functions of this nature need to be written extremely
|
|
|
164 carefully to avoid crashes during GC. Cf. prune_specifiers()
|
|
|
165 and prune_weak_hashtables(). */
|
|
|
166
|
|
|
167 void
|
|
|
168 prune_syntax_tables (int (*obj_marked_p) (Lisp_Object))
|
|
|
169 {
|
|
|
170 Lisp_Object rest, prev = Qnil;
|
|
|
171
|
|
|
172 for (rest = Vall_syntax_tables;
|
|
|
173 !GC_NILP (rest);
|
|
|
174 rest = XCHAR_TABLE (rest)->next_table)
|
|
|
175 {
|
|
|
176 if (! ((*obj_marked_p) (rest)))
|
|
|
177 {
|
|
|
178 /* This table is garbage. Remove it from the list. */
|
|
|
179 if (GC_NILP (prev))
|
|
|
180 Vall_syntax_tables = XCHAR_TABLE (rest)->next_table;
|
|
|
181 else
|
|
|
182 XCHAR_TABLE (prev)->next_table =
|
|
|
183 XCHAR_TABLE (rest)->next_table;
|
|
|
184 }
|
|
|
185 }
|
|
|
186 }
|
|
|
187
|
|
|
188 static Lisp_Object
|
|
|
189 char_table_type_to_symbol (enum char_table_type type)
|
|
|
190 {
|
|
|
191 switch (type)
|
|
|
192 {
|
|
|
193 case CHAR_TABLE_TYPE_GENERIC: return Qgeneric;
|
|
|
194 case CHAR_TABLE_TYPE_SYNTAX: return Qsyntax;
|
|
|
195 case CHAR_TABLE_TYPE_DISPLAY: return Qdisplay;
|
|
|
196 case CHAR_TABLE_TYPE_CHAR: return Qchar;
|
|
|
197 #ifdef MULE
|
|
|
198 case CHAR_TABLE_TYPE_CATEGORY: return Qcategory;
|
|
|
199 #endif
|
|
|
200 }
|
|
183
|
201
|
|
70
|
202 abort ();
|
|
|
203 return Qnil; /* not reached */
|
|
|
204 }
|
|
|
205
|
|
|
206 static enum char_table_type
|
|
|
207 symbol_to_char_table_type (Lisp_Object symbol)
|
|
|
208 {
|
|
|
209 CHECK_SYMBOL (symbol);
|
|
183
|
210
|
|
70
|
211 if (EQ (symbol, Qgeneric)) return CHAR_TABLE_TYPE_GENERIC;
|
|
|
212 if (EQ (symbol, Qsyntax)) return CHAR_TABLE_TYPE_SYNTAX;
|
|
|
213 if (EQ (symbol, Qdisplay)) return CHAR_TABLE_TYPE_DISPLAY;
|
|
|
214 if (EQ (symbol, Qchar)) return CHAR_TABLE_TYPE_CHAR;
|
|
|
215 #ifdef MULE
|
|
|
216 if (EQ (symbol, Qcategory)) return CHAR_TABLE_TYPE_CATEGORY;
|
|
|
217 #endif
|
|
183
|
218
|
|
70
|
219 signal_simple_error ("Unrecognized char table type", symbol);
|
|
|
220 return CHAR_TABLE_TYPE_GENERIC; /* not reached */
|
|
|
221 }
|
|
|
222
|
|
|
223 static void
|
|
|
224 print_chartab_range (Emchar first, Emchar last, Lisp_Object val,
|
|
|
225 Lisp_Object printcharfun)
|
|
|
226 {
|
|
|
227 if (first != last)
|
|
|
228 {
|
|
|
229 write_c_string (" (", printcharfun);
|
|
|
230 print_internal (make_char (first), printcharfun, 0);
|
|
|
231 write_c_string (" ", printcharfun);
|
|
|
232 print_internal (make_char (last), printcharfun, 0);
|
|
|
233 write_c_string (") ", printcharfun);
|
|
|
234 }
|
|
|
235 else
|
|
|
236 {
|
|
|
237 write_c_string (" ", printcharfun);
|
|
|
238 print_internal (make_char (first), printcharfun, 0);
|
|
|
239 write_c_string (" ", printcharfun);
|
|
|
240 }
|
|
|
241 print_internal (val, printcharfun, 1);
|
|
|
242 }
|
|
|
243
|
|
|
244 #ifdef MULE
|
|
|
245
|
|
|
246 static void
|
|
|
247 print_chartab_charset_row (Lisp_Object charset,
|
|
|
248 int row,
|
|
|
249 struct Lisp_Char_Table_Entry *cte,
|
|
|
250 Lisp_Object printcharfun)
|
|
|
251 {
|
|
|
252 int i;
|
|
|
253 Lisp_Object cat = Qunbound;
|
|
|
254 int first = -1;
|
|
|
255
|
|
|
256 for (i = 32; i < 128; i++)
|
|
|
257 {
|
|
|
258 Lisp_Object pam = cte->level2[i - 32];
|
|
|
259
|
|
|
260 if (first == -1)
|
|
|
261 {
|
|
|
262 first = i;
|
|
|
263 cat = pam;
|
|
|
264 continue;
|
|
|
265 }
|
|
|
266
|
|
|
267 if (!EQ (cat, pam))
|
|
|
268 {
|
|
|
269 if (row == -1)
|
|
|
270 print_chartab_range (MAKE_CHAR (charset, first, 0),
|
|
|
271 MAKE_CHAR (charset, i - 1, 0),
|
|
|
272 cat, printcharfun);
|
|
|
273 else
|
|
|
274 print_chartab_range (MAKE_CHAR (charset, row, first),
|
|
|
275 MAKE_CHAR (charset, row, i - 1),
|
|
|
276 cat, printcharfun);
|
|
|
277 first = -1;
|
|
|
278 i--;
|
|
|
279 }
|
|
|
280 }
|
|
183
|
281
|
|
70
|
282 if (first != -1)
|
|
|
283 {
|
|
|
284 if (row == -1)
|
|
|
285 print_chartab_range (MAKE_CHAR (charset, first, 0),
|
|
|
286 MAKE_CHAR (charset, i - 1, 0),
|
|
|
287 cat, printcharfun);
|
|
|
288 else
|
|
|
289 print_chartab_range (MAKE_CHAR (charset, row, first),
|
|
|
290 MAKE_CHAR (charset, row, i - 1),
|
|
|
291 cat, printcharfun);
|
|
|
292 }
|
|
|
293 }
|
|
|
294
|
|
|
295 static void
|
|
|
296 print_chartab_two_byte_charset (Lisp_Object charset,
|
|
|
297 struct Lisp_Char_Table_Entry *cte,
|
|
|
298 Lisp_Object printcharfun)
|
|
|
299 {
|
|
|
300 int i;
|
|
|
301
|
|
|
302 for (i = 32; i < 128; i++)
|
|
|
303 {
|
|
|
304 Lisp_Object jen = cte->level2[i - 32];
|
|
|
305
|
|
|
306 if (!CHAR_TABLE_ENTRYP (jen))
|
|
|
307 {
|
|
|
308 char buf[100];
|
|
|
309
|
|
|
310 write_c_string (" [", printcharfun);
|
|
|
311 print_internal (XCHARSET_NAME (charset), printcharfun, 0);
|
|
|
312 sprintf (buf, " %d] ", i);
|
|
|
313 write_c_string (buf, printcharfun);
|
|
|
314 print_internal (jen, printcharfun, 0);
|
|
|
315 }
|
|
|
316 else
|
|
|
317 print_chartab_charset_row (charset, i, XCHAR_TABLE_ENTRY (jen),
|
|
|
318 printcharfun);
|
|
|
319 }
|
|
|
320 }
|
|
|
321
|
|
|
322 #endif /* MULE */
|
|
|
323
|
|
|
324 static void
|
|
|
325 print_char_table (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
326 {
|
|
|
327 struct Lisp_Char_Table *ct = XCHAR_TABLE (obj);
|
|
|
328 char buf[200];
|
|
183
|
329
|
|
70
|
330 sprintf (buf, "#s(char-table type %s data (",
|
|
|
331 string_data (symbol_name (XSYMBOL
|
|
|
332 (char_table_type_to_symbol (ct->type)))));
|
|
|
333 write_c_string (buf, printcharfun);
|
|
|
334
|
|
|
335 /* Now write out the ASCII/Control-1 stuff. */
|
|
|
336 {
|
|
|
337 int i;
|
|
|
338 int first = -1;
|
|
|
339 Lisp_Object val = Qunbound;
|
|
|
340
|
|
|
341 for (i = 0; i < NUM_ASCII_CHARS; i++)
|
|
|
342 {
|
|
|
343 if (first == -1)
|
|
|
344 {
|
|
|
345 first = i;
|
|
|
346 val = ct->ascii[i];
|
|
|
347 continue;
|
|
|
348 }
|
|
|
349
|
|
|
350 if (!EQ (ct->ascii[i], val))
|
|
|
351 {
|
|
|
352 print_chartab_range (first, i - 1, val, printcharfun);
|
|
|
353 first = -1;
|
|
|
354 i--;
|
|
|
355 }
|
|
|
356 }
|
|
|
357
|
|
|
358 if (first != -1)
|
|
|
359 print_chartab_range (first, i - 1, val, printcharfun);
|
|
|
360 }
|
|
|
361
|
|
|
362 #ifdef MULE
|
|
|
363 {
|
|
|
364 int i;
|
|
|
365
|
|
|
366 for (i = MIN_LEADING_BYTE; i < MIN_LEADING_BYTE + NUM_LEADING_BYTES;
|
|
|
367 i++)
|
|
|
368 {
|
|
|
369 Lisp_Object ann = ct->level1[i - MIN_LEADING_BYTE];
|
|
|
370 Lisp_Object charset = CHARSET_BY_LEADING_BYTE (i);
|
|
|
371
|
|
|
372 if (!CHARSETP (charset) || i == LEADING_BYTE_ASCII
|
|
|
373 || i == LEADING_BYTE_CONTROL_1)
|
|
|
374 continue;
|
|
|
375 if (!CHAR_TABLE_ENTRYP (ann))
|
|
|
376 {
|
|
|
377 write_c_string (" ", printcharfun);
|
|
|
378 print_internal (XCHARSET_NAME (charset),
|
|
|
379 printcharfun, 0);
|
|
|
380 write_c_string (" ", printcharfun);
|
|
|
381 print_internal (ann, printcharfun, 0);
|
|
|
382 }
|
|
|
383 else
|
|
|
384 {
|
|
|
385 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (ann);
|
|
|
386 if (XCHARSET_DIMENSION (charset) == 1)
|
|
|
387 print_chartab_charset_row (charset, -1, cte, printcharfun);
|
|
|
388 else
|
|
|
389 print_chartab_two_byte_charset (charset, cte, printcharfun);
|
|
|
390 }
|
|
|
391 }
|
|
|
392 }
|
|
|
393 #endif /* MULE */
|
|
|
394
|
|
|
395 write_c_string ("))", printcharfun);
|
|
|
396 }
|
|
|
397
|
|
|
398 static int
|
|
|
399 char_table_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
400 {
|
|
|
401 struct Lisp_Char_Table *ct1 = XCHAR_TABLE (obj1);
|
|
|
402 struct Lisp_Char_Table *ct2 = XCHAR_TABLE (obj2);
|
|
|
403 int i;
|
|
|
404
|
|
|
405 if (CHAR_TABLE_TYPE (ct1) != CHAR_TABLE_TYPE (ct2))
|
|
|
406 return 0;
|
|
|
407
|
|
|
408 for (i = 0; i < NUM_ASCII_CHARS; i++)
|
|
|
409 if (!internal_equal (ct1->ascii[i], ct2->ascii[i], depth + 1))
|
|
|
410 return 0;
|
|
|
411
|
|
|
412 #ifdef MULE
|
|
|
413 for (i = 0; i < NUM_LEADING_BYTES; i++)
|
|
|
414 if (!internal_equal (ct1->level1[i], ct2->level1[i], depth + 1))
|
|
|
415 return 0;
|
|
|
416 #endif /* MULE */
|
|
|
417
|
|
|
418 return 1;
|
|
|
419 }
|
|
|
420
|
|
|
421 static unsigned long
|
|
|
422 char_table_hash (Lisp_Object obj, int depth)
|
|
|
423 {
|
|
|
424 struct Lisp_Char_Table *ct = XCHAR_TABLE (obj);
|
|
|
425 unsigned long hashval = internal_array_hash (ct->ascii, NUM_ASCII_CHARS,
|
|
|
426 depth);
|
|
|
427 #ifdef MULE
|
|
|
428 hashval = HASH2 (hashval,
|
|
|
429 internal_array_hash (ct->level1, NUM_LEADING_BYTES, depth));
|
|
|
430 #endif /* MULE */
|
|
|
431 return hashval;
|
|
|
432 }
|
|
|
433
|
|
|
434 DEFUN ("char-table-p", Fchar_table_p, 1, 1, 0, /*
|
|
|
435 Return non-nil if OBJECT is a char table.
|
|
|
436
|
|
|
437 A char table is a table that maps characters (or ranges of characters)
|
|
|
438 to values. Char tables are specialized for characters, only allowing
|
|
|
439 particular sorts of ranges to be assigned values. Although this
|
|
|
440 loses in generality, it makes for extremely fast (constant-time)
|
|
|
441 lookups, and thus is feasible for applications that do an extremely
|
|
|
442 large number of lookups (e.g. scanning a buffer for a character in
|
|
|
443 a particular syntax, where a lookup in the syntax table must occur
|
|
|
444 once per character).
|
|
|
445
|
|
|
446 When Mule support exists, the types of ranges that can be assigned
|
|
|
447 values are
|
|
|
448
|
|
|
449 -- all characters
|
|
|
450 -- an entire charset
|
|
|
451 -- a single row in a two-octet charset
|
|
|
452 -- a single character
|
|
|
453
|
|
|
454 When Mule support is not present, the types of ranges that can be
|
|
|
455 assigned values are
|
|
|
456
|
|
|
457 -- all characters
|
|
|
458 -- a single character
|
|
|
459
|
|
|
460 To create a char table, use `make-char-table'. To modify a char
|
|
|
461 table, use `put-char-table' or `remove-char-table'. To retrieve the
|
|
|
462 value for a particular character, use `get-char-table'. See also
|
|
|
463 `map-char-table', `clear-char-table', `copy-char-table',
|
|
|
464 `valid-char-table-type-p', `char-table-type-list', `valid-char-table-value-p',
|
|
|
465 and `check-char-table-value'.
|
|
|
466 */
|
|
|
467 (object))
|
|
|
468 {
|
|
181
|
469 return CHAR_TABLEP (object) ? Qt : Qnil;
|
|
70
|
470 }
|
|
|
471
|
|
|
472 DEFUN ("char-table-type-list", Fchar_table_type_list, 0, 0, 0, /*
|
|
|
473 Return a list of the recognized char table types.
|
|
|
474 See `valid-char-table-type-p'.
|
|
|
475 */
|
|
|
476 ())
|
|
|
477 {
|
|
|
478 #ifdef MULE
|
|
|
479 return list5 (Qchar, Qcategory, Qdisplay, Qgeneric, Qsyntax);
|
|
|
480 #else
|
|
|
481 return list4 (Qchar, Qdisplay, Qgeneric, Qsyntax);
|
|
|
482 #endif
|
|
|
483 }
|
|
|
484
|
|
|
485 DEFUN ("valid-char-table-type-p", Fvalid_char_table_type_p, 1, 1, 0, /*
|
|
|
486 Return t if TYPE if a recognized char table type.
|
|
|
487
|
|
|
488 Each char table type is used for a different purpose and allows different
|
|
|
489 sorts of values. The different char table types are
|
|
|
490
|
|
|
491 `category'
|
|
|
492 Used for category tables, which specify the regexp categories
|
|
|
493 that a character is in. The valid values are nil or a
|
|
|
494 bit vector of 95 elements. Higher-level Lisp functions are
|
|
|
495 provided for working with category tables. Currently categories
|
|
|
496 and category tables only exist when Mule support is present.
|
|
|
497 `char'
|
|
|
498 A generalized char table, for mapping from one character to
|
|
|
499 another. Used for case tables, syntax matching tables,
|
|
|
500 `keyboard-translate-table', etc. The valid values are characters.
|
|
|
501 `generic'
|
|
|
502 An even more generalized char table, for mapping from a
|
|
|
503 character to anything.
|
|
|
504 `display'
|
|
|
505 Used for display tables, which specify how a particular character
|
|
|
506 is to appear when displayed. #### Not yet implemented.
|
|
|
507 `syntax'
|
|
|
508 Used for syntax tables, which specify the syntax of a particular
|
|
|
509 character. Higher-level Lisp functions are provided for
|
|
|
510 working with syntax tables. The valid values are integers.
|
|
|
511
|
|
|
512 */
|
|
|
513 (type))
|
|
|
514 {
|
|
181
|
515 return (EQ (type, Qchar) ||
|
|
70
|
516 #ifdef MULE
|
|
181
|
517 EQ (type, Qcategory) ||
|
|
70
|
518 #endif
|
|
181
|
519 EQ (type, Qdisplay) ||
|
|
|
520 EQ (type, Qgeneric) ||
|
|
|
521 EQ (type, Qsyntax)) ? Qt : Qnil;
|
|
70
|
522 }
|
|
|
523
|
|
|
524 DEFUN ("char-table-type", Fchar_table_type, 1, 1, 0, /*
|
|
|
525 Return the type of char table TABLE.
|
|
|
526 See `valid-char-table-type-p'.
|
|
|
527 */
|
|
|
528 (table))
|
|
|
529 {
|
|
|
530 CHECK_CHAR_TABLE (table);
|
|
|
531 return char_table_type_to_symbol (XCHAR_TABLE (table)->type);
|
|
|
532 }
|
|
|
533
|
|
|
534 void
|
|
|
535 fill_char_table (struct Lisp_Char_Table *ct, Lisp_Object value)
|
|
|
536 {
|
|
|
537 int i;
|
|
|
538
|
|
|
539 for (i = 0; i < NUM_ASCII_CHARS; i++)
|
|
|
540 ct->ascii[i] = value;
|
|
|
541 #ifdef MULE
|
|
|
542 for (i = 0; i < NUM_LEADING_BYTES; i++)
|
|
|
543 ct->level1[i] = value;
|
|
|
544 #endif /* MULE */
|
|
|
545
|
|
|
546 if (ct->type == CHAR_TABLE_TYPE_SYNTAX)
|
|
|
547 update_syntax_table (ct);
|
|
|
548 }
|
|
|
549
|
|
|
550 DEFUN ("reset-char-table", Freset_char_table, 1, 1, 0, /*
|
|
|
551 Reset a char table to its default state.
|
|
|
552 */
|
|
|
553 (table))
|
|
|
554 {
|
|
|
555 struct Lisp_Char_Table *ct;
|
|
|
556
|
|
|
557 CHECK_CHAR_TABLE (table);
|
|
|
558 ct = XCHAR_TABLE (table);
|
|
|
559
|
|
|
560 switch (ct->type)
|
|
|
561 {
|
|
|
562 case CHAR_TABLE_TYPE_CHAR:
|
|
|
563 case CHAR_TABLE_TYPE_DISPLAY:
|
|
|
564 case CHAR_TABLE_TYPE_GENERIC:
|
|
|
565 #ifdef MULE
|
|
|
566 case CHAR_TABLE_TYPE_CATEGORY:
|
|
|
567 fill_char_table (ct, Qnil);
|
|
|
568 break;
|
|
183
|
569 #endif /* MULE */
|
|
70
|
570
|
|
|
571 case CHAR_TABLE_TYPE_SYNTAX:
|
|
|
572 fill_char_table (ct, make_int (Sinherit));
|
|
|
573 break;
|
|
|
574
|
|
|
575 default:
|
|
|
576 abort ();
|
|
|
577 }
|
|
|
578
|
|
|
579 return Qnil;
|
|
|
580 }
|
|
|
581
|
|
|
582 DEFUN ("make-char-table", Fmake_char_table, 1, 1, 0, /*
|
|
|
583 Make a new, empty char table of type TYPE.
|
|
|
584 Currently recognized types are 'char, 'category, 'display, 'generic,
|
|
|
585 and 'syntax. See `valid-char-table-type-p'.
|
|
|
586 */
|
|
|
587 (type))
|
|
|
588 {
|
|
|
589 struct Lisp_Char_Table *ct;
|
|
|
590 Lisp_Object obj = Qnil;
|
|
|
591 enum char_table_type ty = symbol_to_char_table_type (type);
|
|
|
592
|
|
|
593 ct = (struct Lisp_Char_Table *)
|
|
|
594 alloc_lcrecord (sizeof (struct Lisp_Char_Table), lrecord_char_table);
|
|
|
595 ct->type = ty;
|
|
|
596 if (ty == CHAR_TABLE_TYPE_SYNTAX)
|
|
|
597 {
|
|
|
598 ct->mirror_table = Fmake_char_table (Qgeneric);
|
|
|
599 }
|
|
|
600 else
|
|
|
601 ct->mirror_table = Qnil;
|
|
|
602 ct->next_table = Qnil;
|
|
|
603 XSETCHAR_TABLE (obj, ct);
|
|
|
604 if (ty == CHAR_TABLE_TYPE_SYNTAX)
|
|
|
605 {
|
|
|
606 ct->next_table = Vall_syntax_tables;
|
|
|
607 Vall_syntax_tables = obj;
|
|
|
608 }
|
|
|
609 Freset_char_table (obj);
|
|
|
610 return obj;
|
|
|
611 }
|
|
|
612
|
|
|
613 #ifdef MULE
|
|
|
614
|
|
|
615 static Lisp_Object
|
|
|
616 make_char_table_entry (Lisp_Object initval)
|
|
|
617 {
|
|
|
618 struct Lisp_Char_Table_Entry *cte;
|
|
|
619 Lisp_Object obj = Qnil;
|
|
|
620 int i;
|
|
|
621
|
|
|
622 cte = (struct Lisp_Char_Table_Entry *)
|
|
|
623 alloc_lcrecord (sizeof (struct Lisp_Char_Table_Entry),
|
|
|
624 lrecord_char_table_entry);
|
|
|
625 for (i = 0; i < 96; i++)
|
|
|
626 cte->level2[i] = initval;
|
|
|
627 XSETCHAR_TABLE_ENTRY (obj, cte);
|
|
|
628 return obj;
|
|
|
629 }
|
|
|
630
|
|
|
631 static Lisp_Object
|
|
|
632 copy_char_table_entry (Lisp_Object entry)
|
|
|
633 {
|
|
|
634 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (entry);
|
|
|
635 struct Lisp_Char_Table_Entry *ctenew;
|
|
|
636 Lisp_Object obj = Qnil;
|
|
|
637 int i;
|
|
|
638
|
|
|
639 ctenew = (struct Lisp_Char_Table_Entry *)
|
|
|
640 alloc_lcrecord (sizeof (struct Lisp_Char_Table_Entry),
|
|
|
641 lrecord_char_table_entry);
|
|
|
642 for (i = 0; i < 96; i++)
|
|
|
643 {
|
|
|
644 Lisp_Object new = cte->level2[i];
|
|
|
645 if (CHAR_TABLE_ENTRYP (new))
|
|
|
646 ctenew->level2[i] = copy_char_table_entry (new);
|
|
|
647 else
|
|
|
648 ctenew->level2[i] = new;
|
|
|
649 }
|
|
|
650
|
|
|
651 XSETCHAR_TABLE_ENTRY (obj, cte);
|
|
|
652 return obj;
|
|
|
653 }
|
|
|
654
|
|
|
655 #endif /* MULE */
|
|
|
656
|
|
|
657 DEFUN ("copy-char-table", Fcopy_char_table, 1, 1, 0, /*
|
|
|
658 Make a new char table which is a copy of OLD-TABLE.
|
|
|
659 It will contain the same values for the same characters and ranges
|
|
|
660 as OLD-TABLE. The values will not themselves be copied.
|
|
|
661 */
|
|
|
662 (old_table))
|
|
|
663 {
|
|
|
664 struct Lisp_Char_Table *ct, *ctnew;
|
|
|
665 Lisp_Object obj = Qnil;
|
|
|
666 int i;
|
|
|
667
|
|
|
668 CHECK_CHAR_TABLE (old_table);
|
|
|
669 ct = XCHAR_TABLE (old_table);
|
|
|
670 ctnew = (struct Lisp_Char_Table *)
|
|
|
671 alloc_lcrecord (sizeof (struct Lisp_Char_Table), lrecord_char_table);
|
|
|
672 ctnew->type = ct->type;
|
|
|
673
|
|
|
674 for (i = 0; i < NUM_ASCII_CHARS; i++)
|
|
|
675 {
|
|
|
676 Lisp_Object new = ct->ascii[i];
|
|
|
677 #ifdef MULE
|
|
|
678 assert (! (CHAR_TABLE_ENTRYP (new)));
|
|
|
679 #endif /* MULE */
|
|
|
680 ctnew->ascii[i] = new;
|
|
|
681 }
|
|
|
682
|
|
|
683 #ifdef MULE
|
|
|
684
|
|
|
685 for (i = 0; i < NUM_LEADING_BYTES; i++)
|
|
|
686 {
|
|
|
687 Lisp_Object new = ct->level1[i];
|
|
|
688 if (CHAR_TABLE_ENTRYP (new))
|
|
|
689 ctnew->level1[i] = copy_char_table_entry (new);
|
|
|
690 else
|
|
|
691 ctnew->level1[i] = new;
|
|
|
692 }
|
|
|
693
|
|
|
694 #endif /* MULE */
|
|
|
695
|
|
|
696 if (CHAR_TABLEP (ct->mirror_table))
|
|
|
697 ctnew->mirror_table = Fcopy_char_table (ct->mirror_table);
|
|
|
698 else
|
|
|
699 ctnew->mirror_table = ct->mirror_table;
|
|
|
700 XSETCHAR_TABLE (obj, ctnew);
|
|
|
701 return obj;
|
|
|
702 }
|
|
|
703
|
|
|
704 static void
|
|
|
705 decode_char_table_range (Lisp_Object range, struct chartab_range *outrange)
|
|
|
706 {
|
|
|
707 if (EQ (range, Qt))
|
|
|
708 outrange->type = CHARTAB_RANGE_ALL;
|
|
|
709 else if (CHAR_OR_CHAR_INTP (range))
|
|
|
710 {
|
|
|
711 outrange->type = CHARTAB_RANGE_CHAR;
|
|
|
712 outrange->ch = XCHAR_OR_CHAR_INT (range);
|
|
|
713 }
|
|
|
714 #ifndef MULE
|
|
|
715 else
|
|
|
716 signal_simple_error ("Range must be t or a character", range);
|
|
|
717 #else /* MULE */
|
|
|
718 else if (VECTORP (range))
|
|
|
719 {
|
|
|
720 struct Lisp_Vector *vec = XVECTOR (range);
|
|
|
721 Lisp_Object *elts = vector_data (vec);
|
|
|
722 if (vector_length (vec) != 2)
|
|
|
723 signal_simple_error ("Length of charset row vector must be 2",
|
|
|
724 range);
|
|
|
725 outrange->type = CHARTAB_RANGE_ROW;
|
|
|
726 outrange->charset = Fget_charset (elts[0]);
|
|
|
727 CHECK_INT (elts[1]);
|
|
|
728 outrange->row = XINT (elts[1]);
|
|
|
729 switch (XCHARSET_TYPE (outrange->charset))
|
|
|
730 {
|
|
|
731 case CHARSET_TYPE_94:
|
|
|
732 case CHARSET_TYPE_96:
|
|
|
733 signal_simple_error ("Charset in row vector must be multi-byte",
|
|
|
734 outrange->charset);
|
|
|
735 case CHARSET_TYPE_94X94:
|
|
|
736 check_int_range (outrange->row, 33, 126);
|
|
|
737 break;
|
|
|
738 case CHARSET_TYPE_96X96:
|
|
|
739 check_int_range (outrange->row, 32, 127);
|
|
|
740 break;
|
|
|
741 default:
|
|
|
742 abort ();
|
|
|
743 }
|
|
|
744 }
|
|
|
745 else
|
|
|
746 {
|
|
|
747 if (!CHARSETP (range) && !SYMBOLP (range))
|
|
|
748 signal_simple_error
|
|
|
749 ("Char table range must be t, charset, char, or vector", range);
|
|
|
750 outrange->type = CHARTAB_RANGE_CHARSET;
|
|
|
751 outrange->charset = Fget_charset (range);
|
|
|
752 }
|
|
|
753 #endif /* MULE */
|
|
|
754 }
|
|
|
755
|
|
|
756 #ifdef MULE
|
|
|
757
|
|
|
758 /* called from CHAR_TABLE_VALUE(). */
|
|
|
759 Lisp_Object
|
|
|
760 get_non_ascii_char_table_value (struct Lisp_Char_Table *ct, int leading_byte,
|
|
|
761 Emchar c)
|
|
|
762 {
|
|
|
763 Lisp_Object val;
|
|
|
764 Lisp_Object charset = CHARSET_BY_LEADING_BYTE (leading_byte);
|
|
|
765 int byte1, byte2;
|
|
|
766
|
|
|
767 BREAKUP_CHAR_1_UNSAFE (c, charset, byte1, byte2);
|
|
|
768 val = ct->level1[leading_byte - MIN_LEADING_BYTE];
|
|
|
769 if (CHAR_TABLE_ENTRYP (val))
|
|
|
770 {
|
|
|
771 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (val);
|
|
|
772 val = cte->level2[byte1 - 32];
|
|
|
773 if (CHAR_TABLE_ENTRYP (val))
|
|
|
774 {
|
|
|
775 cte = XCHAR_TABLE_ENTRY (val);
|
|
|
776 assert (byte2 >= 32);
|
|
|
777 val = cte->level2[byte2 - 32];
|
|
|
778 assert (!CHAR_TABLE_ENTRYP (val));
|
|
|
779 }
|
|
|
780 }
|
|
|
781
|
|
|
782 return val;
|
|
|
783 }
|
|
|
784
|
|
|
785 #endif /* MULE */
|
|
|
786
|
|
104
|
787 static Lisp_Object
|
|
183
|
788 get_char_table (Emchar ch, struct Lisp_Char_Table *ct)
|
|
70
|
789 {
|
|
|
790 #ifdef MULE
|
|
|
791 {
|
|
|
792 Lisp_Object charset;
|
|
|
793 int byte1, byte2;
|
|
|
794 Lisp_Object val;
|
|
183
|
795
|
|
104
|
796 BREAKUP_CHAR (ch, charset, byte1, byte2);
|
|
183
|
797
|
|
70
|
798 if (EQ (charset, Vcharset_ascii))
|
|
|
799 val = ct->ascii[byte1];
|
|
|
800 else if (EQ (charset, Vcharset_control_1))
|
|
|
801 val = ct->ascii[byte1 + 128];
|
|
|
802 else
|
|
|
803 {
|
|
|
804 int lb = XCHARSET_LEADING_BYTE (charset) - MIN_LEADING_BYTE;
|
|
|
805 val = ct->level1[lb];
|
|
|
806 if (CHAR_TABLE_ENTRYP (val))
|
|
|
807 {
|
|
|
808 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (val);
|
|
|
809 val = cte->level2[byte1 - 32];
|
|
|
810 if (CHAR_TABLE_ENTRYP (val))
|
|
|
811 {
|
|
|
812 cte = XCHAR_TABLE_ENTRY (val);
|
|
|
813 assert (byte2 >= 32);
|
|
|
814 val = cte->level2[byte2 - 32];
|
|
|
815 assert (!CHAR_TABLE_ENTRYP (val));
|
|
|
816 }
|
|
|
817 }
|
|
|
818 }
|
|
|
819
|
|
|
820 return val;
|
|
|
821 }
|
|
|
822 #else /* not MULE */
|
|
104
|
823 return ct->ascii[(unsigned char)ch];
|
|
70
|
824 #endif /* not MULE */
|
|
|
825 }
|
|
|
826
|
|
104
|
827
|
|
|
828 DEFUN ("get-char-table", Fget_char_table, 2, 2, 0, /*
|
|
|
829 Find value for char CH in TABLE.
|
|
|
830 */
|
|
|
831 (ch, table))
|
|
|
832 {
|
|
|
833 struct Lisp_Char_Table *ct;
|
|
183
|
834
|
|
104
|
835 CHECK_CHAR_TABLE (table);
|
|
|
836 ct = XCHAR_TABLE (table);
|
|
|
837 CHECK_CHAR_COERCE_INT (ch);
|
|
183
|
838
|
|
|
839 return get_char_table (XCHAR (ch), ct);
|
|
104
|
840 }
|
|
|
841
|
|
70
|
842 DEFUN ("get-range-char-table", Fget_range_char_table, 2, 3, 0, /*
|
|
|
843 Find value for a range in TABLE.
|
|
|
844 If there is more than one value, return MULTI (defaults to nil).
|
|
|
845 */
|
|
|
846 (range, table, multi))
|
|
|
847 {
|
|
|
848 struct Lisp_Char_Table *ct;
|
|
|
849 struct chartab_range rainj;
|
|
|
850
|
|
|
851 if (CHAR_OR_CHAR_INTP (range))
|
|
|
852 return Fget_char_table (range, table);
|
|
|
853 CHECK_CHAR_TABLE (table);
|
|
|
854 ct = XCHAR_TABLE (table);
|
|
|
855
|
|
|
856 decode_char_table_range (range, &rainj);
|
|
|
857 switch (rainj.type)
|
|
|
858 {
|
|
|
859 case CHARTAB_RANGE_ALL:
|
|
|
860 {
|
|
|
861 int i;
|
|
|
862 Lisp_Object first = ct->ascii[0];
|
|
183
|
863
|
|
70
|
864 for (i = 1; i < NUM_ASCII_CHARS; i++)
|
|
|
865 if (!EQ (first, ct->ascii[i]))
|
|
|
866 return multi;
|
|
183
|
867
|
|
70
|
868 #ifdef MULE
|
|
|
869 for (i = MIN_LEADING_BYTE; i < MIN_LEADING_BYTE + NUM_LEADING_BYTES;
|
|
|
870 i++)
|
|
|
871 {
|
|
|
872 if (!CHARSETP (CHARSET_BY_LEADING_BYTE (i))
|
|
|
873 || i == LEADING_BYTE_ASCII
|
|
|
874 || i == LEADING_BYTE_CONTROL_1)
|
|
|
875 continue;
|
|
|
876 if (!EQ (first, ct->level1[i - MIN_LEADING_BYTE]))
|
|
|
877 return multi;
|
|
|
878 }
|
|
|
879 #endif /* MULE */
|
|
|
880
|
|
|
881 return first;
|
|
|
882 }
|
|
|
883
|
|
|
884 #ifdef MULE
|
|
|
885 case CHARTAB_RANGE_CHARSET:
|
|
|
886 if (EQ (rainj.charset, Vcharset_ascii))
|
|
|
887 {
|
|
|
888 int i;
|
|
|
889 Lisp_Object first = ct->ascii[0];
|
|
183
|
890
|
|
70
|
891 for (i = 1; i < 128; i++)
|
|
|
892 if (!EQ (first, ct->ascii[i]))
|
|
|
893 return multi;
|
|
|
894 return first;
|
|
|
895 }
|
|
183
|
896
|
|
70
|
897 if (EQ (rainj.charset, Vcharset_control_1))
|
|
|
898 {
|
|
|
899 int i;
|
|
|
900 Lisp_Object first = ct->ascii[128];
|
|
183
|
901
|
|
70
|
902 for (i = 129; i < 160; i++)
|
|
|
903 if (!EQ (first, ct->ascii[i]))
|
|
|
904 return multi;
|
|
|
905 return first;
|
|
|
906 }
|
|
183
|
907
|
|
70
|
908 {
|
|
|
909 Lisp_Object val = ct->level1[XCHARSET_LEADING_BYTE (rainj.charset) -
|
|
|
910 MIN_LEADING_BYTE];
|
|
|
911 if (CHAR_TABLE_ENTRYP (val))
|
|
|
912 return multi;
|
|
|
913 return val;
|
|
|
914 }
|
|
|
915
|
|
|
916 case CHARTAB_RANGE_ROW:
|
|
|
917 {
|
|
|
918 Lisp_Object val = ct->level1[XCHARSET_LEADING_BYTE (rainj.charset) -
|
|
|
919 MIN_LEADING_BYTE];
|
|
|
920 if (!CHAR_TABLE_ENTRYP (val))
|
|
|
921 return val;
|
|
|
922 val = XCHAR_TABLE_ENTRY (val)->level2[rainj.row - 32];
|
|
|
923 if (CHAR_TABLE_ENTRYP (val))
|
|
|
924 return multi;
|
|
|
925 return val;
|
|
|
926 }
|
|
|
927 #endif /* not MULE */
|
|
|
928
|
|
|
929 default:
|
|
|
930 abort ();
|
|
|
931 }
|
|
|
932
|
|
|
933 return Qnil; /* not reached */
|
|
|
934 }
|
|
|
935
|
|
|
936 static int
|
|
|
937 check_valid_char_table_value (Lisp_Object value, enum char_table_type type,
|
|
|
938 Error_behavior errb)
|
|
|
939 {
|
|
|
940 switch (type)
|
|
|
941 {
|
|
|
942 case CHAR_TABLE_TYPE_SYNTAX:
|
|
|
943 if (!ERRB_EQ (errb, ERROR_ME))
|
|
|
944 return INTP (value) || (CONSP (value) && INTP (XCAR (value))
|
|
|
945 && CHAR_OR_CHAR_INTP (XCDR (value)));
|
|
|
946 if (CONSP (value))
|
|
|
947 {
|
|
|
948 Lisp_Object cdr = XCDR (value);
|
|
|
949 CHECK_INT (XCAR (value));
|
|
|
950 CHECK_CHAR_COERCE_INT (cdr);
|
|
|
951 }
|
|
|
952 else
|
|
|
953 CHECK_INT (value);
|
|
|
954 break;
|
|
|
955
|
|
|
956 #ifdef MULE
|
|
|
957 case CHAR_TABLE_TYPE_CATEGORY:
|
|
|
958 if (!ERRB_EQ (errb, ERROR_ME))
|
|
|
959 return CATEGORY_TABLE_VALUEP (value);
|
|
|
960 CHECK_CATEGORY_TABLE_VALUE (value);
|
|
|
961 break;
|
|
183
|
962 #endif /* MULE */
|
|
70
|
963
|
|
|
964 case CHAR_TABLE_TYPE_GENERIC:
|
|
|
965 return 1;
|
|
|
966
|
|
|
967 case CHAR_TABLE_TYPE_DISPLAY:
|
|
|
968 /* #### fix this */
|
|
|
969 maybe_signal_simple_error ("Display char tables not yet implemented",
|
|
|
970 value, Qchar_table, errb);
|
|
|
971 return 0;
|
|
|
972
|
|
|
973 case CHAR_TABLE_TYPE_CHAR:
|
|
|
974 if (!ERRB_EQ (errb, ERROR_ME))
|
|
|
975 return CHAR_OR_CHAR_INTP (value);
|
|
|
976 CHECK_CHAR_COERCE_INT (value);
|
|
|
977 break;
|
|
|
978
|
|
|
979 default:
|
|
|
980 abort ();
|
|
|
981 }
|
|
|
982
|
|
|
983 return 0; /* not reached */
|
|
|
984 }
|
|
|
985
|
|
|
986 static Lisp_Object
|
|
|
987 canonicalize_char_table_value (Lisp_Object value, enum char_table_type type)
|
|
|
988 {
|
|
|
989 switch (type)
|
|
|
990 {
|
|
|
991 case CHAR_TABLE_TYPE_SYNTAX:
|
|
|
992 if (CONSP (value))
|
|
|
993 {
|
|
|
994 Lisp_Object car = XCAR (value);
|
|
|
995 Lisp_Object cdr = XCDR (value);
|
|
|
996 CHECK_CHAR_COERCE_INT (cdr);
|
|
|
997 return Fcons (car, cdr);
|
|
|
998 }
|
|
|
999 default:
|
|
|
1000 break;
|
|
|
1001 }
|
|
|
1002 return value;
|
|
|
1003 }
|
|
|
1004
|
|
|
1005 DEFUN ("valid-char-table-value-p", Fvalid_char_table_value_p, 2, 2, 0, /*
|
|
|
1006 Return non-nil if VALUE is a valid value for CHAR-TABLE-TYPE.
|
|
|
1007 */
|
|
|
1008 (value, char_table_type))
|
|
|
1009 {
|
|
|
1010 enum char_table_type type = symbol_to_char_table_type (char_table_type);
|
|
|
1011
|
|
|
1012 return check_valid_char_table_value (value, type, ERROR_ME_NOT) ? Qt : Qnil;
|
|
|
1013 }
|
|
|
1014
|
|
|
1015 DEFUN ("check-valid-char-table-value", Fcheck_valid_char_table_value, 2, 2, 0, /*
|
|
|
1016 Signal an error if VALUE is not a valid value for CHAR-TABLE-TYPE.
|
|
|
1017 */
|
|
|
1018 (value, char_table_type))
|
|
|
1019 {
|
|
|
1020 enum char_table_type type = symbol_to_char_table_type (char_table_type);
|
|
|
1021
|
|
|
1022 check_valid_char_table_value (value, type, ERROR_ME);
|
|
|
1023 return Qnil;
|
|
|
1024 }
|
|
|
1025
|
|
|
1026 /* Assign VAL to all characters in RANGE in char table CT. */
|
|
|
1027
|
|
|
1028 void
|
|
|
1029 put_char_table (struct Lisp_Char_Table *ct, struct chartab_range *range,
|
|
|
1030 Lisp_Object val)
|
|
|
1031 {
|
|
|
1032 switch (range->type)
|
|
|
1033 {
|
|
|
1034 case CHARTAB_RANGE_ALL:
|
|
|
1035 fill_char_table (ct, val);
|
|
|
1036 return; /* avoid the duplicate call to update_syntax_table() below,
|
|
|
1037 since fill_char_table() also did that. */
|
|
|
1038
|
|
|
1039 #ifdef MULE
|
|
|
1040 case CHARTAB_RANGE_CHARSET:
|
|
|
1041 if (EQ (range->charset, Vcharset_ascii))
|
|
|
1042 {
|
|
|
1043 int i;
|
|
|
1044 for (i = 0; i < 128; i++)
|
|
|
1045 ct->ascii[i] = val;
|
|
|
1046 }
|
|
|
1047 else if (EQ (range->charset, Vcharset_control_1))
|
|
|
1048 {
|
|
|
1049 int i;
|
|
|
1050 for (i = 128; i < 160; i++)
|
|
|
1051 ct->ascii[i] = val;
|
|
|
1052 }
|
|
|
1053 else
|
|
|
1054 {
|
|
|
1055 int lb = XCHARSET_LEADING_BYTE (range->charset) - MIN_LEADING_BYTE;
|
|
|
1056 ct->level1[lb] = val;
|
|
|
1057 }
|
|
|
1058 break;
|
|
|
1059
|
|
|
1060 case CHARTAB_RANGE_ROW:
|
|
|
1061 {
|
|
|
1062 struct Lisp_Char_Table_Entry *cte;
|
|
|
1063 int lb = XCHARSET_LEADING_BYTE (range->charset) - MIN_LEADING_BYTE;
|
|
|
1064 /* make sure that there is a separate entry for the row. */
|
|
|
1065 if (!CHAR_TABLE_ENTRYP (ct->level1[lb]))
|
|
|
1066 ct->level1[lb] = make_char_table_entry (ct->level1[lb]);
|
|
|
1067 cte = XCHAR_TABLE_ENTRY (ct->level1[lb]);
|
|
|
1068 cte->level2[range->row - 32] = val;
|
|
|
1069 }
|
|
|
1070 break;
|
|
|
1071 #endif /* MULE */
|
|
|
1072
|
|
|
1073 case CHARTAB_RANGE_CHAR:
|
|
|
1074 #ifdef MULE
|
|
|
1075 {
|
|
|
1076 Lisp_Object charset;
|
|
|
1077 int byte1, byte2;
|
|
183
|
1078
|
|
70
|
1079 BREAKUP_CHAR (range->ch, charset, byte1, byte2);
|
|
|
1080 if (EQ (charset, Vcharset_ascii))
|
|
|
1081 ct->ascii[byte1] = val;
|
|
|
1082 else if (EQ (charset, Vcharset_control_1))
|
|
|
1083 ct->ascii[byte1 + 128] = val;
|
|
|
1084 else
|
|
|
1085 {
|
|
|
1086 struct Lisp_Char_Table_Entry *cte;
|
|
|
1087 int lb = XCHARSET_LEADING_BYTE (charset) - MIN_LEADING_BYTE;
|
|
|
1088 /* make sure that there is a separate entry for the row. */
|
|
|
1089 if (!CHAR_TABLE_ENTRYP (ct->level1[lb]))
|
|
|
1090 ct->level1[lb] = make_char_table_entry (ct->level1[lb]);
|
|
|
1091 cte = XCHAR_TABLE_ENTRY (ct->level1[lb]);
|
|
|
1092 /* now CTE is a char table entry for the charset;
|
|
|
1093 each entry is for a single row (or character of
|
|
|
1094 a one-octet charset). */
|
|
|
1095 if (XCHARSET_DIMENSION (charset) == 1)
|
|
|
1096 cte->level2[byte1 - 32] = val;
|
|
|
1097 else
|
|
|
1098 {
|
|
|
1099 /* assigning to one character in a two-octet charset. */
|
|
|
1100 /* make sure that the charset row contains a separate
|
|
|
1101 entry for each character. */
|
|
|
1102 if (!CHAR_TABLE_ENTRYP (cte->level2[byte1 - 32]))
|
|
|
1103 cte->level2[byte1 - 32] =
|
|
|
1104 make_char_table_entry (cte->level2[byte1 - 32]);
|
|
|
1105 cte = XCHAR_TABLE_ENTRY (cte->level2[byte1 - 32]);
|
|
|
1106 cte->level2[byte2 - 32] = val;
|
|
|
1107 }
|
|
|
1108 }
|
|
|
1109 }
|
|
|
1110 #else /* not MULE */
|
|
|
1111 ct->ascii[(unsigned char) (range->ch)] = val;
|
|
|
1112 break;
|
|
|
1113 #endif /* not MULE */
|
|
|
1114 }
|
|
|
1115
|
|
|
1116 if (ct->type == CHAR_TABLE_TYPE_SYNTAX)
|
|
|
1117 update_syntax_table (ct);
|
|
|
1118 }
|
|
|
1119
|
|
|
1120 DEFUN ("put-char-table", Fput_char_table, 3, 3, 0, /*
|
|
|
1121 Set the value for chars in RANGE to be VAL in TABLE.
|
|
|
1122
|
|
|
1123 RANGE specifies one or more characters to be affected and should be
|
|
|
1124 one of the following:
|
|
|
1125
|
|
|
1126 -- t (all characters are affected)
|
|
|
1127 -- A charset (only allowed when Mule support is present)
|
|
|
1128 -- A vector of two elements: a two-octet charset and a row number
|
|
|
1129 (only allowed when Mule support is present)
|
|
|
1130 -- A single character
|
|
|
1131
|
|
|
1132 VAL must be a value appropriate for the type of TABLE.
|
|
|
1133 See `valid-char-table-type-p'.
|
|
|
1134 */
|
|
|
1135 (range, val, table))
|
|
|
1136 {
|
|
|
1137 struct Lisp_Char_Table *ct;
|
|
|
1138 struct chartab_range rainj;
|
|
|
1139
|
|
|
1140 CHECK_CHAR_TABLE (table);
|
|
|
1141 ct = XCHAR_TABLE (table);
|
|
|
1142 check_valid_char_table_value (val, ct->type, ERROR_ME);
|
|
|
1143 decode_char_table_range (range, &rainj);
|
|
|
1144 val = canonicalize_char_table_value (val, ct->type);
|
|
|
1145 put_char_table (ct, &rainj, val);
|
|
|
1146 return Qnil;
|
|
|
1147 }
|
|
|
1148
|
|
|
1149 /* Map FN over the ASCII chars in CT. */
|
|
|
1150
|
|
|
1151 static int
|
|
|
1152 map_over_charset_ascii (struct Lisp_Char_Table *ct,
|
|
|
1153 int (*fn) (struct chartab_range *range,
|
|
|
1154 Lisp_Object val, void *arg),
|
|
|
1155 void *arg)
|
|
|
1156 {
|
|
183
|
1157 struct chartab_range rainj;
|
|
|
1158 int i, retval;
|
|
|
1159 int start = 0;
|
|
70
|
1160 #ifdef MULE
|
|
183
|
1161 int stop = 128;
|
|
70
|
1162 #else
|
|
183
|
1163 int stop = 256;
|
|
70
|
1164 #endif
|
|
183
|
1165
|
|
|
1166 rainj.type = CHARTAB_RANGE_CHAR;
|
|
|
1167
|
|
|
1168 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
70
|
1169 {
|
|
|
1170 rainj.ch = (Emchar) i;
|
|
183
|
1171 retval = (fn) (&rainj, ct->ascii[i], arg);
|
|
70
|
1172 }
|
|
|
1173
|
|
183
|
1174 return retval;
|
|
70
|
1175 }
|
|
|
1176
|
|
|
1177 #ifdef MULE
|
|
|
1178
|
|
|
1179 /* Map FN over the Control-1 chars in CT. */
|
|
|
1180
|
|
|
1181 static int
|
|
|
1182 map_over_charset_control_1 (struct Lisp_Char_Table *ct,
|
|
|
1183 int (*fn) (struct chartab_range *range,
|
|
|
1184 Lisp_Object val, void *arg),
|
|
|
1185 void *arg)
|
|
|
1186 {
|
|
183
|
1187 struct chartab_range rainj;
|
|
|
1188 int i, retval;
|
|
|
1189 int start = 128;
|
|
|
1190 int stop = start + 32;
|
|
70
|
1191
|
|
183
|
1192 rainj.type = CHARTAB_RANGE_CHAR;
|
|
|
1193
|
|
|
1194 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
70
|
1195 {
|
|
183
|
1196 rainj.ch = (Emchar) (i);
|
|
|
1197 retval = (fn) (&rainj, ct->ascii[i], arg);
|
|
70
|
1198 }
|
|
|
1199
|
|
183
|
1200 return retval;
|
|
70
|
1201 }
|
|
|
1202
|
|
|
1203 /* Map FN over the row ROW of two-byte charset CHARSET.
|
|
|
1204 There must be a separate value for that row in the char table.
|
|
|
1205 CTE specifies the char table entry for CHARSET. */
|
|
|
1206
|
|
|
1207 static int
|
|
|
1208 map_over_charset_row (struct Lisp_Char_Table_Entry *cte,
|
|
|
1209 Lisp_Object charset, int row,
|
|
|
1210 int (*fn) (struct chartab_range *range,
|
|
|
1211 Lisp_Object val, void *arg),
|
|
|
1212 void *arg)
|
|
|
1213 {
|
|
183
|
1214 Lisp_Object val = cte->level2[row - 32];
|
|
70
|
1215
|
|
|
1216 if (!CHAR_TABLE_ENTRYP (val))
|
|
|
1217 {
|
|
|
1218 struct chartab_range rainj;
|
|
|
1219
|
|
|
1220 rainj.type = CHARTAB_RANGE_ROW;
|
|
|
1221 rainj.charset = charset;
|
|
|
1222 rainj.row = row;
|
|
|
1223 return (fn) (&rainj, val, arg);
|
|
|
1224 }
|
|
|
1225 else
|
|
|
1226 {
|
|
183
|
1227 struct chartab_range rainj;
|
|
|
1228 int i, retval;
|
|
|
1229 int charset94_p = (XCHARSET_CHARS (charset) == 94);
|
|
|
1230 int start = charset94_p ? 33 : 32;
|
|
|
1231 int stop = charset94_p ? 127 : 128;
|
|
|
1232
|
|
70
|
1233 cte = XCHAR_TABLE_ENTRY (val);
|
|
183
|
1234
|
|
|
1235 rainj.type = CHARTAB_RANGE_CHAR;
|
|
|
1236
|
|
|
1237 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
70
|
1238 {
|
|
183
|
1239 rainj.ch = MAKE_CHAR (charset, row, i);
|
|
|
1240 retval = (fn) (&rainj, cte->level2[i - 32], arg);
|
|
70
|
1241 }
|
|
183
|
1242 return retval;
|
|
|
1243 }
|
|
|
1244 }
|
|
70
|
1245
|
|
|
1246
|
|
|
1247 static int
|
|
|
1248 map_over_other_charset (struct Lisp_Char_Table *ct, int lb,
|
|
|
1249 int (*fn) (struct chartab_range *range,
|
|
|
1250 Lisp_Object val, void *arg),
|
|
|
1251 void *arg)
|
|
|
1252 {
|
|
181
|
1253 Lisp_Object val = ct->level1[lb - MIN_LEADING_BYTE];
|
|
|
1254 Lisp_Object charset = CHARSET_BY_LEADING_BYTE (lb);
|
|
183
|
1255
|
|
181
|
1256 if (!CHARSETP (charset)
|
|
|
1257 || lb == LEADING_BYTE_ASCII
|
|
70
|
1258 || lb == LEADING_BYTE_CONTROL_1)
|
|
|
1259 return 0;
|
|
183
|
1260
|
|
70
|
1261 if (!CHAR_TABLE_ENTRYP (val))
|
|
|
1262 {
|
|
|
1263 struct chartab_range rainj;
|
|
|
1264
|
|
|
1265 rainj.type = CHARTAB_RANGE_CHARSET;
|
|
|
1266 rainj.charset = charset;
|
|
|
1267 return (fn) (&rainj, val, arg);
|
|
|
1268 }
|
|
183
|
1269
|
|
181
|
1270 {
|
|
|
1271 struct Lisp_Char_Table_Entry *cte = XCHAR_TABLE_ENTRY (val);
|
|
|
1272 int charset94_p = (XCHARSET_CHARS (charset) == 94);
|
|
|
1273 int start = charset94_p ? 33 : 32;
|
|
|
1274 int stop = charset94_p ? 127 : 128;
|
|
|
1275 int i, retval;
|
|
183
|
1276
|
|
181
|
1277 if (XCHARSET_DIMENSION (charset) == 1)
|
|
183
|
1278 {
|
|
|
1279 struct chartab_range rainj;
|
|
|
1280 rainj.type = CHARTAB_RANGE_CHAR;
|
|
70
|
1281
|
|
183
|
1282 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
|
1283 {
|
|
|
1284 rainj.ch = MAKE_CHAR (charset, i, 0);
|
|
|
1285 retval = (fn) (&rainj, cte->level2[i - 32], arg);
|
|
|
1286 }
|
|
|
1287 }
|
|
181
|
1288 else
|
|
183
|
1289 {
|
|
|
1290 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
181
|
1291 retval = map_over_charset_row (cte, charset, i, fn, arg);
|
|
183
|
1292 }
|
|
|
1293
|
|
|
1294 return retval;
|
|
181
|
1295 }
|
|
70
|
1296 }
|
|
|
1297
|
|
|
1298 #endif /* MULE */
|
|
|
1299
|
|
|
1300 /* Map FN (with client data ARG) over range RANGE in char table CT.
|
|
|
1301 Mapping stops the first time FN returns non-zero, and that value
|
|
|
1302 becomes the return value of map_char_table(). */
|
|
|
1303
|
|
|
1304 int
|
|
|
1305 map_char_table (struct Lisp_Char_Table *ct,
|
|
|
1306 struct chartab_range *range,
|
|
|
1307 int (*fn) (struct chartab_range *range,
|
|
|
1308 Lisp_Object val, void *arg),
|
|
|
1309 void *arg)
|
|
|
1310 {
|
|
|
1311 switch (range->type)
|
|
|
1312 {
|
|
|
1313 case CHARTAB_RANGE_ALL:
|
|
|
1314 {
|
|
|
1315 int retval;
|
|
183
|
1316
|
|
70
|
1317 retval = map_over_charset_ascii (ct, fn, arg);
|
|
|
1318 if (retval)
|
|
|
1319 return retval;
|
|
|
1320 #ifdef MULE
|
|
|
1321 retval = map_over_charset_control_1 (ct, fn, arg);
|
|
|
1322 if (retval)
|
|
|
1323 return retval;
|
|
|
1324 {
|
|
|
1325 int i;
|
|
183
|
1326 int start = MIN_LEADING_BYTE;
|
|
|
1327 int stop = start + NUM_LEADING_BYTES;
|
|
|
1328
|
|
|
1329 for (i = start, retval = 0; i < stop && retval == 0; i++)
|
|
70
|
1330 {
|
|
|
1331 retval = map_over_other_charset (ct, i, fn, arg);
|
|
|
1332 }
|
|
|
1333 }
|
|
181
|
1334 #endif /* MULE */
|
|
183
|
1335 return retval;
|
|
70
|
1336 }
|
|
|
1337
|
|
|
1338 #ifdef MULE
|
|
|
1339 case CHARTAB_RANGE_CHARSET:
|
|
|
1340 return map_over_other_charset (ct,
|
|
|
1341 XCHARSET_LEADING_BYTE (range->charset),
|
|
|
1342 fn, arg);
|
|
|
1343
|
|
|
1344 case CHARTAB_RANGE_ROW:
|
|
|
1345 {
|
|
104
|
1346 Lisp_Object val = ct->level1[XCHARSET_LEADING_BYTE (range->charset) - MIN_LEADING_BYTE];
|
|
70
|
1347 if (!CHAR_TABLE_ENTRYP (val))
|
|
|
1348 {
|
|
|
1349 struct chartab_range rainj;
|
|
|
1350
|
|
|
1351 rainj.type = CHARTAB_RANGE_ROW;
|
|
|
1352 rainj.charset = range->charset;
|
|
|
1353 rainj.row = range->row;
|
|
|
1354 return (fn) (&rainj, val, arg);
|
|
|
1355 }
|
|
|
1356 else
|
|
|
1357 return map_over_charset_row (XCHAR_TABLE_ENTRY (val),
|
|
|
1358 range->charset, range->row,
|
|
|
1359 fn, arg);
|
|
|
1360 }
|
|
|
1361 #endif /* MULE */
|
|
|
1362
|
|
|
1363 case CHARTAB_RANGE_CHAR:
|
|
|
1364 {
|
|
|
1365 Emchar ch = range->ch;
|
|
|
1366 Lisp_Object val = CHAR_TABLE_VALUE_UNSAFE (ct, ch);
|
|
|
1367 struct chartab_range rainj;
|
|
|
1368
|
|
|
1369 rainj.type = CHARTAB_RANGE_CHAR;
|
|
|
1370 rainj.ch = ch;
|
|
|
1371 return (fn) (&rainj, val, arg);
|
|
|
1372 }
|
|
|
1373
|
|
|
1374 default:
|
|
|
1375 abort ();
|
|
|
1376 }
|
|
|
1377
|
|
|
1378 return 0;
|
|
|
1379 }
|
|
|
1380
|
|
|
1381 struct slow_map_char_table_arg
|
|
|
1382 {
|
|
|
1383 Lisp_Object function;
|
|
|
1384 Lisp_Object retval;
|
|
|
1385 };
|
|
|
1386
|
|
|
1387 static int
|
|
|
1388 slow_map_char_table_fun (struct chartab_range *range,
|
|
|
1389 Lisp_Object val, void *arg)
|
|
|
1390 {
|
|
|
1391 Lisp_Object ranjarg = Qnil;
|
|
|
1392 struct slow_map_char_table_arg *closure =
|
|
|
1393 (struct slow_map_char_table_arg *) arg;
|
|
|
1394
|
|
|
1395 switch (range->type)
|
|
|
1396 {
|
|
|
1397 case CHARTAB_RANGE_ALL:
|
|
|
1398 ranjarg = Qt;
|
|
|
1399 break;
|
|
|
1400
|
|
|
1401 #ifdef MULE
|
|
|
1402 case CHARTAB_RANGE_CHARSET:
|
|
|
1403 ranjarg = XCHARSET_NAME (range->charset);
|
|
|
1404 break;
|
|
|
1405
|
|
|
1406 case CHARTAB_RANGE_ROW:
|
|
|
1407 ranjarg = vector2 (XCHARSET_NAME (range->charset),
|
|
|
1408 make_int (range->row));
|
|
|
1409 break;
|
|
183
|
1410 #endif /* MULE */
|
|
70
|
1411 case CHARTAB_RANGE_CHAR:
|
|
|
1412 ranjarg = make_char (range->ch);
|
|
|
1413 break;
|
|
|
1414 default:
|
|
|
1415 abort ();
|
|
|
1416 }
|
|
|
1417
|
|
|
1418 closure->retval = call2 (closure->function, ranjarg, val);
|
|
183
|
1419 return !NILP (closure->retval);
|
|
70
|
1420 }
|
|
|
1421
|
|
|
1422 DEFUN ("map-char-table", Fmap_char_table, 2, 3, 0, /*
|
|
|
1423 Map FUNCTION over entries in TABLE, calling it with two args,
|
|
|
1424 each key and value in the table.
|
|
|
1425
|
|
|
1426 RANGE specifies a subrange to map over and is in the same format as
|
|
|
1427 the RANGE argument to `put-range-table'. If omitted or t, it defaults to
|
|
|
1428 the entire table.
|
|
|
1429 */
|
|
|
1430 (function, table, range))
|
|
|
1431 {
|
|
|
1432 struct Lisp_Char_Table *ct;
|
|
|
1433 struct slow_map_char_table_arg slarg;
|
|
|
1434 struct gcpro gcpro1, gcpro2;
|
|
|
1435 struct chartab_range rainj;
|
|
|
1436
|
|
|
1437 CHECK_CHAR_TABLE (table);
|
|
|
1438 ct = XCHAR_TABLE (table);
|
|
|
1439 if (NILP (range))
|
|
|
1440 range = Qt;
|
|
|
1441 decode_char_table_range (range, &rainj);
|
|
|
1442 slarg.function = function;
|
|
|
1443 slarg.retval = Qnil;
|
|
|
1444 GCPRO2 (slarg.function, slarg.retval);
|
|
|
1445 map_char_table (ct, &rainj, slow_map_char_table_fun, &slarg);
|
|
|
1446 UNGCPRO;
|
|
|
1447
|
|
|
1448 return slarg.retval;
|
|
|
1449 }
|
|
|
1450
|
|
104
|
1451
|
|
70
|
1452
|
|
|
1453 /************************************************************************/
|
|
|
1454 /* Char table read syntax */
|
|
|
1455 /************************************************************************/
|
|
|
1456
|
|
|
1457 static int
|
|
|
1458 chartab_type_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
1459 Error_behavior errb)
|
|
|
1460 {
|
|
|
1461 /* #### should deal with ERRB */
|
|
183
|
1462 symbol_to_char_table_type (value);
|
|
70
|
1463 return 1;
|
|
|
1464 }
|
|
|
1465
|
|
|
1466 static int
|
|
|
1467 chartab_data_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
1468 Error_behavior errb)
|
|
|
1469 {
|
|
|
1470 Lisp_Object rest;
|
|
|
1471
|
|
|
1472 /* #### should deal with ERRB */
|
|
|
1473 EXTERNAL_LIST_LOOP (rest, value)
|
|
|
1474 {
|
|
|
1475 Lisp_Object range = XCAR (rest);
|
|
|
1476 struct chartab_range dummy;
|
|
|
1477
|
|
|
1478 rest = XCDR (rest);
|
|
|
1479 if (!CONSP (rest))
|
|
|
1480 signal_simple_error ("Invalid list format", value);
|
|
|
1481 if (CONSP (range))
|
|
|
1482 {
|
|
|
1483 if (!CONSP (XCDR (range))
|
|
|
1484 || !NILP (XCDR (XCDR (range))))
|
|
|
1485 signal_simple_error ("Invalid range format", range);
|
|
|
1486 decode_char_table_range (XCAR (range), &dummy);
|
|
|
1487 decode_char_table_range (XCAR (XCDR (range)), &dummy);
|
|
|
1488 }
|
|
|
1489 else
|
|
|
1490 decode_char_table_range (range, &dummy);
|
|
|
1491 }
|
|
|
1492
|
|
|
1493 return 1;
|
|
|
1494 }
|
|
|
1495
|
|
|
1496 static Lisp_Object
|
|
|
1497 chartab_instantiate (Lisp_Object data)
|
|
|
1498 {
|
|
|
1499 Lisp_Object chartab;
|
|
|
1500 Lisp_Object type = Qgeneric;
|
|
|
1501 Lisp_Object dataval = Qnil;
|
|
|
1502
|
|
|
1503 while (!NILP (data))
|
|
|
1504 {
|
|
|
1505 Lisp_Object keyw = Fcar (data);
|
|
|
1506 Lisp_Object valw;
|
|
|
1507
|
|
|
1508 data = Fcdr (data);
|
|
|
1509 valw = Fcar (data);
|
|
|
1510 data = Fcdr (data);
|
|
|
1511 if (EQ (keyw, Qtype))
|
|
|
1512 type = valw;
|
|
|
1513 else if (EQ (keyw, Qdata))
|
|
|
1514 dataval = valw;
|
|
|
1515 }
|
|
|
1516
|
|
|
1517 chartab = Fmake_char_table (type);
|
|
|
1518
|
|
|
1519 data = dataval;
|
|
|
1520 while (!NILP (data))
|
|
|
1521 {
|
|
|
1522 Lisp_Object range = Fcar (data);
|
|
|
1523 Lisp_Object val = Fcar (Fcdr (data));
|
|
183
|
1524
|
|
70
|
1525 data = Fcdr (Fcdr (data));
|
|
|
1526 if (CONSP (range))
|
|
|
1527 {
|
|
|
1528 if (CHAR_OR_CHAR_INTP (XCAR (range)))
|
|
|
1529 {
|
|
|
1530 Emchar first = XCHAR_OR_CHAR_INT (Fcar (range));
|
|
|
1531 Emchar last = XCHAR_OR_CHAR_INT (Fcar (Fcdr (range)));
|
|
|
1532 Emchar i;
|
|
|
1533
|
|
|
1534 for (i = first; i <= last; i++)
|
|
|
1535 Fput_char_table (make_char (i), val, chartab);
|
|
|
1536 }
|
|
|
1537 else
|
|
|
1538 abort ();
|
|
|
1539 }
|
|
|
1540 else
|
|
|
1541 Fput_char_table (range, val, chartab);
|
|
|
1542 }
|
|
|
1543
|
|
|
1544 return chartab;
|
|
|
1545 }
|
|
|
1546
|
|
|
1547 #ifdef MULE
|
|
|
1548
|
|
|
1549
|
|
|
1550 /************************************************************************/
|
|
|
1551 /* Category Tables, specifically */
|
|
|
1552 /************************************************************************/
|
|
|
1553
|
|
|
1554 DEFUN ("category-table-p", Fcategory_table_p, 1, 1, 0, /*
|
|
|
1555 Return t if ARG is a category table.
|
|
|
1556 A category table is a type of char table used for keeping track of
|
|
|
1557 categories. Categories are used for classifying characters for use
|
|
|
1558 in regexps -- you can refer to a category rather than having to use
|
|
|
1559 a complicated [] expression (and category lookups are significantly
|
|
|
1560 faster).
|
|
|
1561
|
|
|
1562 There are 95 different categories available, one for each printable
|
|
|
1563 character (including space) in the ASCII charset. Each category
|
|
|
1564 is designated by one such character, called a \"category designator\".
|
|
|
1565 They are specified in a regexp using the syntax \"\\cX\", where X is
|
|
104
|
1566 a category designator.
|
|
70
|
1567
|
|
|
1568 A category table specifies, for each character, the categories that
|
|
|
1569 the character is in. Note that a character can be in more than one
|
|
|
1570 category. More specifically, a category table maps from a character
|
|
|
1571 to either the value nil (meaning the character is in no categories)
|
|
|
1572 or a 95-element bit vector, specifying for each of the 95 categories
|
|
|
1573 whether the character is in that category.
|
|
|
1574
|
|
|
1575 Special Lisp functions are provided that abstract this, so you do not
|
|
|
1576 have to directly manipulate bit vectors.
|
|
|
1577 */
|
|
|
1578 (obj))
|
|
|
1579 {
|
|
183
|
1580 return (CHAR_TABLEP (obj) &&
|
|
|
1581 XCHAR_TABLE_TYPE (obj) == CHAR_TABLE_TYPE_CATEGORY) ?
|
|
|
1582 Qt : Qnil;
|
|
70
|
1583 }
|
|
|
1584
|
|
|
1585 static Lisp_Object
|
|
|
1586 check_category_table (Lisp_Object obj, Lisp_Object def)
|
|
|
1587 {
|
|
|
1588 if (NILP (obj))
|
|
|
1589 obj = def;
|
|
|
1590 while (NILP (Fcategory_table_p (obj)))
|
|
|
1591 obj = wrong_type_argument (Qcategory_table_p, obj);
|
|
183
|
1592 return obj;
|
|
|
1593 }
|
|
70
|
1594
|
|
104
|
1595 int
|
|
183
|
1596 check_category_char (Emchar ch, Lisp_Object table,
|
|
|
1597 unsigned int designator, unsigned int not)
|
|
104
|
1598 {
|
|
|
1599 register Lisp_Object temp;
|
|
183
|
1600 struct Lisp_Char_Table *ctbl;
|
|
110
|
1601 #ifdef ERROR_CHECK_TYPECHECK
|
|
104
|
1602 if (NILP (Fcategory_table_p (table)))
|
|
183
|
1603 signal_simple_error ("Expected category table", table);
|
|
104
|
1604 #endif
|
|
183
|
1605 ctbl = XCHAR_TABLE (table);
|
|
|
1606 temp = get_char_table (ch, ctbl);
|
|
104
|
1607 if (EQ (temp, Qnil)) return not;
|
|
183
|
1608
|
|
104
|
1609 designator -= ' ';
|
|
183
|
1610 return bit_vector_bit (XBIT_VECTOR (temp), designator) ? !not : not;
|
|
104
|
1611 }
|
|
|
1612
|
|
|
1613 DEFUN ("check-category-at", Fcheck_category_at, 2, 4, 0, /*
|
|
110
|
1614 Return t if category of a character at POS includes DESIGNATOR,
|
|
104
|
1615 else return nil. Optional third arg specifies which buffer
|
|
|
1616 (defaulting to current), and fourth specifies the CATEGORY-TABLE,
|
|
|
1617 (defaulting to the buffer's category table).
|
|
|
1618 */
|
|
|
1619 (pos, designator, buffer, category_table))
|
|
|
1620 {
|
|
|
1621 Lisp_Object ctbl;
|
|
|
1622 Emchar ch;
|
|
|
1623 unsigned int des;
|
|
183
|
1624 struct buffer *buf = decode_buffer (buffer, 0);
|
|
104
|
1625
|
|
|
1626 CHECK_INT (pos);
|
|
|
1627 CHECK_CATEGORY_DESIGNATOR (designator);
|
|
183
|
1628 des = XREALINT (designator);
|
|
104
|
1629 ctbl = check_category_table (category_table, Vstandard_category_table);
|
|
183
|
1630 ch = BUF_FETCH_CHAR (buf, XINT (pos));
|
|
|
1631 return check_category_char (ch, ctbl, des, 0) ? Qt : Qnil;
|
|
110
|
1632 }
|
|
|
1633
|
|
|
1634 DEFUN ("char-in-category-p", Fchar_in_category_p, 2, 3, 0, /*
|
|
183
|
1635 Return t if category of character CHR includes DESIGNATOR, else nil.
|
|
|
1636 Optional third arg specifies the CATEGORY-TABLE to use,
|
|
110
|
1637 which defaults to the system default table.
|
|
|
1638 */
|
|
|
1639 (chr, designator, category_table))
|
|
|
1640 {
|
|
|
1641 Lisp_Object ctbl;
|
|
|
1642 Emchar ch;
|
|
|
1643 unsigned int des;
|
|
|
1644
|
|
|
1645 CHECK_CATEGORY_DESIGNATOR (designator);
|
|
183
|
1646 des = XREALINT (designator);
|
|
|
1647 CHECK_CHAR (chr);
|
|
|
1648 ch = XCHAR (chr);
|
|
110
|
1649 ctbl = check_category_table (category_table, Vstandard_category_table);
|
|
183
|
1650 return check_category_char (ch, ctbl, des, 0) ? Qt : Qnil;
|
|
104
|
1651 }
|
|
|
1652
|
|
70
|
1653 DEFUN ("category-table", Fcategory_table, 0, 1, 0, /*
|
|
|
1654 Return the current category table.
|
|
|
1655 This is the one specified by the current buffer, or by BUFFER if it
|
|
|
1656 is non-nil.
|
|
|
1657 */
|
|
|
1658 (buffer))
|
|
|
1659 {
|
|
|
1660 return decode_buffer (buffer, 0)->category_table;
|
|
|
1661 }
|
|
|
1662
|
|
|
1663 DEFUN ("standard-category-table", Fstandard_category_table, 0, 0, 0, /*
|
|
|
1664 Return the standard category table.
|
|
|
1665 This is the one used for new buffers.
|
|
|
1666 */
|
|
|
1667 ())
|
|
|
1668 {
|
|
|
1669 return Vstandard_category_table;
|
|
|
1670 }
|
|
|
1671
|
|
|
1672 DEFUN ("copy-category-table", Fcopy_category_table, 0, 1, 0, /*
|
|
|
1673 Construct a new category table and return it.
|
|
|
1674 It is a copy of the TABLE, which defaults to the standard category table.
|
|
|
1675 */
|
|
|
1676 (table))
|
|
|
1677 {
|
|
|
1678 if (NILP (Vstandard_category_table))
|
|
|
1679 return Fmake_char_table (Qcategory);
|
|
|
1680
|
|
|
1681 table = check_category_table (table, Vstandard_category_table);
|
|
|
1682 return Fcopy_char_table (table);
|
|
|
1683 }
|
|
|
1684
|
|
|
1685 DEFUN ("set-category-table", Fset_category_table, 1, 2, 0, /*
|
|
|
1686 Select a new category table for BUFFER.
|
|
|
1687 One argument, a category table.
|
|
|
1688 BUFFER defaults to the current buffer if omitted.
|
|
|
1689 */
|
|
|
1690 (table, buffer))
|
|
|
1691 {
|
|
|
1692 struct buffer *buf = decode_buffer (buffer, 0);
|
|
|
1693 table = check_category_table (table, Qnil);
|
|
|
1694 buf->category_table = table;
|
|
|
1695 /* Indicate that this buffer now has a specified category table. */
|
|
|
1696 buf->local_var_flags |= XINT (buffer_local_flags.category_table);
|
|
|
1697 return table;
|
|
|
1698 }
|
|
|
1699
|
|
|
1700 DEFUN ("category-designator-p", Fcategory_designator_p, 1, 1, 0, /*
|
|
|
1701 Return t if ARG is a category designator (a char in the range ' ' to '~').
|
|
|
1702 */
|
|
|
1703 (obj))
|
|
|
1704 {
|
|
181
|
1705 return CATEGORY_DESIGNATORP (obj) ? Qt : Qnil;
|
|
70
|
1706 }
|
|
|
1707
|
|
|
1708 DEFUN ("category-table-value-p", Fcategory_table_value_p, 1, 1, 0, /*
|
|
|
1709 Return t if ARG is a category table value.
|
|
|
1710 Valid values are nil or a bit vector of size 95.
|
|
|
1711 */
|
|
|
1712 (obj))
|
|
|
1713 {
|
|
181
|
1714 return CATEGORY_TABLE_VALUEP (obj) ? Qt : Qnil;
|
|
70
|
1715 }
|
|
|
1716
|
|
|
1717 #endif /* MULE */
|
|
|
1718
|
|
|
1719
|
|
|
1720 void
|
|
|
1721 syms_of_chartab (void)
|
|
|
1722 {
|
|
|
1723 #ifdef MULE
|
|
|
1724 defsymbol (&Qcategory_table_p, "category-table-p");
|
|
|
1725 defsymbol (&Qcategory_designator_p, "category-designator-p");
|
|
|
1726 defsymbol (&Qcategory_table_value_p, "category-table-value-p");
|
|
|
1727 #endif /* MULE */
|
|
|
1728
|
|
|
1729 defsymbol (&Qchar_table, "char-table");
|
|
|
1730 defsymbol (&Qchar_tablep, "char-table-p");
|
|
|
1731
|
|
|
1732 DEFSUBR (Fchar_table_p);
|
|
|
1733 DEFSUBR (Fchar_table_type_list);
|
|
|
1734 DEFSUBR (Fvalid_char_table_type_p);
|
|
|
1735 DEFSUBR (Fchar_table_type);
|
|
|
1736 DEFSUBR (Freset_char_table);
|
|
|
1737 DEFSUBR (Fmake_char_table);
|
|
|
1738 DEFSUBR (Fcopy_char_table);
|
|
|
1739 DEFSUBR (Fget_char_table);
|
|
|
1740 DEFSUBR (Fget_range_char_table);
|
|
|
1741 DEFSUBR (Fvalid_char_table_value_p);
|
|
|
1742 DEFSUBR (Fcheck_valid_char_table_value);
|
|
|
1743 DEFSUBR (Fput_char_table);
|
|
|
1744 DEFSUBR (Fmap_char_table);
|
|
|
1745
|
|
|
1746 #ifdef MULE
|
|
|
1747 DEFSUBR (Fcategory_table_p);
|
|
|
1748 DEFSUBR (Fcategory_table);
|
|
|
1749 DEFSUBR (Fstandard_category_table);
|
|
|
1750 DEFSUBR (Fcopy_category_table);
|
|
|
1751 DEFSUBR (Fset_category_table);
|
|
104
|
1752 DEFSUBR (Fcheck_category_at);
|
|
110
|
1753 DEFSUBR (Fchar_in_category_p);
|
|
70
|
1754 DEFSUBR (Fcategory_designator_p);
|
|
|
1755 DEFSUBR (Fcategory_table_value_p);
|
|
|
1756 #endif /* MULE */
|
|
|
1757
|
|
|
1758 /* DO NOT staticpro this. It works just like Vweak_hash_tables. */
|
|
|
1759 Vall_syntax_tables = Qnil;
|
|
|
1760 }
|
|
|
1761
|
|
|
1762 void
|
|
|
1763 structure_type_create_chartab (void)
|
|
|
1764 {
|
|
|
1765 struct structure_type *st;
|
|
|
1766
|
|
|
1767 st = define_structure_type (Qchar_table, 0, chartab_instantiate);
|
|
|
1768
|
|
|
1769 define_structure_type_keyword (st, Qtype, chartab_type_validate);
|
|
|
1770 define_structure_type_keyword (st, Qdata, chartab_data_validate);
|
|
|
1771 }
|
|
|
1772
|
|
|
1773 void
|
|
|
1774 complex_vars_of_chartab (void)
|
|
|
1775 {
|
|
|
1776 #ifdef MULE
|
|
|
1777 /* Set this now, so first buffer creation can refer to it. */
|
|
|
1778 /* Make it nil before calling copy-category-table
|
|
|
1779 so that copy-category-table will know not to try to copy from garbage */
|
|
|
1780 Vstandard_category_table = Qnil;
|
|
|
1781 Vstandard_category_table = Fcopy_category_table (Qnil);
|
|
|
1782 staticpro (&Vstandard_category_table);
|
|
|
1783 #endif /* MULE */
|
|
|
1784 }
|
