|
0
|
1 /* Random utility Lisp functions.
|
|
|
2 Copyright (C) 1985, 86, 87, 93, 94, 95 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995, 1996 Ben Wing.
|
|
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Mule 2.0, FSF 19.30. */
|
|
|
23
|
|
|
24 /* This file has been Mule-ized. */
|
|
|
25
|
|
|
26 /* Note: FSF 19.30 has bool vectors. We have bit vectors. */
|
|
|
27
|
|
|
28 /* Hacked on for Mule by Ben Wing, December 1994, January 1995. */
|
|
|
29
|
|
|
30 #include <config.h>
|
|
|
31
|
|
|
32 /* Note on some machines this defines `vector' as a typedef,
|
|
|
33 so make sure we don't use that name in this file. */
|
|
|
34 #undef vector
|
|
|
35 #define vector *****
|
|
|
36
|
|
|
37 #include "lisp.h"
|
|
|
38
|
|
|
39 #include "buffer.h"
|
|
|
40 #include "bytecode.h"
|
|
|
41 #include "commands.h"
|
|
|
42 #include "device.h"
|
|
|
43 #include "events.h"
|
|
|
44 #include "extents.h"
|
|
|
45 #include "frame.h"
|
|
|
46 #include "systime.h"
|
|
|
47
|
|
140
|
48 /* NOTE: This symbol is also used in lread.c */
|
|
|
49 #define FEATUREP_SYNTAX
|
|
|
50
|
|
0
|
51 Lisp_Object Qstring_lessp;
|
|
|
52 Lisp_Object Qidentity;
|
|
|
53
|
|
|
54 static Lisp_Object mark_bit_vector (Lisp_Object, void (*) (Lisp_Object));
|
|
|
55 static void print_bit_vector (Lisp_Object, Lisp_Object, int);
|
|
|
56 static int bit_vector_equal (Lisp_Object o1, Lisp_Object o2, int depth);
|
|
|
57 static unsigned long bit_vector_hash (Lisp_Object obj, int depth);
|
|
|
58 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("bit-vector", bit_vector,
|
|
|
59 mark_bit_vector, print_bit_vector, 0,
|
|
|
60 bit_vector_equal, bit_vector_hash,
|
|
|
61 struct Lisp_Bit_Vector);
|
|
|
62
|
|
|
63 static Lisp_Object
|
|
|
64 mark_bit_vector (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
65 {
|
|
149
|
66 return Qnil;
|
|
0
|
67 }
|
|
|
68
|
|
|
69 static void
|
|
|
70 print_bit_vector (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
71 {
|
|
|
72 int i;
|
|
|
73 struct Lisp_Bit_Vector *v = XBIT_VECTOR (obj);
|
|
|
74 int len = bit_vector_length (v);
|
|
|
75 int last = len;
|
|
|
76
|
|
|
77 if (INTP (Vprint_length))
|
|
|
78 last = min (len, XINT (Vprint_length));
|
|
|
79 write_c_string ("#*", printcharfun);
|
|
|
80 for (i = 0; i < last; i++)
|
|
|
81 {
|
|
|
82 if (bit_vector_bit (v, i))
|
|
|
83 write_c_string ("1", printcharfun);
|
|
|
84 else
|
|
|
85 write_c_string ("0", printcharfun);
|
|
|
86 }
|
|
|
87
|
|
|
88 if (last != len)
|
|
|
89 write_c_string ("...", printcharfun);
|
|
|
90 }
|
|
|
91
|
|
|
92 static int
|
|
|
93 bit_vector_equal (Lisp_Object o1, Lisp_Object o2, int depth)
|
|
|
94 {
|
|
|
95 struct Lisp_Bit_Vector *v1 = XBIT_VECTOR (o1);
|
|
|
96 struct Lisp_Bit_Vector *v2 = XBIT_VECTOR (o2);
|
|
|
97
|
|
|
98 if (bit_vector_length (v1) != bit_vector_length (v2))
|
|
|
99 return 0;
|
|
|
100
|
|
|
101 return !memcmp (v1->bits, v2->bits,
|
|
|
102 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v1)) *
|
|
|
103 sizeof (long));
|
|
|
104 }
|
|
|
105
|
|
|
106 static unsigned long
|
|
|
107 bit_vector_hash (Lisp_Object obj, int depth)
|
|
|
108 {
|
|
|
109 struct Lisp_Bit_Vector *v = XBIT_VECTOR (obj);
|
|
|
110 return HASH2 (bit_vector_length (v),
|
|
|
111 memory_hash (v->bits,
|
|
|
112 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v)) *
|
|
|
113 sizeof (long)));
|
|
|
114 }
|
|
|
115
|
|
20
|
116 DEFUN ("identity", Fidentity, 1, 1, 0, /*
|
|
0
|
117 Return the argument unchanged.
|
|
20
|
118 */
|
|
|
119 (arg))
|
|
0
|
120 {
|
|
|
121 return arg;
|
|
|
122 }
|
|
|
123
|
|
|
124 extern long get_random (void);
|
|
|
125 extern void seed_random (long arg);
|
|
|
126
|
|
20
|
127 DEFUN ("random", Frandom, 0, 1, 0, /*
|
|
0
|
128 Return a pseudo-random number.
|
|
102
|
129 All integers representable in Lisp are equally likely.
|
|
|
130 On most systems, this is 28 bits' worth.
|
|
|
131 With positive integer argument N, return random number in interval [0,N).
|
|
0
|
132 With argument t, set the random number seed from the current time and pid.
|
|
20
|
133 */
|
|
|
134 (limit))
|
|
0
|
135 {
|
|
|
136 EMACS_INT val;
|
|
|
137 Lisp_Object lispy_val;
|
|
|
138 unsigned long denominator;
|
|
|
139
|
|
|
140 if (EQ (limit, Qt))
|
|
|
141 seed_random (getpid () + time (NULL));
|
|
|
142 if (NATNUMP (limit) && !ZEROP (limit))
|
|
|
143 {
|
|
|
144 /* Try to take our random number from the higher bits of VAL,
|
|
|
145 not the lower, since (says Gentzel) the low bits of `random'
|
|
|
146 are less random than the higher ones. We do this by using the
|
|
|
147 quotient rather than the remainder. At the high end of the RNG
|
|
|
148 it's possible to get a quotient larger than limit; discarding
|
|
|
149 these values eliminates the bias that would otherwise appear
|
|
|
150 when using a large limit. */
|
|
|
151 denominator = ((unsigned long)1 << VALBITS) / XINT (limit);
|
|
|
152 do
|
|
|
153 val = get_random () / denominator;
|
|
|
154 while (val >= XINT (limit));
|
|
|
155 }
|
|
|
156 else
|
|
|
157 val = get_random ();
|
|
|
158 XSETINT (lispy_val, val);
|
|
|
159 return lispy_val;
|
|
|
160 }
|
|
|
161
|
|
|
162 /* Random data-structure functions */
|
|
|
163
|
|
|
164 #ifdef LOSING_BYTECODE
|
|
|
165
|
|
|
166 /* #### Delete this shit */
|
|
|
167
|
|
|
168 /* Charcount is a misnomer here as we might be dealing with the
|
|
|
169 length of a vector or list, but emphasizes that we're not dealing
|
|
|
170 with Bytecounts in strings */
|
|
|
171 static Charcount
|
|
|
172 length_with_bytecode_hack (Lisp_Object seq)
|
|
|
173 {
|
|
|
174 if (!COMPILED_FUNCTIONP (seq))
|
|
149
|
175 return XINT (Flength (seq));
|
|
0
|
176 else
|
|
|
177 {
|
|
|
178 struct Lisp_Compiled_Function *b = XCOMPILED_FUNCTION (seq);
|
|
|
179
|
|
149
|
180 return (b->flags.interactivep ? COMPILED_INTERACTIVE :
|
|
|
181 b->flags.domainp ? COMPILED_DOMAIN :
|
|
|
182 COMPILED_DOC_STRING)
|
|
|
183 + 1;
|
|
0
|
184 }
|
|
|
185 }
|
|
|
186
|
|
|
187 #endif /* LOSING_BYTECODE */
|
|
|
188
|
|
|
189 void
|
|
|
190 check_losing_bytecode (CONST char *function, Lisp_Object seq)
|
|
|
191 {
|
|
|
192 if (COMPILED_FUNCTIONP (seq))
|
|
|
193 error_with_frob
|
|
|
194 (seq,
|
|
|
195 "As of 19.14, `%s' no longer works with compiled-function objects",
|
|
|
196 function);
|
|
|
197 }
|
|
|
198
|
|
20
|
199 DEFUN ("length", Flength, 1, 1, 0, /*
|
|
0
|
200 Return the length of vector, bit vector, list or string SEQUENCE.
|
|
20
|
201 */
|
|
|
202 (obj))
|
|
0
|
203 {
|
|
|
204 Lisp_Object tail;
|
|
|
205 int i;
|
|
|
206
|
|
|
207 retry:
|
|
|
208 if (STRINGP (obj))
|
|
149
|
209 return make_int (string_char_length (XSTRING (obj)));
|
|
0
|
210 else if (VECTORP (obj))
|
|
149
|
211 return make_int (vector_length (XVECTOR (obj)));
|
|
0
|
212 else if (BIT_VECTORP (obj))
|
|
149
|
213 return make_int (bit_vector_length (XBIT_VECTOR (obj)));
|
|
0
|
214 else if (CONSP (obj))
|
|
|
215 {
|
|
|
216 for (i = 0, tail = obj; !NILP (tail); i++)
|
|
|
217 {
|
|
|
218 QUIT;
|
|
|
219 tail = Fcdr (tail);
|
|
|
220 }
|
|
|
221
|
|
|
222 return (make_int (i));
|
|
|
223 }
|
|
|
224 else if (NILP (obj))
|
|
|
225 {
|
|
|
226 return (Qzero);
|
|
|
227 }
|
|
|
228 else
|
|
|
229 {
|
|
|
230 check_losing_bytecode ("length", obj);
|
|
|
231 obj = wrong_type_argument (Qsequencep, obj);
|
|
|
232 goto retry;
|
|
|
233 }
|
|
|
234 }
|
|
|
235
|
|
|
236 /* This does not check for quits. That is safe
|
|
|
237 since it must terminate. */
|
|
|
238
|
|
20
|
239 DEFUN ("safe-length", Fsafe_length, 1, 1, 0, /*
|
|
0
|
240 Return the length of a list, but avoid error or infinite loop.
|
|
|
241 This function never gets an error. If LIST is not really a list,
|
|
|
242 it returns 0. If LIST is circular, it returns a finite value
|
|
|
243 which is at least the number of distinct elements.
|
|
20
|
244 */
|
|
|
245 (list))
|
|
0
|
246 {
|
|
|
247 Lisp_Object tail, halftail, length;
|
|
|
248 int len = 0;
|
|
|
249
|
|
|
250 /* halftail is used to detect circular lists. */
|
|
|
251 halftail = list;
|
|
|
252 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
|
253 {
|
|
|
254 if (EQ (tail, halftail) && len != 0)
|
|
|
255 break;
|
|
|
256 len++;
|
|
|
257 if ((len & 1) == 0)
|
|
|
258 halftail = XCDR (halftail);
|
|
|
259 }
|
|
|
260
|
|
|
261 XSETINT (length, len);
|
|
|
262 return length;
|
|
|
263 }
|
|
|
264
|
|
|
265 /*** string functions. ***/
|
|
|
266
|
|
20
|
267 DEFUN ("string-equal", Fstring_equal, 2, 2, 0, /*
|
|
0
|
268 T if two strings have identical contents.
|
|
|
269 Case is significant. Text properties are ignored.
|
|
|
270 (Under XEmacs, `equal' also ignores text properties and extents in
|
|
|
271 strings, but this is not the case under FSF Emacs.)
|
|
|
272 Symbols are also allowed; their print names are used instead.
|
|
20
|
273 */
|
|
70
|
274 (s1, s2))
|
|
0
|
275 {
|
|
|
276 int len;
|
|
|
277
|
|
|
278 if (SYMBOLP (s1))
|
|
|
279 XSETSTRING (s1, XSYMBOL (s1)->name);
|
|
|
280 if (SYMBOLP (s2))
|
|
|
281 XSETSTRING (s2, XSYMBOL (s2)->name);
|
|
|
282 CHECK_STRING (s1);
|
|
|
283 CHECK_STRING (s2);
|
|
|
284
|
|
14
|
285 len = XSTRING_LENGTH (s1);
|
|
|
286 if (len != XSTRING_LENGTH (s2) ||
|
|
|
287 memcmp (XSTRING_DATA (s1), XSTRING_DATA (s2), len))
|
|
0
|
288 return Qnil;
|
|
|
289 return Qt;
|
|
|
290 }
|
|
|
291
|
|
|
292
|
|
20
|
293 DEFUN ("string-lessp", Fstring_lessp, 2, 2, 0, /*
|
|
0
|
294 T if first arg string is less than second in lexicographic order.
|
|
70
|
295 If I18N2 support (but not Mule support) was compiled in, ordering is
|
|
|
296 determined by the locale. (Case is significant for the default C locale.)
|
|
|
297 In all other cases, comparison is simply done on a character-by-
|
|
|
298 character basis using the numeric value of a character. (Note that
|
|
|
299 this may not produce particularly meaningful results under Mule if
|
|
|
300 characters from different charsets are being compared.)
|
|
|
301
|
|
0
|
302 Symbols are also allowed; their print names are used instead.
|
|
70
|
303
|
|
|
304 The reason that the I18N2 locale-specific collation is not used under
|
|
|
305 Mule is that the locale model of internationalization does not handle
|
|
|
306 multiple charsets and thus has no hope of working properly under Mule.
|
|
|
307 What we really should do is create a collation table over all built-in
|
|
|
308 charsets. This is extremely difficult to do from scratch, however.
|
|
|
309
|
|
|
310 Unicode is a good first step towards solving this problem. In fact,
|
|
|
311 it is quite likely that a collation table exists (or will exist) for
|
|
|
312 Unicode. When Unicode support is added to XEmacs/Mule, this problem
|
|
|
313 may be solved.
|
|
20
|
314 */
|
|
|
315 (s1, s2))
|
|
0
|
316 {
|
|
|
317 struct Lisp_String *p1, *p2;
|
|
|
318 Charcount end, len2;
|
|
|
319
|
|
|
320 if (SYMBOLP (s1))
|
|
|
321 XSETSTRING (s1, XSYMBOL (s1)->name);
|
|
|
322 if (SYMBOLP (s2))
|
|
|
323 XSETSTRING (s2, XSYMBOL (s2)->name);
|
|
|
324 CHECK_STRING (s1);
|
|
|
325 CHECK_STRING (s2);
|
|
|
326
|
|
|
327 p1 = XSTRING (s1);
|
|
|
328 p2 = XSTRING (s2);
|
|
|
329 end = string_char_length (XSTRING (s1));
|
|
|
330 len2 = string_char_length (XSTRING (s2));
|
|
|
331 if (end > len2)
|
|
|
332 end = len2;
|
|
|
333
|
|
|
334 {
|
|
|
335 int i;
|
|
|
336
|
|
70
|
337 #if defined (I18N2) && !defined (MULE)
|
|
|
338 /* There is no hope of this working under Mule. Even if we converted
|
|
|
339 the data into an external format so that strcoll() processed it
|
|
|
340 properly, it would still not work because strcoll() does not
|
|
|
341 handle multiple locales. This is the fundamental flaw in the
|
|
|
342 locale model. */
|
|
0
|
343 Bytecount bcend = charcount_to_bytecount (string_data (p1), end);
|
|
|
344 /* Compare strings using collation order of locale. */
|
|
|
345 /* Need to be tricky to handle embedded nulls. */
|
|
|
346
|
|
|
347 for (i = 0; i < bcend; i += strlen((char *) string_data (p1) + i) + 1)
|
|
|
348 {
|
|
|
349 int val = strcoll ((char *) string_data (p1) + i,
|
|
|
350 (char *) string_data (p2) + i);
|
|
|
351 if (val < 0)
|
|
|
352 return Qt;
|
|
|
353 if (val > 0)
|
|
|
354 return Qnil;
|
|
|
355 }
|
|
70
|
356 #else /* not I18N2, or MULE */
|
|
|
357 /* #### It is not really necessary to do this: We could compare
|
|
|
358 byte-by-byte and still get a reasonable comparison, since this
|
|
|
359 would compare characters with a charset in the same way.
|
|
|
360 With a little rearrangement of the leading bytes, we could
|
|
|
361 make most inter-charset comparisons work out the same, too;
|
|
|
362 even if some don't, this is not a big deal because inter-charset
|
|
|
363 comparisons aren't really well-defined anyway. */
|
|
0
|
364 for (i = 0; i < end; i++)
|
|
|
365 {
|
|
|
366 if (string_char (p1, i) != string_char (p2, i))
|
|
|
367 return string_char (p1, i) < string_char (p2, i) ? Qt : Qnil;
|
|
|
368 }
|
|
70
|
369 #endif /* not I18N2, or MULE */
|
|
0
|
370 /* Can't do i < len2 because then comparison between "foo" and "foo^@"
|
|
|
371 won't work right in I18N2 case */
|
|
|
372 return ((end < len2) ? Qt : Qnil);
|
|
|
373 }
|
|
|
374 }
|
|
|
375
|
|
20
|
376 DEFUN ("string-modified-tick", Fstring_modified_tick, 1, 1, 0, /*
|
|
0
|
377 Return STRING's tick counter, incremented for each change to the string.
|
|
|
378 Each string has a tick counter which is incremented each time the contents
|
|
|
379 of the string are changed (e.g. with `aset'). It wraps around occasionally.
|
|
20
|
380 */
|
|
|
381 (string))
|
|
0
|
382 {
|
|
|
383 struct Lisp_String *s;
|
|
|
384
|
|
|
385 CHECK_STRING (string);
|
|
|
386 s = XSTRING (string);
|
|
|
387 if (CONSP (s->plist) && INTP (XCAR (s->plist)))
|
|
|
388 return XCAR (s->plist);
|
|
|
389 else
|
|
|
390 return Qzero;
|
|
|
391 }
|
|
|
392
|
|
|
393 void
|
|
|
394 bump_string_modiff (Lisp_Object str)
|
|
|
395 {
|
|
|
396 struct Lisp_String *s = XSTRING (str);
|
|
|
397 Lisp_Object *ptr = &s->plist;
|
|
|
398
|
|
|
399 #ifdef I18N3
|
|
|
400 /* #### remove the `string-translatable' property from the string,
|
|
|
401 if there is one. */
|
|
|
402 #endif
|
|
|
403 /* skip over extent info if it's there */
|
|
|
404 if (CONSP (*ptr) && EXTENT_INFOP (XCAR (*ptr)))
|
|
|
405 ptr = &XCDR (*ptr);
|
|
|
406 if (CONSP (*ptr) && INTP (XCAR (*ptr)))
|
|
|
407 XSETINT (XCAR (*ptr), 1+XINT (XCAR (*ptr)));
|
|
|
408 else
|
|
|
409 *ptr = Fcons (make_int (1), *ptr);
|
|
|
410 }
|
|
|
411
|
|
|
412
|
|
|
413 enum concat_target_type { c_cons, c_string, c_vector, c_bit_vector };
|
|
|
414 static Lisp_Object concat (int nargs, Lisp_Object *args,
|
|
|
415 enum concat_target_type target_type,
|
|
|
416 int last_special);
|
|
|
417
|
|
|
418 Lisp_Object
|
|
|
419 concat2 (Lisp_Object s1, Lisp_Object s2)
|
|
|
420 {
|
|
|
421 Lisp_Object args[2];
|
|
|
422 args[0] = s1;
|
|
|
423 args[1] = s2;
|
|
|
424 return concat (2, args, c_string, 0);
|
|
|
425 }
|
|
|
426
|
|
|
427 Lisp_Object
|
|
|
428 concat3 (Lisp_Object s1, Lisp_Object s2, Lisp_Object s3)
|
|
|
429 {
|
|
|
430 Lisp_Object args[3];
|
|
|
431 args[0] = s1;
|
|
|
432 args[1] = s2;
|
|
|
433 args[2] = s3;
|
|
|
434 return concat (3, args, c_string, 0);
|
|
|
435 }
|
|
|
436
|
|
|
437 Lisp_Object
|
|
|
438 vconcat2 (Lisp_Object s1, Lisp_Object s2)
|
|
|
439 {
|
|
|
440 Lisp_Object args[2];
|
|
|
441 args[0] = s1;
|
|
|
442 args[1] = s2;
|
|
|
443 return concat (2, args, c_vector, 0);
|
|
|
444 }
|
|
|
445
|
|
|
446 Lisp_Object
|
|
|
447 vconcat3 (Lisp_Object s1, Lisp_Object s2, Lisp_Object s3)
|
|
|
448 {
|
|
|
449 Lisp_Object args[3];
|
|
|
450 args[0] = s1;
|
|
|
451 args[1] = s2;
|
|
|
452 args[2] = s3;
|
|
|
453 return concat (3, args, c_vector, 0);
|
|
|
454 }
|
|
|
455
|
|
20
|
456 DEFUN ("append", Fappend, 0, MANY, 0, /*
|
|
0
|
457 Concatenate all the arguments and make the result a list.
|
|
|
458 The result is a list whose elements are the elements of all the arguments.
|
|
|
459 Each argument may be a list, vector, bit vector, or string.
|
|
|
460 The last argument is not copied, just used as the tail of the new list.
|
|
20
|
461 */
|
|
|
462 (int nargs, Lisp_Object *args))
|
|
0
|
463 {
|
|
|
464 return concat (nargs, args, c_cons, 1);
|
|
|
465 }
|
|
|
466
|
|
20
|
467 DEFUN ("concat", Fconcat, 0, MANY, 0, /*
|
|
0
|
468 Concatenate all the arguments and make the result a string.
|
|
|
469 The result is a string whose elements are the elements of all the arguments.
|
|
120
|
470 Each argument may be a string or a list or vector of characters.
|
|
0
|
471
|
|
|
472 Do not use individual integers as arguments!
|
|
|
473 The behavior of `concat' in that case will be changed later!
|
|
|
474 If your program passes an integer as an argument to `concat',
|
|
|
475 you should change it right away not to do so.
|
|
20
|
476 */
|
|
|
477 (int nargs, Lisp_Object *args))
|
|
0
|
478 {
|
|
|
479 return concat (nargs, args, c_string, 0);
|
|
|
480 }
|
|
|
481
|
|
20
|
482 DEFUN ("vconcat", Fvconcat, 0, MANY, 0, /*
|
|
0
|
483 Concatenate all the arguments and make the result a vector.
|
|
|
484 The result is a vector whose elements are the elements of all the arguments.
|
|
|
485 Each argument may be a list, vector, bit vector, or string.
|
|
20
|
486 */
|
|
|
487 (int nargs, Lisp_Object *args))
|
|
0
|
488 {
|
|
|
489 return concat (nargs, args, c_vector, 0);
|
|
|
490 }
|
|
|
491
|
|
20
|
492 DEFUN ("bvconcat", Fbvconcat, 0, MANY, 0, /*
|
|
0
|
493 Concatenate all the arguments and make the result a bit vector.
|
|
|
494 The result is a bit vector whose elements are the elements of all the
|
|
|
495 arguments. Each argument may be a list, vector, bit vector, or string.
|
|
20
|
496 */
|
|
|
497 (int nargs, Lisp_Object *args))
|
|
0
|
498 {
|
|
|
499 return concat (nargs, args, c_bit_vector, 0);
|
|
|
500 }
|
|
|
501
|
|
20
|
502 DEFUN ("copy-sequence", Fcopy_sequence, 1, 1, 0, /*
|
|
0
|
503 Return a copy of a list, vector, bit vector or string.
|
|
|
504 The elements of a list or vector are not copied; they are shared
|
|
|
505 with the original.
|
|
20
|
506 */
|
|
|
507 (arg))
|
|
0
|
508 {
|
|
|
509 again:
|
|
|
510 if (NILP (arg)) return arg;
|
|
|
511 /* We handle conses separately because concat() is big and hairy and
|
|
|
512 doesn't handle (copy-sequence '(a b . c)) and it's easier to redo this
|
|
|
513 than to fix concat() without worrying about breaking other things.
|
|
|
514 */
|
|
|
515 if (CONSP (arg))
|
|
|
516 {
|
|
|
517 Lisp_Object rest = arg;
|
|
|
518 Lisp_Object head, tail;
|
|
|
519 tail = Qnil;
|
|
|
520 while (CONSP (rest))
|
|
|
521 {
|
|
|
522 Lisp_Object new = Fcons (XCAR (rest), XCDR (rest));
|
|
|
523 if (NILP (tail))
|
|
|
524 head = tail = new;
|
|
|
525 else
|
|
|
526 XCDR (tail) = new, tail = new;
|
|
|
527 rest = XCDR (rest);
|
|
|
528 QUIT;
|
|
|
529 }
|
|
|
530 if (!NILP (tail))
|
|
|
531 XCDR (tail) = rest;
|
|
|
532 return head;
|
|
|
533 }
|
|
|
534 else if (STRINGP (arg))
|
|
|
535 return concat (1, &arg, c_string, 0);
|
|
|
536 else if (VECTORP (arg))
|
|
|
537 return concat (1, &arg, c_vector, 0);
|
|
|
538 else if (BIT_VECTORP (arg))
|
|
|
539 return concat (1, &arg, c_bit_vector, 0);
|
|
|
540 else
|
|
|
541 {
|
|
|
542 check_losing_bytecode ("copy-sequence", arg);
|
|
|
543 arg = wrong_type_argument (Qsequencep, arg);
|
|
|
544 goto again;
|
|
|
545 }
|
|
|
546 }
|
|
|
547
|
|
|
548 struct merge_string_extents_struct
|
|
|
549 {
|
|
|
550 Lisp_Object string;
|
|
|
551 Bytecount entry_offset;
|
|
|
552 Bytecount entry_length;
|
|
|
553 };
|
|
|
554
|
|
|
555 static Lisp_Object
|
|
|
556 concat (int nargs, Lisp_Object *args,
|
|
|
557 enum concat_target_type target_type,
|
|
|
558 int last_special)
|
|
|
559 {
|
|
|
560 Lisp_Object val;
|
|
|
561 Lisp_Object tail = Qnil;
|
|
|
562 int toindex;
|
|
|
563 int argnum;
|
|
|
564 Lisp_Object last_tail;
|
|
|
565 Lisp_Object prev;
|
|
|
566 struct merge_string_extents_struct *args_mse = 0;
|
|
|
567 Bufbyte *string_result = 0;
|
|
|
568 Bufbyte *string_result_ptr = 0;
|
|
|
569 struct gcpro gcpro1;
|
|
|
570
|
|
|
571 /* The modus operandi in Emacs is "caller gc-protects args".
|
|
|
572 However, concat is called many times in Emacs on freshly
|
|
|
573 created stuff. So we help those callers out by protecting
|
|
|
574 the args ourselves to save them a lot of temporary-variable
|
|
|
575 grief. */
|
|
|
576
|
|
|
577 GCPRO1 (args[0]);
|
|
|
578 gcpro1.nvars = nargs;
|
|
|
579
|
|
|
580 #ifdef I18N3
|
|
|
581 /* #### if the result is a string and any of the strings have a string
|
|
|
582 for the `string-translatable' property, then concat should also
|
|
|
583 concat the args but use the `string-translatable' strings, and store
|
|
|
584 the result in the returned string's `string-translatable' property. */
|
|
|
585 #endif
|
|
|
586 if (target_type == c_string)
|
|
|
587 {
|
|
|
588 args_mse = ((struct merge_string_extents_struct *)
|
|
|
589 alloca (nargs *
|
|
|
590 sizeof (struct merge_string_extents_struct)));
|
|
|
591 }
|
|
|
592
|
|
|
593 /* In append, the last arg isn't treated like the others */
|
|
|
594 if (last_special && nargs > 0)
|
|
|
595 {
|
|
|
596 nargs--;
|
|
|
597 last_tail = args[nargs];
|
|
|
598 }
|
|
|
599 else
|
|
|
600 last_tail = Qnil;
|
|
|
601
|
|
|
602 /* Check and coerce the arguments. */
|
|
|
603 for (argnum = 0; argnum < nargs; argnum++)
|
|
|
604 {
|
|
|
605 Lisp_Object seq = args[argnum];
|
|
|
606 if (CONSP (seq) || NILP (seq))
|
|
|
607 ;
|
|
|
608 else if (VECTORP (seq) || STRINGP (seq) || BIT_VECTORP (seq))
|
|
|
609 ;
|
|
|
610 #ifdef LOSING_BYTECODE
|
|
|
611 else if (COMPILED_FUNCTIONP (seq))
|
|
|
612 /* Urk! We allow this, for "compatibility"... */
|
|
|
613 ;
|
|
|
614 #endif
|
|
|
615 else if (INTP (seq))
|
|
|
616 /* This is too revolting to think about but maintains
|
|
|
617 compatibility with FSF (and lots and lots of old code). */
|
|
|
618 args[argnum] = Fnumber_to_string (seq);
|
|
|
619 else
|
|
|
620 {
|
|
|
621 check_losing_bytecode ("concat", seq);
|
|
|
622 args[argnum] = wrong_type_argument (Qsequencep, seq);
|
|
|
623 }
|
|
|
624
|
|
|
625 if (args_mse)
|
|
|
626 {
|
|
|
627 if (STRINGP (seq))
|
|
|
628 args_mse[argnum].string = seq;
|
|
|
629 else
|
|
|
630 args_mse[argnum].string = Qnil;
|
|
|
631 }
|
|
|
632 }
|
|
|
633
|
|
|
634 {
|
|
|
635 /* Charcount is a misnomer here as we might be dealing with the
|
|
|
636 length of a vector or list, but emphasizes that we're not dealing
|
|
|
637 with Bytecounts in strings */
|
|
|
638 Charcount total_length;
|
|
|
639
|
|
|
640 for (argnum = 0, total_length = 0; argnum < nargs; argnum++)
|
|
|
641 {
|
|
|
642 #ifdef LOSING_BYTECODE
|
|
|
643 Charcount thislen = length_with_bytecode_hack (args[argnum]);
|
|
|
644 #else
|
|
|
645 Charcount thislen = XINT (Flength (args[argnum]));
|
|
|
646 #endif
|
|
|
647 total_length += thislen;
|
|
|
648 }
|
|
|
649
|
|
|
650 switch (target_type)
|
|
|
651 {
|
|
|
652 case c_cons:
|
|
|
653 if (total_length == 0)
|
|
|
654 /* In append, if all but last arg are nil, return last arg */
|
|
|
655 RETURN_UNGCPRO (last_tail);
|
|
|
656 val = Fmake_list (make_int (total_length), Qnil);
|
|
|
657 break;
|
|
|
658 case c_vector:
|
|
|
659 val = make_vector (total_length, Qnil);
|
|
|
660 break;
|
|
|
661 case c_bit_vector:
|
|
|
662 val = make_bit_vector (total_length, Qzero);
|
|
|
663 break;
|
|
|
664 case c_string:
|
|
|
665 /* We don't make the string yet because we don't know the
|
|
|
666 actual number of bytes. This loop was formerly written
|
|
|
667 to call Fmake_string() here and then call set_string_char()
|
|
|
668 for each char. This seems logical enough but is waaaaaaaay
|
|
|
669 slow -- set_string_char() has to scan the whole string up
|
|
|
670 to the place where the substitution is called for in order
|
|
|
671 to find the place to change, and may have to do some
|
|
|
672 realloc()ing in order to make the char fit properly.
|
|
|
673 O(N^2) yuckage. */
|
|
|
674 val = Qnil;
|
|
|
675 string_result = (Bufbyte *) alloca (total_length * MAX_EMCHAR_LEN);
|
|
|
676 string_result_ptr = string_result;
|
|
|
677 break;
|
|
|
678 default:
|
|
|
679 abort ();
|
|
|
680 }
|
|
|
681 }
|
|
|
682
|
|
|
683
|
|
|
684 if (CONSP (val))
|
|
|
685 tail = val, toindex = -1; /* -1 in toindex is flag we are
|
|
|
686 making a list */
|
|
|
687 else
|
|
|
688 toindex = 0;
|
|
|
689
|
|
|
690 prev = Qnil;
|
|
|
691
|
|
|
692 for (argnum = 0; argnum < nargs; argnum++)
|
|
|
693 {
|
|
|
694 Charcount thisleni = 0;
|
|
|
695 Charcount thisindex = 0;
|
|
|
696 Lisp_Object seq = args[argnum];
|
|
|
697 Bufbyte *string_source_ptr = 0;
|
|
|
698 Bufbyte *string_prev_result_ptr = string_result_ptr;
|
|
|
699
|
|
|
700 if (!CONSP (seq))
|
|
|
701 {
|
|
|
702 #ifdef LOSING_BYTECODE
|
|
|
703 thisleni = length_with_bytecode_hack (seq);
|
|
|
704 #else
|
|
|
705 thisleni = XINT (Flength (seq));
|
|
|
706 #endif
|
|
|
707 }
|
|
|
708 if (STRINGP (seq))
|
|
14
|
709 string_source_ptr = XSTRING_DATA (seq);
|
|
0
|
710
|
|
|
711 while (1)
|
|
|
712 {
|
|
|
713 Lisp_Object elt;
|
|
|
714
|
|
|
715 /* We've come to the end of this arg, so exit. */
|
|
|
716 if (NILP (seq))
|
|
|
717 break;
|
|
|
718
|
|
|
719 /* Fetch next element of `seq' arg into `elt' */
|
|
|
720 if (CONSP (seq))
|
|
|
721 {
|
|
|
722 elt = Fcar (seq);
|
|
|
723 seq = Fcdr (seq);
|
|
|
724 }
|
|
|
725 else
|
|
|
726 {
|
|
|
727 if (thisindex >= thisleni)
|
|
|
728 break;
|
|
|
729
|
|
|
730 if (STRINGP (seq))
|
|
|
731 {
|
|
|
732 elt = make_char (charptr_emchar (string_source_ptr));
|
|
|
733 INC_CHARPTR (string_source_ptr);
|
|
|
734 }
|
|
|
735 else if (VECTORP (seq))
|
|
|
736 elt = vector_data (XVECTOR (seq))[thisindex];
|
|
|
737 else if (BIT_VECTORP (seq))
|
|
|
738 elt = make_int (bit_vector_bit (XBIT_VECTOR (seq),
|
|
|
739 thisindex));
|
|
|
740 else
|
|
|
741 elt = Felt (seq, make_int (thisindex));
|
|
|
742 thisindex++;
|
|
|
743 }
|
|
|
744
|
|
|
745 /* Store into result */
|
|
|
746 if (toindex < 0)
|
|
|
747 {
|
|
|
748 /* toindex negative means we are making a list */
|
|
|
749 XCAR (tail) = elt;
|
|
|
750 prev = tail;
|
|
|
751 tail = XCDR (tail);
|
|
|
752 }
|
|
|
753 else if (VECTORP (val))
|
|
|
754 vector_data (XVECTOR (val))[toindex++] = elt;
|
|
|
755 else if (BIT_VECTORP (val))
|
|
|
756 {
|
|
|
757 CHECK_BIT (elt);
|
|
|
758 set_bit_vector_bit (XBIT_VECTOR (val), toindex++, XINT (elt));
|
|
|
759 }
|
|
|
760 else
|
|
|
761 {
|
|
|
762 CHECK_CHAR_COERCE_INT (elt);
|
|
|
763 string_result_ptr += set_charptr_emchar (string_result_ptr,
|
|
|
764 XCHAR (elt));
|
|
|
765 }
|
|
|
766 }
|
|
|
767 if (args_mse)
|
|
|
768 {
|
|
|
769 args_mse[argnum].entry_offset =
|
|
|
770 string_prev_result_ptr - string_result;
|
|
|
771 args_mse[argnum].entry_length =
|
|
|
772 string_result_ptr - string_prev_result_ptr;
|
|
|
773 }
|
|
|
774 }
|
|
|
775
|
|
|
776 /* Now we finally make the string. */
|
|
|
777 if (target_type == c_string)
|
|
|
778 {
|
|
|
779 val = make_string (string_result, string_result_ptr - string_result);
|
|
|
780 for (argnum = 0; argnum < nargs; argnum++)
|
|
|
781 {
|
|
|
782 if (STRINGP (args_mse[argnum].string))
|
|
|
783 copy_string_extents (val, args_mse[argnum].string,
|
|
|
784 args_mse[argnum].entry_offset, 0,
|
|
|
785 args_mse[argnum].entry_length);
|
|
|
786 }
|
|
|
787 }
|
|
|
788
|
|
|
789 if (!NILP (prev))
|
|
|
790 XCDR (prev) = last_tail;
|
|
|
791
|
|
|
792 RETURN_UNGCPRO (val);
|
|
|
793 }
|
|
|
794
|
|
20
|
795 DEFUN ("copy-alist", Fcopy_alist, 1, 1, 0, /*
|
|
0
|
796 Return a copy of ALIST.
|
|
|
797 This is an alist which represents the same mapping from objects to objects,
|
|
|
798 but does not share the alist structure with ALIST.
|
|
|
799 The objects mapped (cars and cdrs of elements of the alist)
|
|
|
800 are shared, however.
|
|
|
801 Elements of ALIST that are not conses are also shared.
|
|
20
|
802 */
|
|
|
803 (alist))
|
|
0
|
804 {
|
|
|
805 Lisp_Object tem;
|
|
|
806
|
|
|
807 CHECK_LIST (alist);
|
|
|
808 if (NILP (alist))
|
|
|
809 return alist;
|
|
|
810 alist = concat (1, &alist, c_cons, 0);
|
|
|
811 for (tem = alist; CONSP (tem); tem = XCDR (tem))
|
|
|
812 {
|
|
|
813 Lisp_Object car;
|
|
|
814 car = XCAR (tem);
|
|
|
815
|
|
|
816 if (CONSP (car))
|
|
|
817 XCAR (tem) = Fcons (XCAR (car), XCDR (car));
|
|
|
818 }
|
|
|
819 return alist;
|
|
|
820 }
|
|
|
821
|
|
20
|
822 DEFUN ("copy-tree", Fcopy_tree, 1, 2, 0, /*
|
|
0
|
823 Return a copy of a list and substructures.
|
|
|
824 The argument is copied, and any lists contained within it are copied
|
|
|
825 recursively. Circularities and shared substructures are not preserved.
|
|
|
826 Second arg VECP causes vectors to be copied, too. Strings and bit vectors
|
|
|
827 are not copied.
|
|
20
|
828 */
|
|
|
829 (arg, vecp))
|
|
0
|
830 {
|
|
|
831 if (CONSP (arg))
|
|
|
832 {
|
|
|
833 Lisp_Object rest;
|
|
|
834 rest = arg = Fcopy_sequence (arg);
|
|
|
835 while (CONSP (rest))
|
|
|
836 {
|
|
|
837 Lisp_Object elt = XCAR (rest);
|
|
|
838 QUIT;
|
|
|
839 if (CONSP (elt) || VECTORP (elt))
|
|
|
840 XCAR (rest) = Fcopy_tree (elt, vecp);
|
|
|
841 if (VECTORP (XCDR (rest))) /* hack for (a b . [c d]) */
|
|
|
842 XCDR (rest) = Fcopy_tree (XCDR (rest), vecp);
|
|
|
843 rest = XCDR (rest);
|
|
|
844 }
|
|
|
845 }
|
|
|
846 else if (VECTORP (arg) && ! NILP (vecp))
|
|
|
847 {
|
|
|
848 int i = vector_length (XVECTOR (arg));
|
|
|
849 int j;
|
|
|
850 arg = Fcopy_sequence (arg);
|
|
|
851 for (j = 0; j < i; j++)
|
|
|
852 {
|
|
|
853 Lisp_Object elt = vector_data (XVECTOR (arg)) [j];
|
|
|
854 QUIT;
|
|
|
855 if (CONSP (elt) || VECTORP (elt))
|
|
|
856 vector_data (XVECTOR (arg)) [j] = Fcopy_tree (elt, vecp);
|
|
|
857 }
|
|
|
858 }
|
|
|
859 return arg;
|
|
|
860 }
|
|
|
861
|
|
20
|
862 DEFUN ("substring", Fsubstring, 2, 3, 0, /*
|
|
0
|
863 Return a substring of STRING, starting at index FROM and ending before TO.
|
|
|
864 TO may be nil or omitted; then the substring runs to the end of STRING.
|
|
|
865 If FROM or TO is negative, it counts from the end.
|
|
|
866 Relevant parts of the string-extent-data are copied in the new string.
|
|
20
|
867 */
|
|
|
868 (string, from, to))
|
|
0
|
869 {
|
|
|
870 Charcount ccfr, ccto;
|
|
|
871 Bytecount bfr, bto;
|
|
|
872 Lisp_Object val;
|
|
|
873
|
|
|
874 CHECK_STRING (string);
|
|
|
875 /* Historically, FROM could not be omitted. Whatever ... */
|
|
|
876 CHECK_INT (from);
|
|
|
877 get_string_range_char (string, from, to, &ccfr, &ccto,
|
|
|
878 GB_HISTORICAL_STRING_BEHAVIOR);
|
|
14
|
879 bfr = charcount_to_bytecount (XSTRING_DATA (string), ccfr);
|
|
|
880 bto = charcount_to_bytecount (XSTRING_DATA (string), ccto);
|
|
|
881 val = make_string (XSTRING_DATA (string) + bfr, bto - bfr);
|
|
0
|
882 /* Copy any applicable extent information into the new string: */
|
|
|
883 copy_string_extents (val, string, 0, bfr, bto - bfr);
|
|
|
884 return (val);
|
|
|
885 }
|
|
|
886
|
|
20
|
887 DEFUN ("subseq", Fsubseq, 2, 3, 0, /*
|
|
0
|
888 Return a subsequence of SEQ, starting at index FROM and ending before TO.
|
|
|
889 TO may be nil or omitted; then the subsequence runs to the end of SEQ.
|
|
|
890 If FROM or TO is negative, it counts from the end.
|
|
|
891 The resulting subsequence is always the same type as the original
|
|
|
892 sequence.
|
|
|
893 If SEQ is a string, relevant parts of the string-extent-data are copied
|
|
|
894 in the new string.
|
|
20
|
895 */
|
|
|
896 (seq, from, to))
|
|
0
|
897 {
|
|
|
898 int len, f, t;
|
|
|
899
|
|
|
900 if (STRINGP (seq))
|
|
|
901 return Fsubstring (seq, from, to);
|
|
|
902
|
|
|
903 if (CONSP (seq) || NILP (seq))
|
|
|
904 ;
|
|
|
905 else if (VECTORP (seq) || BIT_VECTORP (seq))
|
|
|
906 ;
|
|
|
907 else
|
|
|
908 {
|
|
|
909 check_losing_bytecode ("subseq", seq);
|
|
|
910 seq = wrong_type_argument (Qsequencep, seq);
|
|
|
911 }
|
|
|
912
|
|
|
913 len = XINT (Flength (seq));
|
|
|
914 CHECK_INT (from);
|
|
|
915 f = XINT (from);
|
|
|
916 if (f < 0)
|
|
|
917 f = len + f;
|
|
|
918 if (NILP (to))
|
|
|
919 t = len;
|
|
|
920 else
|
|
|
921 {
|
|
|
922 CHECK_INT (to);
|
|
|
923 t = XINT (to);
|
|
|
924 if (t < 0)
|
|
|
925 t = len + t;
|
|
|
926 }
|
|
|
927
|
|
|
928 if (!(0 <= f && f <= t && t <= len))
|
|
|
929 args_out_of_range_3 (seq, make_int (f), make_int (t));
|
|
|
930
|
|
|
931 if (VECTORP (seq))
|
|
|
932 {
|
|
|
933 Lisp_Object result = make_vector (t - f, Qnil);
|
|
|
934 int i;
|
|
|
935 Lisp_Object *in_elts = vector_data (XVECTOR (seq));
|
|
|
936 Lisp_Object *out_elts = vector_data (XVECTOR (result));
|
|
|
937
|
|
|
938 for (i = f; i < t; i++)
|
|
|
939 out_elts[i - f] = in_elts[i];
|
|
|
940 return result;
|
|
|
941 }
|
|
|
942
|
|
|
943 if (CONSP (seq))
|
|
|
944 {
|
|
|
945 Lisp_Object result = Qnil;
|
|
|
946 int i;
|
|
|
947
|
|
|
948 seq = Fnthcdr (make_int (f), seq);
|
|
|
949
|
|
|
950 for (i = f; i < t; i++)
|
|
|
951 {
|
|
|
952 result = Fcons (Fcar (seq), result);
|
|
|
953 seq = Fcdr (seq);
|
|
|
954 }
|
|
|
955
|
|
|
956 return Fnreverse (result);
|
|
|
957 }
|
|
|
958
|
|
|
959 /* bit vector */
|
|
|
960 {
|
|
|
961 Lisp_Object result = make_bit_vector (t - f, Qzero);
|
|
|
962 int i;
|
|
|
963
|
|
|
964 for (i = f; i < t; i++)
|
|
|
965 set_bit_vector_bit (XBIT_VECTOR (result), i - f,
|
|
|
966 bit_vector_bit (XBIT_VECTOR (seq), i));
|
|
|
967 return result;
|
|
|
968 }
|
|
|
969 }
|
|
|
970
|
|
|
971
|
|
20
|
972 DEFUN ("nthcdr", Fnthcdr, 2, 2, 0, /*
|
|
0
|
973 Take cdr N times on LIST, returns the result.
|
|
20
|
974 */
|
|
|
975 (n, list))
|
|
0
|
976 {
|
|
|
977 REGISTER int i, num;
|
|
|
978 CHECK_INT (n);
|
|
|
979 num = XINT (n);
|
|
|
980 for (i = 0; i < num && !NILP (list); i++)
|
|
|
981 {
|
|
|
982 QUIT;
|
|
|
983 list = Fcdr (list);
|
|
|
984 }
|
|
|
985 return list;
|
|
|
986 }
|
|
|
987
|
|
20
|
988 DEFUN ("nth", Fnth, 2, 2, 0, /*
|
|
0
|
989 Return the Nth element of LIST.
|
|
|
990 N counts from zero. If LIST is not that long, nil is returned.
|
|
20
|
991 */
|
|
|
992 (n, list))
|
|
0
|
993 {
|
|
|
994 return Fcar (Fnthcdr (n, list));
|
|
|
995 }
|
|
|
996
|
|
20
|
997 DEFUN ("elt", Felt, 2, 2, 0, /*
|
|
0
|
998 Return element of SEQUENCE at index N.
|
|
20
|
999 */
|
|
|
1000 (seq, n))
|
|
0
|
1001 {
|
|
|
1002 retry:
|
|
|
1003 CHECK_INT_COERCE_CHAR (n); /* yuck! */
|
|
|
1004 if (CONSP (seq) || NILP (seq))
|
|
|
1005 {
|
|
|
1006 Lisp_Object tem = Fnthcdr (n, seq);
|
|
|
1007 /* #### Utterly, completely, fucking disgusting.
|
|
|
1008 * #### The whole point of "elt" is that it operates on
|
|
|
1009 * #### sequences, and does error- (bounds-) checking.
|
|
|
1010 */
|
|
|
1011 if (CONSP (tem))
|
|
|
1012 return (XCAR (tem));
|
|
|
1013 else
|
|
|
1014 #if 1
|
|
|
1015 /* This is The Way It Has Always Been. */
|
|
|
1016 return Qnil;
|
|
|
1017 #else
|
|
|
1018 /* This is The Way Mly Says It Should Be. */
|
|
|
1019 args_out_of_range (seq, n);
|
|
|
1020 #endif
|
|
|
1021 }
|
|
|
1022 else if (STRINGP (seq)
|
|
|
1023 || VECTORP (seq)
|
|
|
1024 || BIT_VECTORP (seq))
|
|
|
1025 return (Faref (seq, n));
|
|
|
1026 #ifdef LOSING_BYTECODE
|
|
|
1027 else if (COMPILED_FUNCTIONP (seq))
|
|
|
1028 {
|
|
|
1029 int idx = XINT (n);
|
|
|
1030 if (idx < 0)
|
|
|
1031 {
|
|
|
1032 lose:
|
|
|
1033 args_out_of_range (seq, n);
|
|
|
1034 }
|
|
|
1035 /* Utter perversity */
|
|
|
1036 {
|
|
|
1037 struct Lisp_Compiled_Function *b = XCOMPILED_FUNCTION (seq);
|
|
|
1038 switch (idx)
|
|
|
1039 {
|
|
|
1040 case COMPILED_ARGLIST:
|
|
|
1041 return (b->arglist);
|
|
|
1042 case COMPILED_BYTECODE:
|
|
|
1043 return (b->bytecodes);
|
|
|
1044 case COMPILED_CONSTANTS:
|
|
|
1045 return (b->constants);
|
|
|
1046 case COMPILED_STACK_DEPTH:
|
|
|
1047 return (make_int (b->maxdepth));
|
|
|
1048 case COMPILED_DOC_STRING:
|
|
|
1049 return (compiled_function_documentation (b));
|
|
|
1050 case COMPILED_DOMAIN:
|
|
|
1051 return (compiled_function_domain (b));
|
|
|
1052 case COMPILED_INTERACTIVE:
|
|
|
1053 if (b->flags.interactivep)
|
|
|
1054 return (compiled_function_interactive (b));
|
|
|
1055 /* if we return nil, can't tell interactive with no args
|
|
|
1056 from noninteractive. */
|
|
|
1057 goto lose;
|
|
|
1058 default:
|
|
|
1059 goto lose;
|
|
|
1060 }
|
|
|
1061 }
|
|
|
1062 }
|
|
|
1063 #endif /* LOSING_BYTECODE */
|
|
|
1064 else
|
|
|
1065 {
|
|
|
1066 check_losing_bytecode ("elt", seq);
|
|
|
1067 seq = wrong_type_argument (Qsequencep, seq);
|
|
|
1068 goto retry;
|
|
|
1069 }
|
|
|
1070 }
|
|
|
1071
|
|
20
|
1072 DEFUN ("member", Fmember, 2, 2, 0, /*
|
|
0
|
1073 Return non-nil if ELT is an element of LIST. Comparison done with `equal'.
|
|
|
1074 The value is actually the tail of LIST whose car is ELT.
|
|
20
|
1075 */
|
|
|
1076 (elt, list))
|
|
0
|
1077 {
|
|
|
1078 REGISTER Lisp_Object tail, tem;
|
|
|
1079 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1080 {
|
|
|
1081 tem = Fcar (tail);
|
|
|
1082 if (! NILP (Fequal (elt, tem)))
|
|
|
1083 return tail;
|
|
|
1084 QUIT;
|
|
|
1085 }
|
|
|
1086 return Qnil;
|
|
|
1087 }
|
|
|
1088
|
|
70
|
1089 DEFUN ("old-member", Fold_member, 2, 2, 0, /*
|
|
|
1090 Return non-nil if ELT is an element of LIST. Comparison done with `old-equal'.
|
|
|
1091 The value is actually the tail of LIST whose car is ELT.
|
|
|
1092 This function is provided only for byte-code compatibility with v19.
|
|
|
1093 Do not use it.
|
|
|
1094 */
|
|
|
1095 (elt, list))
|
|
|
1096 {
|
|
|
1097 REGISTER Lisp_Object tail, tem;
|
|
|
1098 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1099 {
|
|
|
1100 tem = Fcar (tail);
|
|
|
1101 if (! NILP (Fold_equal (elt, tem)))
|
|
|
1102 return tail;
|
|
|
1103 QUIT;
|
|
|
1104 }
|
|
|
1105 return Qnil;
|
|
|
1106 }
|
|
|
1107
|
|
20
|
1108 DEFUN ("memq", Fmemq, 2, 2, 0, /*
|
|
0
|
1109 Return non-nil if ELT is an element of LIST. Comparison done with `eq'.
|
|
|
1110 The value is actually the tail of LIST whose car is ELT.
|
|
20
|
1111 */
|
|
|
1112 (elt, list))
|
|
0
|
1113 {
|
|
|
1114 REGISTER Lisp_Object tail, tem;
|
|
|
1115 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1116 {
|
|
|
1117 tem = Fcar (tail);
|
|
70
|
1118 if (EQ_WITH_EBOLA_NOTICE (elt, tem)) return tail;
|
|
|
1119 QUIT;
|
|
|
1120 }
|
|
|
1121 return Qnil;
|
|
|
1122 }
|
|
|
1123
|
|
|
1124 DEFUN ("old-memq", Fold_memq, 2, 2, 0, /*
|
|
|
1125 Return non-nil if ELT is an element of LIST. Comparison done with `old-eq'.
|
|
|
1126 The value is actually the tail of LIST whose car is ELT.
|
|
|
1127 This function is provided only for byte-code compatibility with v19.
|
|
|
1128 Do not use it.
|
|
|
1129 */
|
|
|
1130 (elt, list))
|
|
|
1131 {
|
|
|
1132 REGISTER Lisp_Object tail, tem;
|
|
|
1133 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1134 {
|
|
|
1135 tem = Fcar (tail);
|
|
0
|
1136 if (HACKEQ_UNSAFE (elt, tem)) return tail;
|
|
|
1137 QUIT;
|
|
|
1138 }
|
|
|
1139 return Qnil;
|
|
|
1140 }
|
|
|
1141
|
|
|
1142 Lisp_Object
|
|
|
1143 memq_no_quit (Lisp_Object elt, Lisp_Object list)
|
|
|
1144 {
|
|
|
1145 REGISTER Lisp_Object tail, tem;
|
|
|
1146 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
|
1147 {
|
|
|
1148 tem = XCAR (tail);
|
|
70
|
1149 if (EQ_WITH_EBOLA_NOTICE (elt, tem)) return tail;
|
|
0
|
1150 }
|
|
|
1151 return Qnil;
|
|
|
1152 }
|
|
|
1153
|
|
20
|
1154 DEFUN ("assoc", Fassoc, 2, 2, 0, /*
|
|
0
|
1155 Return non-nil if KEY is `equal' to the car of an element of LIST.
|
|
|
1156 The value is actually the element of LIST whose car equals KEY.
|
|
20
|
1157 */
|
|
|
1158 (key, list))
|
|
0
|
1159 {
|
|
|
1160 /* This function can GC. */
|
|
|
1161 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1162 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1163 {
|
|
|
1164 elt = Fcar (tail);
|
|
|
1165 if (!CONSP (elt)) continue;
|
|
|
1166 tem = Fequal (Fcar (elt), key);
|
|
|
1167 if (!NILP (tem)) return elt;
|
|
|
1168 QUIT;
|
|
|
1169 }
|
|
|
1170 return Qnil;
|
|
|
1171 }
|
|
|
1172
|
|
70
|
1173 DEFUN ("old-assoc", Fold_assoc, 2, 2, 0, /*
|
|
|
1174 Return non-nil if KEY is `old-equal' to the car of an element of LIST.
|
|
|
1175 The value is actually the element of LIST whose car equals KEY.
|
|
|
1176 */
|
|
|
1177 (key, list))
|
|
|
1178 {
|
|
|
1179 /* This function can GC. */
|
|
|
1180 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1181 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1182 {
|
|
|
1183 elt = Fcar (tail);
|
|
|
1184 if (!CONSP (elt)) continue;
|
|
|
1185 tem = Fold_equal (Fcar (elt), key);
|
|
|
1186 if (!NILP (tem)) return elt;
|
|
|
1187 QUIT;
|
|
|
1188 }
|
|
|
1189 return Qnil;
|
|
|
1190 }
|
|
|
1191
|
|
0
|
1192 Lisp_Object
|
|
|
1193 assoc_no_quit (Lisp_Object key, Lisp_Object list)
|
|
|
1194 {
|
|
|
1195 int speccount = specpdl_depth ();
|
|
|
1196 specbind (Qinhibit_quit, Qt);
|
|
149
|
1197 return unbind_to (speccount, Fassoc (key, list));
|
|
0
|
1198 }
|
|
|
1199
|
|
20
|
1200 DEFUN ("assq", Fassq, 2, 2, 0, /*
|
|
0
|
1201 Return non-nil if KEY is `eq' to the car of an element of LIST.
|
|
|
1202 The value is actually the element of LIST whose car is KEY.
|
|
|
1203 Elements of LIST that are not conses are ignored.
|
|
20
|
1204 */
|
|
|
1205 (key, list))
|
|
0
|
1206 {
|
|
|
1207 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1208 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1209 {
|
|
|
1210 elt = Fcar (tail);
|
|
|
1211 if (!CONSP (elt)) continue;
|
|
|
1212 tem = Fcar (elt);
|
|
70
|
1213 if (EQ_WITH_EBOLA_NOTICE (key, tem)) return elt;
|
|
|
1214 QUIT;
|
|
|
1215 }
|
|
|
1216 return Qnil;
|
|
|
1217 }
|
|
|
1218
|
|
|
1219 DEFUN ("old-assq", Fold_assq, 2, 2, 0, /*
|
|
|
1220 Return non-nil if KEY is `old-eq' to the car of an element of LIST.
|
|
|
1221 The value is actually the element of LIST whose car is KEY.
|
|
|
1222 Elements of LIST that are not conses are ignored.
|
|
|
1223 This function is provided only for byte-code compatibility with v19.
|
|
|
1224 Do not use it.
|
|
|
1225 */
|
|
|
1226 (key, list))
|
|
|
1227 {
|
|
|
1228 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1229 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1230 {
|
|
|
1231 elt = Fcar (tail);
|
|
|
1232 if (!CONSP (elt)) continue;
|
|
|
1233 tem = Fcar (elt);
|
|
0
|
1234 if (HACKEQ_UNSAFE (key, tem)) return elt;
|
|
|
1235 QUIT;
|
|
|
1236 }
|
|
|
1237 return Qnil;
|
|
|
1238 }
|
|
|
1239
|
|
|
1240 /* Like Fassq but never report an error and do not allow quits.
|
|
|
1241 Use only on lists known never to be circular. */
|
|
|
1242
|
|
|
1243 Lisp_Object
|
|
|
1244 assq_no_quit (Lisp_Object key, Lisp_Object list)
|
|
|
1245 {
|
|
|
1246 /* This cannot GC. */
|
|
|
1247 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1248 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
|
1249 {
|
|
|
1250 elt = XCAR (tail);
|
|
|
1251 if (!CONSP (elt)) continue;
|
|
|
1252 tem = XCAR (elt);
|
|
70
|
1253 if (EQ_WITH_EBOLA_NOTICE (key, tem)) return elt;
|
|
0
|
1254 }
|
|
|
1255 return Qnil;
|
|
|
1256 }
|
|
|
1257
|
|
20
|
1258 DEFUN ("rassoc", Frassoc, 2, 2, 0, /*
|
|
0
|
1259 Return non-nil if KEY is `equal' to the cdr of an element of LIST.
|
|
|
1260 The value is actually the element of LIST whose cdr equals KEY.
|
|
20
|
1261 */
|
|
|
1262 (key, list))
|
|
0
|
1263 {
|
|
|
1264 REGISTER Lisp_Object tail;
|
|
|
1265 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1266 {
|
|
|
1267 REGISTER Lisp_Object elt, tem;
|
|
|
1268 elt = Fcar (tail);
|
|
|
1269 if (!CONSP (elt)) continue;
|
|
|
1270 tem = Fequal (Fcdr (elt), key);
|
|
|
1271 if (!NILP (tem)) return elt;
|
|
|
1272 QUIT;
|
|
|
1273 }
|
|
|
1274 return Qnil;
|
|
|
1275 }
|
|
|
1276
|
|
70
|
1277 DEFUN ("old-rassoc", Fold_rassoc, 2, 2, 0, /*
|
|
|
1278 Return non-nil if KEY is `old-equal' to the cdr of an element of LIST.
|
|
|
1279 The value is actually the element of LIST whose cdr equals KEY.
|
|
|
1280 */
|
|
|
1281 (key, list))
|
|
|
1282 {
|
|
|
1283 REGISTER Lisp_Object tail;
|
|
|
1284 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1285 {
|
|
|
1286 REGISTER Lisp_Object elt, tem;
|
|
|
1287 elt = Fcar (tail);
|
|
|
1288 if (!CONSP (elt)) continue;
|
|
|
1289 tem = Fold_equal (Fcdr (elt), key);
|
|
|
1290 if (!NILP (tem)) return elt;
|
|
|
1291 QUIT;
|
|
|
1292 }
|
|
|
1293 return Qnil;
|
|
|
1294 }
|
|
|
1295
|
|
20
|
1296 DEFUN ("rassq", Frassq, 2, 2, 0, /*
|
|
0
|
1297 Return non-nil if KEY is `eq' to the cdr of an element of LIST.
|
|
|
1298 The value is actually the element of LIST whose cdr is KEY.
|
|
20
|
1299 */
|
|
|
1300 (key, list))
|
|
0
|
1301 {
|
|
|
1302 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1303 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1304 {
|
|
|
1305 elt = Fcar (tail);
|
|
|
1306 if (!CONSP (elt)) continue;
|
|
|
1307 tem = Fcdr (elt);
|
|
70
|
1308 if (EQ_WITH_EBOLA_NOTICE (key, tem)) return elt;
|
|
|
1309 QUIT;
|
|
|
1310 }
|
|
|
1311 return Qnil;
|
|
|
1312 }
|
|
|
1313
|
|
|
1314 DEFUN ("old-rassq", Fold_rassq, 2, 2, 0, /*
|
|
|
1315 Return non-nil if KEY is `old-eq' to the cdr of an element of LIST.
|
|
|
1316 The value is actually the element of LIST whose cdr is KEY.
|
|
|
1317 */
|
|
|
1318 (key, list))
|
|
|
1319 {
|
|
|
1320 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1321 for (tail = list; !NILP (tail); tail = Fcdr (tail))
|
|
|
1322 {
|
|
|
1323 elt = Fcar (tail);
|
|
|
1324 if (!CONSP (elt)) continue;
|
|
|
1325 tem = Fcdr (elt);
|
|
0
|
1326 if (HACKEQ_UNSAFE (key, tem)) return elt;
|
|
|
1327 QUIT;
|
|
|
1328 }
|
|
|
1329 return Qnil;
|
|
|
1330 }
|
|
|
1331
|
|
|
1332 Lisp_Object
|
|
|
1333 rassq_no_quit (Lisp_Object key, Lisp_Object list)
|
|
|
1334 {
|
|
|
1335 REGISTER Lisp_Object tail, elt, tem;
|
|
|
1336 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
|
1337 {
|
|
|
1338 elt = XCAR (tail);
|
|
|
1339 if (!CONSP (elt)) continue;
|
|
|
1340 tem = XCDR (elt);
|
|
70
|
1341 if (EQ_WITH_EBOLA_NOTICE (key, tem)) return elt;
|
|
0
|
1342 }
|
|
|
1343 return Qnil;
|
|
|
1344 }
|
|
|
1345
|
|
|
1346
|
|
20
|
1347 DEFUN ("delete", Fdelete, 2, 2, 0, /*
|
|
0
|
1348 Delete by side effect any occurrences of ELT as a member of LIST.
|
|
|
1349 The modified LIST is returned. Comparison is done with `equal'.
|
|
|
1350 If the first member of LIST is ELT, there is no way to remove it by side
|
|
|
1351 effect; therefore, write `(setq foo (delete element foo))' to be sure
|
|
|
1352 of changing the value of `foo'.
|
|
20
|
1353 */
|
|
|
1354 (elt, list))
|
|
0
|
1355 {
|
|
|
1356 REGISTER Lisp_Object tail, prev;
|
|
|
1357
|
|
|
1358 tail = list;
|
|
|
1359 prev = Qnil;
|
|
|
1360 while (!NILP (tail))
|
|
|
1361 {
|
|
|
1362 if (!NILP (Fequal (elt, Fcar (tail))))
|
|
|
1363 {
|
|
|
1364 if (NILP (prev))
|
|
|
1365 list = Fcdr (tail);
|
|
|
1366 else
|
|
|
1367 Fsetcdr (prev, Fcdr (tail));
|
|
|
1368 }
|
|
|
1369 else
|
|
|
1370 prev = tail;
|
|
|
1371 tail = Fcdr (tail);
|
|
|
1372 QUIT;
|
|
|
1373 }
|
|
|
1374 return list;
|
|
|
1375 }
|
|
|
1376
|
|
70
|
1377 DEFUN ("old-delete", Fold_delete, 2, 2, 0, /*
|
|
|
1378 Delete by side effect any occurrences of ELT as a member of LIST.
|
|
|
1379 The modified LIST is returned. Comparison is done with `old-equal'.
|
|
|
1380 If the first member of LIST is ELT, there is no way to remove it by side
|
|
|
1381 effect; therefore, write `(setq foo (delete element foo))' to be sure
|
|
|
1382 of changing the value of `foo'.
|
|
|
1383 */
|
|
|
1384 (elt, list))
|
|
|
1385 {
|
|
|
1386 REGISTER Lisp_Object tail, prev;
|
|
|
1387
|
|
|
1388 tail = list;
|
|
|
1389 prev = Qnil;
|
|
|
1390 while (!NILP (tail))
|
|
|
1391 {
|
|
|
1392 if (!NILP (Fold_equal (elt, Fcar (tail))))
|
|
|
1393 {
|
|
|
1394 if (NILP (prev))
|
|
|
1395 list = Fcdr (tail);
|
|
|
1396 else
|
|
|
1397 Fsetcdr (prev, Fcdr (tail));
|
|
|
1398 }
|
|
|
1399 else
|
|
|
1400 prev = tail;
|
|
|
1401 tail = Fcdr (tail);
|
|
|
1402 QUIT;
|
|
|
1403 }
|
|
|
1404 return list;
|
|
|
1405 }
|
|
|
1406
|
|
20
|
1407 DEFUN ("delq", Fdelq, 2, 2, 0, /*
|
|
0
|
1408 Delete by side effect any occurrences of ELT as a member of LIST.
|
|
|
1409 The modified LIST is returned. Comparison is done with `eq'.
|
|
|
1410 If the first member of LIST is ELT, there is no way to remove it by side
|
|
|
1411 effect; therefore, write `(setq foo (delq element foo))' to be sure of
|
|
|
1412 changing the value of `foo'.
|
|
20
|
1413 */
|
|
|
1414 (elt, list))
|
|
0
|
1415 {
|
|
|
1416 REGISTER Lisp_Object tail, prev;
|
|
|
1417 REGISTER Lisp_Object tem;
|
|
|
1418
|
|
|
1419 tail = list;
|
|
|
1420 prev = Qnil;
|
|
|
1421 while (!NILP (tail))
|
|
|
1422 {
|
|
|
1423 tem = Fcar (tail);
|
|
70
|
1424 if (EQ_WITH_EBOLA_NOTICE (elt, tem))
|
|
|
1425 {
|
|
|
1426 if (NILP (prev))
|
|
|
1427 list = Fcdr (tail);
|
|
|
1428 else
|
|
|
1429 Fsetcdr (prev, Fcdr (tail));
|
|
|
1430 }
|
|
|
1431 else
|
|
|
1432 prev = tail;
|
|
|
1433 tail = Fcdr (tail);
|
|
|
1434 QUIT;
|
|
|
1435 }
|
|
|
1436 return list;
|
|
|
1437 }
|
|
|
1438
|
|
|
1439 DEFUN ("old-delq", Fold_delq, 2, 2, 0, /*
|
|
|
1440 Delete by side effect any occurrences of ELT as a member of LIST.
|
|
|
1441 The modified LIST is returned. Comparison is done with `old-eq'.
|
|
|
1442 If the first member of LIST is ELT, there is no way to remove it by side
|
|
|
1443 effect; therefore, write `(setq foo (delq element foo))' to be sure of
|
|
|
1444 changing the value of `foo'.
|
|
|
1445 */
|
|
|
1446 (elt, list))
|
|
|
1447 {
|
|
|
1448 REGISTER Lisp_Object tail, prev;
|
|
|
1449 REGISTER Lisp_Object tem;
|
|
|
1450
|
|
|
1451 tail = list;
|
|
|
1452 prev = Qnil;
|
|
|
1453 while (!NILP (tail))
|
|
|
1454 {
|
|
|
1455 tem = Fcar (tail);
|
|
0
|
1456 if (HACKEQ_UNSAFE (elt, tem))
|
|
|
1457 {
|
|
|
1458 if (NILP (prev))
|
|
|
1459 list = Fcdr (tail);
|
|
|
1460 else
|
|
|
1461 Fsetcdr (prev, Fcdr (tail));
|
|
|
1462 }
|
|
|
1463 else
|
|
|
1464 prev = tail;
|
|
|
1465 tail = Fcdr (tail);
|
|
|
1466 QUIT;
|
|
|
1467 }
|
|
|
1468 return list;
|
|
|
1469 }
|
|
|
1470
|
|
|
1471 /* no quit, no errors; be careful */
|
|
|
1472
|
|
|
1473 Lisp_Object
|
|
|
1474 delq_no_quit (Lisp_Object elt, Lisp_Object list)
|
|
|
1475 {
|
|
|
1476 REGISTER Lisp_Object tail, prev;
|
|
|
1477 REGISTER Lisp_Object tem;
|
|
|
1478
|
|
|
1479 tail = list;
|
|
|
1480 prev = Qnil;
|
|
|
1481 while (CONSP (tail))
|
|
|
1482 {
|
|
|
1483 tem = XCAR (tail);
|
|
70
|
1484 if (EQ_WITH_EBOLA_NOTICE (elt, tem))
|
|
0
|
1485 {
|
|
|
1486 if (NILP (prev))
|
|
|
1487 list = XCDR (tail);
|
|
|
1488 else
|
|
|
1489 XCDR (prev) = XCDR (tail);
|
|
|
1490 }
|
|
|
1491 else
|
|
|
1492 prev = tail;
|
|
|
1493 tail = XCDR (tail);
|
|
|
1494 }
|
|
|
1495 return list;
|
|
|
1496 }
|
|
|
1497
|
|
|
1498 /* Be VERY careful with this. This is like delq_no_quit() but
|
|
|
1499 also calls free_cons() on the removed conses. You must be SURE
|
|
|
1500 that no pointers to the freed conses remain around (e.g.
|
|
|
1501 someone else is pointing to part of the list). This function
|
|
|
1502 is useful on internal lists that are used frequently and where
|
|
|
1503 the actual list doesn't escape beyond known code bounds. */
|
|
|
1504
|
|
|
1505 Lisp_Object
|
|
|
1506 delq_no_quit_and_free_cons (Lisp_Object elt, Lisp_Object list)
|
|
|
1507 {
|
|
|
1508 REGISTER Lisp_Object tail, prev;
|
|
|
1509 REGISTER Lisp_Object tem;
|
|
|
1510
|
|
|
1511 tail = list;
|
|
|
1512 prev = Qnil;
|
|
|
1513 while (CONSP (tail))
|
|
|
1514 {
|
|
|
1515 Lisp_Object cons_to_free = Qnil;
|
|
|
1516 tem = XCAR (tail);
|
|
70
|
1517 if (EQ_WITH_EBOLA_NOTICE (elt, tem))
|
|
0
|
1518 {
|
|
|
1519 if (NILP (prev))
|
|
|
1520 list = XCDR (tail);
|
|
|
1521 else
|
|
|
1522 XCDR (prev) = XCDR (tail);
|
|
|
1523 cons_to_free = tail;
|
|
|
1524 }
|
|
|
1525 else
|
|
|
1526 prev = tail;
|
|
|
1527 tail = XCDR (tail);
|
|
|
1528 if (!NILP (cons_to_free))
|
|
|
1529 free_cons (XCONS (cons_to_free));
|
|
|
1530 }
|
|
|
1531 return list;
|
|
|
1532 }
|
|
|
1533
|
|
20
|
1534 DEFUN ("remassoc", Fremassoc, 2, 2, 0, /*
|
|
0
|
1535 Delete by side effect any elements of LIST whose car is `equal' to KEY.
|
|
|
1536 The modified LIST is returned. If the first member of LIST has a car
|
|
|
1537 that is `equal' to KEY, there is no way to remove it by side effect;
|
|
|
1538 therefore, write `(setq foo (remassoc key foo))' to be sure of changing
|
|
|
1539 the value of `foo'.
|
|
20
|
1540 */
|
|
|
1541 (key, list))
|
|
0
|
1542 {
|
|
|
1543 REGISTER Lisp_Object tail, prev;
|
|
|
1544
|
|
|
1545 tail = list;
|
|
|
1546 prev = Qnil;
|
|
|
1547 while (!NILP (tail))
|
|
|
1548 {
|
|
|
1549 Lisp_Object elt = Fcar (tail);
|
|
|
1550 if (CONSP (elt) && ! NILP (Fequal (key, Fcar (elt))))
|
|
|
1551 {
|
|
|
1552 if (NILP (prev))
|
|
|
1553 list = Fcdr (tail);
|
|
|
1554 else
|
|
|
1555 Fsetcdr (prev, Fcdr (tail));
|
|
|
1556 }
|
|
|
1557 else
|
|
|
1558 prev = tail;
|
|
|
1559 tail = Fcdr (tail);
|
|
|
1560 QUIT;
|
|
|
1561 }
|
|
|
1562 return list;
|
|
|
1563 }
|
|
|
1564
|
|
|
1565 Lisp_Object
|
|
|
1566 remassoc_no_quit (Lisp_Object key, Lisp_Object list)
|
|
|
1567 {
|
|
|
1568 int speccount = specpdl_depth ();
|
|
|
1569 specbind (Qinhibit_quit, Qt);
|
|
149
|
1570 return unbind_to (speccount, Fremassoc (key, list));
|
|
0
|
1571 }
|
|
|
1572
|
|
20
|
1573 DEFUN ("remassq", Fremassq, 2, 2, 0, /*
|
|
0
|
1574 Delete by side effect any elements of LIST whose car is `eq' to KEY.
|
|
|
1575 The modified LIST is returned. If the first member of LIST has a car
|
|
|
1576 that is `eq' to KEY, there is no way to remove it by side effect;
|
|
|
1577 therefore, write `(setq foo (remassq key foo))' to be sure of changing
|
|
|
1578 the value of `foo'.
|
|
20
|
1579 */
|
|
|
1580 (key, list))
|
|
0
|
1581 {
|
|
|
1582 REGISTER Lisp_Object tail, prev;
|
|
|
1583
|
|
|
1584 tail = list;
|
|
|
1585 prev = Qnil;
|
|
|
1586 while (!NILP (tail))
|
|
|
1587 {
|
|
|
1588 Lisp_Object elt = Fcar (tail);
|
|
70
|
1589 if (CONSP (elt) && EQ_WITH_EBOLA_NOTICE (key, Fcar (elt)))
|
|
0
|
1590 {
|
|
|
1591 if (NILP (prev))
|
|
|
1592 list = Fcdr (tail);
|
|
|
1593 else
|
|
|
1594 Fsetcdr (prev, Fcdr (tail));
|
|
|
1595 }
|
|
|
1596 else
|
|
|
1597 prev = tail;
|
|
|
1598 tail = Fcdr (tail);
|
|
|
1599 QUIT;
|
|
|
1600 }
|
|
|
1601 return list;
|
|
|
1602 }
|
|
|
1603
|
|
|
1604 /* no quit, no errors; be careful */
|
|
|
1605
|
|
|
1606 Lisp_Object
|
|
|
1607 remassq_no_quit (Lisp_Object key, Lisp_Object list)
|
|
|
1608 {
|
|
|
1609 REGISTER Lisp_Object tail, prev;
|
|
|
1610 REGISTER Lisp_Object tem;
|
|
|
1611
|
|
|
1612 tail = list;
|
|
|
1613 prev = Qnil;
|
|
|
1614 while (CONSP (tail))
|
|
|
1615 {
|
|
|
1616 tem = XCAR (tail);
|
|
70
|
1617 if (CONSP (tem) && EQ_WITH_EBOLA_NOTICE (key, XCAR (tem)))
|
|
0
|
1618 {
|
|
|
1619 if (NILP (prev))
|
|
|
1620 list = XCDR (tail);
|
|
|
1621 else
|
|
|
1622 XCDR (prev) = XCDR (tail);
|
|
|
1623 }
|
|
|
1624 else
|
|
|
1625 prev = tail;
|
|
|
1626 tail = XCDR (tail);
|
|
|
1627 }
|
|
|
1628 return list;
|
|
|
1629 }
|
|
|
1630
|
|
20
|
1631 DEFUN ("remrassoc", Fremrassoc, 2, 2, 0, /*
|
|
0
|
1632 Delete by side effect any elements of LIST whose cdr is `equal' to VALUE.
|
|
|
1633 The modified LIST is returned. If the first member of LIST has a car
|
|
|
1634 that is `equal' to VALUE, there is no way to remove it by side effect;
|
|
|
1635 therefore, write `(setq foo (remrassoc value foo))' to be sure of changing
|
|
|
1636 the value of `foo'.
|
|
20
|
1637 */
|
|
|
1638 (value, list))
|
|
0
|
1639 {
|
|
|
1640 REGISTER Lisp_Object tail, prev;
|
|
|
1641
|
|
|
1642 tail = list;
|
|
|
1643 prev = Qnil;
|
|
|
1644 while (!NILP (tail))
|
|
|
1645 {
|
|
|
1646 Lisp_Object elt = Fcar (tail);
|
|
|
1647 if (CONSP (elt) && ! NILP (Fequal (value, Fcdr (elt))))
|
|
|
1648 {
|
|
|
1649 if (NILP (prev))
|
|
|
1650 list = Fcdr (tail);
|
|
|
1651 else
|
|
|
1652 Fsetcdr (prev, Fcdr (tail));
|
|
|
1653 }
|
|
|
1654 else
|
|
|
1655 prev = tail;
|
|
|
1656 tail = Fcdr (tail);
|
|
|
1657 QUIT;
|
|
|
1658 }
|
|
|
1659 return list;
|
|
|
1660 }
|
|
|
1661
|
|
20
|
1662 DEFUN ("remrassq", Fremrassq, 2, 2, 0, /*
|
|
0
|
1663 Delete by side effect any elements of LIST whose cdr is `eq' to VALUE.
|
|
|
1664 The modified LIST is returned. If the first member of LIST has a car
|
|
|
1665 that is `eq' to VALUE, there is no way to remove it by side effect;
|
|
|
1666 therefore, write `(setq foo (remrassq value foo))' to be sure of changing
|
|
|
1667 the value of `foo'.
|
|
20
|
1668 */
|
|
|
1669 (value, list))
|
|
0
|
1670 {
|
|
|
1671 REGISTER Lisp_Object tail, prev;
|
|
|
1672
|
|
|
1673 tail = list;
|
|
|
1674 prev = Qnil;
|
|
|
1675 while (!NILP (tail))
|
|
|
1676 {
|
|
|
1677 Lisp_Object elt = Fcar (tail);
|
|
70
|
1678 if (CONSP (elt) && EQ_WITH_EBOLA_NOTICE (value, Fcdr (elt)))
|
|
0
|
1679 {
|
|
|
1680 if (NILP (prev))
|
|
|
1681 list = Fcdr (tail);
|
|
|
1682 else
|
|
|
1683 Fsetcdr (prev, Fcdr (tail));
|
|
|
1684 }
|
|
|
1685 else
|
|
|
1686 prev = tail;
|
|
|
1687 tail = Fcdr (tail);
|
|
|
1688 QUIT;
|
|
|
1689 }
|
|
|
1690 return list;
|
|
|
1691 }
|
|
|
1692
|
|
|
1693 /* no quit, no errors; be careful */
|
|
|
1694
|
|
|
1695 Lisp_Object
|
|
|
1696 remrassq_no_quit (Lisp_Object value, Lisp_Object list)
|
|
|
1697 {
|
|
|
1698 REGISTER Lisp_Object tail, prev;
|
|
|
1699 REGISTER Lisp_Object tem;
|
|
|
1700
|
|
|
1701 tail = list;
|
|
|
1702 prev = Qnil;
|
|
|
1703 while (CONSP (tail))
|
|
|
1704 {
|
|
|
1705 tem = XCAR (tail);
|
|
70
|
1706 if (CONSP (tem) && EQ_WITH_EBOLA_NOTICE (value, XCDR (tem)))
|
|
0
|
1707 {
|
|
|
1708 if (NILP (prev))
|
|
|
1709 list = XCDR (tail);
|
|
|
1710 else
|
|
|
1711 XCDR (prev) = XCDR (tail);
|
|
|
1712 }
|
|
|
1713 else
|
|
|
1714 prev = tail;
|
|
|
1715 tail = XCDR (tail);
|
|
|
1716 }
|
|
|
1717 return list;
|
|
|
1718 }
|
|
|
1719
|
|
20
|
1720 DEFUN ("nreverse", Fnreverse, 1, 1, 0, /*
|
|
0
|
1721 Reverse LIST by modifying cdr pointers.
|
|
|
1722 Returns the beginning of the reversed list.
|
|
20
|
1723 */
|
|
|
1724 (list))
|
|
0
|
1725 {
|
|
|
1726 Lisp_Object prev, tail, next;
|
|
|
1727 struct gcpro gcpro1, gcpro2;
|
|
|
1728
|
|
|
1729 /* We gcpro our args; see `nconc' */
|
|
|
1730 prev = Qnil;
|
|
|
1731 tail = list;
|
|
|
1732 GCPRO2 (prev, tail);
|
|
|
1733 while (!NILP (tail))
|
|
|
1734 {
|
|
|
1735 QUIT;
|
|
|
1736 next = Fcdr (tail);
|
|
|
1737 Fsetcdr (tail, prev);
|
|
|
1738 prev = tail;
|
|
|
1739 tail = next;
|
|
|
1740 }
|
|
|
1741 UNGCPRO;
|
|
|
1742 return prev;
|
|
|
1743 }
|
|
|
1744
|
|
20
|
1745 DEFUN ("reverse", Freverse, 1, 1, 0, /*
|
|
0
|
1746 Reverse LIST, copying. Returns the beginning of the reversed list.
|
|
|
1747 See also the function `nreverse', which is used more often.
|
|
20
|
1748 */
|
|
|
1749 (list))
|
|
0
|
1750 {
|
|
|
1751 Lisp_Object length;
|
|
|
1752 Lisp_Object *vec;
|
|
|
1753 Lisp_Object tail;
|
|
|
1754 REGISTER int i;
|
|
|
1755
|
|
|
1756 length = Flength (list);
|
|
|
1757 vec = (Lisp_Object *) alloca (XINT (length) * sizeof (Lisp_Object));
|
|
|
1758 for (i = XINT (length) - 1, tail = list; i >= 0; i--, tail = Fcdr (tail))
|
|
|
1759 vec[i] = Fcar (tail);
|
|
|
1760
|
|
|
1761 return Flist (XINT (length), vec);
|
|
|
1762 }
|
|
|
1763
|
|
|
1764 static Lisp_Object list_merge (Lisp_Object org_l1, Lisp_Object org_l2,
|
|
|
1765 Lisp_Object lisp_arg,
|
|
|
1766 int (*pred_fn) (Lisp_Object, Lisp_Object,
|
|
|
1767 Lisp_Object lisp_arg));
|
|
|
1768
|
|
|
1769 Lisp_Object
|
|
|
1770 list_sort (Lisp_Object list,
|
|
|
1771 Lisp_Object lisp_arg,
|
|
|
1772 int (*pred_fn) (Lisp_Object, Lisp_Object,
|
|
|
1773 Lisp_Object lisp_arg))
|
|
|
1774 {
|
|
|
1775 Lisp_Object front, back;
|
|
|
1776 Lisp_Object len, tem;
|
|
|
1777 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
|
1778 int length;
|
|
|
1779
|
|
|
1780 front = list;
|
|
|
1781 len = Flength (list);
|
|
|
1782 length = XINT (len);
|
|
|
1783 if (length < 2)
|
|
|
1784 return list;
|
|
|
1785
|
|
|
1786 XSETINT (len, (length / 2) - 1);
|
|
|
1787 tem = Fnthcdr (len, list);
|
|
|
1788 back = Fcdr (tem);
|
|
|
1789 Fsetcdr (tem, Qnil);
|
|
|
1790
|
|
|
1791 GCPRO3 (front, back, lisp_arg);
|
|
|
1792 front = list_sort (front, lisp_arg, pred_fn);
|
|
|
1793 back = list_sort (back, lisp_arg, pred_fn);
|
|
|
1794 UNGCPRO;
|
|
|
1795 return list_merge (front, back, lisp_arg, pred_fn);
|
|
|
1796 }
|
|
|
1797
|
|
|
1798
|
|
|
1799 static int
|
|
|
1800 merge_pred_function (Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1801 Lisp_Object pred)
|
|
|
1802 {
|
|
|
1803 Lisp_Object tmp;
|
|
|
1804
|
|
|
1805 /* prevents the GC from happening in call2 */
|
|
|
1806 int speccount = specpdl_depth ();
|
|
|
1807 /* Emacs' GC doesn't actually relocate pointers, so this probably
|
|
|
1808 isn't strictly necessary */
|
|
|
1809 record_unwind_protect (restore_gc_inhibit,
|
|
|
1810 make_int (gc_currently_forbidden));
|
|
|
1811 gc_currently_forbidden = 1;
|
|
|
1812 tmp = call2 (pred, obj1, obj2);
|
|
|
1813 unbind_to (speccount, Qnil);
|
|
|
1814
|
|
|
1815 if (NILP (tmp))
|
|
|
1816 return -1;
|
|
|
1817 else
|
|
|
1818 return 1;
|
|
|
1819 }
|
|
|
1820
|
|
20
|
1821 DEFUN ("sort", Fsort, 2, 2, 0, /*
|
|
0
|
1822 Sort LIST, stably, comparing elements using PREDICATE.
|
|
|
1823 Returns the sorted list. LIST is modified by side effects.
|
|
|
1824 PREDICATE is called with two elements of LIST, and should return T
|
|
|
1825 if the first element is \"less\" than the second.
|
|
20
|
1826 */
|
|
|
1827 (list, pred))
|
|
0
|
1828 {
|
|
|
1829 return list_sort (list, pred, merge_pred_function);
|
|
|
1830 }
|
|
|
1831
|
|
|
1832 Lisp_Object
|
|
|
1833 merge (Lisp_Object org_l1, Lisp_Object org_l2,
|
|
|
1834 Lisp_Object pred)
|
|
|
1835 {
|
|
|
1836 return list_merge (org_l1, org_l2, pred, merge_pred_function);
|
|
|
1837 }
|
|
|
1838
|
|
|
1839
|
|
|
1840 static Lisp_Object
|
|
|
1841 list_merge (Lisp_Object org_l1, Lisp_Object org_l2,
|
|
|
1842 Lisp_Object lisp_arg,
|
|
|
1843 int (*pred_fn) (Lisp_Object, Lisp_Object, Lisp_Object lisp_arg))
|
|
|
1844 {
|
|
|
1845 Lisp_Object value;
|
|
|
1846 Lisp_Object tail;
|
|
|
1847 Lisp_Object tem;
|
|
|
1848 Lisp_Object l1, l2;
|
|
|
1849 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
1850
|
|
|
1851 l1 = org_l1;
|
|
|
1852 l2 = org_l2;
|
|
|
1853 tail = Qnil;
|
|
|
1854 value = Qnil;
|
|
|
1855
|
|
|
1856 /* It is sufficient to protect org_l1 and org_l2.
|
|
|
1857 When l1 and l2 are updated, we copy the new values
|
|
|
1858 back into the org_ vars. */
|
|
|
1859
|
|
|
1860 GCPRO4 (org_l1, org_l2, lisp_arg, value);
|
|
|
1861
|
|
|
1862 while (1)
|
|
|
1863 {
|
|
|
1864 if (NILP (l1))
|
|
|
1865 {
|
|
|
1866 UNGCPRO;
|
|
|
1867 if (NILP (tail))
|
|
|
1868 return l2;
|
|
|
1869 Fsetcdr (tail, l2);
|
|
|
1870 return value;
|
|
|
1871 }
|
|
|
1872 if (NILP (l2))
|
|
|
1873 {
|
|
|
1874 UNGCPRO;
|
|
|
1875 if (NILP (tail))
|
|
|
1876 return l1;
|
|
|
1877 Fsetcdr (tail, l1);
|
|
|
1878 return value;
|
|
|
1879 }
|
|
|
1880
|
|
|
1881 if (((*pred_fn) (Fcar (l2), Fcar (l1), lisp_arg)) < 0)
|
|
|
1882 {
|
|
|
1883 tem = l1;
|
|
|
1884 l1 = Fcdr (l1);
|
|
|
1885 org_l1 = l1;
|
|
|
1886 }
|
|
|
1887 else
|
|
|
1888 {
|
|
|
1889 tem = l2;
|
|
|
1890 l2 = Fcdr (l2);
|
|
|
1891 org_l2 = l2;
|
|
|
1892 }
|
|
|
1893 if (NILP (tail))
|
|
|
1894 value = tem;
|
|
|
1895 else
|
|
|
1896 Fsetcdr (tail, tem);
|
|
|
1897 tail = tem;
|
|
|
1898 }
|
|
|
1899 }
|
|
|
1900
|
|
|
1901
|
|
|
1902 /************************************************************************/
|
|
|
1903 /* property-list functions */
|
|
|
1904 /************************************************************************/
|
|
|
1905
|
|
|
1906 /* For properties of text, we need to do order-insensitive comparison of
|
|
|
1907 plists. That is, we need to compare two plists such that they are the
|
|
|
1908 same if they have the same set of keys, and equivalent values.
|
|
|
1909 So (a 1 b 2) would be equal to (b 2 a 1).
|
|
|
1910
|
|
|
1911 NIL_MEANS_NOT_PRESENT is as in `plists-eq' etc.
|
|
|
1912 LAXP means use `equal' for comparisons.
|
|
|
1913 */
|
|
|
1914 int
|
|
|
1915 plists_differ (Lisp_Object a, Lisp_Object b, int nil_means_not_present,
|
|
|
1916 int laxp, int depth)
|
|
|
1917 {
|
|
|
1918 int eqp = (depth == -1); /* -1 as depth means us eq, not equal. */
|
|
|
1919 int la, lb, m, i, fill;
|
|
|
1920 Lisp_Object *keys, *vals;
|
|
|
1921 char *flags;
|
|
|
1922 Lisp_Object rest;
|
|
|
1923
|
|
|
1924 if (NILP (a) && NILP (b))
|
|
|
1925 return 0;
|
|
|
1926
|
|
|
1927 Fcheck_valid_plist (a);
|
|
|
1928 Fcheck_valid_plist (b);
|
|
|
1929
|
|
|
1930 la = XINT (Flength (a));
|
|
|
1931 lb = XINT (Flength (b));
|
|
|
1932 m = (la > lb ? la : lb);
|
|
|
1933 fill = 0;
|
|
|
1934 keys = (Lisp_Object *) alloca (m * sizeof (Lisp_Object));
|
|
|
1935 vals = (Lisp_Object *) alloca (m * sizeof (Lisp_Object));
|
|
|
1936 flags = (char *) alloca (m * sizeof (char));
|
|
|
1937
|
|
|
1938 /* First extract the pairs from A. */
|
|
|
1939 for (rest = a; !NILP (rest); rest = XCDR (XCDR (rest)))
|
|
|
1940 {
|
|
|
1941 Lisp_Object k = XCAR (rest);
|
|
|
1942 Lisp_Object v = XCAR (XCDR (rest));
|
|
|
1943 /* Maybe be Ebolified. */
|
|
|
1944 if (nil_means_not_present && NILP (v)) continue;
|
|
|
1945 keys [fill] = k;
|
|
|
1946 vals [fill] = v;
|
|
|
1947 flags[fill] = 0;
|
|
|
1948 fill++;
|
|
|
1949 }
|
|
|
1950 /* Now iterate over B, and stop if we find something that's not in A,
|
|
|
1951 or that doesn't match. As we match, mark them. */
|
|
|
1952 for (rest = b; !NILP (rest); rest = XCDR (XCDR (rest)))
|
|
|
1953 {
|
|
|
1954 Lisp_Object k = XCAR (rest);
|
|
|
1955 Lisp_Object v = XCAR (XCDR (rest));
|
|
|
1956 /* Maybe be Ebolified. */
|
|
|
1957 if (nil_means_not_present && NILP (v)) continue;
|
|
|
1958 for (i = 0; i < fill; i++)
|
|
|
1959 {
|
|
|
1960 if (!laxp ? EQ (k, keys [i]) : internal_equal (k, keys [i], depth))
|
|
|
1961 {
|
|
|
1962 if ((eqp
|
|
70
|
1963 /* We narrowly escaped being Ebolified here. */
|
|
|
1964 ? !EQ_WITH_EBOLA_NOTICE (v, vals [i])
|
|
0
|
1965 : !internal_equal (v, vals [i], depth)))
|
|
|
1966 /* a property in B has a different value than in A */
|
|
|
1967 goto MISMATCH;
|
|
|
1968 flags [i] = 1;
|
|
|
1969 break;
|
|
|
1970 }
|
|
|
1971 }
|
|
|
1972 if (i == fill)
|
|
|
1973 /* there are some properties in B that are not in A */
|
|
|
1974 goto MISMATCH;
|
|
|
1975 }
|
|
|
1976 /* Now check to see that all the properties in A were also in B */
|
|
|
1977 for (i = 0; i < fill; i++)
|
|
|
1978 if (flags [i] == 0)
|
|
|
1979 goto MISMATCH;
|
|
|
1980
|
|
|
1981 /* Ok. */
|
|
|
1982 return 0;
|
|
|
1983
|
|
|
1984 MISMATCH:
|
|
|
1985 return 1;
|
|
|
1986 }
|
|
|
1987
|
|
20
|
1988 DEFUN ("plists-eq", Fplists_eq, 2, 3, 0, /*
|
|
0
|
1989 Return non-nil if property lists A and B are `eq'.
|
|
|
1990 A property list is an alternating list of keywords and values.
|
|
|
1991 This function does order-insensitive comparisons of the property lists:
|
|
|
1992 For example, the property lists '(a 1 b 2) and '(b 2 a 1) are equal.
|
|
|
1993 Comparison between values is done using `eq'. See also `plists-equal'.
|
|
|
1994 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
1995 a nil value is ignored. This feature is a virus that has infected
|
|
16
|
1996 old Lisp implementations, but should not be used except for backward
|
|
|
1997 compatibility.
|
|
20
|
1998 */
|
|
|
1999 (a, b, nil_means_not_present))
|
|
0
|
2000 {
|
|
|
2001 return (plists_differ (a, b, !NILP (nil_means_not_present), 0, -1)
|
|
|
2002 ? Qnil : Qt);
|
|
|
2003 }
|
|
|
2004
|
|
20
|
2005 DEFUN ("plists-equal", Fplists_equal, 2, 3, 0, /*
|
|
0
|
2006 Return non-nil if property lists A and B are `equal'.
|
|
|
2007 A property list is an alternating list of keywords and values. This
|
|
|
2008 function does order-insensitive comparisons of the property lists: For
|
|
|
2009 example, the property lists '(a 1 b 2) and '(b 2 a 1) are equal.
|
|
|
2010 Comparison between values is done using `equal'. See also `plists-eq'.
|
|
|
2011 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
2012 a nil value is ignored. This feature is a virus that has infected
|
|
16
|
2013 old Lisp implementations, but should not be used except for backward
|
|
|
2014 compatibility.
|
|
20
|
2015 */
|
|
|
2016 (a, b, nil_means_not_present))
|
|
0
|
2017 {
|
|
|
2018 return (plists_differ (a, b, !NILP (nil_means_not_present), 0, 1)
|
|
|
2019 ? Qnil : Qt);
|
|
|
2020 }
|
|
|
2021
|
|
|
2022
|
|
20
|
2023 DEFUN ("lax-plists-eq", Flax_plists_eq, 2, 3, 0, /*
|
|
0
|
2024 Return non-nil if lax property lists A and B are `eq'.
|
|
|
2025 A property list is an alternating list of keywords and values.
|
|
|
2026 This function does order-insensitive comparisons of the property lists:
|
|
|
2027 For example, the property lists '(a 1 b 2) and '(b 2 a 1) are equal.
|
|
|
2028 Comparison between values is done using `eq'. See also `plists-equal'.
|
|
|
2029 A lax property list is like a regular one except that comparisons between
|
|
|
2030 keywords is done using `equal' instead of `eq'.
|
|
|
2031 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
2032 a nil value is ignored. This feature is a virus that has infected
|
|
16
|
2033 old Lisp implementations, but should not be used except for backward
|
|
|
2034 compatibility.
|
|
20
|
2035 */
|
|
|
2036 (a, b, nil_means_not_present))
|
|
0
|
2037 {
|
|
|
2038 return (plists_differ (a, b, !NILP (nil_means_not_present), 1, -1)
|
|
|
2039 ? Qnil : Qt);
|
|
|
2040 }
|
|
|
2041
|
|
20
|
2042 DEFUN ("lax-plists-equal", Flax_plists_equal, 2, 3, 0, /*
|
|
0
|
2043 Return non-nil if lax property lists A and B are `equal'.
|
|
|
2044 A property list is an alternating list of keywords and values. This
|
|
|
2045 function does order-insensitive comparisons of the property lists: For
|
|
|
2046 example, the property lists '(a 1 b 2) and '(b 2 a 1) are equal.
|
|
|
2047 Comparison between values is done using `equal'. See also `plists-eq'.
|
|
|
2048 A lax property list is like a regular one except that comparisons between
|
|
|
2049 keywords is done using `equal' instead of `eq'.
|
|
|
2050 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
2051 a nil value is ignored. This feature is a virus that has infected
|
|
16
|
2052 old Lisp implementations, but should not be used except for backward
|
|
|
2053 compatibility.
|
|
20
|
2054 */
|
|
|
2055 (a, b, nil_means_not_present))
|
|
0
|
2056 {
|
|
|
2057 return (plists_differ (a, b, !NILP (nil_means_not_present), 1, 1)
|
|
|
2058 ? Qnil : Qt);
|
|
|
2059 }
|
|
|
2060
|
|
|
2061 /* Return the value associated with key PROPERTY in property list PLIST.
|
|
|
2062 Return nil if key not found. This function is used for internal
|
|
|
2063 property lists that cannot be directly manipulated by the user.
|
|
|
2064 */
|
|
|
2065
|
|
|
2066 Lisp_Object
|
|
|
2067 internal_plist_get (Lisp_Object plist, Lisp_Object property)
|
|
|
2068 {
|
|
|
2069 Lisp_Object tail = plist;
|
|
|
2070
|
|
|
2071 for (; !NILP (tail); tail = XCDR (XCDR (tail)))
|
|
|
2072 {
|
|
|
2073 struct Lisp_Cons *c = XCONS (tail);
|
|
|
2074 if (EQ (c->car, property))
|
|
|
2075 return XCAR (c->cdr);
|
|
|
2076 }
|
|
|
2077
|
|
|
2078 return Qunbound;
|
|
|
2079 }
|
|
|
2080
|
|
|
2081 /* Set PLIST's value for PROPERTY to VALUE. Analogous to
|
|
|
2082 internal_plist_get(). */
|
|
|
2083
|
|
|
2084 void
|
|
|
2085 internal_plist_put (Lisp_Object *plist, Lisp_Object property,
|
|
|
2086 Lisp_Object value)
|
|
|
2087 {
|
|
|
2088 Lisp_Object tail = *plist;
|
|
|
2089
|
|
|
2090 for (; !NILP (tail); tail = XCDR (XCDR (tail)))
|
|
|
2091 {
|
|
|
2092 struct Lisp_Cons *c = XCONS (tail);
|
|
|
2093 if (EQ (c->car, property))
|
|
|
2094 {
|
|
|
2095 XCAR (c->cdr) = value;
|
|
|
2096 return;
|
|
|
2097 }
|
|
|
2098 }
|
|
|
2099
|
|
|
2100 *plist = Fcons (property, Fcons (value, *plist));
|
|
|
2101 }
|
|
|
2102
|
|
|
2103 int
|
|
|
2104 internal_remprop (Lisp_Object *plist, Lisp_Object property)
|
|
|
2105 {
|
|
|
2106 Lisp_Object tail = *plist;
|
|
|
2107
|
|
|
2108 if (NILP (tail))
|
|
|
2109 return 0;
|
|
|
2110
|
|
|
2111 if (EQ (XCAR (tail), property))
|
|
|
2112 {
|
|
|
2113 *plist = XCDR (XCDR (tail));
|
|
|
2114 return 1;
|
|
|
2115 }
|
|
|
2116
|
|
|
2117 for (tail = XCDR (tail); !NILP (XCDR (tail));
|
|
|
2118 tail = XCDR (XCDR (tail)))
|
|
|
2119 {
|
|
|
2120 struct Lisp_Cons *c = XCONS (tail);
|
|
|
2121 if (EQ (XCAR (c->cdr), property))
|
|
|
2122 {
|
|
|
2123 c->cdr = XCDR (XCDR (c->cdr));
|
|
|
2124 return 1;
|
|
|
2125 }
|
|
|
2126 }
|
|
|
2127
|
|
|
2128 return 0;
|
|
|
2129 }
|
|
|
2130
|
|
|
2131 /* Called on a malformed property list. BADPLACE should be some
|
|
|
2132 place where truncating will form a good list -- i.e. we shouldn't
|
|
|
2133 result in a list with an odd length. */
|
|
|
2134
|
|
|
2135 static Lisp_Object
|
|
|
2136 bad_bad_bunny (Lisp_Object *plist, Lisp_Object *badplace, Error_behavior errb)
|
|
|
2137 {
|
|
|
2138 if (ERRB_EQ (errb, ERROR_ME))
|
|
|
2139 return Fsignal (Qmalformed_property_list, list2 (*plist, *badplace));
|
|
|
2140 else
|
|
|
2141 {
|
|
|
2142 if (ERRB_EQ (errb, ERROR_ME_WARN))
|
|
|
2143 {
|
|
|
2144 warn_when_safe_lispobj
|
|
|
2145 (Qlist, Qwarning,
|
|
|
2146 list2 (build_string
|
|
|
2147 ("Malformed property list -- list has been truncated"),
|
|
|
2148 *plist));
|
|
|
2149 *badplace = Qnil;
|
|
|
2150 }
|
|
|
2151 return Qunbound;
|
|
|
2152 }
|
|
|
2153 }
|
|
|
2154
|
|
|
2155 /* Called on a circular property list. BADPLACE should be some place
|
|
|
2156 where truncating will result in an even-length list, as above.
|
|
|
2157 If doesn't particularly matter where we truncate -- anywhere we
|
|
|
2158 truncate along the entire list will break the circularity, because
|
|
|
2159 it will create a terminus and the list currently doesn't have one.
|
|
|
2160 */
|
|
|
2161
|
|
|
2162 static Lisp_Object
|
|
|
2163 bad_bad_turtle (Lisp_Object *plist, Lisp_Object *badplace, Error_behavior errb)
|
|
|
2164 {
|
|
|
2165 if (ERRB_EQ (errb, ERROR_ME))
|
|
|
2166 /* #### Eek, this will probably result in another error
|
|
|
2167 when PLIST is printed out */
|
|
|
2168 return Fsignal (Qcircular_property_list, list1 (*plist));
|
|
|
2169 else
|
|
|
2170 {
|
|
|
2171 if (ERRB_EQ (errb, ERROR_ME_WARN))
|
|
|
2172 {
|
|
|
2173 warn_when_safe_lispobj
|
|
|
2174 (Qlist, Qwarning,
|
|
|
2175 list2 (build_string
|
|
|
2176 ("Circular property list -- list has been truncated"),
|
|
|
2177 *plist));
|
|
|
2178 *badplace = Qnil;
|
|
|
2179 }
|
|
|
2180 return Qunbound;
|
|
|
2181 }
|
|
|
2182 }
|
|
|
2183
|
|
|
2184 /* Advance the tortoise pointer by two (one iteration of a property-list
|
|
|
2185 loop) and the hare pointer by four and verify that no malformations
|
|
|
2186 or circularities exist. If so, return zero and store a value into
|
|
|
2187 RETVAL that should be returned by the calling function. Otherwise,
|
|
|
2188 return 1. See external_plist_get().
|
|
|
2189 */
|
|
|
2190
|
|
|
2191 static int
|
|
|
2192 advance_plist_pointers (Lisp_Object *plist,
|
|
|
2193 Lisp_Object **tortoise, Lisp_Object **hare,
|
|
|
2194 Error_behavior errb, Lisp_Object *retval)
|
|
|
2195 {
|
|
|
2196 int i;
|
|
|
2197 Lisp_Object *tortsave = *tortoise;
|
|
|
2198
|
|
|
2199 /* Note that our "fixing" may be more brutal than necessary,
|
|
|
2200 but it's the user's own problem, not ours. if they went in and
|
|
|
2201 manually fucked up a plist. */
|
|
|
2202
|
|
|
2203 for (i = 0; i < 2; i++)
|
|
|
2204 {
|
|
|
2205 /* This is a standard iteration of a defensive-loop-checking
|
|
|
2206 loop. We just do it twice because we want to advance past
|
|
|
2207 both the property and its value.
|
|
|
2208
|
|
|
2209 If the pointer indirection is confusing you, remember that
|
|
|
2210 one level of indirection on the hare and tortoise pointers
|
|
|
2211 is only due to pass-by-reference for this function. The other
|
|
|
2212 level is so that the plist can be fixed in place. */
|
|
|
2213
|
|
|
2214 /* When we reach the end of a well-formed plist, **HARE is
|
|
|
2215 nil. In that case, we don't do anything at all except
|
|
|
2216 advance TORTOISE by one. Otherwise, we advance HARE
|
|
|
2217 by two (making sure it's OK to do so), then advance
|
|
|
2218 TORTOISE by one (it will always be OK to do so because
|
|
|
2219 the HARE is always ahead of the TORTOISE and will have
|
|
|
2220 already verified the path), then make sure TORTOISE and
|
|
|
2221 HARE don't contain the same non-nil object -- if the
|
|
|
2222 TORTOISE and the HARE ever meet, then obviously we're
|
|
|
2223 in a circularity, and if we're in a circularity, then
|
|
|
2224 the TORTOISE and the HARE can't cross paths without
|
|
|
2225 meeting, since the HARE only gains one step over the
|
|
|
2226 TORTOISE per iteration. */
|
|
|
2227
|
|
|
2228 if (!NILP (**hare))
|
|
|
2229 {
|
|
|
2230 Lisp_Object *haresave = *hare;
|
|
|
2231 if (!CONSP (**hare))
|
|
|
2232 {
|
|
|
2233 *retval = bad_bad_bunny (plist, haresave, errb);
|
|
|
2234 return 0;
|
|
|
2235 }
|
|
|
2236 *hare = &XCDR (**hare);
|
|
|
2237 /* In a non-plist, we'd check here for a nil value for
|
|
|
2238 **HARE, which is OK (it just means the list has an
|
|
|
2239 odd number of elements). In a plist, it's not OK
|
|
|
2240 for the list to have an odd number of elements. */
|
|
|
2241 if (!CONSP (**hare))
|
|
|
2242 {
|
|
|
2243 *retval = bad_bad_bunny (plist, haresave, errb);
|
|
|
2244 return 0;
|
|
|
2245 }
|
|
|
2246 *hare = &XCDR (**hare);
|
|
|
2247 }
|
|
|
2248
|
|
|
2249 *tortoise = &XCDR (**tortoise);
|
|
|
2250 if (!NILP (**hare) && EQ (**tortoise, **hare))
|
|
|
2251 {
|
|
|
2252 *retval = bad_bad_turtle (plist, tortsave, errb);
|
|
|
2253 return 0;
|
|
|
2254 }
|
|
|
2255 }
|
|
|
2256
|
|
|
2257 return 1;
|
|
|
2258 }
|
|
|
2259
|
|
|
2260 /* Return the value of PROPERTY from PLIST, or Qunbound if
|
|
|
2261 property is not on the list.
|
|
|
2262
|
|
|
2263 PLIST is a Lisp-accessible property list, meaning that it
|
|
|
2264 has to be checked for malformations and circularities.
|
|
|
2265
|
|
|
2266 If ERRB is ERROR_ME, an error will be signalled. Otherwise, the
|
|
|
2267 function will never signal an error; and if ERRB is ERROR_ME_WARN,
|
|
|
2268 on finding a malformation or a circularity, it issues a warning and
|
|
|
2269 attempts to silently fix the problem.
|
|
|
2270
|
|
|
2271 A pointer to PLIST is passed in so that PLIST can be successfully
|
|
|
2272 "fixed" even if the error is at the beginning of the plist. */
|
|
|
2273
|
|
|
2274 Lisp_Object
|
|
|
2275 external_plist_get (Lisp_Object *plist, Lisp_Object property,
|
|
|
2276 int laxp, Error_behavior errb)
|
|
|
2277 {
|
|
|
2278 Lisp_Object *tortoise = plist;
|
|
|
2279 Lisp_Object *hare = plist;
|
|
|
2280
|
|
|
2281 while (!NILP (*tortoise))
|
|
|
2282 {
|
|
|
2283 Lisp_Object *tortsave = tortoise;
|
|
|
2284 Lisp_Object retval;
|
|
|
2285
|
|
|
2286 /* We do the standard tortoise/hare march. We isolate the
|
|
|
2287 grungy stuff to do this in advance_plist_pointers(), though.
|
|
|
2288 To us, all this function does is advance the tortoise
|
|
|
2289 pointer by two and the hare pointer by four and make sure
|
|
|
2290 everything's OK. We first advance the pointers and then
|
|
|
2291 check if a property matched; this ensures that our
|
|
|
2292 check for a matching property is safe. */
|
|
|
2293
|
|
|
2294 if (!advance_plist_pointers (plist, &tortoise, &hare, errb, &retval))
|
|
|
2295 return retval;
|
|
|
2296
|
|
|
2297 if (!laxp ? EQ (XCAR (*tortsave), property)
|
|
|
2298 : internal_equal (XCAR (*tortsave), property, 0))
|
|
|
2299 return XCAR (XCDR (*tortsave));
|
|
|
2300 }
|
|
|
2301
|
|
|
2302 return Qunbound;
|
|
|
2303 }
|
|
|
2304
|
|
|
2305 /* Set PLIST's value for PROPERTY to VALUE, given a possibly
|
|
|
2306 malformed or circular plist. Analogous to external_plist_get(). */
|
|
|
2307
|
|
|
2308 void
|
|
|
2309 external_plist_put (Lisp_Object *plist, Lisp_Object property,
|
|
|
2310 Lisp_Object value, int laxp, Error_behavior errb)
|
|
|
2311 {
|
|
|
2312 Lisp_Object *tortoise = plist;
|
|
|
2313 Lisp_Object *hare = plist;
|
|
|
2314
|
|
|
2315 while (!NILP (*tortoise))
|
|
|
2316 {
|
|
|
2317 Lisp_Object *tortsave = tortoise;
|
|
|
2318 Lisp_Object retval;
|
|
|
2319
|
|
|
2320 /* See above */
|
|
|
2321 if (!advance_plist_pointers (plist, &tortoise, &hare, errb, &retval))
|
|
|
2322 return;
|
|
|
2323
|
|
|
2324 if (!laxp ? EQ (XCAR (*tortsave), property)
|
|
|
2325 : internal_equal (XCAR (*tortsave), property, 0))
|
|
|
2326 {
|
|
|
2327 XCAR (XCDR (*tortsave)) = value;
|
|
|
2328 return;
|
|
|
2329 }
|
|
|
2330 }
|
|
|
2331
|
|
|
2332 *plist = Fcons (property, Fcons (value, *plist));
|
|
|
2333 }
|
|
|
2334
|
|
|
2335 int
|
|
|
2336 external_remprop (Lisp_Object *plist, Lisp_Object property,
|
|
|
2337 int laxp, Error_behavior errb)
|
|
|
2338 {
|
|
|
2339 Lisp_Object *tortoise = plist;
|
|
|
2340 Lisp_Object *hare = plist;
|
|
|
2341
|
|
|
2342 while (!NILP (*tortoise))
|
|
|
2343 {
|
|
|
2344 Lisp_Object *tortsave = tortoise;
|
|
|
2345 Lisp_Object retval;
|
|
|
2346
|
|
|
2347 /* See above */
|
|
|
2348 if (!advance_plist_pointers (plist, &tortoise, &hare, errb, &retval))
|
|
|
2349 return 0;
|
|
|
2350
|
|
|
2351 if (!laxp ? EQ (XCAR (*tortsave), property)
|
|
|
2352 : internal_equal (XCAR (*tortsave), property, 0))
|
|
|
2353 {
|
|
|
2354 /* Now you see why it's so convenient to have that level
|
|
|
2355 of indirection. */
|
|
|
2356 *tortsave = XCDR (XCDR (*tortsave));
|
|
|
2357 return 1;
|
|
|
2358 }
|
|
|
2359 }
|
|
|
2360
|
|
|
2361 return 0;
|
|
|
2362 }
|
|
|
2363
|
|
20
|
2364 DEFUN ("plist-get", Fplist_get, 2, 3, 0, /*
|
|
0
|
2365 Extract a value from a property list.
|
|
|
2366 PLIST is a property list, which is a list of the form
|
|
|
2367 \(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value
|
|
|
2368 corresponding to the given PROP, or DEFAULT if PROP is not
|
|
|
2369 one of the properties on the list.
|
|
20
|
2370 */
|
|
|
2371 (plist, prop, defalt)) /* Cant spel in C */
|
|
0
|
2372 {
|
|
|
2373 Lisp_Object val = external_plist_get (&plist, prop, 0, ERROR_ME);
|
|
|
2374 if (UNBOUNDP (val))
|
|
|
2375 return defalt;
|
|
|
2376 return val;
|
|
|
2377 }
|
|
|
2378
|
|
20
|
2379 DEFUN ("plist-put", Fplist_put, 3, 3, 0, /*
|
|
0
|
2380 Change value in PLIST of PROP to VAL.
|
|
|
2381 PLIST is a property list, which is a list of the form \(PROP1 VALUE1
|
|
|
2382 PROP2 VALUE2 ...). PROP is usually a symbol and VAL is any object.
|
|
|
2383 If PROP is already a property on the list, its value is set to VAL,
|
|
|
2384 otherwise the new PROP VAL pair is added. The new plist is returned;
|
|
|
2385 use `(setq x (plist-put x prop val))' to be sure to use the new value.
|
|
|
2386 The PLIST is modified by side effects.
|
|
20
|
2387 */
|
|
|
2388 (plist, prop, val))
|
|
0
|
2389 {
|
|
|
2390 external_plist_put (&plist, prop, val, 0, ERROR_ME);
|
|
|
2391 return plist;
|
|
|
2392 }
|
|
|
2393
|
|
20
|
2394 DEFUN ("plist-remprop", Fplist_remprop, 2, 2, 0, /*
|
|
0
|
2395 Remove from PLIST the property PROP and its value.
|
|
|
2396 PLIST is a property list, which is a list of the form \(PROP1 VALUE1
|
|
|
2397 PROP2 VALUE2 ...). PROP is usually a symbol. The new plist is
|
|
|
2398 returned; use `(setq x (plist-remprop x prop val))' to be sure to use
|
|
|
2399 the new value. The PLIST is modified by side effects.
|
|
20
|
2400 */
|
|
|
2401 (plist, prop))
|
|
0
|
2402 {
|
|
|
2403 external_remprop (&plist, prop, 0, ERROR_ME);
|
|
|
2404 return plist;
|
|
|
2405 }
|
|
|
2406
|
|
20
|
2407 DEFUN ("plist-member", Fplist_member, 2, 2, 0, /*
|
|
0
|
2408 Return t if PROP has a value specified in PLIST.
|
|
20
|
2409 */
|
|
|
2410 (plist, prop))
|
|
0
|
2411 {
|
|
|
2412 return UNBOUNDP (Fplist_get (plist, prop, Qunbound)) ? Qnil : Qt;
|
|
|
2413 }
|
|
|
2414
|
|
20
|
2415 DEFUN ("check-valid-plist", Fcheck_valid_plist, 1, 1, 0, /*
|
|
0
|
2416 Given a plist, signal an error if there is anything wrong with it.
|
|
|
2417 This means that it's a malformed or circular plist.
|
|
20
|
2418 */
|
|
|
2419 (plist))
|
|
0
|
2420 {
|
|
|
2421 Lisp_Object *tortoise;
|
|
|
2422 Lisp_Object *hare;
|
|
|
2423
|
|
|
2424 start_over:
|
|
|
2425 tortoise = &plist;
|
|
|
2426 hare = &plist;
|
|
|
2427 while (!NILP (*tortoise))
|
|
|
2428 {
|
|
|
2429 Lisp_Object retval;
|
|
|
2430
|
|
|
2431 /* See above */
|
|
|
2432 if (!advance_plist_pointers (&plist, &tortoise, &hare, ERROR_ME,
|
|
|
2433 &retval))
|
|
|
2434 goto start_over;
|
|
|
2435 }
|
|
|
2436
|
|
|
2437 return Qnil;
|
|
|
2438 }
|
|
|
2439
|
|
20
|
2440 DEFUN ("valid-plist-p", Fvalid_plist_p, 1, 1, 0, /*
|
|
0
|
2441 Given a plist, return non-nil if its format is correct.
|
|
|
2442 If it returns nil, `check-valid-plist' will signal an error when given
|
|
|
2443 the plist; that means it's a malformed or circular plist or has non-symbols
|
|
|
2444 as keywords.
|
|
20
|
2445 */
|
|
|
2446 (plist))
|
|
0
|
2447 {
|
|
|
2448 Lisp_Object *tortoise;
|
|
|
2449 Lisp_Object *hare;
|
|
|
2450
|
|
|
2451 tortoise = &plist;
|
|
|
2452 hare = &plist;
|
|
|
2453 while (!NILP (*tortoise))
|
|
|
2454 {
|
|
|
2455 Lisp_Object retval;
|
|
|
2456
|
|
|
2457 /* See above */
|
|
|
2458 if (!advance_plist_pointers (&plist, &tortoise, &hare, ERROR_ME_NOT,
|
|
|
2459 &retval))
|
|
|
2460 return Qnil;
|
|
|
2461 }
|
|
|
2462
|
|
|
2463 return Qt;
|
|
|
2464 }
|
|
|
2465
|
|
20
|
2466 DEFUN ("canonicalize-plist", Fcanonicalize_plist, 1, 2, 0, /*
|
|
0
|
2467 Destructively remove any duplicate entries from a plist.
|
|
|
2468 In such cases, the first entry applies.
|
|
|
2469
|
|
|
2470 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
2471 a nil value is removed. This feature is a virus that has infected
|
|
16
|
2472 old Lisp implementations, but should not be used except for backward
|
|
|
2473 compatibility.
|
|
0
|
2474
|
|
|
2475 The new plist is returned. If NIL-MEANS-NOT-PRESENT is given, the
|
|
|
2476 return value may not be EQ to the passed-in value, so make sure to
|
|
|
2477 `setq' the value back into where it came from.
|
|
20
|
2478 */
|
|
|
2479 (plist, nil_means_not_present))
|
|
0
|
2480 {
|
|
|
2481 Lisp_Object head = plist;
|
|
|
2482
|
|
|
2483 Fcheck_valid_plist (plist);
|
|
|
2484
|
|
|
2485 while (!NILP (plist))
|
|
|
2486 {
|
|
|
2487 Lisp_Object prop = Fcar (plist);
|
|
|
2488 Lisp_Object next = Fcdr (plist);
|
|
|
2489
|
|
|
2490 CHECK_CONS (next); /* just make doubly sure we catch any errors */
|
|
|
2491 if (!NILP (nil_means_not_present) && NILP (Fcar (next)))
|
|
|
2492 {
|
|
|
2493 if (EQ (head, plist))
|
|
|
2494 head = Fcdr (next);
|
|
|
2495 plist = Fcdr (next);
|
|
|
2496 continue;
|
|
|
2497 }
|
|
|
2498 /* external_remprop returns 1 if it removed any property.
|
|
|
2499 We have to loop till it didn't remove anything, in case
|
|
|
2500 the property occurs many times. */
|
|
|
2501 while (external_remprop (&XCDR (next), prop, 0, ERROR_ME));
|
|
|
2502 plist = Fcdr (next);
|
|
|
2503 }
|
|
|
2504
|
|
|
2505 return head;
|
|
|
2506 }
|
|
|
2507
|
|
20
|
2508 DEFUN ("lax-plist-get", Flax_plist_get, 2, 3, 0, /*
|
|
0
|
2509 Extract a value from a lax property list.
|
|
|
2510
|
|
|
2511 LAX-PLIST is a lax property list, which is a list of the form \(PROP1
|
|
|
2512 VALUE1 PROP2 VALUE2...), where comparions between properties is done
|
|
|
2513 using `equal' instead of `eq'. This function returns the value
|
|
|
2514 corresponding to the given PROP, or DEFAULT if PROP is not one of the
|
|
|
2515 properties on the list.
|
|
20
|
2516 */
|
|
|
2517 (lax_plist, prop, defalt)) /* Cant spel in C */
|
|
0
|
2518 {
|
|
|
2519 Lisp_Object val = external_plist_get (&lax_plist, prop, 1, ERROR_ME);
|
|
|
2520 if (UNBOUNDP (val))
|
|
|
2521 return defalt;
|
|
|
2522 return val;
|
|
|
2523 }
|
|
|
2524
|
|
20
|
2525 DEFUN ("lax-plist-put", Flax_plist_put, 3, 3, 0, /*
|
|
0
|
2526 Change value in LAX-PLIST of PROP to VAL.
|
|
|
2527 LAX-PLIST is a lax property list, which is a list of the form \(PROP1
|
|
|
2528 VALUE1 PROP2 VALUE2...), where comparions between properties is done
|
|
|
2529 using `equal' instead of `eq'. PROP is usually a symbol and VAL is
|
|
|
2530 any object. If PROP is already a property on the list, its value is
|
|
|
2531 set to VAL, otherwise the new PROP VAL pair is added. The new plist
|
|
|
2532 is returned; use `(setq x (lax-plist-put x prop val))' to be sure to
|
|
|
2533 use the new value. The LAX-PLIST is modified by side effects.
|
|
20
|
2534 */
|
|
|
2535 (lax_plist, prop, val))
|
|
0
|
2536 {
|
|
|
2537 external_plist_put (&lax_plist, prop, val, 1, ERROR_ME);
|
|
|
2538 return lax_plist;
|
|
|
2539 }
|
|
|
2540
|
|
20
|
2541 DEFUN ("lax-plist-remprop", Flax_plist_remprop, 2, 2, 0, /*
|
|
0
|
2542 Remove from LAX-PLIST the property PROP and its value.
|
|
|
2543 LAX-PLIST is a lax property list, which is a list of the form \(PROP1
|
|
|
2544 VALUE1 PROP2 VALUE2...), where comparions between properties is done
|
|
|
2545 using `equal' instead of `eq'. PROP is usually a symbol. The new
|
|
|
2546 plist is returned; use `(setq x (lax-plist-remprop x prop val))' to be
|
|
|
2547 sure to use the new value. The LAX-PLIST is modified by side effects.
|
|
20
|
2548 */
|
|
|
2549 (lax_plist, prop))
|
|
0
|
2550 {
|
|
|
2551 external_remprop (&lax_plist, prop, 1, ERROR_ME);
|
|
|
2552 return lax_plist;
|
|
|
2553 }
|
|
|
2554
|
|
20
|
2555 DEFUN ("lax-plist-member", Flax_plist_member, 2, 2, 0, /*
|
|
0
|
2556 Return t if PROP has a value specified in LAX-PLIST.
|
|
|
2557 LAX-PLIST is a lax property list, which is a list of the form \(PROP1
|
|
|
2558 VALUE1 PROP2 VALUE2...), where comparions between properties is done
|
|
|
2559 using `equal' instead of `eq'.
|
|
20
|
2560 */
|
|
|
2561 (lax_plist, prop))
|
|
0
|
2562 {
|
|
|
2563 return UNBOUNDP (Flax_plist_get (lax_plist, prop, Qunbound)) ? Qnil : Qt;
|
|
|
2564 }
|
|
|
2565
|
|
20
|
2566 DEFUN ("canonicalize-lax-plist", Fcanonicalize_lax_plist, 1, 2, 0, /*
|
|
0
|
2567 Destructively remove any duplicate entries from a lax plist.
|
|
|
2568 In such cases, the first entry applies.
|
|
|
2569
|
|
|
2570 If optional arg NIL-MEANS-NOT-PRESENT is non-nil, then a property with
|
|
|
2571 a nil value is removed. This feature is a virus that has infected
|
|
16
|
2572 old Lisp implementations, but should not be used except for backward
|
|
|
2573 compatibility.
|
|
0
|
2574
|
|
|
2575 The new plist is returned. If NIL-MEANS-NOT-PRESENT is given, the
|
|
|
2576 return value may not be EQ to the passed-in value, so make sure to
|
|
|
2577 `setq' the value back into where it came from.
|
|
20
|
2578 */
|
|
|
2579 (lax_plist, nil_means_not_present))
|
|
0
|
2580 {
|
|
|
2581 Lisp_Object head = lax_plist;
|
|
|
2582
|
|
|
2583 Fcheck_valid_plist (lax_plist);
|
|
|
2584
|
|
|
2585 while (!NILP (lax_plist))
|
|
|
2586 {
|
|
|
2587 Lisp_Object prop = Fcar (lax_plist);
|
|
|
2588 Lisp_Object next = Fcdr (lax_plist);
|
|
|
2589
|
|
|
2590 CHECK_CONS (next); /* just make doubly sure we catch any errors */
|
|
|
2591 if (!NILP (nil_means_not_present) && NILP (Fcar (next)))
|
|
|
2592 {
|
|
|
2593 if (EQ (head, lax_plist))
|
|
|
2594 head = Fcdr (next);
|
|
|
2595 lax_plist = Fcdr (next);
|
|
|
2596 continue;
|
|
|
2597 }
|
|
|
2598 /* external_remprop returns 1 if it removed any property.
|
|
|
2599 We have to loop till it didn't remove anything, in case
|
|
|
2600 the property occurs many times. */
|
|
|
2601 while (external_remprop (&XCDR (next), prop, 1, ERROR_ME));
|
|
|
2602 lax_plist = Fcdr (next);
|
|
|
2603 }
|
|
|
2604
|
|
|
2605 return head;
|
|
|
2606 }
|
|
|
2607
|
|
|
2608 /* In C because the frame props stuff uses it */
|
|
|
2609
|
|
20
|
2610 DEFUN ("destructive-alist-to-plist", Fdestructive_alist_to_plist, 1, 1, 0, /*
|
|
0
|
2611 Convert association list ALIST into the equivalent property-list form.
|
|
|
2612 The plist is returned. This converts from
|
|
|
2613
|
|
|
2614 \((a . 1) (b . 2) (c . 3))
|
|
|
2615
|
|
|
2616 into
|
|
|
2617
|
|
|
2618 \(a 1 b 2 c 3)
|
|
|
2619
|
|
|
2620 The original alist is destroyed in the process of constructing the plist.
|
|
|
2621 See also `alist-to-plist'.
|
|
20
|
2622 */
|
|
|
2623 (alist))
|
|
0
|
2624 {
|
|
|
2625 Lisp_Object head = alist;
|
|
|
2626 while (!NILP (alist))
|
|
|
2627 {
|
|
|
2628 /* remember the alist element. */
|
|
|
2629 Lisp_Object el = Fcar (alist);
|
|
|
2630
|
|
|
2631 Fsetcar (alist, Fcar (el));
|
|
|
2632 Fsetcar (el, Fcdr (el));
|
|
|
2633 Fsetcdr (el, Fcdr (alist));
|
|
|
2634 Fsetcdr (alist, el);
|
|
|
2635 alist = Fcdr (Fcdr (alist));
|
|
|
2636 }
|
|
|
2637
|
|
|
2638 return head;
|
|
|
2639 }
|
|
|
2640
|
|
|
2641 /* Symbol plists are directly accessible, so we need to protect against
|
|
|
2642 invalid property list structure */
|
|
|
2643
|
|
|
2644 static Lisp_Object
|
|
|
2645 symbol_getprop (Lisp_Object sym, Lisp_Object propname, Lisp_Object defalt)
|
|
|
2646 {
|
|
|
2647 Lisp_Object val = external_plist_get (&XSYMBOL (sym)->plist, propname,
|
|
|
2648 0, ERROR_ME);
|
|
|
2649 if (UNBOUNDP (val))
|
|
|
2650 return defalt;
|
|
|
2651 return val;
|
|
|
2652 }
|
|
|
2653
|
|
|
2654 static void
|
|
|
2655 symbol_putprop (Lisp_Object sym, Lisp_Object propname, Lisp_Object value)
|
|
|
2656 {
|
|
|
2657 external_plist_put (&XSYMBOL (sym)->plist, propname, value, 0, ERROR_ME);
|
|
|
2658 }
|
|
|
2659
|
|
|
2660 static int
|
|
|
2661 symbol_remprop (Lisp_Object symbol, Lisp_Object propname)
|
|
|
2662 {
|
|
|
2663 return external_remprop (&XSYMBOL (symbol)->plist, propname, 0, ERROR_ME);
|
|
|
2664 }
|
|
|
2665
|
|
|
2666 /* We store the string's extent info as the first element of the string's
|
|
|
2667 property list; and the string's MODIFF as the first or second element
|
|
|
2668 of the string's property list (depending on whether the extent info
|
|
|
2669 is present), but only if the string has been modified. This is ugly
|
|
|
2670 but it reduces the memory allocated for the string in the vast
|
|
|
2671 majority of cases, where the string is never modified and has no
|
|
|
2672 extent info. */
|
|
|
2673
|
|
|
2674
|
|
|
2675 static Lisp_Object *
|
|
|
2676 string_plist_ptr (struct Lisp_String *s)
|
|
|
2677 {
|
|
|
2678 Lisp_Object *ptr = &s->plist;
|
|
|
2679
|
|
|
2680 if (CONSP (*ptr) && EXTENT_INFOP (XCAR (*ptr)))
|
|
|
2681 ptr = &XCDR (*ptr);
|
|
|
2682 if (CONSP (*ptr) && INTP (XCAR (*ptr)))
|
|
|
2683 ptr = &XCDR (*ptr);
|
|
|
2684 return ptr;
|
|
|
2685 }
|
|
|
2686
|
|
|
2687 Lisp_Object
|
|
|
2688 string_getprop (struct Lisp_String *s, Lisp_Object property,
|
|
|
2689 Lisp_Object defalt)
|
|
|
2690 {
|
|
|
2691 Lisp_Object val = external_plist_get (string_plist_ptr (s), property, 0,
|
|
|
2692 ERROR_ME);
|
|
|
2693 if (UNBOUNDP (val))
|
|
|
2694 return defalt;
|
|
|
2695 return val;
|
|
|
2696 }
|
|
|
2697
|
|
|
2698 void
|
|
|
2699 string_putprop (struct Lisp_String *s, Lisp_Object property,
|
|
|
2700 Lisp_Object value)
|
|
|
2701 {
|
|
|
2702 external_plist_put (string_plist_ptr (s), property, value, 0, ERROR_ME);
|
|
|
2703 }
|
|
|
2704
|
|
|
2705 static int
|
|
|
2706 string_remprop (struct Lisp_String *s, Lisp_Object property)
|
|
|
2707 {
|
|
|
2708 return external_remprop (string_plist_ptr (s), property, 0, ERROR_ME);
|
|
|
2709 }
|
|
|
2710
|
|
|
2711 static Lisp_Object
|
|
|
2712 string_plist (struct Lisp_String *s)
|
|
|
2713 {
|
|
|
2714 return *string_plist_ptr (s);
|
|
|
2715 }
|
|
|
2716
|
|
20
|
2717 DEFUN ("get", Fget, 2, 3, 0, /*
|
|
0
|
2718 Return the value of OBJECT's PROPNAME property.
|
|
|
2719 This is the last VALUE stored with `(put OBJECT PROPNAME VALUE)'.
|
|
|
2720 If there is no such property, return optional third arg DEFAULT
|
|
|
2721 (which defaults to `nil'). OBJECT can be a symbol, face, extent,
|
|
|
2722 or string. See also `put', `remprop', and `object-plist'.
|
|
20
|
2723 */
|
|
70
|
2724 (object, propname, defalt)) /* Cant spel in C */
|
|
0
|
2725 {
|
|
|
2726 Lisp_Object val;
|
|
|
2727
|
|
|
2728 /* Various places in emacs call Fget() and expect it not to quit,
|
|
|
2729 so don't quit. */
|
|
|
2730
|
|
|
2731 /* It's easiest to treat symbols specially because they may not
|
|
|
2732 be an lrecord */
|
|
|
2733 if (SYMBOLP (object))
|
|
|
2734 val = symbol_getprop (object, propname, defalt);
|
|
|
2735 else if (STRINGP (object))
|
|
|
2736 val = string_getprop (XSTRING (object), propname, defalt);
|
|
|
2737 else if (LRECORDP (object))
|
|
|
2738 {
|
|
|
2739 CONST struct lrecord_implementation
|
|
|
2740 *imp = XRECORD_LHEADER (object)->implementation;
|
|
|
2741 if (imp->getprop)
|
|
|
2742 {
|
|
|
2743 val = (imp->getprop) (object, propname);
|
|
|
2744 if (UNBOUNDP (val))
|
|
|
2745 val = defalt;
|
|
|
2746 }
|
|
|
2747 else
|
|
|
2748 goto noprops;
|
|
|
2749 }
|
|
|
2750 else
|
|
|
2751 {
|
|
|
2752 noprops:
|
|
|
2753 signal_simple_error ("Object type has no properties", object);
|
|
|
2754 }
|
|
|
2755
|
|
|
2756 return val;
|
|
|
2757 }
|
|
|
2758
|
|
20
|
2759 DEFUN ("put", Fput, 3, 3, 0, /*
|
|
0
|
2760 Store OBJECT's PROPNAME property with value VALUE.
|
|
|
2761 It can be retrieved with `(get OBJECT PROPNAME)'. OBJECT can be a
|
|
|
2762 symbol, face, extent, or string.
|
|
|
2763
|
|
|
2764 For a string, no properties currently have predefined meanings.
|
|
|
2765 For the predefined properties for extents, see `set-extent-property'.
|
|
|
2766 For the predefined properties for faces, see `set-face-property'.
|
|
|
2767
|
|
|
2768 See also `get', `remprop', and `object-plist'.
|
|
20
|
2769 */
|
|
|
2770 (object, propname, value))
|
|
0
|
2771 {
|
|
|
2772 CHECK_SYMBOL (propname);
|
|
|
2773 CHECK_IMPURE (object);
|
|
|
2774
|
|
|
2775 if (SYMBOLP (object))
|
|
|
2776 symbol_putprop (object, propname, value);
|
|
|
2777 else if (STRINGP (object))
|
|
|
2778 string_putprop (XSTRING (object), propname, value);
|
|
|
2779 else if (LRECORDP (object))
|
|
|
2780 {
|
|
|
2781 CONST struct lrecord_implementation
|
|
|
2782 *imp = XRECORD_LHEADER (object)->implementation;
|
|
|
2783 if (imp->putprop)
|
|
|
2784 {
|
|
|
2785 if (! (imp->putprop) (object, propname, value))
|
|
|
2786 signal_simple_error ("Can't set property on object", propname);
|
|
|
2787 }
|
|
|
2788 else
|
|
|
2789 goto noprops;
|
|
|
2790 }
|
|
|
2791 else
|
|
|
2792 {
|
|
|
2793 noprops:
|
|
|
2794 signal_simple_error ("Object type has no settable properties", object);
|
|
|
2795 }
|
|
|
2796
|
|
|
2797 return value;
|
|
|
2798 }
|
|
|
2799
|
|
|
2800 void
|
|
|
2801 pure_put (Lisp_Object sym, Lisp_Object prop, Lisp_Object val)
|
|
|
2802 {
|
|
|
2803 Fput (sym, prop, Fpurecopy (val));
|
|
|
2804 }
|
|
|
2805
|
|
20
|
2806 DEFUN ("remprop", Fremprop, 2, 2, 0, /*
|
|
0
|
2807 Remove from OBJECT's property list the property PROPNAME and its
|
|
|
2808 value. OBJECT can be a symbol, face, extent, or string. Returns
|
|
|
2809 non-nil if the property list was actually changed (i.e. if PROPNAME
|
|
|
2810 was present in the property list). See also `get', `put', and
|
|
|
2811 `object-plist'.
|
|
20
|
2812 */
|
|
|
2813 (object, propname))
|
|
0
|
2814 {
|
|
|
2815 int retval = 0;
|
|
|
2816
|
|
|
2817 CHECK_SYMBOL (propname);
|
|
|
2818 CHECK_IMPURE (object);
|
|
|
2819
|
|
|
2820 if (SYMBOLP (object))
|
|
|
2821 retval = symbol_remprop (object, propname);
|
|
|
2822 else if (STRINGP (object))
|
|
|
2823 retval = string_remprop (XSTRING (object), propname);
|
|
|
2824 else if (LRECORDP (object))
|
|
|
2825 {
|
|
|
2826 CONST struct lrecord_implementation
|
|
|
2827 *imp = XRECORD_LHEADER (object)->implementation;
|
|
|
2828 if (imp->remprop)
|
|
|
2829 {
|
|
|
2830 retval = (imp->remprop) (object, propname);
|
|
|
2831 if (retval == -1)
|
|
|
2832 signal_simple_error ("Can't remove property from object",
|
|
|
2833 propname);
|
|
|
2834 }
|
|
|
2835 else
|
|
|
2836 goto noprops;
|
|
|
2837 }
|
|
|
2838 else
|
|
|
2839 {
|
|
|
2840 noprops:
|
|
|
2841 signal_simple_error ("Object type has no removable properties", object);
|
|
|
2842 }
|
|
|
2843
|
|
|
2844 return retval ? Qt : Qnil;
|
|
|
2845 }
|
|
|
2846
|
|
20
|
2847 DEFUN ("object-plist", Fobject_plist, 1, 1, 0, /*
|
|
0
|
2848 Return a property list of OBJECT's props.
|
|
|
2849 For a symbol this is equivalent to `symbol-plist'.
|
|
|
2850 Do not modify the property list directly; this may or may not have
|
|
|
2851 the desired effects. (In particular, for a property with a special
|
|
|
2852 interpretation, this will probably have no effect at all.)
|
|
20
|
2853 */
|
|
|
2854 (object))
|
|
0
|
2855 {
|
|
|
2856 if (SYMBOLP (object))
|
|
|
2857 return Fsymbol_plist (object);
|
|
|
2858 else if (STRINGP (object))
|
|
|
2859 return string_plist (XSTRING (object));
|
|
|
2860 else if (LRECORDP (object))
|
|
|
2861 {
|
|
|
2862 CONST struct lrecord_implementation
|
|
|
2863 *imp = XRECORD_LHEADER (object)->implementation;
|
|
|
2864 if (imp->plist)
|
|
|
2865 return (imp->plist) (object);
|
|
|
2866 else
|
|
|
2867 signal_simple_error ("Object type has no properties", object);
|
|
|
2868 }
|
|
|
2869 else
|
|
|
2870 signal_simple_error ("Object type has no properties", object);
|
|
|
2871
|
|
|
2872 return Qnil;
|
|
|
2873 }
|
|
|
2874
|
|
|
2875
|
|
|
2876 int
|
|
|
2877 internal_equal (Lisp_Object o1, Lisp_Object o2, int depth)
|
|
|
2878 {
|
|
|
2879 if (depth > 200)
|
|
|
2880 error ("Stack overflow in equal");
|
|
|
2881 do_cdr:
|
|
|
2882 QUIT;
|
|
70
|
2883 if (EQ_WITH_EBOLA_NOTICE (o1, o2))
|
|
149
|
2884 return 1;
|
|
0
|
2885 /* Note that (equal 20 20.0) should be nil */
|
|
|
2886 else if (XTYPE (o1) != XTYPE (o2))
|
|
149
|
2887 return 0;
|
|
0
|
2888 else if (CONSP (o1))
|
|
|
2889 {
|
|
|
2890 if (!internal_equal (Fcar (o1), Fcar (o2), depth + 1))
|
|
149
|
2891 return 0;
|
|
0
|
2892 o1 = Fcdr (o1);
|
|
|
2893 o2 = Fcdr (o2);
|
|
|
2894 goto do_cdr;
|
|
|
2895 }
|
|
|
2896
|
|
|
2897 #ifndef LRECORD_VECTOR
|
|
|
2898 else if (VECTORP (o1))
|
|
|
2899 {
|
|
|
2900 int indecks;
|
|
|
2901 int len = vector_length (XVECTOR (o1));
|
|
|
2902 if (len != vector_length (XVECTOR (o2)))
|
|
149
|
2903 return 0;
|
|
0
|
2904 for (indecks = 0; indecks < len; indecks++)
|
|
|
2905 {
|
|
|
2906 Lisp_Object v1, v2;
|
|
|
2907 v1 = vector_data (XVECTOR (o1)) [indecks];
|
|
|
2908 v2 = vector_data (XVECTOR (o2)) [indecks];
|
|
|
2909 if (!internal_equal (v1, v2, depth + 1))
|
|
149
|
2910 return 0;
|
|
0
|
2911 }
|
|
149
|
2912 return 1;
|
|
0
|
2913 }
|
|
|
2914 #endif /* !LRECORD_VECTOR */
|
|
|
2915 else if (STRINGP (o1))
|
|
|
2916 {
|
|
14
|
2917 Bytecount len = XSTRING_LENGTH (o1);
|
|
|
2918 if (len != XSTRING_LENGTH (o2))
|
|
149
|
2919 return 0;
|
|
14
|
2920 if (memcmp (XSTRING_DATA (o1), XSTRING_DATA (o2), len))
|
|
149
|
2921 return 0;
|
|
|
2922 return 1;
|
|
0
|
2923 }
|
|
|
2924 else if (LRECORDP (o1))
|
|
|
2925 {
|
|
|
2926 CONST struct lrecord_implementation
|
|
|
2927 *imp1 = XRECORD_LHEADER (o1)->implementation,
|
|
|
2928 *imp2 = XRECORD_LHEADER (o2)->implementation;
|
|
|
2929 if (imp1 != imp2)
|
|
149
|
2930 return 0;
|
|
0
|
2931 else if (imp1->equal == 0)
|
|
|
2932 /* EQ-ness of the objects was noticed above */
|
|
149
|
2933 return 0;
|
|
0
|
2934 else
|
|
149
|
2935 return (imp1->equal) (o1, o2, depth);
|
|
0
|
2936 }
|
|
|
2937
|
|
149
|
2938 return 0;
|
|
0
|
2939 }
|
|
|
2940
|
|
70
|
2941 /* Note that we may be calling sub-objects that will use
|
|
|
2942 internal_equal() (instead of internal_old_equal()). Oh well.
|
|
|
2943 We will get an Ebola note if there's any possibility of confusion,
|
|
|
2944 but that seems unlikely. */
|
|
|
2945
|
|
|
2946 static int
|
|
|
2947 internal_old_equal (Lisp_Object o1, Lisp_Object o2, int depth)
|
|
|
2948 {
|
|
|
2949 if (depth > 200)
|
|
|
2950 error ("Stack overflow in equal");
|
|
|
2951 do_cdr:
|
|
|
2952 QUIT;
|
|
|
2953 if (HACKEQ_UNSAFE (o1, o2))
|
|
149
|
2954 return 1;
|
|
70
|
2955 /* Note that (equal 20 20.0) should be nil */
|
|
|
2956 else if (XTYPE (o1) != XTYPE (o2))
|
|
149
|
2957 return 0;
|
|
70
|
2958 else if (CONSP (o1))
|
|
|
2959 {
|
|
|
2960 if (!internal_old_equal (Fcar (o1), Fcar (o2), depth + 1))
|
|
149
|
2961 return 0;
|
|
70
|
2962 o1 = Fcdr (o1);
|
|
|
2963 o2 = Fcdr (o2);
|
|
|
2964 goto do_cdr;
|
|
|
2965 }
|
|
|
2966
|
|
|
2967 #ifndef LRECORD_VECTOR
|
|
|
2968 else if (VECTORP (o1))
|
|
|
2969 {
|
|
|
2970 int indecks;
|
|
|
2971 int len = vector_length (XVECTOR (o1));
|
|
|
2972 if (len != vector_length (XVECTOR (o2)))
|
|
149
|
2973 return 0;
|
|
70
|
2974 for (indecks = 0; indecks < len; indecks++)
|
|
|
2975 {
|
|
|
2976 Lisp_Object v1, v2;
|
|
|
2977 v1 = vector_data (XVECTOR (o1)) [indecks];
|
|
|
2978 v2 = vector_data (XVECTOR (o2)) [indecks];
|
|
|
2979 if (!internal_old_equal (v1, v2, depth + 1))
|
|
149
|
2980 return 0;
|
|
70
|
2981 }
|
|
149
|
2982 return 1;
|
|
70
|
2983 }
|
|
|
2984 #endif /* !LRECORD_VECTOR */
|
|
|
2985 else if (STRINGP (o1))
|
|
|
2986 {
|
|
|
2987 Bytecount len = XSTRING_LENGTH (o1);
|
|
|
2988 if (len != XSTRING_LENGTH (o2))
|
|
149
|
2989 return 0;
|
|
70
|
2990 if (memcmp (XSTRING_DATA (o1), XSTRING_DATA (o2), len))
|
|
149
|
2991 return 0;
|
|
|
2992 return 1;
|
|
70
|
2993 }
|
|
|
2994 else if (LRECORDP (o1))
|
|
|
2995 {
|
|
|
2996 CONST struct lrecord_implementation
|
|
|
2997 *imp1 = XRECORD_LHEADER (o1)->implementation,
|
|
|
2998 *imp2 = XRECORD_LHEADER (o2)->implementation;
|
|
|
2999 if (imp1 != imp2)
|
|
149
|
3000 return 0;
|
|
70
|
3001 else if (imp1->equal == 0)
|
|
|
3002 /* EQ-ness of the objects was noticed above */
|
|
149
|
3003 return 0;
|
|
70
|
3004 else
|
|
|
3005 return ((imp1->equal) (o1, o2, depth));
|
|
|
3006 }
|
|
|
3007
|
|
149
|
3008 return 0;
|
|
70
|
3009 }
|
|
|
3010
|
|
20
|
3011 DEFUN ("equal", Fequal, 2, 2, 0, /*
|
|
0
|
3012 T if two Lisp objects have similar structure and contents.
|
|
|
3013 They must have the same data type.
|
|
|
3014 Conses are compared by comparing the cars and the cdrs.
|
|
|
3015 Vectors and strings are compared element by element.
|
|
|
3016 Numbers are compared by value. Symbols must match exactly.
|
|
20
|
3017 */
|
|
|
3018 (o1, o2))
|
|
0
|
3019 {
|
|
149
|
3020 return internal_equal (o1, o2, 0) ? Qt : Qnil;
|
|
0
|
3021 }
|
|
|
3022
|
|
70
|
3023 DEFUN ("old-equal", Fold_equal, 2, 2, 0, /*
|
|
|
3024 T if two Lisp objects have similar structure and contents.
|
|
|
3025 They must have the same data type.
|
|
|
3026 \(Note, however, that an exception is made for characters and integers;
|
|
|
3027 this is known as the \"char-int confoundance disease.\" See `eq' and
|
|
|
3028 `old-eq'.)
|
|
|
3029 This function is provided only for byte-code compatibility with v19.
|
|
|
3030 Do not use it.
|
|
|
3031 */
|
|
|
3032 (o1, o2))
|
|
|
3033 {
|
|
149
|
3034 return internal_old_equal (o1, o2, 0) ? Qt : Qnil;
|
|
70
|
3035 }
|
|
|
3036
|
|
0
|
3037
|
|
20
|
3038 DEFUN ("fillarray", Ffillarray, 2, 2, 0, /*
|
|
0
|
3039 Store each element of ARRAY with ITEM.
|
|
|
3040 ARRAY is a vector, bit vector, or string.
|
|
20
|
3041 */
|
|
|
3042 (array, item))
|
|
0
|
3043 {
|
|
|
3044 retry:
|
|
76
|
3045 if (STRINGP (array))
|
|
|
3046 {
|
|
|
3047 Charcount size;
|
|
|
3048 Charcount i;
|
|
|
3049 Emchar charval;
|
|
|
3050 struct Lisp_String *s;
|
|
|
3051 CHECK_CHAR_COERCE_INT (item);
|
|
|
3052 CHECK_IMPURE (array);
|
|
|
3053 charval = XCHAR (item);
|
|
|
3054 s = XSTRING (array);
|
|
|
3055 size = string_char_length (s);
|
|
|
3056 for (i = 0; i < size; i++)
|
|
|
3057 set_string_char (s, i, charval);
|
|
|
3058 bump_string_modiff (array);
|
|
|
3059 }
|
|
|
3060 else if (VECTORP (array))
|
|
10
|
3061 {
|
|
70
|
3062 Lisp_Object *p;
|
|
|
3063 int size;
|
|
76
|
3064 int i;
|
|
10
|
3065 CHECK_IMPURE (array);
|
|
70
|
3066 size = vector_length (XVECTOR (array));
|
|
|
3067 p = vector_data (XVECTOR (array));
|
|
76
|
3068 for (i = 0; i < size; i++)
|
|
|
3069 p[i] = item;
|
|
10
|
3070 }
|
|
76
|
3071 else if (BIT_VECTORP (array))
|
|
0
|
3072 {
|
|
|
3073 struct Lisp_Bit_Vector *v;
|
|
|
3074 int size;
|
|
76
|
3075 int i;
|
|
0
|
3076 CHECK_BIT (item);
|
|
|
3077 CHECK_IMPURE (array);
|
|
|
3078 v = XBIT_VECTOR (array);
|
|
|
3079 size = bit_vector_length (v);
|
|
76
|
3080 for (i = 0; i < size; i++)
|
|
|
3081 set_bit_vector_bit (v, i, XINT (item));
|
|
0
|
3082 }
|
|
|
3083 else
|
|
|
3084 {
|
|
|
3085 array = wrong_type_argument (Qarrayp, array);
|
|
|
3086 goto retry;
|
|
|
3087 }
|
|
|
3088 return array;
|
|
|
3089 }
|
|
|
3090
|
|
|
3091 Lisp_Object
|
|
|
3092 nconc2 (Lisp_Object s1, Lisp_Object s2)
|
|
|
3093 {
|
|
|
3094 Lisp_Object args[2];
|
|
|
3095 args[0] = s1;
|
|
|
3096 args[1] = s2;
|
|
|
3097 return Fnconc (2, args);
|
|
|
3098 }
|
|
|
3099
|
|
20
|
3100 DEFUN ("nconc", Fnconc, 0, MANY, 0, /*
|
|
0
|
3101 Concatenate any number of lists by altering them.
|
|
|
3102 Only the last argument is not altered, and need not be a list.
|
|
20
|
3103 */
|
|
|
3104 (int nargs, Lisp_Object *args))
|
|
0
|
3105 {
|
|
|
3106 int argnum;
|
|
|
3107 Lisp_Object tail, tem, val;
|
|
|
3108 struct gcpro gcpro1;
|
|
|
3109
|
|
|
3110 /* The modus operandi in Emacs is "caller gc-protects args".
|
|
|
3111 However, nconc (particularly nconc2 ()) is called many times
|
|
|
3112 in Emacs on freshly created stuff (e.g. you see the idiom
|
|
|
3113 nconc2 (Fcopy_sequence (foo), bar) a lot). So we help those
|
|
|
3114 callers out by protecting the args ourselves to save them
|
|
|
3115 a lot of temporary-variable grief. */
|
|
|
3116
|
|
|
3117 GCPRO1 (args[0]);
|
|
|
3118 gcpro1.nvars = nargs;
|
|
|
3119
|
|
|
3120 val = Qnil;
|
|
|
3121
|
|
|
3122 for (argnum = 0; argnum < nargs; argnum++)
|
|
|
3123 {
|
|
|
3124 tem = args[argnum];
|
|
|
3125 if (NILP (tem)) continue;
|
|
|
3126
|
|
|
3127 if (NILP (val))
|
|
|
3128 val = tem;
|
|
|
3129
|
|
|
3130 if (argnum + 1 == nargs) break;
|
|
|
3131
|
|
|
3132 if (!CONSP (tem))
|
|
|
3133 tem = wrong_type_argument (Qlistp, tem);
|
|
|
3134
|
|
|
3135 while (CONSP (tem))
|
|
|
3136 {
|
|
|
3137 tail = tem;
|
|
|
3138 tem = Fcdr (tail);
|
|
|
3139 QUIT;
|
|
|
3140 }
|
|
|
3141
|
|
|
3142 tem = args[argnum + 1];
|
|
|
3143 Fsetcdr (tail, tem);
|
|
|
3144 if (NILP (tem))
|
|
|
3145 args[argnum + 1] = tail;
|
|
|
3146 }
|
|
|
3147
|
|
|
3148 RETURN_UNGCPRO (val);
|
|
|
3149 }
|
|
|
3150
|
|
|
3151
|
|
|
3152 /* This is the guts of all mapping functions.
|
|
|
3153 Apply fn to each element of seq, one by one,
|
|
|
3154 storing the results into elements of vals, a C vector of Lisp_Objects.
|
|
|
3155 leni is the length of vals, which should also be the length of seq.
|
|
|
3156
|
|
|
3157 If VALS is a null pointer, do not accumulate the results. */
|
|
|
3158
|
|
|
3159 static void
|
|
|
3160 mapcar1 (int leni, Lisp_Object *vals, Lisp_Object fn, Lisp_Object seq)
|
|
|
3161 {
|
|
|
3162 Lisp_Object tail;
|
|
|
3163 Lisp_Object dummy = Qnil;
|
|
|
3164 int i;
|
|
|
3165 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
|
3166 Lisp_Object result;
|
|
|
3167
|
|
|
3168 GCPRO3 (dummy, fn, seq);
|
|
|
3169
|
|
|
3170 if (vals)
|
|
|
3171 {
|
|
|
3172 /* Don't let vals contain any garbage when GC happens. */
|
|
|
3173 for (i = 0; i < leni; i++)
|
|
|
3174 vals[i] = Qnil;
|
|
|
3175 gcpro1.var = vals;
|
|
|
3176 gcpro1.nvars = leni;
|
|
|
3177 }
|
|
|
3178
|
|
|
3179 /* We need not explicitly protect `tail' because it is used only on
|
|
|
3180 lists, and 1) lists are not relocated and 2) the list is marked
|
|
|
3181 via `seq' so will not be freed */
|
|
|
3182
|
|
|
3183 if (VECTORP (seq))
|
|
|
3184 {
|
|
|
3185 for (i = 0; i < leni; i++)
|
|
|
3186 {
|
|
|
3187 dummy = vector_data (XVECTOR (seq))[i];
|
|
|
3188 result = call1 (fn, dummy);
|
|
|
3189 if (vals)
|
|
|
3190 vals[i] = result;
|
|
|
3191 }
|
|
|
3192 }
|
|
|
3193 else if (BIT_VECTORP (seq))
|
|
|
3194 {
|
|
|
3195 struct Lisp_Bit_Vector *v = XBIT_VECTOR (seq);
|
|
|
3196 for (i = 0; i < leni; i++)
|
|
|
3197 {
|
|
|
3198 XSETINT (dummy, bit_vector_bit (v, i));
|
|
|
3199 result = call1 (fn, dummy);
|
|
|
3200 if (vals)
|
|
|
3201 vals[i] = result;
|
|
|
3202 }
|
|
|
3203 }
|
|
|
3204 else if (STRINGP (seq))
|
|
|
3205 {
|
|
|
3206 for (i = 0; i < leni; i++)
|
|
|
3207 {
|
|
|
3208 result = call1 (fn, make_char (string_char (XSTRING (seq), i)));
|
|
|
3209 if (vals)
|
|
|
3210 vals[i] = result;
|
|
|
3211 }
|
|
|
3212 }
|
|
|
3213 else /* Must be a list, since Flength did not get an error */
|
|
|
3214 {
|
|
|
3215 tail = seq;
|
|
|
3216 for (i = 0; i < leni; i++)
|
|
|
3217 {
|
|
|
3218 result = call1 (fn, Fcar (tail));
|
|
|
3219 if (vals)
|
|
|
3220 vals[i] = result;
|
|
|
3221 tail = Fcdr (tail);
|
|
|
3222 }
|
|
|
3223 }
|
|
|
3224
|
|
|
3225 UNGCPRO;
|
|
|
3226 }
|
|
|
3227
|
|
20
|
3228 DEFUN ("mapconcat", Fmapconcat, 3, 3, 0, /*
|
|
0
|
3229 Apply FN to each element of SEQ, and concat the results as strings.
|
|
|
3230 In between each pair of results, stick in SEP.
|
|
|
3231 Thus, \" \" as SEP results in spaces between the values returned by FN.
|
|
20
|
3232 */
|
|
|
3233 (fn, seq, sep))
|
|
0
|
3234 {
|
|
16
|
3235 int len = XINT (Flength (seq));
|
|
0
|
3236 int nargs;
|
|
|
3237 Lisp_Object *args;
|
|
|
3238 int i;
|
|
|
3239 struct gcpro gcpro1;
|
|
|
3240
|
|
16
|
3241 nargs = len + len - 1;
|
|
0
|
3242 if (nargs < 0) return build_string ("");
|
|
|
3243
|
|
|
3244 args = (Lisp_Object *) alloca (nargs * sizeof (Lisp_Object));
|
|
|
3245
|
|
|
3246 GCPRO1 (sep);
|
|
16
|
3247 mapcar1 (len, args, fn, seq);
|
|
0
|
3248 UNGCPRO;
|
|
|
3249
|
|
16
|
3250 for (i = len - 1; i >= 0; i--)
|
|
0
|
3251 args[i + i] = args[i];
|
|
|
3252
|
|
|
3253 for (i = 1; i < nargs; i += 2)
|
|
|
3254 args[i] = sep;
|
|
|
3255
|
|
|
3256 return Fconcat (nargs, args);
|
|
|
3257 }
|
|
|
3258
|
|
20
|
3259 DEFUN ("mapcar", Fmapcar, 2, 2, 0, /*
|
|
0
|
3260 Apply FUNCTION to each element of SEQUENCE, and make a list of the results.
|
|
|
3261 The result is a list just as long as SEQUENCE.
|
|
|
3262 SEQUENCE may be a list, a vector, a bit vector, or a string.
|
|
20
|
3263 */
|
|
|
3264 (fn, seq))
|
|
0
|
3265 {
|
|
16
|
3266 int len = XINT (Flength (seq));
|
|
|
3267 Lisp_Object *args = (Lisp_Object *) alloca (len * sizeof (Lisp_Object));
|
|
|
3268
|
|
|
3269 mapcar1 (len, args, fn, seq);
|
|
|
3270
|
|
|
3271 return Flist (len, args);
|
|
0
|
3272 }
|
|
|
3273
|
|
163
|
3274 DEFUN ("mapvector", Fmapvector, 2, 2, 0, /*
|
|
|
3275 Apply FUNCTION to each element of SEQUENCE, making a vector of the results.
|
|
|
3276 The result is a vector of the same length as SEQUENCE.
|
|
|
3277 SEQUENCE may be a list, a vector or a string.
|
|
|
3278 */
|
|
|
3279 (fn, seq))
|
|
|
3280 {
|
|
|
3281 int len = XINT (Flength (seq));
|
|
|
3282 Lisp_Object *args = (Lisp_Object *) alloca (len * sizeof (Lisp_Object));
|
|
|
3283
|
|
|
3284 mapcar1 (len, args, fn, seq);
|
|
|
3285
|
|
|
3286 return Fvector (len, args);
|
|
|
3287 }
|
|
|
3288
|
|
20
|
3289 DEFUN ("mapc-internal", Fmapc_internal, 2, 2, 0, /*
|
|
0
|
3290 Apply FUNCTION to each element of SEQUENCE.
|
|
|
3291 SEQUENCE may be a list, a vector, a bit vector, or a string.
|
|
|
3292 This function is like `mapcar' but does not accumulate the results,
|
|
|
3293 which is more efficient if you do not use the results.
|
|
20
|
3294 */
|
|
|
3295 (fn, seq))
|
|
0
|
3296 {
|
|
16
|
3297 mapcar1 (XINT (Flength (seq)), 0, fn, seq);
|
|
0
|
3298
|
|
|
3299 return Qnil;
|
|
|
3300 }
|
|
|
3301
|
|
|
3302
|
|
|
3303 /* #### this function doesn't belong in this file! */
|
|
|
3304
|
|
20
|
3305 DEFUN ("load-average", Fload_average, 0, 0, 0, /*
|
|
0
|
3306 Return list of 1 minute, 5 minute and 15 minute load averages.
|
|
|
3307 Each of the three load averages is multiplied by 100,
|
|
|
3308 then converted to integer.
|
|
|
3309
|
|
|
3310 If the 5-minute or 15-minute load averages are not available, return a
|
|
|
3311 shortened list, containing only those averages which are available.
|
|
|
3312
|
|
118
|
3313 On some systems, this won't work due to permissions on /dev/kmem in
|
|
|
3314 which case you can't use this.
|
|
20
|
3315 */
|
|
|
3316 ())
|
|
0
|
3317 {
|
|
|
3318 double load_ave[10]; /* hey, just in case */
|
|
|
3319 int loads = getloadavg (load_ave, 3);
|
|
|
3320 Lisp_Object ret;
|
|
|
3321
|
|
|
3322 if (loads == -2)
|
|
|
3323 error ("load-average not implemented for this operating system.");
|
|
|
3324 else if (loads < 0)
|
|
|
3325 error ("could not get load-average; check permissions.");
|
|
|
3326
|
|
|
3327 ret = Qnil;
|
|
|
3328 while (loads > 0)
|
|
|
3329 ret = Fcons (make_int ((int) (load_ave[--loads] * 100.0)), ret);
|
|
|
3330
|
|
|
3331 return ret;
|
|
|
3332 }
|
|
|
3333
|
|
|
3334
|
|
|
3335 Lisp_Object Vfeatures;
|
|
|
3336
|
|
140
|
3337 #ifndef FEATUREP_SYNTAX
|
|
20
|
3338 DEFUN ("featurep", Ffeaturep, 1, 1, 0, /*
|
|
70
|
3339 Return t if FEATURE is present in this Emacs.
|
|
|
3340 Use this to conditionalize execution of lisp code based on the
|
|
|
3341 presence or absence of emacs or environment extensions.
|
|
|
3342 Use `provide' to declare that a feature is available.
|
|
|
3343 This function looks at the value of the variable `features'.
|
|
20
|
3344 */
|
|
70
|
3345 (feature))
|
|
0
|
3346 {
|
|
70
|
3347 CHECK_SYMBOL (feature);
|
|
|
3348 return NILP (Fmemq (feature, Vfeatures)) ? Qnil : Qt;
|
|
0
|
3349 }
|
|
163
|
3350 #else
|
|
|
3351 extern int emacs_major_version, emacs_minor_version;
|
|
|
3352
|
|
|
3353 DEFUN ("featurep", Ffeaturep, 1, 1, 0, /*
|
|
|
3354 Return non-nil if feature expression FEXP is true.
|
|
|
3355 */
|
|
|
3356 (fexp))
|
|
|
3357 {
|
|
|
3358 static double featurep_emacs_version;
|
|
|
3359
|
|
|
3360 /* Brute force translation from Erik Naggum's lisp function. */
|
|
|
3361 if (SYMBOLP(fexp))
|
|
|
3362 {
|
|
|
3363 /* Original definition */
|
|
|
3364 return NILP (Fmemq (fexp, Vfeatures)) ? Qnil : Qt;
|
|
|
3365 }
|
|
|
3366 else if (INTP(fexp) || FLOATP(fexp))
|
|
|
3367 {
|
|
|
3368 double d = extract_float(fexp);
|
|
|
3369
|
|
|
3370 if (featurep_emacs_version == 0.0)
|
|
|
3371 {
|
|
|
3372 featurep_emacs_version = emacs_major_version +
|
|
|
3373 (emacs_minor_version / 100.0);
|
|
|
3374 }
|
|
|
3375 return (featurep_emacs_version >= d) ? Qt : Qnil;
|
|
|
3376 }
|
|
|
3377 else if (CONSP(fexp))
|
|
|
3378 {
|
|
|
3379 Lisp_Object tem;
|
|
|
3380
|
|
|
3381 tem = XCAR(fexp);
|
|
|
3382 if (EQ(tem, Qnot))
|
|
|
3383 {
|
|
|
3384 Lisp_Object negate = XCDR(fexp);
|
|
|
3385
|
|
|
3386 if (!NILP(XCDR(fexp)))
|
|
|
3387 {
|
|
|
3388 return Fsignal(Qinvalid_read_syntax, list1(XCDR(fexp)));
|
|
|
3389 }
|
|
|
3390 else
|
|
|
3391 {
|
|
|
3392 return NILP(Ffeaturep(negate)) ? Qt : Qnil;
|
|
|
3393 }
|
|
|
3394 }
|
|
|
3395 else if (EQ(tem, Qand))
|
|
|
3396 {
|
|
|
3397 tem = XCDR(fexp);
|
|
|
3398 while (!NILP(tem) && !NILP(Ffeaturep(XCAR(tem))))
|
|
|
3399 {
|
|
|
3400 tem = XCDR(tem);
|
|
|
3401 }
|
|
|
3402 return NILP(tem) ? Qt : Qnil;
|
|
|
3403 }
|
|
|
3404 else if (EQ(tem, Qor))
|
|
|
3405 {
|
|
|
3406 tem = XCDR(fexp);
|
|
|
3407 while (!NILP(tem) && NILP(Ffeaturep(XCAR(tem))))
|
|
|
3408 {
|
|
|
3409 tem = XCDR(tem);
|
|
|
3410 }
|
|
|
3411 return NILP(tem) ? Qnil : Qt;
|
|
|
3412 }
|
|
|
3413 else
|
|
|
3414 {
|
|
|
3415 return Fsignal(Qinvalid_read_syntax, list1(XCDR(fexp)));
|
|
|
3416 }
|
|
|
3417 }
|
|
|
3418 else
|
|
|
3419 {
|
|
|
3420 return Fsignal(Qinvalid_read_syntax, list1 (fexp));
|
|
|
3421 }
|
|
|
3422 }
|
|
140
|
3423 #endif
|
|
0
|
3424
|
|
20
|
3425 DEFUN ("provide", Fprovide, 1, 1, 0, /*
|
|
0
|
3426 Announce that FEATURE is a feature of the current Emacs.
|
|
2
|
3427 This function updates the value of the variable `features'.
|
|
20
|
3428 */
|
|
|
3429 (feature))
|
|
0
|
3430 {
|
|
|
3431 Lisp_Object tem;
|
|
|
3432 CHECK_SYMBOL (feature);
|
|
|
3433 if (!NILP (Vautoload_queue))
|
|
|
3434 Vautoload_queue = Fcons (Fcons (Vfeatures, Qnil), Vautoload_queue);
|
|
|
3435 tem = Fmemq (feature, Vfeatures);
|
|
|
3436 if (NILP (tem))
|
|
|
3437 Vfeatures = Fcons (feature, Vfeatures);
|
|
|
3438 LOADHIST_ATTACH (Fcons (Qprovide, feature));
|
|
|
3439 return feature;
|
|
|
3440 }
|
|
|
3441
|
|
20
|
3442 DEFUN ("require", Frequire, 1, 2, 0, /*
|
|
0
|
3443 If feature FEATURE is not loaded, load it from FILENAME.
|
|
|
3444 If FEATURE is not a member of the list `features', then the feature
|
|
|
3445 is not loaded; so load the file FILENAME.
|
|
|
3446 If FILENAME is omitted, the printname of FEATURE is used as the file name.
|
|
20
|
3447 */
|
|
|
3448 (feature, file_name))
|
|
0
|
3449 {
|
|
|
3450 Lisp_Object tem;
|
|
|
3451 CHECK_SYMBOL (feature);
|
|
|
3452 tem = Fmemq (feature, Vfeatures);
|
|
|
3453 LOADHIST_ATTACH (Fcons (Qrequire, feature));
|
|
|
3454 if (!NILP (tem))
|
|
149
|
3455 return feature;
|
|
0
|
3456 else
|
|
|
3457 {
|
|
|
3458 int speccount = specpdl_depth ();
|
|
|
3459
|
|
|
3460 /* Value saved here is to be restored into Vautoload_queue */
|
|
|
3461 record_unwind_protect (un_autoload, Vautoload_queue);
|
|
|
3462 Vautoload_queue = Qt;
|
|
|
3463
|
|
|
3464 call4 (Qload, NILP (file_name) ? Fsymbol_name (feature) : file_name,
|
|
|
3465 Qnil, Qt, Qnil);
|
|
|
3466
|
|
|
3467 tem = Fmemq (feature, Vfeatures);
|
|
|
3468 if (NILP (tem))
|
|
|
3469 error ("Required feature %s was not provided",
|
|
|
3470 string_data (XSYMBOL (feature)->name));
|
|
|
3471
|
|
|
3472 /* Once loading finishes, don't undo it. */
|
|
|
3473 Vautoload_queue = Qt;
|
|
149
|
3474 return unbind_to (speccount, feature);
|
|
0
|
3475 }
|
|
|
3476 }
|
|
|
3477
|
|
|
3478
|
|
|
3479 Lisp_Object Qyes_or_no_p;
|
|
|
3480
|
|
|
3481 void
|
|
|
3482 syms_of_fns (void)
|
|
|
3483 {
|
|
|
3484 defsymbol (&Qstring_lessp, "string-lessp");
|
|
|
3485 defsymbol (&Qidentity, "identity");
|
|
|
3486 defsymbol (&Qyes_or_no_p, "yes-or-no-p");
|
|
|
3487
|
|
20
|
3488 DEFSUBR (Fidentity);
|
|
|
3489 DEFSUBR (Frandom);
|
|
|
3490 DEFSUBR (Flength);
|
|
|
3491 DEFSUBR (Fsafe_length);
|
|
|
3492 DEFSUBR (Fstring_equal);
|
|
|
3493 DEFSUBR (Fstring_lessp);
|
|
|
3494 DEFSUBR (Fstring_modified_tick);
|
|
|
3495 DEFSUBR (Fappend);
|
|
|
3496 DEFSUBR (Fconcat);
|
|
|
3497 DEFSUBR (Fvconcat);
|
|
|
3498 DEFSUBR (Fbvconcat);
|
|
|
3499 DEFSUBR (Fcopy_sequence);
|
|
|
3500 DEFSUBR (Fcopy_alist);
|
|
|
3501 DEFSUBR (Fcopy_tree);
|
|
|
3502 DEFSUBR (Fsubstring);
|
|
|
3503 DEFSUBR (Fsubseq);
|
|
|
3504 DEFSUBR (Fnthcdr);
|
|
|
3505 DEFSUBR (Fnth);
|
|
|
3506 DEFSUBR (Felt);
|
|
|
3507 DEFSUBR (Fmember);
|
|
70
|
3508 DEFSUBR (Fold_member);
|
|
20
|
3509 DEFSUBR (Fmemq);
|
|
70
|
3510 DEFSUBR (Fold_memq);
|
|
20
|
3511 DEFSUBR (Fassoc);
|
|
70
|
3512 DEFSUBR (Fold_assoc);
|
|
20
|
3513 DEFSUBR (Fassq);
|
|
70
|
3514 DEFSUBR (Fold_assq);
|
|
20
|
3515 DEFSUBR (Frassoc);
|
|
70
|
3516 DEFSUBR (Fold_rassoc);
|
|
20
|
3517 DEFSUBR (Frassq);
|
|
70
|
3518 DEFSUBR (Fold_rassq);
|
|
20
|
3519 DEFSUBR (Fdelete);
|
|
70
|
3520 DEFSUBR (Fold_delete);
|
|
20
|
3521 DEFSUBR (Fdelq);
|
|
70
|
3522 DEFSUBR (Fold_delq);
|
|
20
|
3523 DEFSUBR (Fremassoc);
|
|
|
3524 DEFSUBR (Fremassq);
|
|
|
3525 DEFSUBR (Fremrassoc);
|
|
|
3526 DEFSUBR (Fremrassq);
|
|
|
3527 DEFSUBR (Fnreverse);
|
|
|
3528 DEFSUBR (Freverse);
|
|
|
3529 DEFSUBR (Fsort);
|
|
|
3530 DEFSUBR (Fplists_eq);
|
|
|
3531 DEFSUBR (Fplists_equal);
|
|
|
3532 DEFSUBR (Flax_plists_eq);
|
|
|
3533 DEFSUBR (Flax_plists_equal);
|
|
|
3534 DEFSUBR (Fplist_get);
|
|
|
3535 DEFSUBR (Fplist_put);
|
|
|
3536 DEFSUBR (Fplist_remprop);
|
|
|
3537 DEFSUBR (Fplist_member);
|
|
|
3538 DEFSUBR (Fcheck_valid_plist);
|
|
|
3539 DEFSUBR (Fvalid_plist_p);
|
|
|
3540 DEFSUBR (Fcanonicalize_plist);
|
|
|
3541 DEFSUBR (Flax_plist_get);
|
|
|
3542 DEFSUBR (Flax_plist_put);
|
|
|
3543 DEFSUBR (Flax_plist_remprop);
|
|
|
3544 DEFSUBR (Flax_plist_member);
|
|
|
3545 DEFSUBR (Fcanonicalize_lax_plist);
|
|
|
3546 DEFSUBR (Fdestructive_alist_to_plist);
|
|
|
3547 DEFSUBR (Fget);
|
|
|
3548 DEFSUBR (Fput);
|
|
|
3549 DEFSUBR (Fremprop);
|
|
|
3550 DEFSUBR (Fobject_plist);
|
|
|
3551 DEFSUBR (Fequal);
|
|
70
|
3552 DEFSUBR (Fold_equal);
|
|
20
|
3553 DEFSUBR (Ffillarray);
|
|
|
3554 DEFSUBR (Fnconc);
|
|
|
3555 DEFSUBR (Fmapcar);
|
|
163
|
3556 DEFSUBR (Fmapvector);
|
|
20
|
3557 DEFSUBR (Fmapc_internal);
|
|
|
3558 DEFSUBR (Fmapconcat);
|
|
|
3559 DEFSUBR (Fload_average);
|
|
163
|
3560 /*#ifndef FEATUREP_SYNTAX*/
|
|
20
|
3561 DEFSUBR (Ffeaturep);
|
|
163
|
3562 /*#endif*/
|
|
20
|
3563 DEFSUBR (Frequire);
|
|
|
3564 DEFSUBR (Fprovide);
|
|
0
|
3565 }
|
|
|
3566
|
|
|
3567 void
|
|
|
3568 init_provide_once (void)
|
|
|
3569 {
|
|
|
3570 DEFVAR_LISP ("features", &Vfeatures /*
|
|
|
3571 A list of symbols which are the features of the executing emacs.
|
|
|
3572 Used by `featurep' and `require', and altered by `provide'.
|
|
|
3573 */ );
|
|
|
3574 Vfeatures = Qnil;
|
|
|
3575 }
|
