Commit | Line | Data |
---|---|---|
7b863bd5 | 1 | /* Random utility Lisp functions. |
0b5538bd TTN |
2 | Copyright (C) 1985, 1986, 1987, 1993, 1994, 1995, 1997, |
3 | 1998, 1999, 2000, 2001, 2002, 2003, 2004, | |
4 | 2005 Free Software Foundation, Inc. | |
7b863bd5 JB |
5 | |
6 | This file is part of GNU Emacs. | |
7 | ||
8 | GNU Emacs is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
4ff1aed9 | 10 | the Free Software Foundation; either version 2, or (at your option) |
7b863bd5 JB |
11 | any later version. |
12 | ||
13 | GNU Emacs is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GNU Emacs; see the file COPYING. If not, write to | |
4fc5845f LK |
20 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
21 | Boston, MA 02110-1301, USA. */ | |
7b863bd5 | 22 | |
18160b98 | 23 | #include <config.h> |
7b863bd5 | 24 | |
dfcf069d AS |
25 | #ifdef HAVE_UNISTD_H |
26 | #include <unistd.h> | |
27 | #endif | |
58edb572 | 28 | #include <time.h> |
dfcf069d | 29 | |
b15325b2 ST |
30 | #ifndef MAC_OS |
31 | /* On Mac OS, defining this conflicts with precompiled headers. */ | |
365fa1b3 | 32 | |
7b863bd5 JB |
33 | /* Note on some machines this defines `vector' as a typedef, |
34 | so make sure we don't use that name in this file. */ | |
35 | #undef vector | |
36 | #define vector ***** | |
365fa1b3 AC |
37 | |
38 | #endif /* ! MAC_OSX */ | |
39 | ||
7b863bd5 JB |
40 | #include "lisp.h" |
41 | #include "commands.h" | |
a8283a4a | 42 | #include "charset.h" |
dec002ca | 43 | #include "coding.h" |
7b863bd5 | 44 | #include "buffer.h" |
f812877e | 45 | #include "keyboard.h" |
8feddab4 | 46 | #include "keymap.h" |
ac811a55 | 47 | #include "intervals.h" |
2d8e7e1f RS |
48 | #include "frame.h" |
49 | #include "window.h" | |
91b11d9d | 50 | #include "blockinput.h" |
d73c6532 | 51 | #if defined (HAVE_MENUS) && defined (HAVE_X_WINDOWS) |
dfcf069d AS |
52 | #include "xterm.h" |
53 | #endif | |
7b863bd5 | 54 | |
bc937db7 | 55 | #ifndef NULL |
dec002ca | 56 | #define NULL ((POINTER_TYPE *)0) |
bc937db7 KH |
57 | #endif |
58 | ||
bdd8d692 RS |
59 | /* Nonzero enables use of dialog boxes for questions |
60 | asked by mouse commands. */ | |
61 | int use_dialog_box; | |
62 | ||
03d6484e JD |
63 | /* Nonzero enables use of a file dialog for file name |
64 | questions asked by mouse commands. */ | |
65 | int use_file_dialog; | |
66 | ||
2d8e7e1f RS |
67 | extern int minibuffer_auto_raise; |
68 | extern Lisp_Object minibuf_window; | |
dec002ca | 69 | extern Lisp_Object Vlocale_coding_system; |
7aed223d | 70 | extern int load_in_progress; |
2d8e7e1f | 71 | |
68732608 | 72 | Lisp_Object Qstring_lessp, Qprovide, Qrequire; |
0ce830bc | 73 | Lisp_Object Qyes_or_no_p_history; |
eb4ffa4e | 74 | Lisp_Object Qcursor_in_echo_area; |
b4f334f7 | 75 | Lisp_Object Qwidget_type; |
dec002ca | 76 | Lisp_Object Qcodeset, Qdays, Qmonths, Qpaper; |
7b863bd5 | 77 | |
3844ee44 RS |
78 | extern Lisp_Object Qinput_method_function; |
79 | ||
43f15d4a | 80 | static int internal_equal P_ ((Lisp_Object , Lisp_Object, int, int)); |
49bdcd3e RS |
81 | |
82 | extern long get_random (); | |
43f15d4a | 83 | extern void seed_random P_ ((long)); |
49bdcd3e RS |
84 | |
85 | #ifndef HAVE_UNISTD_H | |
86 | extern long time (); | |
87 | #endif | |
e0f5cf5a | 88 | \f |
7b863bd5 | 89 | DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0, |
ddb67bdc | 90 | doc: /* Return the argument unchanged. */) |
e9d8ddc9 | 91 | (arg) |
7b863bd5 JB |
92 | Lisp_Object arg; |
93 | { | |
94 | return arg; | |
95 | } | |
96 | ||
97 | DEFUN ("random", Frandom, Srandom, 0, 1, 0, | |
e9d8ddc9 | 98 | doc: /* Return a pseudo-random number. |
47cebab1 | 99 | All integers representable in Lisp are equally likely. |
0dc72b11 | 100 | On most systems, this is 29 bits' worth. |
47cebab1 | 101 | With positive integer argument N, return random number in interval [0,N). |
e9d8ddc9 MB |
102 | With argument t, set the random number seed from the current time and pid. */) |
103 | (n) | |
88fe8140 | 104 | Lisp_Object n; |
7b863bd5 | 105 | { |
e2d6972a KH |
106 | EMACS_INT val; |
107 | Lisp_Object lispy_val; | |
78217ef1 | 108 | unsigned long denominator; |
7b863bd5 | 109 | |
88fe8140 | 110 | if (EQ (n, Qt)) |
e2d6972a | 111 | seed_random (getpid () + time (NULL)); |
88fe8140 | 112 | if (NATNUMP (n) && XFASTINT (n) != 0) |
7b863bd5 | 113 | { |
4cab5074 KH |
114 | /* Try to take our random number from the higher bits of VAL, |
115 | not the lower, since (says Gentzel) the low bits of `random' | |
116 | are less random than the higher ones. We do this by using the | |
117 | quotient rather than the remainder. At the high end of the RNG | |
88fe8140 | 118 | it's possible to get a quotient larger than n; discarding |
4cab5074 | 119 | these values eliminates the bias that would otherwise appear |
88fe8140 EN |
120 | when using a large n. */ |
121 | denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n); | |
4cab5074 | 122 | do |
99175c23 | 123 | val = get_random () / denominator; |
88fe8140 | 124 | while (val >= XFASTINT (n)); |
7b863bd5 | 125 | } |
78217ef1 | 126 | else |
99175c23 | 127 | val = get_random (); |
e2d6972a KH |
128 | XSETINT (lispy_val, val); |
129 | return lispy_val; | |
7b863bd5 JB |
130 | } |
131 | \f | |
132 | /* Random data-structure functions */ | |
133 | ||
134 | DEFUN ("length", Flength, Slength, 1, 1, 0, | |
e9d8ddc9 | 135 | doc: /* Return the length of vector, list or string SEQUENCE. |
47cebab1 | 136 | A byte-code function object is also allowed. |
f5965ada | 137 | If the string contains multibyte characters, this is not necessarily |
47cebab1 | 138 | the number of bytes in the string; it is the number of characters. |
e9d8ddc9 MB |
139 | To get the number of bytes, use `string-bytes'. */) |
140 | (sequence) | |
88fe8140 | 141 | register Lisp_Object sequence; |
7b863bd5 | 142 | { |
504f24f1 | 143 | register Lisp_Object val; |
7b863bd5 JB |
144 | register int i; |
145 | ||
146 | retry: | |
88fe8140 | 147 | if (STRINGP (sequence)) |
d5db4077 | 148 | XSETFASTINT (val, SCHARS (sequence)); |
88fe8140 EN |
149 | else if (VECTORP (sequence)) |
150 | XSETFASTINT (val, XVECTOR (sequence)->size); | |
b1f81fc5 JB |
151 | else if (SUB_CHAR_TABLE_P (sequence)) |
152 | XSETFASTINT (val, SUB_CHAR_TABLE_ORDINARY_SLOTS); | |
88fe8140 | 153 | else if (CHAR_TABLE_P (sequence)) |
64a5094a | 154 | XSETFASTINT (val, MAX_CHAR); |
88fe8140 EN |
155 | else if (BOOL_VECTOR_P (sequence)) |
156 | XSETFASTINT (val, XBOOL_VECTOR (sequence)->size); | |
157 | else if (COMPILEDP (sequence)) | |
158 | XSETFASTINT (val, XVECTOR (sequence)->size & PSEUDOVECTOR_SIZE_MASK); | |
159 | else if (CONSP (sequence)) | |
7b863bd5 | 160 | { |
7843e09c GM |
161 | i = 0; |
162 | while (CONSP (sequence)) | |
7b863bd5 | 163 | { |
f2be3671 | 164 | sequence = XCDR (sequence); |
7843e09c GM |
165 | ++i; |
166 | ||
167 | if (!CONSP (sequence)) | |
168 | break; | |
169 | ||
170 | sequence = XCDR (sequence); | |
171 | ++i; | |
172 | QUIT; | |
7b863bd5 JB |
173 | } |
174 | ||
f2be3671 GM |
175 | if (!NILP (sequence)) |
176 | wrong_type_argument (Qlistp, sequence); | |
177 | ||
178 | val = make_number (i); | |
7b863bd5 | 179 | } |
88fe8140 | 180 | else if (NILP (sequence)) |
a2ad3e19 | 181 | XSETFASTINT (val, 0); |
7b863bd5 JB |
182 | else |
183 | { | |
88fe8140 | 184 | sequence = wrong_type_argument (Qsequencep, sequence); |
7b863bd5 JB |
185 | goto retry; |
186 | } | |
a2ad3e19 | 187 | return val; |
7b863bd5 JB |
188 | } |
189 | ||
12ae7fc6 | 190 | /* This does not check for quits. That is safe since it must terminate. */ |
5a30fab8 RS |
191 | |
192 | DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0, | |
e9d8ddc9 | 193 | doc: /* Return the length of a list, but avoid error or infinite loop. |
47cebab1 GM |
194 | This function never gets an error. If LIST is not really a list, |
195 | it returns 0. If LIST is circular, it returns a finite value | |
e9d8ddc9 MB |
196 | which is at least the number of distinct elements. */) |
197 | (list) | |
5a30fab8 RS |
198 | Lisp_Object list; |
199 | { | |
200 | Lisp_Object tail, halftail, length; | |
201 | int len = 0; | |
202 | ||
203 | /* halftail is used to detect circular lists. */ | |
204 | halftail = list; | |
70949dac | 205 | for (tail = list; CONSP (tail); tail = XCDR (tail)) |
5a30fab8 RS |
206 | { |
207 | if (EQ (tail, halftail) && len != 0) | |
cb3d1a0a | 208 | break; |
5a30fab8 | 209 | len++; |
3a61aeb4 | 210 | if ((len & 1) == 0) |
70949dac | 211 | halftail = XCDR (halftail); |
5a30fab8 RS |
212 | } |
213 | ||
214 | XSETINT (length, len); | |
215 | return length; | |
216 | } | |
217 | ||
91f78c99 | 218 | DEFUN ("string-bytes", Fstring_bytes, Sstring_bytes, 1, 1, 0, |
e9d8ddc9 MB |
219 | doc: /* Return the number of bytes in STRING. |
220 | If STRING is a multibyte string, this is greater than the length of STRING. */) | |
221 | (string) | |
eaf17c6b | 222 | Lisp_Object string; |
026f59ce | 223 | { |
b7826503 | 224 | CHECK_STRING (string); |
d5db4077 | 225 | return make_number (SBYTES (string)); |
026f59ce RS |
226 | } |
227 | ||
7b863bd5 | 228 | DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0, |
e9d8ddc9 | 229 | doc: /* Return t if two strings have identical contents. |
47cebab1 | 230 | Case is significant, but text properties are ignored. |
e9d8ddc9 MB |
231 | Symbols are also allowed; their print names are used instead. */) |
232 | (s1, s2) | |
7b863bd5 JB |
233 | register Lisp_Object s1, s2; |
234 | { | |
7650760e | 235 | if (SYMBOLP (s1)) |
c06583e1 | 236 | s1 = SYMBOL_NAME (s1); |
7650760e | 237 | if (SYMBOLP (s2)) |
c06583e1 | 238 | s2 = SYMBOL_NAME (s2); |
b7826503 PJ |
239 | CHECK_STRING (s1); |
240 | CHECK_STRING (s2); | |
7b863bd5 | 241 | |
d5db4077 KR |
242 | if (SCHARS (s1) != SCHARS (s2) |
243 | || SBYTES (s1) != SBYTES (s2) | |
244 | || bcmp (SDATA (s1), SDATA (s2), SBYTES (s1))) | |
7b863bd5 JB |
245 | return Qnil; |
246 | return Qt; | |
247 | } | |
248 | ||
0e1e9f8d | 249 | DEFUN ("compare-strings", Fcompare_strings, |
f95837d0 | 250 | Scompare_strings, 6, 7, 0, |
e9d8ddc9 | 251 | doc: /* Compare the contents of two strings, converting to multibyte if needed. |
47cebab1 GM |
252 | In string STR1, skip the first START1 characters and stop at END1. |
253 | In string STR2, skip the first START2 characters and stop at END2. | |
254 | END1 and END2 default to the full lengths of the respective strings. | |
255 | ||
256 | Case is significant in this comparison if IGNORE-CASE is nil. | |
257 | Unibyte strings are converted to multibyte for comparison. | |
258 | ||
259 | The value is t if the strings (or specified portions) match. | |
260 | If string STR1 is less, the value is a negative number N; | |
261 | - 1 - N is the number of characters that match at the beginning. | |
262 | If string STR1 is greater, the value is a positive number N; | |
e9d8ddc9 MB |
263 | N - 1 is the number of characters that match at the beginning. */) |
264 | (str1, start1, end1, str2, start2, end2, ignore_case) | |
0e1e9f8d RS |
265 | Lisp_Object str1, start1, end1, start2, str2, end2, ignore_case; |
266 | { | |
267 | register int end1_char, end2_char; | |
268 | register int i1, i1_byte, i2, i2_byte; | |
269 | ||
b7826503 PJ |
270 | CHECK_STRING (str1); |
271 | CHECK_STRING (str2); | |
0e1e9f8d RS |
272 | if (NILP (start1)) |
273 | start1 = make_number (0); | |
274 | if (NILP (start2)) | |
275 | start2 = make_number (0); | |
b7826503 PJ |
276 | CHECK_NATNUM (start1); |
277 | CHECK_NATNUM (start2); | |
0e1e9f8d | 278 | if (! NILP (end1)) |
b7826503 | 279 | CHECK_NATNUM (end1); |
0e1e9f8d | 280 | if (! NILP (end2)) |
b7826503 | 281 | CHECK_NATNUM (end2); |
0e1e9f8d RS |
282 | |
283 | i1 = XINT (start1); | |
284 | i2 = XINT (start2); | |
285 | ||
286 | i1_byte = string_char_to_byte (str1, i1); | |
287 | i2_byte = string_char_to_byte (str2, i2); | |
288 | ||
d5db4077 | 289 | end1_char = SCHARS (str1); |
0e1e9f8d RS |
290 | if (! NILP (end1) && end1_char > XINT (end1)) |
291 | end1_char = XINT (end1); | |
292 | ||
d5db4077 | 293 | end2_char = SCHARS (str2); |
0e1e9f8d RS |
294 | if (! NILP (end2) && end2_char > XINT (end2)) |
295 | end2_char = XINT (end2); | |
296 | ||
297 | while (i1 < end1_char && i2 < end2_char) | |
298 | { | |
299 | /* When we find a mismatch, we must compare the | |
300 | characters, not just the bytes. */ | |
301 | int c1, c2; | |
302 | ||
303 | if (STRING_MULTIBYTE (str1)) | |
2efdd1b9 | 304 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c1, str1, i1, i1_byte); |
0e1e9f8d RS |
305 | else |
306 | { | |
d5db4077 | 307 | c1 = SREF (str1, i1++); |
0e1e9f8d RS |
308 | c1 = unibyte_char_to_multibyte (c1); |
309 | } | |
310 | ||
311 | if (STRING_MULTIBYTE (str2)) | |
2efdd1b9 | 312 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c2, str2, i2, i2_byte); |
0e1e9f8d RS |
313 | else |
314 | { | |
d5db4077 | 315 | c2 = SREF (str2, i2++); |
0e1e9f8d RS |
316 | c2 = unibyte_char_to_multibyte (c2); |
317 | } | |
318 | ||
319 | if (c1 == c2) | |
320 | continue; | |
321 | ||
322 | if (! NILP (ignore_case)) | |
323 | { | |
324 | Lisp_Object tem; | |
325 | ||
326 | tem = Fupcase (make_number (c1)); | |
327 | c1 = XINT (tem); | |
328 | tem = Fupcase (make_number (c2)); | |
329 | c2 = XINT (tem); | |
330 | } | |
331 | ||
332 | if (c1 == c2) | |
333 | continue; | |
334 | ||
335 | /* Note that I1 has already been incremented | |
336 | past the character that we are comparing; | |
337 | hence we don't add or subtract 1 here. */ | |
338 | if (c1 < c2) | |
60f8d735 | 339 | return make_number (- i1 + XINT (start1)); |
0e1e9f8d | 340 | else |
60f8d735 | 341 | return make_number (i1 - XINT (start1)); |
0e1e9f8d RS |
342 | } |
343 | ||
344 | if (i1 < end1_char) | |
345 | return make_number (i1 - XINT (start1) + 1); | |
346 | if (i2 < end2_char) | |
347 | return make_number (- i1 + XINT (start1) - 1); | |
348 | ||
349 | return Qt; | |
350 | } | |
351 | ||
7b863bd5 | 352 | DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0, |
e9d8ddc9 | 353 | doc: /* Return t if first arg string is less than second in lexicographic order. |
47cebab1 | 354 | Case is significant. |
e9d8ddc9 MB |
355 | Symbols are also allowed; their print names are used instead. */) |
356 | (s1, s2) | |
7b863bd5 JB |
357 | register Lisp_Object s1, s2; |
358 | { | |
7b863bd5 | 359 | register int end; |
09ab3c3b | 360 | register int i1, i1_byte, i2, i2_byte; |
7b863bd5 | 361 | |
7650760e | 362 | if (SYMBOLP (s1)) |
c06583e1 | 363 | s1 = SYMBOL_NAME (s1); |
7650760e | 364 | if (SYMBOLP (s2)) |
c06583e1 | 365 | s2 = SYMBOL_NAME (s2); |
b7826503 PJ |
366 | CHECK_STRING (s1); |
367 | CHECK_STRING (s2); | |
7b863bd5 | 368 | |
09ab3c3b KH |
369 | i1 = i1_byte = i2 = i2_byte = 0; |
370 | ||
d5db4077 KR |
371 | end = SCHARS (s1); |
372 | if (end > SCHARS (s2)) | |
373 | end = SCHARS (s2); | |
7b863bd5 | 374 | |
09ab3c3b | 375 | while (i1 < end) |
7b863bd5 | 376 | { |
09ab3c3b KH |
377 | /* When we find a mismatch, we must compare the |
378 | characters, not just the bytes. */ | |
379 | int c1, c2; | |
380 | ||
2efdd1b9 KH |
381 | FETCH_STRING_CHAR_ADVANCE (c1, s1, i1, i1_byte); |
382 | FETCH_STRING_CHAR_ADVANCE (c2, s2, i2, i2_byte); | |
09ab3c3b KH |
383 | |
384 | if (c1 != c2) | |
385 | return c1 < c2 ? Qt : Qnil; | |
7b863bd5 | 386 | } |
d5db4077 | 387 | return i1 < SCHARS (s2) ? Qt : Qnil; |
7b863bd5 JB |
388 | } |
389 | \f | |
390 | static Lisp_Object concat (); | |
391 | ||
392 | /* ARGSUSED */ | |
393 | Lisp_Object | |
394 | concat2 (s1, s2) | |
395 | Lisp_Object s1, s2; | |
396 | { | |
397 | #ifdef NO_ARG_ARRAY | |
398 | Lisp_Object args[2]; | |
399 | args[0] = s1; | |
400 | args[1] = s2; | |
401 | return concat (2, args, Lisp_String, 0); | |
402 | #else | |
403 | return concat (2, &s1, Lisp_String, 0); | |
404 | #endif /* NO_ARG_ARRAY */ | |
405 | } | |
406 | ||
d4af3687 RS |
407 | /* ARGSUSED */ |
408 | Lisp_Object | |
409 | concat3 (s1, s2, s3) | |
410 | Lisp_Object s1, s2, s3; | |
411 | { | |
412 | #ifdef NO_ARG_ARRAY | |
413 | Lisp_Object args[3]; | |
414 | args[0] = s1; | |
415 | args[1] = s2; | |
416 | args[2] = s3; | |
417 | return concat (3, args, Lisp_String, 0); | |
418 | #else | |
419 | return concat (3, &s1, Lisp_String, 0); | |
420 | #endif /* NO_ARG_ARRAY */ | |
421 | } | |
422 | ||
7b863bd5 | 423 | DEFUN ("append", Fappend, Sappend, 0, MANY, 0, |
e9d8ddc9 | 424 | doc: /* Concatenate all the arguments and make the result a list. |
47cebab1 GM |
425 | The result is a list whose elements are the elements of all the arguments. |
426 | Each argument may be a list, vector or string. | |
4bf8e2a3 MB |
427 | The last argument is not copied, just used as the tail of the new list. |
428 | usage: (append &rest SEQUENCES) */) | |
e9d8ddc9 | 429 | (nargs, args) |
7b863bd5 JB |
430 | int nargs; |
431 | Lisp_Object *args; | |
432 | { | |
433 | return concat (nargs, args, Lisp_Cons, 1); | |
434 | } | |
435 | ||
436 | DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0, | |
e9d8ddc9 | 437 | doc: /* Concatenate all the arguments and make the result a string. |
47cebab1 | 438 | The result is a string whose elements are the elements of all the arguments. |
4bf8e2a3 MB |
439 | Each argument may be a string or a list or vector of characters (integers). |
440 | usage: (concat &rest SEQUENCES) */) | |
e9d8ddc9 | 441 | (nargs, args) |
7b863bd5 JB |
442 | int nargs; |
443 | Lisp_Object *args; | |
444 | { | |
445 | return concat (nargs, args, Lisp_String, 0); | |
446 | } | |
447 | ||
448 | DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0, | |
e9d8ddc9 | 449 | doc: /* Concatenate all the arguments and make the result a vector. |
47cebab1 | 450 | The result is a vector whose elements are the elements of all the arguments. |
4bf8e2a3 MB |
451 | Each argument may be a list, vector or string. |
452 | usage: (vconcat &rest SEQUENCES) */) | |
e9d8ddc9 | 453 | (nargs, args) |
7b863bd5 JB |
454 | int nargs; |
455 | Lisp_Object *args; | |
456 | { | |
3e7383eb | 457 | return concat (nargs, args, Lisp_Vectorlike, 0); |
7b863bd5 JB |
458 | } |
459 | ||
f5965ada | 460 | /* Return a copy of a sub char table ARG. The elements except for a |
3720677d KH |
461 | nested sub char table are not copied. */ |
462 | static Lisp_Object | |
463 | copy_sub_char_table (arg) | |
e1335ba2 | 464 | Lisp_Object arg; |
3720677d | 465 | { |
1468c19b | 466 | Lisp_Object copy = make_sub_char_table (Qnil); |
3720677d KH |
467 | int i; |
468 | ||
1468c19b | 469 | XCHAR_TABLE (copy)->defalt = XCHAR_TABLE (arg)->defalt; |
3720677d KH |
470 | /* Copy all the contents. */ |
471 | bcopy (XCHAR_TABLE (arg)->contents, XCHAR_TABLE (copy)->contents, | |
472 | SUB_CHAR_TABLE_ORDINARY_SLOTS * sizeof (Lisp_Object)); | |
473 | /* Recursively copy any sub char-tables in the ordinary slots. */ | |
474 | for (i = 32; i < SUB_CHAR_TABLE_ORDINARY_SLOTS; i++) | |
475 | if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i])) | |
476 | XCHAR_TABLE (copy)->contents[i] | |
477 | = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]); | |
478 | ||
479 | return copy; | |
480 | } | |
481 | ||
482 | ||
7b863bd5 | 483 | DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0, |
7652ade0 | 484 | doc: /* Return a copy of a list, vector, string or char-table. |
47cebab1 | 485 | The elements of a list or vector are not copied; they are shared |
e9d8ddc9 MB |
486 | with the original. */) |
487 | (arg) | |
7b863bd5 JB |
488 | Lisp_Object arg; |
489 | { | |
265a9e55 | 490 | if (NILP (arg)) return arg; |
e03f7933 RS |
491 | |
492 | if (CHAR_TABLE_P (arg)) | |
493 | { | |
25c30748 | 494 | int i; |
e03f7933 RS |
495 | Lisp_Object copy; |
496 | ||
c8640abf | 497 | copy = Fmake_char_table (XCHAR_TABLE (arg)->purpose, Qnil); |
e03f7933 | 498 | /* Copy all the slots, including the extra ones. */ |
69b3a14b | 499 | bcopy (XVECTOR (arg)->contents, XVECTOR (copy)->contents, |
25c30748 KH |
500 | ((XCHAR_TABLE (arg)->size & PSEUDOVECTOR_SIZE_MASK) |
501 | * sizeof (Lisp_Object))); | |
e03f7933 | 502 | |
3720677d KH |
503 | /* Recursively copy any sub char tables in the ordinary slots |
504 | for multibyte characters. */ | |
505 | for (i = CHAR_TABLE_SINGLE_BYTE_SLOTS; | |
506 | i < CHAR_TABLE_ORDINARY_SLOTS; i++) | |
507 | if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i])) | |
e03f7933 | 508 | XCHAR_TABLE (copy)->contents[i] |
3720677d | 509 | = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]); |
e03f7933 RS |
510 | |
511 | return copy; | |
512 | } | |
513 | ||
514 | if (BOOL_VECTOR_P (arg)) | |
515 | { | |
516 | Lisp_Object val; | |
e03f7933 | 517 | int size_in_chars |
db85986c AS |
518 | = ((XBOOL_VECTOR (arg)->size + BOOL_VECTOR_BITS_PER_CHAR - 1) |
519 | / BOOL_VECTOR_BITS_PER_CHAR); | |
e03f7933 RS |
520 | |
521 | val = Fmake_bool_vector (Flength (arg), Qnil); | |
522 | bcopy (XBOOL_VECTOR (arg)->data, XBOOL_VECTOR (val)->data, | |
523 | size_in_chars); | |
524 | return val; | |
525 | } | |
526 | ||
7650760e | 527 | if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg)) |
7b863bd5 JB |
528 | arg = wrong_type_argument (Qsequencep, arg); |
529 | return concat (1, &arg, CONSP (arg) ? Lisp_Cons : XTYPE (arg), 0); | |
530 | } | |
531 | ||
2d6115c8 KH |
532 | /* This structure holds information of an argument of `concat' that is |
533 | a string and has text properties to be copied. */ | |
87f0532f | 534 | struct textprop_rec |
2d6115c8 KH |
535 | { |
536 | int argnum; /* refer to ARGS (arguments of `concat') */ | |
537 | int from; /* refer to ARGS[argnum] (argument string) */ | |
538 | int to; /* refer to VAL (the target string) */ | |
539 | }; | |
540 | ||
7b863bd5 JB |
541 | static Lisp_Object |
542 | concat (nargs, args, target_type, last_special) | |
543 | int nargs; | |
544 | Lisp_Object *args; | |
545 | enum Lisp_Type target_type; | |
546 | int last_special; | |
547 | { | |
548 | Lisp_Object val; | |
7b863bd5 JB |
549 | register Lisp_Object tail; |
550 | register Lisp_Object this; | |
551 | int toindex; | |
093386ca | 552 | int toindex_byte = 0; |
ea35ce3d RS |
553 | register int result_len; |
554 | register int result_len_byte; | |
7b863bd5 JB |
555 | register int argnum; |
556 | Lisp_Object last_tail; | |
557 | Lisp_Object prev; | |
ea35ce3d | 558 | int some_multibyte; |
2d6115c8 KH |
559 | /* When we make a multibyte string, we can't copy text properties |
560 | while concatinating each string because the length of resulting | |
561 | string can't be decided until we finish the whole concatination. | |
562 | So, we record strings that have text properties to be copied | |
563 | here, and copy the text properties after the concatination. */ | |
093386ca | 564 | struct textprop_rec *textprops = NULL; |
87f0532f KH |
565 | /* Number of elments in textprops. */ |
566 | int num_textprops = 0; | |
2ec7f67a | 567 | USE_SAFE_ALLOCA; |
7b863bd5 | 568 | |
093386ca GM |
569 | tail = Qnil; |
570 | ||
7b863bd5 JB |
571 | /* In append, the last arg isn't treated like the others */ |
572 | if (last_special && nargs > 0) | |
573 | { | |
574 | nargs--; | |
575 | last_tail = args[nargs]; | |
576 | } | |
577 | else | |
578 | last_tail = Qnil; | |
579 | ||
ea35ce3d | 580 | /* Canonicalize each argument. */ |
7b863bd5 JB |
581 | for (argnum = 0; argnum < nargs; argnum++) |
582 | { | |
583 | this = args[argnum]; | |
7650760e | 584 | if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this) |
e03f7933 | 585 | || COMPILEDP (this) || BOOL_VECTOR_P (this))) |
7b863bd5 | 586 | { |
7b863bd5 JB |
587 | args[argnum] = wrong_type_argument (Qsequencep, this); |
588 | } | |
589 | } | |
590 | ||
ea35ce3d RS |
591 | /* Compute total length in chars of arguments in RESULT_LEN. |
592 | If desired output is a string, also compute length in bytes | |
593 | in RESULT_LEN_BYTE, and determine in SOME_MULTIBYTE | |
594 | whether the result should be a multibyte string. */ | |
595 | result_len_byte = 0; | |
596 | result_len = 0; | |
597 | some_multibyte = 0; | |
598 | for (argnum = 0; argnum < nargs; argnum++) | |
7b863bd5 | 599 | { |
ea35ce3d | 600 | int len; |
7b863bd5 | 601 | this = args[argnum]; |
ea35ce3d RS |
602 | len = XFASTINT (Flength (this)); |
603 | if (target_type == Lisp_String) | |
5b6dddaa | 604 | { |
09ab3c3b KH |
605 | /* We must count the number of bytes needed in the string |
606 | as well as the number of characters. */ | |
5b6dddaa KH |
607 | int i; |
608 | Lisp_Object ch; | |
ea35ce3d | 609 | int this_len_byte; |
5b6dddaa | 610 | |
dec58e65 | 611 | if (VECTORP (this)) |
ea35ce3d | 612 | for (i = 0; i < len; i++) |
dec58e65 KH |
613 | { |
614 | ch = XVECTOR (this)->contents[i]; | |
615 | if (! INTEGERP (ch)) | |
616 | wrong_type_argument (Qintegerp, ch); | |
cc531c44 | 617 | this_len_byte = CHAR_BYTES (XINT (ch)); |
ea35ce3d | 618 | result_len_byte += this_len_byte; |
2efdd1b9 | 619 | if (!SINGLE_BYTE_CHAR_P (XINT (ch))) |
ea35ce3d | 620 | some_multibyte = 1; |
dec58e65 | 621 | } |
6d475204 RS |
622 | else if (BOOL_VECTOR_P (this) && XBOOL_VECTOR (this)->size > 0) |
623 | wrong_type_argument (Qintegerp, Faref (this, make_number (0))); | |
ea35ce3d | 624 | else if (CONSP (this)) |
70949dac | 625 | for (; CONSP (this); this = XCDR (this)) |
dec58e65 | 626 | { |
70949dac | 627 | ch = XCAR (this); |
dec58e65 KH |
628 | if (! INTEGERP (ch)) |
629 | wrong_type_argument (Qintegerp, ch); | |
cc531c44 | 630 | this_len_byte = CHAR_BYTES (XINT (ch)); |
ea35ce3d | 631 | result_len_byte += this_len_byte; |
2efdd1b9 | 632 | if (!SINGLE_BYTE_CHAR_P (XINT (ch))) |
ea35ce3d | 633 | some_multibyte = 1; |
dec58e65 | 634 | } |
470730a8 | 635 | else if (STRINGP (this)) |
ea35ce3d | 636 | { |
06f57aa7 | 637 | if (STRING_MULTIBYTE (this)) |
09ab3c3b KH |
638 | { |
639 | some_multibyte = 1; | |
d5db4077 | 640 | result_len_byte += SBYTES (this); |
09ab3c3b KH |
641 | } |
642 | else | |
d5db4077 KR |
643 | result_len_byte += count_size_as_multibyte (SDATA (this), |
644 | SCHARS (this)); | |
ea35ce3d | 645 | } |
5b6dddaa | 646 | } |
ea35ce3d RS |
647 | |
648 | result_len += len; | |
7b863bd5 JB |
649 | } |
650 | ||
09ab3c3b KH |
651 | if (! some_multibyte) |
652 | result_len_byte = result_len; | |
7b863bd5 | 653 | |
ea35ce3d | 654 | /* Create the output object. */ |
7b863bd5 | 655 | if (target_type == Lisp_Cons) |
ea35ce3d | 656 | val = Fmake_list (make_number (result_len), Qnil); |
3e7383eb | 657 | else if (target_type == Lisp_Vectorlike) |
ea35ce3d | 658 | val = Fmake_vector (make_number (result_len), Qnil); |
b10b2daa | 659 | else if (some_multibyte) |
ea35ce3d | 660 | val = make_uninit_multibyte_string (result_len, result_len_byte); |
b10b2daa RS |
661 | else |
662 | val = make_uninit_string (result_len); | |
7b863bd5 | 663 | |
09ab3c3b KH |
664 | /* In `append', if all but last arg are nil, return last arg. */ |
665 | if (target_type == Lisp_Cons && EQ (val, Qnil)) | |
666 | return last_tail; | |
7b863bd5 | 667 | |
ea35ce3d | 668 | /* Copy the contents of the args into the result. */ |
7b863bd5 | 669 | if (CONSP (val)) |
2d6115c8 | 670 | tail = val, toindex = -1; /* -1 in toindex is flag we are making a list */ |
7b863bd5 | 671 | else |
ea35ce3d | 672 | toindex = 0, toindex_byte = 0; |
7b863bd5 JB |
673 | |
674 | prev = Qnil; | |
2d6115c8 | 675 | if (STRINGP (val)) |
2ec7f67a | 676 | SAFE_ALLOCA (textprops, struct textprop_rec *, sizeof (struct textprop_rec) * nargs); |
7b863bd5 JB |
677 | |
678 | for (argnum = 0; argnum < nargs; argnum++) | |
679 | { | |
680 | Lisp_Object thislen; | |
093386ca | 681 | int thisleni = 0; |
de712da3 | 682 | register unsigned int thisindex = 0; |
ea35ce3d | 683 | register unsigned int thisindex_byte = 0; |
7b863bd5 JB |
684 | |
685 | this = args[argnum]; | |
686 | if (!CONSP (this)) | |
687 | thislen = Flength (this), thisleni = XINT (thislen); | |
688 | ||
ea35ce3d RS |
689 | /* Between strings of the same kind, copy fast. */ |
690 | if (STRINGP (this) && STRINGP (val) | |
691 | && STRING_MULTIBYTE (this) == some_multibyte) | |
7b863bd5 | 692 | { |
d5db4077 | 693 | int thislen_byte = SBYTES (this); |
2d6115c8 | 694 | |
d5db4077 KR |
695 | bcopy (SDATA (this), SDATA (val) + toindex_byte, |
696 | SBYTES (this)); | |
d5db4077 | 697 | if (! NULL_INTERVAL_P (STRING_INTERVALS (this))) |
2d6115c8 | 698 | { |
87f0532f | 699 | textprops[num_textprops].argnum = argnum; |
a54ad220 | 700 | textprops[num_textprops].from = 0; |
87f0532f | 701 | textprops[num_textprops++].to = toindex; |
2d6115c8 | 702 | } |
ea35ce3d | 703 | toindex_byte += thislen_byte; |
a54ad220 KH |
704 | toindex += thisleni; |
705 | STRING_SET_CHARS (val, SCHARS (val)); | |
ea35ce3d | 706 | } |
09ab3c3b KH |
707 | /* Copy a single-byte string to a multibyte string. */ |
708 | else if (STRINGP (this) && STRINGP (val)) | |
709 | { | |
d5db4077 | 710 | if (! NULL_INTERVAL_P (STRING_INTERVALS (this))) |
2d6115c8 | 711 | { |
87f0532f KH |
712 | textprops[num_textprops].argnum = argnum; |
713 | textprops[num_textprops].from = 0; | |
714 | textprops[num_textprops++].to = toindex; | |
2d6115c8 | 715 | } |
d5db4077 KR |
716 | toindex_byte += copy_text (SDATA (this), |
717 | SDATA (val) + toindex_byte, | |
718 | SCHARS (this), 0, 1); | |
09ab3c3b KH |
719 | toindex += thisleni; |
720 | } | |
ea35ce3d RS |
721 | else |
722 | /* Copy element by element. */ | |
723 | while (1) | |
724 | { | |
725 | register Lisp_Object elt; | |
726 | ||
727 | /* Fetch next element of `this' arg into `elt', or break if | |
728 | `this' is exhausted. */ | |
729 | if (NILP (this)) break; | |
730 | if (CONSP (this)) | |
70949dac | 731 | elt = XCAR (this), this = XCDR (this); |
6a7df83b RS |
732 | else if (thisindex >= thisleni) |
733 | break; | |
734 | else if (STRINGP (this)) | |
ea35ce3d | 735 | { |
2cef5737 | 736 | int c; |
6a7df83b | 737 | if (STRING_MULTIBYTE (this)) |
ea35ce3d | 738 | { |
2efdd1b9 KH |
739 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, this, |
740 | thisindex, | |
741 | thisindex_byte); | |
6a7df83b | 742 | XSETFASTINT (elt, c); |
ea35ce3d | 743 | } |
6a7df83b | 744 | else |
ea35ce3d | 745 | { |
2a1893f4 | 746 | XSETFASTINT (elt, SREF (this, thisindex)); thisindex++; |
e0e25273 KH |
747 | if (some_multibyte |
748 | && (XINT (elt) >= 0240 | |
f9638719 EZ |
749 | || (XINT (elt) >= 0200 |
750 | && ! NILP (Vnonascii_translation_table))) | |
6a7df83b RS |
751 | && XINT (elt) < 0400) |
752 | { | |
2cef5737 | 753 | c = unibyte_char_to_multibyte (XINT (elt)); |
6a7df83b RS |
754 | XSETINT (elt, c); |
755 | } | |
ea35ce3d | 756 | } |
6a7df83b RS |
757 | } |
758 | else if (BOOL_VECTOR_P (this)) | |
759 | { | |
760 | int byte; | |
db85986c AS |
761 | byte = XBOOL_VECTOR (this)->data[thisindex / BOOL_VECTOR_BITS_PER_CHAR]; |
762 | if (byte & (1 << (thisindex % BOOL_VECTOR_BITS_PER_CHAR))) | |
6a7df83b | 763 | elt = Qt; |
ea35ce3d | 764 | else |
6a7df83b RS |
765 | elt = Qnil; |
766 | thisindex++; | |
ea35ce3d | 767 | } |
6a7df83b RS |
768 | else |
769 | elt = XVECTOR (this)->contents[thisindex++]; | |
7b863bd5 | 770 | |
ea35ce3d RS |
771 | /* Store this element into the result. */ |
772 | if (toindex < 0) | |
7b863bd5 | 773 | { |
f3fbd155 | 774 | XSETCAR (tail, elt); |
ea35ce3d | 775 | prev = tail; |
70949dac | 776 | tail = XCDR (tail); |
7b863bd5 | 777 | } |
ea35ce3d RS |
778 | else if (VECTORP (val)) |
779 | XVECTOR (val)->contents[toindex++] = elt; | |
780 | else | |
781 | { | |
b7826503 | 782 | CHECK_NUMBER (elt); |
ea35ce3d RS |
783 | if (SINGLE_BYTE_CHAR_P (XINT (elt))) |
784 | { | |
2efdd1b9 KH |
785 | if (some_multibyte) |
786 | toindex_byte | |
787 | += CHAR_STRING (XINT (elt), | |
d5db4077 | 788 | SDATA (val) + toindex_byte); |
2efdd1b9 | 789 | else |
08663750 | 790 | SSET (val, toindex_byte++, XINT (elt)); |
a54ad220 | 791 | toindex++; |
ea35ce3d RS |
792 | } |
793 | else | |
794 | /* If we have any multibyte characters, | |
795 | we already decided to make a multibyte string. */ | |
796 | { | |
797 | int c = XINT (elt); | |
ea35ce3d RS |
798 | /* P exists as a variable |
799 | to avoid a bug on the Masscomp C compiler. */ | |
08663750 | 800 | unsigned char *p = SDATA (val) + toindex_byte; |
64a5094a KH |
801 | |
802 | toindex_byte += CHAR_STRING (c, p); | |
ea35ce3d RS |
803 | toindex++; |
804 | } | |
805 | } | |
806 | } | |
7b863bd5 | 807 | } |
265a9e55 | 808 | if (!NILP (prev)) |
f3fbd155 | 809 | XSETCDR (prev, last_tail); |
7b863bd5 | 810 | |
87f0532f | 811 | if (num_textprops > 0) |
2d6115c8 | 812 | { |
33f37824 | 813 | Lisp_Object props; |
3bd00f3b | 814 | int last_to_end = -1; |
33f37824 | 815 | |
87f0532f | 816 | for (argnum = 0; argnum < num_textprops; argnum++) |
2d6115c8 | 817 | { |
87f0532f | 818 | this = args[textprops[argnum].argnum]; |
33f37824 KH |
819 | props = text_property_list (this, |
820 | make_number (0), | |
d5db4077 | 821 | make_number (SCHARS (this)), |
33f37824 KH |
822 | Qnil); |
823 | /* If successive arguments have properites, be sure that the | |
824 | value of `composition' property be the copy. */ | |
3bd00f3b | 825 | if (last_to_end == textprops[argnum].to) |
33f37824 KH |
826 | make_composition_value_copy (props); |
827 | add_text_properties_from_list (val, props, | |
828 | make_number (textprops[argnum].to)); | |
d5db4077 | 829 | last_to_end = textprops[argnum].to + SCHARS (this); |
2d6115c8 KH |
830 | } |
831 | } | |
2ec7f67a KS |
832 | |
833 | SAFE_FREE (); | |
b4f334f7 | 834 | return val; |
7b863bd5 JB |
835 | } |
836 | \f | |
09ab3c3b KH |
837 | static Lisp_Object string_char_byte_cache_string; |
838 | static int string_char_byte_cache_charpos; | |
839 | static int string_char_byte_cache_bytepos; | |
840 | ||
57247650 KH |
841 | void |
842 | clear_string_char_byte_cache () | |
843 | { | |
844 | string_char_byte_cache_string = Qnil; | |
845 | } | |
846 | ||
ea35ce3d RS |
847 | /* Return the character index corresponding to CHAR_INDEX in STRING. */ |
848 | ||
849 | int | |
850 | string_char_to_byte (string, char_index) | |
851 | Lisp_Object string; | |
852 | int char_index; | |
853 | { | |
09ab3c3b KH |
854 | int i, i_byte; |
855 | int best_below, best_below_byte; | |
856 | int best_above, best_above_byte; | |
ea35ce3d | 857 | |
09ab3c3b | 858 | best_below = best_below_byte = 0; |
d5db4077 KR |
859 | best_above = SCHARS (string); |
860 | best_above_byte = SBYTES (string); | |
13f52ed8 KH |
861 | if (best_above == best_above_byte) |
862 | return char_index; | |
09ab3c3b KH |
863 | |
864 | if (EQ (string, string_char_byte_cache_string)) | |
865 | { | |
866 | if (string_char_byte_cache_charpos < char_index) | |
867 | { | |
868 | best_below = string_char_byte_cache_charpos; | |
869 | best_below_byte = string_char_byte_cache_bytepos; | |
870 | } | |
871 | else | |
872 | { | |
873 | best_above = string_char_byte_cache_charpos; | |
874 | best_above_byte = string_char_byte_cache_bytepos; | |
875 | } | |
876 | } | |
877 | ||
878 | if (char_index - best_below < best_above - char_index) | |
879 | { | |
880 | while (best_below < char_index) | |
881 | { | |
882 | int c; | |
2efdd1b9 KH |
883 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, string, |
884 | best_below, best_below_byte); | |
09ab3c3b KH |
885 | } |
886 | i = best_below; | |
887 | i_byte = best_below_byte; | |
888 | } | |
889 | else | |
ea35ce3d | 890 | { |
09ab3c3b KH |
891 | while (best_above > char_index) |
892 | { | |
d5db4077 | 893 | unsigned char *pend = SDATA (string) + best_above_byte; |
e50d9192 KH |
894 | unsigned char *pbeg = pend - best_above_byte; |
895 | unsigned char *p = pend - 1; | |
896 | int bytes; | |
897 | ||
898 | while (p > pbeg && !CHAR_HEAD_P (*p)) p--; | |
899 | PARSE_MULTIBYTE_SEQ (p, pend - p, bytes); | |
900 | if (bytes == pend - p) | |
901 | best_above_byte -= bytes; | |
902 | else if (bytes > pend - p) | |
903 | best_above_byte -= (pend - p); | |
904 | else | |
09ab3c3b | 905 | best_above_byte--; |
09ab3c3b KH |
906 | best_above--; |
907 | } | |
908 | i = best_above; | |
909 | i_byte = best_above_byte; | |
ea35ce3d RS |
910 | } |
911 | ||
09ab3c3b KH |
912 | string_char_byte_cache_bytepos = i_byte; |
913 | string_char_byte_cache_charpos = i; | |
914 | string_char_byte_cache_string = string; | |
915 | ||
ea35ce3d RS |
916 | return i_byte; |
917 | } | |
09ab3c3b | 918 | \f |
ea35ce3d RS |
919 | /* Return the character index corresponding to BYTE_INDEX in STRING. */ |
920 | ||
921 | int | |
922 | string_byte_to_char (string, byte_index) | |
923 | Lisp_Object string; | |
924 | int byte_index; | |
925 | { | |
09ab3c3b KH |
926 | int i, i_byte; |
927 | int best_below, best_below_byte; | |
928 | int best_above, best_above_byte; | |
ea35ce3d | 929 | |
09ab3c3b | 930 | best_below = best_below_byte = 0; |
d5db4077 KR |
931 | best_above = SCHARS (string); |
932 | best_above_byte = SBYTES (string); | |
13f52ed8 KH |
933 | if (best_above == best_above_byte) |
934 | return byte_index; | |
09ab3c3b KH |
935 | |
936 | if (EQ (string, string_char_byte_cache_string)) | |
937 | { | |
938 | if (string_char_byte_cache_bytepos < byte_index) | |
939 | { | |
940 | best_below = string_char_byte_cache_charpos; | |
941 | best_below_byte = string_char_byte_cache_bytepos; | |
942 | } | |
943 | else | |
944 | { | |
945 | best_above = string_char_byte_cache_charpos; | |
946 | best_above_byte = string_char_byte_cache_bytepos; | |
947 | } | |
948 | } | |
949 | ||
950 | if (byte_index - best_below_byte < best_above_byte - byte_index) | |
951 | { | |
952 | while (best_below_byte < byte_index) | |
953 | { | |
954 | int c; | |
2efdd1b9 KH |
955 | FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, string, |
956 | best_below, best_below_byte); | |
09ab3c3b KH |
957 | } |
958 | i = best_below; | |
959 | i_byte = best_below_byte; | |
960 | } | |
961 | else | |
ea35ce3d | 962 | { |
09ab3c3b KH |
963 | while (best_above_byte > byte_index) |
964 | { | |
d5db4077 | 965 | unsigned char *pend = SDATA (string) + best_above_byte; |
e50d9192 KH |
966 | unsigned char *pbeg = pend - best_above_byte; |
967 | unsigned char *p = pend - 1; | |
968 | int bytes; | |
969 | ||
970 | while (p > pbeg && !CHAR_HEAD_P (*p)) p--; | |
971 | PARSE_MULTIBYTE_SEQ (p, pend - p, bytes); | |
972 | if (bytes == pend - p) | |
973 | best_above_byte -= bytes; | |
974 | else if (bytes > pend - p) | |
975 | best_above_byte -= (pend - p); | |
976 | else | |
09ab3c3b | 977 | best_above_byte--; |
09ab3c3b KH |
978 | best_above--; |
979 | } | |
980 | i = best_above; | |
981 | i_byte = best_above_byte; | |
ea35ce3d RS |
982 | } |
983 | ||
09ab3c3b KH |
984 | string_char_byte_cache_bytepos = i_byte; |
985 | string_char_byte_cache_charpos = i; | |
986 | string_char_byte_cache_string = string; | |
987 | ||
ea35ce3d RS |
988 | return i; |
989 | } | |
09ab3c3b | 990 | \f |
ea35ce3d | 991 | /* Convert STRING to a multibyte string. |
2cef5737 | 992 | Single-byte characters 0240 through 0377 are converted |
ea35ce3d RS |
993 | by adding nonascii_insert_offset to each. */ |
994 | ||
995 | Lisp_Object | |
996 | string_make_multibyte (string) | |
997 | Lisp_Object string; | |
998 | { | |
999 | unsigned char *buf; | |
1000 | int nbytes; | |
799c08ac KS |
1001 | Lisp_Object ret; |
1002 | USE_SAFE_ALLOCA; | |
ea35ce3d RS |
1003 | |
1004 | if (STRING_MULTIBYTE (string)) | |
1005 | return string; | |
1006 | ||
d5db4077 KR |
1007 | nbytes = count_size_as_multibyte (SDATA (string), |
1008 | SCHARS (string)); | |
6d475204 RS |
1009 | /* If all the chars are ASCII, they won't need any more bytes |
1010 | once converted. In that case, we can return STRING itself. */ | |
d5db4077 | 1011 | if (nbytes == SBYTES (string)) |
6d475204 RS |
1012 | return string; |
1013 | ||
799c08ac | 1014 | SAFE_ALLOCA (buf, unsigned char *, nbytes); |
d5db4077 | 1015 | copy_text (SDATA (string), buf, SBYTES (string), |
ea35ce3d RS |
1016 | 0, 1); |
1017 | ||
799c08ac | 1018 | ret = make_multibyte_string (buf, SCHARS (string), nbytes); |
233f3db6 | 1019 | SAFE_FREE (); |
799c08ac KS |
1020 | |
1021 | return ret; | |
ea35ce3d RS |
1022 | } |
1023 | ||
2df18cdb KH |
1024 | |
1025 | /* Convert STRING to a multibyte string without changing each | |
1026 | character codes. Thus, characters 0200 trough 0237 are converted | |
1027 | to eight-bit-control characters, and characters 0240 through 0377 | |
1028 | are converted eight-bit-graphic characters. */ | |
1029 | ||
1030 | Lisp_Object | |
1031 | string_to_multibyte (string) | |
1032 | Lisp_Object string; | |
1033 | { | |
1034 | unsigned char *buf; | |
1035 | int nbytes; | |
799c08ac KS |
1036 | Lisp_Object ret; |
1037 | USE_SAFE_ALLOCA; | |
2df18cdb KH |
1038 | |
1039 | if (STRING_MULTIBYTE (string)) | |
1040 | return string; | |
1041 | ||
1042 | nbytes = parse_str_to_multibyte (SDATA (string), SBYTES (string)); | |
fb4452cc KH |
1043 | /* If all the chars are ASCII or eight-bit-graphic, they won't need |
1044 | any more bytes once converted. */ | |
2df18cdb | 1045 | if (nbytes == SBYTES (string)) |
fb4452cc | 1046 | return make_multibyte_string (SDATA (string), nbytes, nbytes); |
2df18cdb | 1047 | |
799c08ac | 1048 | SAFE_ALLOCA (buf, unsigned char *, nbytes); |
2df18cdb KH |
1049 | bcopy (SDATA (string), buf, SBYTES (string)); |
1050 | str_to_multibyte (buf, nbytes, SBYTES (string)); | |
1051 | ||
799c08ac | 1052 | ret = make_multibyte_string (buf, SCHARS (string), nbytes); |
233f3db6 | 1053 | SAFE_FREE (); |
799c08ac KS |
1054 | |
1055 | return ret; | |
2df18cdb KH |
1056 | } |
1057 | ||
1058 | ||
ea35ce3d RS |
1059 | /* Convert STRING to a single-byte string. */ |
1060 | ||
1061 | Lisp_Object | |
1062 | string_make_unibyte (string) | |
1063 | Lisp_Object string; | |
1064 | { | |
799c08ac | 1065 | int nchars; |
ea35ce3d | 1066 | unsigned char *buf; |
a6cb6b78 | 1067 | Lisp_Object ret; |
799c08ac | 1068 | USE_SAFE_ALLOCA; |
ea35ce3d RS |
1069 | |
1070 | if (! STRING_MULTIBYTE (string)) | |
1071 | return string; | |
1072 | ||
799c08ac | 1073 | nchars = SCHARS (string); |
ea35ce3d | 1074 | |
799c08ac | 1075 | SAFE_ALLOCA (buf, unsigned char *, nchars); |
d5db4077 | 1076 | copy_text (SDATA (string), buf, SBYTES (string), |
ea35ce3d RS |
1077 | 1, 0); |
1078 | ||
799c08ac | 1079 | ret = make_unibyte_string (buf, nchars); |
233f3db6 | 1080 | SAFE_FREE (); |
a6cb6b78 JD |
1081 | |
1082 | return ret; | |
ea35ce3d | 1083 | } |
09ab3c3b KH |
1084 | |
1085 | DEFUN ("string-make-multibyte", Fstring_make_multibyte, Sstring_make_multibyte, | |
1086 | 1, 1, 0, | |
e9d8ddc9 | 1087 | doc: /* Return the multibyte equivalent of STRING. |
0dc72b11 LT |
1088 | If STRING is unibyte and contains non-ASCII characters, the function |
1089 | `unibyte-char-to-multibyte' is used to convert each unibyte character | |
1090 | to a multibyte character. In this case, the returned string is a | |
1091 | newly created string with no text properties. If STRING is multibyte | |
1092 | or entirely ASCII, it is returned unchanged. In particular, when | |
1093 | STRING is unibyte and entirely ASCII, the returned string is unibyte. | |
1094 | \(When the characters are all ASCII, Emacs primitives will treat the | |
1095 | string the same way whether it is unibyte or multibyte.) */) | |
e9d8ddc9 | 1096 | (string) |
09ab3c3b KH |
1097 | Lisp_Object string; |
1098 | { | |
b7826503 | 1099 | CHECK_STRING (string); |
aabd38ec | 1100 | |
09ab3c3b KH |
1101 | return string_make_multibyte (string); |
1102 | } | |
1103 | ||
1104 | DEFUN ("string-make-unibyte", Fstring_make_unibyte, Sstring_make_unibyte, | |
1105 | 1, 1, 0, | |
e9d8ddc9 | 1106 | doc: /* Return the unibyte equivalent of STRING. |
f8f2fbf9 EZ |
1107 | Multibyte character codes are converted to unibyte according to |
1108 | `nonascii-translation-table' or, if that is nil, `nonascii-insert-offset'. | |
1109 | If the lookup in the translation table fails, this function takes just | |
1110 | the low 8 bits of each character. */) | |
e9d8ddc9 | 1111 | (string) |
09ab3c3b KH |
1112 | Lisp_Object string; |
1113 | { | |
b7826503 | 1114 | CHECK_STRING (string); |
aabd38ec | 1115 | |
09ab3c3b KH |
1116 | return string_make_unibyte (string); |
1117 | } | |
6d475204 RS |
1118 | |
1119 | DEFUN ("string-as-unibyte", Fstring_as_unibyte, Sstring_as_unibyte, | |
1120 | 1, 1, 0, | |
e9d8ddc9 | 1121 | doc: /* Return a unibyte string with the same individual bytes as STRING. |
47cebab1 GM |
1122 | If STRING is unibyte, the result is STRING itself. |
1123 | Otherwise it is a newly created string, with no text properties. | |
1124 | If STRING is multibyte and contains a character of charset | |
1125 | `eight-bit-control' or `eight-bit-graphic', it is converted to the | |
e9d8ddc9 MB |
1126 | corresponding single byte. */) |
1127 | (string) | |
6d475204 RS |
1128 | Lisp_Object string; |
1129 | { | |
b7826503 | 1130 | CHECK_STRING (string); |
aabd38ec | 1131 | |
6d475204 RS |
1132 | if (STRING_MULTIBYTE (string)) |
1133 | { | |
d5db4077 | 1134 | int bytes = SBYTES (string); |
2efdd1b9 KH |
1135 | unsigned char *str = (unsigned char *) xmalloc (bytes); |
1136 | ||
d5db4077 | 1137 | bcopy (SDATA (string), str, bytes); |
2efdd1b9 KH |
1138 | bytes = str_as_unibyte (str, bytes); |
1139 | string = make_unibyte_string (str, bytes); | |
1140 | xfree (str); | |
6d475204 RS |
1141 | } |
1142 | return string; | |
1143 | } | |
1144 | ||
1145 | DEFUN ("string-as-multibyte", Fstring_as_multibyte, Sstring_as_multibyte, | |
1146 | 1, 1, 0, | |
e9d8ddc9 | 1147 | doc: /* Return a multibyte string with the same individual bytes as STRING. |
47cebab1 GM |
1148 | If STRING is multibyte, the result is STRING itself. |
1149 | Otherwise it is a newly created string, with no text properties. | |
1150 | If STRING is unibyte and contains an individual 8-bit byte (i.e. not | |
1151 | part of a multibyte form), it is converted to the corresponding | |
862779db SM |
1152 | multibyte character of charset `eight-bit-control' or `eight-bit-graphic'. |
1153 | Beware, this often doesn't really do what you think it does. | |
1154 | It is similar to (decode-coding-string STRING 'emacs-mule-unix). | |
1155 | If you're not sure, whether to use `string-as-multibyte' or | |
1156 | `string-to-multibyte', use `string-to-multibyte'. Beware: | |
c061dd8f KH |
1157 | (aref (string-as-multibyte "\\201") 0) -> 129 (aka ?\\201) |
1158 | (aref (string-as-multibyte "\\300") 0) -> 192 (aka ?\\300) | |
1159 | (aref (string-as-multibyte "\\300\\201") 0) -> 192 (aka ?\\300) | |
1160 | (aref (string-as-multibyte "\\300\\201") 1) -> 129 (aka ?\\201) | |
862779db | 1161 | but |
c061dd8f KH |
1162 | (aref (string-as-multibyte "\\201\\300") 0) -> 2240 |
1163 | (aref (string-as-multibyte "\\201\\300") 1) -> <error> */) | |
e9d8ddc9 | 1164 | (string) |
6d475204 RS |
1165 | Lisp_Object string; |
1166 | { | |
b7826503 | 1167 | CHECK_STRING (string); |
aabd38ec | 1168 | |
6d475204 RS |
1169 | if (! STRING_MULTIBYTE (string)) |
1170 | { | |
2efdd1b9 KH |
1171 | Lisp_Object new_string; |
1172 | int nchars, nbytes; | |
1173 | ||
d5db4077 KR |
1174 | parse_str_as_multibyte (SDATA (string), |
1175 | SBYTES (string), | |
2efdd1b9 KH |
1176 | &nchars, &nbytes); |
1177 | new_string = make_uninit_multibyte_string (nchars, nbytes); | |
d5db4077 KR |
1178 | bcopy (SDATA (string), SDATA (new_string), |
1179 | SBYTES (string)); | |
1180 | if (nbytes != SBYTES (string)) | |
1181 | str_as_multibyte (SDATA (new_string), nbytes, | |
1182 | SBYTES (string), NULL); | |
2efdd1b9 | 1183 | string = new_string; |
7a2e5600 | 1184 | STRING_SET_INTERVALS (string, NULL_INTERVAL); |
6d475204 RS |
1185 | } |
1186 | return string; | |
1187 | } | |
2df18cdb KH |
1188 | |
1189 | DEFUN ("string-to-multibyte", Fstring_to_multibyte, Sstring_to_multibyte, | |
1190 | 1, 1, 0, | |
1191 | doc: /* Return a multibyte string with the same individual chars as STRING. | |
9c7a329a | 1192 | If STRING is multibyte, the result is STRING itself. |
2df18cdb KH |
1193 | Otherwise it is a newly created string, with no text properties. |
1194 | Characters 0200 through 0237 are converted to eight-bit-control | |
1195 | characters of the same character code. Characters 0240 through 0377 | |
51931fe9 | 1196 | are converted to eight-bit-graphic characters of the same character |
862779db SM |
1197 | codes. |
1198 | This is similar to (decode-coding-string STRING 'binary) */) | |
2df18cdb KH |
1199 | (string) |
1200 | Lisp_Object string; | |
1201 | { | |
1202 | CHECK_STRING (string); | |
1203 | ||
1204 | return string_to_multibyte (string); | |
1205 | } | |
1206 | ||
ea35ce3d | 1207 | \f |
7b863bd5 | 1208 | DEFUN ("copy-alist", Fcopy_alist, Scopy_alist, 1, 1, 0, |
e9d8ddc9 | 1209 | doc: /* Return a copy of ALIST. |
47cebab1 GM |
1210 | This is an alist which represents the same mapping from objects to objects, |
1211 | but does not share the alist structure with ALIST. | |
1212 | The objects mapped (cars and cdrs of elements of the alist) | |
1213 | are shared, however. | |
e9d8ddc9 MB |
1214 | Elements of ALIST that are not conses are also shared. */) |
1215 | (alist) | |
7b863bd5 JB |
1216 | Lisp_Object alist; |
1217 | { | |
1218 | register Lisp_Object tem; | |
1219 | ||
b7826503 | 1220 | CHECK_LIST (alist); |
265a9e55 | 1221 | if (NILP (alist)) |
7b863bd5 JB |
1222 | return alist; |
1223 | alist = concat (1, &alist, Lisp_Cons, 0); | |
70949dac | 1224 | for (tem = alist; CONSP (tem); tem = XCDR (tem)) |
7b863bd5 JB |
1225 | { |
1226 | register Lisp_Object car; | |
70949dac | 1227 | car = XCAR (tem); |
7b863bd5 JB |
1228 | |
1229 | if (CONSP (car)) | |
f3fbd155 | 1230 | XSETCAR (tem, Fcons (XCAR (car), XCDR (car))); |
7b863bd5 JB |
1231 | } |
1232 | return alist; | |
1233 | } | |
1234 | ||
1235 | DEFUN ("substring", Fsubstring, Ssubstring, 2, 3, 0, | |
ddb67bdc | 1236 | doc: /* Return a substring of STRING, starting at index FROM and ending before TO. |
47cebab1 | 1237 | TO may be nil or omitted; then the substring runs to the end of STRING. |
91f78c99 | 1238 | FROM and TO start at 0. If either is negative, it counts from the end. |
47cebab1 | 1239 | |
e9d8ddc9 MB |
1240 | This function allows vectors as well as strings. */) |
1241 | (string, from, to) | |
7b863bd5 JB |
1242 | Lisp_Object string; |
1243 | register Lisp_Object from, to; | |
1244 | { | |
ac811a55 | 1245 | Lisp_Object res; |
21fbc8e5 | 1246 | int size; |
093386ca | 1247 | int size_byte = 0; |
ea35ce3d | 1248 | int from_char, to_char; |
093386ca | 1249 | int from_byte = 0, to_byte = 0; |
21fbc8e5 RS |
1250 | |
1251 | if (! (STRINGP (string) || VECTORP (string))) | |
1252 | wrong_type_argument (Qarrayp, string); | |
ac811a55 | 1253 | |
b7826503 | 1254 | CHECK_NUMBER (from); |
21fbc8e5 RS |
1255 | |
1256 | if (STRINGP (string)) | |
ea35ce3d | 1257 | { |
d5db4077 KR |
1258 | size = SCHARS (string); |
1259 | size_byte = SBYTES (string); | |
ea35ce3d | 1260 | } |
21fbc8e5 RS |
1261 | else |
1262 | size = XVECTOR (string)->size; | |
1263 | ||
265a9e55 | 1264 | if (NILP (to)) |
ea35ce3d RS |
1265 | { |
1266 | to_char = size; | |
1267 | to_byte = size_byte; | |
1268 | } | |
7b863bd5 | 1269 | else |
ea35ce3d | 1270 | { |
b7826503 | 1271 | CHECK_NUMBER (to); |
ea35ce3d RS |
1272 | |
1273 | to_char = XINT (to); | |
1274 | if (to_char < 0) | |
1275 | to_char += size; | |
1276 | ||
1277 | if (STRINGP (string)) | |
1278 | to_byte = string_char_to_byte (string, to_char); | |
1279 | } | |
1280 | ||
1281 | from_char = XINT (from); | |
1282 | if (from_char < 0) | |
1283 | from_char += size; | |
1284 | if (STRINGP (string)) | |
1285 | from_byte = string_char_to_byte (string, from_char); | |
7b863bd5 | 1286 | |
ea35ce3d RS |
1287 | if (!(0 <= from_char && from_char <= to_char && to_char <= size)) |
1288 | args_out_of_range_3 (string, make_number (from_char), | |
1289 | make_number (to_char)); | |
7b863bd5 | 1290 | |
21fbc8e5 RS |
1291 | if (STRINGP (string)) |
1292 | { | |
d5db4077 | 1293 | res = make_specified_string (SDATA (string) + from_byte, |
b10b2daa RS |
1294 | to_char - from_char, to_byte - from_byte, |
1295 | STRING_MULTIBYTE (string)); | |
21ab867f AS |
1296 | copy_text_properties (make_number (from_char), make_number (to_char), |
1297 | string, make_number (0), res, Qnil); | |
ea35ce3d RS |
1298 | } |
1299 | else | |
1300 | res = Fvector (to_char - from_char, | |
1301 | XVECTOR (string)->contents + from_char); | |
1302 | ||
1303 | return res; | |
1304 | } | |
1305 | ||
aebf4d42 RS |
1306 | |
1307 | DEFUN ("substring-no-properties", Fsubstring_no_properties, Ssubstring_no_properties, 1, 3, 0, | |
1308 | doc: /* Return a substring of STRING, without text properties. | |
1309 | It starts at index FROM and ending before TO. | |
1310 | TO may be nil or omitted; then the substring runs to the end of STRING. | |
1311 | If FROM is nil or omitted, the substring starts at the beginning of STRING. | |
1312 | If FROM or TO is negative, it counts from the end. | |
1313 | ||
1314 | With one argument, just copy STRING without its properties. */) | |
1315 | (string, from, to) | |
1316 | Lisp_Object string; | |
1317 | register Lisp_Object from, to; | |
1318 | { | |
1319 | int size, size_byte; | |
1320 | int from_char, to_char; | |
1321 | int from_byte, to_byte; | |
1322 | ||
1323 | CHECK_STRING (string); | |
1324 | ||
d5db4077 KR |
1325 | size = SCHARS (string); |
1326 | size_byte = SBYTES (string); | |
aebf4d42 RS |
1327 | |
1328 | if (NILP (from)) | |
1329 | from_char = from_byte = 0; | |
1330 | else | |
1331 | { | |
1332 | CHECK_NUMBER (from); | |
1333 | from_char = XINT (from); | |
1334 | if (from_char < 0) | |
1335 | from_char += size; | |
1336 | ||
1337 | from_byte = string_char_to_byte (string, from_char); | |
1338 | } | |
1339 | ||
1340 | if (NILP (to)) | |
1341 | { | |
1342 | to_char = size; | |
1343 | to_byte = size_byte; | |
1344 | } | |
1345 | else | |
1346 | { | |
1347 | CHECK_NUMBER (to); | |
1348 | ||
1349 | to_char = XINT (to); | |
1350 | if (to_char < 0) | |
1351 | to_char += size; | |
1352 | ||
1353 | to_byte = string_char_to_byte (string, to_char); | |
1354 | } | |
1355 | ||
1356 | if (!(0 <= from_char && from_char <= to_char && to_char <= size)) | |
1357 | args_out_of_range_3 (string, make_number (from_char), | |
1358 | make_number (to_char)); | |
1359 | ||
d5db4077 | 1360 | return make_specified_string (SDATA (string) + from_byte, |
aebf4d42 RS |
1361 | to_char - from_char, to_byte - from_byte, |
1362 | STRING_MULTIBYTE (string)); | |
1363 | } | |
1364 | ||
ea35ce3d RS |
1365 | /* Extract a substring of STRING, giving start and end positions |
1366 | both in characters and in bytes. */ | |
1367 | ||
1368 | Lisp_Object | |
1369 | substring_both (string, from, from_byte, to, to_byte) | |
1370 | Lisp_Object string; | |
1371 | int from, from_byte, to, to_byte; | |
1372 | { | |
1373 | Lisp_Object res; | |
1374 | int size; | |
1375 | int size_byte; | |
1376 | ||
1377 | if (! (STRINGP (string) || VECTORP (string))) | |
1378 | wrong_type_argument (Qarrayp, string); | |
1379 | ||
1380 | if (STRINGP (string)) | |
1381 | { | |
d5db4077 KR |
1382 | size = SCHARS (string); |
1383 | size_byte = SBYTES (string); | |
ea35ce3d RS |
1384 | } |
1385 | else | |
1386 | size = XVECTOR (string)->size; | |
1387 | ||
1388 | if (!(0 <= from && from <= to && to <= size)) | |
1389 | args_out_of_range_3 (string, make_number (from), make_number (to)); | |
1390 | ||
1391 | if (STRINGP (string)) | |
1392 | { | |
d5db4077 | 1393 | res = make_specified_string (SDATA (string) + from_byte, |
b10b2daa RS |
1394 | to - from, to_byte - from_byte, |
1395 | STRING_MULTIBYTE (string)); | |
21ab867f AS |
1396 | copy_text_properties (make_number (from), make_number (to), |
1397 | string, make_number (0), res, Qnil); | |
21fbc8e5 RS |
1398 | } |
1399 | else | |
ea35ce3d RS |
1400 | res = Fvector (to - from, |
1401 | XVECTOR (string)->contents + from); | |
b4f334f7 | 1402 | |
ac811a55 | 1403 | return res; |
7b863bd5 JB |
1404 | } |
1405 | \f | |
1406 | DEFUN ("nthcdr", Fnthcdr, Snthcdr, 2, 2, 0, | |
e9d8ddc9 MB |
1407 | doc: /* Take cdr N times on LIST, returns the result. */) |
1408 | (n, list) | |
7b863bd5 JB |
1409 | Lisp_Object n; |
1410 | register Lisp_Object list; | |
1411 | { | |
1412 | register int i, num; | |
b7826503 | 1413 | CHECK_NUMBER (n); |
7b863bd5 | 1414 | num = XINT (n); |
265a9e55 | 1415 | for (i = 0; i < num && !NILP (list); i++) |
7b863bd5 JB |
1416 | { |
1417 | QUIT; | |
71a8e74b DL |
1418 | if (! CONSP (list)) |
1419 | wrong_type_argument (Qlistp, list); | |
1420 | list = XCDR (list); | |
7b863bd5 JB |
1421 | } |
1422 | return list; | |
1423 | } | |
1424 | ||
1425 | DEFUN ("nth", Fnth, Snth, 2, 2, 0, | |
e9d8ddc9 MB |
1426 | doc: /* Return the Nth element of LIST. |
1427 | N counts from zero. If LIST is not that long, nil is returned. */) | |
1428 | (n, list) | |
7b863bd5 JB |
1429 | Lisp_Object n, list; |
1430 | { | |
1431 | return Fcar (Fnthcdr (n, list)); | |
1432 | } | |
1433 | ||
1434 | DEFUN ("elt", Felt, Selt, 2, 2, 0, | |
e9d8ddc9 MB |
1435 | doc: /* Return element of SEQUENCE at index N. */) |
1436 | (sequence, n) | |
88fe8140 | 1437 | register Lisp_Object sequence, n; |
7b863bd5 | 1438 | { |
b7826503 | 1439 | CHECK_NUMBER (n); |
7b863bd5 JB |
1440 | while (1) |
1441 | { | |
88fe8140 EN |
1442 | if (CONSP (sequence) || NILP (sequence)) |
1443 | return Fcar (Fnthcdr (n, sequence)); | |
1444 | else if (STRINGP (sequence) || VECTORP (sequence) | |
1445 | || BOOL_VECTOR_P (sequence) || CHAR_TABLE_P (sequence)) | |
1446 | return Faref (sequence, n); | |
7b863bd5 | 1447 | else |
88fe8140 | 1448 | sequence = wrong_type_argument (Qsequencep, sequence); |
7b863bd5 JB |
1449 | } |
1450 | } | |
1451 | ||
1452 | DEFUN ("member", Fmember, Smember, 2, 2, 0, | |
e9d8ddc9 MB |
1453 | doc: /* Return non-nil if ELT is an element of LIST. Comparison done with `equal'. |
1454 | The value is actually the tail of LIST whose car is ELT. */) | |
1455 | (elt, list) | |
7b863bd5 JB |
1456 | register Lisp_Object elt; |
1457 | Lisp_Object list; | |
1458 | { | |
1459 | register Lisp_Object tail; | |
70949dac | 1460 | for (tail = list; !NILP (tail); tail = XCDR (tail)) |
7b863bd5 JB |
1461 | { |
1462 | register Lisp_Object tem; | |
71a8e74b DL |
1463 | if (! CONSP (tail)) |
1464 | wrong_type_argument (Qlistp, list); | |
1465 | tem = XCAR (tail); | |
265a9e55 | 1466 | if (! NILP (Fequal (elt, tem))) |
7b863bd5 JB |
1467 | return tail; |
1468 | QUIT; | |
1469 | } | |
1470 | return Qnil; | |
1471 | } | |
1472 | ||
1473 | DEFUN ("memq", Fmemq, Smemq, 2, 2, 0, | |
e9d8ddc9 | 1474 | doc: /* Return non-nil if ELT is an element of LIST. |
c14ec135 | 1475 | Comparison done with `eq'. The value is actually the tail of LIST |
e9d8ddc9 MB |
1476 | whose car is ELT. */) |
1477 | (elt, list) | |
f2be3671 | 1478 | Lisp_Object elt, list; |
7b863bd5 | 1479 | { |
f2be3671 | 1480 | while (1) |
7b863bd5 | 1481 | { |
f2be3671 GM |
1482 | if (!CONSP (list) || EQ (XCAR (list), elt)) |
1483 | break; | |
59f953a2 | 1484 | |
f2be3671 GM |
1485 | list = XCDR (list); |
1486 | if (!CONSP (list) || EQ (XCAR (list), elt)) | |
1487 | break; | |
1488 | ||
1489 | list = XCDR (list); | |
1490 | if (!CONSP (list) || EQ (XCAR (list), elt)) | |
1491 | break; | |
1492 | ||
1493 | list = XCDR (list); | |
7b863bd5 JB |
1494 | QUIT; |
1495 | } | |
f2be3671 GM |
1496 | |
1497 | if (!CONSP (list) && !NILP (list)) | |
1498 | list = wrong_type_argument (Qlistp, list); | |
1499 | ||
1500 | return list; | |
7b863bd5 JB |
1501 | } |
1502 | ||
1503 | DEFUN ("assq", Fassq, Sassq, 2, 2, 0, | |
e9d8ddc9 | 1504 | doc: /* Return non-nil if KEY is `eq' to the car of an element of LIST. |
aa1b3f2e | 1505 | The value is actually the first element of LIST whose car is KEY. |
e9d8ddc9 MB |
1506 | Elements of LIST that are not conses are ignored. */) |
1507 | (key, list) | |
f2be3671 | 1508 | Lisp_Object key, list; |
7b863bd5 | 1509 | { |
f2be3671 GM |
1510 | Lisp_Object result; |
1511 | ||
1512 | while (1) | |
7b863bd5 | 1513 | { |
f2be3671 GM |
1514 | if (!CONSP (list) |
1515 | || (CONSP (XCAR (list)) | |
1516 | && EQ (XCAR (XCAR (list)), key))) | |
1517 | break; | |
59f953a2 | 1518 | |
f2be3671 GM |
1519 | list = XCDR (list); |
1520 | if (!CONSP (list) | |
1521 | || (CONSP (XCAR (list)) | |
1522 | && EQ (XCAR (XCAR (list)), key))) | |
1523 | break; | |
59f953a2 | 1524 | |
f2be3671 GM |
1525 | list = XCDR (list); |
1526 | if (!CONSP (list) | |
1527 | || (CONSP (XCAR (list)) | |
1528 | && EQ (XCAR (XCAR (list)), key))) | |
1529 | break; | |
59f953a2 | 1530 | |
f2be3671 | 1531 | list = XCDR (list); |
7b863bd5 JB |
1532 | QUIT; |
1533 | } | |
f2be3671 GM |
1534 | |
1535 | if (CONSP (list)) | |
1536 | result = XCAR (list); | |
1537 | else if (NILP (list)) | |
1538 | result = Qnil; | |
1539 | else | |
1540 | result = wrong_type_argument (Qlistp, list); | |
1541 | ||
1542 | return result; | |
7b863bd5 JB |
1543 | } |
1544 | ||
1545 | /* Like Fassq but never report an error and do not allow quits. | |
1546 | Use only on lists known never to be circular. */ | |
1547 | ||
1548 | Lisp_Object | |
1549 | assq_no_quit (key, list) | |
f2be3671 | 1550 | Lisp_Object key, list; |
7b863bd5 | 1551 | { |
f2be3671 GM |
1552 | while (CONSP (list) |
1553 | && (!CONSP (XCAR (list)) | |
1554 | || !EQ (XCAR (XCAR (list)), key))) | |
1555 | list = XCDR (list); | |
1556 | ||
1557 | return CONSP (list) ? XCAR (list) : Qnil; | |
7b863bd5 JB |
1558 | } |
1559 | ||
1560 | DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0, | |
e9d8ddc9 | 1561 | doc: /* Return non-nil if KEY is `equal' to the car of an element of LIST. |
aa1b3f2e | 1562 | The value is actually the first element of LIST whose car equals KEY. */) |
474d0535 | 1563 | (key, list) |
f2be3671 | 1564 | Lisp_Object key, list; |
7b863bd5 | 1565 | { |
f2be3671 GM |
1566 | Lisp_Object result, car; |
1567 | ||
1568 | while (1) | |
7b863bd5 | 1569 | { |
f2be3671 GM |
1570 | if (!CONSP (list) |
1571 | || (CONSP (XCAR (list)) | |
1572 | && (car = XCAR (XCAR (list)), | |
1573 | EQ (car, key) || !NILP (Fequal (car, key))))) | |
1574 | break; | |
59f953a2 | 1575 | |
f2be3671 GM |
1576 | list = XCDR (list); |
1577 | if (!CONSP (list) | |
1578 | || (CONSP (XCAR (list)) | |
1579 | && (car = XCAR (XCAR (list)), | |
1580 | EQ (car, key) || !NILP (Fequal (car, key))))) | |
1581 | break; | |
59f953a2 | 1582 | |
f2be3671 GM |
1583 | list = XCDR (list); |
1584 | if (!CONSP (list) | |
1585 | || (CONSP (XCAR (list)) | |
1586 | && (car = XCAR (XCAR (list)), | |
1587 | EQ (car, key) || !NILP (Fequal (car, key))))) | |
1588 | break; | |
59f953a2 | 1589 | |
f2be3671 | 1590 | list = XCDR (list); |
7b863bd5 JB |
1591 | QUIT; |
1592 | } | |
f2be3671 GM |
1593 | |
1594 | if (CONSP (list)) | |
1595 | result = XCAR (list); | |
1596 | else if (NILP (list)) | |
1597 | result = Qnil; | |
1598 | else | |
1599 | result = wrong_type_argument (Qlistp, list); | |
1600 | ||
1601 | return result; | |
7b863bd5 JB |
1602 | } |
1603 | ||
1604 | DEFUN ("rassq", Frassq, Srassq, 2, 2, 0, | |
e9d8ddc9 | 1605 | doc: /* Return non-nil if KEY is `eq' to the cdr of an element of LIST. |
aa1b3f2e | 1606 | The value is actually the first element of LIST whose cdr is KEY. */) |
e9d8ddc9 | 1607 | (key, list) |
7b863bd5 JB |
1608 | register Lisp_Object key; |
1609 | Lisp_Object list; | |
1610 | { | |
f2be3671 GM |
1611 | Lisp_Object result; |
1612 | ||
1613 | while (1) | |
7b863bd5 | 1614 | { |
f2be3671 GM |
1615 | if (!CONSP (list) |
1616 | || (CONSP (XCAR (list)) | |
1617 | && EQ (XCDR (XCAR (list)), key))) | |
1618 | break; | |
59f953a2 | 1619 | |
f2be3671 GM |
1620 | list = XCDR (list); |
1621 | if (!CONSP (list) | |
1622 | || (CONSP (XCAR (list)) | |
1623 | && EQ (XCDR (XCAR (list)), key))) | |
1624 | break; | |
59f953a2 | 1625 | |
f2be3671 GM |
1626 | list = XCDR (list); |
1627 | if (!CONSP (list) | |
1628 | || (CONSP (XCAR (list)) | |
1629 | && EQ (XCDR (XCAR (list)), key))) | |
1630 | break; | |
59f953a2 | 1631 | |
f2be3671 | 1632 | list = XCDR (list); |
7b863bd5 JB |
1633 | QUIT; |
1634 | } | |
f2be3671 GM |
1635 | |
1636 | if (NILP (list)) | |
1637 | result = Qnil; | |
1638 | else if (CONSP (list)) | |
1639 | result = XCAR (list); | |
1640 | else | |
1641 | result = wrong_type_argument (Qlistp, list); | |
1642 | ||
1643 | return result; | |
7b863bd5 | 1644 | } |
0fb5a19c RS |
1645 | |
1646 | DEFUN ("rassoc", Frassoc, Srassoc, 2, 2, 0, | |
e9d8ddc9 | 1647 | doc: /* Return non-nil if KEY is `equal' to the cdr of an element of LIST. |
aa1b3f2e | 1648 | The value is actually the first element of LIST whose cdr equals KEY. */) |
e9d8ddc9 | 1649 | (key, list) |
f2be3671 | 1650 | Lisp_Object key, list; |
0fb5a19c | 1651 | { |
f2be3671 GM |
1652 | Lisp_Object result, cdr; |
1653 | ||
1654 | while (1) | |
0fb5a19c | 1655 | { |
f2be3671 GM |
1656 | if (!CONSP (list) |
1657 | || (CONSP (XCAR (list)) | |
1658 | && (cdr = XCDR (XCAR (list)), | |
1659 | EQ (cdr, key) || !NILP (Fequal (cdr, key))))) | |
1660 | break; | |
59f953a2 | 1661 | |
f2be3671 GM |
1662 | list = XCDR (list); |
1663 | if (!CONSP (list) | |
1664 | || (CONSP (XCAR (list)) | |
1665 | && (cdr = XCDR (XCAR (list)), | |
1666 | EQ (cdr, key) || !NILP (Fequal (cdr, key))))) | |
1667 | break; | |
59f953a2 | 1668 | |
f2be3671 GM |
1669 | list = XCDR (list); |
1670 | if (!CONSP (list) | |
1671 | || (CONSP (XCAR (list)) | |
1672 | && (cdr = XCDR (XCAR (list)), | |
1673 | EQ (cdr, key) || !NILP (Fequal (cdr, key))))) | |
1674 | break; | |
59f953a2 | 1675 | |
f2be3671 | 1676 | list = XCDR (list); |
0fb5a19c RS |
1677 | QUIT; |
1678 | } | |
f2be3671 GM |
1679 | |
1680 | if (CONSP (list)) | |
1681 | result = XCAR (list); | |
1682 | else if (NILP (list)) | |
1683 | result = Qnil; | |
1684 | else | |
1685 | result = wrong_type_argument (Qlistp, list); | |
1686 | ||
1687 | return result; | |
0fb5a19c | 1688 | } |
7b863bd5 JB |
1689 | \f |
1690 | DEFUN ("delq", Fdelq, Sdelq, 2, 2, 0, | |
e9d8ddc9 | 1691 | doc: /* Delete by side effect any occurrences of ELT as a member of LIST. |
47cebab1 GM |
1692 | The modified LIST is returned. Comparison is done with `eq'. |
1693 | If the first member of LIST is ELT, there is no way to remove it by side effect; | |
1694 | therefore, write `(setq foo (delq element foo))' | |
e9d8ddc9 MB |
1695 | to be sure of changing the value of `foo'. */) |
1696 | (elt, list) | |
7b863bd5 JB |
1697 | register Lisp_Object elt; |
1698 | Lisp_Object list; | |
1699 | { | |
1700 | register Lisp_Object tail, prev; | |
1701 | register Lisp_Object tem; | |
1702 | ||
1703 | tail = list; | |
1704 | prev = Qnil; | |
265a9e55 | 1705 | while (!NILP (tail)) |
7b863bd5 | 1706 | { |
71a8e74b DL |
1707 | if (! CONSP (tail)) |
1708 | wrong_type_argument (Qlistp, list); | |
1709 | tem = XCAR (tail); | |
7b863bd5 JB |
1710 | if (EQ (elt, tem)) |
1711 | { | |
265a9e55 | 1712 | if (NILP (prev)) |
70949dac | 1713 | list = XCDR (tail); |
7b863bd5 | 1714 | else |
70949dac | 1715 | Fsetcdr (prev, XCDR (tail)); |
7b863bd5 JB |
1716 | } |
1717 | else | |
1718 | prev = tail; | |
70949dac | 1719 | tail = XCDR (tail); |
7b863bd5 JB |
1720 | QUIT; |
1721 | } | |
1722 | return list; | |
1723 | } | |
1724 | ||
ca8dd546 | 1725 | DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0, |
e9d8ddc9 | 1726 | doc: /* Delete by side effect any occurrences of ELT as a member of SEQ. |
47cebab1 GM |
1727 | SEQ must be a list, a vector, or a string. |
1728 | The modified SEQ is returned. Comparison is done with `equal'. | |
1729 | If SEQ is not a list, or the first member of SEQ is ELT, deleting it | |
1730 | is not a side effect; it is simply using a different sequence. | |
1731 | Therefore, write `(setq foo (delete element foo))' | |
e9d8ddc9 MB |
1732 | to be sure of changing the value of `foo'. */) |
1733 | (elt, seq) | |
e517f19d | 1734 | Lisp_Object elt, seq; |
1e134a5f | 1735 | { |
e517f19d GM |
1736 | if (VECTORP (seq)) |
1737 | { | |
504f24f1 | 1738 | EMACS_INT i, n; |
1e134a5f | 1739 | |
e517f19d GM |
1740 | for (i = n = 0; i < ASIZE (seq); ++i) |
1741 | if (NILP (Fequal (AREF (seq, i), elt))) | |
1742 | ++n; | |
1743 | ||
1744 | if (n != ASIZE (seq)) | |
1745 | { | |
b3660ef6 | 1746 | struct Lisp_Vector *p = allocate_vector (n); |
59f953a2 | 1747 | |
e517f19d GM |
1748 | for (i = n = 0; i < ASIZE (seq); ++i) |
1749 | if (NILP (Fequal (AREF (seq, i), elt))) | |
1750 | p->contents[n++] = AREF (seq, i); | |
1751 | ||
e517f19d GM |
1752 | XSETVECTOR (seq, p); |
1753 | } | |
1754 | } | |
1755 | else if (STRINGP (seq)) | |
1e134a5f | 1756 | { |
e517f19d GM |
1757 | EMACS_INT i, ibyte, nchars, nbytes, cbytes; |
1758 | int c; | |
1759 | ||
1760 | for (i = nchars = nbytes = ibyte = 0; | |
d5db4077 | 1761 | i < SCHARS (seq); |
e517f19d | 1762 | ++i, ibyte += cbytes) |
1e134a5f | 1763 | { |
e517f19d GM |
1764 | if (STRING_MULTIBYTE (seq)) |
1765 | { | |
08663750 | 1766 | c = STRING_CHAR (SDATA (seq) + ibyte, |
d5db4077 | 1767 | SBYTES (seq) - ibyte); |
e517f19d GM |
1768 | cbytes = CHAR_BYTES (c); |
1769 | } | |
1e134a5f | 1770 | else |
e517f19d | 1771 | { |
d5db4077 | 1772 | c = SREF (seq, i); |
e517f19d GM |
1773 | cbytes = 1; |
1774 | } | |
59f953a2 | 1775 | |
e517f19d GM |
1776 | if (!INTEGERP (elt) || c != XINT (elt)) |
1777 | { | |
1778 | ++nchars; | |
1779 | nbytes += cbytes; | |
1780 | } | |
1781 | } | |
1782 | ||
d5db4077 | 1783 | if (nchars != SCHARS (seq)) |
e517f19d GM |
1784 | { |
1785 | Lisp_Object tem; | |
1786 | ||
1787 | tem = make_uninit_multibyte_string (nchars, nbytes); | |
1788 | if (!STRING_MULTIBYTE (seq)) | |
d5db4077 | 1789 | STRING_SET_UNIBYTE (tem); |
59f953a2 | 1790 | |
e517f19d | 1791 | for (i = nchars = nbytes = ibyte = 0; |
d5db4077 | 1792 | i < SCHARS (seq); |
e517f19d GM |
1793 | ++i, ibyte += cbytes) |
1794 | { | |
1795 | if (STRING_MULTIBYTE (seq)) | |
1796 | { | |
08663750 | 1797 | c = STRING_CHAR (SDATA (seq) + ibyte, |
d5db4077 | 1798 | SBYTES (seq) - ibyte); |
e517f19d GM |
1799 | cbytes = CHAR_BYTES (c); |
1800 | } | |
1801 | else | |
1802 | { | |
d5db4077 | 1803 | c = SREF (seq, i); |
e517f19d GM |
1804 | cbytes = 1; |
1805 | } | |
59f953a2 | 1806 | |
e517f19d GM |
1807 | if (!INTEGERP (elt) || c != XINT (elt)) |
1808 | { | |
08663750 KR |
1809 | unsigned char *from = SDATA (seq) + ibyte; |
1810 | unsigned char *to = SDATA (tem) + nbytes; | |
e517f19d | 1811 | EMACS_INT n; |
59f953a2 | 1812 | |
e517f19d GM |
1813 | ++nchars; |
1814 | nbytes += cbytes; | |
59f953a2 | 1815 | |
e517f19d GM |
1816 | for (n = cbytes; n--; ) |
1817 | *to++ = *from++; | |
1818 | } | |
1819 | } | |
1820 | ||
1821 | seq = tem; | |
1e134a5f | 1822 | } |
1e134a5f | 1823 | } |
e517f19d GM |
1824 | else |
1825 | { | |
1826 | Lisp_Object tail, prev; | |
1827 | ||
1828 | for (tail = seq, prev = Qnil; !NILP (tail); tail = XCDR (tail)) | |
1829 | { | |
1830 | if (!CONSP (tail)) | |
1831 | wrong_type_argument (Qlistp, seq); | |
59f953a2 | 1832 | |
e517f19d GM |
1833 | if (!NILP (Fequal (elt, XCAR (tail)))) |
1834 | { | |
1835 | if (NILP (prev)) | |
1836 | seq = XCDR (tail); | |
1837 | else | |
1838 | Fsetcdr (prev, XCDR (tail)); | |
1839 | } | |
1840 | else | |
1841 | prev = tail; | |
1842 | QUIT; | |
1843 | } | |
1844 | } | |
59f953a2 | 1845 | |
e517f19d | 1846 | return seq; |
1e134a5f RM |
1847 | } |
1848 | ||
7b863bd5 | 1849 | DEFUN ("nreverse", Fnreverse, Snreverse, 1, 1, 0, |
e9d8ddc9 | 1850 | doc: /* Reverse LIST by modifying cdr pointers. |
cb8a2fd8 | 1851 | Return the reversed list. */) |
e9d8ddc9 | 1852 | (list) |
7b863bd5 JB |
1853 | Lisp_Object list; |
1854 | { | |
1855 | register Lisp_Object prev, tail, next; | |
1856 | ||
265a9e55 | 1857 | if (NILP (list)) return list; |
7b863bd5 JB |
1858 | prev = Qnil; |
1859 | tail = list; | |
265a9e55 | 1860 | while (!NILP (tail)) |
7b863bd5 JB |
1861 | { |
1862 | QUIT; | |
71a8e74b DL |
1863 | if (! CONSP (tail)) |
1864 | wrong_type_argument (Qlistp, list); | |
1865 | next = XCDR (tail); | |
7b863bd5 JB |
1866 | Fsetcdr (tail, prev); |
1867 | prev = tail; | |
1868 | tail = next; | |
1869 | } | |
1870 | return prev; | |
1871 | } | |
1872 | ||
1873 | DEFUN ("reverse", Freverse, Sreverse, 1, 1, 0, | |
cb8a2fd8 | 1874 | doc: /* Reverse LIST, copying. Return the reversed list. |
e9d8ddc9 MB |
1875 | See also the function `nreverse', which is used more often. */) |
1876 | (list) | |
7b863bd5 JB |
1877 | Lisp_Object list; |
1878 | { | |
9d14ae76 | 1879 | Lisp_Object new; |
7b863bd5 | 1880 | |
70949dac | 1881 | for (new = Qnil; CONSP (list); list = XCDR (list)) |
5c3ea973 DL |
1882 | { |
1883 | QUIT; | |
1884 | new = Fcons (XCAR (list), new); | |
1885 | } | |
9d14ae76 RS |
1886 | if (!NILP (list)) |
1887 | wrong_type_argument (Qconsp, list); | |
1888 | return new; | |
7b863bd5 JB |
1889 | } |
1890 | \f | |
1891 | Lisp_Object merge (); | |
1892 | ||
1893 | DEFUN ("sort", Fsort, Ssort, 2, 2, 0, | |
e9d8ddc9 | 1894 | doc: /* Sort LIST, stably, comparing elements using PREDICATE. |
47cebab1 | 1895 | Returns the sorted list. LIST is modified by side effects. |
5c796e80 | 1896 | PREDICATE is called with two elements of LIST, and should return non-nil |
71f6424d | 1897 | if the first element should sort before the second. */) |
e9d8ddc9 | 1898 | (list, predicate) |
88fe8140 | 1899 | Lisp_Object list, predicate; |
7b863bd5 JB |
1900 | { |
1901 | Lisp_Object front, back; | |
1902 | register Lisp_Object len, tem; | |
1903 | struct gcpro gcpro1, gcpro2; | |
1904 | register int length; | |
1905 | ||
1906 | front = list; | |
1907 | len = Flength (list); | |
1908 | length = XINT (len); | |
1909 | if (length < 2) | |
1910 | return list; | |
1911 | ||
1912 | XSETINT (len, (length / 2) - 1); | |
1913 | tem = Fnthcdr (len, list); | |
1914 | back = Fcdr (tem); | |
1915 | Fsetcdr (tem, Qnil); | |
1916 | ||
1917 | GCPRO2 (front, back); | |
88fe8140 EN |
1918 | front = Fsort (front, predicate); |
1919 | back = Fsort (back, predicate); | |
7b863bd5 | 1920 | UNGCPRO; |
88fe8140 | 1921 | return merge (front, back, predicate); |
7b863bd5 JB |
1922 | } |
1923 | ||
1924 | Lisp_Object | |
1925 | merge (org_l1, org_l2, pred) | |
1926 | Lisp_Object org_l1, org_l2; | |
1927 | Lisp_Object pred; | |
1928 | { | |
1929 | Lisp_Object value; | |
1930 | register Lisp_Object tail; | |
1931 | Lisp_Object tem; | |
1932 | register Lisp_Object l1, l2; | |
1933 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; | |
1934 | ||
1935 | l1 = org_l1; | |
1936 | l2 = org_l2; | |
1937 | tail = Qnil; | |
1938 | value = Qnil; | |
1939 | ||
1940 | /* It is sufficient to protect org_l1 and org_l2. | |
1941 | When l1 and l2 are updated, we copy the new values | |
1942 | back into the org_ vars. */ | |
1943 | GCPRO4 (org_l1, org_l2, pred, value); | |
1944 | ||
1945 | while (1) | |
1946 | { | |
265a9e55 | 1947 | if (NILP (l1)) |
7b863bd5 JB |
1948 | { |
1949 | UNGCPRO; | |
265a9e55 | 1950 | if (NILP (tail)) |
7b863bd5 JB |
1951 | return l2; |
1952 | Fsetcdr (tail, l2); | |
1953 | return value; | |
1954 | } | |
265a9e55 | 1955 | if (NILP (l2)) |
7b863bd5 JB |
1956 | { |
1957 | UNGCPRO; | |
265a9e55 | 1958 | if (NILP (tail)) |
7b863bd5 JB |
1959 | return l1; |
1960 | Fsetcdr (tail, l1); | |
1961 | return value; | |
1962 | } | |
1963 | tem = call2 (pred, Fcar (l2), Fcar (l1)); | |
265a9e55 | 1964 | if (NILP (tem)) |
7b863bd5 JB |
1965 | { |
1966 | tem = l1; | |
1967 | l1 = Fcdr (l1); | |
1968 | org_l1 = l1; | |
1969 | } | |
1970 | else | |
1971 | { | |
1972 | tem = l2; | |
1973 | l2 = Fcdr (l2); | |
1974 | org_l2 = l2; | |
1975 | } | |
265a9e55 | 1976 | if (NILP (tail)) |
7b863bd5 JB |
1977 | value = tem; |
1978 | else | |
1979 | Fsetcdr (tail, tem); | |
1980 | tail = tem; | |
1981 | } | |
1982 | } | |
be9d483d | 1983 | |
2d6fabfc | 1984 | \f |
12ae7fc6 | 1985 | #if 0 /* Unsafe version. */ |
be9d483d | 1986 | DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0, |
e9d8ddc9 | 1987 | doc: /* Extract a value from a property list. |
47cebab1 GM |
1988 | PLIST is a property list, which is a list of the form |
1989 | \(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value | |
1990 | corresponding to the given PROP, or nil if PROP is not | |
e9d8ddc9 MB |
1991 | one of the properties on the list. */) |
1992 | (plist, prop) | |
1fbb64aa | 1993 | Lisp_Object plist; |
2d6fabfc | 1994 | Lisp_Object prop; |
7b863bd5 | 1995 | { |
2d6fabfc | 1996 | Lisp_Object tail; |
91f78c99 | 1997 | |
2d6fabfc GM |
1998 | for (tail = plist; |
1999 | CONSP (tail) && CONSP (XCDR (tail)); | |
2000 | tail = XCDR (XCDR (tail))) | |
7b863bd5 | 2001 | { |
2d6fabfc GM |
2002 | if (EQ (prop, XCAR (tail))) |
2003 | return XCAR (XCDR (tail)); | |
ec2423c9 GM |
2004 | |
2005 | /* This function can be called asynchronously | |
2006 | (setup_coding_system). Don't QUIT in that case. */ | |
2007 | if (!interrupt_input_blocked) | |
2008 | QUIT; | |
7b863bd5 | 2009 | } |
2d6fabfc GM |
2010 | |
2011 | if (!NILP (tail)) | |
2012 | wrong_type_argument (Qlistp, prop); | |
91f78c99 | 2013 | |
7b863bd5 JB |
2014 | return Qnil; |
2015 | } | |
12ae7fc6 KS |
2016 | #endif |
2017 | ||
2018 | /* This does not check for quits. That is safe since it must terminate. */ | |
7b863bd5 | 2019 | |
12ae7fc6 | 2020 | DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0, |
27f604dd KS |
2021 | doc: /* Extract a value from a property list. |
2022 | PLIST is a property list, which is a list of the form | |
2023 | \(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value | |
12ae7fc6 KS |
2024 | corresponding to the given PROP, or nil if PROP is not one of the |
2025 | properties on the list. This function never signals an error. */) | |
27f604dd KS |
2026 | (plist, prop) |
2027 | Lisp_Object plist; | |
2028 | Lisp_Object prop; | |
2029 | { | |
2030 | Lisp_Object tail, halftail; | |
2031 | ||
2032 | /* halftail is used to detect circular lists. */ | |
2033 | tail = halftail = plist; | |
2034 | while (CONSP (tail) && CONSP (XCDR (tail))) | |
2035 | { | |
2036 | if (EQ (prop, XCAR (tail))) | |
2037 | return XCAR (XCDR (tail)); | |
2038 | ||
2039 | tail = XCDR (XCDR (tail)); | |
2040 | halftail = XCDR (halftail); | |
2041 | if (EQ (tail, halftail)) | |
2042 | break; | |
2043 | } | |
2044 | ||
2045 | return Qnil; | |
2046 | } | |
2047 | ||
be9d483d | 2048 | DEFUN ("get", Fget, Sget, 2, 2, 0, |
e9d8ddc9 MB |
2049 | doc: /* Return the value of SYMBOL's PROPNAME property. |
2050 | This is the last value stored with `(put SYMBOL PROPNAME VALUE)'. */) | |
2051 | (symbol, propname) | |
c07289e0 | 2052 | Lisp_Object symbol, propname; |
be9d483d | 2053 | { |
b7826503 | 2054 | CHECK_SYMBOL (symbol); |
c07289e0 | 2055 | return Fplist_get (XSYMBOL (symbol)->plist, propname); |
be9d483d BG |
2056 | } |
2057 | ||
2058 | DEFUN ("plist-put", Fplist_put, Splist_put, 3, 3, 0, | |
e9d8ddc9 | 2059 | doc: /* Change value in PLIST of PROP to VAL. |
47cebab1 GM |
2060 | PLIST is a property list, which is a list of the form |
2061 | \(PROP1 VALUE1 PROP2 VALUE2 ...). PROP is a symbol and VAL is any object. | |
2062 | If PROP is already a property on the list, its value is set to VAL, | |
2063 | otherwise the new PROP VAL pair is added. The new plist is returned; | |
2064 | use `(setq x (plist-put x prop val))' to be sure to use the new value. | |
e9d8ddc9 MB |
2065 | The PLIST is modified by side effects. */) |
2066 | (plist, prop, val) | |
b4f334f7 KH |
2067 | Lisp_Object plist; |
2068 | register Lisp_Object prop; | |
2069 | Lisp_Object val; | |
7b863bd5 JB |
2070 | { |
2071 | register Lisp_Object tail, prev; | |
2072 | Lisp_Object newcell; | |
2073 | prev = Qnil; | |
70949dac KR |
2074 | for (tail = plist; CONSP (tail) && CONSP (XCDR (tail)); |
2075 | tail = XCDR (XCDR (tail))) | |
7b863bd5 | 2076 | { |
70949dac | 2077 | if (EQ (prop, XCAR (tail))) |
be9d483d | 2078 | { |
70949dac | 2079 | Fsetcar (XCDR (tail), val); |
be9d483d BG |
2080 | return plist; |
2081 | } | |
91f78c99 | 2082 | |
7b863bd5 | 2083 | prev = tail; |
2d6fabfc | 2084 | QUIT; |
7b863bd5 JB |
2085 | } |
2086 | newcell = Fcons (prop, Fcons (val, Qnil)); | |
265a9e55 | 2087 | if (NILP (prev)) |
be9d483d | 2088 | return newcell; |
7b863bd5 | 2089 | else |
70949dac | 2090 | Fsetcdr (XCDR (prev), newcell); |
be9d483d BG |
2091 | return plist; |
2092 | } | |
2093 | ||
2094 | DEFUN ("put", Fput, Sput, 3, 3, 0, | |
e9d8ddc9 MB |
2095 | doc: /* Store SYMBOL's PROPNAME property with value VALUE. |
2096 | It can be retrieved with `(get SYMBOL PROPNAME)'. */) | |
2097 | (symbol, propname, value) | |
c07289e0 | 2098 | Lisp_Object symbol, propname, value; |
be9d483d | 2099 | { |
b7826503 | 2100 | CHECK_SYMBOL (symbol); |
c07289e0 RS |
2101 | XSYMBOL (symbol)->plist |
2102 | = Fplist_put (XSYMBOL (symbol)->plist, propname, value); | |
2103 | return value; | |
7b863bd5 | 2104 | } |
aebf4d42 RS |
2105 | \f |
2106 | DEFUN ("lax-plist-get", Flax_plist_get, Slax_plist_get, 2, 2, 0, | |
2107 | doc: /* Extract a value from a property list, comparing with `equal'. | |
2108 | PLIST is a property list, which is a list of the form | |
2109 | \(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value | |
2110 | corresponding to the given PROP, or nil if PROP is not | |
2111 | one of the properties on the list. */) | |
2112 | (plist, prop) | |
2113 | Lisp_Object plist; | |
2114 | Lisp_Object prop; | |
2115 | { | |
2116 | Lisp_Object tail; | |
91f78c99 | 2117 | |
aebf4d42 RS |
2118 | for (tail = plist; |
2119 | CONSP (tail) && CONSP (XCDR (tail)); | |
2120 | tail = XCDR (XCDR (tail))) | |
2121 | { | |
2122 | if (! NILP (Fequal (prop, XCAR (tail)))) | |
2123 | return XCAR (XCDR (tail)); | |
2124 | ||
2125 | QUIT; | |
2126 | } | |
2127 | ||
2128 | if (!NILP (tail)) | |
2129 | wrong_type_argument (Qlistp, prop); | |
91f78c99 | 2130 | |
aebf4d42 RS |
2131 | return Qnil; |
2132 | } | |
7b863bd5 | 2133 | |
aebf4d42 RS |
2134 | DEFUN ("lax-plist-put", Flax_plist_put, Slax_plist_put, 3, 3, 0, |
2135 | doc: /* Change value in PLIST of PROP to VAL, comparing with `equal'. | |
2136 | PLIST is a property list, which is a list of the form | |
9e76ae05 | 2137 | \(PROP1 VALUE1 PROP2 VALUE2 ...). PROP and VAL are any objects. |
aebf4d42 RS |
2138 | If PROP is already a property on the list, its value is set to VAL, |
2139 | otherwise the new PROP VAL pair is added. The new plist is returned; | |
2140 | use `(setq x (lax-plist-put x prop val))' to be sure to use the new value. | |
2141 | The PLIST is modified by side effects. */) | |
2142 | (plist, prop, val) | |
2143 | Lisp_Object plist; | |
2144 | register Lisp_Object prop; | |
2145 | Lisp_Object val; | |
2146 | { | |
2147 | register Lisp_Object tail, prev; | |
2148 | Lisp_Object newcell; | |
2149 | prev = Qnil; | |
2150 | for (tail = plist; CONSP (tail) && CONSP (XCDR (tail)); | |
2151 | tail = XCDR (XCDR (tail))) | |
2152 | { | |
2153 | if (! NILP (Fequal (prop, XCAR (tail)))) | |
2154 | { | |
2155 | Fsetcar (XCDR (tail), val); | |
2156 | return plist; | |
2157 | } | |
91f78c99 | 2158 | |
aebf4d42 RS |
2159 | prev = tail; |
2160 | QUIT; | |
2161 | } | |
2162 | newcell = Fcons (prop, Fcons (val, Qnil)); | |
2163 | if (NILP (prev)) | |
2164 | return newcell; | |
2165 | else | |
2166 | Fsetcdr (XCDR (prev), newcell); | |
2167 | return plist; | |
2168 | } | |
2169 | \f | |
95f8c3b9 JPW |
2170 | DEFUN ("eql", Feql, Seql, 2, 2, 0, |
2171 | doc: /* Return t if the two args are the same Lisp object. | |
2172 | Floating-point numbers of equal value are `eql', but they may not be `eq'. */) | |
474d0535 | 2173 | (obj1, obj2) |
95f8c3b9 JPW |
2174 | Lisp_Object obj1, obj2; |
2175 | { | |
2176 | if (FLOATP (obj1)) | |
2177 | return internal_equal (obj1, obj2, 0, 0) ? Qt : Qnil; | |
2178 | else | |
2179 | return EQ (obj1, obj2) ? Qt : Qnil; | |
2180 | } | |
2181 | ||
7b863bd5 | 2182 | DEFUN ("equal", Fequal, Sequal, 2, 2, 0, |
e9d8ddc9 | 2183 | doc: /* Return t if two Lisp objects have similar structure and contents. |
47cebab1 GM |
2184 | They must have the same data type. |
2185 | Conses are compared by comparing the cars and the cdrs. | |
2186 | Vectors and strings are compared element by element. | |
2187 | Numbers are compared by value, but integers cannot equal floats. | |
2188 | (Use `=' if you want integers and floats to be able to be equal.) | |
e9d8ddc9 MB |
2189 | Symbols must match exactly. */) |
2190 | (o1, o2) | |
7b863bd5 JB |
2191 | register Lisp_Object o1, o2; |
2192 | { | |
6054c582 | 2193 | return internal_equal (o1, o2, 0, 0) ? Qt : Qnil; |
e0f5cf5a RS |
2194 | } |
2195 | ||
6054c582 RS |
2196 | DEFUN ("equal-including-properties", Fequal_including_properties, Sequal_including_properties, 2, 2, 0, |
2197 | doc: /* Return t if two Lisp objects have similar structure and contents. | |
2198 | This is like `equal' except that it compares the text properties | |
2199 | of strings. (`equal' ignores text properties.) */) | |
2200 | (o1, o2) | |
2201 | register Lisp_Object o1, o2; | |
2202 | { | |
2203 | return internal_equal (o1, o2, 0, 1) ? Qt : Qnil; | |
2204 | } | |
2205 | ||
2206 | /* DEPTH is current depth of recursion. Signal an error if it | |
2207 | gets too deep. | |
2208 | PROPS, if non-nil, means compare string text properties too. */ | |
2209 | ||
6cb9cafb | 2210 | static int |
6054c582 | 2211 | internal_equal (o1, o2, depth, props) |
e0f5cf5a | 2212 | register Lisp_Object o1, o2; |
6054c582 | 2213 | int depth, props; |
e0f5cf5a RS |
2214 | { |
2215 | if (depth > 200) | |
2216 | error ("Stack overflow in equal"); | |
4ff1aed9 | 2217 | |
6cb9cafb | 2218 | tail_recurse: |
7b863bd5 | 2219 | QUIT; |
4ff1aed9 RS |
2220 | if (EQ (o1, o2)) |
2221 | return 1; | |
2222 | if (XTYPE (o1) != XTYPE (o2)) | |
2223 | return 0; | |
2224 | ||
2225 | switch (XTYPE (o1)) | |
2226 | { | |
4ff1aed9 | 2227 | case Lisp_Float: |
74a47d1f EZ |
2228 | { |
2229 | double d1, d2; | |
2230 | ||
2231 | d1 = extract_float (o1); | |
2232 | d2 = extract_float (o2); | |
2233 | /* If d is a NaN, then d != d. Two NaNs should be `equal' even | |
2234 | though they are not =. */ | |
2235 | return d1 == d2 || (d1 != d1 && d2 != d2); | |
2236 | } | |
4ff1aed9 RS |
2237 | |
2238 | case Lisp_Cons: | |
6054c582 | 2239 | if (!internal_equal (XCAR (o1), XCAR (o2), depth + 1, props)) |
4cab5074 | 2240 | return 0; |
70949dac KR |
2241 | o1 = XCDR (o1); |
2242 | o2 = XCDR (o2); | |
4cab5074 | 2243 | goto tail_recurse; |
4ff1aed9 RS |
2244 | |
2245 | case Lisp_Misc: | |
81d1fba6 | 2246 | if (XMISCTYPE (o1) != XMISCTYPE (o2)) |
6cb9cafb | 2247 | return 0; |
4ff1aed9 | 2248 | if (OVERLAYP (o1)) |
7b863bd5 | 2249 | { |
e23f814f | 2250 | if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o2), |
6054c582 | 2251 | depth + 1, props) |
e23f814f | 2252 | || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o2), |
43f15d4a | 2253 | depth + 1, props)) |
6cb9cafb | 2254 | return 0; |
4ff1aed9 RS |
2255 | o1 = XOVERLAY (o1)->plist; |
2256 | o2 = XOVERLAY (o2)->plist; | |
2257 | goto tail_recurse; | |
7b863bd5 | 2258 | } |
4ff1aed9 RS |
2259 | if (MARKERP (o1)) |
2260 | { | |
2261 | return (XMARKER (o1)->buffer == XMARKER (o2)->buffer | |
2262 | && (XMARKER (o1)->buffer == 0 | |
6ced1284 | 2263 | || XMARKER (o1)->bytepos == XMARKER (o2)->bytepos)); |
4ff1aed9 RS |
2264 | } |
2265 | break; | |
2266 | ||
2267 | case Lisp_Vectorlike: | |
4cab5074 | 2268 | { |
00498bfc AS |
2269 | register int i; |
2270 | EMACS_INT size = XVECTOR (o1)->size; | |
4cab5074 KH |
2271 | /* Pseudovectors have the type encoded in the size field, so this test |
2272 | actually checks that the objects have the same type as well as the | |
2273 | same size. */ | |
2274 | if (XVECTOR (o2)->size != size) | |
2275 | return 0; | |
e03f7933 RS |
2276 | /* Boolvectors are compared much like strings. */ |
2277 | if (BOOL_VECTOR_P (o1)) | |
2278 | { | |
e03f7933 | 2279 | int size_in_chars |
db85986c AS |
2280 | = ((XBOOL_VECTOR (o1)->size + BOOL_VECTOR_BITS_PER_CHAR - 1) |
2281 | / BOOL_VECTOR_BITS_PER_CHAR); | |
e03f7933 RS |
2282 | |
2283 | if (XBOOL_VECTOR (o1)->size != XBOOL_VECTOR (o2)->size) | |
2284 | return 0; | |
2285 | if (bcmp (XBOOL_VECTOR (o1)->data, XBOOL_VECTOR (o2)->data, | |
2286 | size_in_chars)) | |
2287 | return 0; | |
2288 | return 1; | |
2289 | } | |
ed73fcc1 | 2290 | if (WINDOW_CONFIGURATIONP (o1)) |
48646924 | 2291 | return compare_window_configurations (o1, o2, 0); |
e03f7933 RS |
2292 | |
2293 | /* Aside from them, only true vectors, char-tables, and compiled | |
2294 | functions are sensible to compare, so eliminate the others now. */ | |
4cab5074 KH |
2295 | if (size & PSEUDOVECTOR_FLAG) |
2296 | { | |
e03f7933 | 2297 | if (!(size & (PVEC_COMPILED | PVEC_CHAR_TABLE))) |
4cab5074 KH |
2298 | return 0; |
2299 | size &= PSEUDOVECTOR_SIZE_MASK; | |
2300 | } | |
2301 | for (i = 0; i < size; i++) | |
2302 | { | |
2303 | Lisp_Object v1, v2; | |
2304 | v1 = XVECTOR (o1)->contents [i]; | |
2305 | v2 = XVECTOR (o2)->contents [i]; | |
6054c582 | 2306 | if (!internal_equal (v1, v2, depth + 1, props)) |
4cab5074 KH |
2307 | return 0; |
2308 | } | |
2309 | return 1; | |
2310 | } | |
4ff1aed9 RS |
2311 | break; |
2312 | ||
2313 | case Lisp_String: | |
d5db4077 | 2314 | if (SCHARS (o1) != SCHARS (o2)) |
4cab5074 | 2315 | return 0; |
d5db4077 | 2316 | if (SBYTES (o1) != SBYTES (o2)) |
ea35ce3d | 2317 | return 0; |
d5db4077 KR |
2318 | if (bcmp (SDATA (o1), SDATA (o2), |
2319 | SBYTES (o1))) | |
4cab5074 | 2320 | return 0; |
6054c582 RS |
2321 | if (props && !compare_string_intervals (o1, o2)) |
2322 | return 0; | |
4cab5074 | 2323 | return 1; |
093386ca GM |
2324 | |
2325 | case Lisp_Int: | |
2326 | case Lisp_Symbol: | |
2327 | case Lisp_Type_Limit: | |
2328 | break; | |
7b863bd5 | 2329 | } |
91f78c99 | 2330 | |
6cb9cafb | 2331 | return 0; |
7b863bd5 JB |
2332 | } |
2333 | \f | |
2e34157c RS |
2334 | extern Lisp_Object Fmake_char_internal (); |
2335 | ||
7b863bd5 | 2336 | DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0, |
e9d8ddc9 MB |
2337 | doc: /* Store each element of ARRAY with ITEM. |
2338 | ARRAY is a vector, string, char-table, or bool-vector. */) | |
2339 | (array, item) | |
7b863bd5 JB |
2340 | Lisp_Object array, item; |
2341 | { | |
2342 | register int size, index, charval; | |
2343 | retry: | |
7650760e | 2344 | if (VECTORP (array)) |
7b863bd5 JB |
2345 | { |
2346 | register Lisp_Object *p = XVECTOR (array)->contents; | |
2347 | size = XVECTOR (array)->size; | |
2348 | for (index = 0; index < size; index++) | |
2349 | p[index] = item; | |
2350 | } | |
e03f7933 RS |
2351 | else if (CHAR_TABLE_P (array)) |
2352 | { | |
2353 | register Lisp_Object *p = XCHAR_TABLE (array)->contents; | |
2354 | size = CHAR_TABLE_ORDINARY_SLOTS; | |
2355 | for (index = 0; index < size; index++) | |
2356 | p[index] = item; | |
2357 | XCHAR_TABLE (array)->defalt = Qnil; | |
2358 | } | |
7650760e | 2359 | else if (STRINGP (array)) |
7b863bd5 | 2360 | { |
d5db4077 | 2361 | register unsigned char *p = SDATA (array); |
b7826503 | 2362 | CHECK_NUMBER (item); |
7b863bd5 | 2363 | charval = XINT (item); |
d5db4077 | 2364 | size = SCHARS (array); |
57247650 KH |
2365 | if (STRING_MULTIBYTE (array)) |
2366 | { | |
64a5094a KH |
2367 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
2368 | int len = CHAR_STRING (charval, str); | |
d5db4077 | 2369 | int size_byte = SBYTES (array); |
57247650 | 2370 | unsigned char *p1 = p, *endp = p + size_byte; |
95b8aba7 | 2371 | int i; |
57247650 | 2372 | |
95b8aba7 KH |
2373 | if (size != size_byte) |
2374 | while (p1 < endp) | |
2375 | { | |
2376 | int this_len = MULTIBYTE_FORM_LENGTH (p1, endp - p1); | |
2377 | if (len != this_len) | |
2378 | error ("Attempt to change byte length of a string"); | |
2379 | p1 += this_len; | |
2380 | } | |
57247650 KH |
2381 | for (i = 0; i < size_byte; i++) |
2382 | *p++ = str[i % len]; | |
2383 | } | |
2384 | else | |
2385 | for (index = 0; index < size; index++) | |
2386 | p[index] = charval; | |
7b863bd5 | 2387 | } |
e03f7933 RS |
2388 | else if (BOOL_VECTOR_P (array)) |
2389 | { | |
2390 | register unsigned char *p = XBOOL_VECTOR (array)->data; | |
e03f7933 | 2391 | int size_in_chars |
db85986c AS |
2392 | = ((XBOOL_VECTOR (array)->size + BOOL_VECTOR_BITS_PER_CHAR - 1) |
2393 | / BOOL_VECTOR_BITS_PER_CHAR); | |
e03f7933 RS |
2394 | |
2395 | charval = (! NILP (item) ? -1 : 0); | |
00498bfc | 2396 | for (index = 0; index < size_in_chars - 1; index++) |
e03f7933 | 2397 | p[index] = charval; |
00498bfc AS |
2398 | if (index < size_in_chars) |
2399 | { | |
2400 | /* Mask out bits beyond the vector size. */ | |
db85986c AS |
2401 | if (XBOOL_VECTOR (array)->size % BOOL_VECTOR_BITS_PER_CHAR) |
2402 | charval &= (1 << (XBOOL_VECTOR (array)->size % BOOL_VECTOR_BITS_PER_CHAR)) - 1; | |
00498bfc AS |
2403 | p[index] = charval; |
2404 | } | |
e03f7933 | 2405 | } |
7b863bd5 JB |
2406 | else |
2407 | { | |
2408 | array = wrong_type_argument (Qarrayp, array); | |
2409 | goto retry; | |
2410 | } | |
2411 | return array; | |
2412 | } | |
85cad579 RS |
2413 | |
2414 | DEFUN ("clear-string", Fclear_string, Sclear_string, | |
2415 | 1, 1, 0, | |
2416 | doc: /* Clear the contents of STRING. | |
2417 | This makes STRING unibyte and may change its length. */) | |
2418 | (string) | |
2419 | Lisp_Object string; | |
2420 | { | |
cfd23693 | 2421 | int len; |
a085bf9d | 2422 | CHECK_STRING (string); |
cfd23693 | 2423 | len = SBYTES (string); |
85cad579 RS |
2424 | bzero (SDATA (string), len); |
2425 | STRING_SET_CHARS (string, len); | |
2426 | STRING_SET_UNIBYTE (string); | |
2427 | return Qnil; | |
2428 | } | |
ea35ce3d | 2429 | \f |
999de246 RS |
2430 | DEFUN ("char-table-subtype", Fchar_table_subtype, Schar_table_subtype, |
2431 | 1, 1, 0, | |
e9d8ddc9 MB |
2432 | doc: /* Return the subtype of char-table CHAR-TABLE. The value is a symbol. */) |
2433 | (char_table) | |
88fe8140 | 2434 | Lisp_Object char_table; |
999de246 | 2435 | { |
b7826503 | 2436 | CHECK_CHAR_TABLE (char_table); |
999de246 | 2437 | |
88fe8140 | 2438 | return XCHAR_TABLE (char_table)->purpose; |
999de246 RS |
2439 | } |
2440 | ||
e03f7933 RS |
2441 | DEFUN ("char-table-parent", Fchar_table_parent, Schar_table_parent, |
2442 | 1, 1, 0, | |
e9d8ddc9 | 2443 | doc: /* Return the parent char-table of CHAR-TABLE. |
47cebab1 GM |
2444 | The value is either nil or another char-table. |
2445 | If CHAR-TABLE holds nil for a given character, | |
2446 | then the actual applicable value is inherited from the parent char-table | |
e9d8ddc9 MB |
2447 | \(or from its parents, if necessary). */) |
2448 | (char_table) | |
88fe8140 | 2449 | Lisp_Object char_table; |
e03f7933 | 2450 | { |
b7826503 | 2451 | CHECK_CHAR_TABLE (char_table); |
e03f7933 | 2452 | |
88fe8140 | 2453 | return XCHAR_TABLE (char_table)->parent; |
e03f7933 RS |
2454 | } |
2455 | ||
2456 | DEFUN ("set-char-table-parent", Fset_char_table_parent, Sset_char_table_parent, | |
2457 | 2, 2, 0, | |
e9d8ddc9 | 2458 | doc: /* Set the parent char-table of CHAR-TABLE to PARENT. |
c541e2a0 | 2459 | Return PARENT. PARENT must be either nil or another char-table. */) |
e9d8ddc9 | 2460 | (char_table, parent) |
88fe8140 | 2461 | Lisp_Object char_table, parent; |
e03f7933 RS |
2462 | { |
2463 | Lisp_Object temp; | |
2464 | ||
b7826503 | 2465 | CHECK_CHAR_TABLE (char_table); |
e03f7933 | 2466 | |
c8640abf RS |
2467 | if (!NILP (parent)) |
2468 | { | |
b7826503 | 2469 | CHECK_CHAR_TABLE (parent); |
c8640abf RS |
2470 | |
2471 | for (temp = parent; !NILP (temp); temp = XCHAR_TABLE (temp)->parent) | |
55cc974d | 2472 | if (EQ (temp, char_table)) |
c8640abf RS |
2473 | error ("Attempt to make a chartable be its own parent"); |
2474 | } | |
e03f7933 | 2475 | |
88fe8140 | 2476 | XCHAR_TABLE (char_table)->parent = parent; |
e03f7933 RS |
2477 | |
2478 | return parent; | |
2479 | } | |
2480 | ||
2481 | DEFUN ("char-table-extra-slot", Fchar_table_extra_slot, Schar_table_extra_slot, | |
2482 | 2, 2, 0, | |
e9d8ddc9 MB |
2483 | doc: /* Return the value of CHAR-TABLE's extra-slot number N. */) |
2484 | (char_table, n) | |
88fe8140 | 2485 | Lisp_Object char_table, n; |
e03f7933 | 2486 | { |
b7826503 PJ |
2487 | CHECK_CHAR_TABLE (char_table); |
2488 | CHECK_NUMBER (n); | |
e03f7933 | 2489 | if (XINT (n) < 0 |
88fe8140 EN |
2490 | || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table))) |
2491 | args_out_of_range (char_table, n); | |
e03f7933 | 2492 | |
88fe8140 | 2493 | return XCHAR_TABLE (char_table)->extras[XINT (n)]; |
e03f7933 RS |
2494 | } |
2495 | ||
2496 | DEFUN ("set-char-table-extra-slot", Fset_char_table_extra_slot, | |
2497 | Sset_char_table_extra_slot, | |
2498 | 3, 3, 0, | |
e9d8ddc9 MB |
2499 | doc: /* Set CHAR-TABLE's extra-slot number N to VALUE. */) |
2500 | (char_table, n, value) | |
88fe8140 | 2501 | Lisp_Object char_table, n, value; |
e03f7933 | 2502 | { |
b7826503 PJ |
2503 | CHECK_CHAR_TABLE (char_table); |
2504 | CHECK_NUMBER (n); | |
e03f7933 | 2505 | if (XINT (n) < 0 |
88fe8140 EN |
2506 | || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table))) |
2507 | args_out_of_range (char_table, n); | |
e03f7933 | 2508 | |
88fe8140 | 2509 | return XCHAR_TABLE (char_table)->extras[XINT (n)] = value; |
e03f7933 | 2510 | } |
ea35ce3d | 2511 | \f |
38f60cd9 KH |
2512 | static Lisp_Object |
2513 | char_table_range (table, from, to, defalt) | |
2514 | Lisp_Object table; | |
2515 | int from, to; | |
2516 | Lisp_Object defalt; | |
2517 | { | |
2518 | Lisp_Object val; | |
2519 | ||
2520 | if (! NILP (XCHAR_TABLE (table)->defalt)) | |
2521 | defalt = XCHAR_TABLE (table)->defalt; | |
2522 | val = XCHAR_TABLE (table)->contents[from]; | |
2523 | if (SUB_CHAR_TABLE_P (val)) | |
2524 | val = char_table_range (val, 32, 127, defalt); | |
2525 | else if (NILP (val)) | |
2526 | val = defalt; | |
2527 | for (from++; from <= to; from++) | |
2528 | { | |
2529 | Lisp_Object this_val; | |
2530 | ||
2531 | this_val = XCHAR_TABLE (table)->contents[from]; | |
2532 | if (SUB_CHAR_TABLE_P (this_val)) | |
2533 | this_val = char_table_range (this_val, 32, 127, defalt); | |
2534 | else if (NILP (this_val)) | |
2535 | this_val = defalt; | |
2536 | if (! EQ (val, this_val)) | |
2537 | error ("Characters in the range have inconsistent values"); | |
2538 | } | |
2539 | return val; | |
e475c66a | 2540 | } |
38f60cd9 KH |
2541 | |
2542 | ||
999de246 RS |
2543 | DEFUN ("char-table-range", Fchar_table_range, Schar_table_range, |
2544 | 2, 2, 0, | |
e9d8ddc9 | 2545 | doc: /* Return the value in CHAR-TABLE for a range of characters RANGE. |
e475c66a | 2546 | RANGE should be nil (for the default value), |
47cebab1 | 2547 | a vector which identifies a character set or a row of a character set, |
38f60cd9 KH |
2548 | a character set name, or a character code. |
2549 | If the characters in the specified range have different values, | |
d17f5d0a | 2550 | an error is signaled. |
38f60cd9 | 2551 | |
e475c66a | 2552 | Note that this function doesn't check the parent of CHAR-TABLE. */) |
e9d8ddc9 | 2553 | (char_table, range) |
88fe8140 | 2554 | Lisp_Object char_table, range; |
999de246 | 2555 | { |
38f60cd9 | 2556 | int charset_id, c1 = 0, c2 = 0; |
d9cdfe9a | 2557 | int size; |
38f60cd9 KH |
2558 | Lisp_Object ch, val, current_default; |
2559 | ||
b7826503 | 2560 | CHECK_CHAR_TABLE (char_table); |
b4f334f7 | 2561 | |
999de246 | 2562 | if (EQ (range, Qnil)) |
88fe8140 | 2563 | return XCHAR_TABLE (char_table)->defalt; |
38f60cd9 KH |
2564 | if (INTEGERP (range)) |
2565 | { | |
2566 | int c = XINT (range); | |
2567 | if (! CHAR_VALID_P (c, 0)) | |
2568 | error ("Invalid character code: %d", c); | |
2569 | ch = range; | |
2570 | SPLIT_CHAR (c, charset_id, c1, c2); | |
2571 | } | |
6d475204 RS |
2572 | else if (SYMBOLP (range)) |
2573 | { | |
2574 | Lisp_Object charset_info; | |
2575 | ||
2576 | charset_info = Fget (range, Qcharset); | |
b7826503 | 2577 | CHECK_VECTOR (charset_info); |
38f60cd9 KH |
2578 | charset_id = XINT (XVECTOR (charset_info)->contents[0]); |
2579 | ch = Fmake_char_internal (make_number (charset_id), | |
2580 | make_number (0), make_number (0)); | |
6d475204 | 2581 | } |
999de246 RS |
2582 | else if (VECTORP (range)) |
2583 | { | |
38f60cd9 KH |
2584 | size = ASIZE (range); |
2585 | if (size == 0) | |
7ec64183 | 2586 | args_out_of_range (range, make_number (0)); |
38f60cd9 KH |
2587 | CHECK_NUMBER (AREF (range, 0)); |
2588 | charset_id = XINT (AREF (range, 0)); | |
2589 | if (size > 1) | |
e814a159 | 2590 | { |
38f60cd9 KH |
2591 | CHECK_NUMBER (AREF (range, 1)); |
2592 | c1 = XINT (AREF (range, 1)); | |
2593 | if (size > 2) | |
2594 | { | |
2595 | CHECK_NUMBER (AREF (range, 2)); | |
2596 | c2 = XINT (AREF (range, 2)); | |
2597 | } | |
e814a159 | 2598 | } |
38f60cd9 KH |
2599 | |
2600 | /* This checks if charset_id, c0, and c1 are all valid or not. */ | |
2601 | ch = Fmake_char_internal (make_number (charset_id), | |
2602 | make_number (c1), make_number (c2)); | |
999de246 RS |
2603 | } |
2604 | else | |
2605 | error ("Invalid RANGE argument to `char-table-range'"); | |
38f60cd9 KH |
2606 | |
2607 | if (c1 > 0 && (CHARSET_DIMENSION (charset_id) == 1 || c2 > 0)) | |
2608 | { | |
2609 | /* Fully specified character. */ | |
2610 | Lisp_Object parent = XCHAR_TABLE (char_table)->parent; | |
2611 | ||
2612 | XCHAR_TABLE (char_table)->parent = Qnil; | |
2613 | val = Faref (char_table, ch); | |
2614 | XCHAR_TABLE (char_table)->parent = parent; | |
2615 | return val; | |
2616 | } | |
2617 | ||
2618 | current_default = XCHAR_TABLE (char_table)->defalt; | |
2619 | if (charset_id == CHARSET_ASCII | |
2620 | || charset_id == CHARSET_8_BIT_CONTROL | |
2621 | || charset_id == CHARSET_8_BIT_GRAPHIC) | |
2622 | { | |
2623 | int from, to, defalt; | |
2624 | ||
2625 | if (charset_id == CHARSET_ASCII) | |
2626 | from = 0, to = 127, defalt = CHAR_TABLE_DEFAULT_SLOT_ASCII; | |
2627 | else if (charset_id == CHARSET_8_BIT_CONTROL) | |
2628 | from = 128, to = 159, defalt = CHAR_TABLE_DEFAULT_SLOT_8_BIT_CONTROL; | |
2629 | else | |
2630 | from = 160, to = 255, defalt = CHAR_TABLE_DEFAULT_SLOT_8_BIT_GRAPHIC; | |
2631 | if (! NILP (XCHAR_TABLE (char_table)->contents[defalt])) | |
2632 | current_default = XCHAR_TABLE (char_table)->contents[defalt]; | |
2633 | return char_table_range (char_table, from, to, current_default); | |
2634 | } | |
e475c66a | 2635 | |
38f60cd9 KH |
2636 | val = XCHAR_TABLE (char_table)->contents[128 + charset_id]; |
2637 | if (! SUB_CHAR_TABLE_P (val)) | |
2638 | return (NILP (val) ? current_default : val); | |
2639 | if (! NILP (XCHAR_TABLE (val)->defalt)) | |
2640 | current_default = XCHAR_TABLE (val)->defalt; | |
2641 | if (c1 == 0) | |
2642 | return char_table_range (val, 32, 127, current_default); | |
2643 | val = XCHAR_TABLE (val)->contents[c1]; | |
2644 | if (! SUB_CHAR_TABLE_P (val)) | |
2645 | return (NILP (val) ? current_default : val); | |
2646 | if (! NILP (XCHAR_TABLE (val)->defalt)) | |
2647 | current_default = XCHAR_TABLE (val)->defalt; | |
2648 | return char_table_range (val, 32, 127, current_default); | |
999de246 RS |
2649 | } |
2650 | ||
e03f7933 RS |
2651 | DEFUN ("set-char-table-range", Fset_char_table_range, Sset_char_table_range, |
2652 | 3, 3, 0, | |
e9d8ddc9 | 2653 | doc: /* Set the value in CHAR-TABLE for a range of characters RANGE to VALUE. |
ac1106fc LT |
2654 | RANGE should be t (for all characters), nil (for the default value), |
2655 | a character set, a vector which identifies a character set, a row of a | |
2656 | character set, or a character code. Return VALUE. */) | |
e9d8ddc9 | 2657 | (char_table, range, value) |
88fe8140 | 2658 | Lisp_Object char_table, range, value; |
e03f7933 RS |
2659 | { |
2660 | int i; | |
2661 | ||
b7826503 | 2662 | CHECK_CHAR_TABLE (char_table); |
b4f334f7 | 2663 | |
e03f7933 RS |
2664 | if (EQ (range, Qt)) |
2665 | for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++) | |
2b048bf5 KH |
2666 | { |
2667 | /* Don't set these special slots used for default values of | |
2668 | ascii, eight-bit-control, and eight-bit-graphic. */ | |
2669 | if (i != CHAR_TABLE_DEFAULT_SLOT_ASCII | |
2670 | && i != CHAR_TABLE_DEFAULT_SLOT_8_BIT_CONTROL | |
2671 | && i != CHAR_TABLE_DEFAULT_SLOT_8_BIT_GRAPHIC) | |
2672 | XCHAR_TABLE (char_table)->contents[i] = value; | |
2673 | } | |
e03f7933 | 2674 | else if (EQ (range, Qnil)) |
88fe8140 | 2675 | XCHAR_TABLE (char_table)->defalt = value; |
6d475204 RS |
2676 | else if (SYMBOLP (range)) |
2677 | { | |
2678 | Lisp_Object charset_info; | |
13c5d120 | 2679 | int charset_id; |
6d475204 RS |
2680 | |
2681 | charset_info = Fget (range, Qcharset); | |
13c5d120 KH |
2682 | if (! VECTORP (charset_info) |
2683 | || ! NATNUMP (AREF (charset_info, 0)) | |
2684 | || (charset_id = XINT (AREF (charset_info, 0)), | |
2685 | ! CHARSET_DEFINED_P (charset_id))) | |
ebaff4af | 2686 | error ("Invalid charset: %s", SDATA (SYMBOL_NAME (range))); |
13c5d120 KH |
2687 | |
2688 | if (charset_id == CHARSET_ASCII) | |
2689 | for (i = 0; i < 128; i++) | |
2690 | XCHAR_TABLE (char_table)->contents[i] = value; | |
2691 | else if (charset_id == CHARSET_8_BIT_CONTROL) | |
2692 | for (i = 128; i < 160; i++) | |
2693 | XCHAR_TABLE (char_table)->contents[i] = value; | |
2694 | else if (charset_id == CHARSET_8_BIT_GRAPHIC) | |
2695 | for (i = 160; i < 256; i++) | |
2696 | XCHAR_TABLE (char_table)->contents[i] = value; | |
2697 | else | |
2698 | XCHAR_TABLE (char_table)->contents[charset_id + 128] = value; | |
6d475204 | 2699 | } |
e03f7933 | 2700 | else if (INTEGERP (range)) |
88fe8140 | 2701 | Faset (char_table, range, value); |
e03f7933 RS |
2702 | else if (VECTORP (range)) |
2703 | { | |
2b048bf5 KH |
2704 | int size = XVECTOR (range)->size; |
2705 | Lisp_Object *val = XVECTOR (range)->contents; | |
2706 | Lisp_Object ch = Fmake_char_internal (size <= 0 ? Qnil : val[0], | |
2707 | size <= 1 ? Qnil : val[1], | |
2708 | size <= 2 ? Qnil : val[2]); | |
2709 | Faset (char_table, ch, value); | |
e03f7933 RS |
2710 | } |
2711 | else | |
2712 | error ("Invalid RANGE argument to `set-char-table-range'"); | |
2713 | ||
2714 | return value; | |
2715 | } | |
e1335ba2 KH |
2716 | |
2717 | DEFUN ("set-char-table-default", Fset_char_table_default, | |
2718 | Sset_char_table_default, 3, 3, 0, | |
30b1b0cf | 2719 | doc: /* Set the default value in CHAR-TABLE for generic character CH to VALUE. |
47cebab1 | 2720 | The generic character specifies the group of characters. |
2b048bf5 KH |
2721 | If CH is a normal character, set the default value for a group of |
2722 | characters to which CH belongs. | |
30b1b0cf | 2723 | See also the documentation of `make-char'. */) |
e9d8ddc9 | 2724 | (char_table, ch, value) |
e1335ba2 KH |
2725 | Lisp_Object char_table, ch, value; |
2726 | { | |
ada0fa14 | 2727 | int c, charset, code1, code2; |
e1335ba2 KH |
2728 | Lisp_Object temp; |
2729 | ||
b7826503 PJ |
2730 | CHECK_CHAR_TABLE (char_table); |
2731 | CHECK_NUMBER (ch); | |
e1335ba2 KH |
2732 | |
2733 | c = XINT (ch); | |
2db66414 | 2734 | SPLIT_CHAR (c, charset, code1, code2); |
0da528a9 KH |
2735 | |
2736 | /* Since we may want to set the default value for a character set | |
2737 | not yet defined, we check only if the character set is in the | |
2738 | valid range or not, instead of it is already defined or not. */ | |
2739 | if (! CHARSET_VALID_P (charset)) | |
f71599f4 | 2740 | invalid_character (c); |
e1335ba2 | 2741 | |
2b048bf5 KH |
2742 | if (SINGLE_BYTE_CHAR_P (c)) |
2743 | { | |
2744 | /* We use special slots for the default values of single byte | |
2745 | characters. */ | |
2746 | int default_slot | |
2747 | = (c < 0x80 ? CHAR_TABLE_DEFAULT_SLOT_ASCII | |
2748 | : c < 0xA0 ? CHAR_TABLE_DEFAULT_SLOT_8_BIT_CONTROL | |
2749 | : CHAR_TABLE_DEFAULT_SLOT_8_BIT_GRAPHIC); | |
2750 | ||
2751 | return (XCHAR_TABLE (char_table)->contents[default_slot] = value); | |
2752 | } | |
e1335ba2 KH |
2753 | |
2754 | /* Even if C is not a generic char, we had better behave as if a | |
2755 | generic char is specified. */ | |
c1fd9232 | 2756 | if (!CHARSET_DEFINED_P (charset) || CHARSET_DIMENSION (charset) == 1) |
e1335ba2 KH |
2757 | code1 = 0; |
2758 | temp = XCHAR_TABLE (char_table)->contents[charset + 128]; | |
2b048bf5 KH |
2759 | if (! SUB_CHAR_TABLE_P (temp)) |
2760 | { | |
2761 | temp = make_sub_char_table (temp); | |
2762 | XCHAR_TABLE (char_table)->contents[charset + 128] = temp; | |
2763 | } | |
e1335ba2 KH |
2764 | if (!code1) |
2765 | { | |
2b048bf5 | 2766 | XCHAR_TABLE (temp)->defalt = value; |
e1335ba2 KH |
2767 | return value; |
2768 | } | |
2b048bf5 | 2769 | char_table = temp; |
e1335ba2 KH |
2770 | temp = XCHAR_TABLE (char_table)->contents[code1]; |
2771 | if (SUB_CHAR_TABLE_P (temp)) | |
2772 | XCHAR_TABLE (temp)->defalt = value; | |
2773 | else | |
2774 | XCHAR_TABLE (char_table)->contents[code1] = value; | |
2775 | return value; | |
2776 | } | |
1d969a23 RS |
2777 | |
2778 | /* Look up the element in TABLE at index CH, | |
2779 | and return it as an integer. | |
2780 | If the element is nil, return CH itself. | |
2781 | (Actually we do that for any non-integer.) */ | |
2782 | ||
2783 | int | |
2784 | char_table_translate (table, ch) | |
2785 | Lisp_Object table; | |
2786 | int ch; | |
2787 | { | |
2788 | Lisp_Object value; | |
2789 | value = Faref (table, make_number (ch)); | |
2790 | if (! INTEGERP (value)) | |
2791 | return ch; | |
2792 | return XINT (value); | |
2793 | } | |
52ef6c89 KH |
2794 | |
2795 | static void | |
2796 | optimize_sub_char_table (table, chars) | |
2797 | Lisp_Object *table; | |
2798 | int chars; | |
2799 | { | |
2800 | Lisp_Object elt; | |
2801 | int from, to; | |
2802 | ||
2803 | if (chars == 94) | |
2804 | from = 33, to = 127; | |
2805 | else | |
2806 | from = 32, to = 128; | |
2807 | ||
2808 | if (!SUB_CHAR_TABLE_P (*table)) | |
2809 | return; | |
2810 | elt = XCHAR_TABLE (*table)->contents[from++]; | |
2811 | for (; from < to; from++) | |
2812 | if (NILP (Fequal (elt, XCHAR_TABLE (*table)->contents[from]))) | |
2813 | return; | |
2814 | *table = elt; | |
2815 | } | |
2816 | ||
2817 | DEFUN ("optimize-char-table", Foptimize_char_table, Soptimize_char_table, | |
e9d8ddc9 MB |
2818 | 1, 1, 0, doc: /* Optimize char table TABLE. */) |
2819 | (table) | |
52ef6c89 KH |
2820 | Lisp_Object table; |
2821 | { | |
2822 | Lisp_Object elt; | |
2823 | int dim; | |
2824 | int i, j; | |
2825 | ||
b7826503 | 2826 | CHECK_CHAR_TABLE (table); |
52ef6c89 KH |
2827 | |
2828 | for (i = CHAR_TABLE_SINGLE_BYTE_SLOTS; i < CHAR_TABLE_ORDINARY_SLOTS; i++) | |
2829 | { | |
2830 | elt = XCHAR_TABLE (table)->contents[i]; | |
2831 | if (!SUB_CHAR_TABLE_P (elt)) | |
2832 | continue; | |
4a8009a0 | 2833 | dim = CHARSET_DIMENSION (i - 128); |
52ef6c89 KH |
2834 | if (dim == 2) |
2835 | for (j = 32; j < SUB_CHAR_TABLE_ORDINARY_SLOTS; j++) | |
2836 | optimize_sub_char_table (XCHAR_TABLE (elt)->contents + j, dim); | |
2837 | optimize_sub_char_table (XCHAR_TABLE (table)->contents + i, dim); | |
2838 | } | |
2839 | return Qnil; | |
2840 | } | |
2841 | ||
e03f7933 | 2842 | \f |
46ed603f | 2843 | /* Map C_FUNCTION or FUNCTION over SUBTABLE, calling it for each |
c8640abf RS |
2844 | character or group of characters that share a value. |
2845 | DEPTH is the current depth in the originally specified | |
2846 | chartable, and INDICES contains the vector indices | |
46ed603f RS |
2847 | for the levels our callers have descended. |
2848 | ||
2849 | ARG is passed to C_FUNCTION when that is called. */ | |
c8640abf RS |
2850 | |
2851 | void | |
44356f63 | 2852 | map_char_table (c_function, function, table, subtable, arg, depth, indices) |
22e6f12b | 2853 | void (*c_function) P_ ((Lisp_Object, Lisp_Object, Lisp_Object)); |
44356f63 | 2854 | Lisp_Object function, table, subtable, arg, *indices; |
1847b19b | 2855 | int depth; |
e03f7933 | 2856 | { |
3720677d | 2857 | int i, to; |
91244343 SM |
2858 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; |
2859 | ||
2860 | GCPRO4 (arg, table, subtable, function); | |
e03f7933 | 2861 | |
a8283a4a | 2862 | if (depth == 0) |
3720677d KH |
2863 | { |
2864 | /* At first, handle ASCII and 8-bit European characters. */ | |
2865 | for (i = 0; i < CHAR_TABLE_SINGLE_BYTE_SLOTS; i++) | |
2866 | { | |
44356f63 RS |
2867 | Lisp_Object elt= XCHAR_TABLE (subtable)->contents[i]; |
2868 | if (NILP (elt)) | |
2869 | elt = XCHAR_TABLE (subtable)->defalt; | |
2870 | if (NILP (elt)) | |
2871 | elt = Faref (subtable, make_number (i)); | |
3720677d | 2872 | if (c_function) |
46ed603f | 2873 | (*c_function) (arg, make_number (i), elt); |
3720677d KH |
2874 | else |
2875 | call2 (function, make_number (i), elt); | |
2876 | } | |
ea35ce3d RS |
2877 | #if 0 /* If the char table has entries for higher characters, |
2878 | we should report them. */ | |
de86fcba | 2879 | if (NILP (current_buffer->enable_multibyte_characters)) |
91244343 SM |
2880 | { |
2881 | UNGCPRO; | |
2882 | return; | |
2883 | } | |
ea35ce3d | 2884 | #endif |
3720677d KH |
2885 | to = CHAR_TABLE_ORDINARY_SLOTS; |
2886 | } | |
a8283a4a | 2887 | else |
e03f7933 | 2888 | { |
a3b210c4 KH |
2889 | int charset = XFASTINT (indices[0]) - 128; |
2890 | ||
de86fcba | 2891 | i = 32; |
3720677d | 2892 | to = SUB_CHAR_TABLE_ORDINARY_SLOTS; |
a3b210c4 KH |
2893 | if (CHARSET_CHARS (charset) == 94) |
2894 | i++, to--; | |
e03f7933 RS |
2895 | } |
2896 | ||
7e798f25 | 2897 | for (; i < to; i++) |
e03f7933 | 2898 | { |
a3b210c4 KH |
2899 | Lisp_Object elt; |
2900 | int charset; | |
3720677d | 2901 | |
a3b210c4 | 2902 | elt = XCHAR_TABLE (subtable)->contents[i]; |
09ee221d | 2903 | XSETFASTINT (indices[depth], i); |
a3b210c4 | 2904 | charset = XFASTINT (indices[0]) - 128; |
df2fbceb KH |
2905 | if (depth == 0 |
2906 | && (!CHARSET_DEFINED_P (charset) | |
2907 | || charset == CHARSET_8_BIT_CONTROL | |
2908 | || charset == CHARSET_8_BIT_GRAPHIC)) | |
a3b210c4 | 2909 | continue; |
3720677d KH |
2910 | |
2911 | if (SUB_CHAR_TABLE_P (elt)) | |
2912 | { | |
2913 | if (depth >= 3) | |
2914 | error ("Too deep char table"); | |
44356f63 | 2915 | map_char_table (c_function, function, table, elt, arg, depth + 1, indices); |
3720677d | 2916 | } |
e03f7933 | 2917 | else |
a8283a4a | 2918 | { |
a3b210c4 | 2919 | int c1, c2, c; |
3720677d | 2920 | |
a3b210c4 KH |
2921 | c1 = depth >= 1 ? XFASTINT (indices[1]) : 0; |
2922 | c2 = depth >= 2 ? XFASTINT (indices[2]) : 0; | |
2efdd1b9 | 2923 | c = MAKE_CHAR (charset, c1, c2); |
fdf91be0 RS |
2924 | |
2925 | if (NILP (elt)) | |
2926 | elt = XCHAR_TABLE (subtable)->defalt; | |
2927 | if (NILP (elt)) | |
2928 | elt = Faref (table, make_number (c)); | |
2929 | ||
a3b210c4 KH |
2930 | if (c_function) |
2931 | (*c_function) (arg, make_number (c), elt); | |
2932 | else | |
2933 | call2 (function, make_number (c), elt); | |
b4f334f7 | 2934 | } |
e03f7933 | 2935 | } |
91244343 | 2936 | UNGCPRO; |
e03f7933 RS |
2937 | } |
2938 | ||
e52bd6b7 SM |
2939 | static void void_call2 P_ ((Lisp_Object a, Lisp_Object b, Lisp_Object c)); |
2940 | static void | |
2941 | void_call2 (a, b, c) | |
2942 | Lisp_Object a, b, c; | |
2943 | { | |
2944 | call2 (a, b, c); | |
2945 | } | |
2946 | ||
e03f7933 | 2947 | DEFUN ("map-char-table", Fmap_char_table, Smap_char_table, |
47cebab1 | 2948 | 2, 2, 0, |
e9d8ddc9 | 2949 | doc: /* Call FUNCTION for each (normal and generic) characters in CHAR-TABLE. |
47cebab1 | 2950 | FUNCTION is called with two arguments--a key and a value. |
e9d8ddc9 MB |
2951 | The key is always a possible IDX argument to `aref'. */) |
2952 | (function, char_table) | |
88fe8140 | 2953 | Lisp_Object function, char_table; |
e03f7933 | 2954 | { |
3720677d | 2955 | /* The depth of char table is at most 3. */ |
7e798f25 KH |
2956 | Lisp_Object indices[3]; |
2957 | ||
b7826503 | 2958 | CHECK_CHAR_TABLE (char_table); |
e03f7933 | 2959 | |
e52bd6b7 SM |
2960 | /* When Lisp_Object is represented as a union, `call2' cannot directly |
2961 | be passed to map_char_table because it returns a Lisp_Object rather | |
2962 | than returning nothing. | |
2963 | Casting leads to crashes on some architectures. -stef */ | |
44356f63 | 2964 | map_char_table (void_call2, Qnil, char_table, char_table, function, 0, indices); |
e03f7933 RS |
2965 | return Qnil; |
2966 | } | |
2f729392 KH |
2967 | |
2968 | /* Return a value for character C in char-table TABLE. Store the | |
2969 | actual index for that value in *IDX. Ignore the default value of | |
2970 | TABLE. */ | |
2971 | ||
2972 | Lisp_Object | |
2973 | char_table_ref_and_index (table, c, idx) | |
2974 | Lisp_Object table; | |
2975 | int c, *idx; | |
2976 | { | |
2977 | int charset, c1, c2; | |
2978 | Lisp_Object elt; | |
2979 | ||
2980 | if (SINGLE_BYTE_CHAR_P (c)) | |
2981 | { | |
2982 | *idx = c; | |
2983 | return XCHAR_TABLE (table)->contents[c]; | |
2984 | } | |
2985 | SPLIT_CHAR (c, charset, c1, c2); | |
2986 | elt = XCHAR_TABLE (table)->contents[charset + 128]; | |
2987 | *idx = MAKE_CHAR (charset, 0, 0); | |
2988 | if (!SUB_CHAR_TABLE_P (elt)) | |
2989 | return elt; | |
2990 | if (c1 < 32 || NILP (XCHAR_TABLE (elt)->contents[c1])) | |
2991 | return XCHAR_TABLE (elt)->defalt; | |
2992 | elt = XCHAR_TABLE (elt)->contents[c1]; | |
2993 | *idx = MAKE_CHAR (charset, c1, 0); | |
2994 | if (!SUB_CHAR_TABLE_P (elt)) | |
2995 | return elt; | |
2996 | if (c2 < 32 || NILP (XCHAR_TABLE (elt)->contents[c2])) | |
2997 | return XCHAR_TABLE (elt)->defalt; | |
2998 | *idx = c; | |
2999 | return XCHAR_TABLE (elt)->contents[c2]; | |
3000 | } | |
3001 | ||
e03f7933 | 3002 | \f |
7b863bd5 JB |
3003 | /* ARGSUSED */ |
3004 | Lisp_Object | |
3005 | nconc2 (s1, s2) | |
3006 | Lisp_Object s1, s2; | |
3007 | { | |
3008 | #ifdef NO_ARG_ARRAY | |
3009 | Lisp_Object args[2]; | |
3010 | args[0] = s1; | |
3011 | args[1] = s2; | |
3012 | return Fnconc (2, args); | |
3013 | #else | |
3014 | return Fnconc (2, &s1); | |
3015 | #endif /* NO_ARG_ARRAY */ | |
3016 | } | |
3017 | ||
3018 | DEFUN ("nconc", Fnconc, Snconc, 0, MANY, 0, | |
e9d8ddc9 | 3019 | doc: /* Concatenate any number of lists by altering them. |
4bf8e2a3 MB |
3020 | Only the last argument is not altered, and need not be a list. |
3021 | usage: (nconc &rest LISTS) */) | |
e9d8ddc9 | 3022 | (nargs, args) |
7b863bd5 JB |
3023 | int nargs; |
3024 | Lisp_Object *args; | |
3025 | { | |
3026 | register int argnum; | |
3027 | register Lisp_Object tail, tem, val; | |
3028 | ||
093386ca | 3029 | val = tail = Qnil; |
7b863bd5 JB |
3030 | |
3031 | for (argnum = 0; argnum < nargs; argnum++) | |
3032 | { | |
3033 | tem = args[argnum]; | |
265a9e55 | 3034 | if (NILP (tem)) continue; |
7b863bd5 | 3035 | |
265a9e55 | 3036 | if (NILP (val)) |
7b863bd5 JB |
3037 | val = tem; |
3038 | ||
3039 | if (argnum + 1 == nargs) break; | |
3040 | ||
3041 | if (!CONSP (tem)) | |
3042 | tem = wrong_type_argument (Qlistp, tem); | |
3043 | ||
3044 | while (CONSP (tem)) | |
3045 | { | |
3046 | tail = tem; | |
cf42cb72 | 3047 | tem = XCDR (tail); |
7b863bd5 JB |
3048 | QUIT; |
3049 | } | |
3050 | ||
3051 | tem = args[argnum + 1]; | |
3052 | Fsetcdr (tail, tem); | |
265a9e55 | 3053 | if (NILP (tem)) |
7b863bd5 JB |
3054 | args[argnum + 1] = tail; |
3055 | } | |
3056 | ||
3057 | return val; | |
3058 | } | |
3059 | \f | |
3060 | /* This is the guts of all mapping functions. | |
ea35ce3d RS |
3061 | Apply FN to each element of SEQ, one by one, |
3062 | storing the results into elements of VALS, a C vector of Lisp_Objects. | |
3063 | LENI is the length of VALS, which should also be the length of SEQ. */ | |
7b863bd5 JB |
3064 | |
3065 | static void | |
3066 | mapcar1 (leni, vals, fn, seq) | |
3067 | int leni; | |
3068 | Lisp_Object *vals; | |
3069 | Lisp_Object fn, seq; | |
3070 | { | |
3071 | register Lisp_Object tail; | |
3072 | Lisp_Object dummy; | |
3073 | register int i; | |
3074 | struct gcpro gcpro1, gcpro2, gcpro3; | |
3075 | ||
f5c75033 DL |
3076 | if (vals) |
3077 | { | |
3078 | /* Don't let vals contain any garbage when GC happens. */ | |
3079 | for (i = 0; i < leni; i++) | |
3080 | vals[i] = Qnil; | |
7b863bd5 | 3081 | |
f5c75033 DL |
3082 | GCPRO3 (dummy, fn, seq); |
3083 | gcpro1.var = vals; | |
3084 | gcpro1.nvars = leni; | |
3085 | } | |
3086 | else | |
3087 | GCPRO2 (fn, seq); | |
7b863bd5 JB |
3088 | /* We need not explicitly protect `tail' because it is used only on lists, and |
3089 | 1) lists are not relocated and 2) the list is marked via `seq' so will not be freed */ | |
3090 | ||
7650760e | 3091 | if (VECTORP (seq)) |
7b863bd5 JB |
3092 | { |
3093 | for (i = 0; i < leni; i++) | |
3094 | { | |
3095 | dummy = XVECTOR (seq)->contents[i]; | |
f5c75033 DL |
3096 | dummy = call1 (fn, dummy); |
3097 | if (vals) | |
3098 | vals[i] = dummy; | |
7b863bd5 JB |
3099 | } |
3100 | } | |
33aa0881 KH |
3101 | else if (BOOL_VECTOR_P (seq)) |
3102 | { | |
3103 | for (i = 0; i < leni; i++) | |
3104 | { | |
3105 | int byte; | |
db85986c AS |
3106 | byte = XBOOL_VECTOR (seq)->data[i / BOOL_VECTOR_BITS_PER_CHAR]; |
3107 | if (byte & (1 << (i % BOOL_VECTOR_BITS_PER_CHAR))) | |
33aa0881 KH |
3108 | dummy = Qt; |
3109 | else | |
3110 | dummy = Qnil; | |
3111 | ||
f5c75033 DL |
3112 | dummy = call1 (fn, dummy); |
3113 | if (vals) | |
3114 | vals[i] = dummy; | |
33aa0881 KH |
3115 | } |
3116 | } | |
ea35ce3d RS |
3117 | else if (STRINGP (seq)) |
3118 | { | |
ea35ce3d RS |
3119 | int i_byte; |
3120 | ||
3121 | for (i = 0, i_byte = 0; i < leni;) | |
3122 | { | |
3123 | int c; | |
0ab6a3d8 KH |
3124 | int i_before = i; |
3125 | ||
3126 | FETCH_STRING_CHAR_ADVANCE (c, seq, i, i_byte); | |
ea35ce3d | 3127 | XSETFASTINT (dummy, c); |
f5c75033 DL |
3128 | dummy = call1 (fn, dummy); |
3129 | if (vals) | |
3130 | vals[i_before] = dummy; | |
ea35ce3d RS |
3131 | } |
3132 | } | |
7b863bd5 JB |
3133 | else /* Must be a list, since Flength did not get an error */ |
3134 | { | |
3135 | tail = seq; | |
85946364 | 3136 | for (i = 0; i < leni && CONSP (tail); i++) |
7b863bd5 | 3137 | { |
85946364 | 3138 | dummy = call1 (fn, XCAR (tail)); |
f5c75033 DL |
3139 | if (vals) |
3140 | vals[i] = dummy; | |
70949dac | 3141 | tail = XCDR (tail); |
7b863bd5 JB |
3142 | } |
3143 | } | |
3144 | ||
3145 | UNGCPRO; | |
3146 | } | |
3147 | ||
3148 | DEFUN ("mapconcat", Fmapconcat, Smapconcat, 3, 3, 0, | |
e9d8ddc9 | 3149 | doc: /* Apply FUNCTION to each element of SEQUENCE, and concat the results as strings. |
dd8d1e71 | 3150 | In between each pair of results, stick in SEPARATOR. Thus, " " as |
47cebab1 | 3151 | SEPARATOR results in spaces between the values returned by FUNCTION. |
e9d8ddc9 MB |
3152 | SEQUENCE may be a list, a vector, a bool-vector, or a string. */) |
3153 | (function, sequence, separator) | |
88fe8140 | 3154 | Lisp_Object function, sequence, separator; |
7b863bd5 JB |
3155 | { |
3156 | Lisp_Object len; | |
3157 | register int leni; | |
3158 | int nargs; | |
3159 | register Lisp_Object *args; | |
3160 | register int i; | |
3161 | struct gcpro gcpro1; | |
799c08ac KS |
3162 | Lisp_Object ret; |
3163 | USE_SAFE_ALLOCA; | |
7b863bd5 | 3164 | |
88fe8140 | 3165 | len = Flength (sequence); |
7b863bd5 JB |
3166 | leni = XINT (len); |
3167 | nargs = leni + leni - 1; | |
3168 | if (nargs < 0) return build_string (""); | |
3169 | ||
7b4cd44a | 3170 | SAFE_ALLOCA_LISP (args, nargs); |
7b863bd5 | 3171 | |
88fe8140 EN |
3172 | GCPRO1 (separator); |
3173 | mapcar1 (leni, args, function, sequence); | |
7b863bd5 JB |
3174 | UNGCPRO; |
3175 | ||
85946364 | 3176 | for (i = leni - 1; i > 0; i--) |
7b863bd5 | 3177 | args[i + i] = args[i]; |
b4f334f7 | 3178 | |
7b863bd5 | 3179 | for (i = 1; i < nargs; i += 2) |
88fe8140 | 3180 | args[i] = separator; |
7b863bd5 | 3181 | |
799c08ac | 3182 | ret = Fconcat (nargs, args); |
233f3db6 | 3183 | SAFE_FREE (); |
799c08ac KS |
3184 | |
3185 | return ret; | |
7b863bd5 JB |
3186 | } |
3187 | ||
3188 | DEFUN ("mapcar", Fmapcar, Smapcar, 2, 2, 0, | |
e9d8ddc9 | 3189 | doc: /* Apply FUNCTION to each element of SEQUENCE, and make a list of the results. |
47cebab1 | 3190 | The result is a list just as long as SEQUENCE. |
e9d8ddc9 MB |
3191 | SEQUENCE may be a list, a vector, a bool-vector, or a string. */) |
3192 | (function, sequence) | |
88fe8140 | 3193 | Lisp_Object function, sequence; |
7b863bd5 JB |
3194 | { |
3195 | register Lisp_Object len; | |
3196 | register int leni; | |
3197 | register Lisp_Object *args; | |
799c08ac KS |
3198 | Lisp_Object ret; |
3199 | USE_SAFE_ALLOCA; | |
7b863bd5 | 3200 | |
88fe8140 | 3201 | len = Flength (sequence); |
7b863bd5 | 3202 | leni = XFASTINT (len); |
799c08ac | 3203 | |
7b4cd44a | 3204 | SAFE_ALLOCA_LISP (args, leni); |
7b863bd5 | 3205 | |
88fe8140 | 3206 | mapcar1 (leni, args, function, sequence); |
7b863bd5 | 3207 | |
799c08ac | 3208 | ret = Flist (leni, args); |
233f3db6 | 3209 | SAFE_FREE (); |
799c08ac KS |
3210 | |
3211 | return ret; | |
7b863bd5 | 3212 | } |
f5c75033 DL |
3213 | |
3214 | DEFUN ("mapc", Fmapc, Smapc, 2, 2, 0, | |
e9d8ddc9 | 3215 | doc: /* Apply FUNCTION to each element of SEQUENCE for side effects only. |
47cebab1 | 3216 | Unlike `mapcar', don't accumulate the results. Return SEQUENCE. |
e9d8ddc9 MB |
3217 | SEQUENCE may be a list, a vector, a bool-vector, or a string. */) |
3218 | (function, sequence) | |
f5c75033 DL |
3219 | Lisp_Object function, sequence; |
3220 | { | |
3221 | register int leni; | |
3222 | ||
3223 | leni = XFASTINT (Flength (sequence)); | |
3224 | mapcar1 (leni, 0, function, sequence); | |
3225 | ||
3226 | return sequence; | |
3227 | } | |
7b863bd5 JB |
3228 | \f |
3229 | /* Anything that calls this function must protect from GC! */ | |
3230 | ||
3231 | DEFUN ("y-or-n-p", Fy_or_n_p, Sy_or_n_p, 1, 1, 0, | |
e9d8ddc9 | 3232 | doc: /* Ask user a "y or n" question. Return t if answer is "y". |
47cebab1 GM |
3233 | Takes one argument, which is the string to display to ask the question. |
3234 | It should end in a space; `y-or-n-p' adds `(y or n) ' to it. | |
3235 | No confirmation of the answer is requested; a single character is enough. | |
3236 | Also accepts Space to mean yes, or Delete to mean no. \(Actually, it uses | |
3237 | the bindings in `query-replace-map'; see the documentation of that variable | |
3238 | for more information. In this case, the useful bindings are `act', `skip', | |
3239 | `recenter', and `quit'.\) | |
3240 | ||
3241 | Under a windowing system a dialog box will be used if `last-nonmenu-event' | |
e9d8ddc9 MB |
3242 | is nil and `use-dialog-box' is non-nil. */) |
3243 | (prompt) | |
7b863bd5 JB |
3244 | Lisp_Object prompt; |
3245 | { | |
2b8503ea | 3246 | register Lisp_Object obj, key, def, map; |
f5313ed9 | 3247 | register int answer; |
7b863bd5 JB |
3248 | Lisp_Object xprompt; |
3249 | Lisp_Object args[2]; | |
7b863bd5 | 3250 | struct gcpro gcpro1, gcpro2; |
aed13378 | 3251 | int count = SPECPDL_INDEX (); |
eb4ffa4e RS |
3252 | |
3253 | specbind (Qcursor_in_echo_area, Qt); | |
7b863bd5 | 3254 | |
f5313ed9 RS |
3255 | map = Fsymbol_value (intern ("query-replace-map")); |
3256 | ||
b7826503 | 3257 | CHECK_STRING (prompt); |
7b863bd5 JB |
3258 | xprompt = prompt; |
3259 | GCPRO2 (prompt, xprompt); | |
3260 | ||
eff95916 | 3261 | #ifdef HAVE_X_WINDOWS |
df6c90d8 GM |
3262 | if (display_hourglass_p) |
3263 | cancel_hourglass (); | |
eff95916 | 3264 | #endif |
59f953a2 | 3265 | |
7b863bd5 JB |
3266 | while (1) |
3267 | { | |
eb4ffa4e | 3268 | |
0ef68e8a | 3269 | #ifdef HAVE_MENUS |
588064ce | 3270 | if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event)) |
bdd8d692 | 3271 | && use_dialog_box |
0ef68e8a | 3272 | && have_menus_p ()) |
1db4cfb2 RS |
3273 | { |
3274 | Lisp_Object pane, menu; | |
3007ebfb | 3275 | redisplay_preserve_echo_area (3); |
1db4cfb2 RS |
3276 | pane = Fcons (Fcons (build_string ("Yes"), Qt), |
3277 | Fcons (Fcons (build_string ("No"), Qnil), | |
3278 | Qnil)); | |
ec26e1b9 | 3279 | menu = Fcons (prompt, pane); |
f0a31d70 | 3280 | obj = Fx_popup_dialog (Qt, menu, Qnil); |
1db4cfb2 RS |
3281 | answer = !NILP (obj); |
3282 | break; | |
3283 | } | |
0ef68e8a | 3284 | #endif /* HAVE_MENUS */ |
dfa89228 | 3285 | cursor_in_echo_area = 1; |
b312cc52 | 3286 | choose_minibuf_frame (); |
927be332 PJ |
3287 | |
3288 | { | |
3289 | Lisp_Object pargs[3]; | |
3290 | ||
bcb31b2a | 3291 | /* Colorize prompt according to `minibuffer-prompt' face. */ |
927be332 PJ |
3292 | pargs[0] = build_string ("%s(y or n) "); |
3293 | pargs[1] = intern ("face"); | |
3294 | pargs[2] = intern ("minibuffer-prompt"); | |
3295 | args[0] = Fpropertize (3, pargs); | |
3296 | args[1] = xprompt; | |
3297 | Fmessage (2, args); | |
3298 | } | |
7b863bd5 | 3299 | |
2d8e7e1f RS |
3300 | if (minibuffer_auto_raise) |
3301 | { | |
3302 | Lisp_Object mini_frame; | |
3303 | ||
3304 | mini_frame = WINDOW_FRAME (XWINDOW (minibuf_window)); | |
3305 | ||
3306 | Fraise_frame (mini_frame); | |
3307 | } | |
3308 | ||
7ba13c57 | 3309 | obj = read_filtered_event (1, 0, 0, 0); |
dfa89228 KH |
3310 | cursor_in_echo_area = 0; |
3311 | /* If we need to quit, quit with cursor_in_echo_area = 0. */ | |
3312 | QUIT; | |
a63f658b | 3313 | |
f5313ed9 | 3314 | key = Fmake_vector (make_number (1), obj); |
aad2a123 | 3315 | def = Flookup_key (map, key, Qt); |
7b863bd5 | 3316 | |
f5313ed9 RS |
3317 | if (EQ (def, intern ("skip"))) |
3318 | { | |
3319 | answer = 0; | |
3320 | break; | |
3321 | } | |
3322 | else if (EQ (def, intern ("act"))) | |
3323 | { | |
3324 | answer = 1; | |
3325 | break; | |
3326 | } | |
29944b73 RS |
3327 | else if (EQ (def, intern ("recenter"))) |
3328 | { | |
3329 | Frecenter (Qnil); | |
3330 | xprompt = prompt; | |
3331 | continue; | |
3332 | } | |
f5313ed9 | 3333 | else if (EQ (def, intern ("quit"))) |
7b863bd5 | 3334 | Vquit_flag = Qt; |
ec63af1b RS |
3335 | /* We want to exit this command for exit-prefix, |
3336 | and this is the only way to do it. */ | |
3337 | else if (EQ (def, intern ("exit-prefix"))) | |
3338 | Vquit_flag = Qt; | |
f5313ed9 | 3339 | |
7b863bd5 | 3340 | QUIT; |
20aa96aa JB |
3341 | |
3342 | /* If we don't clear this, then the next call to read_char will | |
3343 | return quit_char again, and we'll enter an infinite loop. */ | |
088880f1 | 3344 | Vquit_flag = Qnil; |
7b863bd5 JB |
3345 | |
3346 | Fding (Qnil); | |
3347 | Fdiscard_input (); | |
3348 | if (EQ (xprompt, prompt)) | |
3349 | { | |
3350 | args[0] = build_string ("Please answer y or n. "); | |
3351 | args[1] = prompt; | |
3352 | xprompt = Fconcat (2, args); | |
3353 | } | |
3354 | } | |
3355 | UNGCPRO; | |
6a8a9750 | 3356 | |
09c95874 RS |
3357 | if (! noninteractive) |
3358 | { | |
3359 | cursor_in_echo_area = -1; | |
ea35ce3d RS |
3360 | message_with_string (answer ? "%s(y or n) y" : "%s(y or n) n", |
3361 | xprompt, 0); | |
09c95874 | 3362 | } |
6a8a9750 | 3363 | |
eb4ffa4e | 3364 | unbind_to (count, Qnil); |
f5313ed9 | 3365 | return answer ? Qt : Qnil; |
7b863bd5 JB |
3366 | } |
3367 | \f | |
3368 | /* This is how C code calls `yes-or-no-p' and allows the user | |
3369 | to redefined it. | |
3370 | ||
3371 | Anything that calls this function must protect from GC! */ | |
3372 | ||
3373 | Lisp_Object | |
3374 | do_yes_or_no_p (prompt) | |
3375 | Lisp_Object prompt; | |
3376 | { | |
3377 | return call1 (intern ("yes-or-no-p"), prompt); | |
3378 | } | |
3379 | ||
3380 | /* Anything that calls this function must protect from GC! */ | |
3381 | ||
3382 | DEFUN ("yes-or-no-p", Fyes_or_no_p, Syes_or_no_p, 1, 1, 0, | |
e9d8ddc9 | 3383 | doc: /* Ask user a yes-or-no question. Return t if answer is yes. |
47cebab1 GM |
3384 | Takes one argument, which is the string to display to ask the question. |
3385 | It should end in a space; `yes-or-no-p' adds `(yes or no) ' to it. | |
3386 | The user must confirm the answer with RET, | |
3387 | and can edit it until it has been confirmed. | |
3388 | ||
3389 | Under a windowing system a dialog box will be used if `last-nonmenu-event' | |
e9d8ddc9 MB |
3390 | is nil, and `use-dialog-box' is non-nil. */) |
3391 | (prompt) | |
7b863bd5 JB |
3392 | Lisp_Object prompt; |
3393 | { | |
3394 | register Lisp_Object ans; | |
3395 | Lisp_Object args[2]; | |
3396 | struct gcpro gcpro1; | |
3397 | ||
b7826503 | 3398 | CHECK_STRING (prompt); |
7b863bd5 | 3399 | |
0ef68e8a | 3400 | #ifdef HAVE_MENUS |
b4f334f7 | 3401 | if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event)) |
bdd8d692 | 3402 | && use_dialog_box |
0ef68e8a | 3403 | && have_menus_p ()) |
1db4cfb2 RS |
3404 | { |
3405 | Lisp_Object pane, menu, obj; | |
3007ebfb | 3406 | redisplay_preserve_echo_area (4); |
1db4cfb2 RS |
3407 | pane = Fcons (Fcons (build_string ("Yes"), Qt), |
3408 | Fcons (Fcons (build_string ("No"), Qnil), | |
3409 | Qnil)); | |
3410 | GCPRO1 (pane); | |
ec26e1b9 | 3411 | menu = Fcons (prompt, pane); |
f0a31d70 | 3412 | obj = Fx_popup_dialog (Qt, menu, Qnil); |
1db4cfb2 RS |
3413 | UNGCPRO; |
3414 | return obj; | |
3415 | } | |
0ef68e8a | 3416 | #endif /* HAVE_MENUS */ |
1db4cfb2 | 3417 | |
7b863bd5 JB |
3418 | args[0] = prompt; |
3419 | args[1] = build_string ("(yes or no) "); | |
3420 | prompt = Fconcat (2, args); | |
3421 | ||
3422 | GCPRO1 (prompt); | |
1db4cfb2 | 3423 | |
7b863bd5 JB |
3424 | while (1) |
3425 | { | |
0ce830bc | 3426 | ans = Fdowncase (Fread_from_minibuffer (prompt, Qnil, Qnil, Qnil, |
b24014d4 | 3427 | Qyes_or_no_p_history, Qnil, |
8181f402 | 3428 | Qnil, Qnil)); |
d5db4077 | 3429 | if (SCHARS (ans) == 3 && !strcmp (SDATA (ans), "yes")) |
7b863bd5 JB |
3430 | { |
3431 | UNGCPRO; | |
3432 | return Qt; | |
3433 | } | |
d5db4077 | 3434 | if (SCHARS (ans) == 2 && !strcmp (SDATA (ans), "no")) |
7b863bd5 JB |
3435 | { |
3436 | UNGCPRO; | |
3437 | return Qnil; | |
3438 | } | |
3439 | ||
3440 | Fding (Qnil); | |
3441 | Fdiscard_input (); | |
3442 | message ("Please answer yes or no."); | |
99dc4745 | 3443 | Fsleep_for (make_number (2), Qnil); |
7b863bd5 | 3444 | } |
7b863bd5 JB |
3445 | } |
3446 | \f | |
f4b50f66 | 3447 | DEFUN ("load-average", Fload_average, Sload_average, 0, 1, 0, |
e9d8ddc9 | 3448 | doc: /* Return list of 1 minute, 5 minute and 15 minute load averages. |
91f78c99 | 3449 | |
47cebab1 GM |
3450 | Each of the three load averages is multiplied by 100, then converted |
3451 | to integer. | |
3452 | ||
3453 | When USE-FLOATS is non-nil, floats will be used instead of integers. | |
3454 | These floats are not multiplied by 100. | |
3455 | ||
3456 | If the 5-minute or 15-minute load averages are not available, return a | |
30b1b0cf DL |
3457 | shortened list, containing only those averages which are available. |
3458 | ||
3459 | An error is thrown if the load average can't be obtained. In some | |
3460 | cases making it work would require Emacs being installed setuid or | |
3461 | setgid so that it can read kernel information, and that usually isn't | |
3462 | advisable. */) | |
e9d8ddc9 | 3463 | (use_floats) |
f4b50f66 | 3464 | Lisp_Object use_floats; |
7b863bd5 | 3465 | { |
daa37602 JB |
3466 | double load_ave[3]; |
3467 | int loads = getloadavg (load_ave, 3); | |
f4b50f66 | 3468 | Lisp_Object ret = Qnil; |
7b863bd5 | 3469 | |
daa37602 JB |
3470 | if (loads < 0) |
3471 | error ("load-average not implemented for this operating system"); | |
3472 | ||
f4b50f66 RS |
3473 | while (loads-- > 0) |
3474 | { | |
3475 | Lisp_Object load = (NILP (use_floats) ? | |
3476 | make_number ((int) (100.0 * load_ave[loads])) | |
3477 | : make_float (load_ave[loads])); | |
3478 | ret = Fcons (load, ret); | |
3479 | } | |
daa37602 JB |
3480 | |
3481 | return ret; | |
3482 | } | |
7b863bd5 | 3483 | \f |
b56ba8de SS |
3484 | Lisp_Object Vfeatures, Qsubfeatures; |
3485 | extern Lisp_Object Vafter_load_alist; | |
7b863bd5 | 3486 | |
65550192 | 3487 | DEFUN ("featurep", Ffeaturep, Sfeaturep, 1, 2, 0, |
e9d8ddc9 | 3488 | doc: /* Returns t if FEATURE is present in this Emacs. |
91f78c99 | 3489 | |
47cebab1 GM |
3490 | Use this to conditionalize execution of lisp code based on the |
3491 | presence or absence of emacs or environment extensions. | |
3492 | Use `provide' to declare that a feature is available. This function | |
3493 | looks at the value of the variable `features'. The optional argument | |
e9d8ddc9 MB |
3494 | SUBFEATURE can be used to check a specific subfeature of FEATURE. */) |
3495 | (feature, subfeature) | |
65550192 | 3496 | Lisp_Object feature, subfeature; |
7b863bd5 JB |
3497 | { |
3498 | register Lisp_Object tem; | |
b7826503 | 3499 | CHECK_SYMBOL (feature); |
7b863bd5 | 3500 | tem = Fmemq (feature, Vfeatures); |
65550192 | 3501 | if (!NILP (tem) && !NILP (subfeature)) |
37ebddef | 3502 | tem = Fmember (subfeature, Fget (feature, Qsubfeatures)); |
265a9e55 | 3503 | return (NILP (tem)) ? Qnil : Qt; |
7b863bd5 JB |
3504 | } |
3505 | ||
65550192 | 3506 | DEFUN ("provide", Fprovide, Sprovide, 1, 2, 0, |
e9d8ddc9 | 3507 | doc: /* Announce that FEATURE is a feature of the current Emacs. |
47cebab1 | 3508 | The optional argument SUBFEATURES should be a list of symbols listing |
e9d8ddc9 MB |
3509 | particular subfeatures supported in this version of FEATURE. */) |
3510 | (feature, subfeatures) | |
65550192 | 3511 | Lisp_Object feature, subfeatures; |
7b863bd5 JB |
3512 | { |
3513 | register Lisp_Object tem; | |
b7826503 | 3514 | CHECK_SYMBOL (feature); |
37ebddef | 3515 | CHECK_LIST (subfeatures); |
265a9e55 | 3516 | if (!NILP (Vautoload_queue)) |
989e66e1 RS |
3517 | Vautoload_queue = Fcons (Fcons (make_number (0), Vfeatures), |
3518 | Vautoload_queue); | |
7b863bd5 | 3519 | tem = Fmemq (feature, Vfeatures); |
265a9e55 | 3520 | if (NILP (tem)) |
7b863bd5 | 3521 | Vfeatures = Fcons (feature, Vfeatures); |
65550192 SM |
3522 | if (!NILP (subfeatures)) |
3523 | Fput (feature, Qsubfeatures, subfeatures); | |
68732608 | 3524 | LOADHIST_ATTACH (Fcons (Qprovide, feature)); |
65550192 SM |
3525 | |
3526 | /* Run any load-hooks for this file. */ | |
3527 | tem = Fassq (feature, Vafter_load_alist); | |
cf42cb72 SM |
3528 | if (CONSP (tem)) |
3529 | Fprogn (XCDR (tem)); | |
65550192 | 3530 | |
7b863bd5 JB |
3531 | return feature; |
3532 | } | |
1f79789d RS |
3533 | \f |
3534 | /* `require' and its subroutines. */ | |
3535 | ||
3536 | /* List of features currently being require'd, innermost first. */ | |
3537 | ||
3538 | Lisp_Object require_nesting_list; | |
3539 | ||
b9d9a9b9 | 3540 | Lisp_Object |
1f79789d RS |
3541 | require_unwind (old_value) |
3542 | Lisp_Object old_value; | |
3543 | { | |
b9d9a9b9 | 3544 | return require_nesting_list = old_value; |
1f79789d | 3545 | } |
7b863bd5 | 3546 | |
53d5acf5 | 3547 | DEFUN ("require", Frequire, Srequire, 1, 3, 0, |
e9d8ddc9 | 3548 | doc: /* If feature FEATURE is not loaded, load it from FILENAME. |
47cebab1 GM |
3549 | If FEATURE is not a member of the list `features', then the feature |
3550 | is not loaded; so load the file FILENAME. | |
3551 | If FILENAME is omitted, the printname of FEATURE is used as the file name, | |
8d70d574 LT |
3552 | and `load' will try to load this name appended with the suffix `.elc' or |
3553 | `.el', in that order. The name without appended suffix will not be used. | |
47cebab1 GM |
3554 | If the optional third argument NOERROR is non-nil, |
3555 | then return nil if the file is not found instead of signaling an error. | |
3556 | Normally the return value is FEATURE. | |
e9d8ddc9 MB |
3557 | The normal messages at start and end of loading FILENAME are suppressed. */) |
3558 | (feature, filename, noerror) | |
81a81c0f | 3559 | Lisp_Object feature, filename, noerror; |
7b863bd5 JB |
3560 | { |
3561 | register Lisp_Object tem; | |
1f79789d | 3562 | struct gcpro gcpro1, gcpro2; |
06100606 | 3563 | int from_file = load_in_progress; |
1f79789d | 3564 | |
b7826503 | 3565 | CHECK_SYMBOL (feature); |
1f79789d | 3566 | |
5ba8f83d | 3567 | /* Record the presence of `require' in this file |
9d5c2e7e RS |
3568 | even if the feature specified is already loaded. |
3569 | But not more than once in any file, | |
06100606 RS |
3570 | and not when we aren't loading or reading from a file. */ |
3571 | if (!from_file) | |
3572 | for (tem = Vcurrent_load_list; CONSP (tem); tem = XCDR (tem)) | |
3573 | if (NILP (XCDR (tem)) && STRINGP (XCAR (tem))) | |
3574 | from_file = 1; | |
3575 | ||
3576 | if (from_file) | |
9d5c2e7e RS |
3577 | { |
3578 | tem = Fcons (Qrequire, feature); | |
3579 | if (NILP (Fmember (tem, Vcurrent_load_list))) | |
3580 | LOADHIST_ATTACH (tem); | |
3581 | } | |
7b863bd5 | 3582 | tem = Fmemq (feature, Vfeatures); |
91f78c99 | 3583 | |
265a9e55 | 3584 | if (NILP (tem)) |
7b863bd5 | 3585 | { |
aed13378 | 3586 | int count = SPECPDL_INDEX (); |
1f79789d | 3587 | int nesting = 0; |
bcb31b2a | 3588 | |
aea6173f RS |
3589 | /* This is to make sure that loadup.el gives a clear picture |
3590 | of what files are preloaded and when. */ | |
bcb31b2a RS |
3591 | if (! NILP (Vpurify_flag)) |
3592 | error ("(require %s) while preparing to dump", | |
d5db4077 | 3593 | SDATA (SYMBOL_NAME (feature))); |
91f78c99 | 3594 | |
1f79789d RS |
3595 | /* A certain amount of recursive `require' is legitimate, |
3596 | but if we require the same feature recursively 3 times, | |
3597 | signal an error. */ | |
3598 | tem = require_nesting_list; | |
3599 | while (! NILP (tem)) | |
3600 | { | |
3601 | if (! NILP (Fequal (feature, XCAR (tem)))) | |
3602 | nesting++; | |
3603 | tem = XCDR (tem); | |
3604 | } | |
f707342d | 3605 | if (nesting > 3) |
1f79789d | 3606 | error ("Recursive `require' for feature `%s'", |
d5db4077 | 3607 | SDATA (SYMBOL_NAME (feature))); |
1f79789d RS |
3608 | |
3609 | /* Update the list for any nested `require's that occur. */ | |
3610 | record_unwind_protect (require_unwind, require_nesting_list); | |
3611 | require_nesting_list = Fcons (feature, require_nesting_list); | |
7b863bd5 JB |
3612 | |
3613 | /* Value saved here is to be restored into Vautoload_queue */ | |
3614 | record_unwind_protect (un_autoload, Vautoload_queue); | |
3615 | Vautoload_queue = Qt; | |
3616 | ||
1f79789d RS |
3617 | /* Load the file. */ |
3618 | GCPRO2 (feature, filename); | |
81a81c0f GM |
3619 | tem = Fload (NILP (filename) ? Fsymbol_name (feature) : filename, |
3620 | noerror, Qt, Qnil, (NILP (filename) ? Qt : Qnil)); | |
1f79789d RS |
3621 | UNGCPRO; |
3622 | ||
53d5acf5 RS |
3623 | /* If load failed entirely, return nil. */ |
3624 | if (NILP (tem)) | |
41857307 | 3625 | return unbind_to (count, Qnil); |
7b863bd5 JB |
3626 | |
3627 | tem = Fmemq (feature, Vfeatures); | |
265a9e55 | 3628 | if (NILP (tem)) |
1f79789d | 3629 | error ("Required feature `%s' was not provided", |
d5db4077 | 3630 | SDATA (SYMBOL_NAME (feature))); |
7b863bd5 JB |
3631 | |
3632 | /* Once loading finishes, don't undo it. */ | |
3633 | Vautoload_queue = Qt; | |
3634 | feature = unbind_to (count, feature); | |
3635 | } | |
1f79789d | 3636 | |
7b863bd5 JB |
3637 | return feature; |
3638 | } | |
3639 | \f | |
b4f334f7 KH |
3640 | /* Primitives for work of the "widget" library. |
3641 | In an ideal world, this section would not have been necessary. | |
3642 | However, lisp function calls being as slow as they are, it turns | |
3643 | out that some functions in the widget library (wid-edit.el) are the | |
3644 | bottleneck of Widget operation. Here is their translation to C, | |
3645 | for the sole reason of efficiency. */ | |
3646 | ||
a5254817 | 3647 | DEFUN ("plist-member", Fplist_member, Splist_member, 2, 2, 0, |
e9d8ddc9 | 3648 | doc: /* Return non-nil if PLIST has the property PROP. |
47cebab1 GM |
3649 | PLIST is a property list, which is a list of the form |
3650 | \(PROP1 VALUE1 PROP2 VALUE2 ...\). PROP is a symbol. | |
3651 | Unlike `plist-get', this allows you to distinguish between a missing | |
3652 | property and a property with the value nil. | |
e9d8ddc9 MB |
3653 | The value is actually the tail of PLIST whose car is PROP. */) |
3654 | (plist, prop) | |
b4f334f7 KH |
3655 | Lisp_Object plist, prop; |
3656 | { | |
3657 | while (CONSP (plist) && !EQ (XCAR (plist), prop)) | |
3658 | { | |
3659 | QUIT; | |
3660 | plist = XCDR (plist); | |
3661 | plist = CDR (plist); | |
3662 | } | |
3663 | return plist; | |
3664 | } | |
3665 | ||
3666 | DEFUN ("widget-put", Fwidget_put, Swidget_put, 3, 3, 0, | |
e9d8ddc9 MB |
3667 | doc: /* In WIDGET, set PROPERTY to VALUE. |
3668 | The value can later be retrieved with `widget-get'. */) | |
3669 | (widget, property, value) | |
b4f334f7 KH |
3670 | Lisp_Object widget, property, value; |
3671 | { | |
b7826503 | 3672 | CHECK_CONS (widget); |
f3fbd155 | 3673 | XSETCDR (widget, Fplist_put (XCDR (widget), property, value)); |
f7993597 | 3674 | return value; |
b4f334f7 KH |
3675 | } |
3676 | ||
3677 | DEFUN ("widget-get", Fwidget_get, Swidget_get, 2, 2, 0, | |
e9d8ddc9 | 3678 | doc: /* In WIDGET, get the value of PROPERTY. |
47cebab1 | 3679 | The value could either be specified when the widget was created, or |
e9d8ddc9 MB |
3680 | later with `widget-put'. */) |
3681 | (widget, property) | |
b4f334f7 KH |
3682 | Lisp_Object widget, property; |
3683 | { | |
3684 | Lisp_Object tmp; | |
3685 | ||
3686 | while (1) | |
3687 | { | |
3688 | if (NILP (widget)) | |
3689 | return Qnil; | |
b7826503 | 3690 | CHECK_CONS (widget); |
a5254817 | 3691 | tmp = Fplist_member (XCDR (widget), property); |
b4f334f7 KH |
3692 | if (CONSP (tmp)) |
3693 | { | |
3694 | tmp = XCDR (tmp); | |
3695 | return CAR (tmp); | |
3696 | } | |
3697 | tmp = XCAR (widget); | |
3698 | if (NILP (tmp)) | |
3699 | return Qnil; | |
3700 | widget = Fget (tmp, Qwidget_type); | |
3701 | } | |
3702 | } | |
3703 | ||
3704 | DEFUN ("widget-apply", Fwidget_apply, Swidget_apply, 2, MANY, 0, | |
e9d8ddc9 | 3705 | doc: /* Apply the value of WIDGET's PROPERTY to the widget itself. |
4bf8e2a3 MB |
3706 | ARGS are passed as extra arguments to the function. |
3707 | usage: (widget-apply WIDGET PROPERTY &rest ARGS) */) | |
e9d8ddc9 | 3708 | (nargs, args) |
b4f334f7 KH |
3709 | int nargs; |
3710 | Lisp_Object *args; | |
3711 | { | |
3712 | /* This function can GC. */ | |
3713 | Lisp_Object newargs[3]; | |
3714 | struct gcpro gcpro1, gcpro2; | |
3715 | Lisp_Object result; | |
3716 | ||
3717 | newargs[0] = Fwidget_get (args[0], args[1]); | |
3718 | newargs[1] = args[0]; | |
3719 | newargs[2] = Flist (nargs - 2, args + 2); | |
3720 | GCPRO2 (newargs[0], newargs[2]); | |
3721 | result = Fapply (3, newargs); | |
3722 | UNGCPRO; | |
3723 | return result; | |
3724 | } | |
dec002ca DL |
3725 | |
3726 | #ifdef HAVE_LANGINFO_CODESET | |
3727 | #include <langinfo.h> | |
3728 | #endif | |
3729 | ||
d68beb2f RS |
3730 | DEFUN ("locale-info", Flocale_info, Slocale_info, 1, 1, 0, |
3731 | doc: /* Access locale data ITEM for the current C locale, if available. | |
3732 | ITEM should be one of the following: | |
30b1b0cf | 3733 | |
98aeeaa1 | 3734 | `codeset', returning the character set as a string (locale item CODESET); |
30b1b0cf | 3735 | |
98aeeaa1 | 3736 | `days', returning a 7-element vector of day names (locale items DAY_n); |
30b1b0cf | 3737 | |
98aeeaa1 | 3738 | `months', returning a 12-element vector of month names (locale items MON_n); |
30b1b0cf | 3739 | |
d68beb2f RS |
3740 | `paper', returning a list (WIDTH HEIGHT) for the default paper size, |
3741 | both measured in milimeters (locale items PAPER_WIDTH, PAPER_HEIGHT). | |
dec002ca DL |
3742 | |
3743 | If the system can't provide such information through a call to | |
d68beb2f | 3744 | `nl_langinfo', or if ITEM isn't from the list above, return nil. |
dec002ca | 3745 | |
98aeeaa1 DL |
3746 | See also Info node `(libc)Locales'. |
3747 | ||
dec002ca DL |
3748 | The data read from the system are decoded using `locale-coding-system'. */) |
3749 | (item) | |
3750 | Lisp_Object item; | |
3751 | { | |
3752 | char *str = NULL; | |
3753 | #ifdef HAVE_LANGINFO_CODESET | |
3754 | Lisp_Object val; | |
3755 | if (EQ (item, Qcodeset)) | |
3756 | { | |
3757 | str = nl_langinfo (CODESET); | |
3758 | return build_string (str); | |
3759 | } | |
3760 | #ifdef DAY_1 | |
3761 | else if (EQ (item, Qdays)) /* e.g. for calendar-day-name-array */ | |
3762 | { | |
3763 | Lisp_Object v = Fmake_vector (make_number (7), Qnil); | |
3764 | int days[7] = {DAY_1, DAY_2, DAY_3, DAY_4, DAY_5, DAY_6, DAY_7}; | |
3765 | int i; | |
3766 | synchronize_system_time_locale (); | |
3767 | for (i = 0; i < 7; i++) | |
3768 | { | |
3769 | str = nl_langinfo (days[i]); | |
3770 | val = make_unibyte_string (str, strlen (str)); | |
3771 | /* Fixme: Is this coding system necessarily right, even if | |
3772 | it is consistent with CODESET? If not, what to do? */ | |
3773 | Faset (v, make_number (i), | |
3774 | code_convert_string_norecord (val, Vlocale_coding_system, | |
e52bd6b7 | 3775 | 0)); |
dec002ca DL |
3776 | } |
3777 | return v; | |
3778 | } | |
3779 | #endif /* DAY_1 */ | |
3780 | #ifdef MON_1 | |
3781 | else if (EQ (item, Qmonths)) /* e.g. for calendar-month-name-array */ | |
3782 | { | |
3783 | struct Lisp_Vector *p = allocate_vector (12); | |
3784 | int months[12] = {MON_1, MON_2, MON_3, MON_4, MON_5, MON_6, MON_7, | |
3785 | MON_8, MON_9, MON_10, MON_11, MON_12}; | |
3786 | int i; | |
3787 | synchronize_system_time_locale (); | |
3788 | for (i = 0; i < 12; i++) | |
3789 | { | |
3790 | str = nl_langinfo (months[i]); | |
3791 | val = make_unibyte_string (str, strlen (str)); | |
3792 | p->contents[i] = | |
e52bd6b7 | 3793 | code_convert_string_norecord (val, Vlocale_coding_system, 0); |
dec002ca DL |
3794 | } |
3795 | XSETVECTOR (val, p); | |
3796 | return val; | |
3797 | } | |
3798 | #endif /* MON_1 */ | |
3799 | /* LC_PAPER stuff isn't defined as accessible in glibc as of 2.3.1, | |
3800 | but is in the locale files. This could be used by ps-print. */ | |
3801 | #ifdef PAPER_WIDTH | |
3802 | else if (EQ (item, Qpaper)) | |
3803 | { | |
3804 | return list2 (make_number (nl_langinfo (PAPER_WIDTH)), | |
3805 | make_number (nl_langinfo (PAPER_HEIGHT))); | |
3806 | } | |
3807 | #endif /* PAPER_WIDTH */ | |
3808 | #endif /* HAVE_LANGINFO_CODESET*/ | |
30b1b0cf | 3809 | return Qnil; |
dec002ca | 3810 | } |
b4f334f7 | 3811 | \f |
a90e80bf | 3812 | /* base64 encode/decode functions (RFC 2045). |
24c129e4 KH |
3813 | Based on code from GNU recode. */ |
3814 | ||
3815 | #define MIME_LINE_LENGTH 76 | |
3816 | ||
3817 | #define IS_ASCII(Character) \ | |
3818 | ((Character) < 128) | |
3819 | #define IS_BASE64(Character) \ | |
3820 | (IS_ASCII (Character) && base64_char_to_value[Character] >= 0) | |
9a092df0 PF |
3821 | #define IS_BASE64_IGNORABLE(Character) \ |
3822 | ((Character) == ' ' || (Character) == '\t' || (Character) == '\n' \ | |
3823 | || (Character) == '\f' || (Character) == '\r') | |
3824 | ||
3825 | /* Used by base64_decode_1 to retrieve a non-base64-ignorable | |
3826 | character or return retval if there are no characters left to | |
3827 | process. */ | |
caff31d4 KH |
3828 | #define READ_QUADRUPLET_BYTE(retval) \ |
3829 | do \ | |
3830 | { \ | |
3831 | if (i == length) \ | |
3832 | { \ | |
3833 | if (nchars_return) \ | |
3834 | *nchars_return = nchars; \ | |
3835 | return (retval); \ | |
3836 | } \ | |
3837 | c = from[i++]; \ | |
3838 | } \ | |
9a092df0 | 3839 | while (IS_BASE64_IGNORABLE (c)) |
24c129e4 KH |
3840 | |
3841 | /* Table of characters coding the 64 values. */ | |
3842 | static char base64_value_to_char[64] = | |
3843 | { | |
3844 | 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', /* 0- 9 */ | |
3845 | 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', /* 10-19 */ | |
3846 | 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', /* 20-29 */ | |
3847 | 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', /* 30-39 */ | |
3848 | 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', /* 40-49 */ | |
3849 | 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', /* 50-59 */ | |
3850 | '8', '9', '+', '/' /* 60-63 */ | |
3851 | }; | |
3852 | ||
3853 | /* Table of base64 values for first 128 characters. */ | |
3854 | static short base64_char_to_value[128] = | |
3855 | { | |
3856 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0- 9 */ | |
3857 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 10- 19 */ | |
3858 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 20- 29 */ | |
3859 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 30- 39 */ | |
3860 | -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, /* 40- 49 */ | |
3861 | 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, /* 50- 59 */ | |
3862 | -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, /* 60- 69 */ | |
3863 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, /* 70- 79 */ | |
3864 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, /* 80- 89 */ | |
3865 | 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, /* 90- 99 */ | |
3866 | 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, /* 100-109 */ | |
3867 | 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, /* 110-119 */ | |
3868 | 49, 50, 51, -1, -1, -1, -1, -1 /* 120-127 */ | |
3869 | }; | |
3870 | ||
3871 | /* The following diagram shows the logical steps by which three octets | |
3872 | get transformed into four base64 characters. | |
3873 | ||
3874 | .--------. .--------. .--------. | |
3875 | |aaaaaabb| |bbbbcccc| |ccdddddd| | |
3876 | `--------' `--------' `--------' | |
3877 | 6 2 4 4 2 6 | |
3878 | .--------+--------+--------+--------. | |
3879 | |00aaaaaa|00bbbbbb|00cccccc|00dddddd| | |
3880 | `--------+--------+--------+--------' | |
3881 | ||
3882 | .--------+--------+--------+--------. | |
3883 | |AAAAAAAA|BBBBBBBB|CCCCCCCC|DDDDDDDD| | |
3884 | `--------+--------+--------+--------' | |
3885 | ||
3886 | The octets are divided into 6 bit chunks, which are then encoded into | |
3887 | base64 characters. */ | |
3888 | ||
3889 | ||
2efdd1b9 | 3890 | static int base64_encode_1 P_ ((const char *, char *, int, int, int)); |
caff31d4 | 3891 | static int base64_decode_1 P_ ((const char *, char *, int, int, int *)); |
24c129e4 KH |
3892 | |
3893 | DEFUN ("base64-encode-region", Fbase64_encode_region, Sbase64_encode_region, | |
3894 | 2, 3, "r", | |
e9d8ddc9 | 3895 | doc: /* Base64-encode the region between BEG and END. |
47cebab1 GM |
3896 | Return the length of the encoded text. |
3897 | Optional third argument NO-LINE-BREAK means do not break long lines | |
e9d8ddc9 MB |
3898 | into shorter lines. */) |
3899 | (beg, end, no_line_break) | |
24c129e4 KH |
3900 | Lisp_Object beg, end, no_line_break; |
3901 | { | |
3902 | char *encoded; | |
3903 | int allength, length; | |
3904 | int ibeg, iend, encoded_length; | |
3905 | int old_pos = PT; | |
799c08ac | 3906 | USE_SAFE_ALLOCA; |
24c129e4 KH |
3907 | |
3908 | validate_region (&beg, &end); | |
3909 | ||
3910 | ibeg = CHAR_TO_BYTE (XFASTINT (beg)); | |
3911 | iend = CHAR_TO_BYTE (XFASTINT (end)); | |
3912 | move_gap_both (XFASTINT (beg), ibeg); | |
3913 | ||
3914 | /* We need to allocate enough room for encoding the text. | |
3915 | We need 33 1/3% more space, plus a newline every 76 | |
3916 | characters, and then we round up. */ | |
3917 | length = iend - ibeg; | |
3918 | allength = length + length/3 + 1; | |
3919 | allength += allength / MIME_LINE_LENGTH + 1 + 6; | |
3920 | ||
799c08ac | 3921 | SAFE_ALLOCA (encoded, char *, allength); |
24c129e4 | 3922 | encoded_length = base64_encode_1 (BYTE_POS_ADDR (ibeg), encoded, length, |
2efdd1b9 KH |
3923 | NILP (no_line_break), |
3924 | !NILP (current_buffer->enable_multibyte_characters)); | |
24c129e4 KH |
3925 | if (encoded_length > allength) |
3926 | abort (); | |
3927 | ||
2efdd1b9 KH |
3928 | if (encoded_length < 0) |
3929 | { | |
3930 | /* The encoding wasn't possible. */ | |
233f3db6 | 3931 | SAFE_FREE (); |
a90e80bf | 3932 | error ("Multibyte character in data for base64 encoding"); |
2efdd1b9 KH |
3933 | } |
3934 | ||
24c129e4 KH |
3935 | /* Now we have encoded the region, so we insert the new contents |
3936 | and delete the old. (Insert first in order to preserve markers.) */ | |
8b835738 | 3937 | SET_PT_BOTH (XFASTINT (beg), ibeg); |
24c129e4 | 3938 | insert (encoded, encoded_length); |
233f3db6 | 3939 | SAFE_FREE (); |
24c129e4 KH |
3940 | del_range_byte (ibeg + encoded_length, iend + encoded_length, 1); |
3941 | ||
3942 | /* If point was outside of the region, restore it exactly; else just | |
3943 | move to the beginning of the region. */ | |
3944 | if (old_pos >= XFASTINT (end)) | |
3945 | old_pos += encoded_length - (XFASTINT (end) - XFASTINT (beg)); | |
8b835738 AS |
3946 | else if (old_pos > XFASTINT (beg)) |
3947 | old_pos = XFASTINT (beg); | |
24c129e4 KH |
3948 | SET_PT (old_pos); |
3949 | ||
3950 | /* We return the length of the encoded text. */ | |
3951 | return make_number (encoded_length); | |
3952 | } | |
3953 | ||
3954 | DEFUN ("base64-encode-string", Fbase64_encode_string, Sbase64_encode_string, | |
c22554ac | 3955 | 1, 2, 0, |
e9d8ddc9 | 3956 | doc: /* Base64-encode STRING and return the result. |
47cebab1 | 3957 | Optional second argument NO-LINE-BREAK means do not break long lines |
e9d8ddc9 MB |
3958 | into shorter lines. */) |
3959 | (string, no_line_break) | |
915b8312 | 3960 | Lisp_Object string, no_line_break; |
24c129e4 KH |
3961 | { |
3962 | int allength, length, encoded_length; | |
3963 | char *encoded; | |
4b2e75e6 | 3964 | Lisp_Object encoded_string; |
799c08ac | 3965 | USE_SAFE_ALLOCA; |
24c129e4 | 3966 | |
b7826503 | 3967 | CHECK_STRING (string); |
24c129e4 | 3968 | |
7f8a0840 KH |
3969 | /* We need to allocate enough room for encoding the text. |
3970 | We need 33 1/3% more space, plus a newline every 76 | |
3971 | characters, and then we round up. */ | |
d5db4077 | 3972 | length = SBYTES (string); |
7f8a0840 KH |
3973 | allength = length + length/3 + 1; |
3974 | allength += allength / MIME_LINE_LENGTH + 1 + 6; | |
24c129e4 KH |
3975 | |
3976 | /* We need to allocate enough room for decoding the text. */ | |
799c08ac | 3977 | SAFE_ALLOCA (encoded, char *, allength); |
24c129e4 | 3978 | |
d5db4077 | 3979 | encoded_length = base64_encode_1 (SDATA (string), |
2efdd1b9 KH |
3980 | encoded, length, NILP (no_line_break), |
3981 | STRING_MULTIBYTE (string)); | |
24c129e4 KH |
3982 | if (encoded_length > allength) |
3983 | abort (); | |
3984 | ||
2efdd1b9 KH |
3985 | if (encoded_length < 0) |
3986 | { | |
3987 | /* The encoding wasn't possible. */ | |
233f3db6 | 3988 | SAFE_FREE (); |
a90e80bf | 3989 | error ("Multibyte character in data for base64 encoding"); |
2efdd1b9 KH |
3990 | } |
3991 | ||
4b2e75e6 | 3992 | encoded_string = make_unibyte_string (encoded, encoded_length); |
233f3db6 | 3993 | SAFE_FREE (); |
4b2e75e6 EZ |
3994 | |
3995 | return encoded_string; | |
24c129e4 KH |
3996 | } |
3997 | ||
3998 | static int | |
2efdd1b9 | 3999 | base64_encode_1 (from, to, length, line_break, multibyte) |
24c129e4 KH |
4000 | const char *from; |
4001 | char *to; | |
4002 | int length; | |
4003 | int line_break; | |
2efdd1b9 | 4004 | int multibyte; |
24c129e4 KH |
4005 | { |
4006 | int counter = 0, i = 0; | |
4007 | char *e = to; | |
844eb643 | 4008 | int c; |
24c129e4 | 4009 | unsigned int value; |
2efdd1b9 | 4010 | int bytes; |
24c129e4 KH |
4011 | |
4012 | while (i < length) | |
4013 | { | |
2efdd1b9 KH |
4014 | if (multibyte) |
4015 | { | |
4016 | c = STRING_CHAR_AND_LENGTH (from + i, length - i, bytes); | |
caff31d4 | 4017 | if (c >= 256) |
2efdd1b9 | 4018 | return -1; |
caff31d4 | 4019 | i += bytes; |
2efdd1b9 KH |
4020 | } |
4021 | else | |
4022 | c = from[i++]; | |
24c129e4 KH |
4023 | |
4024 | /* Wrap line every 76 characters. */ | |
4025 | ||
4026 | if (line_break) | |
4027 | { | |
4028 | if (counter < MIME_LINE_LENGTH / 4) | |
4029 | counter++; | |
4030 | else | |
4031 | { | |
4032 | *e++ = '\n'; | |
4033 | counter = 1; | |
4034 | } | |
4035 | } | |
4036 | ||
4037 | /* Process first byte of a triplet. */ | |
4038 | ||
4039 | *e++ = base64_value_to_char[0x3f & c >> 2]; | |
4040 | value = (0x03 & c) << 4; | |
4041 | ||
4042 | /* Process second byte of a triplet. */ | |
4043 | ||
4044 | if (i == length) | |
4045 | { | |
4046 | *e++ = base64_value_to_char[value]; | |
4047 | *e++ = '='; | |
4048 | *e++ = '='; | |
4049 | break; | |
4050 | } | |
4051 | ||
2efdd1b9 KH |
4052 | if (multibyte) |
4053 | { | |
4054 | c = STRING_CHAR_AND_LENGTH (from + i, length - i, bytes); | |
caff31d4 | 4055 | if (c >= 256) |
844eb643 | 4056 | return -1; |
caff31d4 | 4057 | i += bytes; |
2efdd1b9 KH |
4058 | } |
4059 | else | |
4060 | c = from[i++]; | |
24c129e4 KH |
4061 | |
4062 | *e++ = base64_value_to_char[value | (0x0f & c >> 4)]; | |
4063 | value = (0x0f & c) << 2; | |
4064 | ||
4065 | /* Process third byte of a triplet. */ | |
4066 | ||
4067 | if (i == length) | |
4068 | { | |
4069 | *e++ = base64_value_to_char[value]; | |
4070 | *e++ = '='; | |
4071 | break; | |
4072 | } | |
4073 | ||
2efdd1b9 KH |
4074 | if (multibyte) |
4075 | { | |
4076 | c = STRING_CHAR_AND_LENGTH (from + i, length - i, bytes); | |
caff31d4 | 4077 | if (c >= 256) |
844eb643 | 4078 | return -1; |
caff31d4 | 4079 | i += bytes; |
2efdd1b9 KH |
4080 | } |
4081 | else | |
4082 | c = from[i++]; | |
24c129e4 KH |
4083 | |
4084 | *e++ = base64_value_to_char[value | (0x03 & c >> 6)]; | |
4085 | *e++ = base64_value_to_char[0x3f & c]; | |
4086 | } | |
4087 | ||
24c129e4 KH |
4088 | return e - to; |
4089 | } | |
4090 | ||
4091 | ||
4092 | DEFUN ("base64-decode-region", Fbase64_decode_region, Sbase64_decode_region, | |
47cebab1 | 4093 | 2, 2, "r", |
e9d8ddc9 | 4094 | doc: /* Base64-decode the region between BEG and END. |
47cebab1 | 4095 | Return the length of the decoded text. |
e9d8ddc9 MB |
4096 | If the region can't be decoded, signal an error and don't modify the buffer. */) |
4097 | (beg, end) | |
24c129e4 KH |
4098 | Lisp_Object beg, end; |
4099 | { | |
caff31d4 | 4100 | int ibeg, iend, length, allength; |
24c129e4 KH |
4101 | char *decoded; |
4102 | int old_pos = PT; | |
4103 | int decoded_length; | |
9b703a38 | 4104 | int inserted_chars; |
caff31d4 | 4105 | int multibyte = !NILP (current_buffer->enable_multibyte_characters); |
799c08ac | 4106 | USE_SAFE_ALLOCA; |
24c129e4 KH |
4107 | |
4108 | validate_region (&beg, &end); | |
4109 | ||
4110 | ibeg = CHAR_TO_BYTE (XFASTINT (beg)); | |
4111 | iend = CHAR_TO_BYTE (XFASTINT (end)); | |
4112 | ||
4113 | length = iend - ibeg; | |
caff31d4 KH |
4114 | |
4115 | /* We need to allocate enough room for decoding the text. If we are | |
4116 | working on a multibyte buffer, each decoded code may occupy at | |
4117 | most two bytes. */ | |
4118 | allength = multibyte ? length * 2 : length; | |
799c08ac | 4119 | SAFE_ALLOCA (decoded, char *, allength); |
24c129e4 KH |
4120 | |
4121 | move_gap_both (XFASTINT (beg), ibeg); | |
caff31d4 KH |
4122 | decoded_length = base64_decode_1 (BYTE_POS_ADDR (ibeg), decoded, length, |
4123 | multibyte, &inserted_chars); | |
4124 | if (decoded_length > allength) | |
24c129e4 KH |
4125 | abort (); |
4126 | ||
4127 | if (decoded_length < 0) | |
8c217645 KH |
4128 | { |
4129 | /* The decoding wasn't possible. */ | |
233f3db6 | 4130 | SAFE_FREE (); |
a90e80bf | 4131 | error ("Invalid base64 data"); |
8c217645 | 4132 | } |
24c129e4 KH |
4133 | |
4134 | /* Now we have decoded the region, so we insert the new contents | |
4135 | and delete the old. (Insert first in order to preserve markers.) */ | |
59f953a2 | 4136 | TEMP_SET_PT_BOTH (XFASTINT (beg), ibeg); |
2efdd1b9 | 4137 | insert_1_both (decoded, inserted_chars, decoded_length, 0, 1, 0); |
233f3db6 | 4138 | SAFE_FREE (); |
799c08ac | 4139 | |
2efdd1b9 KH |
4140 | /* Delete the original text. */ |
4141 | del_range_both (PT, PT_BYTE, XFASTINT (end) + inserted_chars, | |
4142 | iend + decoded_length, 1); | |
24c129e4 KH |
4143 | |
4144 | /* If point was outside of the region, restore it exactly; else just | |
4145 | move to the beginning of the region. */ | |
4146 | if (old_pos >= XFASTINT (end)) | |
9b703a38 KH |
4147 | old_pos += inserted_chars - (XFASTINT (end) - XFASTINT (beg)); |
4148 | else if (old_pos > XFASTINT (beg)) | |
4149 | old_pos = XFASTINT (beg); | |
e52ad9c9 | 4150 | SET_PT (old_pos > ZV ? ZV : old_pos); |
24c129e4 | 4151 | |
9b703a38 | 4152 | return make_number (inserted_chars); |
24c129e4 KH |
4153 | } |
4154 | ||
4155 | DEFUN ("base64-decode-string", Fbase64_decode_string, Sbase64_decode_string, | |
4156 | 1, 1, 0, | |
e9d8ddc9 MB |
4157 | doc: /* Base64-decode STRING and return the result. */) |
4158 | (string) | |
24c129e4 KH |
4159 | Lisp_Object string; |
4160 | { | |
4161 | char *decoded; | |
4162 | int length, decoded_length; | |
4b2e75e6 | 4163 | Lisp_Object decoded_string; |
799c08ac | 4164 | USE_SAFE_ALLOCA; |
24c129e4 | 4165 | |
b7826503 | 4166 | CHECK_STRING (string); |
24c129e4 | 4167 | |
d5db4077 | 4168 | length = SBYTES (string); |
24c129e4 | 4169 | /* We need to allocate enough room for decoding the text. */ |
799c08ac | 4170 | SAFE_ALLOCA (decoded, char *, length); |
24c129e4 | 4171 | |
8ec118cd | 4172 | /* The decoded result should be unibyte. */ |
d5db4077 | 4173 | decoded_length = base64_decode_1 (SDATA (string), decoded, length, |
8ec118cd | 4174 | 0, NULL); |
24c129e4 KH |
4175 | if (decoded_length > length) |
4176 | abort (); | |
3d6c79c5 | 4177 | else if (decoded_length >= 0) |
2efdd1b9 | 4178 | decoded_string = make_unibyte_string (decoded, decoded_length); |
3d6c79c5 GM |
4179 | else |
4180 | decoded_string = Qnil; | |
24c129e4 | 4181 | |
233f3db6 | 4182 | SAFE_FREE (); |
3d6c79c5 | 4183 | if (!STRINGP (decoded_string)) |
a90e80bf | 4184 | error ("Invalid base64 data"); |
4b2e75e6 EZ |
4185 | |
4186 | return decoded_string; | |
24c129e4 KH |
4187 | } |
4188 | ||
caff31d4 KH |
4189 | /* Base64-decode the data at FROM of LENGHT bytes into TO. If |
4190 | MULTIBYTE is nonzero, the decoded result should be in multibyte | |
4191 | form. If NCHARS_RETRUN is not NULL, store the number of produced | |
4192 | characters in *NCHARS_RETURN. */ | |
4193 | ||
24c129e4 | 4194 | static int |
caff31d4 | 4195 | base64_decode_1 (from, to, length, multibyte, nchars_return) |
24c129e4 KH |
4196 | const char *from; |
4197 | char *to; | |
4198 | int length; | |
caff31d4 KH |
4199 | int multibyte; |
4200 | int *nchars_return; | |
24c129e4 | 4201 | { |
9a092df0 | 4202 | int i = 0; |
24c129e4 KH |
4203 | char *e = to; |
4204 | unsigned char c; | |
4205 | unsigned long value; | |
caff31d4 | 4206 | int nchars = 0; |
24c129e4 | 4207 | |
9a092df0 | 4208 | while (1) |
24c129e4 | 4209 | { |
9a092df0 | 4210 | /* Process first byte of a quadruplet. */ |
24c129e4 | 4211 | |
9a092df0 | 4212 | READ_QUADRUPLET_BYTE (e-to); |
24c129e4 KH |
4213 | |
4214 | if (!IS_BASE64 (c)) | |
4215 | return -1; | |
4216 | value = base64_char_to_value[c] << 18; | |
4217 | ||
4218 | /* Process second byte of a quadruplet. */ | |
4219 | ||
9a092df0 | 4220 | READ_QUADRUPLET_BYTE (-1); |
24c129e4 KH |
4221 | |
4222 | if (!IS_BASE64 (c)) | |
4223 | return -1; | |
4224 | value |= base64_char_to_value[c] << 12; | |
4225 | ||
caff31d4 KH |
4226 | c = (unsigned char) (value >> 16); |
4227 | if (multibyte) | |
4228 | e += CHAR_STRING (c, e); | |
4229 | else | |
4230 | *e++ = c; | |
4231 | nchars++; | |
24c129e4 KH |
4232 | |
4233 | /* Process third byte of a quadruplet. */ | |
59f953a2 | 4234 | |
9a092df0 | 4235 | READ_QUADRUPLET_BYTE (-1); |
24c129e4 KH |
4236 | |
4237 | if (c == '=') | |
4238 | { | |
9a092df0 | 4239 | READ_QUADRUPLET_BYTE (-1); |
59f953a2 | 4240 | |
24c129e4 KH |
4241 | if (c != '=') |
4242 | return -1; | |
4243 | continue; | |
4244 | } | |
4245 | ||
4246 | if (!IS_BASE64 (c)) | |
4247 | return -1; | |
4248 | value |= base64_char_to_value[c] << 6; | |
4249 | ||
caff31d4 KH |
4250 | c = (unsigned char) (0xff & value >> 8); |
4251 | if (multibyte) | |
4252 | e += CHAR_STRING (c, e); | |
4253 | else | |
4254 | *e++ = c; | |
4255 | nchars++; | |
24c129e4 KH |
4256 | |
4257 | /* Process fourth byte of a quadruplet. */ | |
4258 | ||
9a092df0 | 4259 | READ_QUADRUPLET_BYTE (-1); |
24c129e4 KH |
4260 | |
4261 | if (c == '=') | |
4262 | continue; | |
4263 | ||
4264 | if (!IS_BASE64 (c)) | |
4265 | return -1; | |
4266 | value |= base64_char_to_value[c]; | |
4267 | ||
caff31d4 KH |
4268 | c = (unsigned char) (0xff & value); |
4269 | if (multibyte) | |
4270 | e += CHAR_STRING (c, e); | |
4271 | else | |
4272 | *e++ = c; | |
4273 | nchars++; | |
24c129e4 | 4274 | } |
24c129e4 | 4275 | } |
d80c6c11 GM |
4276 | |
4277 | ||
4278 | \f | |
4279 | /*********************************************************************** | |
4280 | ***** ***** | |
4281 | ***** Hash Tables ***** | |
4282 | ***** ***** | |
4283 | ***********************************************************************/ | |
4284 | ||
4285 | /* Implemented by gerd@gnu.org. This hash table implementation was | |
4286 | inspired by CMUCL hash tables. */ | |
4287 | ||
4288 | /* Ideas: | |
4289 | ||
4290 | 1. For small tables, association lists are probably faster than | |
4291 | hash tables because they have lower overhead. | |
4292 | ||
4293 | For uses of hash tables where the O(1) behavior of table | |
4294 | operations is not a requirement, it might therefore be a good idea | |
4295 | not to hash. Instead, we could just do a linear search in the | |
4296 | key_and_value vector of the hash table. This could be done | |
4297 | if a `:linear-search t' argument is given to make-hash-table. */ | |
4298 | ||
4299 | ||
d80c6c11 GM |
4300 | /* The list of all weak hash tables. Don't staticpro this one. */ |
4301 | ||
4302 | Lisp_Object Vweak_hash_tables; | |
4303 | ||
4304 | /* Various symbols. */ | |
4305 | ||
f899c503 | 4306 | Lisp_Object Qhash_table_p, Qeq, Qeql, Qequal, Qkey, Qvalue; |
ee0403b3 | 4307 | Lisp_Object QCtest, QCsize, QCrehash_size, QCrehash_threshold, QCweakness; |
ec504e6f | 4308 | Lisp_Object Qhash_table_test, Qkey_or_value, Qkey_and_value; |
d80c6c11 GM |
4309 | |
4310 | /* Function prototypes. */ | |
4311 | ||
4312 | static struct Lisp_Hash_Table *check_hash_table P_ ((Lisp_Object)); | |
d80c6c11 | 4313 | static int get_key_arg P_ ((Lisp_Object, int, Lisp_Object *, char *)); |
d80c6c11 | 4314 | static void maybe_resize_hash_table P_ ((struct Lisp_Hash_Table *)); |
d80c6c11 GM |
4315 | static int cmpfn_eql P_ ((struct Lisp_Hash_Table *, Lisp_Object, unsigned, |
4316 | Lisp_Object, unsigned)); | |
4317 | static int cmpfn_equal P_ ((struct Lisp_Hash_Table *, Lisp_Object, unsigned, | |
4318 | Lisp_Object, unsigned)); | |
4319 | static int cmpfn_user_defined P_ ((struct Lisp_Hash_Table *, Lisp_Object, | |
4320 | unsigned, Lisp_Object, unsigned)); | |
4321 | static unsigned hashfn_eq P_ ((struct Lisp_Hash_Table *, Lisp_Object)); | |
4322 | static unsigned hashfn_eql P_ ((struct Lisp_Hash_Table *, Lisp_Object)); | |
4323 | static unsigned hashfn_equal P_ ((struct Lisp_Hash_Table *, Lisp_Object)); | |
4324 | static unsigned hashfn_user_defined P_ ((struct Lisp_Hash_Table *, | |
4325 | Lisp_Object)); | |
4326 | static unsigned sxhash_string P_ ((unsigned char *, int)); | |
4327 | static unsigned sxhash_list P_ ((Lisp_Object, int)); | |
4328 | static unsigned sxhash_vector P_ ((Lisp_Object, int)); | |
4329 | static unsigned sxhash_bool_vector P_ ((Lisp_Object)); | |
a0b581cc | 4330 | static int sweep_weak_table P_ ((struct Lisp_Hash_Table *, int)); |
d80c6c11 GM |
4331 | |
4332 | ||
4333 | \f | |
4334 | /*********************************************************************** | |
4335 | Utilities | |
4336 | ***********************************************************************/ | |
4337 | ||
4338 | /* If OBJ is a Lisp hash table, return a pointer to its struct | |
4339 | Lisp_Hash_Table. Otherwise, signal an error. */ | |
4340 | ||
4341 | static struct Lisp_Hash_Table * | |
4342 | check_hash_table (obj) | |
4343 | Lisp_Object obj; | |
4344 | { | |
b7826503 | 4345 | CHECK_HASH_TABLE (obj); |
d80c6c11 GM |
4346 | return XHASH_TABLE (obj); |
4347 | } | |
4348 | ||
4349 | ||
4350 | /* Value is the next integer I >= N, N >= 0 which is "almost" a prime | |
4351 | number. */ | |
4352 | ||
6e509e80 | 4353 | int |
d80c6c11 GM |
4354 | next_almost_prime (n) |
4355 | int n; | |
4356 | { | |
4357 | if (n % 2 == 0) | |
4358 | n += 1; | |
4359 | if (n % 3 == 0) | |
4360 | n += 2; | |
4361 | if (n % 7 == 0) | |
4362 | n += 4; | |
4363 | return n; | |
4364 | } | |
4365 | ||
4366 | ||
4367 | /* Find KEY in ARGS which has size NARGS. Don't consider indices for | |
4368 | which USED[I] is non-zero. If found at index I in ARGS, set | |
4369 | USED[I] and USED[I + 1] to 1, and return I + 1. Otherwise return | |
4370 | -1. This function is used to extract a keyword/argument pair from | |
4371 | a DEFUN parameter list. */ | |
4372 | ||
4373 | static int | |
4374 | get_key_arg (key, nargs, args, used) | |
4375 | Lisp_Object key; | |
4376 | int nargs; | |
4377 | Lisp_Object *args; | |
4378 | char *used; | |
4379 | { | |
4380 | int i; | |
59f953a2 | 4381 | |
d80c6c11 GM |
4382 | for (i = 0; i < nargs - 1; ++i) |
4383 | if (!used[i] && EQ (args[i], key)) | |
4384 | break; | |
59f953a2 | 4385 | |
d80c6c11 GM |
4386 | if (i >= nargs - 1) |
4387 | i = -1; | |
4388 | else | |
4389 | { | |
4390 | used[i++] = 1; | |
4391 | used[i] = 1; | |
4392 | } | |
59f953a2 | 4393 | |
d80c6c11 GM |
4394 | return i; |
4395 | } | |
4396 | ||
4397 | ||
4398 | /* Return a Lisp vector which has the same contents as VEC but has | |
4399 | size NEW_SIZE, NEW_SIZE >= VEC->size. Entries in the resulting | |
4400 | vector that are not copied from VEC are set to INIT. */ | |
4401 | ||
fa7dad5b | 4402 | Lisp_Object |
d80c6c11 GM |
4403 | larger_vector (vec, new_size, init) |
4404 | Lisp_Object vec; | |
4405 | int new_size; | |
4406 | Lisp_Object init; | |
4407 | { | |
4408 | struct Lisp_Vector *v; | |
4409 | int i, old_size; | |
4410 | ||
4411 | xassert (VECTORP (vec)); | |
4412 | old_size = XVECTOR (vec)->size; | |
4413 | xassert (new_size >= old_size); | |
4414 | ||
b3660ef6 | 4415 | v = allocate_vector (new_size); |
d80c6c11 GM |
4416 | bcopy (XVECTOR (vec)->contents, v->contents, |
4417 | old_size * sizeof *v->contents); | |
4418 | for (i = old_size; i < new_size; ++i) | |
4419 | v->contents[i] = init; | |
4420 | XSETVECTOR (vec, v); | |
4421 | return vec; | |
4422 | } | |
4423 | ||
4424 | ||
4425 | /*********************************************************************** | |
4426 | Low-level Functions | |
4427 | ***********************************************************************/ | |
4428 | ||
d80c6c11 GM |
4429 | /* Compare KEY1 which has hash code HASH1 and KEY2 with hash code |
4430 | HASH2 in hash table H using `eql'. Value is non-zero if KEY1 and | |
4431 | KEY2 are the same. */ | |
4432 | ||
4433 | static int | |
4434 | cmpfn_eql (h, key1, hash1, key2, hash2) | |
4435 | struct Lisp_Hash_Table *h; | |
4436 | Lisp_Object key1, key2; | |
4437 | unsigned hash1, hash2; | |
4438 | { | |
2e5da676 GM |
4439 | return (FLOATP (key1) |
4440 | && FLOATP (key2) | |
e84b1dea | 4441 | && XFLOAT_DATA (key1) == XFLOAT_DATA (key2)); |
d80c6c11 GM |
4442 | } |
4443 | ||
4444 | ||
4445 | /* Compare KEY1 which has hash code HASH1 and KEY2 with hash code | |
4446 | HASH2 in hash table H using `equal'. Value is non-zero if KEY1 and | |
4447 | KEY2 are the same. */ | |
4448 | ||
4449 | static int | |
4450 | cmpfn_equal (h, key1, hash1, key2, hash2) | |
4451 | struct Lisp_Hash_Table *h; | |
4452 | Lisp_Object key1, key2; | |
4453 | unsigned hash1, hash2; | |
4454 | { | |
2e5da676 | 4455 | return hash1 == hash2 && !NILP (Fequal (key1, key2)); |
d80c6c11 GM |
4456 | } |
4457 | ||
59f953a2 | 4458 | |
d80c6c11 GM |
4459 | /* Compare KEY1 which has hash code HASH1, and KEY2 with hash code |
4460 | HASH2 in hash table H using H->user_cmp_function. Value is non-zero | |
4461 | if KEY1 and KEY2 are the same. */ | |
4462 | ||
4463 | static int | |
4464 | cmpfn_user_defined (h, key1, hash1, key2, hash2) | |
4465 | struct Lisp_Hash_Table *h; | |
4466 | Lisp_Object key1, key2; | |
4467 | unsigned hash1, hash2; | |
4468 | { | |
4469 | if (hash1 == hash2) | |
4470 | { | |
4471 | Lisp_Object args[3]; | |
59f953a2 | 4472 | |
d80c6c11 GM |
4473 | args[0] = h->user_cmp_function; |
4474 | args[1] = key1; | |
4475 | args[2] = key2; | |
4476 | return !NILP (Ffuncall (3, args)); | |
4477 | } | |
4478 | else | |
4479 | return 0; | |
4480 | } | |
4481 | ||
4482 | ||
4483 | /* Value is a hash code for KEY for use in hash table H which uses | |
4484 | `eq' to compare keys. The hash code returned is guaranteed to fit | |
4485 | in a Lisp integer. */ | |
4486 | ||
4487 | static unsigned | |
4488 | hashfn_eq (h, key) | |
4489 | struct Lisp_Hash_Table *h; | |
4490 | Lisp_Object key; | |
4491 | { | |
cf681889 | 4492 | unsigned hash = XUINT (key) ^ XGCTYPE (key); |
854c1a59 | 4493 | xassert ((hash & ~INTMASK) == 0); |
cf681889 | 4494 | return hash; |
d80c6c11 GM |
4495 | } |
4496 | ||
4497 | ||
4498 | /* Value is a hash code for KEY for use in hash table H which uses | |
4499 | `eql' to compare keys. The hash code returned is guaranteed to fit | |
4500 | in a Lisp integer. */ | |
4501 | ||
4502 | static unsigned | |
4503 | hashfn_eql (h, key) | |
4504 | struct Lisp_Hash_Table *h; | |
4505 | Lisp_Object key; | |
4506 | { | |
cf681889 GM |
4507 | unsigned hash; |
4508 | if (FLOATP (key)) | |
4509 | hash = sxhash (key, 0); | |
d80c6c11 | 4510 | else |
cf681889 | 4511 | hash = XUINT (key) ^ XGCTYPE (key); |
854c1a59 | 4512 | xassert ((hash & ~INTMASK) == 0); |
cf681889 | 4513 | return hash; |
d80c6c11 GM |
4514 | } |
4515 | ||
4516 | ||
4517 | /* Value is a hash code for KEY for use in hash table H which uses | |
4518 | `equal' to compare keys. The hash code returned is guaranteed to fit | |
4519 | in a Lisp integer. */ | |
4520 | ||
4521 | static unsigned | |
4522 | hashfn_equal (h, key) | |
4523 | struct Lisp_Hash_Table *h; | |
4524 | Lisp_Object key; | |
4525 | { | |
cf681889 | 4526 | unsigned hash = sxhash (key, 0); |
854c1a59 | 4527 | xassert ((hash & ~INTMASK) == 0); |
cf681889 | 4528 | return hash; |
d80c6c11 GM |
4529 | } |
4530 | ||
4531 | ||
4532 | /* Value is a hash code for KEY for use in hash table H which uses as | |
4533 | user-defined function to compare keys. The hash code returned is | |
4534 | guaranteed to fit in a Lisp integer. */ | |
4535 | ||
4536 | static unsigned | |
4537 | hashfn_user_defined (h, key) | |
4538 | struct Lisp_Hash_Table *h; | |
4539 | Lisp_Object key; | |
4540 | { | |
4541 | Lisp_Object args[2], hash; | |
59f953a2 | 4542 | |
d80c6c11 GM |
4543 | args[0] = h->user_hash_function; |
4544 | args[1] = key; | |
4545 | hash = Ffuncall (2, args); | |
4546 | if (!INTEGERP (hash)) | |
4547 | Fsignal (Qerror, | |
1fd4c450 | 4548 | list2 (build_string ("Invalid hash code returned from \ |
d80c6c11 GM |
4549 | user-supplied hash function"), |
4550 | hash)); | |
4551 | return XUINT (hash); | |
4552 | } | |
4553 | ||
4554 | ||
4555 | /* Create and initialize a new hash table. | |
4556 | ||
4557 | TEST specifies the test the hash table will use to compare keys. | |
4558 | It must be either one of the predefined tests `eq', `eql' or | |
4559 | `equal' or a symbol denoting a user-defined test named TEST with | |
4560 | test and hash functions USER_TEST and USER_HASH. | |
59f953a2 | 4561 | |
1fd4c450 | 4562 | Give the table initial capacity SIZE, SIZE >= 0, an integer. |
d80c6c11 GM |
4563 | |
4564 | If REHASH_SIZE is an integer, it must be > 0, and this hash table's | |
4565 | new size when it becomes full is computed by adding REHASH_SIZE to | |
4566 | its old size. If REHASH_SIZE is a float, it must be > 1.0, and the | |
4567 | table's new size is computed by multiplying its old size with | |
4568 | REHASH_SIZE. | |
4569 | ||
4570 | REHASH_THRESHOLD must be a float <= 1.0, and > 0. The table will | |
4571 | be resized when the ratio of (number of entries in the table) / | |
4572 | (table size) is >= REHASH_THRESHOLD. | |
4573 | ||
4574 | WEAK specifies the weakness of the table. If non-nil, it must be | |
ec504e6f | 4575 | one of the symbols `key', `value', `key-or-value', or `key-and-value'. */ |
d80c6c11 GM |
4576 | |
4577 | Lisp_Object | |
4578 | make_hash_table (test, size, rehash_size, rehash_threshold, weak, | |
4579 | user_test, user_hash) | |
4580 | Lisp_Object test, size, rehash_size, rehash_threshold, weak; | |
4581 | Lisp_Object user_test, user_hash; | |
4582 | { | |
4583 | struct Lisp_Hash_Table *h; | |
d80c6c11 | 4584 | Lisp_Object table; |
b3660ef6 | 4585 | int index_size, i, sz; |
d80c6c11 GM |
4586 | |
4587 | /* Preconditions. */ | |
4588 | xassert (SYMBOLP (test)); | |
1fd4c450 | 4589 | xassert (INTEGERP (size) && XINT (size) >= 0); |
d80c6c11 GM |
4590 | xassert ((INTEGERP (rehash_size) && XINT (rehash_size) > 0) |
4591 | || (FLOATP (rehash_size) && XFLOATINT (rehash_size) > 1.0)); | |
4592 | xassert (FLOATP (rehash_threshold) | |
4593 | && XFLOATINT (rehash_threshold) > 0 | |
4594 | && XFLOATINT (rehash_threshold) <= 1.0); | |
4595 | ||
1fd4c450 GM |
4596 | if (XFASTINT (size) == 0) |
4597 | size = make_number (1); | |
4598 | ||
b3660ef6 GM |
4599 | /* Allocate a table and initialize it. */ |
4600 | h = allocate_hash_table (); | |
d80c6c11 GM |
4601 | |
4602 | /* Initialize hash table slots. */ | |
4603 | sz = XFASTINT (size); | |
59f953a2 | 4604 | |
d80c6c11 GM |
4605 | h->test = test; |
4606 | if (EQ (test, Qeql)) | |
4607 | { | |
4608 | h->cmpfn = cmpfn_eql; | |
4609 | h->hashfn = hashfn_eql; | |
4610 | } | |
4611 | else if (EQ (test, Qeq)) | |
4612 | { | |
2e5da676 | 4613 | h->cmpfn = NULL; |
d80c6c11 GM |
4614 | h->hashfn = hashfn_eq; |
4615 | } | |
4616 | else if (EQ (test, Qequal)) | |
4617 | { | |
4618 | h->cmpfn = cmpfn_equal; | |
4619 | h->hashfn = hashfn_equal; | |
4620 | } | |
4621 | else | |
4622 | { | |
4623 | h->user_cmp_function = user_test; | |
4624 | h->user_hash_function = user_hash; | |
4625 | h->cmpfn = cmpfn_user_defined; | |
4626 | h->hashfn = hashfn_user_defined; | |
4627 | } | |
59f953a2 | 4628 | |
d80c6c11 GM |
4629 | h->weak = weak; |
4630 | h->rehash_threshold = rehash_threshold; | |
4631 | h->rehash_size = rehash_size; | |
4632 | h->count = make_number (0); | |
4633 | h->key_and_value = Fmake_vector (make_number (2 * sz), Qnil); | |
4634 | h->hash = Fmake_vector (size, Qnil); | |
4635 | h->next = Fmake_vector (size, Qnil); | |
0690cb37 DL |
4636 | /* Cast to int here avoids losing with gcc 2.95 on Tru64/Alpha... */ |
4637 | index_size = next_almost_prime ((int) (sz / XFLOATINT (rehash_threshold))); | |
d80c6c11 GM |
4638 | h->index = Fmake_vector (make_number (index_size), Qnil); |
4639 | ||
4640 | /* Set up the free list. */ | |
4641 | for (i = 0; i < sz - 1; ++i) | |
4642 | HASH_NEXT (h, i) = make_number (i + 1); | |
4643 | h->next_free = make_number (0); | |
4644 | ||
4645 | XSET_HASH_TABLE (table, h); | |
4646 | xassert (HASH_TABLE_P (table)); | |
4647 | xassert (XHASH_TABLE (table) == h); | |
4648 | ||
4649 | /* Maybe add this hash table to the list of all weak hash tables. */ | |
4650 | if (NILP (h->weak)) | |
4651 | h->next_weak = Qnil; | |
4652 | else | |
4653 | { | |
4654 | h->next_weak = Vweak_hash_tables; | |
4655 | Vweak_hash_tables = table; | |
4656 | } | |
4657 | ||
4658 | return table; | |
4659 | } | |
4660 | ||
4661 | ||
f899c503 GM |
4662 | /* Return a copy of hash table H1. Keys and values are not copied, |
4663 | only the table itself is. */ | |
4664 | ||
4665 | Lisp_Object | |
4666 | copy_hash_table (h1) | |
4667 | struct Lisp_Hash_Table *h1; | |
4668 | { | |
4669 | Lisp_Object table; | |
4670 | struct Lisp_Hash_Table *h2; | |
44dc78e0 | 4671 | struct Lisp_Vector *next; |
59f953a2 | 4672 | |
b3660ef6 | 4673 | h2 = allocate_hash_table (); |
f899c503 GM |
4674 | next = h2->vec_next; |
4675 | bcopy (h1, h2, sizeof *h2); | |
4676 | h2->vec_next = next; | |
4677 | h2->key_and_value = Fcopy_sequence (h1->key_and_value); | |
4678 | h2->hash = Fcopy_sequence (h1->hash); | |
4679 | h2->next = Fcopy_sequence (h1->next); | |
4680 | h2->index = Fcopy_sequence (h1->index); | |
4681 | XSET_HASH_TABLE (table, h2); | |
4682 | ||
4683 | /* Maybe add this hash table to the list of all weak hash tables. */ | |
4684 | if (!NILP (h2->weak)) | |
4685 | { | |
4686 | h2->next_weak = Vweak_hash_tables; | |
4687 | Vweak_hash_tables = table; | |
4688 | } | |
4689 | ||
4690 | return table; | |
4691 | } | |
4692 | ||
4693 | ||
d80c6c11 GM |
4694 | /* Resize hash table H if it's too full. If H cannot be resized |
4695 | because it's already too large, throw an error. */ | |
4696 | ||
4697 | static INLINE void | |
4698 | maybe_resize_hash_table (h) | |
4699 | struct Lisp_Hash_Table *h; | |
4700 | { | |
4701 | if (NILP (h->next_free)) | |
4702 | { | |
4703 | int old_size = HASH_TABLE_SIZE (h); | |
4704 | int i, new_size, index_size; | |
59f953a2 | 4705 | |
d80c6c11 GM |
4706 | if (INTEGERP (h->rehash_size)) |
4707 | new_size = old_size + XFASTINT (h->rehash_size); | |
4708 | else | |
4709 | new_size = old_size * XFLOATINT (h->rehash_size); | |
0d6ba42e | 4710 | new_size = max (old_size + 1, new_size); |
0690cb37 DL |
4711 | index_size = next_almost_prime ((int) |
4712 | (new_size | |
4713 | / XFLOATINT (h->rehash_threshold))); | |
854c1a59 | 4714 | if (max (index_size, 2 * new_size) > MOST_POSITIVE_FIXNUM) |
d80c6c11 GM |
4715 | error ("Hash table too large to resize"); |
4716 | ||
4717 | h->key_and_value = larger_vector (h->key_and_value, 2 * new_size, Qnil); | |
4718 | h->next = larger_vector (h->next, new_size, Qnil); | |
4719 | h->hash = larger_vector (h->hash, new_size, Qnil); | |
4720 | h->index = Fmake_vector (make_number (index_size), Qnil); | |
4721 | ||
4722 | /* Update the free list. Do it so that new entries are added at | |
4723 | the end of the free list. This makes some operations like | |
4724 | maphash faster. */ | |
4725 | for (i = old_size; i < new_size - 1; ++i) | |
4726 | HASH_NEXT (h, i) = make_number (i + 1); | |
59f953a2 | 4727 | |
d80c6c11 GM |
4728 | if (!NILP (h->next_free)) |
4729 | { | |
4730 | Lisp_Object last, next; | |
59f953a2 | 4731 | |
d80c6c11 GM |
4732 | last = h->next_free; |
4733 | while (next = HASH_NEXT (h, XFASTINT (last)), | |
4734 | !NILP (next)) | |
4735 | last = next; | |
59f953a2 | 4736 | |
d80c6c11 GM |
4737 | HASH_NEXT (h, XFASTINT (last)) = make_number (old_size); |
4738 | } | |
4739 | else | |
4740 | XSETFASTINT (h->next_free, old_size); | |
4741 | ||
4742 | /* Rehash. */ | |
4743 | for (i = 0; i < old_size; ++i) | |
4744 | if (!NILP (HASH_HASH (h, i))) | |
4745 | { | |
4746 | unsigned hash_code = XUINT (HASH_HASH (h, i)); | |
4747 | int start_of_bucket = hash_code % XVECTOR (h->index)->size; | |
4748 | HASH_NEXT (h, i) = HASH_INDEX (h, start_of_bucket); | |
4749 | HASH_INDEX (h, start_of_bucket) = make_number (i); | |
4750 | } | |
59f953a2 | 4751 | } |
d80c6c11 GM |
4752 | } |
4753 | ||
4754 | ||
4755 | /* Lookup KEY in hash table H. If HASH is non-null, return in *HASH | |
4756 | the hash code of KEY. Value is the index of the entry in H | |
4757 | matching KEY, or -1 if not found. */ | |
4758 | ||
4759 | int | |
4760 | hash_lookup (h, key, hash) | |
4761 | struct Lisp_Hash_Table *h; | |
4762 | Lisp_Object key; | |
4763 | unsigned *hash; | |
4764 | { | |
4765 | unsigned hash_code; | |
4766 | int start_of_bucket; | |
4767 | Lisp_Object idx; | |
4768 | ||
4769 | hash_code = h->hashfn (h, key); | |
4770 | if (hash) | |
4771 | *hash = hash_code; | |
59f953a2 | 4772 | |
d80c6c11 GM |
4773 | start_of_bucket = hash_code % XVECTOR (h->index)->size; |
4774 | idx = HASH_INDEX (h, start_of_bucket); | |
4775 | ||
f5c75033 | 4776 | /* We need not gcpro idx since it's either an integer or nil. */ |
d80c6c11 GM |
4777 | while (!NILP (idx)) |
4778 | { | |
4779 | int i = XFASTINT (idx); | |
2e5da676 GM |
4780 | if (EQ (key, HASH_KEY (h, i)) |
4781 | || (h->cmpfn | |
4782 | && h->cmpfn (h, key, hash_code, | |
7c752c80 | 4783 | HASH_KEY (h, i), XUINT (HASH_HASH (h, i))))) |
d80c6c11 GM |
4784 | break; |
4785 | idx = HASH_NEXT (h, i); | |
4786 | } | |
4787 | ||
4788 | return NILP (idx) ? -1 : XFASTINT (idx); | |
4789 | } | |
4790 | ||
4791 | ||
4792 | /* Put an entry into hash table H that associates KEY with VALUE. | |
64a5094a KH |
4793 | HASH is a previously computed hash code of KEY. |
4794 | Value is the index of the entry in H matching KEY. */ | |
d80c6c11 | 4795 | |
64a5094a | 4796 | int |
d80c6c11 GM |
4797 | hash_put (h, key, value, hash) |
4798 | struct Lisp_Hash_Table *h; | |
4799 | Lisp_Object key, value; | |
4800 | unsigned hash; | |
4801 | { | |
4802 | int start_of_bucket, i; | |
4803 | ||
854c1a59 | 4804 | xassert ((hash & ~INTMASK) == 0); |
d80c6c11 GM |
4805 | |
4806 | /* Increment count after resizing because resizing may fail. */ | |
4807 | maybe_resize_hash_table (h); | |
4808 | h->count = make_number (XFASTINT (h->count) + 1); | |
59f953a2 | 4809 | |
d80c6c11 GM |
4810 | /* Store key/value in the key_and_value vector. */ |
4811 | i = XFASTINT (h->next_free); | |
4812 | h->next_free = HASH_NEXT (h, i); | |
4813 | HASH_KEY (h, i) = key; | |
4814 | HASH_VALUE (h, i) = value; | |
4815 | ||
4816 | /* Remember its hash code. */ | |
4817 | HASH_HASH (h, i) = make_number (hash); | |
4818 | ||
4819 | /* Add new entry to its collision chain. */ | |
4820 | start_of_bucket = hash % XVECTOR (h->index)->size; | |
4821 | HASH_NEXT (h, i) = HASH_INDEX (h, start_of_bucket); | |
4822 | HASH_INDEX (h, start_of_bucket) = make_number (i); | |
64a5094a | 4823 | return i; |
d80c6c11 GM |
4824 | } |
4825 | ||
4826 | ||
4827 | /* Remove the entry matching KEY from hash table H, if there is one. */ | |
4828 | ||
4829 | void | |
4830 | hash_remove (h, key) | |
4831 | struct Lisp_Hash_Table *h; | |
4832 | Lisp_Object key; | |
4833 | { | |
4834 | unsigned hash_code; | |
4835 | int start_of_bucket; | |
4836 | Lisp_Object idx, prev; | |
4837 | ||
4838 | hash_code = h->hashfn (h, key); | |
4839 | start_of_bucket = hash_code % XVECTOR (h->index)->size; | |
4840 | idx = HASH_INDEX (h, start_of_bucket); | |
4841 | prev = Qnil; | |
4842 | ||
f5c75033 | 4843 | /* We need not gcpro idx, prev since they're either integers or nil. */ |
d80c6c11 GM |
4844 | while (!NILP (idx)) |
4845 | { | |
4846 | int i = XFASTINT (idx); | |
4847 | ||
2e5da676 GM |
4848 | if (EQ (key, HASH_KEY (h, i)) |
4849 | || (h->cmpfn | |
4850 | && h->cmpfn (h, key, hash_code, | |
7c752c80 | 4851 | HASH_KEY (h, i), XUINT (HASH_HASH (h, i))))) |
d80c6c11 GM |
4852 | { |
4853 | /* Take entry out of collision chain. */ | |
4854 | if (NILP (prev)) | |
4855 | HASH_INDEX (h, start_of_bucket) = HASH_NEXT (h, i); | |
4856 | else | |
4857 | HASH_NEXT (h, XFASTINT (prev)) = HASH_NEXT (h, i); | |
4858 | ||
4859 | /* Clear slots in key_and_value and add the slots to | |
4860 | the free list. */ | |
4861 | HASH_KEY (h, i) = HASH_VALUE (h, i) = HASH_HASH (h, i) = Qnil; | |
4862 | HASH_NEXT (h, i) = h->next_free; | |
4863 | h->next_free = make_number (i); | |
4864 | h->count = make_number (XFASTINT (h->count) - 1); | |
4865 | xassert (XINT (h->count) >= 0); | |
4866 | break; | |
4867 | } | |
4868 | else | |
4869 | { | |
4870 | prev = idx; | |
4871 | idx = HASH_NEXT (h, i); | |
4872 | } | |
4873 | } | |
4874 | } | |
4875 | ||
4876 | ||
4877 | /* Clear hash table H. */ | |
4878 | ||
4879 | void | |
4880 | hash_clear (h) | |
4881 | struct Lisp_Hash_Table *h; | |
4882 | { | |
4883 | if (XFASTINT (h->count) > 0) | |
4884 | { | |
4885 | int i, size = HASH_TABLE_SIZE (h); | |
4886 | ||
4887 | for (i = 0; i < size; ++i) | |
4888 | { | |
4889 | HASH_NEXT (h, i) = i < size - 1 ? make_number (i + 1) : Qnil; | |
4890 | HASH_KEY (h, i) = Qnil; | |
4891 | HASH_VALUE (h, i) = Qnil; | |
4892 | HASH_HASH (h, i) = Qnil; | |
4893 | } | |
4894 | ||
4895 | for (i = 0; i < XVECTOR (h->index)->size; ++i) | |
4896 | XVECTOR (h->index)->contents[i] = Qnil; | |
4897 | ||
4898 | h->next_free = make_number (0); | |
4899 | h->count = make_number (0); | |
4900 | } | |
4901 | } | |
4902 | ||
4903 | ||
4904 | \f | |
4905 | /************************************************************************ | |
4906 | Weak Hash Tables | |
4907 | ************************************************************************/ | |
4908 | ||
a0b581cc GM |
4909 | /* Sweep weak hash table H. REMOVE_ENTRIES_P non-zero means remove |
4910 | entries from the table that don't survive the current GC. | |
4911 | REMOVE_ENTRIES_P zero means mark entries that are in use. Value is | |
4912 | non-zero if anything was marked. */ | |
4913 | ||
4914 | static int | |
4915 | sweep_weak_table (h, remove_entries_p) | |
4916 | struct Lisp_Hash_Table *h; | |
4917 | int remove_entries_p; | |
4918 | { | |
4919 | int bucket, n, marked; | |
59f953a2 | 4920 | |
a0b581cc GM |
4921 | n = XVECTOR (h->index)->size & ~ARRAY_MARK_FLAG; |
4922 | marked = 0; | |
59f953a2 | 4923 | |
a0b581cc GM |
4924 | for (bucket = 0; bucket < n; ++bucket) |
4925 | { | |
1e546714 | 4926 | Lisp_Object idx, next, prev; |
a0b581cc GM |
4927 | |
4928 | /* Follow collision chain, removing entries that | |
4929 | don't survive this garbage collection. */ | |
a0b581cc | 4930 | prev = Qnil; |
1e546714 | 4931 | for (idx = HASH_INDEX (h, bucket); !GC_NILP (idx); idx = next) |
a0b581cc | 4932 | { |
a0b581cc | 4933 | int i = XFASTINT (idx); |
1e546714 GM |
4934 | int key_known_to_survive_p = survives_gc_p (HASH_KEY (h, i)); |
4935 | int value_known_to_survive_p = survives_gc_p (HASH_VALUE (h, i)); | |
4936 | int remove_p; | |
59f953a2 | 4937 | |
a0b581cc | 4938 | if (EQ (h->weak, Qkey)) |
aee625fa | 4939 | remove_p = !key_known_to_survive_p; |
a0b581cc | 4940 | else if (EQ (h->weak, Qvalue)) |
aee625fa | 4941 | remove_p = !value_known_to_survive_p; |
ec504e6f | 4942 | else if (EQ (h->weak, Qkey_or_value)) |
728c5d9d | 4943 | remove_p = !(key_known_to_survive_p || value_known_to_survive_p); |
ec504e6f | 4944 | else if (EQ (h->weak, Qkey_and_value)) |
728c5d9d | 4945 | remove_p = !(key_known_to_survive_p && value_known_to_survive_p); |
a0b581cc GM |
4946 | else |
4947 | abort (); | |
59f953a2 | 4948 | |
a0b581cc GM |
4949 | next = HASH_NEXT (h, i); |
4950 | ||
4951 | if (remove_entries_p) | |
4952 | { | |
4953 | if (remove_p) | |
4954 | { | |
4955 | /* Take out of collision chain. */ | |
4956 | if (GC_NILP (prev)) | |
1e546714 | 4957 | HASH_INDEX (h, bucket) = next; |
a0b581cc GM |
4958 | else |
4959 | HASH_NEXT (h, XFASTINT (prev)) = next; | |
59f953a2 | 4960 | |
a0b581cc GM |
4961 | /* Add to free list. */ |
4962 | HASH_NEXT (h, i) = h->next_free; | |
4963 | h->next_free = idx; | |
59f953a2 | 4964 | |
a0b581cc GM |
4965 | /* Clear key, value, and hash. */ |
4966 | HASH_KEY (h, i) = HASH_VALUE (h, i) = Qnil; | |
4967 | HASH_HASH (h, i) = Qnil; | |
59f953a2 | 4968 | |
a0b581cc GM |
4969 | h->count = make_number (XFASTINT (h->count) - 1); |
4970 | } | |
d278cde0 KS |
4971 | else |
4972 | { | |
4973 | prev = idx; | |
4974 | } | |
a0b581cc GM |
4975 | } |
4976 | else | |
4977 | { | |
4978 | if (!remove_p) | |
4979 | { | |
4980 | /* Make sure key and value survive. */ | |
aee625fa GM |
4981 | if (!key_known_to_survive_p) |
4982 | { | |
9568e3d8 | 4983 | mark_object (HASH_KEY (h, i)); |
aee625fa GM |
4984 | marked = 1; |
4985 | } | |
4986 | ||
4987 | if (!value_known_to_survive_p) | |
4988 | { | |
9568e3d8 | 4989 | mark_object (HASH_VALUE (h, i)); |
aee625fa GM |
4990 | marked = 1; |
4991 | } | |
a0b581cc GM |
4992 | } |
4993 | } | |
a0b581cc GM |
4994 | } |
4995 | } | |
4996 | ||
4997 | return marked; | |
4998 | } | |
4999 | ||
d80c6c11 GM |
5000 | /* Remove elements from weak hash tables that don't survive the |
5001 | current garbage collection. Remove weak tables that don't survive | |
5002 | from Vweak_hash_tables. Called from gc_sweep. */ | |
5003 | ||
5004 | void | |
5005 | sweep_weak_hash_tables () | |
5006 | { | |
ac0e96ee GM |
5007 | Lisp_Object table, used, next; |
5008 | struct Lisp_Hash_Table *h; | |
a0b581cc GM |
5009 | int marked; |
5010 | ||
5011 | /* Mark all keys and values that are in use. Keep on marking until | |
5012 | there is no more change. This is necessary for cases like | |
5013 | value-weak table A containing an entry X -> Y, where Y is used in a | |
5014 | key-weak table B, Z -> Y. If B comes after A in the list of weak | |
5015 | tables, X -> Y might be removed from A, although when looking at B | |
5016 | one finds that it shouldn't. */ | |
5017 | do | |
5018 | { | |
5019 | marked = 0; | |
5020 | for (table = Vweak_hash_tables; !GC_NILP (table); table = h->next_weak) | |
5021 | { | |
5022 | h = XHASH_TABLE (table); | |
5023 | if (h->size & ARRAY_MARK_FLAG) | |
5024 | marked |= sweep_weak_table (h, 0); | |
5025 | } | |
5026 | } | |
5027 | while (marked); | |
d80c6c11 | 5028 | |
a0b581cc | 5029 | /* Remove tables and entries that aren't used. */ |
ac0e96ee | 5030 | for (table = Vweak_hash_tables, used = Qnil; !GC_NILP (table); table = next) |
d80c6c11 | 5031 | { |
d80c6c11 | 5032 | h = XHASH_TABLE (table); |
ac0e96ee | 5033 | next = h->next_weak; |
91f78c99 | 5034 | |
d80c6c11 GM |
5035 | if (h->size & ARRAY_MARK_FLAG) |
5036 | { | |
ac0e96ee | 5037 | /* TABLE is marked as used. Sweep its contents. */ |
d80c6c11 | 5038 | if (XFASTINT (h->count) > 0) |
a0b581cc | 5039 | sweep_weak_table (h, 1); |
ac0e96ee GM |
5040 | |
5041 | /* Add table to the list of used weak hash tables. */ | |
5042 | h->next_weak = used; | |
5043 | used = table; | |
d80c6c11 GM |
5044 | } |
5045 | } | |
ac0e96ee GM |
5046 | |
5047 | Vweak_hash_tables = used; | |
d80c6c11 GM |
5048 | } |
5049 | ||
5050 | ||
5051 | \f | |
5052 | /*********************************************************************** | |
5053 | Hash Code Computation | |
5054 | ***********************************************************************/ | |
5055 | ||
5056 | /* Maximum depth up to which to dive into Lisp structures. */ | |
5057 | ||
5058 | #define SXHASH_MAX_DEPTH 3 | |
5059 | ||
5060 | /* Maximum length up to which to take list and vector elements into | |
5061 | account. */ | |
5062 | ||
5063 | #define SXHASH_MAX_LEN 7 | |
5064 | ||
5065 | /* Combine two integers X and Y for hashing. */ | |
5066 | ||
5067 | #define SXHASH_COMBINE(X, Y) \ | |
ada0fa14 | 5068 | ((((unsigned)(X) << 4) + (((unsigned)(X) >> 24) & 0x0fffffff)) \ |
d80c6c11 GM |
5069 | + (unsigned)(Y)) |
5070 | ||
5071 | ||
cf681889 GM |
5072 | /* Return a hash for string PTR which has length LEN. The hash |
5073 | code returned is guaranteed to fit in a Lisp integer. */ | |
d80c6c11 GM |
5074 | |
5075 | static unsigned | |
5076 | sxhash_string (ptr, len) | |
5077 | unsigned char *ptr; | |
5078 | int len; | |
5079 | { | |
5080 | unsigned char *p = ptr; | |
5081 | unsigned char *end = p + len; | |
5082 | unsigned char c; | |
5083 | unsigned hash = 0; | |
5084 | ||
5085 | while (p != end) | |
5086 | { | |
5087 | c = *p++; | |
5088 | if (c >= 0140) | |
5089 | c -= 40; | |
5090 | hash = ((hash << 3) + (hash >> 28) + c); | |
5091 | } | |
59f953a2 | 5092 | |
854c1a59 | 5093 | return hash & INTMASK; |
d80c6c11 GM |
5094 | } |
5095 | ||
5096 | ||
5097 | /* Return a hash for list LIST. DEPTH is the current depth in the | |
5098 | list. We don't recurse deeper than SXHASH_MAX_DEPTH in it. */ | |
5099 | ||
5100 | static unsigned | |
5101 | sxhash_list (list, depth) | |
5102 | Lisp_Object list; | |
5103 | int depth; | |
5104 | { | |
5105 | unsigned hash = 0; | |
5106 | int i; | |
59f953a2 | 5107 | |
d80c6c11 GM |
5108 | if (depth < SXHASH_MAX_DEPTH) |
5109 | for (i = 0; | |
5110 | CONSP (list) && i < SXHASH_MAX_LEN; | |
5111 | list = XCDR (list), ++i) | |
5112 | { | |
5113 | unsigned hash2 = sxhash (XCAR (list), depth + 1); | |
5114 | hash = SXHASH_COMBINE (hash, hash2); | |
5115 | } | |
5116 | ||
5117 | return hash; | |
5118 | } | |
5119 | ||
5120 | ||
5121 | /* Return a hash for vector VECTOR. DEPTH is the current depth in | |
5122 | the Lisp structure. */ | |
5123 | ||
5124 | static unsigned | |
5125 | sxhash_vector (vec, depth) | |
5126 | Lisp_Object vec; | |
5127 | int depth; | |
5128 | { | |
5129 | unsigned hash = XVECTOR (vec)->size; | |
5130 | int i, n; | |
5131 | ||
5132 | n = min (SXHASH_MAX_LEN, XVECTOR (vec)->size); | |
5133 | for (i = 0; i < n; ++i) | |
5134 | { | |
5135 | unsigned hash2 = sxhash (XVECTOR (vec)->contents[i], depth + 1); | |
5136 | hash = SXHASH_COMBINE (hash, hash2); | |
5137 | } | |
5138 | ||
5139 | return hash; | |
5140 | } | |
5141 | ||
5142 | ||
5143 | /* Return a hash for bool-vector VECTOR. */ | |
5144 | ||
5145 | static unsigned | |
5146 | sxhash_bool_vector (vec) | |
5147 | Lisp_Object vec; | |
5148 | { | |
5149 | unsigned hash = XBOOL_VECTOR (vec)->size; | |
5150 | int i, n; | |
5151 | ||
5152 | n = min (SXHASH_MAX_LEN, XBOOL_VECTOR (vec)->vector_size); | |
5153 | for (i = 0; i < n; ++i) | |
5154 | hash = SXHASH_COMBINE (hash, XBOOL_VECTOR (vec)->data[i]); | |
5155 | ||
5156 | return hash; | |
5157 | } | |
5158 | ||
5159 | ||
5160 | /* Return a hash code for OBJ. DEPTH is the current depth in the Lisp | |
854c1a59 | 5161 | structure. Value is an unsigned integer clipped to INTMASK. */ |
d80c6c11 GM |
5162 | |
5163 | unsigned | |
5164 | sxhash (obj, depth) | |
5165 | Lisp_Object obj; | |
5166 | int depth; | |
5167 | { | |
5168 | unsigned hash; | |
5169 | ||
5170 | if (depth > SXHASH_MAX_DEPTH) | |
5171 | return 0; | |
59f953a2 | 5172 | |
d80c6c11 GM |
5173 | switch (XTYPE (obj)) |
5174 | { | |
5175 | case Lisp_Int: | |
5176 | hash = XUINT (obj); | |
5177 | break; | |
5178 | ||
d80c6c11 GM |
5179 | case Lisp_Misc: |
5180 | hash = XUINT (obj); | |
5181 | break; | |
5182 | ||
32bfb2d5 EZ |
5183 | case Lisp_Symbol: |
5184 | obj = SYMBOL_NAME (obj); | |
5185 | /* Fall through. */ | |
5186 | ||
d80c6c11 | 5187 | case Lisp_String: |
d5db4077 | 5188 | hash = sxhash_string (SDATA (obj), SCHARS (obj)); |
d80c6c11 GM |
5189 | break; |
5190 | ||
5191 | /* This can be everything from a vector to an overlay. */ | |
5192 | case Lisp_Vectorlike: | |
5193 | if (VECTORP (obj)) | |
5194 | /* According to the CL HyperSpec, two arrays are equal only if | |
5195 | they are `eq', except for strings and bit-vectors. In | |
5196 | Emacs, this works differently. We have to compare element | |
5197 | by element. */ | |
5198 | hash = sxhash_vector (obj, depth); | |
5199 | else if (BOOL_VECTOR_P (obj)) | |
5200 | hash = sxhash_bool_vector (obj); | |
5201 | else | |
5202 | /* Others are `equal' if they are `eq', so let's take their | |
5203 | address as hash. */ | |
5204 | hash = XUINT (obj); | |
5205 | break; | |
5206 | ||
5207 | case Lisp_Cons: | |
5208 | hash = sxhash_list (obj, depth); | |
5209 | break; | |
5210 | ||
5211 | case Lisp_Float: | |
5212 | { | |
e84b1dea GM |
5213 | unsigned char *p = (unsigned char *) &XFLOAT_DATA (obj); |
5214 | unsigned char *e = p + sizeof XFLOAT_DATA (obj); | |
d80c6c11 GM |
5215 | for (hash = 0; p < e; ++p) |
5216 | hash = SXHASH_COMBINE (hash, *p); | |
5217 | break; | |
5218 | } | |
5219 | ||
5220 | default: | |
5221 | abort (); | |
5222 | } | |
5223 | ||
854c1a59 | 5224 | return hash & INTMASK; |
d80c6c11 GM |
5225 | } |
5226 | ||
5227 | ||
5228 | \f | |
5229 | /*********************************************************************** | |
5230 | Lisp Interface | |
5231 | ***********************************************************************/ | |
5232 | ||
5233 | ||
5234 | DEFUN ("sxhash", Fsxhash, Ssxhash, 1, 1, 0, | |
e9d8ddc9 MB |
5235 | doc: /* Compute a hash code for OBJ and return it as integer. */) |
5236 | (obj) | |
d80c6c11 GM |
5237 | Lisp_Object obj; |
5238 | { | |
5239 | unsigned hash = sxhash (obj, 0);; | |
5240 | return make_number (hash); | |
5241 | } | |
5242 | ||
5243 | ||
5244 | DEFUN ("make-hash-table", Fmake_hash_table, Smake_hash_table, 0, MANY, 0, | |
e9d8ddc9 | 5245 | doc: /* Create and return a new hash table. |
91f78c99 | 5246 | |
47cebab1 GM |
5247 | Arguments are specified as keyword/argument pairs. The following |
5248 | arguments are defined: | |
5249 | ||
5250 | :test TEST -- TEST must be a symbol that specifies how to compare | |
5251 | keys. Default is `eql'. Predefined are the tests `eq', `eql', and | |
5252 | `equal'. User-supplied test and hash functions can be specified via | |
5253 | `define-hash-table-test'. | |
5254 | ||
5255 | :size SIZE -- A hint as to how many elements will be put in the table. | |
5256 | Default is 65. | |
5257 | ||
5258 | :rehash-size REHASH-SIZE - Indicates how to expand the table when it | |
5259 | fills up. If REHASH-SIZE is an integer, add that many space. If it | |
5260 | is a float, it must be > 1.0, and the new size is computed by | |
5261 | multiplying the old size with that factor. Default is 1.5. | |
5262 | ||
5263 | :rehash-threshold THRESHOLD -- THRESHOLD must a float > 0, and <= 1.0. | |
5264 | Resize the hash table when ratio of the number of entries in the | |
5265 | table. Default is 0.8. | |
5266 | ||
5267 | :weakness WEAK -- WEAK must be one of nil, t, `key', `value', | |
5268 | `key-or-value', or `key-and-value'. If WEAK is not nil, the table | |
5269 | returned is a weak table. Key/value pairs are removed from a weak | |
5270 | hash table when there are no non-weak references pointing to their | |
5271 | key, value, one of key or value, or both key and value, depending on | |
5272 | WEAK. WEAK t is equivalent to `key-and-value'. Default value of WEAK | |
4bf8e2a3 MB |
5273 | is nil. |
5274 | ||
5275 | usage: (make-hash-table &rest KEYWORD-ARGS) */) | |
e9d8ddc9 | 5276 | (nargs, args) |
d80c6c11 GM |
5277 | int nargs; |
5278 | Lisp_Object *args; | |
5279 | { | |
5280 | Lisp_Object test, size, rehash_size, rehash_threshold, weak; | |
5281 | Lisp_Object user_test, user_hash; | |
5282 | char *used; | |
5283 | int i; | |
5284 | ||
5285 | /* The vector `used' is used to keep track of arguments that | |
5286 | have been consumed. */ | |
5287 | used = (char *) alloca (nargs * sizeof *used); | |
5288 | bzero (used, nargs * sizeof *used); | |
5289 | ||
5290 | /* See if there's a `:test TEST' among the arguments. */ | |
5291 | i = get_key_arg (QCtest, nargs, args, used); | |
5292 | test = i < 0 ? Qeql : args[i]; | |
5293 | if (!EQ (test, Qeq) && !EQ (test, Qeql) && !EQ (test, Qequal)) | |
5294 | { | |
5295 | /* See if it is a user-defined test. */ | |
5296 | Lisp_Object prop; | |
59f953a2 | 5297 | |
d80c6c11 | 5298 | prop = Fget (test, Qhash_table_test); |
c1dd95fc | 5299 | if (!CONSP (prop) || !CONSP (XCDR (prop))) |
1fd4c450 | 5300 | Fsignal (Qerror, list2 (build_string ("Invalid hash table test"), |
d80c6c11 | 5301 | test)); |
c1dd95fc RS |
5302 | user_test = XCAR (prop); |
5303 | user_hash = XCAR (XCDR (prop)); | |
d80c6c11 GM |
5304 | } |
5305 | else | |
5306 | user_test = user_hash = Qnil; | |
5307 | ||
5308 | /* See if there's a `:size SIZE' argument. */ | |
5309 | i = get_key_arg (QCsize, nargs, args, used); | |
cf42cb72 SM |
5310 | size = i < 0 ? Qnil : args[i]; |
5311 | if (NILP (size)) | |
5312 | size = make_number (DEFAULT_HASH_SIZE); | |
5313 | else if (!INTEGERP (size) || XINT (size) < 0) | |
d80c6c11 | 5314 | Fsignal (Qerror, |
1fd4c450 | 5315 | list2 (build_string ("Invalid hash table size"), |
d80c6c11 GM |
5316 | size)); |
5317 | ||
5318 | /* Look for `:rehash-size SIZE'. */ | |
5319 | i = get_key_arg (QCrehash_size, nargs, args, used); | |
5320 | rehash_size = i < 0 ? make_float (DEFAULT_REHASH_SIZE) : args[i]; | |
5321 | if (!NUMBERP (rehash_size) | |
5322 | || (INTEGERP (rehash_size) && XINT (rehash_size) <= 0) | |
5323 | || XFLOATINT (rehash_size) <= 1.0) | |
5324 | Fsignal (Qerror, | |
1fd4c450 | 5325 | list2 (build_string ("Invalid hash table rehash size"), |
d80c6c11 | 5326 | rehash_size)); |
59f953a2 | 5327 | |
d80c6c11 GM |
5328 | /* Look for `:rehash-threshold THRESHOLD'. */ |
5329 | i = get_key_arg (QCrehash_threshold, nargs, args, used); | |
5330 | rehash_threshold = i < 0 ? make_float (DEFAULT_REHASH_THRESHOLD) : args[i]; | |
5331 | if (!FLOATP (rehash_threshold) | |
5332 | || XFLOATINT (rehash_threshold) <= 0.0 | |
5333 | || XFLOATINT (rehash_threshold) > 1.0) | |
5334 | Fsignal (Qerror, | |
1fd4c450 | 5335 | list2 (build_string ("Invalid hash table rehash threshold"), |
d80c6c11 | 5336 | rehash_threshold)); |
59f953a2 | 5337 | |
ee0403b3 GM |
5338 | /* Look for `:weakness WEAK'. */ |
5339 | i = get_key_arg (QCweakness, nargs, args, used); | |
d80c6c11 | 5340 | weak = i < 0 ? Qnil : args[i]; |
ec504e6f GM |
5341 | if (EQ (weak, Qt)) |
5342 | weak = Qkey_and_value; | |
d80c6c11 | 5343 | if (!NILP (weak) |
f899c503 | 5344 | && !EQ (weak, Qkey) |
ec504e6f GM |
5345 | && !EQ (weak, Qvalue) |
5346 | && !EQ (weak, Qkey_or_value) | |
5347 | && !EQ (weak, Qkey_and_value)) | |
1fd4c450 | 5348 | Fsignal (Qerror, list2 (build_string ("Invalid hash table weakness"), |
d80c6c11 | 5349 | weak)); |
59f953a2 | 5350 | |
d80c6c11 GM |
5351 | /* Now, all args should have been used up, or there's a problem. */ |
5352 | for (i = 0; i < nargs; ++i) | |
5353 | if (!used[i]) | |
5354 | Fsignal (Qerror, | |
5355 | list2 (build_string ("Invalid argument list"), args[i])); | |
5356 | ||
5357 | return make_hash_table (test, size, rehash_size, rehash_threshold, weak, | |
5358 | user_test, user_hash); | |
5359 | } | |
5360 | ||
5361 | ||
f899c503 | 5362 | DEFUN ("copy-hash-table", Fcopy_hash_table, Scopy_hash_table, 1, 1, 0, |
e9d8ddc9 MB |
5363 | doc: /* Return a copy of hash table TABLE. */) |
5364 | (table) | |
f899c503 GM |
5365 | Lisp_Object table; |
5366 | { | |
5367 | return copy_hash_table (check_hash_table (table)); | |
5368 | } | |
5369 | ||
5370 | ||
d80c6c11 | 5371 | DEFUN ("hash-table-count", Fhash_table_count, Shash_table_count, 1, 1, 0, |
e9d8ddc9 MB |
5372 | doc: /* Return the number of elements in TABLE. */) |
5373 | (table) | |
47cebab1 | 5374 | Lisp_Object table; |
d80c6c11 GM |
5375 | { |
5376 | return check_hash_table (table)->count; | |
5377 | } | |
5378 | ||
59f953a2 | 5379 | |
d80c6c11 GM |
5380 | DEFUN ("hash-table-rehash-size", Fhash_table_rehash_size, |
5381 | Shash_table_rehash_size, 1, 1, 0, | |
e9d8ddc9 MB |
5382 | doc: /* Return the current rehash size of TABLE. */) |
5383 | (table) | |
47cebab1 | 5384 | Lisp_Object table; |
d80c6c11 GM |
5385 | { |
5386 | return check_hash_table (table)->rehash_size; | |
5387 | } | |
59f953a2 | 5388 | |
d80c6c11 GM |
5389 | |
5390 | DEFUN ("hash-table-rehash-threshold", Fhash_table_rehash_threshold, | |
5391 | Shash_table_rehash_threshold, 1, 1, 0, | |
e9d8ddc9 MB |
5392 | doc: /* Return the current rehash threshold of TABLE. */) |
5393 | (table) | |
47cebab1 | 5394 | Lisp_Object table; |
d80c6c11 GM |
5395 | { |
5396 | return check_hash_table (table)->rehash_threshold; | |
5397 | } | |
59f953a2 | 5398 | |
d80c6c11 GM |
5399 | |
5400 | DEFUN ("hash-table-size", Fhash_table_size, Shash_table_size, 1, 1, 0, | |
e9d8ddc9 | 5401 | doc: /* Return the size of TABLE. |
47cebab1 GM |
5402 | The size can be used as an argument to `make-hash-table' to create |
5403 | a hash table than can hold as many elements of TABLE holds | |
e9d8ddc9 MB |
5404 | without need for resizing. */) |
5405 | (table) | |
d80c6c11 GM |
5406 | Lisp_Object table; |
5407 | { | |
5408 | struct Lisp_Hash_Table *h = check_hash_table (table); | |
5409 | return make_number (HASH_TABLE_SIZE (h)); | |
5410 | } | |
59f953a2 | 5411 | |
d80c6c11 GM |
5412 | |
5413 | DEFUN ("hash-table-test", Fhash_table_test, Shash_table_test, 1, 1, 0, | |
e9d8ddc9 MB |
5414 | doc: /* Return the test TABLE uses. */) |
5415 | (table) | |
47cebab1 | 5416 | Lisp_Object table; |
d80c6c11 GM |
5417 | { |
5418 | return check_hash_table (table)->test; | |
5419 | } | |
5420 | ||
59f953a2 | 5421 | |
e84b1dea GM |
5422 | DEFUN ("hash-table-weakness", Fhash_table_weakness, Shash_table_weakness, |
5423 | 1, 1, 0, | |
e9d8ddc9 MB |
5424 | doc: /* Return the weakness of TABLE. */) |
5425 | (table) | |
47cebab1 | 5426 | Lisp_Object table; |
d80c6c11 GM |
5427 | { |
5428 | return check_hash_table (table)->weak; | |
5429 | } | |
5430 | ||
59f953a2 | 5431 | |
d80c6c11 | 5432 | DEFUN ("hash-table-p", Fhash_table_p, Shash_table_p, 1, 1, 0, |
e9d8ddc9 MB |
5433 | doc: /* Return t if OBJ is a Lisp hash table object. */) |
5434 | (obj) | |
d80c6c11 GM |
5435 | Lisp_Object obj; |
5436 | { | |
5437 | return HASH_TABLE_P (obj) ? Qt : Qnil; | |
5438 | } | |
5439 | ||
5440 | ||
5441 | DEFUN ("clrhash", Fclrhash, Sclrhash, 1, 1, 0, | |
e9d8ddc9 MB |
5442 | doc: /* Clear hash table TABLE. */) |
5443 | (table) | |
d80c6c11 GM |
5444 | Lisp_Object table; |
5445 | { | |
5446 | hash_clear (check_hash_table (table)); | |
5447 | return Qnil; | |
5448 | } | |
5449 | ||
5450 | ||
5451 | DEFUN ("gethash", Fgethash, Sgethash, 2, 3, 0, | |
e9d8ddc9 MB |
5452 | doc: /* Look up KEY in TABLE and return its associated value. |
5453 | If KEY is not found, return DFLT which defaults to nil. */) | |
5454 | (key, table, dflt) | |
68c45bf0 | 5455 | Lisp_Object key, table, dflt; |
d80c6c11 GM |
5456 | { |
5457 | struct Lisp_Hash_Table *h = check_hash_table (table); | |
5458 | int i = hash_lookup (h, key, NULL); | |
5459 | return i >= 0 ? HASH_VALUE (h, i) : dflt; | |
5460 | } | |
5461 | ||
5462 | ||
5463 | DEFUN ("puthash", Fputhash, Sputhash, 3, 3, 0, | |
e9d8ddc9 | 5464 | doc: /* Associate KEY with VALUE in hash table TABLE. |
47cebab1 | 5465 | If KEY is already present in table, replace its current value with |
e9d8ddc9 MB |
5466 | VALUE. */) |
5467 | (key, value, table) | |
1fffe870 | 5468 | Lisp_Object key, value, table; |
d80c6c11 GM |
5469 | { |
5470 | struct Lisp_Hash_Table *h = check_hash_table (table); | |
5471 | int i; | |
5472 | unsigned hash; | |
5473 | ||
5474 | i = hash_lookup (h, key, &hash); | |
5475 | if (i >= 0) | |
5476 | HASH_VALUE (h, i) = value; | |
5477 | else | |
5478 | hash_put (h, key, value, hash); | |
59f953a2 | 5479 | |
d9c4f922 | 5480 | return value; |
d80c6c11 GM |
5481 | } |
5482 | ||
5483 | ||
5484 | DEFUN ("remhash", Fremhash, Sremhash, 2, 2, 0, | |
e9d8ddc9 MB |
5485 | doc: /* Remove KEY from TABLE. */) |
5486 | (key, table) | |
1fffe870 | 5487 | Lisp_Object key, table; |
d80c6c11 GM |
5488 | { |
5489 | struct Lisp_Hash_Table *h = check_hash_table (table); | |
5490 | hash_remove (h, key); | |
5491 | return Qnil; | |
5492 | } | |
5493 | ||
5494 | ||
5495 | DEFUN ("maphash", Fmaphash, Smaphash, 2, 2, 0, | |
e9d8ddc9 | 5496 | doc: /* Call FUNCTION for all entries in hash table TABLE. |
c14ec135 | 5497 | FUNCTION is called with two arguments, KEY and VALUE. */) |
e9d8ddc9 | 5498 | (function, table) |
d80c6c11 GM |
5499 | Lisp_Object function, table; |
5500 | { | |
5501 | struct Lisp_Hash_Table *h = check_hash_table (table); | |
5502 | Lisp_Object args[3]; | |
5503 | int i; | |
5504 | ||
5505 | for (i = 0; i < HASH_TABLE_SIZE (h); ++i) | |
5506 | if (!NILP (HASH_HASH (h, i))) | |
5507 | { | |
5508 | args[0] = function; | |
5509 | args[1] = HASH_KEY (h, i); | |
5510 | args[2] = HASH_VALUE (h, i); | |
5511 | Ffuncall (3, args); | |
5512 | } | |
59f953a2 | 5513 | |
d80c6c11 GM |
5514 | return Qnil; |
5515 | } | |
5516 | ||
5517 | ||
5518 | DEFUN ("define-hash-table-test", Fdefine_hash_table_test, | |
5519 | Sdefine_hash_table_test, 3, 3, 0, | |
e9d8ddc9 | 5520 | doc: /* Define a new hash table test with name NAME, a symbol. |
91f78c99 | 5521 | |
47cebab1 GM |
5522 | In hash tables created with NAME specified as test, use TEST to |
5523 | compare keys, and HASH for computing hash codes of keys. | |
5524 | ||
5525 | TEST must be a function taking two arguments and returning non-nil if | |
5526 | both arguments are the same. HASH must be a function taking one | |
5527 | argument and return an integer that is the hash code of the argument. | |
5528 | Hash code computation should use the whole value range of integers, | |
e9d8ddc9 MB |
5529 | including negative integers. */) |
5530 | (name, test, hash) | |
d80c6c11 GM |
5531 | Lisp_Object name, test, hash; |
5532 | { | |
5533 | return Fput (name, Qhash_table_test, list2 (test, hash)); | |
5534 | } | |
5535 | ||
a3b210c4 | 5536 | |
57916a7a | 5537 | \f |
5c302da4 GM |
5538 | /************************************************************************ |
5539 | MD5 | |
5540 | ************************************************************************/ | |
5541 | ||
57916a7a | 5542 | #include "md5.h" |
5c302da4 | 5543 | #include "coding.h" |
57916a7a GM |
5544 | |
5545 | DEFUN ("md5", Fmd5, Smd5, 1, 5, 0, | |
e9d8ddc9 | 5546 | doc: /* Return MD5 message digest of OBJECT, a buffer or string. |
91f78c99 | 5547 | |
47cebab1 GM |
5548 | A message digest is a cryptographic checksum of a document, and the |
5549 | algorithm to calculate it is defined in RFC 1321. | |
5550 | ||
5551 | The two optional arguments START and END are character positions | |
5552 | specifying for which part of OBJECT the message digest should be | |
5553 | computed. If nil or omitted, the digest is computed for the whole | |
5554 | OBJECT. | |
5555 | ||
5556 | The MD5 message digest is computed from the result of encoding the | |
5557 | text in a coding system, not directly from the internal Emacs form of | |
5558 | the text. The optional fourth argument CODING-SYSTEM specifies which | |
5559 | coding system to encode the text with. It should be the same coding | |
5560 | system that you used or will use when actually writing the text into a | |
5561 | file. | |
5562 | ||
5563 | If CODING-SYSTEM is nil or omitted, the default depends on OBJECT. If | |
5564 | OBJECT is a buffer, the default for CODING-SYSTEM is whatever coding | |
5565 | system would be chosen by default for writing this text into a file. | |
5566 | ||
5567 | If OBJECT is a string, the most preferred coding system (see the | |
5568 | command `prefer-coding-system') is used. | |
5569 | ||
5570 | If NOERROR is non-nil, silently assume the `raw-text' coding if the | |
e9d8ddc9 MB |
5571 | guesswork fails. Normally, an error is signaled in such case. */) |
5572 | (object, start, end, coding_system, noerror) | |
57916a7a GM |
5573 | Lisp_Object object, start, end, coding_system, noerror; |
5574 | { | |
5575 | unsigned char digest[16]; | |
5576 | unsigned char value[33]; | |
5577 | int i; | |
5578 | int size; | |
5579 | int size_byte = 0; | |
5580 | int start_char = 0, end_char = 0; | |
5581 | int start_byte = 0, end_byte = 0; | |
5582 | register int b, e; | |
5583 | register struct buffer *bp; | |
5584 | int temp; | |
5585 | ||
5c302da4 | 5586 | if (STRINGP (object)) |
57916a7a GM |
5587 | { |
5588 | if (NILP (coding_system)) | |
5589 | { | |
5c302da4 | 5590 | /* Decide the coding-system to encode the data with. */ |
57916a7a | 5591 | |
5c302da4 GM |
5592 | if (STRING_MULTIBYTE (object)) |
5593 | /* use default, we can't guess correct value */ | |
f5c1dd0d | 5594 | coding_system = SYMBOL_VALUE (XCAR (Vcoding_category_list)); |
91f78c99 | 5595 | else |
5c302da4 | 5596 | coding_system = Qraw_text; |
57916a7a | 5597 | } |
91f78c99 | 5598 | |
5c302da4 | 5599 | if (NILP (Fcoding_system_p (coding_system))) |
57916a7a | 5600 | { |
5c302da4 | 5601 | /* Invalid coding system. */ |
91f78c99 | 5602 | |
5c302da4 GM |
5603 | if (!NILP (noerror)) |
5604 | coding_system = Qraw_text; | |
5605 | else | |
5606 | while (1) | |
5607 | Fsignal (Qcoding_system_error, Fcons (coding_system, Qnil)); | |
57916a7a GM |
5608 | } |
5609 | ||
5c302da4 GM |
5610 | if (STRING_MULTIBYTE (object)) |
5611 | object = code_convert_string1 (object, coding_system, Qnil, 1); | |
5612 | ||
d5db4077 KR |
5613 | size = SCHARS (object); |
5614 | size_byte = SBYTES (object); | |
57916a7a GM |
5615 | |
5616 | if (!NILP (start)) | |
5617 | { | |
b7826503 | 5618 | CHECK_NUMBER (start); |
57916a7a GM |
5619 | |
5620 | start_char = XINT (start); | |
5621 | ||
5622 | if (start_char < 0) | |
5623 | start_char += size; | |
5624 | ||
5625 | start_byte = string_char_to_byte (object, start_char); | |
5626 | } | |
5627 | ||
5628 | if (NILP (end)) | |
5629 | { | |
5630 | end_char = size; | |
5631 | end_byte = size_byte; | |
5632 | } | |
5633 | else | |
5634 | { | |
b7826503 | 5635 | CHECK_NUMBER (end); |
91f78c99 | 5636 | |
57916a7a GM |
5637 | end_char = XINT (end); |
5638 | ||
5639 | if (end_char < 0) | |
5640 | end_char += size; | |
91f78c99 | 5641 | |
57916a7a GM |
5642 | end_byte = string_char_to_byte (object, end_char); |
5643 | } | |
91f78c99 | 5644 | |
57916a7a GM |
5645 | if (!(0 <= start_char && start_char <= end_char && end_char <= size)) |
5646 | args_out_of_range_3 (object, make_number (start_char), | |
5647 | make_number (end_char)); | |
5648 | } | |
5649 | else | |
5650 | { | |
fe905025 KH |
5651 | struct buffer *prev = current_buffer; |
5652 | ||
5653 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
5654 | ||
b7826503 | 5655 | CHECK_BUFFER (object); |
57916a7a GM |
5656 | |
5657 | bp = XBUFFER (object); | |
fe905025 KH |
5658 | if (bp != current_buffer) |
5659 | set_buffer_internal (bp); | |
91f78c99 | 5660 | |
57916a7a | 5661 | if (NILP (start)) |
fe905025 | 5662 | b = BEGV; |
57916a7a GM |
5663 | else |
5664 | { | |
b7826503 | 5665 | CHECK_NUMBER_COERCE_MARKER (start); |
57916a7a GM |
5666 | b = XINT (start); |
5667 | } | |
5668 | ||
5669 | if (NILP (end)) | |
fe905025 | 5670 | e = ZV; |
57916a7a GM |
5671 | else |
5672 | { | |
b7826503 | 5673 | CHECK_NUMBER_COERCE_MARKER (end); |
57916a7a GM |
5674 | e = XINT (end); |
5675 | } | |
91f78c99 | 5676 | |
57916a7a GM |
5677 | if (b > e) |
5678 | temp = b, b = e, e = temp; | |
91f78c99 | 5679 | |
fe905025 | 5680 | if (!(BEGV <= b && e <= ZV)) |
57916a7a | 5681 | args_out_of_range (start, end); |
91f78c99 | 5682 | |
57916a7a GM |
5683 | if (NILP (coding_system)) |
5684 | { | |
91f78c99 | 5685 | /* Decide the coding-system to encode the data with. |
5c302da4 GM |
5686 | See fileio.c:Fwrite-region */ |
5687 | ||
5688 | if (!NILP (Vcoding_system_for_write)) | |
5689 | coding_system = Vcoding_system_for_write; | |
5690 | else | |
5691 | { | |
5692 | int force_raw_text = 0; | |
5693 | ||
5694 | coding_system = XBUFFER (object)->buffer_file_coding_system; | |
5695 | if (NILP (coding_system) | |
5696 | || NILP (Flocal_variable_p (Qbuffer_file_coding_system, Qnil))) | |
5697 | { | |
5698 | coding_system = Qnil; | |
5699 | if (NILP (current_buffer->enable_multibyte_characters)) | |
5700 | force_raw_text = 1; | |
5701 | } | |
5702 | ||
5703 | if (NILP (coding_system) && !NILP (Fbuffer_file_name(object))) | |
5704 | { | |
5705 | /* Check file-coding-system-alist. */ | |
5706 | Lisp_Object args[4], val; | |
91f78c99 | 5707 | |
5c302da4 GM |
5708 | args[0] = Qwrite_region; args[1] = start; args[2] = end; |
5709 | args[3] = Fbuffer_file_name(object); | |
5710 | val = Ffind_operation_coding_system (4, args); | |
5711 | if (CONSP (val) && !NILP (XCDR (val))) | |
5712 | coding_system = XCDR (val); | |
5713 | } | |
5714 | ||
5715 | if (NILP (coding_system) | |
5716 | && !NILP (XBUFFER (object)->buffer_file_coding_system)) | |
5717 | { | |
5718 | /* If we still have not decided a coding system, use the | |
5719 | default value of buffer-file-coding-system. */ | |
5720 | coding_system = XBUFFER (object)->buffer_file_coding_system; | |
5721 | } | |
5722 | ||
5723 | if (!force_raw_text | |
5724 | && !NILP (Ffboundp (Vselect_safe_coding_system_function))) | |
5725 | /* Confirm that VAL can surely encode the current region. */ | |
1e59646d | 5726 | coding_system = call4 (Vselect_safe_coding_system_function, |
70da6a76 | 5727 | make_number (b), make_number (e), |
1e59646d | 5728 | coding_system, Qnil); |
5c302da4 GM |
5729 | |
5730 | if (force_raw_text) | |
5731 | coding_system = Qraw_text; | |
5732 | } | |
5733 | ||
5734 | if (NILP (Fcoding_system_p (coding_system))) | |
57916a7a | 5735 | { |
5c302da4 GM |
5736 | /* Invalid coding system. */ |
5737 | ||
5738 | if (!NILP (noerror)) | |
5739 | coding_system = Qraw_text; | |
5740 | else | |
5741 | while (1) | |
5742 | Fsignal (Qcoding_system_error, Fcons (coding_system, Qnil)); | |
57916a7a GM |
5743 | } |
5744 | } | |
5745 | ||
5746 | object = make_buffer_string (b, e, 0); | |
fe905025 KH |
5747 | if (prev != current_buffer) |
5748 | set_buffer_internal (prev); | |
5749 | /* Discard the unwind protect for recovering the current | |
5750 | buffer. */ | |
5751 | specpdl_ptr--; | |
57916a7a GM |
5752 | |
5753 | if (STRING_MULTIBYTE (object)) | |
5754 | object = code_convert_string1 (object, coding_system, Qnil, 1); | |
5755 | } | |
5756 | ||
91f78c99 FP |
5757 | md5_buffer (SDATA (object) + start_byte, |
5758 | SBYTES (object) - (size_byte - end_byte), | |
57916a7a GM |
5759 | digest); |
5760 | ||
5761 | for (i = 0; i < 16; i++) | |
5c302da4 | 5762 | sprintf (&value[2 * i], "%02x", digest[i]); |
57916a7a GM |
5763 | value[32] = '\0'; |
5764 | ||
5765 | return make_string (value, 32); | |
5766 | } | |
5767 | ||
24c129e4 | 5768 | \f |
dfcf069d | 5769 | void |
7b863bd5 JB |
5770 | syms_of_fns () |
5771 | { | |
d80c6c11 GM |
5772 | /* Hash table stuff. */ |
5773 | Qhash_table_p = intern ("hash-table-p"); | |
5774 | staticpro (&Qhash_table_p); | |
5775 | Qeq = intern ("eq"); | |
5776 | staticpro (&Qeq); | |
5777 | Qeql = intern ("eql"); | |
5778 | staticpro (&Qeql); | |
5779 | Qequal = intern ("equal"); | |
5780 | staticpro (&Qequal); | |
5781 | QCtest = intern (":test"); | |
5782 | staticpro (&QCtest); | |
5783 | QCsize = intern (":size"); | |
5784 | staticpro (&QCsize); | |
5785 | QCrehash_size = intern (":rehash-size"); | |
5786 | staticpro (&QCrehash_size); | |
5787 | QCrehash_threshold = intern (":rehash-threshold"); | |
5788 | staticpro (&QCrehash_threshold); | |
ee0403b3 GM |
5789 | QCweakness = intern (":weakness"); |
5790 | staticpro (&QCweakness); | |
f899c503 GM |
5791 | Qkey = intern ("key"); |
5792 | staticpro (&Qkey); | |
5793 | Qvalue = intern ("value"); | |
5794 | staticpro (&Qvalue); | |
d80c6c11 GM |
5795 | Qhash_table_test = intern ("hash-table-test"); |
5796 | staticpro (&Qhash_table_test); | |
ec504e6f GM |
5797 | Qkey_or_value = intern ("key-or-value"); |
5798 | staticpro (&Qkey_or_value); | |
5799 | Qkey_and_value = intern ("key-and-value"); | |
5800 | staticpro (&Qkey_and_value); | |
d80c6c11 GM |
5801 | |
5802 | defsubr (&Ssxhash); | |
5803 | defsubr (&Smake_hash_table); | |
f899c503 | 5804 | defsubr (&Scopy_hash_table); |
d80c6c11 GM |
5805 | defsubr (&Shash_table_count); |
5806 | defsubr (&Shash_table_rehash_size); | |
5807 | defsubr (&Shash_table_rehash_threshold); | |
5808 | defsubr (&Shash_table_size); | |
5809 | defsubr (&Shash_table_test); | |
e84b1dea | 5810 | defsubr (&Shash_table_weakness); |
d80c6c11 GM |
5811 | defsubr (&Shash_table_p); |
5812 | defsubr (&Sclrhash); | |
5813 | defsubr (&Sgethash); | |
5814 | defsubr (&Sputhash); | |
5815 | defsubr (&Sremhash); | |
5816 | defsubr (&Smaphash); | |
5817 | defsubr (&Sdefine_hash_table_test); | |
59f953a2 | 5818 | |
7b863bd5 JB |
5819 | Qstring_lessp = intern ("string-lessp"); |
5820 | staticpro (&Qstring_lessp); | |
68732608 RS |
5821 | Qprovide = intern ("provide"); |
5822 | staticpro (&Qprovide); | |
5823 | Qrequire = intern ("require"); | |
5824 | staticpro (&Qrequire); | |
0ce830bc RS |
5825 | Qyes_or_no_p_history = intern ("yes-or-no-p-history"); |
5826 | staticpro (&Qyes_or_no_p_history); | |
eb4ffa4e RS |
5827 | Qcursor_in_echo_area = intern ("cursor-in-echo-area"); |
5828 | staticpro (&Qcursor_in_echo_area); | |
b4f334f7 KH |
5829 | Qwidget_type = intern ("widget-type"); |
5830 | staticpro (&Qwidget_type); | |
7b863bd5 | 5831 | |
09ab3c3b KH |
5832 | staticpro (&string_char_byte_cache_string); |
5833 | string_char_byte_cache_string = Qnil; | |
5834 | ||
1f79789d RS |
5835 | require_nesting_list = Qnil; |
5836 | staticpro (&require_nesting_list); | |
5837 | ||
52a9879b RS |
5838 | Fset (Qyes_or_no_p_history, Qnil); |
5839 | ||
e9d8ddc9 MB |
5840 | DEFVAR_LISP ("features", &Vfeatures, |
5841 | doc: /* A list of symbols which are the features of the executing emacs. | |
47cebab1 | 5842 | Used by `featurep' and `require', and altered by `provide'. */); |
780a7814 | 5843 | Vfeatures = Fcons (intern ("emacs"), Qnil); |
65550192 SM |
5844 | Qsubfeatures = intern ("subfeatures"); |
5845 | staticpro (&Qsubfeatures); | |
7b863bd5 | 5846 | |
dec002ca DL |
5847 | #ifdef HAVE_LANGINFO_CODESET |
5848 | Qcodeset = intern ("codeset"); | |
5849 | staticpro (&Qcodeset); | |
5850 | Qdays = intern ("days"); | |
5851 | staticpro (&Qdays); | |
5852 | Qmonths = intern ("months"); | |
5853 | staticpro (&Qmonths); | |
5854 | Qpaper = intern ("paper"); | |
5855 | staticpro (&Qpaper); | |
5856 | #endif /* HAVE_LANGINFO_CODESET */ | |
5857 | ||
e9d8ddc9 MB |
5858 | DEFVAR_BOOL ("use-dialog-box", &use_dialog_box, |
5859 | doc: /* *Non-nil means mouse commands use dialog boxes to ask questions. | |
436fa78b | 5860 | This applies to `y-or-n-p' and `yes-or-no-p' questions asked by commands |
47cebab1 | 5861 | invoked by mouse clicks and mouse menu items. */); |
bdd8d692 RS |
5862 | use_dialog_box = 1; |
5863 | ||
03d6484e JD |
5864 | DEFVAR_BOOL ("use-file-dialog", &use_file_dialog, |
5865 | doc: /* *Non-nil means mouse commands use a file dialog to ask for files. | |
5866 | This applies to commands from menus and tool bar buttons. The value of | |
5867 | `use-dialog-box' takes precedence over this variable, so a file dialog is only | |
5868 | used if both `use-dialog-box' and this variable are non-nil. */); | |
5869 | use_file_dialog = 1; | |
0dc72b11 | 5870 | |
7b863bd5 JB |
5871 | defsubr (&Sidentity); |
5872 | defsubr (&Srandom); | |
5873 | defsubr (&Slength); | |
5a30fab8 | 5874 | defsubr (&Ssafe_length); |
026f59ce | 5875 | defsubr (&Sstring_bytes); |
7b863bd5 | 5876 | defsubr (&Sstring_equal); |
0e1e9f8d | 5877 | defsubr (&Scompare_strings); |
7b863bd5 JB |
5878 | defsubr (&Sstring_lessp); |
5879 | defsubr (&Sappend); | |
5880 | defsubr (&Sconcat); | |
5881 | defsubr (&Svconcat); | |
5882 | defsubr (&Scopy_sequence); | |
09ab3c3b KH |
5883 | defsubr (&Sstring_make_multibyte); |
5884 | defsubr (&Sstring_make_unibyte); | |
6d475204 RS |
5885 | defsubr (&Sstring_as_multibyte); |
5886 | defsubr (&Sstring_as_unibyte); | |
2df18cdb | 5887 | defsubr (&Sstring_to_multibyte); |
7b863bd5 JB |
5888 | defsubr (&Scopy_alist); |
5889 | defsubr (&Ssubstring); | |
aebf4d42 | 5890 | defsubr (&Ssubstring_no_properties); |
7b863bd5 JB |
5891 | defsubr (&Snthcdr); |
5892 | defsubr (&Snth); | |
5893 | defsubr (&Selt); | |
5894 | defsubr (&Smember); | |
5895 | defsubr (&Smemq); | |
5896 | defsubr (&Sassq); | |
5897 | defsubr (&Sassoc); | |
5898 | defsubr (&Srassq); | |
0fb5a19c | 5899 | defsubr (&Srassoc); |
7b863bd5 | 5900 | defsubr (&Sdelq); |
ca8dd546 | 5901 | defsubr (&Sdelete); |
7b863bd5 JB |
5902 | defsubr (&Snreverse); |
5903 | defsubr (&Sreverse); | |
5904 | defsubr (&Ssort); | |
be9d483d | 5905 | defsubr (&Splist_get); |
7b863bd5 | 5906 | defsubr (&Sget); |
be9d483d | 5907 | defsubr (&Splist_put); |
7b863bd5 | 5908 | defsubr (&Sput); |
aebf4d42 RS |
5909 | defsubr (&Slax_plist_get); |
5910 | defsubr (&Slax_plist_put); | |
95f8c3b9 | 5911 | defsubr (&Seql); |
7b863bd5 | 5912 | defsubr (&Sequal); |
6054c582 | 5913 | defsubr (&Sequal_including_properties); |
7b863bd5 | 5914 | defsubr (&Sfillarray); |
85cad579 | 5915 | defsubr (&Sclear_string); |
999de246 | 5916 | defsubr (&Schar_table_subtype); |
e03f7933 RS |
5917 | defsubr (&Schar_table_parent); |
5918 | defsubr (&Sset_char_table_parent); | |
5919 | defsubr (&Schar_table_extra_slot); | |
5920 | defsubr (&Sset_char_table_extra_slot); | |
999de246 | 5921 | defsubr (&Schar_table_range); |
e03f7933 | 5922 | defsubr (&Sset_char_table_range); |
e1335ba2 | 5923 | defsubr (&Sset_char_table_default); |
52ef6c89 | 5924 | defsubr (&Soptimize_char_table); |
e03f7933 | 5925 | defsubr (&Smap_char_table); |
7b863bd5 JB |
5926 | defsubr (&Snconc); |
5927 | defsubr (&Smapcar); | |
5c6740c9 | 5928 | defsubr (&Smapc); |
7b863bd5 JB |
5929 | defsubr (&Smapconcat); |
5930 | defsubr (&Sy_or_n_p); | |
5931 | defsubr (&Syes_or_no_p); | |
5932 | defsubr (&Sload_average); | |
5933 | defsubr (&Sfeaturep); | |
5934 | defsubr (&Srequire); | |
5935 | defsubr (&Sprovide); | |
a5254817 | 5936 | defsubr (&Splist_member); |
b4f334f7 KH |
5937 | defsubr (&Swidget_put); |
5938 | defsubr (&Swidget_get); | |
5939 | defsubr (&Swidget_apply); | |
24c129e4 KH |
5940 | defsubr (&Sbase64_encode_region); |
5941 | defsubr (&Sbase64_decode_region); | |
5942 | defsubr (&Sbase64_encode_string); | |
5943 | defsubr (&Sbase64_decode_string); | |
57916a7a | 5944 | defsubr (&Smd5); |
d68beb2f | 5945 | defsubr (&Slocale_info); |
7b863bd5 | 5946 | } |
d80c6c11 GM |
5947 | |
5948 | ||
5949 | void | |
5950 | init_fns () | |
5951 | { | |
5952 | Vweak_hash_tables = Qnil; | |
5953 | } | |
ab5796a9 MB |
5954 | |
5955 | /* arch-tag: 787f8219-5b74-46bd-8469-7e1cc475fa31 | |
5956 | (do not change this comment) */ |