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